Merge -r 127928:132243 from trunk
[official-gcc.git] / gcc / testsuite / gcc.dg / vect / vect-56.c
blob387bd3ab8546bb21e35fff9ce172631a0da6b588
1 /* { dg-require-effective-target vect_float } */
3 #include <stdarg.h>
4 #include "tree-vect.h"
6 #define N 256
8 __attribute__ ((noinline))
9 void bar (float *pa, float *pb, float *pc)
11 int i;
13 /* check results: */
14 for (i = 0; i < N/2; i++)
16 if (pa[i] != (pb[i+1] * pc[i+1]))
17 abort ();
20 return;
23 /* Unaligned pointer read accesses, aligned write access.
24 The loop bound is known and divisible by the vectorization factor.
25 No aliasing problems.
26 vect-48.c is similar to this one with one difference:
27 the alignment of the read accesses is unknown.
28 vect-60.c is similar to this one with one difference:
29 the loop bound is unknown.
30 vect-57.c is similar to this one with two differences:
31 aliasing is a problem, and the write access has unknown alignment. */
33 __attribute__ ((noinline)) int
34 main1 ()
36 int i;
37 float a[N] __attribute__ ((__aligned__(16)));
38 float b[N] __attribute__ ((__aligned__(16))) = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45,48,51,54,57};
39 float c[N] __attribute__ ((__aligned__(16))) = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19};
40 float *pa = a;
41 float *pb = b;
42 float *pc = c;
44 for (i = 0; i < N/2; i++)
46 pa[i] = pb[i+1] * pc[i+1];
49 /* check results: */
50 for (i = 0; i < N/2; i++)
52 if (pa[i] != (pb[i+1] * pc[i+1]))
53 abort ();
56 return 0;
59 int main (void)
61 int i;
63 check_vect ();
64 main1 ();
66 return 0;
69 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { xfail vect_no_align } } } */
70 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 2 "vect" { xfail vect_no_align } } } */
71 /* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 0 "vect" } } */
72 /* { dg-final { cleanup-tree-dump "vect" } } */