blob: 811051e0ae095a9283fcf4737b971f1a9c363386 [file] [log] [blame]
H. Peter Anvinea6e34d2002-04-30 20:51:32 +00001/* disasm.c where all the _work_ gets done in the Netwide Disassembler
2 *
3 * The Netwide Assembler is copyright (C) 1996 Simon Tatham and
4 * Julian Hall. All rights reserved. The software is
5 * redistributable under the licence given in the file "Licence"
6 * distributed in the NASM archive.
7 *
8 * initial version 27/iii/95 by Simon Tatham
9 */
10
11#include <stdio.h>
12#include <string.h>
13
14#include "nasm.h"
15#include "disasm.h"
16#include "sync.h"
17#include "insns.h"
18
19#include "names.c"
20
21extern struct itemplate **itable[];
22
23/*
24 * Flags that go into the `segment' field of `insn' structures
25 * during disassembly.
26 */
27#define SEG_RELATIVE 1
28#define SEG_32BIT 2
29#define SEG_RMREG 4
30#define SEG_DISP8 8
31#define SEG_DISP16 16
32#define SEG_DISP32 32
33#define SEG_NODISP 64
34#define SEG_SIGNED 128
35
H. Peter Anvineba20a72002-04-30 20:53:55 +000036static int whichreg(long regflags, int regval)
37{
H. Peter Anvin232badb2002-06-06 02:41:20 +000038#include "regdis.c"
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000039
40 if (!(REG_AL & ~regflags))
41 return R_AL;
42 if (!(REG_AX & ~regflags))
43 return R_AX;
44 if (!(REG_EAX & ~regflags))
45 return R_EAX;
46 if (!(REG_DX & ~regflags))
47 return R_DX;
48 if (!(REG_CL & ~regflags))
49 return R_CL;
50 if (!(REG_CX & ~regflags))
51 return R_CX;
52 if (!(REG_ECX & ~regflags))
53 return R_ECX;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000054 if (!(FPU0 & ~regflags))
55 return R_ST0;
H. Peter Anvind7ed89e2002-04-30 20:52:08 +000056 if (!(REG_CS & ~regflags))
H. Peter Anvin232badb2002-06-06 02:41:20 +000057 return (regval == 1) ? R_CS : 0;
H. Peter Anvin76690a12002-04-30 20:52:49 +000058 if (!(REG_DESS & ~regflags))
59 return (regval == 0 || regval == 2 || regval == 3 ? sreg[regval] : 0);
60 if (!(REG_FSGS & ~regflags))
61 return (regval == 4 || regval == 5 ? sreg[regval] : 0);
H. Peter Anvin232badb2002-06-06 02:41:20 +000062 if (!(REG_SEG67 & ~regflags))
63 return (regval == 6 || regval == 7 ? sreg[regval] : 0);
64
65 /* All the entries below look up regval in an 8-entry array */
66 if (regval < 0 || regval > 7)
67 return 0;
68
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000069 if (!((REGMEM|BITS8) & ~regflags))
70 return reg8[regval];
71 if (!((REGMEM|BITS16) & ~regflags))
72 return reg16[regval];
73 if (!((REGMEM|BITS32) & ~regflags))
74 return reg32[regval];
75 if (!(REG_SREG & ~regflags))
76 return sreg[regval];
77 if (!(REG_CREG & ~regflags))
78 return creg[regval];
79 if (!(REG_DREG & ~regflags))
80 return dreg[regval];
81 if (!(REG_TREG & ~regflags))
82 return treg[regval];
83 if (!(FPUREG & ~regflags))
84 return fpureg[regval];
85 if (!(MMXREG & ~regflags))
86 return mmxreg[regval];
H. Peter Anvin4836e332002-04-30 20:56:43 +000087 if (!(XMMREG & ~regflags))
88 return xmmreg[regval];
H. Peter Anvin232badb2002-06-06 02:41:20 +000089
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000090 return 0;
91}
92
H. Peter Anvinbfebdb02002-09-12 02:23:54 +000093static const char *whichcond(int condval)
H. Peter Anvineba20a72002-04-30 20:53:55 +000094{
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000095 static int conds[] = {
H. Peter Anvin6768eb72002-04-30 20:52:26 +000096 C_O, C_NO, C_C, C_NC, C_Z, C_NZ, C_NA, C_A,
97 C_S, C_NS, C_PE, C_PO, C_L, C_NL, C_NG, C_G
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000098 };
99 return conditions[conds[condval]];
100}
101
102/*
103 * Process an effective address (ModRM) specification.
104 */
105static unsigned char *do_ea (unsigned char *data, int modrm, int asize,
H. Peter Anvineba20a72002-04-30 20:53:55 +0000106 int segsize, operand *op)
107{
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000108 int mod, rm, scale, index, base;
109
110 mod = (modrm >> 6) & 03;
111 rm = modrm & 07;
112
113 if (mod == 3) { /* pure register version */
114 op->basereg = rm;
115 op->segment |= SEG_RMREG;
116 return data;
117 }
118
119 op->addr_size = 0;
120
121 if (asize == 16) {
122 /*
123 * <mod> specifies the displacement size (none, byte or
124 * word), and <rm> specifies the register combination.
125 * Exception: mod=0,rm=6 does not specify [BP] as one might
126 * expect, but instead specifies [disp16].
127 */
128 op->indexreg = op->basereg = -1;
129 op->scale = 1; /* always, in 16 bits */
130 switch (rm) {
131 case 0: op->basereg = R_BX; op->indexreg = R_SI; break;
132 case 1: op->basereg = R_BX; op->indexreg = R_DI; break;
133 case 2: op->basereg = R_BP; op->indexreg = R_SI; break;
134 case 3: op->basereg = R_BP; op->indexreg = R_DI; break;
135 case 4: op->basereg = R_SI; break;
136 case 5: op->basereg = R_DI; break;
137 case 6: op->basereg = R_BP; break;
138 case 7: op->basereg = R_BX; break;
139 }
140 if (rm == 6 && mod == 0) { /* special case */
141 op->basereg = -1;
142 if (segsize != 16)
143 op->addr_size = 16;
144 mod = 2; /* fake disp16 */
145 }
146 switch (mod) {
147 case 0:
148 op->segment |= SEG_NODISP;
149 break;
150 case 1:
151 op->segment |= SEG_DISP8;
152 op->offset = (signed char) *data++;
153 break;
154 case 2:
155 op->segment |= SEG_DISP16;
156 op->offset = *data++;
157 op->offset |= (*data++) << 8;
158 break;
159 }
160 return data;
161 } else {
162 /*
163 * Once again, <mod> specifies displacement size (this time
164 * none, byte or *dword*), while <rm> specifies the base
165 * register. Again, [EBP] is missing, replaced by a pure
166 * disp32 (this time that's mod=0,rm=*5*). However, rm=4
167 * indicates not a single base register, but instead the
168 * presence of a SIB byte...
169 */
170 op->indexreg = -1;
171 switch (rm) {
172 case 0: op->basereg = R_EAX; break;
173 case 1: op->basereg = R_ECX; break;
174 case 2: op->basereg = R_EDX; break;
175 case 3: op->basereg = R_EBX; break;
176 case 5: op->basereg = R_EBP; break;
177 case 6: op->basereg = R_ESI; break;
178 case 7: op->basereg = R_EDI; break;
179 }
180 if (rm == 5 && mod == 0) {
181 op->basereg = -1;
182 if (segsize != 32)
183 op->addr_size = 32;
184 mod = 2; /* fake disp32 */
185 }
186 if (rm == 4) { /* process SIB */
187 scale = (*data >> 6) & 03;
188 index = (*data >> 3) & 07;
189 base = *data & 07;
190 data++;
191
192 op->scale = 1 << scale;
193 switch (index) {
194 case 0: op->indexreg = R_EAX; break;
195 case 1: op->indexreg = R_ECX; break;
196 case 2: op->indexreg = R_EDX; break;
197 case 3: op->indexreg = R_EBX; break;
198 case 4: op->indexreg = -1; break;
199 case 5: op->indexreg = R_EBP; break;
200 case 6: op->indexreg = R_ESI; break;
201 case 7: op->indexreg = R_EDI; break;
202 }
203
204 switch (base) {
205 case 0: op->basereg = R_EAX; break;
206 case 1: op->basereg = R_ECX; break;
207 case 2: op->basereg = R_EDX; break;
208 case 3: op->basereg = R_EBX; break;
209 case 4: op->basereg = R_ESP; break;
210 case 6: op->basereg = R_ESI; break;
211 case 7: op->basereg = R_EDI; break;
212 case 5:
213 if (mod == 0) {
214 mod = 2;
215 op->basereg = -1;
216 } else
217 op->basereg = R_EBP;
218 break;
219 }
220 }
221 switch (mod) {
222 case 0:
223 op->segment |= SEG_NODISP;
224 break;
225 case 1:
226 op->segment |= SEG_DISP8;
227 op->offset = (signed char) *data++;
228 break;
229 case 2:
230 op->segment |= SEG_DISP32;
231 op->offset = *data++;
232 op->offset |= (*data++) << 8;
233 op->offset |= ((long) *data++) << 16;
234 op->offset |= ((long) *data++) << 24;
235 break;
236 }
237 return data;
238 }
239}
240
241/*
H. Peter Anvinef7468f2002-04-30 20:57:59 +0000242 * Determine whether the instruction template in t corresponds to the data
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000243 * stream in data. Return the number of bytes matched if so.
244 */
H. Peter Anvinef7468f2002-04-30 20:57:59 +0000245static int matches (struct itemplate *t, unsigned char *data, int asize,
246 int osize, int segsize, int rep, insn *ins)
H. Peter Anvineba20a72002-04-30 20:53:55 +0000247{
H. Peter Anvinef7468f2002-04-30 20:57:59 +0000248 unsigned char * r = (unsigned char *)(t->code);
H. Peter Anvineba20a72002-04-30 20:53:55 +0000249 unsigned char * origdata = data;
250 int a_used = FALSE, o_used = FALSE;
H. Peter Anvinef7468f2002-04-30 20:57:59 +0000251 int drep = 0;
252
253 if ( rep == 0xF2 )
254 drep = P_REPNE;
255 else if ( rep == 0xF3 )
256 drep = P_REP;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000257
H. Peter Anvineba20a72002-04-30 20:53:55 +0000258 while (*r)
259 {
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000260 int c = *r++;
261 if (c >= 01 && c <= 03) {
262 while (c--)
263 if (*r++ != *data++)
264 return FALSE;
265 }
266 if (c == 04) {
267 switch (*data++) {
268 case 0x07: ins->oprs[0].basereg = 0; break;
269 case 0x17: ins->oprs[0].basereg = 2; break;
270 case 0x1F: ins->oprs[0].basereg = 3; break;
271 default: return FALSE;
272 }
273 }
274 if (c == 05) {
275 switch (*data++) {
276 case 0xA1: ins->oprs[0].basereg = 4; break;
277 case 0xA9: ins->oprs[0].basereg = 5; break;
278 default: return FALSE;
279 }
280 }
281 if (c == 06) {
282 switch (*data++) {
283 case 0x06: ins->oprs[0].basereg = 0; break;
284 case 0x0E: ins->oprs[0].basereg = 1; break;
285 case 0x16: ins->oprs[0].basereg = 2; break;
286 case 0x1E: ins->oprs[0].basereg = 3; break;
287 default: return FALSE;
288 }
289 }
290 if (c == 07) {
291 switch (*data++) {
292 case 0xA0: ins->oprs[0].basereg = 4; break;
293 case 0xA8: ins->oprs[0].basereg = 5; break;
294 default: return FALSE;
295 }
296 }
297 if (c >= 010 && c <= 012) {
298 int t = *r++, d = *data++;
299 if (d < t || d > t+7)
300 return FALSE;
301 else {
302 ins->oprs[c-010].basereg = d-t;
303 ins->oprs[c-010].segment |= SEG_RMREG;
304 }
305 }
306 if (c == 017)
307 if (*data++)
308 return FALSE;
309 if (c >= 014 && c <= 016) {
310 ins->oprs[c-014].offset = (signed char) *data++;
311 ins->oprs[c-014].segment |= SEG_SIGNED;
312 }
313 if (c >= 020 && c <= 022)
314 ins->oprs[c-020].offset = *data++;
315 if (c >= 024 && c <= 026)
316 ins->oprs[c-024].offset = *data++;
317 if (c >= 030 && c <= 032) {
318 ins->oprs[c-030].offset = *data++;
319 ins->oprs[c-030].offset |= (*data++ << 8);
320 }
321 if (c >= 034 && c <= 036) {
322 ins->oprs[c-034].offset = *data++;
323 ins->oprs[c-034].offset |= (*data++ << 8);
H. Peter Anvind308de12002-06-02 05:35:05 +0000324 if (osize == 32) {
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000325 ins->oprs[c-034].offset |= (((long) *data++) << 16);
326 ins->oprs[c-034].offset |= (((long) *data++) << 24);
327 }
328 if (segsize != asize)
329 ins->oprs[c-034].addr_size = asize;
330 }
331 if (c >= 040 && c <= 042) {
332 ins->oprs[c-040].offset = *data++;
333 ins->oprs[c-040].offset |= (*data++ << 8);
334 ins->oprs[c-040].offset |= (((long) *data++) << 16);
335 ins->oprs[c-040].offset |= (((long) *data++) << 24);
336 }
H. Peter Anvind308de12002-06-02 05:35:05 +0000337 if (c >= 044 && c <= 046) {
338 ins->oprs[c-044].offset = *data++;
339 ins->oprs[c-044].offset |= (*data++ << 8);
340 if (asize == 32) {
341 ins->oprs[c-044].offset |= (((long) *data++) << 16);
342 ins->oprs[c-044].offset |= (((long) *data++) << 24);
343 }
344 if (segsize != asize)
345 ins->oprs[c-044].addr_size = asize;
346 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000347 if (c >= 050 && c <= 052) {
348 ins->oprs[c-050].offset = (signed char) *data++;
349 ins->oprs[c-050].segment |= SEG_RELATIVE;
350 }
351 if (c >= 060 && c <= 062) {
352 ins->oprs[c-060].offset = *data++;
353 ins->oprs[c-060].offset |= (*data++ << 8);
354 ins->oprs[c-060].segment |= SEG_RELATIVE;
355 ins->oprs[c-060].segment &= ~SEG_32BIT;
356 }
357 if (c >= 064 && c <= 066) {
358 ins->oprs[c-064].offset = *data++;
359 ins->oprs[c-064].offset |= (*data++ << 8);
H. Peter Anvin17799b42002-05-21 03:31:21 +0000360 if (osize == 32) {
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000361 ins->oprs[c-064].offset |= (((long) *data++) << 16);
362 ins->oprs[c-064].offset |= (((long) *data++) << 24);
363 ins->oprs[c-064].segment |= SEG_32BIT;
364 } else
365 ins->oprs[c-064].segment &= ~SEG_32BIT;
366 ins->oprs[c-064].segment |= SEG_RELATIVE;
H. Peter Anvin17799b42002-05-21 03:31:21 +0000367 if (segsize != osize) {
368 ins->oprs[c-064].type =
369 (ins->oprs[c-064].type & NON_SIZE)
370 | ((osize == 16) ? BITS16 : BITS32);
371 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000372 }
373 if (c >= 070 && c <= 072) {
374 ins->oprs[c-070].offset = *data++;
375 ins->oprs[c-070].offset |= (*data++ << 8);
376 ins->oprs[c-070].offset |= (((long) *data++) << 16);
377 ins->oprs[c-070].offset |= (((long) *data++) << 24);
378 ins->oprs[c-070].segment |= SEG_32BIT | SEG_RELATIVE;
379 }
H. Peter Anvin4cf17482002-04-30 21:01:38 +0000380 if (c >= 0100 && c < 0130) {
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000381 int modrm = *data++;
382 ins->oprs[c & 07].basereg = (modrm >> 3) & 07;
383 ins->oprs[c & 07].segment |= SEG_RMREG;
384 data = do_ea (data, modrm, asize, segsize,
385 &ins->oprs[(c >> 3) & 07]);
386 }
H. Peter Anvin4cf17482002-04-30 21:01:38 +0000387 if (c >= 0130 && c <= 0132) {
388 ins->oprs[c-0130].offset = *data++;
389 ins->oprs[c-0130].offset |= (*data++ << 8);
390 }
391 if (c >= 0140 && c <= 0142) {
392 ins->oprs[c-0140].offset = *data++;
393 ins->oprs[c-0140].offset |= (*data++ << 8);
394 ins->oprs[c-0140].offset |= (((long) *data++) << 16);
395 ins->oprs[c-0140].offset |= (((long) *data++) << 24);
396 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000397 if (c >= 0200 && c <= 0277) {
398 int modrm = *data++;
399 if (((modrm >> 3) & 07) != (c & 07))
400 return FALSE; /* spare field doesn't match up */
401 data = do_ea (data, modrm, asize, segsize,
402 &ins->oprs[(c >> 3) & 07]);
403 }
404 if (c >= 0300 && c <= 0302) {
405 if (asize)
406 ins->oprs[c-0300].segment |= SEG_32BIT;
407 else
408 ins->oprs[c-0300].segment &= ~SEG_32BIT;
409 a_used = TRUE;
410 }
411 if (c == 0310) {
412 if (asize == 32)
413 return FALSE;
414 else
415 a_used = TRUE;
416 }
417 if (c == 0311) {
418 if (asize == 16)
419 return FALSE;
420 else
421 a_used = TRUE;
422 }
423 if (c == 0312) {
424 if (asize != segsize)
425 return FALSE;
426 else
427 a_used = TRUE;
428 }
429 if (c == 0320) {
430 if (osize == 32)
431 return FALSE;
432 else
433 o_used = TRUE;
434 }
435 if (c == 0321) {
436 if (osize == 16)
437 return FALSE;
438 else
439 o_used = TRUE;
440 }
441 if (c == 0322) {
442 if (osize != segsize)
443 return FALSE;
444 else
445 o_used = TRUE;
446 }
447 if (c == 0330) {
448 int t = *r++, d = *data++;
449 if (d < t || d > t+15)
450 return FALSE;
451 else
452 ins->condition = d - t;
453 }
H. Peter Anvinef7468f2002-04-30 20:57:59 +0000454 if (c == 0331) {
455 if ( rep )
456 return FALSE;
457 }
458 if (c == 0332) {
459 if (drep == P_REP)
460 drep = P_REPE;
461 }
462 if (c == 0333) {
463 if ( rep != 0xF3 )
464 return FALSE;
465 drep = 0;
466 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000467 }
468
469 /*
H. Peter Anvinef7468f2002-04-30 20:57:59 +0000470 * Check for unused rep or a/o prefixes.
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000471 */
472 ins->nprefix = 0;
H. Peter Anvinef7468f2002-04-30 20:57:59 +0000473 if (drep)
474 ins->prefixes[ins->nprefix++] = drep;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000475 if (!a_used && asize != segsize)
476 ins->prefixes[ins->nprefix++] = (asize == 16 ? P_A16 : P_A32);
477 if (!o_used && osize != segsize)
478 ins->prefixes[ins->nprefix++] = (osize == 16 ? P_O16 : P_O32);
479
480 return data - origdata;
481}
482
483long disasm (unsigned char *data, char *output, int segsize, long offset,
H. Peter Anvin4836e332002-04-30 20:56:43 +0000484 int autosync, unsigned long prefer)
H. Peter Anvineba20a72002-04-30 20:53:55 +0000485{
H. Peter Anvin4836e332002-04-30 20:56:43 +0000486 struct itemplate **p, **best_p;
487 int length, best_length = 0;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000488 char *segover;
489 int rep, lock, asize, osize, i, slen, colon;
490 unsigned char *origdata;
491 int works;
H. Peter Anvinef7468f2002-04-30 20:57:59 +0000492 insn tmp_ins, ins;
H. Peter Anvin4836e332002-04-30 20:56:43 +0000493 unsigned long goodness, best;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000494
495 /*
496 * Scan for prefixes.
497 */
498 asize = osize = segsize;
499 segover = NULL;
500 rep = lock = 0;
501 origdata = data;
502 for (;;) {
503 if (*data == 0xF3 || *data == 0xF2)
504 rep = *data++;
505 else if (*data == 0xF0)
506 lock = *data++;
507 else if (*data == 0x2E || *data == 0x36 || *data == 0x3E ||
508 *data == 0x26 || *data == 0x64 || *data == 0x65) {
509 switch (*data++) {
510 case 0x2E: segover = "cs"; break;
511 case 0x36: segover = "ss"; break;
512 case 0x3E: segover = "ds"; break;
513 case 0x26: segover = "es"; break;
514 case 0x64: segover = "fs"; break;
515 case 0x65: segover = "gs"; break;
516 }
517 } else if (*data == 0x66)
518 osize = 48 - segsize, data++;
519 else if (*data == 0x67)
520 asize = 48 - segsize, data++;
521 else
522 break;
523 }
524
H. Peter Anvinef7468f2002-04-30 20:57:59 +0000525 tmp_ins.oprs[0].segment = tmp_ins.oprs[1].segment =
526 tmp_ins.oprs[2].segment =
527 tmp_ins.oprs[0].addr_size = tmp_ins.oprs[1].addr_size =
528 tmp_ins.oprs[2].addr_size = (segsize == 16 ? 0 : SEG_32BIT);
529 tmp_ins.condition = -1;
H. Peter Anvin4836e332002-04-30 20:56:43 +0000530 best = ~0UL; /* Worst possible */
531 best_p = NULL;
532 for (p = itable[*data]; *p; p++) {
H. Peter Anvinef7468f2002-04-30 20:57:59 +0000533 if ( (length = matches(*p, data, asize, osize,
534 segsize, rep, &tmp_ins)) ) {
H. Peter Anvin4836e332002-04-30 20:56:43 +0000535 works = TRUE;
536 /*
537 * Final check to make sure the types of r/m match up.
538 */
539 for (i = 0; i < (*p)->operands; i++) {
540 if (
H. Peter Anvin4836e332002-04-30 20:56:43 +0000541 /* If it's a mem-only EA but we have a register, die. */
H. Peter Anvinef7468f2002-04-30 20:57:59 +0000542 ((tmp_ins.oprs[i].segment & SEG_RMREG) &&
H. Peter Anvin4836e332002-04-30 20:56:43 +0000543 !(MEMORY & ~(*p)->opd[i])) ||
544
545 /* If it's a reg-only EA but we have a memory ref, die. */
H. Peter Anvinef7468f2002-04-30 20:57:59 +0000546 (!(tmp_ins.oprs[i].segment & SEG_RMREG) &&
H. Peter Anvin4836e332002-04-30 20:56:43 +0000547 !(REGNORM & ~(*p)->opd[i]) &&
548 !((*p)->opd[i] & REG_SMASK)) ||
549
550 /* Register type mismatch (eg FS vs REG_DESS): die. */
551 ((((*p)->opd[i] & (REGISTER | FPUREG)) ||
H. Peter Anvinef7468f2002-04-30 20:57:59 +0000552 (tmp_ins.oprs[i].segment & SEG_RMREG)) &&
553 !whichreg ((*p)->opd[i], tmp_ins.oprs[i].basereg))) {
H. Peter Anvin4836e332002-04-30 20:56:43 +0000554 works = FALSE;
555 break;
556 }
557 }
558
559 if (works) {
560 goodness = ((*p)->flags & IF_PFMASK) ^ prefer;
561 if ( goodness < best ) {
562 /* This is the best one found so far */
H. Peter Anvinef7468f2002-04-30 20:57:59 +0000563 best = goodness;
564 best_p = p;
H. Peter Anvin4836e332002-04-30 20:56:43 +0000565 best_length = length;
H. Peter Anvinef7468f2002-04-30 20:57:59 +0000566 ins = tmp_ins;
H. Peter Anvin4836e332002-04-30 20:56:43 +0000567 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000568 }
H. Peter Anvin4836e332002-04-30 20:56:43 +0000569 }
570 }
H. Peter Anvineba20a72002-04-30 20:53:55 +0000571
H. Peter Anvinef7468f2002-04-30 20:57:59 +0000572 if (!best_p)
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000573 return 0; /* no instruction was matched */
574
H. Peter Anvin4836e332002-04-30 20:56:43 +0000575 /* Pick the best match */
H. Peter Anvinef7468f2002-04-30 20:57:59 +0000576 p = best_p;
H. Peter Anvin4836e332002-04-30 20:56:43 +0000577 length = best_length;
578
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000579 slen = 0;
580
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000581 if (lock)
582 slen += sprintf(output+slen, "lock ");
583 for (i = 0; i < ins.nprefix; i++)
584 switch (ins.prefixes[i]) {
H. Peter Anvinef7468f2002-04-30 20:57:59 +0000585 case P_REP: slen += sprintf(output+slen, "rep "); break;
586 case P_REPE: slen += sprintf(output+slen, "repe "); break;
587 case P_REPNE: slen += sprintf(output+slen, "repne "); break;
588 case P_A16: slen += sprintf(output+slen, "a16 "); break;
589 case P_A32: slen += sprintf(output+slen, "a32 "); break;
590 case P_O16: slen += sprintf(output+slen, "o16 "); break;
591 case P_O32: slen += sprintf(output+slen, "o32 "); break;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000592 }
593
594 for (i = 0; i < elements(ico); i++)
595 if ((*p)->opcode == ico[i]) {
596 slen += sprintf(output+slen, "%s%s", icn[i],
597 whichcond(ins.condition));
598 break;
599 }
600 if (i >= elements(ico))
601 slen += sprintf(output+slen, "%s", insn_names[(*p)->opcode]);
602 colon = FALSE;
603 length += data - origdata; /* fix up for prefixes */
604 for (i=0; i<(*p)->operands; i++) {
605 output[slen++] = (colon ? ':' : i==0 ? ' ' : ',');
606
607 if (ins.oprs[i].segment & SEG_RELATIVE) {
608 ins.oprs[i].offset += offset + length;
609 /*
610 * sort out wraparound
611 */
612 if (!(ins.oprs[i].segment & SEG_32BIT))
613 ins.oprs[i].offset &= 0xFFFF;
614 /*
615 * add sync marker, if autosync is on
616 */
617 if (autosync)
618 add_sync (ins.oprs[i].offset, 0L);
619 }
620
621 if ((*p)->opd[i] & COLON)
622 colon = TRUE;
623 else
624 colon = FALSE;
625
626 if (((*p)->opd[i] & (REGISTER | FPUREG)) ||
H. Peter Anvineba20a72002-04-30 20:53:55 +0000627 (ins.oprs[i].segment & SEG_RMREG))
628 {
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000629 ins.oprs[i].basereg = whichreg ((*p)->opd[i],
630 ins.oprs[i].basereg);
H. Peter Anvineba20a72002-04-30 20:53:55 +0000631 if ( (*p)->opd[i] & TO )
632 slen += sprintf(output+slen, "to ");
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000633 slen += sprintf(output+slen, "%s",
H. Peter Anvin76690a12002-04-30 20:52:49 +0000634 reg_names[ins.oprs[i].basereg-EXPR_REG_START]);
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000635 } else if (!(UNITY & ~(*p)->opd[i])) {
636 output[slen++] = '1';
637 } else if ( (*p)->opd[i] & IMMEDIATE ) {
638 if ( (*p)->opd[i] & BITS8 ) {
639 slen += sprintf(output+slen, "byte ");
640 if (ins.oprs[i].segment & SEG_SIGNED) {
641 if (ins.oprs[i].offset < 0) {
642 ins.oprs[i].offset *= -1;
643 output[slen++] = '-';
644 } else
645 output[slen++] = '+';
646 }
647 } else if ( (*p)->opd[i] & BITS16 ) {
648 slen += sprintf(output+slen, "word ");
649 } else if ( (*p)->opd[i] & BITS32 ) {
650 slen += sprintf(output+slen, "dword ");
651 } else if ( (*p)->opd[i] & NEAR ) {
652 slen += sprintf(output+slen, "near ");
653 } else if ( (*p)->opd[i] & SHORT ) {
654 slen += sprintf(output+slen, "short ");
655 }
656 slen += sprintf(output+slen, "0x%lx", ins.oprs[i].offset);
657 } else if ( !(MEM_OFFS & ~(*p)->opd[i]) ) {
658 slen += sprintf(output+slen, "[%s%s%s0x%lx]",
659 (segover ? segover : ""),
660 (segover ? ":" : ""),
661 (ins.oprs[i].addr_size == 32 ? "dword " :
662 ins.oprs[i].addr_size == 16 ? "word " : ""),
663 ins.oprs[i].offset);
664 segover = NULL;
665 } else if ( !(REGMEM & ~(*p)->opd[i]) ) {
666 int started = FALSE;
667 if ( (*p)->opd[i] & BITS8 )
668 slen += sprintf(output+slen, "byte ");
669 if ( (*p)->opd[i] & BITS16 )
670 slen += sprintf(output+slen, "word ");
671 if ( (*p)->opd[i] & BITS32 )
672 slen += sprintf(output+slen, "dword ");
673 if ( (*p)->opd[i] & BITS64 )
674 slen += sprintf(output+slen, "qword ");
675 if ( (*p)->opd[i] & BITS80 )
676 slen += sprintf(output+slen, "tword ");
677 if ( (*p)->opd[i] & FAR )
678 slen += sprintf(output+slen, "far ");
679 if ( (*p)->opd[i] & NEAR )
680 slen += sprintf(output+slen, "near ");
681 output[slen++] = '[';
682 if (ins.oprs[i].addr_size)
683 slen += sprintf(output+slen, "%s",
684 (ins.oprs[i].addr_size == 32 ? "dword " :
685 ins.oprs[i].addr_size == 16 ? "word " : ""));
686 if (segover) {
687 slen += sprintf(output+slen, "%s:", segover);
688 segover = NULL;
689 }
690 if (ins.oprs[i].basereg != -1) {
691 slen += sprintf(output+slen, "%s",
H. Peter Anvin76690a12002-04-30 20:52:49 +0000692 reg_names[(ins.oprs[i].basereg -
693 EXPR_REG_START)]);
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000694 started = TRUE;
695 }
696 if (ins.oprs[i].indexreg != -1) {
697 if (started)
698 output[slen++] = '+';
699 slen += sprintf(output+slen, "%s",
H. Peter Anvin76690a12002-04-30 20:52:49 +0000700 reg_names[(ins.oprs[i].indexreg -
701 EXPR_REG_START)]);
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000702 if (ins.oprs[i].scale > 1)
703 slen += sprintf(output+slen, "*%d", ins.oprs[i].scale);
704 started = TRUE;
705 }
706 if (ins.oprs[i].segment & SEG_DISP8) {
707 int sign = '+';
708 if (ins.oprs[i].offset & 0x80) {
709 ins.oprs[i].offset = - (signed char) ins.oprs[i].offset;
710 sign = '-';
711 }
712 slen += sprintf(output+slen, "%c0x%lx", sign,
713 ins.oprs[i].offset);
714 } else if (ins.oprs[i].segment & SEG_DISP16) {
715 if (started)
716 output[slen++] = '+';
717 slen += sprintf(output+slen, "0x%lx", ins.oprs[i].offset);
718 } else if (ins.oprs[i].segment & SEG_DISP32) {
719 if (started)
720 output[slen++] = '+';
721 slen += sprintf(output+slen, "0x%lx", ins.oprs[i].offset);
722 }
723 output[slen++] = ']';
724 } else {
725 slen += sprintf(output+slen, "<operand%d>", i);
726 }
727 }
728 output[slen] = '\0';
729 if (segover) { /* unused segment override */
730 char *p = output;
731 int count = slen+1;
732 while (count--)
733 p[count+3] = p[count];
734 strncpy (output, segover, 2);
735 output[2] = ' ';
736 }
737 return length;
738}
739
H. Peter Anvineba20a72002-04-30 20:53:55 +0000740long eatbyte (unsigned char *data, char *output)
741{
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000742 sprintf(output, "db 0x%02X", *data);
743 return 1;
744}