| /external/llvm/test/Transforms/LoopVectorize/ |
| if-pred-stores.ll | 68 %indvars.iv = phi i64 [ 0, %entry ], [ %indvars.iv.next, %for.inc ]
89 ; because we did not update the phi nodes with the proper predecessor in the
105 %indvars.iv3 = phi i64 [ %indvars.iv.next4, %for.inc23 ], [ undef, %for.body9 ]
106 %iNewChunks.120 = phi i32 [ %iNewChunks.2, %for.inc23 ], [ undef, %for.body9 ]
117 %iNewChunks.2 = phi i32 [ %inc21, %if.then18 ], [ %iNewChunks.120, %for.body14 ]
124 %iNewChunks.1.lcssa = phi i32 [ undef, %for.body9 ], [ %iNewChunks.2, %for.inc23 ]
|
| /external/llvm/lib/Transforms/Scalar/ |
| IndVarSimplify.cpp | 192 /// loop. For PHI nodes, there may be multiple uses, so compute the nearest
196 PHINode *PHI = dyn_cast<PHINode>(User);
197 if (!PHI)
201 for (unsigned i = 0, e = PHI->getNumIncomingValues(); i != e; ++i) {
202 if (PHI->getIncomingValue(i) != Def)
205 BasicBlock *InsertBB = PHI->getIncomingBlock(i);
213 assert(InsertPt && "Missing phi operand");
263 // If this is not an add of the PHI with a constantfp, or if the constant fp
489 // Because of LCSSA, these values will only occur in LCSSA PHI Nodes. Scan
494 // If there are no PHI nodes in this exit block, then no values define
[all...] |
| /dalvik/dx/src/com/android/dx/ssa/ |
| SsaConverter.java | 32 * Returns an SSA representation, edge-split and with phi
56 * or phi placement since no actual control flows to it.
64 * Updates an SSA representation, placing phi functions and renaming all
97 * phi placement run.
129 * inserted correctly when phi statements are removed.
278 * Place Phi functions in appropriate locations.
302 // Bit set of registers vs block index "phi placement sites"
340 * For each register, compute all locations for phi placement
|
| /external/dexmaker/src/dx/java/com/android/dx/ssa/ |
| SsaConverter.java | 33 * Returns an SSA representation, edge-split and with phi
57 * or phi placement since no actual control flows to it.
65 * Updates an SSA representation, placing phi functions and renaming all
98 * phi placement run.
130 * inserted correctly when phi statements are removed.
279 * Place Phi functions in appropriate locations.
303 // Bit set of registers vs block index "phi placement sites"
341 * For each register, compute all locations for phi placement
|
| /external/llvm/examples/OCaml-Kaleidoscope/Chapter6/ |
| codegen.ml | 85 * phi. We create a new name because one is used for the phi node, and the
95 * phi. *)
102 let phi = build_phi incoming "iftmp" builder in var
116 phi
134 (* Start the PHI node with an entry for start. *)
137 (* Within the loop, the variable is defined equal to the PHI node. If it
177 (* Add a new entry to the PHI node for the backedge. *)
|
| /external/llvm/lib/CodeGen/ |
| PHIEliminationUtils.cpp | 1 //===-- PHIEliminationUtils.cpp - Helper functions for PHI elimination ----===//
57 // Make sure the copy goes after any phi nodes however.
|
| /external/llvm/test/Analysis/BasicAA/ |
| 2006-03-03-BadArraySubscript.ll | 14 %i.0.0 = phi i32 [ 0, %entry ], [ %inc, %no_exit ] ; <i32> [#uses=2]
27 %Y.0.1 = phi i32 [ 0, %entry ], [ %tmp.13, %no_exit ] ; <i32> [#uses=1]
|
| /external/llvm/test/Analysis/BlockFrequencyInfo/ |
| bad_input.ll | 15 %i = phi i32 [ 0, %entry ], [ %inc, %for.body ]
38 %i = phi i32 [ 0, %entry ], [ %inc, %for.body ]
|
| /external/llvm/test/Analysis/Delinearization/ |
| iv_times_constant_in_subscript.ll | 22 %i = phi i64 [ 0, %entry ], [ %i.inc, %for.i.inc ]
29 %j = phi i64 [ 0, %for.i ], [ %j.inc, %for.j ]
|
| multidim_only_ivs_2d.ll | 30 %i = phi i64 [ 0, %entry ], [ %i.inc, %for.i.inc ]
35 %j = phi i64 [ 0, %for.i ], [ %j.inc, %for.j ]
|
| multidim_two_accesses_different_delinearization.ll | 19 %i = phi i64 [ 0, %entry ], [ %i.inc, %for.i.inc ]
23 %j = phi i64 [ 0, %for.i ], [ %j.inc, %for.j ]
|
| /external/llvm/test/Analysis/DependenceAnalysis/ |
| SymbolicSIV.ll | 28 %i.03 = phi i64 [ %inc, %for.body ], [ 0, %for.body.preheader ]
29 %B.addr.02 = phi i32* [ %incdec.ptr, %for.body ], [ %B, %for.body.preheader ]
73 %i.03 = phi i64 [ %inc, %for.body ], [ 0, %for.body.preheader ]
74 %B.addr.02 = phi i32* [ %incdec.ptr, %for.body ], [ %B, %for.body.preheader ]
120 %i.03 = phi i64 [ %inc, %for.body ], [ 0, %for.body.preheader ]
121 %B.addr.02 = phi i32* [ %incdec.ptr, %for.body ], [ %B, %for.body.preheader ]
165 %i.03 = phi i64 [ %inc, %for.body ], [ 0, %for.body.preheader ]
166 %B.addr.02 = phi i32* [ %incdec.ptr, %for.body ], [ %B, %for.body.preheader ]
211 %i.03 = phi i64 [ %inc, %for.body ], [ 0, %for.body.preheader ]
212 %B.addr.02 = phi i32* [ %incdec.ptr, %for.body ], [ %B, %for.body.preheader
[all...] |
| /external/llvm/test/Analysis/ScalarEvolution/ |
| trip-count8.ll | 25 %i.01 = phi i32 [ %inc, %for.cond ], [ 0, %bb.nph ] ; <i32> [#uses=3]
34 %i.0.lcssa = phi i32 [ %phitmp, %for.cond.for.end_crit_edge ], [ 1, %entry ] ; <i32> [#uses=1]
|
| /external/llvm/test/CodeGen/AArch64/ |
| arm64-cse.ll | 32 %retval.0 = phi i8* [ %add.ptr, %if.end ], [ null, %entry ]
57 %retval.0 = phi i8* [ %add.ptr, %if.end ], [ null, %entry ]
|
| eliminate-trunc.ll | 16 %indvars.iv = phi i64 [ 0, %for.body4.lr.ph.us ], [ %indvars.iv.next, %for.body4.us ]
29 %indvars.iv26 = phi i64 [ %indvars.iv.next27, %for.cond1.for.inc13_crit_edge.us ], [ 0, %entry ]
|
| /external/llvm/test/CodeGen/ARM/ |
| arm-negative-stride.ll | 13 %indvar = phi i32 [ 0, %entry ], [ %indvar.next, %bb ] ; <i32> [#uses=2]
35 %indvar = phi i32 [ 0, %entry ], [ %indvar.next, %bb ] ; <i32> [#uses=2]
|
| indirectbr-2.ll | 8 ; The indirect branch has the two destinations as successors. The lone PHI
34 %tmp14 = phi i32 [ %7, %4 ]
|
| /external/llvm/test/CodeGen/Generic/ |
| 2006-01-12-BadSetCCFold.ll | 19 %n_nodes.4 = phi i32 [ 64, %then.3.i ], [ 64, %then.2.i ], [ 64, %endif.2.i ] ; <i32> [#uses=1]
27 %cur_node.0.i8.1.i.i = phi %struct.node_t* [ undef, %dealwithargs.exit ], [ null, %no_exit.i12.i.i ] ; <%struct.node_t*> [#uses=0]
|
| /external/llvm/test/CodeGen/Hexagon/ |
| cext-check.ll | 27 %retval.0 = phi i32 [ %add, %if.then ], [ %add3, %if.end ]
55 %retval.0 = phi i32 [ %add, %if.then ], [ %add3, %if.end ]
|
| /external/llvm/test/CodeGen/NVPTX/ |
| pr17529.ll | 13 %index = phi i64 [ %index.next, %vector.body ], [ 0, %entry ]
29 %lsr.iv3 = phi i8* [ %scevgep2, %for.body.preheader1 ], [ %scevgep4, %for.body ]
|
| /external/llvm/test/CodeGen/PowerPC/ |
| stwux.ll | 15 %i.0240 = phi i32 [ -1, %while.body.lr.ph ], [ %i.1, %if.end12 ]
22 %i.1 = phi i32 [ %i.0240, %while.body ], [ undef, %if.then ]
|
| /external/llvm/test/CodeGen/R600/ |
| loop-address.ll | 17 %i.07.in = phi i32 [ %i.07, %for.body ], [ %iterations, %entry ]
18 %ai.06 = phi i32 [ %add, %for.body ], [ 0, %entry ]
|
| structurize.ll | 66 %4 = phi i32 [%2, %branch_from], [%a, %diamond_head]
80 %5 = phi i32 [%3, %diamond_false], [%div7, %diamond_true]
|
| /external/llvm/test/CodeGen/X86/ |
| 2007-04-17-LiveIntervalAssert.ll | 20 %i.2115.0 = phi i32 [ 0, %cond_true ], [ %indvar.next127, %bb32 ] ; <i32> [#uses=1]
21 %c.2112.0 = phi i32 [ 0, %cond_true ], [ %tmp49, %bb32 ] ; <i32> [#uses=1]
|
| 2007-10-30-LSRCrash.ll | 20 %from.0.reg2mem.0.ph.rec = phi i32 [ %tmp75.rec, %bb76.split ], [ 0, %bb98.preheader ] ; <i32> [#uses=1]
40 %tmp75.lcssa189 = phi i8* [ %tmp75, %bb69.us208 ], [ %tmp75, %bb69.us208 ], [ %tmp75, %bb69.us208 ], [ %tmp75, %bb69.outer.split.split ], [ %tmp75, %bb69.outer.split.split ], [ %tmp75, %bb69.outer.split.split ] ; <i8*> [#uses=0]
|
