blob: 665e3d289ef9c6a4faac262e4d47d3e0f6627582 [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
22extern struct itemplate **itable[];
23
24/*
25 * Flags that go into the `segment' field of `insn' structures
26 * during disassembly.
27 */
H. Peter Anvin0ee01422007-04-16 01:18:30 +000028#define SEG_RELATIVE 1
29#define SEG_32BIT 2
30#define SEG_RMREG 4
31#define SEG_DISP8 8
32#define SEG_DISP16 16
33#define SEG_DISP32 32
34#define SEG_NODISP 64
35#define SEG_SIGNED 128
36#define SEG_64BIT 256
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000037
H. Peter Anvin0ee01422007-04-16 01:18:30 +000038/*
39 * REX flags
40 */
41#define REX_P 0x40 /* REX prefix present */
42#define REX_W 0x08 /* 64-bit operand size */
43#define REX_R 0x04 /* ModRM reg extension */
44#define REX_X 0x02 /* SIB index extension */
45#define REX_B 0x01 /* ModRM r/m extension */
46
H. Peter Anvin232badb2002-06-06 02:41:20 +000047#include "regdis.c"
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000048
H. Peter Anvin0ee01422007-04-16 01:18:30 +000049#define getu8(x) (*(uint8_t *)(x))
50#if defined(__i386__) || defined(__x86_64__)
51/* Littleendian CPU which can handle unaligned references */
52#define getu16(x) (*(uint16_t *)(x))
53#define getu32(x) (*(uint32_t *)(x))
54#define getu64(x) (*(uint64_t *)(x))
55#else
56static uint16_t getu16(uint8_t *data)
57{
58 return (uint16_t)data[0] + ((uint16_t)data[1] << 8);
59}
60static uint32_t getu32(uint8_t *data)
61{
62 return (uint32_t)getu16(data) + ((uint32_t)getu16(data+2) << 16);
63}
64static uint64_t getu64(uint8_t *data)
65{
66 return (uint64_t)getu32(data) + ((uint64_t)getu32(data+4) << 32);
67}
68#endif
69
70#define gets8(x) ((int8_t)getu8(x))
71#define gets16(x) ((int16_t)getu16(x))
72#define gets32(x) ((int32_t)getu32(x))
73#define gets64(x) ((int64_t)getu64(x))
74
75/* Important: regval must already have been adjusted for rex extensions */
76static int whichreg(int32_t regflags, int regval, int rex)
77{
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000078 if (!(REG_AL & ~regflags))
H. Peter Anvine2c80182005-01-15 22:15:51 +000079 return R_AL;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000080 if (!(REG_AX & ~regflags))
H. Peter Anvine2c80182005-01-15 22:15:51 +000081 return R_AX;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000082 if (!(REG_EAX & ~regflags))
H. Peter Anvine2c80182005-01-15 22:15:51 +000083 return R_EAX;
H. Peter Anvin10101f22003-02-24 23:22:45 +000084 if (!(REG_DL & ~regflags))
H. Peter Anvine2c80182005-01-15 22:15:51 +000085 return R_DL;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000086 if (!(REG_DX & ~regflags))
H. Peter Anvine2c80182005-01-15 22:15:51 +000087 return R_DX;
H. Peter Anvin10101f22003-02-24 23:22:45 +000088 if (!(REG_EDX & ~regflags))
H. Peter Anvine2c80182005-01-15 22:15:51 +000089 return R_EDX;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000090 if (!(REG_CL & ~regflags))
H. Peter Anvine2c80182005-01-15 22:15:51 +000091 return R_CL;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000092 if (!(REG_CX & ~regflags))
H. Peter Anvine2c80182005-01-15 22:15:51 +000093 return R_CX;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000094 if (!(REG_ECX & ~regflags))
H. Peter Anvine2c80182005-01-15 22:15:51 +000095 return R_ECX;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000096 if (!(FPU0 & ~regflags))
H. Peter Anvine2c80182005-01-15 22:15:51 +000097 return R_ST0;
H. Peter Anvind7ed89e2002-04-30 20:52:08 +000098 if (!(REG_CS & ~regflags))
H. Peter Anvin232badb2002-06-06 02:41:20 +000099 return (regval == 1) ? R_CS : 0;
H. Peter Anvin76690a12002-04-30 20:52:49 +0000100 if (!(REG_DESS & ~regflags))
H. Peter Anvine2c80182005-01-15 22:15:51 +0000101 return (regval == 0 || regval == 2
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000102 || regval == 3 ? rd_sreg[regval] : 0);
H. Peter Anvin76690a12002-04-30 20:52:49 +0000103 if (!(REG_FSGS & ~regflags))
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000104 return (regval == 4 || regval == 5 ? rd_sreg[regval] : 0);
H. Peter Anvin232badb2002-06-06 02:41:20 +0000105 if (!(REG_SEG67 & ~regflags))
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000106 return (regval == 6 || regval == 7 ? rd_sreg[regval] : 0);
H. Peter Anvin232badb2002-06-06 02:41:20 +0000107
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000108 /* All the entries below look up regval in an 16-entry array */
109 if (regval < 0 || regval > 15)
H. Peter Anvine2c80182005-01-15 22:15:51 +0000110 return 0;
H. Peter Anvin232badb2002-06-06 02:41:20 +0000111
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000112 if (!(rex & REX_P) && regval > 7)
113 return 0; /* Internal error! */
114
115 if (!((REGMEM | BITS8) & ~regflags)) {
116 if (rex & REX_P)
117 return rd_reg8_rex[regval];
118 else
119 return rd_reg8[regval];
120 }
H. Peter Anvine2c80182005-01-15 22:15:51 +0000121 if (!((REGMEM | BITS16) & ~regflags))
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000122 return rd_reg16[regval];
H. Peter Anvine2c80182005-01-15 22:15:51 +0000123 if (!((REGMEM | BITS32) & ~regflags))
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000124 return rd_reg32[regval];
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000125 if (!(REG_SREG & ~regflags))
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000126 return rd_sreg[regval & 7]; /* Ignore REX */
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000127 if (!(REG_CREG & ~regflags))
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000128 return rd_creg[regval];
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000129 if (!(REG_DREG & ~regflags))
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000130 return rd_dreg[regval];
131 if (!(REG_TREG & ~regflags)) {
132 if (rex & REX_P)
133 return 0; /* TR registers are ill-defined with rex */
134 return rd_treg[regval];
135 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000136 if (!(FPUREG & ~regflags))
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000137 return rd_fpureg[regval & 7]; /* Ignore REX */
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000138 if (!(MMXREG & ~regflags))
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000139 return rd_mmxreg[regval & 7]; /* Ignore REX */
H. Peter Anvin4836e332002-04-30 20:56:43 +0000140 if (!(XMMREG & ~regflags))
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000141 return rd_xmmreg[regval];
H. Peter Anvin232badb2002-06-06 02:41:20 +0000142
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000143 return 0;
144}
145
Keith Kaniosa6dfa782007-04-13 16:47:53 +0000146static const char *whichcond(int condval)
H. Peter Anvineba20a72002-04-30 20:53:55 +0000147{
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000148 static int conds[] = {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000149 C_O, C_NO, C_C, C_NC, C_Z, C_NZ, C_NA, C_A,
150 C_S, C_NS, C_PE, C_PO, C_L, C_NL, C_NG, C_G
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000151 };
152 return conditions[conds[condval]];
153}
154
155/*
156 * Process an effective address (ModRM) specification.
157 */
Keith Kaniosb7a89542007-04-12 02:40:54 +0000158static uint8_t *do_ea(uint8_t *data, int modrm, int asize,
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000159 int segsize, operand * op, int rex)
H. Peter Anvineba20a72002-04-30 20:53:55 +0000160{
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000161 int mod, rm, scale, index, base;
162
163 mod = (modrm >> 6) & 03;
164 rm = modrm & 07;
165
H. Peter Anvine2c80182005-01-15 22:15:51 +0000166 if (mod == 3) { /* pure register version */
167 op->basereg = rm;
168 op->segment |= SEG_RMREG;
169 return data;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000170 }
171
172 op->addr_size = 0;
173
174 if (asize == 16) {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000175 /*
176 * <mod> specifies the displacement size (none, byte or
177 * word), and <rm> specifies the register combination.
178 * Exception: mod=0,rm=6 does not specify [BP] as one might
179 * expect, but instead specifies [disp16].
180 */
181 op->indexreg = op->basereg = -1;
182 op->scale = 1; /* always, in 16 bits */
183 switch (rm) {
184 case 0:
185 op->basereg = R_BX;
186 op->indexreg = R_SI;
187 break;
188 case 1:
189 op->basereg = R_BX;
190 op->indexreg = R_DI;
191 break;
192 case 2:
193 op->basereg = R_BP;
194 op->indexreg = R_SI;
195 break;
196 case 3:
197 op->basereg = R_BP;
198 op->indexreg = R_DI;
199 break;
200 case 4:
201 op->basereg = R_SI;
202 break;
203 case 5:
204 op->basereg = R_DI;
205 break;
206 case 6:
207 op->basereg = R_BP;
208 break;
209 case 7:
210 op->basereg = R_BX;
211 break;
212 }
213 if (rm == 6 && mod == 0) { /* special case */
214 op->basereg = -1;
215 if (segsize != 16)
216 op->addr_size = 16;
217 mod = 2; /* fake disp16 */
218 }
219 switch (mod) {
220 case 0:
221 op->segment |= SEG_NODISP;
222 break;
223 case 1:
224 op->segment |= SEG_DISP8;
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000225 op->offset = (int8_t)*data++;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000226 break;
227 case 2:
228 op->segment |= SEG_DISP16;
229 op->offset = *data++;
230 op->offset |= ((unsigned)*data++) << 8;
231 break;
232 }
233 return data;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000234 } else {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000235 /*
236 * Once again, <mod> specifies displacement size (this time
237 * none, byte or *dword*), while <rm> specifies the base
238 * register. Again, [EBP] is missing, replaced by a pure
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000239 * disp32 (this time that's mod=0,rm=*5*) in 32-bit mode,
240 * and RIP-relative addressing in 64-bit mode.
241 *
242 * However, rm=4
H. Peter Anvine2c80182005-01-15 22:15:51 +0000243 * indicates not a single base register, but instead the
244 * presence of a SIB byte...
245 */
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000246 int a64 = asize == 64;
247
H. Peter Anvine2c80182005-01-15 22:15:51 +0000248 op->indexreg = -1;
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000249
250 if (a64)
251 op->basereg = rd_reg64[rm | ((rex & REX_B) ? 8 : 0)];
252 else
253 op->basereg = rd_reg32[rm | ((rex & REX_B) ? 8 : 0)];
254
H. Peter Anvine2c80182005-01-15 22:15:51 +0000255 if (rm == 5 && mod == 0) {
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000256 if (segsize == 64) {
257 op->basereg = R_RIP;
258 op->segment |= SEG_RELATIVE;
259 mod = 2; /* fake disp32 */
260 } else {
261 op->basereg = -1;
262 if (segsize != 32)
263 op->addr_size = 32;
264 mod = 2; /* fake disp32 */
265 }
H. Peter Anvine2c80182005-01-15 22:15:51 +0000266 }
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000267
H. Peter Anvine2c80182005-01-15 22:15:51 +0000268 if (rm == 4) { /* process SIB */
269 scale = (*data >> 6) & 03;
270 index = (*data >> 3) & 07;
271 base = *data & 07;
272 data++;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000273
H. Peter Anvine2c80182005-01-15 22:15:51 +0000274 op->scale = 1 << scale;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000275
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000276 if (index == 4)
277 op->indexreg = -1; /* ESP/RSP/R12 cannot be an index */
278 else if (a64)
279 op->indexreg = rd_reg64[index | ((rex & REX_X) ? 8 : 0)];
280 else
281 op->indexreg = rd_reg64[index | ((rex & REX_X) ? 8 : 0)];
282
283 if (base == 5 && mod == 0) {
284 op->basereg = -1;
285 mod = 2; /* Fake disp32 */
286 } else if (a64)
287 op->basereg = rd_reg64[base | ((rex & REX_B) ? 8 : 0)];
288 else
289 op->basereg = rd_reg32[base | ((rex & REX_B) ? 8 : 0)];
H. Peter Anvine2c80182005-01-15 22:15:51 +0000290 }
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000291
H. Peter Anvine2c80182005-01-15 22:15:51 +0000292 switch (mod) {
293 case 0:
294 op->segment |= SEG_NODISP;
295 break;
296 case 1:
297 op->segment |= SEG_DISP8;
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000298 op->offset = gets8(data);
299 data++;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000300 break;
301 case 2:
302 op->segment |= SEG_DISP32;
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000303 op->offset = getu32(data);
304 data += 4;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000305 break;
306 }
307 return data;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000308 }
309}
310
311/*
H. Peter Anvinef7468f2002-04-30 20:57:59 +0000312 * Determine whether the instruction template in t corresponds to the data
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000313 * stream in data. Return the number of bytes matched if so.
314 */
Keith Kaniosb7a89542007-04-12 02:40:54 +0000315static int matches(struct itemplate *t, uint8_t *data, int asize,
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000316 int osize, int segsize, int rep, insn * ins,
317 int rex, int *rexout)
H. Peter Anvineba20a72002-04-30 20:53:55 +0000318{
Keith Kaniosb7a89542007-04-12 02:40:54 +0000319 uint8_t *r = (uint8_t *)(t->code);
320 uint8_t *origdata = data;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000321 int a_used = FALSE, o_used = FALSE;
322 int drep = 0;
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000323
324 *rexout = rex;
325
326 if (segsize == 64) {
327 if (t->flags & IF_NOLONG)
328 return FALSE;
329 } else {
330 if (t->flags & IF_X64)
331 return FALSE;
332 }
H. Peter Anvinef7468f2002-04-30 20:57:59 +0000333
H. Peter Anvine2c80182005-01-15 22:15:51 +0000334 if (rep == 0xF2)
335 drep = P_REPNE;
336 else if (rep == 0xF3)
337 drep = P_REP;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000338
H. Peter Anvine2c80182005-01-15 22:15:51 +0000339 while (*r) {
340 int c = *r++;
341 if (c >= 01 && c <= 03) {
342 while (c--)
343 if (*r++ != *data++)
344 return FALSE;
345 }
346 if (c == 04) {
347 switch (*data++) {
348 case 0x07:
349 ins->oprs[0].basereg = 0;
350 break;
351 case 0x17:
352 ins->oprs[0].basereg = 2;
353 break;
354 case 0x1F:
355 ins->oprs[0].basereg = 3;
356 break;
357 default:
358 return FALSE;
359 }
360 }
361 if (c == 05) {
362 switch (*data++) {
363 case 0xA1:
364 ins->oprs[0].basereg = 4;
365 break;
366 case 0xA9:
367 ins->oprs[0].basereg = 5;
368 break;
369 default:
370 return FALSE;
371 }
372 }
373 if (c == 06) {
374 switch (*data++) {
375 case 0x06:
376 ins->oprs[0].basereg = 0;
377 break;
378 case 0x0E:
379 ins->oprs[0].basereg = 1;
380 break;
381 case 0x16:
382 ins->oprs[0].basereg = 2;
383 break;
384 case 0x1E:
385 ins->oprs[0].basereg = 3;
386 break;
387 default:
388 return FALSE;
389 }
390 }
391 if (c == 07) {
392 switch (*data++) {
393 case 0xA0:
394 ins->oprs[0].basereg = 4;
395 break;
396 case 0xA8:
397 ins->oprs[0].basereg = 5;
398 break;
399 default:
400 return FALSE;
401 }
402 }
403 if (c >= 010 && c <= 012) {
404 int t = *r++, d = *data++;
405 if (d < t || d > t + 7)
406 return FALSE;
407 else {
408 ins->oprs[c - 010].basereg = d - t;
409 ins->oprs[c - 010].segment |= SEG_RMREG;
410 }
411 }
412 if (c == 017)
413 if (*data++)
414 return FALSE;
415 if (c >= 014 && c <= 016) {
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000416 ins->oprs[c - 014].offset = (int8_t)*data++;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000417 ins->oprs[c - 014].segment |= SEG_SIGNED;
418 }
419 if (c >= 020 && c <= 022)
420 ins->oprs[c - 020].offset = *data++;
421 if (c >= 024 && c <= 026)
422 ins->oprs[c - 024].offset = *data++;
423 if (c >= 030 && c <= 032) {
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000424 ins->oprs[c - 030].offset = getu16(data);
425 data += 2;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000426 }
427 if (c >= 034 && c <= 036) {
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000428 if (osize == 32) {
429 ins->oprs[c - 034].offset = getu32(data);
430 data += 4;
431 } else {
432 ins->oprs[c - 034].offset = getu16(data);
433 data += 2;
434 }
H. Peter Anvine2c80182005-01-15 22:15:51 +0000435 if (segsize != asize)
436 ins->oprs[c - 034].addr_size = asize;
437 }
438 if (c >= 040 && c <= 042) {
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000439 ins->oprs[c - 040].offset = getu32(data);
440 data += 4;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000441 }
442 if (c >= 044 && c <= 046) {
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000443 /* hpa: should this be gets32/gets16? */
444 if (asize == 32) {
445 ins->oprs[c - 044].offset = getu32(data);
446 data += 4;
447 } else {
448 ins->oprs[c - 044].offset = getu16(data);
449 data += 2;
450 }
H. Peter Anvine2c80182005-01-15 22:15:51 +0000451 if (segsize != asize)
452 ins->oprs[c - 044].addr_size = asize;
453 }
454 if (c >= 050 && c <= 052) {
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000455 ins->oprs[c - 050].offset = gets8(data++);
H. Peter Anvine2c80182005-01-15 22:15:51 +0000456 ins->oprs[c - 050].segment |= SEG_RELATIVE;
457 }
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000458 if (c >= 054 && c <= 056) {
459 ins->oprs[c - 054].offset = getu64(data);
460 data += 8;
461 }
H. Peter Anvine2c80182005-01-15 22:15:51 +0000462 if (c >= 060 && c <= 062) {
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000463 ins->oprs[c - 060].offset = gets16(data);
464 data += 2;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000465 ins->oprs[c - 060].segment |= SEG_RELATIVE;
466 ins->oprs[c - 060].segment &= ~SEG_32BIT;
467 }
468 if (c >= 064 && c <= 066) {
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000469 if (osize == 32) {
470 ins->oprs[c - 064].offset = getu32(data);
471 data += 4;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000472 ins->oprs[c - 064].segment |= SEG_32BIT;
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000473 } else {
474 ins->oprs[c - 064].offset = getu16(data);
475 data += 2;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000476 ins->oprs[c - 064].segment &= ~SEG_32BIT;
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000477 }
H. Peter Anvine2c80182005-01-15 22:15:51 +0000478 if (segsize != osize) {
479 ins->oprs[c - 064].type =
480 (ins->oprs[c - 064].type & NON_SIZE)
481 | ((osize == 16) ? BITS16 : BITS32);
482 }
483 }
484 if (c >= 070 && c <= 072) {
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000485 ins->oprs[c - 070].offset = getu32(data);
486 data += 4;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000487 ins->oprs[c - 070].segment |= SEG_32BIT | SEG_RELATIVE;
488 }
489 if (c >= 0100 && c < 0130) {
490 int modrm = *data++;
491 ins->oprs[c & 07].basereg = (modrm >> 3) & 07;
492 ins->oprs[c & 07].segment |= SEG_RMREG;
493 data = do_ea(data, modrm, asize, segsize,
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000494 &ins->oprs[(c >> 3) & 07], rex);
H. Peter Anvine2c80182005-01-15 22:15:51 +0000495 }
496 if (c >= 0130 && c <= 0132) {
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000497 ins->oprs[c - 0130].offset = getu16(data);
498 data += 2;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000499 }
500 if (c >= 0140 && c <= 0142) {
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000501 ins->oprs[c - 0140].offset = getu32(data);
502 data += 4;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000503 }
504 if (c >= 0200 && c <= 0277) {
505 int modrm = *data++;
506 if (((modrm >> 3) & 07) != (c & 07))
507 return FALSE; /* spare field doesn't match up */
508 data = do_ea(data, modrm, asize, segsize,
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000509 &ins->oprs[(c >> 3) & 07], rex);
H. Peter Anvine2c80182005-01-15 22:15:51 +0000510 }
511 if (c >= 0300 && c <= 0302) {
512 if (asize)
513 ins->oprs[c - 0300].segment |= SEG_32BIT;
514 else
515 ins->oprs[c - 0300].segment &= ~SEG_32BIT;
516 a_used = TRUE;
517 }
518 if (c == 0310) {
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000519 if (asize != 16)
H. Peter Anvine2c80182005-01-15 22:15:51 +0000520 return FALSE;
521 else
522 a_used = TRUE;
523 }
524 if (c == 0311) {
525 if (asize == 16)
526 return FALSE;
527 else
528 a_used = TRUE;
529 }
530 if (c == 0312) {
531 if (asize != segsize)
532 return FALSE;
533 else
534 a_used = TRUE;
535 }
536 if (c == 0320) {
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000537 if (osize != 16)
H. Peter Anvine2c80182005-01-15 22:15:51 +0000538 return FALSE;
539 else
540 o_used = TRUE;
541 }
542 if (c == 0321) {
543 if (osize == 16)
544 return FALSE;
545 else
546 o_used = TRUE;
547 }
548 if (c == 0322) {
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000549 if (osize != (segsize == 16) ? 16 : 32)
H. Peter Anvine2c80182005-01-15 22:15:51 +0000550 return FALSE;
551 else
552 o_used = TRUE;
553 }
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000554 if (c == 0323) {
555 rex |= REX_W; /* 64-bit only instruction */
556 osize = 64;
557 }
558 if (c == 0324) {
559 if (!(rex & REX_P))
560 return FALSE;
561 }
H. Peter Anvine2c80182005-01-15 22:15:51 +0000562 if (c == 0330) {
563 int t = *r++, d = *data++;
564 if (d < t || d > t + 15)
565 return FALSE;
566 else
567 ins->condition = d - t;
568 }
569 if (c == 0331) {
570 if (rep)
571 return FALSE;
572 }
573 if (c == 0332) {
574 if (drep == P_REP)
575 drep = P_REPE;
576 }
577 if (c == 0333) {
578 if (rep != 0xF3)
579 return FALSE;
580 drep = 0;
581 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000582 }
583
584 /*
H. Peter Anvinef7468f2002-04-30 20:57:59 +0000585 * Check for unused rep or a/o prefixes.
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000586 */
587 ins->nprefix = 0;
H. Peter Anvinef7468f2002-04-30 20:57:59 +0000588 if (drep)
589 ins->prefixes[ins->nprefix++] = drep;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000590 if (!a_used && asize != segsize)
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000591 ins->prefixes[ins->nprefix++] = asize == 16 ? P_A16 : P_A32;
592 if (!o_used && osize == ((segsize == 16) ? 32 : 16)) {
593 fprintf(stderr, "osize = %d, segsize = %d\n", osize, segsize);
594 ins->prefixes[ins->nprefix++] = osize == 16 ? P_O16 : P_O32;
595 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000596
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000597 /* Fix: check for redundant REX prefixes */
598
599 *rexout = rex;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000600 return data - origdata;
601}
602
Keith Kaniosa6dfa782007-04-13 16:47:53 +0000603int32_t disasm(uint8_t *data, char *output, int outbufsize, int segsize,
Keith Kaniosb7a89542007-04-12 02:40:54 +0000604 int32_t offset, int autosync, uint32_t prefer)
H. Peter Anvineba20a72002-04-30 20:53:55 +0000605{
H. Peter Anvin4836e332002-04-30 20:56:43 +0000606 struct itemplate **p, **best_p;
607 int length, best_length = 0;
Keith Kaniosa6dfa782007-04-13 16:47:53 +0000608 char *segover;
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000609 int rep, lock, asize, osize, i, slen, colon, rex, rexout, best_rex;
Keith Kaniosb7a89542007-04-12 02:40:54 +0000610 uint8_t *origdata;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000611 int works;
H. Peter Anvinef7468f2002-04-30 20:57:59 +0000612 insn tmp_ins, ins;
Keith Kaniosb7a89542007-04-12 02:40:54 +0000613 uint32_t goodness, best;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000614
615 /*
616 * Scan for prefixes.
617 */
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000618 asize = segsize;
619 osize = (segsize == 64) ? 32 : segsize;
620 rex = 0;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000621 segover = NULL;
622 rep = lock = 0;
623 origdata = data;
624 for (;;) {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000625 if (*data == 0xF3 || *data == 0xF2)
626 rep = *data++;
627 else if (*data == 0xF0)
628 lock = *data++;
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000629 else if (*data == 0x2E)
630 segover = "cs", data++;
631 else if (*data == 0x36)
632 segover = "ss", data++;
633 else if (*data == 0x3E)
634 segover = "ds", data++;
635 else if (*data == 0x26)
636 segover = "es", data++;
637 else if (*data == 0x64)
638 segover = "fs", data++;
639 else if (*data == 0x65)
640 segover = "gs", data++;
641 else if (*data == 0x66) {
642 if (segsize != 64) /* 66 prefix is ignored in 64-bit mode */
643 osize = 48 - segsize;
644 data++;
645 } else if (*data == 0x67) {
646 asize = (segsize == 32) ? 16 : 32;
647 data++;
648 } else if (segsize == 64 && (*data & 0xf0) == REX_P) {
649 rex = *data++;
650 if (rex & REX_W)
651 osize = 64;
652 break; /* REX is always the last prefix */
653 } else {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000654 break;
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000655 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000656 }
657
H. Peter Anvinef7468f2002-04-30 20:57:59 +0000658 tmp_ins.oprs[0].segment = tmp_ins.oprs[1].segment =
H. Peter Anvine2c80182005-01-15 22:15:51 +0000659 tmp_ins.oprs[2].segment =
660 tmp_ins.oprs[0].addr_size = tmp_ins.oprs[1].addr_size =
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000661 tmp_ins.oprs[2].addr_size = (segsize == 64 ? SEG_64BIT :
662 segsize == 32 ? SEG_32BIT : 0);
H. Peter Anvinef7468f2002-04-30 20:57:59 +0000663 tmp_ins.condition = -1;
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000664 best = -1; /* Worst possible */
H. Peter Anvin4836e332002-04-30 20:56:43 +0000665 best_p = NULL;
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000666 best_rex = 0;
H. Peter Anvin4836e332002-04-30 20:56:43 +0000667 for (p = itable[*data]; *p; p++) {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000668 if ((length = matches(*p, data, asize, osize,
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000669 segsize, rep, &tmp_ins, rex, &rexout))) {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000670 works = TRUE;
671 /*
672 * Final check to make sure the types of r/m match up.
673 */
674 for (i = 0; i < (*p)->operands; i++) {
675 if (
676 /* If it's a mem-only EA but we have a register, die. */
677 ((tmp_ins.oprs[i].segment & SEG_RMREG) &&
678 !(MEMORY & ~(*p)->opd[i])) ||
679 /* If it's a reg-only EA but we have a memory ref, die. */
680 (!(tmp_ins.oprs[i].segment & SEG_RMREG) &&
681 !(REGNORM & ~(*p)->opd[i]) &&
682 !((*p)->opd[i] & REG_SMASK)) ||
683 /* Register type mismatch (eg FS vs REG_DESS): die. */
684 ((((*p)->opd[i] & (REGISTER | FPUREG)) ||
685 (tmp_ins.oprs[i].segment & SEG_RMREG)) &&
686 !whichreg((*p)->opd[i],
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000687 tmp_ins.oprs[i].basereg, rexout))) {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000688 works = FALSE;
689 break;
690 }
691 }
692
693 if (works) {
694 goodness = ((*p)->flags & IF_PFMASK) ^ prefer;
695 if (goodness < best) {
696 /* This is the best one found so far */
697 best = goodness;
698 best_p = p;
699 best_length = length;
700 ins = tmp_ins;
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000701 best_rex = rexout;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000702 }
703 }
704 }
H. Peter Anvin4836e332002-04-30 20:56:43 +0000705 }
H. Peter Anvineba20a72002-04-30 20:53:55 +0000706
H. Peter Anvinef7468f2002-04-30 20:57:59 +0000707 if (!best_p)
H. Peter Anvine2c80182005-01-15 22:15:51 +0000708 return 0; /* no instruction was matched */
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000709
H. Peter Anvin4836e332002-04-30 20:56:43 +0000710 /* Pick the best match */
H. Peter Anvine2c80182005-01-15 22:15:51 +0000711 p = best_p;
H. Peter Anvin4836e332002-04-30 20:56:43 +0000712 length = best_length;
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000713 rex = best_rex;
714 if (best_rex & REX_W)
715 osize = 64;
H. Peter Anvin4836e332002-04-30 20:56:43 +0000716
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000717 slen = 0;
718
Ed Beroset64ab5192004-12-15 23:32:57 +0000719 /* TODO: snprintf returns the value that the string would have if
H. Peter Anvine2c80182005-01-15 22:15:51 +0000720 * the buffer were long enough, and not the actual length of
721 * the returned string, so each instance of using the return
722 * value of snprintf should actually be checked to assure that
723 * the return value is "sane." Maybe a macro wrapper could
724 * be used for that purpose.
725 */
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000726 if (lock)
H. Peter Anvine2c80182005-01-15 22:15:51 +0000727 slen += snprintf(output + slen, outbufsize - slen, "lock ");
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000728 for (i = 0; i < ins.nprefix; i++)
H. Peter Anvine2c80182005-01-15 22:15:51 +0000729 switch (ins.prefixes[i]) {
730 case P_REP:
731 slen += snprintf(output + slen, outbufsize - slen, "rep ");
732 break;
733 case P_REPE:
734 slen += snprintf(output + slen, outbufsize - slen, "repe ");
735 break;
736 case P_REPNE:
737 slen += snprintf(output + slen, outbufsize - slen, "repne ");
738 break;
739 case P_A16:
740 slen += snprintf(output + slen, outbufsize - slen, "a16 ");
741 break;
742 case P_A32:
743 slen += snprintf(output + slen, outbufsize - slen, "a32 ");
744 break;
745 case P_O16:
746 slen += snprintf(output + slen, outbufsize - slen, "o16 ");
747 break;
748 case P_O32:
749 slen += snprintf(output + slen, outbufsize - slen, "o32 ");
750 break;
751 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000752
753 for (i = 0; i < elements(ico); i++)
H. Peter Anvine2c80182005-01-15 22:15:51 +0000754 if ((*p)->opcode == ico[i]) {
755 slen +=
756 snprintf(output + slen, outbufsize - slen, "%s%s", icn[i],
757 whichcond(ins.condition));
758 break;
759 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000760 if (i >= elements(ico))
H. Peter Anvine2c80182005-01-15 22:15:51 +0000761 slen +=
762 snprintf(output + slen, outbufsize - slen, "%s",
763 insn_names[(*p)->opcode]);
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000764 colon = FALSE;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000765 length += data - origdata; /* fix up for prefixes */
766 for (i = 0; i < (*p)->operands; i++) {
767 output[slen++] = (colon ? ':' : i == 0 ? ' ' : ',');
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000768
H. Peter Anvine2c80182005-01-15 22:15:51 +0000769 if (ins.oprs[i].segment & SEG_RELATIVE) {
770 ins.oprs[i].offset += offset + length;
771 /*
772 * sort out wraparound
773 */
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000774 if (!(ins.oprs[i].segment & (SEG_32BIT|SEG_64BIT)))
775 ins.oprs[i].offset &= 0xffff;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000776 /*
777 * add sync marker, if autosync is on
778 */
779 if (autosync)
780 add_sync(ins.oprs[i].offset, 0L);
781 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000782
H. Peter Anvine2c80182005-01-15 22:15:51 +0000783 if ((*p)->opd[i] & COLON)
784 colon = TRUE;
785 else
786 colon = FALSE;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000787
H. Peter Anvine2c80182005-01-15 22:15:51 +0000788 if (((*p)->opd[i] & (REGISTER | FPUREG)) ||
789 (ins.oprs[i].segment & SEG_RMREG)) {
790 ins.oprs[i].basereg = whichreg((*p)->opd[i],
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000791 ins.oprs[i].basereg, rex);
H. Peter Anvine2c80182005-01-15 22:15:51 +0000792 if ((*p)->opd[i] & TO)
793 slen += snprintf(output + slen, outbufsize - slen, "to ");
794 slen += snprintf(output + slen, outbufsize - slen, "%s",
795 reg_names[ins.oprs[i].basereg -
796 EXPR_REG_START]);
797 } else if (!(UNITY & ~(*p)->opd[i])) {
798 output[slen++] = '1';
799 } else if ((*p)->opd[i] & IMMEDIATE) {
800 if ((*p)->opd[i] & BITS8) {
801 slen +=
802 snprintf(output + slen, outbufsize - slen, "byte ");
803 if (ins.oprs[i].segment & SEG_SIGNED) {
804 if (ins.oprs[i].offset < 0) {
805 ins.oprs[i].offset *= -1;
806 output[slen++] = '-';
807 } else
808 output[slen++] = '+';
809 }
810 } else if ((*p)->opd[i] & BITS16) {
811 slen +=
812 snprintf(output + slen, outbufsize - slen, "word ");
813 } else if ((*p)->opd[i] & BITS32) {
814 slen +=
815 snprintf(output + slen, outbufsize - slen, "dword ");
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000816 } else if ((*p)->opd[i] & BITS64) {
817 slen +=
818 snprintf(output + slen, outbufsize - slen, "qword ");
H. Peter Anvine2c80182005-01-15 22:15:51 +0000819 } else if ((*p)->opd[i] & NEAR) {
820 slen +=
821 snprintf(output + slen, outbufsize - slen, "near ");
822 } else if ((*p)->opd[i] & SHORT) {
823 slen +=
824 snprintf(output + slen, outbufsize - slen, "short ");
825 }
826 slen +=
Keith Kanios93f2e9a2007-04-14 00:10:59 +0000827 snprintf(output + slen, outbufsize - slen, "0x%"PRIx64"",
H. Peter Anvine2c80182005-01-15 22:15:51 +0000828 ins.oprs[i].offset);
829 } else if (!(MEM_OFFS & ~(*p)->opd[i])) {
830 slen +=
Keith Kanios93f2e9a2007-04-14 00:10:59 +0000831 snprintf(output + slen, outbufsize - slen, "[%s%s%s0x%"PRIx64"]",
Keith Kaniosb7a89542007-04-12 02:40:54 +0000832 ((const char*)segover ? (const char*)segover : ""), /* placate type mistmatch warning */
833 ((const char*)segover ? ":" : ""), /* by using (const char*) instead of uint8_t* */
H. Peter Anvine2c80182005-01-15 22:15:51 +0000834 (ins.oprs[i].addr_size ==
835 32 ? "dword " : ins.oprs[i].addr_size ==
836 16 ? "word " : ""), ins.oprs[i].offset);
837 segover = NULL;
838 } else if (!(REGMEM & ~(*p)->opd[i])) {
839 int started = FALSE;
840 if ((*p)->opd[i] & BITS8)
841 slen +=
842 snprintf(output + slen, outbufsize - slen, "byte ");
843 if ((*p)->opd[i] & BITS16)
844 slen +=
845 snprintf(output + slen, outbufsize - slen, "word ");
846 if ((*p)->opd[i] & BITS32)
847 slen +=
848 snprintf(output + slen, outbufsize - slen, "dword ");
849 if ((*p)->opd[i] & BITS64)
850 slen +=
851 snprintf(output + slen, outbufsize - slen, "qword ");
852 if ((*p)->opd[i] & BITS80)
853 slen +=
854 snprintf(output + slen, outbufsize - slen, "tword ");
855 if ((*p)->opd[i] & FAR)
856 slen += snprintf(output + slen, outbufsize - slen, "far ");
857 if ((*p)->opd[i] & NEAR)
858 slen +=
859 snprintf(output + slen, outbufsize - slen, "near ");
860 output[slen++] = '[';
861 if (ins.oprs[i].addr_size)
862 slen += snprintf(output + slen, outbufsize - slen, "%s",
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000863 (ins.oprs[i].addr_size == 64 ? "qword " :
864 ins.oprs[i].addr_size == 32 ? "dword " :
865 ins.oprs[i].addr_size == 16 ? "word " :
866 ""));
H. Peter Anvine2c80182005-01-15 22:15:51 +0000867 if (segover) {
868 slen +=
869 snprintf(output + slen, outbufsize - slen, "%s:",
870 segover);
871 segover = NULL;
872 }
873 if (ins.oprs[i].basereg != -1) {
874 slen += snprintf(output + slen, outbufsize - slen, "%s",
875 reg_names[(ins.oprs[i].basereg -
876 EXPR_REG_START)]);
877 started = TRUE;
878 }
879 if (ins.oprs[i].indexreg != -1) {
880 if (started)
881 output[slen++] = '+';
882 slen += snprintf(output + slen, outbufsize - slen, "%s",
883 reg_names[(ins.oprs[i].indexreg -
884 EXPR_REG_START)]);
885 if (ins.oprs[i].scale > 1)
886 slen +=
887 snprintf(output + slen, outbufsize - slen, "*%d",
888 ins.oprs[i].scale);
889 started = TRUE;
890 }
891 if (ins.oprs[i].segment & SEG_DISP8) {
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000892 int minus = 0;
893 int8_t offset = ins.oprs[i].offset;
894 if (offset < 0) {
895 minus = 1;
896 offset = -offset;
897 }
H. Peter Anvine2c80182005-01-15 22:15:51 +0000898 slen +=
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000899 snprintf(output + slen, outbufsize - slen, "%s0x%"PRIx8"",
900 minus ? "-" : "+", offset);
H. Peter Anvine2c80182005-01-15 22:15:51 +0000901 } else if (ins.oprs[i].segment & SEG_DISP16) {
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000902 int minus = 0;
903 int16_t offset = ins.oprs[i].offset;
904 if (offset < 0) {
905 minus = 1;
906 offset = -offset;
907 }
H. Peter Anvine2c80182005-01-15 22:15:51 +0000908 slen +=
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000909 snprintf(output + slen, outbufsize - slen, "%s0x%"PRIx16"",
910 minus ? "-" : started ? "+" : "", offset);
H. Peter Anvine2c80182005-01-15 22:15:51 +0000911 } else if (ins.oprs[i].segment & SEG_DISP32) {
H. Peter Anvin0ee01422007-04-16 01:18:30 +0000912 char *prefix = "";
913 int32_t offset = ins.oprs[i].offset;
914 if (ins.oprs[i].basereg == R_RIP) {
915 prefix = ":";
916 } else if (offset < 0) {
917 offset = -offset;
918 prefix = "-";
919 } else {
920 prefix = started ? "+" : "";
921 }
922 slen +=
923 snprintf(output + slen, outbufsize - slen,
924 "%s0x%"PRIx32"", prefix, offset);
H. Peter Anvine2c80182005-01-15 22:15:51 +0000925 }
926 output[slen++] = ']';
927 } else {
928 slen +=
929 snprintf(output + slen, outbufsize - slen, "<operand%d>",
930 i);
931 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000932 }
933 output[slen] = '\0';
H. Peter Anvine2c80182005-01-15 22:15:51 +0000934 if (segover) { /* unused segment override */
Keith Kaniosa6dfa782007-04-13 16:47:53 +0000935 char *p = output;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000936 int count = slen + 1;
937 while (count--)
938 p[count + 3] = p[count];
939 strncpy(output, segover, 2);
940 output[2] = ' ';
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000941 }
942 return length;
943}
944
Keith Kaniosa6dfa782007-04-13 16:47:53 +0000945int32_t eatbyte(uint8_t *data, char *output, int outbufsize)
H. Peter Anvineba20a72002-04-30 20:53:55 +0000946{
Ed Beroset92348172004-12-15 18:27:50 +0000947 snprintf(output, outbufsize, "db 0x%02X", *data);
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000948 return 1;
949}