| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/plugin/include/ |
| tree-ssa-operands.h | 75 #define PHI_RESULT_PTR(PHI) gimple_phi_result_ptr (PHI)
76 #define PHI_RESULT(PHI) DEF_FROM_PTR (PHI_RESULT_PTR (PHI))
77 #define SET_PHI_RESULT(PHI, V) SET_DEF (PHI_RESULT_PTR (PHI), (V))
79 #define PHI_ARG_DEF_PTR(PHI, I) gimple_phi_arg_imm_use_ptr ((PHI), (I))
80 #define PHI_ARG_DEF(PHI, I) USE_FROM_PTR (PHI_ARG_DEF_PTR ((PHI), (I))
[all...] |
| /external/llvm/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 281 /// dominating definitions for non-PHI blocks.
291 // If this block already needs a PHI, there is nothing to do here.
299 // Need a PHI here.
314 /// FindAvailableVal - If this block requires a PHI, first check if an
315 /// existing PHI matches the PHI placement and reaching definitions computed
316 /// earlier, and if not, create a new PHI. Visit all the block's
318 /// the incoming values for a new PHI.
326 // Check if there needs to be a PHI in BB.
330 // Look for an existing PHI
[all...] |
| /external/llvm/test/CodeGen/R600/ |
| schedule-vs-if-nested-loop-failure.ll | 23 %9 = phi float [ %115, %ENDIF19 ], [ undef, %ENDIF16 ]
24 %10 = phi float [ %114, %ENDIF19 ], [ undef, %ENDIF16 ]
25 %11 = phi float [ %113, %ENDIF19 ], [ undef, %ENDIF16 ]
26 %12 = phi float [ %112, %ENDIF19 ], [ undef, %ENDIF16 ]
27 %13 = phi float [ %111, %ENDIF19 ], [ undef, %ENDIF16 ]
28 %14 = phi i1 [ false, %ENDIF19 ], [ true, %ENDIF16 ]
35 %temp.0 = phi float [ 0.000000e+00, %main_body ], [ %104, %Flow2 ]
36 %temp1.0 = phi float [ 1.000000e+00, %main_body ], [ %103, %Flow2 ]
37 %temp2.0 = phi float [ 0.000000e+00, %main_body ], [ %102, %Flow2 ]
38 %temp3.0 = phi float [ 0.000000e+00, %main_body ], [ %101, %Flow2
[all...] |
| /external/llvm/test/Transforms/IndVarSimplify/ |
| lftr-reuse.ll | 20 ; CHECK: phi i8*
21 ; CHECK-NOT: phi
26 %p.02 = phi i8* [ %base, %entry ], [ %incdec.ptr, %for.body ]
52 %i = phi i32 [ 0, %entry ], [ %i.inc, %outer.inc ]
64 %j = phi i32 [ 0, %inner.ph ], [ %j.inc, %inner ]
81 ; Force SCEVExpander to look for an existing well-formed phi.
89 ; CHECK: phi i64
90 ; CHECK: phi i64
91 ; CHECK-NOT: phi
99 %rowidx = phi i32 [ 0, %entry ], [ %row.inc, %loop
[all...] |
| lcssa-preservation.ll | 15 %outer.iv = phi i32 [ 0, %entry ], [ %x, %outer.latch ]
22 %inner.iv = phi i32 [ undef, %outer.header ], [ %inc, %inner.latch ]
40 ; CHECK-NEXT: %[[LCSSA:.*]] = phi i32 [ %[[SCEV_EXPANDED]], %inner.latch ]
48 %exit.phi = phi i32 [ %inc, %inner.latch ], [ undef, %outer.latch ]
49 ; CHECK-NEXT: phi i32 [ %[[LCSSA]], %[[EXIT_FROM_INNER]] ], [ undef, %[[EXIT_FROM_OUTER]] ]
|
| loop_evaluate_1.ll | 11 %indvar1 = phi i32 [ 0, %entry ], [ %indvar.next2, %loopentry ] ; <i32> [#uses=1]
12 %h.0 = phi i32 [ %tmp.2, %loopentry ], [ 4, %entry ] ; <i32> [#uses=1]
29 ; CHECK: [[VAR4:%.+]] = phi i32 [ 0, %bb ], [ [[VAR3]], %bb1.preheader ]
37 %tmp2 = phi i32 [ %tmp5, %bb1 ], [ 0, %bb ]
38 %tmp3 = phi i32 [ %tmp4, %bb1 ], [ %arg, %bb ]
45 %tmp8 = phi i32 [ 0, %bb ], [ %tmp5, %bb1 ]
|
| /external/llvm/test/Analysis/BasicAA/ |
| phi-speculation.ll | 15 %num = phi i32 [ %count, %entry ], [ %dec, %while.body ]
16 %ptr_phi = phi i32* [ %ptr, %entry ], [ %ptr_inc, %while.body ]
17 %ptr2_phi = phi i32* [ %ptr2, %entry ], [ %ptr2_inc, %while.body ]
18 %result.09 = phi i32 [ 0 , %entry ], [ %add, %while.body ]
44 %ptr_outer_phi = phi i32* [%ptr_inc_outer, %outer.while.backedge], [ %ptr, %entry]
45 %ptr_outer_phi2 = phi i32* [%ptr2_inc_outer, %outer.while.backedge], [ %ptr2, %entry]
46 %num.outer = phi i32 [ %count, %entry ], [ %dec.outer, %outer.while.backedge ]
50 %num = phi i32 [ %count, %outer.while.header ], [ %dec, %while.body ]
51 %ptr_phi = phi i32* [ %ptr_outer_phi, %outer.while.header ], [ %ptr_inc, %while.body ]
52 %ptr2_phi = phi i32* [ %ptr_outer_phi2, %outer.while.header ], [ %ptr2_inc, %while.body
[all...] |
| /external/llvm/test/Transforms/GVN/ |
| rle-phi-translate.ll | 26 %c_addr.0 = phi i32* [ %g, %bb1 ], [ %c, %bb ]
27 %b_addr.0 = phi i32* [ %b, %bb1 ], [ %g, %bb ]
30 ; CHECK: %bv = phi i32
31 ; CHECK: %cv = phi i32
54 %d = phi i32* [ %c, %bb1 ], [ %b, %bb ]
57 ; CHECK: %dv = phi i8 [ 92, %bb1 ], [ 4, %bb ]
79 %d = phi i32* [ %c, %bb1 ], [ %b, %bb ]
80 %i = phi i32 [ 7, %bb1 ], [ 17, %bb ]
83 ; CHECK: %dv = phi i32 [ 82, %bb1 ], [ 4, %bb ]
105 %d = phi i32* [ %c, %bb1 ], [ %b, %bb
[all...] |
| /external/chromium_org/chrome/browser/resources/chromeos/chromevox/chromevox/background/mathmaps/symbols/ |
| greek-scripts.json | 68 "default": "modifier letter small greek phi",
69 "alternative": "greek letter superscript phi",
70 "short": "superscript phi"
108 "default": "greek subscript small letter phi",
109 "alternative": "greek letter phi",
110 "short": "subscript phi"
|
| /external/llvm/test/Transforms/InstCombine/ |
| gepphigep.ll | 25 %phi = phi %struct2* [ %tmp10, %bb1 ], [ %tmp20, %bb2 ]
26 %tmp24 = getelementptr inbounds %struct2* %phi, i64 0, i32 1
33 ; CHECK: %[[PHI:[0-9A-Za-z]+]] = phi i64 [ %tmp9, %bb1 ], [ %tmp19, %bb2 ]
34 ; CHECK: getelementptr inbounds %struct2* %tmp1, i64 %[[PHI]], i32 1
|
| /external/llvm/test/Transforms/LoopStrengthReduce/ |
| 2011-12-19-PostincQuadratic.ll | 14 ; CHECK: %lsr.iv1 = phi [121 x i32]*
16 ; CHECK: %lsr.iv = phi i32
20 ; CHECK: %lsr.iv3 = phi [121 x i32]* [ %lsr.iv1, %for.body43.preheader ]
26 %indvars.iv77 = phi i32 [ %indvars.iv.next78, %for.body7 ], [ 1, %for.cond.preheader ]
27 %bf.072 = phi i32 [ %t1, %for.body7 ], [ 0, %for.cond.preheader ]
33 %bf.459 = phi i32 [ %inc44, %for.body43 ], [ %t1, %for.body7 ]
|
| /external/llvm/test/Transforms/SimplifyCFG/ |
| EqualPHIEdgeBlockMerge.ll | 1 ; Test merging of blocks with phi nodes.
24 %W = phi i32 [ 2, %N ], [ 2, %Q ] ; <i32> [#uses=1]
29 ; Test merging of blocks with phi nodes where at least one incoming value
50 %val.0 = phi i8 [ undef, %R ], [ 1, %T ], [ 0, %S ]
54 ; Test merging of blocks with phi nodes where at least one incoming value
81 %val.0 = phi i8 [ undef, %V ], [ 1, %X ], [ 1, %W ]
107 ; and thus 5 incoming values to the phi.
108 %val.0 = phi i8 [ 1, %V ], [ 1, %X ], [ 2, %W ]
131 %val.0 = phi i8 [ undef, %V ], [ 1, %X ], [ 2, %W ], [ undef, %V ]
141 ; This phi has a conflicting value (0) with below phi (2), so block
[all...] |
| /external/llvm/test/Verifier/ |
| dominates.ll | 19 %y2 = phi i32 [%y1, %bb0]
26 ; CHECK-NEXT: %y2 = phi i32 [ %y1, %bb0 ]
39 %y3 = phi i32 [%y1, %bb2]
44 ; CHECK-NEXT: %y3 = phi i32 [ %y1, %bb2 ]
51 %y3 = phi i32 [%y1, %bb0]
56 ; CHECK-NEXT: %y3 = phi i32 [ %y1, %bb0 ]
|
| /external/chromium_org/v8/src/ |
| hydrogen-infer-representation.cc | 20 // (1) Initialize bit vectors and count real uses. Each phi gets a
33 // phi is connected to another phi if its value is used either directly or
41 HPhi* phi = phi_list->at(i); local
42 for (HUseIterator it(phi->uses()); !it.Done(); it.Advance()) {
96 // Simplify constant phi inputs where possible.
102 // Use the phi reachability information from step 2 to
103 // sum up the non-phi use counts of all connected phis.
105 HPhi* phi = phi_list->at(i); local
111 if (index != i) phi->AddNonPhiUsesFrom(it_use); // Don't count twice
142 HPhi* phi = phis->at(j); local
[all...] |
| hydrogen-uint32-analysis.h | 26 INLINE(bool CheckPhiOperands(HPhi* phi));
27 INLINE(void UnmarkPhi(HPhi* phi, ZoneList<HPhi*>* worklist));
|
| /external/llvm/test/Transforms/CorrelatedValuePropagation/ |
| basic.ll | 32 ; CHECK-NOT: phi i1
33 %cond_merge = phi i1 [ %cond, %entry ], [ false, %bb1 ] ; <i1> [#uses=1]
92 %phi = phi i32* [ %sel, %loop ], [ %x, %entry ]
93 ; CHECK: %phi = phi i32* [ %f, %loop ], [ %x, %entry ]
94 %f = tail call i32* @f(i32* %phi)
128 %p = phi i32 [ 1, %entry ], [ -1, %negative ], [ -1, %negative ], [ -1, %negative ], [ -1, %negative ], [ -1, %negative ]
132 %q = phi i32 [ 0, %negative ], [ 0, %negative ]
151 %p = phi i32 [ -1, %entry ], [ 1, %positive ], [ 1, %positive
[all...] |
| /external/llvm/test/Transforms/SROA/ |
| phi-and-select.ll | 26 %phi = phi i32* [ %a1, %then ], [ %a0, %entry ]
27 ; CHECK: phi i32 [ 1, %{{.*}} ], [ 0, %{{.*}} ]
29 %result = load i32* %phi
63 ; into the same alloca partation continues to work with PHI speculation. This
99 %phi = phi i32* [ %a1, %bb0 ], [ %a0, %bb1 ], [ %a0, %bb2 ], [ %a1, %bb3 ],
101 ; CHECK: phi i32 [ 1, %{{.*}} ], [ 0, %{{.*}} ], [ 0, %{{.*}} ], [ 1, %{{.*}} ], [ 1, %{{.*}} ], [ 0, %{{.*}} ], [ 0, %{{.*}} ], [ 1, %{{.*}} ]
103 %result = load i32* %phi
203 %P = phi i32* [ %Y1, %good ], [ %Y2, %bad
[all...] |
| /external/llvm/test/Transforms/ScalarRepl/ |
| phi-cycle.ll | 20 ; CHECK-NEXT: %tmp = phi i32 [ 1, %entry ], [ %tmp2, %while.cond.backedge.i ]
21 ; CHECK-NEXT: %pos.0.i = phi i32 [ 1, %entry ], [ %xtmp.i, %while.cond.backedge.i ]
22 ; CHECK-NEXT: %left.0.i = phi i32 [ 1, %entry ], [ %dec.i, %while.cond.backedge.i ]
23 ; CHECK-NOT: phi
25 %tmp = phi i32 [ 1, %entry ], [ %tmp2, %while.cond.backedge.i ]
26 %pos.0.i = phi i32 [ 1, %entry ], [ %xtmp.i, %while.cond.backedge.i ]
27 %left.0.i = phi i32 [ 1, %entry ], [ %dec.i, %while.cond.backedge.i ]
53 ; CHECK-NEXT: %tmp1 = phi i32 [ %pos.0.i, %if.then.i ], [ %tmp, %sw.bb.i ]
54 ; CHECK-NOT: phi
56 %tmp1 = phi i32 [ %pos.0.i, %if.then.i ], [ %tmp, %sw.bb.i
[all...] |
| /external/llvm/test/Analysis/Dominators/ |
| 2007-07-11-SplitBlock.ll | 12 %c.2 = phi i32 [ %tmp33, %cond_true20 ], [ 0, %entry ] ; <i32> [#uses=1]
16 %c.2.lcssa = phi i32 [ %c.2, %bb36 ] ; <i32> [#uses=0]
|
| /external/llvm/test/Analysis/ScalarEvolution/ |
| 2007-08-06-MisinterpretBranch.ll | 12 %x_addr.0 = phi i32 [ %tmp6, %bb ], [ %x, %entry ] ; <i32> [#uses=1]
18 %x_addr.1 = phi i32 [ %x, %entry ], [ %tmp6, %bb ] ; <i32> [#uses=1]
|
| 2007-09-27-LargeStepping.ll | 16 %j.0 = phi i32 [ 1, %entry ], [ %tmp2, %bb ] ; <i32> [#uses=2]
17 %i.0 = phi i32 [ -1879048192, %entry ], [ %tmp4, %bb ] ; <i32> [#uses=2]
|
| 2007-11-14-SignedAddRec.ll | 18 %i.0 = phi i32 [ 0, %entry ], [ %tmp5, %bb ] ; <i32> [#uses=3]
19 %x.0 = phi i32 [ 0, %entry ], [ %tmp3, %bb ] ; <i32> [#uses=3]
|
| 2008-08-04-IVOverflow.ll | 16 %i.0 = phi i32 [ 0, %entry ], [ %2, %bb ]
17 %x16.0 = phi i16 [ 0, %entry ], [ %1, %bb ]
|
| 2008-11-02-QuadraticCrash.ll | 11 %a = phi i32 [ 2, %entry ], [ %b, %loop_1 ] ; <i32> [#uses=2]
12 %c = phi i32 [ 5, %entry ], [ %d, %loop_1 ] ; <i32> [#uses=1]
|
| 2008-11-15-CubicOOM.ll | 9 %w.0 = phi i32 [ 0, %entry ], [ %tmp, %bb ] ; <i32> [#uses=2]
10 %e.0 = phi i32 [ 0, %entry ], [ %e.1, %bb ] ; <i32> [#uses=2]
|
