Add arc4random_uniform() function (to avoid "modulo bias")
Obtained from: OpenBSD
This commit is contained in:
parent
85986016ae
commit
6e4fe40a24
@ -69,7 +69,7 @@ MAN+= alarm.3 arc4random.3 \
|
||||
unvis.3 usleep.3 utime.3 valloc.3 vis.3 wordexp.3
|
||||
|
||||
MLINKS+=arc4random.3 arc4random_addrandom.3 arc4random.3 arc4random_stir.3 \
|
||||
arc4random.3 arc4random_buf.3
|
||||
arc4random.3 arc4random_buf.3 arc4random.3 arc4random_uniform.3
|
||||
MLINKS+=ctermid.3 ctermid_r.3
|
||||
MLINKS+=devname.3 devname_r.3
|
||||
MLINKS+=directory.3 closedir.3 directory.3 dirfd.3 directory.3 opendir.3 \
|
||||
|
@ -330,6 +330,7 @@ FBSD_1.0 {
|
||||
|
||||
FBSD_1.1 {
|
||||
arc4random_buf;
|
||||
arc4random_uniform;
|
||||
fdopendir;
|
||||
feature_present;
|
||||
fts_open;
|
||||
|
@ -36,6 +36,7 @@
|
||||
.Sh NAME
|
||||
.Nm arc4random ,
|
||||
.Nm arc4random_buf ,
|
||||
.Nm arc4random_uniform ,
|
||||
.Nm arc4random_stir ,
|
||||
.Nm arc4random_addrandom
|
||||
.Nd arc4 random number generator
|
||||
@ -47,6 +48,8 @@
|
||||
.Fn arc4random "void"
|
||||
.Ft void
|
||||
.Fn arc4random_buf "void *buf" "size_t nbytes"
|
||||
.Ft u_int32_t
|
||||
.Fn arc4random_uniform "u_int32_t upper_bound"
|
||||
.Ft void
|
||||
.Fn arc4random_stir "void"
|
||||
.Ft void
|
||||
@ -78,6 +81,14 @@ of length
|
||||
.Fa nbytes
|
||||
with ARC4-derived random data.
|
||||
.Pp
|
||||
.Fn arc4random_uniform
|
||||
will return a uniformly distributed random number less than
|
||||
.Fa upper_bound .
|
||||
.Fn arc4random_uniform
|
||||
is recommended over constructions like
|
||||
.Dq Li arc4random() % upper_bound
|
||||
as it avoids "modulo bias" when the upper bound is not a power of two.
|
||||
.Pp
|
||||
The
|
||||
.Fn arc4random_stir
|
||||
function reads data from
|
||||
|
@ -240,6 +240,51 @@ arc4random_buf(void *_buf, size_t n)
|
||||
THREAD_UNLOCK();
|
||||
}
|
||||
|
||||
/*
|
||||
* Calculate a uniformly distributed random number less than upper_bound
|
||||
* avoiding "modulo bias".
|
||||
*
|
||||
* Uniformity is achieved by generating new random numbers until the one
|
||||
* returned is outside the range [0, 2**32 % upper_bound). This
|
||||
* guarantees the selected random number will be inside
|
||||
* [2**32 % upper_bound, 2**32) which maps back to [0, upper_bound)
|
||||
* after reduction modulo upper_bound.
|
||||
*/
|
||||
u_int32_t
|
||||
arc4random_uniform(u_int32_t upper_bound)
|
||||
{
|
||||
u_int32_t r, min;
|
||||
|
||||
if (upper_bound < 2)
|
||||
return 0;
|
||||
|
||||
#if (ULONG_MAX > 0xffffffffUL)
|
||||
min = 0x100000000UL % upper_bound;
|
||||
#else
|
||||
/* Calculate (2**32 % upper_bound) avoiding 64-bit math */
|
||||
if (upper_bound > 0x80000000)
|
||||
min = 1 + ~upper_bound; /* 2**32 - upper_bound */
|
||||
else {
|
||||
/* (2**32 - (x * 2)) % x == 2**32 % x when x <= 2**31 */
|
||||
min = ((0xffffffff - (upper_bound * 2)) + 1) % upper_bound;
|
||||
}
|
||||
#endif
|
||||
|
||||
/*
|
||||
* This could theoretically loop forever but each retry has
|
||||
* p > 0.5 (worst case, usually far better) of selecting a
|
||||
* number inside the range we need, so it should rarely need
|
||||
* to re-roll.
|
||||
*/
|
||||
for (;;) {
|
||||
r = arc4random();
|
||||
if (r >= min)
|
||||
break;
|
||||
}
|
||||
|
||||
return (r % upper_bound);
|
||||
}
|
||||
|
||||
#if 0
|
||||
/*-------- Test code for i386 --------*/
|
||||
#include <stdio.h>
|
||||
|
Loading…
Reference in New Issue
Block a user