/external/llvm/test/CodeGen/X86/ |
sink-cheap-instructions.ll | 19 br label %.backedge 21 .backedge: 22 %.0 = phi i8* [ %input, %0 ], [ %7, %.backedge.backedge ] 25 switch i8 %8, label %.backedge.backedge [ 36 br label %.backedge.backedge 40 br label %.backedge.backedge [all...] |
mbp-false-cfg-break.ll | 7 ; CHECK: # %backedge 21 %iv = phi i32 [0, %preheader], [%iv.next, %backedge] 23 br i1 %cnd, label %backedge, label %rare, !prof !{!"branch_weights", i32 1000000, i32 1} 26 br label %backedge 27 backedge:
|
2009-04-12-FastIselOverflowCrash.ll | 13 br i1 %tmp2, label %.backedge, label %BB3 17 br label %.backedge 19 .backedge:
|
/external/llvm/test/Transforms/JumpThreading/ |
induction.ll | 6 ; CHECK: br label %backedge 10 ; CHECK-LABEL: backedge: 12 ; CHECK: br i1 %cont, label %backedge, label %exit 13 %iv = phi i32 [0, %entry], [%iv.next, %backedge] 16 br i1 %cnd, label %backedge, label %exit 18 backedge:
|
/external/llvm/test/Transforms/SCCP/ |
2008-01-27-UndefCorrelate.ll | 9 %indvar = phi i32 [ 0, %entry ], [ %k, %bb.backedge ] 15 br i1 %tmp97, label %bb.backedge, label %bb12 17 bb.backedge: 22 br i1 %tmp9, label %bb.backedge, label %bb12
|
/external/swiftshader/third_party/LLVM/test/Transforms/SCCP/ |
2008-01-27-UndefCorrelate.ll | 9 %indvar = phi i32 [ 0, %entry ], [ %k, %bb.backedge ] 15 br i1 %tmp97, label %bb.backedge, label %bb12 17 bb.backedge: 22 br i1 %tmp9, label %bb.backedge, label %bb12
|
/external/llvm/test/Analysis/ScalarEvolution/ |
trip-count13.ll | 4 ; E.g.: %rhs = 255, %start = 99, backedge taken 156 times 16 ; CHECK-NEXT: Loop %loop: backedge-taken count is (-100 + (-1 * %rhs) + ((100 + %rhs) umax %rhs)) 17 ; CHECK-NEXT: Loop %loop: max backedge-taken count is -1 25 ; E.g.: %start = 99, %rhs = 255, backedge taken 156 times 36 ; CHECK-NEXT: Loop %loop: backedge-taken count is ((-1 * %start) + ((-100 + %start) umax %start)) 37 ; CHECK-NEXT: Loop %loop: max backedge-taken count is -1 45 ; E.g.: %rhs = 127, %start = -29, backedge taken 156 times 56 ; CHECK-NEXT: Loop %loop: backedge-taken count is (-100 + (-1 * %rhs) + ((100 + %rhs) smax %rhs)) 57 ; CHECK-NEXT: Loop %loop: max backedge-taken count is -1 65 ; E.g.: start = -29, %rhs = 127, %backedge taken 156 time [all...] |
trip-count10.ll | 6 ; CHECK: Loop %loop: Unpredictable backedge-taken count. 7 ; CHECK: Loop %loop: Unpredictable max backedge-taken count. 10 ; CHECK: Loop %loop: backedge-taken count is false 11 ; CHECK: Loop %loop: max backedge-taken count is false 14 ; CHECK: Loop %loop: backedge-taken count is false 15 ; CHECK: Loop %loop: max backedge-taken count is false 18 ; CHECK: Loop %loop: Unpredictable backedge-taken count. 19 ; CHECK: Loop %loop: Unpredictable max backedge-taken count. 84 ; CHECK-NEXT: Loop %loophead: Unpredictable backedge-taken count 85 ; CHECK-NEXT: Loop %loophead: Unpredictable max backedge-taken coun [all...] |
trip-count-pow2.ll | 16 ; CHECK: Loop %loop: backedge-taken count is ((-32 + (96 * %n)) /u 32) 17 ; CHECK: Loop %loop: max backedge-taken count is ((-32 + (96 * %n)) /u 32) 34 ; CHECK: Loop %loop: backedge-taken count is ((-32 + (32 * (%n /u 32))) /u 32) 35 ; CHECK: Loop %loop: max backedge-taken count is ((-32 + (32 * (%n /u 32))) /u 32) 51 ; CHECK: Loop %loop: Unpredictable backedge-taken count. 52 ; CHECK: Loop %loop: Unpredictable max backedge-taken count.
|
exhaustive-trip-counts.ll | 8 ; CHECK: Loop %for.body: backedge-taken count is 5 9 ; CHECK: Loop %for.body: max backedge-taken count is 5 10 ; CHECK: Loop %for.body: Predicated backedge-taken count is 5
|
predicated-trip-count.ll | 8 ; that the resulting backedge expression will be valid for: 18 ; backedge taken count is correct. 23 ; CHECK: Loop %bb3: Unpredictable backedge-taken count. 24 ; CHECK-NEXT: Loop %bb3: Unpredictable max backedge-taken count. 25 ; CHECK-NEXT: Loop %bb3: Predicated backedge-taken count is (1 + (-1 smax %M)) 51 ; The predicated backedge taken count is: 57 ; The predicated backedge taken count is 0. 65 ; The predicated backedge taken count is 1 + (zext i16 %Start to i32) - %M 67 ; If %M >= MIN_INT + 1, this predicated backedge taken count would be correct (even 81 ; CHECK: Loop %bb3: Unpredictable backedge-taken count [all...] |
trip-count9.ll | 12 ; CHECK: Loop %loop: backedge-taken count is (-1 + %n) 13 ; CHECK: Loop %loop: max backedge-taken count is 6 28 ; CHECK: Loop %loop: Unpredictable backedge-taken count. 29 ; CHECK: Loop %loop: Unpredictable max backedge-taken count. 44 ; CHECK: Loop %loop: backedge-taken count is (-2 + (2 smax %n)) 45 ; CHECK: Loop %loop: max backedge-taken count is 5 60 ; CHECK: Loop %loop: Unpredictable backedge-taken count. 61 ; CHECK: Loop %loop: Unpredictable max backedge-taken count. 76 ; CHECK: Loop %loop: backedge-taken count is (-1 + (-1 * %x) + ((1 + %x) smax %n)) 77 ; CHECK: Loop %loop: max backedge-taken count is - [all...] |
/external/llvm/test/Transforms/LoopStrengthReduce/ |
hoist-parent-preheader.ll | 14 loop2: ; preds = %loop1, %loop2.backedge 15 %indvar414 = phi i64 [ %indvar.next415, %loop2.backedge ], [ 0, %loop1 ] 20 br i1 false, label %loop2.exit, label %loop2.backedge 22 loop2.backedge: ; preds = %loop2
|
/external/swiftshader/third_party/LLVM/test/Transforms/LoopStrengthReduce/ |
hoist-parent-preheader.ll | 14 loop2: ; preds = %loop1, %loop2.backedge 15 %indvar414 = phi i64 [ %indvar.next415, %loop2.backedge ], [ 0, %loop1 ] 20 br i1 false, label %loop2.exit, label %loop2.backedge 22 loop2.backedge: ; preds = %loop2
|
/external/llvm/test/CodeGen/PowerPC/ |
zext-free.ll | 11 loop: ; preds = %loop.backedge, %entry 12 %0 = phi i8* [ %.pre, %entry ], [ %.be, %loop.backedge ] 20 br i1 %or.cond, label %if.then3, label %loop.backedge 25 br label %loop.backedge 27 loop.backedge: ; preds = %if.then3, %loop
|
/external/v8/src/compiler/ |
bytecode-loop-analysis.cc | 45 // another loop entry or an outer loop backedge. 47 // backedge must either go to the current loop or be the first of the 59 // If this is a backedge, record it. 62 // Check whether this is actually a backedge of the outer loop and we have 78 // If there is no next backedge => offset is not in a loop. 82 // If the header preceeds the offset, it is the backedge of the containing
|
/external/llvm/test/Transforms/GVN/ |
lpre-call-wrap.ll | 3 ; Make sure the load in bb3.backedge is removed and moved into bb1 after the 31 bb: ; preds = %bb3.backedge, %bb.nph 32 %.rle = phi i32 [ %1, %bb.nph ], [ %7, %bb3.backedge ] ; <i32> [#uses=1] 37 br i1 %6, label %bb1, label %bb3.backedge 41 br label %bb3.backedge 43 bb3.backedge: ; preds = %bb, %bb1 44 ; CHECK: bb3.backedge: 51 return: ; preds = %bb3.backedge, %entry
|
2007-07-26-InterlockingLoops.ll | 25 br i1 %cmp1 , label %bb98.backedge, label %return.loopexit 27 bb98.backedge: 33 br i1 false, label %bb98.backedge, label %return.loopexit
|
/external/llvm/test/Transforms/LICM/ |
2014-09-10-doFinalizationAssert.ll | 19 br i1 true, label %outer.backedge, label %tail 24 outer.backedge:
|
assume.ll | 10 br i1 undef, label %if.then, label %for.cond.backedge 12 for.cond.backedge: 27 br i1 undef, label %for.cond.backedge, label %for.body61.us 30 br i1 undef, label %for.cond.backedge, label %for.body61
|
alias-set-tracker-loss.ll | 17 br label %l1.backedge 20 br i1 undef, label %l1.backedge, label %l2.preheader 22 l1.backedge:
|
/external/swiftshader/third_party/LLVM/test/Transforms/GVN/ |
lpre-call-wrap.ll | 3 ; Make sure the load in bb3.backedge is removed and moved into bb1 after the 31 bb: ; preds = %bb3.backedge, %bb.nph 32 %.rle = phi i32 [ %1, %bb.nph ], [ %7, %bb3.backedge ] ; <i32> [#uses=1] 37 br i1 %6, label %bb1, label %bb3.backedge 41 br label %bb3.backedge 43 bb3.backedge: ; preds = %bb, %bb1 44 ; CHECK: bb3.backedge: 51 return: ; preds = %bb3.backedge, %entry
|
/external/swiftshader/third_party/LLVM/test/Transforms/LoopSimplify/ |
single-backedge.ll | 1 ; The loop canonicalization pass should guarantee that there is one backedge
6 ; CHECK: Loop.backedge:
|
/external/llvm/test/Transforms/LoopUnswitch/ |
preserve-analyses.ll | 24 switch i32 %ineq.0.ph, label %bb8.backedge [ 29 bb8.backedge: ; preds = %bb6, %bb5, %bb2 37 br i1 %6, label %bb6, label %bb8.backedge 41 br i1 %5, label %bb7, label %bb8.backedge 45 br label %bb8.outer.backedge 47 bb8.outer.backedge: ; preds = %bb8.outer.loopexit, %bb7 54 br label %bb8.outer.backedge 56 bb8.outer: ; preds = %bb8.outer.backedge, %entry 57 %ineq.0.ph = phi i32 [ 0, %entry ], [ %ineq.0.ph.be, %bb8.outer.backedge ] ; <i32> [#uses=3] 58 %p_addr.0.ph = phi i8* [ %p, %entry ], [ %.lcssa2, %bb8.outer.backedge ] ; <i8*> [#uses=1 [all...] |
/external/swiftshader/third_party/LLVM/test/Transforms/LoopUnswitch/ |
preserve-analyses.ll | 24 switch i32 %ineq.0.ph, label %bb8.backedge [ 29 bb8.backedge: ; preds = %bb6, %bb5, %bb2 37 br i1 %6, label %bb6, label %bb8.backedge 41 br i1 %5, label %bb7, label %bb8.backedge 45 br label %bb8.outer.backedge 47 bb8.outer.backedge: ; preds = %bb8.outer.loopexit, %bb7 54 br label %bb8.outer.backedge 56 bb8.outer: ; preds = %bb8.outer.backedge, %entry 57 %ineq.0.ph = phi i32 [ 0, %entry ], [ %ineq.0.ph.be, %bb8.outer.backedge ] ; <i32> [#uses=3] 58 %p_addr.0.ph = phi i8* [ %p, %entry ], [ %.lcssa2, %bb8.outer.backedge ] ; <i8*> [#uses=1 [all...] |