Lines Matching defs:NodeOrder

1877 /// as the predecessors of the elements of NodeOrder that are not also in
1878 /// NodeOrder.
1879 static bool pred_L(SetVector<SUnit *> &NodeOrder,
1884   for (SUnit *SU : NodeOrder) {
1891       if (NodeOrder.count(PredSU) == 0)
1905       if (NodeOrder.count(SuccSU) == 0)
1913 /// as the successors of the elements of NodeOrder that are not also in
1914 /// NodeOrder.
1915 static bool succ_L(SetVector<SUnit *> &NodeOrder,
1920   for (SUnit *SU : NodeOrder) {
1927       if (NodeOrder.count(SuccSU) == 0)
1941       if (NodeOrder.count(PredSU) == 0)
2241   NodeOrder.clear();
2247     if (pred_L(NodeOrder, N, DDG.get()) && llvm::set_is_subset(N, Nodes)) {
2251     } else if (succ_L(NodeOrder, N, DDG.get()) &&
2299           NodeOrder.insert(maxHeight);
2306             if (NodeOrder.contains(SU))
2323             if (NodeOrder.contains(SU))
2331         if (pred_L(NodeOrder, N, DDG.get(), &Nodes))
2350           NodeOrder.insert(maxDepth);
2363             if (NodeOrder.contains(SU))
2378             if (NodeOrder.contains(SU))
2386         if (succ_L(NodeOrder, N, DDG.get(), &Nodes))
2395     for (SUnit *I : NodeOrder)
2405   if (NodeOrder.empty()){
2406     LLVM_DEBUG(dbgs() << "NodeOrder is empty! abort scheduling\n" );
2423     SetVector<SUnit *>::iterator NI = NodeOrder.begin();
2424     SetVector<SUnit *>::iterator NE = NodeOrder.end();
3228   // a sorted vector that maps each SUnit to its index in the NodeOrder
3230   std::vector<UnitIndex> Indices(NodeOrder.size(), std::make_pair(nullptr, 0));
3232   for (unsigned i = 0, s = NodeOrder.size(); i < s; ++i)
3233     Indices.push_back(std::make_pair(NodeOrder[i], i));
3244   // for each SUnit in the NodeOrder, check whether
3247   // is not part of circuit, then the NodeOrder is not
3249   for (unsigned i = 0, s = NodeOrder.size(); i < s; ++i) {
3250     SUnit *SU = NodeOrder[i];
3274       // Do not process a boundary node, it was not included in NodeOrder,