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

   1 /* Disabling epilogues until we find a better way to deal with scans.  */
   2 /* { dg-additional-options "--param vect-epilogues-nomask=0 -fdump-tree-optimized-details-blocks" } */
   3 /* { dg-require-effective-target vect_float } */
   4 /* { dg-additional-options "--param vect-max-peeling-for-alignment=0" } */
   5
   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 #pragma GCC novector
  17   for (i = 0; i < N; i++)
  18     {
  19       if (pa[i] != (pb[i] * pc[i]))
  20         abort ();
  21     }
  22
  23   return;
  24 }
  25
  26 /* Unaligned pointer accesses, with unknown alignment.
  27    The loop bound is known and divisible by the vectorization factor.
  28    No aliasing problems.
  29    vect-50.c is similar to this one with one difference:
  30         the loop bound is unknown.
  31    vect-45.c is similar to this one with one difference:
  32         can't prove that pointers don't alias.  */
  33
  34 __attribute__ ((noinline)) int
  35 main1 (float * __restrict__ pa, float * __restrict__ pb, float * __restrict__ pc)
  36 {
  37   int i;
  38
  39   for (i = 0; i < N; i++)
  40     {
  41       pa[i] = pb[i] * pc[i];
  42     }
  43
  44   bar (pa,pb,pc);
  45
  46   return 0;
  47 }
  48
  49 int main (void)
  50 {
  51   int i;
  52   float a[N+4] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
  53   float b[N+4] __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,63,66,69};
  54   float c[N+4] __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,21,22,23};
  55
  56   check_vect ();
  57
  58   main1 (a,b,c);
  59   main1 (&a[1],b,c);
  60   main1 (a,&b[1],c);
  61   main1 (&a[1],&b[1],&c[1]);
  62
  63   return 0;
  64 }
  65
  66 /* For targets that don't support misaligned loads we version for the
  67    all three accesses (peeling to align the store will not force the
  68    two loads to be aligned).  */
  69
  70 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
  71 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 3 "vect" { xfail { ! vect_unaligned_possible } } } } */
  72 /* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 0 "vect" { xfail { { vect_no_align && { ! vect_hw_misalign } } || {! vector_alignment_reachable} } } } } */
  73 /* { dg-final { scan-tree-dump-times "Alignment of access forced using versioning." 3 "vect" { target { vect_no_align && { ! vect_hw_misalign } } } } } */
  74 /* { dg-final { scan-tree-dump-times "Alignment of access forced using versioning." 1 "vect" { target { {! vector_alignment_reachable} && {{! vect_no_align} && {! vect_hw_misalign} } } } } } */
  75 /* { dg-final { scan-tree-dump-not "Invalid sum" "optimized" } } */