220   SetVector<SUnit *> NodeOrder;  member in __anon5f28c6f30111::SwingSchedulerDAG
1593 static bool pred_L(SetVector<SUnit *> &NodeOrder,  in pred_L()  argument
1597   for (SetVector<SUnit *>::iterator I = NodeOrder.begin(), E = NodeOrder.end();  in pred_L()
1605       if (NodeOrder.count(PI->getSUnit()) == 0)  in pred_L()
1616       if (NodeOrder.count(IS->getSUnit()) == 0)  in pred_L()
1626 static bool succ_L(SetVector<SUnit *> &NodeOrder,  in succ_L()  argument
1630   for (SetVector<SUnit *>::iterator I = NodeOrder.begin(), E = NodeOrder.end();  in succ_L()
1638       if (NodeOrder.count(SI->getSUnit()) == 0)  in succ_L()
1648       if (NodeOrder.count(PI->getSUnit()) == 0)  in succ_L()
1966   NodeOrder.clear();  in computeNodeOrder()
1972     if (pred_L(NodeOrder, N) && isSubset(N, Nodes)) {  in computeNodeOrder()
1976     } else if (succ_L(NodeOrder, N) && isSubset(N, Nodes)) {  in computeNodeOrder()
2020           NodeOrder.insert(maxHeight);  in computeNodeOrder()
2026             if (NodeOrder.count(I.getSUnit()) != 0)  in computeNodeOrder()
2038             if (NodeOrder.count(I.getSUnit()) != 0)  in computeNodeOrder()
2046         if (pred_L(NodeOrder, N, &Nodes))  in computeNodeOrder()
2064           NodeOrder.insert(maxDepth);  in computeNodeOrder()
2076             if (NodeOrder.count(I.getSUnit()) != 0)  in computeNodeOrder()
2088             if (NodeOrder.count(I.getSUnit()) != 0)  in computeNodeOrder()
2096         if (succ_L(NodeOrder, N, &Nodes))  in computeNodeOrder()
2105     for (SUnit *I : NodeOrder)  in computeNodeOrder()
2115   if (NodeOrder.size() == 0)  in schedulePipeline()
2125     SetVector<SUnit *>::iterator NI = NodeOrder.begin();  in schedulePipeline()
2126     SetVector<SUnit *>::iterator NE = NodeOrder.end();  in schedulePipeline()