diff options
| author | Chris Lattner <sabre@nondot.org> | 2003-07-02 23:57:21 +0000 |
|---|---|---|
| committer | Chris Lattner <sabre@nondot.org> | 2003-07-02 23:57:21 +0000 |
| commit | 3915da3e0fce7cb8846e78360e0f7151544ae8f2 (patch) | |
| tree | 7ebde62c4251c4192e0cb0deaf8abc9296b593c5 /include | |
| parent | 7079386e021b57e3121457b9c6454f3493c75c1d (diff) | |
| download | llvm-3915da3e0fce7cb8846e78360e0f7151544ae8f2.tar.gz llvm-3915da3e0fce7cb8846e78360e0f7151544ae8f2.tar.bz2 llvm-3915da3e0fce7cb8846e78360e0f7151544ae8f2.tar.xz | |
INCLUDE_PARENT_GRAPH is required
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@7089 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'include')
| -rw-r--r-- | include/llvm/Analysis/DSNode.h | 8 | ||||
| -rw-r--r-- | include/llvm/Analysis/DataStructure/DSNode.h | 8 |
2 files changed, 0 insertions, 16 deletions
diff --git a/include/llvm/Analysis/DSNode.h b/include/llvm/Analysis/DSNode.h index f4d71d4030..ff1d7d614e 100644 --- a/include/llvm/Analysis/DSNode.h +++ b/include/llvm/Analysis/DSNode.h @@ -9,10 +9,6 @@ #include "llvm/Analysis/DSSupport.h" -#ifndef NDEBUG -#define INCLUDE_PARENT_GRAPH 1 -#endif - template<typename BaseType> class DSNodeIterator; // Data structure graph traversal iterator @@ -41,11 +37,9 @@ class DSNode { /// unsigned Size; -#ifdef INCLUDE_PARENT_GRAPH /// ParentGraph - The graph this node is currently embedded into. /// DSGraph *ParentGraph; -#endif /// Ty - Keep track of the current outer most type of this object, in addition /// to whether or not it has been indexed like an array or not. If the @@ -130,10 +124,8 @@ public: /// return the number of nodes forwarding over the node! unsigned getNumReferrers() const { return NumReferrers; } -#ifdef INCLUDE_PARENT_GRAPH DSGraph *getParentGraph() const { return ParentGraph; } void setParentGraph(DSGraph *G) { ParentGraph = G; } -#endif /// getForwardNode - This method returns the node that this node is forwarded /// to, if any. diff --git a/include/llvm/Analysis/DataStructure/DSNode.h b/include/llvm/Analysis/DataStructure/DSNode.h index f4d71d4030..ff1d7d614e 100644 --- a/include/llvm/Analysis/DataStructure/DSNode.h +++ b/include/llvm/Analysis/DataStructure/DSNode.h @@ -9,10 +9,6 @@ #include "llvm/Analysis/DSSupport.h" -#ifndef NDEBUG -#define INCLUDE_PARENT_GRAPH 1 -#endif - template<typename BaseType> class DSNodeIterator; // Data structure graph traversal iterator @@ -41,11 +37,9 @@ class DSNode { /// unsigned Size; -#ifdef INCLUDE_PARENT_GRAPH /// ParentGraph - The graph this node is currently embedded into. /// DSGraph *ParentGraph; -#endif /// Ty - Keep track of the current outer most type of this object, in addition /// to whether or not it has been indexed like an array or not. If the @@ -130,10 +124,8 @@ public: /// return the number of nodes forwarding over the node! unsigned getNumReferrers() const { return NumReferrers; } -#ifdef INCLUDE_PARENT_GRAPH DSGraph *getParentGraph() const { return ParentGraph; } void setParentGraph(DSGraph *G) { ParentGraph = G; } -#endif /// getForwardNode - This method returns the node that this node is forwarded /// to, if any. |