Home
last modified time | relevance | path

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

/art/compiler/optimizing/
Dnodes.cc788 for (HBasicBlock* back_edge : info->GetBackEdges()) { in PopulateIrreducibleRecursive()
789 PopulateIrreducibleRecursive(back_edge, finalized); in PopulateIrreducibleRecursive()
836 for (HBasicBlock* back_edge : GetBackEdges()) { in Populate()
837 PopulateIrreducibleRecursive(back_edge, &visited); in Populate()
840 for (HBasicBlock* back_edge : GetBackEdges()) { in Populate()
841 PopulateRecursive(back_edge); in Populate()
899 for (HBasicBlock* back_edge : GetBackEdges()) { in GetLifetimeEnd()
900 last_position = std::max(back_edge->GetLifetimeEnd(), last_position); in GetLifetimeEnd()
906 for (HBasicBlock* back_edge : GetBackEdges()) { in HasBackEdgeNotDominatedByHeader()
907 DCHECK(back_edge->GetDominator() != nullptr); in HasBackEdgeNotDominatedByHeader()
[all …]
Dgraph_checker.cc718 for (HBasicBlock* back_edge : loop_information->GetBackEdges()) { in HandleLoop()
719 int back_edge_id = back_edge->GetBlockId(); in HandleLoop()
725 } else if (back_edge->GetLoopInformation() != loop_information) { in HandleLoop()
731 back_edge->GetLoopInformation()->GetHeader()->GetBlockId())); in HandleLoop()
Dnodes.h890 void AddBackEdge(HBasicBlock* back_edge) { in AddBackEdge() argument
891 back_edges_.push_back(back_edge); in AddBackEdge()
894 void RemoveBackEdge(HBasicBlock* back_edge) { in RemoveBackEdge() argument
895 RemoveElement(back_edges_, back_edge); in RemoveBackEdge()
1101 void AddBackEdge(HBasicBlock* back_edge) { in AddBackEdge() argument
1106 loop_information_->AddBackEdge(back_edge); in AddBackEdge()
1114 void AddBackEdgeWhileUpdating(HBasicBlock* back_edge) { in AddBackEdgeWhileUpdating() argument
1118 loop_information_->AddBackEdge(back_edge); in AddBackEdgeWhileUpdating()
/art/test/594-checker-irreducible-linorder/smali/
DIrreducibleLoop.smali62 :back_edge