Debian Codegraph @

libgomp/testsuite/libgomp.c-c++-common/scan-1.c

raw
1 #define N 30
2 #define M 3
3
4 int a[N][M], b[N][M], c[N][M];
5
6 int
7 main()
8 {
9 int x, y, shift;
10 int j = 0;
11 for (int i = 0; i < N; i++)
12 {
13 a[i][0] = (i+1)*32;
14 a[i][1] = (i+1)*17;
15 a[i][2] = (i+1)*11;
16 b[i][0] = (i+1)*7;
17 b[i][1] = (i+1)*5;
18 b[i][2] = (i+1)*3;
19 }
20
21 x = 0;
22 #pragma omp parallel for simd collapse(2) reduction(inscan,+: x) private(shift)
23 for (int i = 0; i < N; i++)
24 for (int j = 0; j < M; j++)
25 {
26 x += a[i][j];
27 x += b[i][j];
28 #pragma omp scan inclusive(x)
29 shift = i + 29*j;
30 c[i][j] = x + shift;
31 }
32
33 y = 0;
34 for (int i = 0; i < N; i++)
35 for (int j = 0; j < M; j++)
36 {
37 y += a[i][j] + b[i][j];
38 if (c[i][j] != y + i + 29*j)
39 __builtin_abort ();
40 }
41 if (x != y)
42 __builtin_abort ();
43
44 x = 0;
45 #pragma omp parallel for simd collapse(2) reduction(inscan,+: x) private(shift)
46 for (int i = 0; i < N; i++)
47 for (int j = 0; j < M; j++)
48 {
49 shift = i + 29*j;
50 c[i][j] = x + shift;
51 #pragma omp scan exclusive(x)
52 x += a[i][j];
53 x += b[i][j];
54 }
55
56 y = 0;
57 for (int i = 0; i < N; i++)
58 for (int j = 0; j < M; j++)
59 {
60 if (c[i][j] != y + i + 29*j)
61 __builtin_abort ();
62 y += a[i][j] + b[i][j];
63 }
64 if (x != y)
65 __builtin_abort ();
66
67 return 0;
68 }