786               SDep Dep(Load, SDep::Barrier);  in addLoopCarriedDependences()  local
787               Dep.setLatency(1);  in addLoopCarriedDependences()
788               SU.addPred(Dep);  in addLoopCarriedDependences()
796             SDep Dep(Load, SDep::Barrier);  in addLoopCarriedDependences()  local
797             Dep.setLatency(1);  in addLoopCarriedDependences()
798             SU.addPred(Dep);  in addLoopCarriedDependences()
804             SDep Dep(Load, SDep::Barrier);  in addLoopCarriedDependences()  local
805             Dep.setLatency(1);  in addLoopCarriedDependences()
806             SU.addPred(Dep);  in addLoopCarriedDependences()
811             SDep Dep(Load, SDep::Barrier);  in addLoopCarriedDependences()  local
812             Dep.setLatency(1);  in addLoopCarriedDependences()
813             SU.addPred(Dep);  in addLoopCarriedDependences()
820             SDep Dep(Load, SDep::Barrier);  in addLoopCarriedDependences()  local
821             Dep.setLatency(1);  in addLoopCarriedDependences()
822             SU.addPred(Dep);  in addLoopCarriedDependences()
864               SDep Dep(SU, SDep::Anti, Reg);  in updatePhiDependences()  local
865               Dep.setLatency(1);  in updatePhiDependences()
866               I.addPred(Dep);  in updatePhiDependences()
884             SDep Dep(SU, SDep::Data, Reg);  in updatePhiDependences()  local
885             Dep.setLatency(0);  in updatePhiDependences()
886             ST.adjustSchedDependency(SU, 0, &I, MI->getOperandNo(MOI), Dep);  in updatePhiDependences()
887             I.addPred(Dep);  in updatePhiDependences()
971     SDep Dep(&I, SDep::Anti, NewBase);  in changeDependences()  local
973     LastSU->addPred(Dep);  in changeDependences()
1207     SDep Dep(SU, SDep::Anti, Reg);  in swapAntiDependences()  local
1208     Dep.setLatency(Lat);  in swapAntiDependences()
1209     TargetSU->addPred(Dep);  in swapAntiDependences()
1227         auto Dep = OutputDeps.find(BackEdge);  in createAdjacencyStructure()  local
1228         if (Dep != OutputDeps.end()) {  in createAdjacencyStructure()
1229           BackEdge = Dep->second;  in createAdjacencyStructure()
1230           OutputDeps.erase(Dep);  in createAdjacencyStructure()
1370     for (auto &Dep : SU.Preds) {  in apply()  local
1371       SUnit *TmpSU = Dep.getSUnit();  in apply()
1373       SDep::Kind DepKind = Dep.getKind();  in apply()
1391       for (auto &Dep : PHISUs[Index]->Succs) {  in apply()  local
1392         if (Dep.getKind() != SDep::Data)  in apply()
1395         SUnit *TmpSU = Dep.getSUnit();  in apply()
2272 bool SwingSchedulerDAG::isLoopCarriedDep(SUnit *Source, const SDep &Dep,  in isLoopCarriedDep()  argument
2274   if ((Dep.getKind() != SDep::Order && Dep.getKind() != SDep::Output) ||  in isLoopCarriedDep()
2275       Dep.isArtificial() || Dep.getSUnit()->isBoundaryNode())  in isLoopCarriedDep()
2281   if (Dep.getKind() == SDep::Output)  in isLoopCarriedDep()
2285   MachineInstr *DI = Dep.getSUnit()->getInstr();  in isLoopCarriedDep()
2411 int SMSchedule::earliestCycleInChain(const SDep &Dep) {  in earliestCycleInChain()  argument
2414   Worklist.push_back(Dep);  in earliestCycleInChain()
2434 int SMSchedule::latestCycleInChain(const SDep &Dep) {  in latestCycleInChain()  argument
2437   Worklist.push_back(Dep);  in latestCycleInChain()
2483         const SDep &Dep = SU->Preds[i];  in computeStart()  local
2484         if (Dep.getSUnit() == I) {  in computeStart()
2485           if (!DAG->isBackedge(SU, Dep)) {  in computeStart()
2486             int EarlyStart = cycle + Dep.getLatency() -  in computeStart()
2487                              DAG->getDistance(Dep.getSUnit(), SU, Dep) * II;  in computeStart()
2489             if (DAG->isLoopCarriedDep(SU, Dep, false)) {  in computeStart()
2490               int End = earliestCycleInChain(Dep) + (II - 1);  in computeStart()
2494             int LateStart = cycle - Dep.getLatency() +  in computeStart()
2495                             DAG->getDistance(SU, Dep.getSUnit(), Dep) * II;  in computeStart()
2502         if (BE && Dep.getSUnit() == BE && !SU->getInstr()->isPHI() &&  in computeStart()
2508           const SDep &Dep = SU->Succs[i];  in computeStart()  local
2509           if (!DAG->isBackedge(SU, Dep)) {  in computeStart()
2510             int LateStart = cycle - Dep.getLatency() +  in computeStart()
2511                             DAG->getDistance(SU, Dep.getSUnit(), Dep) * II;  in computeStart()
2513             if (DAG->isLoopCarriedDep(SU, Dep)) {  in computeStart()
2514               int Start = latestCycleInChain(Dep) + 1 - II;  in computeStart()
2518             int EarlyStart = cycle + Dep.getLatency() -  in computeStart()
2519                              DAG->getDistance(Dep.getSUnit(), SU, Dep) * II;  in computeStart()
2725     for (auto &Dep : SU->Preds)  in computeUnpipelineableNodes()  local
2726       Worklist.push_back(Dep.getSUnit());  in computeUnpipelineableNodes()
2728       for (auto &Dep : SU->Succs)  in computeUnpipelineableNodes()  local
2729         if (Dep.getKind() == SDep::Anti)  in computeUnpipelineableNodes()
2730           Worklist.push_back(Dep.getSUnit());  in computeUnpipelineableNodes()
2752     for (auto &Dep : SU.Preds)  in normalizeNonPipelinedInstructions()  local
2753       NewCycle = std::max(InstrToCycle[Dep.getSUnit()], NewCycle);  in normalizeNonPipelinedInstructions()