1 /* { dg-do compile } */
2 /* { dg-additional-options "-fno-tree-loop-vectorize" } */
3 /* { dg-require-effective-target lp64 } */
6 f1 (double *p
, double *q
, unsigned int n
)
8 p
= (double *) __builtin_assume_aligned (p
, sizeof (double) * 2);
9 q
= (double *) __builtin_assume_aligned (q
, sizeof (double) * 2);
10 for (unsigned int i
= 0; i
< n
; i
+= 1)
12 double a
= q
[i
] + p
[i
];
13 double b
= q
[i
+ 1] + p
[i
+ 1];
20 f2 (double *p
, double *q
, unsigned int n
)
22 p
= (double *) __builtin_assume_aligned (p
, sizeof (double) * 2);
23 q
= (double *) __builtin_assume_aligned (q
, sizeof (double) * 2);
24 for (unsigned int i
= 0; i
< n
; i
+= 3)
26 double a
= q
[i
] + p
[i
];
27 double b
= q
[i
+ 1] + p
[i
+ 1];
34 f3 (double *p
, double *q
, unsigned int start
, unsigned int n
)
36 p
= (double *) __builtin_assume_aligned (p
, sizeof (double) * 2);
37 q
= (double *) __builtin_assume_aligned (q
, sizeof (double) * 2);
38 for (unsigned int i
= start
; i
< n
; i
+= 2)
40 double a
= q
[i
] + p
[i
];
41 double b
= q
[i
+ 1] + p
[i
+ 1];
47 /* { dg-final { scan-tree-dump-not "basic block vectorized" "slp1" } } */