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.5KB

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