6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-07-23 14:25:07 +00:00
Code Issues Projects Releases Wiki Activity

Inline DSTypeRec stuff into DSNode

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@4751 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner
2002-11-18 21:45:30 +00:00
parent 686a6f5c13
commit a1cf699b50
2 changed files with 36 additions and 24 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -8,6 +8,8 @@
#define LLVM_ANALYSIS_DSNODE_H #define LLVM_ANALYSIS_DSNODE_H
#include "llvm/Analysis/DSSupport.h" #include "llvm/Analysis/DSSupport.h"
template<typename BaseType>
class DSNodeIterator; // Data structure graph traversal iterator
//===----------------------------------------------------------------------===// //===----------------------------------------------------------------------===//
/// DSNode - Data structure node class /// DSNode - Data structure node class
@@ -34,11 +36,11 @@ class DSNode {
/// ///
std::vector<GlobalValue*> Globals; std::vector<GlobalValue*> Globals;
/// Type - Keep track of the current outer most type of this object, in /// Ty - Keep track of the current outer most type of this object, in addition
/// addition to whether or not it has been indexed like an array or not. If /// to whether or not it has been indexed like an array or not. If the
/// the isArray bit is set, the node cannot grow. /// isArray bit is set, the node cannot grow.
/// ///
DSTypeRec Ty; const Type *Ty; // The type itself...
/// Size - The current size of the node. This should be equal to the size of /// Size - The current size of the node. This should be equal to the size of
/// the current type record. /// the current type record.
@@ -56,8 +58,9 @@ public:
Incomplete = 1 << 4, // This node may not be complete Incomplete = 1 << 4, // This node may not be complete
Modified = 1 << 5, // This node is modified in this context Modified = 1 << 5, // This node is modified in this context
Read = 1 << 6, // This node is read in this context Read = 1 << 6, // This node is read in this context
Array = 1 << 7, // This node is treated like an array
#if 1 #if 1
DEAD = 1 << 7, // This node is dead and should not be pointed to DEAD = 1 << 8, // This node is dead and should not be pointed to
#endif #endif
}; };
@@ -66,7 +69,7 @@ public:
/// with a value of 0 for their NodeType. Scalar and Alloca markers go away /// with a value of 0 for their NodeType. Scalar and Alloca markers go away
/// when function graphs are inlined. /// when function graphs are inlined.
/// ///
unsigned char NodeType; unsigned short NodeType;
DSNode(enum NodeTy NT, const Type *T); DSNode(enum NodeTy NT, const Type *T);
DSNode(const DSNode &); DSNode(const DSNode &);
@@ -76,11 +79,13 @@ public:
assert(Referrers.empty() && "Referrers to dead node exist!"); assert(Referrers.empty() && "Referrers to dead node exist!");
} }
// Iterator for graph interface... // Iterator for graph interface... Defined in DSGraphTraits.h
typedef DSNodeIterator iterator; typedef DSNodeIterator<DSNode> iterator;
typedef DSNodeIterator const_iterator; typedef DSNodeIterator<const DSNode> const_iterator;
inline iterator begin() const; // Defined in DSGraphTraits.h inline iterator begin();
inline iterator end() const; inline iterator end();
inline const_iterator begin() const;
inline const_iterator end() const;
//===-------------------------------------------------- //===--------------------------------------------------
// Accessors // Accessors
@@ -90,7 +95,8 @@ public:
unsigned getSize() const { return Size; } unsigned getSize() const { return Size; }
// getType - Return the node type of this object... // getType - Return the node type of this object...
const DSTypeRec &getType() const { return Ty; } const Type *getType() const { return Ty; }
bool isArray() const { return NodeType & Array; }
/// getReferrers - Return a list of the pointers to this node... /// getReferrers - Return a list of the pointers to this node...
/// ///

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

@@ -8,6 +8,8 @@
#define LLVM_ANALYSIS_DSNODE_H #define LLVM_ANALYSIS_DSNODE_H
#include "llvm/Analysis/DSSupport.h" #include "llvm/Analysis/DSSupport.h"
template<typename BaseType>
class DSNodeIterator; // Data structure graph traversal iterator
//===----------------------------------------------------------------------===// //===----------------------------------------------------------------------===//
/// DSNode - Data structure node class /// DSNode - Data structure node class
@@ -34,11 +36,11 @@ class DSNode {
/// ///
std::vector<GlobalValue*> Globals; std::vector<GlobalValue*> Globals;
/// Type - Keep track of the current outer most type of this object, in /// Ty - Keep track of the current outer most type of this object, in addition
/// addition to whether or not it has been indexed like an array or not. If /// to whether or not it has been indexed like an array or not. If the
/// the isArray bit is set, the node cannot grow. /// isArray bit is set, the node cannot grow.
/// ///
DSTypeRec Ty; const Type *Ty; // The type itself...
/// Size - The current size of the node. This should be equal to the size of /// Size - The current size of the node. This should be equal to the size of
/// the current type record. /// the current type record.
@@ -56,8 +58,9 @@ public:
Incomplete = 1 << 4, // This node may not be complete Incomplete = 1 << 4, // This node may not be complete
Modified = 1 << 5, // This node is modified in this context Modified = 1 << 5, // This node is modified in this context
Read = 1 << 6, // This node is read in this context Read = 1 << 6, // This node is read in this context
Array = 1 << 7, // This node is treated like an array
#if 1 #if 1
DEAD = 1 << 7, // This node is dead and should not be pointed to DEAD = 1 << 8, // This node is dead and should not be pointed to
#endif #endif
}; };
@@ -66,7 +69,7 @@ public:
/// with a value of 0 for their NodeType. Scalar and Alloca markers go away /// with a value of 0 for their NodeType. Scalar and Alloca markers go away
/// when function graphs are inlined. /// when function graphs are inlined.
/// ///
unsigned char NodeType; unsigned short NodeType;
DSNode(enum NodeTy NT, const Type *T); DSNode(enum NodeTy NT, const Type *T);
DSNode(const DSNode &); DSNode(const DSNode &);
@@ -76,11 +79,13 @@ public:
assert(Referrers.empty() && "Referrers to dead node exist!"); assert(Referrers.empty() && "Referrers to dead node exist!");
} }
// Iterator for graph interface... // Iterator for graph interface... Defined in DSGraphTraits.h
typedef DSNodeIterator iterator; typedef DSNodeIterator<DSNode> iterator;
typedef DSNodeIterator const_iterator; typedef DSNodeIterator<const DSNode> const_iterator;
inline iterator begin() const; // Defined in DSGraphTraits.h inline iterator begin();
inline iterator end() const; inline iterator end();
inline const_iterator begin() const;
inline const_iterator end() const;
//===-------------------------------------------------- //===--------------------------------------------------
// Accessors // Accessors
@@ -90,7 +95,8 @@ public:
unsigned getSize() const { return Size; } unsigned getSize() const { return Size; }
// getType - Return the node type of this object... // getType - Return the node type of this object...
const DSTypeRec &getType() const { return Ty; } const Type *getType() const { return Ty; }
bool isArray() const { return NodeType & Array; }
/// getReferrers - Return a list of the pointers to this node... /// getReferrers - Return a list of the pointers to this node...
/// ///