2 * Helpers for integer and multimedia instructions.
4 * Copyright (c) 2007 Jocelyn Mayer
6 * This library is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU Lesser General Public
8 * License as published by the Free Software Foundation; either
9 * version 2 of the License, or (at your option) any later version.
11 * This library is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 * Lesser General Public License for more details.
16 * You should have received a copy of the GNU Lesser General Public
17 * License along with this library; if not, see <http://www.gnu.org/licenses/>.
20 #include "qemu/osdep.h"
22 #include "exec/helper-proto.h"
23 #include "qemu/host-utils.h"
26 uint64_t helper_ctpop(uint64_t arg
)
31 uint64_t helper_ctlz(uint64_t arg
)
36 uint64_t helper_cttz(uint64_t arg
)
41 uint64_t helper_zapnot(uint64_t val
, uint64_t mskb
)
45 mask
= -(mskb
& 0x01) & 0x00000000000000ffull
;
46 mask
|= -(mskb
& 0x02) & 0x000000000000ff00ull
;
47 mask
|= -(mskb
& 0x04) & 0x0000000000ff0000ull
;
48 mask
|= -(mskb
& 0x08) & 0x00000000ff000000ull
;
49 mask
|= -(mskb
& 0x10) & 0x000000ff00000000ull
;
50 mask
|= -(mskb
& 0x20) & 0x0000ff0000000000ull
;
51 mask
|= -(mskb
& 0x40) & 0x00ff000000000000ull
;
52 mask
|= -(mskb
& 0x80) & 0xff00000000000000ull
;
57 uint64_t helper_zap(uint64_t val
, uint64_t mask
)
59 return helper_zapnot(val
, ~mask
);
62 uint64_t helper_cmpbe0(uint64_t a
)
64 uint64_t m
= 0x7f7f7f7f7f7f7f7fULL
;
65 uint64_t c
= ~(((a
& m
) + m
) | a
| m
);
66 /* a.......b.......c.......d.......e.......f.......g.......h....... */
68 /* ab......bc......cd......de......ef......fg......gh......h....... */
70 /* abcd....bcde....cdef....defg....efgh....fgh.....gh......h....... */
72 /* abcdefghbcdefgh.cdefgh..defgh...efgh....fgh.....gh......h....... */
76 uint64_t helper_cmpbge(uint64_t a
, uint64_t b
)
78 uint64_t mask
= 0x00ff00ff00ff00ffULL
;
79 uint64_t test
= 0x0100010001000100ULL
;
80 uint64_t al
, ah
, bl
, bh
, cl
, ch
;
82 /* Separate the bytes to avoid false positives. */
88 /* "Compare". If a byte in B is greater than a byte in A,
89 it will clear the test bit. */
90 cl
= ((al
| test
) - bl
) & test
;
91 ch
= ((ah
| test
) - bh
) & test
;
93 /* Fold all of the test bits into a contiguous set. */
94 /* ch=.......a...............c...............e...............g........ */
95 /* cl=.......b...............d...............f...............h........ */
97 /* cl=......ab..............cd..............ef..............gh........ */
99 /* cl=......abcd............cdef............efgh............gh........ */
101 /* cl=......abcdefgh........cdefgh..........efgh............gh........ */
105 uint64_t helper_minub8(uint64_t op1
, uint64_t op2
)
108 uint8_t opa
, opb
, opr
;
111 for (i
= 0; i
< 8; ++i
) {
112 opa
= op1
>> (i
* 8);
113 opb
= op2
>> (i
* 8);
114 opr
= opa
< opb
? opa
: opb
;
115 res
|= (uint64_t)opr
<< (i
* 8);
120 uint64_t helper_minsb8(uint64_t op1
, uint64_t op2
)
127 for (i
= 0; i
< 8; ++i
) {
128 opa
= op1
>> (i
* 8);
129 opb
= op2
>> (i
* 8);
130 opr
= opa
< opb
? opa
: opb
;
131 res
|= (uint64_t)opr
<< (i
* 8);
136 uint64_t helper_minuw4(uint64_t op1
, uint64_t op2
)
139 uint16_t opa
, opb
, opr
;
142 for (i
= 0; i
< 4; ++i
) {
143 opa
= op1
>> (i
* 16);
144 opb
= op2
>> (i
* 16);
145 opr
= opa
< opb
? opa
: opb
;
146 res
|= (uint64_t)opr
<< (i
* 16);
151 uint64_t helper_minsw4(uint64_t op1
, uint64_t op2
)
158 for (i
= 0; i
< 4; ++i
) {
159 opa
= op1
>> (i
* 16);
160 opb
= op2
>> (i
* 16);
161 opr
= opa
< opb
? opa
: opb
;
162 res
|= (uint64_t)opr
<< (i
* 16);
167 uint64_t helper_maxub8(uint64_t op1
, uint64_t op2
)
170 uint8_t opa
, opb
, opr
;
173 for (i
= 0; i
< 8; ++i
) {
174 opa
= op1
>> (i
* 8);
175 opb
= op2
>> (i
* 8);
176 opr
= opa
> opb
? opa
: opb
;
177 res
|= (uint64_t)opr
<< (i
* 8);
182 uint64_t helper_maxsb8(uint64_t op1
, uint64_t op2
)
189 for (i
= 0; i
< 8; ++i
) {
190 opa
= op1
>> (i
* 8);
191 opb
= op2
>> (i
* 8);
192 opr
= opa
> opb
? opa
: opb
;
193 res
|= (uint64_t)opr
<< (i
* 8);
198 uint64_t helper_maxuw4(uint64_t op1
, uint64_t op2
)
201 uint16_t opa
, opb
, opr
;
204 for (i
= 0; i
< 4; ++i
) {
205 opa
= op1
>> (i
* 16);
206 opb
= op2
>> (i
* 16);
207 opr
= opa
> opb
? opa
: opb
;
208 res
|= (uint64_t)opr
<< (i
* 16);
213 uint64_t helper_maxsw4(uint64_t op1
, uint64_t op2
)
220 for (i
= 0; i
< 4; ++i
) {
221 opa
= op1
>> (i
* 16);
222 opb
= op2
>> (i
* 16);
223 opr
= opa
> opb
? opa
: opb
;
224 res
|= (uint64_t)opr
<< (i
* 16);
229 uint64_t helper_perr(uint64_t op1
, uint64_t op2
)
232 uint8_t opa
, opb
, opr
;
235 for (i
= 0; i
< 8; ++i
) {
236 opa
= op1
>> (i
* 8);
237 opb
= op2
>> (i
* 8);
248 uint64_t helper_pklb(uint64_t op1
)
250 return (op1
& 0xff) | ((op1
>> 24) & 0xff00);
253 uint64_t helper_pkwb(uint64_t op1
)
256 | ((op1
>> 8) & 0xff00)
257 | ((op1
>> 16) & 0xff0000)
258 | ((op1
>> 24) & 0xff000000));
261 uint64_t helper_unpkbl(uint64_t op1
)
263 return (op1
& 0xff) | ((op1
& 0xff00) << 24);
266 uint64_t helper_unpkbw(uint64_t op1
)
269 | ((op1
& 0xff00) << 8)
270 | ((op1
& 0xff0000) << 16)
271 | ((op1
& 0xff000000) << 24));
274 void helper_check_overflow(CPUAlphaState
*env
, uint64_t op1
, uint64_t op2
)
276 if (unlikely(op1
!= op2
)) {
277 arith_excp(env
, GETPC(), EXC_M_IOV
, 0);