mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-08-21 03:29:40 +00:00
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@745 91177308-0d34-0410-b5e6-96231b3b80d8
225 lines
7.5 KiB
C++
225 lines
7.5 KiB
C++
//===- llvm/Analysis/DominatorSet.h - Dominator Set Calculation --*- C++ -*--=//
|
|
//
|
|
// This file defines the following classes:
|
|
// 1. DominatorSet: Calculates the [reverse] dominator set for a method
|
|
// 2. ImmediateDominators: Calculates and holds a mapping between BasicBlocks
|
|
// and their immediate dominator.
|
|
// 3. DominatorTree: Represent the ImmediateDominator as an explicit tree
|
|
// structure.
|
|
// 4. DominanceFrontier: Calculate and hold the dominance frontier for a
|
|
// method.
|
|
//
|
|
// These data structures are listed in increasing order of complexity. It
|
|
// takes longer to calculate the dominator frontier, for example, than the
|
|
// ImmediateDominator mapping.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#ifndef LLVM_DOMINATORS_H
|
|
#define LLVM_DOMINATORS_H
|
|
|
|
#include <set>
|
|
#include <map>
|
|
#include <vector>
|
|
class Method;
|
|
class BasicBlock;
|
|
|
|
namespace cfg {
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// DominatorBase - Base class that other, more interesting dominator analyses
|
|
// inherit from.
|
|
//
|
|
class DominatorBase {
|
|
protected:
|
|
const BasicBlock *Root;
|
|
inline DominatorBase(const BasicBlock *root = 0) : Root(root) {}
|
|
public:
|
|
inline const BasicBlock *getRoot() const { return Root; }
|
|
bool isPostDominator() const; // Returns true if analysis based of postdoms
|
|
};
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// DominatorSet - Maintain a set<const BasicBlock*> for every basic block in a
|
|
// method, that represents the blocks that dominate the block.
|
|
//
|
|
class DominatorSet : public DominatorBase {
|
|
public:
|
|
typedef set<const BasicBlock*> DomSetType; // Dom set for a bb
|
|
typedef map<const BasicBlock *, DomSetType> DomSetMapType; // Map of dom sets
|
|
private:
|
|
DomSetMapType Doms;
|
|
|
|
void calcForwardDominatorSet(const Method *M);
|
|
public:
|
|
// DominatorSet ctor - Build either the dominator set or the post-dominator
|
|
// set for a method... Building the postdominator set may require the analysis
|
|
// routine to modify the method so that there is only a single return in the
|
|
// method.
|
|
//
|
|
DominatorSet(const Method *M);
|
|
DominatorSet( Method *M, bool PostDomSet);
|
|
|
|
// Accessor interface:
|
|
typedef DomSetMapType::const_iterator const_iterator;
|
|
inline const_iterator begin() const { return Doms.begin(); }
|
|
inline const_iterator end() const { return Doms.end(); }
|
|
inline const_iterator find(const BasicBlock* B) const { return Doms.find(B); }
|
|
|
|
// getDominators - Return the set of basic blocks that dominate the specified
|
|
// block.
|
|
//
|
|
inline const DomSetType &getDominators(const BasicBlock *BB) const {
|
|
const_iterator I = find(BB);
|
|
assert(I != end() && "BB not in method!");
|
|
return I->second;
|
|
}
|
|
|
|
// dominates - Return true if A dominates B.
|
|
//
|
|
inline bool dominates(const BasicBlock *A, const BasicBlock *B) const {
|
|
return getDominators(B).count(A) != 0;
|
|
}
|
|
};
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// ImmediateDominators - Calculate the immediate dominator for each node in a
|
|
// method.
|
|
//
|
|
class ImmediateDominators : public DominatorBase {
|
|
map<const BasicBlock*, const BasicBlock*> IDoms;
|
|
void calcIDoms(const DominatorSet &DS);
|
|
public:
|
|
|
|
// ImmediateDominators ctor - Calculate the idom mapping, for a method, or
|
|
// from a dominator set calculated for something else...
|
|
//
|
|
inline ImmediateDominators(const DominatorSet &DS)
|
|
: DominatorBase(DS.getRoot()) {
|
|
calcIDoms(DS); // Can be used to make rev-idoms
|
|
}
|
|
|
|
// Accessor interface:
|
|
typedef map<const BasicBlock*, const BasicBlock*> IDomMapType;
|
|
typedef IDomMapType::const_iterator const_iterator;
|
|
inline const_iterator begin() const { return IDoms.begin(); }
|
|
inline const_iterator end() const { return IDoms.end(); }
|
|
inline const_iterator find(const BasicBlock* B) const { return IDoms.find(B);}
|
|
|
|
// operator[] - Return the idom for the specified basic block. The start
|
|
// node returns null, because it does not have an immediate dominator.
|
|
//
|
|
inline const BasicBlock *operator[](const BasicBlock *BB) const {
|
|
map<const BasicBlock*, const BasicBlock*>::const_iterator I =
|
|
IDoms.find(BB);
|
|
return I != IDoms.end() ? I->second : 0;
|
|
}
|
|
};
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// DominatorTree - Calculate the immediate dominator tree for a method.
|
|
//
|
|
class DominatorTree : public DominatorBase {
|
|
class Node2;
|
|
public:
|
|
typedef Node2 Node;
|
|
private:
|
|
map<const BasicBlock*, Node*> Nodes;
|
|
void calculate(const DominatorSet &DS);
|
|
typedef map<const BasicBlock*, Node*> NodeMapType;
|
|
public:
|
|
class Node2 : public vector<Node*> {
|
|
friend class DominatorTree;
|
|
const BasicBlock *TheNode;
|
|
Node2 * const IDom;
|
|
public:
|
|
inline const BasicBlock *getNode() const { return TheNode; }
|
|
inline Node2 *getIDom() const { return IDom; }
|
|
inline const vector<Node*> &getChildren() const { return *this; }
|
|
|
|
// dominates - Returns true iff this dominates N. Note that this is not a
|
|
// constant time operation!
|
|
inline bool dominates(const Node2 *N) const {
|
|
const Node2 *IDom;
|
|
while ((IDom = N->getIDom()) != 0 && IDom != this)
|
|
N = IDom; // Walk up the tree
|
|
return IDom != 0;
|
|
}
|
|
|
|
private:
|
|
inline Node2(const BasicBlock *node, Node *iDom)
|
|
: TheNode(node), IDom(iDom) {}
|
|
inline Node2 *addChild(Node *C) { push_back(C); return C; }
|
|
};
|
|
|
|
public:
|
|
// DominatorTree ctors - Compute a dominator tree, given various amounts of
|
|
// previous knowledge...
|
|
inline DominatorTree(const DominatorSet &DS) : DominatorBase(DS.getRoot()) {
|
|
calculate(DS);
|
|
}
|
|
|
|
DominatorTree(const ImmediateDominators &IDoms);
|
|
~DominatorTree();
|
|
|
|
inline const Node *operator[](const BasicBlock *BB) const {
|
|
NodeMapType::const_iterator i = Nodes.find(BB);
|
|
return (i != Nodes.end()) ? i->second : 0;
|
|
}
|
|
};
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// DominanceFrontier - Calculate the dominance frontiers for a method.
|
|
//
|
|
class DominanceFrontier : public DominatorBase {
|
|
public:
|
|
typedef set<const BasicBlock*> DomSetType; // Dom set for a bb
|
|
typedef map<const BasicBlock *, DomSetType> DomSetMapType; // Map of dom sets
|
|
private:
|
|
DomSetMapType Frontiers;
|
|
const DomSetType &calcDomFrontier(const DominatorTree &DT,
|
|
const DominatorTree::Node *Node);
|
|
const DomSetType &calcPostDomFrontier(const DominatorTree &DT,
|
|
const DominatorTree::Node *Node);
|
|
public:
|
|
DominanceFrontier(const DominatorSet &DS) : DominatorBase(DS.getRoot()) {
|
|
const DominatorTree DT(DS);
|
|
if (isPostDominator())
|
|
calcPostDomFrontier(DT, DT[Root]);
|
|
else
|
|
calcDomFrontier(DT, DT[Root]);
|
|
}
|
|
DominanceFrontier(const ImmediateDominators &ID)
|
|
: DominatorBase(ID.getRoot()) {
|
|
const DominatorTree DT(ID);
|
|
if (isPostDominator())
|
|
calcPostDomFrontier(DT, DT[Root]);
|
|
else
|
|
calcDomFrontier(DT, DT[Root]);
|
|
}
|
|
DominanceFrontier(const DominatorTree &DT) : DominatorBase(DT.getRoot()) {
|
|
if (isPostDominator())
|
|
calcPostDomFrontier(DT, DT[Root]);
|
|
else
|
|
calcDomFrontier(DT, DT[Root]);
|
|
}
|
|
|
|
// Accessor interface:
|
|
typedef DomSetMapType::const_iterator const_iterator;
|
|
inline const_iterator begin() const { return Frontiers.begin(); }
|
|
inline const_iterator end() const { return Frontiers.end(); }
|
|
inline const_iterator find(const BasicBlock* B) const { return Frontiers.find(B);}
|
|
};
|
|
|
|
} // End namespace cfg
|
|
|
|
#endif
|