Fast IFS using RPN notation
python
c
x86-64
nasm
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

rpn_jit.c 10.0KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502
  1. /*
  2. * Copyright (C) 2020 Weber Yann
  3. *
  4. * This file is part of pyrpn.
  5. *
  6. * pyrpn is free software: you can redistribute it and/or modify
  7. * it under the terms of the GNU General Public License as published by
  8. * the Free Software Foundation, either version 3 of the License, or
  9. * any later version.
  10. *
  11. * pyrpn is distributed in the hope that it will be useful,
  12. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  13. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  14. * GNU General Public License for more details.
  15. *
  16. * You should have received a copy of the GNU General Public License
  17. * along with pyrpn. If not, see <http://www.gnu.org/licenses/>.
  18. */
  19. #include "rpn_jit.h"
  20. int rpn_expr_init(rpn_expr_t* expr, const unsigned char stack_sz,
  21. const size_t args_count)
  22. {
  23. #ifdef DEBUG
  24. if(!expr)
  25. {
  26. dprintf(2, "Error, NULL ptr given as expression to rpn_expr_init");
  27. errno = EINVAL;
  28. return -1;
  29. }
  30. #endif
  31. bzero(expr, sizeof(rpn_expr_t));
  32. expr->stack_sz = stack_sz;
  33. expr->args_count = args_count;
  34. expr->state = RPN_SOURCE;
  35. memset(expr->err_reason, (int)'\0', 128);
  36. expr->stack = malloc(sizeof(unsigned long) * stack_sz);
  37. if(!expr->stack)
  38. {
  39. snprintf(expr->err_reason, 128,
  40. "Unable to malloc stack : %s", strerror(errno));
  41. expr->state = RPN_ERROR;
  42. return -1;
  43. }
  44. bzero(expr->stack, sizeof(unsigned long) * stack_sz);
  45. if(_rpn_expr_init_map(expr) < 0)
  46. {
  47. snprintf(expr->err_reason, 128,
  48. "Unable to init code map : %s", strerror(errno));
  49. free(expr->expr);
  50. expr->state = RPN_ERROR;
  51. return -1;
  52. }
  53. return 0;
  54. }
  55. int rpn_expr_reinit(rpn_expr_t* expr)
  56. {
  57. #ifdef DEBUG
  58. if(!expr)
  59. {
  60. dprintf(2, "Error, NULL ptr given as expression to rpn_expr_compile");
  61. errno = EINVAL;
  62. return -1;
  63. }
  64. #endif
  65. bzero(expr->code_map, expr->code_map_sz);
  66. bzero(expr->stack, sizeof(unsigned long) * expr->stack_sz);
  67. if(_rpn_expr_init_map(expr) < 0)
  68. {
  69. snprintf(expr->err_reason, 128,
  70. "Unable to re-init code map : %s", strerror(errno));
  71. free(expr->expr);
  72. expr->state = RPN_ERROR;
  73. return -1;
  74. }
  75. return 0;
  76. }
  77. int rpn_expr_compile(rpn_expr_t *expr, const char *code)
  78. {
  79. #ifdef DEBUG
  80. if(!expr)
  81. {
  82. dprintf(2, "Error, NULL ptr given as expression to rpn_expr_compile");
  83. errno = EINVAL;
  84. return -1;
  85. }
  86. #endif
  87. expr->expr = strdup(code);
  88. if(!expr->expr)
  89. {
  90. snprintf(expr->err_reason, 128,
  91. "Unable to strdup expression : %s", strerror(errno));
  92. expr->state = RPN_ERROR;
  93. return -1;
  94. }
  95. return _rpn_expr_compile_expr(expr);
  96. }
  97. int rpn_expr_untokenize(rpn_expr_t *expr, rpn_tokenized_t *tokens, char long_op)
  98. {
  99. int err;
  100. size_t i;
  101. errno = 0;
  102. #ifdef DEBUG
  103. if(!expr)
  104. {
  105. dprintf(2, "Error, NULL ptr given as expression to rpn_expr_untokenize");
  106. err = EINVAL;
  107. goto ret_err;
  108. }
  109. if(tokens->argc != expr->args_count)
  110. {
  111. /* even if it should work with tokens->argc < expr->args_count */
  112. snprintf(expr->err_reason, 128,
  113. "Expression argc differ from tokenized version");
  114. err = EINVAL;
  115. goto ret_err;
  116. }
  117. #endif
  118. if(!(expr->expr = rpn_tokenized_expr(tokens, long_op)))
  119. {
  120. err = errno;
  121. snprintf(expr->err_reason, 128,
  122. "Error reading tokenized expression : %s",
  123. strerror(err));
  124. goto ret_err;
  125. }
  126. for(i=0; i<tokens->tokens_sz; i++)
  127. {
  128. if(_rpn_expr_token_copy(expr, &(tokens->tokens[i])) < 0)
  129. {
  130. err = errno;
  131. if(errno == EINVAL)
  132. {
  133. dprintf(2,
  134. "Fatal error, unknown token type : %d.\nMemory corruption ?\n",
  135. tokens->tokens[i].type);
  136. exit(1);
  137. }
  138. snprintf(expr->err_reason, 128,
  139. "Untokenize error : %s",
  140. strerror(err));
  141. goto ret_err;
  142. }
  143. }
  144. if(_rpn_expr_end_map(expr))
  145. {
  146. snprintf(expr->err_reason, 128,
  147. "Error ending code map : %s",
  148. strerror(errno));
  149. expr->state = RPN_ERROR;
  150. return -1;
  151. }
  152. expr->state = RPN_READY;
  153. return 0;
  154. ret_err:
  155. expr->state = RPN_ERROR;
  156. errno = err;
  157. return -1;
  158. }
  159. char* rpn_random(size_t op_sz, size_t args_count)
  160. {
  161. double step;
  162. size_t i, buff_sz, offset, rnd;
  163. char *buff, *cur;
  164. unsigned char op_n;
  165. unsigned long int seed, rnd_val;
  166. int nchr, err;
  167. buff_sz = offset = 0;
  168. buff = NULL;
  169. step = 1.0 / (rpn_op_sz() + (args_count>0?2:1)); // + args and values
  170. if(getrandom(&seed, sizeof(long int), 0) < 0)
  171. {
  172. err=errno;
  173. perror("Fails to get a random number from kernel");
  174. errno=err;
  175. return NULL;
  176. }
  177. srand48(seed);
  178. for(i=0; i<op_sz; i++)
  179. {
  180. if(buff_sz - offset < 21)
  181. {
  182. buff_sz += 40;
  183. cur = realloc(buff, sizeof(char) * buff_sz);
  184. if(!cur)
  185. {
  186. err=errno;
  187. perror("Error allocating random expression");
  188. errno=err;
  189. return NULL;
  190. }
  191. buff=cur;
  192. }
  193. cur = buff + offset;
  194. *cur = '\0';
  195. op_n = drand48() / step;
  196. if(op_n < rpn_op_sz())
  197. {
  198. cur[0] = rpn_ops[op_n].chr;
  199. cur[1] = ' ';
  200. cur[2] = '\0';
  201. offset += 2;
  202. }
  203. else if(op_n == rpn_op_sz())
  204. {
  205. if(getrandom(&rnd_val, sizeof(long int), 0) < 0)
  206. {
  207. err=errno;
  208. perror("Fails to get a random number for value");
  209. errno=err;
  210. return NULL;
  211. }
  212. // values
  213. if((nchr = sprintf(cur, "0x%lX ", rnd_val)) < 0)
  214. {
  215. err=errno;
  216. perror("Error while sprintf arguments in random generator");
  217. errno=err;
  218. return NULL;
  219. }
  220. offset += nchr;
  221. }
  222. else
  223. {
  224. rnd = drand48() / (1.0 / args_count);
  225. // arguments
  226. if((nchr = sprintf(cur, "A%ld ", rnd)) < 0)
  227. {
  228. err=errno;
  229. perror("Error while sprintf arguments in random generator");
  230. errno=err;
  231. return NULL;
  232. }
  233. offset += nchr;
  234. }
  235. }
  236. buff[offset] = '\0';
  237. return buff;
  238. }
  239. int _rpn_expr_compile_expr(rpn_expr_t* expr)
  240. {
  241. rpn_tokenizer_t tokenizer;
  242. rpn_token_t *token;
  243. if(expr->state == RPN_ERROR)
  244. {
  245. goto err;
  246. }
  247. if(rpn_tokenizer_start(&tokenizer, &(expr->toks), expr->expr,
  248. expr->args_count) < 0)
  249. {
  250. snprintf(expr->err_reason, 128,
  251. "Error starting tokenizer : %s",
  252. tokenizer.err_reason);
  253. goto err;
  254. }
  255. while((token = rpn_tok(&tokenizer)))
  256. {
  257. if(_rpn_expr_token_copy(expr, token) < 0)
  258. {
  259. if(errno == EINVAL)
  260. {
  261. dprintf(2,
  262. "Fatal error, unknown token type : %d chr %ld.\nMemory corruption ?\n",
  263. token->type, tokenizer.chr_no);
  264. exit(1);
  265. }
  266. snprintf(expr->err_reason, 128,
  267. "Compilation error on chr %ld, unable to copy code part : %s",
  268. tokenizer.chr_no, strerror(errno));
  269. goto err;
  270. }
  271. }
  272. if(rpn_tokenizer_error(&tokenizer))
  273. {
  274. snprintf(expr->err_reason, 128,
  275. "Compilation error, chr %ld : %s",
  276. tokenizer.chr_no, tokenizer.err_reason);
  277. goto err;
  278. }
  279. if(_rpn_expr_end_map(expr))
  280. {
  281. snprintf(expr->err_reason, 128,
  282. "Error ending code map : %s",
  283. strerror(errno));
  284. expr->state = RPN_ERROR;
  285. return -1;
  286. }
  287. expr->state = RPN_READY;
  288. return 0;
  289. err:
  290. expr->state = RPN_ERROR;
  291. return -1;
  292. }
  293. int _rpn_expr_compile_tokens(rpn_expr_t* expr)
  294. {
  295. size_t i;
  296. rpn_token_t *token;
  297. for(i=0; i<expr->toks.tokens_sz; i++)
  298. {
  299. token = &(expr->toks.tokens[i]);
  300. if(_rpn_expr_token_copy(expr, token) < 0)
  301. {
  302. if(errno == EINVAL)
  303. {
  304. dprintf(2,
  305. "Fatal error, unknown token type : %d\nMemory corruption ?\n",
  306. token->type);
  307. exit(1);
  308. }
  309. snprintf(expr->err_reason, 128,
  310. "Compilation error, unable to copy code part : %s",
  311. strerror(errno));
  312. expr->state = RPN_ERROR;
  313. return -1;
  314. }
  315. }
  316. if(_rpn_expr_end_map(expr))
  317. {
  318. snprintf(expr->err_reason, 128,
  319. "Error ending code map : %s",
  320. strerror(errno));
  321. expr->state = RPN_ERROR;
  322. return -1;
  323. }
  324. expr->state = RPN_READY;
  325. return 0;
  326. }
  327. unsigned long rpn_expr_eval(rpn_expr_t *expr, unsigned long *args)
  328. {
  329. rpn_run_f expr_run;
  330. unsigned long int res;
  331. if(expr->state == RPN_ERROR)
  332. {
  333. return 0;
  334. }
  335. expr_run = expr->code_map;
  336. res = expr_run(expr->stack_sz, args, expr->stack);
  337. return res;
  338. }
  339. void rpn_expr_close(rpn_expr_t* expr)
  340. {
  341. if(expr->expr)
  342. {
  343. free(expr->expr);
  344. expr->expr = NULL;
  345. }
  346. if(expr->stack)
  347. {
  348. free(expr->stack);
  349. expr->stack = NULL;
  350. }
  351. if(expr->code_map)
  352. {
  353. if(munmap(expr->code_map, expr->code_map_sz))
  354. {
  355. perror("Unable to unmap code_map");
  356. }
  357. expr->code_map = NULL;
  358. }
  359. }
  360. void rpn_expr_reset_stack(rpn_expr_t *expr)
  361. {
  362. bzero(expr->stack, sizeof(unsigned long) * expr->stack_sz);
  363. }
  364. int _rpn_expr_token_copy(rpn_expr_t *expr, rpn_token_t *token)
  365. {
  366. unsigned long int *value;
  367. rpn_op_t local_op;
  368. value = NULL;
  369. switch(token->type)
  370. {
  371. case RPN_op:
  372. local_op = *(token->op);
  373. value = NULL;
  374. break;
  375. case RPN_arg:
  376. local_op.fun = &rpn_arg;
  377. local_op.fun_sz = &(CODE_SZ(rpn_arg));
  378. value = &(token->arg_n);
  379. break;
  380. case RPN_val:
  381. local_op.fun = &rpn_value;
  382. local_op.fun_sz = &(CODE_SZ(rpn_value));
  383. value = &(token->value);
  384. break;
  385. default:
  386. errno = EINVAL;
  387. return -1;
  388. }
  389. if(_rpn_code_part_cpy(expr, local_op.fun, *(local_op.fun_sz),
  390. value))
  391. {
  392. return -1;
  393. }
  394. return 0;
  395. }
  396. int _rpn_code_part_cpy(rpn_expr_t *expr, const void *code_part,
  397. unsigned long code_part_sz, const unsigned long *value)
  398. {
  399. size_t old_sz, code_sz;
  400. void *new_ptr;
  401. //printf("DEBUG _copy : %p %ld %p:%ld\n", code_part, code_part_sz, value, value?*value:0);
  402. code_sz = expr->code_map_ptr - expr->code_map;
  403. if(!expr->code_map_sz)
  404. {
  405. errno = EINVAL;
  406. return -1;
  407. }
  408. if(code_sz + code_part_sz >= expr->code_map_sz)
  409. {
  410. old_sz = expr->code_map_sz;
  411. expr->code_map_sz = (((code_sz + code_part_sz)>>9)+1)<<9;
  412. new_ptr = mremap(expr->code_map, old_sz, expr->code_map_sz,
  413. MREMAP_MAYMOVE);
  414. if(new_ptr == (void*)-1)
  415. {
  416. expr->code_map_sz = 0;
  417. return -1;
  418. }
  419. expr->code_map = new_ptr;
  420. expr->code_map_ptr = expr->code_map + code_sz;
  421. }
  422. memcpy(expr->code_map_ptr, code_part, code_part_sz);
  423. if(value)
  424. {
  425. // set 1st instruction argument
  426. *(unsigned long*)(expr->code_map_ptr + 2) = *value;
  427. }
  428. expr->code_map_ptr += code_part_sz;
  429. return 0;
  430. }
  431. int _rpn_expr_init_map(rpn_expr_t* expr)
  432. {
  433. if(!expr->code_map_sz)
  434. {
  435. expr->code_map_sz = RPN_MAP_CHUNK;
  436. expr->code_map = mmap(NULL, expr->code_map_sz, PROT_READ | PROT_WRITE,
  437. MAP_PRIVATE | MAP_ANONYMOUS, -1, 0);
  438. if(!expr->code_map)
  439. {
  440. return -1;
  441. }
  442. }
  443. expr->code_map_ptr = expr->code_map;
  444. if(CODE_PART_CPY(expr, rpn_exec))
  445. {
  446. return -1;
  447. }
  448. return 0;
  449. }
  450. int _rpn_expr_end_map(rpn_expr_t *expr)
  451. {
  452. if(CODE_PART_CPY(expr, rpn_exec_ret))
  453. {
  454. return -1;
  455. }
  456. if(mprotect(expr->code_map, expr->code_map_ptr - expr->code_map,
  457. PROT_EXEC))
  458. {
  459. return -1;
  460. }
  461. return 0;
  462. }