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