blob: 136eca8c0a55c903a39aac71558ac12419afd365 (
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
|
/* { dg-do compile } */
/* { dg-options "-O2 -ftree-loop-distribution -ftree-loop-distribute-patterns -fdump-tree-ldist-details -fdump-tree-optimized" } */
extern void bar(int);
void
foo (unsigned i, unsigned n)
{
int a[30];
int b[30];
if (n == 0)
return;
for (i=0; i < n; i++)
a[i] = b[i] = 0;
while (1)
if (b[0])
bar (a[i - 1]);
}
/* We should apply loop distribution and generate 1 memset (0). PRE optimizes
away a[] completely. */
/* { dg-final { scan-tree-dump "distributed: split to 0 loops and 1 library calls" "ldist" } } */
/* { dg-final { scan-tree-dump-times "generated memset zero" 1 "ldist" } } */
/* { dg-final { scan-tree-dump-times "int a" 0 "optimized" } } */
|
