]> git.ipfire.org Git - thirdparty/gcc.git/commitdiff
Add pass_parallelize_loops to pass_oacc_kernels
authorTom de Vries <tom@codesourcery.com>
Mon, 18 Jan 2016 12:52:42 +0000 (12:52 +0000)
committerTom de Vries <vries@gcc.gnu.org>
Mon, 18 Jan 2016 12:52:42 +0000 (12:52 +0000)
2016-01-18  Tom de Vries  <tom@codesourcery.com>

* passes.def: Add pass_parallelize_loops to pass_oacc_kernels.

* gcc.dg/autopar/outer-1.c: Update for new parloops instantiation.
* gcc.dg/autopar/outer-2.c: Same.
* gcc.dg/autopar/outer-3.c: Same.
* gcc.dg/autopar/outer-4.c: Same.
* gcc.dg/autopar/outer-5.c: Same.
* gcc.dg/autopar/outer-6.c: Same.
* gcc.dg/autopar/parallelization-1.c: Same.
* gcc.dg/autopar/parloops-exit-first-loop-alt-2.c: Same.
* gcc.dg/autopar/parloops-exit-first-loop-alt-3.c: Same.
* gcc.dg/autopar/parloops-exit-first-loop-alt-4.c: Same.
* gcc.dg/autopar/parloops-exit-first-loop-alt-5.c: Same.
* gcc.dg/autopar/parloops-exit-first-loop-alt-6.c: Same.
* gcc.dg/autopar/parloops-exit-first-loop-alt-7.c: Same.
* gcc.dg/autopar/parloops-exit-first-loop-alt-pr66652.c: Same.
* gcc.dg/autopar/parloops-exit-first-loop-alt.c: Same.
* gcc.dg/autopar/pr39500-1.c: Same.
* gcc.dg/autopar/pr39500-2.c: Same.
* gcc.dg/autopar/pr46193.c: Same.
* gcc.dg/autopar/pr46194.c: Same.
* gcc.dg/autopar/pr49580.c: Same.
* gcc.dg/autopar/pr49960-1.c: Same.
* gcc.dg/autopar/pr49960.c: Same.
* gcc.dg/autopar/pr68373.c: Same.
* gcc.dg/autopar/reduc-1.c: Same.
* gcc.dg/autopar/reduc-1char.c: Same.
* gcc.dg/autopar/reduc-1short.c: Same.
* gcc.dg/autopar/reduc-2.c: Same.
* gcc.dg/autopar/reduc-2char.c: Same.
* gcc.dg/autopar/reduc-2short.c: Same.
* gcc.dg/autopar/reduc-3.c: Same.
* gcc.dg/autopar/reduc-4.c: Same.
* gcc.dg/autopar/reduc-6.c: Same.
* gcc.dg/autopar/reduc-7.c: Same.
* gcc.dg/autopar/reduc-8.c: Same.
* gcc.dg/autopar/reduc-9.c: Same.
* gcc.dg/autopar/uns-outer-4.c: Same.
* gcc.dg/autopar/uns-outer-5.c: Same.
* gcc.dg/autopar/uns-outer-6.c: Same.
* gfortran.dg/parloops-exit-first-loop-alt-2.f95: Same.
* gfortran.dg/parloops-exit-first-loop-alt.f95: Same.

From-SVN: r232513

43 files changed:
gcc/ChangeLog
gcc/passes.def
gcc/testsuite/ChangeLog
gcc/testsuite/gcc.dg/autopar/outer-1.c
gcc/testsuite/gcc.dg/autopar/outer-2.c
gcc/testsuite/gcc.dg/autopar/outer-3.c
gcc/testsuite/gcc.dg/autopar/outer-4.c
gcc/testsuite/gcc.dg/autopar/outer-5.c
gcc/testsuite/gcc.dg/autopar/outer-6.c
gcc/testsuite/gcc.dg/autopar/parallelization-1.c
gcc/testsuite/gcc.dg/autopar/parloops-exit-first-loop-alt-2.c
gcc/testsuite/gcc.dg/autopar/parloops-exit-first-loop-alt-3.c
gcc/testsuite/gcc.dg/autopar/parloops-exit-first-loop-alt-4.c
gcc/testsuite/gcc.dg/autopar/parloops-exit-first-loop-alt-5.c
gcc/testsuite/gcc.dg/autopar/parloops-exit-first-loop-alt-6.c
gcc/testsuite/gcc.dg/autopar/parloops-exit-first-loop-alt-7.c
gcc/testsuite/gcc.dg/autopar/parloops-exit-first-loop-alt-pr66652.c
gcc/testsuite/gcc.dg/autopar/parloops-exit-first-loop-alt.c
gcc/testsuite/gcc.dg/autopar/pr39500-1.c
gcc/testsuite/gcc.dg/autopar/pr39500-2.c
gcc/testsuite/gcc.dg/autopar/pr46193.c
gcc/testsuite/gcc.dg/autopar/pr46194.c
gcc/testsuite/gcc.dg/autopar/pr49580.c
gcc/testsuite/gcc.dg/autopar/pr49960-1.c
gcc/testsuite/gcc.dg/autopar/pr49960.c
gcc/testsuite/gcc.dg/autopar/pr68373.c
gcc/testsuite/gcc.dg/autopar/reduc-1.c
gcc/testsuite/gcc.dg/autopar/reduc-1char.c
gcc/testsuite/gcc.dg/autopar/reduc-1short.c
gcc/testsuite/gcc.dg/autopar/reduc-2.c
gcc/testsuite/gcc.dg/autopar/reduc-2char.c
gcc/testsuite/gcc.dg/autopar/reduc-2short.c
gcc/testsuite/gcc.dg/autopar/reduc-3.c
gcc/testsuite/gcc.dg/autopar/reduc-4.c
gcc/testsuite/gcc.dg/autopar/reduc-6.c
gcc/testsuite/gcc.dg/autopar/reduc-7.c
gcc/testsuite/gcc.dg/autopar/reduc-8.c
gcc/testsuite/gcc.dg/autopar/reduc-9.c
gcc/testsuite/gcc.dg/autopar/uns-outer-4.c
gcc/testsuite/gcc.dg/autopar/uns-outer-5.c
gcc/testsuite/gcc.dg/autopar/uns-outer-6.c
gcc/testsuite/gfortran.dg/parloops-exit-first-loop-alt-2.f95
gcc/testsuite/gfortran.dg/parloops-exit-first-loop-alt.f95

index ea8645dccaffcf82043910584f0ce15b3de54796..093c9dfe7e9835c264ba02c244d44e7d1f9362f6 100644 (file)
@@ -1,3 +1,7 @@
+2016-01-18  Tom de Vries  <tom@codesourcery.com>
+
+       * passes.def: Add pass_parallelize_loops to pass_oacc_kernels.
+
 2016-01-18  Tom de Vries  <tom@codesourcery.com>
 
        * omp-low.c (set_oacc_fn_attrib): Make extern.
index d9a8c4e9cf7eac7005b960be4a8d77966c3cf218..ab6e083756259cf40e345edd147de74a90f8e0de 100644 (file)
@@ -124,7 +124,7 @@ along with GCC; see the file COPYING3.  If not see
              NEXT_PASS (pass_lim);
              NEXT_PASS (pass_dominator, false /* may_peel_loop_headers_p */);
              NEXT_PASS (pass_dce);
-             /* pass_parallelize_loops_oacc_kernels */
+             NEXT_PASS (pass_parallelize_loops, true /* oacc_kernels_p */);
              NEXT_PASS (pass_expand_omp_ssa);
              NEXT_PASS (pass_rebuild_cgraph_edges);
          POP_INSERT_PASSES ()
index ade60b7375362d8ad46df99c50ce4e4613e1acee..dc50887ef558736a577469f5773f9e9e21573aec 100644 (file)
@@ -1,3 +1,46 @@
+2016-01-18  Tom de Vries  <tom@codesourcery.com>
+
+       * gcc.dg/autopar/outer-1.c: Update for new parloops instantiation.
+       * gcc.dg/autopar/outer-2.c: Same.
+       * gcc.dg/autopar/outer-3.c: Same.
+       * gcc.dg/autopar/outer-4.c: Same.
+       * gcc.dg/autopar/outer-5.c: Same.
+       * gcc.dg/autopar/outer-6.c: Same.
+       * gcc.dg/autopar/parallelization-1.c: Same.
+       * gcc.dg/autopar/parloops-exit-first-loop-alt-2.c: Same.
+       * gcc.dg/autopar/parloops-exit-first-loop-alt-3.c: Same.
+       * gcc.dg/autopar/parloops-exit-first-loop-alt-4.c: Same.
+       * gcc.dg/autopar/parloops-exit-first-loop-alt-5.c: Same.
+       * gcc.dg/autopar/parloops-exit-first-loop-alt-6.c: Same.
+       * gcc.dg/autopar/parloops-exit-first-loop-alt-7.c: Same.
+       * gcc.dg/autopar/parloops-exit-first-loop-alt-pr66652.c: Same.
+       * gcc.dg/autopar/parloops-exit-first-loop-alt.c: Same.
+       * gcc.dg/autopar/pr39500-1.c: Same.
+       * gcc.dg/autopar/pr39500-2.c: Same.
+       * gcc.dg/autopar/pr46193.c: Same.
+       * gcc.dg/autopar/pr46194.c: Same.
+       * gcc.dg/autopar/pr49580.c: Same.
+       * gcc.dg/autopar/pr49960-1.c: Same.
+       * gcc.dg/autopar/pr49960.c: Same.
+       * gcc.dg/autopar/pr68373.c: Same.
+       * gcc.dg/autopar/reduc-1.c: Same.
+       * gcc.dg/autopar/reduc-1char.c: Same.
+       * gcc.dg/autopar/reduc-1short.c: Same.
+       * gcc.dg/autopar/reduc-2.c: Same.
+       * gcc.dg/autopar/reduc-2char.c: Same.
+       * gcc.dg/autopar/reduc-2short.c: Same.
+       * gcc.dg/autopar/reduc-3.c: Same.
+       * gcc.dg/autopar/reduc-4.c: Same.
+       * gcc.dg/autopar/reduc-6.c: Same.
+       * gcc.dg/autopar/reduc-7.c: Same.
+       * gcc.dg/autopar/reduc-8.c: Same.
+       * gcc.dg/autopar/reduc-9.c: Same.
+       * gcc.dg/autopar/uns-outer-4.c: Same.
+       * gcc.dg/autopar/uns-outer-5.c: Same.
+       * gcc.dg/autopar/uns-outer-6.c: Same.
+       * gfortran.dg/parloops-exit-first-loop-alt-2.f95: Same.
+       * gfortran.dg/parloops-exit-first-loop-alt.f95: Same.
+
 2016-01-18  Alan Lawrence  <alan.lawrence@arm.com>
 
        PR target/63679
index d36b5576c3bda661eed4538a589ce66b6fd20a7d..6607ed054baa9c46902ab3781b076a4c374fb5d8 100644 (file)
@@ -1,5 +1,5 @@
 /* { dg-do compile } */
-/* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops-details -fdump-tree-optimized" } */
+/* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops2-details -fdump-tree-optimized" } */
 
 void abort (void);
 
@@ -27,5 +27,5 @@ int main(void)
 
 
 /* Check that outer loop is parallelized.  */
-/* { dg-final { scan-tree-dump-times "parallelizing outer loop" 1 "parloops" } } */
+/* { dg-final { scan-tree-dump-times "parallelizing outer loop" 1 "parloops2" } } */
 /* { dg-final { scan-tree-dump-times "loopfn" 4 "optimized" } } */
index fd7c2be9dda1ffab930c9f3585d111b6d0ec1b6a..9533e8d84272ee60dc9df27c3a60f80c9c3f6211 100644 (file)
@@ -1,5 +1,5 @@
 /* { dg-do compile } */
-/* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops-details -fdump-tree-optimized" } */
+/* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops2-details -fdump-tree-optimized" } */
 
 void abort (void);
 
@@ -27,5 +27,5 @@ int main(void)
   return 0;
 }
 
-/* { dg-final { scan-tree-dump-times "parallelizing outer loop" 1 "parloops" } } */
+/* { dg-final { scan-tree-dump-times "parallelizing outer loop" 1 "parloops2" } } */
 /* { dg-final { scan-tree-dump-times "loopfn" 4 "optimized" } } */
index 55454a43eaa9dc0822fd7e425734e0c96f07db32..130a9743b319b0a64fb85cb347b355b12ae67aa2 100644 (file)
@@ -1,5 +1,5 @@
 /* { dg-do compile } */
-/* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops-details -fdump-tree-optimized" } */
+/* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops2-details -fdump-tree-optimized" } */
 
 void abort (void);
 
@@ -27,5 +27,5 @@ int main(void)
 
 
 /* Check that outer loop is parallelized.  */
-/* { dg-final { scan-tree-dump-times "parallelizing outer loop" 1 "parloops" } } */
+/* { dg-final { scan-tree-dump-times "parallelizing outer loop" 1 "parloops2" } } */
 /* { dg-final { scan-tree-dump-times "loopfn" 4 "optimized" } } */
index 681cf856e3fddd04c0a5b421c258181933c74477..b002b0e80dae17d44daa10b700506d59c31ee081 100644 (file)
@@ -1,5 +1,5 @@
 /* { dg-do compile } */
-/* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops-details -fdump-tree-optimized" } */
+/* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops2-details -fdump-tree-optimized" } */
 
 void abort (void);
 
@@ -25,6 +25,6 @@ parloop (int N)
 }
 
 
-/* { dg-final { scan-tree-dump-times "parallelizing inner loop" 0 "parloops" } } */
-/* { dg-final { scan-tree-dump-times "parallelizing outer loop" 1 "parloops" { xfail *-*-* } } } */
+/* { dg-final { scan-tree-dump-times "parallelizing inner loop" 0 "parloops2" } } */
+/* { dg-final { scan-tree-dump-times "parallelizing outer loop" 1 "parloops2" { xfail *-*-* } } } */
 /* { dg-final { scan-tree-dump-times "loopfn" 4 "optimized" { xfail *-*-* } } } */
index d6e0dd32836dab4081d9186d6c98671df3696e77..84b2de17043c8b265546e9c0ba825b381eee9869 100644 (file)
@@ -1,5 +1,5 @@
 /* { dg-do compile } */
-/* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops-details -fdump-tree-optimized" } */
+/* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops2-details -fdump-tree-optimized" } */
 
 void abort (void);
 
@@ -44,5 +44,5 @@ int main(void)
   return 0;
 }
 
-/* { dg-final { scan-tree-dump-times "parallelizing outer loop" 1 "parloops" { xfail *-*-* } } } */
+/* { dg-final { scan-tree-dump-times "parallelizing outer loop" 1 "parloops2" { xfail *-*-* } } } */
 /* { dg-final { scan-tree-dump-times "loopfn" 4 "optimized" { xfail *-*-* } } } */
index 726794c25ca44b9a93f0ebdc83961ec8ae75aac0..fff7bce138aaa433dd485d6f18d1286e1c368312 100644 (file)
@@ -1,5 +1,5 @@
 /* { dg-do compile } */
-/* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops-details -fdump-tree-optimized" } */
+/* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops2-details -fdump-tree-optimized" } */
 
 void abort (void);
 
@@ -44,6 +44,6 @@ int main(void)
 
 
 /* Check that outer loop is parallelized.  */
-/* { dg-final { scan-tree-dump-times "parallelizing outer loop" 1 "parloops" { xfail *-*-* } } } */
-/* { dg-final { scan-tree-dump-times "parallelizing inner loop" 0 "parloops" } } */
+/* { dg-final { scan-tree-dump-times "parallelizing outer loop" 1 "parloops2" { xfail *-*-* } } } */
+/* { dg-final { scan-tree-dump-times "parallelizing inner loop" 0 "parloops2" } } */
 /* { dg-final { scan-tree-dump-times "loopfn" 4 "optimized" { xfail *-*-* } } } */
index 222831a9dea8478c6b57fb34a1bb7463cacb87a7..1b400fbfb3376952dbfd73aa69f5779e80db41b5 100644 (file)
@@ -1,5 +1,5 @@
 /* { dg-do compile } */
-/* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops-details -fdump-tree-optimized" } */
+/* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops2-details -fdump-tree-optimized" } */
 
 void abort (void);
 
@@ -27,5 +27,5 @@ 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 "SUCCESS: may be parallelized" 1 "parloops2" } } */
 /* { dg-final { scan-tree-dump-times "loopfn" 4 "optimized" } } */
index f9884556c6e90e0f626e73c2453be689b801103c..fbd3af800086999fdd92b04bd7612924c4027112 100644 (file)
@@ -1,5 +1,5 @@
 /* { dg-do compile } */
-/* { dg-options "-O2 -ftree-parallelize-loops=2 -fdump-tree-parloops-details" } */
+/* { dg-options "-O2 -ftree-parallelize-loops=2 -fdump-tree-parloops2-details" } */
 
 /* Constant bound, vector addition.  */
 
@@ -18,4 +18,4 @@ f (void)
       c[i] = a[i] + b[i];
 }
 
-/* { dg-final { scan-tree-dump-times "alternative exit-first loop transform succeeded" 1 "parloops" } } */
+/* { dg-final { scan-tree-dump-times "alternative exit-first loop transform succeeded" 1 "parloops2" } } */
index 8bba35238a86de0726163bab3f15d06312501fde..f7a7323bc953d566864d553fb800348102631d1c 100644 (file)
@@ -1,5 +1,5 @@
 /* { dg-do compile } */
-/* { dg-options "-O2 -ftree-parallelize-loops=2 -fdump-tree-parloops-details" } */
+/* { dg-options "-O2 -ftree-parallelize-loops=2 -fdump-tree-parloops2-details" } */
 
 /* Variable bound, reduction.  */
 
@@ -17,4 +17,4 @@ f (unsigned int n, unsigned int *__restrict__ a)
   return sum;
 }
 
-/* { dg-final { scan-tree-dump-times "alternative exit-first loop transform succeeded" 1 "parloops" } } */
+/* { dg-final { scan-tree-dump-times "alternative exit-first loop transform succeeded" 1 "parloops2" } } */
index ccb07bcc49498b253f5a92ff4ad43976aea3ab0c..6b1a776cae1a328e61ecb48eec025497f56ec70f 100644 (file)
@@ -1,5 +1,5 @@
 /* { dg-do compile } */
-/* { dg-options "-O2 -ftree-parallelize-loops=2 -fdump-tree-parloops-details" } */
+/* { dg-options "-O2 -ftree-parallelize-loops=2 -fdump-tree-parloops2-details" } */
 
 /* Constant bound, reduction.  */
 
@@ -19,4 +19,4 @@ f (void)
   return sum;
 }
 
-/* { dg-final { scan-tree-dump-times "alternative exit-first loop transform succeeded" 1 "parloops" } } */
+/* { dg-final { scan-tree-dump-times "alternative exit-first loop transform succeeded" 1 "parloops2" } } */
index 68367b157104c9d1fb3b1df4a015125c3a40d380..f3f8a3b45ca4de55e1d99409d8f67d1c1be30a45 100644 (file)
@@ -1,5 +1,5 @@
 /* { dg-do compile } */
-/* { dg-options "-O2 -ftree-parallelize-loops=2 -fdump-tree-parloops-details" } */
+/* { dg-options "-O2 -ftree-parallelize-loops=2 -fdump-tree-parloops2-details" } */
 
 /* Variable bound, vector addition, unsigned loop counter, unsigned bound.  */
 
@@ -13,4 +13,4 @@ f (unsigned int n, unsigned int *__restrict__ a, unsigned int *__restrict__ b,
     c[i] = a[i] + b[i];
 }
 
-/* { dg-final { scan-tree-dump-times "alternative exit-first loop transform succeeded" 1 "parloops" } } */
+/* { dg-final { scan-tree-dump-times "alternative exit-first loop transform succeeded" 1 "parloops2" } } */
index 80d15507d6dfdd6f7a16cf3cb6f9bccae9fe3205..186eab32e9bd0f6c17f98b654af363ffcbf19dac 100644 (file)
@@ -1,5 +1,5 @@
 /* { dg-do compile } */
-/* { dg-options "-O2 -ftree-parallelize-loops=2 -fdump-tree-parloops-details" } */
+/* { dg-options "-O2 -ftree-parallelize-loops=2 -fdump-tree-parloops2-details" } */
 
 /* Variable bound, vector addition, unsigned loop counter, signed bound.  */
 
@@ -13,4 +13,4 @@ f (int n, unsigned int *__restrict__ a, unsigned int *__restrict__ b,
     c[i] = a[i] + b[i];
 }
 
-/* { dg-final { scan-tree-dump-times "alternative exit-first loop transform succeeded" 1 "parloops" } } */
+/* { dg-final { scan-tree-dump-times "alternative exit-first loop transform succeeded" 1 "parloops2" } } */
index 8ecff0c07e8d78ea512fd39e76f1ce9b07c58e1b..46c5ac4fd483c8180dd94abee9086c7afdf8f5f7 100644 (file)
@@ -1,5 +1,5 @@
 /* { dg-do compile } */
-/* { dg-options "-O2 -ftree-parallelize-loops=2 -fdump-tree-parloops-details" } */
+/* { dg-options "-O2 -ftree-parallelize-loops=2 -fdump-tree-parloops2-details" } */
 
 /* Variable bound, vector addition, signed loop counter, signed bound.  */
 
@@ -13,4 +13,4 @@ f (int n, unsigned int *__restrict__ a, unsigned int *__restrict__ b,
     c[i] = a[i] + b[i];
 }
 
-/* { dg-final { scan-tree-dump-times "alternative exit-first loop transform succeeded" 1 "parloops" } } */
+/* { dg-final { scan-tree-dump-times "alternative exit-first loop transform succeeded" 1 "parloops2" } } */
index b320628bb64576ba85e5494e5f52c0246d1b1615..a02e183902b0b36c18a3f0f3ede9ec4dff1eb5df 100644 (file)
@@ -1,5 +1,5 @@
 /* { dg-do compile } */
-/* { dg-options "-O2 -ftree-parallelize-loops=2 -fdump-tree-parloops-details" } */
+/* { dg-options "-O2 -ftree-parallelize-loops=2 -fdump-tree-parloops2-details" } */
 
 #include <stdio.h>
 #include <stdlib.h>
@@ -21,5 +21,5 @@ f (unsigned int n, unsigned int sum)
   return sum;
 }
 
-/* { dg-final { scan-tree-dump-times "parallelizing inner loop" 1 "parloops" } } */
-/* { dg-final { scan-tree-dump-times "alternative exit-first loop transform succeeded" 0 "parloops" } } */
+/* { dg-final { scan-tree-dump-times "parallelizing inner loop" 1 "parloops2" } } */
+/* { dg-final { scan-tree-dump-times "alternative exit-first loop transform succeeded" 0 "parloops2" } } */
index c67d262d34ba0cbd3536b84d795e69b54dc19070..dce9c92dd570d8175adbdf801169f3e702849e65 100644 (file)
@@ -1,5 +1,5 @@
 /* { dg-do compile } */
-/* { dg-options "-O2 -ftree-parallelize-loops=2 -fdump-tree-parloops-details" } */
+/* { dg-options "-O2 -ftree-parallelize-loops=2 -fdump-tree-parloops2-details" } */
 
 /* Variable bound, vector addition, signed loop counter, unsigned bound.  */
 
@@ -13,5 +13,5 @@ f (unsigned int n, unsigned int *__restrict__ a, unsigned int *__restrict__ b,
     c[i] = a[i] + b[i];
 }
 
-/* { dg-final { scan-tree-dump-times "alternative exit-first loop transform succeeded" 1 "parloops" } } */
+/* { dg-final { scan-tree-dump-times "alternative exit-first loop transform succeeded" 1 "parloops2" } } */
 
index 33b93b37aba7678335fd6dda54674638f1c7d9c2..28f47897b37124240343fbb98a576b873bd10030 100644 (file)
@@ -1,7 +1,7 @@
 /* pr39500: autopar fails to parallel */
 /* origin: nemokingdom@gmail.com(LiFeng) */
 /* { dg-do compile } */
-/* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops-details" } */
+/* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops2-details" } */
 
 void abort (void);
 
@@ -24,4 +24,4 @@ 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 "SUCCESS: may be parallelized" 1 "parloops2" } } */
index 12fa909e07f45224fef928cb1fc8257ebc0a7e7c..98363e4923a0c033028638d53a001167a892154b 100644 (file)
@@ -1,7 +1,7 @@
 /* pr39500: autopar fails to parallel */
 /* origin: nemokingdom@gmail.com(LiFeng) */
 /* { dg-do compile } */
-/* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops-details" } */
+/* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops2-details" } */
 
 int main (void)
 {
@@ -16,4 +16,4 @@ int main (void)
 
 /* This loop cannot be parallelized due to a dependence.  */
 
-/* { dg-final { scan-tree-dump-times "SUCCESS: may be parallelized" 0 "parloops" } } */
+/* { dg-final { scan-tree-dump-times "SUCCESS: may be parallelized" 0 "parloops2" } } */
index 544a5dabcec3306de7b8d05e469c442d26b4c775..36f89c1738528ab7b33aad4b7e4604e190acd767 100644 (file)
@@ -1,5 +1,5 @@
 /* { dg-do compile } */
-/* { dg-options "-O2 -ftree-parallelize-loops=2 -fdump-tree-parloops-details" } */
+/* { dg-options "-O2 -ftree-parallelize-loops=2 -fdump-tree-parloops2-details" } */
 
 extern void abort (void);
 
@@ -35,4 +35,4 @@ foo2 (int count, char **list)
   return maxaddr;
 }
 
-/* { dg-final { scan-tree-dump-times "parallelizing inner loop" 2 "parloops" } } */
+/* { dg-final { scan-tree-dump-times "parallelizing inner loop" 2 "parloops2" } } */
index 3daf2ab2d3a8e26d7435c04b2149427fa714f7a7..2a184a01ac3dc2f46c97f760046d0ce392e1d483 100644 (file)
@@ -1,6 +1,6 @@
 /* PR tree-optimization/46194 */
 /* { dg-do compile } */
-/* { dg-options "-O -ftree-parallelize-loops=2 -fdump-tree-parloops-details" } */
+/* { dg-options "-O -ftree-parallelize-loops=2 -fdump-tree-parloops2-details" } */
 
 #define N 1000
 int a[N];
@@ -20,4 +20,4 @@ int foo (void)
 
 /* This loop cannot be parallelized due to a dependence.  */
 
-/* { dg-final { scan-tree-dump-times "SUCCESS: may be parallelized" 0 "parloops" } } */
+/* { dg-final { scan-tree-dump-times "SUCCESS: may be parallelized" 0 "parloops2" } } */
index ddb622f6e0d83c29262920f24fb582f773baf3dd..e2c8be8360ae379ad5f987c86a2fd7ea070ec740 100644 (file)
@@ -1,6 +1,6 @@
 /* PR debug/49580 */
 /* { dg-do compile } */
-/* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops-details" } */
+/* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops2-details" } */
 
 #include <stdarg.h>
 #include <stdlib.h>
@@ -33,5 +33,5 @@ int main (void)
 }
 
 
-/* { dg-final { scan-tree-dump-times "SUCCESS: may be parallelized" 1 "parloops" } } */
+/* { dg-final { scan-tree-dump-times "SUCCESS: may be parallelized" 1 "parloops2" } } */
 
index 34d55529e2ba84d3a6cd1c0caf44739127ff6314..bd65c22c3091d0fbd21654ad0bb158c68bcae8b6 100644 (file)
@@ -1,5 +1,5 @@
 /* { dg-do compile } */
-/* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops-details -fdump-tree-optimized" } */
+/* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops2-details -fdump-tree-optimized" } */
 
 #include <stdlib.h>
 #include <stdio.h>
@@ -30,5 +30,5 @@ int main()
 }
 /* Check that no loop gets parallelized.  */
 
-/* { dg-final { scan-tree-dump-times "SUCCESS: may be parallelized" 0 "parloops" } } */
+/* { dg-final { scan-tree-dump-times "SUCCESS: may be parallelized" 0 "parloops2" } } */
 /* { dg-final { scan-tree-dump-times "loopfn" 0 "optimized" } } */
index c41327831982072a393ff63f285332f38b88b9a2..e3fb04d99c19f4d8c2a20c469855c46e8cf1bce6 100644 (file)
@@ -1,5 +1,5 @@
 /* { dg-do compile } */
-/* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops-details -fdump-tree-optimized -fno-partial-inlining" } */
+/* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops2-details -fdump-tree-optimized -fno-partial-inlining" } */
 
 #include <stdio.h>
 #define MB 100
@@ -50,5 +50,5 @@ void main ()
 
 /* Check that the outer most loop doesn't get parallelized (thus no loop gets parallelized)  */
 
-/* { dg-final { scan-tree-dump-times "SUCCESS: may be parallelized" 0 "parloops" } } */
+/* { dg-final { scan-tree-dump-times "SUCCESS: may be parallelized" 0 "parloops2" } } */
 /* { dg-final { scan-tree-dump-times "loopfn" 0 "optimized" } } */
index 8e0f8a5160e514a89fe0d4c021dfae7bfc05444a..ecac6138637511de2315a4d62b7b2970f873d2de 100644 (file)
@@ -1,5 +1,5 @@
 /* { dg-do compile } */
-/* { dg-options "-O2 -ftree-parallelize-loops=2 -fdump-tree-parloops-details" } */
+/* { dg-options "-O2 -ftree-parallelize-loops=2 -fdump-tree-parloops2-details" } */
 
 unsigned int
 foo (int *a, unsigned int n)
@@ -11,4 +11,4 @@ foo (int *a, unsigned int n)
   return i;
 }
 
-/* { dg-final { scan-tree-dump-times "SUCCESS: may be parallelized" 1 "parloops" } } */
+/* { dg-final { scan-tree-dump-times "SUCCESS: may be parallelized" 1 "parloops2" } } */
index 6e9a280145459d17fc8f4a3b929dddad15a1266c..1e5f923376fea7237f92768eb11b5d35a5c2e921 100644 (file)
@@ -1,5 +1,5 @@
 /* { dg-do compile } */
-/* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops-details -fdump-tree-optimized" } */
+/* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops2-details -fdump-tree-optimized" } */
 
 #include <stdarg.h>
 #include <stdlib.h>
@@ -66,6 +66,6 @@ int main (void)
 }
 
 
-/* { dg-final { scan-tree-dump-times "Detected reduction" 3 "parloops" } } */
-/* { dg-final { scan-tree-dump-times "SUCCESS: may be parallelized" 4 "parloops" } } */
+/* { dg-final { scan-tree-dump-times "Detected reduction" 3 "parloops2" } } */
+/* { dg-final { scan-tree-dump-times "SUCCESS: may be parallelized" 4 "parloops2" } } */
 
index 48ead887a9d86d077e070cdc912dc370900445b7..0d611b96eae74756cc3a909738f893e38de6e6ae 100644 (file)
@@ -1,5 +1,5 @@
 /* { dg-do compile } */
-/* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops-details -fdump-tree-optimized" } */
+/* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops2-details -fdump-tree-optimized" } */
 
 #include <stdarg.h>
 #include <stdlib.h>
@@ -60,6 +60,6 @@ int main (void)
 }
 
 
-/* { dg-final { scan-tree-dump-times "Detected reduction" 3 "parloops" } } */
-/* { dg-final { scan-tree-dump-times "SUCCESS: may be parallelized" 4 "parloops" } } */
+/* { dg-final { scan-tree-dump-times "Detected reduction" 3 "parloops2" } } */
+/* { dg-final { scan-tree-dump-times "SUCCESS: may be parallelized" 4 "parloops2" } } */
 
index f3f547cf7e948aed9179f4748f91a6608b533771..92654e345337e3e7fd0ac0eacf64e13b218c12c5 100644 (file)
@@ -1,5 +1,5 @@
 /* { dg-do compile } */
-/* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops-details -fdump-tree-optimized" } */
+/* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops2-details -fdump-tree-optimized" } */
 
 #include <stdarg.h>
 #include <stdlib.h>
@@ -59,6 +59,6 @@ int main (void)
   return 0;
 }
 
-/* { dg-final { scan-tree-dump-times "Detected reduction" 3 "parloops" } } */
-/* { dg-final { scan-tree-dump-times "SUCCESS: may be parallelized" 4 "parloops" } } */
+/* { dg-final { scan-tree-dump-times "Detected reduction" 3 "parloops2" } } */
+/* { dg-final { scan-tree-dump-times "SUCCESS: may be parallelized" 4 "parloops2" } } */
 
index 2f4883d08e45529d4ace18b34730f6c22eb945d3..b94b2d4eabccc02ece7a3eeae34f0b0df37d9920 100644 (file)
@@ -1,5 +1,5 @@
 /* { dg-do compile } */
-/* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops-details -fdump-tree-optimized" } */
+/* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops2-details -fdump-tree-optimized" } */
 
 #include <stdarg.h>
 #include <stdlib.h>
@@ -63,6 +63,6 @@ int main (void)
   return 0;
 }
 
-/* { dg-final { scan-tree-dump-times "Detected reduction" 3 "parloops" { xfail *-*-* } } } */
-/* { dg-final { scan-tree-dump-times "SUCCESS: may be parallelized" 4 "parloops" { xfail *-*-* } } } */
+/* { dg-final { scan-tree-dump-times "Detected reduction" 3 "parloops2" { xfail *-*-* } } } */
+/* { dg-final { scan-tree-dump-times "SUCCESS: may be parallelized" 4 "parloops2" { xfail *-*-* } } } */
 
index a2dad4465119d6d67ad77b7a3d919d95bfb54771..d48d9f9103985028f992d7f077d38a7bf6376796 100644 (file)
@@ -1,5 +1,5 @@
 /* { dg-do compile } */
-/* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops-details -fdump-tree-optimized" } */
+/* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops2-details -fdump-tree-optimized" } */
 
 #include <stdarg.h>
 #include <stdlib.h>
@@ -61,10 +61,10 @@ int main (void)
 }
 
 
-/* { dg-final { scan-tree-dump-times "Detected reduction" 2 "parloops" } } */
-/* { dg-final { scan-tree-dump-times "Detected reduction" 3 "parloops" { xfail *-*-* } } } */
+/* { dg-final { scan-tree-dump-times "Detected reduction" 2 "parloops2" } } */
+/* { dg-final { scan-tree-dump-times "Detected reduction" 3 "parloops2" { xfail *-*-* } } } */
 
-/* { dg-final { scan-tree-dump-times "SUCCESS: may be parallelized" 2 "parloops" } } */
-/* { dg-final { scan-tree-dump-times "SUCCESS: may be parallelized" 3 "parloops" { xfail *-*-* } } } */
+/* { dg-final { scan-tree-dump-times "SUCCESS: may be parallelized" 2 "parloops2" } } */
+/* { dg-final { scan-tree-dump-times "SUCCESS: may be parallelized" 3 "parloops2" { xfail *-*-* } } } */
 
 
index a50e14f0cb4be37289361ccf7ac3336c902fde37..f5466f0b5dddce77c7f6df448c54cfacd948967b 100644 (file)
@@ -1,5 +1,5 @@
 /* { dg-do compile } */
-/* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops-details -fdump-tree-optimized" } */
+/* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops2-details -fdump-tree-optimized" } */
 
 #include <stdarg.h>
 #include <stdlib.h>
@@ -59,8 +59,8 @@ int main (void)
   return 0;
 }
 
-/* { dg-final { scan-tree-dump-times "Detected reduction" 2 "parloops" } } */
-/* { dg-final { scan-tree-dump-times "Detected reduction" 3 "parloops" { xfail *-*-* } } } */
+/* { dg-final { scan-tree-dump-times "Detected reduction" 2 "parloops2" } } */
+/* { dg-final { scan-tree-dump-times "Detected reduction" 3 "parloops2" { xfail *-*-* } } } */
 
-/* { dg-final { scan-tree-dump-times "SUCCESS: may be parallelized" 2 "parloops" } } */
-/* { dg-final { scan-tree-dump-times "SUCCESS: may be parallelized" 3 "parloops" { xfail *-*-* } } } */
+/* { dg-final { scan-tree-dump-times "SUCCESS: may be parallelized" 2 "parloops2" } } */
+/* { dg-final { scan-tree-dump-times "SUCCESS: may be parallelized" 3 "parloops2" { xfail *-*-* } } } */
index 0d4baeff185c08c24defd22081dc1509fc4a7741..9ed1c908a9d2a79287494a12feffa98de5b39d6a 100644 (file)
@@ -1,5 +1,5 @@
 /* { dg-do compile } */
-/* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops-details -fdump-tree-optimized" } */
+/* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops2-details -fdump-tree-optimized" } */
 
 #include <stdarg.h>
 #include <stdlib.h>
@@ -50,6 +50,6 @@ int main (void)
 }
 
 
-/* { dg-final { scan-tree-dump-times "Detected reduction" 1 "parloops" } } */
-/* { dg-final { scan-tree-dump-times "SUCCESS: may be parallelized" 2 "parloops" } } */
+/* { dg-final { scan-tree-dump-times "Detected reduction" 1 "parloops2" } } */
+/* { dg-final { scan-tree-dump-times "SUCCESS: may be parallelized" 2 "parloops2" } } */
 
index 80b15e2852d9a1c027531f6023025693207862a5..fb331ccc6fbbaeb8a42fe76df1d74753bfee1953 100644 (file)
@@ -1,4 +1,4 @@
 /* { dg-do compile } */
-/* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops-details -fdump-tree-optimized --param parloops-chunk-size=100" } */
+/* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops2-details -fdump-tree-optimized --param parloops-chunk-size=100" } */
 
 #include "reduc-3.c"
index 91f679eed04e1139e0927b8972c7af68f257fc0d..22a2e6255f46224a8532272186b2365a167aa443 100644 (file)
@@ -1,5 +1,5 @@
 /* { dg-do compile } */
-/* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops-details -fdump-tree-optimized" } */
+/* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops2-details -fdump-tree-optimized" } */
 
 #include <stdarg.h>
 #include <stdlib.h>
@@ -56,6 +56,6 @@ int main (void)
 
 
 /* need -ffast-math to  parallelize these loops.  */
-/* { dg-final { scan-tree-dump-times "Detected reduction" 0 "parloops" } } */
-/* { dg-final { scan-tree-dump-times "SUCCESS: may be parallelized" 1 "parloops" } } */
-/* { dg-final { scan-tree-dump-times "FAILED: it is not a part of reduction" 3 "parloops" } } */
+/* { dg-final { scan-tree-dump-times "Detected reduction" 0 "parloops2" } } */
+/* { dg-final { scan-tree-dump-times "SUCCESS: may be parallelized" 1 "parloops2" } } */
+/* { dg-final { scan-tree-dump-times "FAILED: it is not a part of reduction" 3 "parloops2" } } */
index 77b99e152ec5a18a3a1165f4e8249b8f71b337e1..efae736db1d020fa6080748c509d65169906f9cb 100644 (file)
@@ -1,5 +1,5 @@
 /* { dg-do compile } */
-/* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops-details -fdump-tree-optimized" } */
+/* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops2-details -fdump-tree-optimized" } */
 
 #include <stdlib.h>
 
@@ -84,6 +84,6 @@ int main (void)
 }
 
 
-/* { dg-final { scan-tree-dump-times "Detected reduction" 2 "parloops" } } */
-/* { dg-final { scan-tree-dump-times "SUCCESS: may be parallelized" 3 "parloops" } } */
+/* { dg-final { scan-tree-dump-times "Detected reduction" 2 "parloops2" } } */
+/* { dg-final { scan-tree-dump-times "SUCCESS: may be parallelized" 3 "parloops2" } } */
 
index 18ba03d56322ac103dfdedf9a2b68d5cafe3c824..b3c0cda55c4fa793a184e13a5e350948e161a58c 100644 (file)
@@ -1,5 +1,5 @@
 /* { dg-do compile } */
-/* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops-details -fdump-tree-optimized" } */
+/* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops2-details -fdump-tree-optimized" } */
 
 #include <stdlib.h>
 
@@ -85,5 +85,5 @@ main (void)
 }
 
 
-/* { 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 "Detected reduction" 2 "parloops2" } } */
+/* { dg-final { scan-tree-dump-times "SUCCESS: may be parallelized" 2 "parloops2" } } */
index 90f4db2861f1a87cc467767ba5cdcbd58b9475fc..99f9298f19368a37e38347fa9ad06e6aeb857e9a 100644 (file)
@@ -1,5 +1,5 @@
 /* { dg-do compile } */
-/* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops-details -fdump-tree-optimized" } */
+/* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops2-details -fdump-tree-optimized" } */
 
 #include <stdlib.h>
 
@@ -84,5 +84,5 @@ int main (void)
 }
 
 
-/* { dg-final { scan-tree-dump-times "Detected reduction" 2 "parloops" } } */
-/* { dg-final { scan-tree-dump-times "SUCCESS: may be parallelized" 3 "parloops" } } */
+/* { dg-final { scan-tree-dump-times "Detected reduction" 2 "parloops2" } } */
+/* { dg-final { scan-tree-dump-times "SUCCESS: may be parallelized" 3 "parloops2" } } */
index 5eb67ea74fc1ccedabd64900324bfb2bd433a8e6..ee4bb82cf9d07a6dd21a92a5f27127ab004aed7d 100644 (file)
@@ -1,5 +1,5 @@
 /* { dg-do compile } */
-/* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops-details -fdump-tree-optimized" } */
+/* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops2-details -fdump-tree-optimized" } */
 
 void abort (void);
 
@@ -21,5 +21,5 @@ parloop (int N)
   g_sum = sum;
 }
 
-/* { dg-final { scan-tree-dump-times "parallelizing outer loop" 1 "parloops" } } */
+/* { dg-final { scan-tree-dump-times "parallelizing outer loop" 1 "parloops2" } } */
 /* { dg-final { scan-tree-dump-times "loopfn" 4 "optimized" } } */
index a929e5dc727b0485a293be299996388d73c3a3a7..2d93a2daf514346347f798fa9759a3087923b9fb 100644 (file)
@@ -1,5 +1,5 @@
 /* { dg-do compile } */
-/* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops-details -fdump-tree-optimized" } */
+/* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops2-details -fdump-tree-optimized" } */
 
 void abort (void);
 
@@ -45,5 +45,5 @@ main (void)
   return 0;
 }
 
-/* { dg-final { scan-tree-dump-times "parallelizing outer loop" 1 "parloops" { xfail *-*-* } } } */
+/* { dg-final { scan-tree-dump-times "parallelizing outer loop" 1 "parloops2" { xfail *-*-* } } } */
 /* { dg-final { scan-tree-dump-times "loopfn" 4 "optimized" } } */
index 5c745f80e93a3e35c950138b6351311ad3d62a1c..dc2870be8d470d17db0d26b798d2bf4163efc832 100644 (file)
@@ -1,5 +1,5 @@
 /* { dg-do compile } */
-/* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops-details -fdump-tree-optimized" } */
+/* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops2-details -fdump-tree-optimized" } */
 
 void abort (void);
 
@@ -46,6 +46,6 @@ main (void)
 
 
 /* Check that outer loop is parallelized.  */
-/* { dg-final { scan-tree-dump-times "parallelizing outer loop" 1 "parloops" } } */
-/* { dg-final { scan-tree-dump-times "parallelizing inner loop" 0 "parloops" } } */
+/* { dg-final { scan-tree-dump-times "parallelizing outer loop" 1 "parloops2" } } */
+/* { dg-final { scan-tree-dump-times "parallelizing inner loop" 0 "parloops2" } } */
 /* { dg-final { scan-tree-dump-times "loopfn" 4 "optimized" } } */
index 52434f2a9e35ddc9d0fd6c4e71e40584066ba44b..236480cb6c649a3cddd8307901f9fc606ee510ba 100644 (file)
@@ -1,7 +1,7 @@
 ! { dg-additional-options "-O2" }
 ! { dg-require-effective-target pthread }
 ! { dg-additional-options "-ftree-parallelize-loops=2" }
-! { dg-additional-options "-fdump-tree-parloops-details" }
+! { dg-additional-options "-fdump-tree-parloops2-details" }
 
 ! Constant bound, vector addition.
 
@@ -16,4 +16,4 @@ subroutine foo ()
   end do
 end subroutine foo
 
-! { dg-final { scan-tree-dump-times "alternative exit-first loop transform succeeded" 1 "parloops" } }
+! { dg-final { scan-tree-dump-times "alternative exit-first loop transform succeeded" 1 "parloops2" } }
index 1eb9dfd801e0fcfb402f055158dd090ab49d9ab5..a33e11db017703aeda962b43a4820e9a0903ec8d 100644 (file)
@@ -1,7 +1,7 @@
 ! { dg-additional-options "-O2" }
 ! { dg-require-effective-target pthread }
 ! { dg-additional-options "-ftree-parallelize-loops=2" }
-! { dg-additional-options "-fdump-tree-parloops-details" }
+! { dg-additional-options "-fdump-tree-parloops2-details" }
 
 ! Variable bound, vector addition.
 
@@ -17,5 +17,5 @@ subroutine foo (nr)
   end do
 end subroutine foo
 
-! { dg-final { scan-tree-dump-times "alternative exit-first loop transform succeeded" 1 "parloops" } }
+! { dg-final { scan-tree-dump-times "alternative exit-first loop transform succeeded" 1 "parloops2" } }