| /external/llvm/lib/CodeGen/ |
| EarlyIfConversion.cpp | 78 // Head block, and phis in the Tail block are converted to select instructions.
90 /// The block containing phis after the if-then-else.
120 SmallVector<PHIInfo, 8> PHIs;
207 // There shouldn't normally be any phis in a single-predecessor block.
381 // If Tail doesn't have any phis, there must be side effects.
383 DEBUG(dbgs() << "No phis in tail.\n");
404 // Any phis in the tail block must be convertible to selects.
405 PHIs.clear();
410 PHIs.push_back(&*I);
411 PHIInfo &PI = PHIs.back()
[all...] |
| PHIElimination.cpp | 104 STATISTIC(NumLowered, "Number of phis lowered");
106 STATISTIC(NumReused, "Number of reused lowered phis");
185 return false; // Quick exit for basic blocks without PHIs.
232 assert(MPhi->getOperand(0).getSubReg() == 0 && "Can't handle sub-reg PHIs");
328 "PHIs should have nonempty LiveIntervals.");
476 // Definitions by other PHIs are not truly live-in for our purposes.
549 return false; // Quick exit for basic blocks without PHIs.
633 // LiveVariables considers uses in PHIs to be in the predecessor basic block,
635 // contrast, LiveIntervals considers uses in PHIs to be on the edge rather than
|
| InlineSpiller.cpp | 444 // dominated, phis need checking.
525 // Stop at original PHIs. We don't know the value at the predecessors.
536 // expensive if there are many predecessors and many more PHIs as
543 // Separate all values dominated by OrigVNI into PHIs and non-PHIs.
544 SmallVector<VNInfo*, 8> PHIs, NonPHIs;
557 PHIs.push_back(VNI2);
561 DEBUG(dbgs() << "split phi value, checking " << PHIs.size()
565 // Create entries for all the PHIs. Don't add them to the worklist, we
567 for (unsigned i = 0, e = PHIs.size(); i != e; ++i
[all...] |
| /external/llvm/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 54 PhiT *PHITag; // Marker for existing PHIs that match.
78 /// calculating the required placement of PHIs and then inserting new PHIs
227 /// placing PHIs within the subset CFG.
278 /// FindPHIPlacement - PHIs are needed in the iterated dominance frontiers
279 /// of the known definitions. Iteratively add PHIs in the dom frontiers
321 // and check if existing PHIs can be used. If not, create empty PHIs where
341 // arguments for any new PHIs added in the forward traversal.
|
| /art/compiler/optimizing/ |
| ssa_builder.h | 60 // over these blocks to set the inputs of their phis.
|
| /external/chromium_org/v8/src/ |
| hydrogen-canonicalize.cc | 42 // Eliminate redundant phis in the block first; changes to their inputs
|
| hydrogen-mark-deoptimize.cc | 30 // Process all phis that can reach this phi
|
| hydrogen-bch.cc | 284 for (int i = 0; i < bb->phis()->length(); i++) {
285 HPhi* phi = bb->phis()->at(i);
338 for (int i = 0; i < bb->phis()->length(); i++) {
339 HPhi* phi = bb->phis()->at(i);
|
| hydrogen-escape-analysis.cc | 84 // Create a new state full of phis for loop header entries.
259 // pessimistic about loop headers, add phis for all values.
267 // propagated states, potentially introducing new phis lazily or
268 // adding values to existing phis.
|
| hydrogen-range-analysis.cc | 51 for (int i = 0; i < block->phis()->length(); ++i) {
52 HPhi* phi = block->phis()->at(i);
224 // For phis, we must propagate the check to all of its inputs.
|
| /external/chromium_org/v8/test/mjsunit/regress/ |
| regress-x87.js | 36 // Regression for double-phis
|
| /external/llvm/test/CodeGen/X86/ |
| bss_pagealigned.ll | 7 define void @unxlate_dev_mem_ptr(i64 %phis, i8* %addr) nounwind {
|
| /external/llvm/lib/Transforms/InstCombine/ |
| InstCombinePHI.cpp | 73 // because it would increase the number of PHIs entering the block,
75 // bad when the PHIs are in the header of a loop.
100 // Add all operands to the new PHIs.
143 // especially bad when the PHIs are in the header of a loop.
169 // if one of the PHIs has a constant for the index. The index may be
181 // also requires a PHI, we'd be introducing more PHIs than we're
220 // Add all operands to the new PHIs.
410 // Be careful about transforming integer PHIs. We don't want to pessimize
616 /// inttoptr. We should produce new PHIs in the right type.
620 // of PHIs, along with their offset. These are the things we want to rewrite
[all...] |
| /external/llvm/test/Transforms/LoopStrengthReduce/ |
| 2011-10-03-CritEdgeMerge.ll | 45 ; Handle single-predecessor phis: PR13756
|
| /external/llvm/test/Transforms/SimplifyCFG/ |
| multiple-phis.ll | 5 ; SimplifyCFG if-converts one of the phis, it should do both.
|
| /external/llvm/lib/Target/AArch64/ |
| AArch64ConditionalCompares.cpp | 137 // FIXME: Handle PHIs in Tail by turning them into selects (if-conversion).
173 /// Check if the Tail PHIs are trivially convertible.
176 /// Remove CmpBB from the Tail PHIs.
213 // Check that all PHIs in Tail are selecting the same value from Head and CmpBB.
239 // Assuming that trivialTailPHIs() is true, update the Tail PHIs by simply
403 // There shouldn't normally be any phis in a single-predecessor block.
464 // Tail is allowed to have many predecessors, but we can't handle PHIs yet.
466 // FIXME: Real PHIs could be if-converted as long as the CmpBB values are
471 DEBUG(dbgs() << "Can't handle phis in Tail.\n");
482 // CmpBB should never have PHIs since Head is its only predecessor
[all...] |
| /dalvik/dx/src/com/android/dx/ssa/ |
| DeadCodeRemover.java | 150 // Remove this instruction result from the sources of any phis
251 // If we're tracking local vars, then some phis have side effects.
|
| /external/chromium_org/v8/src/compiler/ |
| common-operator.cc | 177 DCHECK(arguments > 0); // Disallow empty phis.
184 DCHECK(arguments > 0); // Disallow empty phis.
|
| /external/llvm/lib/Transforms/IPO/ |
| PartialInlining.cpp | 87 // one extracted block. For simplicity, just split the PHIs into a two-level
88 // sequence of PHIs, some of which will go in the extracted region, and some
|
| /external/llvm/lib/Transforms/Scalar/ |
| LoopInstSimplify.cpp | 87 // block is the header of a subloop, in which case we only process its phis.
146 // their phis, but we contract the rest of the subloop body and only follow
|
| /external/llvm/include/llvm/Analysis/ |
| ScalarEvolutionExpander.h | 69 /// Phis that complete an IV chain. Reuse
130 /// replaceCongruentIVs - replace congruent phis with their most canonical
131 /// representative. Return the number of phis eliminated.
|
| /external/llvm/test/Feature/ |
| optnone-llc.ll | 47 ; LLC-Ox-DAG: Skipping pass 'Optimize machine instruction PHIs'
|
| /external/llvm/test/Transforms/IndVarSimplify/ |
| 2014-06-21-congruent-constant.ll | 3 ; This used to crash in SCEVExpander when there were congruent phis with and
|
| /external/dexmaker/src/dx/java/com/android/dx/ssa/ |
| DeadCodeRemover.java | 157 // Remove this instruction result from the sources of any phis
258 // If we're tracking local vars, then some phis have side effects.
|
| /external/llvm/test/Transforms/InstCombine/ |
| phi-merge-gep.ll | 5 ; Don't push the geps through these phis, because they would require
6 ; two phis each, which burdens the loop with high register pressure.
|
