diff options
| author | Chris Lattner <sabre@nondot.org> | 2003-07-02 04:33:55 +0000 |
|---|---|---|
| committer | Chris Lattner <sabre@nondot.org> | 2003-07-02 04:33:55 +0000 |
| commit | 73440f6a15d9268c118bec7e5201aaa2f2efb929 (patch) | |
| tree | 76f25757b024d8514a00d1695a9ede801a9e2f0c | |
| parent | daee2b492fdf706697429f036b37a46ecc84c2fc (diff) | |
Disable the parent graph code when not compiled in DEBUG mode
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@7056 91177308-0d34-0410-b5e6-96231b3b80d8
| -rw-r--r-- | include/llvm/Analysis/DSNode.h | 9 | ||||
| -rw-r--r-- | include/llvm/Analysis/DataStructure/DSNode.h | 9 |
2 files changed, 16 insertions, 2 deletions
diff --git a/include/llvm/Analysis/DSNode.h b/include/llvm/Analysis/DSNode.h index 7d91918dba..f4d71d4030 100644 --- a/include/llvm/Analysis/DSNode.h +++ b/include/llvm/Analysis/DSNode.h @@ -9,6 +9,10 @@ #include "llvm/Analysis/DSSupport.h" +#ifndef NDEBUG +#define INCLUDE_PARENT_GRAPH 1 +#endif + template<typename BaseType> class DSNodeIterator; // Data structure graph traversal iterator @@ -37,9 +41,11 @@ 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 @@ -124,9 +130,10 @@ 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 7d91918dba..f4d71d4030 100644 --- a/include/llvm/Analysis/DataStructure/DSNode.h +++ b/include/llvm/Analysis/DataStructure/DSNode.h @@ -9,6 +9,10 @@ #include "llvm/Analysis/DSSupport.h" +#ifndef NDEBUG +#define INCLUDE_PARENT_GRAPH 1 +#endif + template<typename BaseType> class DSNodeIterator; // Data structure graph traversal iterator @@ -37,9 +41,11 @@ 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 @@ -124,9 +130,10 @@ 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. |