884               SDep Dep(Load, SDep::Barrier);  in addLoopCarriedDependences()  local
885               Dep.setLatency(1);  in addLoopCarriedDependences()
886               SU.addPred(Dep);  in addLoopCarriedDependences()
894             SDep Dep(Load, SDep::Barrier);  in addLoopCarriedDependences()  local
895             Dep.setLatency(1);  in addLoopCarriedDependences()
896             SU.addPred(Dep);  in addLoopCarriedDependences()
902             SDep Dep(Load, SDep::Barrier);  in addLoopCarriedDependences()  local
903             Dep.setLatency(1);  in addLoopCarriedDependences()
904             SU.addPred(Dep);  in addLoopCarriedDependences()
909             SDep Dep(Load, SDep::Barrier);  in addLoopCarriedDependences()  local
910             Dep.setLatency(1);  in addLoopCarriedDependences()
911             SU.addPred(Dep);  in addLoopCarriedDependences()
918             SDep Dep(Load, SDep::Barrier);  in addLoopCarriedDependences()  local
919             Dep.setLatency(1);  in addLoopCarriedDependences()
920             SU.addPred(Dep);  in addLoopCarriedDependences()
960               SDep Dep(SU, SDep::Anti, Reg);  in updatePhiDependences()  local
961               Dep.setLatency(1);  in updatePhiDependences()
962               I.addPred(Dep);  in updatePhiDependences()
980             SDep Dep(SU, SDep::Data, Reg);  in updatePhiDependences()  local
981             Dep.setLatency(0);  in updatePhiDependences()
982             ST.adjustSchedDependency(SU, 0, &I, MO.getOperandNo(), Dep,  in updatePhiDependences()
984             I.addPred(Dep);  in updatePhiDependences()
1068     SDep Dep(&I, SDep::Anti, NewBase);  in changeDependences()  local
1070     LastSU->addPred(Dep);  in changeDependences()
1645     SDep Dep(SU, SDep::Anti, Reg);  in swapAntiDependences()  local
1646     Dep.setLatency(Lat);  in swapAntiDependences()
1647     TargetSU->addPred(Dep);  in swapAntiDependences()
1665         auto Dep = OutputDeps.find(BackEdge);  in createAdjacencyStructure()  local
1666         if (Dep != OutputDeps.end()) {  in createAdjacencyStructure()
1667           BackEdge = Dep->second;  in createAdjacencyStructure()
1668           OutputDeps.erase(Dep);  in createAdjacencyStructure()
1808     for (auto &Dep : SU.Preds) {  in apply()  local
1809       SUnit *TmpSU = Dep.getSUnit();  in apply()
1811       SDep::Kind DepKind = Dep.getKind();  in apply()
1829       for (auto &Dep : PHISUs[Index]->Succs) {  in apply()  local
1830         if (Dep.getKind() != SDep::Data)  in apply()
1833         SUnit *TmpSU = Dep.getSUnit();  in apply()
2721 bool SwingSchedulerDAG::isLoopCarriedDep(SUnit *Source, const SDep &Dep,  in isLoopCarriedDep()  argument
2723   if ((Dep.getKind() != SDep::Order && Dep.getKind() != SDep::Output) ||  in isLoopCarriedDep()
2724       Dep.isArtificial() || Dep.getSUnit()->isBoundaryNode())  in isLoopCarriedDep()
2730   if (Dep.getKind() == SDep::Output)  in isLoopCarriedDep()
2734   MachineInstr *DI = Dep.getSUnit()->getInstr();  in isLoopCarriedDep()
2858 int SMSchedule::earliestCycleInChain(const SDep &Dep) {  in earliestCycleInChain()  argument
2861   Worklist.push_back(Dep);  in earliestCycleInChain()
2881 int SMSchedule::latestCycleInChain(const SDep &Dep) {  in latestCycleInChain()  argument
2884   Worklist.push_back(Dep);  in latestCycleInChain()
2929         const SDep &Dep = SU->Preds[i];  in computeStart()  local
2930         if (Dep.getSUnit() == I) {  in computeStart()
2931           if (!DAG->isBackedge(SU, Dep)) {  in computeStart()
2932             int EarlyStart = cycle + Dep.getLatency() -  in computeStart()
2933                              DAG->getDistance(Dep.getSUnit(), SU, Dep) * II;  in computeStart()
2935             if (DAG->isLoopCarriedDep(SU, Dep, false)) {  in computeStart()
2936               int End = earliestCycleInChain(Dep) + (II - 1);  in computeStart()
2940             int LateStart = cycle - Dep.getLatency() +  in computeStart()
2941                             DAG->getDistance(SU, Dep.getSUnit(), Dep) * II;  in computeStart()
2948         if (BE && Dep.getSUnit() == BE && !SU->getInstr()->isPHI() &&  in computeStart()
2954           const SDep &Dep = SU->Succs[i];  in computeStart()  local
2955           if (!DAG->isBackedge(SU, Dep)) {  in computeStart()
2956             int LateStart = cycle - Dep.getLatency() +  in computeStart()
2957                             DAG->getDistance(SU, Dep.getSUnit(), Dep) * II;  in computeStart()
2959             if (DAG->isLoopCarriedDep(SU, Dep)) {  in computeStart()
2960               int Start = latestCycleInChain(Dep) + 1 - II;  in computeStart()
2964             int EarlyStart = cycle + Dep.getLatency() -  in computeStart()
2965                              DAG->getDistance(Dep.getSUnit(), SU, Dep) * II;  in computeStart()
3183     for (auto &Dep : SU->Preds)  in computeUnpipelineableNodes()  local
3184       Worklist.push_back(Dep.getSUnit());  in computeUnpipelineableNodes()
3186       for (auto &Dep : SU->Succs)  in computeUnpipelineableNodes()  local
3187         if (Dep.getKind() == SDep::Anti)  in computeUnpipelineableNodes()
3188           Worklist.push_back(Dep.getSUnit());  in computeUnpipelineableNodes()
3210     for (auto &Dep : SU.Preds)  in normalizeNonPipelinedInstructions()  local
3211       NewCycle = std::max(InstrToCycle[Dep.getSUnit()], NewCycle);  in normalizeNonPipelinedInstructions()