jit_arm_raw.c 8.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443
  1. #include <stdint.h>
  2. enum jit_reg {
  3. R0 = 0,
  4. R1,
  5. R2,
  6. R3,
  7. R4,
  8. R5,
  9. R6,
  10. R7,
  11. R8,
  12. R9,
  13. R10,
  14. R11,
  15. R12,
  16. R13, // SP Stack Pointer
  17. R14, // LR Link Register
  18. R15 // PC Program Counter
  19. };
  20. enum arg_reg {
  21. ARGR0 = 0,
  22. ARGR1,
  23. ARGR2
  24. };
  25. #define RSP R13
  26. static uint32_t* code;
  27. static uint32_t code_idx;
  28. static uint32_t cpool_idx; // constant pool
  29. #define JIT_MAX_LABELS 32
  30. static int label_idx = 0;
  31. static Label jit_labels[JIT_MAX_LABELS];
  32. static Label jit_labels_unres[JIT_MAX_LABELS]; // unresolved (forward) labels
  33. static int unres_labels = 0;
  34. /*
  35. 31-28 cond
  36. 27: 0
  37. 26: 1
  38. 25: 0
  39. 24: P (1 = offset addressing)
  40. 23: U (1 = +, 0 = -)
  41. 22: 0 (1 = byte access)
  42. 21: W (0 = offset addressing)
  43. 20: L (0 = store 1 = load)
  44. */
  45. void jit_init(int gap) {
  46. // cleans up jit state
  47. label_idx = 0;
  48. unres_labels = 0;
  49. code_idx = 0;
  50. cpool_idx = gap;
  51. for (int i=0; i<JIT_MAX_LABELS; i++) {
  52. if (jit_labels[i].name) free(jit_labels[i].name);
  53. jit_labels[i].name = NULL;
  54. jit_labels[i].idx = 0;
  55. if (jit_labels_unres[i].name) free(jit_labels_unres[i].name);
  56. jit_labels_unres[i].name = NULL;
  57. jit_labels_unres[i].idx = 0;
  58. }
  59. }
  60. void jit_movi(int reg, uint32_t imm) {
  61. // load from constant pool
  62. // template: 0b11000101100100000000000000000000
  63. // 0x5900000
  64. uint32_t op = 0xe5900000;
  65. op |= (15<<16); // base reg = pc
  66. op |= (reg<<12); // dreg
  67. op |= ((cpool_idx-code_idx-2)*4);
  68. *(code+cpool_idx) = imm; // store in constant pool
  69. cpool_idx++;
  70. code[code_idx] = op;
  71. code_idx++;
  72. }
  73. void jit_movr(int dreg, int sreg) {
  74. uint32_t op = 0xe1a00000;
  75. op |= (sreg<<0);
  76. op |= (dreg<<12);
  77. code[code_idx++] = op;
  78. }
  79. void jit_movneg(int dreg, int sreg) {
  80. uint32_t op = 0x41a00000;
  81. op |= (sreg<<0); // base reg = pc
  82. op |= (dreg<<12); // dreg
  83. code[code_idx++] = op;
  84. }
  85. void jit_movne(int dreg, int sreg) {
  86. uint32_t op = 0x11a00000;
  87. op |= (sreg<<0); // base reg = pc
  88. op |= (dreg<<12); // dreg
  89. code[code_idx++] = op;
  90. }
  91. void jit_moveq(int dreg, int sreg) {
  92. uint32_t op = 0x01a00000;
  93. op |= (sreg<<0); // base reg = pc
  94. op |= (dreg<<12); // dreg
  95. code[code_idx++] = op;
  96. }
  97. void jit_lea(int reg, void* addr) {
  98. jit_movi(reg, (uint32_t)addr);
  99. }
  100. void jit_ldr(int reg) {
  101. uint32_t op = 0xe5900000;
  102. op |= (reg<<16); // base reg = pc
  103. op |= (reg<<12); // dreg
  104. code[code_idx++] = op;
  105. }
  106. void jit_ldr_stack(int dreg, int offset) {
  107. uint32_t op = 0xe59d0000;
  108. if (offset<0) {
  109. op = 0xe51d0000;
  110. offset = -1*offset;
  111. }
  112. op |= (offset)&0xfff;
  113. op |= (dreg<<12); // dreg
  114. code[code_idx++] = op;
  115. }
  116. void jit_str_stack(int sreg, int offset) {
  117. uint32_t op = 0xe58d0000;
  118. if (offset<0) {
  119. op = 0xe51d0000;
  120. offset = -1*offset;
  121. }
  122. op |= (offset)&0xfff;
  123. op |= (sreg<<12); // dreg
  124. code[code_idx++] = op;
  125. }
  126. void jit_inc_stack(int offset) {
  127. uint32_t op = 0xe28dd000;
  128. op |= (offset)&0xfff;
  129. code[code_idx++] = op;
  130. }
  131. void jit_dec_stack(int offset) {
  132. uint32_t op = 0xe24dd000;
  133. op |= (offset)&0xfff;
  134. code[code_idx++] = op;
  135. }
  136. void jit_ldrw(int reg) {
  137. jit_ldr(reg);
  138. }
  139. // 8 bit only from rdx! (R3)
  140. void jit_ldrb(int reg) {
  141. uint32_t op = 0xe5900000;
  142. op |= 1<<22; // byte access
  143. op |= (reg<<16); // r3
  144. op |= (3<<12); // dreg
  145. code[code_idx++] = op;
  146. }
  147. // 8 bit only from rdx! (R3)
  148. void jit_strb(int reg) {
  149. uint32_t op = 0xe5800000;
  150. op |= 1<<22; // byte access
  151. op |= (reg<<16); // r3
  152. op |= (3<<12); // dreg
  153. code[code_idx++] = op;
  154. }
  155. // 32 bit only from rdx!
  156. void jit_strw(int reg) {
  157. uint32_t op = 0xe5800000;
  158. op |= (reg<<16); // r3
  159. op |= (3<<12); // dreg
  160. code[code_idx++] = op;
  161. }
  162. #define jit_stra jit_strw
  163. void jit_addr(int dreg, int sreg) {
  164. uint32_t op = 0xe0900000;
  165. op |= (sreg<<0);
  166. op |= (dreg<<12);
  167. op |= (dreg<<16);
  168. code[code_idx++] = op;
  169. }
  170. void jit_addi(int dreg, int imm) {
  171. jit_movi(9,imm);
  172. jit_addr(dreg,9);
  173. }
  174. void jit_subr(int dreg, int sreg) {
  175. uint32_t op = 0xe0500000;
  176. op |= (sreg<<0);
  177. op |= (dreg<<12);
  178. op |= (dreg<<16);
  179. code[code_idx++] = op;
  180. }
  181. void jit_mulr(int dreg, int sreg) {
  182. uint32_t op = 0xe0100090;
  183. op |= (sreg<<8);
  184. op |= (dreg<<0);
  185. op |= (dreg<<16);
  186. code[code_idx++] = op;
  187. }
  188. void jit_andr(int dreg, int sreg) {
  189. uint32_t op = 0xe0000000;
  190. op |= (sreg<<0);
  191. op |= (dreg<<12);
  192. op |= (dreg<<16);
  193. code[code_idx++] = op;
  194. }
  195. void jit_notr(int dreg) {
  196. uint32_t op = 0xe1e00000;
  197. op |= (dreg<<0);
  198. op |= (dreg<<12);
  199. code[code_idx++] = op;
  200. }
  201. void jit_orr(int dreg, int sreg) {
  202. uint32_t op = 0xe1800000;
  203. op |= (sreg<<0);
  204. op |= (dreg<<12);
  205. op |= (dreg<<16);
  206. code[code_idx++] = op;
  207. }
  208. void jit_xorr(int dreg, int sreg) {
  209. uint32_t op = 0xe0200000;
  210. op |= (sreg<<0);
  211. op |= (dreg<<12);
  212. op |= (dreg<<16);
  213. code[code_idx++] = op;
  214. }
  215. void jit_shlr(int dreg, int sreg) {
  216. uint32_t op = 0xe1a00010;
  217. op |= (sreg<<8);
  218. op |= (dreg<<12);
  219. op |= (dreg<<0);
  220. code[code_idx++] = op;
  221. }
  222. void jit_shrr(int dreg, int sreg) {
  223. uint32_t op = 0xe1a00030;
  224. op |= (sreg<<8);
  225. op |= (dreg<<12);
  226. op |= (dreg<<0);
  227. code[code_idx++] = op;
  228. }
  229. void jit_call(void* func, char* note) {
  230. code[code_idx++] = 0xe92d4000; // stmfd sp!, {lr}
  231. jit_movr(14,15);
  232. jit_lea(15,func);
  233. code[code_idx++] = 0xe8bd4000; // ldmfd sp!, {lr}
  234. }
  235. #define jit_call2 jit_call
  236. #define jit_call3 jit_call
  237. void jit_callr(int reg) {
  238. code[code_idx++] = 0xe92d4000; // stmfd sp!, {lr}
  239. jit_movr(14,15);
  240. jit_movr(15,reg);
  241. code[code_idx++] = 0xe8bd4000; // ldmfd sp!, {lr}
  242. }
  243. int32_t inline_div(int32_t a, int32_t b) {
  244. return a/b;
  245. }
  246. void jit_divr(int dreg, int sreg) {
  247. jit_movr(0,dreg);
  248. jit_movr(1,sreg);
  249. jit_call(inline_div,"div");
  250. if (dreg!=0) jit_movr(dreg,0);
  251. // call the c lib function
  252. // later: http://thinkingeek.com/2013/08/11/arm-assembler-raspberry-pi-chapter-15/
  253. }
  254. int32_t inline_mod(int32_t a, int32_t b) {
  255. return a%b;
  256. }
  257. void jit_modr(int dreg, int sreg) {
  258. jit_movr(0,dreg);
  259. jit_movr(1,sreg);
  260. jit_call(inline_mod,"mod");
  261. if (dreg!=0) jit_movr(dreg,0);
  262. }
  263. void jit_cmpr(int sreg, int dreg) {
  264. uint32_t op = 0xe1500000;
  265. op|=(sreg<<0);
  266. op|=(dreg<<16);
  267. code[code_idx++] = op;
  268. }
  269. void jit_cmpi(int sreg, int imm) {
  270. uint32_t op = 0xe3500000;
  271. op|=imm&0xffff; // TODO double check
  272. op|=(sreg<<16);
  273. code[code_idx++] = op;
  274. }
  275. Label* find_label(char* label) {
  276. for (int i=0; i<label_idx; i++) {
  277. if (jit_labels[i].name) {
  278. //printf("find_label %s label vs %s\r\n",label,jit_labels[i].name);
  279. }
  280. if (jit_labels[i].name && (strcmp(jit_labels[i].name,label)==0)) {
  281. return &jit_labels[i];
  282. }
  283. }
  284. return NULL;
  285. }
  286. Label* find_unresolved_label(char* label) {
  287. for (int i=0; i<unres_labels; i++) {
  288. if (jit_labels_unres[i].name) {
  289. //printf("find_unres_label %s label vs %s\r\n",label,jit_labels_unres[i].name);
  290. }
  291. if (jit_labels_unres[i].name && (strcmp(jit_labels_unres[i].name,label)==0)) {
  292. return &jit_labels_unres[i];
  293. }
  294. }
  295. return NULL;
  296. }
  297. void jit_emit_branch(uint32_t op, char* label) {
  298. Label* lbl = find_label(label);
  299. if (lbl) {
  300. int offset = (lbl->idx - code_idx) - 2;
  301. //printf("offset to %s: %d (*4)\r\n",label,offset);
  302. if (offset<0) {
  303. offset = 0x1000000-(-offset);
  304. op|=offset;
  305. code[code_idx++] = op;
  306. }
  307. } else {
  308. //printf("! label not found %s, adding unresolved.\r\n",label);
  309. jit_labels_unres[unres_labels].name = strdup(label);
  310. jit_labels_unres[unres_labels].idx = code_idx;
  311. code[code_idx++] = op;
  312. unres_labels++;
  313. }
  314. }
  315. void jit_je(char* label) {
  316. uint32_t op = 0x0a000000; // beq
  317. jit_emit_branch(op, label);
  318. }
  319. void jit_jge(char* label) {
  320. uint32_t op = 0xaa000000; // bge
  321. jit_emit_branch(op, label);
  322. }
  323. void jit_jne(char* label) {
  324. uint32_t op = 0x1a000000; // bne
  325. jit_emit_branch(op, label);
  326. }
  327. void jit_jneg(char* label) {
  328. uint32_t op = 0x4a000000; // bmi
  329. jit_emit_branch(op, label);
  330. }
  331. void jit_jmp(char* label) {
  332. //printf("jmp to label: %s\r\n",label);
  333. uint32_t op = 0xea000000; // b
  334. jit_emit_branch(op, label);
  335. }
  336. void jit_label(char* label) {
  337. jit_labels[label_idx].name = strdup(label);
  338. jit_labels[label_idx].idx = code_idx;
  339. Label* unres_lbl = NULL;
  340. while ((unres_lbl = find_unresolved_label(label))) {
  341. //printf("! forward label to %s at idx %d resolved.\r\n",label,unres_lbl->idx);
  342. code[unres_lbl->idx] |= (code_idx - unres_lbl->idx) - 2;
  343. free(unres_lbl->name);
  344. unres_lbl->name = NULL;
  345. unres_lbl->idx = 0;
  346. }
  347. label_idx++;
  348. }
  349. void jit_ret() {
  350. jit_movr(15,14); // lr -> pc
  351. }
  352. void jit_push(int r1, int r2) {
  353. uint32_t op = 0xe92d0000;
  354. for (int i=r1; i<=r2; i++) {
  355. op |= (1<<i); // build bit pattern of registers to push
  356. }
  357. code[code_idx++] = op;
  358. }
  359. void jit_pop(int r1, int r2) {
  360. uint32_t op = 0xe8bd0000;
  361. for (int i=r1; i<=r2; i++) {
  362. op |= (1<<i); // build bit pattern of registers to pop
  363. }
  364. code[code_idx++] = op;
  365. }
  366. // do any needed stack alignment etc. here for host ABI
  367. void jit_host_call_enter() {
  368. }
  369. void jit_host_call_exit() {
  370. }
  371. void jit_comment(char* comment) {
  372. }
  373. void debug_handler() {
  374. // NYI
  375. }