Lines Matching refs:NodeSets

520   NodeSetType NodeSets;  in schedule()  local
521 findCircuits(NodeSets); in schedule()
522 NodeSetType Circuits = NodeSets; in schedule()
526 unsigned RecMII = calculateRecMII(NodeSets); in schedule()
528 fuseRecs(NodeSets); in schedule()
568 computeNodeFunctions(NodeSets); in schedule()
570 registerPressureFilter(NodeSets); in schedule()
572 colocateNodeSets(NodeSets); in schedule()
574 checkNodeSets(NodeSets); in schedule()
577 for (auto &I : NodeSets) { in schedule()
583 llvm::stable_sort(NodeSets, std::greater<NodeSet>()); in schedule()
585 groupRemainingNodes(NodeSets); in schedule()
587 removeDuplicateNodes(NodeSets); in schedule()
590 for (auto &I : NodeSets) { in schedule()
596 computeNodeOrder(NodeSets); in schedule()
1548 unsigned SwingSchedulerDAG::calculateRecMII(NodeSetType &NodeSets) { in calculateRecMII() argument
1551 for (NodeSet &Nodes : NodeSets) { in calculateRecMII()
1648 bool SwingSchedulerDAG::Circuits::circuit(int V, int S, NodeSetType &NodeSets, in circuit() argument
1662 NodeSets.push_back(NodeSet(Stack.begin(), Stack.end())); in circuit()
1667 if (circuit(W, S, NodeSets, in circuit()
1702 void SwingSchedulerDAG::findCircuits(NodeSetType &NodeSets) { in findCircuits() argument
1712 Cir.circuit(i, i, NodeSets); in findCircuits()
1814 void SwingSchedulerDAG::computeNodeFunctions(NodeSetType &NodeSets) { in computeNodeFunctions() argument
1868 for (NodeSet &I : NodeSets) in computeNodeFunctions()
2012 void SwingSchedulerDAG::registerPressureFilter(NodeSetType &NodeSets) { in registerPressureFilter() argument
2013 for (auto &NS : NodeSets) { in registerPressureFilter()
2056 void SwingSchedulerDAG::colocateNodeSets(NodeSetType &NodeSets) { in colocateNodeSets() argument
2058 for (int i = 0, e = NodeSets.size(); i < e; ++i) { in colocateNodeSets()
2059 NodeSet &N1 = NodeSets[i]; in colocateNodeSets()
2064 NodeSet &N2 = NodeSets[j]; in colocateNodeSets()
2084 void SwingSchedulerDAG::checkNodeSets(NodeSetType &NodeSets) { in checkNodeSets() argument
2089 for (auto &NS : NodeSets) { in checkNodeSets()
2095 NodeSets.clear(); in checkNodeSets()
2101 void SwingSchedulerDAG::groupRemainingNodes(NodeSetType &NodeSets) { in groupRemainingNodes() argument
2106 for (NodeSet &I : NodeSets) { in groupRemainingNodes()
2140 NodeSets.push_back(NewSet); in groupRemainingNodes()
2149 NodeSets.push_back(NewSet); in groupRemainingNodes()
2158 NodeSets.push_back(NewSet); in groupRemainingNodes()
2194 void SwingSchedulerDAG::fuseRecs(NodeSetType &NodeSets) { in fuseRecs() argument
2195 for (NodeSetType::iterator I = NodeSets.begin(), E = NodeSets.end(); I != E; in fuseRecs()
2205 NodeSets.erase(J); in fuseRecs()
2206 E = NodeSets.end(); in fuseRecs()
2215 void SwingSchedulerDAG::removeDuplicateNodes(NodeSetType &NodeSets) { in removeDuplicateNodes() argument
2216 for (NodeSetType::iterator I = NodeSets.begin(), E = NodeSets.end(); I != E; in removeDuplicateNodes()
2222 NodeSets.erase(J); in removeDuplicateNodes()
2223 E = NodeSets.end(); in removeDuplicateNodes()
2234 void SwingSchedulerDAG::computeNodeOrder(NodeSetType &NodeSets) { in computeNodeOrder() argument
2238 for (auto &Nodes : NodeSets) { in computeNodeOrder()
2255 } else if (NodeSets.size() == 1) { in computeNodeOrder()