3 * Multiprecision arithmetic
5 * (c) 2004 Straylight/Edgeware
8 /*----- Licensing notice --------------------------------------------------*
10 * This file is part of the Python interface to Catacomb.
12 * Catacomb/Python is free software; you can redistribute it and/or modify
13 * it under the terms of the GNU General Public License as published by
14 * the Free Software Foundation; either version 2 of the License, or
15 * (at your option) any later version.
17 * Catacomb/Python is distributed in the hope that it will be useful,
18 * but WITHOUT ANY WARRANTY; without even the implied warranty of
19 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
20 * GNU General Public License for more details.
22 * You should have received a copy of the GNU General Public License
23 * along with Catacomb/Python; if not, write to the Free Software Foundation,
24 * Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
27 /*----- Header files ------------------------------------------------------*/
29 #include "catacomb-python.h"
31 /*----- General utilities -------------------------------------------------*/
33 PyTypeObject *mp_pytype = 0;
34 PyTypeObject *gf_pytype = 0;
36 mp *mp_frompylong(PyObject *obj)
39 PyLongObject *l = (PyLongObject *)obj;
50 assert(MPW_BITS >= SHIFT);
51 bits = (unsigned long)sz * SHIFT;
52 w = (bits + MPW_BITS - 1)/MPW_BITS;
53 x = mp_new(w, l->ob_size < 0 ? MP_NEG : 0);
55 for (i = 0; i < sz; i++) {
56 r |= (mpd)l->ob_digit[i] << b;
58 while (b >= MPW_BITS) {
73 PyObject *mp_topylong(mp *x)
75 unsigned long bits = mp_bits(x);
76 int sz = (bits + SHIFT - 1)/SHIFT;
77 PyLongObject *l = _PyLong_New(sz);
83 assert(MPW_BITS >= SHIFT);
84 while (i < sz && p < x->vl) {
87 while (i < sz && b >= SHIFT) {
88 l->ob_digit[i++] = r & MASK;
94 l->ob_digit[i++] = r & MASK;
97 l->ob_size = (x->f & MP_NEG) ? -sz : sz;
98 return ((PyObject *)l);
101 mp *mp_frompyobject(PyObject *o, int radix)
105 if (PyString_Check(o)) {
108 sc.buf = PyString_AS_STRING(o);
109 sc.lim = sc.buf + PyString_GET_SIZE(o);
110 x = mp_read(MP_NEW, radix, &mptext_stringops, &sc);
112 if (sc.buf < sc.lim) { MP_DROP(x); return (0); }
115 if ((x = tomp(o)) != 0)
120 PyObject *mp_topystring(mp *x, int radix, const char *xpre,
121 const char *pre, const char *post)
123 int len = mptext_len(x, radix) + 1;
126 size_t xprelen = xpre ? strlen(xpre) : 0;
127 size_t prelen = pre ? strlen(pre) : 0;
128 size_t postlen = post ? strlen(post) : 0;
131 o = PyString_FromStringAndSize(0, len + 1 + xprelen + prelen + postlen);
132 p = PyString_AS_STRING(o);
134 if (xpre) { memcpy(sc.buf, xpre, xprelen); sc.buf += xprelen; }
135 if (MP_NEGP(x)) { *sc.buf++ = '-'; x = mp_neg(x, x); }
136 if (pre) { memcpy(sc.buf, pre, prelen); sc.buf += prelen; }
137 sc.lim = sc.buf + len;
138 mp_write(x, radix, &mptext_stringops, &sc);
139 if (post) { memcpy(sc.buf, post, postlen); sc.buf += postlen; }
141 _PyString_Resize(&o, sc.buf - p);
145 static int good_radix_p(int r, int readp)
147 return ((r >= -255 && r <= -2) ||
149 (r >= 2 && r <= 62));
152 PyObject *mp_pywrap(mp *x)
154 mp_pyobj *z = PyObject_New(mp_pyobj, mp_pytype);
156 return ((PyObject *)z);
159 PyObject *gf_pywrap(mp *x)
161 mp_pyobj *z = PyObject_New(mp_pyobj, gf_pytype);
163 return ((PyObject *)z);
166 int mp_tolong_checked(mp *x, long *l, int must)
168 static mp *longmin = 0, *longmax = 0;
172 longmin = mp_fromlong(MP_NEW, LONG_MIN);
173 longmax = mp_fromlong(MP_NEW, LONG_MAX);
175 if (MP_CMP(x, <, longmin) || MP_CMP(x, >, longmax)) {
176 if (must) VALERR("mp out of range for int");
185 /*----- Python interface --------------------------------------------------*/
187 static void mp_pydealloc(PyObject *o)
193 static PyObject *mp_pyrepr(PyObject *o)
194 { return mp_topystring(MP_X(o), 10, "MP(", 0, "L)"); }
196 static PyObject *mp_pystr(PyObject *o)
197 { return mp_topystring(MP_X(o), 10, 0, 0, 0); }
199 mp *tomp(PyObject *o)
206 else if (MP_PYCHECK(o) || GF_PYCHECK(o))
207 return (MP_COPY(MP_X(o)));
208 else if (FE_PYCHECK(o))
209 return (F_OUT(FE_F(o), MP_NEW, FE_X(o)));
210 else if (PFILT_PYCHECK(o))
211 return (MP_COPY(PFILT_F(o)->m));
212 else if (ECPT_PYCHECK(o)) {
218 } else if (GE_PYCHECK(o)) {
219 if ((x = G_TOINT(GE_G(o), MP_NEW, GE_X(o))) == 0)
222 } else if (PyInt_Check(o))
223 return (mp_fromlong(MP_NEW, PyInt_AS_LONG(o)));
224 else if ((l = PyNumber_Long(o)) != 0) {
225 x = mp_frompylong(l);
234 mp *getmp(PyObject *o)
238 if ((x = tomp(o)) == 0) {
239 PyErr_Format(PyExc_TypeError, "can't convert %.100s to mp",
240 o->ob_type->tp_name);
245 int convmp(PyObject *o, void *p)
248 if ((x = getmp(o)) == 0) return (0);
253 mp *getgf(PyObject *o)
257 if ((x = tomp(o)) == 0) {
258 PyErr_Format(PyExc_TypeError, "can't convert %.100s to gf",
259 o->ob_type->tp_name);
264 int convgf(PyObject *o, void *p)
267 if ((x = getgf(o)) == 0) return (0);
272 static mp *implicitmp(PyObject *o)
283 static mp *implicitgf(PyObject *o)
294 static int mpbinop(PyObject *x, PyObject *y, mp **xx, mp **yy)
296 if ((*xx = implicitmp(x)) == 0)
298 if ((*yy = implicitmp(y)) == 0) {
305 static int gfbinop(PyObject *x, PyObject *y, mp **xx, mp **yy)
307 if ((*xx = implicitgf(x)) == 0)
309 if ((*yy = implicitgf(y)) == 0) {
316 #define gf_and mp_and
318 #define gf_xor mp_xor
319 #define BINOP(pre, name) \
320 static PyObject *pre##_py##name(PyObject *x, PyObject *y) { \
322 if (pre##binop(x, y, &xx, &yy)) RETURN_NOTIMPL; \
323 zz = pre##_##name(MP_NEW, xx, yy); \
324 MP_DROP(xx); MP_DROP(yy); \
325 return (pre##_pywrap(zz)); \
341 static mp *mp_abs(mp *d, mp *x)
344 return (mp_neg(d, x));
350 #define UNOP(pre, name) \
351 static PyObject *pre##_py##name(PyObject *x) \
352 { return mp_pywrap(pre##_##name(MP_NEW, MP_X(x))); }
358 static PyObject *mp_pyid(PyObject *x) { RETURN_OBJ(x); }
360 #define gf_lsr mp_lsr
361 #define SHIFTOP(pre, name, rname) \
362 static PyObject *pre##_py##name(PyObject *x, PyObject *y) { \
366 if (pre##binop(x, y, &xx, &yy)) RETURN_NOTIMPL; \
367 if (mp_tolong_checked(yy, &n, 1)) goto end; \
369 z = pre##_pywrap(mp_##rname(MP_NEW, xx, -n)); \
371 z = pre##_pywrap(mp_##name(MP_NEW, xx, n)); \
373 MP_DROP(xx); MP_DROP(yy); \
376 SHIFTOP(mp, lsl2c, lsr2c)
377 SHIFTOP(mp, lsr2c, lsl2c)
378 SHIFTOP(gf, lsl, lsr)
379 SHIFTOP(gf, lsr, lsl)
382 #define DIVOP(pre, name, qq, rr, gather) \
383 static PyObject *pre##_py##name(PyObject *x, PyObject *y) { \
386 INIT_##qq(q) INIT_##rr(r) \
387 if (pre##binop(x, y, &xx, &yy)) RETURN_NOTIMPL; \
389 ZDIVERR("division by zero"); \
390 pre##_div(ARG_##qq(q), ARG_##rr(r), xx, yy); \
393 MP_DROP(xx); MP_DROP(yy); \
396 #define INIT_YES(p) mp *p = MP_NEW;
398 #define ARG_YES(p) &p
400 DIVOP(mp, divmod, YES, YES,
401 Py_BuildValue("(NN)", mp_pywrap(q), mp_pywrap(r)))
402 DIVOP(mp, div, YES, NO, mp_pywrap(q))
403 DIVOP(mp, mod, NO, YES, mp_pywrap(r))
404 DIVOP(gf, divmod, YES, YES,
405 Py_BuildValue("(NN)", gf_pywrap(q), gf_pywrap(r)))
406 DIVOP(gf, div, YES, NO, gf_pywrap(q))
407 DIVOP(gf, mod, NO, YES, gf_pywrap(r))
414 static mp *mp_modinv_checked(mp *d, mp *x, mp *p)
417 mp_gcd(&g, 0, &d, p, x);
418 if (!MP_EQ(g, MP_ONE)) {
419 MP_DROP(g); MP_DROP(d);
420 PyErr_SetString(PyExc_ZeroDivisionError, "no modular inverse");
423 MP_DROP(g); return (d);
426 static PyObject *mp_pyexp(PyObject *x, PyObject *y, PyObject *z)
428 mp *xx = 0, *yy = 0, *zz = 0;
432 if ((xx = implicitmp(x)) == 0 || (yy = implicitmp(y)) == 0 ||
433 (z && z != Py_None && (zz = tomp(z)) == 0)) {
434 mp_drop(xx); mp_drop(yy); mp_drop(zz);
437 if (!z || z == Py_None) {
438 if (MP_NEGP(yy)) VALERR("negative exponent");
439 r = mp_exp(MP_NEW, xx, yy);
441 if (!MP_POSP(zz)) VALERR("modulus must be positive");
443 if ((xx = mp_modinv_checked(xx, xx, zz)) == 0) goto end;
448 mpmont_create(&mm, zz);
449 r = mpmont_exp(&mm, MP_NEW, xx, yy);
453 mpbarrett_create(&mb, zz);
454 r = mpbarrett_exp(&mb, MP_NEW, xx, yy);
455 mpbarrett_destroy(&mb);
460 mp_drop(xx); mp_drop(yy); mp_drop(zz);
464 static mp *gf_modinv_checked(mp *d, mp *x, mp *p)
467 gf_gcd(&g, 0, &d, p, x);
468 if (!MP_EQ(g, MP_ONE)) {
469 MP_DROP(g); MP_DROP(d);
470 PyErr_SetString(PyExc_ZeroDivisionError, "no modular inverse");
473 MP_DROP(g); return (d);
476 #define BASEOP(name, radix, pre) \
477 static PyObject *mp_py##name(PyObject *x) \
478 { return mp_topystring(MP_X(x), radix, 0, pre, 0); }
480 BASEOP(hex, 16, "0x");
483 static int mp_pynonzerop(PyObject *x) { return !MP_ZEROP(MP_X(x)); }
485 static PyObject *mp_pyint(PyObject *x)
488 if (!mp_tolong_checked(MP_X(x), &l, 0)) return (PyInt_FromLong(l));
489 else return mp_topylong(MP_X(x));
491 static PyObject *mp_pylong(PyObject *x)
492 { return (mp_topylong(MP_X(x))); }
493 static PyObject *mp_pyfloat(PyObject *x)
495 PyObject *l = mp_topylong(MP_X(x));
496 double f = PyLong_AsDouble(l);
498 return (PyFloat_FromDouble(f));
501 #define COERCE(pre, PRE) \
502 static int pre##_pycoerce(PyObject **x, PyObject **y) \
506 if (PRE##_PYCHECK(*y)) { \
507 Py_INCREF(*x); Py_INCREF(*y); \
510 if ((z = tomp(*y)) != 0) { \
512 *y = pre##_pywrap(z); \
521 static int mp_pycompare(PyObject *x, PyObject *y)
522 { return mp_cmp(MP_X(x), MP_X(y)); }
524 static PyObject *mp_pynew(PyTypeObject *ty, PyObject *arg, PyObject *kw)
530 char *kwlist[] = { "x", "radix", 0 };
532 if (!PyArg_ParseTupleAndKeywords(arg, kw, "O|i:new", kwlist, &x, &radix))
534 if (MP_PYCHECK(x)) RETURN_OBJ(x);
535 if (!good_radix_p(radix, 1)) VALERR("bad radix");
536 if ((z = mp_frompyobject(x, radix)) == 0) {
537 PyErr_Format(PyExc_TypeError, "can't convert %.100s to mp",
538 x->ob_type->tp_name);
541 zz = (mp_pyobj *)ty->tp_alloc(ty, 0);
544 return ((PyObject *)zz);
547 static long mp_pyhash(PyObject *me)
550 PyObject *l = mp_topylong(MP_X(me)); h = PyObject_Hash(l);
551 Py_DECREF(l); return (h);
554 static PyObject *mpmeth_jacobi(PyObject *me, PyObject *arg)
559 if (!PyArg_ParseTuple(arg, "O&:jacobi", convmp, &y)) goto end;
560 z = PyInt_FromLong(mp_jacobi(y, MP_X(me)));
566 #define BITOP(pre, name, c) \
567 static PyObject *pre##meth_##name(PyObject *me, PyObject *arg) \
570 if (!PyArg_ParseTuple(arg, "O&:" #name, convulong, &i)) return (0); \
571 return (pre##_pywrap(mp_##name##c(MP_NEW, MP_X(me), i))); \
573 BITOP(mp, setbit, 2c);
574 BITOP(mp, clearbit, 2c);
576 BITOP(gf, clearbit, );
579 static PyObject *mpmeth_testbit(PyObject *me, PyObject *arg)
582 if (!PyArg_ParseTuple(arg, "O&:testbit", convulong, &i)) return (0);
583 return (getbool(mp_testbit2c(MP_X(me), i)));
586 static PyObject *gfmeth_testbit(PyObject *me, PyObject *arg)
589 if (!PyArg_ParseTuple(arg, "O&:testbit", convulong, &i)) return (0);
590 return (getbool(mp_testbit(MP_X(me), i)));
593 static PyObject *mpmeth_odd(PyObject *me, PyObject *arg)
598 if (!PyArg_ParseTuple(arg, ":odd")) return (0);
599 t = mp_odd(MP_NEW, MP_X(me), &s);
600 return (Py_BuildValue("(lN)", (long)s, mp_pywrap(t)));
603 static PyObject *mpmeth_sqr(PyObject *me, PyObject *arg)
605 if (!PyArg_ParseTuple(arg, ":sqr")) return (0);
606 return (mp_pywrap(mp_sqr(MP_NEW, MP_X(me))));
609 static PyObject *mpmeth_sqrt(PyObject *me, PyObject *arg)
611 if (!PyArg_ParseTuple(arg, ":sqrt")) return (0);
612 if (MP_NEGP(MP_X(me))) VALERR("negative root");
613 return (mp_pywrap(mp_sqrt(MP_NEW, MP_X(me))));
618 static PyObject *mpmeth_gcd(PyObject *me, PyObject *arg)
620 mp *y = 0, *zz = MP_NEW;
623 if (!PyArg_ParseTuple(arg, "O&:gcd", convmp, &y)) goto end;
624 mp_gcd(&zz, 0, 0, MP_X(me), y);
631 static PyObject *mpmeth_gcdx(PyObject *me, PyObject *arg)
634 mp *yy = 0, *zz = MP_NEW, *uu = MP_NEW, *vv = MP_NEW;
636 if (!PyArg_ParseTuple(arg, "O&:gcdx", convmp, &yy)) goto end;
637 mp_gcd(&zz, &uu, &vv, MP_X(me), yy);
638 z = Py_BuildValue("(NNN)",
639 mp_pywrap(zz), mp_pywrap(uu), mp_pywrap(vv));
645 static PyObject *mpmeth_modinv(PyObject *me, PyObject *arg)
648 mp *yy = 0, *zz = MP_NEW;
650 if (!PyArg_ParseTuple(arg, "O&:modinv", convmp, &yy) ||
651 (zz = mp_modinv_checked(MP_NEW, yy, MP_X(me))) == 0)
659 static PyObject *mpmeth_tostring(PyObject *me, PyObject *arg, PyObject *kw)
662 char *kwlist[] = { "radix", 0 };
663 if (!PyArg_ParseTupleAndKeywords(arg, kw, "|i:tostring", kwlist, &radix))
665 if (!good_radix_p(radix, 0)) VALERR("bad radix");
666 return (mp_topystring(MP_X(me), radix, 0, 0, 0));
671 static PyObject *mpmeth_modsqrt(PyObject *me, PyObject *arg)
674 mp *yy = 0, *zz = MP_NEW;
676 if (!PyArg_ParseTuple(arg, "O&:modsqrt", convmp, &yy)) goto end;
677 if ((zz = mp_modsqrt(MP_NEW, yy, MP_X(me))) == 0)
678 VALERR("no modular square root");
685 static PyObject *mpmeth_leastcongruent(PyObject *me, PyObject *arg)
690 if (!PyArg_ParseTuple(arg, "O&O&:leastcongruent", convmp, &b, convmp, &m))
692 z = mp_leastcongruent(MP_NEW, b, MP_X(me), m);
698 #define STOREOP(name, c) \
699 static PyObject *mpmeth_##name(PyObject *me, \
700 PyObject *arg, PyObject *kw) \
703 char *kwlist[] = { "len", 0 }; \
706 if (!PyArg_ParseTupleAndKeywords(arg, kw, "|l:" #name, \
710 len = mp_octets##c(MP_X(me)); \
713 rc = bytestring_pywrap(0, len); \
714 mp_##name(MP_X(me), PyString_AS_STRING(rc), len); \
720 STOREOP(storel2c, 2c)
721 STOREOP(storeb2c, 2c)
724 #define BUFOP(ty, pyty) \
725 static PyObject *meth__##pyty##_frombuf(PyObject *me, PyObject *arg) \
733 if (!PyArg_ParseTuple(arg, "Os#:frombuf", &me, &p, &sz)) goto end; \
734 buf_init(&b, p, sz); \
735 if ((x = buf_getmp(&b)) == 0) VALERR("malformed data"); \
736 rc = Py_BuildValue("(NN)", ty##_pywrap(x), \
737 bytestring_pywrapbuf(&b)); \
745 static PyObject *mpmeth_tobuf(PyObject *me, PyObject *arg)
752 if (!PyArg_ParseTuple(arg, ":tobuf")) return (0);
754 n = mp_octets(x) + 3;
755 rc = bytestring_pywrap(0, n);
756 buf_init(&b, PyString_AS_STRING(rc), n);
759 _PyString_Resize(&rc, BLEN(&b));
763 static PyObject *mpmeth_primep(PyObject *me, PyObject *arg, PyObject *kw)
765 grand *r = &rand_global;
766 char *kwlist[] = { "rng", 0 };
769 if (!PyArg_ParseTupleAndKeywords(arg, kw, "|O&", kwlist, convgrand, &r))
771 rc = getbool(pgen_primep(MP_X(me), r));
776 static PyObject *mpget_nbits(PyObject *me, void *hunoz)
777 { return (PyInt_FromLong(mp_bits(MP_X(me)))); }
779 static PyObject *mpget_noctets(PyObject *me, void *hunoz)
780 { return (PyInt_FromLong(mp_octets(MP_X(me)))); }
782 static PyObject *mpget_noctets2c(PyObject *me, void *hunoz)
783 { return (PyInt_FromLong(mp_octets2c(MP_X(me)))); }
785 static PyGetSetDef mp_pygetset[] = {
786 #define GETSETNAME(op, func) mp##op##_##func
787 GET (nbits, "X.nbits -> bit length of X")
788 GET (noctets, "X.noctets -> octet length of X")
789 GET (noctets2c, "X.noctets2c -> two's complement octet length of X")
794 static PyMethodDef mp_pymethods[] = {
795 #define METHNAME(func) mpmeth_##func
796 METH (jacobi, "X.jacobi(Y) -> Jacobi symbol (Y/X) (NB inversion!)")
797 METH (setbit, "X.setbit(N) -> X with bit N set")
798 METH (clearbit, "X.clearbit(N) -> X with bit N clear")
799 METH (testbit, "X.testbit(N) -> true/false if bit N set/clear in X")
800 METH (odd, "X.odd() -> S, T where X = 2^S T with T odd")
801 METH (sqr, "X.sqr() -> X^2")
802 METH (sqrt, "X.sqrt() -> largest integer <= sqrt(X)")
803 METH (gcd, "X.gcd(Y) -> gcd(X, Y)")
805 "X.gcdx(Y) -> (gcd(X, Y), U, V) with X U + Y V = gcd(X, Y)")
806 METH (modinv, "X.modinv(Y) -> multiplicative inverse of Y mod X")
807 METH (modsqrt, "X.modsqrt(Y) -> square root of Y mod X, if X prime")
808 METH (leastcongruent,
809 "X.leastcongruent(B, M) -> smallest Z >= B with Z == X (mod M)")
810 KWMETH(primep, "X.primep(rng = rand) -> true/false if X is prime")
811 KWMETH(tostring, "X.tostring(radix = 10) -> STR")
812 KWMETH(storel, "X.storel(len = -1) -> little-endian bytes")
813 KWMETH(storeb, "X.storeb(len = -1) -> big-endian bytes")
815 "X.storel2c(len = -1) -> little-endian bytes, two's complement")
817 "X.storeb2c(len = -1) -> big-endian bytes, two's complement")
818 METH (tobuf, "X.tobuf() -> buffer format")
823 static PyNumberMethods mp_pynumber = {
824 mp_pyadd, /* @nb_add@ */
825 mp_pysub, /* @nb_subtract@ */
826 mp_pymul, /* @nb_multiply@ */
828 mp_pymod, /* @nb_remainder@ */
829 mp_pydivmod, /* @nb_divmod@ */
830 mp_pyexp, /* @nb_power@ */
831 mp_pyneg, /* @nb_negative@ */
832 mp_pyid, /* @nb_positive@ */
833 mp_pyabs, /* @nb_absolute@ */
834 mp_pynonzerop, /* @nb_nonzero@ */
835 mp_pynot2c, /* @nb_invert@ */
836 mp_pylsl2c, /* @nb_lshift@ */
837 mp_pylsr2c, /* @nb_rshift@ */
838 mp_pyand2c, /* @nb_and@ */
839 mp_pyxor2c, /* @nb_xor@ */
840 mp_pyor2c, /* @nb_or@ */
841 mp_pycoerce, /* @nb_coerce@ */
842 mp_pyint, /* @nb_int@ */
843 mp_pylong, /* @nb_long@ */
844 mp_pyfloat, /* @nb_float@ */
845 mp_pyoct, /* @nb_oct@ */
846 mp_pyhex, /* @nb_hex@ */
848 0, /* @nb_inplace_add@ */
849 0, /* @nb_inplace_subtract@ */
850 0, /* @nb_inplace_multiply@ */
851 0, /* @nb_inplace_divide@ */
852 0, /* @nb_inplace_remainder@ */
853 0, /* @nb_inplace_power@ */
854 0, /* @nb_inplace_lshift@ */
855 0, /* @nb_inplace_rshift@ */
856 0, /* @nb_inplace_and@ */
857 0, /* @nb_inplace_xor@ */
858 0, /* @nb_inplace_or@ */
860 mp_pydiv, /* @nb_floor_divide@ */
861 0, /* @nb_true_divide@ */
862 0, /* @nb_inplace_floor_divide@ */
863 0, /* @nb_inplace_true_divide@ */
866 static PyTypeObject mp_pytype_skel = {
867 PyObject_HEAD_INIT(0) 0, /* Header */
868 "MP", /* @tp_name@ */
869 sizeof(mp_pyobj), /* @tp_basicsize@ */
870 0, /* @tp_itemsize@ */
872 mp_pydealloc, /* @tp_dealloc@ */
874 0, /* @tp_getattr@ */
875 0, /* @tp_setattr@ */
876 mp_pycompare, /* @tp_compare@ */
877 mp_pyrepr, /* @tp_repr@ */
878 &mp_pynumber, /* @tp_as_number@ */
879 0, /* @tp_as_sequence@ */
880 0, /* @tp_as_mapping@ */
881 mp_pyhash, /* @tp_hash@ */
883 mp_pystr, /* @tp_str@ */
884 0, /* @tp_getattro@ */
885 0, /* @tp_setattro@ */
886 0, /* @tp_as_buffer@ */
887 Py_TPFLAGS_DEFAULT | /* @tp_flags@ */
888 Py_TPFLAGS_CHECKTYPES |
892 "Multiprecision integers, similar to `long' but more efficient and\n\
893 versatile. Support all the standard arithmetic operations.\n\
895 Constructor mp(X, radix = R) attempts to convert X to an `mp'. If\n\
896 X is a string, it's read in radix-R form, or we look for a prefix\n\
897 if R = 0. Other acceptable things are ints and longs.\n\
901 * Use `//' for division. MPs don't have `/' division.",
903 0, /* @tp_traverse@ */
905 0, /* @tp_richcompare@ */
906 0, /* @tp_weaklistoffset@ */
908 0, /* @tp_iternext@ */
909 mp_pymethods, /* @tp_methods@ */
910 0, /* @tp_members@ */
911 mp_pygetset, /* @tp_getset@ */
914 0, /* @tp_descr_get@ */
915 0, /* @tp_descr_set@ */
916 0, /* @tp_dictoffset@ */
918 PyType_GenericAlloc, /* @tp_alloc@ */
919 mp_pynew, /* @tp_new@ */
924 static PyObject *meth__MP_fromstring(PyObject *me,
925 PyObject *arg, PyObject *kw)
933 char *kwlist[] = { "class", "x", "radix", 0 };
935 if (!PyArg_ParseTupleAndKeywords(arg, kw, "Os#|i:fromstring",
936 kwlist, &me, &p, &len, &r))
938 if (!good_radix_p(r, 1)) VALERR("bad radix");
939 sc.buf = p; sc.lim = p + len;
940 if ((zz = mp_read(MP_NEW, r, &mptext_stringops, &sc)) == 0)
941 VALERR("bad integer");
942 z = Py_BuildValue("(Ns#)", mp_pywrap(zz),
943 sc.buf, (Py_ssize_t)(sc.lim - sc.buf));
948 static PyObject *meth__MP_factorial(PyObject *me, PyObject *arg)
952 if (!PyArg_ParseTuple(arg, "OO&:factorial", &me, convulong, &i))
958 static PyObject *meth__MP_fibonacci(PyObject *me, PyObject *arg)
962 if (!PyArg_ParseTuple(arg, "Ol:fibonacci", &me, &i)) return (0);
967 #define LOADOP(pre, py, name) \
968 static PyObject *meth__##py##_##name(PyObject *me, PyObject *arg) \
972 if (!PyArg_ParseTuple(arg, "Os#:" #name, &me, &p, &len)) return (0); \
973 return (pre##_pywrap(mp_##name(MP_NEW, p, len))); \
975 LOADOP(mp, MP, loadl)
976 LOADOP(mp, MP, loadb)
977 LOADOP(mp, MP, loadl2c)
978 LOADOP(mp, MP, loadb2c)
979 LOADOP(gf, GF, loadl)
980 LOADOP(gf, GF, loadb)
983 /*----- Products of small integers ----------------------------------------*/
985 typedef struct mpmul_pyobj {
991 #define MPMUL_LIVEP(o) (((mpmul_pyobj *)(o))->livep)
992 #define MPMUL_PY(o) (&((mpmul_pyobj *)(o))->mm)
994 static void mpmul_pydealloc(PyObject *me)
997 mp_drop(mpmul_done(MPMUL_PY(me)));
1001 static PyObject *mmmeth_factor(PyObject *me, PyObject *arg)
1006 if (!MPMUL_LIVEP(me)) VALERR("MPMul object invalid");
1007 if (PyTuple_Size(arg) != 1)
1008 i = PyObject_GetIter(arg);
1010 if ((q = PyTuple_GetItem(arg, 0)) == 0) goto end;
1011 if ((i = PyObject_GetIter(q)) == 0) {
1012 PyErr_Clear(); /* that's ok */
1013 i = PyObject_GetIter(arg);
1017 while ((q = PyIter_Next(i)) != 0) {
1018 x = getmp(q); Py_DECREF(q); if (!x) {
1022 mpmul_add(MPMUL_PY(me), x);
1031 static PyObject *mmmeth_done(PyObject *me, PyObject *arg)
1035 if (!PyArg_ParseTuple(arg, ":done")) goto end;
1036 if (!MPMUL_LIVEP(me)) VALERR("MPMul object invalid");
1037 x = mpmul_done(MPMUL_PY(me));
1038 MPMUL_LIVEP(me) = 0;
1039 return (mp_pywrap(x));
1044 static PyObject *mpmul_pynew(PyTypeObject *ty, PyObject *arg, PyObject *kw)
1048 if (kw) TYERR("keyword arguments not allowed here");
1049 mm = (mpmul_pyobj *)ty->tp_alloc(ty, 0);
1050 mpmul_init(&mm->mm);
1052 if (mmmeth_factor((PyObject *)mm, arg) == 0) {
1056 return ((PyObject *)mm);
1061 static PyObject *mmget_livep(PyObject *me, void *hunoz)
1062 { return (getbool(MPMUL_LIVEP(me))); }
1064 static PyGetSetDef mpmul_pygetset[] = {
1065 #define GETSETNAME(op, name) mm##op##_##name
1066 GET (livep, "MM.livep -> flag: object still valid?")
1071 static PyMethodDef mpmul_pymethods[] = {
1072 #define METHNAME(name) mmmeth_##name
1073 METH (factor, "MM.factor(ITERABLE) or MM.factor(I, ...)")
1074 METH (done, "MM.done() -> PRODUCT")
1079 static PyTypeObject *mpmul_pytype, mpmul_pytype_skel = {
1080 PyObject_HEAD_INIT(0) 0, /* Header */
1081 "MPMul", /* @tp_name@ */
1082 sizeof(mpmul_pyobj), /* @tp_basicsize@ */
1083 0, /* @tp_itemsize@ */
1085 mpmul_pydealloc, /* @tp_dealloc@ */
1087 0, /* @tp_getattr@ */
1088 0, /* @tp_setattr@ */
1089 0, /* @tp_compare@ */
1091 0, /* @tp_as_number@ */
1092 0, /* @tp_as_sequence@ */
1093 0, /* @tp_as_mapping@ */
1097 0, /* @tp_getattro@ */
1098 0, /* @tp_setattro@ */
1099 0, /* @tp_as_buffer@ */
1100 Py_TPFLAGS_DEFAULT | /* @tp_flags@ */
1101 Py_TPFLAGS_BASETYPE,
1104 "An object for multiplying many small integers.",
1106 0, /* @tp_traverse@ */
1108 0, /* @tp_richcompare@ */
1109 0, /* @tp_weaklistoffset@ */
1111 0, /* @tp_iternext@ */
1112 mpmul_pymethods, /* @tp_methods@ */
1113 0, /* @tp_members@ */
1114 mpmul_pygetset, /* @tp_getset@ */
1117 0, /* @tp_descr_get@ */
1118 0, /* @tp_descr_set@ */
1119 0, /* @tp_dictoffset@ */
1121 PyType_GenericAlloc, /* @tp_alloc@ */
1122 mpmul_pynew, /* @tp_new@ */
1127 /*----- Montgomery reduction ----------------------------------------------*/
1129 typedef struct mpmont_pyobj {
1134 #define MPMONT_PY(o) (&((mpmont_pyobj *)(o))->mm)
1136 static PyObject *mmmeth_int(PyObject *me, PyObject *arg)
1140 mpmont *mm = MPMONT_PY(me);
1142 if (!PyArg_ParseTuple(arg, "O&:in", convmp, &yy))
1144 mp_div(0, &yy, yy, mm->m);
1145 z = mp_pywrap(mpmont_mul(mm, MP_NEW, yy, mm->r2));
1147 if (yy) MP_DROP(yy);
1151 static PyObject *mmmeth_mul(PyObject *me, PyObject *arg)
1154 mp *yy = 0, *zz = 0;
1156 if (!PyArg_ParseTuple(arg, "O&O&:mul", convmp, &yy, convmp, &zz))
1158 rc = mp_pywrap(mpmont_mul(MPMONT_PY(me), MP_NEW, yy, zz));
1160 if (yy) MP_DROP(yy); if (zz) MP_DROP(zz);
1164 static PyObject *mmmeth_exp(PyObject *me, PyObject *arg)
1167 mp *yy = 0, *zz = 0;
1169 if (!PyArg_ParseTuple(arg, "O&O&:exp", convmp, &yy, convmp, &zz))
1172 if ((yy = mp_modinv_checked(yy, yy, MPMONT_PY(me)->m)) == 0) goto end;
1173 zz = mp_neg(zz, zz);
1175 rc = mp_pywrap(mpmont_exp(MPMONT_PY(me), MP_NEW, yy, zz));
1177 if (yy) MP_DROP(yy); if (zz) MP_DROP(zz);
1181 static PyObject *mmmeth_expr(PyObject *me, PyObject *arg)
1184 mp *yy = 0, *zz = 0;
1186 if (!PyArg_ParseTuple(arg, "O&O&:expr", convmp, &yy, convmp, &zz))
1189 yy = mpmont_reduce(MPMONT_PY(me), yy, yy);
1190 if ((yy = mp_modinv_checked(yy, yy, MPMONT_PY(me)->m)) == 0) goto end;
1191 yy = mpmont_mul(MPMONT_PY(me), yy, yy, MPMONT_PY(me)->r2);
1192 zz = mp_neg(zz, zz);
1194 rc = mp_pywrap(mpmont_expr(MPMONT_PY(me), MP_NEW, yy, zz));
1196 if (yy) MP_DROP(yy); if (zz) MP_DROP(zz);
1200 static PyObject *mm_mexpr_id(PyObject *me)
1201 { return mp_pywrap(MP_COPY(MPMONT_PY(me)->r)); }
1203 static int mm_mexpr_fill(void *p, PyObject *me, PyObject *x, PyObject *y)
1205 mp *xx = 0, *yy = 0;
1206 mp_expfactor *f = p;
1207 mpmont *mm = MPMONT_PY(me);
1209 if ((xx = getmp(x)) == 0 || (yy = getmp(y)) == 0)
1212 xx = mpmont_reduce(mm, xx, xx);
1213 if ((xx = mp_modinv_checked(xx, xx, yy)) == 0)
1215 xx = mpmont_mul(mm, xx, xx, mm->r2);
1216 yy = mp_neg(yy, yy);
1223 mp_drop(xx); mp_drop(yy);
1227 static PyObject *mm_mexpr(PyObject *me, void *v, int n)
1228 { return mp_pywrap(mpmont_mexpr(MPMONT_PY(me), MP_NEW, v, n)); }
1230 static void mp_mexp_drop(void *p)
1232 mp_expfactor *f = p;
1237 static PyObject *mmmeth_mexpr(PyObject *me, PyObject *arg)
1239 return mexp_common(me, arg, sizeof(mp_expfactor),
1240 mm_mexpr_id, mm_mexpr_fill, mm_mexpr, mp_mexp_drop);
1243 static PyObject *mp_mexp_id(PyObject *me)
1244 { return mp_pywrap(MP_ONE); }
1246 static int mp_mexp_fill(void *p, PyObject *me, PyObject *x, PyObject *y)
1248 mp *xx = 0, *yy = 0;
1249 mp_expfactor *f = p;
1251 if ((xx = getmp(x)) == 0 || (yy = getmp(y)) == 0)
1254 if ((xx = mp_modinv_checked(xx, xx, yy)) == 0)
1256 yy = mp_neg(yy, yy);
1263 mp_drop(xx); mp_drop(yy);
1267 static PyObject *mm_mexp(PyObject *me, void *v, int n)
1268 { return mp_pywrap(mpmont_mexp(MPMONT_PY(me), MP_NEW, v, n)); }
1270 static PyObject *mmmeth_mexp(PyObject *me, PyObject *arg)
1272 return mexp_common(me, arg, sizeof(mp_expfactor),
1273 mp_mexp_id, mp_mexp_fill, mm_mexp, mp_mexp_drop);
1276 #define mmmeth_ext mmmeth_reduce
1277 static PyObject *mmmeth_reduce(PyObject *me, PyObject *arg)
1282 if (!PyArg_ParseTuple(arg, "O&", convmp, &yy)) goto end;
1283 z = mp_pywrap(mpmont_reduce(MPMONT_PY(me), MP_NEW, yy));
1288 static void mpmont_pydealloc(PyObject *me)
1290 mpmont_destroy(MPMONT_PY(me));
1294 static PyObject *mpmont_pynew(PyTypeObject *ty, PyObject *arg, PyObject *kw)
1296 mpmont_pyobj *mm = 0;
1297 char *kwlist[] = { "m", 0 };
1300 if (!PyArg_ParseTupleAndKeywords(arg, kw, "O&:new", kwlist, convmp, &xx))
1302 if (!MP_POSP(xx) || !MP_ODDP(xx)) VALERR("m must be positive and odd");
1303 mm = (mpmont_pyobj *)ty->tp_alloc(ty, 0);
1304 mpmont_create(&mm->mm, xx);
1306 if (xx) MP_DROP(xx);
1307 return ((PyObject *)mm);
1310 static PyObject *mmget_m(PyObject *me, void *hunoz)
1311 { return (mp_pywrap(MP_COPY(MPMONT_PY(me)->m))); }
1313 static PyObject *mmget_r(PyObject *me, void *hunoz)
1314 { return (mp_pywrap(MP_COPY(MPMONT_PY(me)->r))); }
1316 static PyObject *mmget_r2(PyObject *me, void *hunoz)
1317 { return (mp_pywrap(MP_COPY(MPMONT_PY(me)->r2))); }
1319 static PyGetSetDef mpmont_pygetset[] = {
1320 #define GETSETNAME(op, name) mm##op##_##name
1321 GET (m, "M.m -> modulus for reduction")
1322 GET (r, "M.r -> multiplicative identity")
1323 GET (r2, "M.r2 -> M.r^2, Montgomerization factor")
1328 static PyMethodDef mpmont_pymethods[] = {
1329 #define METHNAME(name) mmmeth_##name
1330 METH (int, "M.int(X) -> XR")
1331 METH (mul, "M.mul(XR, YR) -> ZR where Z = X Y")
1332 METH (expr, "M.expr(XR, N) -> ZR where Z = X^N mod M.m")
1334 M.mexpr([(XR0, N0), (XR1, N1), ...]) = ZR where Z = X0^N0 X1^N1 ... mod M.m\n\
1335 \t(the list may be flattened if this more convenient.)")
1336 METH (reduce, "M.reduce(XR) -> X")
1337 METH (ext, "M.ext(XR) -> X")
1338 METH (exp, "M.exp(X, N) -> X^N mod M.m")
1340 M.mexp([(X0, N0), (X1, N1), ...]) = X0^N0 X1^N1 ... mod M.m\n\
1341 \t(the list may be flattened if this more convenient.)")
1346 static PyTypeObject *mpmont_pytype, mpmont_pytype_skel = {
1347 PyObject_HEAD_INIT(0) 0, /* Header */
1348 "MPMont", /* @tp_name@ */
1349 sizeof(mpmont_pyobj), /* @tp_basicsize@ */
1350 0, /* @tp_itemsize@ */
1352 mpmont_pydealloc, /* @tp_dealloc@ */
1354 0, /* @tp_getattr@ */
1355 0, /* @tp_setattr@ */
1356 0, /* @tp_compare@ */
1358 0, /* @tp_as_number@ */
1359 0, /* @tp_as_sequence@ */
1360 0, /* @tp_as_mapping@ */
1364 0, /* @tp_getattro@ */
1365 0, /* @tp_setattro@ */
1366 0, /* @tp_as_buffer@ */
1367 Py_TPFLAGS_DEFAULT | /* @tp_flags@ */
1368 Py_TPFLAGS_BASETYPE,
1371 "A Montgomery reduction context.",
1373 0, /* @tp_traverse@ */
1375 0, /* @tp_richcompare@ */
1376 0, /* @tp_weaklistoffset@ */
1378 0, /* @tp_iternext@ */
1379 mpmont_pymethods, /* @tp_methods@ */
1380 0, /* @tp_members@ */
1381 mpmont_pygetset, /* @tp_getset@ */
1384 0, /* @tp_descr_get@ */
1385 0, /* @tp_descr_set@ */
1386 0, /* @tp_dictoffset@ */
1388 PyType_GenericAlloc, /* @tp_alloc@ */
1389 mpmont_pynew, /* @tp_new@ */
1394 /*----- Barrett reduction -------------------------------------------------*/
1396 typedef struct mpbarrett_pyobj {
1401 #define MPBARRETT_PY(o) (&((mpbarrett_pyobj *)(o))->mb)
1403 static PyObject *mbmeth_exp(PyObject *me, PyObject *arg)
1406 mp *yy = 0, *zz = 0;
1408 if (!PyArg_ParseTuple(arg, "O&O&:exp", convmp, &yy, convmp, &zz))
1411 if ((yy = mp_modinv_checked(yy, yy, MPBARRETT_PY(me)->m)) == 0) goto end;
1412 zz = mp_neg(zz, zz);
1414 rc = mp_pywrap(mpbarrett_exp(MPBARRETT_PY(me), MP_NEW, yy, zz));
1416 if (yy) MP_DROP(yy); if (zz) MP_DROP(zz);
1420 static PyObject *mb_mexp(PyObject *me, void *v, int n)
1421 { return mp_pywrap(mpbarrett_mexp(MPBARRETT_PY(me), MP_NEW, v, n)); }
1423 static PyObject *mbmeth_mexp(PyObject *me, PyObject *arg)
1425 return mexp_common(me, arg, sizeof(mp_expfactor),
1426 mp_mexp_id, mp_mexp_fill, mb_mexp, mp_mexp_drop);
1429 static PyObject *mbmeth_reduce(PyObject *me, PyObject *arg)
1434 if (!PyArg_ParseTuple(arg, "O&:reduce", convmp, &yy))
1436 z = mp_pywrap(mpbarrett_reduce(MPBARRETT_PY(me), MP_NEW, yy));
1441 static void mpbarrett_pydealloc(PyObject *me)
1443 mpbarrett_destroy(MPBARRETT_PY(me));
1447 static PyObject *mpbarrett_pynew(PyTypeObject *ty,
1448 PyObject *arg, PyObject *kw)
1450 mpbarrett_pyobj *mb = 0;
1451 char *kwlist[] = { "m", 0 };
1454 if (!PyArg_ParseTupleAndKeywords(arg, kw, "O&:new", kwlist, convmp, &xx))
1456 if (!MP_POSP(xx)) VALERR("m must be positive");
1457 mb = (mpbarrett_pyobj *)ty->tp_alloc(ty, 0);
1458 mpbarrett_create(&mb->mb, xx);
1460 if (xx) MP_DROP(xx);
1461 return ((PyObject *)mb);
1464 static PyObject *mbget_m(PyObject *me, void *hunoz)
1465 { return (mp_pywrap(MP_COPY(MPBARRETT_PY(me)->m))); }
1467 static PyGetSetDef mpbarrett_pygetset[] = {
1468 #define GETSETNAME(op, name) mb##op##_##name
1469 GET (m, "B.m -> modulus for reduction")
1474 static PyMethodDef mpbarrett_pymethods[] = {
1475 #define METHNAME(name) mbmeth_##name
1476 METH (reduce, "B.reduce(X) -> X mod B.m")
1477 METH (exp, "B.exp(X, N) -> X^N mod B.m")
1479 B.mexp([(X0, N0), (X1, N1), ...]) = X0^N0 X1^N1 ... mod B.m\n\
1480 \t(the list may be flattened if this more convenient.)")
1485 static PyTypeObject *mpbarrett_pytype, mpbarrett_pytype_skel = {
1486 PyObject_HEAD_INIT(0) 0, /* Header */
1487 "MPBarrett", /* @tp_name@ */
1488 sizeof(mpbarrett_pyobj), /* @tp_basicsize@ */
1489 0, /* @tp_itemsize@ */
1491 mpbarrett_pydealloc, /* @tp_dealloc@ */
1493 0, /* @tp_getattr@ */
1494 0, /* @tp_setattr@ */
1495 0, /* @tp_compare@ */
1497 0, /* @tp_as_number@ */
1498 0, /* @tp_as_sequence@ */
1499 0, /* @tp_as_mapping@ */
1503 0, /* @tp_getattro@ */
1504 0, /* @tp_setattro@ */
1505 0, /* @tp_as_buffer@ */
1506 Py_TPFLAGS_DEFAULT | /* @tp_flags@ */
1507 Py_TPFLAGS_BASETYPE,
1510 "A Barrett reduction context.",
1512 0, /* @tp_traverse@ */
1514 0, /* @tp_richcompare@ */
1515 0, /* @tp_weaklistoffset@ */
1517 0, /* @tp_iternext@ */
1518 mpbarrett_pymethods, /* @tp_methods@ */
1519 0, /* @tp_members@ */
1520 mpbarrett_pygetset, /* @tp_getset@ */
1523 0, /* @tp_descr_get@ */
1524 0, /* @tp_descr_set@ */
1525 0, /* @tp_dictoffset@ */
1527 PyType_GenericAlloc, /* @tp_alloc@ */
1528 mpbarrett_pynew, /* @tp_new@ */
1533 /*----- Nice prime reduction ----------------------------------------------*/
1535 typedef struct mpreduce_pyobj {
1540 #define MPREDUCE_PY(o) (&((mpreduce_pyobj *)(o))->mr)
1542 static PyObject *mrmeth_exp(PyObject *me, PyObject *arg)
1545 mp *yy = 0, *zz = 0;
1547 if (!PyArg_ParseTuple(arg, "O&O&:exp", convmp, &yy, convmp, &zz))
1550 if ((yy = mp_modinv_checked(yy, yy, MPREDUCE_PY(me)->p)) == 0) goto end;
1551 zz = mp_neg(zz, zz);
1553 rc = mp_pywrap(mpreduce_exp(MPREDUCE_PY(me), MP_NEW, yy, zz));
1555 if (yy) MP_DROP(yy); if (zz) MP_DROP(zz);
1559 static PyObject *mrmeth_reduce(PyObject *me, PyObject *arg)
1564 if (!PyArg_ParseTuple(arg, "O&:reduce", convmp, &yy)) goto end;
1565 z = mp_pywrap(mpreduce_do(MPREDUCE_PY(me), MP_NEW, yy));
1570 static void mpreduce_pydealloc(PyObject *me)
1572 mpreduce_destroy(MPREDUCE_PY(me));
1576 static PyObject *mpreduce_pynew(PyTypeObject *ty,
1577 PyObject *arg, PyObject *kw)
1579 mpreduce_pyobj *mr = 0;
1581 char *kwlist[] = { "m", 0 };
1584 if (!PyArg_ParseTupleAndKeywords(arg, kw, "O&:new", kwlist, convmp, &xx))
1586 if (!MP_POSP(xx)) VALERR("m must be positive");
1587 if (mpreduce_create(&r, xx)) VALERR("bad modulus (must be 2^k - ...)");
1588 mr = (mpreduce_pyobj *)ty->tp_alloc(ty, 0);
1591 if (xx) MP_DROP(xx);
1592 return ((PyObject *)mr);
1595 static PyObject *mrget_m(PyObject *me, void *hunoz)
1596 { return (mp_pywrap(MP_COPY(MPREDUCE_PY(me)->p))); }
1598 static PyGetSetDef mpreduce_pygetset[] = {
1599 #define GETSETNAME(op, name) mr##op##_##name
1600 GET (m, "R.m -> modulus for reduction")
1605 static PyMethodDef mpreduce_pymethods[] = {
1606 #define METHNAME(name) mrmeth_##name
1607 METH (reduce, "R.reduce(X) -> X mod B.m")
1608 METH (exp, "R.exp(X, N) -> X^N mod B.m")
1613 static PyTypeObject *mpreduce_pytype, mpreduce_pytype_skel = {
1614 PyObject_HEAD_INIT(0) 0, /* Header */
1615 "MPReduce", /* @tp_name@ */
1616 sizeof(mpreduce_pyobj), /* @tp_basicsize@ */
1617 0, /* @tp_itemsize@ */
1619 mpreduce_pydealloc, /* @tp_dealloc@ */
1621 0, /* @tp_getattr@ */
1622 0, /* @tp_setattr@ */
1623 0, /* @tp_compare@ */
1625 0, /* @tp_as_number@ */
1626 0, /* @tp_as_sequence@ */
1627 0, /* @tp_as_mapping@ */
1631 0, /* @tp_getattro@ */
1632 0, /* @tp_setattro@ */
1633 0, /* @tp_as_buffer@ */
1634 Py_TPFLAGS_DEFAULT | /* @tp_flags@ */
1635 Py_TPFLAGS_BASETYPE,
1638 "A reduction context for reduction modulo primes of special form.",
1640 0, /* @tp_traverse@ */
1642 0, /* @tp_richcompare@ */
1643 0, /* @tp_weaklistoffset@ */
1645 0, /* @tp_iternext@ */
1646 mpreduce_pymethods, /* @tp_methods@ */
1647 0, /* @tp_members@ */
1648 mpreduce_pygetset, /* @tp_getset@ */
1651 0, /* @tp_descr_get@ */
1652 0, /* @tp_descr_set@ */
1653 0, /* @tp_dictoffset@ */
1655 PyType_GenericAlloc, /* @tp_alloc@ */
1656 mpreduce_pynew, /* @tp_new@ */
1661 /*----- Chinese Remainder Theorem solution --------------------------------*/
1663 typedef struct mpcrt_pyobj {
1668 #define MPCRT_PY(o) (&((mpcrt_pyobj *)(o))->c)
1670 static PyObject *mcmeth_solve(PyObject *me, PyObject *arg)
1672 mpcrt *c = MPCRT_PY(me);
1673 PyObject *q = 0, *x, *z = 0;
1676 int i = 0, n = c->k;
1679 if (PyTuple_Size(arg) == n)
1681 else if (!PyArg_ParseTuple(arg, "O:solve", &q))
1684 if (!PySequence_Check(q)) TYERR("want a sequence of residues");
1685 if (PySequence_Size(q) != n) VALERR("residue count mismatch");
1686 v = xmalloc(n * sizeof(*v));
1687 for (i = 0; i < n; i++) {
1688 if ((x = PySequence_GetItem(q, i)) == 0) goto end;
1689 xx = getmp(x); Py_DECREF(x); if (!xx) goto end;
1692 z = mp_pywrap(mpcrt_solve(c, MP_NEW, v));
1696 for (i = 0; i < n; i++)
1705 static void mpcrt_pydealloc(PyObject *me)
1707 mpcrt *c = MPCRT_PY(me);
1712 static PyObject *mpcrt_pynew(PyTypeObject *ty, PyObject *arg, PyObject *kw)
1716 char *kwlist[] = { "mv", 0 };
1717 PyObject *q = 0, *x;
1721 if (PyTuple_Size(arg) > 1)
1723 else if (!PyArg_ParseTupleAndKeywords(arg, kw, "O:new", kwlist, &q))
1726 if (!PySequence_Check(q)) TYERR("want a sequence of moduli");
1727 n = PySequence_Size(q);
1728 if (PyErr_Occurred()) goto end;
1729 if (!n) VALERR("want at least one modulus");
1730 v = xmalloc(n * sizeof(*v));
1731 for (i = 0; i < n; i++) {
1732 if ((x = PySequence_GetItem(q, i)) == 0) goto end;
1733 xx = getmp(x); Py_DECREF(x); if (!xx) goto end;
1734 v[i].m = xx; v[i].n = 0; v[i].ni = 0; v[i].nni = 0;
1736 c = (mpcrt_pyobj *)ty->tp_alloc(ty, 0);
1737 mpcrt_create(&c->c, v, n, 0);
1739 return ((PyObject *)c);
1744 for (i = 0; i < n; i++)
1752 static PyObject *mcget_product(PyObject *me, void *hunoz)
1753 { return (mp_pywrap(MP_COPY(MPCRT_PY(me)->mb.m))); }
1755 static PyObject *mcget_moduli(PyObject *me, void *hunoz)
1759 mpcrt *c = MPCRT_PY(me);
1761 if ((q = PyList_New(c->k)) == 0) return (0);
1762 for (i = 0; i < c->k; i++)
1763 PyList_SetItem(q, i, mp_pywrap(c->v[i].m));
1767 static PyGetSetDef mpcrt_pygetset[] = {
1768 #define GETSETNAME(op, name) mc##op##_##name
1769 GET (product, "C.product -> product of moduli")
1770 GET (moduli, "C.moduli -> list of individual moduli")
1775 static PyMethodDef mpcrt_pymethods[] = {
1776 #define METHNAME(name) mcmeth_##name
1777 METH (solve, "C.solve([R0, R1]) -> X mod C.product")
1782 static PyTypeObject *mpcrt_pytype, mpcrt_pytype_skel = {
1783 PyObject_HEAD_INIT(0) 0, /* Header */
1784 "MPCRT", /* @tp_name@ */
1785 sizeof(mpcrt_pyobj), /* @tp_basicsize@ */
1786 0, /* @tp_itemsize@ */
1788 mpcrt_pydealloc, /* @tp_dealloc@ */
1790 0, /* @tp_getattr@ */
1791 0, /* @tp_setattr@ */
1792 0, /* @tp_compare@ */
1794 0, /* @tp_as_number@ */
1795 0, /* @tp_as_sequence@ */
1796 0, /* @tp_as_mapping@ */
1800 0, /* @tp_getattro@ */
1801 0, /* @tp_setattro@ */
1802 0, /* @tp_as_buffer@ */
1803 Py_TPFLAGS_DEFAULT | /* @tp_flags@ */
1804 Py_TPFLAGS_BASETYPE,
1807 "A context for the solution of Chinese Remainder Theorem problems.",
1809 0, /* @tp_traverse@ */
1811 0, /* @tp_richcompare@ */
1812 0, /* @tp_weaklistoffset@ */
1814 0, /* @tp_iternext@ */
1815 mpcrt_pymethods, /* @tp_methods@ */
1816 0, /* @tp_members@ */
1817 mpcrt_pygetset, /* @tp_getset@ */
1820 0, /* @tp_descr_get@ */
1821 0, /* @tp_descr_set@ */
1822 0, /* @tp_dictoffset@ */
1824 PyType_GenericAlloc, /* @tp_alloc@ */
1825 mpcrt_pynew, /* @tp_new@ */
1830 /*----- Binary polynomials ------------------------------------------------*/
1832 static PyObject *gf_pyrepr(PyObject *o)
1833 { return mp_topystring(MP_X(o), 16, "GF(", "0x", "L)"); }
1835 static PyObject *gf_pyrichcompare(PyObject *x, PyObject *y, int op)
1841 if (gfbinop(x, y, &xx, &yy)) RETURN_NOTIMPL;
1843 case Py_EQ: b = MP_EQ(xx, yy); break;
1844 case Py_NE: b = !MP_EQ(xx, yy); break;
1849 case Py_LT: b = xl < yl; break;
1850 case Py_LE: b = xl <= yl; break;
1851 case Py_GT: b = xl > yl; break;
1852 case Py_GE: b = xl >= yl; break;
1857 MP_DROP(xx); MP_DROP(yy);
1858 return (getbool(b));
1861 static PyObject *gf_pynew(PyTypeObject *ty, PyObject *arg, PyObject *kw)
1867 char *kwlist[] = { "x", "radix", 0 };
1869 if (!PyArg_ParseTupleAndKeywords(arg, kw, "O|i:gf", kwlist, &x, &radix))
1871 if (GF_PYCHECK(x)) RETURN_OBJ(x);
1872 if (!good_radix_p(radix, 1)) VALERR("radix out of range");
1873 if ((z = mp_frompyobject(x, radix)) == 0) {
1874 PyErr_Format(PyExc_TypeError, "can't convert %.100s to gf",
1875 x->ob_type->tp_name);
1880 VALERR("gf cannot be negative");
1882 zz = (mp_pyobj *)ty->tp_alloc(ty, 0);
1885 return ((PyObject *)zz);
1888 static long gf_pyhash(PyObject *me)
1890 long i = mp_tolong(MP_X(me));
1891 i ^= 0xc7ecd67c; /* random perturbance */
1897 static PyObject *gf_pyexp(PyObject *x, PyObject *y, PyObject *z)
1899 mp *xx = 0, *yy = 0, *zz = 0;
1903 if ((xx = tomp(x)) == 0 || (yy = tomp(y)) == 0 ||
1904 (z && z != Py_None && (zz = tomp(z)) == 0)) {
1905 mp_drop(xx); mp_drop(yy); mp_drop(zz);
1908 if (!z || z == Py_None) {
1909 if (MP_NEGP(yy)) VALERR("negative exponent");
1910 r = gf_exp(MP_NEW, xx, yy);
1913 if (MP_ZEROP(zz)) ZDIVERR("zero modulus");
1915 if ((xx = gf_modinv_checked(xx, xx, zz)) == 0) goto end;
1916 yy = mp_neg(yy, yy);
1918 gfreduce_create(&gr, zz);
1919 r = gfreduce_exp(&gr, MP_NEW, xx, yy);
1920 gfreduce_destroy(&gr);
1924 mp_drop(xx); mp_drop(yy); mp_drop(zz);
1928 static PyObject *gfmeth_sqr(PyObject *me, PyObject *arg)
1930 if (!PyArg_ParseTuple(arg, ":sqr")) return (0);
1931 return (gf_pywrap(gf_sqr(MP_NEW, MP_X(me))));
1934 static PyObject *gfmeth_gcd(PyObject *me, PyObject *arg)
1937 mp *yy = 0, *zz = MP_NEW;
1939 if (!PyArg_ParseTuple(arg, "O&:gcd", convgf, &yy)) goto end;
1940 gf_gcd(&zz, 0, 0, MP_X(me), yy);
1943 if (yy) MP_DROP(yy);
1947 static PyObject *gfmeth_gcdx(PyObject *me, PyObject *arg)
1950 mp *yy = 0, *zz = MP_NEW, *uu = MP_NEW, *vv = MP_NEW;
1952 if (!PyArg_ParseTuple(arg, "O&:gcdx", convgf, &yy))
1954 gf_gcd(&zz, &uu, &vv, MP_X(me), yy);
1955 z = Py_BuildValue("(NNN)",
1956 gf_pywrap(zz), gf_pywrap(uu), gf_pywrap(vv));
1958 if (yy) MP_DROP(yy);
1962 static PyObject *gfmeth_modinv(PyObject *me, PyObject *arg)
1965 mp *yy = 0, *zz = MP_NEW;
1967 if (!PyArg_ParseTuple(arg, "O&:modinv", convgf, &yy) ||
1968 (zz = gf_modinv_checked(MP_NEW, yy, MP_X(me))) == 0)
1972 if (yy) MP_DROP(yy);
1976 static PyObject *gfmeth_irreduciblep(PyObject *me, PyObject *arg)
1978 if (!PyArg_ParseTuple(arg, ":irreduciblep")) return (0);
1979 return getbool(gf_irreduciblep(MP_X(me)));
1982 static PyObject *gfget_degree(PyObject *me, void *hunoz)
1983 { return (PyInt_FromLong(mp_bits(MP_X(me)) - 1)); }
1985 static PyGetSetDef gf_pygetset[] = {
1986 #define GETSETNAME(op, name) gf##op##_##name
1987 GET (degree, "X.degree -> polynomial degree of X")
1989 #define GETSETNAME(op, name) mp##op##_##name
1990 GET (nbits, "X.nbits -> bit length of X")
1991 GET (noctets, "X.noctets -> octet length of X")
1996 static PyMethodDef gf_pymethods[] = {
1997 #define METHNAME(func) gfmeth_##func
1998 METH (setbit, "X.setbit(N) -> X with bit N set")
1999 METH (clearbit, "X.clearbit(N) -> X with bit N clear")
2000 METH (testbit, "X.testbit(N) -> true/false if bit N set/clear in X")
2001 METH (sqr, "X.sqr() -> X^2")
2002 METH (gcd, "X.gcd(Y) -> gcd(X, Y)")
2004 "X.gcdx(Y) -> (gcd(X, Y), U, V) with X U + Y V = gcd(X, Y)")
2005 METH (modinv, "X.modinv(Y) -> multiplicative inverse of Y mod X")
2006 METH (irreduciblep, "X.irreduciblep() -> true/false")
2008 #define METHNAME(func) mpmeth_##func
2009 KWMETH(tostring, "X.tostring(radix = 10) -> STR")
2010 KWMETH(storel, "X.storel(len = -1) -> little-endian bytes")
2011 KWMETH(storeb, "X.storeb(len = -1) -> big-endian bytes")
2013 "X.storel2c(len = -1) -> little-endian bytes, two's complement")
2015 "X.storeb2c(len = -1) -> big-endian bytes, two's complement")
2016 METH (tobuf, "X.tobuf() -> buffer format")
2021 static PyNumberMethods gf_pynumber = {
2022 gf_pyadd, /* @nb_add@ */
2023 gf_pysub, /* @nb_subtract@ */
2024 gf_pymul, /* @nb_multiply@ */
2025 0, /* @nb_divide@ */
2026 gf_pymod, /* @nb_remainder@ */
2027 gf_pydivmod, /* @nb_divmod@ */
2028 gf_pyexp, /* @nb_power@ */
2029 mp_pyid, /* @nb_negative@ */
2030 mp_pyid, /* @nb_positive@ */
2031 mp_pyid, /* @nb_absolute@ */
2032 mp_pynonzerop, /* @nb_nonzero@ */
2033 0 /* doesn't make any sense */, /* @nb_invert@ */
2034 gf_pylsl, /* @nb_lshift@ */
2035 gf_pylsr, /* @nb_rshift@ */
2036 gf_pyand, /* @nb_and@ */
2037 gf_pyxor, /* @nb_xor@ */
2038 gf_pyor, /* @nb_or@ */
2039 gf_pycoerce, /* @nb_coerce@ */
2040 mp_pyint, /* @nb_int@ */
2041 mp_pylong, /* @nb_long@ */
2042 0 /* doesn't make any sense */, /* @nb_float@ */
2043 mp_pyoct, /* @nb_oct@ */
2044 mp_pyhex, /* @nb_hex@ */
2046 0, /* @nb_inplace_add@ */
2047 0, /* @nb_inplace_subtract@ */
2048 0, /* @nb_inplace_multiply@ */
2049 0, /* @nb_inplace_divide@ */
2050 0, /* @nb_inplace_remainder@ */
2051 0, /* @nb_inplace_power@ */
2052 0, /* @nb_inplace_lshift@ */
2053 0, /* @nb_inplace_rshift@ */
2054 0, /* @nb_inplace_and@ */
2055 0, /* @nb_inplace_xor@ */
2056 0, /* @nb_inplace_or@ */
2058 gf_pydiv, /* @nb_floor_divide@ */
2059 0, /* @nb_true_divide@ */
2060 0, /* @nb_inplace_floor_divide@ */
2061 0, /* @nb_inplace_true_divide@ */
2064 static PyTypeObject gf_pytype_skel = {
2065 PyObject_HEAD_INIT(0) 0, /* Header */
2066 "GF", /* @tp_name@ */
2067 sizeof(mp_pyobj), /* @tp_basicsize@ */
2068 0, /* @tp_itemsize@ */
2070 mp_pydealloc, /* @tp_dealloc@ */
2072 0, /* @tp_getattr@ */
2073 0, /* @tp_setattr@ */
2074 0, /* @tp_compare@ */
2075 gf_pyrepr, /* @tp_repr@ */
2076 &gf_pynumber, /* @tp_as_number@ */
2077 0, /* @tp_as_sequence@ */
2078 0, /* @tp_as_mapping@ */
2079 gf_pyhash, /* @tp_hash@ */
2081 mp_pyhex, /* @tp_str@ */
2082 0, /* @tp_getattro@ */
2083 0, /* @tp_setattro@ */
2084 0, /* @tp_as_buffer@ */
2085 Py_TPFLAGS_DEFAULT | /* @tp_flags@ */
2086 Py_TPFLAGS_CHECKTYPES |
2087 Py_TPFLAGS_BASETYPE,
2090 "Binary polynomials. Support almost all the standard arithmetic\n\
2093 Constructor gf(X, radix = R) attempts to convert X to a `gf'. If\n\
2094 X is a string, it's read in radix-R form, or we look for a prefix\n\
2095 if R = 0. Other acceptable things are ints and longs.\n\
2097 The name is hopelessly wrong from a technical point of view, but\n\
2098 but it's much easier to type than `p2' or `c2' or whatever.\n\
2102 * Use `//' for division. GFs don't have `/' division.",
2104 0, /* @tp_traverse@ */
2106 gf_pyrichcompare, /* @tp_richcompare@ */
2107 0, /* @tp_weaklistoffset@ */
2109 0, /* @tp_iternext@ */
2110 gf_pymethods, /* @tp_methods@ */
2111 0, /* @tp_members@ */
2112 gf_pygetset, /* @tp_getset@ */
2115 0, /* @tp_descr_get@ */
2116 0, /* @tp_descr_set@ */
2117 0, /* @tp_dictoffset@ */
2119 PyType_GenericAlloc, /* @tp_alloc@ */
2120 gf_pynew, /* @tp_new@ */
2125 static PyObject *meth__GF_fromstring(PyObject *me,
2126 PyObject *arg, PyObject *kw)
2133 mptext_stringctx sc;
2134 char *kwlist[] = { "class", "x", "radix", 0 };
2136 if (!PyArg_ParseTupleAndKeywords(arg, kw, "Os#|i:fromstring",
2137 kwlist, &me, &p, &len, &r))
2139 if (!good_radix_p(r, 1)) VALERR("bad radix");
2140 sc.buf = p; sc.lim = p + len;
2141 if ((zz = mp_read(MP_NEW, r, &mptext_stringops, &sc)) == 0 ||
2143 if (zz) MP_DROP(zz);
2144 VALERR("bad binary polynomial");
2146 z = Py_BuildValue("(Ns#)", gf_pywrap(zz),
2147 sc.buf, (Py_ssize_t)(sc.lim - sc.buf));
2152 /*----- Sparse poly reduction ---------------------------------------------*/
2154 typedef struct gfreduce_pyobj {
2159 #define GFREDUCE_PY(o) (&((gfreduce_pyobj *)(o))->mr)
2161 static PyObject *grmeth_exp(PyObject *me, PyObject *arg)
2164 mp *yy = 0, *zz = 0;
2166 if (!PyArg_ParseTuple(arg, "O&O&:exp", convgf, &yy, convgf, &zz))
2169 if ((yy = gf_modinv_checked(yy, yy, GFREDUCE_PY(me)->p)) == 0) goto end;
2170 zz = mp_neg(zz, zz);
2172 rc = gf_pywrap(gfreduce_exp(GFREDUCE_PY(me), MP_NEW, yy, zz));
2174 if (yy) MP_DROP(yy); if (zz) MP_DROP(zz);
2178 static PyObject *grmeth_trace(PyObject *me, PyObject *arg)
2183 if (!PyArg_ParseTuple(arg, "O&:trace", convgf, &xx)) goto end;
2184 rc = PyInt_FromLong(gfreduce_trace(GFREDUCE_PY(me), xx));
2186 if (xx) MP_DROP(xx);
2190 static PyObject *grmeth_halftrace(PyObject *me, PyObject *arg)
2195 if (!PyArg_ParseTuple(arg, "O&:halftrace", convgf, &xx)) goto end;
2196 rc = gf_pywrap(gfreduce_halftrace(GFREDUCE_PY(me), MP_NEW, xx));
2198 if (xx) MP_DROP(xx);
2202 static PyObject *grmeth_sqrt(PyObject *me, PyObject *arg)
2207 if (!PyArg_ParseTuple(arg, "O&:sqrt", convgf, &xx)) goto end;
2208 if ((yy = gfreduce_sqrt(GFREDUCE_PY(me), MP_NEW, xx)) == 0)
2209 VALERR("no modular square root");
2212 if (xx) MP_DROP(xx);
2216 static PyObject *grmeth_quadsolve(PyObject *me, PyObject *arg)
2221 if (!PyArg_ParseTuple(arg, "O&:quadsolve", convgf, &xx)) goto end;
2222 if ((yy = gfreduce_quadsolve(GFREDUCE_PY(me), MP_NEW, xx)) == 0)
2223 VALERR("no solution found");
2226 if (xx) MP_DROP(xx);
2230 static PyObject *grmeth_reduce(PyObject *me, PyObject *arg)
2235 if (!PyArg_ParseTuple(arg, "O&:reduce", convgf, &yy)) goto end;
2236 z = gf_pywrap(gfreduce_do(GFREDUCE_PY(me), MP_NEW, yy));
2241 static void gfreduce_pydealloc(PyObject *me)
2243 gfreduce_destroy(GFREDUCE_PY(me));
2247 static PyObject *gfreduce_pynew(PyTypeObject *ty,
2248 PyObject *arg, PyObject *kw)
2250 gfreduce_pyobj *mr = 0;
2252 char *kwlist[] = { "m", 0 };
2255 if (!PyArg_ParseTupleAndKeywords(arg, kw, "O&:new", kwlist, convgf, &xx))
2257 if (MP_ZEROP(xx)) ZDIVERR("modulus is zero!");
2258 gfreduce_create(&r, xx);
2259 mr = (gfreduce_pyobj *)ty->tp_alloc(ty, 0);
2262 if (xx) MP_DROP(xx);
2263 return ((PyObject *)mr);
2266 static PyObject *grget_m(PyObject *me, void *hunoz)
2267 { return (gf_pywrap(MP_COPY(GFREDUCE_PY(me)->p))); }
2269 static PyGetSetDef gfreduce_pygetset[] = {
2270 #define GETSETNAME(op, name) gr##op##_##name
2271 GET (m, "R.m -> reduction polynomial")
2276 static PyMethodDef gfreduce_pymethods[] = {
2277 #define METHNAME(name) grmeth_##name
2278 METH (reduce, "R.reduce(X) -> X mod B.m")
2279 METH (trace, "R.trace(X) -> Tr(X) = x + x^2 + ... + x^{2^{m - 1}}")
2280 METH (halftrace, "R.halftrace(X) -> x + x^{2^2} + ... + x^{2^{m - 1}}")
2281 METH (sqrt, "R.sqrt(X) -> Y where Y^2 = X mod R")
2282 METH (quadsolve, "R.quadsolve(X) -> Y where Y^2 + Y = X mod R")
2283 METH (exp, "R.exp(X, N) -> X^N mod B.m")
2288 static PyTypeObject *gfreduce_pytype, gfreduce_pytype_skel = {
2289 PyObject_HEAD_INIT(0) 0, /* Header */
2290 "GFReduce", /* @tp_name@ */
2291 sizeof(gfreduce_pyobj), /* @tp_basicsize@ */
2292 0, /* @tp_itemsize@ */
2294 gfreduce_pydealloc, /* @tp_dealloc@ */
2296 0, /* @tp_getattr@ */
2297 0, /* @tp_setattr@ */
2298 0, /* @tp_compare@ */
2300 0, /* @tp_as_number@ */
2301 0, /* @tp_as_sequence@ */
2302 0, /* @tp_as_mapping@ */
2306 0, /* @tp_getattro@ */
2307 0, /* @tp_setattro@ */
2308 0, /* @tp_as_buffer@ */
2309 Py_TPFLAGS_DEFAULT | /* @tp_flags@ */
2310 Py_TPFLAGS_BASETYPE,
2313 "A reduction context for reduction modulo sparse irreducible polynomials.",
2315 0, /* @tp_traverse@ */
2317 0, /* @tp_richcompare@ */
2318 0, /* @tp_weaklistoffset@ */
2320 0, /* @tp_iternext@ */
2321 gfreduce_pymethods, /* @tp_methods@ */
2322 0, /* @tp_members@ */
2323 gfreduce_pygetset, /* @tp_getset@ */
2326 0, /* @tp_descr_get@ */
2327 0, /* @tp_descr_set@ */
2328 0, /* @tp_dictoffset@ */
2330 PyType_GenericAlloc, /* @tp_alloc@ */
2331 gfreduce_pynew, /* @tp_new@ */
2336 /*----- Normal/poly transformation ----------------------------------------*/
2338 typedef struct gfn_pyobj {
2344 static PyTypeObject *gfn_pytype, gfn_pytype_skel;
2346 #define GFN_P(o) (((gfn_pyobj *)(o))->p)
2347 #define GFN_PTON(o) (&((gfn_pyobj *)(o))->pton)
2348 #define GFN_NTOP(o) (&((gfn_pyobj *)(o))->ntop)
2350 static PyObject *gfn_pynew(PyTypeObject *ty, PyObject *arg, PyObject *kw)
2352 mp *p = 0, *beta = 0;
2354 char *kwlist[] = { "p", "beta", 0 };
2356 if (!PyArg_ParseTupleAndKeywords(arg, kw, "O&O&:new", kwlist,
2357 convgf, &p, convgf, &beta))
2359 gg = PyObject_New(gfn_pyobj, ty);
2360 if (gfn_create(p, beta, &gg->ntop, &gg->pton)) {
2363 VALERR("can't invert transformation matrix");
2369 return ((PyObject *)gg);
2372 static PyObject *gfnget_p(PyObject *me, void *hunoz)
2373 { return (gf_pywrap(MP_COPY(GFN_P(me)))); }
2375 static PyObject *gfnget_beta(PyObject *me, void *hunoz)
2377 gfn *n = GFN_NTOP(me);
2378 mp *x = n->r[n->n - 1];
2379 return (gf_pywrap(MP_COPY(x)));
2382 #define XFORMOP(name, NAME) \
2383 static PyObject *gfnmeth_##name(PyObject *me, PyObject *arg) \
2388 if (!PyArg_ParseTuple(arg, "O&:" #name, convgf, &xx)) goto end; \
2389 z = gfn_transform(GFN_##NAME(me), MP_NEW, xx); \
2392 if (!z) return (0); \
2393 return (mp_pywrap(z)); \
2399 static void gfn_pydealloc(PyObject *me)
2401 gfn_destroy(GFN_PTON(me));
2402 gfn_destroy(GFN_NTOP(me));
2406 static PyGetSetDef gfn_pygetset[] = {
2407 #define GETSETNAME(op, name) gfn##op##_##name
2408 GET (p, "X.p -> polynomial basis, as polynomial")
2409 GET (beta, "X.beta -> normal basis element, in poly form")
2414 static PyMethodDef gfn_pymethods[] = {
2415 #define METHNAME(name) gfnmeth_##name
2416 METH (pton, "X.pton(A) -> normal-basis representation of A")
2417 METH (ntop, "X.ntop(A) -> polynomial-basis representation of A")
2422 static PyTypeObject gfn_pytype_skel = {
2423 PyObject_HEAD_INIT(0) 0, /* Header */
2424 "GFN", /* @tp_name@ */
2425 sizeof(gfn_pyobj), /* @tp_basicsize@ */
2426 0, /* @tp_itemsize@ */
2428 gfn_pydealloc, /* @tp_dealloc@ */
2430 0, /* @tp_getattr@ */
2431 0, /* @tp_setattr@ */
2432 0, /* @tp_compare@ */
2434 0, /* @tp_as_number@ */
2435 0, /* @tp_as_sequence@ */
2436 0, /* @tp_as_mapping@ */
2440 0, /* @tp_getattro@ */
2441 0, /* @tp_setattro@ */
2442 0, /* @tp_as_buffer@ */
2443 Py_TPFLAGS_DEFAULT | /* @tp_flags@ */
2444 Py_TPFLAGS_BASETYPE,
2447 "An object for transforming elements of binary fields between polynomial\n\
2448 and normal basis representations.",
2450 0, /* @tp_traverse@ */
2452 0, /* @tp_richcompare@ */
2453 0, /* @tp_weaklistoffset@ */
2455 0, /* @tp_iternext@ */
2456 gfn_pymethods, /* @tp_methods@ */
2457 0, /* @tp_members@ */
2458 gfn_pygetset, /* @tp_getset@ */
2461 0, /* @tp_descr_get@ */
2462 0, /* @tp_descr_set@ */
2463 0, /* @tp_dictoffset@ */
2465 PyType_GenericAlloc, /* @tp_alloc@ */
2466 gfn_pynew, /* @tp_new@ */
2471 /*----- Glue --------------------------------------------------------------*/
2473 static PyMethodDef methods[] = {
2474 #define METHNAME(func) meth_##func
2475 KWMETH(_MP_fromstring, "\
2476 fromstring(STR, radix = 0) -> (X, REST)\n\
2478 Parse STR as a large integer, according to radix. If radix is zero,\n\
2479 read a prefix from STR to decide radix: allow `0' for octal, `0x' for hex\n\
2480 or `R_' for other radix R.")
2481 KWMETH(_GF_fromstring, "\
2482 fromstring(STR, radix = 0) -> (X, REST)\n\
2484 Parse STR as a binary polynomial, according to radix. If radix is zero,\n\
2485 read a prefix from STR to decide radix: allow `0' for octal, `0x' for hex\n\
2486 or `R_' for other radix R.")
2487 METH (_MP_factorial, "\
2488 factorial(I) -> I!: compute factorial")
2489 METH (_MP_fibonacci, "\
2490 fibonacci(I) -> F(I): compute Fibonacci number")
2492 loadl(STR) -> X: read little-endian bytes")
2494 loadb(STR) -> X: read big-endian bytes")
2495 METH (_MP_loadl2c, "\
2496 loadl2c(STR) -> X: read little-endian bytes, two's complement")
2497 METH (_MP_loadb2c, "\
2498 loadb2c(STR) -> X: read big-endian bytes, two's complement")
2499 METH (_MP_frombuf, "\
2500 frombuf(STR) -> (X, REST): read buffer format")
2502 loadl(STR) -> X: read little-endian bytes")
2504 loadb(STR) -> X: read big-endian bytes")
2505 METH (_GF_frombuf, "\
2506 frombuf(STR) -> (X, REST): read buffer format")
2511 void mp_pyinit(void)
2515 INITTYPE(mpmul, root);
2516 INITTYPE(mpmont, root);
2517 INITTYPE(mpbarrett, root);
2518 INITTYPE(mpreduce, root);
2519 INITTYPE(mpcrt, root);
2520 INITTYPE(gfreduce, root);
2521 INITTYPE(gfn, root);
2522 addmethods(methods);
2525 void mp_pyinsert(PyObject *mod)
2527 INSERT("MP", mp_pytype);
2528 INSERT("MPMul", mpmul_pytype);
2529 INSERT("MPMont", mpmont_pytype);
2530 INSERT("MPBarrett", mpbarrett_pytype);
2531 INSERT("MPReduce", mpreduce_pytype);
2532 INSERT("MPCRT", mpcrt_pytype);
2533 INSERT("GF", gf_pytype);
2534 INSERT("GFReduce", gfreduce_pytype);
2535 INSERT("GFN", gfn_pytype);
2538 /*----- That's all, folks -------------------------------------------------*/