| /external/llvm/test/CodeGen/X86/ |
| 2007-11-06-InstrSched.ll | 9 %i.0.reg2mem.0 = phi i32 [ 0, %entry ], [ %tmp17, %bb18 ] ; <i32> [#uses=3]
10 %res.0.reg2mem.0 = phi float [ 0.000000e+00, %entry ], [ %tmp14, %bb18 ] ; <float> [#uses=1]
23 %res.0.reg2mem.1 = phi float [ 0.000000e+00, %entry ], [ %tmp14, %bb18 ] ; <float> [#uses=1]
|
| atom-fixup-lea1.ll | 26 %i.06 = phi i32 [ %inc, %for.body ], [ 0, %entry ]
27 %sum.05 = phi i32 [ %add, %for.body ], [ 0, %entry ]
36 %sum.0.lcssa = phi i32 [ 0, %entry ], [ %add, %for.body ]
|
| early-ifcvt.ll | 13 %max.0 = phi i32 [ 0, %entry ], [ %max.1, %do.cond ]
14 %min.0 = phi i32 [ 0, %entry ], [ %min.1, %do.cond ]
15 %n.addr.0 = phi i32 [ %n, %entry ], [ %dec, %do.cond ]
16 %p.addr.0 = phi i32* [ %p, %entry ], [ %incdec.ptr, %do.cond ]
28 %max.1 = phi i32 [ %0, %do.body ], [ %max.0, %if.else ]
29 %min.1 = phi i32 [ %min.0, %do.body ], [ %.min.0, %if.else ]
64 %exit_status.0 = phi i32 [ 2, %if.then29 ], [ 0, %if.then37 ], [ 66, %entry ]
104 %groupPos.8 = phi i32 [ 0, %if.then1990 ], [ %groupPos.9, %sw.bb2050 ]
115 %groupPos.9 = phi i32 [ 0, %if.end.sw.bb2050_crit_edge ], [ %groupPos.8, %if.end2048 ]
139 %groupPos.14 = phi i32 [ 0, %sw.default ], [ %groupPos.8, %while.body2038 ], [ %groupPos.8, %while.end2104 ], [ 0, %i (…)
[all...] |
| phys_subreg_coalesce-2.ll | 18 %indvar = phi i32 [ 0, %forcond.preheader ], [ %divisor.02, %forbody ] ; <i32> [#uses=3]
19 %accumulator.01 = phi i32 [ 1, %forcond.preheader ], [ %div, %forbody ] ; <i32> [#uses=1]
29 %accumulator.0.lcssa = phi i32 [ 1, %forcond.preheader ], [ %div, %forbody ] ; <i32> [#uses=1]
|
| /external/llvm/test/Transforms/ADCE/ |
| 2002-05-23-ZeroArgPHITest.ll | 3 ; into was that when the reg109 PHI was getting zero predecessors, it was
5 ; in with a dummy value before the PHI is deleted.
23 %reg109 = phi %node_t* [ %reg110, %bb2 ], [ %reg107, %bb1 ] ; <%node_t*> [#uses=1]
|
| 2002-07-17-PHIAssertion.ll | 13 %reg128 = phi i32 [ %reg130, %bb6 ], [ 0, %bb0 ] ; <i32> [#uses=2]
28 %reg130 = phi i32 [ %reg117, %bb5 ], [ %reg128, %bb4 ] ; <i32> [#uses=1]
45 %UnifiedRetVal = phi i32 [ 7, %bb3 ], [ 0, %bb9 ] ; <i32> [#uses=1]
|
| /external/llvm/test/Transforms/GVN/ |
| edge.ll | 11 %cond = phi i32 [ %x, %bb0 ], [ 0, %bb1 ]
26 %cond = phi i32 [ %x, %bb0 ], [ 0, %bb1 ]
40 %cond = phi i32 [ %x, %bb0 ], [ 0, %bb1 ]
|
| /external/llvm/test/Transforms/IndVarSimplify/ |
| 2004-03-10-PHIInsertionBug.ll | 13 %inxm.0.i = phi i32 [ 8, %then.3.i ], [ 0, %endif.0.i ] ; <i32> [#uses=1]
14 %doinner.1.i = phi i32 [ 0, %then.3.i ], [ 0, %endif.0.i ] ; <i32> [#uses=0]
18 %inxk.0.i = phi i32 [ %tmp.210.i, %no_exit.2.i ], [ 0, %endif.3.i ] ; <i32> [#uses=1]
|
| lftr-zext.ll | 13 %i.0 = phi i8 [ 0, %0 ], [ %5, %1 ]
14 %p.0 = phi i8* [ getelementptr inbounds ([240 x i8]* @data, i64 0, i64 0), %0 ], [ %4, %1 ]
15 %.0 = phi i8* [ %a, %0 ], [ %2, %1 ]
|
| loop_evaluate_5.ll | 15 %result2 = phi i32 [ %tmp1, %bb2 ], [ 0, %bb.nph ] ; <i32> [#uses=1]
16 %k_01 = phi i5 [ %indvar_next1, %bb2 ], [ 0, %bb.nph ] ; <i5> [#uses=2]
30 %result.lcssa = phi i32 [ %tmp1, %bb2.bb3_crit_edge ], [ 0, %entry ] ; <i32> [#uses=1]
|
| /external/llvm/test/Transforms/LoopStrengthReduce/AArch64/ |
| lsr-memcpy.ll | 19 %len.06 = phi i64 [ 1288, %entry ], [ %sub, %while.body ]
20 %pDst.05 = phi i64* [ inttoptr (i64 6442450944 to i64*), %entry ], [ %incdec.ptr1, %while.body ]
21 %pSrc.04 = phi i64* [ inttoptr (i64 4294967296 to i64*), %entry ], [ %incdec.ptr, %while.body ]
|
| /external/llvm/test/Transforms/LoopUnroll/ |
| basic.ll | 9 ; CHECK-NEXT: phi i32
17 %x.0 = phi i32 [ 0, %entry ], [ %inc, %l1 ]
34 %x.0 = phi i32 [ 0, %entry ], [ %inc, %l1 ]
|
| runtime-loop1.ll | 17 %indvars.iv = phi i64 [ %indvars.iv.next, %for.body ], [ 0, %entry ]
18 %sum.02 = phi i32 [ %add, %for.body ], [ 0, %entry ]
28 %sum.0.lcssa = phi i32 [ 0, %entry ], [ %add, %for.body ]
|
| /external/llvm/test/Transforms/LoopVectorize/X86/ |
| reduction-crash.ll | 21 %tmp4 = phi double [ %tmp9, %bb3 ], [ %tmp, %bb2 ]
22 %tmp5 = phi i32 [ %tmp8, %bb3 ], [ 0, %bb2 ]
33 %tmp13 = phi double [ %tmp, %bb2 ], [ %tmp9, %bb3 ]
|
| /external/llvm/test/Transforms/SCCP/ |
| 2002-05-21-InvalidSimplify.ll | 12 %reg403 = phi i32 [ %reg155, %bb14 ], [ 0, %bb3 ] ; <i32> [#uses=1]
16 %reg407 = phi i32 [ %reg408, %bb11 ], [ 0, %bb6 ] ; <i32> [#uses=2]
23 %reg409 = phi i32 [ %reg410, %bb13 ], [ 0, %bb12 ] ; <i32> [#uses=1]
|
| /external/llvm/test/Transforms/SimplifyCFG/ |
| 2008-01-02-hoist-fp-add.ll | 1 ; The phi should not be eliminated in this case, because the fp op could trap.
22 ; CHECK: = phi double
23 %F.0 = phi double [ %tmp, %entry ], [ %tmp7, %cond_true ] ; <double> [#uses=1]
|
| /external/chromium_org/v8/src/ |
| hydrogen-osr.cc | 95 HPhi* phi = phis->at(j); local
96 if (phi->HasMergedIndex()) {
97 osr_values_->at(phi->merged_index())->set_incoming_value(phi);
|
| hydrogen-redundant-phi.h | 19 : HPhase("H_Redundant phi elimination", graph) { }
|
| /external/chromium_org/v8/test/mjsunit/regress/ |
| regress-parseint.js | 8 // Use a phi to force radix into heap number representation.
|
| /external/llvm/include/llvm/Analysis/ |
| PHITransAddr.h | 1 //===- PHITransAddr.h - PHI Translation for Addresses -----------*- C++ -*-===//
25 /// PHITransAddr - An address value which tracks and handles phi translation.
28 /// an address of "&A[i]" and walk through the definition of 'i' which is a PHI
29 /// node, we *must* phi translate i to get "&A[j]" or else we will analyze an
58 /// BasicBlock to its predecessors requires PHI translation.
68 /// IsPotentiallyPHITranslatable - If this needs PHI translation, return true
73 /// PHITranslateValue - PHI translate the current address up the CFG from
80 /// PHITranslateWithInsertion - PHI translate this value into the specified
101 /// InsertPHITranslatedSubExpr - Insert a computation of the PHI translated
|
| /external/llvm/lib/Transforms/Utils/ |
| DemoteRegToStack.cpp | 46 // If this is a PHI node, we can't insert a load of the value before the
50 // Note that if there are multiple edges from a basic block to this PHI
52 // resulting PHI node will have multiple values (from each load) coming in
101 /* empty */; // Don't insert before PHI nodes or landingpad instrs.
107 /// DemotePHIToStack - This function takes a virtual register computed by a PHI
109 /// The PHI node is deleted. It returns the pointer to the alloca inserted.
137 // Insert a load in place of the PHI and replace all uses.
141 /* empty */; // Don't insert before PHI nodes or landingpad instrs.
146 // Delete PHI.
|
| /external/llvm/test/Analysis/DependenceAnalysis/ |
| Invariant.ll | 15 %i.04 = phi i32 [ 0, %entry ], [ %add10, %for.inc9 ]
16 %res.03 = phi float [ 0.000000e+00, %entry ], [ %add.res.1, %for.inc9 ]
20 %j.02 = phi i32 [ 0, %for.cond1.preheader ], [ %add8, %for.body3 ]
21 %res.11 = phi float [ %res.03, %for.cond1.preheader ], [ %add.res.1, %for.body3 ]
|
| /external/llvm/test/Analysis/ScalarEvolution/ |
| 2007-11-18-OrInstruction.ll | 8 %i = phi i32 [ 1, %entry ], [ %i.next, %body ]
|
| 2008-02-11-ReversedCondition.ll | 9 %i = phi i32 [ 0, %entry ], [ %i.inc, %next ]
|
| 2008-02-12-SMAXTripCount.ll | 9 %i = phi i8 [ -100, %entry ], [ %i.inc, %next ]
|
