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  /* unaligned store.  */
      11  
      12  __attribute__ ((noinline))
      13  int main1 ()
      14  {
      15    int i;
      16    int ia[N+1];
      17  
      18    for (i = 1; i <= N; i++)
      19      {
      20        ia[i] = 5;
      21      }
      22  
      23    /* check results:  */
      24    for (i = 1; i <= N; i++)
      25      {
      26        if (ia[i] != 5)
      27          abort ();
      28      }
      29  
      30    return 0;
      31  }
      32  
      33  int main (void)
      34  { 
      35    check_vect ();
      36    
      37    return main1 ();
      38  }
      39  
      40  /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
      41  /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 0 "vect" { xfail { ! vect_align_stack_vars } } } } */
      42  /* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 1 "vect" { xfail { vect_element_align_preferred || { ! vect_align_stack_vars } } } } } */