[llvm] r280248 - [SLP] Arguments should be camel case, and start with an upper case letter. NFC.

[Chad Rosier via llvm-commits]

Author: mcrosier
Date: Wed Aug 31 10:06:58 2016
New Revision: 280248

URL: http://llvm.org/viewvc/llvm-project?rev=280248&view=rev
Log:
[SLP] Arguments should be camel case, and start with an upper case letter. NFC.

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

Modified: llvm/trunk/include/llvm/Transforms/Vectorize/SLPVectorizer.h
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/include/llvm/Transforms/Vectorize/SLPVectorizer.h?rev=280248&r1=280247&r2=280248&view=diff
==============================================================================
--- llvm/trunk/include/llvm/Transforms/Vectorize/SLPVectorizer.h (original)
+++ llvm/trunk/include/llvm/Transforms/Vectorize/SLPVectorizer.h Wed Aug 31 10:06:58 2016
@@ -80,7 +80,7 @@ private:
   /// \returns true if a value was vectorized.
   bool tryToVectorizeList(ArrayRef<Value *> VL, slpvectorizer::BoUpSLP &R,
                           ArrayRef<Value *> BuildVector = None,
-                          bool allowReorder = false);
+                          bool AllowReorder = false);
 
   /// \brief Try to vectorize a chain that may start at the operands of \V;
   bool tryToVectorize(BinaryOperator *V, slpvectorizer::BoUpSLP &R);

Modified: llvm/trunk/lib/Transforms/Vectorize/SLPVectorizer.cpp
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/lib/Transforms/Vectorize/SLPVectorizer.cpp?rev=280248&r1=280247&r2=280248&view=diff
==============================================================================
--- llvm/trunk/lib/Transforms/Vectorize/SLPVectorizer.cpp (original)
+++ llvm/trunk/lib/Transforms/Vectorize/SLPVectorizer.cpp Wed Aug 31 10:06:58 2016
@@ -3851,7 +3851,7 @@ bool SLPVectorizerPass::tryToVectorizePa
 
 bool SLPVectorizerPass::tryToVectorizeList(ArrayRef<Value *> VL, BoUpSLP &R,
                                            ArrayRef<Value *> BuildVector,
-                                           bool allowReorder) {
+                                           bool AllowReorder) {
   if (VL.size() < 2)
     return false;
 
@@ -3908,7 +3908,7 @@ bool SLPVectorizerPass::tryToVectorizeLi
 
     R.buildTree(Ops, BuildVectorSlice);
     // TODO: check if we can allow reordering for more cases.
-    if (allowReorder && R.shouldReorder()) {
+    if (AllowReorder && R.shouldReorder()) {
       // Conceptually, there is nothing actually preventing us from trying to
       // reorder a larger list. In fact, we do exactly this when vectorizing
       // reductions. However, at this point, we only expect to get here from