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

   1 /* { dg-require-effective-target vect_int } */
   2
   3 #include <stdarg.h>
   4 #include "tree-vect.h"
   5
   6 #define N 160
   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 volatile int y = 0;
  20
  21 __attribute__ ((noinline)) int
  22 main1 (s *arr, int n)
  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].a = 0;
  32       res[i].b = 0;
  33       res[i].c = 0;
  34       res[i].d = 0;
  35       res[i].e = 0;
  36       res[i].f = 0;
  37       res[i].g = 0;
  38       res[i].h = 0;
  39       __asm__ volatile ("");
  40     }
  41
  42   /* Check peeling for gaps for unknown loop bound.  */
  43   for (i = 0; i < n; i++)
  44     {
  45       res[i].c = ptr->b + ptr->c;
  46       x = ptr->c + ptr->f;
  47       res[i].a = x + ptr->b;
  48       res[i].d = ptr->b + ptr->c;
  49       res[i].b = ptr->c;
  50       res[i].f = ptr->f + ptr->e;
  51       res[i].e = ptr->b + ptr->e;
  52       res[i].h = ptr->c;
  53       res[i].g = ptr->b + ptr->c;
  54       ptr++;
  55     }
  56
  57   /* check results:  */
  58   for (i = 0; i < n; i++)
  59     {
  60       if (res[i].c != arr[i].b + arr[i].c
  61           || res[i].a != arr[i].c + arr[i].f + arr[i].b
  62           || res[i].d != arr[i].b + arr[i].c
  63           || res[i].b != arr[i].c
  64           || res[i].f != arr[i].f + arr[i].e
  65           || res[i].e != arr[i].b + arr[i].e
  66           || res[i].h != arr[i].c
  67           || res[i].g != arr[i].b + arr[i].c)
  68         abort ();
  69    }
  70
  71   /* Check also that we don't do more iterations than needed.  */
  72   for (i = n; i < N; i++)
  73     {
  74       if (res[i].c == arr[i].b + arr[i].c
  75           || res[i].a == arr[i].c + arr[i].f + arr[i].b
  76           || res[i].d == arr[i].b + arr[i].c
  77           || res[i].b == arr[i].c
  78           || res[i].f == arr[i].f + arr[i].e
  79           || res[i].e == arr[i].b + arr[i].e
  80           || res[i].h == arr[i].c
  81           || res[i].g == arr[i].b + arr[i].c)
  82         abort ();
  83    }
  84
  85   return 0;
  86 }
  87
  88
  89 int main (void)
  90 {
  91   int i;
  92   s arr[N];
  93
  94   check_vect ();
  95
  96   for (i = 0; i < N; i++)
  97     {
  98       arr[i].a = 5;
  99       arr[i].b = 6;
 100       arr[i].c = 17;
 101       arr[i].d = 3;
 102       arr[i].e = 16;
 103       arr[i].f = 16;
 104       arr[i].g = 3;
 105       arr[i].h = 56;
 106       if (y) /* Avoid vectorization.  */
 107         abort ();
 108     }
 109
 110   main1 (arr, N-2);
 111
 112   return 0;
 113 }
 114
 115 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target vect_strided8 } } } */
 116