Lines Matching defs:NodeOrder

1946 /// as the predecessors of the elements of NodeOrder that are not also in
1947 /// NodeOrder.
1948 static bool pred_L(SetVector<SUnit *> &NodeOrder,
1952 for (const SUnit *SU : NodeOrder) {
1958 if (NodeOrder.count(Pred.getSUnit()) == 0)
1967 if (NodeOrder.count(Succ.getSUnit()) == 0)
1975 /// as the successors of the elements of NodeOrder that are not also in
1976 /// NodeOrder.
1977 static bool succ_L(SetVector<SUnit *> &NodeOrder,
1981 for (const SUnit *SU : NodeOrder) {
1987 if (NodeOrder.count(Succ.getSUnit()) == 0)
1995 if (NodeOrder.count(Pred.getSUnit()) == 0)
2296 NodeOrder.clear();
2302 if (pred_L(NodeOrder, N) && llvm::set_is_subset(N, Nodes)) {
2306 } else if (succ_L(NodeOrder, N) && llvm::set_is_subset(N, Nodes)) {
2353 NodeOrder.insert(maxHeight);
2359 if (NodeOrder.contains(I.getSUnit()))
2371 if (NodeOrder.contains(I.getSUnit()))
2379 if (pred_L(NodeOrder, N, &Nodes))
2398 NodeOrder.insert(maxDepth);
2410 if (NodeOrder.contains(I.getSUnit()))
2420 if (NodeOrder.contains(I.getSUnit()))
2428 if (succ_L(NodeOrder, N, &Nodes))
2437 for (SUnit *I : NodeOrder)
2447 if (NodeOrder.empty()){
2448 LLVM_DEBUG(dbgs() << "NodeOrder is empty! abort scheduling\n" );
2465 SetVector<SUnit *>::iterator NI = NodeOrder.begin();
2466 SetVector<SUnit *>::iterator NE = NodeOrder.end();
3268 // a sorted vector that maps each SUnit to its index in the NodeOrder
3270 std::vector<UnitIndex> Indices(NodeOrder.size(), std::make_pair(nullptr, 0));
3272 for (unsigned i = 0, s = NodeOrder.size(); i < s; ++i)
3273 Indices.push_back(std::make_pair(NodeOrder[i], i));
3284 // for each SUnit in the NodeOrder, check whether
3287 // is not part of circuit, then the NodeOrder is not
3289 for (unsigned i = 0, s = NodeOrder.size(); i < s; ++i) {
3290 SUnit *SU = NodeOrder[i];
3314 // Do not process a boundary node, it was not included in NodeOrder,