low-latency-data-structures 0.0.7

Experimental lock-free SPSC, SPMC broadcast, and SeqLock primitives tuned for ultra-low-latency systems
Documentation 
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

//! Adapter for our own `spsc` primitive. Always available under
//! `_bench_utils` (no extra dep).

use std::marker::PhantomData;

use crate::bench::harness::spsc::{SpscBench, SpscCons, SpscProd};
use crate::mem::global::GlobalAllocator;
use crate::spsc::{self, Consumer, Options, Producer};

/// Marker type that constructs an SPSC pair backed by this crate's
/// `spsc::new` with a mlocked global allocator.
pub struct OursSpsc<T, const C: usize>(PhantomData<fn() -> T>);

impl<T, const C: usize> SpscBench<T, C> for OursSpsc<T, C>
where
    T: bytemuck::AnyBitPattern + Send + 'static,
{
    type Prod = Producer<T, C, GlobalAllocator>;
    type Cons = Consumer<T, C, GlobalAllocator>;
    const NAME: &'static str = "ours";
    fn new() -> (Self::Prod, Self::Cons) {
        spsc::new::<T, C, GlobalAllocator>(Options::global_mlocked())
    }
}

impl<T, const C: usize> SpscProd<T> for Producer<T, C, GlobalAllocator>
where
    T: bytemuck::AnyBitPattern + Send,
{
    #[inline]
    fn try_push(&mut self, v: T) -> Result<(), T> {
        // Our push returns Some(v) when full, None on success.
        match Producer::push(self, v) {
            None => Ok(()),
            Some(v) => Err(v),
        }
    }
}

impl<T, const C: usize> SpscCons<T> for Consumer<T, C, GlobalAllocator>
where
    T: bytemuck::AnyBitPattern + Send,
{
    #[inline]
    fn try_pop(&mut self) -> Option<T> {
        Consumer::pop(self)
    }
}