2022-01-04 12:21:08 +03:00
|
|
|
// Copyright (c) 2019-2022 Alexander Medvednikov. All rights reserved.
|
2020-06-01 22:13:56 +03:00
|
|
|
// Use of this source code is governed by an MIT license
|
|
|
|
// that can be found in the LICENSE file.
|
2020-06-09 16:06:07 +03:00
|
|
|
module musl
|
2020-06-01 22:13:56 +03:00
|
|
|
|
2021-01-26 16:55:09 +03:00
|
|
|
import rand.seed
|
2020-06-01 22:13:56 +03:00
|
|
|
|
2022-02-28 14:17:54 +03:00
|
|
|
pub const seed_len = 1
|
|
|
|
|
2020-12-27 21:06:17 +03:00
|
|
|
// MuslRNG ported from https://git.musl-libc.org/cgit/musl/tree/src/prng/rand_r.c
|
2020-06-01 22:13:56 +03:00
|
|
|
pub struct MuslRNG {
|
|
|
|
mut:
|
2022-02-28 14:17:54 +03:00
|
|
|
state u32 = seed.time_seed_32()
|
|
|
|
bytes_left int
|
|
|
|
buffer u32
|
2020-06-01 22:13:56 +03:00
|
|
|
}
|
|
|
|
|
2020-12-27 21:06:17 +03:00
|
|
|
// seed sets the current random state based on `seed_data`.
|
|
|
|
// seed expects `seed_data` to be only one `u32`.
|
2020-06-01 22:13:56 +03:00
|
|
|
pub fn (mut rng MuslRNG) seed(seed_data []u32) {
|
|
|
|
if seed_data.len != 1 {
|
2020-12-27 21:06:17 +03:00
|
|
|
eprintln('MuslRNG needs only one unsigned 32-bit integer as a seed.')
|
2020-06-01 22:13:56 +03:00
|
|
|
exit(1)
|
|
|
|
}
|
|
|
|
rng.state = seed_data[0]
|
2022-02-28 14:17:54 +03:00
|
|
|
rng.bytes_left = 0
|
|
|
|
rng.buffer = 0
|
|
|
|
}
|
|
|
|
|
|
|
|
// byte returns a uniformly distributed pseudorandom 8-bit unsigned positive `byte`.
|
|
|
|
[inline]
|
2022-04-10 11:43:46 +03:00
|
|
|
pub fn (mut rng MuslRNG) byte() byte {
|
2022-02-28 14:17:54 +03:00
|
|
|
if rng.bytes_left >= 1 {
|
|
|
|
rng.bytes_left -= 1
|
|
|
|
value := byte(rng.buffer)
|
|
|
|
rng.buffer >>= 8
|
|
|
|
return value
|
|
|
|
}
|
|
|
|
rng.buffer = rng.u32()
|
|
|
|
rng.bytes_left = 3
|
|
|
|
value := byte(rng.buffer)
|
|
|
|
rng.buffer >>= 8
|
|
|
|
return value
|
|
|
|
}
|
|
|
|
|
|
|
|
// u16 returns a pseudorandom 16-bit unsigned integer (`u16`).
|
|
|
|
[inline]
|
|
|
|
pub fn (mut rng MuslRNG) u16() u16 {
|
|
|
|
if rng.bytes_left >= 2 {
|
|
|
|
rng.bytes_left -= 2
|
|
|
|
value := u16(rng.buffer)
|
|
|
|
rng.buffer >>= 16
|
|
|
|
return value
|
|
|
|
}
|
|
|
|
ans := rng.u32()
|
|
|
|
rng.buffer = ans >> 16
|
|
|
|
rng.bytes_left = 2
|
|
|
|
return u16(ans)
|
2020-06-01 22:13:56 +03:00
|
|
|
}
|
|
|
|
|
2020-12-27 21:06:17 +03:00
|
|
|
// temper returns a tempered value based on `prev` value.
|
2020-06-01 22:13:56 +03:00
|
|
|
[inline]
|
|
|
|
fn temper(prev u32) u32 {
|
|
|
|
mut x := prev
|
|
|
|
x ^= x >> 11
|
|
|
|
x ^= (x << 7) & 0x9D2C5680
|
|
|
|
x ^= (x << 15) & 0xEFC60000
|
|
|
|
x ^= (x >> 18)
|
|
|
|
return x
|
|
|
|
}
|
|
|
|
|
2020-12-27 21:06:17 +03:00
|
|
|
// u32 returns a pseudorandom 32-bit unsigned integer (`u32`).
|
2022-04-10 11:43:46 +03:00
|
|
|
pub fn (mut rng MuslRNG) u32() u32 {
|
2020-06-01 22:13:56 +03:00
|
|
|
rng.state = rng.state * 1103515245 + 12345
|
|
|
|
// We are not dividing by 2 (or shifting right by 1)
|
|
|
|
// because we want all 32-bits of random data
|
|
|
|
return temper(rng.state)
|
|
|
|
}
|
|
|
|
|
2020-12-27 21:06:17 +03:00
|
|
|
// u64 returns a pseudorandom 64-bit unsigned integer (`u64`).
|
2020-06-01 22:13:56 +03:00
|
|
|
[inline]
|
|
|
|
pub fn (mut rng MuslRNG) u64() u64 {
|
|
|
|
return u64(rng.u32()) | (u64(rng.u32()) << 32)
|
|
|
|
}
|
|
|
|
|
2022-02-28 14:17:54 +03:00
|
|
|
// block_size returns the number of bits that the RNG can produce in a single iteration.
|
|
|
|
[inline]
|
|
|
|
pub fn (mut rng MuslRNG) block_size() int {
|
|
|
|
return 32
|
|
|
|
}
|
|
|
|
|
2021-09-23 11:14:20 +03:00
|
|
|
// free should be called when the generator is no longer needed
|
|
|
|
[unsafe]
|
|
|
|
pub fn (mut rng MuslRNG) free() {
|
|
|
|
unsafe { free(rng) }
|
|
|
|
}
|