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
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
|
/* { dg-require-effective-target vect_int } */
/* { dg-require-effective-target vect_float } */
#include <stdarg.h>
#include <string.h>
#include "tree-vect.h"
#define N 256
__attribute__ ((noinline))
void bar (float *pa, float *pb, float *pc)
{
int i;
/* check results: */
for (i = 0; i < N/2; i++)
{
if (pa[i] != (pb[i+1] * pc[i+1]))
abort ();
}
return;
}
__attribute__ ((noinline))
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 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 (pc, c, sizeof (c));
}
/* Unaligned pointer read accesses with known alignment,
and an unaligned write access with unknown alignment.
The loop bound is iunknown.
Can't prove that the pointers don't alias.
vect-57.c is similar to this one with one difference:
the loop bound is known.
vect-60.c is similar to this one with two differences:
aliasing is not a problem, and the write access is unaligned. */
__attribute__ ((noinline)) int
main1 (int n , float *pa)
{
int i;
float b[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
float c[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
float *pb = b;
float *pc = c;
foo (pb, pc);
for (i = 0; i < n/2; i++)
{
pa[i] = pb[i+1] * pc[i+1];
}
bar (pa,pb,pc);
return 0;
}
int main (void)
{
int i;
int n=N;
float a[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
check_vect ();
main1 (n,a);
return 0;
}
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { xfail vect_no_align } } } */
/* { dg-final { cleanup-tree-dump "vect" } } */
|
