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

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