[llvm] cdccc82 - [NFC] Remove unused funciton param

[Max Kazantsev via llvm-commits]

Author: Max Kazantsev
Date: 2020-10-26T14:53:22+07:00
New Revision: cdccc82f4825a1c9ac1bc0df2a222acdf5e820d4

URL: https://github.com/llvm/llvm-project/commit/cdccc82f4825a1c9ac1bc0df2a222acdf5e820d4
DIFF: https://github.com/llvm/llvm-project/commit/cdccc82f4825a1c9ac1bc0df2a222acdf5e820d4.diff

LOG: [NFC] Remove unused funciton param

Added: 
    

Modified: 
    llvm/lib/Transforms/Scalar/IndVarSimplify.cpp

Removed: 
    


################################################################################
diff  --git a/llvm/lib/Transforms/Scalar/IndVarSimplify.cpp b/llvm/lib/Transforms/Scalar/IndVarSimplify.cpp
index b5275cf818f6..122ee38e4323 100644
--- a/llvm/lib/Transforms/Scalar/IndVarSimplify.cpp
+++ b/llvm/lib/Transforms/Scalar/IndVarSimplify.cpp
@@ -2416,7 +2416,7 @@ bool IndVarSimplify::optimizeLoopExits(Loop *L, SCEVExpander &Rewriter) {
       // Okay, we do not know the exit count here. Can we at least prove that it
       // will remain the same within iteration space?
       auto *BI = cast<BranchInst>(ExitingBB->getTerminator());
-      auto OptimizeCond = [&](bool Inverted, const SCEV *MaxIter) {
+      auto OptimizeCond = [&](bool Inverted) {
         if (isTrivialCond(L, BI, SE, Inverted)) {
           FoldExit(ExitingBB, Inverted);
           return true;