* tree-loop-distribution.c (INCLUDE_ALGORITHM): New header file.
[official-gcc.git] / gcc / testsuite / gcc.dg / tree-ssa / ldist-27.c
blob3580c65f09ba0d140ceac1e54b1e9a495a343520
1 /* { dg-do run } */
2 /* { dg-options "-O3 -ftree-loop-distribute-patterns -fdump-tree-ldist-details" } */
4 #define M (300)
5 #define N (200)
7 struct st
9 double a[M];
10 double b[M];
11 double c[M][N];
14 int __attribute__ ((noinline)) foo (struct st *s)
16 int i, j;
17 for (i = 0; i != M;)
19 s->a[i] = 0.0;
20 s->b[i] = 1.0;
21 for (j = 0; 1; ++j)
23 if (j == N) goto L2;
24 s->c[i][j] = 0.0;
26 L2:
27 ++i;
29 return 0;
32 int main (void)
34 struct st s;
35 return foo (&s);
38 /* { dg-final { scan-tree-dump "distributed: split to " "ldist" } } */