| /external/llvm/lib/CodeGen/ |
| PHIEliminationUtils.h | 1 //=- PHIEliminationUtils.h - Helper functions for PHI elimination -*- C++ -*-=//
|
| /external/llvm/lib/Transforms/Scalar/ |
| Reg2Mem.cpp | 12 // values live across basic blocks are allocas and loads before phi nodes.
35 STATISTIC(NumPhisDemoted, "Number of phi-nodes demoted");
111 // Find all phi's
119 // Demote phi nodes
|
| /external/llvm/test/Analysis/BasicAA/ |
| 2009-10-13-GEP-BaseNoAlias.ll | 25 %P = phi i32* [ %b, %bb ], [ @Y, %bb1 ]
|
| constant-over-index.ll | 15 %i = phi i64 [ 0, %entry ], [ %i.next, %loop ]
|
| phi-spec-order.ll | 13 %nl.018 = phi i32 [ 0, %entry ], [ %inc9, %for.end ]
17 %lsr.iv4 = phi [16000 x double]* [ %i11, %for.body4 ], [ bitcast (double* getelementptr inbounds ([16000 x double]* @Y, i64 0, i64 8)
19 %lsr.iv1 = phi [16000 x double]* [ %i10, %for.body4 ], [ @X, %for.cond2.preheader ]
23 %lsr.iv = phi i32 [ %lsr.iv.next, %for.body4 ], [ 16000, %for.cond2.preheader ]
|
| /external/llvm/test/Analysis/BlockFrequencyInfo/ |
| loop_with_branch.ll | 17 %i = phi i32 [ 0, %entry ], [ %i.next, %back ]
|
| /external/llvm/test/Analysis/BranchProbabilityInfo/ |
| loop.ll | 15 %i.0 = phi i32 [ 0, %entry ], [ %inc3, %do.end ]
21 %j.0 = phi i32 [ 0, %do.body ], [ %inc, %do.body1 ]
55 %i.010 = phi i32 [ 0, %for.body.lr.ph ], [ %inc5, %for.end ]
62 %j.08 = phi i32 [ %inc, %for.body3 ], [ 0, %for.body ]
89 %i.0 = phi i32 [ 0, %entry ], [ %inc4, %if.end ]
98 %j.0 = phi i32 [ %inc, %do.body1 ], [ 0, %do.body ]
125 %i.0 = phi i32 [ 0, %entry ], [ %inc4, %do.end ]
134 %j.0 = phi i32 [ %inc, %do.body1 ], [ 0, %do.body ]
165 %i.0 = phi i32 [ 0, %entry ], [ %inc4, %do.end ]
171 %j.0 = phi i32 [ 0, %do.body ], [ %inc, %if.end
[all...] |
| /external/llvm/test/Analysis/ScalarEvolution/ |
| 2007-07-15-NegativeStride.ll | 13 %i.01.0 = phi i32 [ 100, %entry ], [ %tmp4, %bb ] ; <i32> [#uses=2]
|
| 2008-11-18-LessThanOrEqual.ll | 14 %indvar = phi i32 [ 0, %bb.nph ], [ %indvar.next, %bb1 ] ; <i32> [#uses=2]
|
| 2010-09-03-RequiredTransitive.ll | 13 %indvar1 = phi i64 [ %indvar.next2, %for.inc ], [ 0, %entry ] ; <i64> [#uses=3]
|
| avoid-smax-0.ll | 22 %i.0 = phi i32 [ %7, %bb3 ], [ 0, %bb3.preheader ]
|
| load.ll | 16 %sum.04 = phi i32 [ 0, %entry ], [ %add2, %for.body ]
18 %i.03 = phi i32 [ 0, %entry ], [ %inc, %for.body ]
50 %sum.02 = phi i32 [ 0, %entry ], [ %add, %for.body ]
52 %n.01 = phi %struct.ListNode* [ bitcast ({ %struct.ListNode*, i32, [4 x i8] }* @node5 to %struct.ListNode*), %entry ], [ %1, %for.body ]
|
| sle.ll | 16 %i = phi i64 [ %i.next, %for.body ], [ 0, %entry ] ; <i64> [#uses=2]
|
| trip-count-switch.ll | 10 %i.0 = phi i32 [ 2, %entry ], [ %dec, %if.end ]
|
| trip-count.ll | 19 %i.0 = phi i32 [ 0, %entry ], [ %tmp2, %bb ] ; <i32> [#uses=3]
|
| trip-count2.ll | 25 %i.0 = phi i32 [ 0, %entry ], [ %tmp2, %bb ] ; <i32> [#uses=3]
|
| trip-count4.ll | 12 %indvar = phi i64 [ %n, %entry ], [ %indvar.next, %loop ] ; <i64> [#uses=4]
|
| trip-count6.ll | 13 %mode.0 = phi i8 [ 0, %entry ], [ %indvar.next, %bb4 ] ; <i8> [#uses=4]
|
| zext-wrap.ll | 9 %l_95.0.i1 = phi i8 [ %tmp1, %bb.i ], [ 0, %entry ]
|
| /external/llvm/test/CodeGen/AArch64/ |
| arm64-2011-10-18-LdStOptBug.ll | 18 %indvars.iv = phi i64 [ 0, %entry ], [ %indvars.iv.next, %for.body ]
|
| arm64-cast-opt.ll | 29 %retval.0 = phi i8 [ %conv9, %if.then ], [ 1, %entry ]
|
| arm64-fast-isel-indirectbr.ll | 34 %indirect.goto.dest = phi i8* [ %1, %entry ]
|
| arm64-umaxv.ll | 20 %retval.0 = phi i32 [ %call1, %if.then ], [ 0, %entry ]
43 %retval.0 = phi i32 [ %call1, %if.then ], [ 0, %entry ]
64 %retval.0 = phi i32 [ %call1, %if.then ], [ 0, %entry ]
85 %retval.0 = phi i32 [ %call1, %if.then ], [ 0, %entry ]
|
| arm64-uminv.ll | 20 %retval.0 = phi i32 [ %call1, %if.then ], [ 0, %entry ]
43 %retval.0 = phi i32 [ %call1, %if.then ], [ 0, %entry ]
64 %retval.0 = phi i32 [ %call1, %if.then ], [ 0, %entry ]
85 %retval.0 = phi i32 [ %call1, %if.then ], [ 0, %entry ]
|
| assertion-rc-mismatch.ll | 19 %tmp = phi i8* [ %tmp1, %if ], [ %tmp2, %else ]
|
