| /external/llvm/test/CodeGen/PowerPC/ |
| 2008-07-15-Bswap.ll | 163 br i1 %41, label %labelContinueEdgesLoopV, label %bb210.preheader
165 bb210.preheader: ; preds = %bb206
255 bb297: ; preds = %bb210.preheader
258 bb298: ; preds = %bb297, %bb210.preheader
259 %vu8Mask_0.1 = phi i8 [ -1, %bb297 ], [ 0, %bb210.preheader ] ; <i8> [#uses=1]
260 %vu8Mask_1.1 = phi i8 [ -1, %bb297 ], [ 0, %bb210.preheader ] ; <i8> [#uses=1]
261 %vu8Mask_2.1 = phi i8 [ -1, %bb297 ], [ 0, %bb210.preheader ] ; <i8> [#uses=0]
262 %vu8Mask_3.1 = phi i8 [ -1, %bb297 ], [ 0, %bb210.preheader ] ; <i8> [#uses=1]
263 %vu8Mask_4.1 = phi i8 [ 0, %bb297 ], [ 0, %bb210.preheader ] ; <i8> [#uses=0]
264 %vu8Mask_5.1 = phi i8 [ 0, %bb297 ], [ 0, %bb210.preheader ] ; <i8> [#uses=1
[all...] |
| 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/lib/Transforms/Scalar/ |
| LICM.cpp | 12 // code into the preheader block, or by sinking code to the exit blocks if it is
111 BasicBlock *Preheader; // The preheader block of the current loop...
235 // Get the preheader block to move instructions into...
236 Preheader = L->getLoopPreheader();
270 if (Preheader)
275 if (!DisablePromotion && Preheader && L->hasDedicatedExits()) {
287 Preheader = 0;
376 // Try hoisting the instruction out to the preheader. We can only do this
601 DEBUG(dbgs() << "LICM hoisting to " << Preheader->getName() << ":
[all...] |
| LoopRotation.cpp | 98 /// old header into the preheader. If there were uses of the values produced by
122 // The value now exits in two versions: the initial value in the preheader
346 // execution in the preheader, but does prevent the instruction from
406 // the loop into the preheader we've simplified instructions and the
422 // by the original loop preheader. Conceptually the header was merged
423 // into the preheader, even though we reuse the actual block as a new
440 // thus is not a preheader anymore.
441 // Split the edge to form a real preheader.
450 // We can fold the conditional branch in the preheader, this makes things
494 assert(L->getLoopPreheader() && "Invalid loop preheader after loop rotation")
[all...] |
| /external/llvm/test/CodeGen/X86/ |
| pr3154.ll | 41 br label %bb28.preheader
45 br label %bb28.preheader
47 bb28.preheader: ; preds = %bb22, %bb20
51 bb27: ; preds = %bb27, %bb28.preheader
52 %j4.042 = phi i32 [ 0, %bb28.preheader ], [ %indvar.next45, %bb27 ] ; <i32> [#uses=2]
60 bb29: ; preds = %bb27, %bb28.preheader
|
| loop-strength-reduce-2.ll | 4 ; Make sure the common loop invariant A is hoisted up to preheader,
|
| lsr-i386.ll | 32 bb2: ; preds = %bb2, %bb2.preheader
|
| store_op_load_fold2.ll | 8 cond_true2732.preheader: ; preds = %entry
|
| 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
|
| 2012-11-30-misched-dbg.ll | 31 br label %for.cond1710.preheader
36 for.cond1710.preheader: ; preds = %if.then588
39 for.cond1710: ; preds = %for.cond1710, %for.cond1710.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]
|
| /external/llvm/lib/Target/PowerPC/ |
| PPCCTRLoops.cpp | 639 MachineBasicBlock *Preheader = L->getLoopPreheader();
640 // No preheader means there's not place for the loop instr.
641 if (Preheader == 0) {
644 MachineBasicBlock::iterator InsertPos = Preheader->getFirstTerminator();
647 if (InsertPos != Preheader->end())
691 BuildMI(*Preheader, InsertPos, dl,
696 BuildMI(*Preheader, InsertPos, dl,
710 BuildMI(*Preheader, InsertPos, dl,
715 BuildMI(*Preheader, InsertPos, dl,
719 BuildMI(*Preheader, InsertPos, dl
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| LoopInfoImpl.h | 113 /// getLoopPreheader - If there is a preheader for this loop, return it. A
114 /// loop has a preheader if there is only one edge to the header of the loop
116 /// header of the loop is the preheader node.
118 /// This method returns null if there is no preheader for the loop.
126 // Make sure there is only one exit out of the preheader.
131 return 0; // Multiple exits from the block, must not be a preheader.
133 // The predecessor has exactly one successor, so it is a preheader.
139 /// This is less strict that the loop "preheader" concept, which requires
161 // Make sure there is only one exit out of the preheader.
|
| LoopInfo.h | 21 // * whether there is a preheader for the loop
180 // be a preheader, etc). For best success, the loop simplification and
209 /// getLoopPreheader - If there is a preheader for this loop, return it. A
210 /// loop has a preheader if there is only one edge to the header of the loop
212 /// header of the loop is the preheader node.
214 /// This method returns null if there is no preheader for the loop.
220 /// This is less strict that the loop "preheader" concept, which requires
342 /// If null, the terminator of the loop preheader is used.
354 /// If null, the terminator of the loop preheader is used.
|
| /external/llvm/test/CodeGen/Generic/ |
| 2006-03-01-dagcombineinfloop.ll | 25 br i1 %tmp915, label %return, label %cond_true92.preheader
71 cond_true92.preheader: ; preds = %entry
81 cond_true92: ; preds = %cond_true92.preheader, %cond_next84, %cond_true34
82 %t.0.0 = phi %struct.tree_node* [ %parms, %cond_true92.preheader ], [ %tmp6, %cond_true34 ], [ %tmp6, %cond_next84 ] ; <%struct.tree_node*> [#uses=2]
|
| /external/llvm/test/Transforms/IndVarSimplify/ |
| 2011-11-15-multiexit.ll | 4 ; loop-invariant gep computed in the preheader. This was incorrect
|
| /external/llvm/test/Transforms/LoopStrengthReduce/ |
| share_code_in_preheader.ll | 2 ; LSR should not make two copies of the Q*L expression in the preheader!
|
| /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
|
| /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/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
|
