Home
last modified time | relevance | path

Searched refs:GetLoopInformation (Results 1 – 25 of 42) sorted by relevance

12

/art/compiler/optimizing/
Dsuperblock_cloner_test.cc127 HSuspendCheck* old_suspend_check = header->GetLoopInformation()->GetSuspendCheck(); in TEST_F()
141 HSuspendCheck* new_suspend_check = header->GetLoopInformation()->GetSuspendCheck(); in TEST_F()
164 HLoopInformation* loop_info = header->GetLoopInformation(); in TEST_F()
243 HLoopInformation* loop_info = header->GetLoopInformation(); in TEST_F()
261 EXPECT_EQ(header->GetLoopInformation(), loop_info); in TEST_F()
307 HLoopInformation* loop_info = header->GetLoopInformation(); in TEST_F()
311 HLoopInformation* new_loop_info = new_header->GetLoopInformation(); in TEST_F()
344 HLoopInformation* loop_info = header->GetLoopInformation(); in TEST_F()
357 EXPECT_EQ(loop_info, new_header->GetLoopInformation()); in TEST_F()
381 HLoopInformation* loop_info = header->GetLoopInformation(); in TEST_F()
[all …]
Dfind_loops_test.cc41 ASSERT_EQ(block->GetLoopInformation(), nullptr); in TEST_F()
52 ASSERT_EQ(block->GetLoopInformation(), nullptr); in TEST_F()
66 ASSERT_EQ(block->GetLoopInformation(), nullptr); in TEST_F()
81 ASSERT_EQ(block->GetLoopInformation(), nullptr); in TEST_F()
94 ASSERT_EQ(block->GetLoopInformation(), nullptr); in TEST_F()
107 ASSERT_EQ(block->GetLoopInformation(), nullptr); in TestBlock()
109 ASSERT_EQ(block->GetLoopInformation()->GetHeader()->GetBlockId(), parent_loop_header_id); in TestBlock()
113 HLoopInformation* info = block->GetLoopInformation(); in TestBlock()
270 ASSERT_TRUE(graph->GetBlocks()[3]->GetLoopInformation()->IsIn( in TEST_F()
271 *graph->GetBlocks()[2]->GetLoopInformation())); in TEST_F()
[all …]
Dside_effects_analysis.cc58 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()
Dlicm.cc33 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()
Dlinear_order.cc42 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()
Dnodes_test.cc67 return b != nullptr && b->GetLoopInformation() != nullptr; in TEST_F()
81 return b == nullptr || b->GetLoopInformation() == nullptr; in TEST_F()
123 return b != nullptr && b->GetLoopInformation() != nullptr; in TEST_F()
137 return b == nullptr || b->GetLoopInformation() == nullptr; in TEST_F()
Dsuperblock_cloner.cc323 HLoopInformation* info = block->GetLoopInformation(); in RecalculateBackEdgesInfo()
342 HLoopInformation* info = block->GetLoopInformation(); in RecalculateBackEdgesInfo()
353 HLoopInformation* info = block->GetLoopInformation(); in RecalculateBackEdgesInfo()
377 block->GetLoopInformation()->Populate(); in AnalyzeLoopsLocally()
386 HLoopInformation* cur_loop = block->GetLoopInformation(); in AnalyzeLoopsLocally()
387 HLoopInformation* outer_loop = cur_loop->GetPreHeader()->GetLoopInformation(); in AnalyzeLoopsLocally()
467 HLoopInformation* loop_exit_loop_info = exit->GetLoopInformation(); in FindAndSetLocalAreaForAdjustments()
702 if (bb->GetLoopInformation()) { in DumpBB()
703 oss << "\tloop: " << bb->GetLoopInformation()->GetHeader()->GetBlockId(); in DumpBB()
895 HLoopInformation* block_loop_info = block->GetLoopInformation(); in IsFastCase()
[all …]
Dnodes.cc357 block->GetLoopInformation()->HasBackEdgeNotDominatedByHeader()) { in ComputeDominanceInformation()
409 HLoopInformation* info = successor->GetLoopInformation(); in SplitCriticalEdge()
440 HLoopInformation* info = header->GetLoopInformation(); in OrderLoopHeaderPredecessors()
459 HLoopInformation* loop_info = header->GetLoopInformation(); in FixControlForNewSinglePreheader()
499 HLoopInformation* loop_info = header->GetLoopInformation(); in TransformLoopToSinglePreheaderFormat()
567 HLoopInformation* info = header->GetLoopInformation(); in SimplifyLoop()
604 !block->GetLoopInformation()->IsBackEdge(*first_predecessor)); in ComputeTryBlockInformation()
674 block->GetLoopInformation()->Populate(); in AnalyzeLoops()
812 DCHECK(block->GetLoopInformation()->IsPopulated()); in PopulateRecursive()
813 if (block->GetLoopInformation()->IsIrreducible()) { in PopulateRecursive()
[all …]
Dinduction_var_analysis_test.cc173 iva_->LookupInfo(loop_body_[d]->GetLoopInformation(), instruction)); in GetInductionInfo()
186 iva_->LookupInfo(loop_body_[0]->GetLoopInformation(), instruction1), in HaveSameInduction()
187 iva_->LookupInfo(loop_body_[0]->GetLoopInformation(), instruction2)); in HaveSameInduction()
193 iva_->LookupInfo(loop_body_[0]->GetLoopInformation(), instruction)); in IsNarrowingLinear()
243 ASSERT_EQ(entry_->GetLoopInformation(), nullptr); in TEST_F()
245 ASSERT_EQ(loop_preheader_[d]->GetLoopInformation(), in TEST_F()
247 : loop_header_[d - 1]->GetLoopInformation()); in TEST_F()
248 ASSERT_NE(loop_header_[d]->GetLoopInformation(), nullptr); in TEST_F()
249 ASSERT_NE(loop_body_[d]->GetLoopInformation(), nullptr); in TEST_F()
250 ASSERT_EQ(loop_header_[d]->GetLoopInformation(), in TEST_F()
[all …]
Dsuspend_check_test.cc42 ASSERT_EQ(loop_header->GetLoopInformation()->GetPreHeader(), first_block); in TestCode()
Dgvn.cc459 if (block->GetLoopInformation()->ContainsIrreducibleLoop()) { in VisitBasicBlock()
468 DCHECK(!block->GetLoopInformation()->IsIrreducible()); in VisitBasicBlock()
469 DCHECK_EQ(block->GetDominator(), block->GetLoopInformation()->GetPreHeader()); in VisitBasicBlock()
Dinduction_var_analysis.cc138 if (user->GetBlock()->GetLoopInformation() != loop) { in FixOutsideUse()
152 if (user->GetHolder()->GetBlock()->GetLoopInformation() != loop) { in FixOutsideUse()
239 if (graph_block->IsLoopHeader() && !graph_block->GetLoopInformation()->IsIrreducible()) { in Run()
240 VisitLoop(graph_block->GetLoopInformation()); in Run()
257 if (loop_block->GetLoopInformation() != loop) { in VisitLoop()
304 if (input->GetBlock()->GetLoopInformation() != loop) { in TryVisitNodes()
376 DCHECK(block->GetLoopInformation()->GetHeader() == block); in ExtractScc()
1018 } else if (if_true->GetLoopInformation() != loop && if_false->GetLoopInformation() == loop) { in VisitControl()
1020 } else if (if_true->GetLoopInformation() == loop && if_false->GetLoopInformation() != loop) { in VisitControl()
Dinduction_var_range_test.cc500 HLoopInformation* loop = loop_header_->GetLoopInformation(); in TEST_F()
550 HLoopInformation* loop = loop_header_->GetLoopInformation(); in TEST_F()
1018 EXPECT_TRUE(range_.IsFinite(loop_header_->GetLoopInformation(), &tc)); in TEST_F()
1024 loop_header_->GetLoopInformation(), graph_, loop_preheader_); in TEST_F()
1074 EXPECT_TRUE(range_.IsFinite(loop_header_->GetLoopInformation(), &tc)); in TEST_F()
1079 loop_header_->GetLoopInformation(), graph_, loop_preheader_); in TEST_F()
1158 EXPECT_TRUE(range_.IsFinite(loop_header_->GetLoopInformation(), &tc)); in TEST_F()
1164 loop_header_->GetLoopInformation(), graph_, loop_preheader_); in TEST_F()
1246 EXPECT_TRUE(range_.IsFinite(loop_header_->GetLoopInformation(), &tc)); in TEST_F()
1251 loop_header_->GetLoopInformation(), graph_, loop_preheader_); in TEST_F()
Dgraph_test.cc240 loop_block->GetLoopInformation()->GetPreHeader()); in TEST_F()
275 loop_block->GetLoopInformation()->GetPreHeader()); in TEST_F()
Dcha_guard_optimization.cc182 HLoopInformation* loop_info = block->GetLoopInformation(); in HoistGuard()
Dloop_optimization.cc578 AddLoop(block->GetLoopInformation()); in LocalRun()
769 HSuspendCheck* instruction = header->GetLoopInformation()->GetSuspendCheck(); in TryToRemoveSuspendCheckFromLoopHeader()
906 size_t num_of_blocks = header->GetLoopInformation()->GetBlocks().NumSetBits(); in TryOptimizeInnerLoopFinite()
978 size_t num_of_blocks = header->GetLoopInformation()->GetBlocks().NumSetBits(); in TryVectorizedTraditional()
1146 for (HBlocksInLoopReversePostOrderIterator block_it(*header->GetLoopInformation()); in CanVectorizeDataFlow()
1524 HLoopInformation* vloop = vector_header_->GetLoopInformation(); in FinalizeVectorization()
1556 header->SetLoopInformation(preheader->GetLoopInformation()); // outward in FinalizeVectorization()
1655 bool in_vector_loop = vector_header_->GetLoopInformation()->Contains(*instr->GetBlock()); in GenerateNewLoopPredicated()
2909 HLoopInformation* loop_info = phi->GetBlock()->GetLoopInformation(); in TrySetPhiReduction()
2996 if (use.GetUser()->GetBlock()->GetLoopInformation() != loop_info) { in IsUsedOutsideLoop()
[all …]
Dgvn_test.cc357 ASSERT_TRUE(inner_loop_header->GetLoopInformation()->IsIn( in TEST_F()
358 *outer_loop_header->GetLoopInformation())); in TEST_F()
Dbounds_check_elimination.cc922 HLoopInformation* loop = bounds_check->GetBlock()->GetLoopInformation(); in VisitBoundsCheck()
951 DCHECK(phi->GetBlock()->GetLoopInformation()->IsBackEdge( in HasSameInputAtBackEdges()
954 DCHECK(phi->GetBlock()->GetLoopInformation()->IsBackEdge( in HasSameInputAtBackEdges()
1361 HLoopInformation* loop = array_get->GetBlock()->GetLoopInformation(); in VisitArrayGet()
1554 if (user->IsBoundsCheck() && loop == user->GetBlock()->GetLoopInformation()) { in TransformLoopForDynamicBCE()
1738 } else if (length->IsArrayLength() && length->GetBlock()->GetLoopInformation() == loop) { in CanHandleLength()
1754 } else if (check->IsNullCheck() && check->GetBlock()->GetLoopInformation() == loop) { in CanHandleNullCheck()
Dssa_liveness_analysis.h134 HLoopInformation* GetLoopInformation() const { in GetLoopInformation() function
135 return user_->GetBlock()->GetLoopInformation(); in GetLoopInformation()
1085 : current == block_at_use.GetLoopInformation()) in AddBackEdgeUses()
1294 if (!block.IsLoopHeader() || !block.GetLoopInformation()->IsIrreducible()) { in CheckNoLiveInIrreducibleLoop()
Dcode_sinking.cc241 const HLoopInformation* loop_info = instruction->GetBlock()->GetLoopInformation(); in FindIdealPosition()
242 while (target_block->IsInLoop() && target_block->GetLoopInformation() != loop_info) { in FindIdealPosition()
Dload_store_elimination.cc1456 HLoopInformation* loop_info = block->GetLoopInformation(); in PrepareLoopValue()
1491 block->GetLoopInformation()->Contains(*reference->GetBlock()) && in PrepareLoopStoredBy()
1502 HBasicBlock* pre_header = block->GetLoopInformation()->GetPreHeader(); in PrepareLoopRecords()
1511 if (block->GetLoopInformation()->IsIrreducible()) { in PrepareLoopRecords()
1852 HLoopInformation* loop_info = loop_header->GetLoopInformation(); in MayAliasOnBackEdge()
1919 blocks[record.stored_by.GetPhiPlaceholder().GetBlockId()]->GetLoopInformation(); in TryReplacingLoopPhiPlaceholderWithDefault()
2050 if (index != nullptr && current_block->GetLoopInformation()->Contains(*index->GetBlock())) { in FindLoopPhisToMaterialize()
2083 predecessor != current_block->GetLoopInformation()->GetPreHeader() && in FindLoopPhisToMaterialize()
2432 if (block->GetLoopInformation()->IsIrreducible()) { in ProcessLoopPhiWithUnknownInput()
2616 block->IsLoopHeader() && predecessor != block->GetLoopInformation()->GetPreHeader(); in SearchPhiPlaceholdersForKeptStores()
Dgraph_checker.cc94 if (block->GetLoopInformation()->IsIrreducible()) { in VisitReversePostOrder()
903 HLoopInformation* loop_information = loop_header->GetLoopInformation(); in HandleLoop()
967 } else if (back_edge->GetLoopInformation() != loop_information) { in HandleLoop()
973 back_edge->GetLoopInformation()->GetHeader()->GetBlockId())); in HandleLoop()
Dinduction_var_range.h160 HLoopInformation* lp = phi->GetBlock()->GetLoopInformation(); // closest enveloping loop in IsClassified()
Dloop_analysis.cc323 HLoopInformation* loop_info = block->GetLoopInformation(); in GetSIMDUnrollingFactor()
Dloop_optimization_test.cc322 HBasicBlock* new_preheader = header->GetLoopInformation()->GetPreHeader(); in TEST_F()

12