Lines Matching refs:Preds
108 for (SDep &PredDep : Preds) { in addPred()
165 Preds.push_back(D); in addPred()
176 SmallVectorImpl<SDep>::iterator I = llvm::find(Preds, D); in removePred()
177 if (I == Preds.end()) in removePred()
211 Preds.erase(I); in removePred()
240 for (SDep &PredDep : SU->Preds) { in setHeightDirty()
273 for (const SDep &PredDep : Cur->Preds) { in ComputeDepth()
330 SUnit::pred_iterator BestI = Preds.begin(); in biasCriticalPath()
332 for (SUnit::pred_iterator I = std::next(BestI), E = Preds.end(); I != E; in biasCriticalPath()
339 if (BestI != Preds.begin()) in biasCriticalPath()
340 std::swap(*Preds.begin(), *BestI); in biasCriticalPath()
369 if (SU.Preds.size() > 0) { in dumpNodeAll()
371 for (const SDep &Dep : SU.Preds) { in dumpNodeAll()
503 for (const SDep &PredDep : SU->Preds) { in InitDAGTopologicalSorting()
518 for (const SDep &PD : SU.Preds) { in InitDAGTopologicalSorting()
658 for (const SDep &SD : llvm::reverse(SU->Preds)) { in GetSubGraph()
711 for (const SDep &PredDep : TargetSU->Preds) in WillCreateCycle()