2
0

math.c 8.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396
  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. #ifdef BMX_NG
  142. BBInt64 v = bbStringToLong(value);
  143. #else
  144. BBInt64 v;
  145. bbStringToLong(value, &v);
  146. #endif
  147. return bbStringFromLong(~v);
  148. }
  149. }
  150. BBString * bmx_bitwise_not_ulongint(BBString * value, int size) {
  151. if (size == 4) {
  152. unsigned int v = bmx_string_to_uint(value);
  153. return bmx_string_from_uint(~v);
  154. } else { // 8
  155. unsigned long long v = bmx_string_to_ulong(value);
  156. return bmx_string_from_ulong(~v);
  157. }
  158. }
  159. BBString * bmx_binarymathexpr_sizet(enum binaryOps op, BBString * slhs, BBString * srhs) {
  160. size_t lhs = bmx_string_to_size_t(slhs);
  161. size_t rhs = bmx_string_to_size_t(srhs);
  162. size_t res = 0;
  163. switch (op) {
  164. case OP_MUL:
  165. res = lhs * rhs;
  166. break;
  167. case OP_DIV:
  168. res = lhs / rhs;
  169. break;
  170. case OP_MOD:
  171. res = lhs % rhs;
  172. break;
  173. case OP_SHL:
  174. res = lhs << rhs;
  175. break;
  176. case OP_SHR:
  177. case OP_SAR:
  178. res = lhs >> rhs;
  179. break;
  180. case OP_ADD:
  181. res = lhs + rhs;
  182. break;
  183. case OP_SUB:
  184. res = lhs - rhs;
  185. break;
  186. case OP_AND:
  187. res = lhs & rhs;
  188. break;
  189. case OP_XOR:
  190. res = lhs ^ rhs;
  191. break;
  192. case OP_OR:
  193. res = lhs | rhs;
  194. break;
  195. }
  196. return bmx_string_from_size_t(res);
  197. }
  198. BBString * bmx_binarymathexpr_uint(enum binaryOps op, BBString * slhs, BBString * srhs) {
  199. unsigned int lhs = bmx_string_to_uint(slhs);
  200. unsigned int rhs = bmx_string_to_uint(srhs);
  201. unsigned int res = 0;
  202. switch (op) {
  203. case OP_MUL:
  204. res = lhs * rhs;
  205. break;
  206. case OP_DIV:
  207. res = lhs / rhs;
  208. break;
  209. case OP_MOD:
  210. res = lhs % rhs;
  211. break;
  212. case OP_SHL:
  213. res = lhs << rhs;
  214. break;
  215. case OP_SHR:
  216. case OP_SAR:
  217. res = lhs >> rhs;
  218. break;
  219. case OP_ADD:
  220. res = lhs + rhs;
  221. break;
  222. case OP_SUB:
  223. res = lhs - rhs;
  224. break;
  225. case OP_AND:
  226. res = lhs & rhs;
  227. break;
  228. case OP_XOR:
  229. res = lhs ^ rhs;
  230. break;
  231. case OP_OR:
  232. res = lhs | rhs;
  233. break;
  234. }
  235. return bmx_string_from_uint(res);
  236. }
  237. BBString * bmx_binarymathexpr_ulong(enum binaryOps op, BBString * slhs, BBString * srhs) {
  238. unsigned long long lhs = bmx_string_to_ulong(slhs);
  239. unsigned long long rhs = bmx_string_to_ulong(srhs);
  240. unsigned long long res = 0;
  241. switch (op) {
  242. case OP_MUL:
  243. res = lhs * rhs;
  244. break;
  245. case OP_DIV:
  246. res = lhs / rhs;
  247. break;
  248. case OP_MOD:
  249. res = lhs % rhs;
  250. break;
  251. case OP_SHL:
  252. res = lhs << rhs;
  253. break;
  254. case OP_SHR:
  255. case OP_SAR:
  256. res = lhs >> rhs;
  257. break;
  258. case OP_ADD:
  259. res = lhs + rhs;
  260. break;
  261. case OP_SUB:
  262. res = lhs - rhs;
  263. break;
  264. case OP_AND:
  265. res = lhs & rhs;
  266. break;
  267. case OP_XOR:
  268. res = lhs ^ rhs;
  269. break;
  270. case OP_OR:
  271. res = lhs | rhs;
  272. break;
  273. }
  274. return bmx_string_from_ulong(res);
  275. }
  276. BBString * bmx_binarymathexpr_longint(enum binaryOps op, BBString * slhs, BBString * srhs, int size) {
  277. if (size == 4) {
  278. int lhs = bbStringToInt(slhs);
  279. int rhs = bbStringToInt(srhs);
  280. int res = 0;
  281. switch (op) {
  282. case OP_MUL:
  283. res = lhs * rhs;
  284. break;
  285. case OP_DIV:
  286. res = lhs / rhs;
  287. break;
  288. case OP_MOD:
  289. res = lhs % rhs;
  290. break;
  291. case OP_SHL:
  292. res = lhs << rhs;
  293. break;
  294. case OP_SHR:
  295. case OP_SAR:
  296. res = lhs >> rhs;
  297. break;
  298. case OP_ADD:
  299. res = lhs + rhs;
  300. break;
  301. case OP_SUB:
  302. res = lhs - rhs;
  303. break;
  304. case OP_AND:
  305. res = lhs & rhs;
  306. break;
  307. case OP_XOR:
  308. res = lhs ^ rhs;
  309. break;
  310. case OP_OR:
  311. res = lhs | rhs;
  312. break;
  313. }
  314. return bbStringFromInt(res);
  315. } else { // 8
  316. #ifdef BMX_NG
  317. BBInt64 lhs = bbStringToLong(slhs);
  318. BBInt64 rhs = bbStringToLong(srhs);
  319. #else
  320. BBInt64 lhs;
  321. bbStringToLong(slhs, &lhs);
  322. BBInt64 rhs;
  323. bbStringToLong(srhs, &rhs);
  324. #endif
  325. BBInt64 res = 0;
  326. switch (op) {
  327. case OP_MUL:
  328. res = lhs * rhs;
  329. break;
  330. case OP_DIV:
  331. res = lhs / rhs;
  332. break;
  333. case OP_MOD:
  334. res = lhs % rhs;
  335. break;
  336. case OP_SHL:
  337. res = lhs << rhs;
  338. break;
  339. case OP_SHR:
  340. case OP_SAR:
  341. res = lhs >> rhs;
  342. break;
  343. case OP_ADD:
  344. res = lhs + rhs;
  345. break;
  346. case OP_SUB:
  347. res = lhs - rhs;
  348. break;
  349. case OP_AND:
  350. res = lhs & rhs;
  351. break;
  352. case OP_XOR:
  353. res = lhs ^ rhs;
  354. break;
  355. case OP_OR:
  356. res = lhs | rhs;
  357. break;
  358. }
  359. return bbStringFromLong(res);
  360. }
  361. }
  362. BBString * bmx_binarymathexpr_ulongint(enum binaryOps op, BBString * slhs, BBString * srhs, int size) {
  363. if (size == 4) {
  364. return bmx_binarymathexpr_uint(op, slhs, srhs);
  365. } else { // 8
  366. return bmx_binarymathexpr_ulong(op, slhs, srhs);
  367. }
  368. }