1521 static bool pred_L(SetVector<SUnit *> &NodeOrder,  in pred_L()  argument
1525   for (SetVector<SUnit *>::iterator I = NodeOrder.begin(), E = NodeOrder.end();  in pred_L()
1532       if (NodeOrder.count(Pred.getSUnit()) == 0)  in pred_L()
1541       if (NodeOrder.count(Succ.getSUnit()) == 0)  in pred_L()
1551 static bool succ_L(SetVector<SUnit *> &NodeOrder,  in succ_L()  argument
1555   for (SetVector<SUnit *>::iterator I = NodeOrder.begin(), E = NodeOrder.end();  in succ_L()
1562       if (NodeOrder.count(Succ.getSUnit()) == 0)  in succ_L()
1570       if (NodeOrder.count(Pred.getSUnit()) == 0)  in succ_L()
1872   NodeOrder.clear();  in computeNodeOrder()
1878     if (pred_L(NodeOrder, N) && llvm::set_is_subset(N, Nodes)) {  in computeNodeOrder()
1882     } else if (succ_L(NodeOrder, N) && llvm::set_is_subset(N, Nodes)) {  in computeNodeOrder()
1929           NodeOrder.insert(maxHeight);  in computeNodeOrder()
1935             if (NodeOrder.contains(I.getSUnit()))  in computeNodeOrder()
1947             if (NodeOrder.contains(I.getSUnit()))  in computeNodeOrder()
1955         if (pred_L(NodeOrder, N, &Nodes))  in computeNodeOrder()
1974           NodeOrder.insert(maxDepth);  in computeNodeOrder()
1986             if (NodeOrder.contains(I.getSUnit()))  in computeNodeOrder()
1996             if (NodeOrder.contains(I.getSUnit()))  in computeNodeOrder()
2004         if (succ_L(NodeOrder, N, &Nodes))  in computeNodeOrder()
2013     for (SUnit *I : NodeOrder)  in computeNodeOrder()
2023   if (NodeOrder.empty()){  in schedulePipeline()
2035     SetVector<SUnit *>::iterator NI = NodeOrder.begin();  in schedulePipeline()
2036     SetVector<SUnit *>::iterator NE = NodeOrder.end();  in schedulePipeline()
2749   std::vector<UnitIndex> Indices(NodeOrder.size(), std::make_pair(nullptr, 0));  in checkValidNodeOrder()
2751   for (unsigned i = 0, s = NodeOrder.size(); i < s; ++i)  in checkValidNodeOrder()
2752     Indices.push_back(std::make_pair(NodeOrder[i], i));  in checkValidNodeOrder()
2768   for (unsigned i = 0, s = NodeOrder.size(); i < s; ++i) {  in checkValidNodeOrder()
2769     SUnit *SU = NodeOrder[i];  in checkValidNodeOrder()