1888 static bool pred_L(SetVector<SUnit *> &NodeOrder,  in pred_L()  argument
1892   for (const SUnit *SU : NodeOrder) {  in pred_L()
1898       if (NodeOrder.count(Pred.getSUnit()) == 0)  in pred_L()
1907       if (NodeOrder.count(Succ.getSUnit()) == 0)  in pred_L()
1917 static bool succ_L(SetVector<SUnit *> &NodeOrder,  in succ_L()  argument
1921   for (const SUnit *SU : NodeOrder) {  in succ_L()
1927       if (NodeOrder.count(Succ.getSUnit()) == 0)  in succ_L()
1935       if (NodeOrder.count(Pred.getSUnit()) == 0)  in succ_L()
2236   NodeOrder.clear();  in computeNodeOrder()
2242     if (pred_L(NodeOrder, N) && llvm::set_is_subset(N, Nodes)) {  in computeNodeOrder()
2246     } else if (succ_L(NodeOrder, N) && llvm::set_is_subset(N, Nodes)) {  in computeNodeOrder()
2293           NodeOrder.insert(maxHeight);  in computeNodeOrder()
2299             if (NodeOrder.contains(I.getSUnit()))  in computeNodeOrder()
2311             if (NodeOrder.contains(I.getSUnit()))  in computeNodeOrder()
2319         if (pred_L(NodeOrder, N, &Nodes))  in computeNodeOrder()
2338           NodeOrder.insert(maxDepth);  in computeNodeOrder()
2350             if (NodeOrder.contains(I.getSUnit()))  in computeNodeOrder()
2360             if (NodeOrder.contains(I.getSUnit()))  in computeNodeOrder()
2368         if (succ_L(NodeOrder, N, &Nodes))  in computeNodeOrder()
2377     for (SUnit *I : NodeOrder)  in computeNodeOrder()
2387   if (NodeOrder.empty()){  in schedulePipeline()
2405     SetVector<SUnit *>::iterator NI = NodeOrder.begin();  in schedulePipeline()
2406     SetVector<SUnit *>::iterator NE = NodeOrder.end();  in schedulePipeline()
3201   std::vector<UnitIndex> Indices(NodeOrder.size(), std::make_pair(nullptr, 0));  in checkValidNodeOrder()
3203   for (unsigned i = 0, s = NodeOrder.size(); i < s; ++i)  in checkValidNodeOrder()
3204     Indices.push_back(std::make_pair(NodeOrder[i], i));  in checkValidNodeOrder()
3220   for (unsigned i = 0, s = NodeOrder.size(); i < s; ++i) {  in checkValidNodeOrder()
3221     SUnit *SU = NodeOrder[i];  in checkValidNodeOrder()