67   for (SmallVector<SDep, 4>::iterator I = Preds.begin(), E = Preds.end();  in addPred()
121   Preds.push_back(D);  in addPred()
135   for (SmallVector<SDep, 4>::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()
305          I = llvm::next(BestI), E = Preds.end(); I != E; ++I) {  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()
492     for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();  in InitDAGTopologicalSorting()
508     for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();  in InitDAGTopologicalSorting()
607          I = TargetSU->Preds.begin(), E = TargetSU->Preds.end(); I != E; ++I)  in WillCreateCycle()