Lines Matching refs:Preds
901 for (auto &PI : I.Preds) { in updatePhiDependences()
952 for (const SDep &P : I.Preds) in changeDependences()
961 for (auto &P : LastSU->Preds) in changeDependences()
1198 for (SUnit::pred_iterator IP = SU->Preds.begin(), EP = SU->Preds.end(); in swapAntiDependences()
1253 for (auto &PI : SUnits[i].Preds) { in createAdjacencyStructure()
1377 for (auto &Dep : SU.Preds) { in apply()
1459 for (SUnit::const_pred_iterator IP = SU->Preds.begin(), in computeNodeFunctions()
1460 EP = SU->Preds.end(); in computeNodeFunctions()
1522 SmallSetVector<SUnit *, 8> &Preds, in pred_L() argument
1524 Preds.clear(); in pred_L()
1527 for (const SDep &Pred : (*I)->Preds) { in pred_L()
1533 Preds.insert(Pred.getSUnit()); in pred_L()
1542 Preds.insert(Succ.getSUnit()); in pred_L()
1545 return !Preds.empty(); in pred_L()
1565 for (SDep &Pred : (*I)->Preds) { in succ_L()
1594 for (auto &PI : Cur->Preds) in computePath()
1809 for (auto &PI : SU->Preds) { in addConnectedNodes()
1942 for (const auto &I : maxHeight->Preds) { in computeNodeOrder()
1983 for (const auto &I : maxDepth->Preds) { in computeNodeOrder()
2431 for (const auto &PI : PrevSU->Preds) in earliestCycleInChain()
2466 for (auto &P : SU->Preds) in multipleIterations()
2488 for (unsigned i = 0, e = (unsigned)SU->Preds.size(); i != e; ++i) { in computeStart()
2489 const SDep &Dep = SU->Preds[i]; in computeStart()
2621 for (auto &P : SU->Preds) { in orderDependence()
2780 for (SDep &PredEdge : SU->Preds) { in checkValidNodeOrder()