blob: 21bf211053dab0633f85d72cfcf3b5ba2bbb8195 [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>
Keith Kaniosb7a89542007-04-12 02:40:54 +000013#include <inttypes.h>
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000014
15#include "nasm.h"
16#include "disasm.h"
17#include "sync.h"
18#include "insns.h"
19
20#include "names.c"
21
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000022/*
23 * Flags that go into the `segment' field of `insn' structures
24 * during disassembly.
25 */
H. Peter Anvin0ee01422007-04-16 01:18:30 +000026#define SEG_RELATIVE 1
27#define SEG_32BIT 2
28#define SEG_RMREG 4
29#define SEG_DISP8 8
30#define SEG_DISP16 16
31#define SEG_DISP32 32
32#define SEG_NODISP 64
33#define SEG_SIGNED 128
34#define SEG_64BIT 256
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000035
H. Peter Anvin232badb2002-06-06 02:41:20 +000036#include "regdis.c"
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000037
H. Peter Anvin0ee01422007-04-16 01:18:30 +000038#define getu8(x) (*(uint8_t *)(x))
39#if defined(__i386__) || defined(__x86_64__)
40/* Littleendian CPU which can handle unaligned references */
41#define getu16(x) (*(uint16_t *)(x))
42#define getu32(x) (*(uint32_t *)(x))
43#define getu64(x) (*(uint64_t *)(x))
44#else
45static uint16_t getu16(uint8_t *data)
46{
47 return (uint16_t)data[0] + ((uint16_t)data[1] << 8);
48}
49static uint32_t getu32(uint8_t *data)
50{
51 return (uint32_t)getu16(data) + ((uint32_t)getu16(data+2) << 16);
52}
53static uint64_t getu64(uint8_t *data)
54{
55 return (uint64_t)getu32(data) + ((uint64_t)getu32(data+4) << 32);
56}
57#endif
58
59#define gets8(x) ((int8_t)getu8(x))
60#define gets16(x) ((int16_t)getu16(x))
61#define gets32(x) ((int32_t)getu32(x))
62#define gets64(x) ((int64_t)getu64(x))
63
64/* Important: regval must already have been adjusted for rex extensions */
65static int whichreg(int32_t regflags, int regval, int rex)
66{
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000067 if (!(REG_AL & ~regflags))
H. Peter Anvine2c80182005-01-15 22:15:51 +000068 return R_AL;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000069 if (!(REG_AX & ~regflags))
H. Peter Anvine2c80182005-01-15 22:15:51 +000070 return R_AX;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000071 if (!(REG_EAX & ~regflags))
H. Peter Anvine2c80182005-01-15 22:15:51 +000072 return R_EAX;
H. Peter Anvin7cf03af2007-04-16 02:39:56 +000073 if (!(REG_RAX & ~regflags))
74 return R_RAX;
H. Peter Anvin10101f22003-02-24 23:22:45 +000075 if (!(REG_DL & ~regflags))
H. Peter Anvine2c80182005-01-15 22:15:51 +000076 return R_DL;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000077 if (!(REG_DX & ~regflags))
H. Peter Anvine2c80182005-01-15 22:15:51 +000078 return R_DX;
H. Peter Anvin10101f22003-02-24 23:22:45 +000079 if (!(REG_EDX & ~regflags))
H. Peter Anvine2c80182005-01-15 22:15:51 +000080 return R_EDX;
H. Peter Anvin7cf03af2007-04-16 02:39:56 +000081 if (!(REG_RDX & ~regflags))
82 return R_RDX;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000083 if (!(REG_CL & ~regflags))
H. Peter Anvine2c80182005-01-15 22:15:51 +000084 return R_CL;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000085 if (!(REG_CX & ~regflags))
H. Peter Anvine2c80182005-01-15 22:15:51 +000086 return R_CX;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000087 if (!(REG_ECX & ~regflags))
H. Peter Anvine2c80182005-01-15 22:15:51 +000088 return R_ECX;
H. Peter Anvin7cf03af2007-04-16 02:39:56 +000089 if (!(REG_RCX & ~regflags))
90 return R_RCX;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000091 if (!(FPU0 & ~regflags))
H. Peter Anvine2c80182005-01-15 22:15:51 +000092 return R_ST0;
H. Peter Anvind7ed89e2002-04-30 20:52:08 +000093 if (!(REG_CS & ~regflags))
H. Peter Anvin232badb2002-06-06 02:41:20 +000094 return (regval == 1) ? R_CS : 0;
H. Peter Anvin76690a12002-04-30 20:52:49 +000095 if (!(REG_DESS & ~regflags))
H. Peter Anvine2c80182005-01-15 22:15:51 +000096 return (regval == 0 || regval == 2
H. Peter Anvin0ee01422007-04-16 01:18:30 +000097 || regval == 3 ? rd_sreg[regval] : 0);
H. Peter Anvin76690a12002-04-30 20:52:49 +000098 if (!(REG_FSGS & ~regflags))
H. Peter Anvin0ee01422007-04-16 01:18:30 +000099 return (regval == 4 || regval == 5 ? rd_sreg[regval] : 0);
H. Peter Anvin232badb2002-06-06 02:41:20 +0000100 if (!(REG_SEG67 & ~regflags))
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000101 return (regval == 6 || regval == 7 ? rd_sreg[regval] : 0);
H. Peter Anvin232badb2002-06-06 02:41:20 +0000102
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000103 /* All the entries below look up regval in an 16-entry array */
104 if (regval < 0 || regval > 15)
H. Peter Anvine2c80182005-01-15 22:15:51 +0000105 return 0;
H. Peter Anvin232badb2002-06-06 02:41:20 +0000106
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000107 if (!((REGMEM | BITS8) & ~regflags)) {
108 if (rex & REX_P)
109 return rd_reg8_rex[regval];
110 else
111 return rd_reg8[regval];
112 }
H. Peter Anvine2c80182005-01-15 22:15:51 +0000113 if (!((REGMEM | BITS16) & ~regflags))
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000114 return rd_reg16[regval];
H. Peter Anvine2c80182005-01-15 22:15:51 +0000115 if (!((REGMEM | BITS32) & ~regflags))
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000116 return rd_reg32[regval];
H. Peter Anvinb061d592007-04-16 02:02:06 +0000117 if (!((REGMEM | BITS64) & ~regflags))
118 return rd_reg64[regval];
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000119 if (!(REG_SREG & ~regflags))
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000120 return rd_sreg[regval & 7]; /* Ignore REX */
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000121 if (!(REG_CREG & ~regflags))
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000122 return rd_creg[regval];
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000123 if (!(REG_DREG & ~regflags))
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000124 return rd_dreg[regval];
125 if (!(REG_TREG & ~regflags)) {
126 if (rex & REX_P)
127 return 0; /* TR registers are ill-defined with rex */
128 return rd_treg[regval];
129 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000130 if (!(FPUREG & ~regflags))
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000131 return rd_fpureg[regval & 7]; /* Ignore REX */
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000132 if (!(MMXREG & ~regflags))
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000133 return rd_mmxreg[regval & 7]; /* Ignore REX */
H. Peter Anvin4836e332002-04-30 20:56:43 +0000134 if (!(XMMREG & ~regflags))
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000135 return rd_xmmreg[regval];
H. Peter Anvin232badb2002-06-06 02:41:20 +0000136
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000137 return 0;
138}
139
Keith Kaniosa6dfa782007-04-13 16:47:53 +0000140static const char *whichcond(int condval)
H. Peter Anvineba20a72002-04-30 20:53:55 +0000141{
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000142 static int conds[] = {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000143 C_O, C_NO, C_C, C_NC, C_Z, C_NZ, C_NA, C_A,
144 C_S, C_NS, C_PE, C_PO, C_L, C_NL, C_NG, C_G
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000145 };
146 return conditions[conds[condval]];
147}
148
149/*
150 * Process an effective address (ModRM) specification.
151 */
Keith Kaniosb7a89542007-04-12 02:40:54 +0000152static uint8_t *do_ea(uint8_t *data, int modrm, int asize,
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000153 int segsize, operand * op, int rex)
H. Peter Anvineba20a72002-04-30 20:53:55 +0000154{
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000155 int mod, rm, scale, index, base;
156
157 mod = (modrm >> 6) & 03;
158 rm = modrm & 07;
159
H. Peter Anvine2c80182005-01-15 22:15:51 +0000160 if (mod == 3) { /* pure register version */
H. Peter Anvin7cf03af2007-04-16 02:39:56 +0000161 op->basereg = rm+(rex & REX_B ? 8 : 0);
H. Peter Anvine2c80182005-01-15 22:15:51 +0000162 op->segment |= SEG_RMREG;
163 return data;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000164 }
165
166 op->addr_size = 0;
H. Peter Anvin99c4ecd2007-08-28 23:06:00 +0000167 op->eaflags = 0;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000168
169 if (asize == 16) {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000170 /*
171 * <mod> specifies the displacement size (none, byte or
172 * word), and <rm> specifies the register combination.
173 * Exception: mod=0,rm=6 does not specify [BP] as one might
174 * expect, but instead specifies [disp16].
175 */
176 op->indexreg = op->basereg = -1;
177 op->scale = 1; /* always, in 16 bits */
178 switch (rm) {
179 case 0:
180 op->basereg = R_BX;
181 op->indexreg = R_SI;
182 break;
183 case 1:
184 op->basereg = R_BX;
185 op->indexreg = R_DI;
186 break;
187 case 2:
188 op->basereg = R_BP;
189 op->indexreg = R_SI;
190 break;
191 case 3:
192 op->basereg = R_BP;
193 op->indexreg = R_DI;
194 break;
195 case 4:
196 op->basereg = R_SI;
197 break;
198 case 5:
199 op->basereg = R_DI;
200 break;
201 case 6:
202 op->basereg = R_BP;
203 break;
204 case 7:
205 op->basereg = R_BX;
206 break;
207 }
208 if (rm == 6 && mod == 0) { /* special case */
209 op->basereg = -1;
210 if (segsize != 16)
211 op->addr_size = 16;
212 mod = 2; /* fake disp16 */
213 }
214 switch (mod) {
215 case 0:
216 op->segment |= SEG_NODISP;
217 break;
218 case 1:
219 op->segment |= SEG_DISP8;
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000220 op->offset = (int8_t)*data++;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000221 break;
222 case 2:
223 op->segment |= SEG_DISP16;
224 op->offset = *data++;
225 op->offset |= ((unsigned)*data++) << 8;
226 break;
227 }
228 return data;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000229 } else {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000230 /*
231 * Once again, <mod> specifies displacement size (this time
232 * none, byte or *dword*), while <rm> specifies the base
233 * register. Again, [EBP] is missing, replaced by a pure
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000234 * disp32 (this time that's mod=0,rm=*5*) in 32-bit mode,
235 * and RIP-relative addressing in 64-bit mode.
236 *
237 * However, rm=4
H. Peter Anvine2c80182005-01-15 22:15:51 +0000238 * indicates not a single base register, but instead the
239 * presence of a SIB byte...
240 */
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000241 int a64 = asize == 64;
242
H. Peter Anvine2c80182005-01-15 22:15:51 +0000243 op->indexreg = -1;
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000244
245 if (a64)
246 op->basereg = rd_reg64[rm | ((rex & REX_B) ? 8 : 0)];
247 else
248 op->basereg = rd_reg32[rm | ((rex & REX_B) ? 8 : 0)];
249
H. Peter Anvine2c80182005-01-15 22:15:51 +0000250 if (rm == 5 && mod == 0) {
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000251 if (segsize == 64) {
H. Peter Anvin99c4ecd2007-08-28 23:06:00 +0000252 op->eaflags |= EAF_REL;
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000253 op->segment |= SEG_RELATIVE;
254 mod = 2; /* fake disp32 */
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000255 }
H. Peter Anvin99c4ecd2007-08-28 23:06:00 +0000256
257 if (asize != 64)
258 op->addr_size = asize;
259
260 op->basereg = -1;
261 mod = 2; /* fake disp32 */
H. Peter Anvine2c80182005-01-15 22:15:51 +0000262 }
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000263
H. Peter Anvine2c80182005-01-15 22:15:51 +0000264 if (rm == 4) { /* process SIB */
265 scale = (*data >> 6) & 03;
266 index = (*data >> 3) & 07;
267 base = *data & 07;
268 data++;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000269
H. Peter Anvine2c80182005-01-15 22:15:51 +0000270 op->scale = 1 << scale;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000271
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000272 if (index == 4)
273 op->indexreg = -1; /* ESP/RSP/R12 cannot be an index */
274 else if (a64)
275 op->indexreg = rd_reg64[index | ((rex & REX_X) ? 8 : 0)];
276 else
277 op->indexreg = rd_reg64[index | ((rex & REX_X) ? 8 : 0)];
278
279 if (base == 5 && mod == 0) {
280 op->basereg = -1;
281 mod = 2; /* Fake disp32 */
282 } else if (a64)
283 op->basereg = rd_reg64[base | ((rex & REX_B) ? 8 : 0)];
284 else
285 op->basereg = rd_reg32[base | ((rex & REX_B) ? 8 : 0)];
H. Peter Anvin99c4ecd2007-08-28 23:06:00 +0000286
287 if (segsize != 32)
288 op->addr_size = 32;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000289 }
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000290
H. Peter Anvine2c80182005-01-15 22:15:51 +0000291 switch (mod) {
292 case 0:
293 op->segment |= SEG_NODISP;
294 break;
295 case 1:
296 op->segment |= SEG_DISP8;
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000297 op->offset = gets8(data);
298 data++;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000299 break;
300 case 2:
301 op->segment |= SEG_DISP32;
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000302 op->offset = getu32(data);
303 data += 4;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000304 break;
305 }
306 return data;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000307 }
308}
309
310/*
H. Peter Anvinef7468f2002-04-30 20:57:59 +0000311 * Determine whether the instruction template in t corresponds to the data
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000312 * stream in data. Return the number of bytes matched if so.
313 */
H. Peter Anvin3360d792007-09-11 04:16:57 +0000314static int matches(const struct itemplate *t, uint8_t *data, int asize,
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000315 int osize, int segsize, int rep, insn * ins,
H. Peter Anvin0db11e22007-04-17 20:23:11 +0000316 int rex, int *rexout, int lock)
H. Peter Anvineba20a72002-04-30 20:53:55 +0000317{
Keith Kaniosb7a89542007-04-12 02:40:54 +0000318 uint8_t *r = (uint8_t *)(t->code);
319 uint8_t *origdata = data;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000320 int a_used = FALSE, o_used = FALSE;
321 int drep = 0;
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000322
323 *rexout = rex;
324
H. Peter Anvin0db11e22007-04-17 20:23:11 +0000325 if (t->flags & (segsize == 64 ? IF_NOLONG : IF_LONG))
326 return FALSE;
H. Peter Anvinef7468f2002-04-30 20:57:59 +0000327
H. Peter Anvine2c80182005-01-15 22:15:51 +0000328 if (rep == 0xF2)
329 drep = P_REPNE;
330 else if (rep == 0xF3)
331 drep = P_REP;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000332
H. Peter Anvine2c80182005-01-15 22:15:51 +0000333 while (*r) {
334 int c = *r++;
H. Peter Anvinb061d592007-04-16 02:02:06 +0000335
336 /* FIX: change this into a switch */
337 if (c >= 01 && c <= 03) {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000338 while (c--)
339 if (*r++ != *data++)
340 return FALSE;
H. Peter Anvinb061d592007-04-16 02:02:06 +0000341 } else if (c == 04) {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000342 switch (*data++) {
343 case 0x07:
344 ins->oprs[0].basereg = 0;
345 break;
346 case 0x17:
347 ins->oprs[0].basereg = 2;
348 break;
349 case 0x1F:
350 ins->oprs[0].basereg = 3;
351 break;
352 default:
353 return FALSE;
354 }
H. Peter Anvinb061d592007-04-16 02:02:06 +0000355 } else if (c == 05) {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000356 switch (*data++) {
357 case 0xA1:
358 ins->oprs[0].basereg = 4;
359 break;
360 case 0xA9:
361 ins->oprs[0].basereg = 5;
362 break;
363 default:
364 return FALSE;
H. Peter Anvinb061d592007-04-16 02:02:06 +0000365 }
366 } else if (c == 06) {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000367 switch (*data++) {
368 case 0x06:
369 ins->oprs[0].basereg = 0;
370 break;
371 case 0x0E:
372 ins->oprs[0].basereg = 1;
373 break;
374 case 0x16:
375 ins->oprs[0].basereg = 2;
376 break;
377 case 0x1E:
378 ins->oprs[0].basereg = 3;
379 break;
380 default:
381 return FALSE;
382 }
H. Peter Anvinb061d592007-04-16 02:02:06 +0000383 } else if (c == 07) {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000384 switch (*data++) {
385 case 0xA0:
386 ins->oprs[0].basereg = 4;
387 break;
388 case 0xA8:
389 ins->oprs[0].basereg = 5;
390 break;
391 default:
392 return FALSE;
393 }
H. Peter Anvinb061d592007-04-16 02:02:06 +0000394 } else if (c >= 010 && c <= 012) {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000395 int t = *r++, d = *data++;
396 if (d < t || d > t + 7)
397 return FALSE;
398 else {
H. Peter Anvinb061d592007-04-16 02:02:06 +0000399 ins->oprs[c - 010].basereg = (d-t)+(rex & REX_B ? 8 : 0);
H. Peter Anvine2c80182005-01-15 22:15:51 +0000400 ins->oprs[c - 010].segment |= SEG_RMREG;
401 }
H. Peter Anvinb061d592007-04-16 02:02:06 +0000402 } else if (c == 017) {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000403 if (*data++)
404 return FALSE;
H. Peter Anvinb061d592007-04-16 02:02:06 +0000405 } else if (c >= 014 && c <= 016) {
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000406 ins->oprs[c - 014].offset = (int8_t)*data++;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000407 ins->oprs[c - 014].segment |= SEG_SIGNED;
H. Peter Anvinb061d592007-04-16 02:02:06 +0000408 } else if (c >= 020 && c <= 022) {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000409 ins->oprs[c - 020].offset = *data++;
H. Peter Anvinb061d592007-04-16 02:02:06 +0000410 } else if (c >= 024 && c <= 026) {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000411 ins->oprs[c - 024].offset = *data++;
H. Peter Anvinb061d592007-04-16 02:02:06 +0000412 } else if (c >= 030 && c <= 032) {
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000413 ins->oprs[c - 030].offset = getu16(data);
414 data += 2;
H. Peter Anvinb061d592007-04-16 02:02:06 +0000415 } else if (c >= 034 && c <= 036) {
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000416 if (osize == 32) {
417 ins->oprs[c - 034].offset = getu32(data);
418 data += 4;
419 } else {
420 ins->oprs[c - 034].offset = getu16(data);
421 data += 2;
422 }
H. Peter Anvine2c80182005-01-15 22:15:51 +0000423 if (segsize != asize)
424 ins->oprs[c - 034].addr_size = asize;
H. Peter Anvinb061d592007-04-16 02:02:06 +0000425 } else if (c >= 040 && c <= 042) {
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000426 ins->oprs[c - 040].offset = getu32(data);
427 data += 4;
H. Peter Anvinb061d592007-04-16 02:02:06 +0000428 } else if (c >= 044 && c <= 046) {
429 switch (asize) {
430 case 16:
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000431 ins->oprs[c - 044].offset = getu16(data);
432 data += 2;
H. Peter Anvinb061d592007-04-16 02:02:06 +0000433 break;
434 case 32:
435 ins->oprs[c - 044].offset = getu32(data);
436 data += 4;
437 break;
438 case 64:
439 ins->oprs[c - 044].offset = getu64(data);
440 data += 8;
441 break;
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000442 }
H. Peter Anvine2c80182005-01-15 22:15:51 +0000443 if (segsize != asize)
444 ins->oprs[c - 044].addr_size = asize;
H. Peter Anvinb061d592007-04-16 02:02:06 +0000445 } else if (c >= 050 && c <= 052) {
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000446 ins->oprs[c - 050].offset = gets8(data++);
H. Peter Anvine2c80182005-01-15 22:15:51 +0000447 ins->oprs[c - 050].segment |= SEG_RELATIVE;
H. Peter Anvinb061d592007-04-16 02:02:06 +0000448 } else if (c >= 054 && c <= 056) {
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000449 ins->oprs[c - 054].offset = getu64(data);
450 data += 8;
H. Peter Anvinb061d592007-04-16 02:02:06 +0000451 } else if (c >= 060 && c <= 062) {
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000452 ins->oprs[c - 060].offset = gets16(data);
453 data += 2;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000454 ins->oprs[c - 060].segment |= SEG_RELATIVE;
455 ins->oprs[c - 060].segment &= ~SEG_32BIT;
H. Peter Anvinb061d592007-04-16 02:02:06 +0000456 } else if (c >= 064 && c <= 066) {
H. Peter Anvin7cf03af2007-04-16 02:39:56 +0000457 if (osize == 16) {
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000458 ins->oprs[c - 064].offset = getu16(data);
459 data += 2;
H. Peter Anvin7cf03af2007-04-16 02:39:56 +0000460 ins->oprs[c - 064].segment &= ~(SEG_32BIT|SEG_64BIT);
461 } else if (osize == 32) {
462 ins->oprs[c - 064].offset = getu32(data);
463 data += 4;
464 ins->oprs[c - 064].segment &= ~SEG_64BIT;
465 ins->oprs[c - 064].segment |= SEG_32BIT;
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000466 }
H. Peter Anvine2c80182005-01-15 22:15:51 +0000467 if (segsize != osize) {
468 ins->oprs[c - 064].type =
H. Peter Anvin5a640e12007-05-29 23:57:12 +0000469 (ins->oprs[c - 064].type & ~SIZE_MASK)
H. Peter Anvine2c80182005-01-15 22:15:51 +0000470 | ((osize == 16) ? BITS16 : BITS32);
471 }
H. Peter Anvinb061d592007-04-16 02:02:06 +0000472 } else if (c >= 070 && c <= 072) {
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000473 ins->oprs[c - 070].offset = getu32(data);
474 data += 4;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000475 ins->oprs[c - 070].segment |= SEG_32BIT | SEG_RELATIVE;
H. Peter Anvinb061d592007-04-16 02:02:06 +0000476 } else if (c >= 0100 && c < 0130) {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000477 int modrm = *data++;
H. Peter Anvinb061d592007-04-16 02:02:06 +0000478 ins->oprs[c & 07].basereg = ((modrm >> 3)&7)+(rex & REX_R ? 8 : 0);
H. Peter Anvine2c80182005-01-15 22:15:51 +0000479 ins->oprs[c & 07].segment |= SEG_RMREG;
480 data = do_ea(data, modrm, asize, segsize,
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000481 &ins->oprs[(c >> 3) & 07], rex);
H. Peter Anvinb061d592007-04-16 02:02:06 +0000482 } else if (c >= 0130 && c <= 0132) {
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000483 ins->oprs[c - 0130].offset = getu16(data);
484 data += 2;
H. Peter Anvinb061d592007-04-16 02:02:06 +0000485 } else if (c >= 0140 && c <= 0142) {
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000486 ins->oprs[c - 0140].offset = getu32(data);
487 data += 4;
H. Peter Anvinb061d592007-04-16 02:02:06 +0000488 } else if (c >= 0200 && c <= 0277) {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000489 int modrm = *data++;
490 if (((modrm >> 3) & 07) != (c & 07))
491 return FALSE; /* spare field doesn't match up */
492 data = do_ea(data, modrm, asize, segsize,
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000493 &ins->oprs[(c >> 3) & 07], rex);
H. Peter Anvinb061d592007-04-16 02:02:06 +0000494 } else if (c >= 0300 && c <= 0302) {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000495 a_used = TRUE;
H. Peter Anvinb061d592007-04-16 02:02:06 +0000496 } else if (c == 0310) {
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000497 if (asize != 16)
H. Peter Anvine2c80182005-01-15 22:15:51 +0000498 return FALSE;
499 else
500 a_used = TRUE;
H. Peter Anvinb061d592007-04-16 02:02:06 +0000501 } else if (c == 0311) {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000502 if (asize == 16)
503 return FALSE;
504 else
505 a_used = TRUE;
H. Peter Anvinb061d592007-04-16 02:02:06 +0000506 } else if (c == 0312) {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000507 if (asize != segsize)
508 return FALSE;
509 else
510 a_used = TRUE;
H. Peter Anvince2b3972007-05-30 22:21:11 +0000511 } else if (c == 0313) {
512 if (asize != 64)
513 return FALSE;
514 else
515 a_used = TRUE;
H. Peter Anvinb061d592007-04-16 02:02:06 +0000516 } else if (c == 0320) {
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000517 if (osize != 16)
H. Peter Anvine2c80182005-01-15 22:15:51 +0000518 return FALSE;
519 else
520 o_used = TRUE;
H. Peter Anvinb061d592007-04-16 02:02:06 +0000521 } else if (c == 0321) {
522 if (osize != 32)
H. Peter Anvine2c80182005-01-15 22:15:51 +0000523 return FALSE;
524 else
525 o_used = TRUE;
H. Peter Anvinb061d592007-04-16 02:02:06 +0000526 } else if (c == 0322) {
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000527 if (osize != (segsize == 16) ? 16 : 32)
H. Peter Anvine2c80182005-01-15 22:15:51 +0000528 return FALSE;
529 else
530 o_used = TRUE;
H. Peter Anvinb061d592007-04-16 02:02:06 +0000531 } else if (c == 0323) {
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000532 rex |= REX_W; /* 64-bit only instruction */
533 osize = 64;
H. Peter Anvinb061d592007-04-16 02:02:06 +0000534 } else if (c == 0324) {
H. Peter Anvin7cf03af2007-04-16 02:39:56 +0000535 if (!(rex & (REX_P|REX_W)) || osize != 64)
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000536 return FALSE;
H. Peter Anvinb061d592007-04-16 02:02:06 +0000537 } else if (c == 0330) {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000538 int t = *r++, d = *data++;
539 if (d < t || d > t + 15)
540 return FALSE;
541 else
542 ins->condition = d - t;
H. Peter Anvinb061d592007-04-16 02:02:06 +0000543 } else if (c == 0331) {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000544 if (rep)
545 return FALSE;
H. Peter Anvinb061d592007-04-16 02:02:06 +0000546 } else if (c == 0332) {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000547 if (drep == P_REP)
548 drep = P_REPE;
H. Peter Anvinb061d592007-04-16 02:02:06 +0000549 } else if (c == 0333) {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000550 if (rep != 0xF3)
551 return FALSE;
552 drep = 0;
H. Peter Anvin0db11e22007-04-17 20:23:11 +0000553 } else if (c == 0334) {
554 if (lock) {
555 rex |= REX_R;
556 lock = 0;
557 }
558 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000559 }
560
561 /*
H. Peter Anvinef7468f2002-04-30 20:57:59 +0000562 * Check for unused rep or a/o prefixes.
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000563 */
564 ins->nprefix = 0;
H. Peter Anvin0db11e22007-04-17 20:23:11 +0000565 if (lock)
566 ins->prefixes[ins->nprefix++] = P_LOCK;
H. Peter Anvinef7468f2002-04-30 20:57:59 +0000567 if (drep)
568 ins->prefixes[ins->nprefix++] = drep;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000569 if (!a_used && asize != segsize)
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000570 ins->prefixes[ins->nprefix++] = asize == 16 ? P_A16 : P_A32;
H. Peter Anvin0db11e22007-04-17 20:23:11 +0000571 if (!o_used && osize == ((segsize == 16) ? 32 : 16))
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000572 ins->prefixes[ins->nprefix++] = osize == 16 ? P_O16 : P_O32;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000573
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000574 /* Fix: check for redundant REX prefixes */
575
576 *rexout = rex;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000577 return data - origdata;
578}
579
Keith Kaniosa6dfa782007-04-13 16:47:53 +0000580int32_t disasm(uint8_t *data, char *output, int outbufsize, int segsize,
Keith Kaniosb7a89542007-04-12 02:40:54 +0000581 int32_t offset, int autosync, uint32_t prefer)
H. Peter Anvineba20a72002-04-30 20:53:55 +0000582{
H. Peter Anvin3360d792007-09-11 04:16:57 +0000583 const struct itemplate * const *p, * const *best_p;
H. Peter Anvin4836e332002-04-30 20:56:43 +0000584 int length, best_length = 0;
Keith Kaniosa6dfa782007-04-13 16:47:53 +0000585 char *segover;
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000586 int rep, lock, asize, osize, i, slen, colon, rex, rexout, best_rex;
Keith Kaniosb7a89542007-04-12 02:40:54 +0000587 uint8_t *origdata;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000588 int works;
H. Peter Anvinef7468f2002-04-30 20:57:59 +0000589 insn tmp_ins, ins;
Keith Kaniosb7a89542007-04-12 02:40:54 +0000590 uint32_t goodness, best;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000591
592 /*
593 * Scan for prefixes.
594 */
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000595 asize = segsize;
596 osize = (segsize == 64) ? 32 : segsize;
597 rex = 0;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000598 segover = NULL;
599 rep = lock = 0;
600 origdata = data;
601 for (;;) {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000602 if (*data == 0xF3 || *data == 0xF2)
603 rep = *data++;
604 else if (*data == 0xF0)
605 lock = *data++;
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000606 else if (*data == 0x2E)
607 segover = "cs", data++;
608 else if (*data == 0x36)
609 segover = "ss", data++;
610 else if (*data == 0x3E)
611 segover = "ds", data++;
612 else if (*data == 0x26)
613 segover = "es", data++;
614 else if (*data == 0x64)
615 segover = "fs", data++;
616 else if (*data == 0x65)
617 segover = "gs", data++;
618 else if (*data == 0x66) {
H. Peter Anvin7cf03af2007-04-16 02:39:56 +0000619 osize = (segsize == 16) ? 32 : 16;
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000620 data++;
621 } else if (*data == 0x67) {
622 asize = (segsize == 32) ? 16 : 32;
623 data++;
624 } else if (segsize == 64 && (*data & 0xf0) == REX_P) {
625 rex = *data++;
626 if (rex & REX_W)
627 osize = 64;
628 break; /* REX is always the last prefix */
629 } else {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000630 break;
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000631 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000632 }
633
H. Peter Anvinef7468f2002-04-30 20:57:59 +0000634 tmp_ins.oprs[0].segment = tmp_ins.oprs[1].segment =
H. Peter Anvine2c80182005-01-15 22:15:51 +0000635 tmp_ins.oprs[2].segment =
636 tmp_ins.oprs[0].addr_size = tmp_ins.oprs[1].addr_size =
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000637 tmp_ins.oprs[2].addr_size = (segsize == 64 ? SEG_64BIT :
638 segsize == 32 ? SEG_32BIT : 0);
H. Peter Anvinef7468f2002-04-30 20:57:59 +0000639 tmp_ins.condition = -1;
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000640 best = -1; /* Worst possible */
H. Peter Anvin4836e332002-04-30 20:56:43 +0000641 best_p = NULL;
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000642 best_rex = 0;
H. Peter Anvin4836e332002-04-30 20:56:43 +0000643 for (p = itable[*data]; *p; p++) {
H. Peter Anvin0db11e22007-04-17 20:23:11 +0000644 if ((length = matches(*p, data, asize, osize, segsize, rep,
645 &tmp_ins, rex, &rexout, lock))) {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000646 works = TRUE;
647 /*
648 * Final check to make sure the types of r/m match up.
H. Peter Anvindbf130e2007-05-30 00:18:26 +0000649 * XXX: Need to make sure this is actually correct.
H. Peter Anvine2c80182005-01-15 22:15:51 +0000650 */
651 for (i = 0; i < (*p)->operands; i++) {
652 if (
653 /* If it's a mem-only EA but we have a register, die. */
654 ((tmp_ins.oprs[i].segment & SEG_RMREG) &&
655 !(MEMORY & ~(*p)->opd[i])) ||
656 /* If it's a reg-only EA but we have a memory ref, die. */
657 (!(tmp_ins.oprs[i].segment & SEG_RMREG) &&
H. Peter Anvindbf130e2007-05-30 00:18:26 +0000658 !(REG_EA & ~(*p)->opd[i]) &&
H. Peter Anvine2c80182005-01-15 22:15:51 +0000659 !((*p)->opd[i] & REG_SMASK)) ||
660 /* Register type mismatch (eg FS vs REG_DESS): die. */
661 ((((*p)->opd[i] & (REGISTER | FPUREG)) ||
662 (tmp_ins.oprs[i].segment & SEG_RMREG)) &&
663 !whichreg((*p)->opd[i],
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000664 tmp_ins.oprs[i].basereg, rexout))) {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000665 works = FALSE;
666 break;
667 }
668 }
669
670 if (works) {
671 goodness = ((*p)->flags & IF_PFMASK) ^ prefer;
672 if (goodness < best) {
673 /* This is the best one found so far */
674 best = goodness;
675 best_p = p;
676 best_length = length;
677 ins = tmp_ins;
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000678 best_rex = rexout;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000679 }
680 }
681 }
H. Peter Anvin4836e332002-04-30 20:56:43 +0000682 }
H. Peter Anvineba20a72002-04-30 20:53:55 +0000683
H. Peter Anvinef7468f2002-04-30 20:57:59 +0000684 if (!best_p)
H. Peter Anvine2c80182005-01-15 22:15:51 +0000685 return 0; /* no instruction was matched */
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000686
H. Peter Anvin4836e332002-04-30 20:56:43 +0000687 /* Pick the best match */
H. Peter Anvine2c80182005-01-15 22:15:51 +0000688 p = best_p;
H. Peter Anvin4836e332002-04-30 20:56:43 +0000689 length = best_length;
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000690 rex = best_rex;
691 if (best_rex & REX_W)
692 osize = 64;
H. Peter Anvin4836e332002-04-30 20:56:43 +0000693
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000694 slen = 0;
695
Ed Beroset64ab5192004-12-15 23:32:57 +0000696 /* TODO: snprintf returns the value that the string would have if
H. Peter Anvine2c80182005-01-15 22:15:51 +0000697 * the buffer were long enough, and not the actual length of
698 * the returned string, so each instance of using the return
699 * value of snprintf should actually be checked to assure that
700 * the return value is "sane." Maybe a macro wrapper could
701 * be used for that purpose.
702 */
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000703 for (i = 0; i < ins.nprefix; i++)
H. Peter Anvine2c80182005-01-15 22:15:51 +0000704 switch (ins.prefixes[i]) {
H. Peter Anvin0db11e22007-04-17 20:23:11 +0000705 case P_LOCK:
706 slen += snprintf(output + slen, outbufsize - slen, "lock ");
707 break;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000708 case P_REP:
709 slen += snprintf(output + slen, outbufsize - slen, "rep ");
710 break;
711 case P_REPE:
712 slen += snprintf(output + slen, outbufsize - slen, "repe ");
713 break;
714 case P_REPNE:
715 slen += snprintf(output + slen, outbufsize - slen, "repne ");
716 break;
717 case P_A16:
718 slen += snprintf(output + slen, outbufsize - slen, "a16 ");
719 break;
720 case P_A32:
721 slen += snprintf(output + slen, outbufsize - slen, "a32 ");
722 break;
723 case P_O16:
724 slen += snprintf(output + slen, outbufsize - slen, "o16 ");
725 break;
726 case P_O32:
727 slen += snprintf(output + slen, outbufsize - slen, "o32 ");
728 break;
729 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000730
731 for (i = 0; i < elements(ico); i++)
H. Peter Anvine2c80182005-01-15 22:15:51 +0000732 if ((*p)->opcode == ico[i]) {
733 slen +=
734 snprintf(output + slen, outbufsize - slen, "%s%s", icn[i],
735 whichcond(ins.condition));
736 break;
737 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000738 if (i >= elements(ico))
H. Peter Anvine2c80182005-01-15 22:15:51 +0000739 slen +=
740 snprintf(output + slen, outbufsize - slen, "%s",
741 insn_names[(*p)->opcode]);
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000742 colon = FALSE;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000743 length += data - origdata; /* fix up for prefixes */
744 for (i = 0; i < (*p)->operands; i++) {
745 output[slen++] = (colon ? ':' : i == 0 ? ' ' : ',');
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000746
H. Peter Anvine2c80182005-01-15 22:15:51 +0000747 if (ins.oprs[i].segment & SEG_RELATIVE) {
748 ins.oprs[i].offset += offset + length;
749 /*
750 * sort out wraparound
751 */
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000752 if (!(ins.oprs[i].segment & (SEG_32BIT|SEG_64BIT)))
753 ins.oprs[i].offset &= 0xffff;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000754 /*
755 * add sync marker, if autosync is on
756 */
757 if (autosync)
758 add_sync(ins.oprs[i].offset, 0L);
759 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000760
H. Peter Anvine2c80182005-01-15 22:15:51 +0000761 if ((*p)->opd[i] & COLON)
762 colon = TRUE;
763 else
764 colon = FALSE;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000765
H. Peter Anvine2c80182005-01-15 22:15:51 +0000766 if (((*p)->opd[i] & (REGISTER | FPUREG)) ||
767 (ins.oprs[i].segment & SEG_RMREG)) {
768 ins.oprs[i].basereg = whichreg((*p)->opd[i],
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000769 ins.oprs[i].basereg, rex);
H. Peter Anvine2c80182005-01-15 22:15:51 +0000770 if ((*p)->opd[i] & TO)
771 slen += snprintf(output + slen, outbufsize - slen, "to ");
772 slen += snprintf(output + slen, outbufsize - slen, "%s",
773 reg_names[ins.oprs[i].basereg -
774 EXPR_REG_START]);
775 } else if (!(UNITY & ~(*p)->opd[i])) {
776 output[slen++] = '1';
777 } else if ((*p)->opd[i] & IMMEDIATE) {
778 if ((*p)->opd[i] & BITS8) {
779 slen +=
780 snprintf(output + slen, outbufsize - slen, "byte ");
781 if (ins.oprs[i].segment & SEG_SIGNED) {
782 if (ins.oprs[i].offset < 0) {
783 ins.oprs[i].offset *= -1;
784 output[slen++] = '-';
785 } else
786 output[slen++] = '+';
787 }
788 } else if ((*p)->opd[i] & BITS16) {
789 slen +=
790 snprintf(output + slen, outbufsize - slen, "word ");
791 } else if ((*p)->opd[i] & BITS32) {
792 slen +=
793 snprintf(output + slen, outbufsize - slen, "dword ");
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000794 } else if ((*p)->opd[i] & BITS64) {
795 slen +=
796 snprintf(output + slen, outbufsize - slen, "qword ");
H. Peter Anvine2c80182005-01-15 22:15:51 +0000797 } else if ((*p)->opd[i] & NEAR) {
798 slen +=
799 snprintf(output + slen, outbufsize - slen, "near ");
800 } else if ((*p)->opd[i] & SHORT) {
801 slen +=
802 snprintf(output + slen, outbufsize - slen, "short ");
803 }
804 slen +=
Keith Kanios93f2e9a2007-04-14 00:10:59 +0000805 snprintf(output + slen, outbufsize - slen, "0x%"PRIx64"",
H. Peter Anvine2c80182005-01-15 22:15:51 +0000806 ins.oprs[i].offset);
807 } else if (!(MEM_OFFS & ~(*p)->opd[i])) {
808 slen +=
Keith Kanios93f2e9a2007-04-14 00:10:59 +0000809 snprintf(output + slen, outbufsize - slen, "[%s%s%s0x%"PRIx64"]",
Keith Kaniosb7a89542007-04-12 02:40:54 +0000810 ((const char*)segover ? (const char*)segover : ""), /* placate type mistmatch warning */
811 ((const char*)segover ? ":" : ""), /* by using (const char*) instead of uint8_t* */
H. Peter Anvine2c80182005-01-15 22:15:51 +0000812 (ins.oprs[i].addr_size ==
813 32 ? "dword " : ins.oprs[i].addr_size ==
814 16 ? "word " : ""), ins.oprs[i].offset);
815 segover = NULL;
816 } else if (!(REGMEM & ~(*p)->opd[i])) {
817 int started = FALSE;
818 if ((*p)->opd[i] & BITS8)
819 slen +=
820 snprintf(output + slen, outbufsize - slen, "byte ");
821 if ((*p)->opd[i] & BITS16)
822 slen +=
823 snprintf(output + slen, outbufsize - slen, "word ");
824 if ((*p)->opd[i] & BITS32)
825 slen +=
826 snprintf(output + slen, outbufsize - slen, "dword ");
827 if ((*p)->opd[i] & BITS64)
828 slen +=
829 snprintf(output + slen, outbufsize - slen, "qword ");
830 if ((*p)->opd[i] & BITS80)
831 slen +=
832 snprintf(output + slen, outbufsize - slen, "tword ");
833 if ((*p)->opd[i] & FAR)
834 slen += snprintf(output + slen, outbufsize - slen, "far ");
835 if ((*p)->opd[i] & NEAR)
836 slen +=
837 snprintf(output + slen, outbufsize - slen, "near ");
838 output[slen++] = '[';
839 if (ins.oprs[i].addr_size)
840 slen += snprintf(output + slen, outbufsize - slen, "%s",
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000841 (ins.oprs[i].addr_size == 64 ? "qword " :
842 ins.oprs[i].addr_size == 32 ? "dword " :
843 ins.oprs[i].addr_size == 16 ? "word " :
844 ""));
H. Peter Anvin99c4ecd2007-08-28 23:06:00 +0000845 if (ins.oprs[i].eaflags & EAF_REL)
846 slen += snprintf(output + slen, outbufsize - slen, "rel ");
H. Peter Anvine2c80182005-01-15 22:15:51 +0000847 if (segover) {
848 slen +=
849 snprintf(output + slen, outbufsize - slen, "%s:",
850 segover);
851 segover = NULL;
852 }
853 if (ins.oprs[i].basereg != -1) {
854 slen += snprintf(output + slen, outbufsize - slen, "%s",
855 reg_names[(ins.oprs[i].basereg -
856 EXPR_REG_START)]);
857 started = TRUE;
858 }
859 if (ins.oprs[i].indexreg != -1) {
860 if (started)
861 output[slen++] = '+';
862 slen += snprintf(output + slen, outbufsize - slen, "%s",
863 reg_names[(ins.oprs[i].indexreg -
864 EXPR_REG_START)]);
865 if (ins.oprs[i].scale > 1)
866 slen +=
867 snprintf(output + slen, outbufsize - slen, "*%d",
868 ins.oprs[i].scale);
869 started = TRUE;
870 }
871 if (ins.oprs[i].segment & SEG_DISP8) {
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000872 int minus = 0;
873 int8_t offset = ins.oprs[i].offset;
874 if (offset < 0) {
875 minus = 1;
876 offset = -offset;
877 }
H. Peter Anvine2c80182005-01-15 22:15:51 +0000878 slen +=
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000879 snprintf(output + slen, outbufsize - slen, "%s0x%"PRIx8"",
880 minus ? "-" : "+", offset);
H. Peter Anvine2c80182005-01-15 22:15:51 +0000881 } else if (ins.oprs[i].segment & SEG_DISP16) {
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000882 int minus = 0;
883 int16_t offset = ins.oprs[i].offset;
884 if (offset < 0) {
885 minus = 1;
886 offset = -offset;
887 }
H. Peter Anvine2c80182005-01-15 22:15:51 +0000888 slen +=
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000889 snprintf(output + slen, outbufsize - slen, "%s0x%"PRIx16"",
890 minus ? "-" : started ? "+" : "", offset);
H. Peter Anvine2c80182005-01-15 22:15:51 +0000891 } else if (ins.oprs[i].segment & SEG_DISP32) {
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000892 char *prefix = "";
893 int32_t offset = ins.oprs[i].offset;
H. Peter Anvin99c4ecd2007-08-28 23:06:00 +0000894 if (offset < 0) {
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000895 offset = -offset;
896 prefix = "-";
897 } else {
898 prefix = started ? "+" : "";
899 }
900 slen +=
901 snprintf(output + slen, outbufsize - slen,
902 "%s0x%"PRIx32"", prefix, offset);
H. Peter Anvine2c80182005-01-15 22:15:51 +0000903 }
904 output[slen++] = ']';
905 } else {
906 slen +=
907 snprintf(output + slen, outbufsize - slen, "<operand%d>",
908 i);
909 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000910 }
911 output[slen] = '\0';
H. Peter Anvine2c80182005-01-15 22:15:51 +0000912 if (segover) { /* unused segment override */
Keith Kaniosa6dfa782007-04-13 16:47:53 +0000913 char *p = output;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000914 int count = slen + 1;
915 while (count--)
916 p[count + 3] = p[count];
917 strncpy(output, segover, 2);
918 output[2] = ' ';
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000919 }
920 return length;
921}
922
Keith Kaniosa6dfa782007-04-13 16:47:53 +0000923int32_t eatbyte(uint8_t *data, char *output, int outbufsize)
H. Peter Anvineba20a72002-04-30 20:53:55 +0000924{
Ed Beroset92348172004-12-15 18:27:50 +0000925 snprintf(output, outbufsize, "db 0x%02X", *data);
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000926 return 1;
927}