1948 static bool pred_L(SetVector<SUnit *> &NodeOrder,  in pred_L()  argument
1952   for (const SUnit *SU : NodeOrder) {  in pred_L()
1958       if (NodeOrder.count(Pred.getSUnit()) == 0)  in pred_L()
1967       if (NodeOrder.count(Succ.getSUnit()) == 0)  in pred_L()
1977 static bool succ_L(SetVector<SUnit *> &NodeOrder,  in succ_L()  argument
1981   for (const SUnit *SU : NodeOrder) {  in succ_L()
1987       if (NodeOrder.count(Succ.getSUnit()) == 0)  in succ_L()
1995       if (NodeOrder.count(Pred.getSUnit()) == 0)  in succ_L()
2296   NodeOrder.clear();  in computeNodeOrder()
2302     if (pred_L(NodeOrder, N) && llvm::set_is_subset(N, Nodes)) {  in computeNodeOrder()
2306     } else if (succ_L(NodeOrder, N) && llvm::set_is_subset(N, Nodes)) {  in computeNodeOrder()
2353           NodeOrder.insert(maxHeight);  in computeNodeOrder()
2359             if (NodeOrder.contains(I.getSUnit()))  in computeNodeOrder()
2371             if (NodeOrder.contains(I.getSUnit()))  in computeNodeOrder()
2379         if (pred_L(NodeOrder, N, &Nodes))  in computeNodeOrder()
2398           NodeOrder.insert(maxDepth);  in computeNodeOrder()
2410             if (NodeOrder.contains(I.getSUnit()))  in computeNodeOrder()
2420             if (NodeOrder.contains(I.getSUnit()))  in computeNodeOrder()
2428         if (succ_L(NodeOrder, N, &Nodes))  in computeNodeOrder()
2437     for (SUnit *I : NodeOrder)  in computeNodeOrder()
2447   if (NodeOrder.empty()){  in schedulePipeline()
2465     SetVector<SUnit *>::iterator NI = NodeOrder.begin();  in schedulePipeline()
2466     SetVector<SUnit *>::iterator NE = NodeOrder.end();  in schedulePipeline()
3270   std::vector<UnitIndex> Indices(NodeOrder.size(), std::make_pair(nullptr, 0));  in checkValidNodeOrder()
3272   for (unsigned i = 0, s = NodeOrder.size(); i < s; ++i)  in checkValidNodeOrder()
3273     Indices.push_back(std::make_pair(NodeOrder[i], i));  in checkValidNodeOrder()
3289   for (unsigned i = 0, s = NodeOrder.size(); i < s; ++i) {  in checkValidNodeOrder()
3290     SUnit *SU = NodeOrder[i];  in checkValidNodeOrder()