Lines Matching defs:Edges

371   /// Edges that have already been computed as optimal.
575       MutableArrayRef<SmallVector<WeightedEdge, 8>> Edges);
1013 /// The edges in \p Edges[0] are assumed to have a different destination than
1014 /// the edges in \p Edges[1]. Simple counting shows that the best pair is either
1022         Edges) {
1032   llvm::stable_sort(Edges[0], Cmp);
1033   llvm::stable_sort(Edges[1], Cmp);
1034   auto BestA = Edges[0].begin();
1035   auto BestB = Edges[1].begin();
1080   SmallVector<WeightedEdge, 8> Edges[2];
1092       Edges[SuccIndex].push_back({EdgeFreq, SuccPred, Succ});
1099   std::tie(BestA, BestB) = getBestNonConflictingEdges(BB, Edges);
1273     std::vector<MachineBasicBlock *> Edges;
1276         : Edges({src, dst}) {}
1281       Edges.push_back(dst);
1284     unsigned count() const { return Edges.size() - 1; }
1287       return Edges.back();
1365     MachineBasicBlock *dst = Chain.Edges.back();
1366     Chain.Edges.pop_back();
1367     for (MachineBasicBlock *src : reverse(Chain.Edges)) {