fortran: Factor the evaluation of MINLOC/MAXLOC's BACK argument
[official-gcc.git] / libgomp / testsuite / libgomp.c / loop-26.c
blob5b3021337f5357686f9bacdda021361553263e88
1 /* { dg-do run } */
3 extern void abort (void);
5 signed char v[5][7][9][21][4][42][3];
6 int a[84];
7 int *volatile zero = &a[42];
8 int *volatile two = &a[42 + 2];
9 int *volatile three = &a[42 + 3];
10 int *volatile five = &a[42 + 5];
11 int *volatile seven = &a[42 + 7];
12 int *volatile nine = &a[42 + 9];
13 int *volatile eleven = &a[42 + 11];
14 int *volatile minusone = &a[42 - 1];
15 volatile int zeroi = 0, onei = 1, twoi = 2, threei = 3, fivei = 5;
17 int
18 main ()
20 for (int i = 0; i < 5; i++)
21 for (int j = 0; j < 7; j++)
22 for (int k = 0; k < 9; k++)
23 for (int l = j; l < 5 + j; l++)
24 for (int m = 7; m < 11; m++)
25 for (int n = 0; n < l - 2; n++)
26 for (int o = 0; o < 3; o++)
27 v[i][j][k][l][m - 7][n][o] = 1;
29 int niters = 0;
30 #pragma omp parallel
31 #pragma omp for collapse(7) reduction(+:niters)
32 for (int i = 0; i < 5; i++)
33 for (int *j = &a[42]; j < &a[42 + 7]; j++)
34 for (int *k = &a[42]; k < &a[42 + 9]; k++)
35 for (int *l = j; l < 5 + j; l++)
36 for (int *m = &a[42 + 7]; m < &a[42 + 11]; m++)
37 for (int *n = &a[42]; n < l - 2; n++)
38 for (int *o = &a[42]; o < &a[42 + 3]; o++)
40 niters++;
41 if (i < 0 || i >= 5
42 || j - &a[42] < 0 || j - &a[42] >= 7
43 || k - &a[42] < 0 || k - &a[42] >= 9
44 || l - &a[42] < 0 || l >= j + 5
45 || m - &a[42] < 7 || m - &a[42] >= 11
46 || n - &a[42] < 0 || n >= l - 2
47 || o - &a[42] < 0 || o - &a[42] >= 3)
48 abort ();
49 if (v[i][j - &a[42]][k - &a[42]][l - &a[42]][m - &a[42 + 7]][n - &a[42]][o - &a[42]] != 1)
50 abort ();
51 v[i][j - &a[42]][k - &a[42]][l - &a[42]][m - &a[42 + 7]][n - &a[42]][o - &a[42]]++;
54 if (niters != 58860)
55 abort ();
56 int niters2 = 0;
57 #pragma omp parallel
58 #pragma omp for collapse(7) reduction(+:niters2)
59 for (int *i = zero; i < five; i += onei)
60 for (int *j = seven - onei; j >= zero; j -= onei)
61 for (int *k = nine - onei; k >= zero; k += -onei)
62 for (int *l = j + zeroi; l < fivei + j; l += onei)
63 for (int *m = eleven - onei; m >= seven; m -= onei)
64 for (int *n = l - threei; n >= zero; n -= onei)
65 for (int *o = zero; o < three; o += onei)
67 niters2++;
68 if (i - &a[42] < 0 || i - &a[42] >= 5
69 || j - &a[42] < 0 || j - &a[42] >= 7
70 || k - &a[42] < 0 || k - &a[42] >= 9
71 || l < j || l >= j + 5
72 || m - &a[42] < 7 || m - &a[42] >= 11
73 || n - &a[42] < 0 || n >= l - 2
74 || o - &a[42] < 0 || o - &a[42] >= 3)
75 abort ();
76 if (v[i - &a[42]][j - &a[42]][k - &a[42]][l - &a[42]][m - &a[42 + 7]][n - &a[42]][o - &a[42]] != 2)
77 abort ();
78 v[i - &a[42]][j - &a[42]][k - &a[42]][l - &a[42]][m - &a[42 + 7]][n - &a[42]][o - &a[42]]++;
81 if (niters2 != 58860)
82 abort ();
84 for (int i = 0; i < 5; i++)
85 for (int j = 0; j < 7; j++)
86 for (int k = 0; k < 9; k++)
87 for (int l = j; l < 5 + j; l++)
88 for (int m = 7; m < 11; m++)
89 for (int n = 0; n < l - 2; n++)
90 for (int o = 0; o < 3; o++)
91 if (v[i][j][k][l][m - 7][n][o] != 3)
92 abort ();
94 int niters3 = 0;
95 #pragma omp parallel
96 #pragma omp for collapse(5) reduction(+:niters3)
97 for (int *i = &a[42 + 4]; i >= &a[42 + 0]; i--)
98 for (int *j = &a[42 + 6]; j >= &a[42 + 0]; --j)
99 for (int *l = j + 4; l >= j; l--)
100 for (int *n = l - 3; n >= &a[42]; --n)
101 for (int *o = &a[42 + 2]; o >= &a[42 + 0]; o--)
103 niters3++;
104 if (i - &a[42] < 0 || i - &a[42] >= 5
105 || j - &a[42] < 0 || j - &a[42] >= 7
106 || l < j || l >= j + 5
107 || n - &a[42] < 0 || n >= l - 2
108 || o - &a[42] < 0 || o - &a[42] >= 3)
109 abort ();
110 if (v[i - &a[42]][j - &a[42]][0][l - &a[42]][0][n - &a[42]][o - &a[42]] != 3)
111 abort ();
112 v[i - &a[42]][j - &a[42]][0][l - &a[42]][0][n - &a[42]][o - &a[42]]++;
115 if (niters3 != 1635)
116 abort ();
118 int niters4 = 0;
119 #pragma omp parallel
120 #pragma omp for collapse(5) reduction(+:niters4)
121 for (int *i = zero; i < five; i += onei)
122 for (int *j = zero; j <= seven - onei; j += onei)
123 for (int *l = zeroi + j; l < j + fivei; l += onei)
124 for (int *n = zero; n <= l - threei; n += onei)
125 for (int o = zeroi; o < threei; o += onei)
127 niters4++;
128 if (i - &a[42] < 0 || i - &a[42] >= 5
129 || j - &a[42] < 0 || j - &a[42] >= 7
130 || l < j || l >= j + 5
131 || n - &a[42] < 0 || n >= l - 2
132 || o < 0 || o >= 3)
133 abort ();
134 if (v[i - &a[42]][j - &a[42]][0][l - &a[42]][0][n - &a[42]][o] != 4)
135 abort ();
136 v[i - &a[42]][j - &a[42]][0][l - &a[42]][0][n - &a[42]][o]++;
139 if (niters4 != 1635)
140 abort ();
142 for (int i = 0; i < 5; i++)
143 for (int j = 0; j < 7; j++)
144 for (int l = j; l < j + 5; l++)
145 for (int n = 0; n < l - 2; n++)
146 for (int o = 0; o < 3; o++)
147 if (v[i][j][0][l][0][n][o] != 5)
148 abort ();
150 int niters5 = 0;
151 #pragma omp parallel
152 #pragma omp for collapse(3) reduction(+:niters5)
153 for (int *j = &a[42 + 6]; j >= &a[42]; --j)
154 for (int *l = j + 0; l <= j + 4; l++)
155 for (int *n = l - 3; n > &a[42 - 1]; --n)
157 niters5++;
158 if (j - &a[42] < 0 || j - &a[42] >= 7
159 || l < j || l >= j + 5
160 || n < &a[42] || n >= l - 2)
161 abort ();
162 if (v[0][j - &a[42]][0][l - &a[42]][0][n - &a[42]][0] != 5)
163 abort ();
164 v[0][j - &a[42]][0][l - &a[42]][0][n - &a[42]][0]++;
167 if (niters5 != 109)
168 abort ();
170 int niters6 = 0;
171 #pragma omp parallel
172 #pragma omp for collapse(3) reduction(+:niters6)
173 for (int *j = seven - onei; j > minusone; j -= onei)
174 for (int *l = j + threei + onei; l >= j; l += -onei)
175 for (int *n = l - threei; n > minusone; n -= onei)
177 niters6++;
178 if (j - &a[42] < 0 || j - &a[42] >= 7
179 || l < j || l >= j + 5
180 || n < &a[42] || n >= l - 2)
181 abort ();
182 if (v[0][j - &a[42]][0][l - &a[42]][0][n - &a[42]][0] != 6)
183 abort ();
184 v[0][j - &a[42]][0][l - &a[42]][0][n - &a[42]][0]++;
187 if (niters6 != 109)
188 abort ();
190 for (int j = 0; j < 7; j++)
191 for (int l = j; l < j + 5; l++)
192 for (int n = 0; n < l - 2; n++)
193 if (v[0][j][0][l][0][n][0] != 7)
194 abort ();
195 return 0;