replica
/
hanchenye-llvm-project
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Changes to compile with GCC 2.96 

llvm-svn: 745
This commit is contained in:
Chris Lattner 2001-10-13 06:25:03 +00:00
parent 92d335cbfe
commit 93f8297775
1 changed files with 12 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

20
llvm/include/llvm/Analysis/Dominators.h
View File

@ -126,33 +126,36 @@ public:
// DominatorTree - Calculate the immediate dominator tree for a method. // DominatorTree - Calculate the immediate dominator tree for a method.
// //
class DominatorTree : public DominatorBase { class DominatorTree : public DominatorBase {
class Node; class Node2;
public:
typedef Node2 Node;
private:
map<const BasicBlock*, Node*> Nodes; map<const BasicBlock*, Node*> Nodes;
void calculate(const DominatorSet &DS); void calculate(const DominatorSet &DS);
typedef map<const BasicBlock*, Node*> NodeMapType; typedef map<const BasicBlock*, Node*> NodeMapType;
public: public:
class Node : public vector<Node*> { class Node2 : public vector<Node*> {
friend class DominatorTree; friend class DominatorTree;
const BasicBlock *TheNode; const BasicBlock *TheNode;
Node * const IDom; Node2 * const IDom;
public: public:
inline const BasicBlock *getNode() const { return TheNode; } inline const BasicBlock *getNode() const { return TheNode; }
inline Node *getIDom() const { return IDom; } inline Node2 *getIDom() const { return IDom; }
inline const vector<Node*> &getChildren() const { return *this; } inline const vector<Node*> &getChildren() const { return *this; }
// dominates - Returns true iff this dominates N. Note that this is not a // dominates - Returns true iff this dominates N. Note that this is not a
// constant time operation! // constant time operation!
inline bool dominates(const Node *N) const { inline bool dominates(const Node2 *N) const {
const Node *IDom; const Node2 *IDom;
while ((IDom = N->getIDom()) != 0 && IDom != this) while ((IDom = N->getIDom()) != 0 && IDom != this)
N = IDom; // Walk up the tree N = IDom; // Walk up the tree
return IDom != 0; return IDom != 0;
} }
private: private:
inline Node(const BasicBlock *node, Node *iDom) inline Node2(const BasicBlock *node, Node *iDom)
: TheNode(node), IDom(iDom) {} : TheNode(node), IDom(iDom) {}
inline Node *addChild(Node *C) { push_back(C); return C; } inline Node2 *addChild(Node *C) { push_back(C); return C; }
}; };
public: public:
@ -177,6 +180,7 @@ public:
// DominanceFrontier - Calculate the dominance frontiers for a method. // DominanceFrontier - Calculate the dominance frontiers for a method.
// //
class DominanceFrontier : public DominatorBase { class DominanceFrontier : public DominatorBase {
public:
typedef set<const BasicBlock*> DomSetType; // Dom set for a bb typedef set<const BasicBlock*> DomSetType; // Dom set for a bb
typedef map<const BasicBlock *, DomSetType> DomSetMapType; // Map of dom sets typedef map<const BasicBlock *, DomSetType> DomSetMapType; // Map of dom sets
private: private: