gcc/testsuite/gcc.dg/vect/slp-12a.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 int out[N*8], a0, a1, a2, a3, a4, a5, a6, a7, b1, b0, b2, b3, b4, b5, b6, b7;
  13   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};
  14   unsigned int ia[N];
  15
  16   for (i = 0; i < N; i++)
  17     {
  18
  19       a0 = in[i*8] + 5;
  20       a1 = in[i*8 + 1] + 6;
  21       a2 = in[i*8 + 2] + 7;
  22       a3 = in[i*8 + 3] + 8;
  23       a4 = in[i*8 + 4] + 9;
  24       a5 = in[i*8 + 5] + 10;
  25       a6 = in[i*8 + 6] + 11;
  26       a7 = in[i*8 + 7] + 12;
  27
  28       b0 = a0 * 3;
  29       b1 = a1 * 2;
  30       b2 = a2 * 12;
  31       b3 = a3 * 5;
  32       b4 = a4 * 8;
  33       b5 = a5 * 4;
  34       b6 = a6 * 3;
  35       b7 = a7 * 2;
  36
  37       out[i*8] = b0 - 2;
  38       out[i*8 + 1] = b1 - 3;
  39       out[i*8 + 2] = b2 - 2;
  40       out[i*8 + 3] = b3 - 1;
  41       out[i*8 + 4] = b4 - 8;
  42       out[i*8 + 5] = b5 - 7;
  43       /* Due to the use in the ia[i] store we keep the feeding expression
  44          in the form ((in[i*8 + 6] + 11) * 3 - 3) while other expressions
  45          got associated as for example (in[i*5 + 5] * 4 + 33).  That
  46          causes SLP discovery to fail.  */
  47       out[i*8 + 6] = b6 - 3;
  48       out[i*8 + 7] = b7 - 7;
  49
  50       ia[i] = b6;
  51     }
  52
  53   /* check results:  */
  54 #pragma GCC novector
  55   for (i = 0; i < N; i++)
  56     {
  57       if (out[i*8] !=  (in[i*8] + 5) * 3 - 2
  58          || out[i*8 + 1] != (in[i*8 + 1] + 6) * 2 - 3
  59          || out[i*8 + 2] != (in[i*8 + 2] + 7) * 12 - 2
  60          || out[i*8 + 3] != (in[i*8 + 3] + 8) * 5 - 1
  61          || out[i*8 + 4] != (in[i*8 + 4] + 9) * 8 - 8
  62          || out[i*8 + 5] != (in[i*8 + 5] + 10) * 4 - 7
  63          || out[i*8 + 6] != (in[i*8 + 6] + 11) * 3 - 3
  64          || out[i*8 + 7] != (in[i*8 + 7] + 12) * 2 - 7
  65          || ia[i] != (in[i*8 + 6] + 11) * 3)
  66         abort ();
  67     }
  68
  69   return 0;
  70 }
  71
  72 int main (void)
  73 {
  74   check_vect ();
  75
  76   main1 ();
  77
  78   return 0;
  79 }
  80
  81 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target { vect_strided8 && vect_int_mult } } } } */
  82 /* { dg-final { scan-tree-dump-times "vectorized 0 loops" 1 "vect" { target { ! { vect_strided8 && vect_int_mult } } } } } */
  83 /* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 0 "vect" { target { { vect_strided8 && {! vect_load_lanes } } && vect_int_mult } } } } */
  84 /* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 0 "vect" { target { ! { vect_strided8 && vect_int_mult } } } } } */