Subversion Repositories openrisc_2011-10-31

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

#include <stdarg.h>

#include "tree-vect.h"

#define N 8

#define OFF 8

/* Check handling of accesses for which the "initial condition" -

   the expression that represents the first location accessed - is

   more involved than just an ssa_name.  */

int ia[N];

int ib[N+OFF] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__))) = {0, 1, 3, 5, 7, 11, 13, 17, 0, 2, 6, 10, 14, 22, 26, 34};

int off = 8;

__attribute__ ((noinline))

int main1 (int *ib)

{

  int i;

  for (i = 0; i < N; i++)

    {

      ia[i] = ib[i+off];

    }

  /* check results:  */

  for (i = 0; i < N; i++)

    {

     if (ia[i] != ib[i+off])

        abort ();

    }

  return 0;

}

int main (void)

{

  check_vect ();

  main1 (ib);

  return 0;

}

/* For targets that don't support misaligned loads we version for the load.

   (The store is aligned).  */

/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */

/* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 1 "vect" { xfail { vect_no_align } } } } */

/* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 0 "vect" } } */

/* { dg-final { scan-tree-dump-times "Alignment of access forced using versioning." 1 "vect" { target vect_no_align } } } */

/* { dg-final { cleanup-tree-dump "vect" } } */