247 void ScheduleDAGInstrs::addPhysRegDataDeps(SUnit *SU, unsigned OperIdx) {  in addPhysRegDataDeps()
259       SUnit *UseSU = I->SU;  in addPhysRegDataDeps()
290 void ScheduleDAGInstrs::addPhysRegDeps(SUnit *SU, unsigned OperIdx) {  in addPhysRegDeps()
306       SUnit *DefSU = I->SU;  in addPhysRegDeps()
385 void ScheduleDAGInstrs::addVRegDefDeps(SUnit *SU, unsigned OperIdx) {  in addVRegDefDeps()
423         SUnit *UseSU = I->SU;  in addVRegDefDeps()
460     SUnit *DefSU = V2SU.SU;  in addVRegDefDeps()
494 void ScheduleDAGInstrs::addVRegUseDeps(SUnit *SU, unsigned OperIdx) {  in addVRegUseDeps()
640                                  const DataLayout &DL, SUnit *SUa, SUnit *SUb,  in iterateChainSucc()
641                                  SUnit *ExitSU, unsigned *Depth,  in iterateChainSucc()
642                                  SmallPtrSetImpl<const SUnit *> &Visited) {  in iterateChainSucc()
674   for (SUnit::const_succ_iterator I = SUb->Succs.begin(), E = SUb->Succs.end();  in iterateChainSucc()
686                             const DataLayout &DL, SUnit *SU, SUnit *ExitSU,  in adjustChainDeps()
687                             std::set<SUnit *> &CheckList,  in adjustChainDeps()
692   SmallPtrSet<const SUnit*, 16> Visited;  in adjustChainDeps()
695   for (std::set<SUnit *>::iterator I = CheckList.begin(), IE = CheckList.end();  in adjustChainDeps()
707     for (SUnit::const_succ_iterator J = (*I)->Succs.begin(),  in adjustChainDeps()
719                                       const DataLayout &DL, SUnit *SUa,  in addChainDependency()
720                                       SUnit *SUb, std::set<SUnit *> &RejectList,  in addChainDependency()
760     SUnit *SU = newSUnit(MI);  in initSUnits()
797 void ScheduleDAGInstrs::collectVRegUses(SUnit *SU) {  in collectVRegUses()
848   SUnit *BarrierChain = nullptr, *AliasChain = nullptr;  in buildSchedGraph()
854   MapVector<ValueType, std::vector<SUnit *> > AliasMemDefs, NonAliasMemDefs;  in buildSchedGraph()
855   MapVector<ValueType, std::vector<SUnit *> > AliasMemUses, NonAliasMemUses;  in buildSchedGraph()
856   std::set<SUnit*> RejectMemNodes;  in buildSchedGraph()
895     SUnit *SU = MISUnitMap[MI];  in buildSchedGraph()
955       for (MapVector<ValueType, std::vector<SUnit *> >::iterator I =  in buildSchedGraph()
961       for (MapVector<ValueType, std::vector<SUnit *> >::iterator I =  in buildSchedGraph()
996       for (MapVector<ValueType, std::vector<SUnit *> >::iterator I =  in buildSchedGraph()
1002       for (MapVector<ValueType, std::vector<SUnit *> >::iterator I =  in buildSchedGraph()
1040         MapVector<ValueType, std::vector<SUnit *> >::iterator I =  in buildSchedGraph()
1042         MapVector<ValueType, std::vector<SUnit *> >::iterator IE =  in buildSchedGraph()
1065         MapVector<ValueType, std::vector<SUnit *> >::iterator J =  in buildSchedGraph()
1067         MapVector<ValueType, std::vector<SUnit *> >::iterator JE =  in buildSchedGraph()
1102           for (MapVector<ValueType, std::vector<SUnit *> >::iterator I =  in buildSchedGraph()
1123           MapVector<ValueType, std::vector<SUnit *> >::iterator I =  in buildSchedGraph()
1125           MapVector<ValueType, std::vector<SUnit *> >::iterator IE =  in buildSchedGraph()
1346 void ScheduleDAGInstrs::dumpNode(const SUnit *SU) const {  in dumpNode()
1352 std::string ScheduleDAGInstrs::getGraphNodeLabel(const SUnit *SU) const {  in getGraphNodeLabel()
1382   std::vector<std::pair<const SUnit*, const SUnit*> > ConnectionPairs;
1407   bool isVisited(const SUnit *SU) const {  in isVisited()
1414   void visitPreorder(const SUnit *SU) {  in visitPreorder()
1422   void visitPostorderNode(const SUnit *SU) {  in visitPostorderNode()
1435     for (SUnit::const_pred_iterator  in visitPostorderNode()
1465   void visitPostorderEdge(const SDep &PredDep, const SUnit *Succ) {  in visitPostorderEdge()
1472   void visitCrossEdge(const SDep &PredDep, const SUnit *Succ) {  in visitCrossEdge()
1502     for (std::vector<std::pair<const SUnit*, const SUnit*> >::const_iterator  in finalize()
1518   bool joinPredSubtree(const SDep &PredDep, const SUnit *Succ,  in joinPredSubtree()
1523     const SUnit *PredSU = PredDep.getSUnit();  in joinPredSubtree()
1531     for (SUnit::const_succ_iterator SI = PredSU->Succs.begin(),  in joinPredSubtree()
1570   std::vector<std::pair<const SUnit*, SUnit::const_pred_iterator> > DFSStack;
1574   void follow(const SUnit *SU) {  in follow()
1584   const SUnit *getCurr() const { return DFSStack.back().first; }  in getCurr()
1586   SUnit::const_pred_iterator getPred() const { return DFSStack.back().second; }  in getPred()
1588   SUnit::const_pred_iterator getPredEnd() const {  in getPredEnd()
1594 static bool hasDataSucc(const SUnit *SU) {  in hasDataSucc()
1595   for (SUnit::const_succ_iterator  in hasDataSucc()
1605 void SchedDFSResult::compute(ArrayRef<SUnit> SUnits) {  in compute()
1610   for (ArrayRef<SUnit>::const_iterator  in compute()
1612     const SUnit *SU = &*SI;  in compute()
1638       const SUnit *Child = DFS.getCurr();  in compute()