vect-73.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 ic[N*2];
   9 int ib[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45};
  10
  11 #define ia (ic+N)
  12
  13 __attribute__ ((noinline))
  14 int main1 ()
  15 {
  16   int i, j;
  17
  18   for (i = 0; i < N; i++)
  19     {
  20        ia[i] = ib[i];
  21     }
  22
  23   /* check results: */
  24   for (i = 0; i < N; i++)
  25     {
  26        if (ia[i] != ib[i])
  27          abort();
  28     }
  29
  30   return 0;
  31 }
  32
  33 int main (void)
  34 {
  35   check_vect ();
  36
  37   return main1 ();
  38 }
  39
  40 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
  41 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 0 "vect" } } */
  42 /* { dg-final { cleanup-tree-dump "vect" } } */