365   std::stable_sort(NodeSets.begin(), NodeSets.end(), std::greater<NodeSet>());  in schedule()
877   for (NodeSet &Nodes : NodeSets) {  in calculateRecMII()
994         NodeSets.push_back(NodeSet(Stack.begin(), Stack.end()));  in circuit()
1208   for (NodeSet &I : NodeSets)  in computeNodeFunctions()
1230                    const NodeSet *S = nullptr) {  in pred_L()
1263                    const NodeSet *S = nullptr) {  in succ_L()
1328                             NodeSet &NS) {  in computeLiveOuts()
1414     NodeSet &N1 = NodeSets[i];  in colocateNodeSets()
1419       NodeSet &N2 = NodeSets[j];  in colocateNodeSets()
1462   for (NodeSet &I : NodeSets) {  in groupRemainingNodes()
1490   NodeSet NewSet;  in groupRemainingNodes()
1521 void SwingSchedulerDAG::addConnectedNodes(SUnit *SU, NodeSet &NewSet,  in addConnectedNodes()
1539 static bool isIntersect(SmallSetVector<SUnit *, 8> &Set1, const NodeSet &Set2,  in isIntersect()
1554     NodeSet &NI = *I;  in fuseRecs()
1556       NodeSet &NJ = *J;  in fuseRecs()
1560         for (NodeSet::iterator NII = J->begin(), ENI = J->end(); NII != ENI;  in fuseRecs()
3553           [SU](const NodeSet &Circuit) { return Circuit.count(SU); });  in checkValidNodeOrder()
3713 void NodeSet::print(raw_ostream &os) const {  in print()
3739 LLVM_DUMP_METHOD void NodeSet::dump() const { print(dbgs()); }  in dump()