math.c 7.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384
  1. #include <brl.mod/blitz.mod/blitz.h>
  2. enum binaryOps {
  3. OP_MUL,
  4. OP_DIV,
  5. OP_MOD,
  6. OP_SHL,
  7. OP_SHR,
  8. OP_SAR,
  9. OP_ADD,
  10. OP_SUB,
  11. OP_AND,
  12. OP_XOR,
  13. OP_OR
  14. };
  15. unsigned int bmx_string_to_uint( BBString *t ){
  16. int i=0,neg=0;
  17. unsigned n=0;
  18. while( i<t->length && isspace(t->buf[i]) ) ++i;
  19. if( i==t->length ) return 0;
  20. if( t->buf[i]=='+' ) ++i;
  21. else if( (neg = t->buf[i]=='-') ) ++i;
  22. if( i==t->length ) return 0;
  23. if( t->buf[i]=='%' ){
  24. for( ++i;i<t->length;++i ){
  25. int c=t->buf[i];
  26. if( c!='0' && c!='1' ) break;
  27. n=n*2+(c-'0');
  28. }
  29. }else if( t->buf[i]=='$' ){
  30. for( ++i;i<t->length;++i ){
  31. int c=toupper(t->buf[i]);
  32. if( !isxdigit(c) ) break;
  33. if( c>='A' ) c-=('A'-'0'-10);
  34. n=n*16+(c-'0');
  35. }
  36. }else{
  37. for( ;i<t->length;++i ){
  38. int c=t->buf[i];
  39. if( !isdigit(c) ) break;
  40. n=n*10+(c-'0');
  41. }
  42. }
  43. return neg ? -n : n;
  44. }
  45. unsigned long long bmx_string_to_ulong( BBString *t ){
  46. int i=0,neg=0;
  47. unsigned long long n=0;
  48. while( i<t->length && isspace(t->buf[i]) ) ++i;
  49. if( i==t->length ){ return 0; }
  50. if( t->buf[i]=='+' ) ++i;
  51. else if( (neg = t->buf[i]=='-') ) ++i;
  52. if( i==t->length ){ return 0; }
  53. if( t->buf[i]=='%' ){
  54. for( ++i;i<t->length;++i ){
  55. int c=t->buf[i];
  56. if( c!='0' && c!='1' ) break;
  57. n=n*2+(c-'0');
  58. }
  59. }else if( t->buf[i]=='$' ){
  60. for( ++i;i<t->length;++i ){
  61. int c=toupper(t->buf[i]);
  62. if( !isxdigit(c) ) break;
  63. if( c>='A' ) c-=('A'-'0'-10);
  64. n=n*16+(c-'0');
  65. }
  66. }else{
  67. for( ;i<t->length;++i ){
  68. int c=t->buf[i];
  69. if( !isdigit(c) ) break;
  70. n=n*10+(c-'0');
  71. }
  72. }
  73. return neg ? -n : n;
  74. }
  75. size_t bmx_string_to_size_t( BBString *t ){
  76. int i=0,neg=0;
  77. size_t n=0;
  78. while( i<t->length && isspace(t->buf[i]) ) ++i;
  79. if( i==t->length ){ return 0; }
  80. if( t->buf[i]=='+' ) ++i;
  81. else if( (neg=(t->buf[i]=='-')) ) ++i;
  82. if( i==t->length ){ return 0; }
  83. if( t->buf[i]=='%' ){
  84. for( ++i;i<t->length;++i ){
  85. int c=t->buf[i];
  86. if( c!='0' && c!='1' ) break;
  87. n=n*2+(c-'0');
  88. }
  89. }else if( t->buf[i]=='$' ){
  90. for( ++i;i<t->length;++i ){
  91. int c=toupper(t->buf[i]);
  92. if( !isxdigit(c) ) break;
  93. if( c>='A' ) c-=('A'-'0'-10);
  94. n=n*16+(c-'0');
  95. }
  96. }else{
  97. for( ;i<t->length;++i ){
  98. int c=t->buf[i];
  99. if( !isdigit(c) ) break;
  100. n=n*10+(c-'0');
  101. }
  102. }
  103. return neg ? -n : n;
  104. }
  105. BBString *bmx_string_from_uint( unsigned int n ){
  106. char buf[64];
  107. sprintf(buf, "%u", n);
  108. return bbStringFromBytes( (unsigned char*)buf, strlen(buf) );
  109. }
  110. BBString *bmx_string_from_ulong( unsigned long long n ){
  111. char buf[64];
  112. sprintf(buf, "%llu", n);
  113. return bbStringFromBytes( (unsigned char*)buf, strlen(buf) );
  114. }
  115. BBString *bmx_string_from_size_t( size_t n ){
  116. char buf[64];
  117. #if UINTPTR_MAX == 0xffffffff
  118. sprintf(buf, "%u", n);
  119. #else
  120. sprintf(buf, "%llu", n);
  121. #endif
  122. return bbStringFromBytes( (unsigned char*)buf, strlen(buf) );
  123. }
  124. BBString * bmx_bitwise_not_uint(BBString * value) {
  125. unsigned int v = bmx_string_to_uint(value);
  126. return bmx_string_from_uint(~v);
  127. }
  128. BBString * bmx_bitwise_not_sizet(BBString * value) {
  129. size_t v = bmx_string_to_size_t(value);
  130. return bmx_string_from_size_t(~v);
  131. }
  132. BBString * bmx_bitwise_not_ulong(BBString * value) {
  133. unsigned long long v = bmx_string_to_ulong(value);
  134. return bmx_string_from_ulong(~v);
  135. }
  136. BBString * bmx_bitwise_not_longint(BBString * value, int size) {
  137. if (size == 4) {
  138. int v = bbStringToInt(value);
  139. return bbStringFromInt(~v);
  140. } else { // 8
  141. BBInt64 v = bbStringToLong(value);
  142. return bbStringFromLong(~v);
  143. }
  144. }
  145. BBString * bmx_bitwise_not_ulongint(BBString * value, int size) {
  146. if (size == 4) {
  147. unsigned int v = bmx_string_to_uint(value);
  148. return bmx_string_from_uint(~v);
  149. } else { // 8
  150. unsigned long long v = bmx_string_to_ulong(value);
  151. return bmx_string_from_ulong(~v);
  152. }
  153. }
  154. BBString * bmx_binarymathexpr_sizet(enum binaryOps op, BBString * slhs, BBString * srhs) {
  155. size_t lhs = bmx_string_to_size_t(slhs);
  156. size_t rhs = bmx_string_to_size_t(srhs);
  157. size_t res = 0;
  158. switch (op) {
  159. case OP_MUL:
  160. res = lhs * rhs;
  161. break;
  162. case OP_DIV:
  163. res = lhs / rhs;
  164. break;
  165. case OP_MOD:
  166. res = lhs % rhs;
  167. break;
  168. case OP_SHL:
  169. res = lhs << rhs;
  170. break;
  171. case OP_SHR:
  172. case OP_SAR:
  173. res = lhs >> rhs;
  174. break;
  175. case OP_ADD:
  176. res = lhs + rhs;
  177. break;
  178. case OP_SUB:
  179. res = lhs - rhs;
  180. break;
  181. case OP_AND:
  182. res = lhs & rhs;
  183. break;
  184. case OP_XOR:
  185. res = lhs ^ rhs;
  186. break;
  187. case OP_OR:
  188. res = lhs | rhs;
  189. break;
  190. }
  191. return bmx_string_from_size_t(res);
  192. }
  193. BBString * bmx_binarymathexpr_uint(enum binaryOps op, BBString * slhs, BBString * srhs) {
  194. unsigned int lhs = bmx_string_to_uint(slhs);
  195. unsigned int rhs = bmx_string_to_uint(srhs);
  196. unsigned int res = 0;
  197. switch (op) {
  198. case OP_MUL:
  199. res = lhs * rhs;
  200. break;
  201. case OP_DIV:
  202. res = lhs / rhs;
  203. break;
  204. case OP_MOD:
  205. res = lhs % rhs;
  206. break;
  207. case OP_SHL:
  208. res = lhs << rhs;
  209. break;
  210. case OP_SHR:
  211. case OP_SAR:
  212. res = lhs >> rhs;
  213. break;
  214. case OP_ADD:
  215. res = lhs + rhs;
  216. break;
  217. case OP_SUB:
  218. res = lhs - rhs;
  219. break;
  220. case OP_AND:
  221. res = lhs & rhs;
  222. break;
  223. case OP_XOR:
  224. res = lhs ^ rhs;
  225. break;
  226. case OP_OR:
  227. res = lhs | rhs;
  228. break;
  229. }
  230. return bmx_string_from_uint(res);
  231. }
  232. BBString * bmx_binarymathexpr_ulong(enum binaryOps op, BBString * slhs, BBString * srhs) {
  233. unsigned long long lhs = bmx_string_to_ulong(slhs);
  234. unsigned long long rhs = bmx_string_to_ulong(srhs);
  235. unsigned long long res = 0;
  236. switch (op) {
  237. case OP_MUL:
  238. res = lhs * rhs;
  239. break;
  240. case OP_DIV:
  241. res = lhs / rhs;
  242. break;
  243. case OP_MOD:
  244. res = lhs % rhs;
  245. break;
  246. case OP_SHL:
  247. res = lhs << rhs;
  248. break;
  249. case OP_SHR:
  250. case OP_SAR:
  251. res = lhs >> rhs;
  252. break;
  253. case OP_ADD:
  254. res = lhs + rhs;
  255. break;
  256. case OP_SUB:
  257. res = lhs - rhs;
  258. break;
  259. case OP_AND:
  260. res = lhs & rhs;
  261. break;
  262. case OP_XOR:
  263. res = lhs ^ rhs;
  264. break;
  265. case OP_OR:
  266. res = lhs | rhs;
  267. break;
  268. }
  269. return bmx_string_from_ulong(res);
  270. }
  271. BBString * bmx_binarymathexpr_longint(enum binaryOps op, BBString * slhs, BBString * srhs, int size) {
  272. if (size == 4) {
  273. int lhs = bbStringToInt(slhs);
  274. int rhs = bbStringToInt(srhs);
  275. int res = 0;
  276. switch (op) {
  277. case OP_MUL:
  278. res = lhs * rhs;
  279. break;
  280. case OP_DIV:
  281. res = lhs / rhs;
  282. break;
  283. case OP_MOD:
  284. res = lhs % rhs;
  285. break;
  286. case OP_SHL:
  287. res = lhs << rhs;
  288. break;
  289. case OP_SHR:
  290. case OP_SAR:
  291. res = lhs >> rhs;
  292. break;
  293. case OP_ADD:
  294. res = lhs + rhs;
  295. break;
  296. case OP_SUB:
  297. res = lhs - rhs;
  298. break;
  299. case OP_AND:
  300. res = lhs & rhs;
  301. break;
  302. case OP_XOR:
  303. res = lhs ^ rhs;
  304. break;
  305. case OP_OR:
  306. res = lhs | rhs;
  307. break;
  308. }
  309. return bbStringFromInt(res);
  310. } else { // 8
  311. BBInt64 lhs = bbStringToLong(slhs);
  312. BBInt64 rhs = bbStringToLong(srhs);
  313. BBInt64 res = 0;
  314. switch (op) {
  315. case OP_MUL:
  316. res = lhs * rhs;
  317. break;
  318. case OP_DIV:
  319. res = lhs / rhs;
  320. break;
  321. case OP_MOD:
  322. res = lhs % rhs;
  323. break;
  324. case OP_SHL:
  325. res = lhs << rhs;
  326. break;
  327. case OP_SHR:
  328. case OP_SAR:
  329. res = lhs >> rhs;
  330. break;
  331. case OP_ADD:
  332. res = lhs + rhs;
  333. break;
  334. case OP_SUB:
  335. res = lhs - rhs;
  336. break;
  337. case OP_AND:
  338. res = lhs & rhs;
  339. break;
  340. case OP_XOR:
  341. res = lhs ^ rhs;
  342. break;
  343. case OP_OR:
  344. res = lhs | rhs;
  345. break;
  346. }
  347. return bbStringFromLong(res);
  348. }
  349. }
  350. BBString * bmx_binarymathexpr_ulongint(enum binaryOps op, BBString * slhs, BBString * srhs, int size) {
  351. if (size == 4) {
  352. return bmx_binarymathexpr_uint(op, slhs, srhs);
  353. } else { // 8
  354. return bmx_binarymathexpr_ulong(op, slhs, srhs);
  355. }
  356. }