Lines Matching refs:SDep
75 LLVM_DUMP_METHOD void SDep::dump(const TargetRegisterInfo *TRI) const { in dump()
107 bool SUnit::addPred(const SDep &D, bool Required) { in addPred()
109 for (SDep &PredDep : Preds) { in addPred()
120 SDep ForwardD = PredDep; in addPred()
122 for (SDep &SuccDep : PredSU->Succs) { in addPred()
134 SDep P = D; in addPred()
138 if (D.getKind() == SDep::Data) { in addPred()
175 void SUnit::removePred(const SDep &D) { in removePred()
177 SmallVectorImpl<SDep>::iterator I = llvm::find(Preds, D); in removePred()
181 SDep P = D; in removePred()
184 SmallVectorImpl<SDep>::iterator Succ = llvm::find(N->Succs, P); in removePred()
189 if (P.getKind() == SDep::Data) { in removePred()
224 for (SDep &SuccDep : SU->Succs) { in setDepthDirty()
239 for (SDep &PredDep : SU->Preds) { in setHeightDirty()
272 for (const SDep &PredDep : Cur->Preds) { in ComputeDepth()
303 for (const SDep &SuccDep : Cur->Succs) { in ComputeHeight()
333 if (I->getKind() == SDep::Data && I->getSUnit()->getDepth() > MaxDepth) in biasCriticalPath()
368 for (const SDep &Dep : SU.Preds) { in dumpNodeAll()
378 for (const SDep &Dep : SU.Succs) { in dumpNodeAll()
500 for (const SDep &PredDep : SU->Preds) { in InitDAGTopologicalSorting()
515 for (const SDep &PD : SU.Preds) { in InitDAGTopologicalSorting()
580 for (const SDep &SuccDep in DFS()
709 for (const SDep &PredDep : TargetSU->Preds) in WillCreateCycle()