old-autovect-branch/gcc/testsuite/gcc.dg/vect/vect-6.c

   1 /* { dg-require-effective-target vect_float } */
   2
   3 #include <stdarg.h>
   4 #include "tree-vect.h"
   5
   6 #define N 16
   7
   8 float results1[N] = {192.00,240.00,288.00,336.00,384.00,432.00,480.00,528.00,0.00};
   9 float results2[N] = {0.00,0.00,0.00,0.00,0.00,0.00,0.00,0.00,0.00,54.00,120.00,198.00,288.00,390.00,504.00,630.00};
  10
  11 int main1 ()
  12 {
  13   int i;
  14   float a[N] = {0};
  15   float e[N] = {0};
  16   float b[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45};
  17   float c[N] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15};
  18
  19   for (i = 0; i < N/2; i++)
  20     {
  21       a[i] = b[i+N/2] * c[i+N/2] - b[i] * c[i];
  22       e[i+N/2] = b[i] * c[i+N/2] + b[i+N/2] * c[i];
  23     }
  24
  25   /* check results:  */
  26   for (i=0; i<N; i++)
  27     {
  28       if (a[i] != results1[i] || e[i] != results2[i])
  29         abort();
  30     }
  31
  32
  33   for (i = 1; i <=N-4; i++)
  34     {
  35       a[i+3] = b[i-1];
  36     }
  37
  38   /* check results:  */
  39   for (i = 1; i <=N-4; i++)
  40     {
  41       if (a[i+3] != b[i-1])
  42         abort ();
  43     }
  44
  45   return 0;
  46 }
  47
  48 int main (void)
  49 {
  50   check_vect ();
  51
  52   return main1 ();
  53 }
  54
  55 /* { dg-final { scan-tree-dump-times "vectorized 2 loops" 1 "vect" } } */
  56 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 0 "vect" } } */
  57 /* { dg-final { cleanup-tree-dump "vect" } } */
  58
  59