https://gcc.gnu.org/bugzilla/show_bug.cgi?id=107257
Li Shaohua <shaohua.li at inf dot ethz.ch> changed:
What |Removed |Added
----------------------------------------------------------------------------
Resolution|INVALID |---
Status|RESOLVED |NEW
--- Comment #4 from Li Shaohua <shaohua.li at inf dot ethz.ch> ---
Hi,
Sorry for my previous over-reduced test case. Here is a well-formed reduction:
```
void printf();
int a, b, c;
int d[3];
int e(int f, int g, int k, int l, int m, int n) {
int h = 4 * f + 2 * (g + l + n) + k + m, j = h >> 4;
return j;
}
void o(int f) {
int i = 0;
for (; i < 3; i++)
d[i] = 4279432140;
for (; - 72 + f - -72 <= 2; f++) {
a = 2;
for (; a >= 0; a--) {
b = 2;
for (; b >= 0; b--) {
int p = !(d[b] > 0 != e(10, 29, 42, 74, 89, -68) + f - 15);
if (p)
break;
}
if (f)
break;
}
}
}
void q() {
int i = 0;
o(0);
if (c)
for (; i < 1;)
for (; i < 1; i++)
;
}
int main() {
q();
printf("%d\n", b);
}
```
Compiler explorer: https://godbolt.org/z/bjjW5q17r
