[gcc] GCC 4.5.0=>4.5.1

gcc/gcc/testsuite/gcc.dg/autopar/parallelization-1.c

Index: gcc/gcc/testsuite/gcc.dg/autopar/parallelization-1.c
diff --git a/gcc/gcc/testsuite/gcc.dg/autopar/parallelization-1.c b/gcc/gcc/testsuite/gcc.dg/autopar/parallelization-1.c
index ee62ff666b8b03bc8998e7532fea2da231fbc9d3..f53be8598db12113f01a0433a4d1a9109ae55c2e 100644
--- a/gcc/gcc/testsuite/gcc.dg/autopar/parallelization-1.c
+++ b/gcc/gcc/testsuite/gcc.dg/autopar/parallelization-1.c
@@ -1,12 +1,12 @@
 /* { 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" } */
 
 void abort (void);
 
 void parloop (int N)
 {
   int i;
-  int x[10000000];
+  int x[10000990];
 
   for (i = 0; i < N; i++)
     x[i] = i + 3;
@@ -20,7 +20,7 @@ void parloop (int N)
 
 int main(void)
 {
-  parloop(10000000);
+  parloop(10000);
 
   return 0;
 }
@@ -28,6 +28,6 @@ int main(void)
 /* Check that the first loop in parloop got parallelized.  */
 
 /* { dg-final { scan-tree-dump-times "SUCCESS: may be parallelized" 1 "parloops" } } */
-/* { dg-final { scan-tree-dump-times "loopfn" 5 "final_cleanup" } } */
+/* { dg-final { scan-tree-dump-times "loopfn" 5 "optimized" } } */
 /* { dg-final { cleanup-tree-dump "parloops" } } */
-/* { dg-final { cleanup-tree-dump "final_cleanup" } } */
+/* { dg-final { cleanup-tree-dump "optimized" } } */