H. Peter Anvin | ea6e34d | 2002-04-30 20:51:32 +0000 | [diff] [blame] | 1 | /* 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 | |
| 21 | extern 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 Anvin | eba20a7 | 2002-04-30 20:53:55 +0000 | [diff] [blame] | 36 | static int whichreg(long regflags, int regval) |
| 37 | { |
H. Peter Anvin | ea6e34d | 2002-04-30 20:51:32 +0000 | [diff] [blame] | 38 | static int reg32[] = { |
| 39 | R_EAX, R_ECX, R_EDX, R_EBX, R_ESP, R_EBP, R_ESI, R_EDI }; |
| 40 | static int reg16[] = { |
| 41 | R_AX, R_CX, R_DX, R_BX, R_SP, R_BP, R_SI, R_DI }; |
| 42 | static int reg8[] = { |
| 43 | R_AL, R_CL, R_DL, R_BL, R_AH, R_CH, R_DH, R_BH }; |
| 44 | static int sreg[] = { |
| 45 | R_ES, R_CS, R_SS, R_DS, R_FS, R_GS, 0, 0 }; |
| 46 | static int creg[] = { |
| 47 | R_CR0, 0, R_CR2, R_CR3, R_CR4, 0, 0, 0 }; |
| 48 | static int dreg[] = { |
| 49 | R_DR0, R_DR1, R_DR2, R_DR3, 0, 0, R_DR6, R_DR7 }; |
| 50 | static int treg[] = { |
| 51 | 0, 0, 0, R_TR3, R_TR4, R_TR5, R_TR6, R_TR7 }; |
| 52 | static int fpureg[] = { |
| 53 | R_ST0, R_ST1, R_ST2, R_ST3, R_ST4, R_ST5, R_ST6, R_ST7 }; |
| 54 | static int mmxreg[] = { |
| 55 | R_MM0, R_MM1, R_MM2, R_MM3, R_MM4, R_MM5, R_MM6, R_MM7 }; |
H. Peter Anvin | 4836e33 | 2002-04-30 20:56:43 +0000 | [diff] [blame^] | 56 | static int xmmreg[] = { |
| 57 | R_XMM0, R_XMM1, R_XMM2, R_XMM3, R_XMM4, R_XMM5, R_XMM6, R_XMM7 }; |
H. Peter Anvin | ea6e34d | 2002-04-30 20:51:32 +0000 | [diff] [blame] | 58 | |
| 59 | if (!(REG_AL & ~regflags)) |
| 60 | return R_AL; |
| 61 | if (!(REG_AX & ~regflags)) |
| 62 | return R_AX; |
| 63 | if (!(REG_EAX & ~regflags)) |
| 64 | return R_EAX; |
| 65 | if (!(REG_DX & ~regflags)) |
| 66 | return R_DX; |
| 67 | if (!(REG_CL & ~regflags)) |
| 68 | return R_CL; |
| 69 | if (!(REG_CX & ~regflags)) |
| 70 | return R_CX; |
| 71 | if (!(REG_ECX & ~regflags)) |
| 72 | return R_ECX; |
| 73 | if (!(REG_CR4 & ~regflags)) |
| 74 | return R_CR4; |
| 75 | if (!(FPU0 & ~regflags)) |
| 76 | return R_ST0; |
H. Peter Anvin | d7ed89e | 2002-04-30 20:52:08 +0000 | [diff] [blame] | 77 | if (!(REG_CS & ~regflags)) |
| 78 | return R_CS; |
H. Peter Anvin | 76690a1 | 2002-04-30 20:52:49 +0000 | [diff] [blame] | 79 | if (!(REG_DESS & ~regflags)) |
| 80 | return (regval == 0 || regval == 2 || regval == 3 ? sreg[regval] : 0); |
| 81 | if (!(REG_FSGS & ~regflags)) |
| 82 | return (regval == 4 || regval == 5 ? sreg[regval] : 0); |
H. Peter Anvin | ea6e34d | 2002-04-30 20:51:32 +0000 | [diff] [blame] | 83 | if (!((REGMEM|BITS8) & ~regflags)) |
| 84 | return reg8[regval]; |
| 85 | if (!((REGMEM|BITS16) & ~regflags)) |
| 86 | return reg16[regval]; |
| 87 | if (!((REGMEM|BITS32) & ~regflags)) |
| 88 | return reg32[regval]; |
| 89 | if (!(REG_SREG & ~regflags)) |
| 90 | return sreg[regval]; |
| 91 | if (!(REG_CREG & ~regflags)) |
| 92 | return creg[regval]; |
| 93 | if (!(REG_DREG & ~regflags)) |
| 94 | return dreg[regval]; |
| 95 | if (!(REG_TREG & ~regflags)) |
| 96 | return treg[regval]; |
| 97 | if (!(FPUREG & ~regflags)) |
| 98 | return fpureg[regval]; |
| 99 | if (!(MMXREG & ~regflags)) |
| 100 | return mmxreg[regval]; |
H. Peter Anvin | 4836e33 | 2002-04-30 20:56:43 +0000 | [diff] [blame^] | 101 | if (!(XMMREG & ~regflags)) |
| 102 | return xmmreg[regval]; |
H. Peter Anvin | ea6e34d | 2002-04-30 20:51:32 +0000 | [diff] [blame] | 103 | return 0; |
| 104 | } |
| 105 | |
H. Peter Anvin | eba20a7 | 2002-04-30 20:53:55 +0000 | [diff] [blame] | 106 | static char *whichcond(int condval) |
| 107 | { |
H. Peter Anvin | ea6e34d | 2002-04-30 20:51:32 +0000 | [diff] [blame] | 108 | static int conds[] = { |
H. Peter Anvin | 6768eb7 | 2002-04-30 20:52:26 +0000 | [diff] [blame] | 109 | C_O, C_NO, C_C, C_NC, C_Z, C_NZ, C_NA, C_A, |
| 110 | C_S, C_NS, C_PE, C_PO, C_L, C_NL, C_NG, C_G |
H. Peter Anvin | ea6e34d | 2002-04-30 20:51:32 +0000 | [diff] [blame] | 111 | }; |
| 112 | return conditions[conds[condval]]; |
| 113 | } |
| 114 | |
| 115 | /* |
| 116 | * Process an effective address (ModRM) specification. |
| 117 | */ |
| 118 | static unsigned char *do_ea (unsigned char *data, int modrm, int asize, |
H. Peter Anvin | eba20a7 | 2002-04-30 20:53:55 +0000 | [diff] [blame] | 119 | int segsize, operand *op) |
| 120 | { |
H. Peter Anvin | ea6e34d | 2002-04-30 20:51:32 +0000 | [diff] [blame] | 121 | int mod, rm, scale, index, base; |
| 122 | |
| 123 | mod = (modrm >> 6) & 03; |
| 124 | rm = modrm & 07; |
| 125 | |
| 126 | if (mod == 3) { /* pure register version */ |
| 127 | op->basereg = rm; |
| 128 | op->segment |= SEG_RMREG; |
| 129 | return data; |
| 130 | } |
| 131 | |
| 132 | op->addr_size = 0; |
| 133 | |
| 134 | if (asize == 16) { |
| 135 | /* |
| 136 | * <mod> specifies the displacement size (none, byte or |
| 137 | * word), and <rm> specifies the register combination. |
| 138 | * Exception: mod=0,rm=6 does not specify [BP] as one might |
| 139 | * expect, but instead specifies [disp16]. |
| 140 | */ |
| 141 | op->indexreg = op->basereg = -1; |
| 142 | op->scale = 1; /* always, in 16 bits */ |
| 143 | switch (rm) { |
| 144 | case 0: op->basereg = R_BX; op->indexreg = R_SI; break; |
| 145 | case 1: op->basereg = R_BX; op->indexreg = R_DI; break; |
| 146 | case 2: op->basereg = R_BP; op->indexreg = R_SI; break; |
| 147 | case 3: op->basereg = R_BP; op->indexreg = R_DI; break; |
| 148 | case 4: op->basereg = R_SI; break; |
| 149 | case 5: op->basereg = R_DI; break; |
| 150 | case 6: op->basereg = R_BP; break; |
| 151 | case 7: op->basereg = R_BX; break; |
| 152 | } |
| 153 | if (rm == 6 && mod == 0) { /* special case */ |
| 154 | op->basereg = -1; |
| 155 | if (segsize != 16) |
| 156 | op->addr_size = 16; |
| 157 | mod = 2; /* fake disp16 */ |
| 158 | } |
| 159 | switch (mod) { |
| 160 | case 0: |
| 161 | op->segment |= SEG_NODISP; |
| 162 | break; |
| 163 | case 1: |
| 164 | op->segment |= SEG_DISP8; |
| 165 | op->offset = (signed char) *data++; |
| 166 | break; |
| 167 | case 2: |
| 168 | op->segment |= SEG_DISP16; |
| 169 | op->offset = *data++; |
| 170 | op->offset |= (*data++) << 8; |
| 171 | break; |
| 172 | } |
| 173 | return data; |
| 174 | } else { |
| 175 | /* |
| 176 | * Once again, <mod> specifies displacement size (this time |
| 177 | * none, byte or *dword*), while <rm> specifies the base |
| 178 | * register. Again, [EBP] is missing, replaced by a pure |
| 179 | * disp32 (this time that's mod=0,rm=*5*). However, rm=4 |
| 180 | * indicates not a single base register, but instead the |
| 181 | * presence of a SIB byte... |
| 182 | */ |
| 183 | op->indexreg = -1; |
| 184 | switch (rm) { |
| 185 | case 0: op->basereg = R_EAX; break; |
| 186 | case 1: op->basereg = R_ECX; break; |
| 187 | case 2: op->basereg = R_EDX; break; |
| 188 | case 3: op->basereg = R_EBX; break; |
| 189 | case 5: op->basereg = R_EBP; break; |
| 190 | case 6: op->basereg = R_ESI; break; |
| 191 | case 7: op->basereg = R_EDI; break; |
| 192 | } |
| 193 | if (rm == 5 && mod == 0) { |
| 194 | op->basereg = -1; |
| 195 | if (segsize != 32) |
| 196 | op->addr_size = 32; |
| 197 | mod = 2; /* fake disp32 */ |
| 198 | } |
| 199 | if (rm == 4) { /* process SIB */ |
| 200 | scale = (*data >> 6) & 03; |
| 201 | index = (*data >> 3) & 07; |
| 202 | base = *data & 07; |
| 203 | data++; |
| 204 | |
| 205 | op->scale = 1 << scale; |
| 206 | switch (index) { |
| 207 | case 0: op->indexreg = R_EAX; break; |
| 208 | case 1: op->indexreg = R_ECX; break; |
| 209 | case 2: op->indexreg = R_EDX; break; |
| 210 | case 3: op->indexreg = R_EBX; break; |
| 211 | case 4: op->indexreg = -1; break; |
| 212 | case 5: op->indexreg = R_EBP; break; |
| 213 | case 6: op->indexreg = R_ESI; break; |
| 214 | case 7: op->indexreg = R_EDI; break; |
| 215 | } |
| 216 | |
| 217 | switch (base) { |
| 218 | case 0: op->basereg = R_EAX; break; |
| 219 | case 1: op->basereg = R_ECX; break; |
| 220 | case 2: op->basereg = R_EDX; break; |
| 221 | case 3: op->basereg = R_EBX; break; |
| 222 | case 4: op->basereg = R_ESP; break; |
| 223 | case 6: op->basereg = R_ESI; break; |
| 224 | case 7: op->basereg = R_EDI; break; |
| 225 | case 5: |
| 226 | if (mod == 0) { |
| 227 | mod = 2; |
| 228 | op->basereg = -1; |
| 229 | } else |
| 230 | op->basereg = R_EBP; |
| 231 | break; |
| 232 | } |
| 233 | } |
| 234 | switch (mod) { |
| 235 | case 0: |
| 236 | op->segment |= SEG_NODISP; |
| 237 | break; |
| 238 | case 1: |
| 239 | op->segment |= SEG_DISP8; |
| 240 | op->offset = (signed char) *data++; |
| 241 | break; |
| 242 | case 2: |
| 243 | op->segment |= SEG_DISP32; |
| 244 | op->offset = *data++; |
| 245 | op->offset |= (*data++) << 8; |
| 246 | op->offset |= ((long) *data++) << 16; |
| 247 | op->offset |= ((long) *data++) << 24; |
| 248 | break; |
| 249 | } |
| 250 | return data; |
| 251 | } |
| 252 | } |
| 253 | |
| 254 | /* |
| 255 | * Determine whether the code string in r corresponds to the data |
| 256 | * stream in data. Return the number of bytes matched if so. |
| 257 | */ |
| 258 | static int matches (unsigned char *r, unsigned char *data, int asize, |
H. Peter Anvin | eba20a7 | 2002-04-30 20:53:55 +0000 | [diff] [blame] | 259 | int osize, int segsize, insn *ins) |
| 260 | { |
| 261 | unsigned char * origdata = data; |
| 262 | int a_used = FALSE, o_used = FALSE; |
H. Peter Anvin | ea6e34d | 2002-04-30 20:51:32 +0000 | [diff] [blame] | 263 | |
H. Peter Anvin | eba20a7 | 2002-04-30 20:53:55 +0000 | [diff] [blame] | 264 | while (*r) |
| 265 | { |
H. Peter Anvin | ea6e34d | 2002-04-30 20:51:32 +0000 | [diff] [blame] | 266 | int c = *r++; |
| 267 | if (c >= 01 && c <= 03) { |
| 268 | while (c--) |
| 269 | if (*r++ != *data++) |
| 270 | return FALSE; |
| 271 | } |
| 272 | if (c == 04) { |
| 273 | switch (*data++) { |
| 274 | case 0x07: ins->oprs[0].basereg = 0; break; |
| 275 | case 0x17: ins->oprs[0].basereg = 2; break; |
| 276 | case 0x1F: ins->oprs[0].basereg = 3; break; |
| 277 | default: return FALSE; |
| 278 | } |
| 279 | } |
| 280 | if (c == 05) { |
| 281 | switch (*data++) { |
| 282 | case 0xA1: ins->oprs[0].basereg = 4; break; |
| 283 | case 0xA9: ins->oprs[0].basereg = 5; break; |
| 284 | default: return FALSE; |
| 285 | } |
| 286 | } |
| 287 | if (c == 06) { |
| 288 | switch (*data++) { |
| 289 | case 0x06: ins->oprs[0].basereg = 0; break; |
| 290 | case 0x0E: ins->oprs[0].basereg = 1; break; |
| 291 | case 0x16: ins->oprs[0].basereg = 2; break; |
| 292 | case 0x1E: ins->oprs[0].basereg = 3; break; |
| 293 | default: return FALSE; |
| 294 | } |
| 295 | } |
| 296 | if (c == 07) { |
| 297 | switch (*data++) { |
| 298 | case 0xA0: ins->oprs[0].basereg = 4; break; |
| 299 | case 0xA8: ins->oprs[0].basereg = 5; break; |
| 300 | default: return FALSE; |
| 301 | } |
| 302 | } |
| 303 | if (c >= 010 && c <= 012) { |
| 304 | int t = *r++, d = *data++; |
| 305 | if (d < t || d > t+7) |
| 306 | return FALSE; |
| 307 | else { |
| 308 | ins->oprs[c-010].basereg = d-t; |
| 309 | ins->oprs[c-010].segment |= SEG_RMREG; |
| 310 | } |
| 311 | } |
| 312 | if (c == 017) |
| 313 | if (*data++) |
| 314 | return FALSE; |
| 315 | if (c >= 014 && c <= 016) { |
| 316 | ins->oprs[c-014].offset = (signed char) *data++; |
| 317 | ins->oprs[c-014].segment |= SEG_SIGNED; |
| 318 | } |
| 319 | if (c >= 020 && c <= 022) |
| 320 | ins->oprs[c-020].offset = *data++; |
| 321 | if (c >= 024 && c <= 026) |
| 322 | ins->oprs[c-024].offset = *data++; |
| 323 | if (c >= 030 && c <= 032) { |
| 324 | ins->oprs[c-030].offset = *data++; |
| 325 | ins->oprs[c-030].offset |= (*data++ << 8); |
| 326 | } |
| 327 | if (c >= 034 && c <= 036) { |
| 328 | ins->oprs[c-034].offset = *data++; |
| 329 | ins->oprs[c-034].offset |= (*data++ << 8); |
| 330 | if (asize == 32) { |
| 331 | ins->oprs[c-034].offset |= (((long) *data++) << 16); |
| 332 | ins->oprs[c-034].offset |= (((long) *data++) << 24); |
| 333 | } |
| 334 | if (segsize != asize) |
| 335 | ins->oprs[c-034].addr_size = asize; |
| 336 | } |
| 337 | if (c >= 040 && c <= 042) { |
| 338 | ins->oprs[c-040].offset = *data++; |
| 339 | ins->oprs[c-040].offset |= (*data++ << 8); |
| 340 | ins->oprs[c-040].offset |= (((long) *data++) << 16); |
| 341 | ins->oprs[c-040].offset |= (((long) *data++) << 24); |
| 342 | } |
| 343 | if (c >= 050 && c <= 052) { |
| 344 | ins->oprs[c-050].offset = (signed char) *data++; |
| 345 | ins->oprs[c-050].segment |= SEG_RELATIVE; |
| 346 | } |
| 347 | if (c >= 060 && c <= 062) { |
| 348 | ins->oprs[c-060].offset = *data++; |
| 349 | ins->oprs[c-060].offset |= (*data++ << 8); |
| 350 | ins->oprs[c-060].segment |= SEG_RELATIVE; |
| 351 | ins->oprs[c-060].segment &= ~SEG_32BIT; |
| 352 | } |
| 353 | if (c >= 064 && c <= 066) { |
| 354 | ins->oprs[c-064].offset = *data++; |
| 355 | ins->oprs[c-064].offset |= (*data++ << 8); |
| 356 | if (asize == 32) { |
| 357 | ins->oprs[c-064].offset |= (((long) *data++) << 16); |
| 358 | ins->oprs[c-064].offset |= (((long) *data++) << 24); |
| 359 | ins->oprs[c-064].segment |= SEG_32BIT; |
| 360 | } else |
| 361 | ins->oprs[c-064].segment &= ~SEG_32BIT; |
| 362 | ins->oprs[c-064].segment |= SEG_RELATIVE; |
| 363 | if (segsize != asize) |
| 364 | ins->oprs[c-064].addr_size = asize; |
| 365 | } |
| 366 | if (c >= 070 && c <= 072) { |
| 367 | ins->oprs[c-070].offset = *data++; |
| 368 | ins->oprs[c-070].offset |= (*data++ << 8); |
| 369 | ins->oprs[c-070].offset |= (((long) *data++) << 16); |
| 370 | ins->oprs[c-070].offset |= (((long) *data++) << 24); |
| 371 | ins->oprs[c-070].segment |= SEG_32BIT | SEG_RELATIVE; |
| 372 | } |
| 373 | if (c >= 0100 && c <= 0177) { |
| 374 | int modrm = *data++; |
| 375 | ins->oprs[c & 07].basereg = (modrm >> 3) & 07; |
| 376 | ins->oprs[c & 07].segment |= SEG_RMREG; |
| 377 | data = do_ea (data, modrm, asize, segsize, |
| 378 | &ins->oprs[(c >> 3) & 07]); |
| 379 | } |
| 380 | if (c >= 0200 && c <= 0277) { |
| 381 | int modrm = *data++; |
| 382 | if (((modrm >> 3) & 07) != (c & 07)) |
| 383 | return FALSE; /* spare field doesn't match up */ |
| 384 | data = do_ea (data, modrm, asize, segsize, |
| 385 | &ins->oprs[(c >> 3) & 07]); |
| 386 | } |
| 387 | if (c >= 0300 && c <= 0302) { |
| 388 | if (asize) |
| 389 | ins->oprs[c-0300].segment |= SEG_32BIT; |
| 390 | else |
| 391 | ins->oprs[c-0300].segment &= ~SEG_32BIT; |
| 392 | a_used = TRUE; |
| 393 | } |
| 394 | if (c == 0310) { |
| 395 | if (asize == 32) |
| 396 | return FALSE; |
| 397 | else |
| 398 | a_used = TRUE; |
| 399 | } |
| 400 | if (c == 0311) { |
| 401 | if (asize == 16) |
| 402 | return FALSE; |
| 403 | else |
| 404 | a_used = TRUE; |
| 405 | } |
| 406 | if (c == 0312) { |
| 407 | if (asize != segsize) |
| 408 | return FALSE; |
| 409 | else |
| 410 | a_used = TRUE; |
| 411 | } |
| 412 | if (c == 0320) { |
| 413 | if (osize == 32) |
| 414 | return FALSE; |
| 415 | else |
| 416 | o_used = TRUE; |
| 417 | } |
| 418 | if (c == 0321) { |
| 419 | if (osize == 16) |
| 420 | return FALSE; |
| 421 | else |
| 422 | o_used = TRUE; |
| 423 | } |
| 424 | if (c == 0322) { |
| 425 | if (osize != segsize) |
| 426 | return FALSE; |
| 427 | else |
| 428 | o_used = TRUE; |
| 429 | } |
| 430 | if (c == 0330) { |
| 431 | int t = *r++, d = *data++; |
| 432 | if (d < t || d > t+15) |
| 433 | return FALSE; |
| 434 | else |
| 435 | ins->condition = d - t; |
| 436 | } |
| 437 | } |
| 438 | |
| 439 | /* |
| 440 | * Check for unused a/o prefixes. |
| 441 | */ |
| 442 | ins->nprefix = 0; |
| 443 | if (!a_used && asize != segsize) |
| 444 | ins->prefixes[ins->nprefix++] = (asize == 16 ? P_A16 : P_A32); |
| 445 | if (!o_used && osize != segsize) |
| 446 | ins->prefixes[ins->nprefix++] = (osize == 16 ? P_O16 : P_O32); |
| 447 | |
| 448 | return data - origdata; |
| 449 | } |
| 450 | |
| 451 | long disasm (unsigned char *data, char *output, int segsize, long offset, |
H. Peter Anvin | 4836e33 | 2002-04-30 20:56:43 +0000 | [diff] [blame^] | 452 | int autosync, unsigned long prefer) |
H. Peter Anvin | eba20a7 | 2002-04-30 20:53:55 +0000 | [diff] [blame] | 453 | { |
H. Peter Anvin | 4836e33 | 2002-04-30 20:56:43 +0000 | [diff] [blame^] | 454 | struct itemplate **p, **best_p; |
| 455 | int length, best_length = 0; |
H. Peter Anvin | ea6e34d | 2002-04-30 20:51:32 +0000 | [diff] [blame] | 456 | char *segover; |
| 457 | int rep, lock, asize, osize, i, slen, colon; |
| 458 | unsigned char *origdata; |
| 459 | int works; |
| 460 | insn ins; |
H. Peter Anvin | 4836e33 | 2002-04-30 20:56:43 +0000 | [diff] [blame^] | 461 | unsigned long goodness, best; |
H. Peter Anvin | ea6e34d | 2002-04-30 20:51:32 +0000 | [diff] [blame] | 462 | |
| 463 | /* |
| 464 | * Scan for prefixes. |
| 465 | */ |
| 466 | asize = osize = segsize; |
| 467 | segover = NULL; |
| 468 | rep = lock = 0; |
| 469 | origdata = data; |
| 470 | for (;;) { |
| 471 | if (*data == 0xF3 || *data == 0xF2) |
| 472 | rep = *data++; |
| 473 | else if (*data == 0xF0) |
| 474 | lock = *data++; |
| 475 | else if (*data == 0x2E || *data == 0x36 || *data == 0x3E || |
| 476 | *data == 0x26 || *data == 0x64 || *data == 0x65) { |
| 477 | switch (*data++) { |
| 478 | case 0x2E: segover = "cs"; break; |
| 479 | case 0x36: segover = "ss"; break; |
| 480 | case 0x3E: segover = "ds"; break; |
| 481 | case 0x26: segover = "es"; break; |
| 482 | case 0x64: segover = "fs"; break; |
| 483 | case 0x65: segover = "gs"; break; |
| 484 | } |
| 485 | } else if (*data == 0x66) |
| 486 | osize = 48 - segsize, data++; |
| 487 | else if (*data == 0x67) |
| 488 | asize = 48 - segsize, data++; |
| 489 | else |
| 490 | break; |
| 491 | } |
| 492 | |
| 493 | ins.oprs[0].segment = ins.oprs[1].segment = ins.oprs[2].segment = |
| 494 | ins.oprs[0].addr_size = ins.oprs[1].addr_size = ins.oprs[2].addr_size = |
| 495 | (segsize == 16 ? 0 : SEG_32BIT); |
| 496 | ins.condition = -1; |
H. Peter Anvin | 4836e33 | 2002-04-30 20:56:43 +0000 | [diff] [blame^] | 497 | best = ~0UL; /* Worst possible */ |
| 498 | best_p = NULL; |
| 499 | for (p = itable[*data]; *p; p++) { |
| 500 | if ( (length = matches((unsigned char *)((*p)->code), data, |
| 501 | asize, osize, segsize, &ins)) ) { |
| 502 | works = TRUE; |
| 503 | /* |
| 504 | * Final check to make sure the types of r/m match up. |
| 505 | */ |
| 506 | for (i = 0; i < (*p)->operands; i++) { |
| 507 | if ( |
| 508 | |
| 509 | /* If it's a mem-only EA but we have a register, die. */ |
| 510 | ((ins.oprs[i].segment & SEG_RMREG) && |
| 511 | !(MEMORY & ~(*p)->opd[i])) || |
| 512 | |
| 513 | /* If it's a reg-only EA but we have a memory ref, die. */ |
| 514 | (!(ins.oprs[i].segment & SEG_RMREG) && |
| 515 | !(REGNORM & ~(*p)->opd[i]) && |
| 516 | !((*p)->opd[i] & REG_SMASK)) || |
| 517 | |
| 518 | /* Register type mismatch (eg FS vs REG_DESS): die. */ |
| 519 | ((((*p)->opd[i] & (REGISTER | FPUREG)) || |
| 520 | (ins.oprs[i].segment & SEG_RMREG)) && |
| 521 | !whichreg ((*p)->opd[i], ins.oprs[i].basereg))) { |
| 522 | works = FALSE; |
| 523 | break; |
| 524 | } |
| 525 | } |
| 526 | |
| 527 | if (works) { |
| 528 | goodness = ((*p)->flags & IF_PFMASK) ^ prefer; |
| 529 | if ( goodness < best ) { |
| 530 | /* This is the best one found so far */ |
| 531 | best = goodness; |
| 532 | best_p = p; |
| 533 | best_length = length; |
| 534 | } |
H. Peter Anvin | ea6e34d | 2002-04-30 20:51:32 +0000 | [diff] [blame] | 535 | } |
H. Peter Anvin | 4836e33 | 2002-04-30 20:56:43 +0000 | [diff] [blame^] | 536 | } |
| 537 | } |
H. Peter Anvin | eba20a7 | 2002-04-30 20:53:55 +0000 | [diff] [blame] | 538 | |
H. Peter Anvin | 4836e33 | 2002-04-30 20:56:43 +0000 | [diff] [blame^] | 539 | if (!best_p ) |
H. Peter Anvin | ea6e34d | 2002-04-30 20:51:32 +0000 | [diff] [blame] | 540 | return 0; /* no instruction was matched */ |
| 541 | |
H. Peter Anvin | 4836e33 | 2002-04-30 20:56:43 +0000 | [diff] [blame^] | 542 | /* Pick the best match */ |
| 543 | p = best_p; |
| 544 | length = best_length; |
| 545 | |
H. Peter Anvin | ea6e34d | 2002-04-30 20:51:32 +0000 | [diff] [blame] | 546 | slen = 0; |
| 547 | |
| 548 | if (rep) { |
| 549 | slen += sprintf(output+slen, "rep%s ", |
| 550 | (rep == 0xF2 ? "ne" : |
| 551 | (*p)->opcode == I_CMPSB || |
| 552 | (*p)->opcode == I_CMPSW || |
| 553 | (*p)->opcode == I_CMPSD || |
| 554 | (*p)->opcode == I_SCASB || |
| 555 | (*p)->opcode == I_SCASW || |
| 556 | (*p)->opcode == I_SCASD ? "e" : "")); |
| 557 | } |
| 558 | if (lock) |
| 559 | slen += sprintf(output+slen, "lock "); |
| 560 | for (i = 0; i < ins.nprefix; i++) |
| 561 | switch (ins.prefixes[i]) { |
| 562 | case P_A16: slen += sprintf(output+slen, "a16 "); break; |
| 563 | case P_A32: slen += sprintf(output+slen, "a32 "); break; |
| 564 | case P_O16: slen += sprintf(output+slen, "o16 "); break; |
| 565 | case P_O32: slen += sprintf(output+slen, "o32 "); break; |
| 566 | } |
| 567 | |
| 568 | for (i = 0; i < elements(ico); i++) |
| 569 | if ((*p)->opcode == ico[i]) { |
| 570 | slen += sprintf(output+slen, "%s%s", icn[i], |
| 571 | whichcond(ins.condition)); |
| 572 | break; |
| 573 | } |
| 574 | if (i >= elements(ico)) |
| 575 | slen += sprintf(output+slen, "%s", insn_names[(*p)->opcode]); |
| 576 | colon = FALSE; |
| 577 | length += data - origdata; /* fix up for prefixes */ |
| 578 | for (i=0; i<(*p)->operands; i++) { |
| 579 | output[slen++] = (colon ? ':' : i==0 ? ' ' : ','); |
| 580 | |
| 581 | if (ins.oprs[i].segment & SEG_RELATIVE) { |
| 582 | ins.oprs[i].offset += offset + length; |
| 583 | /* |
| 584 | * sort out wraparound |
| 585 | */ |
| 586 | if (!(ins.oprs[i].segment & SEG_32BIT)) |
| 587 | ins.oprs[i].offset &= 0xFFFF; |
| 588 | /* |
| 589 | * add sync marker, if autosync is on |
| 590 | */ |
| 591 | if (autosync) |
| 592 | add_sync (ins.oprs[i].offset, 0L); |
| 593 | } |
| 594 | |
| 595 | if ((*p)->opd[i] & COLON) |
| 596 | colon = TRUE; |
| 597 | else |
| 598 | colon = FALSE; |
| 599 | |
| 600 | if (((*p)->opd[i] & (REGISTER | FPUREG)) || |
H. Peter Anvin | eba20a7 | 2002-04-30 20:53:55 +0000 | [diff] [blame] | 601 | (ins.oprs[i].segment & SEG_RMREG)) |
| 602 | { |
H. Peter Anvin | ea6e34d | 2002-04-30 20:51:32 +0000 | [diff] [blame] | 603 | ins.oprs[i].basereg = whichreg ((*p)->opd[i], |
| 604 | ins.oprs[i].basereg); |
H. Peter Anvin | eba20a7 | 2002-04-30 20:53:55 +0000 | [diff] [blame] | 605 | if ( (*p)->opd[i] & TO ) |
| 606 | slen += sprintf(output+slen, "to "); |
H. Peter Anvin | ea6e34d | 2002-04-30 20:51:32 +0000 | [diff] [blame] | 607 | slen += sprintf(output+slen, "%s", |
H. Peter Anvin | 76690a1 | 2002-04-30 20:52:49 +0000 | [diff] [blame] | 608 | reg_names[ins.oprs[i].basereg-EXPR_REG_START]); |
H. Peter Anvin | ea6e34d | 2002-04-30 20:51:32 +0000 | [diff] [blame] | 609 | } else if (!(UNITY & ~(*p)->opd[i])) { |
| 610 | output[slen++] = '1'; |
| 611 | } else if ( (*p)->opd[i] & IMMEDIATE ) { |
| 612 | if ( (*p)->opd[i] & BITS8 ) { |
| 613 | slen += sprintf(output+slen, "byte "); |
| 614 | if (ins.oprs[i].segment & SEG_SIGNED) { |
| 615 | if (ins.oprs[i].offset < 0) { |
| 616 | ins.oprs[i].offset *= -1; |
| 617 | output[slen++] = '-'; |
| 618 | } else |
| 619 | output[slen++] = '+'; |
| 620 | } |
| 621 | } else if ( (*p)->opd[i] & BITS16 ) { |
| 622 | slen += sprintf(output+slen, "word "); |
| 623 | } else if ( (*p)->opd[i] & BITS32 ) { |
| 624 | slen += sprintf(output+slen, "dword "); |
| 625 | } else if ( (*p)->opd[i] & NEAR ) { |
| 626 | slen += sprintf(output+slen, "near "); |
| 627 | } else if ( (*p)->opd[i] & SHORT ) { |
| 628 | slen += sprintf(output+slen, "short "); |
| 629 | } |
| 630 | slen += sprintf(output+slen, "0x%lx", ins.oprs[i].offset); |
| 631 | } else if ( !(MEM_OFFS & ~(*p)->opd[i]) ) { |
| 632 | slen += sprintf(output+slen, "[%s%s%s0x%lx]", |
| 633 | (segover ? segover : ""), |
| 634 | (segover ? ":" : ""), |
| 635 | (ins.oprs[i].addr_size == 32 ? "dword " : |
| 636 | ins.oprs[i].addr_size == 16 ? "word " : ""), |
| 637 | ins.oprs[i].offset); |
| 638 | segover = NULL; |
| 639 | } else if ( !(REGMEM & ~(*p)->opd[i]) ) { |
| 640 | int started = FALSE; |
| 641 | if ( (*p)->opd[i] & BITS8 ) |
| 642 | slen += sprintf(output+slen, "byte "); |
| 643 | if ( (*p)->opd[i] & BITS16 ) |
| 644 | slen += sprintf(output+slen, "word "); |
| 645 | if ( (*p)->opd[i] & BITS32 ) |
| 646 | slen += sprintf(output+slen, "dword "); |
| 647 | if ( (*p)->opd[i] & BITS64 ) |
| 648 | slen += sprintf(output+slen, "qword "); |
| 649 | if ( (*p)->opd[i] & BITS80 ) |
| 650 | slen += sprintf(output+slen, "tword "); |
| 651 | if ( (*p)->opd[i] & FAR ) |
| 652 | slen += sprintf(output+slen, "far "); |
| 653 | if ( (*p)->opd[i] & NEAR ) |
| 654 | slen += sprintf(output+slen, "near "); |
| 655 | output[slen++] = '['; |
| 656 | if (ins.oprs[i].addr_size) |
| 657 | slen += sprintf(output+slen, "%s", |
| 658 | (ins.oprs[i].addr_size == 32 ? "dword " : |
| 659 | ins.oprs[i].addr_size == 16 ? "word " : "")); |
| 660 | if (segover) { |
| 661 | slen += sprintf(output+slen, "%s:", segover); |
| 662 | segover = NULL; |
| 663 | } |
| 664 | if (ins.oprs[i].basereg != -1) { |
| 665 | slen += sprintf(output+slen, "%s", |
H. Peter Anvin | 76690a1 | 2002-04-30 20:52:49 +0000 | [diff] [blame] | 666 | reg_names[(ins.oprs[i].basereg - |
| 667 | EXPR_REG_START)]); |
H. Peter Anvin | ea6e34d | 2002-04-30 20:51:32 +0000 | [diff] [blame] | 668 | started = TRUE; |
| 669 | } |
| 670 | if (ins.oprs[i].indexreg != -1) { |
| 671 | if (started) |
| 672 | output[slen++] = '+'; |
| 673 | slen += sprintf(output+slen, "%s", |
H. Peter Anvin | 76690a1 | 2002-04-30 20:52:49 +0000 | [diff] [blame] | 674 | reg_names[(ins.oprs[i].indexreg - |
| 675 | EXPR_REG_START)]); |
H. Peter Anvin | ea6e34d | 2002-04-30 20:51:32 +0000 | [diff] [blame] | 676 | if (ins.oprs[i].scale > 1) |
| 677 | slen += sprintf(output+slen, "*%d", ins.oprs[i].scale); |
| 678 | started = TRUE; |
| 679 | } |
| 680 | if (ins.oprs[i].segment & SEG_DISP8) { |
| 681 | int sign = '+'; |
| 682 | if (ins.oprs[i].offset & 0x80) { |
| 683 | ins.oprs[i].offset = - (signed char) ins.oprs[i].offset; |
| 684 | sign = '-'; |
| 685 | } |
| 686 | slen += sprintf(output+slen, "%c0x%lx", sign, |
| 687 | ins.oprs[i].offset); |
| 688 | } else if (ins.oprs[i].segment & SEG_DISP16) { |
| 689 | if (started) |
| 690 | output[slen++] = '+'; |
| 691 | slen += sprintf(output+slen, "0x%lx", ins.oprs[i].offset); |
| 692 | } else if (ins.oprs[i].segment & SEG_DISP32) { |
| 693 | if (started) |
| 694 | output[slen++] = '+'; |
| 695 | slen += sprintf(output+slen, "0x%lx", ins.oprs[i].offset); |
| 696 | } |
| 697 | output[slen++] = ']'; |
| 698 | } else { |
| 699 | slen += sprintf(output+slen, "<operand%d>", i); |
| 700 | } |
| 701 | } |
| 702 | output[slen] = '\0'; |
| 703 | if (segover) { /* unused segment override */ |
| 704 | char *p = output; |
| 705 | int count = slen+1; |
| 706 | while (count--) |
| 707 | p[count+3] = p[count]; |
| 708 | strncpy (output, segover, 2); |
| 709 | output[2] = ' '; |
| 710 | } |
| 711 | return length; |
| 712 | } |
| 713 | |
H. Peter Anvin | eba20a7 | 2002-04-30 20:53:55 +0000 | [diff] [blame] | 714 | long eatbyte (unsigned char *data, char *output) |
| 715 | { |
H. Peter Anvin | ea6e34d | 2002-04-30 20:51:32 +0000 | [diff] [blame] | 716 | sprintf(output, "db 0x%02X", *data); |
| 717 | return 1; |
| 718 | } |