4 * Copyright (c) 2003 Fabrice Bellard
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/>.
21 #include "dyngen-exec.h"
22 #include "host-utils.h"
25 //#define DEBUG_MULDIV
28 static const uint8_t rclb_table
[32] = {
29 0, 1, 2, 3, 4, 5, 6, 7,
30 8, 0, 1, 2, 3, 4, 5, 6,
31 7, 8, 0, 1, 2, 3, 4, 5,
32 6, 7, 8, 0, 1, 2, 3, 4,
36 static const uint8_t rclw_table
[32] = {
37 0, 1, 2, 3, 4, 5, 6, 7,
38 8, 9, 10, 11, 12, 13, 14, 15,
39 16, 0, 1, 2, 3, 4, 5, 6,
40 7, 8, 9, 10, 11, 12, 13, 14,
43 /* division, flags are undefined */
45 void helper_divb_AL(target_ulong t0
)
47 unsigned int num
, den
, q
, r
;
52 raise_exception(env
, EXCP00_DIVZ
);
56 raise_exception(env
, EXCP00_DIVZ
);
59 r
= (num
% den
) & 0xff;
60 EAX
= (EAX
& ~0xffff) | (r
<< 8) | q
;
63 void helper_idivb_AL(target_ulong t0
)
70 raise_exception(env
, EXCP00_DIVZ
);
74 raise_exception(env
, EXCP00_DIVZ
);
77 r
= (num
% den
) & 0xff;
78 EAX
= (EAX
& ~0xffff) | (r
<< 8) | q
;
81 void helper_divw_AX(target_ulong t0
)
83 unsigned int num
, den
, q
, r
;
85 num
= (EAX
& 0xffff) | ((EDX
& 0xffff) << 16);
88 raise_exception(env
, EXCP00_DIVZ
);
92 raise_exception(env
, EXCP00_DIVZ
);
95 r
= (num
% den
) & 0xffff;
96 EAX
= (EAX
& ~0xffff) | q
;
97 EDX
= (EDX
& ~0xffff) | r
;
100 void helper_idivw_AX(target_ulong t0
)
104 num
= (EAX
& 0xffff) | ((EDX
& 0xffff) << 16);
107 raise_exception(env
, EXCP00_DIVZ
);
110 if (q
!= (int16_t)q
) {
111 raise_exception(env
, EXCP00_DIVZ
);
114 r
= (num
% den
) & 0xffff;
115 EAX
= (EAX
& ~0xffff) | q
;
116 EDX
= (EDX
& ~0xffff) | r
;
119 void helper_divl_EAX(target_ulong t0
)
124 num
= ((uint32_t)EAX
) | ((uint64_t)((uint32_t)EDX
) << 32);
127 raise_exception(env
, EXCP00_DIVZ
);
131 if (q
> 0xffffffff) {
132 raise_exception(env
, EXCP00_DIVZ
);
138 void helper_idivl_EAX(target_ulong t0
)
143 num
= ((uint32_t)EAX
) | ((uint64_t)((uint32_t)EDX
) << 32);
146 raise_exception(env
, EXCP00_DIVZ
);
150 if (q
!= (int32_t)q
) {
151 raise_exception(env
, EXCP00_DIVZ
);
160 void helper_aam(int base
)
167 EAX
= (EAX
& ~0xffff) | al
| (ah
<< 8);
171 void helper_aad(int base
)
176 ah
= (EAX
>> 8) & 0xff;
177 al
= ((ah
* base
) + al
) & 0xff;
178 EAX
= (EAX
& ~0xffff) | al
;
182 void helper_aaa(void)
188 eflags
= helper_cc_compute_all(CC_OP
);
191 ah
= (EAX
>> 8) & 0xff;
193 icarry
= (al
> 0xf9);
194 if (((al
& 0x0f) > 9) || af
) {
195 al
= (al
+ 6) & 0x0f;
196 ah
= (ah
+ 1 + icarry
) & 0xff;
197 eflags
|= CC_C
| CC_A
;
199 eflags
&= ~(CC_C
| CC_A
);
202 EAX
= (EAX
& ~0xffff) | al
| (ah
<< 8);
206 void helper_aas(void)
212 eflags
= helper_cc_compute_all(CC_OP
);
215 ah
= (EAX
>> 8) & 0xff;
218 if (((al
& 0x0f) > 9) || af
) {
219 al
= (al
- 6) & 0x0f;
220 ah
= (ah
- 1 - icarry
) & 0xff;
221 eflags
|= CC_C
| CC_A
;
223 eflags
&= ~(CC_C
| CC_A
);
226 EAX
= (EAX
& ~0xffff) | al
| (ah
<< 8);
230 void helper_daa(void)
232 int old_al
, al
, af
, cf
;
235 eflags
= helper_cc_compute_all(CC_OP
);
238 old_al
= al
= EAX
& 0xff;
241 if (((al
& 0x0f) > 9) || af
) {
242 al
= (al
+ 6) & 0xff;
245 if ((old_al
> 0x99) || cf
) {
246 al
= (al
+ 0x60) & 0xff;
249 EAX
= (EAX
& ~0xff) | al
;
250 /* well, speed is not an issue here, so we compute the flags by hand */
251 eflags
|= (al
== 0) << 6; /* zf */
252 eflags
|= parity_table
[al
]; /* pf */
253 eflags
|= (al
& 0x80); /* sf */
257 void helper_das(void)
262 eflags
= helper_cc_compute_all(CC_OP
);
269 if (((al
& 0x0f) > 9) || af
) {
274 al
= (al
- 6) & 0xff;
276 if ((al1
> 0x99) || cf
) {
277 al
= (al
- 0x60) & 0xff;
280 EAX
= (EAX
& ~0xff) | al
;
281 /* well, speed is not an issue here, so we compute the flags by hand */
282 eflags
|= (al
== 0) << 6; /* zf */
283 eflags
|= parity_table
[al
]; /* pf */
284 eflags
|= (al
& 0x80); /* sf */
289 static void add128(uint64_t *plow
, uint64_t *phigh
, uint64_t a
, uint64_t b
)
299 static void neg128(uint64_t *plow
, uint64_t *phigh
)
303 add128(plow
, phigh
, 1, 0);
306 /* return TRUE if overflow */
307 static int div64(uint64_t *plow
, uint64_t *phigh
, uint64_t b
)
309 uint64_t q
, r
, a1
, a0
;
323 /* XXX: use a better algorithm */
324 for (i
= 0; i
< 64; i
++) {
326 a1
= (a1
<< 1) | (a0
>> 63);
335 #if defined(DEBUG_MULDIV)
336 printf("div: 0x%016" PRIx64
"%016" PRIx64
" / 0x%016" PRIx64
337 ": q=0x%016" PRIx64
" r=0x%016" PRIx64
"\n",
338 *phigh
, *plow
, b
, a0
, a1
);
346 /* return TRUE if overflow */
347 static int idiv64(uint64_t *plow
, uint64_t *phigh
, int64_t b
)
351 sa
= ((int64_t)*phigh
< 0);
359 if (div64(plow
, phigh
, b
) != 0) {
363 if (*plow
> (1ULL << 63)) {
368 if (*plow
>= (1ULL << 63)) {
378 void helper_mulq_EAX_T0(target_ulong t0
)
382 mulu64(&r0
, &r1
, EAX
, t0
);
389 void helper_imulq_EAX_T0(target_ulong t0
)
393 muls64(&r0
, &r1
, EAX
, t0
);
397 CC_SRC
= ((int64_t)r1
!= ((int64_t)r0
>> 63));
400 target_ulong
helper_imulq_T0_T1(target_ulong t0
, target_ulong t1
)
404 muls64(&r0
, &r1
, t0
, t1
);
406 CC_SRC
= ((int64_t)r1
!= ((int64_t)r0
>> 63));
410 void helper_divq_EAX(target_ulong t0
)
415 raise_exception(env
, EXCP00_DIVZ
);
419 if (div64(&r0
, &r1
, t0
)) {
420 raise_exception(env
, EXCP00_DIVZ
);
426 void helper_idivq_EAX(target_ulong t0
)
431 raise_exception(env
, EXCP00_DIVZ
);
435 if (idiv64(&r0
, &r1
, t0
)) {
436 raise_exception(env
, EXCP00_DIVZ
);
444 target_ulong
helper_bsf(target_ulong t0
)
451 while ((res
& 1) == 0) {
458 target_ulong
helper_lzcnt(target_ulong t0
, int wordsize
)
461 target_ulong res
, mask
;
463 if (wordsize
> 0 && t0
== 0) {
467 count
= TARGET_LONG_BITS
- 1;
468 mask
= (target_ulong
)1 << (TARGET_LONG_BITS
- 1);
469 while ((res
& mask
) == 0) {
474 return wordsize
- 1 - count
;
479 target_ulong
helper_bsr(target_ulong t0
)
481 return helper_lzcnt(t0
, 0);
485 #include "shift_helper_template.h"
489 #include "shift_helper_template.h"
493 #include "shift_helper_template.h"
498 #include "shift_helper_template.h"