re PR tree-optimization/33291 (a+=2; a+=2 not simplified to a+=4; with -O3 ...
[gcc.git] / gcc / testsuite / gcc.dg / tree-ssa / ltrans-1.c
1 /* { dg-do compile } */
2 /* { dg-options "-O2 -ftree-loop-linear -fdump-tree-ltrans-all" } */
3 /* { dg-require-effective-target size32plus } */
4
5 double u[1782225];
6 int foo(int N, int *res)
7 {
8 int i, j;
9 double sum = 0.0;
10 /* This loop should be converted to a perfect nest and
11 interchanged. */
12 for (i = 0; i < N; i++)
13 {
14 for (j = 0; j < N; j++)
15 sum = sum + u[i + 1335 * j];
16
17 u[1336 * i] *= 2;
18 }
19 *res = sum + N;
20 }
21 /* { dg-final { scan-tree-dump-times "converted loop nest to perfect loop nest" 1 "ltrans"} } */
22 /* { dg-final { scan-tree-dump-times "transformed loop" 1 "ltrans"} } */
23 /* { dg-final { cleanup-tree-dump "ltrans" } } */