disasm.c 53 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766
  1. /* ----------------------------------------------------------------------- *
  2. *
  3. * Copyright 1996-2012 The NASM Authors - All Rights Reserved
  4. * See the file AUTHORS included with the NASM distribution for
  5. * the specific copyright holders.
  6. *
  7. * Redistribution and use in source and binary forms, with or without
  8. * modification, are permitted provided that the following
  9. * conditions are met:
  10. *
  11. * * Redistributions of source code must retain the above copyright
  12. * notice, this list of conditions and the following disclaimer.
  13. * * Redistributions in binary form must reproduce the above
  14. * copyright notice, this list of conditions and the following
  15. * disclaimer in the documentation and/or other materials provided
  16. * with the distribution.
  17. *
  18. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
  19. * CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
  20. * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
  21. * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
  22. * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
  23. * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
  24. * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
  25. * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
  26. * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  27. * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
  28. * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
  29. * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
  30. * EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  31. *
  32. * ----------------------------------------------------------------------- */
  33. /*
  34. * disasm.c where all the _work_ gets done in the Netwide Disassembler
  35. */
  36. #include "compiler.h"
  37. #include <stdio.h>
  38. #include <string.h>
  39. #include <limits.h>
  40. #include "nasm.h"
  41. #include "disasm.h"
  42. #include "sync.h"
  43. #include "insns.h"
  44. #include "tables.h"
  45. #include "regdis.h"
  46. #include "disp8.h"
  47. #define fetch_safe(_start, _ptr, _size, _need, _op) \
  48. do { \
  49. if (((_ptr) - (_start)) >= ((_size) - (_need))) \
  50. _op; \
  51. } while (0)
  52. #define fetch_or_return(_start, _ptr, _size, _need) \
  53. fetch_safe(_start, _ptr, _size, _need, return 0)
  54. /*
  55. * Flags that go into the `segment' field of `insn' structures
  56. * during disassembly.
  57. */
  58. #define SEG_RELATIVE 1
  59. #define SEG_32BIT 2
  60. #define SEG_RMREG 4
  61. #define SEG_DISP8 8
  62. #define SEG_DISP16 16
  63. #define SEG_DISP32 32
  64. #define SEG_NODISP 64
  65. #define SEG_SIGNED 128
  66. #define SEG_64BIT 256
  67. /*
  68. * Prefix information
  69. */
  70. struct prefix_info {
  71. uint8_t osize; /* Operand size */
  72. uint8_t asize; /* Address size */
  73. uint8_t osp; /* Operand size prefix present */
  74. uint8_t asp; /* Address size prefix present */
  75. uint8_t rep; /* Rep prefix present */
  76. uint8_t seg; /* Segment override prefix present */
  77. uint8_t wait; /* WAIT "prefix" present */
  78. uint8_t lock; /* Lock prefix present */
  79. uint8_t vex[3]; /* VEX prefix present */
  80. uint8_t vex_c; /* VEX "class" (VEX, XOP, ...) */
  81. uint8_t vex_m; /* VEX.M field */
  82. uint8_t vex_v;
  83. uint8_t vex_lp; /* VEX.LP fields */
  84. uint32_t rex; /* REX prefix present */
  85. uint8_t evex[3]; /* EVEX prefix present */
  86. };
  87. #define getu8(x) (*(uint8_t *)(x))
  88. #if X86_MEMORY
  89. /* Littleendian CPU which can handle unaligned references */
  90. #define getu16(x) (*(uint16_t *)(x))
  91. #define getu32(x) (*(uint32_t *)(x))
  92. #define getu64(x) (*(uint64_t *)(x))
  93. #else
  94. static uint16_t getu16(uint8_t *data)
  95. {
  96. return (uint16_t)data[0] + ((uint16_t)data[1] << 8);
  97. }
  98. static uint32_t getu32(uint8_t *data)
  99. {
  100. return (uint32_t)getu16(data) + ((uint32_t)getu16(data+2) << 16);
  101. }
  102. static uint64_t getu64(uint8_t *data)
  103. {
  104. return (uint64_t)getu32(data) + ((uint64_t)getu32(data+4) << 32);
  105. }
  106. #endif
  107. #define gets8(x) ((int8_t)getu8(x))
  108. #define gets16(x) ((int16_t)getu16(x))
  109. #define gets32(x) ((int32_t)getu32(x))
  110. #define gets64(x) ((int64_t)getu64(x))
  111. /* Important: regval must already have been adjusted for rex extensions */
  112. static enum reg_enum whichreg(opflags_t regflags, int regval, int rex)
  113. {
  114. size_t i;
  115. static const struct {
  116. opflags_t flags;
  117. enum reg_enum reg;
  118. } specific_registers[] = {
  119. {REG_AL, R_AL},
  120. {REG_AX, R_AX},
  121. {REG_EAX, R_EAX},
  122. {REG_RAX, R_RAX},
  123. {REG_DL, R_DL},
  124. {REG_DX, R_DX},
  125. {REG_EDX, R_EDX},
  126. {REG_RDX, R_RDX},
  127. {REG_CL, R_CL},
  128. {REG_CX, R_CX},
  129. {REG_ECX, R_ECX},
  130. {REG_RCX, R_RCX},
  131. {FPU0, R_ST0},
  132. {XMM0, R_XMM0},
  133. {YMM0, R_YMM0},
  134. {ZMM0, R_ZMM0},
  135. {REG_ES, R_ES},
  136. {REG_CS, R_CS},
  137. {REG_SS, R_SS},
  138. {REG_DS, R_DS},
  139. {REG_FS, R_FS},
  140. {REG_GS, R_GS},
  141. {OPMASK0, R_K0},
  142. };
  143. if (!(regflags & (REGISTER|REGMEM)))
  144. return 0; /* Registers not permissible?! */
  145. regflags |= REGISTER;
  146. for (i = 0; i < ARRAY_SIZE(specific_registers); i++)
  147. if (!(specific_registers[i].flags & ~regflags))
  148. return specific_registers[i].reg;
  149. /* All the entries below look up regval in an 16-entry array */
  150. if (regval < 0 || regval > (rex & REX_EV ? 31 : 15))
  151. return 0;
  152. #define GET_REGISTER(__array, __index) \
  153. ((size_t)(__index) < (size_t)ARRAY_SIZE(__array) ? __array[(__index)] : 0)
  154. if (!(REG8 & ~regflags)) {
  155. if (rex & (REX_P|REX_NH))
  156. return GET_REGISTER(nasm_rd_reg8_rex, regval);
  157. else
  158. return GET_REGISTER(nasm_rd_reg8, regval);
  159. }
  160. if (!(REG16 & ~regflags))
  161. return GET_REGISTER(nasm_rd_reg16, regval);
  162. if (!(REG32 & ~regflags))
  163. return GET_REGISTER(nasm_rd_reg32, regval);
  164. if (!(REG64 & ~regflags))
  165. return GET_REGISTER(nasm_rd_reg64, regval);
  166. if (!(REG_SREG & ~regflags))
  167. return GET_REGISTER(nasm_rd_sreg, regval & 7); /* Ignore REX */
  168. if (!(REG_CREG & ~regflags))
  169. return GET_REGISTER(nasm_rd_creg, regval);
  170. if (!(REG_DREG & ~regflags))
  171. return GET_REGISTER(nasm_rd_dreg, regval);
  172. if (!(REG_TREG & ~regflags)) {
  173. if (regval > 7)
  174. return 0; /* TR registers are ill-defined with rex */
  175. return GET_REGISTER(nasm_rd_treg, regval);
  176. }
  177. if (!(FPUREG & ~regflags))
  178. return GET_REGISTER(nasm_rd_fpureg, regval & 7); /* Ignore REX */
  179. if (!(MMXREG & ~regflags))
  180. return GET_REGISTER(nasm_rd_mmxreg, regval & 7); /* Ignore REX */
  181. if (!(XMMREG & ~regflags))
  182. return GET_REGISTER(nasm_rd_xmmreg, regval);
  183. if (!(YMMREG & ~regflags))
  184. return GET_REGISTER(nasm_rd_ymmreg, regval);
  185. if (!(ZMMREG & ~regflags))
  186. return GET_REGISTER(nasm_rd_zmmreg, regval);
  187. if (!(OPMASKREG & ~regflags))
  188. return GET_REGISTER(nasm_rd_opmaskreg, regval);
  189. if (!(BNDREG & ~regflags))
  190. return GET_REGISTER(nasm_rd_bndreg, regval);
  191. #undef GET_REGISTER
  192. return 0;
  193. }
  194. static uint32_t append_evex_reg_deco(char *buf, uint32_t num,
  195. decoflags_t deco, uint8_t *evex)
  196. {
  197. const char * const er_names[] = {"rn-sae", "rd-sae", "ru-sae", "rz-sae"};
  198. uint32_t num_chars = 0;
  199. if ((deco & MASK) && (evex[2] & EVEX_P2AAA)) {
  200. enum reg_enum opmasknum = nasm_rd_opmaskreg[evex[2] & EVEX_P2AAA];
  201. const char * regname = nasm_reg_names[opmasknum - EXPR_REG_START];
  202. num_chars += snprintf(buf + num_chars, num - num_chars,
  203. "{%s}", regname);
  204. if ((deco & Z) && (evex[2] & EVEX_P2Z)) {
  205. num_chars += snprintf(buf + num_chars, num - num_chars,
  206. "{z}");
  207. }
  208. }
  209. if (evex[2] & EVEX_P2B) {
  210. if (deco & ER) {
  211. uint8_t er_type = (evex[2] & EVEX_P2LL) >> 5;
  212. num_chars += snprintf(buf + num_chars, num - num_chars,
  213. ",{%s}", er_names[er_type]);
  214. } else if (deco & SAE) {
  215. num_chars += snprintf(buf + num_chars, num - num_chars,
  216. ",{sae}");
  217. }
  218. }
  219. return num_chars;
  220. }
  221. static uint32_t append_evex_mem_deco(char *buf, uint32_t num, opflags_t type,
  222. decoflags_t deco, uint8_t *evex)
  223. {
  224. uint32_t num_chars = 0;
  225. if ((evex[2] & EVEX_P2B) && (deco & BRDCAST_MASK)) {
  226. decoflags_t deco_brsize = deco & BRSIZE_MASK;
  227. opflags_t template_opsize = (deco_brsize == BR_BITS32 ? BITS32 : BITS64);
  228. uint8_t br_num = (type & SIZE_MASK) / BITS128 *
  229. BITS64 / template_opsize * 2;
  230. num_chars += snprintf(buf + num_chars, num - num_chars,
  231. "{1to%d}", br_num);
  232. }
  233. if ((deco & MASK) && (evex[2] & EVEX_P2AAA)) {
  234. enum reg_enum opmasknum = nasm_rd_opmaskreg[evex[2] & EVEX_P2AAA];
  235. const char * regname = nasm_reg_names[opmasknum - EXPR_REG_START];
  236. num_chars += snprintf(buf + num_chars, num - num_chars,
  237. "{%s}", regname);
  238. if ((deco & Z) && (evex[2] & EVEX_P2Z)) {
  239. num_chars += snprintf(buf + num_chars, num - num_chars,
  240. "{z}");
  241. }
  242. }
  243. return num_chars;
  244. }
  245. /*
  246. * Process an effective address (ModRM) specification.
  247. */
  248. static uint8_t *do_ea(uint8_t *data, int modrm, int asize,
  249. int segsize, enum ea_type type,
  250. operand *op, insn *ins)
  251. {
  252. int mod, rm, scale, index, base;
  253. int rex;
  254. uint8_t *evex;
  255. uint8_t sib = 0;
  256. bool is_evex = !!(ins->rex & REX_EV);
  257. mod = (modrm >> 6) & 03;
  258. rm = modrm & 07;
  259. if (mod != 3 && asize != 16 && rm == 4)
  260. sib = *data++;
  261. rex = ins->rex;
  262. evex = ins->evex_p;
  263. if (mod == 3) { /* pure register version */
  264. op->basereg = rm+(rex & REX_B ? 8 : 0);
  265. op->segment |= SEG_RMREG;
  266. if (is_evex && segsize == 64) {
  267. op->basereg += (evex[0] & EVEX_P0X ? 0 : 16);
  268. }
  269. return data;
  270. }
  271. op->disp_size = 0;
  272. op->eaflags = 0;
  273. if (asize == 16) {
  274. /*
  275. * <mod> specifies the displacement size (none, byte or
  276. * word), and <rm> specifies the register combination.
  277. * Exception: mod=0,rm=6 does not specify [BP] as one might
  278. * expect, but instead specifies [disp16].
  279. */
  280. if (type != EA_SCALAR)
  281. return NULL;
  282. op->indexreg = op->basereg = -1;
  283. op->scale = 1; /* always, in 16 bits */
  284. switch (rm) {
  285. case 0:
  286. op->basereg = R_BX;
  287. op->indexreg = R_SI;
  288. break;
  289. case 1:
  290. op->basereg = R_BX;
  291. op->indexreg = R_DI;
  292. break;
  293. case 2:
  294. op->basereg = R_BP;
  295. op->indexreg = R_SI;
  296. break;
  297. case 3:
  298. op->basereg = R_BP;
  299. op->indexreg = R_DI;
  300. break;
  301. case 4:
  302. op->basereg = R_SI;
  303. break;
  304. case 5:
  305. op->basereg = R_DI;
  306. break;
  307. case 6:
  308. op->basereg = R_BP;
  309. break;
  310. case 7:
  311. op->basereg = R_BX;
  312. break;
  313. }
  314. if (rm == 6 && mod == 0) { /* special case */
  315. op->basereg = -1;
  316. if (segsize != 16)
  317. op->disp_size = 16;
  318. mod = 2; /* fake disp16 */
  319. }
  320. switch (mod) {
  321. case 0:
  322. op->segment |= SEG_NODISP;
  323. break;
  324. case 1:
  325. op->segment |= SEG_DISP8;
  326. if (ins->evex_tuple != 0) {
  327. op->offset = gets8(data) * get_disp8N(ins);
  328. } else {
  329. op->offset = gets8(data);
  330. }
  331. data++;
  332. break;
  333. case 2:
  334. op->segment |= SEG_DISP16;
  335. op->offset = *data++;
  336. op->offset |= ((unsigned)*data++) << 8;
  337. break;
  338. }
  339. return data;
  340. } else {
  341. /*
  342. * Once again, <mod> specifies displacement size (this time
  343. * none, byte or *dword*), while <rm> specifies the base
  344. * register. Again, [EBP] is missing, replaced by a pure
  345. * disp32 (this time that's mod=0,rm=*5*) in 32-bit mode,
  346. * and RIP-relative addressing in 64-bit mode.
  347. *
  348. * However, rm=4
  349. * indicates not a single base register, but instead the
  350. * presence of a SIB byte...
  351. */
  352. int a64 = asize == 64;
  353. op->indexreg = -1;
  354. if (a64)
  355. op->basereg = nasm_rd_reg64[rm | ((rex & REX_B) ? 8 : 0)];
  356. else
  357. op->basereg = nasm_rd_reg32[rm | ((rex & REX_B) ? 8 : 0)];
  358. if (rm == 5 && mod == 0) {
  359. if (segsize == 64) {
  360. op->eaflags |= EAF_REL;
  361. op->segment |= SEG_RELATIVE;
  362. }
  363. if (asize != 64)
  364. op->disp_size = asize;
  365. op->basereg = -1;
  366. mod = 2; /* fake disp32 */
  367. }
  368. if (rm == 4) { /* process SIB */
  369. uint8_t vsib_hi = 0;
  370. scale = (sib >> 6) & 03;
  371. index = (sib >> 3) & 07;
  372. base = sib & 07;
  373. op->scale = 1 << scale;
  374. if (segsize == 64) {
  375. vsib_hi = (rex & REX_X ? 8 : 0) |
  376. (evex[2] & EVEX_P2VP ? 0 : 16);
  377. }
  378. if (type == EA_XMMVSIB)
  379. op->indexreg = nasm_rd_xmmreg[index | vsib_hi];
  380. else if (type == EA_YMMVSIB)
  381. op->indexreg = nasm_rd_ymmreg[index | vsib_hi];
  382. else if (type == EA_ZMMVSIB)
  383. op->indexreg = nasm_rd_zmmreg[index | vsib_hi];
  384. else if (index == 4 && !(rex & REX_X))
  385. op->indexreg = -1; /* ESP/RSP cannot be an index */
  386. else if (a64)
  387. op->indexreg = nasm_rd_reg64[index | ((rex & REX_X) ? 8 : 0)];
  388. else
  389. op->indexreg = nasm_rd_reg32[index | ((rex & REX_X) ? 8 : 0)];
  390. if (base == 5 && mod == 0) {
  391. op->basereg = -1;
  392. mod = 2; /* Fake disp32 */
  393. } else if (a64)
  394. op->basereg = nasm_rd_reg64[base | ((rex & REX_B) ? 8 : 0)];
  395. else
  396. op->basereg = nasm_rd_reg32[base | ((rex & REX_B) ? 8 : 0)];
  397. if (segsize == 16)
  398. op->disp_size = 32;
  399. } else if (type != EA_SCALAR) {
  400. /* Can't have VSIB without SIB */
  401. return NULL;
  402. }
  403. switch (mod) {
  404. case 0:
  405. op->segment |= SEG_NODISP;
  406. break;
  407. case 1:
  408. op->segment |= SEG_DISP8;
  409. if (ins->evex_tuple != 0) {
  410. op->offset = gets8(data) * get_disp8N(ins);
  411. } else {
  412. op->offset = gets8(data);
  413. }
  414. data++;
  415. break;
  416. case 2:
  417. op->segment |= SEG_DISP32;
  418. op->offset = gets32(data);
  419. data += 4;
  420. break;
  421. }
  422. return data;
  423. }
  424. }
  425. /*
  426. * Determine whether the instruction template in t corresponds to the data
  427. * stream in data. Return the number of bytes matched if so.
  428. */
  429. #define case4(x) case (x): case (x)+1: case (x)+2: case (x)+3
  430. static int matches(const struct itemplate *t, uint8_t *data,
  431. const struct prefix_info *prefix, int segsize, insn *ins)
  432. {
  433. uint8_t *r = (uint8_t *)(t->code);
  434. uint8_t *origdata = data;
  435. bool a_used = false, o_used = false;
  436. enum prefixes drep = 0;
  437. enum prefixes dwait = 0;
  438. uint8_t lock = prefix->lock;
  439. int osize = prefix->osize;
  440. int asize = prefix->asize;
  441. int i, c;
  442. int op1, op2;
  443. struct operand *opx, *opy;
  444. uint8_t opex = 0;
  445. bool vex_ok = false;
  446. int regmask = (segsize == 64) ? 15 : 7;
  447. enum ea_type eat = EA_SCALAR;
  448. for (i = 0; i < MAX_OPERANDS; i++) {
  449. ins->oprs[i].segment = ins->oprs[i].disp_size =
  450. (segsize == 64 ? SEG_64BIT : segsize == 32 ? SEG_32BIT : 0);
  451. }
  452. ins->condition = -1;
  453. ins->evex_tuple = 0;
  454. ins->rex = prefix->rex;
  455. memset(ins->prefixes, 0, sizeof ins->prefixes);
  456. if (itemp_has(t, (segsize == 64 ? IF_NOLONG : IF_LONG)))
  457. return 0;
  458. if (prefix->rep == 0xF2)
  459. drep = (itemp_has(t, IF_BND) ? P_BND : P_REPNE);
  460. else if (prefix->rep == 0xF3)
  461. drep = P_REP;
  462. dwait = prefix->wait ? P_WAIT : 0;
  463. while ((c = *r++) != 0) {
  464. op1 = (c & 3) + ((opex & 1) << 2);
  465. op2 = ((c >> 3) & 3) + ((opex & 2) << 1);
  466. opx = &ins->oprs[op1];
  467. opy = &ins->oprs[op2];
  468. opex = 0;
  469. switch (c) {
  470. case 01:
  471. case 02:
  472. case 03:
  473. case 04:
  474. while (c--)
  475. if (*r++ != *data++)
  476. return 0;
  477. break;
  478. case 05:
  479. case 06:
  480. case 07:
  481. opex = c;
  482. break;
  483. case4(010):
  484. {
  485. int t = *r++, d = *data++;
  486. if (d < t || d > t + 7)
  487. return 0;
  488. else {
  489. opx->basereg = (d-t)+
  490. (ins->rex & REX_B ? 8 : 0);
  491. opx->segment |= SEG_RMREG;
  492. }
  493. break;
  494. }
  495. case4(014):
  496. /* this is an separate index reg position of MIB operand (ICC) */
  497. /* Disassembler uses NASM's split EA form only */
  498. break;
  499. case4(0274):
  500. opx->offset = (int8_t)*data++;
  501. opx->segment |= SEG_SIGNED;
  502. break;
  503. case4(020):
  504. opx->offset = *data++;
  505. break;
  506. case4(024):
  507. opx->offset = *data++;
  508. break;
  509. case4(030):
  510. opx->offset = getu16(data);
  511. data += 2;
  512. break;
  513. case4(034):
  514. if (osize == 32) {
  515. opx->offset = getu32(data);
  516. data += 4;
  517. } else {
  518. opx->offset = getu16(data);
  519. data += 2;
  520. }
  521. if (segsize != asize)
  522. opx->disp_size = asize;
  523. break;
  524. case4(040):
  525. opx->offset = getu32(data);
  526. data += 4;
  527. break;
  528. case4(0254):
  529. opx->offset = gets32(data);
  530. data += 4;
  531. break;
  532. case4(044):
  533. switch (asize) {
  534. case 16:
  535. opx->offset = getu16(data);
  536. data += 2;
  537. if (segsize != 16)
  538. opx->disp_size = 16;
  539. break;
  540. case 32:
  541. opx->offset = getu32(data);
  542. data += 4;
  543. if (segsize == 16)
  544. opx->disp_size = 32;
  545. break;
  546. case 64:
  547. opx->offset = getu64(data);
  548. opx->disp_size = 64;
  549. data += 8;
  550. break;
  551. }
  552. break;
  553. case4(050):
  554. opx->offset = gets8(data++);
  555. opx->segment |= SEG_RELATIVE;
  556. break;
  557. case4(054):
  558. opx->offset = getu64(data);
  559. data += 8;
  560. break;
  561. case4(060):
  562. opx->offset = gets16(data);
  563. data += 2;
  564. opx->segment |= SEG_RELATIVE;
  565. opx->segment &= ~SEG_32BIT;
  566. break;
  567. case4(064): /* rel */
  568. opx->segment |= SEG_RELATIVE;
  569. /* In long mode rel is always 32 bits, sign extended. */
  570. if (segsize == 64 || osize == 32) {
  571. opx->offset = gets32(data);
  572. data += 4;
  573. if (segsize != 64)
  574. opx->segment |= SEG_32BIT;
  575. opx->type = (opx->type & ~SIZE_MASK)
  576. | (segsize == 64 ? BITS64 : BITS32);
  577. } else {
  578. opx->offset = gets16(data);
  579. data += 2;
  580. opx->segment &= ~SEG_32BIT;
  581. opx->type = (opx->type & ~SIZE_MASK) | BITS16;
  582. }
  583. break;
  584. case4(070):
  585. opx->offset = gets32(data);
  586. data += 4;
  587. opx->segment |= SEG_32BIT | SEG_RELATIVE;
  588. break;
  589. case4(0100):
  590. case4(0110):
  591. case4(0120):
  592. case4(0130):
  593. {
  594. int modrm = *data++;
  595. opx->segment |= SEG_RMREG;
  596. data = do_ea(data, modrm, asize, segsize, eat, opy, ins);
  597. if (!data)
  598. return 0;
  599. opx->basereg = ((modrm >> 3) & 7) + (ins->rex & REX_R ? 8 : 0);
  600. if ((ins->rex & REX_EV) && (segsize == 64))
  601. opx->basereg += (ins->evex_p[0] & EVEX_P0RP ? 0 : 16);
  602. break;
  603. }
  604. case 0172:
  605. {
  606. uint8_t ximm = *data++;
  607. c = *r++;
  608. ins->oprs[c >> 3].basereg = (ximm >> 4) & regmask;
  609. ins->oprs[c >> 3].segment |= SEG_RMREG;
  610. ins->oprs[c & 7].offset = ximm & 15;
  611. }
  612. break;
  613. case 0173:
  614. {
  615. uint8_t ximm = *data++;
  616. c = *r++;
  617. if ((c ^ ximm) & 15)
  618. return 0;
  619. ins->oprs[c >> 4].basereg = (ximm >> 4) & regmask;
  620. ins->oprs[c >> 4].segment |= SEG_RMREG;
  621. }
  622. break;
  623. case4(0174):
  624. {
  625. uint8_t ximm = *data++;
  626. opx->basereg = (ximm >> 4) & regmask;
  627. opx->segment |= SEG_RMREG;
  628. }
  629. break;
  630. case4(0200):
  631. case4(0204):
  632. case4(0210):
  633. case4(0214):
  634. case4(0220):
  635. case4(0224):
  636. case4(0230):
  637. case4(0234):
  638. {
  639. int modrm = *data++;
  640. if (((modrm >> 3) & 07) != (c & 07))
  641. return 0; /* spare field doesn't match up */
  642. data = do_ea(data, modrm, asize, segsize, eat, opy, ins);
  643. if (!data)
  644. return 0;
  645. break;
  646. }
  647. case4(0240):
  648. case 0250:
  649. {
  650. uint8_t evexm = *r++;
  651. uint8_t evexwlp = *r++;
  652. uint8_t modrm, valid_mask;
  653. ins->evex_tuple = *r++ - 0300;
  654. modrm = *(origdata + 1);
  655. ins->rex |= REX_EV;
  656. if ((prefix->rex & (REX_EV|REX_V|REX_P)) != REX_EV)
  657. return 0;
  658. if ((evexm & 0x1f) != prefix->vex_m)
  659. return 0;
  660. switch (evexwlp & 060) {
  661. case 000:
  662. if (prefix->rex & REX_W)
  663. return 0;
  664. break;
  665. case 020:
  666. if (!(prefix->rex & REX_W))
  667. return 0;
  668. ins->rex |= REX_W;
  669. break;
  670. case 040: /* VEX.W is a don't care */
  671. ins->rex &= ~REX_W;
  672. break;
  673. case 060:
  674. break;
  675. }
  676. /* If EVEX.b is set with reg-reg op,
  677. * EVEX.L'L contains embedded rounding control info
  678. */
  679. if ((prefix->evex[2] & EVEX_P2B) && ((modrm >> 6) == 3)) {
  680. valid_mask = 0x3; /* prefix only */
  681. } else {
  682. valid_mask = 0xf; /* vector length and prefix */
  683. }
  684. if ((evexwlp ^ prefix->vex_lp) & valid_mask)
  685. return 0;
  686. if (c == 0250) {
  687. if ((prefix->vex_v != 0) ||
  688. (!(prefix->evex[2] & EVEX_P2VP) &&
  689. ((eat < EA_XMMVSIB) || (eat > EA_ZMMVSIB))))
  690. return 0;
  691. } else {
  692. opx->segment |= SEG_RMREG;
  693. opx->basereg = ((~prefix->evex[2] & EVEX_P2VP) << (4 - 3) ) |
  694. prefix->vex_v;
  695. }
  696. vex_ok = true;
  697. memcpy(ins->evex_p, prefix->evex, 3);
  698. break;
  699. }
  700. case4(0260):
  701. case 0270:
  702. {
  703. int vexm = *r++;
  704. int vexwlp = *r++;
  705. ins->rex |= REX_V;
  706. if ((prefix->rex & (REX_V|REX_P)) != REX_V)
  707. return 0;
  708. if ((vexm & 0x1f) != prefix->vex_m)
  709. return 0;
  710. switch (vexwlp & 060) {
  711. case 000:
  712. if (prefix->rex & REX_W)
  713. return 0;
  714. break;
  715. case 020:
  716. if (!(prefix->rex & REX_W))
  717. return 0;
  718. ins->rex &= ~REX_W;
  719. break;
  720. case 040: /* VEX.W is a don't care */
  721. ins->rex &= ~REX_W;
  722. break;
  723. case 060:
  724. break;
  725. }
  726. /* The 010 bit of vexwlp is set if VEX.L is ignored */
  727. if ((vexwlp ^ prefix->vex_lp) & ((vexwlp & 010) ? 03 : 07))
  728. return 0;
  729. if (c == 0270) {
  730. if (prefix->vex_v != 0)
  731. return 0;
  732. } else {
  733. opx->segment |= SEG_RMREG;
  734. opx->basereg = prefix->vex_v;
  735. }
  736. vex_ok = true;
  737. break;
  738. }
  739. case 0271:
  740. if (prefix->rep == 0xF3)
  741. drep = P_XRELEASE;
  742. break;
  743. case 0272:
  744. if (prefix->rep == 0xF2)
  745. drep = P_XACQUIRE;
  746. else if (prefix->rep == 0xF3)
  747. drep = P_XRELEASE;
  748. break;
  749. case 0273:
  750. if (prefix->lock == 0xF0) {
  751. if (prefix->rep == 0xF2)
  752. drep = P_XACQUIRE;
  753. else if (prefix->rep == 0xF3)
  754. drep = P_XRELEASE;
  755. }
  756. break;
  757. case 0310:
  758. if (asize != 16)
  759. return 0;
  760. else
  761. a_used = true;
  762. break;
  763. case 0311:
  764. if (asize != 32)
  765. return 0;
  766. else
  767. a_used = true;
  768. break;
  769. case 0312:
  770. if (asize != segsize)
  771. return 0;
  772. else
  773. a_used = true;
  774. break;
  775. case 0313:
  776. if (asize != 64)
  777. return 0;
  778. else
  779. a_used = true;
  780. break;
  781. case 0314:
  782. if (prefix->rex & REX_B)
  783. return 0;
  784. break;
  785. case 0315:
  786. if (prefix->rex & REX_X)
  787. return 0;
  788. break;
  789. case 0316:
  790. if (prefix->rex & REX_R)
  791. return 0;
  792. break;
  793. case 0317:
  794. if (prefix->rex & REX_W)
  795. return 0;
  796. break;
  797. case 0320:
  798. if (osize != 16)
  799. return 0;
  800. else
  801. o_used = true;
  802. break;
  803. case 0321:
  804. if (osize != 32)
  805. return 0;
  806. else
  807. o_used = true;
  808. break;
  809. case 0322:
  810. if (osize != (segsize == 16 ? 16 : 32))
  811. return 0;
  812. else
  813. o_used = true;
  814. break;
  815. case 0323:
  816. ins->rex |= REX_W; /* 64-bit only instruction */
  817. osize = 64;
  818. o_used = true;
  819. break;
  820. case 0324:
  821. if (osize != 64)
  822. return 0;
  823. o_used = true;
  824. break;
  825. case 0325:
  826. ins->rex |= REX_NH;
  827. break;
  828. case 0330:
  829. {
  830. int t = *r++, d = *data++;
  831. if (d < t || d > t + 15)
  832. return 0;
  833. else
  834. ins->condition = d - t;
  835. break;
  836. }
  837. case 0326:
  838. if (prefix->rep == 0xF3)
  839. return 0;
  840. break;
  841. case 0331:
  842. if (prefix->rep)
  843. return 0;
  844. break;
  845. case 0332:
  846. if (prefix->rep != 0xF2)
  847. return 0;
  848. drep = 0;
  849. break;
  850. case 0333:
  851. if (prefix->rep != 0xF3)
  852. return 0;
  853. drep = 0;
  854. break;
  855. case 0334:
  856. if (lock) {
  857. ins->rex |= REX_R;
  858. lock = 0;
  859. }
  860. break;
  861. case 0335:
  862. if (drep == P_REP)
  863. drep = P_REPE;
  864. break;
  865. case 0336:
  866. case 0337:
  867. break;
  868. case 0340:
  869. return 0;
  870. case 0341:
  871. if (prefix->wait != 0x9B)
  872. return 0;
  873. dwait = 0;
  874. break;
  875. case 0360:
  876. if (prefix->osp || prefix->rep)
  877. return 0;
  878. break;
  879. case 0361:
  880. if (!prefix->osp || prefix->rep)
  881. return 0;
  882. o_used = true;
  883. break;
  884. case 0364:
  885. if (prefix->osp)
  886. return 0;
  887. break;
  888. case 0365:
  889. if (prefix->asp)
  890. return 0;
  891. break;
  892. case 0366:
  893. if (!prefix->osp)
  894. return 0;
  895. o_used = true;
  896. break;
  897. case 0367:
  898. if (!prefix->asp)
  899. return 0;
  900. a_used = true;
  901. break;
  902. case 0370:
  903. case 0371:
  904. break;
  905. case 0374:
  906. eat = EA_XMMVSIB;
  907. break;
  908. case 0375:
  909. eat = EA_YMMVSIB;
  910. break;
  911. case 0376:
  912. eat = EA_ZMMVSIB;
  913. break;
  914. default:
  915. return 0; /* Unknown code */
  916. }
  917. }
  918. if (!vex_ok && (ins->rex & (REX_V | REX_EV)))
  919. return 0;
  920. /* REX cannot be combined with VEX */
  921. if ((ins->rex & REX_V) && (prefix->rex & REX_P))
  922. return 0;
  923. /*
  924. * Check for unused rep or a/o prefixes.
  925. */
  926. for (i = 0; i < t->operands; i++) {
  927. if (ins->oprs[i].segment != SEG_RMREG)
  928. a_used = true;
  929. }
  930. if (lock) {
  931. if (ins->prefixes[PPS_LOCK])
  932. return 0;
  933. ins->prefixes[PPS_LOCK] = P_LOCK;
  934. }
  935. if (drep) {
  936. if (ins->prefixes[PPS_REP])
  937. return 0;
  938. ins->prefixes[PPS_REP] = drep;
  939. }
  940. ins->prefixes[PPS_WAIT] = dwait;
  941. if (!o_used) {
  942. if (osize != ((segsize == 16) ? 16 : 32)) {
  943. enum prefixes pfx = 0;
  944. switch (osize) {
  945. case 16:
  946. pfx = P_O16;
  947. break;
  948. case 32:
  949. pfx = P_O32;
  950. break;
  951. case 64:
  952. pfx = P_O64;
  953. break;
  954. }
  955. if (ins->prefixes[PPS_OSIZE])
  956. return 0;
  957. ins->prefixes[PPS_OSIZE] = pfx;
  958. }
  959. }
  960. if (!a_used && asize != segsize) {
  961. if (ins->prefixes[PPS_ASIZE])
  962. return 0;
  963. ins->prefixes[PPS_ASIZE] = asize == 16 ? P_A16 : P_A32;
  964. }
  965. /* Fix: check for redundant REX prefixes */
  966. return data - origdata;
  967. }
  968. /* Condition names for disassembly, sorted by x86 code */
  969. static const char * const condition_name[16] = {
  970. "o", "no", "c", "nc", "z", "nz", "na", "a",
  971. "s", "ns", "pe", "po", "l", "nl", "ng", "g"
  972. };
  973. int32_t disasm(uint8_t *data, int32_t data_size, char *output, int outbufsize, int segsize,
  974. int64_t offset, int autosync, iflag_t *prefer)
  975. {
  976. const struct itemplate * const *p, * const *best_p;
  977. const struct disasm_index *ix;
  978. uint8_t *dp;
  979. int length, best_length = 0;
  980. char *segover;
  981. int i, slen, colon, n;
  982. uint8_t *origdata;
  983. int works;
  984. insn tmp_ins, ins;
  985. iflag_t goodness, best;
  986. int best_pref;
  987. struct prefix_info prefix;
  988. bool end_prefix;
  989. bool is_evex;
  990. memset(&ins, 0, sizeof ins);
  991. /*
  992. * Scan for prefixes.
  993. */
  994. memset(&prefix, 0, sizeof prefix);
  995. prefix.asize = segsize;
  996. prefix.osize = (segsize == 64) ? 32 : segsize;
  997. segover = NULL;
  998. origdata = data;
  999. ix = itable;
  1000. end_prefix = false;
  1001. while (!end_prefix) {
  1002. switch (*data) {
  1003. case 0xF2:
  1004. case 0xF3:
  1005. fetch_or_return(origdata, data, data_size, 1);
  1006. prefix.rep = *data++;
  1007. break;
  1008. case 0x9B:
  1009. fetch_or_return(origdata, data, data_size, 1);
  1010. prefix.wait = *data++;
  1011. break;
  1012. case 0xF0:
  1013. fetch_or_return(origdata, data, data_size, 1);
  1014. prefix.lock = *data++;
  1015. break;
  1016. case 0x2E:
  1017. fetch_or_return(origdata, data, data_size, 1);
  1018. segover = "cs", prefix.seg = *data++;
  1019. break;
  1020. case 0x36:
  1021. fetch_or_return(origdata, data, data_size, 1);
  1022. segover = "ss", prefix.seg = *data++;
  1023. break;
  1024. case 0x3E:
  1025. fetch_or_return(origdata, data, data_size, 1);
  1026. segover = "ds", prefix.seg = *data++;
  1027. break;
  1028. case 0x26:
  1029. fetch_or_return(origdata, data, data_size, 1);
  1030. segover = "es", prefix.seg = *data++;
  1031. break;
  1032. case 0x64:
  1033. fetch_or_return(origdata, data, data_size, 1);
  1034. segover = "fs", prefix.seg = *data++;
  1035. break;
  1036. case 0x65:
  1037. fetch_or_return(origdata, data, data_size, 1);
  1038. segover = "gs", prefix.seg = *data++;
  1039. break;
  1040. case 0x66:
  1041. fetch_or_return(origdata, data, data_size, 1);
  1042. prefix.osize = (segsize == 16) ? 32 : 16;
  1043. prefix.osp = *data++;
  1044. break;
  1045. case 0x67:
  1046. fetch_or_return(origdata, data, data_size, 1);
  1047. prefix.asize = (segsize == 32) ? 16 : 32;
  1048. prefix.asp = *data++;
  1049. break;
  1050. case 0xC4:
  1051. case 0xC5:
  1052. if (segsize == 64 || (data[1] & 0xc0) == 0xc0) {
  1053. fetch_or_return(origdata, data, data_size, 2);
  1054. prefix.vex[0] = *data++;
  1055. prefix.vex[1] = *data++;
  1056. prefix.rex = REX_V;
  1057. prefix.vex_c = RV_VEX;
  1058. if (prefix.vex[0] == 0xc4) {
  1059. fetch_or_return(origdata, data, data_size, 1);
  1060. prefix.vex[2] = *data++;
  1061. prefix.rex |= (~prefix.vex[1] >> 5) & 7; /* REX_RXB */
  1062. prefix.rex |= (prefix.vex[2] >> (7-3)) & REX_W;
  1063. prefix.vex_m = prefix.vex[1] & 0x1f;
  1064. prefix.vex_v = (~prefix.vex[2] >> 3) & 15;
  1065. prefix.vex_lp = prefix.vex[2] & 7;
  1066. } else {
  1067. prefix.rex |= (~prefix.vex[1] >> (7-2)) & REX_R;
  1068. prefix.vex_m = 1;
  1069. prefix.vex_v = (~prefix.vex[1] >> 3) & 15;
  1070. prefix.vex_lp = prefix.vex[1] & 7;
  1071. }
  1072. ix = itable_vex[RV_VEX][prefix.vex_m][prefix.vex_lp & 3];
  1073. }
  1074. end_prefix = true;
  1075. break;
  1076. case 0x62:
  1077. {
  1078. if (segsize == 64 || ((data[1] & 0xc0) == 0xc0)) {
  1079. fetch_or_return(origdata, data, data_size, 4);
  1080. data++; /* 62h EVEX prefix */
  1081. prefix.evex[0] = *data++;
  1082. prefix.evex[1] = *data++;
  1083. prefix.evex[2] = *data++;
  1084. prefix.rex = REX_EV;
  1085. prefix.vex_c = RV_EVEX;
  1086. prefix.rex |= (~prefix.evex[0] >> 5) & 7; /* REX_RXB */
  1087. prefix.rex |= (prefix.evex[1] >> (7-3)) & REX_W;
  1088. prefix.vex_m = prefix.evex[0] & EVEX_P0MM;
  1089. prefix.vex_v = (~prefix.evex[1] & EVEX_P1VVVV) >> 3;
  1090. prefix.vex_lp = ((prefix.evex[2] & EVEX_P2LL) >> (5-2)) |
  1091. (prefix.evex[1] & EVEX_P1PP);
  1092. ix = itable_vex[prefix.vex_c][prefix.vex_m][prefix.vex_lp & 3];
  1093. }
  1094. end_prefix = true;
  1095. break;
  1096. }
  1097. case 0x8F:
  1098. if ((data[1] & 030) != 0 &&
  1099. (segsize == 64 || (data[1] & 0xc0) == 0xc0)) {
  1100. fetch_or_return(origdata, data, data_size, 3);
  1101. prefix.vex[0] = *data++;
  1102. prefix.vex[1] = *data++;
  1103. prefix.vex[2] = *data++;
  1104. prefix.rex = REX_V;
  1105. prefix.vex_c = RV_XOP;
  1106. prefix.rex |= (~prefix.vex[1] >> 5) & 7; /* REX_RXB */
  1107. prefix.rex |= (prefix.vex[2] >> (7-3)) & REX_W;
  1108. prefix.vex_m = prefix.vex[1] & 0x1f;
  1109. prefix.vex_v = (~prefix.vex[2] >> 3) & 15;
  1110. prefix.vex_lp = prefix.vex[2] & 7;
  1111. ix = itable_vex[RV_XOP][prefix.vex_m][prefix.vex_lp & 3];
  1112. }
  1113. end_prefix = true;
  1114. break;
  1115. case REX_P + 0x0:
  1116. case REX_P + 0x1:
  1117. case REX_P + 0x2:
  1118. case REX_P + 0x3:
  1119. case REX_P + 0x4:
  1120. case REX_P + 0x5:
  1121. case REX_P + 0x6:
  1122. case REX_P + 0x7:
  1123. case REX_P + 0x8:
  1124. case REX_P + 0x9:
  1125. case REX_P + 0xA:
  1126. case REX_P + 0xB:
  1127. case REX_P + 0xC:
  1128. case REX_P + 0xD:
  1129. case REX_P + 0xE:
  1130. case REX_P + 0xF:
  1131. if (segsize == 64) {
  1132. fetch_or_return(origdata, data, data_size, 1);
  1133. prefix.rex = *data++;
  1134. if (prefix.rex & REX_W)
  1135. prefix.osize = 64;
  1136. }
  1137. end_prefix = true;
  1138. break;
  1139. default:
  1140. end_prefix = true;
  1141. break;
  1142. }
  1143. }
  1144. iflag_set_all(&best); /* Worst possible */
  1145. best_p = NULL;
  1146. best_pref = INT_MAX;
  1147. if (!ix)
  1148. return 0; /* No instruction table at all... */
  1149. dp = data;
  1150. fetch_or_return(origdata, dp, data_size, 1);
  1151. ix += *dp++;
  1152. while (ix->n == -1) {
  1153. fetch_or_return(origdata, dp, data_size, 1);
  1154. ix = (const struct disasm_index *)ix->p + *dp++;
  1155. }
  1156. p = (const struct itemplate * const *)ix->p;
  1157. for (n = ix->n; n; n--, p++) {
  1158. if ((length = matches(*p, data, &prefix, segsize, &tmp_ins))) {
  1159. works = true;
  1160. /*
  1161. * Final check to make sure the types of r/m match up.
  1162. * XXX: Need to make sure this is actually correct.
  1163. */
  1164. for (i = 0; i < (*p)->operands; i++) {
  1165. if (
  1166. /* If it's a mem-only EA but we have a
  1167. register, die. */
  1168. ((tmp_ins.oprs[i].segment & SEG_RMREG) &&
  1169. is_class(MEMORY, (*p)->opd[i])) ||
  1170. /* If it's a reg-only EA but we have a memory
  1171. ref, die. */
  1172. (!(tmp_ins.oprs[i].segment & SEG_RMREG) &&
  1173. !(REG_EA & ~(*p)->opd[i]) &&
  1174. !((*p)->opd[i] & REG_SMASK)) ||
  1175. /* Register type mismatch (eg FS vs REG_DESS):
  1176. die. */
  1177. ((((*p)->opd[i] & (REGISTER | FPUREG)) ||
  1178. (tmp_ins.oprs[i].segment & SEG_RMREG)) &&
  1179. !whichreg((*p)->opd[i],
  1180. tmp_ins.oprs[i].basereg, tmp_ins.rex))
  1181. ) {
  1182. works = false;
  1183. break;
  1184. }
  1185. }
  1186. /*
  1187. * Note: we always prefer instructions which incorporate
  1188. * prefixes in the instructions themselves. This is to allow
  1189. * e.g. PAUSE to be preferred to REP NOP, and deal with
  1190. * MMX/SSE instructions where prefixes are used to select
  1191. * between MMX and SSE register sets or outright opcode
  1192. * selection.
  1193. */
  1194. if (works) {
  1195. int i, nprefix;
  1196. goodness = iflag_pfmask(*p);
  1197. goodness = iflag_xor(&goodness, prefer);
  1198. nprefix = 0;
  1199. for (i = 0; i < MAXPREFIX; i++)
  1200. if (tmp_ins.prefixes[i])
  1201. nprefix++;
  1202. if (nprefix < best_pref ||
  1203. (nprefix == best_pref &&
  1204. iflag_cmp(&goodness, &best) < 0)) {
  1205. /* This is the best one found so far */
  1206. best = goodness;
  1207. best_p = p;
  1208. best_pref = nprefix;
  1209. best_length = length;
  1210. ins = tmp_ins;
  1211. }
  1212. }
  1213. }
  1214. }
  1215. if (!best_p)
  1216. return 0; /* no instruction was matched */
  1217. /* Pick the best match */
  1218. p = best_p;
  1219. length = best_length;
  1220. slen = 0;
  1221. /* TODO: snprintf returns the value that the string would have if
  1222. * the buffer were long enough, and not the actual length of
  1223. * the returned string, so each instance of using the return
  1224. * value of snprintf should actually be checked to assure that
  1225. * the return value is "sane." Maybe a macro wrapper could
  1226. * be used for that purpose.
  1227. */
  1228. for (i = 0; i < MAXPREFIX; i++) {
  1229. const char *prefix = prefix_name(ins.prefixes[i]);
  1230. if (prefix)
  1231. slen += snprintf(output+slen, outbufsize-slen, "%s ", prefix);
  1232. }
  1233. i = (*p)->opcode;
  1234. if (i >= FIRST_COND_OPCODE)
  1235. slen += snprintf(output + slen, outbufsize - slen, "%s%s",
  1236. nasm_insn_names[i], condition_name[ins.condition]);
  1237. else
  1238. slen += snprintf(output + slen, outbufsize - slen, "%s",
  1239. nasm_insn_names[i]);
  1240. colon = false;
  1241. is_evex = !!(ins.rex & REX_EV);
  1242. length += data - origdata; /* fix up for prefixes */
  1243. for (i = 0; i < (*p)->operands; i++) {
  1244. opflags_t t = (*p)->opd[i];
  1245. decoflags_t deco = (*p)->deco[i];
  1246. const operand *o = &ins.oprs[i];
  1247. int64_t offs;
  1248. output[slen++] = (colon ? ':' : i == 0 ? ' ' : ',');
  1249. offs = o->offset;
  1250. if (o->segment & SEG_RELATIVE) {
  1251. offs += offset + length;
  1252. /*
  1253. * sort out wraparound
  1254. */
  1255. if (!(o->segment & (SEG_32BIT|SEG_64BIT)))
  1256. offs &= 0xffff;
  1257. else if (segsize != 64)
  1258. offs &= 0xffffffff;
  1259. /*
  1260. * add sync marker, if autosync is on
  1261. */
  1262. if (autosync)
  1263. add_sync(offs, 0L);
  1264. }
  1265. if (t & COLON)
  1266. colon = true;
  1267. else
  1268. colon = false;
  1269. if ((t & (REGISTER | FPUREG)) ||
  1270. (o->segment & SEG_RMREG)) {
  1271. enum reg_enum reg;
  1272. reg = whichreg(t, o->basereg, ins.rex);
  1273. if (t & TO)
  1274. slen += snprintf(output + slen, outbufsize - slen, "to ");
  1275. slen += snprintf(output + slen, outbufsize - slen, "%s",
  1276. nasm_reg_names[reg-EXPR_REG_START]);
  1277. if (t & REGSET_MASK)
  1278. slen += snprintf(output + slen, outbufsize - slen, "+%d",
  1279. (int)((t & REGSET_MASK) >> (REGSET_SHIFT-1))-1);
  1280. if (is_evex && deco)
  1281. slen += append_evex_reg_deco(output + slen, outbufsize - slen,
  1282. deco, ins.evex_p);
  1283. } else if (!(UNITY & ~t)) {
  1284. output[slen++] = '1';
  1285. } else if (t & IMMEDIATE) {
  1286. if (t & BITS8) {
  1287. slen +=
  1288. snprintf(output + slen, outbufsize - slen, "byte ");
  1289. if (o->segment & SEG_SIGNED) {
  1290. if (offs < 0) {
  1291. offs *= -1;
  1292. output[slen++] = '-';
  1293. } else
  1294. output[slen++] = '+';
  1295. }
  1296. } else if (t & BITS16) {
  1297. slen +=
  1298. snprintf(output + slen, outbufsize - slen, "word ");
  1299. } else if (t & BITS32) {
  1300. slen +=
  1301. snprintf(output + slen, outbufsize - slen, "dword ");
  1302. } else if (t & BITS64) {
  1303. slen +=
  1304. snprintf(output + slen, outbufsize - slen, "qword ");
  1305. } else if (t & NEAR) {
  1306. slen +=
  1307. snprintf(output + slen, outbufsize - slen, "near ");
  1308. } else if (t & SHORT) {
  1309. slen +=
  1310. snprintf(output + slen, outbufsize - slen, "short ");
  1311. }
  1312. slen +=
  1313. snprintf(output + slen, outbufsize - slen, "0x%"PRIx64"",
  1314. offs);
  1315. } else if (!(MEM_OFFS & ~t)) {
  1316. slen +=
  1317. snprintf(output + slen, outbufsize - slen,
  1318. "[%s%s%s0x%"PRIx64"]",
  1319. (segover ? segover : ""),
  1320. (segover ? ":" : ""),
  1321. (o->disp_size == 64 ? "qword " :
  1322. o->disp_size == 32 ? "dword " :
  1323. o->disp_size == 16 ? "word " : ""), offs);
  1324. segover = NULL;
  1325. } else if (is_class(REGMEM, t)) {
  1326. int started = false;
  1327. if (t & BITS8)
  1328. slen +=
  1329. snprintf(output + slen, outbufsize - slen, "byte ");
  1330. if (t & BITS16)
  1331. slen +=
  1332. snprintf(output + slen, outbufsize - slen, "word ");
  1333. if (t & BITS32)
  1334. slen +=
  1335. snprintf(output + slen, outbufsize - slen, "dword ");
  1336. if (t & BITS64)
  1337. slen +=
  1338. snprintf(output + slen, outbufsize - slen, "qword ");
  1339. if (t & BITS80)
  1340. slen +=
  1341. snprintf(output + slen, outbufsize - slen, "tword ");
  1342. if ((ins.evex_p[2] & EVEX_P2B) && (deco & BRDCAST_MASK)) {
  1343. /* when broadcasting, each element size should be used */
  1344. if (deco & BR_BITS32)
  1345. slen +=
  1346. snprintf(output + slen, outbufsize - slen, "dword ");
  1347. else if (deco & BR_BITS64)
  1348. slen +=
  1349. snprintf(output + slen, outbufsize - slen, "qword ");
  1350. } else {
  1351. if (t & BITS128)
  1352. slen +=
  1353. snprintf(output + slen, outbufsize - slen, "oword ");
  1354. if (t & BITS256)
  1355. slen +=
  1356. snprintf(output + slen, outbufsize - slen, "yword ");
  1357. if (t & BITS512)
  1358. slen +=
  1359. snprintf(output + slen, outbufsize - slen, "zword ");
  1360. }
  1361. if (t & FAR)
  1362. slen += snprintf(output + slen, outbufsize - slen, "far ");
  1363. if (t & NEAR)
  1364. slen +=
  1365. snprintf(output + slen, outbufsize - slen, "near ");
  1366. output[slen++] = '[';
  1367. if (o->disp_size)
  1368. slen += snprintf(output + slen, outbufsize - slen, "%s",
  1369. (o->disp_size == 64 ? "qword " :
  1370. o->disp_size == 32 ? "dword " :
  1371. o->disp_size == 16 ? "word " :
  1372. ""));
  1373. if (o->eaflags & EAF_REL)
  1374. slen += snprintf(output + slen, outbufsize - slen, "rel ");
  1375. if (segover) {
  1376. slen +=
  1377. snprintf(output + slen, outbufsize - slen, "%s:",
  1378. segover);
  1379. segover = NULL;
  1380. }
  1381. if (o->basereg != -1) {
  1382. slen += snprintf(output + slen, outbufsize - slen, "%s",
  1383. nasm_reg_names[(o->basereg-EXPR_REG_START)]);
  1384. started = true;
  1385. }
  1386. if (o->indexreg != -1 && !itemp_has(*best_p, IF_MIB)) {
  1387. if (started)
  1388. output[slen++] = '+';
  1389. slen += snprintf(output + slen, outbufsize - slen, "%s",
  1390. nasm_reg_names[(o->indexreg-EXPR_REG_START)]);
  1391. if (o->scale > 1)
  1392. slen +=
  1393. snprintf(output + slen, outbufsize - slen, "*%d",
  1394. o->scale);
  1395. started = true;
  1396. }
  1397. if (o->segment & SEG_DISP8) {
  1398. if (is_evex) {
  1399. const char *prefix;
  1400. uint32_t offset = offs;
  1401. if ((int32_t)offset < 0) {
  1402. prefix = "-";
  1403. offset = -offset;
  1404. } else {
  1405. prefix = "+";
  1406. }
  1407. slen +=
  1408. snprintf(output + slen, outbufsize - slen, "%s0x%"PRIx32"",
  1409. prefix, offset);
  1410. } else {
  1411. const char *prefix;
  1412. uint8_t offset = offs;
  1413. if ((int8_t)offset < 0) {
  1414. prefix = "-";
  1415. offset = -offset;
  1416. } else {
  1417. prefix = "+";
  1418. }
  1419. slen +=
  1420. snprintf(output + slen, outbufsize - slen, "%s0x%"PRIx8"",
  1421. prefix, offset);
  1422. }
  1423. } else if (o->segment & SEG_DISP16) {
  1424. const char *prefix;
  1425. uint16_t offset = offs;
  1426. if ((int16_t)offset < 0 && started) {
  1427. offset = -offset;
  1428. prefix = "-";
  1429. } else {
  1430. prefix = started ? "+" : "";
  1431. }
  1432. slen +=
  1433. snprintf(output + slen, outbufsize - slen,
  1434. "%s0x%"PRIx16"", prefix, offset);
  1435. } else if (o->segment & SEG_DISP32) {
  1436. if (prefix.asize == 64) {
  1437. const char *prefix;
  1438. uint64_t offset = offs;
  1439. if ((int32_t)offs < 0 && started) {
  1440. offset = -offset;
  1441. prefix = "-";
  1442. } else {
  1443. prefix = started ? "+" : "";
  1444. }
  1445. slen +=
  1446. snprintf(output + slen, outbufsize - slen,
  1447. "%s0x%"PRIx64"", prefix, offset);
  1448. } else {
  1449. const char *prefix;
  1450. uint32_t offset = offs;
  1451. if ((int32_t) offset < 0 && started) {
  1452. offset = -offset;
  1453. prefix = "-";
  1454. } else {
  1455. prefix = started ? "+" : "";
  1456. }
  1457. slen +=
  1458. snprintf(output + slen, outbufsize - slen,
  1459. "%s0x%"PRIx32"", prefix, offset);
  1460. }
  1461. }
  1462. if (o->indexreg != -1 && itemp_has(*best_p, IF_MIB)) {
  1463. output[slen++] = ',';
  1464. slen += snprintf(output + slen, outbufsize - slen, "%s",
  1465. nasm_reg_names[(o->indexreg-EXPR_REG_START)]);
  1466. if (o->scale > 1)
  1467. slen +=
  1468. snprintf(output + slen, outbufsize - slen, "*%d",
  1469. o->scale);
  1470. started = true;
  1471. }
  1472. output[slen++] = ']';
  1473. if (is_evex && deco)
  1474. slen += append_evex_mem_deco(output + slen, outbufsize - slen,
  1475. t, deco, ins.evex_p);
  1476. } else {
  1477. slen +=
  1478. snprintf(output + slen, outbufsize - slen, "<operand%d>",
  1479. i);
  1480. }
  1481. }
  1482. output[slen] = '\0';
  1483. if (segover) { /* unused segment override */
  1484. char *p = output;
  1485. int count = slen + 1;
  1486. while (count--)
  1487. p[count + 3] = p[count];
  1488. strncpy(output, segover, 2);
  1489. output[2] = ' ';
  1490. }
  1491. return length;
  1492. }
  1493. /*
  1494. * This is called when we don't have a complete instruction. If it
  1495. * is a standalone *single-byte* prefix show it as such, otherwise
  1496. * print it as a literal.
  1497. */
  1498. int32_t eatbyte(uint8_t *data, char *output, int outbufsize, int segsize)
  1499. {
  1500. uint8_t byte = *data;
  1501. const char *str = NULL;
  1502. switch (byte) {
  1503. case 0xF2:
  1504. str = "repne";
  1505. break;
  1506. case 0xF3:
  1507. str = "rep";
  1508. break;
  1509. case 0x9B:
  1510. str = "wait";
  1511. break;
  1512. case 0xF0:
  1513. str = "lock";
  1514. break;
  1515. case 0x2E:
  1516. str = "cs";
  1517. break;
  1518. case 0x36:
  1519. str = "ss";
  1520. break;
  1521. case 0x3E:
  1522. str = "ds";
  1523. break;
  1524. case 0x26:
  1525. str = "es";
  1526. break;
  1527. case 0x64:
  1528. str = "fs";
  1529. break;
  1530. case 0x65:
  1531. str = "gs";
  1532. break;
  1533. case 0x66:
  1534. str = (segsize == 16) ? "o32" : "o16";
  1535. break;
  1536. case 0x67:
  1537. str = (segsize == 32) ? "a16" : "a32";
  1538. break;
  1539. case REX_P + 0x0:
  1540. case REX_P + 0x1:
  1541. case REX_P + 0x2:
  1542. case REX_P + 0x3:
  1543. case REX_P + 0x4:
  1544. case REX_P + 0x5:
  1545. case REX_P + 0x6:
  1546. case REX_P + 0x7:
  1547. case REX_P + 0x8:
  1548. case REX_P + 0x9:
  1549. case REX_P + 0xA:
  1550. case REX_P + 0xB:
  1551. case REX_P + 0xC:
  1552. case REX_P + 0xD:
  1553. case REX_P + 0xE:
  1554. case REX_P + 0xF:
  1555. if (segsize == 64) {
  1556. snprintf(output, outbufsize, "rex%s%s%s%s%s",
  1557. (byte == REX_P) ? "" : ".",
  1558. (byte & REX_W) ? "w" : "",
  1559. (byte & REX_R) ? "r" : "",
  1560. (byte & REX_X) ? "x" : "",
  1561. (byte & REX_B) ? "b" : "");
  1562. break;
  1563. }
  1564. /* else fall through */
  1565. default:
  1566. snprintf(output, outbufsize, "db 0x%02x", byte);
  1567. break;
  1568. }
  1569. if (str)
  1570. snprintf(output, outbufsize, "%s", str);
  1571. return 1;
  1572. }