gcc/testsuite/gcc.dg/tree-ssa/loop-interchange-11.c

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