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
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
use std::{
collections::BTreeMap,
net::{IpAddr, SocketAddr},
sync::Arc,
};
use tiny_keccak::{Hasher, Sha3};
use tokio::sync::RwLock;
use xor_name::XorName;
#[derive(Clone)]
pub(crate) struct ConnectionPool<I: ConnId> {
store: Arc<RwLock<Store<I>>>,
}
impl<I: ConnId> ConnectionPool<I> {
pub(crate) fn new() -> Self {
Self {
store: Arc::new(RwLock::new(Store::default())),
}
}
pub(crate) async fn insert(
&self,
id: I,
addr: SocketAddr,
conn: quinn::Connection,
) -> ConnectionRemover<I> {
let mut store = self.store.write().await;
let key = Key {
addr,
id: store.id_gen.next(),
};
let _ = store.id_map.insert(id, (conn.clone(), key));
let _ = store.key_map.insert(key, (conn, id));
ConnectionRemover {
store: self.store.clone(),
id,
key,
}
}
#[allow(unused)]
pub(crate) async fn has_id(&self, id: &I) -> bool {
let store = self.store.read().await;
store.id_map.contains_key(id)
}
pub(crate) async fn remove(&self, addr: &SocketAddr) -> Vec<quinn::Connection> {
let mut store = self.store.write().await;
let keys_to_remove = store
.key_map
.range_mut(Key::min(*addr)..=Key::max(*addr))
.into_iter()
.map(|(key, _)| *key)
.collect::<Vec<_>>();
keys_to_remove
.iter()
.filter_map(|key| store.key_map.remove(key).map(|entry| entry.0))
.collect::<Vec<_>>()
}
pub(crate) async fn get_by_id(
&self,
addr: &I,
) -> Option<(quinn::Connection, ConnectionRemover<I>)> {
let store = self.store.read().await;
let (conn, key) = store.id_map.get(addr)?;
let remover = ConnectionRemover {
store: self.store.clone(),
key: *key,
id: *addr,
};
Some((conn.clone(), remover))
}
pub(crate) async fn get_by_addr(
&self,
addr: &SocketAddr,
) -> Option<(quinn::Connection, ConnectionRemover<I>)> {
let store = self.store.read().await;
let (key, entry) = store
.key_map
.range(Key::min(*addr)..=Key::max(*addr))
.next()?;
let conn = entry.clone().0;
let remover = ConnectionRemover {
store: self.store.clone(),
key: *key,
id: entry.1,
};
Some((conn, remover))
}
}
#[derive(Clone)]
pub(crate) struct ConnectionRemover<I: ConnId> {
store: Arc<RwLock<Store<I>>>,
key: Key,
id: I,
}
impl<I: ConnId> ConnectionRemover<I> {
pub(crate) async fn remove(&self) {
let mut store = self.store.write().await;
let _ = store.key_map.remove(&self.key);
let _ = store.id_map.remove(&self.id);
}
pub(crate) fn id(&self) -> I {
self.id
}
}
#[derive(Default)]
struct Store<I: ConnId> {
id_map: BTreeMap<I, (quinn::Connection, Key)>,
key_map: BTreeMap<Key, (quinn::Connection, I)>,
id_gen: IdGen,
}
pub trait ConnId:
Clone + Copy + Eq + PartialEq + Ord + PartialOrd + Default + Send + Sync + 'static
{
fn generate(socket_addr: &SocketAddr) -> Self;
}
impl ConnId for XorName {
fn generate(addr: &SocketAddr) -> Self {
let mut hasher = Sha3::v256();
let mut output = [0u8; 32];
match addr.ip() {
IpAddr::V4(addr) => hasher.update(&addr.octets()),
IpAddr::V6(addr) => hasher.update(&addr.octets()),
}
hasher.update(&addr.port().to_be_bytes());
hasher.finalize(&mut output);
XorName(output)
}
}
#[derive(Clone, Copy, Eq, PartialEq, Ord, PartialOrd)]
struct Key {
addr: SocketAddr,
id: u64,
}
impl Key {
fn min(addr: SocketAddr) -> Self {
Self { addr, id: u64::MIN }
}
fn max(addr: SocketAddr) -> Self {
Self { addr, id: u64::MAX }
}
}
#[derive(Default)]
struct IdGen(u64);
impl IdGen {
fn next(&mut self) -> u64 {
let id = self.0;
self.0 = self.0.wrapping_add(1);
id
}
}