diff options
author | Chad Rosier <mcrosier@codeaurora.org> | 2016-08-31 15:06:58 +0000 |
---|---|---|
committer | Chad Rosier <mcrosier@codeaurora.org> | 2016-08-31 15:06:58 +0000 |
commit | 669130ffdf3d7637affb29770be6bf39b2abe953 (patch) | |
tree | 21cb0b7b56543ab83af4648da3b208dbba6a41df /llvm/lib/Transforms/Vectorize/SLPVectorizer.cpp | |
parent | 15b978a2c87ce1f53e31338907bd986795c0a4b6 (diff) | |
download | bcm5719-llvm-669130ffdf3d7637affb29770be6bf39b2abe953.tar.gz bcm5719-llvm-669130ffdf3d7637affb29770be6bf39b2abe953.zip |
[SLP] Arguments should be camel case, and start with an upper case letter. NFC.
llvm-svn: 280248
Diffstat (limited to 'llvm/lib/Transforms/Vectorize/SLPVectorizer.cpp')
-rw-r--r-- | llvm/lib/Transforms/Vectorize/SLPVectorizer.cpp | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/llvm/lib/Transforms/Vectorize/SLPVectorizer.cpp b/llvm/lib/Transforms/Vectorize/SLPVectorizer.cpp index 83e65094d7f..745afc18a07 100644 --- a/llvm/lib/Transforms/Vectorize/SLPVectorizer.cpp +++ b/llvm/lib/Transforms/Vectorize/SLPVectorizer.cpp @@ -3851,7 +3851,7 @@ bool SLPVectorizerPass::tryToVectorizePair(Value *A, Value *B, BoUpSLP &R) { 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::tryToVectorizeList(ArrayRef<Value *> VL, BoUpSLP &R, 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 |