vect-10.c

   1 /* { dg-do compile } */
   2 /* { dg-require-effective-target vect_int } */
   3
   4 #define N 16
   5
   6 short a[N];
   7 short d[N];
   8
   9 int foo ()
  10 {
  11   int i;
  12   short b[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45};
  13   short c[N] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15};
  14
  15   /* Strided access pattern.  */
  16   for (i = 0; i < N/2; i++)
  17     {
  18       a[i] = b[2*i+1] * c[2*i+1] - b[2*i] * c[2*i];
  19       d[i] = b[2*i] * c[2*i+1] + b[2*i+1] * c[2*i];
  20     }
  21
  22   return 0;
  23 }
  24
  25 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { xfail { ! vect_strided2 } } } } */
  26 /* { dg-final { cleanup-tree-dump "vect" } } */