Home
last modified time | relevance | path

Searched refs:backedges (Results 1 - 2 of 2) sorted by relevance

/third_party/node/deps/v8/src/compiler/
H A Dloop-peeling.cc23 // | | (backedges)
49 // backedges of the loop correspond to edges from the peeled iteration to
50 // the main loop body, with multiple backedges requiring a merge.
73 // | | | (backedges)
151 int backedges = loop_node->InputCount() - 1; in Peel() local
152 if (backedges > 1) { in Peel()
153 // Multiple backedges from original loop, therefore multiple output edges in Peel()
160 graph_->NewNode(common_->Merge(backedges), backedges, &inputs[0]); in Peel()
166 for (int i = 0; i < backedges; in Peel()
[all...]
H A Dscheduler.cc810 // recording backedges that form cycles. O(|B|). in ComputeAndInsertSpecialRPO()
848 // Otherwise, compute the loop information from the backedges in order in ComputeAndInsertSpecialRPO()
992 // Computes loop membership from the backedges of the control flow graph.
994 size_t num_loops, ZoneVector<Backedge>* backedges) { in ComputeLoopInfo()
1004 // Compute loop membership starting from backedges. in ComputeLoopInfo()
1006 for (size_t i = 0; i < backedges->size(); i++) { in ComputeLoopInfo()
1007 BasicBlock* member = backedges->at(i).first; in ComputeLoopInfo()
1008 BasicBlock* header = member->SuccessorAt(backedges->at(i).second); in ComputeLoopInfo()
993 ComputeLoopInfo(ZoneVector<SpecialRPOStackFrame>* queue, size_t num_loops, ZoneVector<Backedge>* backedges) ComputeLoopInfo() argument

Completed in 5 milliseconds