/* -*-c-*-
*
- * $Id: mpcrt.c,v 1.2 1999/12/10 23:22:32 mdw Exp $
+ * $Id: mpcrt.c,v 1.5 2001/04/29 17:39:33 mdw Exp $
*
* Chinese Remainder Theorem computations (Gauss's algorithm)
*
/*----- Revision history --------------------------------------------------*
*
* $Log: mpcrt.c,v $
+ * Revision 1.5 2001/04/29 17:39:33 mdw
+ * Fix memory leak.
+ *
+ * Revision 1.4 2001/04/19 18:25:38 mdw
+ * Use mpmul for the multiplication.
+ *
+ * Revision 1.3 2000/10/08 12:11:22 mdw
+ * Use @MP_EQ@ instead of @MP_CMP@.
+ *
* Revision 1.2 1999/12/10 23:22:32 mdw
* Interface changes for suggested destinations. Use Barrett reduction.
*
#include "mp.h"
#include "mpcrt.h"
+#include "mpmul.h"
#include "mpbarrett.h"
/*----- Main code ---------------------------------------------------------*/
if (n != MP_NEW)
n = MP_COPY(n);
else {
- n = MP_COPY(v[0].m);
- for (i = 1; i < k; i++)
- n = mp_mul(n, n, v[i].m);
+ mpmul mm;
+ mpmul_init(&mm);
+ for (i = 0; i < k; i++)
+ mpmul_add(&mm, v[i].m);
+ n = mpmul_done(&mm);
}
/* --- A quick hack if %$k = 2$% --- */
mpcrt_create(&c, m, n, 0);
b = mpcrt_solve(&c, MP_NEW, r);
- if (MP_CMP(a, !=, b)) {
+ if (!MP_EQ(a, b)) {
fputs("\n*** failed\n", stderr);
fputs("n = ", stderr);
mp_writefile(c.mb.m, stderr, 10);