/external/llvm/test/Transforms/LoopSimplify/ |
indirectbr-backedge.ll | 5 ; CHECK: bb1: ; preds = %bb5, %bb 8 ; CHECK: bb5: ; preds = %bb1 9 ; CHECK-NEXT: br label %bb1{{$}} 13 br label %bb1 15 bb1: ; preds = %bb5, %bb1, %bb 16 indirectbr i8* %p, [label %bb6, label %bb7, label %bb1, label %bb2, label %bb3, label %bb5, label %bb4] 18 bb2: ; preds = %bb1 21 bb3: ; preds = %bb1 24 bb4: ; preds = %bb1 [all...] |
basictest.ll | 4 ; to by BB1 & BB2 8 br i1 true, label %BB1, label %BB2 9 BB1: ; preds = %0 13 BB3: ; preds = %BB3, %BB2, %BB1
|
2010-07-15-IncorrectDomFrontierUpdate.ll | 6 br i1 undef, label %bb37, label %bb1.i 8 bb1.i: ; preds = %bb1.i, %bb 9 %indvar = phi i64 [ %indvar.next, %bb1.i ], [ 0, %entry ] ; <i64> [#uses=1] 12 br i1 %exitcond, label %bb37, label %bb1.i 14 bb37: ; preds = %bb1.i, %bb
|
/external/llvm/test/Transforms/InstCombine/ |
2010-01-28-NegativeSRem.ll | 6 br label %BB1 8 BB1: ; preds = %BB1, %entry 9 ; CHECK: BB1: 10 %x = phi i32 [ -29, %entry ], [ 0, %BB1 ] ; <i32> [#uses=2] 13 br i1 %t, label %BB2, label %BB1 16 BB2: ; preds = %BB1
|
/external/llvm/test/Transforms/ADCE/ |
2002-05-22-PHITest.ll | 1 ; It is illegal to remove BB1 because it will mess up the PHI node! 3 ; RUN: opt < %s -adce -S | grep BB1 7 br i1 %C, label %BB1, label %BB2 9 BB1: ; preds = %0 12 BB2: ; preds = %BB1, %0 13 %R = phi i32 [ %A, %0 ], [ %B, %BB1 ] ; <i32> [#uses=1]
|
/external/llvm/test/Transforms/LoopVectorize/ |
phi-hang.ll | 6 br label %bb1 8 bb1: ; preds = %bb5, %bb 13 bb3: ; preds = %bb1 19 bb5: ; preds = %bb4, %bb1 20 %tmp6 = phi i32 [ 0, %bb4 ], [ %tmp, %bb1 ] 21 %tmp7 = phi i32 [ 0, %bb4 ], [ %tmp6, %bb1 ] 22 %tmp8 = phi i32 [ 0, %bb4 ], [ %tmp, %bb1 ] 25 br i1 %tmp10, label %bb11, label %bb1 34 br label %bb1 36 bb1: ; preds = %bb1, %b [all...] |
/external/llvm/test/Analysis/PostDominators/ |
pr1098.ll | 6 br i1 %x, label %bb1, label %bb0 9 bb1: ; preds = %entry 11 bb2: ; preds = %bb1
|
/external/llvm/test/CodeGen/PowerPC/ |
2008-06-23-LiveVariablesCrash.ll | 6 br i1 true, label %bb1, label %bb3 8 bb1: 14 %val1 = phi i32 [ 0, %bb1 ], [ %val2, %bb2 ] 18 i32 0, label %bb1 20 i32 2, label %bb1
|
/external/llvm/test/Analysis/ScalarEvolution/ |
2008-07-12-UnneededSelect2.ll | 12 bb: ; preds = %bb1, %bb.nph 13 %z.02 = phi i32 [ %1, %bb1 ], [ 1, %bb.nph ] ; <i32> [#uses=1] 14 %i.01 = phi i32 [ %2, %bb1 ], [ 1, %bb.nph ] ; <i32> [#uses=2] 17 br label %bb1 19 bb1: ; preds = %bb 21 br i1 %3, label %bb, label %bb1.bb2_crit_edge 23 bb1.bb2_crit_edge: ; preds = %bb1 24 %.lcssa = phi i32 [ %1, %bb1 ] ; <i32> [#uses=1] 27 bb2: ; preds = %bb1.bb2_crit_edge, %entr [all...] |
2008-11-18-LessThanOrEqual.ll | 12 bb: ; preds = %bb.nph, %bb1 13 %indvar = phi i32 [ 0, %bb.nph ], [ %indvar.next, %bb1 ] ; <i32> [#uses=2] 17 br label %bb1 19 bb1: ; preds = %bb 22 br i1 %phitmp, label %bb1.bb2_crit_edge, label %bb 24 bb1.bb2_crit_edge: ; preds = %bb1 27 bb2: ; preds = %bb1.bb2_crit_edge, %entry
|
2009-01-02-SignedNegativeStride.ll | 17 bb: ; preds = %bb1, %bb.nph 18 %g_16.tmp.0 = phi i16 [ %g_16.promoted, %bb.nph ], [ %2, %bb1 ] ; <i16> [#uses=1] 20 br label %bb1 22 bb1: ; preds = %bb 24 br i1 %3, label %bb1.bb2_crit_edge, label %bb 26 bb1.bb2_crit_edge: ; preds = %bb1 30 bb2: ; preds = %bb1.bb2_crit_edge, %entry
|
2008-12-15-DontUseSDiv.ll | 6 br label %bb1 8 bb: ; preds = %bb1 11 br label %bb1 13 bb1: ; preds = %bb, %entry 19 return: ; preds = %bb1
|
2008-11-18-Stride1.ll | 16 bb: ; preds = %bb.nph, %bb1 17 %indvar = phi i32 [ 0, %bb.nph ], [ %indvar.next, %bb1 ] ; <i32> [#uses=2] 21 br label %bb1 23 bb1: ; preds = %bb 26 br i1 %2, label %bb, label %bb1.bb2_crit_edge 28 bb1.bb2_crit_edge: ; preds = %bb1 29 %.lcssa = phi i32 [ %1, %bb1 ] ; <i32> [#uses=1] 32 bb2: ; preds = %bb1.bb2_crit_edge, %entry 33 %x_addr.0.lcssa = phi i32 [ %.lcssa, %bb1.bb2_crit_edge ], [ %x, %entry ] ; <i32> [#uses=1 [all...] |
2008-11-18-Stride2.ll | 15 bb: ; preds = %bb.nph, %bb1 16 %indvar = phi i32 [ 0, %bb.nph ], [ %indvar.next, %bb1 ] ; <i32> [#uses=2] 20 br label %bb1 22 bb1: ; preds = %bb 25 br i1 %2, label %bb1.bb2_crit_edge, label %bb 27 bb1.bb2_crit_edge: ; preds = %bb1 28 %.lcssa = phi i32 [ %1, %bb1 ] ; <i32> [#uses=1] 31 bb2: ; preds = %bb1.bb2_crit_edge, %entry 32 %x_addr.0.lcssa = phi i32 [ %.lcssa, %bb1.bb2_crit_edge ], [ %x, %entry ] ; <i32> [#uses=1 [all...] |
sext-iv-0.ll | 10 bb1.thread: 11 br label %bb1 13 bb1: ; preds = %bb1, %bb1.thread 14 %i.0.reg2mem.0 = phi i64 [ -128, %bb1.thread ], [ %8, %bb1 ] ; <i64> [#uses=3] 16 ; CHECK-NEXT: --> {-128,+,1}<%bb1> Exits: 127 19 ; CHECK-NEXT: --> {-128,+,1}<%bb1> Exits: 127 22 ; CHECK-NEXT: --> {-128,+,1}<%bb1> Exits: 12 [all...] |
sext-iv-1.ll | 2 ; RUN: | grep " --> (sext i. {.*,+,.*}<%bb1> to i64)" | count 5 11 bb1.thread: 12 br label %bb1 14 bb1: ; preds = %bb1, %bb1.thread 15 %i.0.reg2mem.0 = phi i64 [ -128, %bb1.thread ], [ %8, %bb1 ] ; <i64> [#uses=3] 27 br i1 %9, label %return, label %bb1 29 return: ; preds = %bb1 [all...] |
2008-12-08-FiniteSGE.ll | 4 bb1.thread: 5 br label %bb1 7 bb1: ; preds = %bb1, %bb1.thread 8 %indvar = phi i32 [ 0, %bb1.thread ], [ %indvar.next, %bb1 ] ; <i32> [#uses=4] 17 br i1 %4, label %bb2, label %bb1 19 bb2: ; preds = %bb1
|
/external/llvm/test/Transforms/SCCP/ |
apint-basictest.ll | 7 br i1 %B, label %BB1, label %BB2 8 BB1: 14 %Ret = phi i128 [%Val, %BB1], [2, %BB2]
|
/external/llvm/test/CodeGen/ARM/ |
2008-03-05-SxtInRegBug.ll | 5 br label %bb1 6 bb1: ; preds = %entry 10 bb2: ; preds = %bb1 12 bb3: ; preds = %bb1
|
/external/llvm/test/CodeGen/X86/ |
twoaddr-coalesce.ll | 7 bb1.thread: 8 br label %bb1 10 bb1: ; preds = %bb1, %bb1.thread 11 %i.0.reg2mem.0 = phi i32 [ 0, %bb1.thread ], [ %indvar.next, %bb1 ] ; <i32> [#uses=2] 18 br i1 %exitcond, label %bb2, label %bb1 20 bb2: ; preds = %bb1
|
2010-09-30-CMOV-JumpTable-PHI.ll | 25 i32 3, label %bb1.i 26 i32 4, label %bb1.i1237 27 i32 5, label %bb1.i1266 28 i32 6, label %bb1.i1275 29 i32 2, label %bb1.i1434 30 i32 8, label %bb1.i1523 31 i32 7, label %bb1.i1537 34 bb1.i: ; preds = %bb.i 37 bb1.i1237: ; preds = %bb.i 38 br i1 undef, label %bb.i1820, label %bb1.i124 [all...] |
/external/llvm/test/Transforms/ConstProp/ |
phi.ll | 8 br i1 %B, label %BB1, label %BB3 10 BB1: ; preds = %BB0 13 BB3: ; preds = %BB1, %BB0 14 %Ret = phi i32 [ 1, %BB0 ], [ 1, %BB1 ] ; <i32> [#uses=1]
|
/external/llvm/test/Transforms/IndVarSimplify/ |
loop_evaluate_6.ll | 16 bb: ; preds = %bb1, %bb.nph 17 %x_offs_addr.01 = phi i32 [ %1, %bb1 ], [ %x_offs, %bb.nph ] ; <i32> [#uses=1] 19 br label %bb1 21 bb1: ; preds = %bb 23 br i1 %2, label %bb, label %bb1.bb2_crit_edge 25 bb1.bb2_crit_edge: ; preds = %bb1 28 bb2: ; preds = %bb1.bb2_crit_edge, %entry 29 %x_offs_addr.0.lcssa = phi i32 [ %1, %bb1.bb2_crit_edge ], [ %x_offs, %entry ] ; <i32> [#uses=1]
|
/external/llvm/test/Transforms/GVN/ |
edge.ll | 7 br i1 %cmp, label %bb2, label %bb1 8 bb1: 11 %cond = phi i32 [ %x, %bb0 ], [ 0, %bb1 ] 22 br i1 %cmp, label %bb1, label %bb2 23 bb1: 26 %cond = phi i32 [ %x, %bb0 ], [ 0, %bb1 ] 36 switch i32 %x, label %bb1 [ i32 0, label %bb2] 37 bb1: 40 %cond = phi i32 [ %x, %bb0 ], [ 0, %bb1 ] 52 br i1 %y, label %bb2, label %bb1 [all...] |
/external/llvm/test/Transforms/SimplifyCFG/ |
PR16069.ll | 7 br i1 %y, label %bb1, label %bb2 8 bb1: 13 %cond.i = phi i32 [ 0, %bb1 ], [ srem (i32 1, i32 zext (i1 icmp eq (i32* @b, i32* null) to i32)), %bb2 ] 21 br i1 %x, label %bb1, label %bb2 22 bb1: 25 %cond = phi i32 [ 0, %bb1 ], [ srem (i32 1, i32 zext (i1 icmp eq (i32* @b, i32* null) to i32)), %bb0 ] 26 ; CHECK: %cond = phi i32 [ 0, %bb1 ], [ srem (i32 1, i32 zext (i1 icmp eq (i32* @b, i32* null) to i32)), %bb0 ]
|