Home
last modified time | relevance | path

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

/art/compiler/optimizing/
Dloop_optimization_test.cc137 b = s->GetSuccessors()[0]; in TEST_F()
148 s = b->GetSuccessors()[1]; in TEST_F()
159 s = b->GetSuccessors()[1]; in TEST_F()
160 HBasicBlock* bi = b->GetSuccessors()[0]; in TEST_F()
164 bi = si->GetSuccessors()[0]; in TEST_F()
186 b = s->GetSuccessors()[0]; in TEST_F()
189 s = b->GetSuccessors()[1]; in TEST_F()
192 s = b->GetSuccessors()[1]; in TEST_F()
Dgraph_test.cc101 ASSERT_EQ(false_block->GetSuccessors()[0], return_block); in TEST()
136 ASSERT_EQ(true_block->GetSuccessors()[0], return_block); in TEST()
243 ASSERT_EQ(if_instr->IfTrueSuccessor()->GetSuccessors().size(), 1u); in TEST()
244 ASSERT_EQ(if_instr->IfTrueSuccessor()->GetSuccessors()[0], in TEST()
281 ASSERT_EQ(if_instr->IfFalseSuccessor()->GetSuccessors().size(), 1u); in TEST()
282 ASSERT_EQ(if_instr->IfFalseSuccessor()->GetSuccessors()[0], in TEST()
Dpretty_printer.h85 const ArenaVector<HBasicBlock*>& successors = block->GetSuccessors(); in VisitBasicBlock()
136 PrintInt(current_block_->GetSuccessors()[0]->GetBlockId()); in VisitGoto()
Dnodes_mips.h60 return GetBlock()->GetSuccessors()[num_entries_]; in GetDefaultBlock()
Dgraph_checker.cc63 std::count(p->GetSuccessors().begin(), p->GetSuccessors().end(), block); in VisitBasicBlock()
77 sorted_successors.assign(block->GetSuccessors().begin(), block->GetSuccessors().end()); in VisitBasicBlock()
184 if (block->GetSuccessors().size() > 1) { in VisitBasicBlock()
567 if (loop_information->GetPreHeader()->GetSuccessors().size() != 1) { in HandleLoop()
572 loop_information->GetPreHeader()->GetSuccessors().size())); in HandleLoop()
879 if (instruction->GetNumEntries() + 1u != block->GetSuccessors().size()) { in VisitPackedSwitch()
886 block->GetSuccessors().size())); in VisitPackedSwitch()
Dnodes.cc75 if (successors_visited[current_id] == current->GetSuccessors().size()) { in FindBackEdges()
79 HBasicBlock* successor = current->GetSuccessors()[successors_visited[current_id]++]; in FindBackEdges()
129 for (HBasicBlock* successor : block->GetSuccessors()) { in RemoveDeadBlocks()
211 DCHECK(ContainsElement(block->GetSuccessors(), successor)); in UpdateDominatorOfSuccessor()
246 if (successors_visited[current_id] == current->GetSuccessors().size()) { in ComputeDominanceInformation()
249 HBasicBlock* successor = current->GetSuccessors()[successors_visited[current_id]++]; in ComputeDominanceInformation()
281 for (HBasicBlock* successor : block->GetSuccessors()) { in ComputeDominanceInformation()
292 for (HBasicBlock* successor : block->GetSuccessors()) { in ComputeDominanceInformation()
409 if (block->GetSuccessors().size() > 1) { in SimplifyCFG()
755 for (HBasicBlock* successor : it_loop.Current()->GetSuccessors()) { in HasExitEdge()
[all …]
Dblock_builder.cc224 DCHECK(!graph_->GetEntryBlock()->GetSuccessors().empty()) in MightHaveLiveNormalPredecessors()
347 for (size_t i = 0, e = try_block->GetSuccessors().size(); i < e; ++i) { in InsertTryBoundaryBlocks()
348 HBasicBlock* successor = try_block->GetSuccessors()[i]; in InsertTryBoundaryBlocks()
Dnodes_x86.h111 return GetBlock()->GetSuccessors()[num_entries_]; in GetDefaultBlock()
Dloop_optimization.cc48 block->GetSuccessors().size() == 1 && in IsGotoBlock()
60 for (HBasicBlock* successor : it_loop.Current()->GetSuccessors()) { in IsEarlyExit()
466 block->GetSuccessors().size() == 1 && in SimplifyBlocks()
470 } else if (block->GetSuccessors().size() == 2) { in SimplifyBlocks()
472 HBasicBlock* succ0 = block->GetSuccessors()[0]; in SimplifyBlocks()
473 HBasicBlock* succ1 = block->GetSuccessors()[1]; in SimplifyBlocks()
515 if (header->GetSuccessors().size() != 2) { in OptimizeInnerLoop()
518 HBasicBlock* exit = (header->GetSuccessors()[0] == body) in OptimizeInnerLoop()
519 ? header->GetSuccessors()[1] in OptimizeInnerLoop()
520 : header->GetSuccessors()[0]; in OptimizeInnerLoop()
[all …]
Dlinear_order.cc115 for (HBasicBlock* successor : current->GetSuccessors()) { in LinearizeGraph()
Dcode_sinking.cc264 if (block->GetSuccessors().empty()) { in SinkCodeToUncommonBranch()
268 for (HBasicBlock* successor : block->GetSuccessors()) { in SinkCodeToUncommonBranch()
Ddead_code_elimination.cc39 ArrayRef<HBasicBlock* const> live_successors(block->GetSuccessors()); in MarkReachableBlocks()
67 DCHECK_EQ(live_successors[0], block->GetSuccessors()[switch_index]); in MarkReachableBlocks()
Dgvn.cc432 if (dominator->GetSuccessors().size() == 1) { in VisitBasicBlock()
525 for (const HBasicBlock* successor : block->GetSuccessors()) { in WillBeReferencedAgain()
Dssa_liveness_analysis.cc148 for (HBasicBlock* successor : block->GetSuccessors()) { in ComputeLiveRanges()
277 for (HBasicBlock* successor : block.GetSuccessors()) { in UpdateLiveOut()
Dcodegen_test.cc457 HBasicBlock* block = graph_in->GetEntryBlock()->GetSuccessors()[0]; in TEST_F()
505 HBasicBlock* block = graph_in->GetEntryBlock()->GetSuccessors()[0]; in TEST_F()
573 HBasicBlock* block = graph_in->GetEntryBlock()->GetSuccessors()[0]; in TEST_F()
Dbounds_check_elimination.cc1511 for (HBasicBlock* successor : it_loop.Current()->GetSuccessors()) { in IsEarlyExitLoop()
1701 HBasicBlock* true_block = if_block->GetSuccessors()[0]; // True successor. in TransformLoopForDeoptimizationIfNeeded()
1702 HBasicBlock* false_block = if_block->GetSuccessors()[1]; // False successor. in TransformLoopForDeoptimizationIfNeeded()
Dnodes.h937 const ArenaVector<HBasicBlock*>& GetSuccessors() const { in GetSuccessors() function
1085 DCHECK_EQ(GetSuccessors().size(), 1u); in GetSingleSuccessor()
1086 return GetSuccessors()[0]; in GetSingleSuccessor()
2923 return GetBlock()->GetSuccessors()[0]; in IfTrueSuccessor()
2927 return GetBlock()->GetSuccessors()[1]; in IfFalseSuccessor()
2958 HBasicBlock* GetNormalFlowSuccessor() const { return GetBlock()->GetSuccessors()[0]; } in GetNormalFlowSuccessor()
2961 return ArrayRef<HBasicBlock* const>(GetBlock()->GetSuccessors()).SubArray(1u); in GetExceptionHandlers()
3194 return GetBlock()->GetSuccessors()[num_entries_]; in GetDefaultBlock()
Dcode_generator.cc183 block = block->GetSuccessors()[0]; in FirstNonEmptyBlock()
Dinstruction_builder.cc354 DCHECK_EQ(current_block_->GetSuccessors().size(), 1u); in Build()
Dcode_generator_arm64.cc659 const ArenaVector<HBasicBlock*>& successors = switch_instr_->GetBlock()->GetSuccessors(); in EmitTable()
5783 const ArenaVector<HBasicBlock*>& successors = switch_instr->GetBlock()->GetSuccessors(); in VisitPackedSwitch()
Dcode_generator_mips64.cc6235 const ArenaVector<HBasicBlock*>& successors = switch_block->GetSuccessors(); in GenPackedSwitchWithCompares()
6265 const ArenaVector<HBasicBlock*>& successors = switch_block->GetSuccessors(); in GenTableBasedPackedSwitch()
Dcode_generator_x86_64.cc6784 const ArenaVector<HBasicBlock*>& successors = switch_instr->GetBlock()->GetSuccessors(); in VisitPackedSwitch()
7012 const ArenaVector<HBasicBlock*>& successors = block->GetSuccessors(); in CreateJumpTable()
Dcode_generator_x86.cc7385 const ArenaVector<HBasicBlock*>& successors = switch_block->GetSuccessors(); in GenPackedSwitchWithCompares()
7635 const ArenaVector<HBasicBlock*>& successors = block->GetSuccessors(); in CreateJumpTable()
Dcode_generator_arm_vixl.cc2551 const ArenaVector<HBasicBlock*>& successors = switch_instr_->GetBlock()->GetSuccessors(); in FixTable()
9380 const ArenaVector<HBasicBlock*>& successors = switch_instr->GetBlock()->GetSuccessors(); in VisitPackedSwitch()
Dcode_generator_mips.cc8655 const ArenaVector<HBasicBlock*>& successors = switch_block->GetSuccessors(); in GenPackedSwitchWithCompares()
8686 const ArenaVector<HBasicBlock*>& successors = switch_block->GetSuccessors(); in GenTableBasedPackedSwitch()