Learn how easy it is to sync an existing GitHub or Google Code repo to a SourceForge project! See Demo

Close

[e90b2f]: src / gmp / randbui.c Maximize Restore History

Download this file

randbui.c    49 lines (36 with data), 1.5 kB

 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
/* gmp_urandomb_ui -- random bits returned in a ulong.
Copyright 2003, 2004 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 2.1 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; see the file COPYING.LIB. If not, write to
the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
MA 02110-1301, USA. */
#include "gmp.h"
#include "gmp-impl.h"
/* Currently bits>=BITS_PER_ULONG is quietly truncated to BITS_PER_ULONG,
maybe this should raise an exception or something. */
unsigned long
gmp_urandomb_ui (gmp_randstate_ptr rstate, unsigned long bits)
{
mp_limb_t a[LIMBS_PER_ULONG];
/* start with zeros, since if bits==0 then _gmp_rand will store nothing at
all, or if bits <= GMP_NUMB_BITS then it will store only a[0] */
a[0] = 0;
#if LIMBS_PER_ULONG > 1
a[1] = 0;
#endif
_gmp_rand (a, rstate, MIN (bits, BITS_PER_ULONG));
#if LIMBS_PER_ULONG == 1
return a[0];
#else
return a[0] | (a[1] << GMP_NUMB_BITS);
#endif
}