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 volatile int y = 0;
  22
  23 __attribute__ ((noinline)) int
  24 main1 (s *arr)
  25 {
  26   int i;
  27   s *ptr = arr;
  28   s res[N];
  29   unsigned char x;
  30
  31   for (i = 0; i < N; i++)
  32     {
  33       res[i].c = ptr->b + ptr->c;
  34       x = ptr->c + ptr->f;
  35       res[i].a = x + ptr->b;
  36       res[i].d = ptr->b + ptr->c;
  37       res[i].b = ptr->c;
  38       res[i].f = ptr->f + ptr->e;
  39       res[i].e = ptr->b + ptr->e;
  40       res[i].h = ptr->c;
  41       res[i].g = ptr->b + ptr->c;
  42       ptr++;
  43     }
  44
  45   /* check results:  */
  46   for (i = 0; i < N; i++)
  47     {
  48       if (res[i].a != check_res[i].a
  49           || res[i].b != check_res[i].b
  50           || res[i].c != check_res[i].c
  51           || res[i].d != check_res[i].d
  52           || res[i].e != check_res[i].e
  53           || res[i].f != check_res[i].f
  54           || res[i].g != check_res[i].g
  55           || res[i].h != check_res[i].h)
  56           abort ();
  57    }
  58
  59   ptr = arr;
  60   /* Not vectorizable: gap in store.  */
  61   for (i = 0; i < N; i++)
  62     {
  63       res[i].a = ptr->b;
  64       res[i].b = ptr->c;
  65       ptr++;
  66     }
  67
  68   /* Check results.  */
  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       if (y) /* Avoid vectorization.  */
 109         abort ();
 110     }
 111   main1 (arr);
 112
 113   return 0;
 114 }
 115
 116 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target vect_strided8 } } } */
 117