1 /* { dg-do compile } */
2 /* { dg-options "-O2 -ftree-loop-distribution -fdump-tree-ldist-all" } */
7 int a
[1000], b
[1000], c
[1000];
9 for (i
= 1; i
< 1000; i
++)
12 b
[i
] = a
[i
-1]+1; /* S2 */
15 S1->S2 (flow, level 1)
17 One partition as A is used in both S1 and S2.
20 return a
[1000-2] + b
[1000-1] + c
[1000-2];
23 /* { dg-final { scan-tree-dump-times "distributed: split to 2 loops" 0 "ldist" } } */