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

[LV] While I'm here, use range based for loops which are so much cleaner

Browse Source 
for this kind of walk.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@204188 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chandler Carruth 2014-03-18 22:00:32 +00:00
parent 633eb08d31
commit 3c1eb9903b
1 changed files with 7 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
lib/Transforms/Vectorize/LoopVectorize.cpp
View File

@ -989,12 +989,12 @@ private:
}
};
static void addInnerLoop(Loop *L, SmallVectorImpl<Loop *> &V) {
if (L->empty())
return V.push_back(L);
static void addInnerLoop(Loop &L, SmallVectorImpl<Loop *> &V) {
if (L.empty())
return V.push_back(&L);
for (Loop::iterator I = L->begin(), E = L->end(); I != E; ++I)
addInnerLoop(*I, V);
for (Loop *InnerL : L)
addInnerLoop(*InnerL, V);
}
/// The LoopVectorize Pass.
@ -1051,8 +1051,8 @@ struct LoopVectorize : public FunctionPass {
// and can invalidate iterators across the loops.
SmallVector<Loop *, 8> Worklist;
for (LoopInfo::iterator I = LI->begin(), E = LI->end(); I != E; ++I)
addInnerLoop(*I, Worklist);
for (Loop *L : *LI)
addInnerLoop(*L, Worklist);
// Now walk the identified inner loops.
bool Changed = false;