Lines Matching defs:NodeOrder
220 SetVector<SUnit *> NodeOrder;
1591 /// as the predecessors of the elements of NodeOrder that are not also in
1592 /// NodeOrder.
1593 static bool pred_L(SetVector<SUnit *> &NodeOrder,
1597 for (SetVector<SUnit *>::iterator I = NodeOrder.begin(), E = NodeOrder.end();
1605 if (NodeOrder.count(PI->getSUnit()) == 0)
1616 if (NodeOrder.count(IS->getSUnit()) == 0)
1624 /// as the successors of the elements of NodeOrder that are not also in
1625 /// NodeOrder.
1626 static bool succ_L(SetVector<SUnit *> &NodeOrder,
1630 for (SetVector<SUnit *>::iterator I = NodeOrder.begin(), E = NodeOrder.end();
1638 if (NodeOrder.count(SI->getSUnit()) == 0)
1648 if (NodeOrder.count(PI->getSUnit()) == 0)
1966 NodeOrder.clear();
1972 if (pred_L(NodeOrder, N) && isSubset(N, Nodes)) {
1976 } else if (succ_L(NodeOrder, N) && isSubset(N, Nodes)) {
2020 NodeOrder.insert(maxHeight);
2026 if (NodeOrder.count(I.getSUnit()) != 0)
2038 if (NodeOrder.count(I.getSUnit()) != 0)
2046 if (pred_L(NodeOrder, N, &Nodes))
2064 NodeOrder.insert(maxDepth);
2076 if (NodeOrder.count(I.getSUnit()) != 0)
2088 if (NodeOrder.count(I.getSUnit()) != 0)
2096 if (succ_L(NodeOrder, N, &Nodes))
2105 for (SUnit *I : NodeOrder)
2115 if (NodeOrder.size() == 0)
2125 SetVector<SUnit *>::iterator NI = NodeOrder.begin();
2126 SetVector<SUnit *>::iterator NE = NodeOrder.end();
