gcc/testsuite/gcc.dg/vect/vect-76-big-array.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 124
   8 #define OFF 4
   9
  10 /* Check handling of accesses for which the "initial condition" -
  11    the expression that represents the first location accessed - is
  12    more involved than just an ssa_name.  */
  13
  14 int ib[N+OFF] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__))) = {0, 1, 3, 5, 7, 11, 13, 17};
  15 int ic[N+OFF] = {0, 1, 3, 5, 7, 11, 13, 17};
  16
  17 __attribute__ ((noinline))
  18 int main1 (int *pib)
  19 {
  20   int i;
  21   int ia[N+OFF];
  22   for (i = OFF; i < N+OFF; i++)
  23     {
  24       ib[i] = ib[i%8]*(i/8);
  25       ic[i] = ic[i%8]*(i/8);
  26       asm volatile ("" ::: "memory");
  27     }
  28
  29   for (i = OFF; i < N; i++)
  30     {
  31       ia[i] = pib[i - OFF];
  32     }
  33
  34
  35   /* check results:  */
  36 #pragma GCC novector
  37   for (i = OFF; i < N; i++)
  38     {
  39      if (ia[i] != pib[i - OFF])
  40         abort ();
  41     }
  42
  43   for (i = 0; i < N; i++)
  44     {
  45       ia[i] = pib[i - OFF];
  46     }
  47
  48
  49   /* check results:  */
  50 #pragma GCC novector
  51   for (i = 0; i < N; i++)
  52     {
  53      if (ia[i] != pib[i - OFF])
  54         abort ();
  55     }
  56
  57   for (i = OFF; i < N; i++)
  58     {
  59       ia[i] = ic[i - OFF];
  60     }
  61
  62
  63   /* check results:  */
  64 #pragma GCC novector
  65   for (i = OFF; i < N; i++)
  66     {
  67      if (ia[i] != ic[i - OFF])
  68         abort ();
  69     }
  70
  71   return 0;
  72 }
  73
  74 int main (void)
  75 {
  76   check_vect ();
  77
  78   main1 (&ib[OFF]);
  79   return 0;
  80 }
  81
  82
  83 /* { dg-final { scan-tree-dump-times "vectorized 3 loops" 1 "vect" } } */
  84 /* { dg-final { scan-tree-dump-not "Invalid sum" "optimized" } } */