+2015-10-16 Michael Collison <michael.collison@linaro.org>
+ Andrew Pinski <andrew.pinski@caviumnetworks.com>
+
+ * match.pd ((x < y) && (x < z) -> x < min (y,z),
+ (x > y) and (x > z) -> x > max (y,z))
+
2015-10-15 Gregor Richards <gregor.richards@uwaterloo.ca>
Szabolcs Nagy <szabolcs.nagy@arm.com>
(with { tree utype = unsigned_type_for (TREE_TYPE (@0)); }
(convert (bit_and (op (convert:utype @0) (convert:utype @1))
(convert:utype @4))))))))
+
+/* Transform (@0 < @1 and @0 < @2) to use min,
+ (@0 > @1 and @0 > @2) to use max */
+(for op (lt le gt ge)
+ ext (min min max max)
+ (simplify
+ (bit_and (op:s @0 @1) (op:s @0 @2))
+ (if (INTEGRAL_TYPE_P (TREE_TYPE (@0)))
+ (op @0 (ext @1 @2)))))
+
+2015-10-16 Michael Collison <michael.collison@linaro.org>
+ Andrew Pinski <andrew.pinski@caviumnetworks.com>
+
+ * testsuite/gcc.dg/tree-ssa/minmax-loopend.c: New test.
+
2015-10-15 Marek Polacek <polacek@redhat.com>
* gcc.dg/tree-ssa/reassoc-42.c: New test.
--- /dev/null
+/* { dg-do compile } */
+/* { dg-options "-O2 -fdump-tree-optimized" } */
+
+int min_test(long a, long b, long c) {
+ int cmp1 = a < b;
+ int cmp2 = a < c;
+ return cmp1 & cmp2;
+}
+
+int max_test (long a, long b, long c) {
+ int cmp1 = a > b;
+ int cmp2 = a > c;
+ return cmp1 & cmp2;
+}
+
+/* { dg-final { scan-tree-dump-times "MIN_EXPR" 1 "optimized" } } */
+/* { dg-final { scan-tree-dump-times "MAX_EXPR" 1 "optimized" } } */