252 static void AntiDepEdges(const SUnit *SU, std::vector<const SDep*>& Edges) {  in AntiDepEdges()
256     if ((P->getKind() == SDep::Anti) || (P->getKind() == SDep::Output)) {  in AntiDepEdges()
266   const SDep *Next = nullptr;  in CriticalPathStep()
278           (NextDepth == PredTotalLatency && P->getKind() == SDep::Anti)) {  in CriticalPathStep()
815     std::vector<const SDep *> Edges;  in BreakAntiDependencies()
834         const SDep *Edge = Edges[i];  in BreakAntiDependencies()
837         if ((Edge->getKind() != SDep::Anti) &&  in BreakAntiDependencies()
838             (Edge->getKind() != SDep::Output)) continue;  in BreakAntiDependencies()
880                 (P->getKind() != SDep::Anti || P->getReg() != AntiDepReg) :  in BreakAntiDependencies()
881                 (P->getKind() == SDep::Data && P->getReg() == AntiDepReg)) {  in BreakAntiDependencies()
888             if ((P->getSUnit() == NextSU) && (P->getKind() != SDep::Anti) &&  in BreakAntiDependencies()
889                 (P->getKind() != SDep::Output)) {  in BreakAntiDependencies()
894                        (P->getKind() == SDep::Data) &&  in BreakAntiDependencies()
912           for (SDep S : PathSU->Succs) {  in BreakAntiDependencies()
913             SDep::Kind K = S.getKind();  in BreakAntiDependencies()
914             if (K != SDep::Data && K != SDep::Output && K != SDep::Anti)  in BreakAntiDependencies()