Lines Matching refs:Edges
79 // the sum of the edge frequencies from the incoming edges.
313 /// This checks all edges of the function the blocks reside in and replaces the
375 // Generate edges and read current weight.
384 // First count the edges from FristBB to SecondBB, if there is more than
394 // When the edges are merged anyway, then redirect all flow.
398 // We know now how many edges there are from FirstBB to SecondBB, reroute a
421 std::set<Edge> Edges;
426 Edges.insert(old);
429 for (std::set<Edge>::iterator EI = Edges.begin(), EE = Edges.end();
450 DEBUG(dbgs() << "Splitting " << NumPreds << " Edges from " << BB->getName()
461 // Create edges and read old weight.
510 // collect weights of all incoming and outgoing edges, rememer edges that
664 // The set of return edges (Edges with no successors).
670 // 2) The return edges in the ReturnEdges set.
671 // 3) The flow that is leaving the function already via return edges.
725 // resolve furhter return edges.
962 // Speculatively set edges to zero.
