gcc/testsuite/gcc.dg/vect/vect-strided-float.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 __attribute__ ((noinline)) int
   9 main1 (void)
  10 {
  11   int i;
  12   float a[N*2];
  13   float b[N*2] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45,48,51,54,57,60,63,66,69,72,75,78,81,84,87,90,93};
  14   float c[N*2] = {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};
  15
  16   /* Strided access pattern.  */
  17   for (i = 0; i < N/2; i++)
  18     {
  19       a[i*2] = b[2*i+1] * c[2*i+1] - b[2*i] * c[2*i];
  20       a[i*2+1] = b[2*i+8] * c[2*i+9] + b[2*i+9] * c[2*i+8];
  21     }
  22
  23   /* Check results.  */
  24   for (i = 0; i < N/2; i++)
  25     {
  26       if (a[i*2] != b[2*i+1] * c[2*i+1] - b[2*i] * c[2*i]
  27           || a[i*2+1] != b[2*i+8] * c[2*i+9] + b[2*i+9] * c[2*i+8])
  28         abort();
  29     }
  30
  31   return 0;
  32 }
  33
  34 int main (void)
  35 {
  36   check_vect ();
  37   return main1 ();
  38 }
  39
  40 /* Needs interleaving support.  */
  41 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target { vect_interleave && vect_extract_even_odd } } } } */
  42 /* { dg-final { scan-tree-dump-times "vectorized 0 loops" 1 "vect" { xfail { vect_interleave && vect_extract_even_odd } } } } */
  43 /* { dg-final { cleanup-tree-dump "vect" } } */
  44