/* -*-c-*-
*
- * $Id: pfilt.c,v 1.1 1999/12/22 15:49:39 mdw Exp $
+ * $Id: pfilt.c,v 1.2 2000/06/17 11:54:27 mdw Exp $
*
* Finding and testing prime numbers
*
/*----- Revision history --------------------------------------------------*
*
* $Log: pfilt.c,v $
+ * 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.
*
/* --- Multiply the big number --- */
{
- mp *d = mp_create(MP_LEN(q->m) + 2);
+ mp *d = mp_new(MP_LEN(q->m) + 2, q->m->f);
mpx_umuln(d->v, d->vl, q->m->v, q->m->vl, m);
mpx_uaddn(d->v, d->vl, a);
- d->f = q->m->f;
if (p == q)
mp_drop(p->m);
mp_shrink(d);