dasm_arm64.h 16 KB

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