Home
last modified time | relevance | path

Searched refs:back_edge (Results 1 – 4 of 4) sorted by relevance

/art/compiler/optimizing/
Dnodes.cc626 for (HBasicBlock* back_edge : info->GetBackEdges()) { in PopulateIrreducibleRecursive()
627 PopulateIrreducibleRecursive(back_edge, finalized); in PopulateIrreducibleRecursive()
671 for (HBasicBlock* back_edge : GetBackEdges()) { in Populate()
672 PopulateIrreducibleRecursive(back_edge, &visited); in Populate()
675 for (HBasicBlock* back_edge : GetBackEdges()) { in Populate()
676 PopulateRecursive(back_edge); in Populate()
725 for (HBasicBlock* back_edge : GetBackEdges()) { in GetLifetimeEnd()
726 last_position = std::max(back_edge->GetLifetimeEnd(), last_position); in GetLifetimeEnd()
732 for (HBasicBlock* back_edge : GetBackEdges()) { in HasBackEdgeNotDominatedByHeader()
733 DCHECK(back_edge->GetDominator() != nullptr); in HasBackEdgeNotDominatedByHeader()
[all …]
Dgraph_checker.cc621 for (HBasicBlock* back_edge : loop_information->GetBackEdges()) { in HandleLoop()
622 int back_edge_id = back_edge->GetBlockId(); in HandleLoop()
628 } else if (back_edge->GetLoopInformation() != loop_information) { in HandleLoop()
634 back_edge->GetLoopInformation()->GetHeader()->GetBlockId())); in HandleLoop()
Dnodes.h776 void AddBackEdge(HBasicBlock* back_edge) { in AddBackEdge() argument
777 back_edges_.push_back(back_edge); in AddBackEdge()
780 void RemoveBackEdge(HBasicBlock* back_edge) { in RemoveBackEdge() argument
781 RemoveElement(back_edges_, back_edge); in RemoveBackEdge()
971 void AddBackEdge(HBasicBlock* back_edge) { in AddBackEdge() argument
976 loop_information_->AddBackEdge(back_edge); in AddBackEdge()
/art/test/594-checker-irreducible-linorder/smali/
DIrreducibleLoop.smali62 :back_edge