libcpp, c, middle-end: Optimize initializers using #embed in C
[official-gcc.git] / gcc / testsuite / gcc.dg / vect / vect-58.c
blob83b921401530a2fe05cbb75a43063c1fd67128b3
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+1] != (pb[i+1] * pc[i+1]))
20 abort ();
23 return;
26 /* Unaligned pointer accesses, with a known alignment.
27 The loop bound is unknown.
28 No aliasing problems.
29 vect-54.c is similar to this one with one difference:
30 the loop bound is known. */
32 float a[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__))); 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}; 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};
34 __attribute__ ((noinline)) int
35 main1 (int n)
37 int i;
38 float *pa = a;
39 float *pb = b;
40 float *pc = c;
42 for (i = 0; i < n/2; i++)
44 pa[i+1] = pb[i+1] * pc[i+1];
47 bar (a,b,c);
49 return 0;
52 int main (void)
54 int i;
55 int n=N;
57 check_vect ();
58 main1 (n);
60 return 0;
63 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
64 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 0 "vect" } } */
65 /* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 1 "vect" { xfail vect_element_align_preferred } } } */
66 /* { dg-final { scan-tree-dump-not "Invalid sum" "optimized" } } */