From 32ef15bd33b765435ed5b2634c67b09d71026576 Mon Sep 17 00:00:00 2001 From: Jakub Jelinek Date: Tue, 22 Nov 2011 17:57:33 +0100 Subject: [PATCH] re PR tree-optimization/51074 (No constant folding performed for VEC_PERM_EXPR, VEC_INTERLEAVE*EXPR, VEC_EXTRACT*EXPR) PR tree-optimization/51074 * fold-const.c (fold_binary_loc): Fix up VEC_INTERLEAVE_*_EXPR handling for BYTES_BIG_ENDIAN. * optabs.c (can_vec_perm_for_code_p): Likewise. * gcc.dg/vect/pr51074.c: New test. From-SVN: r181627 --- gcc/ChangeLog | 7 +++++++ gcc/fold-const.c | 6 ++++-- gcc/optabs.c | 4 ++-- gcc/testsuite/ChangeLog | 5 +++++ gcc/testsuite/gcc.dg/vect/pr51074.c | 24 ++++++++++++++++++++++++ 5 files changed, 42 insertions(+), 4 deletions(-) create mode 100644 gcc/testsuite/gcc.dg/vect/pr51074.c diff --git a/gcc/ChangeLog b/gcc/ChangeLog index d77a380bfaa..8fdeef271e4 100644 --- a/gcc/ChangeLog +++ b/gcc/ChangeLog @@ -1,3 +1,10 @@ +2011-11-22 Jakub Jelinek + + PR tree-optimization/51074 + * fold-const.c (fold_binary_loc): Fix up VEC_INTERLEAVE_*_EXPR + handling for BYTES_BIG_ENDIAN. + * optabs.c (can_vec_perm_for_code_p): Likewise. + 2011-11-22 Michael Matz PR other/51125 diff --git a/gcc/fold-const.c b/gcc/fold-const.c index e590377265e..8f31a5fdb0e 100644 --- a/gcc/fold-const.c +++ b/gcc/fold-const.c @@ -13483,10 +13483,12 @@ fold_binary_loc (location_t loc, sel[i] = i * 2 + 1; break; case VEC_INTERLEAVE_HIGH_EXPR: - sel[i] = (i + nelts) / 2 + ((i & 1) ? nelts : 0); + sel[i] = (i + (BYTES_BIG_ENDIAN ? 0 : nelts)) / 2 + + ((i & 1) ? nelts : 0); break; case VEC_INTERLEAVE_LOW_EXPR: - sel[i] = i / 2 + ((i & 1) ? nelts : 0); + sel[i] = (i + (BYTES_BIG_ENDIAN ? nelts : 0)) / 2 + + ((i & 1) ? nelts : 0); break; default: gcc_unreachable (); diff --git a/gcc/optabs.c b/gcc/optabs.c index 2468efd273b..647805b3923 100644 --- a/gcc/optabs.c +++ b/gcc/optabs.c @@ -6932,9 +6932,9 @@ can_vec_perm_for_code_p (enum tree_code code, enum machine_mode mode, break; case VEC_INTERLEAVE_HIGH_EXPR: - alt = nelt / 2; - /* FALLTHRU */ case VEC_INTERLEAVE_LOW_EXPR: + if ((BYTES_BIG_ENDIAN != 0) ^ (code == VEC_INTERLEAVE_HIGH_EXPR)) + alt = nelt / 2; for (i = 0; i < nelt / 2; ++i) { data[i * 2] = i + alt; diff --git a/gcc/testsuite/ChangeLog b/gcc/testsuite/ChangeLog index 0502af90351..c21ee616c75 100644 --- a/gcc/testsuite/ChangeLog +++ b/gcc/testsuite/ChangeLog @@ -1,3 +1,8 @@ +2011-11-22 Jakub Jelinek + + PR tree-optimization/51074 + * gcc.dg/vect/pr51074.c: New test. + 2011-11-22 Dodji Seketeli PR c++/51143 diff --git a/gcc/testsuite/gcc.dg/vect/pr51074.c b/gcc/testsuite/gcc.dg/vect/pr51074.c new file mode 100644 index 00000000000..30913999400 --- /dev/null +++ b/gcc/testsuite/gcc.dg/vect/pr51074.c @@ -0,0 +1,24 @@ +/* PR tree-optimization/51074 */ + +#include "tree-vect.h" + +struct S { int a, b; } s[8]; + +int +main () +{ + int i; + check_vect (); + for (i = 0; i < 8; i++) + { + s[i].b = 0; + s[i].a = i; + } + asm volatile ("" : : : "memory"); + for (i = 0; i < 8; i++) + if (s[i].b != 0 || s[i].a != i) + abort (); + return 0; +} + +/* { dg-final { cleanup-tree-dump "vect" } } */ -- 2.30.2