/prebuilts/go/linux-x86/src/cmd/compile/internal/ssa/ |
loopreschedchecks.go | 111 // Set up counter. There are no phis etc pre-existing for it. 294 // Except for mem and counter phis, it will be the same value seen on the original 353 // Rewrite appropriate inputs of phis reached in successors 383 // addDFphis creates new trivial phis that are necessary to correctly reflect (within SSA) 385 // These new phis can only occur at the dominance frontier of h; block s is in the dominance 388 // These newly created phis are themselves new definitions that may require addition of their
|
deadstore.go | 27 // Ignore phis - they will always be first and can't be eliminated
|
decompose.go | 290 // and then recursively decomposes the phis for each field. 306 // Recursively decompose phis for each field.
|
deadcode.go | 242 // Remove phi args from c's phis.
|
nilcheck.go | 49 // phis whose arguments are all non-nil
|
schedule.go | 107 // We want all the phis first.
|
nilcheck_test.go | 204 // TestNilcheckPhi tests that nil checks of phis, for which all values are known to be
|
/prebuilts/go/darwin-x86/src/cmd/compile/internal/ssa/ |
deadstore.go | 27 // Ignore phis - they will always be first and can't be eliminated
|
decompose.go | 290 // and then recursively decomposes the phis for each field. 306 // Recursively decompose phis for each field.
|
deadcode.go | 242 // Remove phi args from c's phis.
|
nilcheck.go | 49 // phis whose arguments are all non-nil
|
schedule.go | 107 // We want all the phis first.
|
nilcheck_test.go | 204 // TestNilcheckPhi tests that nil checks of phis, for which all values are known to be
|
/prebuilts/go/darwin-x86/src/cmd/compile/internal/gc/ |
phi.go | 213 // Insert phis at target blocks. 300 // Process phis as new defs. They come before FwdRefs in this block. 342 break // All phis will be at the end of the block during phi building.
|
/prebuilts/go/linux-x86/src/cmd/compile/internal/gc/ |
phi.go | 213 // Insert phis at target blocks. 300 // Process phis as new defs. They come before FwdRefs in this block. 342 break // All phis will be at the end of the block during phi building.
|
/external/mesa3d/src/gallium/drivers/nouveau/codegen/ |
nv50_ir_ra.cpp | 405 PhiMap phis; 411 phis.insert(std::make_pair(std::make_pair(phi, pb), phi->getSrc(j))); 428 PhiMap::iterator it = phis.find(std::make_pair(phi, pb)); 429 assert(it != phis.end()); 430 phis.insert(std::make_pair(std::make_pair(phi, pn), it->second)); 431 phis.erase(it); 440 PhiMap::const_iterator it = phis.find(std::make_pair(phi, pb)); 441 assert(it != phis.end()); [all...] |
/external/v8/src/crankshaft/ |
hydrogen-check-elimination.cc | 199 // Create entries for succ block's phis. 200 if (!succ->IsLoopHeader() && succ->phis()->length() > 0) { 203 phi_index < succ->phis()->length(); 205 HPhi* phi = succ->phis()->at(phi_index);
|
hydrogen.cc | 514 // instructions have been added to the block (they have phis for all 515 // values in the environment, these phis may be eliminated later). 519 DCHECK_EQ(phis()->length(), incoming_env->length()); 773 // Check that phis have correct arguments. 774 for (int j = 0; j < block->phis()->length(); j++) { 775 HPhi* phi = block->phis()->at(j); [all...] |
/art/compiler/optimizing/ |
induction_var_analysis.cc | 32 const HInstructionList& phis = loop->GetHeader()->GetPhis(); local 38 if (other->IsLoopHeaderPhi() && (phi == nullptr || phis.FoundBefore(other, phi))) { [all...] |
/external/mesa3d/src/amd/common/ |
ac_nir_to_llvm.c | 64 struct hash_table *phis; member in struct:nir_to_llvm_context [all...] |
/external/r8/src/main/java/com/android/tools/r8/ir/conversion/ |
IRBuilder.java | 134 * Creates a ValueList of all the operands at the given index in the list of phis. 136 public static ValueList fromPhis(List<Phi> phis, int index) { 138 for (Phi phi : phis) { 377 // Join predecessors for which all phis have the same inputs. This avoids generating the [all...] |
/external/v8/src/compiler/ |
instruction.cc | 704 for (const PhiInstruction* phi : block->phis()) { [all...] |
effect-control-linearizer.cc | 69 // Effect phis that need to be updated after the first pass. 219 NodeVector phis(graph->zone()); 238 phis.push_back(use); 270 for (Node* const phi : phis) { 331 // Iterate over the phis and update the effect phis. 336 // Only go through the phis and effect phis. 340 // IfException blocks should not have effect phis. 354 // Just skip phis [all...] |
register-allocator.cc | [all...] |
/external/v8/src/crankshaft/arm/ |
lithium-arm.cc | 705 DCHECK(block->phis()->length() == 0); 722 // We are at a state join => process phis. 726 for (int i = 0; i < block->phis()->length(); ++i) { 727 HPhi* phi = block->phis()->at(i); [all...] |