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 ib[N+OFF] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__))) = {0, 1, 3, 5, 7, 11, 13, 17, 0, 2, 6, 10, 14, 22, 26, 34}; 15int ia[N]; 16 17__attribute__ ((noinline)) 18int main1 (int *ib, int off) 19{ 20 int i; 21 22 for (i = 0; i < N; i++) 23 { 24 ia[i] = ib[i+off]; 25 } 26 27 28 /* check results: */ 29 for (i = 0; i < N; i++) 30 { 31 if (ia[i] != ib[i+off]) 32 abort (); 33 } 34 35 return 0; 36} 37 38int main (void) 39{ 40 check_vect (); 41 42 main1 (ib, 8); 43 return 0; 44} 45 46/* For targets that don't support misaligned loads we version for the load. 47 (The store is aligned). */ 48/* Requires versioning for aliasing. */ 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