RPCS3/llvm
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm.git synced 2025-01-30 23:33:57 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Protect updateDFSNumbers()

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@37560 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Devang Patel 2007-06-12 17:30:56 +00:00
parent 5fd306bf0d
commit 6857e366f5
1 changed files with 3 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -131,6 +131,8 @@ protected:
// Info - Collection of information used during the computation of idoms. // Info - Collection of information used during the computation of idoms.
std::map<BasicBlock*, InfoRec> Info; std::map<BasicBlock*, InfoRec> Info;
void updateDFSNumbers();
public: public:
DominatorTreeBase(intptr_t ID, bool isPostDom) DominatorTreeBase(intptr_t ID, bool isPostDom)
: DominatorBase(ID, isPostDom), DFSInfoValid(false), SlowQueries(0) {} : DominatorBase(ID, isPostDom), DFSInfoValid(false), SlowQueries(0) {}
@ -191,13 +193,12 @@ protected:
return IDom != 0; return IDom != 0;
} }
void updateDFSNumbers();
/// isReachableFromEntry - Return true if A is dominated by the entry /// isReachableFromEntry - Return true if A is dominated by the entry
/// block of the function containing it. /// block of the function containing it.
const bool isReachableFromEntry(BasicBlock* A); const bool isReachableFromEntry(BasicBlock* A);
/// dominates - Returns true iff this dominates N. Note that this is not a /// dominates - Returns true iff A dominates B. Note that this is not a
/// constant time operation! /// constant time operation!
/// ///
inline bool dominates(const DomTreeNode *A, DomTreeNode *B) { inline bool dominates(const DomTreeNode *A, DomTreeNode *B) {