3 * $Id: pgen.c,v 1.7 2001/02/03 16:05:32 mdw Exp $
5 * Prime generation glue
7 * (c) 1999 Straylight/Edgeware
10 /*----- Licensing notice --------------------------------------------------*
12 * This file is part of Catacomb.
14 * Catacomb is free software; you can redistribute it and/or modify
15 * it under the terms of the GNU Library General Public License as
16 * published by the Free Software Foundation; either version 2 of the
17 * License, or (at your option) any later version.
19 * Catacomb is distributed in the hope that it will be useful,
20 * but WITHOUT ANY WARRANTY; without even the implied warranty of
21 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
22 * GNU Library General Public License for more details.
24 * You should have received a copy of the GNU Library General Public
25 * License along with Catacomb; if not, write to the Free
26 * Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
30 /*----- Revision history --------------------------------------------------*
33 * Revision 1.7 2001/02/03 16:05:32 mdw
34 * Now @mp_drop@ checks its argument is non-NULL before attempting to free
35 * it. Note that the macro version @MP_DROP@ doesn't do this.
37 * Revision 1.6 2000/10/08 12:11:22 mdw
38 * Use @MP_EQ@ instead of @MP_CMP@.
40 * Revision 1.5 2000/06/17 11:52:36 mdw
41 * Signal a pgen abort if the jump and base share a common factor.
43 * Revision 1.4 1999/12/22 16:01:11 mdw
44 * Same file, completely different code. Main interface for new prime-
49 /*----- Header files ------------------------------------------------------*/
64 /*----- Standard prime filter ---------------------------------------------*/
66 /* --- @pgen_filter@ --- */
68 int pgen_filter(int rq
, pgen_event
*ev
, void *p
)
70 pgen_filterctx
*f
= p
;
75 rc
= pfilt_create(&f
->f
, ev
->m
);
80 if (!((f
->step
| f
->f
.m
->v
[0]) & 1))
81 rc
= pfilt_step(&f
->f
, 1);
83 rc
= pfilt_step(&f
->f
, f
->step
);
90 while (rc
== PGEN_FAIL
)
91 rc
= pfilt_step(&f
->f
, f
->step
);
92 ev
->m
= MP_COPY(f
->f
.m
);
96 /* --- @pgen_jump@ --- *
98 * Similar to the standard @pgen_filter@, but jumps in large steps rather
102 int pgen_jump(int rq
, pgen_event
*ev
, void *p
)
110 mp_gcd(&g
, 0, 0, ev
->m
, f
->j
->m
);
111 if (MP_CMP(g
, >, MP_ONE
)) {
116 rc
= pfilt_create(&f
->f
, ev
->m
);
121 rc
= pfilt_jump(&f
->f
, f
->j
);
124 pfilt_destroy(&f
->f
);
128 while (rc
== PGEN_FAIL
)
129 rc
= pfilt_jump(&f
->f
, f
->j
);
130 ev
->m
= MP_COPY(f
->f
.m
);
134 /*----- Standard prime test -----------------------------------------------*/
136 /* --- @pgen_test@ --- */
138 int pgen_test(int rq
, pgen_event
*ev
, void *p
)
145 rabin_create(r
, ev
->m
);
149 mp
*a
= mprand_range(MP_NEW
, ev
->m
, ev
->r
, 0);
150 rc
= rabin_test(r
, a
);
162 /*----- The main driver ---------------------------------------------------*/
166 * Arguments: @const char *name@ = name of the value being searched for
167 * @mp *d@ = destination for the result integer
168 * @mp *m@ = start value to pass to stepper
169 * @pgen_proc *event@ = event handler function
170 * @void *ectx@ = context argument for event andler
171 * @unsigned steps@ = number of steps to take in search
172 * @pgen_proc *step@ = stepper function to use
173 * @void *sctx@ = context argument for stepper
174 * @unsigned tests@ = number of tests to make
175 * @pgen_proc *test@ = tester function to use
176 * @void *tctx@ = context argument for tester
178 * Returns: Pointer to final result, or null.
180 * Use: A generalized prime-number search skeleton. Yes, that's a
181 * scary number of arguments.
184 mp
*pgen(const char *name
, mp
*d
, mp
*m
, pgen_proc
*event
, void *ectx
,
185 unsigned steps
, pgen_proc
*step
, void *sctx
,
186 unsigned tests
, pgen_proc
*test
, void *tctx
)
193 /* --- Set up the initial event block --- */
202 ev
.r
= fibrand_create(0);
204 /* --- Tell the event handler we're under way --- */
206 if (event
&& event(PGEN_BEGIN
, &ev
, ectx
) == PGEN_ABORT
)
209 /* --- Set up for the initial call --- */
211 proc
= step
; ctx
= sctx
; rq
= PGEN_BEGIN
;
213 /* --- Enter the great maelstrom of state transitions --- */
227 /* --- Call the procedure and decide what to do next --- */
229 rc
= proc(rq
, &ev
, ctx
);
236 proc
= test
; ctx
= tctx
;
241 act
|= A_TEST
| A_EVENT
;
245 proc
= test
; ctx
= tctx
;
252 act
|= A_ENDTEST
| A_EVENT
;
253 proc
= step
; ctx
= sctx
;
258 act
|= A_EVENT
| A_DONE
| A_ENDSTEP
;
263 act
|= A_EVENT
| A_DONE
;
264 if (proc
== test
|| rq
== PGEN_TRY
)
266 if (proc
== test
&& rq
== PGEN_BEGIN
)
270 assert(((void)"Invalid response from function", 0));
274 /* --- If decrementing counters is requested, do that --- */
276 if ((act
& A_STEP
) && steps
) {
279 act
|= A_EVENT
| A_ENDSTEP
| A_DONE
;
285 if ((act
& A_TEST
) && tests
) {
288 act
|= A_ENDTEST
| A_ENDSTEP
| A_DONE
;
293 /* --- Report an event if so directed --- */
295 if ((act
& A_EVENT
) && event
&& event(rc
, &ev
, ectx
) == PGEN_ABORT
) {
297 if (!(act
& A_DONE
)) {
298 act
|= A_ENDSTEP
| A_DONE
;
304 /* --- Close down tester and stepper functions --- */
307 test(PGEN_DONE
, &ev
, tctx
);
309 step(PGEN_DONE
, &ev
, sctx
);
311 /* --- Stop the entire test if necessary --- */
317 /* --- Tidy up and return --- */
319 if (rc
== PGEN_ABORT
) {
323 ev
.r
->ops
->destroy(ev
.r
);
329 /*----- Test rig ----------------------------------------------------------*/
333 #include <mLib/testrig.h>
335 static int verify(dstr
*v
)
337 mp
*m
= *(mp
**)v
[0].buf
;
338 mp
*q
= *(mp
**)v
[1].buf
;
346 p
= pgen("p", MP_NEW
, m
, pgen_evspin
, 0, 0, pgen_filter
, &pf
,
347 rabin_iters(mp_bits(m
)), pgen_test
, &r
);
348 if (!p
|| !MP_EQ(p
, q
)) {
349 fputs("\n*** pgen failed", stderr
);
350 fputs("\nm = ", stderr
); mp_writefile(m
, stderr
, 10);
351 fputs("\np = ", stderr
); mp_writefile(p
, stderr
, 10);
352 fputs("\nq = ", stderr
); mp_writefile(q
, stderr
, 10);
360 assert(mparena_count(MPARENA_GLOBAL
) == 0);
364 static test_chunk tests
[] = {
365 { "pgen", verify
, { &type_mp
, &type_mp
, 0 } },
369 int main(int argc
, char *argv
[])
372 test_run(argc
, argv
, tests
, SRCDIR
"/tests/pgen");
377 /*----- That's all, folks -------------------------------------------------*/