Lines Matching defs:NodeSet
144 class NodeSet;
222 typedef SmallVector<NodeSet, 8> NodeSetType;
362 void addConnectedNodes(SUnit *SU, NodeSet &NewSet,
418 /// A NodeSet contains a set of SUnit DAG nodes with additional information
420 class NodeSet {
432 NodeSet() : Nodes(), HasRecurrence(false) {}
434 NodeSet(iterator S, iterator E) : Nodes(S, E), HasRecurrence(true) {}
462 int compareRecMII(NodeSet &RHS) { return RecMII - RHS.RecMII; }
490 bool operator>(const NodeSet &RHS) const {
501 bool operator==(const NodeSet &RHS) const {
506 bool operator!=(const NodeSet &RHS) const { return !operator==(RHS); }
866 dbgs() << " Rec NodeSet ";
871 std::sort(NodeSets.begin(), NodeSets.end(), std::greater<NodeSet>());
879 dbgs() << " NodeSet ";
1352 for (NodeSet &Nodes : NodeSets) {
1450 NodeSets.push_back(NodeSet(Stack.begin(), Stack.end()));
1575 for (NodeSet &I : NodeSets)
1595 const NodeSet *S = nullptr) {
1628 const NodeSet *S = nullptr) {
1693 NodeSet &NS) {
1776 NodeSet &N1 = NodeSets[i];
1781 NodeSet &N2 = NodeSets[j];
1826 for (NodeSet &I : NodeSets) {
1854 NodeSet NewSet;
1885 void SwingSchedulerDAG::addConnectedNodes(SUnit *SU, NodeSet &NewSet,
1903 static bool isIntersect(SmallSetVector<SUnit *, 8> &Set1, const NodeSet &Set2,
1918 NodeSet &NI = *I;
1920 NodeSet &NJ = *J;
1924 for (NodeSet::iterator NII = J->begin(), ENI = J->end(); NII != ENI;
1969 DEBUG(dbgs() << "NodeSet size " << Nodes.size() << "\n");
2100 DEBUG(dbgs() << "\nDone with Nodeset\n");
