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
|
/* { dg-require-effective-target vect_float } */
#include <stdarg.h>
#include "tree-vect.h"
#define N 256
/* Unaligned pointer read accesses, aligned write access.
The loop bound is unknown.
No aliasing problems.
vect-60.c is similar to this one with one difference:
the alignment of the read accesses is known.
vect-48.c is similar to this one with one difference:
the loop bound is known.
vect-53.c is similar to this one with one difference:
aliasing is a problem. */
__attribute__ ((noinline)) int
main1 (int n, float *pb, float *pc)
{
float pa[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
int i;
for (i = 0; i < n; i++)
{
pa[i] = pb[i] * pc[i];
}
/* check results: */
for (i = 0; i < N; i++)
{
if (pa[i] != (pb[i] * pc[i]))
abort ();
}
return 0;
}
int main (void)
{
int i;
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 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 ();
main1 (N,&b[1],c);
main1 (N,&b[1],&c[1]);
return 0;
}
/* For targets that don't support misaligned loads we version for the two loads.
(The store is aligned). */
/* { 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 "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 { cleanup-tree-dump "vect" } } */
|
