gcc/testsuite/gcc.dg/vect/slp-17.c

   1 /* { dg-require-effective-target vect_int } */
   2
   3 #include <stdarg.h>
   4 #include <stdio.h>
   5 #include "tree-vect.h"
   6
   7 #define N 8
   8
   9 unsigned short out[N*8];
  10 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};
  11 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};
  12 unsigned short out2[N*8];
  13
  14 int
  15 main1 ()
  16 {
  17   int i;
  18
  19   for (i = 0; i < N*2; i++)
  20     {
  21       out[i*2] = in[i*2] + 5;
  22       out[i*2 + 1] = in[i*2 + 1] + 6;
  23
  24       out2[i*4] = in2[i*4] + 2;
  25       out2[i*4 + 1] = in2[i*4 + 1] + 2;
  26       out2[i*4 + 2] = in2[i*4 + 2] + 1;
  27       out2[i*4 + 3] = in2[i*4 + 3] + 3;
  28     }
  29
  30   /* check results:  */
  31   for (i = 0; i < N*2; i++)
  32     {
  33       if (out[i*2] != in[i*2] + 5
  34          || out[i*2 + 1] != in[i*2 + 1] + 6
  35          || out2[i*4] !=  in2[i*4] + 2
  36          || out2[i*4 + 1] != in2[i*4 + 1] + 2
  37          || out2[i*4 + 2] != in2[i*4 + 2] + 1
  38          || out2[i*4 + 3] != in2[i*4 + 3] + 3)
  39         abort ();
  40     }
  41
  42   return 0;
  43 }
  44
  45 int main (void)
  46 {
  47   check_vect ();
  48
  49   main1 ();
  50
  51   return 0;
  52 }
  53
  54 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
  55 /* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 2 "vect"  } } */
  56 /* { dg-final { cleanup-tree-dump "vect" } } */
  57