792       SUnit *SuccSU = SI.getSUnit();  in isSuccOrder()  local
794         if (Visited.count(SuccSU))  in isSuccOrder()
796         if (SuccSU == SUb)  in isSuccOrder()
798         Worklist.push_back(SuccSU);  in isSuccOrder()
799         Visited.insert(SuccSU);  in isSuccOrder()
2888     SUnit *SuccSU = Cur.getSUnit();  in latestCycleInChain()  local
2889     if (Visited.count(SuccSU) || SuccSU->isBoundaryNode())  in latestCycleInChain()
2891     std::map<SUnit *, int>::const_iterator it = InstrToCycle.find(SuccSU);  in latestCycleInChain()
2895     for (const auto &SI : SuccSU->Succs)  in latestCycleInChain()
2898     Visited.insert(SuccSU);  in latestCycleInChain()
3313       SUnit *SuccSU = SuccEdge.getSUnit();  in checkValidNodeOrder()  local
3317       if (SuccSU->isBoundaryNode())  in checkValidNodeOrder()
3320           *llvm::lower_bound(Indices, std::make_pair(SuccSU, 0), CompareKey));  in checkValidNodeOrder()
3321       if (!SuccSU->getInstr()->isPHI() && SuccIndex < Index) {  in checkValidNodeOrder()
3323         Succ = SuccSU;  in checkValidNodeOrder()