1 /* { dg-require-effective-target vect_float } */
2
3 #include <stdarg.h>
4 #include "tree-vect.h"
5
6 #define N 16
7
8 float b[N*2] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45,48,51,54,57,60,63,66,69,72,75,78,81,84,87,90,93};
9 float c[N*2] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31};
10
11 __attribute__ ((noinline)) int
main1(void)12 main1 (void)
13 {
14 int i;
15 float a[N*2];
16
17 /* Strided access pattern. */
18 for (i = 0; i < N/2; i++)
19 {
20 a[i*2] = b[2*i+1] * c[2*i+1] - b[2*i] * c[2*i];
21 a[i*2+1] = b[2*i+8] * c[2*i+9] + b[2*i+9] * c[2*i+8];
22 }
23
24 /* Check results. */
25 for (i = 0; i < N/2; i++)
26 {
27 if (a[i*2] != b[2*i+1] * c[2*i+1] - b[2*i] * c[2*i]
28 || a[i*2+1] != b[2*i+8] * c[2*i+9] + b[2*i+9] * c[2*i+8])
29 abort();
30 }
31
32 return 0;
33 }
34
main(void)35 int main (void)
36 {
37 check_vect ();
38 return main1 ();
39 }
40
41 /* Needs interleaving support. */
42 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target vect_strided2 } } } */
43 /* { dg-final { scan-tree-dump-times "vectorized 0 loops" 1 "vect" { xfail vect_strided2 } } } */
44
45