(op (min @X { wide_int_to_tree (from_type, real_c1); })
{ wide_int_to_tree (from_type, c2); })))))))))
+#if GIMPLE
+/* A >= B ? A : B -> max (A, B) and friends. The code is still
+ in fold_cond_expr_with_comparison for GENERIC folding with
+ some extra constraints. */
+(for cmp (eq ne le lt unle unlt ge gt unge ungt uneq ltgt)
+ (simplify
+ (cond (cmp:c (nop_convert1?@c0 @0) (nop_convert2?@c1 @1))
+ (convert3? @0) (convert4? @1))
+ (if (!HONOR_SIGNED_ZEROS (type)
+ && ((INTEGRAL_TYPE_P (type)
+ /* Allow widening conversions of the data. */
+ && TYPE_PRECISION (TREE_TYPE (@0)) <= TYPE_PRECISION (type)
+ && TYPE_PRECISION (TREE_TYPE (@1)) <= TYPE_PRECISION (type))
+ || (tree_nop_conversion_p (type, TREE_TYPE (@0))
+ && tree_nop_conversion_p (type, TREE_TYPE (@1)))))
+ (switch
+ (if (cmp == EQ_EXPR)
+ (if (VECTOR_TYPE_P (type))
+ (view_convert @c1)
+ (convert @c1)))
+ (if (cmp == NE_EXPR)
+ (if (VECTOR_TYPE_P (type))
+ (view_convert @c0)
+ (convert @c0)))
+ (if (cmp == LE_EXPR || cmp == UNLE_EXPR || cmp == LT_EXPR || cmp == UNLT_EXPR)
+ (if (!HONOR_NANS (type))
+ (if (VECTOR_TYPE_P (type))
+ (view_convert (min @c0 @c1))
+ (convert (min @c0 @c1)))))
+ (if (cmp == GE_EXPR || cmp == UNGE_EXPR || cmp == GT_EXPR || cmp == UNGT_EXPR)
+ (if (!HONOR_NANS (type))
+ (if (VECTOR_TYPE_P (type))
+ (view_convert (max @c0 @c1))
+ (convert (max @c0 @c1)))))
+ (if (cmp == UNEQ_EXPR)
+ (if (!HONOR_NANS (type))
+ (if (VECTOR_TYPE_P (type))
+ (view_convert @c1)
+ (convert @c1))))
+ (if (cmp == LTGT_EXPR)
+ (if (!HONOR_NANS (type))
+ (if (VECTOR_TYPE_P (type))
+ (view_convert @c0)
+ (convert @c0))))))))
+#endif
+
/* X != C1 ? -X : C2 simplifies to -X when -C1 == C2. */
(simplify
(cond (ne @0 INTEGER_CST@1) (negate@3 @0) INTEGER_CST@2)