blob: e423148407d47ac157bdf4f5524d327257596ccb (
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
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
|
#include <stdarg.h>
#include "tree-vect.h"
#define N 128
typedef struct {
unsigned short a;
unsigned short b;
unsigned short c;
} s;
#define A(I) (I)
#define B(I) ((I) * 2)
#define C(I) ((unsigned short) ~((I) ^ 0x18))
void __attribute__ ((noinline))
check1 (s *res)
{
int i;
for (i = 0; i < N; i++)
if (res[i].a != C (i)
|| res[i].b != A (i)
|| res[i].c != B (i))
abort ();
}
void __attribute__ ((noinline))
check2 (unsigned short *res)
{
int i;
for (i = 0; i < N; i++)
if (res[i] != (unsigned short) (A (i) + B (i) + C (i)))
abort ();
}
void __attribute__ ((noinline))
check3 (s *res)
{
int i;
for (i = 0; i < N; i++)
if (res[i].a != i
|| res[i].b != i
|| res[i].c != i)
abort ();
}
void __attribute__ ((noinline))
check4 (unsigned short *res)
{
int i;
for (i = 0; i < N; i++)
if (res[i] != (unsigned short) (A (i) + B (i)))
abort ();
}
void __attribute__ ((noinline))
main1 (s *arr)
{
int i;
s *ptr = arr;
s res1[N];
unsigned short res2[N];
for (i = 0; i < N; i++)
{
res1[i].a = arr[i].c;
res1[i].b = arr[i].a;
res1[i].c = arr[i].b;
}
check1 (res1);
for (i = 0; i < N; i++)
res2[i] = arr[i].a + arr[i].b + arr[i].c;
check2 (res2);
for (i = 0; i < N; i++)
{
res1[i].a = i;
res1[i].b = i;
res1[i].c = i;
}
check3 (res1);
for (i = 0; i < N; i++)
res2[i] = arr[i].a + arr[i].b;
check4 (res2);
}
int main (void)
{
int i;
s arr[N];
check_vect ();
for (i = 0; i < N; i++)
{
arr[i].a = A (i);
arr[i].b = B (i);
arr[i].c = C (i);
}
main1 (arr);
return 0;
}
/* { dg-final { scan-tree-dump-times "vectorized 4 loops" 1 "vect" { target vect_strided3 } } } */
/* { dg-final { cleanup-tree-dump "vect" } } */
|
