793       if (SI.getKind() == SDep::Order) {  in isSuccOrder()
884               SDep Dep(Load, SDep::Barrier);  in addLoopCarriedDependences()
894             SDep Dep(Load, SDep::Barrier);  in addLoopCarriedDependences()
902             SDep Dep(Load, SDep::Barrier);  in addLoopCarriedDependences()
909             SDep Dep(Load, SDep::Barrier);  in addLoopCarriedDependences()
918             SDep Dep(Load, SDep::Barrier);  in addLoopCarriedDependences()
935   SmallVector<SDep, 4> RemoveDeps;  in updatePhiDependences()
960               SDep Dep(SU, SDep::Anti, Reg);  in updatePhiDependences()
968                 I.addPred(SDep(SU, SDep::Barrier));  in updatePhiDependences()
980             SDep Dep(SU, SDep::Data, Reg);  in updatePhiDependences()
990               I.addPred(SDep(SU, SDep::Barrier));  in updatePhiDependences()
1000       if (PMI->isPHI() && PI.getKind() == SDep::Order) {  in updatePhiDependences()
1010     for (const SDep &D : RemoveDeps)  in updatePhiDependences()
1048     SmallVector<SDep, 4> Deps;  in changeDependences()
1049     for (const SDep &P : I.Preds)  in changeDependences()
1052     for (const SDep &D : Deps) {  in changeDependences()
1059       if (P.getSUnit() == &I && P.getKind() == SDep::Order)  in changeDependences()
1061     for (const SDep &D : Deps) {  in changeDependences()
1068     SDep Dep(&I, SDep::Anti, NewBase);  in changeDependences()
1631   SmallVector<std::pair<SUnit *, SDep>, 8> DepsAdded;  in swapAntiDependences()
1633     for (SDep &Pred : SU.Preds)  in swapAntiDependences()
1634       if (Pred.getKind() == SDep::Anti)  in swapAntiDependences()
1637   for (std::pair<SUnit *, SDep> &P : DepsAdded) {  in swapAntiDependences()
1640     SDep &D = P.second;  in swapAntiDependences()
1645     SDep Dep(SU, SDep::Anti, Reg);  in swapAntiDependences()
1662       if (SI.getKind() == SDep::Output) {  in createAdjacencyStructure()
1675           (SI.getKind() == SDep::Anti && !SI.getSUnit()->getInstr()->isPHI()))  in createAdjacencyStructure()
1689       if (PI.getKind() == SDep::Order && PI.getSUnit()->getInstr()->mayLoad()) {  in createAdjacencyStructure()
1811       SDep::Kind DepKind = Dep.getKind();  in apply()
1813       if (DepKind == SDep::Anti && TmpMI->isPHI())  in apply()
1817       else if (DepKind == SDep::Data && !TmpMI->isPHI() && TmpSU->NumPreds > 0)  in apply()
1830         if (Dep.getKind() != SDep::Data)  in apply()
1851           Src->addPred(SDep(I, SDep::Artificial));  in apply()
1862 static bool ignoreDependence(const SDep &D, bool isPred) {  in ignoreDependence()
1865   return D.getKind() == SDep::Anti && isPred;  in ignoreDependence()
1890     for (const SDep &P : SU->Preds) {  in computeNodeFunctions()
1910     for (const SDep &S : SU->Succs) {  in computeNodeFunctions()
1953     for (const SDep &Pred : SU->Preds) {  in pred_L()
1962     for (const SDep &Succ : SU->Succs) {  in pred_L()
1963       if (Succ.getKind() != SDep::Anti)  in pred_L()
1982     for (const SDep &Succ : SU->Succs) {  in succ_L()
1990     for (const SDep &Pred : SU->Preds) {  in succ_L()
1991       if (Pred.getKind() != SDep::Anti)  in succ_L()
2022     if (PI.getKind() == SDep::Anti)  in computePath()
2367             if (I.getKind() != SDep::Anti)  in computeNodeOrder()
2416             if (I.getKind() != SDep::Anti)  in computeNodeOrder()
2721 bool SwingSchedulerDAG::isLoopCarriedDep(SUnit *Source, const SDep &Dep,  in isLoopCarriedDep()
2723   if ((Dep.getKind() != SDep::Order && Dep.getKind() != SDep::Output) ||  in isLoopCarriedDep()
2730   if (Dep.getKind() == SDep::Output)  in isLoopCarriedDep()
2858 int SMSchedule::earliestCycleInChain(const SDep &Dep) {  in earliestCycleInChain()
2860   SmallVector<SDep, 8> Worklist;  in earliestCycleInChain()
2864     const SDep &Cur = Worklist.pop_back_val();  in earliestCycleInChain()
2873       if (PI.getKind() == SDep::Order || PI.getKind() == SDep::Output)  in earliestCycleInChain()
2881 int SMSchedule::latestCycleInChain(const SDep &Dep) {  in latestCycleInChain()
2883   SmallVector<SDep, 8> Worklist;  in latestCycleInChain()
2887     const SDep &Cur = Worklist.pop_back_val();  in latestCycleInChain()
2896       if (SI.getKind() == SDep::Order || SI.getKind() == SDep::Output)  in latestCycleInChain()
2910         if (S.getKind() == SDep::Data && S.getSUnit()->getInstr()->isPHI())  in multipleIterations()
2929         const SDep &Dep = SU->Preds[i];  in computeStart()
2954           const SDep &Dep = SU->Succs[i];  in computeStart()
3046       if (S.getKind() == SDep::Order && stageScheduled(*I) == StageInst1) {  in orderDependence()
3054       else if (S.getKind() == SDep::Anti && stageScheduled(*I) == StageInst1) {  in orderDependence()
3063       if (P.getKind() == SDep::Order && stageScheduled(*I) == StageInst1) {  in orderDependence()
3158   for (const SDep &Pred : SU->Preds)  in onlyHasLoopCarriedOutputOrOrderPreds()
3161   for (const SDep &Succ : SU->Succs)  in onlyHasLoopCarriedOutputOrOrderPreds()
3187         if (Dep.getKind() == SDep::Anti)  in computeUnpipelineableNodes()
3301     for (SDep &PredEdge : SU->Preds) {  in checkValidNodeOrder()
3312     for (SDep &SuccEdge : SU->Succs) {  in checkValidNodeOrder()