1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
|
/* { dg-do compile } */
/* { dg-additional-options "-fno-tree-dce -ftree-loop-distribution" } */
short a, d;
int b, c, f, g, h, i, j[2], o;
__attribute__((const)) int s(char r);
int main() {
int l, m, k, n;
if (b) {
char p;
for (; p >= 0; p--) {
int e[] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0,
1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1,
0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0};
if (j[p]) {
int q[1];
i = o;
o = q[h];
if (g)
n = d;
m = 4;
for (; m; m--) {
if (l)
k |= c;
if (a)
break;
}
}
s(n);
f |= b;
}
}
return 0;
}
|
