Home
last modified time | relevance | path

Searched refs:GetSuccessors (Results 1 – 25 of 29) sorted by relevance

12

/art/compiler/optimizing/
Dloop_optimization_test.cc135 b = s->GetSuccessors()[0]; in TEST_F()
146 s = b->GetSuccessors()[1]; in TEST_F()
157 s = b->GetSuccessors()[1]; in TEST_F()
158 HBasicBlock* bi = b->GetSuccessors()[0]; in TEST_F()
162 bi = si->GetSuccessors()[0]; in TEST_F()
184 b = s->GetSuccessors()[0]; in TEST_F()
187 s = b->GetSuccessors()[1]; in TEST_F()
190 s = b->GetSuccessors()[1]; in TEST_F()
213 DCHECK(header->GetSuccessors()[1] == return_block_); in TEST_F()
271 HBasicBlock* body = header->GetSuccessors()[0]; in TEST_F()
Dgraph_test.cc107 ASSERT_EQ(false_block->GetSuccessors()[0], return_block); in TEST_F()
139 ASSERT_EQ(true_block->GetSuccessors()[0], return_block); in TEST_F()
237 ASSERT_EQ(if_instr->IfTrueSuccessor()->GetSuccessors().size(), 1u); in TEST_F()
238 ASSERT_EQ(if_instr->IfTrueSuccessor()->GetSuccessors()[0], in TEST_F()
272 ASSERT_EQ(if_instr->IfFalseSuccessor()->GetSuccessors().size(), 1u); in TEST_F()
273 ASSERT_EQ(if_instr->IfFalseSuccessor()->GetSuccessors()[0], in TEST_F()
Dsuperblock_cloner_test.cc414 HBasicBlock* latch = header->GetSuccessors()[1]; in TEST_F()
477 CreateBasicLoopControlFlow(header, header->GetSuccessors()[1], &header, &loop_body); in TEST_F()
520 CreateBasicLoopControlFlow(header, header->GetSuccessors()[1], &header, &loop_body); in TEST_F()
524 CreateBasicLoopControlFlow(header, header->GetSuccessors()[1], &header, &loop_body); in TEST_F()
578 CreateBasicLoopControlFlow(header, header->GetSuccessors()[1], &header, &loop_body); in TEST_F()
581 CreateBasicLoopControlFlow(header, header->GetSuccessors()[1], &header, &loop_body); in TEST_F()
598 HBasicBlock* loop3_long_exit = loop3_extra_if_block->GetSuccessors()[0]; in TEST_F()
607 loop3_long_exit = loop3_extra_if_block->GetSuccessors()[0]; in TEST_F()
687 CreateBasicLoopControlFlow(header, header->GetSuccessors()[1], &header, &loop_body); in TEST_F()
691 CreateBasicLoopControlFlow(header, header->GetSuccessors()[1], &header, &loop_body); in TEST_F()
[all …]
Dpretty_printer.h85 const ArenaVector<HBasicBlock*>& successors = block->GetSuccessors(); in VisitBasicBlock()
136 PrintInt(current_block_->GetSuccessors()[0]->GetBlockId()); in VisitGoto()
Dgraph_checker.cc104 std::count(p->GetSuccessors().begin(), p->GetSuccessors().end(), block); in VisitBasicBlock()
118 sorted_successors.assign(block->GetSuccessors().begin(), block->GetSuccessors().end()); in VisitBasicBlock()
225 if (block->GetSuccessors().size() > 1) { in VisitBasicBlock()
663 if (loop_information->GetPreHeader()->GetSuccessors().size() != 1) { in HandleLoop()
668 loop_information->GetPreHeader()->GetSuccessors().size())); in HandleLoop()
979 if (instruction->GetNumEntries() + 1u != block->GetSuccessors().size()) { in VisitPackedSwitch()
986 block->GetSuccessors().size())); in VisitPackedSwitch()
Dnodes_mips.h64 return GetBlock()->GetSuccessors()[num_entries_]; in GetDefaultBlock()
Dnodes.cc80 if (successors_visited[current_id] == current->GetSuccessors().size()) { in FindBackEdges()
84 HBasicBlock* successor = current->GetSuccessors()[successors_visited[current_id]++]; in FindBackEdges()
166 for (HBasicBlock* successor : block->GetSuccessors()) { in RemoveDeadBlocks()
252 DCHECK(ContainsElement(block->GetSuccessors(), successor)); in UpdateDominatorOfSuccessor()
289 if (successors_visited[current_id] == current->GetSuccessors().size()) { in ComputeDominanceInformation()
292 HBasicBlock* successor = current->GetSuccessors()[successors_visited[current_id]++]; in ComputeDominanceInformation()
324 for (HBasicBlock* successor : block->GetSuccessors()) { in ComputeDominanceInformation()
335 for (HBasicBlock* successor : block->GetSuccessors()) { in ComputeDominanceInformation()
570 if (block->GetSuccessors().size() > 1) { in SimplifyCFG()
930 for (HBasicBlock* successor : it_loop.Current()->GetSuccessors()) { in HasExitEdge()
[all …]
Dblock_builder.cc250 DCHECK(!graph_->GetEntryBlock()->GetSuccessors().empty()) in MightHaveLiveNormalPredecessors()
381 for (size_t i = 0, e = try_block->GetSuccessors().size(); i < e; ++i) { in InsertTryBoundaryBlocks()
382 HBasicBlock* successor = try_block->GetSuccessors()[i]; in InsertTryBoundaryBlocks()
Ddead_code_elimination.cc44 ArrayRef<HBasicBlock* const> live_successors(block->GetSuccessors()); in MarkReachableBlocks()
72 DCHECK_EQ(live_successors[0], block->GetSuccessors()[switch_index]); in MarkReachableBlocks()
251 DCHECK_EQ(block->GetSuccessors().size(), 1u); in SimplifyAlwaysThrows()
Dlinear_order.cc119 for (HBasicBlock* successor : current->GetSuccessors()) { in LinearizeGraphInternal()
Dsuperblock_cloner.cc105 for (HBasicBlock* succ : block->GetSuccessors()) { in TraverseSubgraphForConnectivity()
262 if (successors_visited[current_id] == current->GetSuccessors().size()) { in FindBackEdgesLocal()
266 HBasicBlock* successor = current->GetSuccessors()[successors_visited[current_id]++]; in FindBackEdgesLocal()
417 for (HBasicBlock* succ : block->GetSuccessors()) { in SearchForSubgraphExits()
466 for (HBasicBlock* orig_succ : orig_block->GetSuccessors()) { in RemapEdgesSuccessors()
655 for (HBasicBlock* succ : bb->GetSuccessors()) { in DumpBB()
Dcode_sinking.cc283 if (block->GetSuccessors().empty()) { in SinkCodeToUncommonBranch()
287 for (HBasicBlock* successor : block->GetSuccessors()) { in SinkCodeToUncommonBranch()
Dloop_analysis.cc35 for (HBasicBlock* successor : block->GetSuccessors()) { in CalculateLoopBasicProperties()
Dloop_optimization.cc65 block->GetSuccessors().size() == 1 && in IsGotoBlock()
77 for (HBasicBlock* successor : it_loop.Current()->GetSuccessors()) { in IsEarlyExit()
679 block->GetSuccessors().size() == 1 && in SimplifyBlocks()
683 } else if (block->GetSuccessors().size() == 2) { in SimplifyBlocks()
685 HBasicBlock* succ0 = block->GetSuccessors()[0]; in SimplifyBlocks()
686 HBasicBlock* succ1 = block->GetSuccessors()[1]; in SimplifyBlocks()
727 if (header->GetSuccessors().size() != 2) { in TryOptimizeInnerLoopFinite()
730 HBasicBlock* exit = (header->GetSuccessors()[0] == body) in TryOptimizeInnerLoopFinite()
731 ? header->GetSuccessors()[1] in TryOptimizeInnerLoopFinite()
732 : header->GetSuccessors()[0]; in TryOptimizeInnerLoopFinite()
[all …]
Dgvn.cc422 if (dominator->GetSuccessors().size() == 1) { in VisitBasicBlock()
518 for (const HBasicBlock* successor : block->GetSuccessors()) { in WillBeReferencedAgain()
Dnodes_x86.h118 return GetBlock()->GetSuccessors()[num_entries_]; in GetDefaultBlock()
Dssa_liveness_analysis.cc177 for (HBasicBlock* successor : block->GetSuccessors()) { in ComputeLiveRanges()
295 for (HBasicBlock* successor : block.GetSuccessors()) { in UpdateLiveOut()
Dcodegen_test.cc460 HBasicBlock* block = graph_in->GetEntryBlock()->GetSuccessors()[0]; in TEST_F()
507 HBasicBlock* block = graph_in->GetEntryBlock()->GetSuccessors()[0]; in TEST_F()
575 HBasicBlock* block = graph_in->GetEntryBlock()->GetSuccessors()[0]; in TEST_F()
Dbounds_check_elimination.cc1597 for (HBasicBlock* successor : it_loop.Current()->GetSuccessors()) { in IsEarlyExitLoop()
1790 HBasicBlock* true_block = if_block->GetSuccessors()[0]; // True successor. in TransformLoopForDeoptimizationIfNeeded()
1791 HBasicBlock* false_block = if_block->GetSuccessors()[1]; // False successor. in TransformLoopForDeoptimizationIfNeeded()
Dinduction_var_analysis.cc115 guard->GetSuccessors().size() == 1) { in IsGuardedBy()
1152 if (body->GetSuccessors().size() != 1 || in RewriteBreakLoop()
Dnodes.h992 const ArenaVector<HBasicBlock*>& GetSuccessors() const { in GetSuccessors() function
1154 DCHECK_EQ(GetSuccessors().size(), 1u); in GetSingleSuccessor()
1155 return GetSuccessors()[0]; in GetSingleSuccessor()
3163 return GetBlock()->GetSuccessors()[0]; in IfTrueSuccessor()
3167 return GetBlock()->GetSuccessors()[1]; in IfFalseSuccessor()
3205 HBasicBlock* GetNormalFlowSuccessor() const { return GetBlock()->GetSuccessors()[0]; } in GetNormalFlowSuccessor()
3208 return ArrayRef<HBasicBlock* const>(GetBlock()->GetSuccessors()).SubArray(1u); in GetExceptionHandlers()
3456 return GetBlock()->GetSuccessors()[num_entries_]; in GetDefaultBlock()
Dcode_generator.cc330 block = block->GetSuccessors()[0]; in FirstNonEmptyBlock()
Dinstruction_builder.cc397 DCHECK_EQ(current_block_->GetSuccessors().size(), 1u); in Build()
Dcode_generator_arm64.cc590 const ArenaVector<HBasicBlock*>& successors = switch_instr_->GetBlock()->GetSuccessors(); in EmitTable()
5641 const ArenaVector<HBasicBlock*>& successors = switch_instr->GetBlock()->GetSuccessors(); in VisitPackedSwitch()
Dcode_generator_mips64.cc7515 const ArenaVector<HBasicBlock*>& successors = switch_block->GetSuccessors(); in GenPackedSwitchWithCompares()
7545 const ArenaVector<HBasicBlock*>& successors = switch_block->GetSuccessors(); in GenTableBasedPackedSwitch()

12