258 static void AntiDepEdges(const SUnit *SU, std::vector<const SDep *> &Edges) {  in AntiDepEdges()
260   for (const SDep &Pred : SU->Preds) {  in AntiDepEdges()
261     if ((Pred.getKind() == SDep::Anti) || (Pred.getKind() == SDep::Output)) {  in AntiDepEdges()
271   const SDep *Next = nullptr;  in CriticalPathStep()
275     for (const SDep &Pred : SU->Preds) {  in CriticalPathStep()
282           (NextDepth == PredTotalLatency && Pred.getKind() == SDep::Anti)) {  in CriticalPathStep()
813     std::vector<const SDep *> Edges;  in BreakAntiDependencies()
831       for (const SDep *Edge : Edges) {  in BreakAntiDependencies()
834         if ((Edge->getKind() != SDep::Anti) &&  in BreakAntiDependencies()
835             (Edge->getKind() != SDep::Output)) continue;  in BreakAntiDependencies()
874           for (const SDep &Pred : PathSU->Preds) {  in BreakAntiDependencies()
875             if (Pred.getSUnit() == NextSU ? (Pred.getKind() != SDep::Anti ||  in BreakAntiDependencies()
877                                           : (Pred.getKind() == SDep::Data &&  in BreakAntiDependencies()
883           for (const SDep &Pred : PathSU->Preds) {  in BreakAntiDependencies()
884             if ((Pred.getSUnit() == NextSU) && (Pred.getKind() != SDep::Anti) &&  in BreakAntiDependencies()
885                 (Pred.getKind() != SDep::Output)) {  in BreakAntiDependencies()
890                        (Pred.getKind() == SDep::Data) &&  in BreakAntiDependencies()
908           for (SDep S : PathSU->Succs) {  in BreakAntiDependencies()
909             SDep::Kind K = S.getKind();  in BreakAntiDependencies()
910             if (K != SDep::Data && K != SDep::Output && K != SDep::Anti)  in BreakAntiDependencies()