Mercurial > hg > CbC > CbC_gcc
diff gcc/testsuite/gcc.dg/autopar/pr49960.c @ 131:84e7813d76e9
gcc-8.2
author | mir3636 |
---|---|
date | Thu, 25 Oct 2018 07:37:49 +0900 |
parents | 04ced10e8804 |
children |
line wrap: on
line diff
--- a/gcc/testsuite/gcc.dg/autopar/pr49960.c Fri Oct 27 22:46:09 2017 +0900 +++ b/gcc/testsuite/gcc.dg/autopar/pr49960.c Thu Oct 25 07:37:49 2018 +0900 @@ -7,7 +7,8 @@ #define MA 400 int T[MA][MB],A[MA][NA],B[MB][NA]; -void MRTRBR(int MA_1, int NA_1, int MB_1) +void __attribute__((noinline)) +MRTRBR(int MA_1, int NA_1, int MB_1) { int i,j, t,k; @@ -21,7 +22,7 @@ /* The outer most loop is not parallel because for different k's there is write-write dependency for T[i][j]. */ - /* The two inner loops don't get parallelized due to low number of + /* The innermost loop doesn't get parallelized due to low number of iterations. */ for (k = 3; k < NA_1; k++) @@ -38,7 +39,10 @@ for (i = 3; i < MA; i++) for (j = 3; j < MB; j++) - T[i][j] = (i>j?i:j); + { + __asm__ volatile ("" : : : "memory"); + T[i][j] = (i>j?i:j); + } MRTRBR (MA,NA,MB); @@ -48,7 +52,7 @@ } -/* Check that the outer most loop doesn't get parallelized (thus no loop gets parallelized) */ +/* Check that the outer most loop doesn't get parallelized. */ -/* { dg-final { scan-tree-dump-times "SUCCESS: may be parallelized" 0 "parloops2" } } */ -/* { dg-final { scan-tree-dump-times "loopfn" 0 "optimized" } } */ +/* { dg-final { scan-tree-dump-times "SUCCESS: may be parallelized" 1 "parloops2" } } */ +/* { dg-final { scan-tree-dump-times "__builtin_GOMP_parallel" 1 "optimized" } } */