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
66
67
68
69
70
71
72
73
74
|
/* Test gmp_urandomm_ui.
Copyright 2003, 2005 Free Software Foundation, Inc.
This file is part of the GNU MP Library test suite.
The GNU MP Library test suite is free software; you can redistribute it
and/or modify it under the terms of the GNU 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 test suite 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 General
Public License for more details.
You should have received a copy of the GNU General Public License along with
the GNU MP Library test suite. If not, see https://www.gnu.org/licenses/. */
#include <stdio.h>
#include <stdlib.h>
#include "gmp-impl.h"
#include "tests.h"
/* Expect numbers generated by rstate to obey the limit requested. */
void
check_one (const char *name, gmp_randstate_ptr rstate)
{
static const unsigned long n_table[] = {
1, 2, 3, 4, 5, 6, 7, 8,
123, 456, 789,
255, 256, 257,
1023, 1024, 1025,
32767, 32768, 32769,
ULONG_MAX/2-2, ULONG_MAX/2-1, ULONG_MAX/2, ULONG_MAX/2+1, ULONG_MAX/2+2,
ULONG_MAX-2, ULONG_MAX-1, ULONG_MAX,
};
unsigned long got, n;
int i, j;
for (i = 0; i < numberof (n_table); i++)
{
n = n_table[i];
for (j = 0; j < 5; j++)
{
got = gmp_urandomm_ui (rstate, n);
if (got >= n)
{
printf ("Return value out of range:\n");
printf (" algorithm: %s\n", name);
printf (" n: %#lx\n", n);
printf (" got: %#lx\n", got);
abort ();
}
}
}
}
int
main (int argc, char *argv[])
{
tests_start ();
call_rand_algs (check_one);
tests_end ();
exit (0);
}
|
