| /art/compiler/sea_ir/ir/ |
| sea.cc | 33 std::vector<PhiInstructionNode*>* phis = region->GetPhiNodes(); local
34 for (std::vector<PhiInstructionNode*>::const_iterator cit = phis->begin();
35 cit != phis->end(); cit++) {
352 std::vector<PhiInstructionNode*>* phis = crt_region->GetPhiNodes(); local
353 for (std::vector<PhiInstructionNode*>::iterator phi_it = phis->begin();
354 phi_it != phis->end(); phi_it++) {
|
| /external/llvm/lib/Transforms/Utils/ |
| BasicBlockUtils.cpp | 99 // Recursively deleting a PHI may cause multiple PHIs to be deleted
100 // or RAUW'd undef, so use an array of WeakVH for the PHIs to delete.
101 SmallVector<WeakVH, 8> PHIs;
104 PHIs.push_back(PN);
107 for (unsigned i = 0, e = PHIs.size(); i != e; ++i)
108 if (PHINode *PN = dyn_cast_or_null<PHINode>(PHIs[i].operator Value*()))
150 // Begin by getting rid of unneeded PHIs.
[all...] |
| BreakCriticalEdges.cpp | 88 /// may require new PHIs in the new exit block. This function inserts the
89 /// new PHIs, as needed. Preds is a list of preds inside the loop, SplitBB
|
| SimplifyCFG.cpp | [all...] |
| /external/chromium_org/v8/src/ |
| lithium-allocator.cc | 557 const ZoneList<HPhi*>* phis = successor->phis(); local
558 for (int i = 0; i < phis->length(); ++i) {
559 HPhi* phi = phis->at(i);
1015 const ZoneList<HPhi*>* phis = block->phis(); local
1276 const ZoneList<HPhi*>* phis = block->phis(); local
[all...] |
| hydrogen-check-elimination.cc | 198 // Create entries for succ block's phis.
199 if (!succ->IsLoopHeader() && succ->phis()->length() > 0) {
202 phi_index < succ->phis()->length();
204 HPhi* phi = succ->phis()->at(phi_index);
|
| /external/llvm/lib/Transforms/IPO/ |
| GlobalOpt.cpp | 612 /// value will trap if the value is dynamically null. PHIs keeps track of any
615 SmallPtrSet<const PHINode*, 8> &PHIs) {
635 if (!AllUsesOfValueWillTrapIfNull(CI, PHIs)) return false;
637 if (!AllUsesOfValueWillTrapIfNull(GEPI, PHIs)) return false;
641 if (PHIs.insert(PN) && !AllUsesOfValueWillTrapIfNull(PN, PHIs))
660 SmallPtrSet<const PHINode*, 8> PHIs;
661 if (!AllUsesOfValueWillTrapIfNull(LI, PHIs))
[all...] |
| /external/chromium_org/v8/src/compiler/ |
| schedule.h | 93 // node. Note that if a basic block has phis, then all phis must appear as the
|
| verifier.cc | 416 // Verify phis are placed in the block of their control input.
422 // TODO(titzer): Nasty special case. Phis from RawMachineAssembler
|
| simplified-lowering.cc | 33 // backwards from uses to definitions, around cycles in phis, according
154 // phis can have 0, if they have not been used in a representation-inducing
270 // Helper for handling phis.
284 // Phis adapt to whatever output representation their uses demand,
[all...] |
| /external/llvm/lib/Analysis/ |
| ScalarEvolutionExpander.cpp | [all...] |
| BasicAliasAnalysis.cpp | 542 /// all visited phi nodes an making sure that the phis cannot reach the
[all...] |
| /external/clang/test/CodeGenObjC/ |
| ns_consume_null_check.m | 32 // Ensure that we build PHIs correctly in the presence of cleanups.
|
| /external/llvm/lib/Target/ARM/ |
| A15SDOptimizer.cpp | 358 // Look through full copies and PHIs to get the set of non-copy MachineInstrs
362 // Looking through PHIs may create loops so we need to track what
620 // PHIs (which are essentially multi-way COPYs). It is because of PHIs that
|
| /external/llvm/test/Transforms/IndVarSimplify/ |
| ada-loops.ll | 10 ; don't check that phis are "folded together" because that is a job
|
| no-iv-rewrite.ll | 278 ; Eliminate the congruent phis j, k, and l.
280 ; Two phis should remain, one starting at %init, and one at %init1.
|
| /external/llvm/test/Transforms/SLPVectorizer/X86/ |
| ordering.ll | 44 ; Make sure we don't vectorize these phis - they have invokes as inputs.
|
| /external/llvm/lib/CodeGen/ |
| MachineSSAUpdater.cpp | 347 /// first calculating the required placement of PHIs and then inserting new
348 /// PHIs where needed.
|
| TailDuplication.cpp | 42 STATISTIC(NumAddedPHIs , "Number of phis added");
362 // Remember which registers are used by phis in this block. This is
[all...] |
| /external/llvm/include/llvm/Transforms/Utils/ |
| SSAUpdater.h | 145 /// for the PHIs to insert. After this is complete, the loads and stores are
|
| /external/llvm/lib/Target/NVPTX/ |
| NVPTXTargetMachine.cpp | 217 // Optimize PHIs before DCE: removing dead PHI cycles may make more
|
| /external/llvm/lib/Transforms/ObjCARC/ |
| ProvenanceAnalysis.cpp | 49 // If the values are PHIs in the same block, we can do a more precise as well
|
| /external/llvm/lib/Transforms/Scalar/ |
| SimplifyCFGPass.cpp | 111 // agree is trivial. Note that they can't agree if there are phis in the
|
| /external/llvm/test/Transforms/ScalarRepl/ |
| phi-select.ll | 2 ; Test promotion of allocas that have phis and select users.
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/plugin/include/ |
| timevar.def | 150 DEFTIMEVAR (TV_TREE_PHIOPT , "tree linearize phis")
|
