| /art/compiler/optimizing/ |
| D | graph_test.cc | 165 ASSERT_EQ(if_block->GetPredecessors().size(), 2u); in TEST_F()
166 ASSERT_EQ(if_block->GetPredecessors()[0], entry_block->GetSingleSuccessor()); in TEST_F()
167 ASSERT_NE(if_block->GetPredecessors()[1], if_block); in TEST_F()
170 ASSERT_EQ(if_block->GetPredecessors()[1], in TEST_F()
197 ASSERT_EQ(if_block->GetPredecessors().size(), 2u); in TEST_F()
198 ASSERT_EQ(if_block->GetPredecessors()[0], entry_block->GetSingleSuccessor()); in TEST_F()
199 ASSERT_NE(if_block->GetPredecessors()[1], if_block); in TEST_F()
202 ASSERT_EQ(if_block->GetPredecessors()[1], in TEST_F()
234 ASSERT_EQ(loop_block->GetPredecessors().size(), 2u); in TEST_F()
269 ASSERT_EQ(loop_block->GetPredecessors().size(), 2u); in TEST_F()
|
| D | loop_optimization_test.cc | 251 EXPECT_EQ(header->GetPredecessors()[0]->GetSinglePredecessor(), entry_block_); in TEST_F()
257 EXPECT_TRUE(input->GetBlock()->Dominates(header->GetPredecessors()[i])); in TEST_F()
309 DCHECK(header->GetPredecessors()[0] == body); in TEST_F()
310 DCHECK(header->GetPredecessors()[1] == preheader0); in TEST_F()
311 DCHECK(header->GetPredecessors()[2] == preheader1); in TEST_F()
321 EXPECT_EQ(header->GetPredecessors().size(), 2u); in TEST_F()
322 EXPECT_EQ(header->GetPredecessors()[1], body); in TEST_F()
|
| D | graph_checker.cc | 57 return block->GetPredecessors().size() == 1u && in IsExitTryBoundaryIntoExitBlock()
96 sorted_predecessors.assign(block->GetPredecessors().begin(), block->GetPredecessors().end()); in VisitBasicBlock()
128 std::count(s->GetPredecessors().begin(), s->GetPredecessors().end(), block); in VisitBasicBlock()
150 for (HBasicBlock* predecessor : block->GetPredecessors()) { in VisitBasicBlock()
231 if (successor->GetPredecessors().size() > 1) { in VisitBasicBlock()
256 for (HBasicBlock* predecessor : block->GetPredecessors()) { in VisitBasicBlock()
691 size_t num_preds = loop_header->GetPredecessors().size(); in HandleLoop()
698 HBasicBlock* first_predecessor = loop_header->GetPredecessors()[0]; in HandleLoop()
704 for (size_t i = 1, e = loop_header->GetPredecessors().size(); i < e; ++i) { in HandleLoop()
705 HBasicBlock* predecessor = loop_header->GetPredecessors()[i]; in HandleLoop()
[all …]
|
| D | dead_code_elimination.cc | 250 block->GetPredecessors().size() == 1u) { in SimplifyAlwaysThrows()
260 succ->GetPredecessors().size() > 1u && in SimplifyAlwaysThrows()
368 HBasicBlock* predecessor_to_update = block->GetPredecessors()[i]; in SimplifyIfs()
390 if (block->GetPredecessors().size() == 1) { in SimplifyIfs()
434 if (successor->IsExitBlock() || successor->GetPredecessors().size() != 1u) { in ConnectSuccessiveBlocks()
|
| D | block_builder.cc | 252 for (HBasicBlock* predecessor : catch_block->GetPredecessors()) { in MightHaveLiveNormalPredecessors()
263 } else if (catch_block->GetPredecessors().empty()) { in MightHaveLiveNormalPredecessors()
361 for (HBasicBlock* predecessor : try_block->GetPredecessors()) { in InsertTryBoundaryBlocks()
432 while (!block->GetPredecessors().empty()) { in InsertSynthesizedLoopsForOsr()
433 block->GetPredecessors()[0]->ReplaceSuccessor(block, loop_block); in InsertSynthesizedLoopsForOsr()
|
| D | load_store_elimination.cc | 1574 ArrayRef<HBasicBlock* const> predecessors(block->GetPredecessors()); in MergePredecessorValues()
1600 DCHECK(!merged_value.IsPureUnknown() || block->GetPredecessors().size() <= 1) in MergePredecessorValues()
1616 if (block->GetPredecessors().empty()) { in MergePredecessorRecords()
1634 ArrayRef<HBasicBlock* const> predecessors(block->GetPredecessors()); in MergePredecessorRecords()
1706 DCHECK_GE(current_block->GetPredecessors().size(), 2u); in MaterializeNonLoopPhis()
1717 for (HBasicBlock* predecessor : current_block->GetPredecessors()) { in MaterializeNonLoopPhis()
1733 if (phi_inputs.size() == current_block->GetPredecessors().size()) { in MaterializeNonLoopPhis()
1922 DCHECK_GE(block->GetPredecessors().size(), 2u); in TryReplacingLoopPhiPlaceholderWithDefault()
1924 for (HBasicBlock* predecessor : block->GetPredecessors()) { in TryReplacingLoopPhiPlaceholderWithDefault()
1946 for (HBasicBlock* predecessor : block->GetPredecessors()) { in TryReplacingLoopPhiPlaceholderWithDefault()
[all …]
|
| D | execution_subgraph.cc | 63 for (HBasicBlock* pred : to_remove->GetPredecessors()) { in RemoveBlock()
290 for (const HBasicBlock* pred : cur->GetPredecessors()) { in RecalculateExcludedCohort()
305 const auto& preds = blk->GetPredecessors(); in RecalculateExcludedCohort()
|
| D | nodes.cc | 471 successor->GetPredecessors().size() - successor->NumberOfBackEdges()) { in ComputeDominanceInformation()
562 if (info->IsBackEdge(*header->GetPredecessors()[0])) { in OrderLoopHeaderPredecessors()
563 HBasicBlock* to_swap = header->GetPredecessors()[0]; in OrderLoopHeaderPredecessors()
564 for (size_t pred = 1, e = header->GetPredecessors().size(); pred < e; ++pred) { in OrderLoopHeaderPredecessors()
565 HBasicBlock* predecessor = header->GetPredecessors()[pred]; in OrderLoopHeaderPredecessors()
581 for (size_t pred = 0; pred < header->GetPredecessors().size(); ++pred) { in FixControlForNewSinglePreheader()
582 HBasicBlock* predecessor = header->GetPredecessors()[pred]; in FixControlForNewSinglePreheader()
636 for (size_t pred = 0; pred < header->GetPredecessors().size(); ++pred) { in TransformLoopToSinglePreheaderFormat()
637 HBasicBlock* predecessor = header->GetPredecessors()[pred]; in TransformLoopToSinglePreheaderFormat()
668 HBasicBlock* pred_block = header->GetPredecessors()[input_pos]; in TransformLoopToSinglePreheaderFormat()
[all …]
|
| D | select_generator.cc | 36 if (block->GetPredecessors().size() != 1u) { in IsSimpleBlock()
180 bool only_two_predecessors = (merge_block->GetPredecessors().size() == 2u); in Run()
|
| D | ssa_liveness_analysis.cc | 361 for (HBasicBlock* predecessor : block->GetPredecessors()) { in FindFirstRegisterHint()
399 if (end == user->GetBlock()->GetPredecessors()[input_index]->GetLifetimeEnd()) { in FindFirstRegisterHint()
406 user->GetBlock()->GetPredecessors()[i]->GetLifetimeEnd() - 1); in FindFirstRegisterHint()
439 const ArenaVector<HBasicBlock*>& predecessors = defined_by_->GetBlock()->GetPredecessors(); in FindHintAtDefinition()
|
| D | reference_type_propagation_test.cc | 324 GetAllocator(), kNoRegNumber, blk->GetPredecessors().size(), DataType::Type::kReference); in RunVisitListTest()
329 for (const auto& [pred, index] : ZipCount(MakeIterationRange(blk->GetPredecessors()))) { in RunVisitListTest()
416 GetAllocator(), kNoRegNumber, blk->GetPredecessors().size(), DataType::Type::kReference); in RunVisitListTest()
421 for (const auto& [pred, index] : ZipCount(MakeIterationRange(blk->GetPredecessors()))) { in RunVisitListTest()
|
| D | linear_order.cc | 101 size_t number_of_forward_predecessors = block->GetPredecessors().size(); in LinearizeGraphInternal()
|
| D | pretty_printer.h | 76 const ArenaVector<HBasicBlock*>& predecessors = block->GetPredecessors(); in VisitBasicBlock()
|
| D | code_sinking.cc | 36 for (HBasicBlock* exit_predecessor : exit->GetPredecessors()) { in Run()
194 : block->GetPredecessors()[use.GetIndex()]; in FindIdealPosition()
|
| D | superblock_cloner.cc | 196 DCHECK(!first_phi_met || copy_succ->GetPredecessors().size() == phi_input_count); in RemapOrigInternalOrIncomingEdge()
240 for (HBasicBlock* orig_pred : orig_block->GetPredecessors()) { in CopyIncomingEdgesForVersioning()
436 HBasicBlock* corresponding_block = phi_block->GetPredecessors()[i]; in ResolvePhi()
622 DCHECK_EQ(exit_block->GetPredecessors().size(), 1u); in ConstructSubgraphClosedSSA()
692 for (HBasicBlock* pred : bb->GetPredecessors()) { in DumpBB()
1101 for (HBasicBlock* pred : block->GetPredecessors()) { in IsSubgraphConnected()
|
| D | register_allocation_resolver.cc | 174 for (HBasicBlock* predecessor : block->GetPredecessors()) { in Resolve()
188 for (size_t i = 0, e = block->GetPredecessors().size(); i < e; ++i) { in Resolve()
189 HBasicBlock* predecessor = block->GetPredecessors()[i]; in Resolve()
490 DCHECK_EQ(to->GetPredecessors().size(), 1u); in ConnectSplitSiblings()
|
| D | optimizing_unit_test.h | 359 auto preds_and_idx = ZipCount(MakeIterationRange(target->GetPredecessors())); in EnsurePredecessorOrder()
360 bool correct_preds = preds.size() == target->GetPredecessors().size() && in EnsurePredecessorOrder()
391 << dump_list(target->GetPredecessors()) << " not " in EnsurePredecessorOrder()
|
| D | loop_optimization.cc | 63 if (block->GetPredecessors().size() == 1 && in IsGotoBlock()
409 DCHECK_EQ(true_succ->GetPredecessors().size(), 1u); in TryToEvaluateIfCondition()
410 DCHECK_EQ(false_succ->GetPredecessors().size(), 1u); in TryToEvaluateIfCondition()
677 if (block->GetPredecessors().size() == 1 && in SimplifyBlocks()
679 block->GetSingleSuccessor()->GetPredecessors().size() == 1) { in SimplifyBlocks()
733 if (exit->GetPredecessors().size() != 1) { in TryOptimizeInnerLoopFinite()
|
| D | instruction_builder.cc | 209 } else if (current_block_->GetPredecessors().size() > 0) { in InitializeBlockLocals()
215 HInstruction* value = ValueOfLocalAt(current_block_->GetPredecessors()[0], local); in InitializeBlockLocals()
217 for (HBasicBlock* predecessor : current_block_->GetPredecessors()) { in InitializeBlockLocals()
234 HInstruction* first_input = ValueOfLocalAt(current_block_->GetPredecessors()[0], local); in InitializeBlockLocals()
238 current_block_->GetPredecessors().size(), in InitializeBlockLocals()
240 for (size_t i = 0; i < current_block_->GetPredecessors().size(); i++) { in InitializeBlockLocals()
241 HInstruction* pred_value = ValueOfLocalAt(current_block_->GetPredecessors()[i], local); in InitializeBlockLocals()
325 for (HBasicBlock* predecessor : block->GetPredecessors()) { in SetLoopHeaderPhiInputs()
|
| D | bounds_check_elimination.cc | 697 DCHECK_EQ(true_successor->GetPredecessors().size(), 1u); in HandleIf()
701 DCHECK_EQ(false_successor->GetPredecessors().size(), 1u); in HandleIf()
939 *phi->GetBlock()->GetPredecessors()[1])); in HasSameInputAtBackEdges()
942 *phi->GetBlock()->GetPredecessors()[i])); in HasSameInputAtBackEdges()
|
| D | gvn.cc | 427 const ArenaVector<HBasicBlock*>& predecessors = block->GetPredecessors(); in VisitBasicBlock()
|
| D | register_allocator_graph_color.cc | 1340 for (HBasicBlock* predecessor : block->GetPredecessors()) { in FindCoalesceOpportunities()
1359 ArrayRef<HBasicBlock* const> predecessors(defined_by->GetBlock()->GetPredecessors()); in FindCoalesceOpportunities()
|
| D | execution_subgraph_test.cc | 943 for (HBasicBlock* pred : remove_implicit->GetPredecessors()) { in TEST_F()
|
| D | superblock_cloner_test.cc | 451 EXPECT_EQ(header->GetPredecessors().size(), 3u); in TEST_F()
|
| D | graph_visualizer.cc | 280 for (HBasicBlock* predecessor : block->GetPredecessors()) { in PrintPredecessors()
|