[llvm] 6d26799 - [AArch64] Don't rely on (zext (trunc x)) pattern to detect zext_inreg MULL patterns - use value tracking directly
Simon Pilgrim via llvm-commits
llvm-commits at lists.llvm.org
Fri Sep 22 02:45:23 PDT 2023
Author: Simon Pilgrim
Date: 2023-09-22T10:43:20+01:00
New Revision: 6d2679992e58bdb2ab74f354b0b8c9ce2a31f247
URL: https://github.com/llvm/llvm-project/commit/6d2679992e58bdb2ab74f354b0b8c9ce2a31f247
DIFF: https://github.com/llvm/llvm-project/commit/6d2679992e58bdb2ab74f354b0b8c9ce2a31f247.diff
LOG: [AArch64] Don't rely on (zext (trunc x)) pattern to detect zext_inreg MULL patterns - use value tracking directly
As explained on D159533, I'm trying to generalize the "(zext (trunc x)) -> x iff the upper bits are known zero" fold in getNode() and I was seeing assertions in the aarch64 mull matching code as it was assuming these 'zero-extend-inreg' patterns will remain from earlier in LowerMUL.
Instead I've updated selectUmullSmull/skipExtensionForVectorMULL to just use value tracking to detect when the upper bits are known zero, and to insert the truncation nodes later if necessary.
Differential Revision: https://reviews.llvm.org/D159537
Added:
Modified:
llvm/lib/Target/AArch64/AArch64ISelLowering.cpp
Removed:
################################################################################
diff --git a/llvm/lib/Target/AArch64/AArch64ISelLowering.cpp b/llvm/lib/Target/AArch64/AArch64ISelLowering.cpp
index cd1f2401763589b..6c717ca1390a638 100644
--- a/llvm/lib/Target/AArch64/AArch64ISelLowering.cpp
+++ b/llvm/lib/Target/AArch64/AArch64ISelLowering.cpp
@@ -4426,18 +4426,25 @@ static bool isExtendedBUILD_VECTOR(SDValue N, SelectionDAG &DAG,
}
static SDValue skipExtensionForVectorMULL(SDValue N, SelectionDAG &DAG) {
+ EVT VT = N.getValueType();
+ assert(VT.is128BitVector() && "Unexpected vector MULL size");
+
+ unsigned NumElts = VT.getVectorNumElements();
+ unsigned OrigEltSize = VT.getScalarSizeInBits();
+ unsigned EltSize = OrigEltSize / 2;
+ MVT TruncVT = MVT::getVectorVT(MVT::getIntegerVT(EltSize), NumElts);
+
+ APInt HiBits = APInt::getHighBitsSet(OrigEltSize, EltSize);
+ if (DAG.MaskedValueIsZero(N, HiBits))
+ return DAG.getNode(ISD::TRUNCATE, SDLoc(N), TruncVT, N);
+
if (ISD::isExtOpcode(N.getOpcode()))
return addRequiredExtensionForVectorMULL(N.getOperand(0), DAG,
- N.getOperand(0).getValueType(),
- N.getValueType(),
+ N.getOperand(0).getValueType(), VT,
N.getOpcode());
assert(N.getOpcode() == ISD::BUILD_VECTOR && "expected BUILD_VECTOR");
- EVT VT = N.getValueType();
SDLoc dl(N);
- unsigned EltSize = VT.getScalarSizeInBits() / 2;
- unsigned NumElts = VT.getVectorNumElements();
- MVT TruncVT = MVT::getIntegerVT(EltSize);
SmallVector<SDValue, 8> Ops;
for (unsigned i = 0; i != NumElts; ++i) {
ConstantSDNode *C = cast<ConstantSDNode>(N.getOperand(i));
@@ -4446,7 +4453,7 @@ static SDValue skipExtensionForVectorMULL(SDValue N, SelectionDAG &DAG) {
// The values are implicitly truncated so sext vs. zext doesn't matter.
Ops.push_back(DAG.getConstant(CInt.zextOrTrunc(32), dl, MVT::i32));
}
- return DAG.getBuildVector(MVT::getVectorVT(TruncVT, NumElts), dl, Ops);
+ return DAG.getBuildVector(TruncVT, dl, Ops);
}
static bool isSignExtended(SDValue N, SelectionDAG &DAG) {
@@ -4588,31 +4595,8 @@ static unsigned selectUmullSmull(SDValue &N0, SDValue &N1, SelectionDAG &DAG,
EVT VT = N0.getValueType();
APInt Mask = APInt::getHighBitsSet(VT.getScalarSizeInBits(),
VT.getScalarSizeInBits() / 2);
- if (DAG.MaskedValueIsZero(IsN0ZExt ? N1 : N0, Mask)) {
- EVT HalfVT;
- switch (VT.getSimpleVT().SimpleTy) {
- case MVT::v2i64:
- HalfVT = MVT::v2i32;
- break;
- case MVT::v4i32:
- HalfVT = MVT::v4i16;
- break;
- case MVT::v8i16:
- HalfVT = MVT::v8i8;
- break;
- default:
- return 0;
- }
- // Truncate and then extend the result.
- SDValue NewExt =
- DAG.getNode(ISD::TRUNCATE, DL, HalfVT, IsN0ZExt ? N1 : N0);
- NewExt = DAG.getZExtOrTrunc(NewExt, DL, VT);
- if (IsN0ZExt)
- N1 = NewExt;
- else
- N0 = NewExt;
+ if (DAG.MaskedValueIsZero(IsN0ZExt ? N1 : N0, Mask))
return AArch64ISD::UMULL;
- }
}
if (!IsN1SExt && !IsN1ZExt)
More information about the llvm-commits
mailing list