no-vfa-vect-61.c

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