Home
last modified time | relevance | path

Searched refs:IsLoopHeaderPhi (Results 1 – 6 of 6) sorted by relevance

/art/compiler/optimizing/
Dssa_phi_elimination.cc107 DCHECK(user->IsLoopHeaderPhi()); in EliminateDeadPhis()
192 DCHECK(!current->IsLoopHeaderPhi() || in Run()
Dbounds_check_elimination.cc598 DCHECK(!range->IsMonotonicValueRange() || instruction->IsLoopHeaderPhi()); in AssignRange()
614 DCHECK(instruction->IsLoopHeaderPhi()); in ApplyRangeFromComparison()
632 DCHECK(left->IsLoopHeaderPhi()); in HandleIfBetweenTwoMonotonicValueRanges()
633 DCHECK(right->IsLoopHeaderPhi()); in HandleIfBetweenTwoMonotonicValueRanges()
934 DCHECK(phi->IsLoopHeaderPhi()); in HasSameInputAtBackEdges()
951 if (phi->IsLoopHeaderPhi() in VisitPhi()
Dinduction_var_analysis.cc38 if (other->IsLoopHeaderPhi() && (phi == nullptr || phis.FoundBefore(other, phi))) { in RotateEntryPhiFirst()
327 if (scc_.size() == 1 && !scc_[0]->IsLoopHeaderPhi()) { in VisitNode()
406 if (!phi->IsLoopHeaderPhi()) { in ClassifyNonTrivial()
418 if (scc_[i]->IsLoopHeaderPhi()) { in ClassifyNonTrivial()
708 if (phi->IsLoopHeaderPhi() && phi->InputCount() == 2) { in SolvePhiAllInputs()
Dscheduler.cc290 if (!instruction->IsLoopHeaderPhi()) { in AddCrossIterationDependencies()
Dnodes.cc1106 if (instruction->IsLoopHeaderPhi() && (instruction->GetBlock() == loop_header)) { in CopyFromWithLoopPhiAdjustment()
Dnodes.h2133 bool IsLoopHeaderPhi() const { return IsPhi() && block_->IsLoopHeader(); } in IsLoopHeaderPhi() function
2135 return IsLoopHeaderPhi() && GetBlock()->GetLoopInformation()->IsIrreducible(); in IsIrreducibleLoopHeaderPhi()