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_int } */
       4  
       5  #include <stdarg.h>
       6  #include "tree-vect.h"
       7  
       8  #define N 128
       9  
      10  struct tmp_struct
      11  {
      12    int x;
      13    int y[N];
      14  };
      15  
      16  __attribute__ ((noinline))
      17  int main1 ()
      18  {
      19    int i, *q;
      20    struct tmp_struct tmp, *p;
      21  
      22    p = &tmp;
      23    q = p->y;
      24  
      25    for (i = 0; i < N; i++)
      26      {
      27        *q++ = 5;
      28      }
      29  
      30    /* check results: */
      31    for (i = 0; i < N; i++)
      32      {
      33        if (p->y[i] != 5)
      34          {
      35            abort ();
      36          }
      37      }
      38  
      39    return 0;
      40  }
      41  
      42  int main (void)
      43  {
      44    check_vect ();
      45  
      46    return main1 ();
      47  }
      48  
      49  /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
      50  /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 0 "vect" { xfail { ! vect_align_stack_vars } } } } */
      51  /* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 1 "vect" { xfail { vect_element_align_preferred || { ! vect_align_stack_vars } } } } } */