gcc/testsuite/gcc.dg/vect/no-tree-pre-slp-29.c

   1 /* { dg-require-effective-target vect_int } */
   2
   3 #include <stdarg.h>
   4 #include "tree-vect.h"
   5
   6 #define N 8
   7
   8 unsigned short in2[N*8] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63};
   9
  10 int
  11 main1 (unsigned short *in)
  12 {
  13   int i;
  14   unsigned short out[N*8];
  15
  16   for (i = 0; i < N; i++)
  17     {
  18       out[i*4] = in[i*4];
  19       out[i*4 + 1] = in[i*4 + 1];
  20       out[i*4 + 2] = in[i*4 + 2];
  21       out[i*4 + 3] = in[i*4 + 3];
  22     }
  23
  24   /* check results:  */
  25   for (i = 0; i < N; i++)
  26     {
  27       if (out[i*4] !=  in[i*4]
  28          || out[i*4 + 1] != in[i*4 + 1]
  29          || out[i*4 + 2] != in[i*4 + 2]
  30          || out[i*4 + 3] != in[i*4 + 3])
  31         abort ();
  32     }
  33
  34   return 0;
  35 }
  36
  37 int
  38 main2 (unsigned short * __restrict__ in, unsigned short * __restrict__ out)
  39 {
  40   int i;
  41
  42   for (i = 0; i < N; i++)
  43     {
  44       out[i*4] = in[i*4];
  45       out[i*4 + 1] = in[i*4 + 1];
  46       out[i*4 + 2] = in[i*4 + 2];
  47       out[i*4 + 3] = in[i*4 + 3];
  48     }
  49
  50   /* check results:  */
  51   for (i = 0; i < N; i++)
  52     {
  53       if (out[i*4] !=  in[i*4]
  54          || out[i*4 + 1] != in[i*4 + 1]
  55          || out[i*4 + 2] != in[i*4 + 2]
  56          || out[i*4 + 3] != in[i*4 + 3])
  57         abort ();
  58     }
  59
  60   return 0;
  61 }
  62
  63 int main (void)
  64 {
  65   unsigned short out[N*8];
  66
  67   check_vect ();
  68
  69   main1 (&in2[5]);
  70   main2 (&in2[3], &out[3]);
  71
  72   return 0;
  73 }
  74
  75 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 2 "vect" } } */
  76 /* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 2 "vect"  } } */
  77