1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
|
/* Test gmp_urandomb_ui.
Copyright 2003, 2005 Free Software Foundation, Inc.
This file is part of the GNU MP Library.
The GNU MP Library is free software; you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation; either version 3 of the License, or (at your
option) any later version.
The GNU MP Library is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public
License for more details.
You should have received a copy of the GNU Lesser General Public License
along with the GNU MP Library. If not, see http://www.gnu.org/licenses/. */
#include <stdio.h>
#include <stdlib.h>
#include "gmp.h"
#include "gmp-impl.h"
#include "tests.h"
/* Expect numbers generated by rstate to obey the number of bits requested.
No point testing bits==BITS_PER_ULONG, since any return is acceptable in
that case. */
void
check_one (const char *name, gmp_randstate_ptr rstate)
{
unsigned long bits, limit, got;
int i;
for (bits = 0; bits < BITS_PER_ULONG; bits++)
{
/* will demand got < limit */
limit = (1L << bits);
for (i = 0; i < 5; i++)
{
got = gmp_urandomb_ui (rstate, bits);
if (got >= limit)
{
printf ("Return value out of range:\n");
printf (" algorithm: %s\n", name);
printf (" bits: %lu\n", bits);
printf (" limit: %#lx\n", limit);
printf (" got: %#lx\n", got);
abort ();
}
}
}
}
int
main (int argc, char *argv[])
{
tests_start ();
call_rand_algs (check_one);
tests_end ();
exit (0);
}
|
