1 /* { dg-do compile } */
2 /* { dg-options "-O2 -floop-interchange -fdump-tree-linterchange-details" } */
3 /* { dg-skip-if "too big data segment" { avr-*-* visium-*-* } } */
4
5 #define M 256
6 int a[M][M], b[M][M];
7
8 void
simple_reduc_1(int n,int * p)9 simple_reduc_1 (int n, int *p)
10 {
11 for (int j = 0; j < n; j++)
12 {
13 int sum = p[j];
14 for (int i = 0; i < n; i++)
15 {
16 sum = sum + b[i][j];
17 b[i][j] += a[i][j];
18 }
19
20 p[j] = sum;
21 }
22 }
23 /* { dg-final { scan-tree-dump-not "Loop_pair<outer:., inner:.> is interchanged" "linterchange" } } */
24