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