diff options
| -rw-r--r-- | include/llvm/Analysis/DSGraph.h | 11 | ||||
| -rw-r--r-- | include/llvm/Analysis/DataStructure/DSGraph.h | 11 |
2 files changed, 14 insertions, 8 deletions
diff --git a/include/llvm/Analysis/DSGraph.h b/include/llvm/Analysis/DSGraph.h index 3ec567e665..1c7f77fd23 100644 --- a/include/llvm/Analysis/DSGraph.h +++ b/include/llvm/Analysis/DSGraph.h @@ -109,10 +109,13 @@ public: void dump() const; void writeGraphToFile(std::ostream &O, const std::string &GraphName) const; - // maskNodeTypes - Apply a mask to all of the node types in the graph. This - // is useful for clearing out markers like Scalar or Incomplete. - // - void maskNodeTypes(unsigned char Mask); + /// maskNodeTypes - Apply a mask to all of the node types in the graph. This + /// is useful for clearing out markers like Incomplete. + /// + void maskNodeTypes(unsigned char Mask) { + for (unsigned i = 0, e = Nodes.size(); i != e; ++i) + Nodes[i]->NodeType &= Mask; + } void maskIncompleteMarkers() { maskNodeTypes(~DSNode::Incomplete); } // markIncompleteNodes - Traverse the graph, identifying nodes that may be diff --git a/include/llvm/Analysis/DataStructure/DSGraph.h b/include/llvm/Analysis/DataStructure/DSGraph.h index 3ec567e665..1c7f77fd23 100644 --- a/include/llvm/Analysis/DataStructure/DSGraph.h +++ b/include/llvm/Analysis/DataStructure/DSGraph.h @@ -109,10 +109,13 @@ public: void dump() const; void writeGraphToFile(std::ostream &O, const std::string &GraphName) const; - // maskNodeTypes - Apply a mask to all of the node types in the graph. This - // is useful for clearing out markers like Scalar or Incomplete. - // - void maskNodeTypes(unsigned char Mask); + /// maskNodeTypes - Apply a mask to all of the node types in the graph. This + /// is useful for clearing out markers like Incomplete. + /// + void maskNodeTypes(unsigned char Mask) { + for (unsigned i = 0, e = Nodes.size(); i != e; ++i) + Nodes[i]->NodeType &= Mask; + } void maskIncompleteMarkers() { maskNodeTypes(~DSNode::Incomplete); } // markIncompleteNodes - Traverse the graph, identifying nodes that may be |