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
|
/* { dg-require-effective-target vect_int } */
#include <stdlib.h>
#include <stdarg.h>
#include "tree-vect.h"
/* Compile time unknown misalignment. Cannot use loop peeling to align
the store. */
#define N 17
struct foo {
char x0;
int y[N][N];
} __attribute__ ((packed));
struct foo f2;
int z[16] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15};
__attribute__ ((noinline))
void fbar(struct foo *fp)
{
int i,j;
for (i=0; i<N; i++)
for (j=0; j<N; j++)
f2.y[i][j] = z[i];
for (i=0; i<N; i++)
for (j=0; j<N; j++)
if (f2.y[i][j] != z[i])
abort ();
}
int main (void)
{
struct foo *fp = (struct foo *) malloc (2*sizeof (struct foo));
check_vect ();
fbar(fp);
return 0;
}
/* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 0 "vect" } } */
/* { 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" } } */
|
