diff options
| author | Jakub Jelinek <jakub@redhat.com> | 2018-12-11 21:28:35 +0100 |
|---|---|---|
| committer | Jakub Jelinek <jakub@gcc.gnu.org> | 2018-12-11 21:28:35 +0100 |
| commit | 3c0517a6531112d2dec16d18cdabb1513d387b7a (patch) | |
| tree | 2d255ca4091010661cc0d4e93218e16eb42e4330 | |
| parent | 3c393a2c012f7f5f1c3df7d6d7b17a9cf992af17 (diff) | |
| download | gcc-3c0517a6531112d2dec16d18cdabb1513d387b7a.zip gcc-3c0517a6531112d2dec16d18cdabb1513d387b7a.tar.gz gcc-3c0517a6531112d2dec16d18cdabb1513d387b7a.tar.bz2 | |
re PR tree-optimization/80520 (Performance regression from missing if-conversion)
PR tree-optimization/80520
* gcc.dg/tree-ssa/split-path-11.c (foo): Make the test ilp32 target
clean.
From-SVN: r267031
| -rw-r--r-- | gcc/testsuite/ChangeLog | 6 | ||||
| -rw-r--r-- | gcc/testsuite/gcc.dg/tree-ssa/split-path-11.c | 10 |
2 files changed, 11 insertions, 5 deletions
diff --git a/gcc/testsuite/ChangeLog b/gcc/testsuite/ChangeLog index c6730c2..36c4232 100644 --- a/gcc/testsuite/ChangeLog +++ b/gcc/testsuite/ChangeLog @@ -1,3 +1,9 @@ +2018-12-11 Jakub Jelinek <jakub@redhat.com> + + PR tree-optimization/80520 + * gcc.dg/tree-ssa/split-path-11.c (foo): Make the test ilp32 target + clean. + 2018-12-11 Marek Polacek <polacek@redhat.com> PR c++/86608 - reading constexpr volatile variable. diff --git a/gcc/testsuite/gcc.dg/tree-ssa/split-path-11.c b/gcc/testsuite/gcc.dg/tree-ssa/split-path-11.c index f94f1a8..66f57d9 100644 --- a/gcc/testsuite/gcc.dg/tree-ssa/split-path-11.c +++ b/gcc/testsuite/gcc.dg/tree-ssa/split-path-11.c @@ -1,13 +1,13 @@ /* { dg-do compile } */ /* { dg-options "-O2 -fsplit-paths -fdump-tree-split-paths-details -w" } */ -void foo(unsigned long *M) +void foo(unsigned long long *M) { - for (unsigned long k = 0; k < 227; ++k) + for (unsigned long long k = 0; k < 227; ++k) { - unsigned long y = - ((M[k] & 0xffffffff80000000) | (M[k + 1] & 0x7fffffff)); - M[k] = (M[k + 397] ^ (y >> 1) ^ ((y & 1) ? 2567483615 : 0)); + unsigned long long y = + ((M[k] & 0xffffffff80000000ULL) | (M[k + 1] & 0x7fffffffULL)); + M[k] = (M[k + 397] ^ (y >> 1) ^ ((y & 1) ? 2567483615ULL : 0)); } } |