|  | char z[10] = { 0 }; | 
|  |  | 
|  | template <int N> | 
|  | __attribute__((noinline, noclone)) void | 
|  | foo (int (*&x)[3][N], int *y, long (&w)[1][N]) | 
|  | { | 
|  | unsigned long long a[9] = {}; | 
|  | short b[5] = {}; | 
|  | #pragma omp parallel for reduction(+:x[0:N][:][0:N], z[:4]) \ | 
|  | reduction(*:y[:3]) reduction(|:a[:4]) \ | 
|  | reduction(&:w[0:][:N]) reduction(max:b) | 
|  | for (int i = 0; i < 128; i++) | 
|  | { | 
|  | x[i / 64][i % 3][(i / 4) & 1] += i; | 
|  | if ((i & 15) == 1) | 
|  | y[0] *= 3; | 
|  | if ((i & 31) == N) | 
|  | y[1] *= 7; | 
|  | if ((i & 63) == 3) | 
|  | y[N] *= 17; | 
|  | z[i / 32] += (i & 3); | 
|  | if (i < 4) | 
|  | z[i] += i; | 
|  | a[i / 32] |= 1ULL << (i & 30); | 
|  | w[0][i & 1] &= ~(1L << (i / 17 * 3)); | 
|  | if ((i % 79) > b[0]) | 
|  | b[0] = i % 79; | 
|  | if ((i % 13) > b[1]) | 
|  | b[1] = i % 13; | 
|  | if ((i % 23) > b[N]) | 
|  | b[N] = i % 23; | 
|  | if ((i % 85) > b[3]) | 
|  | b[3] = i % 85; | 
|  | if ((i % 192) > b[4]) | 
|  | b[4] = i % 192; | 
|  | } | 
|  | for (int i = 0; i < 9; i++) | 
|  | if (a[i] != (i < 4 ? 0x55555555ULL : 0)) | 
|  | __builtin_abort (); | 
|  | if (b[0] != 78 || b[1] != 12 || b[N] != 22 || b[3] != 84 || b[4] != 127) | 
|  | __builtin_abort (); | 
|  | } | 
|  |  | 
|  | int a3[4][3][2]; | 
|  | int (*p3)[3][2] = &a3[1]; | 
|  | int y3[5] = { 0, 1, 1, 1, 0 }; | 
|  | long w3[1][2] = { ~0L, ~0L }; | 
|  | short bb[5]; | 
|  |  | 
|  | template <int N> | 
|  | struct S | 
|  | { | 
|  | int (*&x)[3][N]; | 
|  | int *y; | 
|  | long (&w)[1][N]; | 
|  | char z[10]; | 
|  | short (&b)[5]; | 
|  | unsigned long long a[9]; | 
|  | S() : x(p3), y(y3+1), w(w3), z(), a(), b(bb) {} | 
|  | __attribute__((noinline, noclone)) void foo (); | 
|  | }; | 
|  |  | 
|  | template <int N> | 
|  | void | 
|  | S<N>::foo () | 
|  | { | 
|  | #pragma omp parallel for reduction(+:x[0:N][:][0:N], z[:4]) \ | 
|  | reduction(*:y[:3]) reduction(|:a[:4]) \ | 
|  | reduction(&:w[0:][:N]) reduction(max:b) | 
|  | for (int i = 0; i < 128; i++) | 
|  | { | 
|  | x[i / 64][i % 3][(i / 4) & 1] += i; | 
|  | if ((i & 15) == 1) | 
|  | y[0] *= 3; | 
|  | if ((i & 31) == N) | 
|  | y[1] *= 7; | 
|  | if ((i & 63) == 3) | 
|  | y[N] *= 17; | 
|  | z[i / 32] += (i & 3); | 
|  | if (i < 4) | 
|  | z[i] += i; | 
|  | a[i / 32] |= 1ULL << (i & 30); | 
|  | w[0][i & 1] &= ~(1L << (i / 17 * 3)); | 
|  | if ((i % 79) > b[0]) | 
|  | b[0] = i % 79; | 
|  | if ((i % 13) > b[1]) | 
|  | b[1] = i % 13; | 
|  | if ((i % 23) > b[N]) | 
|  | b[N] = i % 23; | 
|  | if ((i % 85) > b[3]) | 
|  | b[3] = i % 85; | 
|  | if ((i % 192) > b[4]) | 
|  | b[4] = i % 192; | 
|  | } | 
|  | } | 
|  |  | 
|  | int | 
|  | main () | 
|  | { | 
|  | int a[4][3][2] = {}; | 
|  | static int a2[4][3][2] = {{{ 0, 0 }, { 0, 0 }, { 0, 0 }}, | 
|  | {{ 312, 381 }, { 295, 356 }, { 337, 335 }}, | 
|  | {{ 1041, 975 }, { 1016, 1085 }, { 935, 1060 }}, | 
|  | {{ 0, 0 }, { 0, 0 }, { 0, 0 }}}; | 
|  | int (*p)[3][2] = &a[1]; | 
|  | int y[5] = { 0, 1, 1, 1, 0 }; | 
|  | int y2[5] = { 0, 6561, 2401, 289, 0 }; | 
|  | char z2[10] = { 48, 49, 50, 51, 0, 0, 0, 0, 0, 0 }; | 
|  | long w[1][2] = { ~0L, ~0L }; | 
|  | foo<2> (p, y + 1, w); | 
|  | if (__builtin_memcmp (a, a2, sizeof (a)) | 
|  | || __builtin_memcmp (y, y2, sizeof (y)) | 
|  | || __builtin_memcmp (z, z2, sizeof (z)) | 
|  | || w[0][0] != ~0x249249L | 
|  | || w[0][1] != ~0x249249L) | 
|  | __builtin_abort (); | 
|  | S<2> s; | 
|  | s.foo (); | 
|  | for (int i = 0; i < 9; i++) | 
|  | if (s.a[i] != (i < 4 ? 0x55555555ULL : 0)) | 
|  | __builtin_abort (); | 
|  | if (__builtin_memcmp (a3, a2, sizeof (a3)) | 
|  | || __builtin_memcmp (y3, y2, sizeof (y3)) | 
|  | || __builtin_memcmp (s.z, z2, sizeof (s.z)) | 
|  | || w3[0][0] != ~0x249249L | 
|  | || w3[0][1] != ~0x249249L) | 
|  | __builtin_abort (); | 
|  | if (bb[0] != 78 || bb[1] != 12 || bb[2] != 22 || bb[3] != 84 || bb[4] != 127) | 
|  | __builtin_abort (); | 
|  | } |