1510 static bool pred_L(SetVector<SUnit *> &NodeOrder,  in pred_L()  argument
1514   for (const SUnit *SU : NodeOrder) {  in pred_L()
1520       if (NodeOrder.count(Pred.getSUnit()) == 0)  in pred_L()
1529       if (NodeOrder.count(Succ.getSUnit()) == 0)  in pred_L()
1539 static bool succ_L(SetVector<SUnit *> &NodeOrder,  in succ_L()  argument
1543   for (const SUnit *SU : NodeOrder) {  in succ_L()
1549       if (NodeOrder.count(Succ.getSUnit()) == 0)  in succ_L()
1557       if (NodeOrder.count(Pred.getSUnit()) == 0)  in succ_L()
1861   NodeOrder.clear();  in computeNodeOrder()
1867     if (pred_L(NodeOrder, N) && llvm::set_is_subset(N, Nodes)) {  in computeNodeOrder()
1871     } else if (succ_L(NodeOrder, N) && llvm::set_is_subset(N, Nodes)) {  in computeNodeOrder()
1918           NodeOrder.insert(maxHeight);  in computeNodeOrder()
1924             if (NodeOrder.contains(I.getSUnit()))  in computeNodeOrder()
1936             if (NodeOrder.contains(I.getSUnit()))  in computeNodeOrder()
1944         if (pred_L(NodeOrder, N, &Nodes))  in computeNodeOrder()
1963           NodeOrder.insert(maxDepth);  in computeNodeOrder()
1975             if (NodeOrder.contains(I.getSUnit()))  in computeNodeOrder()
1985             if (NodeOrder.contains(I.getSUnit()))  in computeNodeOrder()
1993         if (succ_L(NodeOrder, N, &Nodes))  in computeNodeOrder()
2002     for (SUnit *I : NodeOrder)  in computeNodeOrder()
2012   if (NodeOrder.empty()){  in schedulePipeline()
2024     SetVector<SUnit *>::iterator NI = NodeOrder.begin();  in schedulePipeline()
2025     SetVector<SUnit *>::iterator NE = NodeOrder.end();  in schedulePipeline()
2812   std::vector<UnitIndex> Indices(NodeOrder.size(), std::make_pair(nullptr, 0));  in checkValidNodeOrder()
2814   for (unsigned i = 0, s = NodeOrder.size(); i < s; ++i)  in checkValidNodeOrder()
2815     Indices.push_back(std::make_pair(NodeOrder[i], i));  in checkValidNodeOrder()
2831   for (unsigned i = 0, s = NodeOrder.size(); i < s; ++i) {  in checkValidNodeOrder()
2832     SUnit *SU = NodeOrder[i];  in checkValidNodeOrder()