Lines Matching defs:NodeSets
573 NodeSetType NodeSets;
574 findCircuits(NodeSets);
575 NodeSetType Circuits = NodeSets;
579 unsigned RecMII = calculateRecMII(NodeSets);
581 fuseRecs(NodeSets);
621 computeNodeFunctions(NodeSets);
623 registerPressureFilter(NodeSets);
625 colocateNodeSets(NodeSets);
627 checkNodeSets(NodeSets);
630 for (auto &I : NodeSets) {
636 llvm::stable_sort(NodeSets, std::greater<NodeSet>());
638 groupRemainingNodes(NodeSets);
640 removeDuplicateNodes(NodeSets);
643 for (auto &I : NodeSets) {
649 computeNodeOrder(NodeSets);
1567 unsigned SwingSchedulerDAG::calculateRecMII(NodeSetType &NodeSets) {
1570 for (NodeSet &Nodes : NodeSets) {
1653 bool SwingSchedulerDAG::Circuits::circuit(int V, int S, NodeSetType &NodeSets,
1668 NodeSets.push_back(NodeSet(Stack.begin(), Stack.end(), DAG));
1674 if (circuit(W, S, NodeSets, DAG,
1709 void SwingSchedulerDAG::findCircuits(NodeSetType &NodeSets) {
1715 Cir.circuit(I, I, NodeSets, this);
1805 void SwingSchedulerDAG::computeNodeFunctions(NodeSetType &NodeSets) {
1859 for (NodeSet &I : NodeSets)
2017 void SwingSchedulerDAG::registerPressureFilter(NodeSetType &NodeSets) {
2018 for (auto &NS : NodeSets) {
2061 void SwingSchedulerDAG::colocateNodeSets(NodeSetType &NodeSets) {
2063 for (int i = 0, e = NodeSets.size(); i < e; ++i) {
2064 NodeSet &N1 = NodeSets[i];
2069 NodeSet &N2 = NodeSets[j];
2089 void SwingSchedulerDAG::checkNodeSets(NodeSetType &NodeSets) {
2094 for (auto &NS : NodeSets) {
2100 NodeSets.clear();
2106 void SwingSchedulerDAG::groupRemainingNodes(NodeSetType &NodeSets) {
2111 for (NodeSet &I : NodeSets) {
2145 NodeSets.push_back(NewSet);
2154 NodeSets.push_back(NewSet);
2163 NodeSets.push_back(NewSet);
2199 void SwingSchedulerDAG::fuseRecs(NodeSetType &NodeSets) {
2200 for (NodeSetType::iterator I = NodeSets.begin(), E = NodeSets.end(); I != E;
2210 NodeSets.erase(J);
2211 E = NodeSets.end();
2219 /// Remove nodes that have been scheduled in previous NodeSets.
2220 void SwingSchedulerDAG::removeDuplicateNodes(NodeSetType &NodeSets) {
2221 for (NodeSetType::iterator I = NodeSets.begin(), E = NodeSets.end(); I != E;
2227 NodeSets.erase(J);
2228 E = NodeSets.end();
2239 void SwingSchedulerDAG::computeNodeOrder(NodeSetType &NodeSets) {
2243 for (auto &Nodes : NodeSets) {
2261 } else if (NodeSets.size() == 1) {