slp-26.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 int
   9 main1 ()
  10 {
  11   int i;
  12   unsigned short in[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};
  13   unsigned short out[N*8], a[N], b[N] = {3,6,9,12,15,18,21,24};
  14
  15   /* Partial SLP is not supported.  */
  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       a[i] = b[i] / 3;
  24     }
  25
  26   /* check results:  */
  27   for (i = 0; i < N; i++)
  28     {
  29       if (out[i*4] !=  in[i*4]
  30          || out[i*4 + 1] != in[i*4 + 1]
  31          || out[i*4 + 2] != in[i*4 + 2]
  32          || out[i*4 + 3] != in[i*4 + 3]
  33          || a[i] != b[i] / 3)
  34         abort ();
  35     }
  36
  37   return 0;
  38 }
  39
  40 int main (void)
  41 {
  42   check_vect ();
  43
  44   main1 ();
  45
  46   return 0;
  47 }
  48
  49 /* { dg-final { scan-tree-dump-times "vectorized 0 loops" 1 "vect"  } } */
  50 /* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 0 "vect"  } } */
  51 /* { dg-final { cleanup-tree-dump "vect" } } */
  52