blob: a94140ecabc688b569da0c444ebe3d8ef25d6741 (
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
|
/* { dg-require-effective-target vect_int } */
#include <stdarg.h>
#include "tree-vect.h"
#define N 24
struct s{
int m;
int n[N/6][N/6][N];
};
struct test1{
struct s a; /* array a.n is unaligned */
int b;
int c;
struct s e[N]; /* array e.n is aligned */
};
__attribute__ ((noinline))
int main1 ()
{
int i,j;
struct test1 tmp1;
for (i = 0; i < N; i++)
for (j = 3; j < N-3; j++)
{
tmp1.e[i].n[1][2][j] = 8;
}
/* check results: */
for (i = 0; i < N; i++)
for (j = 3; j < N-3; j++)
{
if (tmp1.e[i].n[1][2][j] != 8)
abort ();
}
/* not consecutive */
for (i = 0; i < N; i++)
for (j = 3; j < N-3; j++)
{
tmp1.e[j].n[1][2][j] = 8;
}
/* check results: */
for (i = 0; i < N; i++)
for (j = 3; j < N-3; j++)
{
if (tmp1.e[j].n[1][2][j] != 8)
abort ();
}
return 0;
}
int main (void)
{
check_vect ();
return main1 ();
}
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
/* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 0 "vect" } } */
/* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 1 "vect" {target { vector_alignment_reachable} } } } */
/* { dg-final { scan-tree-dump-times "Alignment of access forced using versioning" 1 "vect" {target {{! vector_alignment_reachable} && {! vect_hw_misalign} } } } } */
|
