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/>.
22 #include "qemu/host-utils.h"
25 uint64_t helper_ctpop(uint64_t arg
)
30 uint64_t helper_ctlz(uint64_t arg
)
35 uint64_t helper_cttz(uint64_t arg
)
40 static inline uint64_t byte_zap(uint64_t op
, uint8_t mskb
)
45 mask
|= ((mskb
>> 0) & 1) * 0x00000000000000FFULL
;
46 mask
|= ((mskb
>> 1) & 1) * 0x000000000000FF00ULL
;
47 mask
|= ((mskb
>> 2) & 1) * 0x0000000000FF0000ULL
;
48 mask
|= ((mskb
>> 3) & 1) * 0x00000000FF000000ULL
;
49 mask
|= ((mskb
>> 4) & 1) * 0x000000FF00000000ULL
;
50 mask
|= ((mskb
>> 5) & 1) * 0x0000FF0000000000ULL
;
51 mask
|= ((mskb
>> 6) & 1) * 0x00FF000000000000ULL
;
52 mask
|= ((mskb
>> 7) & 1) * 0xFF00000000000000ULL
;
57 uint64_t helper_zap(uint64_t val
, uint64_t mask
)
59 return byte_zap(val
, mask
);
62 uint64_t helper_zapnot(uint64_t val
, uint64_t mask
)
64 return byte_zap(val
, ~mask
);
67 uint64_t helper_cmpbge(uint64_t op1
, uint64_t op2
)
69 uint8_t opa
, opb
, res
;
73 for (i
= 0; i
< 8; i
++) {
83 uint64_t helper_minub8(uint64_t op1
, uint64_t op2
)
86 uint8_t opa
, opb
, opr
;
89 for (i
= 0; i
< 8; ++i
) {
92 opr
= opa
< opb
? opa
: opb
;
93 res
|= (uint64_t)opr
<< (i
* 8);
98 uint64_t helper_minsb8(uint64_t op1
, uint64_t op2
)
105 for (i
= 0; i
< 8; ++i
) {
106 opa
= op1
>> (i
* 8);
107 opb
= op2
>> (i
* 8);
108 opr
= opa
< opb
? opa
: opb
;
109 res
|= (uint64_t)opr
<< (i
* 8);
114 uint64_t helper_minuw4(uint64_t op1
, uint64_t op2
)
117 uint16_t opa
, opb
, opr
;
120 for (i
= 0; i
< 4; ++i
) {
121 opa
= op1
>> (i
* 16);
122 opb
= op2
>> (i
* 16);
123 opr
= opa
< opb
? opa
: opb
;
124 res
|= (uint64_t)opr
<< (i
* 16);
129 uint64_t helper_minsw4(uint64_t op1
, uint64_t op2
)
136 for (i
= 0; i
< 4; ++i
) {
137 opa
= op1
>> (i
* 16);
138 opb
= op2
>> (i
* 16);
139 opr
= opa
< opb
? opa
: opb
;
140 res
|= (uint64_t)opr
<< (i
* 16);
145 uint64_t helper_maxub8(uint64_t op1
, uint64_t op2
)
148 uint8_t opa
, opb
, opr
;
151 for (i
= 0; i
< 8; ++i
) {
152 opa
= op1
>> (i
* 8);
153 opb
= op2
>> (i
* 8);
154 opr
= opa
> opb
? opa
: opb
;
155 res
|= (uint64_t)opr
<< (i
* 8);
160 uint64_t helper_maxsb8(uint64_t op1
, uint64_t op2
)
167 for (i
= 0; i
< 8; ++i
) {
168 opa
= op1
>> (i
* 8);
169 opb
= op2
>> (i
* 8);
170 opr
= opa
> opb
? opa
: opb
;
171 res
|= (uint64_t)opr
<< (i
* 8);
176 uint64_t helper_maxuw4(uint64_t op1
, uint64_t op2
)
179 uint16_t opa
, opb
, opr
;
182 for (i
= 0; i
< 4; ++i
) {
183 opa
= op1
>> (i
* 16);
184 opb
= op2
>> (i
* 16);
185 opr
= opa
> opb
? opa
: opb
;
186 res
|= (uint64_t)opr
<< (i
* 16);
191 uint64_t helper_maxsw4(uint64_t op1
, uint64_t op2
)
198 for (i
= 0; i
< 4; ++i
) {
199 opa
= op1
>> (i
* 16);
200 opb
= op2
>> (i
* 16);
201 opr
= opa
> opb
? opa
: opb
;
202 res
|= (uint64_t)opr
<< (i
* 16);
207 uint64_t helper_perr(uint64_t op1
, uint64_t op2
)
210 uint8_t opa
, opb
, opr
;
213 for (i
= 0; i
< 8; ++i
) {
214 opa
= op1
>> (i
* 8);
215 opb
= op2
>> (i
* 8);
226 uint64_t helper_pklb(uint64_t op1
)
228 return (op1
& 0xff) | ((op1
>> 24) & 0xff00);
231 uint64_t helper_pkwb(uint64_t op1
)
234 | ((op1
>> 8) & 0xff00)
235 | ((op1
>> 16) & 0xff0000)
236 | ((op1
>> 24) & 0xff000000));
239 uint64_t helper_unpkbl(uint64_t op1
)
241 return (op1
& 0xff) | ((op1
& 0xff00) << 24);
244 uint64_t helper_unpkbw(uint64_t op1
)
247 | ((op1
& 0xff00) << 8)
248 | ((op1
& 0xff0000) << 16)
249 | ((op1
& 0xff000000) << 24));
252 uint64_t helper_addqv(CPUAlphaState
*env
, uint64_t op1
, uint64_t op2
)
256 if (unlikely((tmp
^ op2
^ (-1ULL)) & (tmp
^ op1
) & (1ULL << 63))) {
257 arith_excp(env
, GETPC(), EXC_M_IOV
, 0);
262 uint64_t helper_addlv(CPUAlphaState
*env
, uint64_t op1
, uint64_t op2
)
265 op1
= (uint32_t)(op1
+ op2
);
266 if (unlikely((tmp
^ op2
^ (-1UL)) & (tmp
^ op1
) & (1UL << 31))) {
267 arith_excp(env
, GETPC(), EXC_M_IOV
, 0);
272 uint64_t helper_subqv(CPUAlphaState
*env
, uint64_t op1
, uint64_t op2
)
276 if (unlikely((op1
^ op2
) & (res
^ op1
) & (1ULL << 63))) {
277 arith_excp(env
, GETPC(), EXC_M_IOV
, 0);
282 uint64_t helper_sublv(CPUAlphaState
*env
, uint64_t op1
, uint64_t op2
)
286 if (unlikely((op1
^ op2
) & (res
^ op1
) & (1UL << 31))) {
287 arith_excp(env
, GETPC(), EXC_M_IOV
, 0);
292 uint64_t helper_mullv(CPUAlphaState
*env
, uint64_t op1
, uint64_t op2
)
294 int64_t res
= (int64_t)op1
* (int64_t)op2
;
296 if (unlikely((int32_t)res
!= res
)) {
297 arith_excp(env
, GETPC(), EXC_M_IOV
, 0);
299 return (int64_t)((int32_t)res
);
302 uint64_t helper_mulqv(CPUAlphaState
*env
, uint64_t op1
, uint64_t op2
)
306 muls64(&tl
, &th
, op1
, op2
);
307 /* If th != 0 && th != -1, then we had an overflow */
308 if (unlikely((th
+ 1) > 1)) {
309 arith_excp(env
, GETPC(), EXC_M_IOV
, 0);