arm: Use LDMIA/STMIA for thumb1 DI/DF loads/stores
[official-gcc.git] / gcc / testsuite / gcc.dg / vect / vect-56.c
blobd3a8e9eca819768fd3c424c06c834294c5e68172
1 /* Disabling epilogues until we find a better way to deal with scans. */
2 /* { dg-additional-options "--param vect-epilogues-nomask=0 -fdump-tree-optimized-details-blocks" } */
3 /* { dg-require-effective-target vect_float } */
5 #include <stdarg.h>
6 #include "tree-vect.h"
8 #define N 256
10 __attribute__ ((noinline))
11 void bar (float *pa, float *pb, float *pc)
13 int i;
15 /* check results: */
16 #pragma GCC novector
17 for (i = 0; i < N/2; i++)
19 if (pa[i] != (pb[i+1] * pc[i+1]))
20 abort ();
23 return;
26 /* Unaligned pointer read accesses, aligned write access.
27 The loop bound is known and divisible by the vectorization factor.
28 No aliasing problems.
29 vect-48.c is similar to this one with one difference:
30 the alignment of the read accesses is unknown.
31 vect-60.c is similar to this one with one difference:
32 the loop bound is unknown.
33 vect-57.c is similar to this one with two differences:
34 aliasing is a problem, and the write access has unknown alignment. */
36 float b[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__))) = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45,48,51,54,57};
37 float c[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__))) = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19};
39 __attribute__ ((noinline)) int
40 main1 ()
42 int i;
43 float a[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
44 float *pa = a;
45 float *pb = b;
46 float *pc = c;
48 for (i = 0; i < N/2; i++)
50 pa[i] = pb[i+1] * pc[i+1];
53 /* check results: */
54 #pragma GCC novector
55 for (i = 0; i < N/2; i++)
57 if (pa[i] != (pb[i+1] * pc[i+1]))
58 abort ();
61 return 0;
64 int main (void)
66 int i;
68 check_vect ();
69 main1 ();
71 return 0;
74 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { xfail { vect_no_align && { ! vect_hw_misalign } } } } } */
75 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 2 "vect" { target { ! vect_element_align } xfail { ! vect_unaligned_possible } } } } */
76 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 1 "vect" { target { vect_element_align } xfail { ! vect_unaligned_possible } } } } */
77 /* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 0 "vect" { target { { ! vect_element_align } || vect_element_align_preferred} } } } */
78 /* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 1 "vect" { target { vect_element_align && { ! vect_element_align_preferred } } } } } */
79 /* { dg-final { scan-tree-dump-not "Invalid sum" "optimized" } } */