Lines Matching refs:Preds
105 for (SDep &PredDep : Preds) { in addPred()
162 Preds.push_back(D); in addPred()
173 SmallVectorImpl<SDep>::iterator I = llvm::find(Preds, D); in removePred()
174 if (I == Preds.end()) in removePred()
183 Preds.erase(I); in removePred()
235 for (SDep &PredDep : SU->Preds) { in setHeightDirty()
268 for (const SDep &PredDep : Cur->Preds) { in ComputeDepth()
325 SUnit::pred_iterator BestI = Preds.begin(); in biasCriticalPath()
327 for (SUnit::pred_iterator I = std::next(BestI), E = Preds.end(); I != E; in biasCriticalPath()
332 if (BestI != Preds.begin()) in biasCriticalPath()
333 std::swap(*Preds.begin(), *BestI); in biasCriticalPath()
362 if (SU.Preds.size() > 0) { in dumpNodeAll()
364 for (const SDep &Dep : SU.Preds) { in dumpNodeAll()
491 for (const SDep &PredDep : SU->Preds) { in InitDAGTopologicalSorting()
505 for (const SDep &PD : SU.Preds) { in InitDAGTopologicalSorting()
619 for (int I = SU->Preds.size()-1; I >= 0; --I) { in GetSubGraph()
620 const SUnit *Pred = SU->Preds[I].getSUnit(); in GetSubGraph()
671 for (const SDep &PredDep : TargetSU->Preds) in WillCreateCycle()