/* { 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
|
|
|
/* Unaligned pointer read accesses, aligned write access.
|
/* Unaligned pointer read accesses, aligned write access.
|
The loop bound is unknown.
|
The loop bound is unknown.
|
No aliasing problems.
|
No aliasing problems.
|
vect-60.c is similar to this one with one difference:
|
vect-60.c is similar to this one with one difference:
|
the alignment of the read accesses is known.
|
the alignment of the read accesses is known.
|
vect-48.c is similar to this one with one difference:
|
vect-48.c is similar to this one with one difference:
|
the loop bound is known.
|
the loop bound is known.
|
vect-53.c is similar to this one with one difference:
|
vect-53.c is similar to this one with one difference:
|
aliasing is a problem. */
|
aliasing is a problem. */
|
|
|
__attribute__ ((noinline)) int
|
__attribute__ ((noinline)) int
|
main1 (int n, float *pb, float *pc)
|
main1 (int n, float *pb, float *pc)
|
{
|
{
|
float pa[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
|
float pa[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
|
int i;
|
int i;
|
|
|
for (i = 0; i < n; i++)
|
for (i = 0; i < n; i++)
|
{
|
{
|
pa[i] = pb[i] * pc[i];
|
pa[i] = pb[i] * pc[i];
|
}
|
}
|
|
|
/* check results: */
|
/* check results: */
|
for (i = 0; i < N; i++)
|
for (i = 0; i < N; i++)
|
{
|
{
|
if (pa[i] != (pb[i] * pc[i]))
|
if (pa[i] != (pb[i] * pc[i]))
|
abort ();
|
abort ();
|
}
|
}
|
|
|
return 0;
|
return 0;
|
}
|
}
|
|
|
int main (void)
|
int main (void)
|
{
|
{
|
int i;
|
int i;
|
float a[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
|
float a[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
|
float b[N+1] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__))) = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45,48,51,54,57,60};
|
float b[N+1] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__))) = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45,48,51,54,57,60};
|
float c[N+1] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__))) = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20};
|
float c[N+1] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__))) = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20};
|
|
|
check_vect ();
|
check_vect ();
|
|
|
main1 (N,&b[1],c);
|
main1 (N,&b[1],c);
|
main1 (N,&b[1],&c[1]);
|
main1 (N,&b[1],&c[1]);
|
|
|
return 0;
|
return 0;
|
}
|
}
|
|
|
/* For targets that don't support misaligned loads we version for the two loads.
|
/* For targets that don't support misaligned loads we version for the two loads.
|
(The store is aligned). */
|
(The store is aligned). */
|
|
|
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
|
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
|
/* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 2 "vect" { xfail vect_no_align } } } */
|
/* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 2 "vect" { xfail vect_no_align } } } */
|
/* { 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 peeling" 0 "vect" } } */
|
/* { dg-final { scan-tree-dump-times "Alignment of access forced using versioning." 2 "vect" { target vect_no_align } } } */
|
/* { dg-final { scan-tree-dump-times "Alignment of access forced using versioning." 2 "vect" { target vect_no_align } } } */
|
/* { dg-final { cleanup-tree-dump "vect" } } */
|
/* { dg-final { cleanup-tree-dump "vect" } } */
|
|
|