[llvm] r312853 - [SLP] Fix buildbots, NFC.

Alexey Bataev via llvm-commits llvm-commits at lists.llvm.org
Fri Sep 8 19:08:46 PDT 2017


Author: abataev
Date: Fri Sep  8 19:08:45 2017
New Revision: 312853

URL: http://llvm.org/viewvc/llvm-project?rev=312853&view=rev
Log:
[SLP] Fix buildbots, NFC.

Modified:
    llvm/trunk/lib/Transforms/Vectorize/SLPVectorizer.cpp

Modified: llvm/trunk/lib/Transforms/Vectorize/SLPVectorizer.cpp
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/lib/Transforms/Vectorize/SLPVectorizer.cpp?rev=312853&r1=312852&r2=312853&view=diff
==============================================================================
--- llvm/trunk/lib/Transforms/Vectorize/SLPVectorizer.cpp (original)
+++ llvm/trunk/lib/Transforms/Vectorize/SLPVectorizer.cpp Fri Sep  8 19:08:45 2017
@@ -5202,7 +5202,6 @@ private:
 
     int PairwiseRdxCost;
     int SplittingRdxCost;
-    bool IsUnsigned = true;
     switch (ReductionData.getKind()) {
     case RK_Arithmetic:
       PairwiseRdxCost =
@@ -5214,10 +5213,11 @@ private:
       break;
     case RK_Min:
     case RK_Max:
-      IsUnsigned = false;
     case RK_UMin:
     case RK_UMax: {
       Type *VecCondTy = CmpInst::makeCmpResultType(VecTy);
+      bool IsUnsigned = ReductionData.getKind() == RK_UMin ||
+                        ReductionData.getKind() == RK_UMax;
       PairwiseRdxCost =
           TTI->getMinMaxReductionCost(VecTy, VecCondTy,
                                       /*IsPairwiseForm=*/true, IsUnsigned);




More information about the llvm-commits mailing list