1/* { dg-require-effective-target vect_int } */ 2 3#include <stdarg.h> 4#include "tree-vect.h" 5 6#define N 8 7#define OFF 8 8 9/* Check handling of accesses for which the "initial condition" - 10 the expression that represents the first location accessed - is 11 more involved than just an ssa_name. */ 12 13int ib[N+OFF] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__))) = {0, 1, 3, 5, 7, 11, 13, 17, 0, 2, 6, 10, 14, 22, 26, 34}; 14 15__attribute__ ((noinline)) 16int main1 (int *ib, int off) 17{ 18 int i; 19 int ia[N]; 20 21 for (i = 0; i < N; i++) 22 { 23 ia[i] = ib[i+off]; 24 } 25 26 27 /* check results: */ 28 for (i = 0; i < N; i++) 29 { 30 if (ia[i] != ib[i+off]) 31 abort (); 32 } 33 34 return 0; 35} 36 37int main (void) 38{ 39 check_vect (); 40 41 main1 (ib, 8); 42 return 0; 43} 44 45/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */ 46/* { dg-final { cleanup-tree-dump "vect" } } */ 47