Home
last modified time | relevance | path

Searched refs:GetPredecessors (Results 1 – 11 of 11) sorted by relevance

/art/compiler/optimizing/
Dssa_builder.cc37 for (size_t pred = 0; pred < block->GetPredecessors().Size(); pred++) { in BuildSsa()
38 HInstruction* input = ValueOfLocal(block->GetPredecessors().Get(pred), phi->GetRegNumber()); in BuildSsa()
84 } else if (block->GetPredecessors().Size() > 0) { in VisitBasicBlock()
90 HInstruction* value = ValueOfLocal(block->GetPredecessors().Get(0), local); in VisitBasicBlock()
92 for (size_t i = 0, e = block->GetPredecessors().Size(); i < e; ++i) { in VisitBasicBlock()
93 HInstruction* current = ValueOfLocal(block->GetPredecessors().Get(i), local); in VisitBasicBlock()
110 GetGraph()->GetArena(), local, block->GetPredecessors().Size(), Primitive::kPrimVoid); in VisitBasicBlock()
111 for (size_t i = 0; i < block->GetPredecessors().Size(); i++) { in VisitBasicBlock()
112 HInstruction* value = ValueOfLocal(block->GetPredecessors().Get(i), local); in VisitBasicBlock()
Dgraph_test.cc162 ASSERT_EQ(if_block->GetPredecessors().Size(), 2u); in TEST()
163 ASSERT_EQ(if_block->GetPredecessors().Get(0), entry_block); in TEST()
164 ASSERT_NE(if_block->GetPredecessors().Get(1), if_block); in TEST()
167 ASSERT_EQ(if_block->GetPredecessors().Get(1), in TEST()
198 ASSERT_EQ(if_block->GetPredecessors().Size(), 2u); in TEST()
199 ASSERT_EQ(if_block->GetPredecessors().Get(0), entry_block); in TEST()
200 ASSERT_NE(if_block->GetPredecessors().Get(1), if_block); in TEST()
203 ASSERT_EQ(if_block->GetPredecessors().Get(1), in TEST()
239 ASSERT_EQ(loop_block->GetPredecessors().Size(), 2u); in TEST()
278 ASSERT_EQ(loop_block->GetPredecessors().Size(), 2u); in TEST()
Dnodes.cc126 block->GetPredecessors().Size() - block->NumberOfBackEdges()) { in VisitBlockForDominatorTree()
180 size_t number_of_incomings = header->GetPredecessors().Size() - info->NumberOfBackEdges(); in SimplifyLoop()
188 for (size_t pred = 0; pred < header->GetPredecessors().Size(); ++pred) { in SimplifyLoop()
189 HBasicBlock* predecessor = header->GetPredecessors().Get(pred); in SimplifyLoop()
208 if (successor->GetPredecessors().Size() > 1) { in SimplifyCFG()
241 for (size_t i = 0, e = block->GetPredecessors().Size(); i < e; ++i) { in PopulateRecursive()
242 PopulateRecursive(block->GetPredecessors().Get(i)); in PopulateRecursive()
266 DCHECK_EQ(header_->GetPredecessors().Size(), 2u); in GetPreHeader()
Dgraph_visualizer.cc87 for (size_t i = 0, e = block->GetPredecessors().Size(); i < e; ++i) { in PrintPredecessors()
88 HBasicBlock* predecessor = block->GetPredecessors().Get(i); in PrintPredecessors()
Dpretty_printer.h74 const GrowableArray<HBasicBlock*>& predecessors = block->GetPredecessors(); in VisitBasicBlock()
Dregister_allocator.cc893 DCHECK_EQ(to->GetPredecessors().Size(), 1u); in ConnectSplitSiblings()
958 for (size_t i = 0, e = block->GetPredecessors().Size(); i < e; ++i) { in Resolve()
959 ConnectSplitSiblings(interval, block->GetPredecessors().Get(i), block); in Resolve()
969 for (size_t i = 0, e = current->GetPredecessors().Size(); i < e; ++i) { in Resolve()
970 HBasicBlock* predecessor = current->GetPredecessors().Get(i); in Resolve()
Dnodes.h272 const GrowableArray<HBasicBlock*>& GetPredecessors() const { in GetPredecessors() function
/art/compiler/sea_ir/ir/
Dregions_test.cc41 std::vector<sea_ir::Region*>* preds = then_region->GetPredecessors(); in TEST_F()
50 preds = then_region->GetPredecessors(); in TEST_F()
53 preds = else_region->GetPredecessors(); in TEST_F()
Dsea.cc82 if ((*crt_it)->GetPredecessors()->size() == 0) { in ComputeIDominators()
88 if ((*crt_it)->GetPredecessors()->size() == 0) { in ComputeIDominators()
93 std::vector<Region*>* preds = (*crt_it)->GetPredecessors(); in ComputeIDominators()
269 if ((*crt_it)->GetPredecessors()->size() == 0) { in ComputeRPO()
438 std::vector<Region*>* preds = (*region_it)->GetPredecessors(); in ComputeDominanceFrontier()
Dsea.h234 std::vector<sea_ir::Region*>* GetPredecessors() { in GetPredecessors() function
/art/compiler/sea_ir/code_gen/
Dcode_gen.cc31 const std::vector<Region*>* predecessors = r->GetPredecessors(); in Visit()
259 const std::vector<Region*>* predecessors = r->GetPredecessors(); in Visit()