| /aosp12/art/compiler/optimizing/ |
| H A D | superblock_cloner_test.cc | 163 HLoopInformation* loop_info = header->GetLoopInformation(); in TEST_F()
242 HLoopInformation* loop_info = header->GetLoopInformation(); in TEST_F()
260 EXPECT_EQ(header->GetLoopInformation(), loop_info); in TEST_F()
306 HLoopInformation* loop_info = header->GetLoopInformation(); in TEST_F()
343 HLoopInformation* loop_info = header->GetLoopInformation(); in TEST_F()
356 EXPECT_EQ(loop_info, new_header->GetLoopInformation()); in TEST_F()
398 EXPECT_EQ(loop_info, header->GetLoopInformation()); in TEST_F()
460 EXPECT_EQ(loop1_header->GetLoopInformation()->GetPreHeader()->GetLoopInformation(), nullptr); in CheckLoopStructureForLoopPeelingNested()
461 EXPECT_EQ(loop2_header->GetLoopInformation()->GetPreHeader()->GetLoopInformation(), nullptr); in CheckLoopStructureForLoopPeelingNested()
462 EXPECT_EQ(loop3_header->GetLoopInformation()->GetPreHeader()->GetLoopInformation()->GetHeader(), in CheckLoopStructureForLoopPeelingNested()
[all …]
|
| H A D | find_loops_test.cc | 40 ASSERT_EQ(block->GetLoopInformation(), nullptr); in TEST_F()
51 ASSERT_EQ(block->GetLoopInformation(), nullptr); in TEST_F()
65 ASSERT_EQ(block->GetLoopInformation(), nullptr); in TEST_F()
80 ASSERT_EQ(block->GetLoopInformation(), nullptr); in TEST_F()
93 ASSERT_EQ(block->GetLoopInformation(), nullptr); in TEST_F()
106 ASSERT_EQ(block->GetLoopInformation(), nullptr); in TestBlock()
112 HLoopInformation* info = block->GetLoopInformation(); in TestBlock()
269 ASSERT_TRUE(graph->GetBlocks()[3]->GetLoopInformation()->IsIn( in TEST_F()
271 ASSERT_FALSE(graph->GetBlocks()[2]->GetLoopInformation()->IsIn( in TEST_F()
297 ASSERT_FALSE(graph->GetBlocks()[4]->GetLoopInformation()->IsIn( in TEST_F()
[all …]
|
| H A D | side_effects_analysis.cc | 58 UpdateLoopEffects(block->GetLoopInformation(), effects); in Run()
59 HBasicBlock* pre_header = block->GetLoopInformation()->GetPreHeader(); in Run()
64 UpdateLoopEffects(pre_header->GetLoopInformation(), GetLoopEffects(block)); in Run()
68 UpdateLoopEffects(block->GetLoopInformation(), effects); in Run()
|
| H A D | licm.cc | 33 HLoopInformation* info = instruction->GetBlock()->GetLoopInformation(); in InputsAreDefinedBeforeLoop()
35 HLoopInformation* input_loop = input->GetBlock()->GetLoopInformation(); in InputsAreDefinedBeforeLoop()
49 HLoopInformation* input_loop = input->GetBlock()->GetLoopInformation(); in InputsAreDefinedBeforeLoop()
101 HLoopInformation* loop_info = block->GetLoopInformation(); in Run()
108 if (inner->GetLoopInformation() != loop_info) { in Run()
|
| H A D | linear_order.cc | 42 HLoopInformation* block_loop = block->GetLoopInformation(); in AddToListForLinearization()
46 HLoopInformation* current_loop = current->GetLoopInformation(); in AddToListForLinearization()
63 HLoopInformation* loop = header->GetLoopInformation(); in IsLinearOrderWellFormed()
103 number_of_forward_predecessors -= block->GetLoopInformation()->NumberOfBackEdges(); in LinearizeGraphInternal()
|
| H A D | superblock_cloner.cc | 325 HLoopInformation* info = block->GetLoopInformation(); in RecalculateBackEdgesInfo()
344 HLoopInformation* info = block->GetLoopInformation(); in RecalculateBackEdgesInfo()
355 HLoopInformation* info = block->GetLoopInformation(); in RecalculateBackEdgesInfo()
379 block->GetLoopInformation()->Populate(); in AnalyzeLoopsLocally()
388 HLoopInformation* cur_loop = block->GetLoopInformation(); in AnalyzeLoopsLocally()
469 HLoopInformation* loop_exit_loop_info = exit->GetLoopInformation(); in FindAndSetLocalAreaForAdjustments()
704 if (bb->GetLoopInformation()) { in DumpBB()
888 HLoopInformation* block_loop_info = block->GetLoopInformation(); in IsFastCase()
1130 current = current->GetPreHeader()->GetLoopInformation(); in FindCommonLoop()
1148 DCHECK(loop_info_ == loop_header->GetLoopInformation()); in DoLoopTransformationImpl()
[all …]
|
| H A D | nodes_test.cc | 66 return b != nullptr && b->GetLoopInformation() != nullptr; in TEST_F()
80 return b == nullptr || b->GetLoopInformation() == nullptr; in TEST_F()
122 return b != nullptr && b->GetLoopInformation() != nullptr; in TEST_F()
136 return b == nullptr || b->GetLoopInformation() == nullptr; in TEST_F()
|
| H A D | induction_var_analysis_test.cc | 172 iva_->LookupInfo(loop_body_[d]->GetLoopInformation(), instruction)); in GetInductionInfo()
185 iva_->LookupInfo(loop_body_[0]->GetLoopInformation(), instruction1), in HaveSameInduction()
186 iva_->LookupInfo(loop_body_[0]->GetLoopInformation(), instruction2)); in HaveSameInduction()
242 ASSERT_EQ(entry_->GetLoopInformation(), nullptr); in TEST_F()
244 ASSERT_EQ(loop_preheader_[d]->GetLoopInformation(), in TEST_F()
246 : loop_header_[d - 1]->GetLoopInformation()); in TEST_F()
247 ASSERT_NE(loop_header_[d]->GetLoopInformation(), nullptr); in TEST_F()
248 ASSERT_NE(loop_body_[d]->GetLoopInformation(), nullptr); in TEST_F()
249 ASSERT_EQ(loop_header_[d]->GetLoopInformation(), in TEST_F()
250 loop_body_[d]->GetLoopInformation()); in TEST_F()
[all …]
|
| H A D | nodes.cc | 539 HLoopInformation* info = successor->GetLoopInformation(); in SplitCriticalEdge()
561 HLoopInformation* info = header->GetLoopInformation(); in OrderLoopHeaderPredecessors()
688 HLoopInformation* info = header->GetLoopInformation(); in SimplifyLoop()
789 block->GetLoopInformation()->Populate(); in AnalyzeLoops()
927 DCHECK(block->GetLoopInformation()->IsPopulated()); in PopulateRecursive()
928 if (block->GetLoopInformation()->IsIrreducible()) { in PopulateRecursive()
961 HLoopInformation* info = block->GetLoopInformation(); in PopulateIrreducibleRecursive()
2408 HLoopInformation* loop_info = GetLoopInformation(); in DisconnectAndDelete()
2667 block->GetLoopInformation()->ClearAllBlocks(); in UpdateLoopAndTryInformationOfNewBlock()
3004 HLoopInformation* loop = header->GetLoopInformation(); in TransformLoopForVectorization()
[all …]
|
| H A D | induction_var_analysis.cc | 170 if (user->GetBlock()->GetLoopInformation() != loop) { in FixOutsideUse()
184 if (user->GetHolder()->GetBlock()->GetLoopInformation() != loop) { in FixOutsideUse()
252 if (graph_block->IsLoopHeader() && !graph_block->GetLoopInformation()->IsIrreducible()) { in Run()
253 VisitLoop(graph_block->GetLoopInformation()); in Run()
269 if (loop_block->GetLoopInformation() != loop) { in VisitLoop()
341 HLoopInformation* otherLoop = instruction->GetBlock()->GetLoopInformation(); in VisitDescendant()
911 } else if (if_true->GetLoopInformation() != loop && if_false->GetLoopInformation() == loop) { in VisitControl()
913 } else if (if_true->GetLoopInformation() == loop && if_false->GetLoopInformation() != loop) { in VisitControl()
|
| H A D | gvn.cc | 462 if (block->GetLoopInformation()->ContainsIrreducibleLoop()) { in VisitBasicBlock()
471 DCHECK(!block->GetLoopInformation()->IsIrreducible()); in VisitBasicBlock()
472 DCHECK_EQ(block->GetDominator(), block->GetLoopInformation()->GetPreHeader()); in VisitBasicBlock()
|
| H A D | induction_var_range_test.cc | 795 EXPECT_TRUE(range_.IsFinite(loop_header_->GetLoopInformation(), &tc)); in TEST_F()
801 loop_header_->GetLoopInformation(), graph_, loop_preheader_); in TEST_F()
851 EXPECT_TRUE(range_.IsFinite(loop_header_->GetLoopInformation(), &tc)); in TEST_F()
856 loop_header_->GetLoopInformation(), graph_, loop_preheader_); in TEST_F()
933 EXPECT_TRUE(range_.IsFinite(loop_header_->GetLoopInformation(), &tc)); in TEST_F()
939 loop_header_->GetLoopInformation(), graph_, loop_preheader_); in TEST_F()
1019 EXPECT_TRUE(range_.IsFinite(loop_header_->GetLoopInformation(), &tc)); in TEST_F()
1024 loop_header_->GetLoopInformation(), graph_, loop_preheader_); in TEST_F()
|
| H A D | suspend_check_test.cc | 41 ASSERT_EQ(loop_header->GetLoopInformation()->GetPreHeader(), first_block); in TestCode()
|
| H A D | graph_test.cc | 239 loop_block->GetLoopInformation()->GetPreHeader()); in TEST_F()
274 loop_block->GetLoopInformation()->GetPreHeader()); in TEST_F()
|
| H A D | bounds_check_elimination.cc | 909 HLoopInformation* loop = bounds_check->GetBlock()->GetLoopInformation(); in VisitBoundsCheck()
938 DCHECK(phi->GetBlock()->GetLoopInformation()->IsBackEdge( in HasSameInputAtBackEdges()
941 DCHECK(phi->GetBlock()->GetLoopInformation()->IsBackEdge( in HasSameInputAtBackEdges()
1348 HLoopInformation* loop = array_get->GetBlock()->GetLoopInformation(); in VisitArrayGet()
1541 if (user->IsBoundsCheck() && loop == user->GetBlock()->GetLoopInformation()) { in TransformLoopForDynamicBCE()
1716 } else if (length->IsArrayLength() && length->GetBlock()->GetLoopInformation() == loop) { in CanHandleLength()
1732 } else if (check->IsNullCheck() && check->GetBlock()->GetLoopInformation() == loop) { in CanHandleNullCheck()
|
| H A D | gvn_test.cc | 356 ASSERT_TRUE(inner_loop_header->GetLoopInformation()->IsIn( in TEST_F()
357 *outer_loop_header->GetLoopInformation())); in TEST_F()
|
| H A D | cha_guard_optimization.cc | 182 HLoopInformation* loop_info = block->GetLoopInformation(); in HoistGuard()
|
| H A D | ssa_liveness_analysis.h | 136 HLoopInformation* GetLoopInformation() const { in GetLoopInformation() function
137 return user_->GetBlock()->GetLoopInformation(); in GetLoopInformation()
1087 : current == block_at_use.GetLoopInformation()) in AddBackEdgeUses()
1296 if (!block.IsLoopHeader() || !block.GetLoopInformation()->IsIrreducible()) { in CheckNoLiveInIrreducibleLoop()
|
| H A D | loop_optimization.cc | 531 AddLoop(block->GetLoopInformation()); in LocalRun()
1172 HLoopInformation* vloop = vector_header_->GetLoopInformation(); in Vectorize()
1212 header->SetLoopInformation(preheader->GetLoopInformation()); // outward in Vectorize()
2401 HLoopInformation* loop_info = phi->GetBlock()->GetLoopInformation(); in TrySetPhiReduction()
2485 if (use.GetUser()->GetBlock()->GetLoopInformation() != loop_info) { in IsUsedOutsideLoop()
2500 HLoopInformation* other_loop_info = user->GetBlock()->GetLoopInformation(); in IsOnlyUsedAfterLoop()
2531 HLoopInformation* other_loop_info = user->GetBlock()->GetLoopInformation(); in TryReplaceWithLastValue()
2546 HLoopInformation* other_loop_info = user->GetHolder()->GetBlock()->GetLoopInformation(); in TryReplaceWithLastValue()
|
| H A D | load_store_elimination.cc | 1502 HLoopInformation* loop_info = block->GetLoopInformation(); in PrepareLoopValue()
1533 block->GetLoopInformation()->Contains(*ref_info->GetReference()->GetBlock())) { in PrepareLoopStoredBy()
1543 HBasicBlock* pre_header = block->GetLoopInformation()->GetPreHeader(); in PrepareLoopRecords()
1552 if (block->GetLoopInformation()->IsIrreducible()) { in PrepareLoopRecords()
1889 HLoopInformation* loop_info = loop_header->GetLoopInformation(); in MayAliasOnBackEdge()
1957 blocks[record.stored_by.GetPhiPlaceholder().GetBlockId()]->GetLoopInformation(); in TryReplacingLoopPhiPlaceholderWithDefault()
2077 if (index != nullptr && current_block->GetLoopInformation()->Contains(*index->GetBlock())) { in FindLoopPhisToMaterialize()
2110 predecessor != current_block->GetLoopInformation()->GetPreHeader() && in FindLoopPhisToMaterialize()
2463 if (block->GetLoopInformation()->IsIrreducible()) { in ProcessLoopPhiWithUnknownInput()
2649 block->IsLoopHeader() && predecessor != block->GetLoopInformation()->GetPreHeader(); in SearchPhiPlaceholdersForKeptStores()
[all …]
|
| H A D | induction_var_range.h | 159 HLoopInformation* lp = phi->GetBlock()->GetLoopInformation(); // closest enveloping loop in IsClassified()
|
| H A D | load_store_analysis.cc | 177 if (blk->IsLoopHeader() && blk->GetLoopInformation()->IsIrreducible()) { in CollectPartialEscapes()
|
| H A D | scheduler_arm64.cc | 190 DCHECK((block->GetLoopInformation() != nullptr) || in VisitSuspendCheck()
|
| H A D | graph_checker.cc | 667 HLoopInformation* loop_information = loop_header->GetLoopInformation(); in HandleLoop()
730 } else if (back_edge->GetLoopInformation() != loop_information) { in HandleLoop()
736 back_edge->GetLoopInformation()->GetHeader()->GetBlockId())); in HandleLoop()
|
| H A D | induction_var_range.cc | 322 …for (HLoopInformation* lp = instruction->GetBlock()->GetLoopInformation(); // closest enveloping … in Replace()
324 lp = lp->GetPreHeader()->GetLoopInformation()) { in Replace()
450 HLoopInformation* lp = context->GetBlock()->GetLoopInformation(); // closest enveloping loop in HasInductionInfo()
482 return info->fetch->GetBlock()->GetLoopInformation() != nullptr; in HasFetchInLoop()
|