694       if (SI.getKind() == SDep::Order) {  in isSuccOrder()
786               SDep Dep(Load, SDep::Barrier);  in addLoopCarriedDependences()
796             SDep Dep(Load, SDep::Barrier);  in addLoopCarriedDependences()
804             SDep Dep(Load, SDep::Barrier);  in addLoopCarriedDependences()
811             SDep Dep(Load, SDep::Barrier);  in addLoopCarriedDependences()
820             SDep Dep(Load, SDep::Barrier);  in addLoopCarriedDependences()
837   SmallVector<SDep, 4> RemoveDeps;  in updatePhiDependences()
864               SDep Dep(SU, SDep::Anti, Reg);  in updatePhiDependences()
872                 I.addPred(SDep(SU, SDep::Barrier));  in updatePhiDependences()
884             SDep Dep(SU, SDep::Data, Reg);  in updatePhiDependences()
893               I.addPred(SDep(SU, SDep::Barrier));  in updatePhiDependences()
903       if (PMI->isPHI() && PI.getKind() == SDep::Order) {  in updatePhiDependences()
951     SmallVector<SDep, 4> Deps;  in changeDependences()
952     for (const SDep &P : I.Preds)  in changeDependences()
962       if (P.getSUnit() == &I && P.getKind() == SDep::Order)  in changeDependences()
971     SDep Dep(&I, SDep::Anti, NewBase);  in changeDependences()
1193   SmallVector<std::pair<SUnit *, SDep>, 8> DepsAdded;  in swapAntiDependences()
1195     for (SDep &Pred : SU.Preds)  in swapAntiDependences()
1196       if (Pred.getKind() == SDep::Anti)  in swapAntiDependences()
1199   for (std::pair<SUnit *, SDep> &P : DepsAdded) {  in swapAntiDependences()
1202     SDep &D = P.second;  in swapAntiDependences()
1207     SDep Dep(SU, SDep::Anti, Reg);  in swapAntiDependences()
1224       if (SI.getKind() == SDep::Output) {  in createAdjacencyStructure()
1237           (SI.getKind() == SDep::Anti && !SI.getSUnit()->getInstr()->isPHI()))  in createAdjacencyStructure()
1251       if (PI.getKind() == SDep::Order && PI.getSUnit()->getInstr()->mayLoad()) {  in createAdjacencyStructure()
1373       SDep::Kind DepKind = Dep.getKind();  in apply()
1375       if (DepKind == SDep::Anti && TmpMI->isPHI())  in apply()
1379       else if (DepKind == SDep::Data && !TmpMI->isPHI() && TmpSU->NumPreds > 0)  in apply()
1392         if (Dep.getKind() != SDep::Data)  in apply()
1413           Src->addPred(SDep(I, SDep::Artificial));  in apply()
1424 static bool ignoreDependence(const SDep &D, bool isPred) {  in ignoreDependence()
1427   return D.getKind() == SDep::Anti && isPred;  in ignoreDependence()
1452     for (const SDep &P : SU->Preds) {  in computeNodeFunctions()
1472     for (const SDep &S : SU->Succs) {  in computeNodeFunctions()
1515     for (const SDep &Pred : SU->Preds) {  in pred_L()
1524     for (const SDep &Succ : SU->Succs) {  in pred_L()
1525       if (Succ.getKind() != SDep::Anti)  in pred_L()
1544     for (const SDep &Succ : SU->Succs) {  in succ_L()
1552     for (const SDep &Pred : SU->Preds) {  in succ_L()
1553       if (Pred.getKind() != SDep::Anti)  in succ_L()
1584     if (PI.getKind() == SDep::Anti)  in computePath()
1932             if (I.getKind() != SDep::Anti)  in computeNodeOrder()
1981             if (I.getKind() != SDep::Anti)  in computeNodeOrder()
2272 bool SwingSchedulerDAG::isLoopCarriedDep(SUnit *Source, const SDep &Dep,  in isLoopCarriedDep()
2274   if ((Dep.getKind() != SDep::Order && Dep.getKind() != SDep::Output) ||  in isLoopCarriedDep()
2281   if (Dep.getKind() == SDep::Output)  in isLoopCarriedDep()
2411 int SMSchedule::earliestCycleInChain(const SDep &Dep) {  in earliestCycleInChain()
2413   SmallVector<SDep, 8> Worklist;  in earliestCycleInChain()
2417     const SDep &Cur = Worklist.pop_back_val();  in earliestCycleInChain()
2426       if (PI.getKind() == SDep::Order || PI.getKind() == SDep::Output)  in earliestCycleInChain()
2434 int SMSchedule::latestCycleInChain(const SDep &Dep) {  in latestCycleInChain()
2436   SmallVector<SDep, 8> Worklist;  in latestCycleInChain()
2440     const SDep &Cur = Worklist.pop_back_val();  in latestCycleInChain()
2449       if (SI.getKind() == SDep::Order || SI.getKind() == SDep::Output)  in latestCycleInChain()
2463         if (S.getKind() == SDep::Data && S.getSUnit()->getInstr()->isPHI())  in multipleIterations()
2483         const SDep &Dep = SU->Preds[i];  in computeStart()
2508           const SDep &Dep = SU->Succs[i];  in computeStart()
2600       if (S.getKind() == SDep::Order && stageScheduled(*I) == StageInst1) {  in orderDependence()
2608       else if (S.getKind() == SDep::Anti && stageScheduled(*I) == StageInst1) {  in orderDependence()
2617       if (P.getKind() == SDep::Order && stageScheduled(*I) == StageInst1) {  in orderDependence()
2729         if (Dep.getKind() == SDep::Anti)  in computeUnpipelineableNodes()
2843     for (SDep &PredEdge : SU->Preds) {  in checkValidNodeOrder()
2854     for (SDep &SuccEdge : SU->Succs) {  in checkValidNodeOrder()