1  /* { dg-require-effective-target vect_int } */
       2  
       3  #include <stdarg.h>
       4  #include "tree-vect.h"
       5  
       6  #define N 16
       7   
       8  __attribute__ ((noinline))
       9  int main1 ()
      10  {  
      11    union {
      12      unsigned char a[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
      13      unsigned char b[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
      14    } s;
      15    int i;
      16  
      17    /* Initialization.  */
      18    for (i = 0; i < N; i++)
      19      {
      20        s.b[i] = i;
      21      }
      22  
      23    for (i = 0; i < N; i++)
      24      {
      25        s.a[i] = s.b[i] + 1;
      26      }
      27  
      28    /* check results:  */
      29    for (i = 0; i < N; i++)
      30      {
      31        if (s.a[i] != i + 1)
      32  	abort ();
      33      }
      34  
      35    return 0;
      36  }
      37  
      38  int main (void)
      39  { 
      40    check_vect ();
      41    
      42    return main1 ();
      43  } 
      44  
      45  
      46  /* { dg-final { scan-tree-dump-times "vectorized 2 loops" 1 "vect"  { xfail { ia64-*-* sparc*-*-* } } } } */