33   class NodeSubset {  class in llvm::Graph
36     NodeSubset(BitVector e) : Elements(e) {}  in NodeSubset()  function in llvm::Graph::NodeSubset
39     NodeSubset() : Elements(0) {  in NodeSubset()  function in llvm::Graph::NodeSubset
44     bool operator==(const NodeSubset &other) const {  in operator ==()
47     bool operator!=(const NodeSubset &other) const {  in operator !=()
75     bool isSubsetOf(const NodeSubset &other) const {  in isSubsetOf()
80     NodeSubset Complement() const {  in Complement()
85     NodeSubset Join(const NodeSubset &other) const {  in Join()
90     NodeSubset Meet(const NodeSubset &other) const {  in Meet()
96   typedef std::pair<unsigned, NodeSubset> NodeType;
135   NodeSubset NodesReachableFrom(unsigned Idx) const {  in NodesReachableFrom()
138     NodeSubset Reachable;  in NodesReachableFrom()
143       NodeSubset Previous(Reachable);  in NodesReachableFrom()
166     NodeSubset Children;
170     ChildIterator(NodeType *F, NodeSubset C) : FirstNode(F), Children(C) {}  in ChildIterator()
226     return ChildIterator(Parent - Parent->first, NodeSubset());  in child_end()
275     GT::NodeSubset NodesInSomeSCC;  in TEST()
281       GT::NodeSubset NodesInThisSCC;  in TEST()
301           GT::NodeSubset NodesReachableFromSCC = G.NodesReachableFrom(i);  in TEST()
302           GT::NodeSubset ReachableButNotInSCC =  in TEST()
330           GT::NodeSubset NodesReachableFromSCC = G.NodesReachableFrom(i);  in TEST()