| 1 |
/* { dg-do run } */ |
| 2 |
/* { dg-options "-O2 -fno-tree-sink -fno-tree-ter -fschedule-insns" } */ |
| 3 |
|
| 4 |
int a, c, d = 1, e, f = 1, h, i, j; |
| 5 |
unsigned b = 1, g; |
| 6 |
int main() { |
| 7 |
for (; h < 2; h++) { |
| 8 |
int k = ~(b || 0), l = ((~e - j) ^ a % b) % k, m = (b ^ -1) + e; |
| 9 |
unsigned o = ~a % ~1; |
| 10 |
if (f) { |
| 11 |
l = d; |
| 12 |
m = 10; |
| 13 |
i = e; |
| 14 |
d = -(~e + b); |
| 15 |
g = o % m; |
| 16 |
e = -1; |
| 17 |
n: |
| 18 |
a = a % ~i; |
| 19 |
b = ~k; |
| 20 |
if (!g) { |
| 21 |
b = e + o % -1; |
| 22 |
continue; |
| 23 |
} |
| 24 |
if (!l) |
| 25 |
break; |
| 26 |
} |
| 27 |
int q = (~d + g) << ~e, p = (~d - q) & a >> b; |
| 28 |
unsigned s = ~((g & e) + (p | (b ^ (d + k)))); |
| 29 |
int r = (e & s) + p, u = d | ~a, |
| 30 |
t = ((~(q + (~a + (s + e)))) & u) | (-g & (c << d ^ p)); |
| 31 |
if (t) |
| 32 |
if (!r) |
| 33 |
goto n; |
| 34 |
g = m; |
| 35 |
e = i; |
| 36 |
} |
| 37 |
return 0; |
| 38 |
} |