(root)/
gcc-13.2.0/
gcc/
testsuite/
gcc.dg/
vect/
vect-58.c
       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  
       5  #include <stdarg.h>
       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/2; i++)
      17      {
      18        if (pa[i+1] != (pb[i+1] * pc[i+1]))
      19  	abort ();
      20      }
      21  
      22    return;
      23  }
      24  
      25  /* Unaligned pointer accesses, with a known alignment.
      26     The loop bound is unknown.
      27     No aliasing problems.
      28     vect-54.c is similar to this one with one difference:
      29          the loop bound is known.  */
      30  
      31  float a[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));  float b[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__))) = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45,48,51,54,57};  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};
      32  
      33  __attribute__ ((noinline)) int
      34  main1 (int n)
      35  {
      36    int i;
      37    float *pa = a;
      38    float *pb = b;
      39    float *pc = c;
      40  
      41    for (i = 0; i < n/2; i++)
      42      {
      43        pa[i+1] = pb[i+1] * pc[i+1];
      44      }
      45  
      46    bar (a,b,c);
      47  
      48    return 0;
      49  }
      50  
      51  int main (void)
      52  {
      53    int i;
      54    int n=N;
      55  
      56    check_vect ();
      57    main1 (n);
      58  
      59    return 0;
      60  }
      61  
      62  /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
      63  /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 0 "vect" } } */
      64  /* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 1 "vect" { xfail vect_element_align_preferred } } } */