/external/llvm/test/Transforms/LoopVectorize/ |
runtime-check.ll | 12 ;CHECK: for.body.preheader:
|
/external/llvm/test/CodeGen/ARM/ |
2008-04-04-ScavengerAssert.ll | 16 br i1 false, label %bb220.i.i.i, label %bb62.preheader.i.i.i 17 bb62.preheader.i.i.i: ; preds = %bb47.i.i.i
|
2009-06-04-MissingLiveIn.ll | 241 br i1 undef, label %bb211.preheader, label %bb214 243 bb211.preheader: ; preds = %bb198 246 bb211: ; preds = %bb211, %bb211.preheader
|
2008-04-11-PHIofImpDef.ll | 737 bb5295.i: ; preds = %bb5295.preheader.i, %storeVecColor_RGB_UI.exit [all...] |
/external/llvm/test/CodeGen/PowerPC/ |
2011-12-06-SpillAndRestoreCR.ll | 39 br label %for.cond5.preheader 41 for.cond5.preheader: ; preds = %for.inc15, %for.body 48 for.body7: ; preds = %for.body7, %for.cond5.preheader 49 %indvars.iv = phi i64 [ 0, %for.cond5.preheader ], [ %indvars.iv.next.15, %for.body7 ] 50 %max.235 = phi float [ %max.139, %for.cond5.preheader ], [ %max.3.15, %for.body7 ] 51 %xindex.234 = phi i32 [ %xindex.138, %for.cond5.preheader ], [ %xindex.3.15, %for.body7 ] 52 %yindex.233 = phi i32 [ %yindex.137, %for.cond5.preheader ], [ %yindex.3.15, %for.body7 ] 190 br i1 %exitcond, label %for.end17, label %for.cond5.preheader
|
ctrloop-s000.ll | 30 br label %for.cond1.preheader 32 for.cond1.preheader: ; preds = %for.end, %entry 36 for.body3: ; preds = %for.body3, %for.cond1.preheader 37 %indvars.iv = phi i64 [ 0, %for.cond1.preheader ], [ %indvars.iv.next.15, %for.body3 ] 142 br i1 %exitcond, label %for.end8, label %for.cond1.preheader
|
/external/llvm/test/CodeGen/X86/ |
misched-new.ll | 24 br i1 undef, label %for.cond.preheader, label %if.end 26 for.cond.preheader: ; preds = %entry
|
2008-04-28-CoalescerBug.ll | 17 i32 18, label %bb13086.preheader 20 bb13086.preheader: ; preds = %entry 28 bb13088: ; preds = %bb13572, %bb13567, %bb13107, %bb13086.preheader
|
multiple-loop-post-inc.ll | 85 br i1 %3, label %bb6.preheader, label %bb8 87 bb6.preheader: ; preds = %bb4 90 bb.nph43: ; preds = %bb6.preheader 156 bb7: ; preds = %bb6.bb7_crit_edge, %bb6.preheader 157 %I_addr.1.lcssa = phi float* [ %scevgep110, %bb6.bb7_crit_edge ], [ %I_addr.0, %bb6.preheader ] ; <float*> [#uses=1] 158 %O_addr.1.lcssa = phi float* [ %scevgep125, %bb6.bb7_crit_edge ], [ %O_addr.0, %bb6.preheader ] ; <float*> [#uses=1] 159 %vX0.0.lcssa = phi <4 x float> [ %41, %bb6.bb7_crit_edge ], [ %31, %bb6.preheader ] ; <<4 x float>> [#uses=1] 160 %N_addr.1.lcssa = phi i64 [ %tmp136, %bb6.bb7_crit_edge ], [ %N_addr.0, %bb6.preheader ] ; <i64> [#uses=1]
|
scev-interchange.ll | 287 br i1 undef, label %bb16.preheader.i.i, label %bb8.i.i 295 br i1 undef, label %bb7.i215.i, label %bb16.preheader.i.i 297 bb15.i.i: ; preds = %bb16.preheader.i.i, %bb15.i.i 298 %j1.0212.i.i = phi i32 [ %1, %bb15.i.i ], [ 0, %bb16.preheader.i.i ] ; <i32> [#uses=2] 305 bb17.i.i: ; preds = %bb16.preheader.i.i, %bb15.i.i 306 br label %bb16.preheader.i.i 308 bb16.preheader.i.i: ; preds = %bb17.i.i, %bb9.i216.i, %bb7.i215.i
|
2007-10-15-CoalescerCrash.ll | 307 br i1 false, label %cond_false759.preheader, label %cond_false149.preheader 309 cond_false149.preheader: ; preds = %entry 312 cond_false759.preheader: ; preds = %entry 318 cond_true794: ; preds = %cond_false759.preheader 321 cond_next873: ; preds = %cond_false759.preheader
|
crash.ll | 402 br i1 undef, label %return, label %while.body.preheader 404 while.body.preheader: ; preds = %entry 407 if.then3: ; preds = %while.body.preheader 419 if.end7: ; preds = %if.then.i256, %land.lhs.true.i255, %if.then3, %while.body.preheader
|
/external/llvm/test/Transforms/GVN/ |
2009-01-22-SortInvalidation.ll | 81 bb59: ; preds = %bb63.preheader 85 bb65: ; preds = %bb63.preheader, %bb59 87 br i1 false, label %bb67, label %bb63.preheader 96 br label %bb63.preheader 98 bb63.preheader: ; preds = %bb69.loopexit, %bb65
|
/external/llvm/include/llvm/Analysis/ |
LoopInfo.h | 21 // * whether there is a preheader for the loop 181 // be a preheader, etc). For best success, the loop simplification and 210 /// getLoopPreheader - If there is a preheader for this loop, return it. A 211 /// loop has a preheader if there is only one edge to the header of the loop 213 /// header of the loop is the preheader node. 215 /// This method returns null if there is no preheader for the loop. 221 /// This is less strict that the loop "preheader" concept, which requires 343 /// If null, the terminator of the loop preheader is used. 355 /// If null, the terminator of the loop preheader is used.
|
/external/llvm/test/Transforms/CodeGenPrepare/ |
2008-11-24-RAUW-Self.ll | 69 br label %bb7.preheader 93 br label %bb7.preheader 105 br label %bb7.preheader 107 bb7.preheader: ; preds = %bb7.i180.bb7_crit_edge, %bb11.i172, %bb1.i.bb7_crit_edge 113 bb7: ; preds = %addflt.exit114, %bb7.preheader 351 br label %bb15.preheader 354 br label %bb15.preheader 356 bb15.preheader: ; preds = %bb10.i58, %bb9.i56 359 bb15: ; preds = %addflt.exit, %bb15.preheader
|
/external/llvm/test/Transforms/LCSSA/ |
2006-10-31-UnreachableBlock.ll | 7 br label %loopentry.preheader 8 loopentry.preheader: ; preds = %dead_block_after_break, %entry 11 loopentry: ; preds = %endif.1, %loopentry.preheader 161 br label %loopentry.preheader
|
/external/llvm/test/Transforms/SLPVectorizer/X86/ |
hoist.ll | 15 ; preheader:
|
/external/llvm/lib/Transforms/Scalar/ |
LoopUnswitch.cpp | 144 // preheader of the loop, the body of the loop, and the exit blocks of the 414 // If LoopSimplify was unable to form a preheader, don't do any unswitching. 720 // First step, split the preheader, so that we know that there is a safe place 730 // that the jump from the preheader can execute the contents of the exit block 732 // loop header, not the preheader). 792 // First step, split the preheader and exit blocks, and add these blocks to 797 // We want the loop to come after the preheader, but before the exit blocks. 815 // the loop preheader and exit blocks), keeping track of the mapping between 828 // original preheader. [all...] |
/external/llvm/lib/Analysis/ |
LoopInfo.cpp | 85 /// If null, the terminator of the loop preheader is used. 101 /// If null, the terminator of the loop preheader is used. 117 BasicBlock *Preheader = getLoopPreheader(); 118 // Without a preheader, hoisting is not feasible. 119 if (!Preheader) 121 InsertPt = Preheader->getTerminator(); 212 // Normal-form loops have a preheader, a single backedge, and all of their
|
/external/chromium_org/v8/src/ |
hydrogen-bch.cc | 220 // Check that the limit is defined in the loop preheader. 234 // Check that the length is defined in the loop preheader. 286 // If necessary, redefine the limit in the preheader.
|
/external/llvm/test/Transforms/LoopRotate/ |
multiple-exits.ll | 36 ; CHECK: for.cond1.preheader: 41 ; CHECK: %sum.1 = phi i32 [ %add, %land.rhs ], [ %sum.04, %for.cond1.preheader ] 42 ; CHECK: %i.1 = phi i32 [ %inc, %land.rhs ], [ 0, %for.cond1.preheader ]
|
/external/llvm/include/llvm/CodeGen/ |
MachineLoopInfo.h | 20 // * whether there is a preheader for the loop
|
/external/llvm/lib/Transforms/Utils/ |
LoopUnroll.cpp | 142 BasicBlock *Preheader = L->getLoopPreheader(); 143 if (!Preheader) { 144 DEBUG(dbgs() << " Can't unroll; loop preheader-insertion failed.\n"); 334 PN->replaceAllUsesWith(PN->getIncomingValueForBlock(Preheader));
|
/external/llvm/test/CodeGen/Generic/ |
2007-05-15-InfiniteRecursion.ll | 61 br i1 false, label %cond_true356.i.preheader, label %bb359.i 63 cond_true356.i.preheader: ; preds = %cond_false785 67 cond_false.i: ; preds = %cond_true356.i.preheader 70 cond_next159.i: ; preds = %cond_true356.i.preheader
|
/external/llvm/test/CodeGen/Thumb2/ |
cross-rc-coalescing-2.ll | 14 ; Loop preheader
|