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
|
use futures::future;
use futures::stream;
use futures::task;
use futures_util::lock::BiLock;
use std::thread;
// mod support;
// use support::*;
#[test]
fn smoke() {
let future = future::lazy(|_| {
let (a, b) = BiLock::new(1);
{
let mut lock = match a.poll_lock() {
Poll::Ready(l) => l,
Poll::Pending => panic!("poll not ready"),
};
assert_eq!(*lock, 1);
*lock = 2;
assert!(b.poll_lock().is_pending());
assert!(a.poll_lock().is_pending());
}
assert!(b.poll_lock().is_ready());
assert!(a.poll_lock().is_ready());
{
let lock = match b.poll_lock() {
Poll::Ready(l) => l,
Poll::Pending => panic!("poll not ready"),
};
assert_eq!(*lock, 2);
}
assert_eq!(a.reunite(b).expect("bilock/smoke: reunite error"), 2);
Ok::<(), ()>(())
});
assert!(task::spawn(future)
.poll_future_notify(¬ify_noop(), 0)
.expect("failure in poll")
.is_ready());
}
#[test]
fn concurrent() {
const N: usize = 10000;
let (a, b) = BiLock::new(0);
let a = Increment { a: Some(a), remaining: N };
let b = stream::iter_ok(0..N).fold(b, |b, _n| {
b.lock().map(|mut b| {
*b += 1;
b.unlock()
})
});
let t1 = thread::spawn(move || a.wait());
let b = b.wait().expect("b error");
let a = t1.join().unwrap().expect("a error");
match a.poll_lock() {
Poll::Ready(l) => assert_eq!(*l, 2 * N),
Poll::Pending => panic!("poll not ready"),
}
match b.poll_lock() {
Poll::Ready(l) => assert_eq!(*l, 2 * N),
Poll::Pending => panic!("poll not ready"),
}
assert_eq!(a.reunite(b).expect("bilock/concurrent: reunite error"), 2 * N);
struct Increment {
remaining: usize,
a: Option<BiLock<usize>>,
}
impl Future for Increment {
type Item = BiLock<usize>;
type Error = ();
fn poll(&mut self) -> Poll<BiLock<usize>, ()> {
loop {
if self.remaining == 0 {
return Ok(self.a.take().unwrap().into());
}
let a = self.a.as_ref().unwrap();
let mut a = match a.poll_lock() {
Poll::Ready(l) => l,
Poll::Pending => return Ok(Poll::Pending),
};
self.remaining -= 1;
*a += 1;
}
}
}
}
|
