| 1 |
/* PR tree-optimization/113603 */ |
| 2 |
|
| 3 |
int a, e; |
| 4 |
signed char b; |
| 5 |
int *c; |
| 6 |
signed char *d; |
| 7 |
short f; |
| 8 |
signed char g[3]; |
| 9 |
|
| 10 |
int * |
| 11 |
foo (void) |
| 12 |
{ |
| 13 |
for (int i = 0; i < 3; i++) |
| 14 |
g[i] = 2; |
| 15 |
int j[100][100] = { {}, {4} }; |
| 16 |
signed char *k = &g[1]; |
| 17 |
do |
| 18 |
{ |
| 19 |
for (;;) |
| 20 |
{ |
| 21 |
if (c) |
| 22 |
break; |
| 23 |
return &a; |
| 24 |
} |
| 25 |
for (f = 0;; f++) |
| 26 |
{ |
| 27 |
for (b = 0; b < 2; b++) |
| 28 |
*c = j[b][f]; |
| 29 |
if (e) |
| 30 |
d = k; |
| 31 |
*k = *d; |
| 32 |
if (*c) |
| 33 |
break; |
| 34 |
if (f) |
| 35 |
break; |
| 36 |
} |
| 37 |
} |
| 38 |
while (f); |
| 39 |
return 0; |
| 40 |
} |