libcpp, c, middle-end: Optimize initializers using #embed in C
[official-gcc.git] / gcc / testsuite / gcc.dg / vect / no-vfa-vect-45.c
blob5db05288c81bf5c4c158efbc50f6d4862bf3f335
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 (const float *pa, const float *pb, const float *pc)
11 int i;
13 /* check results: */
14 #pragma GCC novector
15 for (i = 0; i < N; i++)
17 if (pa[i] != (pb[i] * pc[i]))
18 abort ();
21 return;
24 /* Unaligned pointer accesses, with unknown alignment.
25 The loop bound is known and divisible by the vectorization factor.
26 Can't prove that the pointers don't alias.
27 vect-51.c is similar to this one with one difference:
28 the loop bound is unknown.
29 vect-44.c is similar to this one with one difference:
30 Aliasing is not a problem. */
32 __attribute__ ((noinline)) int
33 main1 (float *pa, float *pb, float *pc)
35 int i;
37 for (i = 0; i < N; i++)
39 pa[i] = pb[i] * pc[i];
42 bar (pa,pb,pc);
44 return 0;
47 int main (void)
49 int i;
50 float a[N];
51 float b[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45,48,51,54,57};
52 float c[N] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19};
54 check_vect ();
56 main1 (a,b,c);
57 return 0;
60 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { xfail *-*-* } } } */