998     for (auto &PI : I.Preds) {  in updatePhiDependences()
1049     for (const SDep &P : I.Preds)  in changeDependences()
1058     for (auto &P : LastSU->Preds)  in changeDependences()
1633     for (SDep &Pred : SU.Preds)  in swapAntiDependences()
1685     for (auto &PI : SUnits[i].Preds) {  in createAdjacencyStructure()
1808     for (auto &Dep : SU.Preds) {  in apply()
1890     for (const SDep &P : SU->Preds) {  in computeNodeFunctions()
1949                    SmallSetVector<SUnit *, 8> &Preds,  in pred_L()  argument
1951   Preds.clear();  in pred_L()
1953     for (const SDep &Pred : SU->Preds) {  in pred_L()
1959         Preds.insert(Pred.getSUnit());  in pred_L()
1968         Preds.insert(Succ.getSUnit());  in pred_L()
1971   return !Preds.empty();  in pred_L()
1990     for (const SDep &Pred : SU->Preds) {  in succ_L()
2021   for (auto &PI : Cur->Preds)  in computePath()
2234   for (auto &PI : SU->Preds) {  in addConnectedNodes()
2366           for (const auto &I : maxHeight->Preds) {  in computeNodeOrder()
2407           for (const auto &I : maxDepth->Preds) {  in computeNodeOrder()
2872     for (const auto &PI : PrevSU->Preds)  in earliestCycleInChain()
2907   for (auto &P : SU->Preds)  in multipleIterations()
2928       for (unsigned i = 0, e = (unsigned)SU->Preds.size(); i != e; ++i) {  in computeStart()
2929         const SDep &Dep = SU->Preds[i];  in computeStart()
3060     for (auto &P : SU->Preds) {  in orderDependence()
3158   for (const SDep &Pred : SU->Preds)  in onlyHasLoopCarriedOutputOrOrderPreds()
3183     for (auto &Dep : SU->Preds)  in computeUnpipelineableNodes()
3210     for (auto &Dep : SU.Preds)  in normalizeNonPipelinedInstructions()
3301     for (SDep &PredEdge : SU->Preds) {  in checkValidNodeOrder()