1/* { dg-require-effective-target vect_int } */
2/* { dg-add-options bind_pic_locally } */
3
4#include <stdarg.h>
5#include "tree-vect.h"
6
7#define N 8
8#define OFF 8
9
10/* Check handling of accesses for which the "initial condition" -
11   the expression that represents the first location accessed - is
12   more involved than just an ssa_name.  */
13
14int ia[N];
15int ib[N+OFF] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__))) = {0, 1, 3, 5, 7, 11, 13, 17, 0, 2, 6, 10, 14, 22, 26, 34};
16int off = 8;
17
18__attribute__ ((noinline))
19int main1 (int *ib)
20{
21  int i;
22
23  for (i = 0; i < N; i++)
24    {
25      ia[i] = ib[i+off];
26    }
27
28
29  /* check results:  */
30  for (i = 0; i < N; i++)
31    {
32     if (ia[i] != ib[i+off])
33        abort ();
34    }
35
36  return 0;
37}
38
39int main (void)
40{
41  check_vect ();
42
43  main1 (ib);
44  return 0;
45}
46
47/* For targets that don't support misaligned loads we version for the load.
48   (The store is aligned).  */
49
50/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
51/* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 1 "vect" { xfail { vect_no_align && { ! vect_hw_misalign } } } } } */
52/* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 0 "vect" } } */
53/* { dg-final { scan-tree-dump-times "Alignment of access forced using versioning." 1 "vect" { target { vect_no_align && { ! vect_hw_misalign } } } } } */
54/* { dg-final { cleanup-tree-dump "vect" } } */
55