1 /* { dg-require-effective-target vect_int } */
2
3 #include <stdarg.h>
4 #include "tree-vect.h"
5
6 #define N 24
7 #define OFF 4
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
13 int ib[N+OFF] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__))) = {0, 1, 3, 5, 7, 11, 13, 17, 0, 2, 6, 10};
14 int ic[N+OFF] = {0, 1, 3, 5, 7, 11, 13, 17, 0, 2, 6, 10};
15
16 __attribute__ ((noinline))
main1(int * pib)17 int main1 (int *pib)
18 {
19 int i;
20 int ia[N+OFF];
21
22 for (i = OFF; i < N; i++)
23 {
24 ia[i] = pib[i - OFF];
25 }
26
27
28 /* check results: */
29 for (i = OFF; i < N; i++)
30 {
31 if (ia[i] != pib[i - OFF])
32 abort ();
33 }
34
35 for (i = 0; i < N; i++)
36 {
37 ia[i] = pib[i - OFF];
38 }
39
40
41 /* check results: */
42 for (i = 0; i < N; i++)
43 {
44 if (ia[i] != pib[i - OFF])
45 abort ();
46 }
47
48 for (i = OFF; i < N; i++)
49 {
50 ia[i] = ic[i - OFF];
51 }
52
53
54 /* check results: */
55 for (i = OFF; i < N; i++)
56 {
57 if (ia[i] != ic[i - OFF])
58 abort ();
59 }
60
61 return 0;
62 }
63
main(void)64 int main (void)
65 {
66 check_vect ();
67
68 main1 (&ib[OFF]);
69 return 0;
70 }
71
72
73 /* { dg-final { scan-tree-dump-times "vectorized 3 loops" 1 "vect" } } */
74