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 599536 : fn clone(&self) -> Self {
16 599536 : Chan {
17 599536 : shared: self.shared.clone(),
18 599536 : }
19 599536 : }
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 78289 : pub fn new() -> Chan<T> {
30 78289 : Chan {
31 78289 : shared: Arc::new(State {
32 78289 : queue: Mutex::new(VecDeque::new()),
33 78289 : waker: Waker::new(),
34 78289 : }),
35 78289 : }
36 78289 : }
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 1249 : pub fn recv(&self) -> T {
41 1249 : self.shared.recv()
42 1249 : }
43 :
44 : /// Panic if the queue is empty.
45 65522 : pub fn must_recv(&self) -> T {
46 65522 : self.shared
47 65522 : .try_recv()
48 65522 : .expect("message should've been ready")
49 65522 : }
50 :
51 : /// Get a message from the front of the queue, return None if the queue is empty.
52 : /// Never blocks.
53 56033 : pub fn try_recv(&self) -> Option<T> {
54 56033 : self.shared.try_recv()
55 56033 : }
56 :
57 : /// Send a message to the back of the queue.
58 118666 : pub fn send(&self, t: T) {
59 118666 : self.shared.send(t);
60 118666 : }
61 : }
62 :
63 : struct State<T> {
64 : queue: Mutex<VecDeque<T>>,
65 : waker: Waker,
66 : }
67 :
68 : impl<T> State<T> {
69 118666 : fn send(&self, t: T) {
70 118666 : self.queue.lock().push_back(t);
71 118666 : self.waker.wake_all();
72 118666 : }
73 :
74 121555 : fn try_recv(&self) -> Option<T> {
75 121555 : let mut q = self.queue.lock();
76 121555 : q.pop_front()
77 121555 : }
78 :
79 1249 : fn recv(&self) -> T {
80 1249 : // interrupt the receiver to prevent consuming everything at once
81 1249 : executor::yield_me(0);
82 1249 :
83 1249 : let mut queue = self.queue.lock();
84 1249 : if let Some(t) = queue.pop_front() {
85 0 : return t;
86 0 : }
87 : loop {
88 2741 : self.waker.wake_me_later();
89 2741 : if let Some(t) = queue.pop_front() {
90 1198 : return t;
91 1492 : }
92 1492 : MutexGuard::unlocked(&mut queue, || {
93 1492 : executor::yield_me(-1);
94 1492 : });
95 : }
96 0 : }
97 : }
98 :
99 : impl<T> PollSome for Chan<T> {
100 : /// Schedules a wakeup for the current thread.
101 781679 : fn wake_me(&self) {
102 781679 : self.shared.waker.wake_me_later();
103 781679 : }
104 :
105 : /// Checks if chan has any pending messages.
106 631157 : fn has_some(&self) -> bool {
107 631157 : !self.shared.queue.lock().is_empty()
108 631157 : }
109 : }
|