loop-38.c: Correct testcase.
[official-gcc.git] / gcc / testsuite / gcc.dg / tree-ssa / loop-38.c
blob7f2303124ad9c0e22698f3ce078153b56fc37b32
1 /* { dg-do compile } */
2 /* { dg-options "-O2 -fdump-tree-cunrolli-details" } */
3 int a[10];
4 int b[11];
5 t(int n)
7 int i;
8 int sum = 0;
9 for (i=0;i<n;i++)
10 if (q())
11 sum+=a[i];
12 else
13 sum+=b[i];
14 return sum;
16 /* { dg-final { scan-tree-dump "Found better loop bound 11" "cunrolli" } } */
17 /* { dg-final { scan-tree-dump "Loop 1 iterates at most 11 times" "cunrolli" } } */
18 /* { dg-final { cleanup-tree-dump "cunrolli" } } */