Lines Matching refs:Preds
109 for (SDep &PredDep : Preds) { in addPred()
166 Preds.push_back(D); in addPred()
177 SmallVectorImpl<SDep>::iterator I = llvm::find(Preds, D); in removePred()
178 if (I == Preds.end()) in removePred()
187 Preds.erase(I); in removePred()
239 for (SDep &PredDep : SU->Preds) { in setHeightDirty()
272 for (const SDep &PredDep : Cur->Preds) { in ComputeDepth()
329 SUnit::pred_iterator BestI = Preds.begin(); in biasCriticalPath()
331 for (SUnit::pred_iterator I = std::next(BestI), E = Preds.end(); I != E; in biasCriticalPath()
336 if (BestI != Preds.begin()) in biasCriticalPath()
337 std::swap(*Preds.begin(), *BestI); in biasCriticalPath()
366 if (SU.Preds.size() > 0) { in dumpNodeAll()
368 for (const SDep &Dep : SU.Preds) { in dumpNodeAll()
500 for (const SDep &PredDep : SU->Preds) { in InitDAGTopologicalSorting()
515 for (const SDep &PD : SU.Preds) { in InitDAGTopologicalSorting()
655 for (const SDep &SD : llvm::reverse(SU->Preds)) { in GetSubGraph()
708 for (const SDep &PredDep : TargetSU->Preds) in WillCreateCycle()