* (c) 1999 Straylight/Edgeware
*/
-/*----- Licensing notice --------------------------------------------------*
+/*----- Licensing notice --------------------------------------------------*
*
* This file is part of Catacomb.
*
* it under the terms of the GNU Library General Public License as
* published by the Free Software Foundation; either version 2 of the
* License, or (at your option) any later version.
- *
+ *
* Catacomb is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Library General Public License for more details.
- *
+ *
* You should have received a copy of the GNU Library General Public
* License along with Catacomb; if not, write to the Free
* Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
mp *x = MP_ONE, *X = MP_ZERO;
mp *y = MP_ZERO, *Y = MP_ONE;
mp *u, *v;
- mp *q = MP_NEW;
+ mp *q = MP_NEW, *t, *spare = MP_NEW;
unsigned f = 0;
#define f_swap 1u
*/
if (MPX_UCMP(a->v, a->vl, <, b->v, b->vl)) {
- { mp *t = a; a = b; b = t; }
+ t = a; a = b; b = t;
f |= f_swap;
}
/* --- Check for zeroness --- */
- if (MP_EQ(b, MP_ZERO)) {
+ if (MP_ZEROP(b)) {
/* --- Store %$|a|$% as the GCD --- */
if (f & f_ext) {
if (f & f_swap) {
- mp **t = xx; xx = yy; yy = t;
+ mp **tt = xx; xx = yy; yy = tt;
}
if (xx) {
if (*xx) MP_DROP(*xx);
/* --- Main extended Euclidean algorithm --- */
while (!MP_ZEROP(v)) {
- mp *t;
mp_div(&q, &u, u, v);
if (f & f_ext) {
- t = mp_mul(MP_NEW, X, q);
+ t = mp_mul(spare, X, q);
t = mp_sub(t, x, t);
- MP_DROP(x); x = X; X = t;
- t = mp_mul(MP_NEW, Y, q);
+ spare = x; x = X; X = t;
+ t = mp_mul(spare, Y, q);
t = mp_sub(t, y, t);
- MP_DROP(y); y = Y; Y = t;
+ spare = y; y = Y; Y = t;
}
t = u; u = v; v = t;
}
- MP_DROP(q);
+ MP_DROP(q); if (spare) MP_DROP(spare);
if (!gcd)
MP_DROP(u);
else {
/* --- If @a@ and @b@ got swapped, swap the coefficients back --- */
if (f & f_swap) {
- mp *t = x; x = y; y = t;
+ t = x; x = y; y = t;
t = a; a = b; b = t;
}
mp *y = mp_modinv(MP_NEW, x, m);
if (!MP_EQ(y, r)) {
fputs("\n*** mp_modinv failed", stderr);
- fputs("\nx = ", stderr); mp_writefile(x, stderr, 10);
- fputs("\nm = ", stderr); mp_writefile(m, stderr, 10);
+ fputs("\nx = ", stderr); mp_writefile(x, stderr, 10);
+ fputs("\nm = ", stderr); mp_writefile(m, stderr, 10);
fputs("\nexpect = ", stderr); mp_writefile(r, stderr, 10);
fputs("\nresult = ", stderr); mp_writefile(y, stderr, 10);
ok = 0;
}
MP_DROP(x); MP_DROP(m); MP_DROP(r); MP_DROP(y);
assert(mparena_count(MPARENA_GLOBAL) == 0);
- return (ok);
+ return (ok);
}
static int gcd(dstr *v)
mp_gcd(&gg, &xx, &yy, a, b);
if (!MP_EQ(x, xx)) {
fputs("\n*** mp_gcd(x) failed", stderr);
- fputs("\na = ", stderr); mp_writefile(a, stderr, 10);
- fputs("\nb = ", stderr); mp_writefile(b, stderr, 10);
+ fputs("\na = ", stderr); mp_writefile(a, stderr, 10);
+ fputs("\nb = ", stderr); mp_writefile(b, stderr, 10);
fputs("\nexpect = ", stderr); mp_writefile(x, stderr, 10);
fputs("\nresult = ", stderr); mp_writefile(xx, stderr, 10);
fputc('\n', stderr);
}
if (!MP_EQ(y, yy)) {
fputs("\n*** mp_gcd(y) failed", stderr);
- fputs("\na = ", stderr); mp_writefile(a, stderr, 10);
- fputs("\nb = ", stderr); mp_writefile(b, stderr, 10);
+ fputs("\na = ", stderr); mp_writefile(a, stderr, 10);
+ fputs("\nb = ", stderr); mp_writefile(b, stderr, 10);
fputs("\nexpect = ", stderr); mp_writefile(y, stderr, 10);
fputs("\nresult = ", stderr); mp_writefile(yy, stderr, 10);
fputc('\n', stderr);
if (!MP_EQ(g, gg)) {
fputs("\n*** mp_gcd(gcd) failed", stderr);
- fputs("\na = ", stderr); mp_writefile(a, stderr, 10);
- fputs("\nb = ", stderr); mp_writefile(b, stderr, 10);
+ fputs("\na = ", stderr); mp_writefile(a, stderr, 10);
+ fputs("\nb = ", stderr); mp_writefile(b, stderr, 10);
fputs("\nexpect = ", stderr); mp_writefile(g, stderr, 10);
fputs("\nresult = ", stderr); mp_writefile(gg, stderr, 10);
fputc('\n', stderr);