Home
last modified time | relevance | path

Searched refs:IsInLoop (Results 1 – 11 of 11) sorted by relevance

/art/compiler/optimizing/
Dside_effects_analysis.cc60 if (pre_header->IsInLoop()) { in Run()
66 } else if (block->IsInLoop()) { in Run()
Dlicm.cc32 DCHECK(instruction->IsInLoop()); in InputsAreDefinedBeforeLoop()
107 DCHECK(inner->IsInLoop()); in Run()
Ddead_code_elimination.cc380 if (block->IsInLoop()) { in SimplifyIfs()
468 if (block->IsInLoop()) { in RemoveDeadBlocks()
Dcode_sinking.cc210 while (target_block->IsInLoop()) { in FindIdealPosition()
Dssa_liveness_analysis.h338 if (!is_environment && instruction->IsInLoop()) {
400 if (block->IsInLoop()) { in AddPhiUse()
1049 DCHECK(block_at_use.IsInLoop()); in AddBackEdgeUses()
Dnodes.cc1809 while (target_block->IsInLoop()) { in MoveBeforeFirstUserAndOutOfLoops()
2198 DCHECK(!IsInLoop() || !GetLoopInformation()->IsBackEdge(*predecessor)); in DisconnectAndDelete()
2326 DCHECK(!other->IsInLoop()); in MergeWithInlined()
2399 if (!block->IsInLoop()) { in UpdateLoopAndTryInformationOfNewBlock()
2470 DCHECK(!body->IsInLoop()); in InlineInto()
2496 DCHECK(!first->IsInLoop()); in InlineInto()
Dscheduler.cc766 if (only_optimize_loop_blocks_ && !block->IsInLoop()) { in IsSchedulable()
Dnodes.h1309 return IsInLoop() && (loop_information_->GetHeader() == this); in IsLoopHeader()
1332 } else if (!IsInLoop()) { in SetInLoop()
1351 bool IsInLoop() const { return loop_information_ != nullptr; } in IsInLoop() function
2132 bool IsInLoop() const { return block_->IsInLoop(); } in IsInLoop() function
Dinduction_var_analysis.cc268 DCHECK(loop_block->IsInLoop()); in VisitLoop()
Dbounds_check_elimination.cc1347 if (!has_dom_based_dynamic_bce_ && array_get->IsInLoop()) { in VisitArrayGet()
Dinstruction_simplifier.cc1728 if (rem->IsInLoop() && be_loop_friendly_) { in TryToReuseDiv()