trotcast 0.1.0

An mpmc broadcast impl
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
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
95
96
97
98
99
100
101

use crate::prelude::*;
use std::sync::{Arc, atomic::Ordering};

/// A sender handle for the broadcast channel that allows sending messages to all receivers.
pub struct Sender<T> {
    shared: Arc<State<T>>,
}
impl<T: Clone> Sender<T> {
    pub(crate) fn new(shared: Arc<State<T>>) -> Self {
        shared.num_writers.fetch_add(1, Ordering::Release);
        Self { shared }
    }

    /// Spawns a debugger from the sender
    ///
    /// Enabled with the `debug` feature
    #[cfg(feature = "debug")]
    pub fn debugger(&self) -> Debug<T> {
        Debug {
            shared: Arc::clone(&self.shared),
        }
    }

    /// Spawns a new [`Receiver`]
    pub fn spawn_rx(&self) -> Receiver<T> {
        Receiver::new(Arc::clone(&self.shared))
    }

    fn send_inner(&self, value: T, blocking: bool) -> Result<(), SendError<T>> {
        if self.shared.num_readers.load(Ordering::Relaxed) == 0 {
            return Err(SendError::Disconnected(value));
        }

        loop {
            // I need sole access to the tail. other writers must wait on me.
            let mut tail_lock = self.shared.internal_tail.write().unwrap();

            let fence = (tail_lock.0 + 1) % self.shared.len;

            let required_reads = unsafe { (&*self.shared.ring[fence].state.get()).required_reads };

            // the fence has not yet been cleared of reads.
            if required_reads
                .saturating_sub(self.shared.ring[fence].num_reads.load(Ordering::SeqCst))
                != 0
            {
                if blocking {
                    continue;
                } else {
                    return Err(SendError::Full(value));
                }
            }
            let seat = tail_lock.0;

            // This is free to write!
            let state = unsafe { &mut *self.shared.ring[seat].state.get() };
            state.val = Some(value);

            state.required_reads = self.shared.num_readers.load(Ordering::SeqCst);

            // set the tail last and then unlock check_writing
            let tail = (seat + 1) % self.shared.len;

            self.shared.ring[seat].num_reads.store(0, Ordering::SeqCst);
            self.shared.tail.store(tail, Ordering::SeqCst);
            tail_lock.0 = tail;
            return Ok(());
        }
    }
    /// Sends a message. Will loop if the channel is full.
    ///
    /// # Errors
    /// - if there are no readers to receive the message.
    pub fn blocking_send(&self, value: T) -> Result<(), BlockingSendError<T>> {
        self.send_inner(value, true).map_err(|e| match e {
            SendError::Disconnected(val) => BlockingSendError::Disconnected(val),
            _ => unreachable!(),
        })
    }

    /// Sends a message.
    ///
    /// # Errors
    /// - if there are no readers to receive the message.
    /// - if the channel is full.
    pub fn send(&self, value: T) -> Result<(), SendError<T>> {
        self.send_inner(value, false)
    }
}

impl<T: Clone> Clone for Sender<T> {
    fn clone(&self) -> Self {
        Self::new(Arc::clone(&self.shared))
    }
}

impl<T> Drop for Sender<T> {
    fn drop(&mut self) {
        self.shared.num_writers.fetch_sub(1, Ordering::Release);
    }
}