Lines Matching refs:SDep
264 SDep Dep;
266 Dep = SDep(SU, SDep::Artificial);
271 Dep = SDep(SU, SDep::Data, *Alias);
297 SDep::Kind Kind = MO.isUse() ? SDep::Anti : SDep::Output;
307 (Kind != SDep::Output || !MO.isDead() ||
309 if (Kind == SDep::Anti)
310 DefSU->addPred(SDep(SU, Kind, /*Reg=*/*Alias));
312 SDep Dep(SU, Kind, /*Reg=*/*Alias);
389 SDep Dep(SU, SDep::Output, Reg);
422 SDep dep(DefSU, SDep::Data, Reg);
429 ST.adjustSchedDependency(DefSU, SU, const_cast<SDep &>(dep));
437 DefI->SU->addPred(SDep(SU, SDep::Anti, Reg));
583 SUb->addPred(SDep(SUa, SDep::MayAliasMem));
614 SDep Dep(SU, SDep::MayAliasMem);
640 SDep Dep(SUa, isNormalMemory ? SDep::MayAliasMem : SDep::Barrier);
780 SDep Dep(SU, SDep::Artificial);
800 I->second->addPred(SDep(SU, SDep::Barrier));
805 SDep Dep(SU, SDep::Barrier);
812 BarrierChain->addPred(SDep(SU, SDep::Barrier));
914 BarrierChain->addPred(SDep(SU, SDep::Barrier));
919 ExitSU.addPred(SDep(SU, SDep::Artificial));
967 BarrierChain->addPred(SDep(SU, SDep::Barrier));
1071 if (PI->getKind() != SDep::Data)
1099 void visitPostorderEdge(const SDep &PredDep, const SUnit *Succ) {
1106 void visitCrossEdge(const SDep &PredDep, const SUnit *Succ) {
1152 bool joinPredSubtree(const SDep &PredDep, const SUnit *Succ,
1154 assert(PredDep.getKind() == SDep::Data && "Subtrees are for data edges");
1167 if (SI->getKind() == SDep::Data) {
1213 const SDep *backtrack() {
1231 if (SI->getKind() == SDep::Data && !SI->getSUnit()->isBoundaryNode())
1256 const SDep &PredDep = *DFS.getPred();
1259 if (PredDep.getKind() != SDep::Data
1273 const SDep *PredDep = DFS.backtrack();
