i386: Adjust rtx cost for imulq and imulw [PR115749]
[official-gcc.git] / gcc / testsuite / gcc.dg / vect / vect-23.c
blob8c49c94a6215c451f13d462a4cdfe4ee7cbfb6b2
1 /* { dg-require-effective-target vect_int } */
2 /* { dg-require-effective-target vect_condition } */
3 /* { dg-additional-options "-fdump-tree-optimized-details-blocks" } */
5 #include <stdarg.h>
6 #include "tree-vect.h"
8 #define N 64
10 __attribute__ ((noinline)) int
11 main1 ()
13 int i;
14 int ia[N];
15 int ib[N]=
16 {1,1,0,0,1,0,1,0,
17 1,1,0,0,1,0,1,0,
18 1,1,0,0,1,0,1,0,
19 1,1,0,0,1,0,1,0,
20 1,1,0,0,1,0,1,0,
21 1,1,0,0,1,0,1,0,
22 1,1,0,0,1,0,1,0,
23 1,1,0,0,1,0,1,0};
24 int ic[N] =
25 {1,1,0,0,1,0,1,0,
26 1,1,0,0,1,0,1,0,
27 1,1,0,0,1,0,1,0,
28 1,1,0,0,1,0,1,0,
29 1,1,0,0,1,0,1,0,
30 1,1,0,0,1,0,1,0,
31 1,1,0,0,1,0,1,0,
32 1,1,0,0,1,0,1,0};
34 char ca[N];
35 char cb[N] =
36 {1,1,0,0,1,0,1,0,
37 1,1,0,0,1,0,1,0,
38 1,1,0,0,1,0,1,0,
39 1,1,0,0,1,0,1,0,
40 1,1,0,0,1,0,1,0,
41 1,1,0,0,1,0,1,0,
42 1,1,0,0,1,0,1,0,
43 1,1,0,0,1,0,1,0};
45 char cc[N] =
46 {1,1,0,0,1,0,1,0,
47 1,1,0,0,1,0,1,0,
48 1,1,0,0,1,0,1,0,
49 1,1,0,0,1,0,1,0,
50 1,1,0,0,1,0,1,0,
51 1,1,0,0,1,0,1,0,
52 1,1,0,0,1,0,1,0,
53 1,1,0,0,1,0,1,0};
55 short sa[N];
56 short sb[N] =
57 {1,1,0,0,1,0,1,0,
58 1,1,0,0,1,0,1,0,
59 1,1,0,0,1,0,1,0,
60 1,1,0,0,1,0,1,0,
61 1,1,0,0,1,0,1,0,
62 1,1,0,0,1,0,1,0,
63 1,1,0,0,1,0,1,0,
64 1,1,0,0,1,0,1,0};
66 short sc[N] =
67 {1,1,0,0,1,0,1,0,
68 1,1,0,0,1,0,1,0,
69 1,1,0,0,1,0,1,0,
70 1,1,0,0,1,0,1,0,
71 1,1,0,0,1,0,1,0,
72 1,1,0,0,1,0,1,0,
73 1,1,0,0,1,0,1,0,
74 1,1,0,0,1,0,1,0};
76 /* Check ints. */
78 for (i = 0; i < N; i++)
80 ia[i] = ib[i] && ic[i];
83 /* check results: */
84 #pragma GCC novector
85 for (i = 0; i <N; i++)
87 if (ia[i] != ib[i] && ic[i])
88 abort ();
91 /* Check chars. */
93 for (i = 0; i < N; i++)
95 ca[i] = cb[i] && cc[i];
98 /* check results: */
99 #pragma GCC novector
100 for (i = 0; i <N; i++)
102 if (ca[i] != cb[i] && cc[i])
103 abort ();
106 /* Check shorts. */
108 for (i = 0; i < N; i++)
110 sa[i] = sb[i] && sc[i];
113 /* check results: */
114 #pragma GCC novector
115 for (i = 0; i <N; i++)
117 if (sa[i] != sb[i] && sc[i])
118 abort ();
121 return 0;
124 int main (void)
126 check_vect ();
128 return main1 ();
131 /* { dg-final { scan-tree-dump-times "vectorized 3 loops" 1 "vect" } } */
132 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 0 "vect" { xfail { ! vect_align_stack_vars } } } } */
133 /* { dg-final { scan-tree-dump-not "Invalid sum" "optimized" } } */