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

   1 /* Disabling epilogues until we find a better way to deal with scans.  */
   2 /* { dg-require-effective-target vect_float } */
   3 /* { dg-add-options double_vectors } */
   4 /* { dg-additional-options "--param vect-epilogues-nomask=0 -fdump-tree-optimized-details-blocks" } */
   5
   6 #include <stdarg.h>
   7 #include "tree-vect.h"
   8
   9 #define N 256
  10
  11 /* Unaligned pointer read accesses, aligned write access.
  12    The loop bound is unknown.
  13    No aliasing problems.
  14    vect-60.c is similar to this one with one difference:
  15         the alignment of the read accesses is known.
  16    vect-48.c is similar to this one with one difference:
  17         the loop bound is known.
  18    vect-53.c is similar to this one with one difference:
  19         aliasing is a problem.  */
  20
  21 __attribute__ ((noinline)) int
  22 main1 (int n, float *pb, float *pc)
  23 {
  24   float pa[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
  25   int i;
  26
  27   for (i = 0; i < n; i++)
  28     {
  29       pa[i] = pb[i] * pc[i];
  30     }
  31
  32   /* check results:  */
  33 #pragma GCC novector
  34   for (i = 0; i < N; i++)
  35     {
  36       if (pa[i] != (pb[i] * pc[i]))
  37         abort ();
  38     }
  39
  40   return 0;
  41 }
  42
  43 int main (void)
  44 {
  45   int i;
  46   float a[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
  47   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};
  48   float c[N+1] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__))) = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20};
  49
  50   check_vect ();
  51
  52   main1 (N,&b[1],c);
  53   main1 (N,&b[1],&c[1]);
  54
  55   return 0;
  56 }
  57
  58 /* For targets that don't support misaligned loads we version for the two loads.
  59    (The store is aligned).  */
  60
  61 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
  62 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 3 "vect" { target { ! vect_align_stack_vars } xfail { ! vect_unaligned_possible } } } } */
  63 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 2 "vect" { target vect_align_stack_vars xfail { ! vect_unaligned_possible } } } } */
  64 /* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 0 "vect" } } */
  65 /* { dg-final { scan-tree-dump-times "Alignment of access forced using versioning." 2 "vect" { target { vect_no_align && { ! vect_hw_misalign } } } } } */
  66 /* { dg-final { scan-tree-dump-not "Invalid sum" "optimized" } } */