| 1 | /* -*-c-*- |
| 2 | * |
| 3 | * Where the fun begins |
| 4 | * |
| 5 | * (c) 2004 Straylight/Edgeware |
| 6 | */ |
| 7 | |
| 8 | /*----- Licensing notice --------------------------------------------------* |
| 9 | * |
| 10 | * This file is part of the Python interface to Catacomb. |
| 11 | * |
| 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. |
| 16 | * |
| 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. |
| 21 | * |
| 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. |
| 25 | */ |
| 26 | |
| 27 | /*----- Header files ------------------------------------------------------*/ |
| 28 | |
| 29 | #include "catacomb-python.h" |
| 30 | |
| 31 | /*----- Main code ---------------------------------------------------------*/ |
| 32 | |
| 33 | static const struct nameval consts[] = { |
| 34 | #define C(x) { #x, x } |
| 35 | C(FTY_PRIME), C(FTY_BINARY), |
| 36 | C(PGEN_PASS), C(PGEN_FAIL), C(PGEN_BEGIN), C(PGEN_TRY), C(PGEN_DONE), |
| 37 | C(PGEN_ABORT), |
| 38 | C(MPW_MAX), |
| 39 | C(PMODE_READ), C(PMODE_VERIFY), |
| 40 | C(KOPEN_READ), C(KOPEN_WRITE), C(KOPEN_NOFILE), |
| 41 | C(KEXP_FOREVER), C(KEXP_EXPIRE), |
| 42 | C(KF_ENCMASK), C(KENC_BINARY), C(KENC_MP), C(KENC_STRUCT), |
| 43 | C(KENC_ENCRYPT), C(KENC_STRING), C(KENC_EC), |
| 44 | C(KF_CATMASK), C(KCAT_SYMM), C(KCAT_PRIV), C(KCAT_PUB), C(KCAT_SHARE), |
| 45 | C(KF_NONSECRET), |
| 46 | C(KF_BURN), C(KF_OPT), |
| 47 | C(EC_XONLY), C(EC_YBIT), C(EC_LSB), C(EC_CMPR), C(EC_EXPLY), C(EC_SORT), |
| 48 | #define ENTRY(tag, val, str) C(KERR_##tag), |
| 49 | KEY_ERRORS(ENTRY) |
| 50 | #undef ENTRY |
| 51 | #undef C |
| 52 | { 0 } |
| 53 | }; |
| 54 | |
| 55 | PyObject *mexp_common(PyObject *me, PyObject *arg, |
| 56 | size_t efsz, |
| 57 | PyObject *(*id)(PyObject *), |
| 58 | int (*fill)(void *, PyObject *, |
| 59 | PyObject *, PyObject *), |
| 60 | PyObject *(*exp)(PyObject *, void *, int), |
| 61 | void (*drop)(void *)) |
| 62 | { |
| 63 | int i = 0, j, n, flat; |
| 64 | PyObject *qq, *x, *y, *z = 0; |
| 65 | char *v = 0, *vv; |
| 66 | |
| 67 | if (PyTuple_Size(arg) == 1) |
| 68 | arg = PyTuple_GetItem(arg, 0); |
| 69 | Py_INCREF(arg); |
| 70 | if (!PySequence_Check(arg)) TYERR("not a sequence"); |
| 71 | n = PySequence_Size(arg); if (!n) { z = id(me); goto end; } |
| 72 | x = PySequence_GetItem(arg, 0); |
| 73 | if (PySequence_Check(x)) |
| 74 | flat = 0; |
| 75 | else { |
| 76 | if (n % 2) VALERR("must have even number of arguments"); |
| 77 | n /= 2; |
| 78 | flat = 1; |
| 79 | } |
| 80 | Py_DECREF(x); |
| 81 | |
| 82 | v = xmalloc(n * efsz); |
| 83 | for (i = j = 0, vv = v; i < n; i++, vv += efsz) { |
| 84 | if (flat) { |
| 85 | x = PySequence_GetItem(arg, j++); |
| 86 | y = PySequence_GetItem(arg, j++); |
| 87 | } else { |
| 88 | qq = PySequence_GetItem(arg, j++); |
| 89 | if (!qq) goto end; |
| 90 | if (!PySequence_Check(qq) || PySequence_Size(qq) != 2) { |
| 91 | Py_DECREF(qq); |
| 92 | TYERR("want a sequence of pairs"); |
| 93 | } |
| 94 | x = PySequence_GetItem(qq, 0); |
| 95 | y = PySequence_GetItem(qq, 1); |
| 96 | Py_DECREF(qq); |
| 97 | } |
| 98 | if (!x || !y) goto end; |
| 99 | if (fill(vv, me, x, y)) { |
| 100 | Py_DECREF(x); |
| 101 | Py_DECREF(y); |
| 102 | if (!PyErr_Occurred()) |
| 103 | PyErr_SetString(PyExc_TypeError, "type mismatch"); |
| 104 | goto end; |
| 105 | } |
| 106 | Py_DECREF(x); |
| 107 | Py_DECREF(y); |
| 108 | } |
| 109 | z = exp(me, v, n); |
| 110 | |
| 111 | end: |
| 112 | if (v) { |
| 113 | for (j = 0, vv = v; j < i; j++, vv += efsz) |
| 114 | drop(vv); |
| 115 | xfree(v); |
| 116 | } |
| 117 | Py_DECREF(arg); |
| 118 | return (z); |
| 119 | } |
| 120 | |
| 121 | static PyObject *smallprimes(void) |
| 122 | { |
| 123 | PyObject *v = PyList_New(NPRIME); |
| 124 | int i; |
| 125 | |
| 126 | for (i = 0; i < NPRIME; i++) |
| 127 | PyList_SetItem(v, i, PyInt_FromLong(primetab[i])); |
| 128 | return (v); |
| 129 | } |
| 130 | |
| 131 | static PyObject *meth__ego(PyObject *me, PyObject *arg) |
| 132 | { |
| 133 | char *argv0; |
| 134 | if (!PyArg_ParseTuple(arg, "s:_ego", &argv0)) |
| 135 | return (0); |
| 136 | if (strcmp(QUIS, "<UNNAMED>") == 0) |
| 137 | ego(argv0); |
| 138 | RETURN_NONE; |
| 139 | } |
| 140 | |
| 141 | static PyMethodDef methods[] = { |
| 142 | #define METHNAME(func) meth_##func |
| 143 | METH (_ego, "_ego(ARGV0)") |
| 144 | #undef METHNAME |
| 145 | { 0 } |
| 146 | }; |
| 147 | |
| 148 | static void init_random(void) |
| 149 | { |
| 150 | #if PY_MAJOR_VERSION >= 3 || (PY_MAJOR_VERSION == 2 && PY_MINOR_VERSION >= 6) |
| 151 | char *seed; |
| 152 | uint32 r; |
| 153 | |
| 154 | if (!Py_HashRandomizationFlag) return; |
| 155 | seed = getenv("PYTHONHASHSEED"); |
| 156 | if (!seed || strcmp(seed, "random") == 0) r = GR_WORD(&rand_global); |
| 157 | else r = strtoul(seed, 0, 0); |
| 158 | if (!r) r = 0xe011f220; /* zero doesn't work well */ |
| 159 | unihash_setkey(&unihash_global, r); |
| 160 | #endif |
| 161 | } |
| 162 | |
| 163 | void init_base(void) |
| 164 | { |
| 165 | PyObject *mod; |
| 166 | addmethods(methods); |
| 167 | INIT_MODULES; |
| 168 | init_random(); |
| 169 | mod = Py_InitModule("catacomb._base", donemethods()); |
| 170 | INSERT_MODULES; |
| 171 | INSERT("smallprimes", smallprimes()); |
| 172 | setconstants(mod, consts); |
| 173 | } |
| 174 | |
| 175 | /*----- That's all, folks -------------------------------------------------*/ |