mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-26 04:40:38 +00:00
bd0298b1e1
The code have been developed by Daniel Berlin over the years, and the new implementation goal is that of addressing shortcomings of the current GVN infrastructure, i.e. long compile time for large testcases, lack of phi predication, no load/store value numbering etc... The current code just implements the "core" GVN algorithm, although other pieces (load coercion, phi handling, predicate system) are already implemented in a branch out of tree. Once the core is stable, we'll start adding pieces on top of the base framework. The test currently living in test/Transform/NewGVN are a copy of the ones in GVN, with proper `XFAIL` (missing features in NewGVN). A flag will be added in a future commit to enable NewGVN, so that interested parties can exercise this code easily. Differential Revision: https://reviews.llvm.org/D26224 llvm-svn: 290346
34 lines
1.0 KiB
LLVM
34 lines
1.0 KiB
LLVM
; RUN: opt < %s -newgvn
|
|
; PR12858
|
|
|
|
define void @fn5(i16 signext %p1, i8 signext %p2) nounwind uwtable {
|
|
entry:
|
|
br i1 undef, label %if.else, label %if.then
|
|
|
|
if.then: ; preds = %entry
|
|
br label %if.end
|
|
|
|
if.else: ; preds = %entry
|
|
%conv = sext i16 %p1 to i32
|
|
br label %if.end
|
|
|
|
if.end: ; preds = %if.else, %if.then
|
|
%conv1 = sext i16 %p1 to i32
|
|
br i1 undef, label %if.then3, label %if.else4
|
|
|
|
if.then3: ; preds = %if.end
|
|
br label %if.end12
|
|
|
|
if.else4: ; preds = %if.end
|
|
%conv7 = sext i8 %p2 to i32
|
|
%cmp8 = icmp eq i32 %conv1, %conv7
|
|
br i1 %cmp8, label %if.then10, label %if.end12
|
|
|
|
if.then10: ; preds = %if.else4
|
|
br label %if.end12
|
|
|
|
if.end12: ; preds = %if.then10, %if.else4, %if.then3
|
|
%conv13 = sext i8 %p2 to i32
|
|
ret void
|
|
}
|