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