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 9.2KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465
  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_compile(rpn_expr_t *expr, const char *code)
  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. expr->expr = strdup(code);
  66. if(!expr->expr)
  67. {
  68. snprintf(expr->err_reason, 128,
  69. "Unable to strdup expression : %s", strerror(errno));
  70. expr->state = RPN_ERROR;
  71. return -1;
  72. }
  73. return _rpn_expr_compile_expr(expr);
  74. }
  75. int rpn_expr_untokenize(rpn_expr_t *expr, rpn_tokenized_t *tokens, char long_op)
  76. {
  77. int err;
  78. size_t i;
  79. errno = 0;
  80. #ifdef DEBUG
  81. if(!expr)
  82. {
  83. dprintf(2, "Error, NULL ptr given as expression to rpn_expr_untokenize");
  84. err = EINVAL;
  85. goto ret_err;
  86. }
  87. if(tokens->argc != expr->args_count)
  88. {
  89. /* even if it should work with tokens->argc < expr->args_count */
  90. snprintf(expr->err_reason, 128,
  91. "Expression argc differ from tokenized version");
  92. err = EINVAL;
  93. goto ret_err;
  94. }
  95. #endif
  96. if(!(expr->expr = rpn_tokenized_expr(tokens, long_op)))
  97. {
  98. err = errno;
  99. snprintf(expr->err_reason, 128,
  100. "Error reading tokenized expression : %s",
  101. strerror(err));
  102. goto ret_err;
  103. }
  104. for(i=0; i<tokens->tokens_sz; i++)
  105. {
  106. if(_rpn_expr_token_copy(expr, &(tokens->tokens[i])) < 0)
  107. {
  108. err = errno;
  109. if(errno == EINVAL)
  110. {
  111. dprintf(2,
  112. "Fatal error, unknown token type : %d.\nMemory corruption ?\n",
  113. tokens->tokens[i].type);
  114. exit(1);
  115. }
  116. snprintf(expr->err_reason, 128,
  117. "Untokenize error : %s",
  118. strerror(err));
  119. goto ret_err;
  120. }
  121. }
  122. return 0;
  123. ret_err:
  124. errno = err;
  125. return -1;
  126. }
  127. char* rpn_random(size_t op_sz, size_t args_count)
  128. {
  129. double step;
  130. size_t i, buff_sz, offset, rnd;
  131. char *buff, *cur;
  132. unsigned char op_n;
  133. unsigned long int seed, rnd_val;
  134. int nchr, err;
  135. buff_sz = offset = 0;
  136. buff = NULL;
  137. step = 1.0 / (rpn_op_sz() + (args_count>0?2:1)); // + args and values
  138. if(getrandom(&seed, sizeof(long int), 0) < 0)
  139. {
  140. err=errno;
  141. perror("Fails to get a random number from kernel");
  142. errno=err;
  143. return NULL;
  144. }
  145. srand48(seed);
  146. for(i=0; i<op_sz; i++)
  147. {
  148. if(buff_sz - offset < 21)
  149. {
  150. buff_sz += 40;
  151. cur = realloc(buff, sizeof(char) * buff_sz);
  152. if(!cur)
  153. {
  154. err=errno;
  155. perror("Error allocating random expression");
  156. errno=err;
  157. return NULL;
  158. }
  159. buff=cur;
  160. }
  161. cur = buff + offset;
  162. *cur = '\0';
  163. op_n = drand48() / step;
  164. if(op_n < rpn_op_sz())
  165. {
  166. cur[0] = rpn_ops[op_n].chr;
  167. cur[1] = ' ';
  168. cur[2] = '\0';
  169. offset += 2;
  170. }
  171. else if(op_n == rpn_op_sz())
  172. {
  173. if(getrandom(&rnd_val, sizeof(long int), 0) < 0)
  174. {
  175. err=errno;
  176. perror("Fails to get a random number for value");
  177. errno=err;
  178. return NULL;
  179. }
  180. // values
  181. if((nchr = sprintf(cur, "0x%lX ", rnd_val)) < 0)
  182. {
  183. err=errno;
  184. perror("Error while sprintf arguments in random generator");
  185. errno=err;
  186. return NULL;
  187. }
  188. offset += nchr;
  189. }
  190. else
  191. {
  192. rnd = drand48() / (1.0 / args_count);
  193. // arguments
  194. if((nchr = sprintf(cur, "A%ld ", rnd)) < 0)
  195. {
  196. err=errno;
  197. perror("Error while sprintf arguments in random generator");
  198. errno=err;
  199. return NULL;
  200. }
  201. offset += nchr;
  202. }
  203. }
  204. buff[offset] = '\0';
  205. return buff;
  206. }
  207. int _rpn_expr_compile_expr(rpn_expr_t* expr)
  208. {
  209. rpn_tokenizer_t tokenizer;
  210. rpn_token_t *token;
  211. if(expr->state == RPN_ERROR)
  212. {
  213. goto err;
  214. }
  215. if(rpn_tokenizer_start(&tokenizer, &(expr->toks), expr->expr,
  216. expr->args_count) < 0)
  217. {
  218. snprintf(expr->err_reason, 128,
  219. "Error starting tokenizer : %s",
  220. tokenizer.err_reason);
  221. goto err;
  222. }
  223. while((token = rpn_tok(&tokenizer)))
  224. {
  225. if(_rpn_expr_token_copy(expr, token) < 0)
  226. {
  227. if(errno == EINVAL)
  228. {
  229. dprintf(2,
  230. "Fatal error, unknown token type : %d chr %ld.\nMemory corruption ?\n",
  231. token->type, tokenizer.chr_no);
  232. exit(1);
  233. }
  234. snprintf(expr->err_reason, 128,
  235. "Compilation error on chr %ld, unable to copy code part : %s",
  236. tokenizer.chr_no, strerror(errno));
  237. goto err;
  238. }
  239. }
  240. if(rpn_tokenizer_error(&tokenizer))
  241. {
  242. snprintf(expr->err_reason, 128,
  243. "Compilation error, chr %ld : %s",
  244. tokenizer.chr_no, tokenizer.err_reason);
  245. goto err;
  246. }
  247. if(_rpn_expr_end_map(expr))
  248. {
  249. snprintf(expr->err_reason, 128,
  250. "Error ending code map : %s",
  251. strerror(errno));
  252. expr->state = RPN_ERROR;
  253. return -1;
  254. }
  255. expr->state = RPN_READY;
  256. return 0;
  257. err:
  258. expr->state = RPN_ERROR;
  259. return -1;
  260. }
  261. int _rpn_expr_compile_tokens(rpn_expr_t* expr)
  262. {
  263. size_t i;
  264. rpn_token_t *token;
  265. for(i=0; i<expr->toks.tokens_sz; i++)
  266. {
  267. token = &(expr->toks.tokens[i]);
  268. if(_rpn_expr_token_copy(expr, token) < 0)
  269. {
  270. if(errno == EINVAL)
  271. {
  272. dprintf(2,
  273. "Fatal error, unknown token type : %d\nMemory corruption ?\n",
  274. token->type);
  275. exit(1);
  276. }
  277. snprintf(expr->err_reason, 128,
  278. "Compilation error, unable to copy code part : %s",
  279. strerror(errno));
  280. expr->state = RPN_ERROR;
  281. return -1;
  282. }
  283. }
  284. if(_rpn_expr_end_map(expr))
  285. {
  286. snprintf(expr->err_reason, 128,
  287. "Error ending code map : %s",
  288. strerror(errno));
  289. expr->state = RPN_ERROR;
  290. return -1;
  291. }
  292. expr->state = RPN_READY;
  293. return 0;
  294. }
  295. unsigned long rpn_expr_eval(rpn_expr_t *expr, unsigned long *args)
  296. {
  297. rpn_run_f expr_run;
  298. unsigned long int res;
  299. if(expr->state == RPN_ERROR)
  300. {
  301. return 0;
  302. }
  303. expr_run = expr->code_map;
  304. res = expr_run(expr->stack_sz, args, expr->stack);
  305. return res;
  306. }
  307. void rpn_expr_close(rpn_expr_t* expr)
  308. {
  309. if(expr->expr)
  310. {
  311. free(expr->expr);
  312. expr->expr = NULL;
  313. }
  314. if(expr->stack)
  315. {
  316. free(expr->stack);
  317. expr->stack = NULL;
  318. }
  319. if(expr->code_map)
  320. {
  321. if(munmap(expr->code_map, expr->code_map_sz))
  322. {
  323. perror("Unable to unmap code_map");
  324. }
  325. expr->code_map = NULL;
  326. }
  327. }
  328. void rpn_expr_reset_stack(rpn_expr_t *expr)
  329. {
  330. bzero(expr->stack, sizeof(unsigned long) * expr->stack_sz);
  331. }
  332. int _rpn_expr_token_copy(rpn_expr_t *expr, rpn_token_t *token)
  333. {
  334. unsigned long int *value;
  335. rpn_op_t local_op;
  336. value = NULL;
  337. switch(token->type)
  338. {
  339. case RPN_op:
  340. local_op = *(token->op);
  341. value = NULL;
  342. break;
  343. case RPN_arg:
  344. local_op.fun = &rpn_arg;
  345. local_op.fun_sz = &(CODE_SZ(rpn_arg));
  346. value = &(token->arg_n);
  347. break;
  348. case RPN_val:
  349. local_op.fun = &rpn_value;
  350. local_op.fun_sz = &(CODE_SZ(rpn_value));
  351. value = &(token->value);
  352. break;
  353. default:
  354. errno = EINVAL;
  355. return -1;
  356. }
  357. if(_rpn_code_part_cpy(expr, local_op.fun, *(local_op.fun_sz),
  358. value))
  359. {
  360. return -1;
  361. }
  362. return 0;
  363. }
  364. int _rpn_code_part_cpy(rpn_expr_t *expr, const void *code_part,
  365. unsigned long code_part_sz, const unsigned long *value)
  366. {
  367. size_t old_sz, code_sz;
  368. void *new_ptr;
  369. //printf("DEBUG _copy : %p %ld %p:%ld\n", code_part, code_part_sz, value, value?*value:0);
  370. code_sz = expr->code_map_ptr - expr->code_map;
  371. if(!expr->code_map_sz)
  372. {
  373. errno = EINVAL;
  374. return -1;
  375. }
  376. if(code_sz + code_part_sz >= expr->code_map_sz)
  377. {
  378. old_sz = expr->code_map_sz;
  379. expr->code_map_sz = (((code_sz + code_part_sz)>>9)+1)<<9;
  380. new_ptr = mremap(expr->code_map, old_sz, expr->code_map_sz,
  381. MREMAP_MAYMOVE);
  382. if(new_ptr == (void*)-1)
  383. {
  384. expr->code_map_sz = 0;
  385. return -1;
  386. }
  387. expr->code_map = new_ptr;
  388. expr->code_map_ptr = expr->code_map + code_sz;
  389. }
  390. memcpy(expr->code_map_ptr, code_part, code_part_sz);
  391. if(value)
  392. {
  393. // set 1st instruction argument
  394. *(unsigned long*)(expr->code_map_ptr + 2) = *value;
  395. }
  396. expr->code_map_ptr += code_part_sz;
  397. return 0;
  398. }
  399. int _rpn_expr_init_map(rpn_expr_t* expr)
  400. {
  401. expr->code_map_sz = RPN_MAP_CHUNK;
  402. expr->code_map = mmap(NULL, expr->code_map_sz, PROT_READ | PROT_WRITE,
  403. MAP_PRIVATE | MAP_ANONYMOUS, -1, 0);
  404. if(!expr->code_map)
  405. {
  406. return -1;
  407. }
  408. expr->code_map_ptr = expr->code_map;
  409. if(CODE_PART_CPY(expr, rpn_exec))
  410. {
  411. return -1;
  412. }
  413. return 0;
  414. }
  415. int _rpn_expr_end_map(rpn_expr_t *expr)
  416. {
  417. if(CODE_PART_CPY(expr, rpn_exec_ret))
  418. {
  419. return -1;
  420. }
  421. if(mprotect(expr->code_map, expr->code_map_ptr - expr->code_map,
  422. PROT_EXEC))
  423. {
  424. return -1;
  425. }
  426. return 0;
  427. }