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
|
/* { dg-require-effective-target vect_int } */
#include <stdlib.h>
#include <stdarg.h>
#include "tree-vect.h"
/* Compile time known misalignment. Cannot use loop peeling to align
the store. */
#define N 16
struct foo {
char x;
int y[N];
} __attribute__((packed));
int x[N] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15};
__attribute__ ((noinline)) int
main1 (struct foo * __restrict__ p)
{
int i;
for (i = 0; i < N; i++)
{
p->y[i] = x[i];
}
/* check results: */
for (i = 0; i < N; i++)
{
if (p->y[i] != x[i])
abort ();
}
return 0;
}
int main (void)
{
int i;
struct foo *p = malloc (2*sizeof (struct foo));
check_vect ();
main1 (p);
return 0;
}
/* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 1 "vect" { target vect_hw_misalign } } } */
/* { dg-final { scan-tree-dump-times "Alignment of access forced using versioning" 1 "vect" { xfail vect_hw_misalign} } } */
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
/* { dg-final { cleanup-tree-dump "vect" } } */
|
