blob: f75691431abb51ae0f1d2fc5a4c97d4bb973ad75 (
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
|
/* { dg-require-effective-target vect_int } */
#include <stdarg.h>
#include "tree-vect.h"
#define N 128
typedef struct {
int a;
int b;
int c;
int d;
int e;
} s;
int
main1 (s *arr)
{
int i;
s *ptr = arr;
s res[N];
/* SLP with unrolling by 4. */
for (i = 0; i < N; i++)
{
res[i].c = ptr->c + ptr->c;
res[i].a = ptr->a + ptr->a;
res[i].d = ptr->d + ptr->d;
res[i].b = ptr->b + ptr->b;
res[i].e = ptr->e + ptr->e;
ptr++;
}
/* check results: */
for (i = 0; i < N; i++)
{
if (res[i].c != arr[i].c + arr[i].c
|| res[i].a != arr[i].a + arr[i].a
|| res[i].d != arr[i].d + arr[i].d
|| res[i].b != arr[i].b + arr[i].b
|| res[i].e != arr[i].e + arr[i].e)
abort();
}
}
int main (void)
{
int i;
s arr[N];
check_vect ();
for (i = 0; i < N; i++)
{
arr[i].a = i;
arr[i].b = i * 2;
arr[i].c = 17;
arr[i].d = i+34;
arr[i].e = i * 3 + 5;
if (arr[i].a == 178)
abort();
}
main1 (arr);
return 0;
}
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
/* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 1 "vect" } } */
/* { dg-final { cleanup-tree-dump "vect" } } */
|
