| /external/llvm/test/Transforms/SLPVectorizer/X86/ |
| crash_dequeue.ll | 29 %3 = phi double* [ %2, %entry ], [ %2, %while.cond.i ], [ undef, %while.body.i ]
30 %4 = phi double* [ %0, %entry ], [ %1, %while.cond.i ], [ undef, %while.body.i ]
|
| hoist.ll | 22 ;CHECK: phi
32 %i.024 = phi i32 [ 0, %entry ], [ %add10, %for.body ]
|
| /external/llvm/test/Transforms/ScalarRepl/ |
| inline-vector.ll | 11 ; CHECK: phi <4 x float>
23 %storemerge = phi i32 [ 0, %entry ], [ %inc, %for.body ]
|
| /external/llvm/test/Transforms/SimplifyCFG/ |
| branch-fold.ll | 50 %o2 = phi i1 [ false, %a ], [ %phitmp, %b ], [ false, %entry ]
68 %cond = phi i1 [ undef, %cond.true ], [ %phitmp, %cond.false ]
|
| volatile-phioper.ll | 29 %Addr.017 = phi i8* [ %incdec.ptr, %while.body ], [ null, %if.then ], [ null, %entry ]
30 %x.016 = phi i8 [ %inc, %while.body ], [ 0, %if.then ], [ 0, %entry ]
|
| /external/llvm/unittests/IR/ |
| UserTest.cpp | 60 " %phi = phi i32 [ 0, %s0 ], [ 1, %s1 ],\n"
|
| /packages/apps/Camera2/jni/ |
| tinyplanet.cc | 115 float phi = 2 * atan(1 / r); local
120 float py = (phi / PI_F) * input_height;
|
| /packages/apps/Gallery2/jni/filters/ |
| tinyplanet.cc | 114 float phi = 2 * atan(1 / r); local
119 float py = (phi / PI_F) * input_height;
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/plugin/include/ |
| tree-pass.h | 168 /* Update the SSA form inserting PHI nodes for newly exposed symbols
170 only insert PHI nodes for a real name O_j in blocks reached by all
172 frontier for O_j is not pruned, we may end up inserting PHI nodes
178 /* Update the SSA form without inserting any new PHI nodes at all.
179 This is used by passes that have either inserted all the PHI nodes
184 /* Insert PHI nodes everywhere they are needed. No pruning of the
185 IDF is done. This is used by passes that need the PHI nodes for
190 may be doing something wrong. Inserting PHI nodes for an old name
|
| /external/llvm/test/Transforms/Scalarizer/ |
| basic.ll | 16 ; CHECK: %i = phi i32 [ %count, %entry ], [ %nexti, %loop ]
17 ; CHECK: %acc.i0 = phi float [ %init.i0, %entry ], [ %sel.i0, %loop ]
18 ; CHECK: %acc.i1 = phi float [ %init.i1, %entry ], [ %sel.i1, %loop ]
19 ; CHECK: %acc.i2 = phi float [ %init.i2, %entry ], [ %sel.i2, %loop ]
20 ; CHECK: %acc.i3 = phi float [ %init.i3, %entry ], [ %sel.i3, %loop ]
64 %i = phi i32 [ %count, %entry ], [ %nexti, %loop ]
65 %acc = phi <4 x float> [ %init, %entry ], [ %sel, %loop ]
102 ; CHECK: %i = phi i32 [ %count, %entry ], [ %nexti, %loop ]
103 ; CHECK: %acc.i0 = phi i32 [ %init.i0, %entry ], [ %sel.i0, %loop ]
104 ; CHECK: %acc.i1 = phi i32 [ %init.i1, %entry ], [ %sel.i1, %loop
[all...] |
| /art/compiler/optimizing/ |
| ssa_phi_elimination.h | 48 * replace the phi with the value when entering the loop.
|
| /external/chromium_org/v8/src/ |
| hydrogen-canonicalize.cc | 6 #include "src/hydrogen-redundant-phi.h"
|
| /external/chromium_org/v8/test/mjsunit/compiler/ |
| regress-rep-change.js | 30 // Regression test for the case where a phi has two input operands with
|
| /external/clang/include/clang/Analysis/Analyses/ |
| ThreadSafetyOps.def | 46 TIL_OPCODE_DEF(Phi)
|
| /external/clang/test/CodeGenCXX/ |
| new-array-init.cpp | 43 // CHECK: phi
|
| /external/llvm/docs/HistoricalNotes/ |
| 2001-02-13-Reference-Memory.txt | 32 SSA generation/PHI node insertion pass to build the dependencies
|
| /external/llvm/lib/Transforms/Scalar/ |
| SimplifyCFGPass.cpp | 16 // * Eliminates PHI nodes for basic blocks with a single predecessor.
70 /// mergeEmptyReturnBlocks - If we have more than one empty (other than phi
86 // single PHI node that is the operand to the return.
121 // If the canonical return block has no PHI node, create one now.
|
| /external/llvm/test/Analysis/BasicAA/ |
| gcsetest.ll | 36 %AP = phi i32 [0, %0], [%X, %Loop]
|
| /external/llvm/test/Analysis/Delinearization/ |
| multidim_only_ivs_2d_nested.ll | 33 %indvars.iv51 = phi i64 [ 1, %for.cond1.preheader.lr.ph ], [ %indvars.iv.next52, %for.inc17 ]
49 %i.023.us.us = phi i64 [ 0, %for.cond7.preheader.lr.ph.split.us.us ], [ %inc12.us.us, %for.inc11.us.us ]
54 %j.021.us.us = phi i64 [ 0, %for.body9.lr.ph.us.us ], [ %inc.us.us, %for.body9.us.us ]
63 %indvars.iv48 = phi i64 [ %indvars.iv.next49, %for.end13.us ], [ 1, %for.cond1.preheader ]
|
| /external/llvm/test/Analysis/ScalarEvolution/ |
| 2008-07-12-UnneededSelect1.ll | 18 %j.01 = phi i32 [ %8, %bb1 ], [ 0, %bb.nph ] ; <i32> [#uses=1]
|
| 2008-12-08-FiniteSGE.ll | 10 %indvar = phi i32 [ 0, %bb1.thread ], [ %indvar.next, %bb1 ] ; <i32> [#uses=4]
|
| 2009-01-02-SignedNegativeStride.ll | 21 %g_16.tmp.0 = phi i16 [ %g_16.promoted, %bb.nph ], [ %2, %bb1 ] ; <i16> [#uses=1]
|
| sext-iv-1.ll | 15 %i.0.reg2mem.0 = phi i64 [ -128, %bb1.thread ], [ %8, %bb1 ] ; <i64> [#uses=3]
38 %i.0.reg2mem.0 = phi i64 [ -128, %bb1.thread ], [ %8, %bb1 ] ; <i64> [#uses=3]
61 %i.0.reg2mem.0 = phi i64 [ -129, %bb1.thread ], [ %8, %bb1 ] ; <i64> [#uses=3]
84 %i.0.reg2mem.0 = phi i64 [ -128, %bb1.thread ], [ %8, %bb1 ] ; <i64> [#uses=3]
|
| /external/llvm/test/CodeGen/ARM/ |
| 2007-03-27-RegScavengerAssert.ll | 33 %loc_addr.0 = phi %struct.rtx_def** [ %tmp10981099, %cond_true1092 ], [ %loc, %bb1084 ] ; <%struct.rtx_def**> [#uses=0]
|
| 2009-08-04-RegScavengerAssert.ll | 13 %0 = phi i32 [ 0, %entry ], [ %asmtmp.i, %bb5.i ] ; <i32> [#uses=1]
|
