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
|
/* { dg-require-effective-target vect_int } */
#include <stdarg.h>
#include "tree-vect.h"
#define N 16
struct s{
int b[N];
int c[N];
int m;
};
struct t{
struct s strc_s;
int m;
};
struct test1{
struct t strc_t;
struct t *ptr_t;
int k;
int l;
};
int a[N] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15};
__attribute__ ((noinline))
int main1 ()
{
int i;
struct test1 tmp1;
struct t tmp2;
tmp1.ptr_t = &tmp2;
/* DR bases comparison: record and array. */
for (i = 0; i < N; i++)
{
tmp1.strc_t.strc_s.b[i] = a[i];
}
/* Check results. */
for (i = 0; i < N; i++)
{
if (tmp1.strc_t.strc_s.b[i] != a[i])
abort();
}
/* DR bases comparison: record containing ptr and array. */
for (i = 0; i < N; i++)
{
tmp1.ptr_t->strc_s.c[i] = a[i];
}
/* Check results. */
for (i = 0; i < N; i++)
{
if (tmp1.ptr_t->strc_s.c[i] != a[i])
abort();
}
return 0;
}
int main (void)
{
check_vect ();
return main1 ();
}
/* { dg-final { scan-tree-dump-times "vectorized 2 loops" 1 "vect" } } */
/* { dg-final { cleanup-tree-dump "vect" } } */
|
