match.pd: Re-order two cases in comparison with max/min value simplification to make...

2015-07-28  Richard Biener  <rguenther@suse.de>

	* match.pd: Re-order two cases in comparison with max/min
	value simplification to make it apply for bools.

From-SVN: r226311

diff --git a/gcc/ChangeLog b/gcc/ChangeLog
index 54a0da3237f8a8ae1e6168362af307dee125d9ad..d81551f6968ef90bb6c52b68c6a4129d5e7330fc 100644 (file)
--- a/gcc/ChangeLog
+++ b/gcc/ChangeLog
@@ -1,3 +1,8 @@
+2015-07-28  Richard Biener  <rguenther@suse.de>
+
+       * match.pd: Re-order two cases in comparison with max/min
+       value simplification to make it apply for bools.
+
 2015-07-28  Kyrylo Tkachov  <kyrylo.tkachov@arm.com>
 
        * config/aarch64/aarch64.c (aarch64_rtx_arith_op_extract_p):

diff --git a/gcc/match.pd b/gcc/match.pd
index f431df567644889954cf6fc4502d87e9f6109ae8..5aaa8e119aa240c1fa2d7fb486be68040fc55e14 100644 (file)
--- a/gcc/match.pd
+++ b/gcc/match.pd
@@ -1856,12 +1856,6 @@ along with GCC; see the file COPYING3.  If not see
        { constant_boolean_node (true, type); })
        (if (cmp == LT_EXPR)
        (ne @2 @1))))
-     (if (wi::eq_p (@1, max - 1))
-      (switch
-       (if (cmp == GT_EXPR)
-        (eq @2 { wide_int_to_tree (TREE_TYPE (@1), wi::add (@1, 1)); }))
-       (if (cmp == LE_EXPR)
-        (ne @2 { wide_int_to_tree (TREE_TYPE (@1), wi::add (@1, 1)); }))))
      (if (wi::eq_p (@1, min))
       (switch
        (if (cmp == LT_EXPR)
@@ -1872,6 +1866,12 @@ along with GCC; see the file COPYING3.  If not see
         { constant_boolean_node (true, type); })
        (if (cmp == GT_EXPR)
         (ne @2 @1))))
+     (if (wi::eq_p (@1, max - 1))
+      (switch
+       (if (cmp == GT_EXPR)
+        (eq @2 { wide_int_to_tree (TREE_TYPE (@1), wi::add (@1, 1)); }))
+       (if (cmp == LE_EXPR)
+        (ne @2 { wide_int_to_tree (TREE_TYPE (@1), wi::add (@1, 1)); }))))
      (if (wi::eq_p (@1, min + 1))
       (switch
        (if (cmp == GE_EXPR)