| /external/llvm/test/Transforms/LoopUnroll/ |
| 2006-08-24-MultiBlockLoop.ll | 7 %indvar1.ph = phi i32 [ 0, %entry ], [ %indvar.next2, %bb72 ] ; <i32> [#uses=1]
|
| /external/llvm/test/Transforms/LoopVectorize/ |
| hoist-loads.ll | 16 %indvars.iv = phi i64 [ 0, %entry ], [ %indvars.iv.next, %if.end9 ]
28 %tmp.0 = phi float [ %1, %if.else ], [ 0.000000e+00, %for.body ]
48 %indvars.iv = phi i64 [ 0, %entry ], [ %indvars.iv.next, %if.end9 ]
60 %tmp.0 = phi float [ %1, %if.else ], [ 0.000000e+00, %for.body ]
|
| if-conversion-reduction.ll | 15 %indvars.iv = phi i64 [ %indvars.iv.next, %for.inc ], [ 0, %entry ]
16 %sum.011 = phi i32 [ %sum.1, %for.inc ], [ 0, %entry ]
28 %sum.1 = phi i32 [ %add4, %if.then ], [ %sum.011, %for.body ]
35 %sum.0.lcssa = phi i32 [ 0, %entry ], [ 4, %for.inc ]
|
| minmax_reduction.ll | 27 %indvars.iv = phi i64 [ 0, %entry ], [ %indvars.iv.next, %for.body ]
28 %max.red.08 = phi i32 [ %max, %entry ], [ %max.red.0, %for.body ]
56 %indvars.iv = phi i64 [ 0, %entry ], [ %indvars.iv.next, %for.body ]
57 %max.red.08 = phi i32 [ %max, %entry ], [ %max.red.0, %for.body ]
84 %indvars.iv = phi i64 [ 0, %entry ], [ %indvars.iv.next, %for.body ]
85 %max.red.08 = phi i32 [ %max, %entry ], [ %max.red.0, %for.body ]
113 %indvars.iv = phi i64 [ 0, %entry ], [ %indvars.iv.next, %for.body ]
114 %max.red.08 = phi i32 [ %max, %entry ], [ %max.red.0, %for.body ]
143 %indvars.iv = phi i64 [ 0, %entry ], [ %indvars.iv.next, %for.body ]
144 %max.red.08 = phi i32 [ %max, %entry ], [ %max.red.0, %for.body
[all...] |
| /external/llvm/test/Transforms/LowerInvoke/ |
| 2003-12-10-Crash.ll | 17 %__tmp.0 = phi i32* [ null, %invoke_cont.0 ], [ null, %then ] ; <i32*> [#uses=0]
|
| /external/llvm/test/Transforms/ObjCARC/ |
| contract-testcases.ll | 41 %tmp7 = phi %4* [ undef, %bb5 ], [ undef, %bb4 ], [ undef, %bb3 ], [ undef, %bb4 ]
45 ; When rewriting operands for a phi which has multiple operands
52 ; CHECK: %tmp8 = phi %0* [ %0, %bb ], [ %0, %bb ]
62 %tmp8 = phi %0* [ %tmp, %bb ], [ %tmp, %bb ]
|
| /external/llvm/test/Transforms/PhaseOrdering/ |
| scev.ll | 17 %p.addr.0 = phi i32* [ %p, %entry ], [ %add.ptr1, %for.inc ]
18 %i.0 = phi i32 [ 0, %entry ], [ %inc, %for.inc ]
46 %p.addr.0 = phi i32* [ %p, %entry ], [ %add.ptr1, %for.inc ]
47 %i.0 = phi i32 [ 0, %entry ], [ %inc, %for.inc ]
|
| /external/llvm/test/Transforms/SCCP/ |
| 2008-01-27-UndefCorrelate.ll | 9 %indvar = phi i32 [ 0, %entry ], [ %k, %bb.backedge ]
|
| apint-array.ll | 21 %H = phi i101 [%G, %True], [-1, %Head]
|
| apint-basictest3.ll | 21 %Ret = phi i128 [%t3, %BB1], [%f3, %BB2]
|
| apint-ipsccp1.ll | 12 %Ret = phi i512 [%Val, %BB1], [2, %BB2]
|
| /external/llvm/test/Transforms/SimplifyCFG/ |
| EmptyBlockMerge.ll | 17 %reg117 = phi i32 [ 110, %bb2 ], [ %reg108, %bb0 ] ; <i32> [#uses=1]
|
| PhiEliminate2.ll | 13 %V6 = phi i32 [ %V5, %else ], [ %V4, %then ] ; <i32> [#uses=0]
|
| speculate-math.ll | 1 ; RUN: opt -S -simplifycfg -phi-node-folding-threshold=2 < %s | FileCheck %s
19 %cond.i = phi float [ %0, %cond.else.i ], [ 0x7FF8000000000000, %entry ]
37 %cond.i = phi float [ %0, %cond.else.i ], [ 0x7FF8000000000000, %entry ]
54 %cond.i = phi float [ %0, %cond.else.i ], [ 0x7FF8000000000000, %entry ]
|
| speculate-with-offset.ll | 24 %storemerge = phi i64* [ undef, %if.then ], [ %tmp5, %if.end ]
46 %storemerge = phi i64* [ undef, %if.then ], [ %tmp5, %if.end ]
68 %storemerge = phi i64* [ undef, %if.then ], [ %tmp5, %if.end ]
90 %storemerge = phi i64* [ undef, %if.then ], [ %tmp5, %if.end ]
|
| /external/llvm/test/Transforms/TailCallElim/ |
| 2010-06-26-MultipleReturnValues.ll | 6 ; CHECK: %accumulator.tr = phi i32 [ 1, %entry ], [ 0, %body ]
|
| accum_recursion.ll | 17 ; CHECK: phi i32
38 ; CHECK: phi i32
47 ; CHECK: %accumulator.tr = phi i64 [ %n, %entry ], [ %3, %bb1 ]
48 ; CHECK: %n.tr = phi i64 [ %n, %entry ], [ %2, %bb1 ]
|
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_bb.cpp | 74 joinAt = phi = entry = exit = NULL;
123 if (phi) {
124 insertBefore(phi, inst);
130 phi = exit = inst;
139 if (phi) {
140 insertAfter(exit, inst); // after last phi
161 assert(phi);
164 assert(!phi);
165 phi = exit = inst;
173 assert(!phi);
[all...] |
| /external/llvm/lib/Target/R600/ |
| SIFixSGPRCopies.cpp | 25 /// %vreg4 <vsrc> = PHI %vreg1 <vsrc>, <BB#0>, %vreg3 <vrsc>, <BB#1>
40 /// %vreg4 <sgpr> = PHI %vreg0 <sgpr>, <BB#0>, %vreg3 <vsrc>, <BB#1>
43 /// Now that the result of the PHI instruction is an SGPR, the register
55 /// %vreg4 <sgpr> = PHI %vreg0 <sgpr>, <BB#0>, %vreg3 <sgpr>, <BB#1>
60 /// In order to avoid this problem, this pass searches for PHI instructions
62 /// <vgpr> if the user of the PHI's definition register is a vector instruction.
63 /// If the PHI's definition class is constrained to <vgpr> then the coalescer
138 // The Reg parameter to the function must always be defined by either a PHI
218 case AMDGPU::PHI: {
219 DEBUG(dbgs() << " Fixing PHI:\n")
[all...] |
| /external/llvm/test/Analysis/DependenceAnalysis/ |
| GCD.ll | 35 %B.addr.04 = phi i32* [ %B, %entry ], [ %scevgep, %for.inc8 ]
36 %i.03 = phi i64 [ 0, %entry ], [ %inc9, %for.inc8 ]
40 %j.02 = phi i64 [ 0, %for.cond1.preheader ], [ %inc, %for.body3 ]
41 %B.addr.11 = phi i32* [ %B.addr.04, %for.cond1.preheader ], [ %incdec.ptr, %for.body3 ]
96 %B.addr.04 = phi i32* [ %B, %entry ], [ %scevgep, %for.inc9 ]
97 %i.03 = phi i64 [ 0, %entry ], [ %inc10, %for.inc9 ]
101 %j.02 = phi i64 [ 0, %for.cond1.preheader ], [ %inc, %for.body3 ]
102 %B.addr.11 = phi i32* [ %B.addr.04, %for.cond1.preheader ], [ %incdec.ptr, %for.body3 ]
158 %B.addr.04 = phi i32* [ %B, %entry ], [ %scevgep, %for.inc9 ]
159 %i.03 = phi i64 [ 0, %entry ], [ %inc10, %for.inc9
[all...] |
| Coupled.ll | 24 %i.02 = phi i64 [ 0, %entry ], [ %inc, %for.body ]
25 %B.addr.01 = phi i32* [ %B, %entry ], [ %incdec.ptr, %for.body ]
60 %i.02 = phi i64 [ 0, %entry ], [ %inc, %for.body ]
61 %B.addr.01 = phi i32* [ %B, %entry ], [ %incdec.ptr, %for.body ]
96 %i.02 = phi i64 [ 0, %entry ], [ %inc, %for.body ]
97 %B.addr.01 = phi i32* [ %B, %entry ], [ %incdec.ptr, %for.body ]
134 %i.02 = phi i64 [ 0, %entry ], [ %inc, %for.body ]
135 %B.addr.01 = phi i32* [ %B, %entry ], [ %incdec.ptr, %for.body ]
172 %i.02 = phi i64 [ 0, %entry ], [ %inc, %for.body ]
173 %B.addr.01 = phi i32* [ %B, %entry ], [ %incdec.ptr, %for.body
[all...] |
| /external/llvm/test/CodeGen/ARM/ |
| 2009-06-30-RegScavengerAssert3.ll | 41 %cflag.0.i = phi i16 [ 0, %bb228.i ], [ 0, %bb74.i ], [ 1, %bb138.i ] ; <i16> [#uses=1]
59 %c.1020.i = phi i32 [ 0, %bb.nph.i98 ], [ %c.14.i, %bb218.i ] ; <i32> [#uses=1]
60 %cflag.418.i = phi i16 [ 0, %bb.nph.i98 ], [ %cflag.3.i, %bb218.i ] ; <i16> [#uses=1]
61 %pj.317.i = phi i32 [ undef, %bb.nph.i98 ], [ %8, %bb218.i ] ; <i32> [#uses=1]
62 %pi.316.i = phi i32 [ undef, %bb.nph.i98 ], [ %7, %bb218.i ] ; <i32> [#uses=1]
63 %fj.515.i = phi i32 [ undef, %bb.nph.i98 ], [ %fj.4.i, %bb218.i ] ; <i32> [#uses=3]
64 %ci.910.i = phi i32 [ undef, %bb.nph.i98 ], [ %ci.12.i, %bb218.i ] ; <i32> [#uses=2]
85 %fi.5.i = phi i32 [ undef, %bb167.i ], [ %ci.910.i, %bb158.i ], [ undef, %bb160.i ], [ %ci.910.i, %bb161.i ], [ undef, %bb163.i ] ; <i32> [#uses=1]
86 %fj.4.i = phi i32 [ undef, %bb167.i ], [ undef, %bb158.i ], [ %fj.515.i, %bb160.i ], [ undef, %bb161.i ], [ %fj.515.i, %bb163.i ] ; <i32> [#uses=2]
109 %cflag.3.i = phi i16 [ %cflag.418.i, %bb168.i ], [ 1, %bb211.i ] ; <i16> [#uses=2
[all...] |
| /external/llvm/examples/OCaml-Kaleidoscope/Chapter5/ |
| codegen.ml | 67 * phi. We create a new name because one is used for the phi node, and the
77 * phi. *)
84 let phi = build_phi incoming "iftmp" builder in var
98 phi
116 (* Start the PHI node with an entry for start. *)
119 (* Within the loop, the variable is defined equal to the PHI node. If it
159 (* Add a new entry to the PHI node for the backedge. *)
|
| /external/llvm/test/Analysis/ScalarEvolution/ |
| 2011-03-09-ExactNoMaxBECount.ll | 17 %0 = phi i32 [ 0, %"5.preheader" ], [ %1, %"4" ]
29 %6 = phi i32 [ 0, %entry ], [ %4, %"9" ]
|
| 2011-04-26-FoldAddRec.ll | 10 %p_17.addr.012 = phi i32 [ 0, %entry ], [ %add, %for.inc ]
22 %p_18.addr.011 = phi i8 [ %add12, %for.inc9 ], [ %p_18, %for.cond ]
|
