gcc/testsuite/gcc.dg/vect/vect-62.c

   1 /* { dg-require-effective-target vect_int } */
   2
   3 #include <stdarg.h>
   4 #include "tree-vect.h"
   5
   6 #define N 16
   7
   8 int main1 ()
   9 {
  10   int i, j;
  11   int ib[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45};
  12   int ia[N][4][N+8];
  13
  14   /* Multidimensional array. Aligned. The "inner" dimensions
  15      are invariant in the inner loop. Store. */
  16   for (i = 0; i < N; i++)
  17     {
  18       for (j = 0; j < N; j++)
  19         {
  20            ia[i][1][j+8] = ib[i];
  21         }
  22     }
  23
  24   /* check results: */
  25   for (i = 0; i < N; i++)
  26     {
  27       for (j = 0; j < N; j++)
  28         {
  29            if (ia[i][1][j+8] != ib[i])
  30               abort();
  31         }
  32     }
  33
  34   /* Multidimensional array. Aligned. The "inner" dimensions
  35      are invariant in the inner loop. Store. */
  36   for (i = 0; i < N; i++)
  37     {
  38       for (j = 0; j < N; j++)
  39         {
  40            ia[i][1][8] = ib[i];
  41         }
  42     }
  43
  44   /* check results: */
  45   for (i = 0; i < N; i++)
  46     {
  47       for (j = 0; j < N; j++)
  48         {
  49            if (ia[i][1][8] != ib[i])
  50               abort();
  51         }
  52     }
  53
  54
  55   return 0;
  56 }
  57
  58 int main (void)
  59 {
  60   check_vect ();
  61
  62   return main1 ();
  63 }
  64
  65 /* { dg-final { scan-tree-dump-times "vectorized 2 loops" 1 "vect" } } */
  66 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 0 "vect" } } */