| 1 |
// PR target/107404 |
| 2 |
// { dg-do run } |
| 3 |
// { dg-options "-O3" } |
| 4 |
|
| 5 |
unsigned long long a; |
| 6 |
void b(unsigned long long *f, int p2) { *f ^= p2; } |
| 7 |
long c; |
| 8 |
char e, i; |
| 9 |
short g, m; |
| 10 |
long long ab[1][25][21][22]; |
| 11 |
unsigned long long aa[1][21][22]; |
| 12 |
unsigned long long ae[1][25][21][21]; |
| 13 |
long long ac[129360]; |
| 14 |
char ad[25][1][21]; |
| 15 |
char ah[1][25][1][21]; |
| 16 |
short af[100]; |
| 17 |
long max(long f, unsigned long p2) { return f < p2 ? p2 : f; } |
| 18 |
const int &max2(const int &f, const int &p2) { return f < p2 ? p2 : f; } |
| 19 |
void foo(unsigned f, unsigned p2, char l, char p4, long long n[][25][21][22], |
| 20 |
unsigned long long p6[][21][22], unsigned long long u[][25][21][21]) { |
| 21 |
long an; |
| 22 |
for (int j = 0; j < 4; j = p2) |
| 23 |
for (short k = 0; k < 7; k += 2) |
| 24 |
for (short o = 0; o < (short)p2 + 21742; o = l) { |
| 25 |
for (signed char p = 2; p < 9; p += p4) |
| 26 |
if (p6[j][o][p]) |
| 27 |
for (long q(3); 4 ? n[0][k][o][0] : 0; |
| 28 |
q += p6[0][o][0] ? p6[j][0][p] : 0) |
| 29 |
ac[j + q] = 5066799590; |
| 30 |
for (long r(p4 - 16); r < 21; r += 4) { |
| 31 |
ad[k][o][r] = max(u[j][k][o][r], f + u[j][k][o][r]); |
| 32 |
long d = u[j][k][o][r]; |
| 33 |
an = d < p2 ? p2 : d; |
| 34 |
e = ah[j][k][o][r] = an; |
| 35 |
af[o * r] = i; |
| 36 |
} |
| 37 |
for (short s(c); s < (short)p2; s = 2) |
| 38 |
for (short am(m); am; am = max2(3, p2)) |
| 39 |
for (long y = 0; y; y = 3) |
| 40 |
for (short t(0); t < max2(g, 0);) |
| 41 |
; |
| 42 |
} |
| 43 |
} |
| 44 |
int main() { |
| 45 |
foo(7, 1558227751, 104, 16, ab, aa, ae); |
| 46 |
for (unsigned long v = 0; v < 5; ++v) |
| 47 |
for (unsigned long w = 0; w < 1; ++w) |
| 48 |
for (unsigned long x = 0; x < 21; ++x) |
| 49 |
b(&a, ad[v][w][x]); |
| 50 |
|
| 51 |
if (a) |
| 52 |
__builtin_abort(); |
| 53 |
} |