Lines Matching refs:getSUnit
111 if (!Required && PredDep.getSUnit() == D.getSUnit()) in addPred()
117 SUnit *PredSU = PredDep.getSUnit(); in addPred()
135 SUnit *N = D.getSUnit(); in addPred()
182 SUnit *N = D.getSUnit(); in removePred()
226 SUnit *SuccSU = SuccDep.getSUnit(); in setDepthDirty()
241 SUnit *PredSU = PredDep.getSUnit(); in setHeightDirty()
274 SUnit *PredSU = PredDep.getSUnit(); in ComputeDepth()
305 SUnit *SuccSU = SuccDep.getSUnit(); in ComputeHeight()
331 unsigned MaxDepth = BestI->getSUnit()->getDepth(); in biasCriticalPath()
334 if (I->getKind() == SDep::Data && I->getSUnit()->getDepth() > MaxDepth) { in biasCriticalPath()
335 MaxDepth = I->getSUnit()->getDepth(); in biasCriticalPath()
373 dumpNodeName(*Dep.getSUnit()); in dumpNodeAll()
383 dumpNodeName(*Dep.getSUnit()); in dumpNodeAll()
504 SUnit *SU = PredDep.getSUnit(); in InitDAGTopologicalSorting()
519 assert(Node2Index[SU.NodeNum] > Node2Index[PD.getSUnit()->NodeNum] && in InitDAGTopologicalSorting()
584 unsigned s = SuccDep.getSUnit()->NodeNum; in DFS()
594 WorkList.push_back(SuccDep.getSUnit()); in DFS()
625 const SUnit *Succ = SD.getSUnit(); in GetSubGraph()
659 const SUnit *Pred = SD.getSUnit(); in GetSubGraph()
713 IsReachable(SU, PredDep.getSUnit())) in WillCreateCycle()