blob: aa0747b6e7e58de6e8f65a553cabfbc5a72f6fcc (
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
25
26
27
|
/* A test for # of iterations analysis (signed counter cannot wrap) and final
value replacement. */
/* { dg-options "-O2 -fdump-tree-optimized" } */
int foo(void);
int bla(void)
{
int i, n = foo (), j;
j = 0;
/* The loop should be removed completely. */
for (i = 1; i <= n; i++)
j += n;
/* Should be replaced with return n * n; */
return j;
}
/* Since the loop is removed, there should be no addition. */
/* { dg-final { scan-tree-dump-times "\\+" 0 "optimized" } } */
/* { dg-final { scan-tree-dump-times "n_. \\* n_." 1 "optimized" } } */
/* The if from the loop header copying remains in the code. */
/* { dg-final { scan-tree-dump-times "if " 1 "optimized" } } */
/* { dg-final { cleanup-tree-dump "optimized" } } */
|
