Home
last modified time | relevance | path

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

/art/compiler/optimizing/
Dgraph_test.cc102 ASSERT_EQ(false_block->GetSuccessors()[0], return_block); in TEST()
137 ASSERT_EQ(true_block->GetSuccessors()[0], return_block); in TEST()
244 ASSERT_EQ(if_instr->IfTrueSuccessor()->GetSuccessors().size(), 1u); in TEST()
245 ASSERT_EQ(if_instr->IfTrueSuccessor()->GetSuccessors()[0], in TEST()
282 ASSERT_EQ(if_instr->IfFalseSuccessor()->GetSuccessors().size(), 1u); in TEST()
283 ASSERT_EQ(if_instr->IfFalseSuccessor()->GetSuccessors()[0], in TEST()
Dpretty_printer.h83 const ArenaVector<HBasicBlock*>& successors = block->GetSuccessors(); in VisitBasicBlock()
134 PrintInt(current_block_->GetSuccessors()[0]->GetBlockId()); in VisitGoto()
Ddead_code_elimination.cc38 ArrayRef<HBasicBlock* const> live_successors(block->GetSuccessors()); in MarkReachableBlocks()
66 DCHECK_EQ(live_successors[0], block->GetSuccessors()[switch_index]); in MarkReachableBlocks()
Dgraph_checker.cc61 std::count(p->GetSuccessors().begin(), p->GetSuccessors().end(), block); in VisitBasicBlock()
75 sorted_successors.assign(block->GetSuccessors().begin(), block->GetSuccessors().end()); in VisitBasicBlock()
182 if (block->GetSuccessors().size() > 1) { in VisitBasicBlock()
561 if (loop_information->GetPreHeader()->GetSuccessors().size() != 1) { in HandleLoop()
566 loop_information->GetPreHeader()->GetSuccessors().size())); in HandleLoop()
866 if (instruction->GetNumEntries() + 1u != block->GetSuccessors().size()) { in VisitPackedSwitch()
873 block->GetSuccessors().size())); in VisitPackedSwitch()
Dnodes.cc73 if (successors_visited[current_id] == current->GetSuccessors().size()) { in FindBackEdges()
77 HBasicBlock* successor = current->GetSuccessors()[successors_visited[current_id]++]; in FindBackEdges()
130 for (HBasicBlock* successor : block->GetSuccessors()) { in RemoveDeadBlocks()
212 DCHECK(ContainsElement(block->GetSuccessors(), successor)); in UpdateDominatorOfSuccessor()
247 if (successors_visited[current_id] == current->GetSuccessors().size()) { in ComputeDominanceInformation()
250 HBasicBlock* successor = current->GetSuccessors()[successors_visited[current_id]++]; in ComputeDominanceInformation()
283 for (HBasicBlock* successor : block->GetSuccessors()) { in ComputeDominanceInformation()
295 for (HBasicBlock* successor : block->GetSuccessors()) { in ComputeDominanceInformation()
414 if (block->GetSuccessors().size() > 1) { in SimplifyCFG()
1449 for (HBasicBlock* successor : GetSuccessors()) { in SplitBefore()
[all …]
Dblock_builder.cc214 DCHECK(!graph_->GetEntryBlock()->GetSuccessors().empty()) in MightHaveLiveNormalPredecessors()
333 for (size_t i = 0, e = try_block->GetSuccessors().size(); i < e; ++i) { in InsertTryBoundaryBlocks()
334 HBasicBlock* successor = try_block->GetSuccessors()[i]; in InsertTryBoundaryBlocks()
Dnodes_x86.h105 return GetBlock()->GetSuccessors()[num_entries_]; in GetDefaultBlock()
Dssa_liveness_analysis.cc94 for (HBasicBlock* successor : current->GetSuccessors()) { in LinearizeGraph()
220 for (HBasicBlock* successor : block->GetSuccessors()) { in ComputeLiveRanges()
351 for (HBasicBlock* successor : block.GetSuccessors()) { in UpdateLiveOut()
Dgvn.cc432 if (dominator->GetSuccessors().size() == 1) { in VisitBasicBlock()
525 for (auto successor : block->GetSuccessors()) { in WillBeReferencedAgain()
Dcodegen_test.cc674 HBasicBlock* block = graph_in->GetEntryBlock()->GetSuccessors()[0]; in TEST_F()
722 HBasicBlock* block = graph_in->GetEntryBlock()->GetSuccessors()[0]; in TEST_F()
790 HBasicBlock* block = graph_in->GetEntryBlock()->GetSuccessors()[0]; in TEST_F()
Dbounds_check_elimination.cc1406 for (HBasicBlock* successor : it_loop.Current()->GetSuccessors()) { in IsEarlyExitLoop()
1597 HBasicBlock* true_block = if_block->GetSuccessors()[0]; // True successor. in TransformLoopForDeoptimizationIfNeeded()
1598 HBasicBlock* false_block = if_block->GetSuccessors()[1]; // False successor. in TransformLoopForDeoptimizationIfNeeded()
Dnodes.h836 const ArenaVector<HBasicBlock*>& GetSuccessors() const { in GetSuccessors() function
984 DCHECK_EQ(GetSuccessors().size(), 1u); in GetSingleSuccessor()
985 return GetSuccessors()[0]; in GetSingleSuccessor()
2710 return GetBlock()->GetSuccessors()[0]; in IfTrueSuccessor()
2714 return GetBlock()->GetSuccessors()[1]; in IfFalseSuccessor()
2745 HBasicBlock* GetNormalFlowSuccessor() const { return GetBlock()->GetSuccessors()[0]; } in GetNormalFlowSuccessor()
2748 return ArrayRef<HBasicBlock* const>(GetBlock()->GetSuccessors()).SubArray(1u); in GetExceptionHandlers()
2892 return GetBlock()->GetSuccessors()[num_entries_]; in GetDefaultBlock()
Dcode_generator.cc159 block = block->GetSuccessors()[0]; in FirstNonEmptyBlock()
Dcode_generator_arm64.cc564 const ArenaVector<HBasicBlock*>& successors = switch_instr_->GetBlock()->GetSuccessors(); in EmitTable()
4765 const ArenaVector<HBasicBlock*>& successors = switch_instr->GetBlock()->GetSuccessors(); in VisitPackedSwitch()
Dinstruction_builder.cc335 DCHECK_EQ(current_block_->GetSuccessors().size(), 1u); in Build()
Dcode_generator_x86_64.cc6495 const ArenaVector<HBasicBlock*>& successors = switch_instr->GetBlock()->GetSuccessors(); in VisitPackedSwitch()
6686 const ArenaVector<HBasicBlock*>& successors = block->GetSuccessors(); in CreateJumpTable()
Dcode_generator_arm.cc6660 const ArenaVector<HBasicBlock*>& successors = switch_instr->GetBlock()->GetSuccessors(); in VisitPackedSwitch()
6687 const ArenaVector<HBasicBlock*>& successors = switch_instr->GetBlock()->GetSuccessors(); in VisitPackedSwitch()
Dcode_generator_x86.cc7023 const ArenaVector<HBasicBlock*>& successors = switch_block->GetSuccessors(); in GenPackedSwitchWithCompares()
7263 const ArenaVector<HBasicBlock*>& successors = block->GetSuccessors(); in CreateJumpTable()
Dcode_generator_mips64.cc4157 const ArenaVector<HBasicBlock*>& successors = switch_instr->GetBlock()->GetSuccessors(); in VisitPackedSwitch()
Dcode_generator_mips.cc5147 const ArenaVector<HBasicBlock*>& successors = switch_instr->GetBlock()->GetSuccessors(); in VisitPackedSwitch()