Lines Matching refs:getSUnit
71 if (!Required && I->getSUnit() == D.getSUnit()) in addPred()
76 SUnit *PredSU = I->getSUnit(); in addPred()
95 SUnit *N = D.getSUnit(); in addPred()
141 SUnit *N = D.getSUnit(); in removePred()
187 SUnit *SuccSU = I->getSUnit(); in setDepthDirty()
203 SUnit *PredSU = I->getSUnit(); in setHeightDirty()
244 SUnit *PredSU = I->getSUnit(); in ComputeDepth()
277 SUnit *SuccSU = I->getSUnit(); in ComputeHeight()
303 unsigned MaxDepth = BestI->getSUnit()->getDepth(); in biasCriticalPath()
306 if (I->getKind() == SDep::Data && I->getSUnit()->getDepth() > MaxDepth) in biasCriticalPath()
346 dbgs() << "SU(" << I->getSUnit()->NodeNum << ")"; in dumpAll()
366 dbgs() << "SU(" << I->getSUnit()->NodeNum << ")"; in dumpAll()
493 SUnit *SU = I->getSUnit(); in InitDAGTopologicalSorting()
509 assert(Node2Index[SU->NodeNum] > Node2Index[I->getSUnit()->NodeNum] && in InitDAGTopologicalSorting()
555 unsigned s = SU->Succs[I].getSUnit()->NodeNum; in DFS()
565 WorkList.push_back(SU->Succs[I].getSUnit()); in DFS()
608 IsReachable(SU, I->getSUnit())) in WillCreateCycle()