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
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
|
#![feature(test)]
#[macro_use]
extern crate futures;
extern crate test;
use futures::{Async, Poll, AsyncSink};
use futures::executor;
use futures::executor::{Notify, NotifyHandle};
use futures::sink::Sink;
use futures::stream::Stream;
use futures::sync::mpsc::unbounded;
use futures::sync::mpsc::channel;
use futures::sync::mpsc::Sender;
use futures::sync::mpsc::UnboundedSender;
use test::Bencher;
fn notify_noop() -> NotifyHandle {
struct Noop;
impl Notify for Noop {
fn notify(&self, _id: usize) {}
}
const NOOP : &'static Noop = &Noop;
NotifyHandle::from(NOOP)
}
/// Single producer, single consumer
#[bench]
fn unbounded_1_tx(b: &mut Bencher) {
b.iter(|| {
let (tx, rx) = unbounded();
let mut rx = executor::spawn(rx);
// 1000 iterations to avoid measuring overhead of initialization
// Result should be divided by 1000
for i in 0..1000 {
// Poll, not ready, park
assert_eq!(Ok(Async::NotReady), rx.poll_stream_notify(¬ify_noop(), 1));
UnboundedSender::unbounded_send(&tx, i).unwrap();
// Now poll ready
assert_eq!(Ok(Async::Ready(Some(i))), rx.poll_stream_notify(¬ify_noop(), 1));
}
})
}
/// 100 producers, single consumer
#[bench]
fn unbounded_100_tx(b: &mut Bencher) {
b.iter(|| {
let (tx, rx) = unbounded();
let mut rx = executor::spawn(rx);
let tx: Vec<_> = (0..100).map(|_| tx.clone()).collect();
// 1000 send/recv operations total, result should be divided by 1000
for _ in 0..10 {
for i in 0..tx.len() {
assert_eq!(Ok(Async::NotReady), rx.poll_stream_notify(¬ify_noop(), 1));
UnboundedSender::unbounded_send(&tx[i], i).unwrap();
assert_eq!(Ok(Async::Ready(Some(i))), rx.poll_stream_notify(¬ify_noop(), 1));
}
}
})
}
#[bench]
fn unbounded_uncontended(b: &mut Bencher) {
b.iter(|| {
let (tx, mut rx) = unbounded();
for i in 0..1000 {
UnboundedSender::unbounded_send(&tx, i).expect("send");
// No need to create a task, because poll is not going to park.
assert_eq!(Ok(Async::Ready(Some(i))), rx.poll());
}
})
}
/// A Stream that continuously sends incrementing number of the queue
struct TestSender {
tx: Sender<u32>,
last: u32, // Last number sent
}
// Could be a Future, it doesn't matter
impl Stream for TestSender {
type Item = u32;
type Error = ();
fn poll(&mut self) -> Poll<Option<Self::Item>, Self::Error> {
match self.tx.start_send(self.last + 1) {
Err(_) => panic!(),
Ok(AsyncSink::Ready) => {
self.last += 1;
Ok(Async::Ready(Some(self.last)))
}
Ok(AsyncSink::NotReady(_)) => {
Ok(Async::NotReady)
}
}
}
}
/// Single producers, single consumer
#[bench]
fn bounded_1_tx(b: &mut Bencher) {
b.iter(|| {
let (tx, rx) = channel(0);
let mut tx = executor::spawn(TestSender {
tx: tx,
last: 0,
});
let mut rx = executor::spawn(rx);
for i in 0..1000 {
assert_eq!(Ok(Async::Ready(Some(i + 1))), tx.poll_stream_notify(¬ify_noop(), 1));
assert_eq!(Ok(Async::NotReady), tx.poll_stream_notify(¬ify_noop(), 1));
assert_eq!(Ok(Async::Ready(Some(i + 1))), rx.poll_stream_notify(¬ify_noop(), 1));
}
})
}
/// 100 producers, single consumer
#[bench]
fn bounded_100_tx(b: &mut Bencher) {
b.iter(|| {
// Each sender can send one item after specified capacity
let (tx, rx) = channel(0);
let mut tx: Vec<_> = (0..100).map(|_| {
executor::spawn(TestSender {
tx: tx.clone(),
last: 0
})
}).collect();
let mut rx = executor::spawn(rx);
for i in 0..10 {
for j in 0..tx.len() {
// Send an item
assert_eq!(Ok(Async::Ready(Some(i + 1))), tx[j].poll_stream_notify(¬ify_noop(), 1));
// Then block
assert_eq!(Ok(Async::NotReady), tx[j].poll_stream_notify(¬ify_noop(), 1));
// Recv the item
assert_eq!(Ok(Async::Ready(Some(i + 1))), rx.poll_stream_notify(¬ify_noop(), 1));
}
}
})
}
|
