libgomp/testsuite/libgomp.c/taskloop-2.c

   1 /* { dg-do run } */
   2 /* { dg-options "-O2 -std=c99" } */
   3 /* { dg-additional-options "-msse2" { target sse2_runtime } } */
   4 /* { dg-additional-options "-mavx" { target avx_runtime } } */
   5
   6 int u[1024], v[1024], w[1024], m;
   7
   8 __attribute__((noinline, noclone)) void
   9 f1 (long a, long b)
  10 {
  11   #pragma omp taskloop simd default(none) shared(u, v, w) nogroup
  12   for (long d = a; d < b; d++)
  13     u[d] = v[d] + w[d];
  14 }
  15
  16 __attribute__((noinline, noclone)) int
  17 f2 (long a, long b, long c)
  18 {
  19   int d, e;
  20   #pragma omp taskloop simd default(none) shared(u, v, w) linear(d:1) linear(c:5) lastprivate(e)
  21   for (d = a; d < b; d++)
  22     {
  23       u[d] = v[d] + w[d];
  24       c = c + 5;
  25       e = c + 9;
  26     }
  27   return d + c + e;
  28 }
  29
  30 __attribute__((noinline, noclone)) int
  31 f3 (long a, long b)
  32 {
  33   int d;
  34   #pragma omp taskloop simd default(none) shared(u, v, w)
  35   for (d = a; d < b; d++)
  36     {
  37       int *p = &d;
  38       u[d] = v[d] + w[d];
  39     }
  40   return d;
  41 }
  42
  43 __attribute__((noinline, noclone)) int
  44 f4 (long a, long b, long c, long d)
  45 {
  46   int e, f, g;
  47   #pragma omp taskloop simd default(none) shared(u, v, w) collapse(2) lastprivate(g)
  48   for (e = a; e < b; e++)
  49     for (f = c; f < d; f++)
  50       {
  51         int *p = &e;
  52         int *q = &f;
  53         int r = 32 * e + f;
  54         u[r] = v[r] + w[r];
  55         g = r;
  56       }
  57   return e + f + g;
  58 }
  59
  60 __attribute__((noinline, noclone)) int
  61 f5 (long a, long b, long c, long d)
  62 {
  63   int e, f;
  64   #pragma omp taskloop simd default(none) shared(u, v, w) collapse(2)
  65   for (e = a; e < b; e++)
  66     for (f = c; f < d; f++)
  67       {
  68         int r = 32 * e + f;
  69         u[r] = v[r] + w[r];
  70       }
  71   return e + f;
  72 }
  73
  74 int
  75 main ()
  76 {
  77   int i;
  78   for (i = 0; i < 1024; i++)
  79     {
  80       v[i] = i;
  81       w[i] = i + 1;
  82     }
  83   #pragma omp parallel
  84     #pragma omp single
  85       f1 (0, 1024);
  86   for (i = 0; i < 1024; i++)
  87     if (u[i] != 2 * i + 1)
  88       __builtin_abort ();
  89     else
  90       {
  91         v[i] = 1024 - i;
  92         w[i] = 512 - i;
  93       }
  94   #pragma omp parallel
  95     #pragma omp single
  96       m = f2 (2, 1022, 17);
  97   for (i = 0; i < 1024; i++)
  98     if ((i < 2 || i >= 1022) ? u[i] != 2 * i + 1 : u[i] != 1536 - 2 * i)
  99       __builtin_abort ();
 100     else
 101       {
 102         v[i] = i;
 103         w[i] = i + 1;
 104       }
 105   if (m != 1022 + 2 * (1020 * 5 + 17) + 9)
 106     __builtin_abort ();
 107   #pragma omp parallel
 108     #pragma omp single
 109       m = f3 (0, 1024);
 110   for (i = 0; i < 1024; i++)
 111     if (u[i] != 2 * i + 1)
 112       __builtin_abort ();
 113     else
 114       {
 115         v[i] = 1024 - i;
 116         w[i] = 512 - i;
 117       }
 118   if (m != 1024)
 119     __builtin_abort ();
 120   #pragma omp parallel
 121     #pragma omp single
 122       m = f4 (0, 32, 0, 32);
 123   for (i = 0; i < 1024; i++)
 124     if (u[i] != 1536 - 2 * i)
 125       __builtin_abort ();
 126     else
 127       {
 128         v[i] = i;
 129         w[i] = i + 1;
 130       }
 131   if (m != 32 + 32 + 1023)
 132     __builtin_abort ();
 133   #pragma omp parallel
 134     #pragma omp single
 135       m = f5 (0, 32, 0, 32);
 136   for (i = 0; i < 1024; i++)
 137     if (u[i] != 2 * i + 1)
 138       __builtin_abort ();
 139     else
 140       {
 141         v[i] = 1024 - i;
 142         w[i] = 512 - i;
 143       }
 144   if (m != 32 + 32)
 145     __builtin_abort ();
 146   return 0;
 147 }