69 lines
1.4 KiB
C
69 lines
1.4 KiB
C
/* { 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, will use strided stores */
|
|
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 2 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} } } } } */
|