2021-01-18 13:20:06 +01:00
|
|
|
// Copyright (c) 2019-2021 Alexander Medvednikov. All rights reserved.
|
2020-03-21 09:48:02 +01: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
|
|
|
|
)
|
|
|
|
|
2020-07-05 00:33:36 +02:00
|
|
|
pub fn read(bytes_needed int) ?[]byte {
|
2020-03-21 09:48:02 +01:00
|
|
|
mut buffer := &byte(0)
|
|
|
|
unsafe {
|
2020-07-05 00:33:36 +02:00
|
|
|
buffer = malloc(bytes_needed)
|
2020-03-21 09:48:02 +01:00
|
|
|
}
|
2020-07-05 00:33:36 +02:00
|
|
|
mut bstart := buffer
|
2020-03-21 09:48:02 +01:00
|
|
|
mut bytes_read := 0
|
2020-07-05 00:33:36 +02:00
|
|
|
mut remaining_bytes := bytes_needed
|
2020-03-21 09:48:02 +01:00
|
|
|
// getrandom syscall wont block if requesting <= 256 bytes
|
2020-07-05 00:33:36 +02:00
|
|
|
for bytes_read < bytes_needed {
|
|
|
|
batch_size := if remaining_bytes > read_batch_size { read_batch_size } else { remaining_bytes }
|
|
|
|
unsafe {
|
|
|
|
bstart = buffer + bytes_read
|
2020-03-21 09:48:02 +01:00
|
|
|
}
|
2020-07-05 00:33:36 +02:00
|
|
|
rbytes := getrandom(batch_size, bstart)
|
|
|
|
if rbytes == -1 {
|
|
|
|
free(buffer)
|
|
|
|
return read_error
|
|
|
|
}
|
|
|
|
bytes_read += rbytes
|
2020-03-21 09:48:02 +01:00
|
|
|
}
|
|
|
|
return c_array_to_bytes_tmp(bytes_needed, buffer)
|
|
|
|
}
|
|
|
|
|
|
|
|
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)
|
|
|
|
}
|