/* { dg-require-effective-target vect_int } */
|
/* { dg-require-effective-target vect_int } */
|
/* { dg-require-effective-target vect_float } */
|
/* { dg-require-effective-target vect_float } */
|
|
|
#include <stdarg.h>
|
#include <stdarg.h>
|
#include <string.h>
|
#include <string.h>
|
#include "tree-vect.h"
|
#include "tree-vect.h"
|
|
|
#define N 256
|
#define N 256
|
|
|
__attribute__ ((noinline))
|
__attribute__ ((noinline))
|
void bar (float *pa, float *pb, float *pc)
|
void bar (float *pa, float *pb, float *pc)
|
{
|
{
|
int i;
|
int i;
|
|
|
/* check results: */
|
/* check results: */
|
for (i = 0; i < N/2; i++)
|
for (i = 0; i < N/2; i++)
|
{
|
{
|
if (pa[i] != (pb[i+1] * pc[i+1]))
|
if (pa[i] != (pb[i+1] * pc[i+1]))
|
abort ();
|
abort ();
|
}
|
}
|
|
|
return;
|
return;
|
}
|
}
|
|
|
__attribute__ ((noinline))
|
__attribute__ ((noinline))
|
void foo (float *pb, float *pc)
|
void foo (float *pb, float *pc)
|
{
|
{
|
float b[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45,48,51,54,57};
|
float b[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45,48,51,54,57};
|
float c[N] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19};
|
float c[N] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19};
|
memcpy (pb, b, sizeof (b));
|
memcpy (pb, b, sizeof (b));
|
memcpy (pc, c, sizeof (c));
|
memcpy (pc, c, sizeof (c));
|
}
|
}
|
|
|
/* Unaligned pointer read accesses with known alignment,
|
/* Unaligned pointer read accesses with known alignment,
|
and an unaligned write access with unknown alignment.
|
and an unaligned write access with unknown alignment.
|
The loop bound is iunknown.
|
The loop bound is iunknown.
|
Can't prove that the pointers don't alias.
|
Can't prove that the pointers don't alias.
|
vect-57.c is similar to this one with one difference:
|
vect-57.c is similar to this one with one difference:
|
the loop bound is known.
|
the loop bound is known.
|
vect-60.c is similar to this one with two differences:
|
vect-60.c is similar to this one with two differences:
|
aliasing is not a problem, and the write access is unaligned. */
|
aliasing is not a problem, and the write access is unaligned. */
|
|
|
__attribute__ ((noinline)) int
|
__attribute__ ((noinline)) int
|
main1 (int n , float *pa)
|
main1 (int n , float *pa)
|
{
|
{
|
int i;
|
int i;
|
float b[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
|
float b[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
|
float c[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
|
float c[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
|
float *pb = b;
|
float *pb = b;
|
float *pc = c;
|
float *pc = c;
|
|
|
foo (pb, pc);
|
foo (pb, pc);
|
|
|
for (i = 0; i < n/2; i++)
|
for (i = 0; i < n/2; i++)
|
{
|
{
|
pa[i] = pb[i+1] * pc[i+1];
|
pa[i] = pb[i+1] * pc[i+1];
|
}
|
}
|
|
|
bar (pa,pb,pc);
|
bar (pa,pb,pc);
|
|
|
return 0;
|
return 0;
|
}
|
}
|
|
|
int main (void)
|
int main (void)
|
{
|
{
|
int i;
|
int i;
|
int n=N;
|
int n=N;
|
float a[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
|
float a[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
|
|
|
check_vect ();
|
check_vect ();
|
main1 (n,a);
|
main1 (n,a);
|
|
|
return 0;
|
return 0;
|
}
|
}
|
|
|
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { xfail vect_no_align } } } */
|
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { xfail vect_no_align } } } */
|
/* { dg-final { cleanup-tree-dump "vect" } } */
|
/* { dg-final { cleanup-tree-dump "vect" } } */
|
|
|
