1 /* Include file for internal GNU MP types and definitions.
3 Copyright (C) 1991, 1993, 1994 Free Software Foundation, Inc.
5 This file is part of the GNU MP Library.
7 The GNU MP Library is free software; you can redistribute it and/or modify
8 it under the terms of the GNU Library General Public License as published by
9 the Free Software Foundation; either version 2 of the License, or (at your
10 option) any later version.
12 The GNU MP Library is distributed in the hope that it will be useful, but
13 WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
14 or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Library General Public
15 License for more details.
17 You should have received a copy of the GNU Library General Public License
18 along with the GNU MP Library; see the file COPYING.LIB. If not, write to
19 the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
21 #if ! defined (alloca)
22 #if defined (__GNUC__) || defined (__sparc__) || defined (sparc)
23 #define alloca __builtin_alloca
31 #if ! defined (__GNUC__)
32 #define inline /* Empty */
36 #define ABS(x) (x >= 0 ? x : -x)
37 #define MIN(l,o) ((l) < (o) ? (l) : (o))
38 #define MAX(h,i) ((h) > (i) ? (h) : (i))
40 #include "gmp-mparam.h"
41 /* #include "longlong.h" */
44 void *malloc (size_t);
45 void *realloc (void *, size_t);
48 extern void * (*_mp_allocate_func
) (size_t);
49 extern void * (*_mp_reallocate_func
) (void *, size_t, size_t);
50 extern void (*_mp_free_func
) (void *, size_t);
52 void *_mp_default_allocate (size_t);
53 void *_mp_default_reallocate (void *, size_t, size_t);
54 void _mp_default_free (void *, size_t);
58 #define const /* Empty */
59 #define signed /* Empty */
65 extern void * (*_mp_allocate_func
) ();
66 extern void * (*_mp_reallocate_func
) ();
67 extern void (*_mp_free_func
) ();
69 void *_mp_default_allocate ();
70 void *_mp_default_reallocate ();
71 void _mp_default_free ();
74 /* Copy NLIMBS *limbs* from SRC to DST. */
75 #define MPN_COPY_INCR(DST, SRC, NLIMBS) \
78 for (__i = 0; __i < (NLIMBS); __i++) \
79 (DST)[__i] = (SRC)[__i]; \
81 #define MPN_COPY_DECR(DST, SRC, NLIMBS) \
84 for (__i = (NLIMBS) - 1; __i >= 0; __i--) \
85 (DST)[__i] = (SRC)[__i]; \
87 #define MPN_COPY MPN_COPY_INCR
89 /* Zero NLIMBS *limbs* AT DST. */
90 #define MPN_ZERO(DST, NLIMBS) \
93 for (__i = 0; __i < (NLIMBS); __i++) \
97 #define MPN_NORMALIZE(DST, NLIMBS) \
101 if ((DST)[(NLIMBS) - 1] != 0) \
106 #define MPN_NORMALIZE_NOT_ZERO(DST, NLIMBS) \
110 if ((DST)[(NLIMBS) - 1] != 0) \
116 /* Swap (mp_ptr, mp_size_t) (U, UL) with (V, VL) */
117 #define MPN_SWAP(u, l, v, m) \
119 { mp_ptr _; _ = (u), (u) = (v), (v) = _;} \
120 { mp_size_t _; _ = (l), (l) = (m), (m) = _;} \
123 /* Return true iff the limb X has less bits than the limb Y. */
124 #define MPN_LESS_BITS_LIMB(x,y) ((x) < (y) && (x) < ((x) ^ (y)))
126 /* Return true iff (mp_ptr, mp_size_t) (U, UL) has less bits than (V, VL). */
127 #define MPN_LESS_BITS(u, l, v, m) \
129 || ((l) == (m) && (l) != 0 && MPN_LESS_BITS_LIMB ((u)[(l - 1)], (v)[(l) - 1])))
131 /* Return true iff (mp_ptr, mp_size_t) (U, UL) has more bits than (V, VL). */
132 #define MPN_MORE_BITS(u, l, v, m) MPN_LESS_BITS (v, m, u, l)
134 /* Perform twos complement on (mp_ptr, mp_size_t) (U, UL),
135 putting result at (v, VL). Precondition: U[0] != 0. */
136 #define MPN_COMPL_INCR(u, v, l) \
143 #define MPN_COMPL MPN_COMPL_INCR
145 /* Initialize the MP_INT X with space for NLIMBS limbs.
146 X should be a temporary variable, and it will be automatically
147 cleared out when the running function returns.
148 We use __x here to make it possible to accept both mpz_ptr and mpz_t
150 #define MPZ_TMP_INIT(X, NLIMBS) \
153 __x->alloc = (NLIMBS); \
154 __x->d = (mp_ptr) alloca ((NLIMBS) * BYTES_PER_MP_LIMB); \
157 #define MPN_MUL_N_RECURSE(prodp, up, vp, size, tspace) \
159 if ((size) < KARATSUBA_THRESHOLD) \
160 ____mpn_mul_n_basecase (prodp, up, vp, size); \
162 ____mpn_mul_n (prodp, up, vp, size, tspace); \
164 #define MPN_SQR_N_RECURSE(prodp, up, size, tspace) \
166 if ((size) < KARATSUBA_THRESHOLD) \
167 ____mpn_sqr_n_basecase (prodp, up, size); \
169 ____mpn_sqr_n (prodp, up, size, tspace); \
172 /* Structure for conversion between internal binary format and
173 strings in base 2..36. */
176 /* Number of digits in the conversion base that always fits in
177 an mp_limb. For example, for base 10 this is 10, since
178 2**32 = 4294967296 has ten digits. */
181 /* log(2)/log(conversion_base) */
182 float chars_per_bit_exactly
;
184 /* big_base is conversion_base**chars_per_limb, i.e. the biggest
185 number that fits a word, built by factors of conversion_base.
186 Exception: For 2, 4, 8, etc, big_base is log2(base), i.e. the
187 number of bits used to represent each digit in the base. */
190 /* big_base_inverted is a BITS_PER_MP_LIMB bit approximation to
191 1/big_base, represented as a fixed-point number. Instead of
192 dividing by big_base an application can choose to multiply
193 by big_base_inverted. */
194 mp_limb big_base_inverted
;
197 extern const struct bases __mp_bases
[];
198 extern mp_size_t __gmp_default_fp_limb_precision
;
200 /* Divide the two-limb number in (NH,,NL) by D, with DI being a 32 bit
201 approximation to (2**(2*BITS_PER_MP_LIMB))/D - (2**BITS_PER_MP_LIMB).
202 Put the quotient in Q and the remainder in R. */
203 #define udiv_qrnnd_preinv(q, r, nh, nl, d, di) \
205 mp_limb _q, _ql, _r; \
207 umul_ppmm (_q, _ql, (nh), (di)); \
208 _q += (nh); /* DI is 2**BITS_PER_MP_LIMB too small */\
209 umul_ppmm (_xh, _xl, _q, (d)); \
210 sub_ddmmss (_xh, _r, (nh), (nl), _xh, _xl); \
213 sub_ddmmss (_xh, _r, _xh, _r, 0, (d)); \
217 sub_ddmmss (_xh, _r, _xh, _r, 0, (d)); \
229 #define udiv_qrnnd_preinv2gen(q, r, nh, nl, d, di, dnorm, lgup) \
231 mp_limb n2, n10, n1, nadj, q1; \
233 n2 = ((nh) << (BITS_PER_MP_LIMB - (lgup))) + ((nl) >> 1 >> (l - 1));\
234 n10 = (nl) << (BITS_PER_MP_LIMB - (lgup)); \
235 n1 = ((mp_limb_signed) n10 >> (BITS_PER_MP_LIMB - 1)); \
236 nadj = n10 + (n1 & (dnorm)); \
237 umul_ppmm (_xh, _xl, di, n2 - n1); \
238 add_ssaaaa (_xh, _xl, _xh, _xl, 0, nadj); \
240 umul_ppmm (_xh, _xl, q1, d); \
241 add_ssaaaa (_xh, _xl, _xh, _xl, nh, nl); \
243 (r) = _xl + ((d) & _xh); \
246 #define udiv_qrnnd_preinv2norm(q, r, nh, nl, d, di) \
248 mp_limb n2, n10, n1, nadj, q1; \
252 n1 = ((mp_limb_signed) n10 >> (BITS_PER_MP_LIMB - 1)); \
253 nadj = n10 + (n1 & (d)); \
254 umul_ppmm (_xh, _xl, di, n2 - n1); \
255 add_ssaaaa (_xh, _xl, _xh, _xl, 0, nadj); \
257 umul_ppmm (_xh, _xl, q1, d); \
258 add_ssaaaa (_xh, _xl, _xh, _xl, nh, nl); \
260 (r) = _xl + ((d) & _xh); \
264 #if defined (__GNUC__)
265 /* Define stuff for longlong.h asm macros. */
266 #if __GNUC_NEW_ATTR_MODE_SYNTAX
267 typedef unsigned int UQItype
__attribute__ ((mode ("QI")));
268 typedef int SItype
__attribute__ ((mode ("SI")));
269 typedef unsigned int USItype
__attribute__ ((mode ("SI")));
270 typedef int DItype
__attribute__ ((mode ("DI")));
271 typedef unsigned int UDItype
__attribute__ ((mode ("DI")));
273 typedef unsigned int UQItype
__attribute__ ((mode (QI
)));
274 typedef int SItype
__attribute__ ((mode (SI
)));
275 typedef unsigned int USItype
__attribute__ ((mode (SI
)));
276 typedef int DItype
__attribute__ ((mode (DI
)));
277 typedef unsigned int UDItype
__attribute__ ((mode (DI
)));
281 typedef mp_limb UWtype
;
282 typedef unsigned int UHWtype
;
283 #define W_TYPE_SIZE BITS_PER_MP_LIMB