|
111
|
1 /* { dg-require-effective-target vect_float } */
|
|
|
2 /* { dg-add-options double_vectors } */
|
|
|
3
|
|
|
4 #include <stdarg.h>
|
|
|
5 #include "tree-vect.h"
|
|
|
6
|
|
|
7 #define N 256
|
|
|
8
|
|
|
9 /* Unaligned pointer read accesses, aligned write access.
|
|
|
10 The loop bound is unknown.
|
|
|
11 No aliasing problems.
|
|
|
12 vect-60.c is similar to this one with one difference:
|
|
|
13 the alignment of the read accesses is known.
|
|
|
14 vect-48.c is similar to this one with one difference:
|
|
|
15 the loop bound is known.
|
|
|
16 vect-53.c is similar to this one with one difference:
|
|
|
17 aliasing is a problem. */
|
|
|
18
|
|
|
19 __attribute__ ((noinline)) int
|
|
|
20 main1 (int n, float *pb, float *pc)
|
|
|
21 {
|
|
|
22 float pa[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
|
|
|
23 int i;
|
|
|
24
|
|
|
25 for (i = 0; i < n; i++)
|
|
|
26 {
|
|
|
27 pa[i] = pb[i] * pc[i];
|
|
|
28 }
|
|
|
29
|
|
|
30 /* check results: */
|
|
|
31 for (i = 0; i < N; i++)
|
|
|
32 {
|
|
|
33 if (pa[i] != (pb[i] * pc[i]))
|
|
|
34 abort ();
|
|
|
35 }
|
|
|
36
|
|
|
37 return 0;
|
|
|
38 }
|
|
|
39
|
|
|
40 int main (void)
|
|
|
41 {
|
|
|
42 int i;
|
|
|
43 float a[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
|
|
|
44 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};
|
|
|
45 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};
|
|
|
46
|
|
|
47 check_vect ();
|
|
|
48
|
|
|
49 main1 (N,&b[1],c);
|
|
|
50 main1 (N,&b[1],&c[1]);
|
|
|
51
|
|
|
52 return 0;
|
|
|
53 }
|
|
|
54
|
|
|
55 /* For targets that don't support misaligned loads we version for the two loads.
|
|
|
56 (The store is aligned). */
|
|
|
57
|
|
|
58 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
|
|
131
|
59 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 3 "vect" { target { ! vect_align_stack_vars } xfail { ! vect_unaligned_possible } } } } */
|
|
|
60 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 2 "vect" { target vect_align_stack_vars xfail { ! vect_unaligned_possible } } } } */
|
|
111
|
61 /* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 0 "vect" } } */
|
|
|
62 /* { dg-final { scan-tree-dump-times "Alignment of access forced using versioning." 2 "vect" { target { vect_no_align && { ! vect_hw_misalign } } } } } */
|
