[gcc] GCC 4.5.0=>4.5.1

gcc/gcc/testsuite/gcc.dg/autopar/reduc-7.c

Index: gcc/gcc/testsuite/gcc.dg/autopar/reduc-7.c
diff --git a/gcc/gcc/testsuite/gcc.dg/autopar/reduc-7.c b/gcc/gcc/testsuite/gcc.dg/autopar/reduc-7.c
index 90bbc9806c7bd65a47a07a78cbe7e605367c2adf..f66069e56ca87dbe48718d5f73f89b83f117e6ce 100644
--- a/gcc/gcc/testsuite/gcc.dg/autopar/reduc-7.c
+++ b/gcc/gcc/testsuite/gcc.dg/autopar/reduc-7.c
@@ -1,9 +1,9 @@
 /* { dg-do compile } */
-/* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops-details -fdump-tree-final_cleanup" } */
+/* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops-details -fdump-tree-optimized" } */
 
 #include <stdlib.h>
 
-#define N 32
+#define N 3200
 
 extern void abort (void);
 typedef unsigned char T;
@@ -42,28 +42,36 @@ testmin (const T *c, T init, T result)
 
 int main (void)
 { 
-  static unsigned char const A[N] = {
+  static unsigned char A[N] = {
     0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07, 0x08,
     0x09, 0x0a, 0x0b, 0x0c, 0x0d, 0x0e, 0x0f, 0x10,
     0x70, 0x71, 0x72, 0x73, 0x74, 0x75, 0x76, 0x77,
     0x78, 0x79, 0x7a, 0x7b, 0x7c, 0x7d, 0x7e, 0x7f
   };
 
-  static unsigned char const B[N] = {
+  static unsigned char B[N] = {
     0x70, 0x71, 0x72, 0x73, 0x74, 0x75, 0x76, 0x77,
     0x78, 0x79, 0x7a, 0x7b, 0x7c, 0x7d, 0x7e, 0x7f,
     0x80, 0x81, 0x82, 0x83, 0x84, 0x85, 0x86, 0x87,
     0x88, 0x89, 0x8a, 0x8b, 0x8c, 0x8d, 0x8e, 0x8f
   };
 
-  static unsigned char const C[N] = {
+  static unsigned char C[N] = {
     0xff, 0xfe, 0xfd, 0xfc, 0xfb, 0xfa, 0xf9, 0xf8,
     0x09, 0x0a, 0x0b, 0x0c, 0x0d, 0x0e, 0x0f, 0x10,
     0x80, 0x81, 0x82, 0x83, 0x84, 0x85, 0x86, 0x87,
     0x70, 0x71, 0x72, 0x73, 0x74, 0x75, 0x76, 0x77,
   };
 
-  
+  int i;
+
+  for (i=32; i<N; i++)
+    {
+      A[i]= 0x01;
+      B[i]= 0x70;
+      C[i]= 0xff;
+    }
+
   testmin (A, 10, 1);
   testmin (B, 0x7f, 0x70);
   testmin (C, 0x7f, 0x09);
@@ -75,8 +83,9 @@ int main (void)
   return 0;
 }
 
+
 /* { dg-final { scan-tree-dump-times "Detected reduction" 2 "parloops" } } */
-/* { dg-final { scan-tree-dump-times "SUCCESS: may be parallelized" 2 "parloops" } } */
+/* { dg-final { scan-tree-dump-times "SUCCESS: may be parallelized" 3 "parloops" } } */
 /* { dg-final { cleanup-tree-dump "parloops" } } */
-/* { dg-final { cleanup-tree-dump "final_cleanup" } } */
+/* { dg-final { cleanup-tree-dump "optimized" } } */