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

   1 /* { dg-require-effective-target vect_float } */
   2 /* { dg-additional-options "-fdump-tree-optimized-details-blocks" } */
   3
   4 #include <stdarg.h>
   5 #include "tree-vect.h"
   6
   7 #define N 16
   8
   9 /* Check handling of accesses for which the "initial condition" -
  10    the expression that represents the first location accessed - is
  11    more involved than just an ssa_name.  */
  12
  13 float a[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
  14 float b[N+4] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__))) = {0.0, 1.0, 2.0, 3.0, 4.0, 5.0, 7.0, 9.0, 10.0, 11.0, 12.0, 13.0, 14.0, 15.0, 16.0, 17.0, 18.0, 19.0};
  15 float c[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__))) = {0.5, 1.5, 2.5, 3.5, 4.5, 5.5, 7.5, 9.5, 10.5, 11.5, 12.5, 13.5, 14.5, 15.5};
  16
  17 __attribute__ ((noinline)) int
  18 main1 (float *__restrict__  pa, float * __restrict__ pb, float * __restrict__ pc)
  19 {
  20   int i;
  21   float *q = pb + 4;
  22
  23   for (i = 0; i < N; i++)
  24     {
  25       pa[i] = q[i] * pc[i];
  26     }
  27
  28 #pragma GCC novector
  29   for (i = 0; i < N; i++)
  30     {
  31       if (pa[i] != q[i] * pc[i])
  32         abort();
  33     }
  34
  35   return 0;
  36 }
  37
  38 int main (void)
  39 {
  40   check_vect ();
  41
  42   main1 (a, b, c);
  43
  44   return 0;
  45 }
  46
  47 /* Xfail until handling restrict is refined.  See pr29145 */
  48 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
  49 /* Uncomment when this testcase gets vectorized again:
  50  dg-final { scan-tree-dump-times "Alignment of access forced using versioning" 3 "vect" { target vect_no_align } }
  51  dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 2 "vect" { xfail vect_no_align } }
  52  dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 1 "vect" { xfail vect_no_align } }
  53 */
  54 /* { dg-final { scan-tree-dump-not "Invalid sum" "optimized" } } */