gcc/testsuite/gcc.dg/vect/vect-54.c

   1 /* { dg-require-effective-target vect_float } */
   2 /* { dg-add-options double_vectors } */
   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   for (i = 0; i < N/2; i++)
  16     {
  17       if (pa[i+1] != (pb[i+1] * pc[i+1]))
  18         abort ();
  19     }
  20
  21   return;
  22 }
  23
  24 /* Unaligned pointer accesses, with a known alignment.
  25    The loop bound is known and divisible by the vectorization factor.
  26    No aliasing problems.
  27    vect-58.c is similar to this one with one difference:
  28         the loop bound is unknown.  */
  29
  30 float b[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__))) = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45,48,51,54,57};
  31 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};
  32
  33 __attribute__ ((noinline)) int
  34 main1 ()
  35 {
  36   int i;
  37   float a[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
  38   float *pa = a;
  39   float *pb = b;
  40   float *pc = c;
  41
  42   for (i = 0; i < N/2; i++)
  43     {
  44       pa[i+1] = pb[i+1] * pc[i+1];
  45     }
  46
  47   bar (a,b,c);
  48
  49   return 0;
  50 }
  51
  52 int main (void)
  53 {
  54   int i;
  55
  56   check_vect ();
  57   main1 ();
  58
  59   return 0;
  60 }
  61
  62 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
  63 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 0 "vect" { xfail { ! vect_align_stack_vars } } } } */
  64 /* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 1 "vect" { xfail vect_element_align_preferred } } } */