libcpp, c, middle-end: Optimize initializers using #embed in C
[official-gcc.git] / gcc / testsuite / gcc.dg / vect / slp-11c.c
blob25d7f2ce3832f579d6a603da220bcf9a67346375
1 /* { dg-require-effective-target vect_int } */
2 /* { dg-require-effective-target vect_float } */
4 #include <stdarg.h>
5 #include "tree-vect.h"
7 #define N 8
9 int
10 main1 ()
12 int i;
13 unsigned int in[N*8] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63};
14 float out[N*8];
16 /* Different operations - we SLP the store and split the group to two
17 single-lane branches. */
18 for (i = 0; i < N*4; i++)
20 out[i*2] = ((float) in[i*2] * 2 + 6) ;
21 out[i*2 + 1] = (float) (in[i*2 + 1] * 3 + 7);
24 /* check results: */
25 #pragma GCC novector
26 for (i = 0; i < N*4; i++)
28 if (out[i*2] != ((float) in[i*2] * 2 + 6)
29 || out[i*2 + 1] != (float) (in[i*2 + 1] * 3 + 7))
30 abort ();
34 return 0;
37 int main (void)
39 check_vect ();
41 main1 ();
43 return 0;
46 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target { { vect_uintfloat_cvt && vect_strided2 } && vect_int_mult } } } } */
47 /* { dg-final { scan-tree-dump-times "vectorized 0 loops" 1 "vect" { target { ! { { vect_uintfloat_cvt && vect_strided2 } && vect_int_mult } } } } } */
48 /* { dg-final { scan-tree-dump "LOAD_LANES" "vect" { target { vect_load_lanes } } } } */