|
111
|
1 /* { dg-require-effective-target vect_int } */
|
|
|
2 /* { dg-require-effective-target vect_float } */
|
|
|
3
|
|
|
4 #include <stdarg.h>
|
|
|
5 #include "tree-vect.h"
|
|
|
6
|
|
|
7 #define N 8
|
|
|
8
|
|
|
9 int
|
|
|
10 main1 ()
|
|
|
11 {
|
|
|
12 int i;
|
|
|
13 unsigned int out[N*8], a0, a1, a2, a3, a4, a5, a6, a7, b1, b0, b2, b3, b4, b5, b6, b7;
|
|
|
14 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};
|
|
|
15 float out2[N*8];
|
|
|
16
|
|
|
17 for (i = 0; i < N; i++)
|
|
|
18 {
|
|
|
19
|
|
|
20 a0 = in[i*8] + 5;
|
|
|
21 a1 = in[i*8 + 1] + 6;
|
|
|
22 a2 = in[i*8 + 2] + 7;
|
|
|
23 a3 = in[i*8 + 3] + 8;
|
|
|
24 a4 = in[i*8 + 4] + 9;
|
|
|
25 a5 = in[i*8 + 5] + 10;
|
|
|
26 a6 = in[i*8 + 6] + 11;
|
|
|
27 a7 = in[i*8 + 7] + 12;
|
|
|
28
|
|
|
29 b0 = a0 * 3;
|
|
|
30 b1 = a1 * 2;
|
|
|
31 b2 = a2 * 12;
|
|
|
32 b3 = a3 * 5;
|
|
|
33 b4 = a4 * 8;
|
|
|
34 b5 = a5 * 4;
|
|
|
35 b6 = a6 * 3;
|
|
|
36 b7 = a7 * 2;
|
|
|
37
|
|
|
38 out[i*8] = b0 - 2;
|
|
|
39 out[i*8 + 1] = b1 - 3;
|
|
|
40 out[i*8 + 2] = b2 - 2;
|
|
|
41 out[i*8 + 3] = b3 - 1;
|
|
|
42 out[i*8 + 4] = b4 - 8;
|
|
|
43 out[i*8 + 5] = b5 - 7;
|
|
|
44 out[i*8 + 6] = b6 - 3;
|
|
|
45 out[i*8 + 7] = b7 - 7;
|
|
|
46 }
|
|
|
47
|
|
|
48 /* check results: */
|
|
|
49 for (i = 0; i < N; i++)
|
|
|
50 {
|
|
|
51 if (out[i*8] != (in[i*8] + 5) * 3 - 2
|
|
|
52 || out[i*8 + 1] != (in[i*8 + 1] + 6) * 2 - 3
|
|
|
53 || out[i*8 + 2] != (in[i*8 + 2] + 7) * 12 - 2
|
|
|
54 || out[i*8 + 3] != (in[i*8 + 3] + 8) * 5 - 1
|
|
|
55 || out[i*8 + 4] != (in[i*8 + 4] + 9) * 8 - 8
|
|
|
56 || out[i*8 + 5] != (in[i*8 + 5] + 10) * 4 - 7
|
|
|
57 || out[i*8 + 6] != (in[i*8 + 6] + 11) * 3 - 3
|
|
|
58 || out[i*8 + 7] != (in[i*8 + 7] + 12) * 2 - 7)
|
|
|
59 abort ();
|
|
|
60 }
|
|
|
61
|
|
|
62 for (i = 0; i < N*2; i++)
|
|
|
63 {
|
|
|
64 out[i*4] = (in[i*4] + 2) * 3;
|
|
|
65 out[i*4 + 1] = (in[i*4 + 1] + 2) * 7;
|
|
|
66 out[i*4 + 2] = (in[i*4 + 2] + 7) * 3;
|
|
|
67 out[i*4 + 3] = (in[i*4 + 3] + 7) * 7;
|
|
|
68 }
|
|
|
69
|
|
|
70 /* check results: */
|
|
|
71 for (i = 0; i < N*2; i++)
|
|
|
72 {
|
|
|
73 if (out[i*4] != (in[i*4] + 2) * 3
|
|
|
74 || out[i*4 + 1] != (in[i*4 + 1] + 2) * 7
|
|
|
75 || out[i*4 + 2] != (in[i*4 + 2] + 7) * 3
|
|
|
76 || out[i*4 + 3] != (in[i*4 + 3] + 7) * 7)
|
|
|
77 abort ();
|
|
|
78 }
|
|
|
79
|
|
|
80 for (i = 0; i < N*4; i++)
|
|
|
81 {
|
|
|
82 out2[i*2] = (float) (in[i*2] * 2 + 5) ;
|
|
|
83 out2[i*2 + 1] = (float) (in[i*2 + 1] * 3 + 7);
|
|
|
84 }
|
|
|
85
|
|
|
86 /* check results: */
|
|
|
87 for (i = 0; i < N*4; i++)
|
|
|
88 {
|
|
|
89 if (out2[i*2] != (float) (in[i*2] * 2 + 5)
|
|
|
90 || out2[i*2 + 1] != (float) (in[i*2 + 1] * 3 + 7))
|
|
|
91 abort ();
|
|
|
92 }
|
|
|
93
|
|
|
94
|
|
|
95 return 0;
|
|
|
96 }
|
|
|
97
|
|
|
98 int main (void)
|
|
|
99 {
|
|
|
100 check_vect ();
|
|
|
101
|
|
|
102 main1 ();
|
|
|
103
|
|
|
104 return 0;
|
|
|
105 }
|
|
|
106
|
|
|
107 /* { dg-final { scan-tree-dump-times "vectorized 3 loops" 1 "vect" {target {vect_uintfloat_cvt && vect_int_mult} } } } */
|
|
|
108 /* { dg-final { scan-tree-dump-times "vectorized 2 loops" 1 "vect" {target {{! { vect_uintfloat_cvt}} && vect_int_mult} } } } */
|
|
|
109 /* { dg-final { scan-tree-dump-times "vectorized 0 loops" 1 "vect" {target {{! { vect_uintfloat_cvt}} && { ! {vect_int_mult}}} } } } */
|
|
131
|
110 /* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 3 "vect" {target { vect_uintfloat_cvt && vect_int_mult }} } } */
|
|
111
|
111 /* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 2 "vect" {target {{! { vect_uintfloat_cvt}} && vect_int_mult} } } } */
|
|
|
112 /* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 0 "vect" {target {{! { vect_uintfloat_cvt}} && { ! {vect_int_mult}}} } } } */
|
|
|
113
|
