blob: cc877293cea72c774893e62865b6c3d4b92e7e92 (
plain)
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
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
|
/* { dg-require-effective-target vect_int } */
#include <stdarg.h>
#include "tree-vect.h"
#define N 32
typedef struct {
unsigned char a;
unsigned char b;
} s;
typedef struct {
unsigned int a;
unsigned int b;
} ii;
volatile int y = 0;
__attribute__ ((noinline)) int
main1 (s *arr, ii *iarr)
{
s *ptr = arr;
ii *iptr = iarr;
s res[N];
ii ires[N];
int i;
for (i = 0; i < N; i++)
{
ires[i].a = iptr->b;
ires[i].b = iptr->a;
res[i].b = ptr->b - ptr->a;
res[i].a = ptr->b + ptr->a;
iptr++;
ptr++;
}
/* check results: */
for (i = 0; i < N; i++)
{
if (res[i].b != arr[i].b - arr[i].a
|| ires[i].a != iarr[i].b
|| res[i].a != arr[i].b + arr[i].a
|| ires[i].b != iarr[i].a
)
abort ();
}
return 0;
}
int main (void)
{
int i;
s arr[N];
ii iarr[N];
check_vect ();
for (i = 0; i < N; i++)
{
arr[i].a = i;
arr[i].b = i * 2;
iarr[i].a = i;
iarr[i].b = i * 3;
if (y) /* Avoid vectorization. */
abort ();
}
main1 (arr, iarr);
return 0;
}
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target vect_strided2 } } } */
/* { dg-final { cleanup-tree-dump "vect" } } */
|
