slp-6.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 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};
   9 unsigned int 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};
  10
  11 int
  12 main1 ()
  13 {
  14   int i;
  15   unsigned short out[N*8];
  16   unsigned int out2[N*8];
  17
  18   for (i = 0; i < N; i++)
  19     {
  20       out[i*8] = in[i*8] + 5;
  21       out[i*8 + 1] = in[i*8 + 1] + 6;
  22       out[i*8 + 2] = in[i*8 + 2] + 7;
  23       out[i*8 + 3] = in[i*8 + 3] + 8;
  24       out[i*8 + 4] = in[i*8 + 4] + 9;
  25       out[i*8 + 5] = in[i*8 + 5] + 10;
  26       out[i*8 + 6] = in[i*8 + 6] + 11;
  27       out[i*8 + 7] = in[i*8 + 7] + 12;
  28     }
  29
  30   /* check results:  */
  31   for (i = 0; i < N; i++)
  32     {
  33       if (out[i*8] !=  in[i*8] + 5
  34          || out[i*8 + 1] != in[i*8 + 1] + 6
  35          || out[i*8 + 2] != in[i*8 + 2] + 7
  36          || out[i*8 + 3] != in[i*8 + 3] + 8
  37          || out[i*8 + 4] != in[i*8 + 4] + 9
  38          || out[i*8 + 5] != in[i*8 + 5] + 10
  39          || out[i*8 + 6] != in[i*8 + 6] + 11
  40          || out[i*8 + 7] != in[i*8 + 7] + 12)
  41         abort ();
  42     }
  43
  44   for (i = 0; i < N*2; i++)
  45     {
  46       out[i*4] = in[i*4] + 2;
  47       out[i*4 + 1] = in[i*4 + 1] + 2;
  48       out[i*4 + 2] = in[i*4 + 2] + 1;
  49       out[i*4 + 3] = in[i*4 + 3] + 3;
  50     }
  51
  52   /* check results:  */
  53   for (i = 0; i < N*2; i++)
  54     {
  55       if (out[i*4] !=  in[i*4] + 2
  56          || out[i*4 + 1] != in[i*4 + 1] + 2
  57          || out[i*4 + 2] != in[i*4 + 2] + 1
  58          || out[i*4 + 3] != in[i*4 + 3] + 3)
  59         abort ();
  60     }
  61
  62   for (i = 0; i < N/2; i++)
  63     {
  64       out2[i*16] = in2[i*16] * 2;
  65       out2[i*16 + 1] = in2[i*16 + 1] * 3;
  66       out2[i*16 + 2] = in2[i*16 + 2] * 4;
  67       out2[i*16 + 3] = in2[i*16 + 3] * 3;
  68       out2[i*16 + 4] = in2[i*16 + 4] * 2;
  69       out2[i*16 + 5] = in2[i*16 + 5] * 3;
  70       out2[i*16 + 6] = in2[i*16 + 6] * 2;
  71       out2[i*16 + 7] = in2[i*16 + 7] * 4;
  72       out2[i*16 + 8] = in2[i*16 + 8] * 2;
  73       out2[i*16 + 9] = in2[i*16 + 9] * 5;
  74       out2[i*16 + 10] = in2[i*16 + 10] * 2;
  75       out2[i*16 + 11] = in2[i*16 + 11] * 3;
  76       out2[i*16 + 12] = in2[i*16 + 12] * 4;
  77       out2[i*16 + 13] = in2[i*16 + 13] * 4;
  78       out2[i*16 + 14] = in2[i*16 + 14] * 3;
  79       out2[i*16 + 15] = in2[i*16 + 15] * 2;
  80     }
  81
  82   /* check results:  */
  83   for (i = 0; i < N/2; i++)
  84     {
  85       if (out2[i*16] !=  in2[i*16] * 2
  86          || out2[i*16 + 1] != in2[i*16 + 1] * 3
  87          || out2[i*16 + 2] != in2[i*16 + 2] * 4
  88          || out2[i*16 + 3] != in2[i*16 + 3] * 3
  89          || out2[i*16 + 4] != in2[i*16 + 4] * 2
  90          || out2[i*16 + 5] != in2[i*16 + 5] * 3
  91          || out2[i*16 + 6] != in2[i*16 + 6] * 2
  92          || out2[i*16 + 7] != in2[i*16 + 7] * 4
  93          || out2[i*16 + 8] != in2[i*16 + 8] * 2
  94          || out2[i*16 + 9] != in2[i*16 + 9] * 5
  95          || out2[i*16 + 10] != in2[i*16 + 10] * 2
  96          || out2[i*16 + 11] != in2[i*16 + 11] * 3
  97          || out2[i*16 + 12] != in2[i*16 + 12] * 4
  98          || out2[i*16 + 13] != in2[i*16 + 13] * 4
  99          || out2[i*16 + 14] != in2[i*16 + 14] * 3
 100          || out2[i*16 + 15] != in2[i*16 + 15] * 2)
 101         abort ();
 102     }
 103
 104
 105   return 0;
 106 }
 107
 108 int main (void)
 109 {
 110   check_vect ();
 111
 112   main1 ();
 113
 114   return 0;
 115 }
 116
 117 /* { dg-final { scan-tree-dump-times "vectorized 3 loops" 1 "vect"  {target vect_int_mult} } } */
 118 /* { dg-final { scan-tree-dump-times "vectorized 2 loops" 1 "vect"  {target  { ! { vect_int_mult } } } } } */
 119 /* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 3 "vect" {target vect_int_mult  } } } */
 120 /* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 2 "vect" {target  { ! { vect_int_mult } } } } } */
 121 /* { dg-final { cleanup-tree-dump "vect" } } */
 122