dasm_arm64.h 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518
  1. /*
  2. ** DynASM ARM64 encoding engine.
  3. ** Copyright (C) 2005-2016 Mike Pall. All rights reserved.
  4. ** Released under the MIT license. See dynasm.lua for full copyright notice.
  5. */
  6. #include <stddef.h>
  7. #include <stdarg.h>
  8. #include <string.h>
  9. #include <stdlib.h>
  10. #define DASM_ARCH "arm64"
  11. #ifndef DASM_EXTERN
  12. #define DASM_EXTERN(a,b,c,d) 0
  13. #endif
  14. /* Action definitions. */
  15. enum {
  16. DASM_STOP, DASM_SECTION, DASM_ESC, DASM_REL_EXT,
  17. /* The following actions need a buffer position. */
  18. DASM_ALIGN, DASM_REL_LG, DASM_LABEL_LG,
  19. /* The following actions also have an argument. */
  20. DASM_REL_PC, DASM_LABEL_PC,
  21. DASM_IMM, DASM_IMM6, DASM_IMM12, DASM_IMM13W, DASM_IMM13X, DASM_IMML,
  22. DASM__MAX
  23. };
  24. /* Maximum number of section buffer positions for a single dasm_put() call. */
  25. #define DASM_MAXSECPOS 25
  26. /* DynASM encoder status codes. Action list offset or number are or'ed in. */
  27. #define DASM_S_OK 0x00000000
  28. #define DASM_S_NOMEM 0x01000000
  29. #define DASM_S_PHASE 0x02000000
  30. #define DASM_S_MATCH_SEC 0x03000000
  31. #define DASM_S_RANGE_I 0x11000000
  32. #define DASM_S_RANGE_SEC 0x12000000
  33. #define DASM_S_RANGE_LG 0x13000000
  34. #define DASM_S_RANGE_PC 0x14000000
  35. #define DASM_S_RANGE_REL 0x15000000
  36. #define DASM_S_UNDEF_LG 0x21000000
  37. #define DASM_S_UNDEF_PC 0x22000000
  38. /* Macros to convert positions (8 bit section + 24 bit index). */
  39. #define DASM_POS2IDX(pos) ((pos)&0x00ffffff)
  40. #define DASM_POS2BIAS(pos) ((pos)&0xff000000)
  41. #define DASM_SEC2POS(sec) ((sec)<<24)
  42. #define DASM_POS2SEC(pos) ((pos)>>24)
  43. #define DASM_POS2PTR(D, pos) (D->sections[DASM_POS2SEC(pos)].rbuf + (pos))
  44. /* Action list type. */
  45. typedef const unsigned int *dasm_ActList;
  46. /* Per-section structure. */
  47. typedef struct dasm_Section {
  48. int *rbuf; /* Biased buffer pointer (negative section bias). */
  49. int *buf; /* True buffer pointer. */
  50. size_t bsize; /* Buffer size in bytes. */
  51. int pos; /* Biased buffer position. */
  52. int epos; /* End of biased buffer position - max single put. */
  53. int ofs; /* Byte offset into section. */
  54. } dasm_Section;
  55. /* Core structure holding the DynASM encoding state. */
  56. struct dasm_State {
  57. size_t psize; /* Allocated size of this structure. */
  58. dasm_ActList actionlist; /* Current actionlist pointer. */
  59. int *lglabels; /* Local/global chain/pos ptrs. */
  60. size_t lgsize;
  61. int *pclabels; /* PC label chains/pos ptrs. */
  62. size_t pcsize;
  63. void **globals; /* Array of globals (bias -10). */
  64. dasm_Section *section; /* Pointer to active section. */
  65. size_t codesize; /* Total size of all code sections. */
  66. int maxsection; /* 0 <= sectionidx < maxsection. */
  67. int status; /* Status code. */
  68. dasm_Section sections[1]; /* All sections. Alloc-extended. */
  69. };
  70. /* The size of the core structure depends on the max. number of sections. */
  71. #define DASM_PSZ(ms) (sizeof(dasm_State)+(ms-1)*sizeof(dasm_Section))
  72. /* Initialize DynASM state. */
  73. void dasm_init(Dst_DECL, int maxsection)
  74. {
  75. dasm_State *D;
  76. size_t psz = 0;
  77. int i;
  78. Dst_REF = NULL;
  79. DASM_M_GROW(Dst, struct dasm_State, Dst_REF, psz, DASM_PSZ(maxsection));
  80. D = Dst_REF;
  81. D->psize = psz;
  82. D->lglabels = NULL;
  83. D->lgsize = 0;
  84. D->pclabels = NULL;
  85. D->pcsize = 0;
  86. D->globals = NULL;
  87. D->maxsection = maxsection;
  88. for (i = 0; i < maxsection; i++) {
  89. D->sections[i].buf = NULL; /* Need this for pass3. */
  90. D->sections[i].rbuf = D->sections[i].buf - DASM_SEC2POS(i);
  91. D->sections[i].bsize = 0;
  92. D->sections[i].epos = 0; /* Wrong, but is recalculated after resize. */
  93. }
  94. }
  95. /* Free DynASM state. */
  96. void dasm_free(Dst_DECL)
  97. {
  98. dasm_State *D = Dst_REF;
  99. int i;
  100. for (i = 0; i < D->maxsection; i++)
  101. if (D->sections[i].buf)
  102. DASM_M_FREE(Dst, D->sections[i].buf, D->sections[i].bsize);
  103. if (D->pclabels) DASM_M_FREE(Dst, D->pclabels, D->pcsize);
  104. if (D->lglabels) DASM_M_FREE(Dst, D->lglabels, D->lgsize);
  105. DASM_M_FREE(Dst, D, D->psize);
  106. }
  107. /* Setup global label array. Must be called before dasm_setup(). */
  108. void dasm_setupglobal(Dst_DECL, void **gl, unsigned int maxgl)
  109. {
  110. dasm_State *D = Dst_REF;
  111. D->globals = gl - 10; /* Negative bias to compensate for locals. */
  112. DASM_M_GROW(Dst, int, D->lglabels, D->lgsize, (10+maxgl)*sizeof(int));
  113. }
  114. /* Grow PC label array. Can be called after dasm_setup(), too. */
  115. void dasm_growpc(Dst_DECL, unsigned int maxpc)
  116. {
  117. dasm_State *D = Dst_REF;
  118. size_t osz = D->pcsize;
  119. DASM_M_GROW(Dst, int, D->pclabels, D->pcsize, maxpc*sizeof(int));
  120. memset((void *)(((unsigned char *)D->pclabels)+osz), 0, D->pcsize-osz);
  121. }
  122. /* Setup encoder. */
  123. void dasm_setup(Dst_DECL, const void *actionlist)
  124. {
  125. dasm_State *D = Dst_REF;
  126. int i;
  127. D->actionlist = (dasm_ActList)actionlist;
  128. D->status = DASM_S_OK;
  129. D->section = &D->sections[0];
  130. memset((void *)D->lglabels, 0, D->lgsize);
  131. if (D->pclabels) memset((void *)D->pclabels, 0, D->pcsize);
  132. for (i = 0; i < D->maxsection; i++) {
  133. D->sections[i].pos = DASM_SEC2POS(i);
  134. D->sections[i].ofs = 0;
  135. }
  136. }
  137. #ifdef DASM_CHECKS
  138. #define CK(x, st) \
  139. do { if (!(x)) { \
  140. D->status = DASM_S_##st|(p-D->actionlist-1); return; } } while (0)
  141. #define CKPL(kind, st) \
  142. do { if ((size_t)((char *)pl-(char *)D->kind##labels) >= D->kind##size) { \
  143. D->status = DASM_S_RANGE_##st|(p-D->actionlist-1); return; } } while (0)
  144. #else
  145. #define CK(x, st) ((void)0)
  146. #define CKPL(kind, st) ((void)0)
  147. #endif
  148. static int dasm_imm12(unsigned int n)
  149. {
  150. if ((n >> 12) == 0)
  151. return n;
  152. else if ((n & 0xff000fff) == 0)
  153. return (n >> 12) | 0x1000;
  154. else
  155. return -1;
  156. }
  157. static int dasm_ffs(unsigned long long x)
  158. {
  159. int n = -1;
  160. while (x) { x >>= 1; n++; }
  161. return n;
  162. }
  163. static int dasm_imm13(int lo, int hi)
  164. {
  165. int inv = 0, w = 64, s = 0xfff, xa, xb;
  166. unsigned long long n = (((unsigned long long)hi) << 32) | (unsigned int)lo;
  167. unsigned long long m = 1ULL, a, b, c;
  168. if (n & 1) { n = ~n; inv = 1; }
  169. a = n & -n; b = (n+a)&-(n+a); c = (n+a-b)&-(n+a-b);
  170. xa = dasm_ffs(a); xb = dasm_ffs(b);
  171. if (c) {
  172. w = dasm_ffs(c) - xa;
  173. if (w == 32) m = 0x0000000100000001UL;
  174. else if (w == 16) m = 0x0001000100010001UL;
  175. else if (w == 8) m = 0x0101010101010101UL;
  176. else if (w == 4) m = 0x1111111111111111UL;
  177. else if (w == 2) m = 0x5555555555555555UL;
  178. else return -1;
  179. s = (-2*w & 0x3f) - 1;
  180. } else if (!a) {
  181. return -1;
  182. } else if (xb == -1) {
  183. xb = 64;
  184. }
  185. if ((b-a) * m != n) return -1;
  186. if (inv) {
  187. return ((w - xb) << 6) | (s+w+xa-xb);
  188. } else {
  189. return ((w - xa) << 6) | (s+xb-xa);
  190. }
  191. return -1;
  192. }
  193. /* Pass 1: Store actions and args, link branches/labels, estimate offsets. */
  194. void dasm_put(Dst_DECL, int start, ...)
  195. {
  196. va_list ap;
  197. dasm_State *D = Dst_REF;
  198. dasm_ActList p = D->actionlist + start;
  199. dasm_Section *sec = D->section;
  200. int pos = sec->pos, ofs = sec->ofs;
  201. int *b;
  202. if (pos >= sec->epos) {
  203. DASM_M_GROW(Dst, int, sec->buf, sec->bsize,
  204. sec->bsize + 2*DASM_MAXSECPOS*sizeof(int));
  205. sec->rbuf = sec->buf - DASM_POS2BIAS(pos);
  206. sec->epos = (int)sec->bsize/sizeof(int) - DASM_MAXSECPOS+DASM_POS2BIAS(pos);
  207. }
  208. b = sec->rbuf;
  209. b[pos++] = start;
  210. va_start(ap, start);
  211. while (1) {
  212. unsigned int ins = *p++;
  213. unsigned int action = (ins >> 16);
  214. if (action >= DASM__MAX) {
  215. ofs += 4;
  216. } else {
  217. int *pl, n = action >= DASM_REL_PC ? va_arg(ap, int) : 0;
  218. switch (action) {
  219. case DASM_STOP: goto stop;
  220. case DASM_SECTION:
  221. n = (ins & 255); CK(n < D->maxsection, RANGE_SEC);
  222. D->section = &D->sections[n]; goto stop;
  223. case DASM_ESC: p++; ofs += 4; break;
  224. case DASM_REL_EXT: break;
  225. case DASM_ALIGN: ofs += (ins & 255); b[pos++] = ofs; break;
  226. case DASM_REL_LG:
  227. n = (ins & 2047) - 10; pl = D->lglabels + n;
  228. /* Bkwd rel or global. */
  229. if (n >= 0) { CK(n>=10||*pl<0, RANGE_LG); CKPL(lg, LG); goto putrel; }
  230. pl += 10; n = *pl;
  231. if (n < 0) n = 0; /* Start new chain for fwd rel if label exists. */
  232. goto linkrel;
  233. case DASM_REL_PC:
  234. pl = D->pclabels + n; CKPL(pc, PC);
  235. putrel:
  236. n = *pl;
  237. if (n < 0) { /* Label exists. Get label pos and store it. */
  238. b[pos] = -n;
  239. } else {
  240. linkrel:
  241. b[pos] = n; /* Else link to rel chain, anchored at label. */
  242. *pl = pos;
  243. }
  244. pos++;
  245. break;
  246. case DASM_LABEL_LG:
  247. pl = D->lglabels + (ins & 2047) - 10; CKPL(lg, LG); goto putlabel;
  248. case DASM_LABEL_PC:
  249. pl = D->pclabels + n; CKPL(pc, PC);
  250. putlabel:
  251. n = *pl; /* n > 0: Collapse rel chain and replace with label pos. */
  252. while (n > 0) { int *pb = DASM_POS2PTR(D, n); n = *pb; *pb = pos;
  253. }
  254. *pl = -pos; /* Label exists now. */
  255. b[pos++] = ofs; /* Store pass1 offset estimate. */
  256. break;
  257. case DASM_IMM:
  258. CK((n & ((1<<((ins>>10)&31))-1)) == 0, RANGE_I);
  259. n >>= ((ins>>10)&31);
  260. #ifdef DASM_CHECKS
  261. if ((ins & 0x8000))
  262. CK(((n + (1<<(((ins>>5)&31)-1)))>>((ins>>5)&31)) == 0, RANGE_I);
  263. else
  264. CK((n>>((ins>>5)&31)) == 0, RANGE_I);
  265. #endif
  266. b[pos++] = n;
  267. break;
  268. case DASM_IMM6:
  269. CK((n >> 6) == 0, RANGE_I);
  270. b[pos++] = n;
  271. break;
  272. case DASM_IMM12:
  273. CK(dasm_imm12((unsigned int)n) != -1, RANGE_I);
  274. b[pos++] = n;
  275. break;
  276. case DASM_IMM13W:
  277. CK(dasm_imm13(n, n) != -1, RANGE_I);
  278. b[pos++] = n;
  279. break;
  280. case DASM_IMM13X: {
  281. int m = va_arg(ap, int);
  282. CK(dasm_imm13(n, m) != -1, RANGE_I);
  283. b[pos++] = n;
  284. b[pos++] = m;
  285. break;
  286. }
  287. case DASM_IMML: {
  288. #ifdef DASM_CHECKS
  289. int scale = (p[-2] >> 30);
  290. CK((!(n & ((1<<scale)-1)) && (unsigned int)(n>>scale) < 4096) ||
  291. (unsigned int)(n+256) < 512, RANGE_I);
  292. #endif
  293. b[pos++] = n;
  294. break;
  295. }
  296. }
  297. }
  298. }
  299. stop:
  300. va_end(ap);
  301. sec->pos = pos;
  302. sec->ofs = ofs;
  303. }
  304. #undef CK
  305. /* Pass 2: Link sections, shrink aligns, fix label offsets. */
  306. int dasm_link(Dst_DECL, size_t *szp)
  307. {
  308. dasm_State *D = Dst_REF;
  309. int secnum;
  310. int ofs = 0;
  311. #ifdef DASM_CHECKS
  312. *szp = 0;
  313. if (D->status != DASM_S_OK) return D->status;
  314. {
  315. int pc;
  316. for (pc = 0; pc*sizeof(int) < D->pcsize; pc++)
  317. if (D->pclabels[pc] > 0) return DASM_S_UNDEF_PC|pc;
  318. }
  319. #endif
  320. { /* Handle globals not defined in this translation unit. */
  321. int idx;
  322. for (idx = 20; idx*sizeof(int) < D->lgsize; idx++) {
  323. int n = D->lglabels[idx];
  324. /* Undefined label: Collapse rel chain and replace with marker (< 0). */
  325. while (n > 0) { int *pb = DASM_POS2PTR(D, n); n = *pb; *pb = -idx; }
  326. }
  327. }
  328. /* Combine all code sections. No support for data sections (yet). */
  329. for (secnum = 0; secnum < D->maxsection; secnum++) {
  330. dasm_Section *sec = D->sections + secnum;
  331. int *b = sec->rbuf;
  332. int pos = DASM_SEC2POS(secnum);
  333. int lastpos = sec->pos;
  334. while (pos != lastpos) {
  335. dasm_ActList p = D->actionlist + b[pos++];
  336. while (1) {
  337. unsigned int ins = *p++;
  338. unsigned int action = (ins >> 16);
  339. switch (action) {
  340. case DASM_STOP: case DASM_SECTION: goto stop;
  341. case DASM_ESC: p++; break;
  342. case DASM_REL_EXT: break;
  343. case DASM_ALIGN: ofs -= (b[pos++] + ofs) & (ins & 255); break;
  344. case DASM_REL_LG: case DASM_REL_PC: pos++; break;
  345. case DASM_LABEL_LG: case DASM_LABEL_PC: b[pos++] += ofs; break;
  346. case DASM_IMM: case DASM_IMM6: case DASM_IMM12: case DASM_IMM13W:
  347. case DASM_IMML: pos++; break;
  348. case DASM_IMM13X: pos += 2; break;
  349. }
  350. }
  351. stop: (void)0;
  352. }
  353. ofs += sec->ofs; /* Next section starts right after current section. */
  354. }
  355. D->codesize = ofs; /* Total size of all code sections */
  356. *szp = ofs;
  357. return DASM_S_OK;
  358. }
  359. #ifdef DASM_CHECKS
  360. #define CK(x, st) \
  361. do { if (!(x)) return DASM_S_##st|(p-D->actionlist-1); } while (0)
  362. #else
  363. #define CK(x, st) ((void)0)
  364. #endif
  365. /* Pass 3: Encode sections. */
  366. int dasm_encode(Dst_DECL, void *buffer)
  367. {
  368. dasm_State *D = Dst_REF;
  369. char *base = (char *)buffer;
  370. unsigned int *cp = (unsigned int *)buffer;
  371. int secnum;
  372. /* Encode all code sections. No support for data sections (yet). */
  373. for (secnum = 0; secnum < D->maxsection; secnum++) {
  374. dasm_Section *sec = D->sections + secnum;
  375. int *b = sec->buf;
  376. int *endb = sec->rbuf + sec->pos;
  377. while (b != endb) {
  378. dasm_ActList p = D->actionlist + *b++;
  379. while (1) {
  380. unsigned int ins = *p++;
  381. unsigned int action = (ins >> 16);
  382. int n = (action >= DASM_ALIGN && action < DASM__MAX) ? *b++ : 0;
  383. switch (action) {
  384. case DASM_STOP: case DASM_SECTION: goto stop;
  385. case DASM_ESC: *cp++ = *p++; break;
  386. case DASM_REL_EXT:
  387. n = DASM_EXTERN(Dst, (unsigned char *)cp, (ins&2047), !(ins&2048));
  388. goto patchrel;
  389. case DASM_ALIGN:
  390. ins &= 255; while ((((char *)cp - base) & ins)) *cp++ = 0xe1a00000;
  391. break;
  392. case DASM_REL_LG:
  393. CK(n >= 0, UNDEF_LG);
  394. case DASM_REL_PC:
  395. CK(n >= 0, UNDEF_PC);
  396. n = *DASM_POS2PTR(D, n) - (int)((char *)cp - base) + 4;
  397. patchrel:
  398. if (!(ins & 0xf800)) { /* B, BL */
  399. CK((n & 3) == 0 && ((n+0x08000000) >> 28) == 0, RANGE_REL);
  400. cp[-1] |= ((n >> 2) & 0x03ffffff);
  401. } else if ((ins & 0x800)) { /* B.cond, CBZ, CBNZ, LDR* literal */
  402. CK((n & 3) == 0 && ((n+0x00100000) >> 21) == 0, RANGE_REL);
  403. cp[-1] |= ((n << 3) & 0x00ffffe0);
  404. } else if ((ins & 0x3000) == 0x2000) { /* ADR */
  405. CK(((n+0x00100000) >> 21) == 0, RANGE_REL);
  406. cp[-1] |= ((n << 3) & 0x00ffffe0) | ((n & 3) << 29);
  407. } else if ((ins & 0x3000) == 0x3000) { /* ADRP */
  408. cp[-1] |= ((n >> 9) & 0x00ffffe0) | (((n >> 12) & 3) << 29);
  409. } else if ((ins & 0x1000)) { /* TBZ, TBNZ */
  410. CK((n & 3) == 0 && ((n+0x00008000) >> 16) == 0, RANGE_REL);
  411. cp[-1] |= ((n << 3) & 0x0007ffe0);
  412. }
  413. break;
  414. case DASM_LABEL_LG:
  415. ins &= 2047; if (ins >= 20) D->globals[ins-10] = (void *)(base + n);
  416. break;
  417. case DASM_LABEL_PC: break;
  418. case DASM_IMM:
  419. cp[-1] |= (n & ((1<<((ins>>5)&31))-1)) << (ins&31);
  420. break;
  421. case DASM_IMM6:
  422. cp[-1] |= ((n&31) << 19) | ((n&32) << 26);
  423. break;
  424. case DASM_IMM12:
  425. cp[-1] |= (dasm_imm12((unsigned int)n) << 10);
  426. break;
  427. case DASM_IMM13W:
  428. cp[-1] |= (dasm_imm13(n, n) << 10);
  429. break;
  430. case DASM_IMM13X:
  431. cp[-1] |= (dasm_imm13(n, *b++) << 10);
  432. break;
  433. case DASM_IMML: {
  434. int scale = (p[-2] >> 30);
  435. cp[-1] |= (!(n & ((1<<scale)-1)) && (unsigned int)(n>>scale) < 4096) ?
  436. ((n << (10-scale)) | 0x01000000) : ((n & 511) << 12);
  437. break;
  438. }
  439. default: *cp++ = ins; break;
  440. }
  441. }
  442. stop: (void)0;
  443. }
  444. }
  445. if (base + D->codesize != (char *)cp) /* Check for phase errors. */
  446. return DASM_S_PHASE;
  447. return DASM_S_OK;
  448. }
  449. #undef CK
  450. /* Get PC label offset. */
  451. int dasm_getpclabel(Dst_DECL, unsigned int pc)
  452. {
  453. dasm_State *D = Dst_REF;
  454. if (pc*sizeof(int) < D->pcsize) {
  455. int pos = D->pclabels[pc];
  456. if (pos < 0) return *DASM_POS2PTR(D, -pos);
  457. if (pos > 0) return -1; /* Undefined. */
  458. }
  459. return -2; /* Unused or out of range. */
  460. }
  461. #ifdef DASM_CHECKS
  462. /* Optional sanity checker to call between isolated encoding steps. */
  463. int dasm_checkstep(Dst_DECL, int secmatch)
  464. {
  465. dasm_State *D = Dst_REF;
  466. if (D->status == DASM_S_OK) {
  467. int i;
  468. for (i = 1; i <= 9; i++) {
  469. if (D->lglabels[i] > 0) { D->status = DASM_S_UNDEF_LG|i; break; }
  470. D->lglabels[i] = 0;
  471. }
  472. }
  473. if (D->status == DASM_S_OK && secmatch >= 0 &&
  474. D->section != &D->sections[secmatch])
  475. D->status = DASM_S_MATCH_SEC|(D->section-D->sections);
  476. return D->status;
  477. }
  478. #endif