Lines Matching defs:Edges

381   /// Edges that have already been computed as optimal.
589       MutableArrayRef<SmallVector<WeightedEdge, 8>> Edges);
1028 /// The edges in \p Edges[0] are assumed to have a different destination than
1029 /// the edges in \p Edges[1]. Simple counting shows that the best pair is either
1037         Edges) {
1047   llvm::stable_sort(Edges[0], Cmp);
1048   llvm::stable_sort(Edges[1], Cmp);
1049   auto BestA = Edges[0].begin();
1050   auto BestB = Edges[1].begin();
1095   SmallVector<WeightedEdge, 8> Edges[2];
1107       Edges[SuccIndex].push_back({EdgeFreq, SuccPred, Succ});
1114   std::tie(BestA, BestB) = getBestNonConflictingEdges(BB, Edges);
1288     std::vector<MachineBasicBlock *> Edges;
1291         : Edges({src, dst}) {}
1296       Edges.push_back(dst);
1299     unsigned count() const { return Edges.size() - 1; }
1301     MachineBasicBlock *getKey() const { return Edges.back(); }
1378     MachineBasicBlock *dst = Chain.Edges.back();
1379     Chain.Edges.pop_back();
1380     for (MachineBasicBlock *src : reverse(Chain.Edges)) {