1855         int N = OE.getDst()->NodeNum;  in createAdjacencyStructure()
1865       if (OE.getDst()->isBoundaryNode() || OE.isArtificial())  in createAdjacencyStructure()
1877       int N = OE.getDst()->NodeNum;  in createAdjacencyStructure()
1887       SUnit *Dst = IE.getDst();  in createAdjacencyStructure()
2098       SUnit *Succ = OE.getDst();  in computeNodeFunctions()
2156       SUnit *SuccSU = OE.getDst();  in pred_L()
2178       SUnit *SuccSU = OE.getDst();  in succ_L()
2223           computePath(OE.getDst(), Path, DestNodes, Exclude, Visited, DDG);  in computePath()
2429     SUnit *Successor = OE.getDst();  in addConnectedNodes()
2558             SUnit *SU = OE.getDst();  in computeNodeOrder()
2628             SUnit *SU = OE.getDst();  in computeNodeOrder()
3114       Edge.getDst()->isBoundaryNode())  in isLoopCarriedDep()
3124   MachineInstr *DI = Edge.getDst()->getInstr();  in isLoopCarriedDep()
3224     SUnit *SuccSU = Cur.getDst();  in latestCycleInChain()
3276         if (OE.getDst() == I) {  in computeStart()
3371       if (OE.getDst() != *I)  in orderDependence()
3517         Worklist.push_back(OE.getDst());  in computeUnpipelineableNodes()
3547         NewCycle = std::max(InstrToCycle[OE.getDst()], NewCycle);  in normalizeNonPipelinedInstructions()
3607       SUnit *Dst = OE.getDst();  in isValidSchedule()
3677       SUnit *SuccSU = OE.getDst();  in checkValidNodeOrder()
4256     SUnit *Dst = Edge.getDst();  in isValidSchedule()