1.5.6Copyright © 2003-2007 University of Illinois at Urbana-Champaign. All Rights Reserved.
LLVM API Documentation
#include <Dominators.h>
Definition at line 717 of file Dominators.h.
| llvm::DominatorTree::DominatorTree | ( | ) | [inline] |
| llvm::DominatorTree::~DominatorTree | ( | ) | [inline] |
| DominatorTreeBase<BasicBlock>& llvm::DominatorTree::getBase | ( | ) | [inline] |
Definition at line 731 of file Dominators.h.
References DT.
Referenced by compare(), and llvm::PMDataManager::verifyDomInfo().
| const std::vector<BasicBlock*>& llvm::DominatorTree::getRoots | ( | ) | const [inline] |
getRoots - Return the root blocks of the current CFG. This may include multiple blocks if we are computing post dominators. For forward dominators, this will always be a single block (the entry node).
Definition at line 737 of file Dominators.h.
References DT.
Referenced by llvm::DominanceFrontier::runOnFunction(), and llvm::PMDataManager::verifyDomInfo().
| BasicBlock* llvm::DominatorTree::getRoot | ( | ) | const [inline] |
| DomTreeNode* llvm::DominatorTree::getRootNode | ( | ) | const [inline] |
Definition at line 745 of file Dominators.h.
References DT.
Referenced by compare(), and llvm::GraphTraits< DominatorTree * >::getEntryNode().
| bool llvm::DominatorTree::compare | ( | DominatorTree & | Other | ) | const [inline] |
compare - Return false if the other dominator tree matches this dominator tree. Otherwise return true.
Definition at line 751 of file Dominators.h.
References DT, getBase(), llvm::DomTreeNodeBase< NodeT >::getBlock(), getRootNode(), and R.
Referenced by llvm::PMDataManager::verifyDomInfo().
| bool DominatorTree::runOnFunction | ( | Function & | F | ) | [virtual] |
runOnFunction - Virtual method overriden by subclasses to do the per-function processing of the pass.
Implements llvm::FunctionPass.
Definition at line 59 of file Dominators.cpp.
References DT.
| virtual void llvm::DominatorTree::getAnalysisUsage | ( | AnalysisUsage & | ) | const [inline, virtual] |
getAnalysisUsage - This function should be overriden by passes that need analysis information to do their job. If a pass specifies that it uses a particular analysis result to this function, it can then use the getAnalysis<AnalysisType>() function, below.
Reimplemented from llvm::Pass.
Definition at line 766 of file Dominators.h.
References llvm::AnalysisUsage::setPreservesAll().
| bool llvm::DominatorTree::dominates | ( | DomTreeNode * | A, | |
| DomTreeNode * | B | |||
| ) | const [inline] |
Definition at line 770 of file Dominators.h.
References DT.
Referenced by llvm::DominanceFrontier::changeImmediateDominator(), FindPHIToPartitionLoops(), getSCEVStartAndStride(), IVUseShouldUsePostIncValue(), llvm::DominanceFrontier::splitBlock(), and llvm::SplitBlockPredecessors().
| bool llvm::DominatorTree::dominates | ( | BasicBlock * | A, | |
| BasicBlock * | B | |||
| ) | const [inline] |
| bool llvm::DominatorTree::dominates | ( | Instruction * | A, | |
| Instruction * | B | |||
| ) | const [inline] |
Definition at line 780 of file Dominators.h.
References llvm::BasicBlock::begin(), DT, and llvm::Instruction::getParent().
| bool llvm::DominatorTree::properlyDominates | ( | const DomTreeNode * | A, | |
| DomTreeNode * | B | |||
| ) | const [inline] |
Definition at line 802 of file Dominators.h.
References DT.
Referenced by llvm::DominanceFrontier::calculate().
| bool llvm::DominatorTree::properlyDominates | ( | BasicBlock * | A, | |
| BasicBlock * | B | |||
| ) | const [inline] |
| BasicBlock* llvm::DominatorTree::findNearestCommonDominator | ( | BasicBlock * | A, | |
| BasicBlock * | B | |||
| ) | [inline] |
findNearestCommonDominator - Find nearest common dominator basic block for basic block A and B. If there is no such block then return NULL.
Definition at line 812 of file Dominators.h.
References DT.
| DomTreeNode* llvm::DominatorTree::operator[] | ( | BasicBlock * | BB | ) | const [inline] |
| DomTreeNode* llvm::DominatorTree::getNode | ( | BasicBlock * | BB | ) | const [inline] |
getNode - return the (Post)DominatorTree node for the specified basic block. This is the same as using operator[] on this class.
Definition at line 823 of file Dominators.h.
References DT.
Referenced by CloneDominatorInfo(), and llvm::PMDataManager::verifyDomInfo().
| DomTreeNode* llvm::DominatorTree::addNewBlock | ( | BasicBlock * | BB, | |
| BasicBlock * | DomBB | |||
| ) | [inline] |
addNewBlock - Add a new node to the dominator tree information. This creates a new node as a child of DomBB dominator node,linking it into the children list of the immediate dominator.
Definition at line 830 of file Dominators.h.
References DT.
Referenced by CloneDominatorInfo().
| void llvm::DominatorTree::changeImmediateDominator | ( | BasicBlock * | N, | |
| BasicBlock * | NewIDom | |||
| ) | [inline] |
changeImmediateDominator - This method is used to update the dominator tree information when a node's immediate dominator changes.
Definition at line 837 of file Dominators.h.
References DT.
| void llvm::DominatorTree::changeImmediateDominator | ( | DomTreeNode * | N, | |
| DomTreeNode * | NewIDom | |||
| ) | [inline] |
| void llvm::DominatorTree::eraseNode | ( | BasicBlock * | BB | ) | [inline] |
eraseNode - Removes a node from the dominator tree. Block must not domiante any other blocks. Removes node from its immediate dominator's children list. Deletes dominator node associated with basic block BB.
Definition at line 848 of file Dominators.h.
References DT.
| void llvm::DominatorTree::splitBlock | ( | BasicBlock * | NewBB | ) | [inline] |
splitBlock - BB is split and now it has one successor. Update dominator tree to reflect this change.
Definition at line 854 of file Dominators.h.
References DT.
Referenced by llvm::SplitBlockPredecessors().
| bool llvm::DominatorTree::isReachableFromEntry | ( | BasicBlock * | A | ) | [inline] |
| virtual void llvm::DominatorTree::releaseMemory | ( | ) | [inline, virtual] |
releaseMemory() - This member can be implemented by a pass if it wants to be able to release its memory when it is no longer needed. The default behavior of passes is to hold onto memory for the entire duration of their lifetime (which is the entire compile time). For pipelined passes, this is not a big deal because that memory gets recycled every time the pass is invoked on another program unit. For IP passes, it is more important to free memory when it is unused.
Optionally implement this function to release pass memory when it is no longer used.
Reimplemented from llvm::Pass.
Definition at line 863 of file Dominators.h.
References DT.
| virtual void llvm::DominatorTree::print | ( | std::ostream & | O, | |
| const Module * | M = 0 | |||
| ) | const [inline, virtual] |
print - Print out the internal state of the pass. This is called by Analyze to print out the contents of an analysis. Otherwise it is not necessary to implement this method. Beware that the module pointer MAY be null. This automatically forwards to a virtual function that does not provide the Module* in case the analysis doesn't need it it can just be ignored.
Reimplemented from llvm::Pass.
Definition at line 867 of file Dominators.h.
char DominatorTree::ID = 0 [static] |
Definition at line 719 of file Dominators.h.
Definition at line 720 of file Dominators.h.
Referenced by addNewBlock(), changeImmediateDominator(), compare(), dominates(), DominatorTree(), eraseNode(), findNearestCommonDominator(), getBase(), getNode(), getRoot(), getRootNode(), getRoots(), isReachableFromEntry(), operator[](), print(), properlyDominates(), releaseMemory(), runOnFunction(), splitBlock(), and ~DominatorTree().
Generated on Thu Nov 5 23:48:20 2009 for LLVM by
1.5.6
Copyright © 2003-2007 University of Illinois at Urbana-Champaign.
All Rights Reserved.