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