/third_party/node/deps/v8/src/maglev/ |
H A D | maglev-basic-block.h | 28 if (has_phi()) return phis()->first()->id(); in first_id() 33 if (has_phi()) return phis()->first()->id(); in FirstNonGapMoveId() 68 Phi::List* phis() const { in phis() function in v8::internal::maglev::BasicBlock 70 return state_->phis(); in phis()
|
H A D | maglev-regalloc.cc | 258 // Activate phis. in AllocateRegisters() 262 for (Phi* phi : *block->phis()) { in AllocateRegisters() 267 for (Phi* phi : *block->phis()) { in AllocateRegisters() 282 for (Phi* phi : *block->phis()) { in AllocateRegisters() 510 // Inject allocation into target phis. in AllocateControlNode() 514 Phi::List* phis = target->phis(); in AllocateControlNode() local 515 for (Phi* phi : *phis) { in AllocateControlNode() 519 for (Phi* phi : *phis) UpdateUse(&phi->input(block->predecessor_id())); in AllocateControlNode() 526 // Merge register values. Values only flowing into phis an in AllocateControlNode() [all...] |
H A D | maglev-interpreter-frame-state.h | 350 Phi::List* phis() { return &phis_; } in phis() function in v8::internal::maglev::MergePointInterpreterFrameState 352 void SetPhis(Phi::List&& phis) { in SetPhis() argument 353 // Move the collected phis to the live interpreter frame. in SetPhis() 355 phis_.MoveTail(&phis, phis.begin()); in SetPhis() 415 // It's possible that merged == unmerged at this point since loop-phis are in MergeValue() 438 // letting the register allocator remove phis, we could always merge through in MergeValue()
|
H A D | maglev-vreg-allocator.h | 33 for (Phi* phi : *block->phis()) { in PostProcessGraph()
|
H A D | maglev-compiler.cc | 82 // Don't mark Phi uses when visiting the node, because of loop phis. in Process() 94 for (Phi* phi : *target->phis()) { in Process() 104 for (Phi* phi : *target->phis()) { in Process()
|
H A D | maglev-code-generator.cc | 268 Phi::List* phis = target->phis(); in EmitBlockEndGapMoves() local 269 for (Phi* phi : *phis) { in EmitBlockEndGapMoves()
|
H A D | maglev-graph-processor.h | 93 for (Phi* phi : *block->phis()) { in ProcessGraph()
|
/third_party/mesa3d/src/compiler/nir/ |
H A D | nir_phi_builder.c | 53 /* Needed so we can create phis and undefs */ 63 struct exec_list phis; member 127 exec_list_make_empty(&val->phis); in nir_phi_builder_add_value() 238 exec_list_push_tail(&val->phis, &phi->instr.node); in nir_phi_builder_value_get_block_def() 279 while (!exec_list_is_empty(&val->phis)) { in nir_phi_builder_finish() 280 struct exec_node *head = exec_list_get_head(&val->phis); in nir_phi_builder_finish()
|
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/IR/ |
H A D | BasicBlock.h | 326 /// Returns a range that iterates over the phis in the basic block. 329 iterator_range<const_phi_iterator> phis() const { in phis() function in llvm::final 330 return const_cast<BasicBlock *>(this)->phis(); in phis() 332 iterator_range<phi_iterator> phis();
|
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Scalar/ |
H A D | LoopInterchange.cpp | 683 for (PHINode &PHI : L->getHeader()->phis()) { 900 for (PHINode &PHI : InnerExit->phis()) { 924 for (PHINode &PHI : LoopNestExit->phis()) { 1363 for (PHINode &P : make_early_inc_range(InnerExit->phis())) { 1369 // Skip phis with incoming values from the inner loop body, excluding the 1380 "Can only replace phis iff the uses are in the loop nest exit or " 1388 for (PHINode &P : InnerExit->phis()) 1392 for (PHINode &P : InnerLatch->phis()) 1413 for (PHINode &P : OuterExit->phis()) { 1550 for (PHINode &PHI : drop_begin(InnerLoopHeader->phis(), [all...] |
H A D | LoopDeletion.cpp | 54 for (PHINode &P : ExitBlock->phis()) { in isLoopDead() 163 for (PHINode &P : ExitBlock->phis()) { in deleteLoopIfDead()
|
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/ |
H A D | PhiValues.cpp | 35 // and to do the same for all of the phis reachable from this phi, as doing so 39 // * All phis in a strongly connected component will have the same reachable 49 // including phis, as that makes invalidateValue easier. 58 // Recursively process the incoming phis of this phi. in processPhi() 78 // Now that incoming phis have been handled, push this phi to the stack. in processPhi() 81 // If the depth number has not changed then we've finished collecting the phis in processPhi() 84 // Collect the reachable values for this component. The phis of this in processPhi() 118 // Filter out phis to get the non-phi reachable values. in processPhi() 168 for (const PHINode &PN : BB.phis()) { in print() 201 for (const PHINode &PN : BB.phis()) in run() [all...] |
H A D | DivergenceAnalysis.cpp | 218 for (auto &Phi : UserBlock->phis()) { in taintLoopLiveOuts() 254 for (const auto &Phi : Block.phis()) { in pushPHINodes()
|
/third_party/skia/third_party/externals/spirv-tools/test/opt/ |
H A D | scalar_analysis.cpp | 1194 std::vector<const Instruction*> phis{}; in TEST_F() 1198 phis.push_back(&inst); in TEST_F() 1202 EXPECT_EQ(phis.size(), 2u); in TEST_F() 1203 SENode* phi_node_1 = analysis.AnalyzeInstruction(phis[0]); in TEST_F() 1204 SENode* phi_node_2 = analysis.AnalyzeInstruction(phis[1]); in TEST_F()
|
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/test/opt/ |
H A D | scalar_analysis.cpp | 1194 std::vector<const Instruction*> phis{}; in TEST_F() 1198 phis.push_back(&inst); in TEST_F() 1202 EXPECT_EQ(phis.size(), 2u); in TEST_F() 1203 SENode* phi_node_1 = analysis.AnalyzeInstruction(phis[0]); in TEST_F() 1204 SENode* phi_node_2 = analysis.AnalyzeInstruction(phis[1]); in TEST_F()
|
/third_party/spirv-tools/test/opt/ |
H A D | scalar_analysis.cpp | 1190 std::vector<const Instruction*> phis{}; in TEST_F() 1194 phis.push_back(&inst); in TEST_F() 1198 EXPECT_EQ(phis.size(), 2u); in TEST_F() 1199 SENode* phi_node_1 = analysis.AnalyzeInstruction(phis[0]); in TEST_F() 1200 SENode* phi_node_2 = analysis.AnalyzeInstruction(phis[1]); in TEST_F()
|
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/ObjCARC/ |
H A D | ObjCARC.h | 88 for (auto &P : BB->phis()) { in getEquivalentPHIs()
|
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Utils/ |
H A D | CallPromotionUtils.cpp | 49 for (PHINode &Phi : Invoke->getNormalDest()->phis()) { in fixupPHINodeForNormalDest() 81 for (PHINode &Phi : Invoke->getUnwindDest()->phis()) { in fixupPHINodeForUnwindDest()
|
H A D | LoopUnrollAndJam.cpp | 94 for (auto &Phi : Header->phis()) { in processHeaderPhiOperands() 392 // value from the previous iteration's phis in UnrollAndJamLoop() 393 for (PHINode &Phi : ForeBlocksFirst[It]->phis()) { in UnrollAndJamLoop() 414 for (PHINode &Phi : BB->phis()) { in UnrollAndJamLoop() 424 for (PHINode &Phi : BB->phis()) { in UnrollAndJamLoop() 436 // Move all the phis from Src into Dest in UnrollAndJamLoop() 472 // Subloop successors and phis in UnrollAndJamLoop() 497 // Aft blocks successors and phis in UnrollAndJamLoop()
|
H A D | LoopUnroll.cpp | 190 for (const PHINode &PN : Header->phis()) { in isEpilogProfitable() 642 for (PHINode &PHI : Succ->phis()) { in UnrollLoop() 731 for (PHINode &Phi : Succ->phis()) in UnrollLoop()
|
H A D | LoopUnrollRuntime.cpp | 94 for (PHINode &PN : Succ->phis()) { in ConnectProlog() 207 for (PHINode &PN : NewExit->phis()) { in ConnectEpilog() 251 // Skip this as we already updated phis in exit blocks. in ConnectEpilog() 254 for (PHINode &PN : Succ->phis()) { in ConnectEpilog()
|
/third_party/skia/third_party/externals/swiftshader/src/Pipeline/ |
H A D | SpirvShaderControlFlow.cpp | 667 auto storageIt = state->routine->phis.find(objectId); in LoadPhi() 668 ASSERT(storageIt != state->routine->phis.end()); in LoadPhi() 685 auto storageIt = state->routine->phis.find(objectId); in StorePhi() 686 ASSERT(storageIt != state->routine->phis.end()); in StorePhi()
|
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/ |
H A D | MachineBasicBlock.h | 243 /// Returns a range that iterates over the phis in the basic block. 244 inline iterator_range<iterator> phis() { in phis() function in llvm::MachineBasicBlock 247 inline iterator_range<const_iterator> phis() const { in phis() function in llvm::MachineBasicBlock 248 return const_cast<MachineBasicBlock *>(this)->phis(); in phis()
|
/third_party/mesa3d/src/nouveau/codegen/ |
H A D | nv50_ir_ra.cpp | 439 PhiMap phis; in splitEdges() 445 phis.insert(std::make_pair(std::make_pair(phi, pb), phi->getSrc(j))); in splitEdges() 462 PhiMap::iterator it = phis.find(std::make_pair(phi, pb)); in splitEdges() 463 assert(it != phis.end()); in splitEdges() 464 phis.insert(std::make_pair(std::make_pair(phi, pn), it->second)); in splitEdges() 465 phis.erase(it); in splitEdges() 474 PhiMap::const_iterator it = phis.find(std::make_pair(phi, pb)); in splitEdges() 475 assert(it != phis.end()); in splitEdges() 2008 for (int phis = 0; phi->srcExists(phis); in resolveSplitsAndMerges() [all...] |
/third_party/node/deps/v8/src/compiler/backend/ |
H A D | register-allocator-verifier.cc | 397 } else if (block->PredecessorCount() == 1 && block->phis().size() == 0) { in CreateForBlock() 458 CHECK(origin->PredecessorCount() > 1 || origin->phis().size() > 0); in ValidatePendingAssessment() 466 for (const PhiInstruction* candidate : origin->phis()) { in ValidatePendingAssessment() 515 // define duplicate phis. in ValidatePendingAssessment()
|