gnu/dist/gcc4/gcc/testsuite/gcc.dg/vect/vect-107.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 int
   9 main1 (void)
  10 {
  11   int i;
  12   float a[N];
  13   float b[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45};
  14   float c[N] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15};
  15   float d[N] = {0,2,4,6,8,10,12,14,16,18,20,22,24,26,28,30};
  16
  17   /* Strided access pattern.  */
  18   for (i = 0; i < N/2; i++)
  19     {
  20       a[i] = b[2*i+1] * c[2*i+1] - b[2*i] * c[2*i];
  21       d[i] = b[2*i] * c[2*i+1] + b[2*i+1] * c[2*i];
  22     }
  23
  24   /* Check results.  */
  25   for (i = 0; i < N/2; i++)
  26     {
  27       if (a[i] != b[2*i+1] * c[2*i+1] - b[2*i] * c[2*i]
  28           || d[i] != b[2*i] * c[2*i+1] + b[2*i+1] * c[2*i])
  29         abort();
  30     }
  31
  32   return 0;
  33 }
  34
  35 int main (void)
  36 {
  37   check_vect ();
  38   return main1 ();
  39 }
  40
  41 /* { dg-final { scan-tree-dump-times "vectorized 0 loops" 1 "vect" } } */
  42 /* { dg-final { cleanup-tree-dump "vect" } } */