objint_longlong.c 9.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282
  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. * Copyright (c) 2014 Paul Sokolovsky
  8. *
  9. * Permission is hereby granted, free of charge, to any person obtaining a copy
  10. * of this software and associated documentation files (the "Software"), to deal
  11. * in the Software without restriction, including without limitation the rights
  12. * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
  13. * copies of the Software, and to permit persons to whom the Software is
  14. * furnished to do so, subject to the following conditions:
  15. *
  16. * The above copyright notice and this permission notice shall be included in
  17. * all copies or substantial portions of the Software.
  18. *
  19. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  20. * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  21. * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  22. * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  23. * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
  24. * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
  25. * THE SOFTWARE.
  26. */
  27. #include <stdlib.h>
  28. #include <string.h>
  29. #include "py/smallint.h"
  30. #include "py/objint.h"
  31. #include "py/runtime.h"
  32. #if MICROPY_PY_BUILTINS_FLOAT
  33. #include <math.h>
  34. #endif
  35. #if MICROPY_LONGINT_IMPL == MICROPY_LONGINT_IMPL_LONGLONG
  36. #if MICROPY_PY_SYS_MAXSIZE
  37. // Export value for sys.maxsize
  38. const mp_obj_int_t mp_maxsize_obj = {{&mp_type_int}, MP_SSIZE_MAX};
  39. #endif
  40. mp_obj_t mp_obj_int_from_bytes_impl(bool big_endian, size_t len, const byte *buf) {
  41. int delta = 1;
  42. if (!big_endian) {
  43. buf += len - 1;
  44. delta = -1;
  45. }
  46. mp_longint_impl_t value = 0;
  47. for (; len--; buf += delta) {
  48. value = (value << 8) | *buf;
  49. }
  50. return mp_obj_new_int_from_ll(value);
  51. }
  52. void mp_obj_int_to_bytes_impl(mp_obj_t self_in, bool big_endian, size_t len, byte *buf) {
  53. assert(MP_OBJ_IS_TYPE(self_in, &mp_type_int));
  54. mp_obj_int_t *self = self_in;
  55. long long val = self->val;
  56. if (big_endian) {
  57. byte *b = buf + len;
  58. while (b > buf) {
  59. *--b = val;
  60. val >>= 8;
  61. }
  62. } else {
  63. for (; len > 0; --len) {
  64. *buf++ = val;
  65. val >>= 8;
  66. }
  67. }
  68. }
  69. int mp_obj_int_sign(mp_obj_t self_in) {
  70. mp_longint_impl_t val;
  71. if (MP_OBJ_IS_SMALL_INT(self_in)) {
  72. val = MP_OBJ_SMALL_INT_VALUE(self_in);
  73. } else {
  74. mp_obj_int_t *self = self_in;
  75. val = self->val;
  76. }
  77. if (val < 0) {
  78. return -1;
  79. } else if (val > 0) {
  80. return 1;
  81. } else {
  82. return 0;
  83. }
  84. }
  85. mp_obj_t mp_obj_int_unary_op(mp_unary_op_t op, mp_obj_t o_in) {
  86. mp_obj_int_t *o = o_in;
  87. switch (op) {
  88. case MP_UNARY_OP_BOOL: return mp_obj_new_bool(o->val != 0);
  89. // truncate value to fit in mp_int_t, which gives the same hash as
  90. // small int if the value fits without truncation
  91. case MP_UNARY_OP_HASH: return MP_OBJ_NEW_SMALL_INT((mp_int_t)o->val);
  92. case MP_UNARY_OP_POSITIVE: return o_in;
  93. case MP_UNARY_OP_NEGATIVE: return mp_obj_new_int_from_ll(-o->val);
  94. case MP_UNARY_OP_INVERT: return mp_obj_new_int_from_ll(~o->val);
  95. case MP_UNARY_OP_ABS: {
  96. mp_obj_int_t *self = MP_OBJ_TO_PTR(o_in);
  97. if (self->val >= 0) {
  98. return o_in;
  99. }
  100. self = mp_obj_new_int_from_ll(self->val);
  101. // TODO could overflow long long
  102. self->val = -self->val;
  103. return MP_OBJ_FROM_PTR(self);
  104. }
  105. default: return MP_OBJ_NULL; // op not supported
  106. }
  107. }
  108. mp_obj_t mp_obj_int_binary_op(mp_binary_op_t op, mp_obj_t lhs_in, mp_obj_t rhs_in) {
  109. long long lhs_val;
  110. long long rhs_val;
  111. if (MP_OBJ_IS_SMALL_INT(lhs_in)) {
  112. lhs_val = MP_OBJ_SMALL_INT_VALUE(lhs_in);
  113. } else if (MP_OBJ_IS_TYPE(lhs_in, &mp_type_int)) {
  114. lhs_val = ((mp_obj_int_t*)lhs_in)->val;
  115. } else {
  116. return MP_OBJ_NULL; // op not supported
  117. }
  118. if (MP_OBJ_IS_SMALL_INT(rhs_in)) {
  119. rhs_val = MP_OBJ_SMALL_INT_VALUE(rhs_in);
  120. } else if (MP_OBJ_IS_TYPE(rhs_in, &mp_type_int)) {
  121. rhs_val = ((mp_obj_int_t*)rhs_in)->val;
  122. } else {
  123. // delegate to generic function to check for extra cases
  124. return mp_obj_int_binary_op_extra_cases(op, lhs_in, rhs_in);
  125. }
  126. switch (op) {
  127. case MP_BINARY_OP_ADD:
  128. case MP_BINARY_OP_INPLACE_ADD:
  129. return mp_obj_new_int_from_ll(lhs_val + rhs_val);
  130. case MP_BINARY_OP_SUBTRACT:
  131. case MP_BINARY_OP_INPLACE_SUBTRACT:
  132. return mp_obj_new_int_from_ll(lhs_val - rhs_val);
  133. case MP_BINARY_OP_MULTIPLY:
  134. case MP_BINARY_OP_INPLACE_MULTIPLY:
  135. return mp_obj_new_int_from_ll(lhs_val * rhs_val);
  136. case MP_BINARY_OP_FLOOR_DIVIDE:
  137. case MP_BINARY_OP_INPLACE_FLOOR_DIVIDE:
  138. return mp_obj_new_int_from_ll(lhs_val / rhs_val);
  139. case MP_BINARY_OP_MODULO:
  140. case MP_BINARY_OP_INPLACE_MODULO:
  141. return mp_obj_new_int_from_ll(lhs_val % rhs_val);
  142. case MP_BINARY_OP_AND:
  143. case MP_BINARY_OP_INPLACE_AND:
  144. return mp_obj_new_int_from_ll(lhs_val & rhs_val);
  145. case MP_BINARY_OP_OR:
  146. case MP_BINARY_OP_INPLACE_OR:
  147. return mp_obj_new_int_from_ll(lhs_val | rhs_val);
  148. case MP_BINARY_OP_XOR:
  149. case MP_BINARY_OP_INPLACE_XOR:
  150. return mp_obj_new_int_from_ll(lhs_val ^ rhs_val);
  151. case MP_BINARY_OP_LSHIFT:
  152. case MP_BINARY_OP_INPLACE_LSHIFT:
  153. return mp_obj_new_int_from_ll(lhs_val << (int)rhs_val);
  154. case MP_BINARY_OP_RSHIFT:
  155. case MP_BINARY_OP_INPLACE_RSHIFT:
  156. return mp_obj_new_int_from_ll(lhs_val >> (int)rhs_val);
  157. case MP_BINARY_OP_POWER:
  158. case MP_BINARY_OP_INPLACE_POWER: {
  159. if (rhs_val < 0) {
  160. #if MICROPY_PY_BUILTINS_FLOAT
  161. return mp_obj_float_binary_op(op, lhs_val, rhs_in);
  162. #else
  163. mp_raise_ValueError("negative power with no float support");
  164. #endif
  165. }
  166. long long ans = 1;
  167. while (rhs_val > 0) {
  168. if (rhs_val & 1) {
  169. ans *= lhs_val;
  170. }
  171. if (rhs_val == 1) {
  172. break;
  173. }
  174. rhs_val /= 2;
  175. lhs_val *= lhs_val;
  176. }
  177. return mp_obj_new_int_from_ll(ans);
  178. }
  179. case MP_BINARY_OP_LESS:
  180. return mp_obj_new_bool(lhs_val < rhs_val);
  181. case MP_BINARY_OP_MORE:
  182. return mp_obj_new_bool(lhs_val > rhs_val);
  183. case MP_BINARY_OP_LESS_EQUAL:
  184. return mp_obj_new_bool(lhs_val <= rhs_val);
  185. case MP_BINARY_OP_MORE_EQUAL:
  186. return mp_obj_new_bool(lhs_val >= rhs_val);
  187. case MP_BINARY_OP_EQUAL:
  188. return mp_obj_new_bool(lhs_val == rhs_val);
  189. default:
  190. return MP_OBJ_NULL; // op not supported
  191. }
  192. }
  193. mp_obj_t mp_obj_new_int(mp_int_t value) {
  194. if (MP_SMALL_INT_FITS(value)) {
  195. return MP_OBJ_NEW_SMALL_INT(value);
  196. }
  197. return mp_obj_new_int_from_ll(value);
  198. }
  199. mp_obj_t mp_obj_new_int_from_uint(mp_uint_t value) {
  200. // SMALL_INT accepts only signed numbers, so make sure the input
  201. // value fits completely in the small-int positive range.
  202. if ((value & ~MP_SMALL_INT_POSITIVE_MASK) == 0) {
  203. return MP_OBJ_NEW_SMALL_INT(value);
  204. }
  205. return mp_obj_new_int_from_ll(value);
  206. }
  207. mp_obj_t mp_obj_new_int_from_ll(long long val) {
  208. mp_obj_int_t *o = m_new_obj(mp_obj_int_t);
  209. o->base.type = &mp_type_int;
  210. o->val = val;
  211. return o;
  212. }
  213. mp_obj_t mp_obj_new_int_from_ull(unsigned long long val) {
  214. // TODO raise an exception if the unsigned long long won't fit
  215. if (val >> (sizeof(unsigned long long) * 8 - 1) != 0) {
  216. mp_raise_msg(&mp_type_OverflowError, "ulonglong too large");
  217. }
  218. mp_obj_int_t *o = m_new_obj(mp_obj_int_t);
  219. o->base.type = &mp_type_int;
  220. o->val = val;
  221. return o;
  222. }
  223. mp_obj_t mp_obj_new_int_from_str_len(const char **str, size_t len, bool neg, unsigned int base) {
  224. // TODO this does not honor the given length of the string, but it all cases it should anyway be null terminated
  225. // TODO check overflow
  226. mp_obj_int_t *o = m_new_obj(mp_obj_int_t);
  227. o->base.type = &mp_type_int;
  228. char *endptr;
  229. o->val = strtoll(*str, &endptr, base);
  230. *str = endptr;
  231. return o;
  232. }
  233. mp_int_t mp_obj_int_get_truncated(mp_const_obj_t self_in) {
  234. if (MP_OBJ_IS_SMALL_INT(self_in)) {
  235. return MP_OBJ_SMALL_INT_VALUE(self_in);
  236. } else {
  237. const mp_obj_int_t *self = self_in;
  238. return self->val;
  239. }
  240. }
  241. mp_int_t mp_obj_int_get_checked(mp_const_obj_t self_in) {
  242. // TODO: Check overflow
  243. return mp_obj_int_get_truncated(self_in);
  244. }
  245. #if MICROPY_PY_BUILTINS_FLOAT
  246. mp_float_t mp_obj_int_as_float_impl(mp_obj_t self_in) {
  247. assert(MP_OBJ_IS_TYPE(self_in, &mp_type_int));
  248. mp_obj_int_t *self = self_in;
  249. return self->val;
  250. }
  251. #endif
  252. #endif