diff options
| author | Chris Lattner <sabre@nondot.org> | 2006-01-14 20:55:09 +0000 |
|---|---|---|
| committer | Chris Lattner <sabre@nondot.org> | 2006-01-14 20:55:09 +0000 |
| commit | 25abb1dc094a08a3ba5cb426698b4780cbe438bb (patch) | |
| tree | 1902d196402ffc22261c1c248ebdc9f244dcb054 /lib/Analysis/LoopInfo.cpp | |
| parent | b47fad9892a2b73252b05aa809b2de1af89a1d3d (diff) | |
Change ET-Forest to automatically recalculate its DFSnum's if too many slow
queries are made.
Patch by Daniel Berlin!
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@25323 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/Analysis/LoopInfo.cpp')
| -rw-r--r-- | lib/Analysis/LoopInfo.cpp | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/lib/Analysis/LoopInfo.cpp b/lib/Analysis/LoopInfo.cpp index cf6e20a909..20b470f3eb 100644 --- a/lib/Analysis/LoopInfo.cpp +++ b/lib/Analysis/LoopInfo.cpp @@ -104,7 +104,7 @@ void LoopInfo::releaseMemory() { } -void LoopInfo::Calculate(const ETForest &EF) { +void LoopInfo::Calculate(ETForest &EF) { BasicBlock *RootNode = EF.getRoot(); for (df_iterator<BasicBlock*> NI = df_begin(RootNode), @@ -135,7 +135,7 @@ static bool isNotAlreadyContainedIn(Loop *SubLoop, Loop *ParentLoop) { return isNotAlreadyContainedIn(SubLoop->getParentLoop(), ParentLoop); } -Loop *LoopInfo::ConsiderForLoop(BasicBlock *BB, const ETForest &EF) { +Loop *LoopInfo::ConsiderForLoop(BasicBlock *BB, ETForest &EF) { if (BBMap.find(BB) != BBMap.end()) return 0; // Haven't processed this node? std::vector<BasicBlock *> TodoStack; |