733       if (SI.getKind() == SDep::Order) {  in isSuccOrder()
825               SDep Dep(Load, SDep::Barrier);  in addLoopCarriedDependences()
835             SDep Dep(Load, SDep::Barrier);  in addLoopCarriedDependences()
843             SDep Dep(Load, SDep::Barrier);  in addLoopCarriedDependences()
850             SDep Dep(Load, SDep::Barrier);  in addLoopCarriedDependences()
859             SDep Dep(Load, SDep::Barrier);  in addLoopCarriedDependences()
876   SmallVector<SDep, 4> RemoveDeps;  in updatePhiDependences()
901               SDep Dep(SU, SDep::Anti, Reg);  in updatePhiDependences()
909                 I.addPred(SDep(SU, SDep::Barrier));  in updatePhiDependences()
921             SDep Dep(SU, SDep::Data, Reg);  in updatePhiDependences()
930               I.addPred(SDep(SU, SDep::Barrier));  in updatePhiDependences()
940       if (PMI->isPHI() && PI.getKind() == SDep::Order) {  in updatePhiDependences()
988     SmallVector<SDep, 4> Deps;  in changeDependences()
989     for (const SDep &P : I.Preds)  in changeDependences()
999       if (P.getSUnit() == &I && P.getKind() == SDep::Order)  in changeDependences()
1008     SDep Dep(&I, SDep::Anti, NewBase);  in changeDependences()
1571   SmallVector<std::pair<SUnit *, SDep>, 8> DepsAdded;  in swapAntiDependences()
1573     for (SDep &Pred : SU.Preds)  in swapAntiDependences()
1574       if (Pred.getKind() == SDep::Anti)  in swapAntiDependences()
1577   for (std::pair<SUnit *, SDep> &P : DepsAdded) {  in swapAntiDependences()
1580     SDep &D = P.second;  in swapAntiDependences()
1585     SDep Dep(SU, SDep::Anti, Reg);  in swapAntiDependences()
1602       if (SI.getKind() == SDep::Output) {  in createAdjacencyStructure()
1615           (SI.getKind() == SDep::Anti && !SI.getSUnit()->getInstr()->isPHI()))  in createAdjacencyStructure()
1629       if (PI.getKind() == SDep::Order && PI.getSUnit()->getInstr()->mayLoad()) {  in createAdjacencyStructure()
1751       SDep::Kind DepKind = Dep.getKind();  in apply()
1753       if (DepKind == SDep::Anti && TmpMI->isPHI())  in apply()
1757       else if (DepKind == SDep::Data && !TmpMI->isPHI() && TmpSU->NumPreds > 0)  in apply()
1770         if (Dep.getKind() != SDep::Data)  in apply()
1791           Src->addPred(SDep(I, SDep::Artificial));  in apply()
1802 static bool ignoreDependence(const SDep &D, bool isPred) {  in ignoreDependence()
1805   return D.getKind() == SDep::Anti && isPred;  in ignoreDependence()
1830     for (const SDep &P : SU->Preds) {  in computeNodeFunctions()
1850     for (const SDep &S : SU->Succs) {  in computeNodeFunctions()
1893     for (const SDep &Pred : SU->Preds) {  in pred_L()
1902     for (const SDep &Succ : SU->Succs) {  in pred_L()
1903       if (Succ.getKind() != SDep::Anti)  in pred_L()
1922     for (const SDep &Succ : SU->Succs) {  in succ_L()
1930     for (const SDep &Pred : SU->Preds) {  in succ_L()
1931       if (Pred.getKind() != SDep::Anti)  in succ_L()
1962     if (PI.getKind() == SDep::Anti)  in computePath()
2307             if (I.getKind() != SDep::Anti)  in computeNodeOrder()
2356             if (I.getKind() != SDep::Anti)  in computeNodeOrder()
2665 bool SwingSchedulerDAG::isLoopCarriedDep(SUnit *Source, const SDep &Dep,  in isLoopCarriedDep()
2667   if ((Dep.getKind() != SDep::Order && Dep.getKind() != SDep::Output) ||  in isLoopCarriedDep()
2674   if (Dep.getKind() == SDep::Output)  in isLoopCarriedDep()
2801 int SMSchedule::earliestCycleInChain(const SDep &Dep) {  in earliestCycleInChain()
2803   SmallVector<SDep, 8> Worklist;  in earliestCycleInChain()
2807     const SDep &Cur = Worklist.pop_back_val();  in earliestCycleInChain()
2816       if (PI.getKind() == SDep::Order || PI.getKind() == SDep::Output)  in earliestCycleInChain()
2824 int SMSchedule::latestCycleInChain(const SDep &Dep) {  in latestCycleInChain()
2826   SmallVector<SDep, 8> Worklist;  in latestCycleInChain()
2830     const SDep &Cur = Worklist.pop_back_val();  in latestCycleInChain()
2839       if (SI.getKind() == SDep::Order || SI.getKind() == SDep::Output)  in latestCycleInChain()
2853         if (S.getKind() == SDep::Data && S.getSUnit()->getInstr()->isPHI())  in multipleIterations()
2873         const SDep &Dep = SU->Preds[i];  in computeStart()
2898           const SDep &Dep = SU->Succs[i];  in computeStart()
2990       if (S.getKind() == SDep::Order && stageScheduled(*I) == StageInst1) {  in orderDependence()
2998       else if (S.getKind() == SDep::Anti && stageScheduled(*I) == StageInst1) {  in orderDependence()
3007       if (P.getKind() == SDep::Order && stageScheduled(*I) == StageInst1) {  in orderDependence()
3118         if (Dep.getKind() == SDep::Anti)  in computeUnpipelineableNodes()
3232     for (SDep &PredEdge : SU->Preds) {  in checkValidNodeOrder()
3243     for (SDep &SuccEdge : SU->Succs) {  in checkValidNodeOrder()