Lines Matching refs:Preds
938 for (auto &PI : I.Preds) { in updatePhiDependences()
989 for (const SDep &P : I.Preds) in changeDependences()
998 for (auto &P : LastSU->Preds) in changeDependences()
1573 for (SDep &Pred : SU.Preds) in swapAntiDependences()
1625 for (auto &PI : SUnits[i].Preds) { in createAdjacencyStructure()
1748 for (auto &Dep : SU.Preds) { in apply()
1830 for (const SDep &P : SU->Preds) { in computeNodeFunctions()
1889 SmallSetVector<SUnit *, 8> &Preds, in pred_L() argument
1891 Preds.clear(); in pred_L()
1893 for (const SDep &Pred : SU->Preds) { in pred_L()
1899 Preds.insert(Pred.getSUnit()); in pred_L()
1908 Preds.insert(Succ.getSUnit()); in pred_L()
1911 return !Preds.empty(); in pred_L()
1930 for (const SDep &Pred : SU->Preds) { in succ_L()
1961 for (auto &PI : Cur->Preds) in computePath()
2174 for (auto &PI : SU->Preds) { in addConnectedNodes()
2306 for (const auto &I : maxHeight->Preds) { in computeNodeOrder()
2347 for (const auto &I : maxDepth->Preds) { in computeNodeOrder()
2815 for (const auto &PI : PrevSU->Preds) in earliestCycleInChain()
2850 for (auto &P : SU->Preds) in multipleIterations()
2872 for (unsigned i = 0, e = (unsigned)SU->Preds.size(); i != e; ++i) { in computeStart()
2873 const SDep &Dep = SU->Preds[i]; in computeStart()
3004 for (auto &P : SU->Preds) { in orderDependence()
3114 for (auto &Dep : SU->Preds) in computeUnpipelineableNodes()
3141 for (auto &Dep : SU.Preds) in normalizeNonPipelinedInstructions()
3232 for (SDep &PredEdge : SU->Preds) { in checkValidNodeOrder()