303       SDep Dep;  in addPhysRegDataDeps()
305         Dep = SDep(SU, SDep::Artificial);  in addPhysRegDataDeps()
310         Dep = SDep(SU, SDep::Data, *Alias);  in addPhysRegDataDeps()
336   SDep::Kind Kind = MO.isUse() ? SDep::Anti : SDep::Output;  in addPhysRegDeps()
346           (Kind != SDep::Output || !MO.isDead() ||  in addPhysRegDeps()
348         if (Kind == SDep::Anti)  in addPhysRegDeps()
349           DefSU->addPred(SDep(SU, Kind, /*Reg=*/*Alias));  in addPhysRegDeps()
351           SDep Dep(SU, Kind, /*Reg=*/*Alias);  in addPhysRegDeps()
461         SDep Dep(SU, SDep::Data, Reg);  in addVRegDefDeps()
504     SDep Dep(SU, SDep::Output, Reg);  in addVRegDefDeps()
549     V2SU.SU->addPred(SDep(SU, SDep::Anti, Reg));  in addVRegUseDeps()
626     SDep Dep(SUa, SDep::MayAliasMem);  in addChainDependency()
996       SDep Dep(SU, SDep::Artificial);  in buildSchedGraph()
1462       if (PI->getKind() != SDep::Data)  in visitPostorderNode()
1490   void visitPostorderEdge(const SDep &PredDep, const SUnit *Succ) {  in visitPostorderEdge()
1497   void visitCrossEdge(const SDep &PredDep, const SUnit *Succ) {  in visitCrossEdge()
1543   bool joinPredSubtree(const SDep &PredDep, const SUnit *Succ,  in joinPredSubtree()
1545     assert(PredDep.getKind() == SDep::Data && "Subtrees are for data edges");  in joinPredSubtree()
1558       if (SI->getKind() == SDep::Data) {  in joinPredSubtree()
1604   const SDep *backtrack() {  in backtrack()
1622     if (SI->getKind() == SDep::Data && !SI->getSUnit()->isBoundaryNode())  in hasDataSucc()
1647         const SDep &PredDep = *DFS.getPred();  in compute()
1650         if (PredDep.getKind() != SDep::Data  in compute()
1664       const SDep *PredDep = DFS.backtrack();  in compute()