Lines Matching refs:NodeSets
575 NodeSetType NodeSets; in schedule() local
576 findCircuits(NodeSets); in schedule()
577 NodeSetType Circuits = NodeSets; in schedule()
581 unsigned RecMII = calculateRecMII(NodeSets); in schedule()
583 fuseRecs(NodeSets); in schedule()
623 computeNodeFunctions(NodeSets); in schedule()
625 registerPressureFilter(NodeSets); in schedule()
627 colocateNodeSets(NodeSets); in schedule()
629 checkNodeSets(NodeSets); in schedule()
632 for (auto &I : NodeSets) { in schedule()
638 llvm::stable_sort(NodeSets, std::greater<NodeSet>()); in schedule()
640 groupRemainingNodes(NodeSets); in schedule()
642 removeDuplicateNodes(NodeSets); in schedule()
645 for (auto &I : NodeSets) { in schedule()
651 computeNodeOrder(NodeSets); in schedule()
1608 unsigned SwingSchedulerDAG::calculateRecMII(NodeSetType &NodeSets) { in calculateRecMII() argument
1611 for (NodeSet &Nodes : NodeSets) { in calculateRecMII()
1708 bool SwingSchedulerDAG::Circuits::circuit(int V, int S, NodeSetType &NodeSets, in circuit() argument
1722 NodeSets.push_back(NodeSet(Stack.begin(), Stack.end())); in circuit()
1727 if (circuit(W, S, NodeSets, in circuit()
1762 void SwingSchedulerDAG::findCircuits(NodeSetType &NodeSets) { in findCircuits() argument
1772 Cir.circuit(i, i, NodeSets); in findCircuits()
1874 void SwingSchedulerDAG::computeNodeFunctions(NodeSetType &NodeSets) { in computeNodeFunctions() argument
1928 for (NodeSet &I : NodeSets) in computeNodeFunctions()
2072 void SwingSchedulerDAG::registerPressureFilter(NodeSetType &NodeSets) { in registerPressureFilter() argument
2073 for (auto &NS : NodeSets) { in registerPressureFilter()
2116 void SwingSchedulerDAG::colocateNodeSets(NodeSetType &NodeSets) { in colocateNodeSets() argument
2118 for (int i = 0, e = NodeSets.size(); i < e; ++i) { in colocateNodeSets()
2119 NodeSet &N1 = NodeSets[i]; in colocateNodeSets()
2124 NodeSet &N2 = NodeSets[j]; in colocateNodeSets()
2144 void SwingSchedulerDAG::checkNodeSets(NodeSetType &NodeSets) { in checkNodeSets() argument
2149 for (auto &NS : NodeSets) { in checkNodeSets()
2155 NodeSets.clear(); in checkNodeSets()
2161 void SwingSchedulerDAG::groupRemainingNodes(NodeSetType &NodeSets) { in groupRemainingNodes() argument
2166 for (NodeSet &I : NodeSets) { in groupRemainingNodes()
2200 NodeSets.push_back(NewSet); in groupRemainingNodes()
2209 NodeSets.push_back(NewSet); in groupRemainingNodes()
2218 NodeSets.push_back(NewSet); in groupRemainingNodes()
2254 void SwingSchedulerDAG::fuseRecs(NodeSetType &NodeSets) { in fuseRecs() argument
2255 for (NodeSetType::iterator I = NodeSets.begin(), E = NodeSets.end(); I != E; in fuseRecs()
2265 NodeSets.erase(J); in fuseRecs()
2266 E = NodeSets.end(); in fuseRecs()
2275 void SwingSchedulerDAG::removeDuplicateNodes(NodeSetType &NodeSets) { in removeDuplicateNodes() argument
2276 for (NodeSetType::iterator I = NodeSets.begin(), E = NodeSets.end(); I != E; in removeDuplicateNodes()
2282 NodeSets.erase(J); in removeDuplicateNodes()
2283 E = NodeSets.end(); in removeDuplicateNodes()
2294 void SwingSchedulerDAG::computeNodeOrder(NodeSetType &NodeSets) { in computeNodeOrder() argument
2298 for (auto &Nodes : NodeSets) { in computeNodeOrder()
2315 } else if (NodeSets.size() == 1) { in computeNodeOrder()