Searched refs:back_edge (Results 1 - 3 of 3) sorted by last modified time

/art/compiler/optimizing/
H A Dgraph_checker.cc615 for (HBasicBlock* back_edge : loop_information->GetBackEdges()) {
616 int back_edge_id = back_edge->GetBlockId();
622 } else if (back_edge->GetLoopInformation() != loop_information) {
628 back_edge->GetLoopInformation()->GetHeader()->GetBlockId()));
H A Dnodes.cc623 for (HBasicBlock* back_edge : info->GetBackEdges()) {
624 PopulateIrreducibleRecursive(back_edge, finalized);
668 for (HBasicBlock* back_edge : GetBackEdges()) {
669 PopulateIrreducibleRecursive(back_edge, &visited);
672 for (HBasicBlock* back_edge : GetBackEdges()) {
673 PopulateRecursive(back_edge);
721 for (HBasicBlock* back_edge : GetBackEdges()) {
722 last_position = std::max(back_edge->GetLifetimeEnd(), last_position);
728 for (HBasicBlock* back_edge : GetBackEdges()) {
729 DCHECK(back_edge
[all...]
H A Dnodes.h677 void AddBackEdge(HBasicBlock* back_edge) { argument
678 back_edges_.push_back(back_edge);
681 void RemoveBackEdge(HBasicBlock* back_edge) { argument
682 RemoveElement(back_edges_, back_edge);
870 void AddBackEdge(HBasicBlock* back_edge) { argument
875 loop_information_->AddBackEdge(back_edge);

Completed in 42 milliseconds