old-autovect-branch/gcc/testsuite/gcc.dg/vect/vect-reduc-dot-u16.c

   1 /* { dg-require-effective-target vect_int } */
   2
   3 #include <stdarg.h>
   4 #include "tree-vect.h"
   5
   6 #define N 64
   7
   8 #define DOT1 43680
   9 #define DOT2 43680
  10
  11 unsigned short X[N] __attribute__ ((__aligned__(16)));
  12 unsigned short Y[N] __attribute__ ((__aligned__(16)));
  13
  14 /* short->short->int dot product. Not vectorized. */
  15 /* ??? Is vectorized on i386.  */
  16 unsigned int
  17 foo1(int len) {
  18   int i;
  19   unsigned int result = 0;
  20   unsigned short prod;
  21
  22   for (i=0; i<len; i++) {
  23     prod = X[i] * Y[i];
  24     result += prod;
  25   }
  26   return result;
  27 }
  28
  29 /* short->int->int dot product. Should be vectorized on ppc,
  30    but for some reason currently the GIMPLE arguments are cast to int
  31    instead of 'unsigned int'. */
  32 /* ??? This is exactly correct.  The multiplication promotes to int,
  33    then is promoted to unsigned int for the addition.  Which results
  34    in an int->unsigned int cast, which since no bits are modified in
  35    the cast should be trivially vectorizable.  */
  36 unsigned int
  37 foo2(int len) {
  38   int i;
  39   unsigned int result = 0;
  40
  41   for (i=0; i<len; i++) {
  42     result += (X[i] * Y[i]);
  43   }
  44   return result;
  45 }
  46
  47
  48 int main (void)
  49 {
  50   unsigned int dot1, dot2;
  51   int i;
  52
  53   check_vect ();
  54
  55   for (i=0; i<N; i++) {
  56     X[i] = i;
  57     Y[i] = 64-i;
  58   }
  59
  60   dot1 = foo1 (N);
  61   if (dot1 != DOT1)
  62     abort ();
  63
  64   dot2 = foo2 (N);
  65   if (dot2 != DOT2)
  66     abort ();
  67
  68   return 0;
  69 }
  70
  71 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { xfail *-*-* } } } */
  72 /* { dg-final { cleanup-tree-dump "vect" } } */
  73