| /art/compiler/optimizing/ |
| D | graph_test.cc | 166 ASSERT_EQ(if_block->GetPredecessors().size(), 2u); in TEST_F()
167 ASSERT_EQ(if_block->GetPredecessors()[0], entry_block->GetSingleSuccessor()); in TEST_F()
168 ASSERT_NE(if_block->GetPredecessors()[1], if_block); in TEST_F()
171 ASSERT_EQ(if_block->GetPredecessors()[1], in TEST_F()
198 ASSERT_EQ(if_block->GetPredecessors().size(), 2u); in TEST_F()
199 ASSERT_EQ(if_block->GetPredecessors()[0], entry_block->GetSingleSuccessor()); in TEST_F()
200 ASSERT_NE(if_block->GetPredecessors()[1], if_block); in TEST_F()
203 ASSERT_EQ(if_block->GetPredecessors()[1], in TEST_F()
235 ASSERT_EQ(loop_block->GetPredecessors().size(), 2u); in TEST_F()
270 ASSERT_EQ(loop_block->GetPredecessors().size(), 2u); in TEST_F()
|
| D | loop_optimization_test.cc | 249 EXPECT_EQ(header->GetPredecessors()[0]->GetSinglePredecessor(), entry_block_); in TEST_F()
255 EXPECT_TRUE(input->GetBlock()->Dominates(header->GetPredecessors()[i])); in TEST_F()
307 DCHECK(header->GetPredecessors()[0] == body); in TEST_F()
308 DCHECK(header->GetPredecessors()[1] == preheader0); in TEST_F()
309 DCHECK(header->GetPredecessors()[2] == preheader1); in TEST_F()
319 EXPECT_EQ(header->GetPredecessors().size(), 2u); in TEST_F()
320 EXPECT_EQ(header->GetPredecessors()[1], body); in TEST_F()
|
| D | code_sinking.cc | 50 for (HBasicBlock* exit_predecessor : exit->GetPredecessors()) { in UncommonBranchSinking()
222 : block->GetPredecessors()[use.GetIndex()]; in FindIdealPosition()
586 for (HBasicBlock* pred : exit->GetPredecessors()) { in ReturnSinking()
606 for (size_t i = 0; i < exit->GetPredecessors().size(); /*++i in loop*/) { in ReturnSinking()
607 HBasicBlock* pred = exit->GetPredecessors()[i]; in ReturnSinking()
631 for (size_t i = 0; i < exit->GetPredecessors().size(); /*++i in loop*/) { in ReturnSinking()
632 HBasicBlock* pred = exit->GetPredecessors()[i]; in ReturnSinking()
|
| D | block_builder.cc | 239 for (HBasicBlock* predecessor : catch_block->GetPredecessors()) { in MightHaveLiveNormalPredecessors()
250 } else if (catch_block->GetPredecessors().empty()) { in MightHaveLiveNormalPredecessors()
348 for (HBasicBlock* predecessor : try_block->GetPredecessors()) { in InsertTryBoundaryBlocks()
419 while (!block->GetPredecessors().empty()) { in InsertSynthesizedLoopsForOsr()
420 block->GetPredecessors()[0]->ReplaceSuccessor(block, loop_block); in InsertSynthesizedLoopsForOsr()
|
| D | load_store_elimination.cc | 1533 ArrayRef<HBasicBlock* const> predecessors(block->GetPredecessors()); in MergePredecessorValues()
1559 DCHECK_IMPLIES(merged_value.IsPureUnknown(), block->GetPredecessors().size() <= 1) in MergePredecessorValues()
1575 if (block->GetPredecessors().empty() || block->IsCatchBlock()) { in MergePredecessorRecords()
1576 DCHECK_IMPLIES(block->GetPredecessors().empty(), block->IsEntryBlock()); in MergePredecessorRecords()
1593 ArrayRef<HBasicBlock* const> predecessors(block->GetPredecessors()); in MergePredecessorRecords()
1664 DCHECK_GE(current_block->GetPredecessors().size(), 2u); in MaterializeNonLoopPhis()
1675 for (HBasicBlock* predecessor : current_block->GetPredecessors()) { in MaterializeNonLoopPhis()
1690 if (phi_inputs.size() == current_block->GetPredecessors().size()) { in MaterializeNonLoopPhis()
1884 DCHECK_GE(block->GetPredecessors().size(), 2u); in TryReplacingLoopPhiPlaceholderWithDefault()
1886 for (HBasicBlock* predecessor : block->GetPredecessors()) { in TryReplacingLoopPhiPlaceholderWithDefault()
[all …]
|
| D | graph_checker.cc | 60 return block->GetPredecessors().size() == 1u && in IsExitTryBoundaryIntoExitBlock()
185 sorted_predecessors.assign(block->GetPredecessors().begin(), block->GetPredecessors().end()); in VisitBasicBlock()
223 std::count(s->GetPredecessors().begin(), s->GetPredecessors().end(), block); in VisitBasicBlock()
251 for (HBasicBlock* predecessor : block->GetPredecessors()) { in VisitBasicBlock()
357 if (successor->GetPredecessors().size() > 1) { in VisitBasicBlock()
382 for (HBasicBlock* predecessor : block->GetPredecessors()) { in VisitBasicBlock()
928 size_t num_preds = loop_header->GetPredecessors().size(); in HandleLoop()
935 HBasicBlock* first_predecessor = loop_header->GetPredecessors()[0]; in HandleLoop()
941 for (size_t i = 1, e = loop_header->GetPredecessors().size(); i < e; ++i) { in HandleLoop()
942 HBasicBlock* predecessor = loop_header->GetPredecessors()[i]; in HandleLoop()
[all …]
|
| D | nodes.cc | 341 successor->GetPredecessors().size() - successor->NumberOfBackEdges()) { in ComputeDominanceInformation()
441 if (info->IsBackEdge(*header->GetPredecessors()[0])) { in OrderLoopHeaderPredecessors()
442 HBasicBlock* to_swap = header->GetPredecessors()[0]; in OrderLoopHeaderPredecessors()
443 for (size_t pred = 1, e = header->GetPredecessors().size(); pred < e; ++pred) { in OrderLoopHeaderPredecessors()
444 HBasicBlock* predecessor = header->GetPredecessors()[pred]; in OrderLoopHeaderPredecessors()
460 for (size_t pred = 0; pred < header->GetPredecessors().size(); ++pred) { in FixControlForNewSinglePreheader()
461 HBasicBlock* predecessor = header->GetPredecessors()[pred]; in FixControlForNewSinglePreheader()
515 for (size_t pred = 0; pred < header->GetPredecessors().size(); ++pred) { in TransformLoopToSinglePreheaderFormat()
516 HBasicBlock* predecessor = header->GetPredecessors()[pred]; in TransformLoopToSinglePreheaderFormat()
547 HBasicBlock* pred_block = header->GetPredecessors()[input_pos]; in TransformLoopToSinglePreheaderFormat()
[all …]
|
| 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 | dead_code_elimination.cc | 307 if (block->GetPredecessors().size() == 1u && in SimplifyAlwaysThrows()
395 HBasicBlock* predecessor_to_update = block->GetPredecessors()[i]; in SimplifyIfs()
417 if (block->GetPredecessors().size() == 1) { in SimplifyIfs()
509 HBasicBlock* pred = block->GetPredecessors()[index]; in MaybeAddPhi()
578 if (successor->IsExitBlock() || successor->GetPredecessors().size() != 1u) { in ConnectSuccessiveBlocks()
|
| D | pretty_printer.h | 77 const ArenaVector<HBasicBlock*>& predecessors = block->GetPredecessors(); in VisitBasicBlock()
|
| D | linear_order.cc | 101 size_t number_of_forward_predecessors = block->GetPredecessors().size(); in LinearizeGraphInternal()
|
| D | select_generator.cc | 36 if (block->GetPredecessors().size() != 1u) { in IsSimpleBlock()
175 bool only_two_predecessors = (merge_block->GetPredecessors().size() == 2u); in TryGenerateSelectSimpleDiamondPattern()
|
| D | superblock_cloner.cc | 196 DCHECK_IMPLIES(first_phi_met, copy_succ->GetPredecessors().size() == phi_input_count); in RemapOrigInternalOrIncomingEdge()
240 for (HBasicBlock* orig_pred : orig_block->GetPredecessors()) { in CopyIncomingEdgesForVersioning()
434 HBasicBlock* corresponding_block = phi_block->GetPredecessors()[i]; in ResolvePhi()
620 DCHECK_EQ(exit_block->GetPredecessors().size(), 1u); in ConstructSubgraphClosedSSA()
690 for (HBasicBlock* pred : bb->GetPredecessors()) { in DumpBB()
1108 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 | 344 auto preds_and_idx = ZipCount(MakeIterationRange(target->GetPredecessors())); in EnsurePredecessorOrder()
345 bool correct_preds = preds.size() == target->GetPredecessors().size() && in EnsurePredecessorOrder()
376 << dump_list(target->GetPredecessors()) << " not " in EnsurePredecessorOrder()
|
| D | gvn.cc | 424 const ArenaVector<HBasicBlock*>& predecessors = block->GetPredecessors(); in VisitBasicBlock()
|
| D | instruction_builder.cc | 211 } else if (current_block_->GetPredecessors().size() > 0) { in InitializeBlockLocals()
217 HInstruction* value = ValueOfLocalAt(current_block_->GetPredecessors()[0], local); in InitializeBlockLocals()
219 for (HBasicBlock* predecessor : current_block_->GetPredecessors()) { in InitializeBlockLocals()
236 HInstruction* first_input = ValueOfLocalAt(current_block_->GetPredecessors()[0], local); in InitializeBlockLocals()
240 current_block_->GetPredecessors().size(), in InitializeBlockLocals()
242 for (size_t i = 0; i < current_block_->GetPredecessors().size(); i++) { in InitializeBlockLocals()
243 HInstruction* pred_value = ValueOfLocalAt(current_block_->GetPredecessors()[i], local); in InitializeBlockLocals()
327 for (HBasicBlock* predecessor : block->GetPredecessors()) { in SetLoopHeaderPhiInputs()
|
| D | bounds_check_elimination.cc | 710 DCHECK_EQ(true_successor->GetPredecessors().size(), 1u); in HandleIf()
714 DCHECK_EQ(false_successor->GetPredecessors().size(), 1u); in HandleIf()
952 *phi->GetBlock()->GetPredecessors()[1])); in HasSameInputAtBackEdges()
955 *phi->GetBlock()->GetPredecessors()[i])); in HasSameInputAtBackEdges()
|
| 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()
818 if (block->GetPredecessors().size() == 1 && in SimplifyBlocks()
820 block->GetSingleSuccessor()->GetPredecessors().size() == 1) { in SimplifyBlocks()
869 if (successor->GetPredecessors().size() != 1) { in GetInnerLoopFiniteSingleExit()
|
| D | load_store_elimination_test.cc | 1145 CHECK_EQ(loop_entry->GetPredecessors().size(), 2u); in TEST_F()
1146 if (loop_entry->GetPredecessors()[0] != loop_pre_header) { in TEST_F()
1274 CHECK_EQ(loop_entry->GetPredecessors().size(), 2u); in TEST_F()
1275 if (loop_entry->GetPredecessors()[0] != loop_pre_header) { in TEST_F()
|
| D | superblock_cloner_test.cc | 452 EXPECT_EQ(header->GetPredecessors().size(), 3u); in TEST_F()
|
| D | graph_visualizer.cc | 279 for (HBasicBlock* predecessor : block->GetPredecessors()) { in PrintPredecessors()
|
| D | nodes.h | 1124 const ArenaVector<HBasicBlock*>& GetPredecessors() const { in GetPredecessors() function
1129 return GetPredecessors().size(); in GetNumberOfPredecessors()
1289 DCHECK_EQ(GetPredecessors().size(), 1u); in GetSinglePredecessor()
1290 return GetPredecessors()[0]; in GetSinglePredecessor()
1301 DCHECK_EQ(GetPredecessors()[idx], predecessor); in IsFirstIndexOfPredecessor()
1395 return GetPredecessors()[0] == GetLoopInformation()->GetPreHeader(); in IsLoopPreHeaderFirstPredecessor()
1400 return GetLoopInformation()->IsBackEdge(*GetPredecessors()[0]); in IsFirstPredecessorBackEdge()
|
| D | induction_var_analysis.cc | 82 while (guard->GetPredecessors().size() == 1 && in IsGuardedBy()
|