Lines Matching refs:Preds
67 for (SmallVectorImpl<SDep>::iterator I = Preds.begin(), E = Preds.end(); in addPred()
121 Preds.push_back(D); in addPred()
135 for (SmallVectorImpl<SDep>::iterator I = Preds.begin(), E = Preds.end(); in removePred()
146 Preds.erase(I); in removePred()
201 for (SUnit::const_pred_iterator I = SU->Preds.begin(), in setHeightDirty()
202 E = SU->Preds.end(); I != E; ++I) { in setHeightDirty()
242 for (SUnit::const_pred_iterator I = Cur->Preds.begin(), in ComputeDepth()
243 E = Cur->Preds.end(); I != E; ++I) { in ComputeDepth()
302 SUnit::pred_iterator BestI = Preds.begin(); in biasCriticalPath()
304 for (SUnit::pred_iterator I = std::next(BestI), E = Preds.end(); I != E; in biasCriticalPath()
309 if (BestI != Preds.begin()) in biasCriticalPath()
310 std::swap(*Preds.begin(), *BestI); in biasCriticalPath()
335 if (Preds.size() != 0) { in dumpAll()
337 for (SUnit::const_succ_iterator I = Preds.begin(), E = Preds.end(); in dumpAll()
491 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in InitDAGTopologicalSorting()
507 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in InitDAGTopologicalSorting()
606 I = TargetSU->Preds.begin(), E = TargetSU->Preds.end(); I != E; ++I) in WillCreateCycle()