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