6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-02-19 06:31:18 +00:00
Code Issues Projects Releases Wiki Activity

INCLUDE_PARENT_GRAPH is required

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@7089 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2003-07-02 23:57:21 +00:00
parent 7079386e02
commit 3915da3e0f
2 changed files with 0 additions and 16 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
include/llvm/Analysis/DSNode.h
View File

@ -9,10 +9,6 @@
#include "llvm/Analysis/DSSupport.h" #include "llvm/Analysis/DSSupport.h"
#ifndef NDEBUG
#define INCLUDE_PARENT_GRAPH 1
#endif
template<typename BaseType> template<typename BaseType>
class DSNodeIterator; // Data structure graph traversal iterator class DSNodeIterator; // Data structure graph traversal iterator
@ -41,11 +37,9 @@ class DSNode {
/// ///
unsigned Size; unsigned Size;
#ifdef INCLUDE_PARENT_GRAPH
/// ParentGraph - The graph this node is currently embedded into. /// ParentGraph - The graph this node is currently embedded into.
/// ///
DSGraph *ParentGraph; DSGraph *ParentGraph;
#endif
/// Ty - Keep track of the current outer most type of this object, in addition /// 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 /// 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! /// return the number of nodes forwarding over the node!
unsigned getNumReferrers() const { return NumReferrers; } unsigned getNumReferrers() const { return NumReferrers; }
#ifdef INCLUDE_PARENT_GRAPH
DSGraph *getParentGraph() const { return ParentGraph; } DSGraph *getParentGraph() const { return ParentGraph; }
void setParentGraph(DSGraph *G) { ParentGraph = G; } void setParentGraph(DSGraph *G) { ParentGraph = G; }
#endif
/// getForwardNode - This method returns the node that this node is forwarded /// getForwardNode - This method returns the node that this node is forwarded
/// to, if any. /// to, if any.

8
include/llvm/Analysis/DataStructure/DSNode.h
View File

@ -9,10 +9,6 @@
#include "llvm/Analysis/DSSupport.h" #include "llvm/Analysis/DSSupport.h"
#ifndef NDEBUG
#define INCLUDE_PARENT_GRAPH 1
#endif
template<typename BaseType> template<typename BaseType>
class DSNodeIterator; // Data structure graph traversal iterator class DSNodeIterator; // Data structure graph traversal iterator
@ -41,11 +37,9 @@ class DSNode {
/// ///
unsigned Size; unsigned Size;
#ifdef INCLUDE_PARENT_GRAPH
/// ParentGraph - The graph this node is currently embedded into. /// ParentGraph - The graph this node is currently embedded into.
/// ///
DSGraph *ParentGraph; DSGraph *ParentGraph;
#endif
/// Ty - Keep track of the current outer most type of this object, in addition /// 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 /// 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! /// return the number of nodes forwarding over the node!
unsigned getNumReferrers() const { return NumReferrers; } unsigned getNumReferrers() const { return NumReferrers; }
#ifdef INCLUDE_PARENT_GRAPH
DSGraph *getParentGraph() const { return ParentGraph; } DSGraph *getParentGraph() const { return ParentGraph; }
void setParentGraph(DSGraph *G) { ParentGraph = G; } void setParentGraph(DSGraph *G) { ParentGraph = G; }
#endif
/// getForwardNode - This method returns the node that this node is forwarded /// getForwardNode - This method returns the node that this node is forwarded
/// to, if any. /// to, if any.