mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-12-15 04:30:12 +00:00
081c34b725
must be called in the pass's constructor. This function uses static dependency declarations to recursively initialize the pass's dependencies. Clients that only create passes through the createFooPass() APIs will require no changes. Clients that want to use the CommandLine options for passes will need to manually call the appropriate initialization functions in PassInitialization.h before parsing commandline arguments. I have tested this with all standard configurations of clang and llvm-gcc on Darwin. It is possible that there are problems with the static dependencies that will only be visible with non-standard options. If you encounter any crash in pass registration/creation, please send the testcase to me directly. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@116820 91177308-0d34-0410-b5e6-96231b3b80d8
138 lines
3.7 KiB
C++
138 lines
3.7 KiB
C++
//=- llvm/Analysis/PostDominators.h - Post Dominator Calculation-*- C++ -*-===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is distributed under the University of Illinois Open Source
|
|
// License. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// This file exposes interfaces to post dominance information.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#ifndef LLVM_ANALYSIS_POST_DOMINATORS_H
|
|
#define LLVM_ANALYSIS_POST_DOMINATORS_H
|
|
|
|
#include "llvm/Analysis/Dominators.h"
|
|
|
|
namespace llvm {
|
|
|
|
/// PostDominatorTree Class - Concrete subclass of DominatorTree that is used to
|
|
/// compute the a post-dominator tree.
|
|
///
|
|
struct PostDominatorTree : public FunctionPass {
|
|
static char ID; // Pass identification, replacement for typeid
|
|
DominatorTreeBase<BasicBlock>* DT;
|
|
|
|
PostDominatorTree() : FunctionPass(ID) {
|
|
initializePostDominatorTreePass(*PassRegistry::getPassRegistry());
|
|
DT = new DominatorTreeBase<BasicBlock>(true);
|
|
}
|
|
|
|
~PostDominatorTree();
|
|
|
|
virtual bool runOnFunction(Function &F);
|
|
|
|
virtual void getAnalysisUsage(AnalysisUsage &AU) const {
|
|
AU.setPreservesAll();
|
|
}
|
|
|
|
inline const std::vector<BasicBlock*> &getRoots() const {
|
|
return DT->getRoots();
|
|
}
|
|
|
|
inline DomTreeNode *getRootNode() const {
|
|
return DT->getRootNode();
|
|
}
|
|
|
|
inline DomTreeNode *operator[](BasicBlock *BB) const {
|
|
return DT->getNode(BB);
|
|
}
|
|
|
|
inline DomTreeNode *getNode(BasicBlock *BB) const {
|
|
return DT->getNode(BB);
|
|
}
|
|
|
|
inline bool dominates(DomTreeNode* A, DomTreeNode* B) const {
|
|
return DT->dominates(A, B);
|
|
}
|
|
|
|
inline bool dominates(const BasicBlock* A, const BasicBlock* B) const {
|
|
return DT->dominates(A, B);
|
|
}
|
|
|
|
inline bool properlyDominates(const DomTreeNode* A, DomTreeNode* B) const {
|
|
return DT->properlyDominates(A, B);
|
|
}
|
|
|
|
inline bool properlyDominates(BasicBlock* A, BasicBlock* B) const {
|
|
return DT->properlyDominates(A, B);
|
|
}
|
|
|
|
inline BasicBlock *findNearestCommonDominator(BasicBlock *A, BasicBlock *B) {
|
|
return DT->findNearestCommonDominator(A, B);
|
|
}
|
|
|
|
virtual void releaseMemory() {
|
|
DT->releaseMemory();
|
|
}
|
|
|
|
virtual void print(raw_ostream &OS, const Module*) const;
|
|
};
|
|
|
|
FunctionPass* createPostDomTree();
|
|
|
|
template <> struct GraphTraits<PostDominatorTree*>
|
|
: public GraphTraits<DomTreeNode*> {
|
|
static NodeType *getEntryNode(PostDominatorTree *DT) {
|
|
return DT->getRootNode();
|
|
}
|
|
|
|
static nodes_iterator nodes_begin(PostDominatorTree *N) {
|
|
if (getEntryNode(N))
|
|
return df_begin(getEntryNode(N));
|
|
else
|
|
return df_end(getEntryNode(N));
|
|
}
|
|
|
|
static nodes_iterator nodes_end(PostDominatorTree *N) {
|
|
return df_end(getEntryNode(N));
|
|
}
|
|
};
|
|
|
|
/// PostDominanceFrontier Class - Concrete subclass of DominanceFrontier that is
|
|
/// used to compute the a post-dominance frontier.
|
|
///
|
|
struct PostDominanceFrontier : public DominanceFrontierBase {
|
|
static char ID;
|
|
PostDominanceFrontier()
|
|
: DominanceFrontierBase(ID, true) {
|
|
initializePostDominanceFrontierPass(*PassRegistry::getPassRegistry());
|
|
}
|
|
|
|
virtual bool runOnFunction(Function &) {
|
|
Frontiers.clear();
|
|
PostDominatorTree &DT = getAnalysis<PostDominatorTree>();
|
|
Roots = DT.getRoots();
|
|
if (const DomTreeNode *Root = DT.getRootNode())
|
|
calculate(DT, Root);
|
|
return false;
|
|
}
|
|
|
|
virtual void getAnalysisUsage(AnalysisUsage &AU) const {
|
|
AU.setPreservesAll();
|
|
AU.addRequired<PostDominatorTree>();
|
|
}
|
|
|
|
private:
|
|
const DomSetType &calculate(const PostDominatorTree &DT,
|
|
const DomTreeNode *Node);
|
|
};
|
|
|
|
FunctionPass* createPostDomFrontier();
|
|
|
|
} // End llvm namespace
|
|
|
|
#endif
|