/* { dg-require-effective-target vect_int } */

#include <stdarg.h>
#include "tree-vect.h"

#define N 128

int ic[N*2];
int ib[N];

#define ia (ic+N)

volatile int y = 0;

__attribute__ ((noinline))
int main1 ()
{
  int i, j;

  for (i = 0; i < N; i++)
    {
      ib[i] = i*3;
      if (y)
	abort ();
    }

  for (i = 0; i < N; i++)
    {
       ia[i] = ib[i];
    }

  /* check results: */
  for (i = 0; i < N; i++)
    {
       if (ia[i] != ib[i])
         abort ();
    }

  return 0;
}

int main (void)
{
  check_vect ();

  return main1 ();
}

/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
/* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 0 "vect" } } */
/* { dg-final { cleanup-tree-dump "vect" } } */