/* { dg-require-effective-target vect_float } */
|
/* { dg-require-effective-target vect_float } */
|
|
|
#include <stdarg.h>
|
#include <stdarg.h>
|
#include "tree-vect.h"
|
#include "tree-vect.h"
|
|
|
#define N 256
|
#define N 256
|
|
|
float pa[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
|
float pa[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
|
float pb[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__))) = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45,48,51,54,57};
|
float pb[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__))) = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45,48,51,54,57};
|
float pc[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__))) = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19};
|
float pc[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__))) = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19};
|
|
|
/* Check handling of unaligned accesses when the misalignment is
|
/* Check handling of unaligned accesses when the misalignment is
|
known at compile time and different accesses have the same
|
known at compile time and different accesses have the same
|
misalignment (e.g. peeling to align one access will align all
|
misalignment (e.g. peeling to align one access will align all
|
accesses with the same misalignment. Also, the number of
|
accesses with the same misalignment. Also, the number of
|
peeled iterations is known in this case, and the vectorizer
|
peeled iterations is known in this case, and the vectorizer
|
can use this information (generate prolog and epilog loops
|
can use this information (generate prolog and epilog loops
|
with known number of iterations, and only if needed). */
|
with known number of iterations, and only if needed). */
|
|
|
__attribute__ ((noinline)) int
|
__attribute__ ((noinline)) int
|
main1 ()
|
main1 ()
|
{
|
{
|
int i;
|
int i;
|
|
|
for (i = 0; i < 10; i++)
|
for (i = 0; i < 10; i++)
|
{
|
{
|
pa[i+1] = pb[i+1] * pc[i+1];
|
pa[i+1] = pb[i+1] * pc[i+1];
|
}
|
}
|
|
|
/* check results: */
|
/* check results: */
|
for (i = 0; i < 10; i++)
|
for (i = 0; i < 10; i++)
|
{
|
{
|
if (pa[i+1] != (pb[i+1] * pc[i+1]))
|
if (pa[i+1] != (pb[i+1] * pc[i+1]))
|
abort ();
|
abort ();
|
}
|
}
|
|
|
return 0;
|
return 0;
|
}
|
}
|
|
|
__attribute__ ((noinline)) int
|
__attribute__ ((noinline)) int
|
main2 ()
|
main2 ()
|
{
|
{
|
int i;
|
int i;
|
|
|
for (i = 0; i < 12; i++)
|
for (i = 0; i < 12; i++)
|
{
|
{
|
pa[i+1] = pb[i+1] * pc[i+1];
|
pa[i+1] = pb[i+1] * pc[i+1];
|
}
|
}
|
|
|
/* check results: */
|
/* check results: */
|
for (i = 0; i < 12; i++)
|
for (i = 0; i < 12; i++)
|
{
|
{
|
if (pa[i+1] != (pb[i+1] * pc[i+1]))
|
if (pa[i+1] != (pb[i+1] * pc[i+1]))
|
abort ();
|
abort ();
|
}
|
}
|
|
|
return 0;
|
return 0;
|
}
|
}
|
|
|
__attribute__ ((noinline)) int
|
__attribute__ ((noinline)) int
|
main3 (int n)
|
main3 (int n)
|
{
|
{
|
int i;
|
int i;
|
|
|
for (i = 0; i < n; i++)
|
for (i = 0; i < n; i++)
|
{
|
{
|
pa[i+1] = pb[i+1] * pc[i+1];
|
pa[i+1] = pb[i+1] * pc[i+1];
|
}
|
}
|
|
|
/* check results: */
|
/* check results: */
|
for (i = 0; i < n; i++)
|
for (i = 0; i < n; i++)
|
{
|
{
|
if (pa[i+1] != (pb[i+1] * pc[i+1]))
|
if (pa[i+1] != (pb[i+1] * pc[i+1]))
|
abort ();
|
abort ();
|
}
|
}
|
|
|
return 0;
|
return 0;
|
}
|
}
|
|
|
int main (void)
|
int main (void)
|
{
|
{
|
int i;
|
int i;
|
|
|
check_vect ();
|
check_vect ();
|
|
|
main1 ();
|
main1 ();
|
main2 ();
|
main2 ();
|
main3 (N-1);
|
main3 (N-1);
|
|
|
return 0;
|
return 0;
|
}
|
}
|
|
|
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 3 "vect" } } */
|
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 3 "vect" } } */
|
/* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 0 "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" 3 "vect" } } */
|
/* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 3 "vect" } } */
|
/* { dg-final { cleanup-tree-dump "vect" } } */
|
/* { dg-final { cleanup-tree-dump "vect" } } */
|
|
|
