RPCS3/llvm
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm.git synced 2024-12-06 19:09:08 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Add new method - nearestCommonDominator().

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@37508 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Devang Patel 2007-06-08 00:21:17 +00:00
parent 53c279b194
commit 0ab301c5fa
1 changed files with 11 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -185,6 +185,17 @@ protected:
void updateDFSNumbers();
/// Return the nearest common dominator of A and B.
BasicBlock *nearestCommonDominator(BasicBlock *A, BasicBlock *B) const {
ETNode *NodeA = getNode(A)->getETNode();
ETNode *NodeB = getNode(B)->getETNode();
ETNode *Common = NodeA->NCA(NodeB);
if (!Common)
return NULL;
return Common->getData<BasicBlock>();
}
/// dominates - Returns true iff this dominates N. Note that this is not a
/// constant time operation!
///