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
use crate::WakerEntity;
use ach_array::Array;
use core::sync::atomic::{AtomicBool, Ordering};
pub struct WakerToken<'a, T, const N: usize> {
pool: &'a WakerPool<T, N>,
index: usize,
}
impl<'a, T, const N: usize> WakerToken<'a, T, N> {
pub fn swap(&self, waker: WakerEntity<T>) {
if let Err(e) = self.pool.pool[self.index].try_replace(waker) {
e.input.wake();
}
}
}
impl<'a, T, const N: usize> Drop for WakerToken<'a, T, N> {
fn drop(&mut self) {
if let Ok(wake) = self.pool.pool[self.index].get() {
wake.remove();
}
let _ = self.pool.used[self.index].compare_exchange(
true,
false,
Ordering::SeqCst,
Ordering::Relaxed,
);
}
}
pub struct WakerPool<T, const N: usize> {
pool: Array<WakerEntity<T>, N>,
used: [AtomicBool; N],
}
impl<T, const N: usize> WakerPool<T, N> {
const FALSE: AtomicBool = AtomicBool::new(false);
pub const fn new() -> Self {
Self {
pool: Array::new(),
used: [Self::FALSE; N],
}
}
pub fn register(&self) -> Result<WakerToken<T, N>, ()> {
for (i, used) in self.used.iter().enumerate() {
if used
.compare_exchange(false, true, Ordering::SeqCst, Ordering::Relaxed)
.is_ok()
{
return Ok(WakerToken {
pool: self,
index: i,
});
}
}
Err(())
}
pub fn wake_one(&self) -> bool {
loop {
if let Some(waker) = self.pool.pop() {
if waker.wake() {
return true;
}
} else {
return false;
}
}
}
pub fn wake_all(&self) -> usize {
let mut num = 0;
while let Some(waker) = self.pool.pop() {
waker.wake();
num += 1;
}
num
}
pub fn retain(&self, mut f: impl FnMut(&WakerEntity<T>) -> bool) {
for e in self.pool.iter(false) {
if !f(&*e) {
e.remove();
}
}
}
}