|
111
|
1 /* { dg-require-effective-target vect_int } */
|
|
|
2
|
|
|
3 #include "tree-vect.h"
|
|
|
4
|
|
|
5 #define N 32
|
|
|
6 #define COEF 32470
|
|
|
7 #define COEF2 324700
|
|
|
8
|
|
|
9 unsigned char in[N];
|
|
|
10 int out[N];
|
|
|
11 int out2[N];
|
|
|
12
|
|
|
13 __attribute__ ((noinline)) void
|
|
|
14 foo ()
|
|
|
15 {
|
|
|
16 int i;
|
|
|
17
|
|
|
18 for (i = 0; i < N/2; i++)
|
|
|
19 {
|
|
|
20 out[2*i] = in[2*i] * COEF;
|
|
|
21 out2[2*i] = in[2*i] + COEF2;
|
|
|
22 out[2*i+1] = in[2*i+1] * COEF;
|
|
|
23 out2[2*i+1] = in[2*i+1] + COEF2;
|
|
|
24 }
|
|
|
25 }
|
|
|
26
|
|
|
27 int main (void)
|
|
|
28 {
|
|
|
29 int i;
|
|
|
30
|
|
|
31 check_vect ();
|
|
|
32
|
|
|
33 for (i = 0; i < N; i++)
|
|
|
34 {
|
|
|
35 in[i] = i;
|
|
|
36 __asm__ volatile ("");
|
|
|
37 }
|
|
|
38
|
|
|
39 foo ();
|
|
|
40
|
|
|
41 for (i = 0; i < N; i++)
|
|
|
42 if (out[i] != in[i] * COEF || out2[i] != in[i] + COEF2)
|
|
|
43 abort ();
|
|
|
44
|
|
|
45 return 0;
|
|
|
46 }
|
|
|
47
|
|
|
48 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target vect_widen_mult_hi_to_si } } } */
|
|
|
49 /* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 2 "vect" { target vect_widen_mult_hi_to_si } } } */
|
|
|
50 /* { dg-final { scan-tree-dump-times "vect_recog_widen_mult_pattern: detected" 2 "vect" { target vect_widen_mult_hi_to_si_pattern } } } */
|
|
|
51 /* { dg-final { scan-tree-dump-times "pattern recognized" 2 "vect" { target vect_widen_mult_hi_to_si_pattern } } } */
|
|
|
52
|
