|
111
|
1 /* A test for # of iterations estimation. We know that the loop is executed
|
|
|
2 at most 100 times, thus the (32-bit) induction variables do not overflow,
|
|
|
3 and we may use 64-bit variable to represent them. */
|
|
|
4
|
|
|
5 /* { dg-options "-O2 -fdump-tree-optimized" } */
|
|
|
6 /* { dg-do compile { target i?86-*-* x86_64-*-* } } */
|
|
|
7
|
|
|
8 unsigned a[100];
|
|
|
9
|
|
|
10 void foo(unsigned n)
|
|
|
11 {
|
|
|
12 unsigned i;
|
|
|
13
|
|
|
14 for (i = 0; i < n; i++)
|
|
|
15 a[i] = 4 * i;
|
|
|
16 }
|
|
|
17
|
|
|
18 /* Check that the memory reference was replaced with MEM, and that there is no
|
|
|
19 multiplication. */
|
|
|
20
|
|
|
21 /* { dg-final { scan-tree-dump-times "MEM" 1 "optimized" } } */
|
|
|
22 /* { dg-final { scan-tree-dump-times "\[^\\n\\r\]*= \\* " 0 "optimized" } } */
|
|
|
23
|
