diff options
| author | Misha Brukman <brukman+llvm@gmail.com> | 2005-04-22 04:01:18 +0000 |
|---|---|---|
| committer | Misha Brukman <brukman+llvm@gmail.com> | 2005-04-22 04:01:18 +0000 |
| commit | dedf2bd5a34dac25e4245f58bb902ced6b64edd9 (patch) | |
| tree | 8ae45f7a66e26530d3f60616f44557d31dc2cee7 /lib/Analysis/LoopInfo.cpp | |
| parent | 00876a2808f1a8061f7e0852c7949fc5074ecb04 (diff) | |
Convert tabs to spaces
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@21439 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/Analysis/LoopInfo.cpp')
| -rw-r--r-- | lib/Analysis/LoopInfo.cpp | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/lib/Analysis/LoopInfo.cpp b/lib/Analysis/LoopInfo.cpp index 8559d9a6b7..16d036c089 100644 --- a/lib/Analysis/LoopInfo.cpp +++ b/lib/Analysis/LoopInfo.cpp @@ -109,7 +109,7 @@ void LoopInfo::Calculate(const DominatorSet &DS) { BasicBlock *RootNode = DS.getRoot(); for (df_iterator<BasicBlock*> NI = df_begin(RootNode), - NE = df_end(RootNode); NI != NE; ++NI) + NE = df_end(RootNode); NI != NE; ++NI) if (Loop *L = ConsiderForLoop(*NI, DS)) TopLevelLoops.push_back(L); } @@ -191,7 +191,7 @@ Loop *LoopInfo::ConsiderForLoop(BasicBlock *BB, const DominatorSet &DS) { // If there are any loops nested within this loop, create them now! for (std::vector<BasicBlock*>::iterator I = L->Blocks.begin(), - E = L->Blocks.end(); I != E; ++I) + E = L->Blocks.end(); I != E; ++I) if (Loop *NewLoop = ConsiderForLoop(*I, DS)) { L->SubLoops.push_back(NewLoop); NewLoop->ParentLoop = L; @@ -201,7 +201,7 @@ Loop *LoopInfo::ConsiderForLoop(BasicBlock *BB, const DominatorSet &DS) { // loop can be found for them. // for (std::vector<BasicBlock*>::iterator I = L->Blocks.begin(), - E = L->Blocks.end(); I != E; ++I) { + E = L->Blocks.end(); I != E; ++I) { std::map<BasicBlock*, Loop*>::iterator BBMI = BBMap.lower_bound(*I); if (BBMI == BBMap.end() || BBMI->first != *I) // Not in map yet... BBMap.insert(BBMI, std::make_pair(*I, L)); // Must be at this level |