llvm.org GIT mirror llvm / 3dc73d3
Move this test from ADCE to loop deletion, where it is more appropriate. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@51181 91177308-0d34-0410-b5e6-96231b3b80d8 Owen Anderson 11 years ago
2 changed file(s) with 36 addition(s) and 36 deletion(s). Raw diff Collapse all Expand all
+0
-36
test/Transforms/ADCE/adcetest.ll less more
None ; This is the test case taken from Appel's book that illustrates a hard case
1 ; that SCCP gets right, and when followed by ADCE, is completely eliminated
2 ;
3 ; RUN: llvm-as < %s | opt -sccp -adce -simplifycfg | llvm-dis | not grep br
4
5 define i32 @"test function"(i32 %i0, i32 %j0) {
6 BB1:
7 br label %BB2
8
9 BB2: ; preds = %BB7, %BB1
10 %j2 = phi i32 [ %j4, %BB7 ], [ 1, %BB1 ] ; [#uses=2]
11 %k2 = phi i32 [ %k4, %BB7 ], [ 0, %BB1 ] ; [#uses=4]
12 %kcond = icmp slt i32 %k2, 100 ; [#uses=1]
13 br i1 %kcond, label %BB3, label %BB4
14
15 BB3: ; preds = %BB2
16 %jcond = icmp slt i32 %j2, 20 ; [#uses=1]
17 br i1 %jcond, label %BB5, label %BB6
18
19 BB4: ; preds = %BB2
20 ret i32 %j2
21
22 BB5: ; preds = %BB3
23 %k3 = add i32 %k2, 1 ; [#uses=1]
24 br label %BB7
25
26 BB6: ; preds = %BB3
27 %k5 = add i32 %k2, 1 ; [#uses=1]
28 br label %BB7
29
30 BB7: ; preds = %BB6, %BB5
31 %j4 = phi i32 [ 1, %BB5 ], [ %k2, %BB6 ] ; [#uses=1]
32 %k4 = phi i32 [ %k3, %BB5 ], [ %k5, %BB6 ] ; [#uses=1]
33 br label %BB2
34 }
35
0 ; This is the test case taken from Appel's book that illustrates a hard case
1 ; that SCCP gets right, and when followed by ADCE, is completely eliminated
2 ;
3 ; RUN: llvm-as < %s | opt -sccp -simplifycfg -indvars -loop-deletion -dce -simplifycfg | llvm-dis | not grep br
4
5 define i32 @"test function"(i32 %i0, i32 %j0) {
6 BB1:
7 br label %BB2
8
9 BB2: ; preds = %BB7, %BB1
10 %j2 = phi i32 [ %j4, %BB7 ], [ 1, %BB1 ] ; [#uses=2]
11 %k2 = phi i32 [ %k4, %BB7 ], [ 0, %BB1 ] ; [#uses=4]
12 %kcond = icmp slt i32 %k2, 100 ; [#uses=1]
13 br i1 %kcond, label %BB3, label %BB4
14
15 BB3: ; preds = %BB2
16 %jcond = icmp slt i32 %j2, 20 ; [#uses=1]
17 br i1 %jcond, label %BB5, label %BB6
18
19 BB4: ; preds = %BB2
20 ret i32 %j2
21
22 BB5: ; preds = %BB3
23 %k3 = add i32 %k2, 1 ; [#uses=1]
24 br label %BB7
25
26 BB6: ; preds = %BB3
27 %k5 = add i32 %k2, 1 ; [#uses=1]
28 br label %BB7
29
30 BB7: ; preds = %BB6, %BB5
31 %j4 = phi i32 [ 1, %BB5 ], [ %k2, %BB6 ] ; [#uses=1]
32 %k4 = phi i32 [ %k3, %BB5 ], [ %k5, %BB6 ] ; [#uses=1]
33 br label %BB2
34 }
35