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_ifs.c 2.9KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178
  1. #include "rpn_ifs.h"
  2. rpn_ifs_t* rpn_ifs_new(rpn_if_param_t *params, rpn_value_t *memmap)
  3. {
  4. rpn_ifs_t *res;
  5. int err;
  6. if(!(res = malloc(sizeof(rpn_ifs_t))))
  7. {
  8. goto error;
  9. }
  10. bzero(res, sizeof(rpn_ifs_t));
  11. memcpy(&(res->params), params, sizeof(rpn_if_param_t));
  12. if(memmap)
  13. {
  14. res->self_mem = 0;
  15. res->mem = memmap;
  16. }
  17. else
  18. {
  19. res->self_mem = 1;
  20. res->mem = mmap(NULL, params->mem_sz, PROT_READ|PROT_WRITE, MAP_ANON,
  21. -1, 0);
  22. if(res->mem == (void*)-1)
  23. {
  24. goto mmap_err;
  25. }
  26. }
  27. return res;
  28. mmap_err:
  29. err = errno;
  30. free(res);
  31. error:
  32. err = errno;
  33. errno = err;
  34. return NULL;
  35. }
  36. void rpn_ifs_free(rpn_ifs_t *rifs)
  37. {
  38. while(rifs->if_sz)
  39. {
  40. rpn_if_free(rifs->rpn_if[--(rifs->if_sz)]);
  41. }
  42. if(rifs->self_mem)
  43. {
  44. munmap(rifs->mem, rifs->params.mem_sz);
  45. }
  46. if(rifs->rpn_if)
  47. {
  48. free(rifs->rpn_if);
  49. }
  50. if(rifs->weight)
  51. {
  52. free(rifs->weight);
  53. }
  54. }
  55. size_t rpn_ifs_add_if(rpn_ifs_t *rifs, unsigned int weight)
  56. {
  57. size_t res, i, first_flat;
  58. void *tmp;
  59. res = rifs->if_sz + 1;
  60. if(!(tmp = realloc(rifs->rpn_if, sizeof(rpn_if_t*) * res)))
  61. {
  62. return 0;
  63. }
  64. rifs->rpn_if = tmp;
  65. if(!(tmp = realloc(rifs->weight, sizeof(unsigned int) * res)))
  66. {
  67. return 0;
  68. }
  69. rifs->weight = tmp;
  70. rifs->weight[rifs->if_sz] = weight;
  71. //WRONG expr ARGUMENT !!!
  72. rifs->rpn_if[rifs->if_sz] = rpn_if_new(&(rifs->params), rifs->mem);
  73. if(!rifs->rpn_if[rifs->if_sz])
  74. {
  75. return 0;
  76. }
  77. first_flat = rifs->params.rpn_sz;
  78. rifs->flat_sz += rifs->params.rpn_sz;
  79. if(!(tmp = realloc(rifs->flat_rpn, sizeof(rpn_expr_t*) * rifs->flat_sz)))
  80. {
  81. return 0;
  82. }
  83. for(i=0; i<rifs->params.rpn_sz;i++)
  84. {
  85. rifs->flat_rpn[first_flat + i] = &(rifs->rpn_if[rifs->if_sz]->rpn[i]);
  86. }
  87. rifs->if_sz++;
  88. if(rpn_ifs_weight_update(rifs) < 0)
  89. {
  90. rpn_ifs_del_if(rifs, res); // don't attempt to ceck for errors..
  91. return 0;
  92. }
  93. return res;
  94. }
  95. int rpn_ifs_del_if(rpn_ifs_t *rifs, size_t if_idx)
  96. {
  97. size_t sz_mv;
  98. #ifdef DEBUG
  99. if(if_idx >= rifs->if_sz)
  100. {
  101. dprintf(2, "Error, wrong IF index given when attempt to delete from IFS");
  102. errno = EINVAL;
  103. return -1;
  104. }
  105. #endif
  106. rpn_if_free(rifs->rpn_if[rifs->if_sz - 1]);
  107. if(if_idx < rifs->if_sz - 1)
  108. {
  109. sz_mv = rifs->if_sz - if_idx;
  110. memmove(rifs->rpn_if + if_idx, rifs->rpn_if + if_idx + 1, sz_mv);
  111. memmove(rifs->weight + if_idx, rifs->weight + if_idx + 1, sz_mv);
  112. }
  113. rifs->if_sz--;
  114. rifs->flat_sz -= rifs->params.rpn_sz;
  115. return 0;
  116. }
  117. int rpn_ifs_run(rpn_ifs_t *rifs, size_t n)
  118. {
  119. return 0;
  120. }
  121. int rpn_ifs_weight_update(rpn_ifs_t *rifs)
  122. {
  123. unsigned long int weight_sum;
  124. size_t i, j, max;
  125. rpn_if_t **proba;
  126. proba = rifs->if_proba;
  127. bzero(rifs->if_proba, sizeof(rpn_if_t*)*255);
  128. weight_sum = 0;
  129. for(i=0; i < rifs->if_sz; i++)
  130. {
  131. weight_sum += rifs->weight[i];
  132. }
  133. j=0;
  134. for(i=0; i < rifs->if_sz; i++)
  135. {
  136. max = rifs->weight[i] * 255 / weight_sum;
  137. while(max)
  138. {
  139. *proba = rifs->rpn_if[i];
  140. max--;
  141. j++;
  142. }
  143. }
  144. return 0;
  145. }
  146. rpn_expr_t **rpn_ifs_flat_rpn(rpn_ifs_t *rifs)
  147. {
  148. return NULL;
  149. }
  150. int rpn_ifs_step(rpn_ifs_t *rifs)
  151. {
  152. return 1;
  153. }