| 1 | // Copyright (c) 2019-2024 Alexander Medvednikov. All rights reserved. |
| 2 | // Use of this source code is governed by an MIT license |
| 3 | // that can be found in the LICENSE file. |
| 4 | module musl |
| 5 | |
| 6 | import rand.seed |
| 7 | import rand.buffer |
| 8 | |
| 9 | pub const seed_len = 1 |
| 10 | |
| 11 | // MuslRNG ported from https://git.musl-libc.org/cgit/musl/tree/src/prng/rand_r.c . |
| 12 | pub struct MuslRNG { |
| 13 | buffer.PRNGBuffer |
| 14 | mut: |
| 15 | state u32 = seed.time_seed_32() |
| 16 | } |
| 17 | |
| 18 | // seed sets the current random state based on `seed_data`. |
| 19 | // seed expects `seed_data` to be only one `u32`. |
| 20 | pub fn (mut rng MuslRNG) seed(seed_data []u32) { |
| 21 | if seed_data.len != 1 { |
| 22 | eprintln('MuslRNG needs only one unsigned 32-bit integer as a seed.') |
| 23 | exit(1) |
| 24 | } |
| 25 | rng.state = seed_data[0] |
| 26 | rng.bytes_left = 0 |
| 27 | rng.buffer = 0 |
| 28 | } |
| 29 | |
| 30 | // byte returns a uniformly distributed pseudorandom 8-bit unsigned positive `byte`. |
| 31 | @[inline] |
| 32 | pub fn (mut rng MuslRNG) u8() u8 { |
| 33 | if rng.bytes_left >= 1 { |
| 34 | rng.bytes_left -= 1 |
| 35 | value := u8(rng.buffer) |
| 36 | rng.buffer >>= 8 |
| 37 | return value |
| 38 | } |
| 39 | rng.buffer = rng.u32() |
| 40 | rng.bytes_left = 3 |
| 41 | value := u8(rng.buffer) |
| 42 | rng.buffer >>= 8 |
| 43 | return value |
| 44 | } |
| 45 | |
| 46 | // u16 returns a pseudorandom 16-bit unsigned integer (`u16`). |
| 47 | @[inline] |
| 48 | pub fn (mut rng MuslRNG) u16() u16 { |
| 49 | if rng.bytes_left >= 2 { |
| 50 | rng.bytes_left -= 2 |
| 51 | value := u16(rng.buffer) |
| 52 | rng.buffer >>= 16 |
| 53 | return value |
| 54 | } |
| 55 | ans := rng.u32() |
| 56 | rng.buffer = ans >> 16 |
| 57 | rng.bytes_left = 2 |
| 58 | return u16(ans) |
| 59 | } |
| 60 | |
| 61 | // temper returns a tempered value based on `prev` value. |
| 62 | @[inline] |
| 63 | fn temper(prev u32) u32 { |
| 64 | mut x := prev |
| 65 | x ^= x >> 11 |
| 66 | x ^= (x << 7) & 0x9D2C5680 |
| 67 | x ^= (x << 15) & 0xEFC60000 |
| 68 | x ^= (x >> 18) |
| 69 | return x |
| 70 | } |
| 71 | |
| 72 | // u32 returns a pseudorandom 32-bit unsigned integer (`u32`). |
| 73 | @[ignore_overflow] |
| 74 | pub fn (mut rng MuslRNG) u32() u32 { |
| 75 | rng.state = rng.state * 1103515245 + 12345 |
| 76 | // We are not dividing by 2 (or shifting right by 1) |
| 77 | // because we want all 32-bits of random data |
| 78 | return temper(rng.state) |
| 79 | } |
| 80 | |
| 81 | // u64 returns a pseudorandom 64-bit unsigned integer (`u64`). |
| 82 | @[inline] |
| 83 | pub fn (mut rng MuslRNG) u64() u64 { |
| 84 | return u64(rng.u32()) | (u64(rng.u32()) << 32) |
| 85 | } |
| 86 | |
| 87 | // block_size returns the number of bits that the RNG can produce in a single iteration. |
| 88 | @[inline] |
| 89 | pub fn (mut rng MuslRNG) block_size() int { |
| 90 | return 32 |
| 91 | } |
| 92 | |
| 93 | // free should be called when the generator is no longer needed. |
| 94 | @[unsafe] |
| 95 | pub fn (mut rng MuslRNG) free() { |
| 96 | } |
| 97 | |