Lines Matching full:backedges
19 // | | (backedges)
45 // backedges of the loop correspond to edges from the peeled iteration to
46 // the main loop body, with multiple backedges requiring a merge.
69 // | | | (backedges)
234 int backedges = loop_node->InputCount() - 1;
235 if (backedges > 1) {
236 // Multiple backedges from original loop, therefore multiple output edges
243 graph->NewNode(common->Merge(backedges), backedges, &inputs[0]);
249 for (int i = 0; i < backedges; i++) {
255 const Operator* op = common->ResizeMergeOrPhi(node->op(), backedges);
256 Node* phi = graph->NewNode(op, backedges + 1, &inputs[0]);
