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 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130
use crate::{barrier::*, prelude::*, utils::*}; use std::cell::Cell; use std::sync::{ atomic::{AtomicBool, Ordering}, Arc, }; pub struct Producer<D: DataProvider<T>, T, S: Sequencer> { sequencer: S, data_provider: Arc<D>, _element: std::marker::PhantomData<T>, } pub struct SingleProducerSequencer<W: WaitStrategy> { cursor: Arc<AtomicSequence>, next_write_sequence: Cell<Sequence>, cached_available_sequence: Cell<Sequence>, wait_strategy: Arc<W>, gating_sequences: Vec<Arc<AtomicSequence>>, buffer_size: usize, is_done: Arc<AtomicBool>, } impl<W: WaitStrategy> SingleProducerSequencer<W> { pub fn new(buffer_size: usize, wait_strategy: W) -> Self { SingleProducerSequencer { cursor: Arc::new(AtomicSequence::default()), next_write_sequence: Cell::new(0), cached_available_sequence: Cell::new(Sequence::default()), wait_strategy: Arc::new(wait_strategy), gating_sequences: Vec::new(), buffer_size, is_done: Default::default(), } } } impl<W: WaitStrategy> Sequencer for SingleProducerSequencer<W> { type Barrier = ProcessingSequenceBarrier<W>; fn next(&self, count: usize) -> (Sequence, Sequence) { let mut min_sequence = self.cached_available_sequence.take(); let next = self.next_write_sequence.take(); let (start, end) = (next, next + (count - 1) as Sequence); while min_sequence + (self.buffer_size as Sequence) < end { min_sequence = min_cursor_sequence(&self.gating_sequences); } self.cached_available_sequence.set(min_sequence); self.next_write_sequence.set(end + 1); (start, end) } fn publish(&self, highest: Sequence) { self.cursor.set(highest); self.wait_strategy.signal(); } fn create_barrier( &mut self, gating_sequences: Vec<Arc<AtomicSequence>>, ) -> ProcessingSequenceBarrier<W> { ProcessingSequenceBarrier::new( self.wait_strategy.clone(), gating_sequences, self.is_done.clone(), ) } fn add_gating_sequence(&mut self, gating_sequence: Arc<AtomicSequence>) { self.gating_sequences.push(gating_sequence); } fn get_cursor(&self) -> Arc<AtomicSequence> { self.cursor.clone() } fn drain(self) { let current = self.next_write_sequence.take() - 1; while min_cursor_sequence(&self.gating_sequences) < current { self.wait_strategy.signal(); } self.is_done.store(true, Ordering::SeqCst); self.wait_strategy.signal(); } } impl<W: WaitStrategy> Drop for SingleProducerSequencer<W> { fn drop(&mut self) { self.is_done.store(true, Ordering::SeqCst); self.wait_strategy.signal(); } } impl<'a, D: DataProvider<T> + 'a, T, S: Sequencer + 'a> EventProducer<'a> for Producer<D, T, S> { type Item = T; fn write<F, U, I, E>(&self, items: I, f: F) where D: DataProvider<T>, I: IntoIterator<Item = U, IntoIter = E>, E: ExactSizeIterator<Item = U>, F: Fn(&mut Self::Item, Sequence, &U), { let iter = items.into_iter(); let (start, end) = self.sequencer.next(iter.len()); for (idx, item) in iter.enumerate() { let seq = start + idx as Sequence; let slot = unsafe { self.data_provider.get_mut(seq) }; f(slot, seq, &item); } self.sequencer.publish(end); } fn drain(self) { self.sequencer.drain() } } impl<D: DataProvider<T>, T, S: Sequencer> Producer<D, T, S> { pub fn new(data_provider: Arc<D>, sequencer: S) -> Self { Producer { data_provider, sequencer, _element: Default::default(), } } }