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()
1195 for (SDep &Pred : SU.Preds) in swapAntiDependences()
1247 for (auto &PI : SUnits[i].Preds) { in createAdjacencyStructure()
1370 for (auto &Dep : SU.Preds) { in apply()
1452 for (const SDep &P : SU->Preds) { in computeNodeFunctions()
1511 SmallSetVector<SUnit *, 8> &Preds, in pred_L() argument
1513 Preds.clear(); in pred_L()
1515 for (const SDep &Pred : SU->Preds) { in pred_L()
1521 Preds.insert(Pred.getSUnit()); in pred_L()
1530 Preds.insert(Succ.getSUnit()); in pred_L()
1533 return !Preds.empty(); in pred_L()
1552 for (const SDep &Pred : SU->Preds) { in succ_L()
1583 for (auto &PI : Cur->Preds) in computePath()
1799 for (auto &PI : SU->Preds) { in addConnectedNodes()
1931 for (const auto &I : maxHeight->Preds) { in computeNodeOrder()
1972 for (const auto &I : maxDepth->Preds) { in computeNodeOrder()
2425 for (const auto &PI : PrevSU->Preds) in earliestCycleInChain()
2460 for (auto &P : SU->Preds) in multipleIterations()
2482 for (unsigned i = 0, e = (unsigned)SU->Preds.size(); i != e; ++i) { in computeStart()
2483 const SDep &Dep = SU->Preds[i]; in computeStart()
2614 for (auto &P : SU->Preds) { in orderDependence()
2725 for (auto &Dep : SU->Preds) in computeUnpipelineableNodes()
2752 for (auto &Dep : SU.Preds) in normalizeNonPipelinedInstructions()
2843 for (SDep &PredEdge : SU->Preds) { in checkValidNodeOrder()