Line data Source code
1 : use std::collections::VecDeque;
2 : use std::sync::Arc;
3 :
4 : use parking_lot::{Mutex, MutexGuard};
5 :
6 : use crate::executor::{self, PollSome, Waker};
7 :
8 : /// FIFO channel with blocking send and receive. Can be cloned and shared between threads.
9 : /// Blocking functions should be used only from threads that are managed by the executor.
10 : pub struct Chan<T> {
11 : shared: Arc<State<T>>,
12 : }
13 :
14 : impl<T> Clone for Chan<T> {
15 624461 : fn clone(&self) -> Self {
16 624461 : Chan {
17 624461 : shared: self.shared.clone(),
18 624461 : }
19 624461 : }
20 : }
21 :
22 : impl<T> Default for Chan<T> {
23 0 : fn default() -> Self {
24 0 : Self::new()
25 0 : }
26 : }
27 :
28 : impl<T> Chan<T> {
29 80156 : pub fn new() -> Chan<T> {
30 80156 : Chan {
31 80156 : shared: Arc::new(State {
32 80156 : queue: Mutex::new(VecDeque::new()),
33 80156 : waker: Waker::new(),
34 80156 : }),
35 80156 : }
36 80156 : }
37 :
38 : /// Get a message from the front of the queue, block if the queue is empty.
39 : /// If not called from the executor thread, it can block forever.
40 1329 : pub fn recv(&self) -> T {
41 1329 : self.shared.recv()
42 1329 : }
43 :
44 : /// Panic if the queue is empty.
45 67678 : pub fn must_recv(&self) -> T {
46 67678 : self.shared
47 67678 : .try_recv()
48 67678 : .expect("message should've been ready")
49 67678 : }
50 :
51 : /// Get a message from the front of the queue, return None if the queue is empty.
52 : /// Never blocks.
53 58595 : pub fn try_recv(&self) -> Option<T> {
54 58595 : self.shared.try_recv()
55 58595 : }
56 :
57 : /// Send a message to the back of the queue.
58 123476 : pub fn send(&self, t: T) {
59 123476 : self.shared.send(t);
60 123476 : }
61 : }
62 :
63 : struct State<T> {
64 : queue: Mutex<VecDeque<T>>,
65 : waker: Waker,
66 : }
67 :
68 : impl<T> State<T> {
69 123476 : fn send(&self, t: T) {
70 123476 : self.queue.lock().push_back(t);
71 123476 : self.waker.wake_all();
72 123476 : }
73 :
74 126273 : fn try_recv(&self) -> Option<T> {
75 126273 : let mut q = self.queue.lock();
76 126273 : q.pop_front()
77 126273 : }
78 :
79 1329 : fn recv(&self) -> T {
80 1329 : // interrupt the receiver to prevent consuming everything at once
81 1329 : executor::yield_me(0);
82 1329 :
83 1329 : let mut queue = self.queue.lock();
84 1329 : if let Some(t) = queue.pop_front() {
85 0 : return t;
86 0 : }
87 : loop {
88 2903 : self.waker.wake_me_later();
89 2903 : if let Some(t) = queue.pop_front() {
90 1258 : return t;
91 1574 : }
92 1574 : MutexGuard::unlocked(&mut queue, || {
93 1574 : executor::yield_me(-1);
94 1574 : });
95 : }
96 0 : }
97 : }
98 :
99 : impl<T> PollSome for Chan<T> {
100 : /// Schedules a wakeup for the current thread.
101 819332 : fn wake_me(&self) {
102 819332 : self.shared.waker.wake_me_later();
103 819332 : }
104 :
105 : /// Checks if chan has any pending messages.
106 659614 : fn has_some(&self) -> bool {
107 659614 : !self.shared.queue.lock().is_empty()
108 659614 : }
109 : }
|