1228 static bool pred_L(SetVector<SUnit *> &NodeOrder,  in pred_L()  argument
1232   for (SetVector<SUnit *>::iterator I = NodeOrder.begin(), E = NodeOrder.end();  in pred_L()
1240       if (NodeOrder.count(PI->getSUnit()) == 0)  in pred_L()
1251       if (NodeOrder.count(IS->getSUnit()) == 0)  in pred_L()
1261 static bool succ_L(SetVector<SUnit *> &NodeOrder,  in succ_L()  argument
1265   for (SetVector<SUnit *>::iterator I = NodeOrder.begin(), E = NodeOrder.end();  in succ_L()
1273       if (NodeOrder.count(SI->getSUnit()) == 0)  in succ_L()
1283       if (NodeOrder.count(PI->getSUnit()) == 0)  in succ_L()
1594   NodeOrder.clear();  in computeNodeOrder()
1600     if (pred_L(NodeOrder, N) && isSubset(N, Nodes)) {  in computeNodeOrder()
1604     } else if (succ_L(NodeOrder, N) && isSubset(N, Nodes)) {  in computeNodeOrder()
1651           NodeOrder.insert(maxHeight);  in computeNodeOrder()
1657             if (NodeOrder.count(I.getSUnit()) != 0)  in computeNodeOrder()
1669             if (NodeOrder.count(I.getSUnit()) != 0)  in computeNodeOrder()
1677         if (pred_L(NodeOrder, N, &Nodes))  in computeNodeOrder()
1696           NodeOrder.insert(maxDepth);  in computeNodeOrder()
1708             if (NodeOrder.count(I.getSUnit()) != 0)  in computeNodeOrder()
1718             if (NodeOrder.count(I.getSUnit()) != 0)  in computeNodeOrder()
1726         if (succ_L(NodeOrder, N, &Nodes))  in computeNodeOrder()
1735     for (SUnit *I : NodeOrder)  in computeNodeOrder()
1744   if (NodeOrder.empty())  in schedulePipeline()
1754     SetVector<SUnit *>::iterator NI = NodeOrder.begin();  in schedulePipeline()
1755     SetVector<SUnit *>::iterator NE = NodeOrder.end();  in schedulePipeline()
3493   std::vector<UnitIndex> Indices(NodeOrder.size(), std::make_pair(nullptr, 0));  in checkValidNodeOrder()
3495   for (unsigned i = 0, s = NodeOrder.size(); i < s; ++i)  in checkValidNodeOrder()
3496     Indices.push_back(std::make_pair(NodeOrder[i], i));  in checkValidNodeOrder()
3512   for (unsigned i = 0, s = NodeOrder.size(); i < s; ++i) {  in checkValidNodeOrder()
3513     SUnit *SU = NodeOrder[i];  in checkValidNodeOrder()