brintos

brintos / llvm-project-archived public Read only

0
0
Text · 1.3 KiB · 4a2e8bd Raw
37 lines · plain
1; This is the test case taken from Appel's book that illustrates a hard case2; that SCCP gets right, and when followed by ADCE, is completely eliminated3;4; RUN: opt < %s -passes=sccp,simplifycfg,indvars,loop-deletion,dce,simplifycfg -simplifycfg-require-and-preserve-domtree=1 -simplifycfg-require-and-preserve-domtree=1 -S | not grep br5 6define i32 @"test function"(i32 %i0, i32 %j0) {7BB1:8        br label %BB29 10BB2:            ; preds = %BB7, %BB111        %j2 = phi i32 [ %j4, %BB7 ], [ 1, %BB1 ]                ; <i32> [#uses=2]12        %k2 = phi i32 [ %k4, %BB7 ], [ 0, %BB1 ]                ; <i32> [#uses=4]13        %kcond = icmp slt i32 %k2, 100          ; <i1> [#uses=1]14        br i1 %kcond, label %BB3, label %BB415 16BB3:            ; preds = %BB217        %jcond = icmp slt i32 %j2, 20           ; <i1> [#uses=1]18        br i1 %jcond, label %BB5, label %BB619 20BB4:            ; preds = %BB221        ret i32 %j222 23BB5:            ; preds = %BB324        %k3 = add i32 %k2, 1            ; <i32> [#uses=1]25        br label %BB726 27BB6:            ; preds = %BB328        %k5 = add i32 %k2, 1            ; <i32> [#uses=1]29        br label %BB730 31BB7:            ; preds = %BB6, %BB532        %j4 = phi i32 [ 1, %BB5 ], [ %k2, %BB6 ]                ; <i32> [#uses=1]33        %k4 = phi i32 [ %k3, %BB5 ], [ %k5, %BB6 ]              ; <i32> [#uses=1]34        br label %BB235}36 37