| /* { dg-do compile } */ |
| /* { dg-options "-O2 -fdump-tree-vrp1-details" } */ |
| /* LLVM LOCAL test not applicable */ |
| /* { dg-require-fdump "" } */ |
| |
| static int blocksize = 4096; |
| |
| int bar (int); |
| |
| void foo (void) |
| { |
| int toread; |
| int bytes; |
| static char eof_reached = 0; |
| |
| toread = blocksize; |
| bytes = 1; |
| |
| while (toread != 0) |
| { |
| bytes = bar (toread); |
| if (bytes <= 0) |
| { |
| if (bytes < 0) |
| continue; |
| break; |
| } |
| toread -= bytes; |
| } |
| |
| if (bytes == 0) |
| eof_reached = 1; |
| } |
| |
| |
| /* First, we should simplify the bits < 0 test within the loop. */ |
| /* { dg-final { scan-tree-dump-times "Simplified relational" 1 "vrp1" } } */ |
| |
| /* Second, we should thread the edge out of the loop via the break |
| statement. */ |
| /* { dg-final { scan-tree-dump-times "Threaded jump" 1 "vrp1" } } */ |
| |
| /* Now if we were really good, we'd realize that the final bytes == 0 |
| test is totally useless. That's not likely to happen anytime soon. */ |
| |
| /* { dg-final { cleanup-tree-dump "vrp1" } } */ |
| |
