660     for (auto &PI : I.Preds) {  in updatePhiDependences()
711     for (SUnit::pred_iterator P = I.Preds.begin(), E = I.Preds.end(); P != E;  in changeDependences()
721     for (auto &P : LastSU->Preds)  in changeDependences()
900     for (SUnit::pred_iterator IP = SU->Preds.begin(), EP = SU->Preds.end();  in swapAntiDependences()
957     for (auto &PI : SUnits[i].Preds) {  in createAdjacencyStructure()
1081     for (auto &Dep : SU.Preds) {  in apply()
1166     for (SUnit::const_pred_iterator IP = SU->Preds.begin(),  in computeNodeFunctions()
1167                                     EP = SU->Preds.end();  in computeNodeFunctions()
1229                    SmallSetVector<SUnit *, 8> &Preds,  in pred_L()  argument
1231   Preds.clear();  in pred_L()
1234     for (SUnit::pred_iterator PI = (*I)->Preds.begin(), PE = (*I)->Preds.end();  in pred_L()
1241         Preds.insert(PI->getSUnit());  in pred_L()
1252         Preds.insert(IS->getSUnit());  in pred_L()
1255   return !Preds.empty();  in pred_L()
1276     for (SUnit::const_pred_iterator PI = (*I)->Preds.begin(),  in succ_L()
1277                                     PE = (*I)->Preds.end();  in succ_L()
1307   for (auto &PI : Cur->Preds)  in computePath()
1530   for (auto &PI : SU->Preds) {  in addConnectedNodes()
1664           for (const auto &I : maxHeight->Preds) {  in computeNodeOrder()
1705           for (const auto &I : maxDepth->Preds) {  in computeNodeOrder()
3182     for (const auto &PI : PrevSU->Preds)  in earliestCycleInChain()
3217   for (auto &P : SU->Preds)  in multipleIterations()
3239       for (unsigned i = 0, e = (unsigned)SU->Preds.size(); i != e; ++i) {  in computeStart()
3240         const SDep &Dep = SU->Preds[i];  in computeStart()
3364     for (auto &P : SU->Preds) {  in orderDependence()
3524     for (SDep &PredEdge : SU->Preds) {  in checkValidNodeOrder()