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