[llvm] r229312 - Coding style fixes to recent patches. NFC.
Simon Pilgrim
llvm-dev at redking.me.uk
Sun Feb 15 06:19:30 PST 2015
Author: rksimon
Date: Sun Feb 15 08:19:29 2015
New Revision: 229312
URL: http://llvm.org/viewvc/llvm-project?rev=229312&view=rev
Log:
Coding style fixes to recent patches. NFC.
Modified:
llvm/trunk/lib/Target/X86/X86ISelLowering.cpp
Modified: llvm/trunk/lib/Target/X86/X86ISelLowering.cpp
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/lib/Target/X86/X86ISelLowering.cpp?rev=229312&r1=229311&r2=229312&view=diff
==============================================================================
--- llvm/trunk/lib/Target/X86/X86ISelLowering.cpp (original)
+++ llvm/trunk/lib/Target/X86/X86ISelLowering.cpp Sun Feb 15 08:19:29 2015
@@ -6651,7 +6651,7 @@ static SDValue matchAddSub(const BuildVe
bool AddFound = false;
bool SubFound = false;
- for (unsigned i = 0, e = NumElts; i != e; i++) {
+ for (unsigned i = 0, e = NumElts; i != e; ++i) {
SDValue Op = BV->getOperand(i);
// Skip 'undef' values.
@@ -7926,10 +7926,10 @@ static SDValue lowerVectorShuffleAsBitSh
bool MatchLeft = true, MatchRight = true;
for (int i = 0; i != Size; i += Scale) {
- for (int j = 0; j != Shift; j++) {
+ for (int j = 0; j != Shift; ++j) {
MatchLeft &= Zeroable[i + j];
}
- for (int j = Scale - Shift; j != Scale; j++) {
+ for (int j = Scale - Shift; j != Scale; ++j) {
MatchRight &= Zeroable[i + j];
}
}
@@ -7963,7 +7963,7 @@ static SDValue lowerVectorShuffleAsBitSh
// multiple to see if we can find a match with the moved element indices
// and that the shifted in elements are all zeroable.
for (int Scale = 2; Scale * VT.getScalarSizeInBits() <= 64; Scale *= 2)
- for (int Shift = 1; Shift != Scale; Shift++)
+ for (int Shift = 1; Shift != Scale; ++Shift)
if (SDValue BitShift = MatchBitShift(Shift, Scale))
return BitShift;
@@ -8132,7 +8132,7 @@ static SDValue lowerVectorShuffleAsZeroO
// Returns one of the source operands if the shuffle can be reduced to a
// MOVQ, copying the lower 64-bits and zero-extending to the upper 64-bits.
auto CanZExtLowHalf = [&]() {
- for (int i = NumElements / 2; i != NumElements; i++)
+ for (int i = NumElements / 2; i != NumElements; ++i)
if (!Zeroable[i])
return SDValue();
if (isSequentialOrUndefInRange(Mask, 0, NumElements / 2, 0))
@@ -8385,7 +8385,7 @@ static SDValue lowerVectorShuffleAsInser
int V2DstIndex = -1;
bool V1UsedInPlace = false;
- for (int i = 0; i < 4; i++) {
+ for (int i = 0; i < 4; ++i) {
// Synthesize a zero mask from the zeroable elements (includes undefs).
if (Zeroable[i]) {
ZMask |= 1 << i;
More information about the llvm-commits
mailing list