main/gcc/testsuite/gcc.dg/vect/vect-75-big-array.c

   1 /* { dg-require-effective-target vect_int } */
   2
   3 #include <stdarg.h>
   4 #include "tree-vect.h"
   5
   6 #define N 120
   7 #define OFF 8
   8
   9 /* Check handling of accesses for which the "initial condition" -
  10    the expression that represents the first location accessed - is
  11    more involved than just an ssa_name.  */
  12
  13 int ib[N+OFF] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__))) = {0, 1, 3, 5, 7, 11, 13, 17};
  14
  15 volatile int y = 0;
  16
  17 __attribute__ ((noinline))
  18 int main1 (int *ib)
  19 {
  20   int i;
  21   int ia[N];
  22
  23   for (i = OFF; i < N+OFF; i++)
  24     {
  25       ib[i] = ib[i%OFF]*(i/OFF);
  26       if (y)
  27         abort ();
  28     }
  29   for (i = 0; i < N; i++)
  30     {
  31       ia[i] = ib[i+OFF];
  32     }
  33
  34
  35   /* check results:  */
  36   for (i = 0; i < N; i++)
  37     {
  38      if (ia[i] != ib[i+OFF])
  39         abort ();
  40     }
  41
  42   return 0;
  43 }
  44
  45 int main (void)
  46 {
  47   check_vect ();
  48
  49   main1 (ib);
  50   return 0;
  51 }
  52
  53
  54 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
  55 /*  { dg-final { scan-tree-dump-times "Alignment of access forced using versioning" 1 "vect" { target vect_no_align } } } */
  56 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 1 "vect" { xfail vect_no_align } } } */
  57 /* { dg-final { cleanup-tree-dump "vect" } } */