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-add-options double_vectors } */
       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 known and divisible by the vectorization factor.
      13     No aliasing problems.
      14     vect-56.c is similar to this one with one difference:
      15          the alignment of the read accesses is known.
      16     vect-52.c is similar to this one with one difference:
      17          the loop bound is unknown.
      18     vect-49.c is similar to this one with one difference:
      19          aliasing is a problem.  */
      20  
      21  __attribute__ ((noinline)) int
      22  main1 (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    for (i = 0; i < N; i++)
      34      {
      35        if (pa[i] != (pb[i] * pc[i]))
      36  	abort ();
      37      }
      38  
      39    return 0;
      40  }
      41  
      42  int main (void)
      43  {
      44    int i;
      45    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};
      46    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};
      47  
      48    check_vect ();
      49  
      50    main1 (b,c);
      51    main1 (&b[1],c);
      52  
      53    return 0;
      54  }
      55  
      56  /* For targets that don't support misaligned loads we version for the two loads.
      57     (The store is aligned).  */
      58  
      59  /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect"  } } */
      60  /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 3 "vect" { target { ! vect_align_stack_vars } xfail { ! vect_unaligned_possible } } } } */
      61  /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 2 "vect" { target vect_align_stack_vars xfail { ! vect_unaligned_possible } } } } */
      62  /* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 0 "vect" } } */
      63  /* { dg-final { scan-tree-dump-times "Alignment of access forced using versioning." 2 "vect" { target { vect_no_align && { ! vect_hw_misalign } } } } } */