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()
1172 unsigned SwingSchedulerDAG::calculateRecMII(NodeSetType &NodeSets) {  in calculateRecMII()  argument
1175   for (NodeSet &Nodes : NodeSets) {  in calculateRecMII()
1276 bool SwingSchedulerDAG::Circuits::circuit(int V, int S, NodeSetType &NodeSets,  in circuit()  argument
1290         NodeSets.push_back(NodeSet(Stack.begin(), Stack.end()));  in circuit()
1295       if (circuit(W, S, NodeSets,  in circuit()
1331 void SwingSchedulerDAG::findCircuits(NodeSetType &NodeSets) {  in findCircuits()  argument
1341     Cir.circuit(i, i, NodeSets);  in findCircuits()
1443 void SwingSchedulerDAG::computeNodeFunctions(NodeSetType &NodeSets) {  in computeNodeFunctions()  argument
1501   for (NodeSet &I : NodeSets)  in computeNodeFunctions()
1648 void SwingSchedulerDAG::registerPressureFilter(NodeSetType &NodeSets) {  in registerPressureFilter()  argument
1649   for (auto &NS : NodeSets) {  in registerPressureFilter()
1692 void SwingSchedulerDAG::colocateNodeSets(NodeSetType &NodeSets) {  in colocateNodeSets()  argument
1694   for (int i = 0, e = NodeSets.size(); i < e; ++i) {  in colocateNodeSets()
1695     NodeSet &N1 = NodeSets[i];  in colocateNodeSets()
1700       NodeSet &N2 = NodeSets[j];  in colocateNodeSets()
1720 void SwingSchedulerDAG::checkNodeSets(NodeSetType &NodeSets) {  in checkNodeSets()  argument
1725   for (auto &NS : NodeSets) {  in checkNodeSets()
1731   NodeSets.clear();  in checkNodeSets()
1737 void SwingSchedulerDAG::groupRemainingNodes(NodeSetType &NodeSets) {  in groupRemainingNodes()  argument
1742   for (NodeSet &I : NodeSets) {  in groupRemainingNodes()
1776     NodeSets.push_back(NewSet);  in groupRemainingNodes()
1785     NodeSets.push_back(NewSet);  in groupRemainingNodes()
1794         NodeSets.push_back(NewSet);  in groupRemainingNodes()
1830 void SwingSchedulerDAG::fuseRecs(NodeSetType &NodeSets) {  in fuseRecs()  argument
1831   for (NodeSetType::iterator I = NodeSets.begin(), E = NodeSets.end(); I != E;  in fuseRecs()
1841         NodeSets.erase(J);  in fuseRecs()
1842         E = NodeSets.end();  in fuseRecs()
1851 void SwingSchedulerDAG::removeDuplicateNodes(NodeSetType &NodeSets) {  in removeDuplicateNodes()  argument
1852   for (NodeSetType::iterator I = NodeSets.begin(), E = NodeSets.end(); I != E;  in removeDuplicateNodes()
1858         NodeSets.erase(J);  in removeDuplicateNodes()
1859         E = NodeSets.end();  in removeDuplicateNodes()
1870 void SwingSchedulerDAG::computeNodeOrder(NodeSetType &NodeSets) {  in computeNodeOrder()  argument
1874   for (auto &Nodes : NodeSets) {  in computeNodeOrder()
1891     } else if (NodeSets.size() == 1) {  in computeNodeOrder()