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

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