482   NodeSetType NodeSets;  in schedule()  local
483   findCircuits(NodeSets);  in schedule()
484   NodeSetType Circuits = NodeSets;  in schedule()
488   unsigned RecMII = calculateRecMII(NodeSets);  in schedule()
490   fuseRecs(NodeSets);  in schedule()
530   computeNodeFunctions(NodeSets);  in schedule()
532   registerPressureFilter(NodeSets);  in schedule()
534   colocateNodeSets(NodeSets);  in schedule()
536   checkNodeSets(NodeSets);  in schedule()
539     for (auto &I : NodeSets) {  in schedule()
545   llvm::stable_sort(NodeSets, std::greater<NodeSet>());  in schedule()
547   groupRemainingNodes(NodeSets);  in schedule()
549   removeDuplicateNodes(NodeSets);  in schedule()
552     for (auto &I : NodeSets) {  in schedule()
558   computeNodeOrder(NodeSets);  in schedule()
1170 unsigned SwingSchedulerDAG::calculateRecMII(NodeSetType &NodeSets) {  in calculateRecMII()  argument
1173   for (NodeSet &Nodes : NodeSets) {  in calculateRecMII()
1270 bool SwingSchedulerDAG::Circuits::circuit(int V, int S, NodeSetType &NodeSets,  in circuit()  argument
1284         NodeSets.push_back(NodeSet(Stack.begin(), Stack.end()));  in circuit()
1289       if (circuit(W, S, NodeSets,  in circuit()
1324 void SwingSchedulerDAG::findCircuits(NodeSetType &NodeSets) {  in findCircuits()  argument
1334     Cir.circuit(i, i, NodeSets);  in findCircuits()
1436 void SwingSchedulerDAG::computeNodeFunctions(NodeSetType &NodeSets) {  in computeNodeFunctions()  argument
1490   for (NodeSet &I : NodeSets)  in computeNodeFunctions()
1637 void SwingSchedulerDAG::registerPressureFilter(NodeSetType &NodeSets) {  in registerPressureFilter()  argument
1638   for (auto &NS : NodeSets) {  in registerPressureFilter()
1681 void SwingSchedulerDAG::colocateNodeSets(NodeSetType &NodeSets) {  in colocateNodeSets()  argument
1683   for (int i = 0, e = NodeSets.size(); i < e; ++i) {  in colocateNodeSets()
1684     NodeSet &N1 = NodeSets[i];  in colocateNodeSets()
1689       NodeSet &N2 = NodeSets[j];  in colocateNodeSets()
1709 void SwingSchedulerDAG::checkNodeSets(NodeSetType &NodeSets) {  in checkNodeSets()  argument
1714   for (auto &NS : NodeSets) {  in checkNodeSets()
1720   NodeSets.clear();  in checkNodeSets()
1726 void SwingSchedulerDAG::groupRemainingNodes(NodeSetType &NodeSets) {  in groupRemainingNodes()  argument
1731   for (NodeSet &I : NodeSets) {  in groupRemainingNodes()
1765     NodeSets.push_back(NewSet);  in groupRemainingNodes()
1774     NodeSets.push_back(NewSet);  in groupRemainingNodes()
1783         NodeSets.push_back(NewSet);  in groupRemainingNodes()
1819 void SwingSchedulerDAG::fuseRecs(NodeSetType &NodeSets) {  in fuseRecs()  argument
1820   for (NodeSetType::iterator I = NodeSets.begin(), E = NodeSets.end(); I != E;  in fuseRecs()
1830         NodeSets.erase(J);  in fuseRecs()
1831         E = NodeSets.end();  in fuseRecs()
1840 void SwingSchedulerDAG::removeDuplicateNodes(NodeSetType &NodeSets) {  in removeDuplicateNodes()  argument
1841   for (NodeSetType::iterator I = NodeSets.begin(), E = NodeSets.end(); I != E;  in removeDuplicateNodes()
1847         NodeSets.erase(J);  in removeDuplicateNodes()
1848         E = NodeSets.end();  in removeDuplicateNodes()
1859 void SwingSchedulerDAG::computeNodeOrder(NodeSetType &NodeSets) {  in computeNodeOrder()  argument
1863   for (auto &Nodes : NodeSets) {  in computeNodeOrder()
1880     } else if (NodeSets.size() == 1) {  in computeNodeOrder()