maxjhandsome
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Releases Wiki Activity
llvm-project/llvm/test/Transforms/JumpThreading/basic.ll

583 lines
9.9 KiB
LLVM
Raw Normal View History

Tests: rewrite 'opt ... %s' to 'opt ... < %s' so that opt does not emit a ModuleID This is done to avoid odd test failures, like the one fixed in r171243. My previous regex was not good enough to find these. llvm-svn: 171343
2013-01-01 21:57:25 +08:00
; RUN: opt -jump-threading -S < %s | FileCheck %s
add a basic testcase. llvm-svn: 50093
2008-04-22 14:35:14 +08:00
declare i32 @f1()
declare i32 @f2()
declare void @f3()
merge two tests. llvm-svn: 83751
2009-10-11 11:55:30 +08:00
define i32 @test1(i1 %cond) {
Update Transforms tests to use CHECK-LABEL for easier debugging. No functionality change. This update was done with the following bash script: find test/Transforms -name "*.ll" | \ while read NAME; do echo "$NAME" if ! grep -q "^; *RUN: *llc" $NAME; then TEMP=`mktemp -t temp` cp $NAME $TEMP sed -n "s/^define [^@]*@\([A-Za-z0-9_]*\)(.*$/\1/p" < $NAME | \ while read FUNC; do sed -i '' "s/;\(.*\)\([A-Za-z0-9_]*\):\( *\)@$FUNC\([( ]*\)\$/;\1\2-LABEL:\3@$FUNC(/g" $TEMP done mv $TEMP $NAME fi done llvm-svn: 186268
2013-07-14 09:42:54 +08:00
; CHECK-LABEL: @test1(
merge two tests. llvm-svn: 83751
2009-10-11 11:55:30 +08:00
add a basic testcase. llvm-svn: 50093
2008-04-22 14:35:14 +08:00
br i1 %cond, label %T1, label %F1
T1:
%v1 = call i32 @f1()
br label %Merge
F1:
%v2 = call i32 @f2()
br label %Merge
Merge:
%A = phi i1 [true, %T1], [false, %F1]
%B = phi i32 [%v1, %T1], [%v2, %F1]
br i1 %A, label %T2, label %F2
T2:
simplify some run lines, convert a test to filecheck. llvm-svn: 83750
2009-10-11 11:54:21 +08:00
; CHECK: T2:
; CHECK: ret i32 %v1
add a basic testcase. llvm-svn: 50093
2008-04-22 14:35:14 +08:00
call void @f3()
ret i32 %B
F2:
simplify some run lines, convert a test to filecheck. llvm-svn: 83750
2009-10-11 11:54:21 +08:00
; CHECK: F2:
; CHECK: ret i32 %v2
add a basic testcase. llvm-svn: 50093
2008-04-22 14:35:14 +08:00
ret i32 %B
}
Teach jump threading some more simple tricks: 1) have it fold "br undef", which does occur with surprising frequency as jump threading iterates. 2) teach j-t to delete dead blocks. This removes the successor edges, reducing the in-edges of other blocks, allowing recursive simplification. 3) Fold things like: br COND, BBX, BBY BBX: br COND, BBZ, BBW which also happens because jump threading iterates. llvm-svn: 60470
2008-12-03 15:48:08 +08:00
;; cond is known false on Entry -> F1 edge!
define i32 @test2(i1 %cond) {
Update Transforms tests to use CHECK-LABEL for easier debugging. No functionality change. This update was done with the following bash script: find test/Transforms -name "*.ll" | \ while read NAME; do echo "$NAME" if ! grep -q "^; *RUN: *llc" $NAME; then TEMP=`mktemp -t temp` cp $NAME $TEMP sed -n "s/^define [^@]*@\([A-Za-z0-9_]*\)(.*$/\1/p" < $NAME | \ while read FUNC; do sed -i '' "s/;\(.*\)\([A-Za-z0-9_]*\):\( *\)@$FUNC\([( ]*\)\$/;\1\2-LABEL:\3@$FUNC(/g" $TEMP done mv $TEMP $NAME fi done llvm-svn: 186268
2013-07-14 09:42:54 +08:00
; CHECK-LABEL: @test2(
Teach jump threading some more simple tricks: 1) have it fold "br undef", which does occur with surprising frequency as jump threading iterates. 2) teach j-t to delete dead blocks. This removes the successor edges, reducing the in-edges of other blocks, allowing recursive simplification. 3) Fold things like: br COND, BBX, BBY BBX: br COND, BBZ, BBW which also happens because jump threading iterates. llvm-svn: 60470
2008-12-03 15:48:08 +08:00
Entry:
br i1 %cond, label %T1, label %F1
T1:
simplify some run lines, convert a test to filecheck. llvm-svn: 83750
2009-10-11 11:54:21 +08:00
; CHECK: %v1 = call i32 @f1()
; CHECK: ret i32 47
Teach jump threading some more simple tricks: 1) have it fold "br undef", which does occur with surprising frequency as jump threading iterates. 2) teach j-t to delete dead blocks. This removes the successor edges, reducing the in-edges of other blocks, allowing recursive simplification. 3) Fold things like: br COND, BBX, BBY BBX: br COND, BBZ, BBW which also happens because jump threading iterates. llvm-svn: 60470
2008-12-03 15:48:08 +08:00
%v1 = call i32 @f1()
br label %Merge
F1:
br i1 %cond, label %Merge, label %F2
Merge:
%B = phi i32 [47, %T1], [192, %F1]
ret i32 %B
F2:
call void @f3()
ret i32 12
}
merge two tests. llvm-svn: 83751
2009-10-11 11:55:30 +08:00
; Undef handling.
define i32 @test3(i1 %cond) {
Update Transforms tests to use CHECK-LABEL for easier debugging. No functionality change. This update was done with the following bash script: find test/Transforms -name "*.ll" | \ while read NAME; do echo "$NAME" if ! grep -q "^; *RUN: *llc" $NAME; then TEMP=`mktemp -t temp` cp $NAME $TEMP sed -n "s/^define [^@]*@\([A-Za-z0-9_]*\)(.*$/\1/p" < $NAME | \ while read FUNC; do sed -i '' "s/;\(.*\)\([A-Za-z0-9_]*\):\( *\)@$FUNC\([( ]*\)\$/;\1\2-LABEL:\3@$FUNC(/g" $TEMP done mv $TEMP $NAME fi done llvm-svn: 186268
2013-07-14 09:42:54 +08:00
; CHECK-LABEL: @test3(
merge two tests. llvm-svn: 83751
2009-10-11 11:55:30 +08:00
; CHECK-NEXT: T1:
; CHECK-NEXT: ret i32 42
br i1 undef, label %T1, label %F1
T1:
ret i32 42
F1:
ret i32 17
}
make jump threading on a phi with undef inputs happen. llvm-svn: 83754
2009-10-11 12:18:15 +08:00
define i32 @test4(i1 %cond, i1 %cond2) {
Update Transforms tests to use CHECK-LABEL for easier debugging. No functionality change. This update was done with the following bash script: find test/Transforms -name "*.ll" | \ while read NAME; do echo "$NAME" if ! grep -q "^; *RUN: *llc" $NAME; then TEMP=`mktemp -t temp` cp $NAME $TEMP sed -n "s/^define [^@]*@\([A-Za-z0-9_]*\)(.*$/\1/p" < $NAME | \ while read FUNC; do sed -i '' "s/;\(.*\)\([A-Za-z0-9_]*\):\( *\)@$FUNC\([( ]*\)\$/;\1\2-LABEL:\3@$FUNC(/g" $TEMP done mv $TEMP $NAME fi done llvm-svn: 186268
2013-07-14 09:42:54 +08:00
; CHECK-LABEL: @test4(
make jump threading on a phi with undef inputs happen. llvm-svn: 83754
2009-10-11 12:18:15 +08:00
br i1 %cond, label %T1, label %F1
T1:
; CHECK: %v1 = call i32 @f1()
; CHECK-NEXT: br label %T
%v1 = call i32 @f1()
br label %Merge
F1:
%v2 = call i32 @f2()
; CHECK: %v2 = call i32 @f2()
; CHECK-NEXT: br i1 %cond2,
br label %Merge
Merge:
%A = phi i1 [undef, %T1], [%cond2, %F1]
%B = phi i32 [%v1, %T1], [%v2, %F1]
br i1 %A, label %T2, label %F2
T2:
call void @f3()
ret i32 %B
F2:
ret i32 %B
}
implement a transformation in jump threading that is currently done by condprop, but do it in a much more general form. The basic idea is that we can do a limited form of tail duplication in the case when we have a branch on a phi. Moving the branch up in to the predecessor block makes instruction selection much easier and encourages chained jump threadings. llvm-svn: 83759
2009-10-11 15:24:57 +08:00
;; This tests that the branch in 'merge' can be cloned up into T1.
define i32 @test5(i1 %cond, i1 %cond2) {
Update Transforms tests to use CHECK-LABEL for easier debugging. No functionality change. This update was done with the following bash script: find test/Transforms -name "*.ll" | \ while read NAME; do echo "$NAME" if ! grep -q "^; *RUN: *llc" $NAME; then TEMP=`mktemp -t temp` cp $NAME $TEMP sed -n "s/^define [^@]*@\([A-Za-z0-9_]*\)(.*$/\1/p" < $NAME | \ while read FUNC; do sed -i '' "s/;\(.*\)\([A-Za-z0-9_]*\):\( *\)@$FUNC\([( ]*\)\$/;\1\2-LABEL:\3@$FUNC(/g" $TEMP done mv $TEMP $NAME fi done llvm-svn: 186268
2013-07-14 09:42:54 +08:00
; CHECK-LABEL: @test5(
implement a transformation in jump threading that is currently done by condprop, but do it in a much more general form. The basic idea is that we can do a limited form of tail duplication in the case when we have a branch on a phi. Moving the branch up in to the predecessor block makes instruction selection much easier and encourages chained jump threadings. llvm-svn: 83759
2009-10-11 15:24:57 +08:00
br i1 %cond, label %T1, label %F1
T1:
; CHECK: T1:
; CHECK-NEXT: %v1 = call i32 @f1()
; CHECK-NEXT: %cond3 = icmp eq i32 %v1, 412
; CHECK-NEXT: br i1 %cond3, label %T2, label %F2
%v1 = call i32 @f1()
%cond3 = icmp eq i32 %v1, 412
br label %Merge
F1:
%v2 = call i32 @f2()
br label %Merge
Merge:
%A = phi i1 [%cond3, %T1], [%cond2, %F1]
%B = phi i32 [%v1, %T1], [%v2, %F1]
br i1 %A, label %T2, label %F2
T2:
call void @f3()
ret i32 %B
F2:
ret i32 %B
}
when folding duplicate conditions, delete the now-probably-dead instruction tree feeding it. llvm-svn: 83778
2009-10-12 02:39:58 +08:00
;; Lexically duplicated conditionals should be threaded.
define i32 @test6(i32 %A) {
Update Transforms tests to use CHECK-LABEL for easier debugging. No functionality change. This update was done with the following bash script: find test/Transforms -name "*.ll" | \ while read NAME; do echo "$NAME" if ! grep -q "^; *RUN: *llc" $NAME; then TEMP=`mktemp -t temp` cp $NAME $TEMP sed -n "s/^define [^@]*@\([A-Za-z0-9_]*\)(.*$/\1/p" < $NAME | \ while read FUNC; do sed -i '' "s/;\(.*\)\([A-Za-z0-9_]*\):\( *\)@$FUNC\([( ]*\)\$/;\1\2-LABEL:\3@$FUNC(/g" $TEMP done mv $TEMP $NAME fi done llvm-svn: 186268
2013-07-14 09:42:54 +08:00
; CHECK-LABEL: @test6(
when folding duplicate conditions, delete the now-probably-dead instruction tree feeding it. llvm-svn: 83778
2009-10-12 02:39:58 +08:00
%tmp455 = icmp eq i32 %A, 42
br i1 %tmp455, label %BB1, label %BB2
Use LVI to eliminate conditional branches where we've tested a related condition previously. Update tests for this change. This fixes PR5652. llvm-svn: 112270
2010-08-28 01:12:29 +08:00
; CHECK: call i32 @f2()
; CHECK-NEXT: ret i32 3
when folding duplicate conditions, delete the now-probably-dead instruction tree feeding it. llvm-svn: 83778
2009-10-12 02:39:58 +08:00
; CHECK: call i32 @f1()
Use LVI to eliminate conditional branches where we've tested a related condition previously. Update tests for this change. This fixes PR5652. llvm-svn: 112270
2010-08-28 01:12:29 +08:00
; CHECK-NOT: br
; CHECK: call void @f3()
; CHECK-NOT: br
; CHECK: ret i32 4
BB2:
when folding duplicate conditions, delete the now-probably-dead instruction tree feeding it. llvm-svn: 83778
2009-10-12 02:39:58 +08:00
call i32 @f1()
br label %BB1
BB1:
%tmp459 = icmp eq i32 %A, 42
br i1 %tmp459, label %BB3, label %BB4
BB3:
call i32 @f2()
ret i32 3
BB4:
call void @f3()
ret i32 4
}
reapply 86289, 86278, 86270, 86267, 86266 & 86264 plus a fix (making pred factoring only happen if threading is guaranteed to be successful). This now survives an X86-64 bootstrap of llvm-gcc. llvm-svn: 86355
2009-11-07 16:05:03 +08:00
;; This tests that the branch in 'merge' can be cloned up into T1.
;; rdar://7367025
define i32 @test7(i1 %cond, i1 %cond2) {
Entry:
Update Transforms tests to use CHECK-LABEL for easier debugging. No functionality change. This update was done with the following bash script: find test/Transforms -name "*.ll" | \ while read NAME; do echo "$NAME" if ! grep -q "^; *RUN: *llc" $NAME; then TEMP=`mktemp -t temp` cp $NAME $TEMP sed -n "s/^define [^@]*@\([A-Za-z0-9_]*\)(.*$/\1/p" < $NAME | \ while read FUNC; do sed -i '' "s/;\(.*\)\([A-Za-z0-9_]*\):\( *\)@$FUNC\([( ]*\)\$/;\1\2-LABEL:\3@$FUNC(/g" $TEMP done mv $TEMP $NAME fi done llvm-svn: 186268
2013-07-14 09:42:54 +08:00
; CHECK-LABEL: @test7(
reapply 86289, 86278, 86270, 86267, 86266 & 86264 plus a fix (making pred factoring only happen if threading is guaranteed to be successful). This now survives an X86-64 bootstrap of llvm-gcc. llvm-svn: 86355
2009-11-07 16:05:03 +08:00
%v1 = call i32 @f1()
br i1 %cond, label %Merge, label %F1
F1:
%v2 = call i32 @f2()
br label %Merge
Merge:
%B = phi i32 [%v1, %Entry], [%v2, %F1]
%M = icmp ne i32 %B, %v1
%N = icmp eq i32 %B, 47
%O = and i1 %M, %N
br i1 %O, label %T2, label %F2
when folding duplicate conditions, delete the now-probably-dead instruction tree feeding it. llvm-svn: 83778
2009-10-12 02:39:58 +08:00
reapply 86289, 86278, 86270, 86267, 86266 & 86264 plus a fix (making pred factoring only happen if threading is guaranteed to be successful). This now survives an X86-64 bootstrap of llvm-gcc. llvm-svn: 86355
2009-11-07 16:05:03 +08:00
; CHECK: Merge:
; CHECK-NOT: phi
; CHECK-NEXT: %v2 = call i32 @f2()
T2:
call void @f3()
ret i32 %B
F2:
ret i32 %B
; CHECK: F2:
; CHECK-NEXT: phi i32
}
when folding duplicate conditions, delete the now-probably-dead instruction tree feeding it. llvm-svn: 83778
2009-10-12 02:39:58 +08:00
make jump threading recursively simplify expressions instead of doing it just one level deep. On the testcase we go from getting this: F1: ; preds = %T2 %F = and i1 true, %cond ; <i1> [#uses=1] br i1 %F, label %X, label %Y to a fully threaded: F1: ; preds = %T2 br label %Y This changes gets us to the point where we're forming (too many) switch instructions on doug's strswitch testcase. llvm-svn: 86646
2009-11-10 09:57:31 +08:00
declare i1 @test8a()
define i32 @test8b(i1 %cond, i1 %cond2) {
Update Transforms tests to use CHECK-LABEL for easier debugging. No functionality change. This update was done with the following bash script: find test/Transforms -name "*.ll" | \ while read NAME; do echo "$NAME" if ! grep -q "^; *RUN: *llc" $NAME; then TEMP=`mktemp -t temp` cp $NAME $TEMP sed -n "s/^define [^@]*@\([A-Za-z0-9_]*\)(.*$/\1/p" < $NAME | \ while read FUNC; do sed -i '' "s/;\(.*\)\([A-Za-z0-9_]*\):\( *\)@$FUNC\([( ]*\)\$/;\1\2-LABEL:\3@$FUNC(/g" $TEMP done mv $TEMP $NAME fi done llvm-svn: 186268
2013-07-14 09:42:54 +08:00
; CHECK-LABEL: @test8b(
make jump threading recursively simplify expressions instead of doing it just one level deep. On the testcase we go from getting this: F1: ; preds = %T2 %F = and i1 true, %cond ; <i1> [#uses=1] br i1 %F, label %X, label %Y to a fully threaded: F1: ; preds = %T2 br label %Y This changes gets us to the point where we're forming (too many) switch instructions on doug's strswitch testcase. llvm-svn: 86646
2009-11-10 09:57:31 +08:00
T0:
%A = call i1 @test8a()
br i1 %A, label %T1, label %F1
Make jump threading eliminate blocks that just contain phi nodes, debug intrinsics, and an unconditional branch when possible. This reuses the TryToSimplifyUncondBranchFromEmptyBlock function split out of simplifycfg. llvm-svn: 86722
2009-11-11 05:40:01 +08:00
; CHECK: T0:
; CHECK-NEXT: call
; CHECK-NEXT: br i1 %A, label %T1, label %Y
make jump threading recursively simplify expressions instead of doing it just one level deep. On the testcase we go from getting this: F1: ; preds = %T2 %F = and i1 true, %cond ; <i1> [#uses=1] br i1 %F, label %X, label %Y to a fully threaded: F1: ; preds = %T2 br label %Y This changes gets us to the point where we're forming (too many) switch instructions on doug's strswitch testcase. llvm-svn: 86646
2009-11-10 09:57:31 +08:00
T1:
%B = call i1 @test8a()
br i1 %B, label %T2, label %F1
Make jump threading eliminate blocks that just contain phi nodes, debug intrinsics, and an unconditional branch when possible. This reuses the TryToSimplifyUncondBranchFromEmptyBlock function split out of simplifycfg. llvm-svn: 86722
2009-11-11 05:40:01 +08:00
; CHECK: T1:
; CHECK-NEXT: call
; CHECK-NEXT: br i1 %B, label %T2, label %Y
make jump threading recursively simplify expressions instead of doing it just one level deep. On the testcase we go from getting this: F1: ; preds = %T2 %F = and i1 true, %cond ; <i1> [#uses=1] br i1 %F, label %X, label %Y to a fully threaded: F1: ; preds = %T2 br label %Y This changes gets us to the point where we're forming (too many) switch instructions on doug's strswitch testcase. llvm-svn: 86646
2009-11-10 09:57:31 +08:00
T2:
%C = call i1 @test8a()
br i1 %cond, label %T3, label %F1
Make jump threading eliminate blocks that just contain phi nodes, debug intrinsics, and an unconditional branch when possible. This reuses the TryToSimplifyUncondBranchFromEmptyBlock function split out of simplifycfg. llvm-svn: 86722
2009-11-11 05:40:01 +08:00
; CHECK: T2:
; CHECK-NEXT: call
; CHECK-NEXT: br i1 %cond, label %T3, label %Y
make jump threading recursively simplify expressions instead of doing it just one level deep. On the testcase we go from getting this: F1: ; preds = %T2 %F = and i1 true, %cond ; <i1> [#uses=1] br i1 %F, label %X, label %Y to a fully threaded: F1: ; preds = %T2 br label %Y This changes gets us to the point where we're forming (too many) switch instructions on doug's strswitch testcase. llvm-svn: 86646
2009-11-10 09:57:31 +08:00
T3:
ret i32 0
F1:
%D = phi i32 [0, %T0], [0, %T1], [1, %T2]
%E = icmp eq i32 %D, 1
%F = and i1 %E, %cond
br i1 %F, label %X, label %Y
X:
call i1 @test8a()
ret i32 1
Y:
ret i32 2
}
implement a TODO by teaching jump threading about "xor x, 1". llvm-svn: 86739
2009-11-11 06:39:16 +08:00
;;; Verify that we can handle constraint propagation through "xor x, 1".
define i32 @test9(i1 %cond, i1 %cond2) {
Entry:
Update Transforms tests to use CHECK-LABEL for easier debugging. No functionality change. This update was done with the following bash script: find test/Transforms -name "*.ll" | \ while read NAME; do echo "$NAME" if ! grep -q "^; *RUN: *llc" $NAME; then TEMP=`mktemp -t temp` cp $NAME $TEMP sed -n "s/^define [^@]*@\([A-Za-z0-9_]*\)(.*$/\1/p" < $NAME | \ while read FUNC; do sed -i '' "s/;\(.*\)\([A-Za-z0-9_]*\):\( *\)@$FUNC\([( ]*\)\$/;\1\2-LABEL:\3@$FUNC(/g" $TEMP done mv $TEMP $NAME fi done llvm-svn: 186268
2013-07-14 09:42:54 +08:00
; CHECK-LABEL: @test9(
implement a TODO by teaching jump threading about "xor x, 1". llvm-svn: 86739
2009-11-11 06:39:16 +08:00
%v1 = call i32 @f1()
br i1 %cond, label %Merge, label %F1
; CHECK: Entry:
; CHECK-NEXT: %v1 = call i32 @f1()
; CHECK-NEXT: br i1 %cond, label %F2, label %Merge
F1:
%v2 = call i32 @f2()
br label %Merge
Merge:
%B = phi i32 [%v1, %Entry], [%v2, %F1]
%M = icmp eq i32 %B, %v1
%M1 = xor i1 %M, 1
%N = icmp eq i32 %B, 47
%O = and i1 %M1, %N
br i1 %O, label %T2, label %F2
; CHECK: Merge:
; CHECK-NOT: phi
; CHECK-NEXT: %v2 = call i32 @f2()
T2:
%Q = zext i1 %M to i32
ret i32 %Q
F2:
ret i32 %B
; CHECK: F2:
; CHECK-NEXT: phi i32
}
Stub out a new lazy value info pass, which will eventually vend value constraint information to the optimizer. llvm-svn: 86767
2009-11-11 08:22:30 +08:00
with the new code we can thread non-instruction values. This allows us to handle the test10 testcase. llvm-svn: 86924
2009-11-12 09:41:34 +08:00
; CHECK: @test10
declare i32 @test10f1()
declare i32 @test10f2()
declare void @test10f3()
;; Non-local condition threading.
should not commit when distracted. llvm-svn: 86929
2009-11-12 10:04:17 +08:00
define i32 @test10g(i1 %cond) {
Update Transforms tests to use CHECK-LABEL for easier debugging. No functionality change. This update was done with the following bash script: find test/Transforms -name "*.ll" | \ while read NAME; do echo "$NAME" if ! grep -q "^; *RUN: *llc" $NAME; then TEMP=`mktemp -t temp` cp $NAME $TEMP sed -n "s/^define [^@]*@\([A-Za-z0-9_]*\)(.*$/\1/p" < $NAME | \ while read FUNC; do sed -i '' "s/;\(.*\)\([A-Za-z0-9_]*\):\( *\)@$FUNC\([( ]*\)\$/;\1\2-LABEL:\3@$FUNC(/g" $TEMP done mv $TEMP $NAME fi done llvm-svn: 186268
2013-07-14 09:42:54 +08:00
; CHECK-LABEL: @test10g(
with the new code we can thread non-instruction values. This allows us to handle the test10 testcase. llvm-svn: 86924
2009-11-12 09:41:34 +08:00
; CHECK-NEXT: br i1 %cond, label %T2, label %F2
br i1 %cond, label %T1, label %F1
T1:
%v1 = call i32 @test10f1()
br label %Merge
; CHECK: %v1 = call i32 @test10f1()
; CHECK-NEXT: call void @f3()
typo llvm-svn: 86980
2009-11-12 17:44:17 +08:00
; CHECK-NEXT: ret i32 %v1
with the new code we can thread non-instruction values. This allows us to handle the test10 testcase. llvm-svn: 86924
2009-11-12 09:41:34 +08:00
F1:
%v2 = call i32 @test10f2()
br label %Merge
Merge:
%B = phi i32 [%v1, %T1], [%v2, %F1]
br i1 %cond, label %T2, label %F2
T2:
call void @f3()
ret i32 %B
F2:
ret i32 %B
}
We now thread some impossible condition information with LVI. llvm-svn: 86927
2009-11-12 09:55:20 +08:00
; Impossible conditional constraints should get threaded. BB3 is dead here.
define i32 @test11(i32 %A) {
Update Transforms tests to use CHECK-LABEL for easier debugging. No functionality change. This update was done with the following bash script: find test/Transforms -name "*.ll" | \ while read NAME; do echo "$NAME" if ! grep -q "^; *RUN: *llc" $NAME; then TEMP=`mktemp -t temp` cp $NAME $TEMP sed -n "s/^define [^@]*@\([A-Za-z0-9_]*\)(.*$/\1/p" < $NAME | \ while read FUNC; do sed -i '' "s/;\(.*\)\([A-Za-z0-9_]*\):\( *\)@$FUNC\([( ]*\)\$/;\1\2-LABEL:\3@$FUNC(/g" $TEMP done mv $TEMP $NAME fi done llvm-svn: 186268
2013-07-14 09:42:54 +08:00
; CHECK-LABEL: @test11(
We now thread some impossible condition information with LVI. llvm-svn: 86927
2009-11-12 09:55:20 +08:00
; CHECK-NEXT: icmp
; CHECK-NEXT: br i1 %tmp455, label %BB4, label %BB2
%tmp455 = icmp eq i32 %A, 42
br i1 %tmp455, label %BB1, label %BB2
BB2:
; CHECK: call i32 @f1()
should not commit when distracted. llvm-svn: 86929
2009-11-12 10:04:17 +08:00
; CHECK-NEXT: ret i32 %C
We now thread some impossible condition information with LVI. llvm-svn: 86927
2009-11-12 09:55:20 +08:00
%C = call i32 @f1()
ret i32 %C
BB1:
%tmp459 = icmp eq i32 %A, 43
br i1 %tmp459, label %BB3, label %BB4
BB3:
call i32 @f2()
ret i32 3
BB4:
call void @f3()
ret i32 4
}
with the new code we can thread non-instruction values. This allows us to handle the test10 testcase. llvm-svn: 86924
2009-11-12 09:41:34 +08:00
use getPredicateOnEdge to fold comparisons through PHI nodes, which implements GCC PR18046. This also gets us 360 more jump threads on 176.gcc. llvm-svn: 86953
2009-11-12 13:24:05 +08:00
;; Correlated value through boolean expression. GCC PR18046.
define void @test12(i32 %A) {
Update Transforms tests to use CHECK-LABEL for easier debugging. No functionality change. This update was done with the following bash script: find test/Transforms -name "*.ll" | \ while read NAME; do echo "$NAME" if ! grep -q "^; *RUN: *llc" $NAME; then TEMP=`mktemp -t temp` cp $NAME $TEMP sed -n "s/^define [^@]*@\([A-Za-z0-9_]*\)(.*$/\1/p" < $NAME | \ while read FUNC; do sed -i '' "s/;\(.*\)\([A-Za-z0-9_]*\):\( *\)@$FUNC\([( ]*\)\$/;\1\2-LABEL:\3@$FUNC(/g" $TEMP done mv $TEMP $NAME fi done llvm-svn: 186268
2013-07-14 09:42:54 +08:00
; CHECK-LABEL: @test12(
use getPredicateOnEdge to fold comparisons through PHI nodes, which implements GCC PR18046. This also gets us 360 more jump threads on 176.gcc. llvm-svn: 86953
2009-11-12 13:24:05 +08:00
entry:
%cond = icmp eq i32 %A, 0
br i1 %cond, label %bb, label %bb1
; Should branch to the return block instead of through BB1.
; CHECK: entry:
; CHECK-NEXT: %cond = icmp eq i32 %A, 0
; CHECK-NEXT: br i1 %cond, label %bb1, label %return
bb:
%B = call i32 @test10f2()
br label %bb1
bb1:
%C = phi i32 [ %A, %entry ], [ %B, %bb ]
%cond4 = icmp eq i32 %C, 0
br i1 %cond4, label %bb2, label %return
; CHECK: bb1:
; CHECK-NEXT: %B = call i32 @test10f2()
; CHECK-NEXT: %cond4 = icmp eq i32 %B, 0
; CHECK-NEXT: br i1 %cond4, label %bb2, label %return
bb2:
%D = call i32 @test10f2()
ret void
return:
ret void
}
with the new code we can thread non-instruction values. This allows us to handle the test10 testcase. llvm-svn: 86924
2009-11-12 09:41:34 +08:00
Stub out a new lazy value info pass, which will eventually vend value constraint information to the optimizer. llvm-svn: 86767
2009-11-11 08:22:30 +08:00
Teach jump threading to duplicate small blocks when the branch condition is a xor with a phi node. This eliminates nonsense like this from 176.gcc in several places: LBB166_84: testl %eax, %eax - setne %al - xorb %cl, %al - notb %al - testb $1, %al - je LBB166_85 + je LBB166_69 + jmp LBB166_85 This is rdar://7391699 llvm-svn: 93221
2010-01-12 10:07:17 +08:00
;; Duplicate condition to avoid xor of cond.
;; rdar://7391699
define i32 @test13(i1 %cond, i1 %cond2) {
Stub out a new lazy value info pass, which will eventually vend value constraint information to the optimizer. llvm-svn: 86767
2009-11-11 08:22:30 +08:00
Entry:
Update Transforms tests to use CHECK-LABEL for easier debugging. No functionality change. This update was done with the following bash script: find test/Transforms -name "*.ll" | \ while read NAME; do echo "$NAME" if ! grep -q "^; *RUN: *llc" $NAME; then TEMP=`mktemp -t temp` cp $NAME $TEMP sed -n "s/^define [^@]*@\([A-Za-z0-9_]*\)(.*$/\1/p" < $NAME | \ while read FUNC; do sed -i '' "s/;\(.*\)\([A-Za-z0-9_]*\):\( *\)@$FUNC\([( ]*\)\$/;\1\2-LABEL:\3@$FUNC(/g" $TEMP done mv $TEMP $NAME fi done llvm-svn: 186268
2013-07-14 09:42:54 +08:00
; CHECK-LABEL: @test13(
Stub out a new lazy value info pass, which will eventually vend value constraint information to the optimizer. llvm-svn: 86767
2009-11-11 08:22:30 +08:00
%v1 = call i32 @f1()
br i1 %cond, label %Merge, label %F1
F1:
br label %Merge
Merge:
%B = phi i1 [true, %Entry], [%cond2, %F1]
Teach jump threading to duplicate small blocks when the branch condition is a xor with a phi node. This eliminates nonsense like this from 176.gcc in several places: LBB166_84: testl %eax, %eax - setne %al - xorb %cl, %al - notb %al - testb $1, %al - je LBB166_85 + je LBB166_69 + jmp LBB166_85 This is rdar://7391699 llvm-svn: 93221
2010-01-12 10:07:17 +08:00
%C = phi i32 [192, %Entry], [%v1, %F1]
%M = icmp eq i32 %C, 192
Stub out a new lazy value info pass, which will eventually vend value constraint information to the optimizer. llvm-svn: 86767
2009-11-11 08:22:30 +08:00
%N = xor i1 %B, %M
br i1 %N, label %T2, label %F2
T2:
ret i32 123
F2:
ret i32 %v1
Teach jump threading to duplicate small blocks when the branch condition is a xor with a phi node. This eliminates nonsense like this from 176.gcc in several places: LBB166_84: testl %eax, %eax - setne %al - xorb %cl, %al - notb %al - testb $1, %al - je LBB166_85 + je LBB166_69 + jmp LBB166_85 This is rdar://7391699 llvm-svn: 93221
2010-01-12 10:07:17 +08:00
1) Use the new SimplifyInstructionsInBlock routine instead of the copy in JT. 2) When cloning blocks for PHI or xor conditions, use instsimplify to simplify the code as we go. This allows us to squish common cases early in JT which opens up opportunities for subsequent iterations, and allows it to completely simplify the testcase. llvm-svn: 93253
2010-01-13 04:41:47 +08:00
; CHECK: br i1 %cond, label %F2, label %Merge
Teach jump threading to duplicate small blocks when the branch condition is a xor with a phi node. This eliminates nonsense like this from 176.gcc in several places: LBB166_84: testl %eax, %eax - setne %al - xorb %cl, %al - notb %al - testb $1, %al - je LBB166_85 + je LBB166_69 + jmp LBB166_85 This is rdar://7391699 llvm-svn: 93221
2010-01-12 10:07:17 +08:00
; CHECK: Merge:
; CHECK-NEXT: %M = icmp eq i32 %v1, 192
; CHECK-NEXT: %N = xor i1 %cond2, %M
; CHECK-NEXT: br i1 %N, label %T2, label %F2
Stub out a new lazy value info pass, which will eventually vend value constraint information to the optimizer. llvm-svn: 86767
2009-11-11 08:22:30 +08:00
}
Update Transforms tests to use CHECK-LABEL for easier debugging. No functionality change. This update was done with the following bash script: find test/Transforms -name "*.ll" | \ while read NAME; do echo "$NAME" if ! grep -q "^; *RUN: *llc" $NAME; then TEMP=`mktemp -t temp` cp $NAME $TEMP sed -n "s/^define [^@]*@\([A-Za-z0-9_]*\)(.*$/\1/p" < $NAME | \ while read FUNC; do sed -i '' "s/;\(.*\)\([A-Za-z0-9_]*\):\( *\)@$FUNC\([( ]*\)\$/;\1\2-LABEL:\3@$FUNC(/g" $TEMP done mv $TEMP $NAME fi done llvm-svn: 186268
2013-07-14 09:42:54 +08:00
; CHECK-LABEL: @test14(
Add a micro-test for the transforms I added to JumpThreading. I have not been able to find a way to test each in isolation, for a few reasons: 1) The ability to look-through non-i1 BinaryOperator's requires the ability to look through non-constant ICmps in order for it to ever trigger. 2) The ability to do LVI-powered PHI value determination only matters in cases that ProcessBranchOnPHI can't handle. Since it already handles all the cases without other instructions in the def-use chain between the PHI and the branch, it requires the ability to look through ICmps and/or BinaryOperators as well. llvm-svn: 112611
2010-09-01 01:59:07 +08:00
define i32 @test14(i32 %in) {
entry:
%A = icmp eq i32 %in, 0
; CHECK: br i1 %A, label %right_ret, label %merge
br i1 %A, label %left, label %right
; CHECK-NOT: left:
left:
br label %merge
; CHECK-NOT: right:
right:
%B = call i32 @f1()
br label %merge
merge:
; CHECK-NOT: %C = phi i32 [%in, %left], [%B, %right]
%C = phi i32 [%in, %left], [%B, %right]
%D = add i32 %C, 1
%E = icmp eq i32 %D, 2
br i1 %E, label %left_ret, label %right_ret
; CHECK: left_ret:
left_ret:
ret i32 0
right_ret:
ret i32 1
}
Stub out a new lazy value info pass, which will eventually vend value constraint information to the optimizer. llvm-svn: 86767
2009-11-11 08:22:30 +08:00
Add a test for the duplicated-conditional situation illutrated by PR5652. llvm-svn: 112621
2010-09-01 02:49:12 +08:00
; PR5652
Update Transforms tests to use CHECK-LABEL for easier debugging. No functionality change. This update was done with the following bash script: find test/Transforms -name "*.ll" | \ while read NAME; do echo "$NAME" if ! grep -q "^; *RUN: *llc" $NAME; then TEMP=`mktemp -t temp` cp $NAME $TEMP sed -n "s/^define [^@]*@\([A-Za-z0-9_]*\)(.*$/\1/p" < $NAME | \ while read FUNC; do sed -i '' "s/;\(.*\)\([A-Za-z0-9_]*\):\( *\)@$FUNC\([( ]*\)\$/;\1\2-LABEL:\3@$FUNC(/g" $TEMP done mv $TEMP $NAME fi done llvm-svn: 186268
2013-07-14 09:42:54 +08:00
; CHECK-LABEL: @test15(
Add a test for the duplicated-conditional situation illutrated by PR5652. llvm-svn: 112621
2010-09-01 02:49:12 +08:00
define i32 @test15(i32 %len) {
entry:
; CHECK: icmp ult i32 %len, 13
%tmp = icmp ult i32 %len, 13
br i1 %tmp, label %check, label %exit0
exit0:
ret i32 0
check:
%tmp9 = icmp ult i32 %len, 21
br i1 %tmp9, label %exit1, label %exit2
exit2:
; CHECK-NOT: ret i32 2
ret i32 2
exit1:
ret i32 1
; CHECK: }
}
[JumpThreading] See through Cast Instructions To capture more jump-thread opportunity. llvm-svn: 263618
2016-03-16 12:52:52 +08:00
;;; Verify that we can handle constraint propagation through cast.
define i32 @test16(i1 %cond) {
Entry:
; CHECK-LABEL: @test16(
br i1 %cond, label %Merge, label %F1
; CHECK: Entry:
; CHECK-NEXT: br i1 %cond, label %F2, label %Merge
F1:
%v1 = call i32 @f1()
br label %Merge
Merge:
%B = phi i32 [0, %Entry], [%v1, %F1]
%M = icmp eq i32 %B, 0
%M1 = zext i1 %M to i32
%N = icmp eq i32 %M1, 0
br i1 %N, label %T2, label %F2
; CHECK: Merge:
; CHECK-NOT: phi
; CHECK-NEXT: %v1 = call i32 @f1()
T2:
%Q = call i32 @f2()
ret i32 %Q
F2:
ret i32 %B
; CHECK: F2:
; CHECK-NEXT: phi i32
}
Add a new attribute, 'noduplicate'. If a function contains a noduplicate call, the call cannot be duplicated - Jump threading, loop unrolling, loop unswitching, and loop rotation are inhibited if they would duplicate the call. Similarly inlining of the function is inhibited, if that would duplicate the call (in particular inlining is still allowed when there is only one callsite and the function has internal linkage). llvm-svn: 170704
2012-12-21 00:04:27 +08:00
; In this test we check that block duplication is inhibited by the presence
; of a function with the 'noduplicate' attribute.
declare void @g()
declare void @j()
declare void @k()
[JumpThreading] make jump threading respect convergent annotation. Summary: JumpThreading shouldn't duplicate a convergent call, because that would move a convergent call into a control-inequivalent location. For example, if (cond) { ... } else { ... } convergent_call(); if (cond) { ... } else { ... } should not be optimized to if (cond) { ... convergent_call(); ... } else { ... convergent_call(); ... } Test Plan: test/Transforms/JumpThreading/basic.ll Patch by Xuetian Weng. Reviewers: resistor, arsenm, jingyue Subscribers: llvm-commits Differential Revision: http://reviews.llvm.org/D12484 llvm-svn: 246415
2015-08-31 14:10:27 +08:00
; CHECK-LABEL: define void @h(i32 %p) {
Add a new attribute, 'noduplicate'. If a function contains a noduplicate call, the call cannot be duplicated - Jump threading, loop unrolling, loop unswitching, and loop rotation are inhibited if they would duplicate the call. Similarly inlining of the function is inhibited, if that would duplicate the call (in particular inlining is still allowed when there is only one callsite and the function has internal linkage). llvm-svn: 170704
2012-12-21 00:04:27 +08:00
define void @h(i32 %p) {
%x = icmp ult i32 %p, 5
br i1 %x, label %l1, label %l2
l1:
call void @j()
br label %l3
l2:
call void @k()
br label %l3
l3:
Use references to attribute groups on the call/invoke instructions. Listing all of the attributes for the callee of a call/invoke instruction is way too much and makes the IR unreadable. Use references to attributes instead. llvm-svn: 175877
2013-02-22 17:09:42 +08:00
; CHECK: call void @g() [[NOD:#[0-9]+]]
; CHECK-NOT: call void @g() [[NOD]]
Add a new attribute, 'noduplicate'. If a function contains a noduplicate call, the call cannot be duplicated - Jump threading, loop unrolling, loop unswitching, and loop rotation are inhibited if they would duplicate the call. Similarly inlining of the function is inhibited, if that would duplicate the call (in particular inlining is still allowed when there is only one callsite and the function has internal linkage). llvm-svn: 170704
2012-12-21 00:04:27 +08:00
call void @g() noduplicate
%y = icmp ult i32 %p, 5
br i1 %y, label %l4, label %l5
l4:
call void @j()
ret void
l5:
call void @k()
ret void
; CHECK: }
}
Use references to attribute groups on the call/invoke instructions. Listing all of the attributes for the callee of a call/invoke instruction is way too much and makes the IR unreadable. Use references to attributes instead. llvm-svn: 175877
2013-02-22 17:09:42 +08:00
[JumpThreading] make jump threading respect convergent annotation. Summary: JumpThreading shouldn't duplicate a convergent call, because that would move a convergent call into a control-inequivalent location. For example, if (cond) { ... } else { ... } convergent_call(); if (cond) { ... } else { ... } should not be optimized to if (cond) { ... convergent_call(); ... } else { ... convergent_call(); ... } Test Plan: test/Transforms/JumpThreading/basic.ll Patch by Xuetian Weng. Reviewers: resistor, arsenm, jingyue Subscribers: llvm-commits Differential Revision: http://reviews.llvm.org/D12484 llvm-svn: 246415
2015-08-31 14:10:27 +08:00
; CHECK-LABEL: define void @h_con(i32 %p) {
define void @h_con(i32 %p) {
%x = icmp ult i32 %p, 5
br i1 %x, label %l1, label %l2
l1:
call void @j()
br label %l3
l2:
call void @k()
br label %l3
l3:
; CHECK: call void @g() [[CON:#[0-9]+]]
; CHECK-NOT: call void @g() [[CON]]
call void @g() convergent
%y = icmp ult i32 %p, 5
br i1 %y, label %l4, label %l5
l4:
call void @j()
ret void
l5:
call void @k()
ret void
; CHECK: }
}
Use references to attribute groups on the call/invoke instructions. Listing all of the attributes for the callee of a call/invoke instruction is way too much and makes the IR unreadable. Use references to attributes instead. llvm-svn: 175877
2013-02-22 17:09:42 +08:00
; CHECK: attributes [[NOD]] = { noduplicate }
[JumpThreading] make jump threading respect convergent annotation. Summary: JumpThreading shouldn't duplicate a convergent call, because that would move a convergent call into a control-inequivalent location. For example, if (cond) { ... } else { ... } convergent_call(); if (cond) { ... } else { ... } should not be optimized to if (cond) { ... convergent_call(); ... } else { ... convergent_call(); ... } Test Plan: test/Transforms/JumpThreading/basic.ll Patch by Xuetian Weng. Reviewers: resistor, arsenm, jingyue Subscribers: llvm-commits Differential Revision: http://reviews.llvm.org/D12484 llvm-svn: 246415
2015-08-31 14:10:27 +08:00
; CHECK: attributes [[CON]] = { convergent }