diff options
author | Chad Rosier <mcrosier@codeaurora.org> | 2016-09-13 13:30:30 +0000 |
---|---|---|
committer | Chad Rosier <mcrosier@codeaurora.org> | 2016-09-13 13:30:30 +0000 |
commit | 7ea0d3947a070aed7c75ee253ae3addd252fe9f2 (patch) | |
tree | a7ba779b0168e5632a44ab9a43c1b64c4cadbed3 | |
parent | 0a893f7df488f6449099429cd35f8db4f44a86cd (diff) | |
download | bcm5719-llvm-7ea0d3947a070aed7c75ee253ae3addd252fe9f2.tar.gz bcm5719-llvm-7ea0d3947a070aed7c75ee253ae3addd252fe9f2.zip |
[LoopInterchange] Minor refactor. NFC.
llvm-svn: 281334
-rw-r--r-- | llvm/lib/Transforms/Scalar/LoopInterchange.cpp | 23 |
1 files changed, 11 insertions, 12 deletions
diff --git a/llvm/lib/Transforms/Scalar/LoopInterchange.cpp b/llvm/lib/Transforms/Scalar/LoopInterchange.cpp index 02653491b86..b9ebfd02912 100644 --- a/llvm/lib/Transforms/Scalar/LoopInterchange.cpp +++ b/llvm/lib/Transforms/Scalar/LoopInterchange.cpp @@ -75,12 +75,6 @@ static bool populateDependencyMatrix(CharMatrix &DepMatrix, unsigned Level, typedef SmallVector<Value *, 16> ValueVector; ValueVector MemInstr; - if (Level > MaxLoopNestDepth) { - DEBUG(dbgs() << "Cannot handle loops of depth greater than " - << MaxLoopNestDepth << "\n"); - return false; - } - // For each block. for (Loop::block_iterator BB = L->block_begin(), BE = L->block_end(); BB != BE; ++BB) { @@ -497,21 +491,26 @@ struct LoopInterchange : public FunctionPass { bool processLoopList(LoopVector LoopList, Function &F) { bool Changed = false; - CharMatrix DependencyMatrix; - if (LoopList.size() < 2) { + unsigned LoopNestDepth = LoopList.size(); + if (LoopNestDepth < 2) { DEBUG(dbgs() << "Loop doesn't contain minimum nesting level.\n"); return false; } + if (LoopNestDepth > MaxLoopNestDepth) { + DEBUG(dbgs() << "Cannot handle loops of depth greater than " + << MaxLoopNestDepth << "\n"); + return false; + } if (!isComputableLoopNest(LoopList)) { DEBUG(dbgs() << "Not valid loop candidate for interchange\n"); return false; } - Loop *OuterMostLoop = *(LoopList.begin()); - DEBUG(dbgs() << "Processing LoopList of size = " << LoopList.size() - << "\n"); + DEBUG(dbgs() << "Processing LoopList of size = " << LoopNestDepth << "\n"); - if (!populateDependencyMatrix(DependencyMatrix, LoopList.size(), + CharMatrix DependencyMatrix; + Loop *OuterMostLoop = *(LoopList.begin()); + if (!populateDependencyMatrix(DependencyMatrix, LoopNestDepth, OuterMostLoop, DI)) { DEBUG(dbgs() << "Populating Dependency matrix failed\n"); return false; |