Lines Matching refs:getSUnit
108 if (!Required && PredDep.getSUnit() == D.getSUnit()) in addPred()
114 SUnit *PredSU = PredDep.getSUnit(); in addPred()
132 SUnit *N = D.getSUnit(); in addPred()
179 SUnit *N = D.getSUnit(); in removePred()
221 SUnit *SuccSU = SuccDep.getSUnit(); in setDepthDirty()
236 SUnit *PredSU = PredDep.getSUnit(); in setHeightDirty()
269 SUnit *PredSU = PredDep.getSUnit(); in ComputeDepth()
300 SUnit *SuccSU = SuccDep.getSUnit(); in ComputeHeight()
326 unsigned MaxDepth = BestI->getSUnit()->getDepth(); in biasCriticalPath()
329 if (I->getKind() == SDep::Data && I->getSUnit()->getDepth() > MaxDepth) in biasCriticalPath()
366 dumpNodeName(*Dep.getSUnit()); in dumpNodeAll()
376 dumpNodeName(*Dep.getSUnit()); in dumpNodeAll()
492 SUnit *SU = PredDep.getSUnit(); in InitDAGTopologicalSorting()
506 assert(Node2Index[SU.NodeNum] > Node2Index[PD.getSUnit()->NodeNum] && in InitDAGTopologicalSorting()
545 unsigned s = SuccDep.getSUnit()->NodeNum; in DFS()
555 WorkList.push_back(SuccDep.getSUnit()); in DFS()
586 const SUnit *Succ = SU->Succs[I].getSUnit(); in GetSubGraph()
620 const SUnit *Pred = SU->Preds[I].getSUnit(); in GetSubGraph()
673 IsReachable(SU, PredDep.getSUnit())) in WillCreateCycle()