gcc/testsuite/gcc.dg/vect/vect-strided-u8-i8-gap4-big-array.c

   1 /* { dg-require-effective-target vect_int } */
   2
   3 #include <stdarg.h>
   4 #include "tree-vect.h"
   5
   6 #define N 128
   7
   8 typedef struct {
   9    unsigned char a;
  10    unsigned char b;
  11    unsigned char c;
  12    unsigned char d;
  13    unsigned char e;
  14    unsigned char f;
  15    unsigned char g;
  16    unsigned char h;
  17 } s;
  18
  19 s check_res[N];
  20
  21 __attribute__ ((noinline)) int
  22 main1 (s *arr)
  23 {
  24   int i;
  25   s *ptr = arr;
  26   s res[N];
  27   unsigned char x;
  28
  29   for (i = 0; i < N; i++)
  30     {
  31       res[i].c = ptr->b + ptr->c;
  32       x = ptr->c + ptr->f;
  33       res[i].a = x + ptr->b;
  34       res[i].d = ptr->b + ptr->c;
  35       res[i].b = ptr->c;
  36       res[i].f = ptr->f + ptr->e;
  37       res[i].e = ptr->b + ptr->e;
  38       res[i].h = ptr->c;
  39       res[i].g = ptr->b + ptr->c;
  40       ptr++;
  41     }
  42
  43   /* check results:  */
  44 #pragma GCC novector
  45   for (i = 0; i < N; i++)
  46     {
  47       if (res[i].a != check_res[i].a
  48           || res[i].b != check_res[i].b
  49           || res[i].c != check_res[i].c
  50           || res[i].d != check_res[i].d
  51           || res[i].e != check_res[i].e
  52           || res[i].f != check_res[i].f
  53           || res[i].g != check_res[i].g
  54           || res[i].h != check_res[i].h)
  55           abort ();
  56    }
  57
  58   ptr = arr;
  59   /* Vectorized as a strided SLP pair.  */
  60   for (i = 0; i < N; i++)
  61     {
  62       res[i].a = ptr->b;
  63       res[i].b = ptr->c;
  64       ptr++;
  65     }
  66
  67   /* Check results.  */
  68 #pragma GCC novector
  69   for (i = 0; i < N; i++)
  70     {
  71       if (res[i].a != arr[i].b
  72           || res[i].b != arr[i].c)
  73           abort ();
  74     }
  75
  76 }
  77
  78
  79 int main (void)
  80 {
  81   int i;
  82   s arr[N];
  83   unsigned char x;
  84
  85   check_vect ();
  86
  87   for (i = 0; i < N; i++)
  88     {
  89       arr[i].a = i;
  90       arr[i].b = i * 2;
  91       arr[i].c = 17;
  92       arr[i].d = i+34;
  93       arr[i].e = i * 3 + 5;
  94       arr[i].f = i * 5;
  95       arr[i].g = i - 3;
  96       arr[i].h = 56;
  97
  98       check_res[i].c = arr[i].b + arr[i].c;
  99       x = arr[i].c + arr[i].f;
 100       check_res[i].a = x + arr[i].b;
 101       check_res[i].d = arr[i].b + arr[i].c;
 102       check_res[i].b = arr[i].c;
 103       check_res[i].f = arr[i].f + arr[i].e;
 104       check_res[i].e = arr[i].b + arr[i].e;
 105       check_res[i].h = arr[i].c;
 106       check_res[i].g = arr[i].b + arr[i].c;
 107
 108       asm volatile ("" ::: "memory");
 109     }
 110   main1 (arr);
 111
 112   return 0;
 113 }
 114
 115 /* { dg-final { scan-tree-dump-times "vectorized 2 loops" 1 "vect" { target vect_strided8 } } } */