timely_communication/allocator/counters.rs
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 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146
//! Push and Pull wrappers to maintain counts of messages in channels.
use std::rc::Rc;
use std::cell::RefCell;
use crate::{Push, Pull};
/// The push half of an intra-thread channel.
pub struct Pusher<T, P: Push<T>> {
index: usize,
// count: usize,
events: Rc<RefCell<Vec<usize>>>,
pusher: P,
phantom: ::std::marker::PhantomData<T>,
}
impl<T, P: Push<T>> Pusher<T, P> {
/// Wraps a pusher with a message counter.
pub fn new(pusher: P, index: usize, events: Rc<RefCell<Vec<usize>>>) -> Self {
Pusher {
index,
// count: 0,
events,
pusher,
phantom: ::std::marker::PhantomData,
}
}
}
impl<T, P: Push<T>> Push<T> for Pusher<T, P> {
#[inline]
fn push(&mut self, element: &mut Option<T>) {
// if element.is_none() {
// if self.count != 0 {
// self.events
// .borrow_mut()
// .push_back(self.index);
// self.count = 0;
// }
// }
// else {
// self.count += 1;
// }
// TODO: Version above is less chatty, but can be a bit late in
// moving information along. Better, but needs cooperation.
self.events
.borrow_mut()
.push(self.index);
self.pusher.push(element)
}
}
use crossbeam_channel::Sender;
/// The push half of an intra-thread channel.
pub struct ArcPusher<T, P: Push<T>> {
index: usize,
// count: usize,
events: Sender<usize>,
pusher: P,
phantom: ::std::marker::PhantomData<T>,
buzzer: crate::buzzer::Buzzer,
}
impl<T, P: Push<T>> ArcPusher<T, P> {
/// Wraps a pusher with a message counter.
pub fn new(pusher: P, index: usize, events: Sender<usize>, buzzer: crate::buzzer::Buzzer) -> Self {
ArcPusher {
index,
// count: 0,
events,
pusher,
phantom: ::std::marker::PhantomData,
buzzer,
}
}
}
impl<T, P: Push<T>> Push<T> for ArcPusher<T, P> {
#[inline]
fn push(&mut self, element: &mut Option<T>) {
// if element.is_none() {
// if self.count != 0 {
// self.events
// .send((self.index, Event::Pushed(self.count)))
// .expect("Failed to send message count");
// self.count = 0;
// }
// }
// else {
// self.count += 1;
// }
// These three calls should happen in this order, to ensure that
// we first enqueue data, second enqueue interest in the channel,
// and finally awaken the thread. Other orders are defective when
// multiple threads are involved.
self.pusher.push(element);
let _ = self.events.send(self.index);
// TODO : Perhaps this shouldn't be a fatal error (e.g. in shutdown).
// .expect("Failed to send message count");
self.buzzer.buzz();
}
}
/// The pull half of an intra-thread channel.
pub struct Puller<T, P: Pull<T>> {
index: usize,
count: usize,
events: Rc<RefCell<Vec<usize>>>,
puller: P,
phantom: ::std::marker::PhantomData<T>,
}
impl<T, P: Pull<T>> Puller<T, P> {
/// Wraps a puller with a message counter.
pub fn new(puller: P, index: usize, events: Rc<RefCell<Vec<usize>>>) -> Self {
Puller {
index,
count: 0,
events,
puller,
phantom: ::std::marker::PhantomData,
}
}
}
impl<T, P: Pull<T>> Pull<T> for Puller<T, P> {
#[inline]
fn pull(&mut self) -> &mut Option<T> {
let result = self.puller.pull();
if result.is_none() {
if self.count != 0 {
self.events
.borrow_mut()
.push(self.index);
self.count = 0;
}
}
else {
self.count += 1;
}
result
}
}