dasm_arm64.h 16 KB

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