1 /* { dg-do compile { target int32plus } } */
2 /* { dg-options "-O2 -ftree-loop-linear -fdump-tree-ltrans-all" } */
9 for(k = 0; k < 1234; k++)
10 for(j = 0; j < 5; j++)
11 for(i = 0; i < 67; i++)
13 a[j+i-(-m+n+3)][i-k+4] = a[k+j][i];
20 /* For the data dependence analysis of the outermost loop, the
21 evolution of "k+j" should be instantiated in the outermost loop "k"
22 and the evolution should be taken in the innermost loop "i". The
23 pattern below ensures that the evolution is not computed in the
24 outermost "k" loop: the 4 comes from the instantiation of the
25 number of iterations of loop "j". */
27 /* { dg-final { scan-tree-dump-times "4, \\+, 1" 0 "ltrans" } } */
28 /* { dg-final { cleanup-tree-dump "ltrans" } } */