[llvm] SelectionDAG: Improve expandFMINIMUM_FMAXIMUM (PR #137367)
Matt Arsenault via llvm-commits
llvm-commits at lists.llvm.org
Tue Dec 23 05:14:08 PST 2025
================
@@ -8758,54 +8780,64 @@ SDValue TargetLowering::expandFMINIMUM_FMAXIMUM(SDNode *N,
// First, implement comparison not propagating NaN. If no native fmin or fmax
// available, use plain select with setcc instead.
SDValue MinMax;
- unsigned CompOpcIeee = IsMax ? ISD::FMAXNUM_IEEE : ISD::FMINNUM_IEEE;
- unsigned CompOpc = IsMax ? ISD::FMAXNUM : ISD::FMINNUM;
-
- // FIXME: We should probably define fminnum/fmaxnum variants with correct
- // signed zero behavior.
- bool MinMaxMustRespectOrderedZero = false;
-
- if (isOperationLegalOrCustom(CompOpcIeee, VT)) {
- MinMax = DAG.getNode(CompOpcIeee, DL, VT, LHS, RHS, Flags);
- MinMaxMustRespectOrderedZero = true;
- } else if (isOperationLegalOrCustom(CompOpc, VT)) {
- MinMax = DAG.getNode(CompOpc, DL, VT, LHS, RHS, Flags);
- } else {
- if (VT.isVector() && !isOperationLegalOrCustom(ISD::VSELECT, VT))
- return DAG.UnrollVectorOp(N);
-
- // NaN (if exists) will be propagated later, so orderness doesn't matter.
- SDValue Compare =
- DAG.getSetCC(DL, CCVT, LHS, RHS, IsMax ? ISD::SETOGT : ISD::SETOLT);
- MinMax = DAG.getSelect(DL, VT, Compare, LHS, RHS, Flags);
+ unsigned MinMaxOpcIeee = IsMax ? ISD::FMAXNUM_IEEE : ISD::FMINNUM_IEEE;
+ // TODO: Add ISD::FMAXNUM or ISD::FMINNUM when we are sure that they have
+ // the same behavior on all platforms.
+ unsigned MinMaxOpcNum2019 = IsMax ? ISD::FMAXIMUMNUM : ISD::FMINIMUMNUM;
+ unsigned MinMaxOpc = ISD::DELETED_NODE;
+
+ if (isOperationLegal(MinMaxOpcIeee, VT))
+ MinMaxOpc = MinMaxOpcIeee;
+ else if (isOperationLegal(MinMaxOpcNum2019, VT))
+ MinMaxOpc = MinMaxOpcNum2019;
+ else if (isOperationCustom(MinMaxOpcIeee, VT))
+ MinMaxOpc = MinMaxOpcIeee;
+ else if (isOperationCustom(MinMaxOpcNum2019, VT))
----------------
arsenm wrote:
These should all consistently be isOperationLegalOrCustom, mixing isLegal and isCustom doesn't make much sense
https://github.com/llvm/llvm-project/pull/137367
More information about the llvm-commits
mailing list