forked from OSchip/llvm-project
[DAGCombiner] Add a shuffle mask commutation helper function. NFCI.
We have an increasing number of cases where we are creating commuted shuffle masks - all implementing nearly the same code. This patch adds a static helper function - ShuffleVectorSDNode::commuteMask() and replaces a number of cases to use it. Differential Revision: http://reviews.llvm.org/D8139 llvm-svn: 231581
This commit is contained in:
parent
a99e152e80
commit
8c58c066b7
|
@ -1332,6 +1332,21 @@ public:
|
|||
}
|
||||
static bool isSplatMask(const int *Mask, EVT VT);
|
||||
|
||||
/// Change values in a shuffle permute mask assuming
|
||||
/// the two vector operands have swapped position.
|
||||
static void commuteMask(SmallVectorImpl<int> &Mask) {
|
||||
unsigned NumElems = Mask.size();
|
||||
for (unsigned i = 0; i != NumElems; ++i) {
|
||||
int idx = Mask[i];
|
||||
if (idx < 0)
|
||||
continue;
|
||||
else if (idx < (int)NumElems)
|
||||
Mask[i] = idx + NumElems;
|
||||
else
|
||||
Mask[i] = idx - NumElems;
|
||||
}
|
||||
}
|
||||
|
||||
static bool classof(const SDNode *N) {
|
||||
return N->getOpcode() == ISD::VECTOR_SHUFFLE;
|
||||
}
|
||||
|
|
|
@ -12030,16 +12030,8 @@ SDValue DAGCombiner::visitVECTOR_SHUFFLE(SDNode *N) {
|
|||
SDValue SV1 = BC0->getOperand(1);
|
||||
bool LegalMask = TLI.isShuffleMaskLegal(NewMask, ScaleVT);
|
||||
if (!LegalMask) {
|
||||
for (int i = 0, e = (int)NewMask.size(); i != e; ++i) {
|
||||
int idx = NewMask[i];
|
||||
if (idx < 0)
|
||||
continue;
|
||||
else if (idx < e)
|
||||
NewMask[i] = idx + e;
|
||||
else
|
||||
NewMask[i] = idx - e;
|
||||
}
|
||||
std::swap(SV0, SV1);
|
||||
ShuffleVectorSDNode::commuteMask(NewMask);
|
||||
LegalMask = TLI.isShuffleMaskLegal(NewMask, ScaleVT);
|
||||
}
|
||||
|
||||
|
@ -12163,16 +12155,7 @@ SDValue DAGCombiner::visitVECTOR_SHUFFLE(SDNode *N) {
|
|||
|
||||
// Avoid introducing shuffles with illegal mask.
|
||||
if (!TLI.isShuffleMaskLegal(Mask, VT)) {
|
||||
// Compute the commuted shuffle mask and test again.
|
||||
for (unsigned i = 0; i != NumElts; ++i) {
|
||||
int idx = Mask[i];
|
||||
if (idx < 0)
|
||||
continue;
|
||||
else if (idx < (int)NumElts)
|
||||
Mask[i] = idx + NumElts;
|
||||
else
|
||||
Mask[i] = idx - NumElts;
|
||||
}
|
||||
ShuffleVectorSDNode::commuteMask(Mask);
|
||||
|
||||
if (!TLI.isShuffleMaskLegal(Mask, VT))
|
||||
return SDValue();
|
||||
|
|
|
@ -1446,13 +1446,7 @@ SDValue SelectionDAG::getCondCode(ISD::CondCode Cond) {
|
|||
// N2 to point at N1.
|
||||
static void commuteShuffle(SDValue &N1, SDValue &N2, SmallVectorImpl<int> &M) {
|
||||
std::swap(N1, N2);
|
||||
int NElts = M.size();
|
||||
for (int i = 0; i != NElts; ++i) {
|
||||
if (M[i] >= NElts)
|
||||
M[i] -= NElts;
|
||||
else if (M[i] >= 0)
|
||||
M[i] += NElts;
|
||||
}
|
||||
ShuffleVectorSDNode::commuteMask(M);
|
||||
}
|
||||
|
||||
SDValue SelectionDAG::getVectorShuffle(EVT VT, SDLoc dl, SDValue N1,
|
||||
|
@ -1625,19 +1619,8 @@ SDValue SelectionDAG::getVectorShuffle(EVT VT, SDLoc dl, SDValue N1,
|
|||
|
||||
SDValue SelectionDAG::getCommutedVectorShuffle(const ShuffleVectorSDNode &SV) {
|
||||
MVT VT = SV.getSimpleValueType(0);
|
||||
unsigned NumElems = VT.getVectorNumElements();
|
||||
SmallVector<int, 8> MaskVec;
|
||||
|
||||
for (unsigned i = 0; i != NumElems; ++i) {
|
||||
int Idx = SV.getMaskElt(i);
|
||||
if (Idx >= 0) {
|
||||
if (Idx < (int)NumElems)
|
||||
Idx += NumElems;
|
||||
else
|
||||
Idx -= NumElems;
|
||||
}
|
||||
MaskVec.push_back(Idx);
|
||||
}
|
||||
SmallVector<int, 8> MaskVec(SV.getMask().begin(), SV.getMask().end());
|
||||
ShuffleVectorSDNode::commuteMask(MaskVec);
|
||||
|
||||
SDValue Op0 = SV.getOperand(0);
|
||||
SDValue Op1 = SV.getOperand(1);
|
||||
|
|
|
@ -3878,21 +3878,6 @@ static bool isSequentialOrUndefInRange(ArrayRef<int> Mask,
|
|||
return true;
|
||||
}
|
||||
|
||||
/// CommuteVectorShuffleMask - Change values in a shuffle permute mask assuming
|
||||
/// the two vector operands have swapped position.
|
||||
static void CommuteVectorShuffleMask(SmallVectorImpl<int> &Mask,
|
||||
unsigned NumElems) {
|
||||
for (unsigned i = 0; i != NumElems; ++i) {
|
||||
int idx = Mask[i];
|
||||
if (idx < 0)
|
||||
continue;
|
||||
else if (idx < (int)NumElems)
|
||||
Mask[i] = idx + NumElems;
|
||||
else
|
||||
Mask[i] = idx - NumElems;
|
||||
}
|
||||
}
|
||||
|
||||
/// isVEXTRACTIndex - Return true if the specified
|
||||
/// EXTRACT_SUBVECTOR operand specifies a vector extract that is
|
||||
/// suitable for instruction that extract 128 or 256 bit vectors
|
||||
|
@ -22842,7 +22827,7 @@ static bool isHorizontalBinOp(SDValue &LHS, SDValue &RHS, bool IsCommutative) {
|
|||
// If A and B occur in reverse order in RHS, then "swap" them (which means
|
||||
// rewriting the mask).
|
||||
if (A != C)
|
||||
CommuteVectorShuffleMask(RMask, NumElts);
|
||||
ShuffleVectorSDNode::commuteMask(RMask);
|
||||
|
||||
// At this point LHS and RHS are equivalent to
|
||||
// LHS = VECTOR_SHUFFLE A, B, LMask
|
||||
|
|
Loading…
Reference in New Issue