Mercurial > hg > CbC > CbC_gcc
view gcc/testsuite/c-c++-common/goacc/kernels-loop-data.c @ 131:84e7813d76e9
gcc-8.2
author | mir3636 |
---|---|
date | Thu, 25 Oct 2018 07:37:49 +0900 |
parents | |
children |
line wrap: on
line source
/* { dg-additional-options "-O2" } */ /* { dg-additional-options "-fdump-tree-parloops1-all" } */ /* { dg-additional-options "-fdump-tree-optimized" } */ #include <stdlib.h> #define N (1024 * 512) #define COUNTERTYPE unsigned int int main (void) { unsigned int *__restrict a; unsigned int *__restrict b; unsigned int *__restrict c; a = (unsigned int *)malloc (N * sizeof (unsigned int)); b = (unsigned int *)malloc (N * sizeof (unsigned int)); c = (unsigned int *)malloc (N * sizeof (unsigned int)); #pragma acc data copyout (a[0:N], b[0:N], c[0:N]) { #pragma acc kernels present (a[0:N]) { for (COUNTERTYPE i = 0; i < N; i++) a[i] = i * 2; } #pragma acc kernels present (b[0:N]) { for (COUNTERTYPE i = 0; i < N; i++) b[i] = i * 4; } #pragma acc kernels present (a[0:N], b[0:N], c[0:N]) { for (COUNTERTYPE ii = 0; ii < N; ii++) c[ii] = a[ii] + b[ii]; } } for (COUNTERTYPE i = 0; i < N; i++) if (c[i] != a[i] + b[i]) abort (); free (a); free (b); free (c); return 0; } /* Check that only three loops are analyzed, and that all can be parallelized. */ /* { dg-final { scan-tree-dump-times "SUCCESS: may be parallelized" 3 "parloops1" } } */ /* { dg-final { scan-tree-dump-times "(?n)__attribute__\\(\\(oacc kernels parallelized, oacc function \\(, , \\), oacc kernels, omp target entrypoint\\)\\)" 3 "parloops1" } } */ /* { dg-final { scan-tree-dump-not "FAILED:" "parloops1" } } */ /* Check that the loop has been split off into a function. */ /* { dg-final { scan-tree-dump-times "(?n);; Function .*main._omp_fn.0" 1 "optimized" } } */ /* { dg-final { scan-tree-dump-times "(?n);; Function .*main._omp_fn.1" 1 "optimized" } } */ /* { dg-final { scan-tree-dump-times "(?n);; Function .*main._omp_fn.2" 1 "optimized" } } */