Commit 9bc22d19 by Richard Biener Committed by Richard Biener

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

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
parent e47c4031
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> 2015-07-28 Kyrylo Tkachov <kyrylo.tkachov@arm.com>
* config/aarch64/aarch64.c (aarch64_rtx_arith_op_extract_p): * config/aarch64/aarch64.c (aarch64_rtx_arith_op_extract_p):
......
...@@ -1856,12 +1856,6 @@ along with GCC; see the file COPYING3. If not see ...@@ -1856,12 +1856,6 @@ along with GCC; see the file COPYING3. If not see
{ constant_boolean_node (true, type); }) { constant_boolean_node (true, type); })
(if (cmp == LT_EXPR) (if (cmp == LT_EXPR)
(ne @2 @1)))) (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)) (if (wi::eq_p (@1, min))
(switch (switch
(if (cmp == LT_EXPR) (if (cmp == LT_EXPR)
...@@ -1872,6 +1866,12 @@ along with GCC; see the file COPYING3. If not see ...@@ -1872,6 +1866,12 @@ along with GCC; see the file COPYING3. If not see
{ constant_boolean_node (true, type); }) { constant_boolean_node (true, type); })
(if (cmp == GT_EXPR) (if (cmp == GT_EXPR)
(ne @2 @1)))) (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)) (if (wi::eq_p (@1, min + 1))
(switch (switch
(if (cmp == GE_EXPR) (if (cmp == GE_EXPR)
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment