| /art/compiler/optimizing/ |
| D | loop_optimization_test.cc | 152 b = s->GetSuccessors()[0]; in TEST_F()
163 s = b->GetSuccessors()[1]; in TEST_F()
174 s = b->GetSuccessors()[1]; in TEST_F()
175 HBasicBlock* bi = b->GetSuccessors()[0]; in TEST_F()
179 bi = si->GetSuccessors()[0]; in TEST_F()
201 b = s->GetSuccessors()[0]; in TEST_F()
204 s = b->GetSuccessors()[1]; in TEST_F()
207 s = b->GetSuccessors()[1]; in TEST_F()
230 DCHECK(header->GetSuccessors()[1] == return_block_); in TEST_F()
288 HBasicBlock* body = header->GetSuccessors()[0]; in TEST_F()
|
| D | graph_test.cc | 108 ASSERT_EQ(false_block->GetSuccessors()[0], return_block); in TEST_F()
140 ASSERT_EQ(true_block->GetSuccessors()[0], return_block); in TEST_F()
238 ASSERT_EQ(if_instr->IfTrueSuccessor()->GetSuccessors().size(), 1u); in TEST_F()
239 ASSERT_EQ(if_instr->IfTrueSuccessor()->GetSuccessors()[0], in TEST_F()
273 ASSERT_EQ(if_instr->IfFalseSuccessor()->GetSuccessors().size(), 1u); in TEST_F()
274 ASSERT_EQ(if_instr->IfFalseSuccessor()->GetSuccessors()[0], in TEST_F()
|
| D | superblock_cloner_test.cc | 409 EXPECT_EQ(original_preheader->GetSuccessors().size(), 2u); in TEST_F()
423 HBasicBlock* latch = header->GetSuccessors()[1]; in TEST_F()
484 CreateBasicLoopControlFlow(header, header->GetSuccessors()[1], &header, &loop_body); in TEST_F()
527 CreateBasicLoopControlFlow(header, header->GetSuccessors()[1], &header, &loop_body); in TEST_F()
531 CreateBasicLoopControlFlow(header, header->GetSuccessors()[1], &header, &loop_body); in TEST_F()
585 CreateBasicLoopControlFlow(header, header->GetSuccessors()[1], &header, &loop_body); in TEST_F()
588 CreateBasicLoopControlFlow(header, header->GetSuccessors()[1], &header, &loop_body); in TEST_F()
604 HBasicBlock* loop3_long_exit = loop3_extra_if_block->GetSuccessors()[0]; in TEST_F()
613 loop3_long_exit = loop3_extra_if_block->GetSuccessors()[0]; in TEST_F()
693 CreateBasicLoopControlFlow(header, header->GetSuccessors()[1], &header, &loop_body); in TEST_F()
[all …]
|
| D | pretty_printer.h | 86 const ArenaVector<HBasicBlock*>& successors = block->GetSuccessors(); in VisitBasicBlock()
137 PrintInt(current_block_->GetSuccessors()[0]->GetBlockId()); in VisitGoto()
|
| D | dead_code_elimination.cc | 48 ArrayRef<HBasicBlock* const> live_successors(block->GetSuccessors()); in MarkReachableBlocks()
76 DCHECK_EQ(live_successors[0], block->GetSuccessors()[switch_index]); in MarkReachableBlocks()
285 if (block->GetSuccessors().size() == 1 && in SimplifyAlwaysThrows()
499 for (HBasicBlock* succ : block->GetSuccessors()) { in MaybeAddPhi()
623 while (block->GetSuccessors().size() > 1) { in DisconnectHandlersAndUpdateTryBoundary()
624 HBasicBlock* handler = block->GetSuccessors()[1]; in DisconnectHandlersAndUpdateTryBoundary()
638 DCHECK_EQ(block->GetSuccessors().size(), 1u); in DisconnectHandlersAndUpdateTryBoundary()
806 merge_true = merge_true->GetSuccessors()[0]; in RemoveEmptyIfs()
812 merge_false = merge_false->GetSuccessors()[0]; in RemoveEmptyIfs()
|
| D | graph_checker.cc | 194 std::count(p->GetSuccessors().begin(), p->GetSuccessors().end(), block); in VisitBasicBlock()
214 sorted_successors.assign(block->GetSuccessors().begin(), block->GetSuccessors().end()); in VisitBasicBlock()
343 if (block->GetSuccessors().empty() && !block->IsExitBlock()) { in VisitBasicBlock()
352 if (block->GetSuccessors().size() > 1) { in VisitBasicBlock()
905 if (loop_information->GetPreHeader()->GetSuccessors().size() != 1) { in HandleLoop()
910 loop_information->GetPreHeader()->GetSuccessors().size())); in HandleLoop()
1220 if (instruction->GetNumEntries() + 1u != block->GetSuccessors().size()) { in VisitPackedSwitch()
1227 block->GetSuccessors().size())); in VisitPackedSwitch()
|
| D | nodes.cc | 90 if (successors_visited[current_id] == current->GetSuccessors().size()) { in FindBackEdges()
94 HBasicBlock* successor = current->GetSuccessors()[successors_visited[current_id]++]; in FindBackEdges()
295 DCHECK(ContainsElement(block->GetSuccessors(), successor)); in UpdateDominatorOfSuccessor()
332 if (successors_visited[current_id] == current->GetSuccessors().size()) { in ComputeDominanceInformation()
335 HBasicBlock* successor = current->GetSuccessors()[successors_visited[current_id]++]; in ComputeDominanceInformation()
367 for (HBasicBlock* successor : block->GetSuccessors()) { in ComputeDominanceInformation()
378 for (HBasicBlock* successor : block->GetSuccessors()) { in ComputeDominanceInformation()
628 if (block->GetSuccessors().size() > 1) { in SimplifyCFG()
987 for (HBasicBlock* successor : it_loop.Current()->GetSuccessors()) { in HasExitEdge()
2076 for (HBasicBlock* successor : GetSuccessors()) { in SplitBefore()
[all …]
|
| D | loop_optimization.cc | 64 block->GetSuccessors().size() == 1 && in IsGotoBlock()
76 for (HBasicBlock* successor : it_loop.Current()->GetSuccessors()) { in IsEarlyExit()
469 if (loop_info->NumberOfBackEdges() != 1 || header->GetSuccessors().size() != 2) { in HasLoopDiamondStructure()
472 HBasicBlock* header_succ_0 = header->GetSuccessors()[0]; in HasLoopDiamondStructure()
473 HBasicBlock* header_succ_1 = header->GetSuccessors()[1]; in HasLoopDiamondStructure()
485 if (diamond_true->GetSuccessors().size() != 1 || diamond_false->GetSuccessors().size() != 1) { in HasLoopDiamondStructure()
819 block->GetSuccessors().size() == 1 && in SimplifyBlocks()
823 } else if (block->GetSuccessors().size() == 2) { in SimplifyBlocks()
825 HBasicBlock* succ0 = block->GetSuccessors()[0]; in SimplifyBlocks()
826 HBasicBlock* succ1 = block->GetSuccessors()[1]; in SimplifyBlocks()
[all …]
|
| D | block_builder.cc | 237 DCHECK(!graph_->GetEntryBlock()->GetSuccessors().empty()) in MightHaveLiveNormalPredecessors()
368 for (size_t i = 0, e = try_block->GetSuccessors().size(); i < e; ++i) { in InsertTryBoundaryBlocks()
369 HBasicBlock* successor = try_block->GetSuccessors()[i]; in InsertTryBoundaryBlocks()
|
| D | linear_order.cc | 119 for (HBasicBlock* successor : current->GetSuccessors()) { in LinearizeGraphInternal()
|
| D | superblock_cloner.cc | 105 for (HBasicBlock* succ : block->GetSuccessors()) { in TraverseSubgraphForConnectivity()
294 if (successors_visited[current_id] == current->GetSuccessors().size()) { in FindBackEdgesLocal()
298 HBasicBlock* successor = current->GetSuccessors()[successors_visited[current_id]++]; in FindBackEdgesLocal()
449 for (HBasicBlock* succ : block->GetSuccessors()) { in SearchForSubgraphExits()
504 for (HBasicBlock* orig_succ : orig_block->GetSuccessors()) { in RemapEdgesSuccessors()
694 for (HBasicBlock* succ : bb->GetSuccessors()) { in DumpBB()
|
| D | gvn.cc | 434 if (dominator->GetSuccessors().size() == 1) { in VisitBasicBlock()
533 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 | 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 | code_sinking.cc | 384 ArrayRef<HBasicBlock* const>(block->GetSuccessors()); in SinkCodeToUncommonBranch()
|
| D | load_store_elimination_test.cc | 1141 CHECK_EQ(loop_entry->GetSuccessors().size(), 2u); in TEST_F()
1270 CHECK_EQ(loop_entry->GetSuccessors().size(), 2u); in TEST_F()
2096 if (left_loop->GetSuccessors()[0] != return_block) { in TEST_F()
2202 if (left_loop->GetSuccessors()[0] != return_block) { in TEST_F()
|
| D | bounds_check_elimination.cc | 1720 for (HBasicBlock* successor : it_loop.Current()->GetSuccessors()) { in IsEarlyExitLoop()
1914 HBasicBlock* true_block = if_block->GetSuccessors()[0]; // True successor. in TransformLoopForDeoptimizationIfNeeded()
1915 HBasicBlock* false_block = if_block->GetSuccessors()[1]; // False successor. in TransformLoopForDeoptimizationIfNeeded()
|
| D | nodes.h | 1132 const ArenaVector<HBasicBlock*>& GetSuccessors() const { in GetSuccessors() function
1294 DCHECK_EQ(GetSuccessors().size(), 1u); in GetSingleSuccessor()
1295 return GetSuccessors()[0]; in GetSingleSuccessor()
3547 return GetBlock()->GetSuccessors()[0];
3551 return GetBlock()->GetSuccessors()[1];
3599 HBasicBlock* GetNormalFlowSuccessor() const { return GetBlock()->GetSuccessors()[0]; }
3602 return ArrayRef<HBasicBlock* const>(GetBlock()->GetSuccessors()).SubArray(1u);
3851 return GetBlock()->GetSuccessors()[num_entries_];
|
| D | induction_var_analysis.cc | 83 guard->GetSuccessors().size() == 1) { in IsGuardedBy()
1270 if (body->GetSuccessors().size() != 1 || in RewriteBreakLoop()
|
| D | code_generator.cc | 249 block = block->GetSuccessors()[0]; in FirstNonEmptyBlock()
|
| D | instruction_builder.cc | 446 DCHECK_EQ(current_block_->GetSuccessors().size(), 1u); in Build()
|
| D | code_generator_arm64.cc | 565 const ArenaVector<HBasicBlock*>& successors = switch_instr_->GetBlock()->GetSuccessors(); in EmitTable()
6652 const ArenaVector<HBasicBlock*>& successors = switch_instr->GetBlock()->GetSuccessors(); in VisitPackedSwitch()
|
| D | code_generator_riscv64.cc | 2040 ArrayRef<HBasicBlock* const> successors(switch_block->GetSuccessors()); in GenPackedSwitchWithCompares()
2070 const ArenaVector<HBasicBlock*>& successors = switch_block->GetSuccessors(); in GenTableBasedPackedSwitch()
|