252 void ScheduleDAGInstrs::addPhysRegDataDeps(SUnit *SU, unsigned OperIdx) {  in addPhysRegDataDeps()
264       SUnit *UseSU = I->SU;  in addPhysRegDataDeps()
295 void ScheduleDAGInstrs::addPhysRegDeps(SUnit *SU, unsigned OperIdx) {  in addPhysRegDeps()
311       SUnit *DefSU = I->SU;  in addPhysRegDeps()
376 void ScheduleDAGInstrs::addVRegDefDeps(SUnit *SU, unsigned OperIdx) {  in addVRegDefDeps()
397     SUnit *DefSU = DefI->SU;  in addVRegDefDeps()
414 void ScheduleDAGInstrs::addVRegUseDeps(SUnit *SU, unsigned OperIdx) {  in addVRegUseDeps()
438     SUnit *DefSU = getSUnit(Def);  in addVRegUseDeps()
586                                  const DataLayout &DL, SUnit *SUa, SUnit *SUb,  in iterateChainSucc()
587                                  SUnit *ExitSU, unsigned *Depth,  in iterateChainSucc()
588                                  SmallPtrSetImpl<const SUnit *> &Visited) {  in iterateChainSucc()
620   for (SUnit::const_succ_iterator I = SUb->Succs.begin(), E = SUb->Succs.end();  in iterateChainSucc()
632                             const DataLayout &DL, SUnit *SU, SUnit *ExitSU,  in adjustChainDeps()
633                             std::set<SUnit *> &CheckList,  in adjustChainDeps()
638   SmallPtrSet<const SUnit*, 16> Visited;  in adjustChainDeps()
641   for (std::set<SUnit *>::iterator I = CheckList.begin(), IE = CheckList.end();  in adjustChainDeps()
653     for (SUnit::const_succ_iterator J = (*I)->Succs.begin(),  in adjustChainDeps()
665                                       const DataLayout &DL, SUnit *SUa,  in addChainDependency()
666                                       SUnit *SUb, std::set<SUnit *> &RejectList,  in addChainDependency()
706     SUnit *SU = newSUnit(MI);  in initSUnits()
767   SUnit *BarrierChain = nullptr, *AliasChain = nullptr;  in buildSchedGraph()
773   MapVector<ValueType, std::vector<SUnit *> > AliasMemDefs, NonAliasMemDefs;  in buildSchedGraph()
774   MapVector<ValueType, std::vector<SUnit *> > AliasMemUses, NonAliasMemUses;  in buildSchedGraph()
775   std::set<SUnit*> RejectMemNodes;  in buildSchedGraph()
810     SUnit *SU = MISUnitMap[MI];  in buildSchedGraph()
870       for (MapVector<ValueType, std::vector<SUnit *> >::iterator I =  in buildSchedGraph()
876       for (MapVector<ValueType, std::vector<SUnit *> >::iterator I =  in buildSchedGraph()
911       for (MapVector<ValueType, std::vector<SUnit *> >::iterator I =  in buildSchedGraph()
917       for (MapVector<ValueType, std::vector<SUnit *> >::iterator I =  in buildSchedGraph()
955         MapVector<ValueType, std::vector<SUnit *> >::iterator I =  in buildSchedGraph()
957         MapVector<ValueType, std::vector<SUnit *> >::iterator IE =  in buildSchedGraph()
980         MapVector<ValueType, std::vector<SUnit *> >::iterator J =  in buildSchedGraph()
982         MapVector<ValueType, std::vector<SUnit *> >::iterator JE =  in buildSchedGraph()
1017           for (MapVector<ValueType, std::vector<SUnit *> >::iterator I =  in buildSchedGraph()
1038           MapVector<ValueType, std::vector<SUnit *> >::iterator I =  in buildSchedGraph()
1040           MapVector<ValueType, std::vector<SUnit *> >::iterator IE =  in buildSchedGraph()
1211 void ScheduleDAGInstrs::dumpNode(const SUnit *SU) const {  in dumpNode()
1217 std::string ScheduleDAGInstrs::getGraphNodeLabel(const SUnit *SU) const {  in getGraphNodeLabel()
1247   std::vector<std::pair<const SUnit*, const SUnit*> > ConnectionPairs;
1272   bool isVisited(const SUnit *SU) const {  in isVisited()
1279   void visitPreorder(const SUnit *SU) {  in visitPreorder()
1287   void visitPostorderNode(const SUnit *SU) {  in visitPostorderNode()
1300     for (SUnit::const_pred_iterator  in visitPostorderNode()
1330   void visitPostorderEdge(const SDep &PredDep, const SUnit *Succ) {  in visitPostorderEdge()
1337   void visitCrossEdge(const SDep &PredDep, const SUnit *Succ) {  in visitCrossEdge()
1367     for (std::vector<std::pair<const SUnit*, const SUnit*> >::const_iterator  in finalize()
1383   bool joinPredSubtree(const SDep &PredDep, const SUnit *Succ,  in joinPredSubtree()
1388     const SUnit *PredSU = PredDep.getSUnit();  in joinPredSubtree()
1396     for (SUnit::const_succ_iterator SI = PredSU->Succs.begin(),  in joinPredSubtree()
1435   std::vector<std::pair<const SUnit*, SUnit::const_pred_iterator> > DFSStack;
1439   void follow(const SUnit *SU) {  in follow()
1449   const SUnit *getCurr() const { return DFSStack.back().first; }  in getCurr()
1451   SUnit::const_pred_iterator getPred() const { return DFSStack.back().second; }  in getPred()
1453   SUnit::const_pred_iterator getPredEnd() const {  in getPredEnd()
1459 static bool hasDataSucc(const SUnit *SU) {  in hasDataSucc()
1460   for (SUnit::const_succ_iterator  in hasDataSucc()
1470 void SchedDFSResult::compute(ArrayRef<SUnit> SUnits) {  in compute()
1475   for (ArrayRef<SUnit>::const_iterator  in compute()
1477     const SUnit *SU = &*SI;  in compute()
1503       const SUnit *Child = DFS.getCurr();  in compute()