| /art/compiler/optimizing/ |
| D | loop_optimization_test.cc | 154 b = s->GetSuccessors()[0]; in TEST_F()
165 s = b->GetSuccessors()[1]; in TEST_F()
176 s = b->GetSuccessors()[1]; in TEST_F()
177 HBasicBlock* bi = b->GetSuccessors()[0]; in TEST_F()
181 bi = si->GetSuccessors()[0]; in TEST_F()
203 b = s->GetSuccessors()[0]; in TEST_F()
206 s = b->GetSuccessors()[1]; in TEST_F()
209 s = b->GetSuccessors()[1]; in TEST_F()
232 DCHECK(header->GetSuccessors()[1] == return_block_); in TEST_F()
290 HBasicBlock* body = header->GetSuccessors()[0]; in TEST_F()
|
| D | execution_subgraph.cc | 44 return it == nullptr || it->GetSuccessors().size() <= kMaxFilterableSuccessors; in __anon8468d4a20102()
66 for (auto [succ, i] : ZipCount(MakeIterationRange(pred->GetSuccessors()))) { in RemoveBlock()
143 static_cast<ssize_t>(graph_->GetEntryBlock()->GetSuccessors().size())); in Prune()
161 ssize_t num_entry_succ = graph_->GetEntryBlock()->GetSuccessors().size(); in Prune()
197 if (*cur_succ >= static_cast<ssize_t>(cur_block->GetSuccessors().size())) { in Prune()
205 const HBasicBlock* nxt = cur_block->GetSuccessors()[*cur_succ]; in Prune()
207 << " max: " << cur_block->GetSuccessors().size(); in Prune()
296 for (const HBasicBlock* succ : cur->GetSuccessors()) { in RecalculateExcludedCohort()
309 const auto& succs = blk->GetSuccessors(); in RecalculateExcludedCohort()
|
| D | graph_test.cc | 107 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()
|
| D | superblock_cloner_test.cc | 408 EXPECT_EQ(original_preheader->GetSuccessors().size(), 2u); in TEST_F()
422 HBasicBlock* latch = header->GetSuccessors()[1]; in TEST_F()
483 CreateBasicLoopControlFlow(header, header->GetSuccessors()[1], &header, &loop_body); in TEST_F()
526 CreateBasicLoopControlFlow(header, header->GetSuccessors()[1], &header, &loop_body); in TEST_F()
530 CreateBasicLoopControlFlow(header, header->GetSuccessors()[1], &header, &loop_body); in TEST_F()
584 CreateBasicLoopControlFlow(header, header->GetSuccessors()[1], &header, &loop_body); in TEST_F()
587 CreateBasicLoopControlFlow(header, header->GetSuccessors()[1], &header, &loop_body); in TEST_F()
603 HBasicBlock* loop3_long_exit = loop3_extra_if_block->GetSuccessors()[0]; in TEST_F()
612 loop3_long_exit = loop3_extra_if_block->GetSuccessors()[0]; in TEST_F()
692 CreateBasicLoopControlFlow(header, header->GetSuccessors()[1], &header, &loop_body); in TEST_F()
[all …]
|
| D | pretty_printer.h | 85 const ArenaVector<HBasicBlock*>& successors = block->GetSuccessors(); in VisitBasicBlock()
136 PrintInt(current_block_->GetSuccessors()[0]->GetBlockId()); in VisitGoto()
|
| D | graph_checker.cc | 105 std::count(p->GetSuccessors().begin(), p->GetSuccessors().end(), block); in VisitBasicBlock()
119 sorted_successors.assign(block->GetSuccessors().begin(), block->GetSuccessors().end()); in VisitBasicBlock()
226 if (block->GetSuccessors().size() > 1) { in VisitBasicBlock()
669 if (loop_information->GetPreHeader()->GetSuccessors().size() != 1) { in HandleLoop()
674 loop_information->GetPreHeader()->GetSuccessors().size())); in HandleLoop()
985 if (instruction->GetNumEntries() + 1u != block->GetSuccessors().size()) { in VisitPackedSwitch()
992 block->GetSuccessors().size())); in VisitPackedSwitch()
|
| D | nodes.cc | 88 if (successors_visited[current_id] == current->GetSuccessors().size()) { in FindBackEdges()
92 HBasicBlock* successor = current->GetSuccessors()[successors_visited[current_id]++]; in FindBackEdges()
174 for (HBasicBlock* successor : block->GetSuccessors()) { in RemoveDeadBlocks()
260 DCHECK(ContainsElement(block->GetSuccessors(), successor)); in UpdateDominatorOfSuccessor()
391 for (const HBasicBlock* succ : cur->GetSuccessors()) { in CalculateConnectednessOn()
462 if (successors_visited[current_id] == current->GetSuccessors().size()) { in ComputeDominanceInformation()
465 HBasicBlock* successor = current->GetSuccessors()[successors_visited[current_id]++]; in ComputeDominanceInformation()
497 for (HBasicBlock* successor : block->GetSuccessors()) { in ComputeDominanceInformation()
508 for (HBasicBlock* successor : block->GetSuccessors()) { in ComputeDominanceInformation()
743 if (block->GetSuccessors().size() > 1) { in SimplifyCFG()
[all …]
|
| D | dead_code_elimination.cc | 44 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()
|
| D | block_builder.cc | 250 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()
|
| D | linear_order.cc | 119 for (HBasicBlock* successor : current->GetSuccessors()) { in LinearizeGraphInternal()
|
| D | code_sinking.cc | 284 if (block->GetSuccessors().empty()) { in SinkCodeToUncommonBranch()
288 for (HBasicBlock* successor : block->GetSuccessors()) { in SinkCodeToUncommonBranch()
|
| D | superblock_cloner.cc | 105 for (HBasicBlock* succ : block->GetSuccessors()) { in TraverseSubgraphForConnectivity()
296 if (successors_visited[current_id] == current->GetSuccessors().size()) { in FindBackEdgesLocal()
300 HBasicBlock* successor = current->GetSuccessors()[successors_visited[current_id]++]; in FindBackEdgesLocal()
451 for (HBasicBlock* succ : block->GetSuccessors()) { in SearchForSubgraphExits()
506 for (HBasicBlock* orig_succ : orig_block->GetSuccessors()) { in RemapEdgesSuccessors()
696 for (HBasicBlock* succ : bb->GetSuccessors()) { in DumpBB()
|
| D | loop_optimization.cc | 64 block->GetSuccessors().size() == 1 && in IsGotoBlock()
76 for (HBasicBlock* successor : it_loop.Current()->GetSuccessors()) { in IsEarlyExit()
678 block->GetSuccessors().size() == 1 && in SimplifyBlocks()
682 } else if (block->GetSuccessors().size() == 2) { in SimplifyBlocks()
684 HBasicBlock* succ0 = block->GetSuccessors()[0]; in SimplifyBlocks()
685 HBasicBlock* succ1 = block->GetSuccessors()[1]; in SimplifyBlocks()
726 if (header->GetSuccessors().size() != 2) { in TryOptimizeInnerLoopFinite()
729 HBasicBlock* exit = (header->GetSuccessors()[0] == body) in TryOptimizeInnerLoopFinite()
730 ? header->GetSuccessors()[1] in TryOptimizeInnerLoopFinite()
731 : header->GetSuccessors()[0]; in TryOptimizeInnerLoopFinite()
[all …]
|
| D | gvn.cc | 437 if (dominator->GetSuccessors().size() == 1) { in VisitBasicBlock()
536 for (const HBasicBlock* successor : block->GetSuccessors()) { in WillBeReferencedAgain()
|
| D | nodes_x86.h | 118 return GetBlock()->GetSuccessors()[num_entries_]; in GetDefaultBlock()
|
| D | ssa_liveness_analysis.cc | 177 for (HBasicBlock* successor : block->GetSuccessors()) { in ComputeLiveRanges()
295 for (HBasicBlock* successor : block.GetSuccessors()) { in UpdateLiveOut()
|
| D | execution_subgraph.h | 303 return blk == nullptr || blk->GetSuccessors().size() <= kMaxFilterableSuccessors; in CanAnalyse()
|
| D | codegen_test.cc | 456 HBasicBlock* block = graph_in->GetEntryBlock()->GetSuccessors()[0]; in TEST_F()
502 HBasicBlock* block = graph_in->GetEntryBlock()->GetSuccessors()[0]; in TEST_F()
571 HBasicBlock* block = graph_in->GetEntryBlock()->GetSuccessors()[0]; in TEST_F()
|
| D | loop_analysis.cc | 36 for (HBasicBlock* successor : block->GetSuccessors()) { in CalculateLoopBasicProperties()
|
| D | bounds_check_elimination.cc | 1698 for (HBasicBlock* successor : it_loop.Current()->GetSuccessors()) { in IsEarlyExitLoop()
1891 HBasicBlock* true_block = if_block->GetSuccessors()[0]; // True successor. in TransformLoopForDeoptimizationIfNeeded()
1892 HBasicBlock* false_block = if_block->GetSuccessors()[1]; // False successor. in TransformLoopForDeoptimizationIfNeeded()
|
| D | induction_var_analysis.cc | 115 guard->GetSuccessors().size() == 1) { in IsGuardedBy()
1152 if (body->GetSuccessors().size() != 1 || in RewriteBreakLoop()
|
| D | execution_subgraph_test.cc | 63 for (const HBasicBlock* succ : cur->GetSuccessors()) { in CalculateValidity()
|
| D | nodes.h | 1105 const ArenaVector<HBasicBlock*>& GetSuccessors() const { in GetSuccessors() function
1267 DCHECK_EQ(GetSuccessors().size(), 1u); in GetSingleSuccessor()
1268 return GetSuccessors()[0]; in GetSingleSuccessor()
3425 return GetBlock()->GetSuccessors()[0];
3429 return GetBlock()->GetSuccessors()[1];
3467 HBasicBlock* GetNormalFlowSuccessor() const { return GetBlock()->GetSuccessors()[0]; }
3470 return ArrayRef<HBasicBlock* const>(GetBlock()->GetSuccessors()).SubArray(1u);
3718 return GetBlock()->GetSuccessors()[num_entries_];
|
| D | load_store_elimination_test.cc | 1282 CHECK_EQ(loop_entry->GetSuccessors().size(), 2u); in TEST_F()
1411 CHECK_EQ(loop_entry->GetSuccessors().size(), 2u); in TEST_F()
4170 if (left_loop->GetSuccessors()[0] != left_finish) { in TEST_F()
4452 if (left_loop->GetSuccessors()[0] != return_block) { in TEST_F()
4559 if (left_loop->GetSuccessors()[0] != return_block) { in TEST_F()
|
| D | code_generator.cc | 325 block = block->GetSuccessors()[0]; in FirstNonEmptyBlock()
|