PR tree-optimization/81303
[official-gcc.git] / gcc / testsuite / gcc.dg / tree-ssa / ldist-33.c
blob24d27fde9daa13277f716315f89bbfd2401ad3a1
1 /* { dg-do compile } */
2 /* { dg-options "-O2 -ftree-loop-distribution -ftree-loop-distribute-patterns -fdump-tree-ldist-details" } */
4 #define N (1024)
5 double a[N][N], b[N][N], c[N][N];
7 void
8 foo (void)
10 unsigned i, j, k;
12 for (i = 0; i < N; ++i)
13 for (j = 0; j < N; ++j)
15 c[i][j] = 0.0;
16 for (k = 0; k < N; ++k)
17 c[i][j] += a[i][k] * b[k][j];
21 /* { dg-final { scan-tree-dump "Loop nest . distributed: split to 1 loops and 1 library" "ldist" } } */