[gcc] GCC 4.5.0=>4.5.1

gcc/gcc/testsuite/gcc.dg/vect/vect-76.c

Index: gcc/gcc/testsuite/gcc.dg/vect/vect-76.c
diff --git a/gcc/gcc/testsuite/gcc.dg/vect/vect-76.c b/gcc/gcc/testsuite/gcc.dg/vect/vect-76.c
index 8a2f7514e7ed17681532b7e4c52eac53fd56fca3..d771302422426cac39d9a7e57ccc8613432548f1 100644
--- a/gcc/gcc/testsuite/gcc.dg/vect/vect-76.c
+++ b/gcc/gcc/testsuite/gcc.dg/vect/vect-76.c
@@ -3,21 +3,21 @@
 #include <stdarg.h>
 #include "tree-vect.h"
 
-#define N 12
+#define N 24
 #define OFF 4
 
 /* Check handling of accesses for which the "initial condition" -
    the expression that represents the first location accessed - is
    more involved than just an ssa_name.  */
 
-int ib[N+OFF] __attribute__ ((__aligned__(16))) = {0, 1, 3, 5, 7, 11, 13, 17, 0, 2, 6, 10};
+int ib[N+OFF] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__))) = {0, 1, 3, 5, 7, 11, 13, 17, 0, 2, 6, 10};
+int ic[N+OFF] = {0, 1, 3, 5, 7, 11, 13, 17, 0, 2, 6, 10};
 
 __attribute__ ((noinline))
 int main1 (int *pib)
 {
   int i;
   int ia[N+OFF];
-  int ic[N+OFF] = {0, 1, 3, 5, 7, 11, 13, 17, 0, 2, 6, 10};
 
   for (i = OFF; i < N; i++)
     {