gcc/testsuite/gcc.dg/vect/no-vfa-vect-49.c

   1 /* { dg-require-effective-target vect_float } */
   2
   3 #include <stdarg.h>
   4 #include "tree-vect.h"
   5
   6 #define N 256
   7
   8 __attribute__ ((noinline))
   9 void bar (float *pa, float *pb, float *pc)
  10 {
  11   int i;
  12
  13   /* check results:  */
  14 #pragma GCC novector
  15   for (i = 0; i < N; i++)
  16     {
  17       if (pa[i] != (pb[i] * pc[i]))
  18         abort ();
  19     }
  20
  21   return;
  22 }
  23
  24 /* Unaligned pointer read accesses, aligned pointer write access.
  25    The loop bound is known and divisible by the vectorization factor.
  26    Can't prove that the pointers don't alias.
  27    vect-53.c is similar to this one with one difference:
  28         the loop bound is unknown.
  29    vect-48.c is similar to this one with one difference:
  30         aliasing is not a problem.  */
  31
  32 __attribute__ ((noinline)) int
  33 main1 (float *pb, float *pc)
  34 {
  35   float pa[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
  36   int i;
  37
  38   for (i = 0; i < N; i++)
  39     {
  40       pa[i] = pb[i] * pc[i];
  41     }
  42
  43   bar (pa,pb,pc);
  44
  45   return 0;
  46 }
  47
  48 int main (void)
  49 {
  50   int i;
  51   float b[N+1] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__))) = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45,48,51,54,57,60};
  52   float c[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__))) = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19};
  53
  54   check_vect ();
  55
  56   main1 (b,c);
  57   main1 (&b[1],c);
  58
  59   return 0;
  60 }
  61
  62 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */