/external/llvm/test/CodeGen/X86/ |
licm-nested.ll | 13 br i1 %cmp, label %while.cond.preheader, label %bb.nph53 15 while.cond.preheader: ; preds = %entry 27 bb.nph53: ; preds = %entry, %while.cond.preheader 28 %NUM.0.ph80 = phi i32 [ %call, %while.cond.preheader ], [ 17000, %entry ] ; <i32> [#uses=1] 82 while.end: ; preds = %while.cond.loopexit, %while.cond.preheader 83 %count.0.lcssa = phi i32 [ 0, %while.cond.preheader ], [ %count.1, %while.cond.loopexit ] ; <i32> [#uses=1]
|
2006-10-12-CycleInDAG.ll | 14 br i1 false, label %cond_next196, label %bb12.preheader 16 bb12.preheader: ; preds = %0
|
coalesce-implicitdef.ll | 89 if.end30: ; preds = %for.inc27.if.end30.loopexit56_crit_edge, %label.loopexit, %label.preheader, %for.inc 90 %i.0.load46 = phi i32 [ 0, %for.inc ], [ %i.0.load4669, %label.preheader ], [ %i.0.load4669, %label.loopexit ], [ %i.0.load4669, %for.inc27.if.end30.loopexit56_crit_edge ] 91 %pi.4 = phi i32* [ %i, %for.inc ], [ %pi.3.ph, %label.preheader ], [ %pi.3.ph, %label.loopexit ], [ %pi.3.ph, %for.inc27.if.end30.loopexit56_crit_edge ] 94 br i1 %tobool31, label %for.inc34, label %label.preheader 105 br i1 %tobool37, label %label.preheader, label %land.rhs 109 br label %label.preheader 111 label.preheader: ; preds = %for.end36, %if.end30, %land.rhs 120 while.condthread-pre-split.lr.ph.lr.ph: ; preds = %label.preheader
|
optimize-max-0.ll | 16 br i1 %cond, label %bb29, label %bb10.preheader 18 bb10.preheader: ; preds = %entry 22 bb.nph7: ; preds = %bb7.preheader 49 bb9: ; preds = %bb7.preheader, %bb7.bb9_crit_edge 55 br i1 %exitcond12, label %bb7.preheader, label %bb10.bb18.loopexit_crit_edge 63 bb.nph9: ; preds = %bb10.preheader 68 br label %bb7.preheader 70 bb7.preheader: ; preds = %bb.nph9.split, %bb10 132 bb18.loopexit: ; preds = %bb10.bb18.loopexit_crit_edge.split, %bb10.preheader 241 br i1 %cond, label %bb29, label %bb10.preheader [all...] |
2007-03-15-GEP-Idx-Sink.ll | 7 br i1 %0, label %bb.preheader, label %return 9 bb.preheader: ; preds = %entry 19 bb: ; preds = %bb, %bb.preheader 20 %i.073.0 = phi i32 [ 0, %bb.preheader ], [ %indvar.next, %bb ] ; <i32> [#uses=3]
|
2012-02-20-MachineCPBug.ll | 17 br i1 %cmp.i, label %for.cond.preheader.i, label %if.end.i 19 for.cond.preheader.i: ; preds = %entry 24 for.body.lr.ph.i: ; preds = %for.cond.preheader.i 44 for.body9.lr.ph.i: ; preds = %if.end.i, %for.cond.preheader.i
|
optimize-max-3.ll | 13 br i1 %cmp6, label %for.end, label %for.body.preheader 15 for.body.preheader: ; preds = %entry 21 for.body: ; preds = %for.body.preheader, %for.body 22 %i = phi i64 [ %i.next, %for.body ], [ 0, %for.body.preheader ] ; <i64> [#uses=2]
|
/external/llvm/test/Transforms/LoopStrengthReduce/ |
2012-01-16-nopreheader.ll | 9 ; has no with no preheader. 39 indirectbr i8* undef, [label %while.cond238.preheader, label %lor.lhs.false227] 42 indirectbr i8* undef, [label %while.cond238.preheader, label %if.else] 44 while.cond238.preheader: ; preds = %lor.lhs.false227, %if.end221 48 while.cond238: ; preds = %land.rhs243, %while.cond238.preheader 49 %1 = phi i64 [ %indvar.next15, %land.rhs243 ], [ 0, %while.cond238.preheader ]
|
/external/llvm/test/CodeGen/Generic/ |
2006-01-12-BadSetCCFold.ll | 28 br i1 %tmp.14.i1134.i.i, label %no_exit.i.preheader.i.i, label %make_tables.exit.i 30 no_exit.i.preheader.i.i: ; preds = %fill_table.exit22.i.i
|
2006-09-02-LocalAllocCrash.ll | 30 br i1 false, label %cond_next518, label %cond_true397.preheader 35 cond_true397.preheader: ; preds = %cond_true298 69 br i1 false, label %bb1567, label %cond_true1369.preheader 77 cond_true1369.preheader: ; preds = %cond_true1254
|
2008-02-26-NegatableCrash.ll | 16 i32 0, label %bb244.preheader 17 i32 1, label %bb279.preheader 20 bb279.preheader: ; preds = %entry 23 bb244.preheader: ; preds = %entry
|
2009-11-16-BadKillsCrash.ll | 29 to label %bb26.preheader unwind label %lpad ; <i32> [#uses=0] 31 bb26.preheader: ; preds = %invcont8 59 invcont38: ; preds = %invcont25, %bb1.i, %bb.i97, %bb26.preheader 60 %__extracted.0 = phi i32 [ 0, %bb26.preheader ], [ undef, %invcont25 ], [ %2, %bb.i97 ], [ %2, %bb1.i ] ; <i32> [#uses=1]
|
/external/llvm/test/Transforms/IndVarSimplify/ |
eliminate-comparison.ll | 124 br i1 %tmp5, label %noassert, label %forcond38.preheader 126 forcond38.preheader: ; preds = %forcond 141 forcond38: ; preds = %noassert68, %forcond38.preheader 142 %__key8.0 = phi i32 [ %tmp81, %noassert68 ], [ 2, %forcond38.preheader ] 175 br i1 %tmp5, label %noassert, label %forcond38.preheader 177 forcond38.preheader: ; preds = %forcond 192 forcond38: ; preds = %noassert68, %forcond38.preheader 193 %__key8.0 = phi i32 [ %tmp81, %noassert68 ], [ 2, %forcond38.preheader ]
|
ult-sub-to-eq.ll | 31 ; First check that we move the sub into the preheader, it doesn't have to be 33 ; CHECK: for.body.preheader:
|
/external/llvm/test/Transforms/LoopSimplify/ |
2003-05-12-PreheaderExitOfChild.ll | 1 ; This (complex) testcase causes an assertion failure because a preheader is 3 ; to be the preheader instead of the exit loop itself.
|
2011-12-14-LandingpadHeader.ll | 11 ; CHECK: catch.preheader:
|
/external/llvm/test/CodeGen/ARM/ |
2009-06-15-RegScavengerAssert.ll | 130 br i1 undef, label %bb1.i81.i.preheader, label %bb.i173 135 bb1.i81.i.preheader: ; preds = %flag_CleanStore3464.exit 136 br i1 undef, label %bb1.i64.i.preheader, label %bb5.i179 138 bb5.i179: ; preds = %bb1.i81.i.preheader 141 bb1.i64.i.preheader: ; preds = %bb1.i81.i.preheader 144 bb.i9.i: ; preds = %bb1.i64.i.preheader 147 dfg_DeleteProofList.exit.i: ; preds = %bb1.i64.i.preheader 328 br i1 undef, label %sort_ApproxStaticSortTheory.exit, label %bb.i5.i2185.preheader 330 bb.i5.i2185.preheader: ; preds = %bb8.i217 [all...] |
2007-04-02-RegScavengerAssert.ll | 28 br i1 false, label %bb.preheader, label %return 30 bb.preheader: ; preds = %entry 42 cond_next.us: ; preds = %bb.preheader 48 bb: ; preds = %bb.preheader
|
2009-07-22-ScavengerAssert.ll | 71 br i1 undef, label %bb25, label %bb43.preheader 73 bb43.preheader: ; preds = %bb22 79 bb28: ; preds = %bb43.preheader 82 bb45: ; preds = %bb43.preheader, %cli_calloc.exit54
|
2009-07-22-SchedulerAssert.ll | 76 br i1 %7, label %bb25, label %bb43.preheader 78 bb43.preheader: ; preds = %bb22 84 bb28: ; preds = %bb43.preheader 87 bb45: ; preds = %bb43.preheader, %cli_calloc.exit54
|
/external/llvm/test/Analysis/ScalarEvolution/ |
unsimplified-loop.ll | 3 ; This loop has no preheader, multiple backedges, etc., but ScalarEvolution
|
/external/llvm/test/Transforms/LICM/ |
no-preheader-test.ll | 1 ; Test that LICM works when there is not a loop-preheader
|
/external/llvm/test/Transforms/GVN/ |
crash.ll | 10 br i1 undef, label %if.end13, label %while.body.preheader 14 br label %while.body.preheader 16 while.body.preheader: ; preds = %if.end13, %if.end 19 while.body: ; preds = %while.body.backedge, %while.body.preheader 20 %o.addr.0 = phi i32* [ undef, %while.body.preheader ], [ %o.addr.0.be, %while.body.backedge ] ; <i32*> [#uses=2] 76 bb69.i: ; preds = %bb57.i.preheader 81 bb65.i: ; preds = %bb65.i.preheader, %bb64.i
|
/external/llvm/test/Transforms/LoopVectorize/X86/ |
small-size.ll | 55 br i1 %1, label %.lr.ph5, label %.preheader 59 br label %.preheader 61 .preheader: ; preds = %..preheader_crit_edge, %0 75 .lr.ph: ; preds = %.preheader, %.lr.ph 76 %indvars.iv = phi i64 [ %indvars.iv.next, %.lr.ph ], [ %i.0.lcssa, %.preheader ] 77 %.02 = phi i32 [ %4, %.lr.ph ], [ %n, %.preheader ] 90 ._crit_edge: ; preds = %.lr.ph, %.preheader
|
/external/llvm/lib/CodeGen/ |
MachineLICM.cpp | 81 MachineBasicBlock *CurPreheader; // The preheader for CurLoop. 99 // Register pressure on path leading from loop preheader to current BB. 161 /// invariants out to the preheader. 212 /// effect of hoisting MI from the current block to the preheader. 251 /// of the preheader to initialize the starting "register pressure". Note 271 /// the preheader that compute the same value. If it's found, do a RAU on 273 /// the instruction to the preheader. 284 bool Hoist(MachineInstr *MI, MachineBasicBlock *Preheader); 287 /// current loop preheader that may become duplicates of instructions that 291 /// getCurPreheader - Get the preheader for the current loop, splittin [all...] |