OpenE2K
/
gcc
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

2015-09-30 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))
	* testsuite/gcc.dg/tree-ssa/minmax-loopend.c: New test.


Co-Authored-By: Andrew Pinski <andrew.pinski@caviumnetworks.com>

From-SVN: r228854
This commit is contained in:
Michael Collison 2015-10-15 22:21:22 +00:00 committed by Michael Collison
parent 9418279db6
commit 4f7a569265
4 changed files with 38 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
gcc/ChangeLog
View File

@ -1,3 +1,9 @@
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>

10
gcc/match.pd
View File

@ -2431,3 +2431,13 @@ along with GCC; see the file COPYING3. If not see
(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)))))

5
gcc/testsuite/ChangeLog
View File

@ -1,3 +1,8 @@
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.

17
gcc/testsuite/gcc.dg/tree-ssa/minmax-loopend.c Normal file
View File

@ -0,0 +1,17 @@
/* { 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" } } */