Home
last modified time | relevance | path

Searched refs:IsLoopHeader (Results 1 – 25 of 31) sorted by relevance

12

/aosp12/art/compiler/optimizing/
H A Dside_effects_analysis.cc32 if (block->IsLoopHeader()) { in Run()
56 if (block->IsLoopHeader()) { in Run()
76 DCHECK(block->IsLoopHeader()); in GetLoopEffects()
H A Dlicm.cc96 if (!block->IsLoopHeader()) { in Run()
128 bool found_first_non_hoisted_visible_instruction_in_loop = !inner->IsLoopHeader(); in Run()
137 DCHECK(instruction->GetBlock()->IsLoopHeader()); in Run()
H A Dlinear_order.cc60 if (header == nullptr || !header->IsLoopHeader()) { in IsLinearOrderWellFormed()
102 if (block->IsLoopHeader()) { in LinearizeGraphInternal()
H A Dfind_loops_test.cc104 ASSERT_EQ(block->IsLoopHeader(), is_loop_header); in TestBlock()
119 ASSERT_FALSE(block->IsLoopHeader()); in TestBlock()
313 ASSERT_TRUE(graph->GetBlocks()[3]->IsLoopHeader()); in TEST_F()
H A Dsuspend_check_test.cc40 ASSERT_TRUE(loop_header->IsLoopHeader()); in TestCode()
H A Dnodes.cc486 block->IsLoopHeader() && in ComputeDominanceInformation()
537 if (successor->IsLoopHeader()) { in SplitCriticalEdge()
560 DCHECK(header->IsLoopHeader()); in OrderLoopHeaderPredecessors()
765 if (block->IsLoopHeader()) { in SimplifyCFG()
782 if (block->IsLoopHeader()) { in AnalyzeLoops()
924 if (block->IsLoopHeader()) { in PopulateRecursive()
947 if (block->IsLoopHeader()) { in PopulateIrreducibleRecursive()
2407 if (IsLoopHeader()) { in DisconnectAndDelete()
2662 if (block->IsLoopHeader()) { in UpdateLoopAndTryInformationOfNewBlock()
2945 DCHECK(header->IsLoopHeader()); in TransformLoopHeaderForBCE()
[all …]
H A Dssa_builder.cc242 if (block->IsLoopHeader()) { in RunPrimitiveTypePropagation()
504 if (block->IsLoopHeader()) { in HasPhiEquivalentAtLoopEntry()
H A Dload_store_elimination.cc1541 DCHECK(block->IsLoopHeader()); in PrepareLoopRecords()
1712 DCHECK(!current_block->IsLoopHeader()) in MaterializeNonLoopPhis()
1863 if (block->IsLoopHeader()) { in VisitBasicBlock()
1874 DCHECK(loop_header->IsLoopHeader()); in MayAliasOnBackEdge()
1936 if (block->IsLoopHeader()) { in TryReplacingLoopPhiPlaceholderWithDefault()
1955 blocks[record.stored_by.GetPhiPlaceholder().GetBlockId()]->IsLoopHeader()) { in TryReplacingLoopPhiPlaceholderWithDefault()
2070 if (current_block->IsLoopHeader()) { in FindLoopPhisToMaterialize()
2109 if (current_block->IsLoopHeader() && in FindLoopPhisToMaterialize()
2462 if (block->IsLoopHeader()) { in ProcessLoopPhiWithUnknownInput()
2649 block->IsLoopHeader() && predecessor != block->GetLoopInformation()->GetPreHeader(); in SearchPhiPlaceholdersForKeptStores()
[all …]
H A Dload_store_analysis.cc177 if (blk->IsLoopHeader() && blk->GetLoopInformation()->IsIrreducible()) { in CollectPartialEscapes()
H A Dsuperblock_cloner.cc91 if (block->IsLoopHeader()) { in OrderLoopsHeadersPredecessors()
373 if (block->IsLoopHeader()) { in AnalyzeLoopsLocally()
387 if (block->IsLoopHeader()) { in AnalyzeLoopsLocally()
H A Ddead_code_elimination.cc342 DCHECK(!block->IsLoopHeader()); in SimplifyIfs()
H A Dgvn.cc461 if (block->IsLoopHeader()) { in VisitBasicBlock()
H A Dgraph_checker.cc251 if (block->IsLoopHeader()) { in VisitBasicBlock()
288 if (block->IsLoopHeader()) { in VisitBasicBlock()
H A Dssa_liveness_analysis.cc257 if (block->IsLoopHeader()) { in ComputeLiveRanges()
H A Dregister_allocation_resolver.cc154 (block->IsLoopHeader() && block->GetLoopInformation()->IsIrreducible())) { in Resolve()
H A Dcode_generator.cc1116 if (block->IsLoopHeader()) { in CheckLoopEntriesCanBeUsedForOsr()
1610 DCHECK(block->IsLoopHeader()); in ClearSpillSlotsFromLoopPhisInStackMap()
H A Dreference_type_propagation.cc778 if (phi->GetBlock()->IsLoopHeader()) { in VisitPhi()
H A Dinstruction_builder.cc187 } else if (current_block_->IsLoopHeader()) { in InitializeBlockLocals()
341 if (block->IsLoopHeader()) { in IsBlockPopulated()
380 } else if (current_block_->IsLoopHeader()) { in Build()
H A Dregister_allocator_linear_scan.cc178 (block->IsLoopHeader() && block->GetLoopInformation()->IsIrreducible())) { in AllocateRegistersInternal()
H A Dssa_liveness_analysis.h1296 if (!block.IsLoopHeader() || !block.GetLoopInformation()->IsIrreducible()) { in CheckNoLiveInIrreducibleLoop()
H A Dnodes.h1183 return IsLoopHeader() ? loop_information_->NumberOfBackEdges() : 0; in NumberOfBackEdges()
1348 bool IsLoopHeader() const { in IsLoopHeader() function
1353 DCHECK(IsLoopHeader()); in IsLoopPreHeaderFirstPredecessor()
1358 DCHECK(IsLoopHeader()); in IsFirstPredecessorBackEdge()
1370 if (IsLoopHeader()) { in SetInLoop()
2244 bool IsLoopHeaderPhi() const { return IsPhi() && block_->IsLoopHeader(); } in IsLoopHeaderPhi()
H A Dinduction_var_analysis.cc252 if (graph_block->IsLoopHeader() && !graph_block->GetLoopInformation()->IsIrreducible()) { in Run()
H A Dbounds_check_elimination.cc387 DCHECK(induction_variable_->GetBlock()->IsLoopHeader()); in GetLoopHeader()
H A Dregister_allocator_graph_color.cc798 || (block->IsLoopHeader() && block->GetLoopInformation()->IsIrreducible())) { in ProcessInstructions()
H A Dinliner.cc1812 if (block->IsLoopHeader()) { in CanInlineBody()

12