[llvm] r313743 - [X86][SSE] Remove unnecessary NonceMasks from combineX86ShufflesRecursively calls (NFCI)
Simon Pilgrim via llvm-commits
llvm-commits at lists.llvm.org
Wed Sep 20 02:36:11 PDT 2017
Author: rksimon
Date: Wed Sep 20 02:36:11 2017
New Revision: 313743
URL: http://llvm.org/viewvc/llvm-project?rev=313743&view=rev
Log:
[X86][SSE] Remove unnecessary NonceMasks from combineX86ShufflesRecursively calls (NFCI)
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=313743&r1=313742&r2=313743&view=diff
==============================================================================
--- llvm/trunk/lib/Target/X86/X86ISelLowering.cpp (original)
+++ llvm/trunk/lib/Target/X86/X86ISelLowering.cpp Wed Sep 20 02:36:11 2017
@@ -29222,11 +29222,9 @@ static SDValue combineShuffle(SDNode *N,
// specific PSHUF instruction sequences into their minimal form so that we
// can evaluate how many specialized shuffle instructions are involved in
// a particular chain.
- SmallVector<int, 1> NonceMask; // Just a placeholder.
- NonceMask.push_back(0);
- if (combineX86ShufflesRecursively({Op}, 0, Op, NonceMask, {},
- /*Depth*/ 1, /*HasVarMask*/ false, DAG,
- DCI, Subtarget))
+ if (combineX86ShufflesRecursively({Op}, 0, Op, {0}, {}, /*Depth*/ 1,
+ /*HasVarMask*/ false, DAG, DCI,
+ Subtarget))
return SDValue(); // This routine will use CombineTo to replace N.
}
@@ -31857,11 +31855,9 @@ static SDValue combineVectorShiftImm(SDN
// We can decode 'whole byte' logical bit shifts as shuffles.
if (LogicalShift && (ShiftVal.getZExtValue() % 8) == 0) {
SDValue Op(N, 0);
- SmallVector<int, 1> NonceMask; // Just a placeholder.
- NonceMask.push_back(0);
- if (combineX86ShufflesRecursively({Op}, 0, Op, NonceMask, {},
- /*Depth*/ 1, /*HasVarMask*/ false, DAG,
- DCI, Subtarget))
+ if (combineX86ShufflesRecursively({Op}, 0, Op, {0}, {}, /*Depth*/ 1,
+ /*HasVarMask*/ false, DAG, DCI,
+ Subtarget))
return SDValue(); // This routine will use CombineTo to replace N.
}
@@ -31898,11 +31894,8 @@ static SDValue combineVectorInsert(SDNod
// Attempt to combine PINSRB/PINSRW patterns to a shuffle.
SDValue Op(N, 0);
- SmallVector<int, 1> NonceMask; // Just a placeholder.
- NonceMask.push_back(0);
- combineX86ShufflesRecursively({Op}, 0, Op, NonceMask, {},
- /*Depth*/ 1, /*HasVarMask*/ false, DAG,
- DCI, Subtarget);
+ combineX86ShufflesRecursively({Op}, 0, Op, {0}, {}, /*Depth*/ 1,
+ /*HasVarMask*/ false, DAG, DCI, Subtarget);
return SDValue();
}
@@ -32202,11 +32195,9 @@ static SDValue combineAnd(SDNode *N, Sel
// Attempt to recursively combine a bitmask AND with shuffles.
if (VT.isVector() && (VT.getScalarSizeInBits() % 8) == 0) {
SDValue Op(N, 0);
- SmallVector<int, 1> NonceMask; // Just a placeholder.
- NonceMask.push_back(0);
- if (combineX86ShufflesRecursively({Op}, 0, Op, NonceMask, {},
- /*Depth*/ 1, /*HasVarMask*/ false, DAG,
- DCI, Subtarget))
+ if (combineX86ShufflesRecursively({Op}, 0, Op, {0}, {}, /*Depth*/ 1,
+ /*HasVarMask*/ false, DAG, DCI,
+ Subtarget))
return SDValue(); // This routine will use CombineTo to replace N.
}
@@ -34351,11 +34342,9 @@ static SDValue combineAndnp(SDNode *N, S
// Attempt to recursively combine a bitmask ANDNP with shuffles.
if (VT.isVector() && (VT.getScalarSizeInBits() % 8) == 0) {
SDValue Op(N, 0);
- SmallVector<int, 1> NonceMask; // Just a placeholder.
- NonceMask.push_back(0);
- if (combineX86ShufflesRecursively({Op}, 0, Op, NonceMask, {},
- /*Depth*/ 1, /*HasVarMask*/ false, DAG,
- DCI, Subtarget))
+ if (combineX86ShufflesRecursively({Op}, 0, Op, {0}, {}, /*Depth*/ 1,
+ /*HasVarMask*/ false, DAG, DCI,
+ Subtarget))
return SDValue(); // This routine will use CombineTo to replace N.
}
More information about the llvm-commits
mailing list