| /* A test for strength reduction and induction variable elimination. */ |
| |
| /* { dg-do compile } */ |
| /* { dg-options "-O1 -fdump-tree-vars" } */ |
| |
| /* Size of this structure should be sufficiently weird so that no memory |
| addressing mode applies. */ |
| |
| struct bla |
| { |
| char x[187]; |
| int y; |
| char z[253]; |
| } arr_base[100]; |
| |
| void xxx(void) |
| { |
| int iter; |
| |
| for (iter = 0; iter < 100; iter++) |
| arr_base[iter].y = 17 * iter; |
| } |
| |
| /* Access to arr_base[iter].y should be strength reduced. */ |
| |
| /* { dg-final { scan-tree-dump-times "arr_base\[^\\n\\r\]*=" 0 "vars" } } */ |
| |
| /* 17 * iter should be strength reduced. */ |
| |
| /* { dg-final { scan-tree-dump-times " \\* 17" 0 "vars" } } */ |
| /* { dg-final { scan-tree-dump-times " \\+ 17" 1 "vars" } } */ |
| |
| /* The induction variable comparison with 99 should be eliminated |
| and replaced by comparison of the variable for 17 * iter with 1700. */ |
| |
| /* { dg-final { scan-tree-dump-times "1700" 1 "vars" } } */ |
| /* { dg-final { scan-tree-dump-times "iter" 0 "vars" } } */ |
