6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-04-04 10:30:01 +00:00
Code Issues Projects Releases Wiki Activity

Add comments, allow DSNode "copy ctor" to ignore outgoing links, add more

Browse Source 
structured access to the globals list, add a couple helper methods.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@10982 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2004-01-27 21:49:25 +00:00
parent 5f549af582
commit 7a31285c3f
2 changed files with 40 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -97,9 +97,16 @@ public:
private:
unsigned short NodeType;
public:
/// DSNode ctor - Create a node of the specified type, inserting it into the
/// specified graph.
DSNode(const Type *T, DSGraph *G);
DSNode(const DSNode &, DSGraph *G);
/// DSNode "copy ctor" - Copy the specified node, inserting it into the
/// specified graph. If NullLinks is true, then null out all of the links,
/// but keep the same number of them. This can be used for efficiency if the
/// links are just going to be clobbered anyway.
DSNode(const DSNode &, DSGraph *G, bool NullLinks = false);
~DSNode() {
dropAllReferences();
@ -241,14 +248,24 @@ public:
/// also marks the node with the 'G' flag if it does not already have it.
///
void addGlobal(GlobalValue *GV);
void mergeGlobals(const std::vector<GlobalValue*> &RHS);
const std::vector<GlobalValue*> &getGlobals() const { return Globals; }
typedef std::vector<GlobalValue*>::const_iterator global_iterator;
global_iterator global_begin() const { return Globals.begin(); }
global_iterator global_end() const { return Globals.end(); }
/// maskNodeTypes - Apply a mask to the node types bitfield.
///
void maskNodeTypes(unsigned Mask) {
NodeType &= Mask;
}
void mergeNodeFlags(unsigned RHS) {
NodeType |= RHS;
}
/// getNodeFlags - Return all of the flags set on the node. If the DEAD flag
/// is set, hide it from the caller.
unsigned getNodeFlags() const { return NodeType & ~DEAD; }
@ -320,7 +337,7 @@ private:
inline DSNode *DSNodeHandle::getNode() const {
assert((!N || Offset < N->Size || (N->Size == 0 && Offset == 0) ||
!N->ForwardNH.isNull()) && "Node handle offset out of range!");
if (!N || N->ForwardNH.isNull())
if (N == 0 || N->ForwardNH.isNull())
return N;
return HandleForwarding();

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

@ -97,9 +97,16 @@ public:
private:
unsigned short NodeType;
public:
/// DSNode ctor - Create a node of the specified type, inserting it into the
/// specified graph.
DSNode(const Type *T, DSGraph *G);
DSNode(const DSNode &, DSGraph *G);
/// DSNode "copy ctor" - Copy the specified node, inserting it into the
/// specified graph. If NullLinks is true, then null out all of the links,
/// but keep the same number of them. This can be used for efficiency if the
/// links are just going to be clobbered anyway.
DSNode(const DSNode &, DSGraph *G, bool NullLinks = false);
~DSNode() {
dropAllReferences();
@ -241,14 +248,24 @@ public:
/// also marks the node with the 'G' flag if it does not already have it.
///
void addGlobal(GlobalValue *GV);
void mergeGlobals(const std::vector<GlobalValue*> &RHS);
const std::vector<GlobalValue*> &getGlobals() const { return Globals; }
typedef std::vector<GlobalValue*>::const_iterator global_iterator;
global_iterator global_begin() const { return Globals.begin(); }
global_iterator global_end() const { return Globals.end(); }
/// maskNodeTypes - Apply a mask to the node types bitfield.
///
void maskNodeTypes(unsigned Mask) {
NodeType &= Mask;
}
void mergeNodeFlags(unsigned RHS) {
NodeType |= RHS;
}
/// getNodeFlags - Return all of the flags set on the node. If the DEAD flag
/// is set, hide it from the caller.
unsigned getNodeFlags() const { return NodeType & ~DEAD; }
@ -320,7 +337,7 @@ private:
inline DSNode *DSNodeHandle::getNode() const {
assert((!N || Offset < N->Size || (N->Size == 0 && Offset == 0) ||
!N->ForwardNH.isNull()) && "Node handle offset out of range!");
if (!N || N->ForwardNH.isNull())
if (N == 0 || N->ForwardNH.isNull())
return N;
return HandleForwarding();