261       SDep Dep;  in addPhysRegDataDeps()
263         Dep = SDep(SU, SDep::Artificial);  in addPhysRegDataDeps()
265         Dep = SDep(SU, SDep::Data, *Alias);  in addPhysRegDataDeps()
294   SDep::Kind Kind = MO.isUse() ? SDep::Anti : SDep::Output;  in addPhysRegDeps()
304           (Kind != SDep::Output || !MO.isDead() ||  in addPhysRegDeps()
306         if (Kind == SDep::Anti)  in addPhysRegDeps()
307           DefSU->addPred(SDep(SU, Kind, /*Reg=*/*Alias));  in addPhysRegDeps()
309           SDep Dep(SU, Kind, /*Reg=*/*Alias);  in addPhysRegDeps()
387       SDep Dep(SU, SDep::Output, Reg);  in addVRegDefDeps()
422       SDep dep(DefSU, SDep::Data, Reg);  in addVRegUseDeps()
432       ST.adjustSchedDependency(DefSU, SU, const_cast<SDep &>(dep));  in addVRegUseDeps()
440     DefI->SU->addPred(SDep(SU, SDep::Anti, Reg));  in addVRegUseDeps()
586     SUb->addPred(SDep(SUa, SDep::MayAliasMem));  in iterateChainSucc()
617       SDep Dep(SU, SDep::MayAliasMem);  in adjustChainDeps()
643     SDep Dep(SUa, isNormalMemory ? SDep::MayAliasMem : SDep::Barrier);  in addChainDependency()
783       SDep Dep(SU, SDep::Artificial);  in buildSchedGraph()
803         I->second->addPred(SDep(SU, SDep::Barrier));  in buildSchedGraph()
808           SDep Dep(SU, SDep::Barrier);  in buildSchedGraph()
815         BarrierChain->addPred(SDep(SU, SDep::Barrier));  in buildSchedGraph()
917         BarrierChain->addPred(SDep(SU, SDep::Barrier));  in buildSchedGraph()
922         ExitSU.addPred(SDep(SU, SDep::Artificial));  in buildSchedGraph()
970           BarrierChain->addPred(SDep(SU, SDep::Barrier));  in buildSchedGraph()
1074       if (PI->getKind() != SDep::Data)  in visitPostorderNode()
1102   void visitPostorderEdge(const SDep &PredDep, const SUnit *Succ) {  in visitPostorderEdge()
1109   void visitCrossEdge(const SDep &PredDep, const SUnit *Succ) {  in visitCrossEdge()
1155   bool joinPredSubtree(const SDep &PredDep, const SUnit *Succ,  in joinPredSubtree()
1157     assert(PredDep.getKind() == SDep::Data && "Subtrees are for data edges");  in joinPredSubtree()
1170       if (SI->getKind() == SDep::Data) {  in joinPredSubtree()
1216   const SDep *backtrack() {  in backtrack()
1234     if (SI->getKind() == SDep::Data && !SI->getSUnit()->isBoundaryNode())  in hasDataSucc()
1259         const SDep &PredDep = *DFS.getPred();  in compute()
1262         if (PredDep.getKind() != SDep::Data  in compute()
1276       const SDep *PredDep = DFS.backtrack();  in compute()