Lines Matching refs:SDep
292 bool isBackedge(SUnit *Source, const SDep &Dep) { in isBackedge()
293 if (Dep.getKind() != SDep::Anti) in isBackedge()
299 static bool isOrder(SUnit *Source, const SDep &Dep) { in isOrder()
300 if (Dep.getKind() != SDep::Order) in isOrder()
306 bool isLoopCarriedOrder(SUnit *Source, const SDep &Dep, bool isSucc = true);
309 unsigned getLatency(SUnit *Source, const SDep &Dep) { in getLatency()
312 if (Dep.getKind() == SDep::Anti) { in getLatency()
324 unsigned getDistance(SUnit *U, SUnit *V, const SDep &Dep) { in getDistance()
327 if (V->getInstr()->isPHI() && Dep.getKind() == SDep::Anti) in getDistance()
599 int earliestCycleInChain(const SDep &Dep);
603 int latestCycleInChain(const SDep &Dep);
957 if (SI.getKind() == SDep::Order) { in isSuccOrder()
1028 SU.addPred(SDep(Load, SDep::Barrier)); in addLoopCarriedDependences()
1034 SU.addPred(SDep(Load, SDep::Barrier)); in addLoopCarriedDependences()
1041 SU.addPred(SDep(Load, SDep::Barrier)); in addLoopCarriedDependences()
1047 SU.addPred(SDep(Load, SDep::Barrier)); in addLoopCarriedDependences()
1052 SU.addPred(SDep(Load, SDep::Barrier)); in addLoopCarriedDependences()
1062 SU.addPred(SDep(Load, SDep::Barrier)); in addLoopCarriedDependences()
1076 SmallVector<SDep, 4> RemoveDeps; in updatePhiDependences()
1103 SDep Dep(SU, SDep::Anti, Reg); in updatePhiDependences()
1110 I.addPred(SDep(SU, SDep::Barrier)); in updatePhiDependences()
1122 SDep Dep(SU, SDep::Data, Reg); in updatePhiDependences()
1131 I.addPred(SDep(SU, SDep::Barrier)); in updatePhiDependences()
1141 if (PMI->isPHI() && PI.getKind() == SDep::Order) { in updatePhiDependences()
1189 SmallVector<SDep, 4> Deps; in changeDependences()
1201 if (P.getSUnit() == &I && P.getKind() == SDep::Order) in changeDependences()
1210 SDep Dep(&I, SDep::Anti, NewBase); in changeDependences()
1372 SmallVector<std::pair<SUnit *, SDep>, 8> DepsAdded; in swapAntiDependences()
1377 if (IP->getKind() != SDep::Anti) in swapAntiDependences()
1382 for (SmallVector<std::pair<SUnit *, SDep>, 8>::iterator I = DepsAdded.begin(), in swapAntiDependences()
1387 SDep &D = I->second; in swapAntiDependences()
1392 SDep Dep(SU, SDep::Anti, Reg); in swapAntiDependences()
1409 (SI.getKind() == SDep::Anti && !SI.getSUnit()->getInstr()->isPHI())) in createAdjacencyStructure()
1423 if (PI.getKind() == SDep::Order && PI.getSUnit()->getInstr()->mayLoad()) { in createAdjacencyStructure()
1510 static bool ignoreDependence(const SDep &D, bool isPred) { in ignoreDependence()
1513 return D.getKind() == SDep::Anti && isPred; in ignoreDependence()
1612 if (IS->getKind() != SDep::Anti) in pred_L()
1644 if (PI->getKind() != SDep::Anti) in succ_L()
1673 if (PI.getKind() == SDep::Anti) in computePath()
1955 if (SI.getSUnit() == Inst2 && SI.getKind() == SDep::Data) in hasDataDependence()
2034 if (I.getKind() != SDep::Anti) in computeNodeOrder()
2078 if (I.getKind() == SDep::Anti) in computeNodeOrder()
2084 if (I.getKind() != SDep::Anti) in computeNodeOrder()
3401 bool SwingSchedulerDAG::isLoopCarriedOrder(SUnit *Source, const SDep &Dep, in isLoopCarriedOrder()
3506 int SMSchedule::earliestCycleInChain(const SDep &Dep) { in earliestCycleInChain()
3508 SmallVector<SDep, 8> Worklist; in earliestCycleInChain()
3512 const SDep &Cur = Worklist.pop_back_val(); in earliestCycleInChain()
3529 int SMSchedule::latestCycleInChain(const SDep &Dep) { in latestCycleInChain()
3531 SmallVector<SDep, 8> Worklist; in latestCycleInChain()
3535 const SDep &Cur = Worklist.pop_back_val(); in latestCycleInChain()
3558 if (S.getKind() == SDep::Order && S.getSUnit()->getInstr()->isPHI()) in multipleIterations()
3578 const SDep &Dep = SU->Preds[i]; in computeStart()
3603 const SDep &Dep = SU->Succs[i]; in computeStart()
3689 if (S.getKind() == SDep::Order) { in orderDependence()
3706 if (P.getKind() == SDep::Order) { in orderDependence()