re PR tree-optimization/33291 (a+=2; a+=2 not simplified to a+=4; with -O3 ...
[gcc.git] / gcc / testsuite / gcc.dg / tree-ssa / pr26435.c
1 /* { dg-do compile } */
2 /* { dg-options "-O2 -ftree-loop-linear -fdump-tree-ltrans-all" } */
3 /* { dg-require-effective-target size32plus } */
4
5 int foo(int *p, int n)
6 {
7 int i, j, k = 0;
8
9 /* This is a reduction: there is a scalar dependence that cannot be
10 removed by rewriting IVs. This code cannot and should not be
11 transformed into a perfect loop. */
12 for (i = 0; i < 2; ++i, p += n)
13 for (j = 0; j < 2; ++j)
14 k += p[j];
15
16 return k;
17 }
18
19 /* { dg-final { scan-tree-dump-times "converted loop nest to perfect loop nest" 0 "ltrans"} } */
20 /* { dg-final { cleanup-tree-dump "ltrans" } } */