forked from OSchip/llvm-project
parent
46989c637d
commit
765d3e0013
|
@ -3357,6 +3357,7 @@ SDValue LowerVECTOR_SHUFFLEv8i16(SDValue V1, SDValue V2,
|
||||||
int QuadIdx = EltIdx / 4;
|
int QuadIdx = EltIdx / 4;
|
||||||
++LowQuad[QuadIdx];
|
++LowQuad[QuadIdx];
|
||||||
}
|
}
|
||||||
|
|
||||||
int BestLowQuad = -1;
|
int BestLowQuad = -1;
|
||||||
unsigned MaxQuad = 1;
|
unsigned MaxQuad = 1;
|
||||||
for (unsigned i = 0; i < 4; ++i) {
|
for (unsigned i = 0; i < 4; ++i) {
|
||||||
|
@ -3376,6 +3377,7 @@ SDValue LowerVECTOR_SHUFFLEv8i16(SDValue V1, SDValue V2,
|
||||||
int QuadIdx = EltIdx / 4;
|
int QuadIdx = EltIdx / 4;
|
||||||
++HighQuad[QuadIdx];
|
++HighQuad[QuadIdx];
|
||||||
}
|
}
|
||||||
|
|
||||||
int BestHighQuad = -1;
|
int BestHighQuad = -1;
|
||||||
MaxQuad = 1;
|
MaxQuad = 1;
|
||||||
for (unsigned i = 0; i < 4; ++i) {
|
for (unsigned i = 0; i < 4; ++i) {
|
||||||
|
@ -3389,14 +3391,17 @@ SDValue LowerVECTOR_SHUFFLEv8i16(SDValue V1, SDValue V2,
|
||||||
if (BestLowQuad != -1 || BestHighQuad != -1) {
|
if (BestLowQuad != -1 || BestHighQuad != -1) {
|
||||||
// First sort the 4 chunks in order using shufpd.
|
// First sort the 4 chunks in order using shufpd.
|
||||||
SmallVector<SDValue, 8> MaskVec;
|
SmallVector<SDValue, 8> MaskVec;
|
||||||
|
|
||||||
if (BestLowQuad != -1)
|
if (BestLowQuad != -1)
|
||||||
MaskVec.push_back(DAG.getConstant(BestLowQuad, MVT::i32));
|
MaskVec.push_back(DAG.getConstant(BestLowQuad, MVT::i32));
|
||||||
else
|
else
|
||||||
MaskVec.push_back(DAG.getConstant(0, MVT::i32));
|
MaskVec.push_back(DAG.getConstant(0, MVT::i32));
|
||||||
|
|
||||||
if (BestHighQuad != -1)
|
if (BestHighQuad != -1)
|
||||||
MaskVec.push_back(DAG.getConstant(BestHighQuad, MVT::i32));
|
MaskVec.push_back(DAG.getConstant(BestHighQuad, MVT::i32));
|
||||||
else
|
else
|
||||||
MaskVec.push_back(DAG.getConstant(1, MVT::i32));
|
MaskVec.push_back(DAG.getConstant(1, MVT::i32));
|
||||||
|
|
||||||
SDValue Mask= DAG.getNode(ISD::BUILD_VECTOR, MVT::v2i32, &MaskVec[0],2);
|
SDValue Mask= DAG.getNode(ISD::BUILD_VECTOR, MVT::v2i32, &MaskVec[0],2);
|
||||||
NewV = DAG.getNode(ISD::VECTOR_SHUFFLE, MVT::v2i64,
|
NewV = DAG.getNode(ISD::VECTOR_SHUFFLE, MVT::v2i64,
|
||||||
DAG.getNode(ISD::BIT_CONVERT, MVT::v2i64, V1),
|
DAG.getNode(ISD::BIT_CONVERT, MVT::v2i64, V1),
|
||||||
|
@ -3409,6 +3414,7 @@ SDValue LowerVECTOR_SHUFFLEv8i16(SDValue V1, SDValue V2,
|
||||||
// Sort lower half in order using PSHUFLW.
|
// Sort lower half in order using PSHUFLW.
|
||||||
MaskVec.clear();
|
MaskVec.clear();
|
||||||
bool AnyOutOrder = false;
|
bool AnyOutOrder = false;
|
||||||
|
|
||||||
for (unsigned i = 0; i != 4; ++i) {
|
for (unsigned i = 0; i != 4; ++i) {
|
||||||
SDValue Elt = MaskElts[i];
|
SDValue Elt = MaskElts[i];
|
||||||
if (Elt.getOpcode() == ISD::UNDEF) {
|
if (Elt.getOpcode() == ISD::UNDEF) {
|
||||||
|
@ -3418,7 +3424,9 @@ SDValue LowerVECTOR_SHUFFLEv8i16(SDValue V1, SDValue V2,
|
||||||
unsigned EltIdx = cast<ConstantSDNode>(Elt)->getValue();
|
unsigned EltIdx = cast<ConstantSDNode>(Elt)->getValue();
|
||||||
if (EltIdx != i)
|
if (EltIdx != i)
|
||||||
AnyOutOrder = true;
|
AnyOutOrder = true;
|
||||||
|
|
||||||
MaskVec.push_back(DAG.getConstant(EltIdx % 4, MaskEVT));
|
MaskVec.push_back(DAG.getConstant(EltIdx % 4, MaskEVT));
|
||||||
|
|
||||||
// If this element is in the right place after this shuffle, then
|
// If this element is in the right place after this shuffle, then
|
||||||
// remember it.
|
// remember it.
|
||||||
if ((int)(EltIdx / 4) == BestLowQuad)
|
if ((int)(EltIdx / 4) == BestLowQuad)
|
||||||
|
@ -3436,8 +3444,10 @@ SDValue LowerVECTOR_SHUFFLEv8i16(SDValue V1, SDValue V2,
|
||||||
if (BestHighQuad != -1) {
|
if (BestHighQuad != -1) {
|
||||||
// Sort high half in order using PSHUFHW if possible.
|
// Sort high half in order using PSHUFHW if possible.
|
||||||
MaskVec.clear();
|
MaskVec.clear();
|
||||||
|
|
||||||
for (unsigned i = 0; i != 4; ++i)
|
for (unsigned i = 0; i != 4; ++i)
|
||||||
MaskVec.push_back(DAG.getConstant(i, MaskEVT));
|
MaskVec.push_back(DAG.getConstant(i, MaskEVT));
|
||||||
|
|
||||||
bool AnyOutOrder = false;
|
bool AnyOutOrder = false;
|
||||||
for (unsigned i = 4; i != 8; ++i) {
|
for (unsigned i = 4; i != 8; ++i) {
|
||||||
SDValue Elt = MaskElts[i];
|
SDValue Elt = MaskElts[i];
|
||||||
|
@ -3448,13 +3458,16 @@ SDValue LowerVECTOR_SHUFFLEv8i16(SDValue V1, SDValue V2,
|
||||||
unsigned EltIdx = cast<ConstantSDNode>(Elt)->getValue();
|
unsigned EltIdx = cast<ConstantSDNode>(Elt)->getValue();
|
||||||
if (EltIdx != i)
|
if (EltIdx != i)
|
||||||
AnyOutOrder = true;
|
AnyOutOrder = true;
|
||||||
|
|
||||||
MaskVec.push_back(DAG.getConstant((EltIdx % 4) + 4, MaskEVT));
|
MaskVec.push_back(DAG.getConstant((EltIdx % 4) + 4, MaskEVT));
|
||||||
|
|
||||||
// If this element is in the right place after this shuffle, then
|
// If this element is in the right place after this shuffle, then
|
||||||
// remember it.
|
// remember it.
|
||||||
if ((int)(EltIdx / 4) == BestHighQuad)
|
if ((int)(EltIdx / 4) == BestHighQuad)
|
||||||
InOrder.set(i);
|
InOrder.set(i);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
if (AnyOutOrder) {
|
if (AnyOutOrder) {
|
||||||
SDValue Mask = DAG.getNode(ISD::BUILD_VECTOR, MaskVT, &MaskVec[0], 8);
|
SDValue Mask = DAG.getNode(ISD::BUILD_VECTOR, MaskVT, &MaskVec[0], 8);
|
||||||
NewV = DAG.getNode(ISD::VECTOR_SHUFFLE, MVT::v8i16, NewV, NewV, Mask);
|
NewV = DAG.getNode(ISD::VECTOR_SHUFFLE, MVT::v8i16, NewV, NewV, Mask);
|
||||||
|
@ -3475,12 +3488,13 @@ SDValue LowerVECTOR_SHUFFLEv8i16(SDValue V1, SDValue V2,
|
||||||
NewV = DAG.getNode(ISD::INSERT_VECTOR_ELT, MVT::v8i16, NewV, ExtOp,
|
NewV = DAG.getNode(ISD::INSERT_VECTOR_ELT, MVT::v8i16, NewV, ExtOp,
|
||||||
DAG.getConstant(i, PtrVT));
|
DAG.getConstant(i, PtrVT));
|
||||||
}
|
}
|
||||||
|
|
||||||
return NewV;
|
return NewV;
|
||||||
}
|
}
|
||||||
|
|
||||||
// PSHUF{H|L}W are not used. Lower into extracts and inserts but try to use
|
// PSHUF{H|L}W are not used. Lower into extracts and inserts but try to use as
|
||||||
///as few as possible.
|
// few as possible. First, let's find out how many elements are already in the
|
||||||
// First, let's find out how many elements are already in the right order.
|
// right order.
|
||||||
unsigned V1InOrder = 0;
|
unsigned V1InOrder = 0;
|
||||||
unsigned V1FromV1 = 0;
|
unsigned V1FromV1 = 0;
|
||||||
unsigned V2InOrder = 0;
|
unsigned V2InOrder = 0;
|
||||||
|
|
Loading…
Reference in New Issue