1993-07-28 06:05:47 -03:00
|
|
|
#ifndef Py_LONGINTREPR_H
|
|
|
|
#define Py_LONGINTREPR_H
|
|
|
|
#ifdef __cplusplus
|
|
|
|
extern "C" {
|
|
|
|
#endif
|
|
|
|
|
1991-05-05 17:09:44 -03:00
|
|
|
|
1992-01-19 12:30:12 -04:00
|
|
|
/* This is published for the benefit of "friend" marshal.c only. */
|
|
|
|
|
2009-03-20 12:51:55 -03:00
|
|
|
/* Parameters of the long integer representation. There are two different
|
|
|
|
sets of parameters: one set for 30-bit digits, stored in an unsigned 32-bit
|
|
|
|
integer type, and one set for 15-bit digits with each digit stored in an
|
|
|
|
unsigned short. The value of PYLONG_BITS_IN_DIGIT, defined either at
|
|
|
|
configure time or in pyport.h, is used to decide which digit size to use.
|
1991-05-05 17:09:44 -03:00
|
|
|
|
2009-03-20 12:51:55 -03:00
|
|
|
Type 'digit' should be able to hold 2*PyLong_BASE-1, and type 'twodigits'
|
|
|
|
should be an unsigned integer type able to hold all integers up to
|
|
|
|
PyLong_BASE*PyLong_BASE-1. x_sub assumes that 'digit' is an unsigned type,
|
|
|
|
and that overflow is handled by taking the result modulo 2**N for some N >
|
|
|
|
PyLong_SHIFT. The majority of the code doesn't care about the precise
|
|
|
|
value of PyLong_SHIFT, but there are some notable exceptions:
|
|
|
|
|
|
|
|
- long_pow() requires that PyLong_SHIFT be divisible by 5
|
|
|
|
|
|
|
|
- PyLong_{As,From}ByteArray require that PyLong_SHIFT be at least 8
|
|
|
|
|
|
|
|
- long_hash() requires that PyLong_SHIFT is *strictly* less than the number
|
|
|
|
of bits in an unsigned long, as do the PyLong <-> long (or unsigned long)
|
|
|
|
conversion functions
|
|
|
|
|
|
|
|
- the long <-> size_t/Py_ssize_t conversion functions expect that
|
|
|
|
PyLong_SHIFT is strictly less than the number of bits in a size_t
|
|
|
|
|
|
|
|
- the marshal code currently expects that PyLong_SHIFT is a multiple of 15
|
|
|
|
|
|
|
|
The values 15 and 30 should fit all of the above requirements, on any
|
|
|
|
platform.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#if HAVE_STDINT_H
|
|
|
|
#include <stdint.h>
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#if PYLONG_BITS_IN_DIGIT == 30
|
|
|
|
#if !(defined HAVE_UINT64_T && defined HAVE_UINT32_T && \
|
|
|
|
defined HAVE_INT64_T && defined HAVE_INT32_T)
|
|
|
|
#error "30-bit long digits requested, but the necessary types are not available on this platform"
|
|
|
|
#endif
|
|
|
|
typedef PY_UINT32_T digit;
|
|
|
|
typedef PY_INT32_T sdigit; /* signed variant of digit */
|
|
|
|
typedef PY_UINT64_T twodigits;
|
|
|
|
typedef PY_INT64_T stwodigits; /* signed variant of twodigits */
|
|
|
|
#define PyLong_SHIFT 30
|
|
|
|
#elif PYLONG_BITS_IN_DIGIT == 15
|
1991-05-05 17:09:44 -03:00
|
|
|
typedef unsigned short digit;
|
2009-03-20 12:51:55 -03:00
|
|
|
typedef short sdigit; /* signed variant of digit */
|
|
|
|
typedef unsigned long twodigits;
|
|
|
|
typedef long stwodigits; /* signed variant of twodigits */
|
|
|
|
#define PyLong_SHIFT 15
|
|
|
|
#else
|
|
|
|
#error "PYLONG_BITS_IN_DIGIT should be 15 or 30"
|
|
|
|
#endif
|
|
|
|
#define PyLong_BASE ((digit)1 << PyLong_SHIFT)
|
|
|
|
#define PyLong_MASK ((digit)(PyLong_BASE - 1))
|
1991-05-05 17:09:44 -03:00
|
|
|
|
2008-02-25 13:32:07 -04:00
|
|
|
/* b/w compatibility with Python 2.5 */
|
|
|
|
#define SHIFT PyLong_SHIFT
|
|
|
|
#define BASE PyLong_BASE
|
|
|
|
#define MASK PyLong_MASK
|
|
|
|
|
2008-01-25 08:18:43 -04:00
|
|
|
#if PyLong_SHIFT % 5 != 0
|
2008-02-25 13:32:07 -04:00
|
|
|
#error "longobject.c requires that PyLong_SHIFT be divisible by 5"
|
SF patch 936813: fast modular exponentiation
This checkin is adapted from part 2 (of 3) of Trevor Perrin's patch set.
BACKWARD INCOMPATIBILITY: SHIFT must now be divisible by 5. AFAIK,
nobody will care. long_pow() could be complicated to worm around that,
if necessary.
long_pow():
- BUGFIX: This leaked the base and power when the power was negative
(and so the computation delegated to float pow).
- Instead of doing right-to-left exponentiation, do left-to-right. This
is more efficient for small bases, which is the common case.
- In addition, if the exponent is large (more than FIVEARY_CUTOFF
digits), precompute [a**i % c for i in range(32)], and go left to
right 5 bits at a time.
l_divmod():
- The signature changed so that callers who don't want the quotient,
or don't want the remainder, can pass NULL in the slot they don't
want. This saves them from having to declare a vrbl for unwanted
stuff, and remembering to decref it.
long_mod(), long_div(), long_classic_div():
- Adjust to new l_divmod() signature, and simplified as a result.
2004-08-29 23:44:38 -03:00
|
|
|
#endif
|
|
|
|
|
1991-05-05 17:09:44 -03:00
|
|
|
/* Long integer representation.
|
|
|
|
The absolute value of a number is equal to
|
|
|
|
SUM(for i=0 through abs(ob_size)-1) ob_digit[i] * 2**(SHIFT*i)
|
|
|
|
Negative numbers are represented with ob_size < 0;
|
|
|
|
zero is represented by ob_size == 0.
|
|
|
|
In a normalized number, ob_digit[abs(ob_size)-1] (the most significant
|
|
|
|
digit) is never zero. Also, in all cases, for all valid i,
|
|
|
|
0 <= ob_digit[i] <= MASK.
|
2000-07-16 09:04:32 -03:00
|
|
|
The allocation function takes care of allocating extra memory
|
2002-03-02 00:33:09 -04:00
|
|
|
so that ob_digit[0] ... ob_digit[abs(ob_size)-1] are actually available.
|
|
|
|
|
|
|
|
CAUTION: Generic code manipulating subtypes of PyVarObject has to
|
|
|
|
aware that longs abuse ob_size's sign bit.
|
|
|
|
*/
|
1991-05-05 17:09:44 -03:00
|
|
|
|
1992-01-19 12:30:12 -04:00
|
|
|
struct _longobject {
|
2002-03-02 00:33:09 -04:00
|
|
|
PyObject_VAR_HEAD
|
1991-05-05 17:09:44 -03:00
|
|
|
digit ob_digit[1];
|
1992-01-19 12:30:12 -04:00
|
|
|
};
|
1991-05-05 17:09:44 -03:00
|
|
|
|
2006-02-15 13:27:45 -04:00
|
|
|
PyAPI_FUNC(PyLongObject *) _PyLong_New(Py_ssize_t);
|
1993-07-28 06:05:47 -03:00
|
|
|
|
2001-09-10 17:52:51 -03:00
|
|
|
/* Return a copy of src. */
|
2002-08-12 04:21:58 -03:00
|
|
|
PyAPI_FUNC(PyObject *) _PyLong_Copy(PyLongObject *src);
|
2001-09-10 17:52:51 -03:00
|
|
|
|
1993-07-28 06:05:47 -03:00
|
|
|
#ifdef __cplusplus
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
#endif /* !Py_LONGINTREPR_H */
|