aboutsummaryrefslogtreecommitdiff
path: root/benches/mod.rs
blob: 11be47eb7541295abe4f5cf7bafa1d5d7afad933 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
#![feature(test)]
extern crate test;

use std::{
    alloc::{alloc_zeroed, dealloc, Layout},
    ptr::NonNull,
};

// AlignedBuffer is like a Box<[u8; N]> except that it is always N-byte aligned
struct AlignedBuffer<const N: usize>(NonNull<[u8; N]>);

impl<const N: usize> AlignedBuffer<N> {
    fn layout() -> Layout {
        Layout::from_size_align(N, N).unwrap()
    }

    fn new() -> Self {
        let p = unsafe { alloc_zeroed(Self::layout()) } as *mut [u8; N];
        Self(NonNull::new(p).unwrap())
    }

    fn buf(&mut self) -> &mut [u8; N] {
        unsafe { self.0.as_mut() }
    }
}

impl<const N: usize> Drop for AlignedBuffer<N> {
    fn drop(&mut self) {
        unsafe { dealloc(self.0.as_ptr() as *mut u8, Self::layout()) }
    }
}

// Used to benchmark the throughput of getrandom in an optimal scenario.
// The buffer is hot, and does not require initialization.
#[inline(always)]
fn bench<const N: usize>(b: &mut test::Bencher) {
    let mut ab = AlignedBuffer::<N>::new();
    let buf = ab.buf();
    b.iter(|| {
        getrandom::getrandom(&mut buf[..]).unwrap();
        test::black_box(&buf);
    });
    b.bytes = N as u64;
}

// Used to benchmark the throughput of getrandom is a slightly less optimal
// scenario. The buffer is still hot, but requires initialization.
#[inline(always)]
fn bench_with_init<const N: usize>(b: &mut test::Bencher) {
    let mut ab = AlignedBuffer::<N>::new();
    let buf = ab.buf();
    b.iter(|| {
        for byte in buf.iter_mut() {
            *byte = 0;
        }
        getrandom::getrandom(&mut buf[..]).unwrap();
        test::black_box(&buf);
    });
    b.bytes = N as u64;
}

// 32 bytes (256-bit) is the seed sized used for rand::thread_rng
const SEED: usize = 32;
// Common size of a page, 4 KiB
const PAGE: usize = 4096;
// Large buffer to get asymptotic performance, 2 MiB
const LARGE: usize = 1 << 21;

#[bench]
fn bench_seed(b: &mut test::Bencher) {
    bench::<SEED>(b);
}
#[bench]
fn bench_seed_init(b: &mut test::Bencher) {
    bench_with_init::<SEED>(b);
}

#[bench]
fn bench_page(b: &mut test::Bencher) {
    bench::<PAGE>(b);
}
#[bench]
fn bench_page_init(b: &mut test::Bencher) {
    bench_with_init::<PAGE>(b);
}

#[bench]
fn bench_large(b: &mut test::Bencher) {
    bench::<LARGE>(b);
}
#[bench]
fn bench_large_init(b: &mut test::Bencher) {
    bench_with_init::<LARGE>(b);
}