gcc/testsuite/gcc.dg/vect/vect-60.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   for (i = 0; i < N/2; i++)
  15     {
  16       if (pa[i] != (pb[i+1] * pc[i+1]))
  17         abort ();
  18     }
  19
  20   return;
  21 }
  22
  23 /* Unaligned pointer read accesses, aligned write access.
  24    The loop bound is unknown
  25    No aliasing problems.
  26    vect-52.c is similar to this one with one difference:
  27         the alignment of the read accesses is unknown.
  28    vect-56.c is similar to this one with one difference:
  29         the loop bound is known.
  30    vect-61.c is similar to this one with two differences:
  31         aliasing is not a problem, and the write access has unknown alignment.  */
  32
  33 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};
  34 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};
  35
  36 __attribute__ ((noinline)) int
  37 main1 (int n)
  38 {
  39   int i;
  40   float a[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
  41   float *pa = a;
  42   float *pb = b;
  43   float *pc = c;
  44
  45   for (i = 0; i < n/2; i++)
  46     {
  47       pa[i] = pb[i+1] * pc[i+1];
  48     }
  49
  50   /* check results:  */
  51   for (i = 0; i < N/2; i++)
  52     {
  53       if (pa[i] != (pb[i+1] * pc[i+1]))
  54         abort ();
  55     }
  56
  57   return 0;
  58 }
  59
  60 int main (void)
  61 {
  62   int i;
  63   int n=N;
  64
  65   check_vect ();
  66   main1 (n);
  67
  68   return 0;
  69 }
  70
  71 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { xfail { vect_no_align && { ! vect_hw_misalign } } } } } */
  72 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 2 "vect" { target { ! vect_element_align } xfail { ! vect_unaligned_possible } } } } */
  73 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 1 "vect" { target { vect_element_align } xfail { ! vect_unaligned_possible } } } } */
  74 /* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 0 "vect" { target { { ! vect_element_align } || vect_element_align_preferred } } } } */
  75 /* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 1 "vect" { target { vect_element_align && { ! vect_element_align_preferred } } } } } */