112     if (!Required && PredDep.getSUnit() == D.getSUnit())  in addPred()
118         SUnit *PredSU = PredDep.getSUnit();  in addPred()
136   SUnit *N = D.getSUnit();  in addPred()
183   SUnit *N = D.getSUnit();  in removePred()
225       SUnit *SuccSU = SuccDep.getSUnit();  in setDepthDirty()
240       SUnit *PredSU = PredDep.getSUnit();  in setHeightDirty()
273       SUnit *PredSU = PredDep.getSUnit();  in ComputeDepth()
304       SUnit *SuccSU = SuccDep.getSUnit();  in ComputeHeight()
330   unsigned MaxDepth = BestI->getSUnit()->getDepth();  in biasCriticalPath()
333     if (I->getKind() == SDep::Data && I->getSUnit()->getDepth() > MaxDepth)  in biasCriticalPath()
370       dumpNodeName(*Dep.getSUnit());  in dumpNodeAll()
380       dumpNodeName(*Dep.getSUnit());  in dumpNodeAll()
501       SUnit *SU = PredDep.getSUnit();  in InitDAGTopologicalSorting()
516       assert(Node2Index[SU.NodeNum] > Node2Index[PD.getSUnit()->NodeNum] &&  in InitDAGTopologicalSorting()
581       unsigned s = SuccDep.getSUnit()->NodeNum;  in DFS()
591         WorkList.push_back(SuccDep.getSUnit());  in DFS()
622       const SUnit *Succ = SD.getSUnit();  in GetSubGraph()
656       const SUnit *Pred = SD.getSUnit();  in GetSubGraph()
710         IsReachable(SU, PredDep.getSUnit()))  in WillCreateCycle()