gcc/testsuite/gcc.dg/vect/vect-105-big-array.c

   1 /* { dg-require-effective-target vect_int } */
   2 /* { dg-additional-options "-fdump-tree-optimized-details-blocks" } */
   3
   4 #include <stdlib.h>
   5 #include <stdarg.h>
   6 #include "tree-vect.h"
   7
   8 #define N 16
   9
  10 struct extraction
  11 {
  12   int a[N][N];
  13   int b[N][N];
  14 };
  15
  16 static int a[N][N];
  17 static int b[N][N];
  18 static int c[N][N];
  19
  20 __attribute__ ((noinline))
  21 int main1 (int x) {
  22   int i,j, off;
  23   struct extraction *p;
  24   p = (struct extraction *) malloc (sizeof (struct extraction));
  25   for (i = 0; i < N; i++)
  26    {
  27     for (j = 0; j < N; j++)
  28      {
  29        a[i][j] = (i*7 + j*17)%53;
  30        b[i][j] = (i*11+ j*13)%41;
  31        asm volatile ("" ::: "memory");
  32      }
  33    }
  34   for (i = 0; i < N; i++)
  35    {
  36     for (j = 0; j < N; j++)
  37      {
  38        c[i][j] = a[i][j];
  39        asm volatile ("" ::: "memory");
  40      }
  41    }
  42   for (i = 1; i < N; i++)
  43   {
  44     for (j = 0; j < N; j++)
  45     {
  46       off = x + i + j + N+1;
  47       if (x + i + j > N*N-1)
  48         break;
  49       if (off > N*N-1)
  50         *(&c[0][0]+x+i+j) = *(&b[0][0] + off - N*N);
  51       else
  52         *(&c[0][0]+x+i+j) = *(&a[0][0] + off);
  53       asm volatile ("" ::: "memory");
  54     }
  55   }
  56
  57   for (i = 0; i < N; i++)
  58    {
  59     for (j = 0; j < N; j++)
  60      {
  61        p->a[i][j] = a[i][j];
  62        p->b[i][j] = b[i][j];
  63        asm volatile ("" ::: "memory");
  64      }
  65    }
  66
  67   /* Vectorizable: distance > number of iterations.  */
  68   for (i = 1; i < N; i++)
  69   {
  70     for (j = 0; j < N; j++)
  71     {
  72        *((int *)p + x + i + j) = *((int *)p + x + i + j + N+1);
  73     }
  74   }
  75
  76   /* check results: */
  77   for (i = 0; i < N; i++)
  78    {
  79 #pragma GCC novector
  80     for (j = 0; j < N; j++)
  81      {
  82        if (p->a[i][j] != c[i][j])
  83          abort ();
  84      }
  85   }
  86   return 0;
  87 }
  88
  89 int main (void)
  90 {
  91   check_vect ();
  92
  93   return main1 (N);
  94 }
  95
  96 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
  97 /* { dg-final { scan-tree-dump-times "Alignment of access forced using versioning" 2 "vect" { target { vect_no_align && { ! vect_hw_misalign } } } } } */
  98 /* { dg-final { scan-tree-dump-times "possible dependence between data-refs" 0 "vect" } } */
  99
 100 /* { dg-final { scan-tree-dump-not "Invalid sum" "optimized" } } */