2021-01-18 15:20:06 +03:00
|
|
|
// Copyright (c) 2019-2021 Alexander Medvednikov. All rights reserved.
|
2020-03-21 11:48:02 +03:00
|
|
|
// Use of this source code is governed by an MIT license
|
|
|
|
// that can be found in the LICENSE file.
|
|
|
|
|
|
|
|
module rand
|
|
|
|
|
|
|
|
#include <sys/random.h>
|
|
|
|
|
|
|
|
fn C.getrandom(p byteptr, n size_t, flags u32) int
|
|
|
|
|
|
|
|
const (
|
|
|
|
read_batch_size = 256
|
|
|
|
)
|
|
|
|
|
2021-01-23 15:33:49 +03:00
|
|
|
// read returns an array of `bytes_needed` random bytes read from the OS.
|
2020-07-05 01:33:36 +03:00
|
|
|
pub fn read(bytes_needed int) ?[]byte {
|
2021-02-17 22:47:19 +03:00
|
|
|
mut buffer := unsafe { malloc(bytes_needed) }
|
2020-03-21 11:48:02 +03:00
|
|
|
mut bytes_read := 0
|
2020-07-05 01:33:36 +03:00
|
|
|
mut remaining_bytes := bytes_needed
|
2020-03-21 11:48:02 +03:00
|
|
|
// getrandom syscall wont block if requesting <= 256 bytes
|
2020-07-05 01:33:36 +03:00
|
|
|
for bytes_read < bytes_needed {
|
|
|
|
batch_size := if remaining_bytes > read_batch_size { read_batch_size } else { remaining_bytes }
|
2021-02-17 22:47:19 +03:00
|
|
|
rbytes := unsafe { getrandom(batch_size, buffer + bytes_read) }
|
2020-07-05 01:33:36 +03:00
|
|
|
if rbytes == -1 {
|
2021-02-17 22:47:19 +03:00
|
|
|
unsafe { free(buffer) }
|
2020-07-05 01:33:36 +03:00
|
|
|
return read_error
|
|
|
|
}
|
|
|
|
bytes_read += rbytes
|
2020-03-21 11:48:02 +03:00
|
|
|
}
|
2021-02-17 22:47:19 +03:00
|
|
|
return unsafe {buffer.vbytes(bytes_needed)}
|
2020-03-21 11:48:02 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
fn v_getrandom(bytes_needed int, buffer voidptr) int {
|
|
|
|
if bytes_needed > read_batch_size {
|
|
|
|
panic('getrandom() dont request more than $read_batch_size bytes at once.')
|
|
|
|
}
|
|
|
|
return C.getrandom(buffer, bytes_needed, 0)
|
|
|
|
}
|