HomeSort by relevance Sort by last modified time
    Searched refs:backedges (Results 1 - 4 of 4) sorted by null

  /external/v8/src/compiler/
loop-peeling.cc 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)
230 int backedges = loop_node->InputCount() - 1; local
231 if (backedges > 1) {
232 // Multiple backedges from original loop, therefore multiple output edges
239 graph->NewNode(common->Merge(backedges), backedges, &inputs[0]);
245 for (int i = 0; i < backedges; i++)
    [all...]
osr.cc 132 // Gather backedges from the previous copies of the inner loops of {loop}.
133 NodeVectorVector backedges(tmp_zone);
134 TRACE("Gathering backedges...\n");
150 backedges.push_back(NodeVector(tmp_zone));
151 backedges.back().reserve(header_nodes.size());
158 backedges.back().push_back(input);
166 int backedge_count = static_cast<int>(backedges.size());
172 Node* input = backedges[0][index];
179 // Complex case of multiple backedges from previous copies requires
180 // merging the backedges to create the entry into the loop header
    [all...]
scheduler.cc 736 // recording backedges that form cycles. O(|B|).
774 // Otherwise, compute the loop information from the backedges in order
    [all...]
  /external/v8/test/cctest/compiler/
test-osr.cc 261 // Two branches that create two different backedges.
302 While(OsrDeconstructorTester& R, Node* cond, bool is_osr, int backedges = 1)
304 loop = t.NewLoop(is_osr, backedges);

Completed in 121 milliseconds