Lines Matching refs:SDep
693 if (SI.getKind() == SDep::Order) { in isSuccOrder()
785 SDep Dep(Load, SDep::Barrier); in addLoopCarriedDependences()
795 SDep Dep(Load, SDep::Barrier); in addLoopCarriedDependences()
803 SDep Dep(Load, SDep::Barrier); in addLoopCarriedDependences()
810 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()
963 if (P.getSUnit() == &I && P.getKind() == SDep::Order) in changeDependences()
972 SDep Dep(&I, SDep::Anti, NewBase); in changeDependences()
1196 SmallVector<std::pair<SUnit *, SDep>, 8> DepsAdded; in swapAntiDependences()
1201 if (IP->getKind() != SDep::Anti) in swapAntiDependences()
1206 for (SmallVector<std::pair<SUnit *, SDep>, 8>::iterator I = DepsAdded.begin(), in swapAntiDependences()
1211 SDep &D = I->second; in swapAntiDependences()
1216 SDep Dep(SU, SDep::Anti, Reg); in swapAntiDependences()
1233 if (SI.getKind() == SDep::Output) { in createAdjacencyStructure()
1246 (SI.getKind() == SDep::Anti && !SI.getSUnit()->getInstr()->isPHI())) in createAdjacencyStructure()
1260 if (PI.getKind() == SDep::Order && PI.getSUnit()->getInstr()->mayLoad()) { in createAdjacencyStructure()
1383 SDep::Kind DepKind = Dep.getKind(); in apply()
1385 if (DepKind == SDep::Anti && TmpMI->isPHI()) in apply()
1389 else if (DepKind == SDep::Data && !TmpMI->isPHI() && TmpSU->NumPreds > 0) in apply()
1402 if (Dep.getKind() != SDep::Data) in apply()
1423 Src->addPred(SDep(I, SDep::Artificial)); in apply()
1434 static bool ignoreDependence(const SDep &D, bool isPred) { in ignoreDependence()
1437 return D.getKind() == SDep::Anti && isPred; in ignoreDependence()
1547 if (IS->getKind() != SDep::Anti) in pred_L()
1579 if (PI->getKind() != SDep::Anti) in succ_L()
1608 if (PI.getKind() == SDep::Anti) in computePath()
1967 if (I.getKind() != SDep::Anti) in computeNodeOrder()
2016 if (I.getKind() != SDep::Anti) in computeNodeOrder()
2301 bool SwingSchedulerDAG::isLoopCarriedDep(SUnit *Source, const SDep &Dep, in isLoopCarriedDep()
2303 if ((Dep.getKind() != SDep::Order && Dep.getKind() != SDep::Output) || in isLoopCarriedDep()
2310 if (Dep.getKind() == SDep::Output) in isLoopCarriedDep()
2442 int SMSchedule::earliestCycleInChain(const SDep &Dep) { in earliestCycleInChain()
2444 SmallVector<SDep, 8> Worklist; in earliestCycleInChain()
2448 const SDep &Cur = Worklist.pop_back_val(); in earliestCycleInChain()
2457 if (PI.getKind() == SDep::Order || PI.getKind() == SDep::Output) in earliestCycleInChain()
2465 int SMSchedule::latestCycleInChain(const SDep &Dep) { in latestCycleInChain()
2467 SmallVector<SDep, 8> Worklist; in latestCycleInChain()
2471 const SDep &Cur = Worklist.pop_back_val(); in latestCycleInChain()
2480 if (SI.getKind() == SDep::Order || SI.getKind() == SDep::Output) in latestCycleInChain()
2494 if (S.getKind() == SDep::Data && S.getSUnit()->getInstr()->isPHI()) in multipleIterations()
2514 const SDep &Dep = SU->Preds[i]; in computeStart()
2539 const SDep &Dep = SU->Succs[i]; in computeStart()
2632 if (S.getKind() == SDep::Order && stageScheduled(*I) == StageInst1) { in orderDependence()
2640 else if (S.getKind() == SDep::Anti && stageScheduled(*I) == StageInst1) { in orderDependence()
2649 if (P.getKind() == SDep::Order && stageScheduled(*I) == StageInst1) { in orderDependence()
2806 for (SDep &PredEdge : SU->Preds) { in checkValidNodeOrder()
2817 for (SDep &SuccEdge : SU->Succs) { in checkValidNodeOrder()