objint_mpz.c 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422
  1. /*
  2. * This file is part of the MicroPython project, http://micropython.org/
  3. *
  4. * The MIT License (MIT)
  5. *
  6. * Copyright (c) 2013, 2014 Damien P. George
  7. *
  8. * Permission is hereby granted, free of charge, to any person obtaining a copy
  9. * of this software and associated documentation files (the "Software"), to deal
  10. * in the Software without restriction, including without limitation the rights
  11. * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
  12. * copies of the Software, and to permit persons to whom the Software is
  13. * furnished to do so, subject to the following conditions:
  14. *
  15. * The above copyright notice and this permission notice shall be included in
  16. * all copies or substantial portions of the Software.
  17. *
  18. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  19. * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  20. * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  21. * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  22. * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
  23. * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
  24. * THE SOFTWARE.
  25. */
  26. #include <string.h>
  27. #include <stdio.h>
  28. #include <assert.h>
  29. #include "py/parsenumbase.h"
  30. #include "py/smallint.h"
  31. #include "py/objint.h"
  32. #include "py/runtime.h"
  33. #if MICROPY_PY_BUILTINS_FLOAT
  34. #include <math.h>
  35. #endif
  36. #if MICROPY_LONGINT_IMPL == MICROPY_LONGINT_IMPL_MPZ
  37. #if MICROPY_PY_SYS_MAXSIZE
  38. // Export value for sys.maxsize
  39. #define DIG_MASK ((MPZ_LONG_1 << MPZ_DIG_SIZE) - 1)
  40. STATIC const mpz_dig_t maxsize_dig[] = {
  41. #define NUM_DIG 1
  42. (MP_SSIZE_MAX >> MPZ_DIG_SIZE * 0) & DIG_MASK,
  43. #if (MP_SSIZE_MAX >> MPZ_DIG_SIZE * 0) > DIG_MASK
  44. #undef NUM_DIG
  45. #define NUM_DIG 2
  46. (MP_SSIZE_MAX >> MPZ_DIG_SIZE * 1) & DIG_MASK,
  47. #if (MP_SSIZE_MAX >> MPZ_DIG_SIZE * 1) > DIG_MASK
  48. #undef NUM_DIG
  49. #define NUM_DIG 3
  50. (MP_SSIZE_MAX >> MPZ_DIG_SIZE * 2) & DIG_MASK,
  51. #if (MP_SSIZE_MAX >> MPZ_DIG_SIZE * 2) > DIG_MASK
  52. #undef NUM_DIG
  53. #define NUM_DIG 4
  54. (MP_SSIZE_MAX >> MPZ_DIG_SIZE * 3) & DIG_MASK,
  55. #if (MP_SSIZE_MAX >> MPZ_DIG_SIZE * 3) > DIG_MASK
  56. #error cannot encode MP_SSIZE_MAX as mpz
  57. #endif
  58. #endif
  59. #endif
  60. #endif
  61. };
  62. const mp_obj_int_t mp_maxsize_obj = {
  63. {&mp_type_int},
  64. {.fixed_dig = 1, .len = NUM_DIG, .alloc = NUM_DIG, .dig = (mpz_dig_t*)maxsize_dig}
  65. };
  66. #undef DIG_MASK
  67. #undef NUM_DIG
  68. #endif
  69. mp_obj_int_t *mp_obj_int_new_mpz(void) {
  70. mp_obj_int_t *o = m_new_obj(mp_obj_int_t);
  71. o->base.type = &mp_type_int;
  72. mpz_init_zero(&o->mpz);
  73. return o;
  74. }
  75. // This routine expects you to pass in a buffer and size (in *buf and buf_size).
  76. // If, for some reason, this buffer is too small, then it will allocate a
  77. // buffer and return the allocated buffer and size in *buf and *buf_size. It
  78. // is the callers responsibility to free this allocated buffer.
  79. //
  80. // The resulting formatted string will be returned from this function and the
  81. // formatted size will be in *fmt_size.
  82. //
  83. // This particular routine should only be called for the mpz representation of the int.
  84. char *mp_obj_int_formatted_impl(char **buf, size_t *buf_size, size_t *fmt_size, mp_const_obj_t self_in,
  85. int base, const char *prefix, char base_char, char comma) {
  86. assert(MP_OBJ_IS_TYPE(self_in, &mp_type_int));
  87. const mp_obj_int_t *self = MP_OBJ_TO_PTR(self_in);
  88. size_t needed_size = mp_int_format_size(mpz_max_num_bits(&self->mpz), base, prefix, comma);
  89. if (needed_size > *buf_size) {
  90. *buf = m_new(char, needed_size);
  91. *buf_size = needed_size;
  92. }
  93. char *str = *buf;
  94. *fmt_size = mpz_as_str_inpl(&self->mpz, base, prefix, base_char, comma, str);
  95. return str;
  96. }
  97. mp_obj_t mp_obj_int_from_bytes_impl(bool big_endian, size_t len, const byte *buf) {
  98. mp_obj_int_t *o = mp_obj_int_new_mpz();
  99. mpz_set_from_bytes(&o->mpz, big_endian, len, buf);
  100. return MP_OBJ_FROM_PTR(o);
  101. }
  102. void mp_obj_int_to_bytes_impl(mp_obj_t self_in, bool big_endian, size_t len, byte *buf) {
  103. assert(MP_OBJ_IS_TYPE(self_in, &mp_type_int));
  104. mp_obj_int_t *self = MP_OBJ_TO_PTR(self_in);
  105. memset(buf, 0, len);
  106. mpz_as_bytes(&self->mpz, big_endian, len, buf);
  107. }
  108. int mp_obj_int_sign(mp_obj_t self_in) {
  109. if (MP_OBJ_IS_SMALL_INT(self_in)) {
  110. mp_int_t val = MP_OBJ_SMALL_INT_VALUE(self_in);
  111. if (val < 0) {
  112. return -1;
  113. } else if (val > 0) {
  114. return 1;
  115. } else {
  116. return 0;
  117. }
  118. }
  119. mp_obj_int_t *self = MP_OBJ_TO_PTR(self_in);
  120. if (self->mpz.len == 0) {
  121. return 0;
  122. } else if (self->mpz.neg == 0) {
  123. return 1;
  124. } else {
  125. return -1;
  126. }
  127. }
  128. mp_obj_t mp_obj_int_unary_op(mp_unary_op_t op, mp_obj_t o_in) {
  129. mp_obj_int_t *o = MP_OBJ_TO_PTR(o_in);
  130. switch (op) {
  131. case MP_UNARY_OP_BOOL: return mp_obj_new_bool(!mpz_is_zero(&o->mpz));
  132. case MP_UNARY_OP_HASH: return MP_OBJ_NEW_SMALL_INT(mpz_hash(&o->mpz));
  133. case MP_UNARY_OP_POSITIVE: return o_in;
  134. case MP_UNARY_OP_NEGATIVE: { mp_obj_int_t *o2 = mp_obj_int_new_mpz(); mpz_neg_inpl(&o2->mpz, &o->mpz); return MP_OBJ_FROM_PTR(o2); }
  135. case MP_UNARY_OP_INVERT: { mp_obj_int_t *o2 = mp_obj_int_new_mpz(); mpz_not_inpl(&o2->mpz, &o->mpz); return MP_OBJ_FROM_PTR(o2); }
  136. case MP_UNARY_OP_ABS: {
  137. mp_obj_int_t *self = MP_OBJ_TO_PTR(o_in);
  138. if (self->mpz.neg == 0) {
  139. return o_in;
  140. }
  141. mp_obj_int_t *self2 = mp_obj_int_new_mpz();
  142. mpz_abs_inpl(&self2->mpz, &self->mpz);
  143. return MP_OBJ_FROM_PTR(self2);
  144. }
  145. default: return MP_OBJ_NULL; // op not supported
  146. }
  147. }
  148. mp_obj_t mp_obj_int_binary_op(mp_binary_op_t op, mp_obj_t lhs_in, mp_obj_t rhs_in) {
  149. const mpz_t *zlhs;
  150. const mpz_t *zrhs;
  151. mpz_t z_int;
  152. mpz_dig_t z_int_dig[MPZ_NUM_DIG_FOR_INT];
  153. // lhs could be a small int (eg small-int + mpz)
  154. if (MP_OBJ_IS_SMALL_INT(lhs_in)) {
  155. mpz_init_fixed_from_int(&z_int, z_int_dig, MPZ_NUM_DIG_FOR_INT, MP_OBJ_SMALL_INT_VALUE(lhs_in));
  156. zlhs = &z_int;
  157. } else {
  158. assert(MP_OBJ_IS_TYPE(lhs_in, &mp_type_int));
  159. zlhs = &((mp_obj_int_t*)MP_OBJ_TO_PTR(lhs_in))->mpz;
  160. }
  161. // if rhs is small int, then lhs was not (otherwise mp_binary_op handles it)
  162. if (MP_OBJ_IS_SMALL_INT(rhs_in)) {
  163. mpz_init_fixed_from_int(&z_int, z_int_dig, MPZ_NUM_DIG_FOR_INT, MP_OBJ_SMALL_INT_VALUE(rhs_in));
  164. zrhs = &z_int;
  165. } else if (MP_OBJ_IS_TYPE(rhs_in, &mp_type_int)) {
  166. zrhs = &((mp_obj_int_t*)MP_OBJ_TO_PTR(rhs_in))->mpz;
  167. #if MICROPY_PY_BUILTINS_FLOAT
  168. } else if (mp_obj_is_float(rhs_in)) {
  169. return mp_obj_float_binary_op(op, mpz_as_float(zlhs), rhs_in);
  170. #if MICROPY_PY_BUILTINS_COMPLEX
  171. } else if (MP_OBJ_IS_TYPE(rhs_in, &mp_type_complex)) {
  172. return mp_obj_complex_binary_op(op, mpz_as_float(zlhs), 0, rhs_in);
  173. #endif
  174. #endif
  175. } else {
  176. // delegate to generic function to check for extra cases
  177. return mp_obj_int_binary_op_extra_cases(op, lhs_in, rhs_in);
  178. }
  179. if (0) {
  180. #if MICROPY_PY_BUILTINS_FLOAT
  181. } else if (op == MP_BINARY_OP_TRUE_DIVIDE || op == MP_BINARY_OP_INPLACE_TRUE_DIVIDE) {
  182. if (mpz_is_zero(zrhs)) {
  183. goto zero_division_error;
  184. }
  185. mp_float_t flhs = mpz_as_float(zlhs);
  186. mp_float_t frhs = mpz_as_float(zrhs);
  187. return mp_obj_new_float(flhs / frhs);
  188. #endif
  189. } else if (op >= MP_BINARY_OP_INPLACE_OR && op < MP_BINARY_OP_CONTAINS) {
  190. mp_obj_int_t *res = mp_obj_int_new_mpz();
  191. switch (op) {
  192. case MP_BINARY_OP_ADD:
  193. case MP_BINARY_OP_INPLACE_ADD:
  194. mpz_add_inpl(&res->mpz, zlhs, zrhs);
  195. break;
  196. case MP_BINARY_OP_SUBTRACT:
  197. case MP_BINARY_OP_INPLACE_SUBTRACT:
  198. mpz_sub_inpl(&res->mpz, zlhs, zrhs);
  199. break;
  200. case MP_BINARY_OP_MULTIPLY:
  201. case MP_BINARY_OP_INPLACE_MULTIPLY:
  202. mpz_mul_inpl(&res->mpz, zlhs, zrhs);
  203. break;
  204. case MP_BINARY_OP_FLOOR_DIVIDE:
  205. case MP_BINARY_OP_INPLACE_FLOOR_DIVIDE: {
  206. if (mpz_is_zero(zrhs)) {
  207. zero_division_error:
  208. mp_raise_msg(&mp_type_ZeroDivisionError, "division by zero");
  209. }
  210. mpz_t rem; mpz_init_zero(&rem);
  211. mpz_divmod_inpl(&res->mpz, &rem, zlhs, zrhs);
  212. mpz_deinit(&rem);
  213. break;
  214. }
  215. case MP_BINARY_OP_MODULO:
  216. case MP_BINARY_OP_INPLACE_MODULO: {
  217. if (mpz_is_zero(zrhs)) {
  218. goto zero_division_error;
  219. }
  220. mpz_t quo; mpz_init_zero(&quo);
  221. mpz_divmod_inpl(&quo, &res->mpz, zlhs, zrhs);
  222. mpz_deinit(&quo);
  223. break;
  224. }
  225. case MP_BINARY_OP_AND:
  226. case MP_BINARY_OP_INPLACE_AND:
  227. mpz_and_inpl(&res->mpz, zlhs, zrhs);
  228. break;
  229. case MP_BINARY_OP_OR:
  230. case MP_BINARY_OP_INPLACE_OR:
  231. mpz_or_inpl(&res->mpz, zlhs, zrhs);
  232. break;
  233. case MP_BINARY_OP_XOR:
  234. case MP_BINARY_OP_INPLACE_XOR:
  235. mpz_xor_inpl(&res->mpz, zlhs, zrhs);
  236. break;
  237. case MP_BINARY_OP_LSHIFT:
  238. case MP_BINARY_OP_INPLACE_LSHIFT:
  239. case MP_BINARY_OP_RSHIFT:
  240. case MP_BINARY_OP_INPLACE_RSHIFT: {
  241. mp_int_t irhs = mp_obj_int_get_checked(rhs_in);
  242. if (irhs < 0) {
  243. mp_raise_ValueError("negative shift count");
  244. }
  245. if (op == MP_BINARY_OP_LSHIFT || op == MP_BINARY_OP_INPLACE_LSHIFT) {
  246. mpz_shl_inpl(&res->mpz, zlhs, irhs);
  247. } else {
  248. mpz_shr_inpl(&res->mpz, zlhs, irhs);
  249. }
  250. break;
  251. }
  252. case MP_BINARY_OP_POWER:
  253. case MP_BINARY_OP_INPLACE_POWER:
  254. if (mpz_is_neg(zrhs)) {
  255. #if MICROPY_PY_BUILTINS_FLOAT
  256. return mp_obj_float_binary_op(op, mpz_as_float(zlhs), rhs_in);
  257. #else
  258. mp_raise_ValueError("negative power with no float support");
  259. #endif
  260. }
  261. mpz_pow_inpl(&res->mpz, zlhs, zrhs);
  262. break;
  263. default: {
  264. assert(op == MP_BINARY_OP_DIVMOD);
  265. if (mpz_is_zero(zrhs)) {
  266. goto zero_division_error;
  267. }
  268. mp_obj_int_t *quo = mp_obj_int_new_mpz();
  269. mpz_divmod_inpl(&quo->mpz, &res->mpz, zlhs, zrhs);
  270. mp_obj_t tuple[2] = {MP_OBJ_FROM_PTR(quo), MP_OBJ_FROM_PTR(res)};
  271. return mp_obj_new_tuple(2, tuple);
  272. }
  273. }
  274. return MP_OBJ_FROM_PTR(res);
  275. } else {
  276. int cmp = mpz_cmp(zlhs, zrhs);
  277. switch (op) {
  278. case MP_BINARY_OP_LESS:
  279. return mp_obj_new_bool(cmp < 0);
  280. case MP_BINARY_OP_MORE:
  281. return mp_obj_new_bool(cmp > 0);
  282. case MP_BINARY_OP_LESS_EQUAL:
  283. return mp_obj_new_bool(cmp <= 0);
  284. case MP_BINARY_OP_MORE_EQUAL:
  285. return mp_obj_new_bool(cmp >= 0);
  286. case MP_BINARY_OP_EQUAL:
  287. return mp_obj_new_bool(cmp == 0);
  288. default:
  289. return MP_OBJ_NULL; // op not supported
  290. }
  291. }
  292. }
  293. #if MICROPY_PY_BUILTINS_POW3
  294. STATIC mpz_t *mp_mpz_for_int(mp_obj_t arg, mpz_t *temp) {
  295. if (MP_OBJ_IS_SMALL_INT(arg)) {
  296. mpz_init_from_int(temp, MP_OBJ_SMALL_INT_VALUE(arg));
  297. return temp;
  298. } else {
  299. mp_obj_int_t *arp_p = MP_OBJ_TO_PTR(arg);
  300. return &(arp_p->mpz);
  301. }
  302. }
  303. mp_obj_t mp_obj_int_pow3(mp_obj_t base, mp_obj_t exponent, mp_obj_t modulus) {
  304. if (!MP_OBJ_IS_INT(base) || !MP_OBJ_IS_INT(exponent) || !MP_OBJ_IS_INT(modulus)) {
  305. mp_raise_TypeError("pow() with 3 arguments requires integers");
  306. } else {
  307. mp_obj_t result = mp_obj_new_int_from_ull(0); // Use the _from_ull version as this forces an mpz int
  308. mp_obj_int_t *res_p = (mp_obj_int_t *) MP_OBJ_TO_PTR(result);
  309. mpz_t l_temp, r_temp, m_temp;
  310. mpz_t *lhs = mp_mpz_for_int(base, &l_temp);
  311. mpz_t *rhs = mp_mpz_for_int(exponent, &r_temp);
  312. mpz_t *mod = mp_mpz_for_int(modulus, &m_temp);
  313. mpz_pow3_inpl(&(res_p->mpz), lhs, rhs, mod);
  314. if (lhs == &l_temp) { mpz_deinit(lhs); }
  315. if (rhs == &r_temp) { mpz_deinit(rhs); }
  316. if (mod == &m_temp) { mpz_deinit(mod); }
  317. return result;
  318. }
  319. }
  320. #endif
  321. mp_obj_t mp_obj_new_int(mp_int_t value) {
  322. if (MP_SMALL_INT_FITS(value)) {
  323. return MP_OBJ_NEW_SMALL_INT(value);
  324. }
  325. return mp_obj_new_int_from_ll(value);
  326. }
  327. mp_obj_t mp_obj_new_int_from_ll(long long val) {
  328. mp_obj_int_t *o = mp_obj_int_new_mpz();
  329. mpz_set_from_ll(&o->mpz, val, true);
  330. return MP_OBJ_FROM_PTR(o);
  331. }
  332. mp_obj_t mp_obj_new_int_from_ull(unsigned long long val) {
  333. mp_obj_int_t *o = mp_obj_int_new_mpz();
  334. mpz_set_from_ll(&o->mpz, val, false);
  335. return MP_OBJ_FROM_PTR(o);
  336. }
  337. mp_obj_t mp_obj_new_int_from_uint(mp_uint_t value) {
  338. // SMALL_INT accepts only signed numbers, so make sure the input
  339. // value fits completely in the small-int positive range.
  340. if ((value & ~MP_SMALL_INT_POSITIVE_MASK) == 0) {
  341. return MP_OBJ_NEW_SMALL_INT(value);
  342. }
  343. return mp_obj_new_int_from_ull(value);
  344. }
  345. mp_obj_t mp_obj_new_int_from_str_len(const char **str, size_t len, bool neg, unsigned int base) {
  346. mp_obj_int_t *o = mp_obj_int_new_mpz();
  347. size_t n = mpz_set_from_str(&o->mpz, *str, len, neg, base);
  348. *str += n;
  349. return MP_OBJ_FROM_PTR(o);
  350. }
  351. mp_int_t mp_obj_int_get_truncated(mp_const_obj_t self_in) {
  352. if (MP_OBJ_IS_SMALL_INT(self_in)) {
  353. return MP_OBJ_SMALL_INT_VALUE(self_in);
  354. } else {
  355. const mp_obj_int_t *self = MP_OBJ_TO_PTR(self_in);
  356. // hash returns actual int value if it fits in mp_int_t
  357. return mpz_hash(&self->mpz);
  358. }
  359. }
  360. mp_int_t mp_obj_int_get_checked(mp_const_obj_t self_in) {
  361. if (MP_OBJ_IS_SMALL_INT(self_in)) {
  362. return MP_OBJ_SMALL_INT_VALUE(self_in);
  363. } else {
  364. const mp_obj_int_t *self = MP_OBJ_TO_PTR(self_in);
  365. mp_int_t value;
  366. if (mpz_as_int_checked(&self->mpz, &value)) {
  367. return value;
  368. } else {
  369. // overflow
  370. mp_raise_msg(&mp_type_OverflowError, "overflow converting long int to machine word");
  371. }
  372. }
  373. }
  374. #if MICROPY_PY_BUILTINS_FLOAT
  375. mp_float_t mp_obj_int_as_float_impl(mp_obj_t self_in) {
  376. assert(MP_OBJ_IS_TYPE(self_in, &mp_type_int));
  377. mp_obj_int_t *self = MP_OBJ_TO_PTR(self_in);
  378. return mpz_as_float(&self->mpz);
  379. }
  380. #endif
  381. #endif