| /external/llvm/test/Analysis/ScalarEvolution/ |
| pr3909.ll | 13 %i.0 = phi i64 [ 0, %entry ], [ %tmp11, %endwhile5 ] ; <i64> [#uses=1]
14 %m.0 = phi i64 [ 0, %entry ], [ %tmp11, %endwhile5 ] ; <i64> [#uses=2]
19 %j.0 = phi i64 [ %tmp2, %whilebody ], [ %tmp9, %whilebody4 ] ; <i64> [#uses=2]
|
| /external/llvm/test/CodeGen/ARM/ |
| pr13249.ll | 8 %tmp = phi i8* [ %tmp5, %bb3 ], [ %arg, %bb ]
14 %tmp8 = phi i8 [ %tmp14, %bb13 ], [ %tmp4, %bb3 ]
15 %tmp9 = phi i8* [ %tmp12, %bb13 ], [ %tmp, %bb3 ]
|
| /external/llvm/test/CodeGen/Generic/ |
| undef-phi.ll | 3 ; This function has a PHI with one undefined input. Verify that PHIElimination
15 %stack.addr.02 = phi %struct.xx_stack* [ %0, %for.body ], [ %stack, %entry ]
22 %top.0.lcssa = phi %struct.xx_stack* [ undef, %entry ], [ %stack.addr.02, %for.body ]
|
| badarg6.ll | 25 %reg321 = phi double [ 2.000000e-01, %bb25 ], [ %reg315, %bb42 ] ; <double> [#uses=1]
26 %reg322 = phi double [ 6.000000e+00, %bb25 ], [ %reg316, %bb42 ] ; <double> [#uses=1]
27 %reg323 = phi double [ -1.000000e+00, %bb25 ], [ %reg317, %bb42 ] ; <double> [#uses=1]
28 %reg324 = phi double [ -1.000000e+00, %bb25 ], [ %reg318, %bb42 ] ; <double> [#uses=1]
29 %reg325 = phi double [ 1.000000e+00, %bb25 ], [ %reg319, %bb42 ] ; <double> [#uses=1]
|
| /external/llvm/test/CodeGen/X86/ |
| coalescer-identity.ll | 22 %1 = phi i32 [ %3, %for.inc.us ], [ %.pre, %for.body.lr.ph ]
23 %dec13.us = phi i16 [ %dec12.us, %for.inc.us ], [ %s.promoted, %for.body.lr.ph ]
24 %i.011.us = phi i32 [ %inc.us, %for.inc.us ], [ undef, %for.body.lr.ph ]
25 %v.010.us = phi i32 [ %phitmp.us, %for.inc.us ], [ 1, %for.body.lr.ph ]
36 %3 = phi i32 [ %1, %for.body.us ], [ %4, %cond.end.us ]
37 %dec12.us = phi i16 [ %add.us, %for.body.us ], [ %dec.us, %cond.end.us ]
44 %4 = phi i32 [ 0, %cond.false.us ], [ %1, %if.then7.us ]
45 %cond.us = phi i32 [ 0, %cond.false.us ], [ %v.010.us, %if.then7.us ]
58 %dec13 = phi i16 [ %dec12, %for.body ], [ %s.promoted, %for.body.lr.ph ]
59 %i.011 = phi i32 [ %inc, %for.body ], [ undef, %for.body.lr.ph
[all...] |
| /external/llvm/test/Transforms/IndVarSimplify/ |
| 2011-11-17-selfphi.ll | 5 ; CHECK-NOT: lcssa = phi
14 %p_41.addr.0.ph = phi i32 [ %p_41.addr.1.lcssa, %for.end ], [ 1, %for.cond.preheader ]
24 %p_41.addr.1.lcssa = phi i32 [ undef, %for.ph ], [ %p_41.addr.0.ph, %for.cond ]
|
| loop_evaluate_2.ll | 14 %i.01.0 = phi i32 [ %tmp4, %bb ], [ 0, %bb.preheader ] ; <i32> [#uses=1]
15 %j.03.0 = phi i32 [ %tmp2, %bb ], [ 0, %bb.preheader ] ; <i32> [#uses=1]
25 %j.03.1 = phi i32 [ 0, %entry ], [ %tmp2, %bb8.loopexit ] ; <i32> [#uses=1]
|
| loop_evaluate_6.ll | 1 ; RUN: opt < %s -indvars -loop-deletion -S | grep phi | count 1
12 %x_offs_addr.01 = phi i32 [ %1, %bb1 ], [ %x_offs, %bb.nph ] ; <i32> [#uses=1]
24 %x_offs_addr.0.lcssa = phi i32 [ %1, %bb1.bb2_crit_edge ], [ %x_offs, %entry ] ; <i32> [#uses=1]
|
| iv-sext.ll | 20 ; CHECK: phi i64
21 ; CHECK-NOT: phi i64
23 %distERBhi.121 = phi float [ %distERBhi.2.lcssa, %bb8 ], [ 0.000000e+00, %bb.nph22 ] ; <float> [#uses=2]
24 %distERBlo.120 = phi float [ %distERBlo.0.lcssa, %bb8 ], [ 0.000000e+00, %bb.nph22 ] ; <float> [#uses=2]
25 %hiPart.119 = phi i32 [ %hiPart.0.lcssa, %bb8 ], [ 0, %bb.nph22 ] ; <i32> [#uses=3]
26 %loPart.118 = phi i32 [ %loPart.0.lcssa, %bb8 ], [ 0, %bb.nph22 ] ; <i32> [#uses=2]
27 %peakCount.117 = phi float [ %peakCount.2.lcssa, %bb8 ], [ %tmp, %bb.nph22 ] ; <float> [#uses=2]
28 %part.016 = phi i32 [ %tmp46, %bb8 ], [ 0, %bb.nph22 ] ; <i32> [#uses=5]
47 %distERBlo.0.ph = phi float [ %distERBlo.120, %bb ], [ %tmp9, %bb1 ] ; <float> [#uses=3]
48 %distERBhi.0.ph = phi float [ %distERBhi.121, %bb ], [ %tmp14, %bb1 ] ; <float> [#uses=3
[all...] |
| /external/llvm/test/Transforms/InstCombine/ |
| 2004-01-13-InstCombineInvokePHI.ll | 3 ; inserting a cast of the return value after the PHI instruction, but which is
4 ; used by the PHI instruction. This is bad: because of the semantics of the
21 %P2 = phi i32* [ %P, %call ], [ null, %entry ] ; <i32*> [#uses=1]
|
| fold-phi.ll | 9 %sum.057 = phi float [ 0.000000e+00, %entry ], [ %add5, %bb0 ]
26 ; CHECK: phi float
28 %sum.057 = phi float [ 0.000000e+00, %entry ], [ %add5, %bb0 ]
|
| /external/llvm/test/Transforms/LoopStrengthReduce/ |
| related_indvars.ll | 1 ; RUN: opt < %s -loop-reduce -S | grep phi | count 1
3 ; This should only result in one PHI node!
15 %indvar = phi i32 [ 0, %entry ], [ %indvar.next, %no_exit ] ; <i32> [#uses=2]
|
| /external/llvm/test/Transforms/LoopUnroll/ |
| 2011-08-08-PhiUpdate.ll | 2 ; Test phi update after partial unroll.
9 ; CHECK: %sub5.lcssa = phi i32 [ %sub{{.*}}, %if.else{{.*}} ], [ %sub{{.*}}, %if.else{{.*}} ], [ %sub{{.*}}, %if.else{{.*}} ], [ %sub{{.*}}, %if.else{{.*}} ]
20 %sub = phi i32 [ %i, %if.else.lr.ph ], [ %sub5, %if.else ]
26 %i.tr = phi i32 [ %i, %entry ], [ %sub5, %if.else ]
35 ; CHECK: %.lcssa = phi i32 [ %{{[2468]}}, %bb1{{.*}} ], [ %{{[2468]}}, %bb1{{.*}} ], [ %{{[2468]}}, %bb1{{.*}} ], [ %{{[2468]}}, %bb1{{.*}} ]
47 %indvar = phi i64 [ 0, %bb.nph ], [ %indvar.next, %bb1 ] ; <i64> [#uses=2]
48 %s.01 = phi i32 [ 0, %bb.nph ], [ %2, %bb1 ] ; <i32> [#uses=1]
60 %.lcssa = phi i32 [ %2, %bb1 ] ; <i32> [#uses=1]
64 %s.0.lcssa = phi i32 [ %.lcssa, %bb1.bb2_crit_edge ], [ 0, %entry ] ; <i32> [#uses=1]
68 ; Check phi update for loop with an early-exit
[all...] |
| /external/llvm/test/Transforms/LoopVectorize/X86/ |
| no-vector.ll | 9 %i.06 = phi i32 [ %inc, %for.body ], [ 0, %entry ]
10 %r.05 = phi i32 [ %xor, %for.body ], [ 0, %entry ]
20 %r.0.lcssa = phi i32 [ 0, %entry ], [ %xor, %for.body ]
|
| /external/llvm/test/Transforms/ScalarRepl/ |
| 2011-09-22-PHISpeculateInvoke.ll | 6 ; (The PHI could theoretically be transformed by splitting the critical
27 %storemerge.in = phi i32* [ %retptr2, %else ], [ %retptr1, %then ]
40 ; CHECK: %storemerge.in = phi i32* [ %retptr2, %else ], [ %retptr1, %then ]
|
| /external/llvm/lib/Transforms/InstCombine/ |
| InstCombinePHI.cpp | 23 /// FoldPHIArgBinOpIntoPHI - If we have something like phi [add (a,b), add(a,c)]
24 /// and if a/b/c and the add's all have a single use, turn this into a phi
67 // Keep track of which operand needs a phi node.
72 // If both LHS and RHS would need a PHI, don't do this transformation,
141 // We don't want to replace this phi if the replacement would require
142 // more than one phi, which leads to higher register pressure. This is
168 // Don't merge two GEPs when two operands differ (introducing phi nodes)
180 // If we already needed a PHI for an earlier operand, and another operand
181 // also requires a PHI, we'd be introducing more PHIs than we're
182 // eliminating, which increases register pressure on entry to the PHI'
[all...] |
| /external/llvm/test/Transforms/LoopStrengthReduce/X86/ |
| 2012-01-13-phielim.ll | 6 ; Check that redundant phi elimination ran
20 %indvars.iv7.i = phi i64 [ 16, %while.body.lr.ph.i ], [ %indvars.iv.next8.i, %cond.true29.i ]
21 %i.05.i = phi i64 [ 0, %while.body.lr.ph.i ], [ %indvars.iv7.i, %cond.true29.i ]
28 %indvars.iv.i = phi i64 [ 0, %while.body.i ], [ %indvars.iv.next.i, %for.body.i ]
58 ; Test phi reuse after LSR that requires SCEVExpander to hoist an
70 %indvars.iv1163 = phi i64 [ %indvars.iv.next1164, %if.then477 ], [ 1, %entry ]
71 %k.0.in = phi i32* [ %last, %if.then477 ], [ getelementptr inbounds ([5000 x %struct.anon.7.91.199.307.415.475.559.643.751.835.943.1003.1111.1219.1351.1375.1399.1435.1471.1483.1519.1531.1651.1771]* @tags, i64 0, i64 0, i32 2), %entry ]
95 ; Test redundant phi elimination when the deleted phi's increment is
96 ; itself a phi
[all...] |
| /external/chromium_org/v8/src/compiler/ |
| change-lowering.cc | 114 Node* phi = graph()->NewNode( local
115 common()->Phi(static_cast<MachineType>(kTypeBool | kRepTagged), 2),
118 return Replace(phi);
154 Node* phi = graph()->NewNode(common()->Phi(kMachAnyTagged, 2), heap_number, local
157 return Replace(phi);
180 Node* phi = graph()->NewNode( local
181 common()->Phi((signedness == kSigned) ? kMachInt32 : kMachUint32, 2),
184 return Replace(phi);
204 Node* phi local
232 Node* phi = graph()->NewNode(common()->Phi(kMachAnyTagged, 2), smi, local
[all...] |
| change-lowering-unittest.cc | 131 Node* phi = reduction.replacement(); local
133 EXPECT_THAT(phi,
202 Node* phi = reduction.replacement(); local
205 phi,
232 Node* phi = reduction.replacement(); local
235 phi,
261 Node* phi = reduction.replacement(); local
264 phi,
287 Node* phi = reduction.replacement(); local
290 phi,
313 Node* phi = reduction.replacement(); local
369 Node* phi = reduction.replacement(); local
398 Node* phi = reduction.replacement(); local
425 Node* phi = reduction.replacement(); local
452 Node* phi = reduction.replacement(); local
[all...] |
| /external/llvm/lib/CodeGen/ |
| UnreachableBlockElim.cpp | 171 // Cleanup PHI nodes.
174 // Prune unneeded PHI entries.
177 MachineBasicBlock::iterator phi = BB->begin(); local
178 while (phi != BB->end() && phi->isPHI()) {
179 for (unsigned i = phi->getNumOperands() - 1; i >= 2; i-=2)
180 if (!preds.count(phi->getOperand(i).getMBB())) {
181 phi->RemoveOperand(i);
182 phi->RemoveOperand(i-1);
186 if (phi->getNumOperands() == 3)
[all...] |
| /external/llvm/test/CodeGen/MSP430/ |
| postinc.ll | 11 %i.010 = phi i16 [ 0, %entry ], [ %inc, %for.body ] ; <i16> [#uses=2]
12 %sum.09 = phi i16 [ 0, %entry ], [ %add, %for.body ] ; <i16> [#uses=1]
23 %sum.0.lcssa = phi i16 [ 0, %entry ], [ %add, %for.body ] ; <i16> [#uses=1]
33 %i.010 = phi i16 [ 0, %entry ], [ %inc, %for.body ] ; <i16> [#uses=2]
34 %sum.09 = phi i16 [ 0, %entry ], [ %add, %for.body ] ; <i16> [#uses=1]
45 %sum.0.lcssa = phi i16 [ 0, %entry ], [ %add, %for.body ] ; <i16> [#uses=1]
55 %i.010 = phi i16 [ 0, %entry ], [ %inc, %for.body ] ; <i16> [#uses=2]
56 %sum.09 = phi i16 [ 0, %entry ], [ %add, %for.body ] ; <i16> [#uses=1]
67 %sum.0.lcssa = phi i16 [ 0, %entry ], [ %add, %for.body ] ; <i16> [#uses=1]
77 %i.010 = phi i16 [ 0, %entry ], [ %inc, %for.body ] ; <i16> [#uses=2
[all...] |
| indirectbr.ll | 13 %gotovar.4.0 = phi i8* [ %gotovar.4.0.pre, %bb3 ], [ %0, %entry ] ; <i8*> [#uses=1]
25 %res.0 = phi i16 [ 385, %L5 ], [ 35, %bb2 ] ; <i16> [#uses=1]
29 %res.1 = phi i16 [ %res.0, %L4 ], [ 5, %bb2 ] ; <i16> [#uses=1]
33 %res.2 = phi i16 [ %res.1, %L3 ], [ 1, %bb2 ] ; <i16> [#uses=1]
38 %res.3 = phi i16 [ %phitmp, %L2 ], [ 2, %bb2 ] ; <i16> [#uses=1]
|
| /external/llvm/test/Transforms/LoopVectorize/ |
| reverse_induction.ll | 17 %add.i7 = phi i64 [ %startval, %entry ], [ %add.i, %for.body ]
18 %i.06 = phi i32 [ 0, %entry ], [ %inc4, %for.body ]
19 %redux5 = phi i32 [ 0, %entry ], [ %inc.redux, %for.body ]
40 %add.i7 = phi i128 [ %startval, %entry ], [ %add.i, %for.body ]
41 %i.06 = phi i32 [ 0, %entry ], [ %inc4, %for.body ]
42 %redux5 = phi i32 [ 0, %entry ], [ %inc.redux, %for.body ]
64 %add.i7 = phi i16 [ %startval, %entry ], [ %add.i, %for.body ]
65 %i.06 = phi i32 [ 0, %entry ], [ %inc4, %for.body ]
66 %redux5 = phi i32 [ 0, %entry ], [ %inc.redux, %for.body ]
98 ; CHECK: %index = phi i64 [ 0, %vector.ph ], [ %index.next, %vector.body
[all...] |
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/generators/ |
| RSAKeyPairGenerator.java | 30 BigInteger p, q, n, d, e, pSub1, qSub1, phi; local
120 phi = p;
122 q = phi;
127 phi = pSub1.multiply(qSub1);
132 d = e.modInverse(phi);
|
| /external/llvm/test/CodeGen/PowerPC/ |
| 2009-11-25-ImpDefBug.ll | 43 %eRight.08 = phi %struct..0EdgeT* [ %eTop.eMaj, %bb32 ], [ undef, %bb34 ], [ undef, %bb33 ] ; <%struct..0EdgeT*> [#uses=0]
44 %fdgOuter.0 = phi i32 [ %fdgOuter.1, %bb32 ], [ undef, %bb34 ], [ %fdgOuter.1, %bb33 ] ; <i32> [#uses=1]
45 %fz.3 = phi i32 [ %fz.2, %bb32 ], [ 2147483647, %bb34 ], [ %fz.2, %bb33 ] ; <i32> [#uses=1]
50 %fdgOuter.1 = phi i32 [ undef, %bb17 ], [ %fdgOuter.0, %bb38 ] ; <i32> [#uses=2]
51 %fz.2 = phi i32 [ undef, %bb17 ], [ %fz.3, %bb38 ] ; <i32> [#uses=2]
|
