Lines Matching defs:NodeSets

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