| // { dg-require-effective-target size32plus } | |
| extern "C" void abort (); | |
| int r, a[1024], b[1024], q; | |
| #pragma omp declare reduction (foo: int: omp_out += omp_in) initializer (omp_priv = 0) | |
| __attribute__((noipa)) void | |
| foo (int *a, int *b, int &r) | |
| { | |
| #pragma omp for reduction (inscan, foo:r) | |
| for (int i = 0; i < 1024; i++) | |
| { | |
| b[i] = r; | |
| #pragma omp scan exclusive(r) | |
| r += a[i]; | |
| } | |
| } | |
| __attribute__((noipa)) int | |
| bar (void) | |
| { | |
| int &s = q; | |
| q = 0; | |
| #pragma omp parallel | |
| #pragma omp for reduction (inscan, foo:s) nowait | |
| for (int i = 0; i < 1024; i++) | |
| { | |
| b[i] = s; | |
| #pragma omp scan exclusive(s) | |
| s += 2 * a[i]; | |
| } | |
| return s; | |
| } | |
| __attribute__((noipa)) void | |
| baz (int *a, int *b, int &r) | |
| { | |
| #pragma omp parallel for reduction (inscan, foo:r) | |
| for (int i = 0; i < 1024; i++) | |
| { | |
| b[i] = r; | |
| #pragma omp scan exclusive(r) | |
| r += a[i]; | |
| } | |
| } | |
| __attribute__((noipa)) int | |
| qux (void) | |
| { | |
| int &s = q; | |
| q = 0; | |
| #pragma omp parallel for reduction (inscan, foo:s) | |
| for (int i = 0; i < 1024; i++) | |
| { | |
| b[i] = s; | |
| #pragma omp scan exclusive(s) | |
| s += 2 * a[i]; | |
| } | |
| return s; | |
| } | |
| int | |
| main () | |
| { | |
| int s = 0; | |
| for (int i = 0; i < 1024; ++i) | |
| { | |
| a[i] = i; | |
| b[i] = -1; | |
| asm ("" : "+g" (i)); | |
| } | |
| #pragma omp parallel | |
| foo (a, b, r); | |
| if (r != 1024 * 1023 / 2) | |
| abort (); | |
| for (int i = 0; i < 1024; ++i) | |
| { | |
| if (b[i] != s) | |
| abort (); | |
| else | |
| b[i] = 25; | |
| s += i; | |
| } | |
| if (bar () != 1024 * 1023) | |
| abort (); | |
| s = 0; | |
| for (int i = 0; i < 1024; ++i) | |
| { | |
| if (b[i] != s) | |
| abort (); | |
| else | |
| b[i] = -1; | |
| s += 2 * i; | |
| } | |
| r = 0; | |
| baz (a, b, r); | |
| if (r != 1024 * 1023 / 2) | |
| abort (); | |
| s = 0; | |
| for (int i = 0; i < 1024; ++i) | |
| { | |
| if (b[i] != s) | |
| abort (); | |
| else | |
| b[i] = -25; | |
| s += i; | |
| } | |
| if (qux () != 1024 * 1023) | |
| abort (); | |
| s = 0; | |
| for (int i = 0; i < 1024; ++i) | |
| { | |
| if (b[i] != s) | |
| abort (); | |
| s += 2 * i; | |
| } | |
| } |