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 /*----- Header files ------------------------------------------------------*/
45 /*----- Standard prime filter ---------------------------------------------*/
47 /* --- @pgen_filter@ --- */
49 int pgen_filter(int rq
, pgen_event
*ev
, void *p
)
51 pgen_filterctx
*f
= p
;
56 rc
= pfilt_create(&f
->f
, ev
->m
);
61 if (!((f
->step
| f
->f
.m
->v
[0]) & 1))
62 rc
= pfilt_step(&f
->f
, 1);
64 rc
= pfilt_step(&f
->f
, f
->step
);
71 while (rc
== PGEN_FAIL
)
72 rc
= pfilt_step(&f
->f
, f
->step
);
73 ev
->m
= MP_COPY(f
->f
.m
);
77 /* --- @pgen_jump@ --- *
79 * Similar to the standard @pgen_filter@, but jumps in large steps rather
83 int pgen_jump(int rq
, pgen_event
*ev
, void *p
)
91 mp_gcd(&g
, 0, 0, ev
->m
, f
->j
->m
);
92 if (MP_CMP(g
, >, MP_ONE
)) {
97 rc
= pfilt_create(&f
->f
, ev
->m
);
102 rc
= pfilt_jump(&f
->f
, f
->j
);
105 pfilt_destroy(&f
->f
);
109 while (rc
== PGEN_FAIL
)
110 rc
= pfilt_jump(&f
->f
, f
->j
);
111 ev
->m
= MP_COPY(f
->f
.m
);
115 /*----- Standard prime test -----------------------------------------------*/
117 /* --- @pgen_test@ --- */
119 int pgen_test(int rq
, pgen_event
*ev
, void *p
)
126 rabin_create(r
, ev
->m
);
131 rc
= rabin_rtest(r
, MP_TWO
);
133 mp
*a
= mprand_range(MP_NEW
, ev
->m
, ev
->r
, 0);
134 rc
= rabin_rtest(r
, a
);
147 /*----- The main driver ---------------------------------------------------*/
151 * Arguments: @const char *name@ = name of the value being searched for
152 * @mp *d@ = destination for the result integer
153 * @mp *m@ = start value to pass to stepper
154 * @pgen_proc *event@ = event handler function
155 * @void *ectx@ = context argument for event andler
156 * @unsigned steps@ = number of steps to take in search
157 * @pgen_proc *step@ = stepper function to use
158 * @void *sctx@ = context argument for stepper
159 * @unsigned tests@ = number of tests to make
160 * @pgen_proc *test@ = tester function to use
161 * @void *tctx@ = context argument for tester
163 * Returns: Pointer to final result, or null.
165 * Use: A generalized prime-number search skeleton. Yes, that's a
166 * scary number of arguments.
169 mp
*pgen(const char *name
, mp
*d
, mp
*m
, pgen_proc
*event
, void *ectx
,
170 unsigned steps
, pgen_proc
*step
, void *sctx
,
171 unsigned tests
, pgen_proc
*test
, void *tctx
)
178 /* --- Set up the initial event block --- */
187 ev
.r
= fibrand_create(0);
189 /* --- Tell the event handler we're under way --- */
191 if (event
&& event(PGEN_BEGIN
, &ev
, ectx
) == PGEN_ABORT
)
194 /* --- Set up for the initial call --- */
196 proc
= step
; ctx
= sctx
; rq
= PGEN_BEGIN
;
198 /* --- Enter the great maelstrom of state transitions --- */
212 /* --- Call the procedure and decide what to do next --- */
214 rc
= proc(rq
, &ev
, ctx
);
221 proc
= test
; ctx
= tctx
;
226 act
|= A_TEST
| A_EVENT
;
230 proc
= test
; ctx
= tctx
;
237 act
|= A_ENDTEST
| A_EVENT
;
238 proc
= step
; ctx
= sctx
;
243 act
|= A_EVENT
| A_DONE
| A_ENDSTEP
;
248 act
|= A_EVENT
| A_DONE
;
249 if (proc
== test
|| rq
== PGEN_TRY
)
251 if (proc
== test
&& rq
== PGEN_BEGIN
)
255 assert(((void)"Invalid response from function", 0));
259 /* --- If decrementing counters is requested, do that --- */
261 if ((act
& A_STEP
) && steps
) {
263 if (ev
.steps
== steps
) {
264 act
|= A_EVENT
| A_ENDSTEP
| A_DONE
;
270 if ((act
& A_TEST
) && tests
) {
272 if (ev
.tests
== tests
) {
273 act
|= A_ENDTEST
| A_ENDSTEP
| A_DONE
;
278 /* --- Report an event if so directed --- */
280 if ((act
& A_EVENT
) && event
&& event(rc
, &ev
, ectx
) == PGEN_ABORT
) {
282 if (!(act
& A_DONE
)) {
283 act
|= A_ENDSTEP
| A_DONE
;
289 /* --- Close down tester and stepper functions --- */
292 test(PGEN_DONE
, &ev
, tctx
);
294 step(PGEN_DONE
, &ev
, sctx
);
296 /* --- Stop the entire test if necessary --- */
302 /* --- Tidy up and return --- */
304 if (rc
== PGEN_ABORT
) {
308 ev
.r
->ops
->destroy(ev
.r
);
314 /* --- @pgen_primep@ --- *
316 * Arguments: @mp *p@ = a number to check
317 * @grand *gr@ = a random number source
319 * Returns: Nonzero if @p@ is really prime.
322 int pgen_primep(mp
*p
, grand
*gr
)
324 int i
= rabin_iters(mp_bits(p
));
328 if (MP_NEGP(p
)) return (0);
329 switch (pfilt_smallfactor(p
)) {
330 case PGEN_DONE
: return (1);
331 case PGEN_FAIL
: return (0);
335 x
= mprand_range(x
, p
, gr
, 0);
336 if (rabin_rtest(&r
, x
) == PGEN_FAIL
)
345 /*----- Test rig ----------------------------------------------------------*/
349 #include <mLib/testrig.h>
351 static int verify(dstr
*v
)
353 mp
*m
= *(mp
**)v
[0].buf
;
354 mp
*q
= *(mp
**)v
[1].buf
;
362 p
= pgen("p", MP_NEW
, m
, pgen_evspin
, 0, 0, pgen_filter
, &pf
,
363 rabin_iters(mp_bits(m
)), pgen_test
, &r
);
364 if (!p
|| !MP_EQ(p
, q
)) {
365 fputs("\n*** pgen failed", stderr
);
366 fputs("\nm = ", stderr
); mp_writefile(m
, stderr
, 10);
367 fputs("\np = ", stderr
); mp_writefile(p
, stderr
, 10);
368 fputs("\nq = ", stderr
); mp_writefile(q
, stderr
, 10);
376 assert(mparena_count(MPARENA_GLOBAL
) == 0);
380 static test_chunk tests
[] = {
381 { "pgen", verify
, { &type_mp
, &type_mp
, 0 } },
385 int main(int argc
, char *argv
[])
388 test_run(argc
, argv
, tests
, SRCDIR
"/tests/pgen");
393 /*----- That's all, folks -------------------------------------------------*/