| /external/llvm/test/Transforms/LoopStrengthReduce/ |
| 2013-01-05-IndBr.ll | 3 ; Indirect branch in the preheader crashes replaceCongruentIVs.
|
| 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/X86/ |
| reduction-crash.ll | 9 ; CHECK: preheader
|
| /external/chromium/chrome/browser/password_manager/ |
| ie7_password.cc | 19 struct PreHeader {
45 PreHeader pre_header; // Contains the size of the different sections.
63 if (information->pre_header.pre_header_size != sizeof(PreHeader))
|
| /external/chromium_org/components/webdata/encryptor/ |
| ie7_password_win.cc | 20 struct PreHeader {
45 PreHeader pre_header; // Contains the size of the different sections.
62 if (information->pre_header.pre_header_size != sizeof(PreHeader))
|
| /external/llvm/test/CodeGen/ARM/ |
| 2009-02-16-SpillerBug.ll | 22 RESUME: ; preds = %bb520.preheader, %entry
109 br i1 %2, label %bb520.preheader, label %bb499
111 bb520.preheader: ; preds = %bb499
|
| 2010-11-15-SpillEarlyClobber.ll | 22 br i1 undef, label %bb10.preheader.i, label %bb.i
24 bb10.preheader.i: ; preds = %bb.i
27 bb10.i: ; preds = %bb10.i, %bb10.preheader.i
|
| 2008-04-10-ScavengerAssert.ll | 28 br i1 false, label %bb220.i.i.i, label %bb62.preheader.i.i.i
29 bb62.preheader.i.i.i: ; preds = %cond_next48
130 br i1 false, label %bb65.preheader.i, label %bb78.i
131 bb65.preheader.i: ; preds = %bb34.i
133 bb65.outer.us.i: ; preds = %bb65.outer.us.i, %bb65.preheader.i
136 br i1 false, label %bb151.i.preheader, label %bb90.i
139 bb151.i.preheader: ; preds = %bb78.i
141 bb151.i: ; preds = %bb226.backedge.i, %bb151.i.preheader
142 %i.154.i = phi i32 [ %tmp15747.i, %bb226.backedge.i ], [ 0, %bb151.i.preheader ] ; <i32> [#uses=2]
162 br i1 %tmp21153.i, label %bb190.preheader.i, label %cond_next215.
[all...] |
| coalesce-dbgvalue.ll | 19 for.cond1.preheader:
52 for.cond1.outer: ; preds = %land.end, %for.cond1.preheader
53 %storemerge11.ph = phi i32 [ %inc8, %land.end ], [ 0, %for.cond1.preheader ]
54 %e.1.ph = phi i64 [ %phitmp, %land.end ], [ 0, %for.cond1.preheader ]
|
| /external/llvm/test/CodeGen/X86/ |
| 2008-02-27-DeadSlotElimBug.ll | 41 br i1 false, label %bb58.preheader, label %bb81
43 bb58.preheader: ; preds = %bb35
47 bb58: ; preds = %bb58, %bb58.preheader
|
| 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
|
| 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
|
| 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
|
| /external/llvm/lib/Transforms/Scalar/ |
| LoopIdiomRecognize.cpp | 85 /// preheader) from the given preheader.
278 // A typical usage of this function is to check if the preheader function is
280 // the preheader and be placed at the end of the precondition block without
332 // It should have a preheader containing nothing but a goto instruction.
534 // it back from the precondition block to the preheader.
[all...] |
| 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 | 99 /// old header into the preheader. If there were uses of the values produced by
123 // The value now exits in two versions: the initial value in the preheader
362 // execution in the preheader, but does prevent the instruction from
422 // the loop into the preheader we've simplified instructions and the
438 // by the original loop preheader. Conceptually the header was merged
439 // into the preheader, even though we reuse the actual block as a new
456 // thus is not a preheader anymore.
457 // Split the edge to form a real preheader.
466 // We can fold the conditional branch in the preheader, this makes things
510 assert(L->getLoopPreheader() && "Invalid loop preheader after loop rotation")
[all...] |
| /external/llvm/test/Transforms/LoopUnroll/ |
| scevunroll.ll | 148 br i1 false, label %for.inc, label %for.body38.preheader
150 for.body38.preheader:
154 %i.113 = phi i32 [ %inc76, %for.inc74 ], [ 0, %for.body38.preheader ]
167 br i1 false, label %for.body38, label %for.body87.preheader
169 for.body87.preheader:
|
| /external/llvm/test/Transforms/SLPVectorizer/X86/ |
| crash_smallpt.ll | 28 br label %for.cond36.preheader
30 for.cond36.preheader: ; preds = %_Z5clampd.exit.1, %arrayctor.cont
58 for.body42.lr.ph.us: ; preds = %for.cond36.preheader
61 _Z5clampd.exit.1: ; preds = %for.cond36.preheader
62 br label %for.cond36.preheader
|
| /external/llvm/lib/Transforms/Utils/ |
| LoopUnrollRuntime.cpp | 77 // Adding a value to the new PHI node from the original loop preheader.
146 BasicBlock *Preheader = L->getLoopPreheader();
172 // We replace the first phi node with the value from the preheader
173 VMap[I] = NewPHI->getIncomingValueForBlock(Preheader);
271 // It helps to splits the original preheader twice, one for the end of the
272 // prolog code and one for a new loop preheader
298 "CFG edges in Preheader are not correct");
|
| /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...] |
| /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.
|
| /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
|
