projects
/
u
/
mdw
/
catacomb
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
New interface for computing products of many (small) integers.
[u/mdw/catacomb]
/
pfilt.c
diff --git
a/pfilt.c
b/pfilt.c
index
0eb6054
..
eda5116
100644
(file)
--- a/
pfilt.c
+++ b/
pfilt.c
@@
-1,6
+1,6
@@
/* -*-c-*-
*
/* -*-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
*
*
* Finding and testing prime numbers
*
@@
-30,6
+30,9
@@
/*----- Revision history --------------------------------------------------*
*
* $Log: pfilt.c,v $
/*----- 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.
*
* Revision 1.1 1999/12/22 15:49:39 mdw
* Renamed from `pgen'. Reworking for new prime-search system.
*
@@
-189,10
+192,9
@@
int pfilt_muladd(pfilt *p, const pfilt *q, mpw m, mpw a)
/* --- Multiply the big number --- */
{
/* --- 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);
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);
if (p == q)
mp_drop(p->m);
mp_shrink(d);