/* -*-c-*-
*
- * $Id: pfilt.c,v 1.4 2000/10/08 12:14:57 mdw Exp $
+ * $Id: pfilt.c,v 1.6 2004/04/08 01:36:15 mdw Exp $
*
* Finding and testing prime numbers
*
* MA 02111-1307, USA.
*/
-/*----- Revision history --------------------------------------------------*
- *
- * $Log: pfilt.c,v $
- * Revision 1.4 2000/10/08 12:14:57 mdw
- * Remove vestiges of @primorial@.
- *
- * Revision 1.3 2000/08/15 21:44:27 mdw
- * (pfilt_smallfactor): New function for doing trial division the hard
- * way.
- *
- * (pfilt_create): Use @mpx_udivn@ for computing residues, for improved
- * performance.
- *
- * Pull the `small prime' test into a separate function, and do it
- * properly.
- *
- * Revision 1.2 2000/06/17 11:54:27 mdw
- * Use new MP memory management functions.
- *
- * Revision 1.1 1999/12/22 15:49:39 mdw
- * Renamed from `pgen'. Reworking for new prime-search system.
- *
- * Revision 1.3 1999/12/10 23:28:35 mdw
- * Track suggested destination changes.
- *
- * Revision 1.2 1999/11/20 22:23:05 mdw
- * Add multiply-and-add function for Diffie-Hellman safe prime generation.
- *
- * Revision 1.1 1999/11/19 13:17:57 mdw
- * Prime number generator and tester.
- *
- */
-
/*----- Header files ------------------------------------------------------*/
#include "mp.h"
int rc = PGEN_TRY;
int i;
size_t sz = MP_LEN(m);
- mpw *v = mpalloc(m->a, sz);
+ mparena *a = m->a ? m->a : MPARENA_GLOBAL;
+ mpw *v = mpalloc(a, sz);
/* --- Fill in the residues --- */
/* --- Done --- */
- mpfree(m->a, v);
+ mpfree(a, v);
return (rc);
}
int rc = PGEN_TRY;
int i;
size_t sz = MP_LEN(m);
- mpw *v = mpalloc(m->a, sz);
+ mparena *a = m->a ? m->a : MPARENA_GLOBAL;
+ mpw *v = mpalloc(a, sz);
/* --- Take a copy of the number --- */
/* --- Done --- */
- mpfree(m->a, v);
+ mpfree(a, v);
return (rc);
}