slp-reduc-1.c

   1 /* { dg-require-effective-target vect_int } */
   2
   3 #include <stdarg.h>
   4 #include "tree-vect.h"
   5
   6 #define N 16
   7
   8 unsigned int ub[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45};
   9 unsigned int uc[N] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15};
  10
  11 /* Vectorization of reduction using loop-aware SLP.  */
  12
  13 __attribute__ ((noinline))
  14 int main1 (int n, int res0, int res1, int res2, int res3)
  15 {
  16   int i;
  17   unsigned int udiff0 = 5, udiff1 = 10, udiff2 = 20, udiff3 = 30;
  18
  19   for (i = 0; i < n; i++) {
  20     udiff3 += (ub[4*i + 3] - uc[4*i + 3]);
  21     udiff2 += (ub[4*i + 2] - uc[4*i + 2]);
  22     udiff1 += (ub[4*i + 1] - uc[4*i + 1]);
  23     udiff0 += (ub[4*i] - uc[4*i]);
  24   }
  25
  26   /* Check results:  */
  27   if (udiff0 != res0
  28       || udiff1 != res1
  29       || udiff2 != res2
  30       || udiff3 != res3)
  31     abort ();
  32
  33   return 0;
  34 }
  35
  36 int main (void)
  37 {
  38   check_vect ();
  39
  40   main1 (N/4, 53, 66, 84, 102);
  41   main1 (N/4 - 1, 29, 40, 56, 72);
  42   return 0;
  43 }
  44
  45 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { xfail vect_no_int_add } } } */
  46 /* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 1 "vect" { xfail vect_no_int_add } } } */
  47 /* { dg-final { cleanup-tree-dump "vect" } } */
  48