libgomp/testsuite/libgomp.oacc-c-c++-common/f-asyncwait-1.c

   1 /* { dg-do run } */
   2
   3 /* Based on asyncwait-1.f90.  */
   4
   5 #include <stdlib.h>
   6
   7 #define N 64
   8
   9 int
  10 main (void)
  11 {
  12   int *a, *b, *c, *d, *e;
  13
  14   a = (int*)malloc (N * sizeof (*a));
  15   b = (int*)malloc (N * sizeof (*b));
  16   c = (int*)malloc (N * sizeof (*c));
  17   d = (int*)malloc (N * sizeof (*d));
  18   e = (int*)malloc (N * sizeof (*e));
  19
  20   for (int i = 0; i < N; ++i)
  21     {
  22       a[i] = 3;
  23       b[i] = 0;
  24     }
  25
  26 #pragma acc data copy (a[0:N]) copy (b[0:N])
  27   {
  28
  29 #pragma acc parallel async
  30 #pragma acc loop
  31     for (int i = 0; i < N; ++i)
  32       b[i] = a[i];
  33
  34 #pragma acc wait
  35   }
  36
  37   for (int i = 0; i < N; ++i)
  38     {
  39       if (a[i] != 3)
  40         abort ();
  41       if (b[i] != 3)
  42         abort ();
  43     }
  44
  45   for (int i = 0; i < N; ++i)
  46     {
  47       a[i] = 2;
  48       b[i] = 0;
  49     }
  50
  51 #pragma acc data copy (a[0:N]) copy (b[0:N])
  52   {
  53 #pragma acc parallel async (1)
  54 #pragma acc loop
  55     for (int i = 0; i < N; ++i)
  56       b[i] = a[i];
  57
  58 #pragma acc wait (1)
  59   }
  60
  61   for (int i = 0; i < N; ++i)
  62     {
  63       if (a[i] != 2) abort ();
  64       if (b[i] != 2) abort ();
  65     }
  66
  67   for (int i = 0; i < N; ++i)
  68     {
  69       a[i] = 3;
  70       b[i] = 0;
  71       c[i] = 0;
  72       d[i] = 0;
  73     }
  74
  75 #pragma acc data copy (a[0:N]) copy (b[0:N]) copy (c[0:N]) copy (d[0:N])
  76   {
  77
  78 #pragma acc parallel async (1)
  79     for (int i = 0; i < N; ++i)
  80       b[i] = (a[i] * a[i] * a[i]) / a[i];
  81
  82 #pragma acc parallel async (1)
  83     for (int i = 0; i < N; ++i)
  84       c[i] = (a[i] * 4) / a[i];
  85
  86
  87 #pragma acc parallel async (1)
  88 #pragma acc loop
  89     for (int i = 0; i < N; ++i)
  90       d[i] = ((a[i] * a[i] + a[i]) / a[i]) - a[i];
  91
  92 #pragma acc wait (1)
  93   }
  94
  95   for (int i = 0; i < N; ++i)
  96     {
  97       if (a[i] != 3)
  98         abort ();
  99       if (b[i] != 9)
 100         abort ();
 101       if (c[i] != 4)
 102         abort ();
 103       if (d[i] != 1)
 104         abort ();
 105     }
 106
 107   for (int i = 0; i < N; ++i)
 108     {
 109       a[i] = 2;
 110       b[i] = 0;
 111       c[i] = 0;
 112       d[i] = 0;
 113       e[i] = 0;
 114     }
 115
 116 #pragma acc data copy (a[0:N], b[0:N], c[0:N], d[0:N], e[0:N])
 117   {
 118
 119 #pragma acc parallel async (1)
 120     for (int i = 0; i < N; ++i)
 121       b[i] = (a[i] * a[i] * a[i]) / a[i];
 122
 123 #pragma acc parallel async (1)
 124 #pragma acc loop
 125     for (int i = 0; i < N; ++i)
 126       c[i] = (a[i] * 4) / a[i];
 127
 128 #pragma acc parallel async (1)
 129 #pragma acc loop
 130     for (int i = 0; i < N; ++i)
 131       d[i] = ((a[i] * a[i] + a[i]) / a[i]) - a[i];
 132
 133
 134 #pragma acc parallel wait (1) async (1)
 135 #pragma acc loop
 136     for (int i = 0; i < N; ++i)
 137       e[i] = a[i] + b[i] + c[i] + d[i];
 138
 139 #pragma acc wait (1)
 140   }
 141
 142   for (int i = 0; i < N; ++i)
 143     {
 144       if (a[i] != 2)
 145         abort ();
 146       if (b[i] != 4)
 147         abort ();
 148       if (c[i] != 4)
 149         abort ();
 150       if (d[i] != 1)
 151         abort ();
 152       if (e[i] != 11)
 153         abort ();
 154     }
 155
 156   for (int i = 0; i < N; ++i)
 157     {
 158       a[i] = 3;
 159       b[i] = 0;
 160     }
 161
 162 #pragma acc data copy (a[0:N]) copy (b[0:N])
 163   {
 164
 165 #pragma acc kernels async
 166 #pragma acc loop
 167     for (int i = 0; i < N; ++i)
 168       b[i] = a[i];
 169
 170 #pragma acc wait
 171   }
 172
 173   for (int i = 0; i < N; ++i)
 174     {
 175       if (a[i] != 3)
 176         abort ();
 177       if (b[i] != 3)
 178         abort ();
 179     }
 180
 181   for (int i = 0; i < N; ++i)
 182     {
 183       a[i] = 2;
 184       b[i] = 0;
 185     }
 186
 187 #pragma acc data copy (a[0:N]) copy (b[0:N])
 188   {
 189 #pragma acc kernels async (1)
 190 #pragma acc loop
 191     for (int i = 0; i < N; ++i)
 192       b[i] = a[i];
 193
 194 #pragma acc wait (1)
 195   }
 196
 197   for (int i = 0; i < N; ++i)
 198     {
 199       if (a[i] != 2)
 200         abort ();
 201       if (b[i] != 2)
 202         abort ();
 203     }
 204
 205   for (int i = 0; i < N; ++i)
 206     {
 207       a[i] = 3;
 208       b[i] = 0;
 209       c[i] = 0;
 210       d[i] = 0;
 211     }
 212
 213 #pragma acc data copy (a[0:N]) copy (b[0:N]) copy (c[0:N]) copy (d[0:N])
 214   {
 215 #pragma acc kernels async (1)
 216     for (int i = 0; i < N; ++i)
 217       b[i] = (a[i] * a[i] * a[i]) / a[i];
 218
 219 #pragma acc kernels async (1)
 220     for (int i = 0; i < N; ++i)
 221       c[i] = (a[i] * 4) / a[i];
 222
 223 #pragma acc kernels async (1)
 224 #pragma acc loop
 225     for (int i = 0; i < N; ++i)
 226       d[i] = ((a[i] * a[i] + a[i]) / a[i]) - a[i];
 227
 228 #pragma acc wait (1)
 229   }
 230
 231   for (int i = 0; i < N; ++i)
 232     {
 233       if (a[i] != 3)
 234         abort ();
 235       if (b[i] != 9)
 236         abort ();
 237       if (c[i] != 4)
 238         abort ();
 239       if (d[i] != 1)
 240         abort ();
 241     }
 242
 243   for (int i = 0; i < N; ++i)
 244     {
 245       a[i] = 2;
 246       b[i] = 0;
 247       c[i] = 0;
 248       d[i] = 0;
 249       e[i] = 0;
 250     }
 251
 252 #pragma acc data copy (a[0:N], b[0:N], c[0:N], d[0:N], e[0:N])
 253   {
 254 #pragma acc kernels async (1)
 255     for (int i = 0; i < N; ++i)
 256       b[i] = (a[i] * a[i] * a[i]) / a[i];
 257
 258 #pragma acc kernels async (1)
 259 #pragma acc loop
 260     for (int i = 0; i < N; ++i)
 261       c[i] = (a[i] * 4) / a[i];
 262
 263 #pragma acc kernels async (1)
 264 #pragma acc loop
 265     for (int i = 0; i < N; ++i)
 266       d[i] = ((a[i] * a[i] + a[i]) / a[i]) - a[i];
 267
 268 #pragma acc kernels wait (1) async (1)
 269 #pragma acc loop
 270     for (int i = 0; i < N; ++i)
 271       e[i] = a[i] + b[i] + c[i] + d[i];
 272
 273 #pragma acc wait (1)
 274   }
 275
 276   for (int i = 0; i < N; ++i)
 277     {
 278       if (a[i] != 2)
 279         abort ();
 280       if (b[i] != 4)
 281         abort ();
 282       if (c[i] != 4)
 283         abort ();
 284       if (d[i] != 1)
 285         abort ();
 286       if (e[i] != 11)
 287         abort ();
 288     }
 289
 290   free (a);
 291   free (b);
 292   free (c);
 293   free (d);
 294   free (e);
 295
 296   return 0;
 297 }