Debian Codegraph @

gcc/testsuite/c-c++-common/gomp/order-1.c

raw
1 void
2 f1 (int *a)
3 {
4 int i;
5 #pragma omp for order(concurrent)
6 for (i = 0; i < 128; i++)
7 a[i]++;
8 #pragma omp simd order ( concurrent )
9 for (i = 0; i < 128; i++)
10 a[i]++;
11 #pragma omp for simd order(concurrent)
12 for (i = 0; i < 128; i++)
13 a[i]++;
14 }
15
16 void
17 f2 (int *a)
18 {
19 int i;
20 #pragma omp parallel for order(concurrent)
21 for (i = 0; i < 128; i++)
22 a[i]++;
23 #pragma omp parallel for simd order (concurrent)
24 for (i = 0; i < 128; i++)
25 a[i]++;
26 #pragma omp teams distribute parallel for order(concurrent)
27 for (i = 0; i < 128; i++)
28 a[i]++;
29 #pragma omp teams distribute parallel for simd order(concurrent)
30 for (i = 0; i < 128; i++)
31 a[i]++;
32 #pragma omp teams distribute order(concurrent)
33 for (i = 0; i < 128; i++)
34 a[i]++;
35 #pragma omp teams
36 {
37 #pragma omp distribute parallel for order(concurrent)
38 for (i = 0; i < 128; i++)
39 a[i]++;
40 #pragma omp distribute parallel for simd order(concurrent)
41 for (i = 0; i < 128; i++)
42 a[i]++;
43 #pragma omp distribute order(concurrent)
44 for (i = 0; i < 128; i++)
45 a[i]++;
46 }
47 #pragma omp taskloop simd order (concurrent)
48 for (i = 0; i < 128; i++)
49 a[i]++;
50 }