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
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
use crate::dht::{
errors::DHTError,
rpc::{DHTMessage, DHTMessageProcessor, DHTRecord, DHTRequest, DHTResponse},
swarm::{build_swarm, DHTEvent, DHTSwarm, DHTSwarmEvent},
DHTConfig, RecordValidator,
};
use libp2p::{
core::transport::ListenerId,
futures::StreamExt,
identify::Event as IdentifyEvent,
kad::{
self,
kbucket::{Distance, NodeStatus},
record::{store::RecordStore, Key},
KademliaEvent, PeerRecord, QueryResult, Quorum, Record,
},
swarm::{
dial_opts::{DialOpts, PeerCondition},
SwarmEvent,
},
Multiaddr, PeerId,
};
use std::fmt;
use std::{collections::HashMap, time::Duration};
use tokio;
/// The processing component of a [DHTNode]/[DHTProcessor] pair. Consumers
/// should only interface with a [DHTProcessor] via [DHTNode].
pub struct DHTProcessor<V: RecordValidator + 'static> {
config: DHTConfig,
peer_id: PeerId,
processor: DHTMessageProcessor,
swarm: DHTSwarm,
requests: HashMap<kad::QueryId, DHTMessage>,
listeners: HashMap<Multiaddr, ListenerId>,
kad_last_range: Option<(Distance, Distance)>,
validator: Option<V>,
}
// Temporary(?), exploring processing both requests that
// are bound by kad::QueryId, and requests that do not tie
// into DHT queries (like WaitForPeers).
macro_rules! store_request {
($self:expr, $message:expr, $result:expr) => {
let result: Result<kad::QueryId, DHTError> = $result.map_err(|e| e.into());
match result {
Ok(query_id) => {
$self.requests.insert(query_id, $message);
}
Err(e) => {
$message.respond(Err(e));
}
};
};
}
impl<V> DHTProcessor<V>
where
V: RecordValidator + 'static,
{
/// Creates a new [DHTProcessor] and spawns a networking thread for processing.
/// The processor can only be accessed through channels via the corresponding
/// [DHTNode].
pub(crate) fn spawn(
keypair: &libp2p::identity::Keypair,
peer_id: PeerId,
validator: Option<V>,
config: DHTConfig,
processor: DHTMessageProcessor,
) -> Result<tokio::task::JoinHandle<Result<(), DHTError>>, DHTError> {
let swarm = build_swarm(keypair, &peer_id, &config)?;
let mut node = DHTProcessor {
peer_id,
config,
processor,
swarm,
requests: HashMap::default(),
listeners: HashMap::default(),
kad_last_range: None,
validator,
};
Ok(tokio::spawn(async move { node.process().await }))
}
/// Begin processing requests and connections on the DHT network
/// in the current thread. Executes until the loop is broken, via
/// either an unhandlable error or a terminate message (not yet implemented).
async fn process(&mut self) -> Result<(), DHTError> {
// Queue up bootstrapping this node both immediately, and every
// `bootstrap_interval` seconds.
let mut bootstrap_tick =
tokio::time::interval(Duration::from_secs(self.config.bootstrap_interval));
// Traverse and potentially dial peers on this interval.
let mut peer_dialing_tick =
tokio::time::interval(Duration::from_secs(self.config.peer_dialing_interval));
loop {
tokio::select! {
message = self.processor.pull_message() => {
match message {
Some(m) => self.process_message(m).await,
// This occurs when sender is closed (client dropped).
// Exit the process loop for thread clean up.
None => {
error!("DHT processing loop unexpectedly closed.");
break
},
}
}
event = self.swarm.select_next_some() => {
self.process_swarm_event(event).await
}
_ = bootstrap_tick.tick() => self.execute_bootstrap()?,
_ = peer_dialing_tick.tick() => self.dial_next_peer(),
}
}
Ok(())
}
/// Processes an incoming DHTMessage. Will attempt to respond
/// immediately if possible (synchronous error or pulling value from cache),
/// otherwise, the message will be mapped to a query, where it can be fulfilled
/// later, most likely in `process_kad_result()`.
async fn process_message(&mut self, message: DHTMessage) {
dht_event_trace(self, &message);
// Process client requests.
match message.request {
DHTRequest::AddPeers { ref peers } => {
let result = self.add_peers(peers).await.map(|_| DHTResponse::Success);
message.respond(result);
}
DHTRequest::StartListening { ref address } => {
let result = self.start_listening(address).map(|_| DHTResponse::Success);
message.respond(result);
}
DHTRequest::StopListening { ref address } => {
let result = self.stop_listening(address).map(|_| DHTResponse::Success);
message.respond(result);
}
DHTRequest::GetAddresses { external } => {
let listeners: Vec<Multiaddr> = if external {
self.swarm
.external_addresses()
.map(|addr_record| addr_record.addr.to_owned())
.collect::<Vec<Multiaddr>>()
} else {
self.swarm
.listeners()
.map(|addr| addr.to_owned())
.collect::<Vec<Multiaddr>>()
};
message.respond(Ok(DHTResponse::GetAddresses(listeners)));
}
DHTRequest::Bootstrap => {
message.respond(self.execute_bootstrap().map(|_| DHTResponse::Success));
}
DHTRequest::GetProviders { ref key } => {
store_request!(
self,
message,
Ok::<kad::QueryId, DHTError>(
self.swarm.behaviour_mut().kad.get_providers(Key::new(key))
)
);
}
/*
DHTRequest::WaitForPeers(peers) => {
let info = self.swarm.network_info();
if info.num_peers() >= peers {
message.respond(Ok(DHTResponse::Success));
} else {
store_request!(self, message);
}
}
*/
DHTRequest::GetNetworkInfo => {
let info = self.swarm.network_info();
message.respond(Ok(DHTResponse::GetNetworkInfo(info.into())));
}
DHTRequest::StartProviding { ref key } => {
store_request!(
self,
message,
self.swarm
.behaviour_mut()
.kad
.start_providing(Key::new(key))
);
}
DHTRequest::GetRecord { ref key } => {
store_request!(
self,
message,
Ok::<kad::QueryId, DHTError>(
self.swarm
.behaviour_mut()
.kad
.get_record(Key::new(key), Quorum::One)
)
);
}
DHTRequest::PutRecord { ref key, ref value } => {
let value_owned = value.to_owned();
if self.validate(value).await {
let record = Record {
key: Key::new(key),
value: value_owned,
publisher: None,
expires: None,
};
store_request!(
self,
message,
self.swarm
.behaviour_mut()
.kad
.put_record(record, Quorum::One)
);
} else {
message.respond(Err(DHTError::ValidationError(value_owned)));
}
}
};
}
/// Processes an incoming SwarmEvent, triggered from swarm activity or
/// a swarm query. If a SwarmEvent has an associated DHTQuery,
/// the pending query will be fulfilled.
async fn process_swarm_event(&mut self, event: DHTSwarmEvent) {
dht_event_trace(self, &event);
match event {
SwarmEvent::Behaviour(DHTEvent::Kademlia(e)) => self.process_kad_event(e).await,
SwarmEvent::Behaviour(DHTEvent::Identify(e)) => self.process_identify_event(e),
// The following events are currently handled only for debug logging.
SwarmEvent::NewListenAddr { address: _, .. } => {}
SwarmEvent::ConnectionEstablished { peer_id: _, .. } => {}
SwarmEvent::ConnectionClosed {
peer_id: _,
cause: _,
..
} => {}
SwarmEvent::IncomingConnection {
local_addr: _,
send_back_addr: _,
} => {}
SwarmEvent::IncomingConnectionError {
local_addr: _,
send_back_addr: _,
error: _,
} => {}
SwarmEvent::OutgoingConnectionError {
peer_id: _,
error: _,
} => {}
SwarmEvent::BannedPeer { peer_id: _, .. } => {}
SwarmEvent::ExpiredListenAddr {
listener_id: _,
address: _,
} => {}
SwarmEvent::ListenerClosed {
listener_id: _,
addresses: _,
reason: _,
} => {}
SwarmEvent::ListenerError {
listener_id: _,
error: _,
} => {}
SwarmEvent::Dialing(_) => {}
}
}
async fn process_kad_event(&mut self, event: KademliaEvent) {
match event {
KademliaEvent::OutboundQueryCompleted { id, result, .. } => match result {
QueryResult::GetRecord(Ok(ok)) => {
for PeerRecord {
record: Record { key, value, .. },
..
} in ok.records
{
if let Some(message) = self.requests.remove(&id) {
let is_valid = self.validate(&value).await;
// We don't want to propagate validation errors for all
// possible invalid records, but handle it similarly as if
// no record at all was found.
message.respond(Ok(DHTResponse::GetRecord(DHTRecord {
key: key.to_vec(),
value: if is_valid { Some(value) } else { None },
})));
};
}
}
QueryResult::GetRecord(Err(e)) => {
if let Some(message) = self.requests.remove(&id) {
match e {
kad::GetRecordError::NotFound { key, .. } => {
// Not finding a record is not an `Err` response,
// but simply a successful query with a `None` result.
message.respond(Ok(DHTResponse::GetRecord(DHTRecord {
key: key.to_vec(),
value: None,
})))
}
e => message.respond(Err(DHTError::from(e))),
};
}
}
QueryResult::PutRecord(Ok(kad::PutRecordOk { key })) => {
if let Some(message) = self.requests.remove(&id) {
message.respond(Ok(DHTResponse::PutRecord { key: key.to_vec() }));
}
}
QueryResult::PutRecord(Err(e)) => {
match e {
kad::PutRecordError::Timeout {
ref key,
quorum: _,
success: _,
}
| kad::PutRecordError::QuorumFailed {
ref key,
quorum: _,
success: _,
} => {
let record = self.swarm.behaviour_mut().kad.store_mut().get(key);
trace!("Has internal record? {:?}", record);
}
}
if let Some(message) = self.requests.remove(&id) {
message.respond(Err(DHTError::from(e)));
}
}
QueryResult::StartProviding(Ok(kad::AddProviderOk { key })) => {
if let Some(message) = self.requests.remove(&id) {
message.respond(Ok(DHTResponse::StartProviding { key: key.to_vec() }));
}
}
QueryResult::StartProviding(Err(e)) => {
if let Some(message) = self.requests.remove(&id) {
message.respond(Err(DHTError::from(e)));
}
}
QueryResult::GetProviders(Ok(kad::GetProvidersOk {
providers,
key,
closest_peers: _,
})) => {
if let Some(message) = self.requests.remove(&id) {
message.respond(Ok(DHTResponse::GetProviders {
providers: providers.into_iter().collect(),
key: key.to_vec(),
}));
}
}
QueryResult::GetProviders(Err(e)) => {
if let Some(message) = self.requests.remove(&id) {
message.respond(Err(DHTError::from(e)));
}
}
QueryResult::Bootstrap(Ok(kad::BootstrapOk {
peer: _,
num_remaining: _,
})) => {}
QueryResult::Bootstrap(Err(kad::BootstrapError::Timeout {
peer: _,
num_remaining: _,
})) => {}
_ => {}
},
KademliaEvent::InboundRequest { request } => match request {
kad::InboundRequest::FindNode {
num_closer_peers: _,
} => {}
kad::InboundRequest::GetProvider {
num_closer_peers: _,
num_provider_peers: _,
} => {}
kad::InboundRequest::AddProvider { record: _ } => {}
kad::InboundRequest::GetRecord {
num_closer_peers: _,
present_locally: _,
} => {}
kad::InboundRequest::PutRecord { source, record, .. } => match record {
Some(rec) => {
if self.validate(&rec.value).await {
if let Err(e) =
self.swarm.behaviour_mut().kad.store_mut().put(rec.clone())
{
warn!(
"InboundRequest::PutRecord write failed: {:?} {:?}, {}",
rec, source, e
);
}
} else {
warn!(
"InboundRequest::PutRecord validation failed: {:?} {:?}",
rec, source
);
}
}
None => warn!("InboundRequest::PutRecord failed; empty record"),
},
},
KademliaEvent::RoutingUpdated {
peer: _,
is_new_peer: _,
addresses: _,
..
} => {}
KademliaEvent::UnroutablePeer { peer: _ } => {}
KademliaEvent::RoutablePeer {
peer: _,
address: _,
} => {}
KademliaEvent::PendingRoutablePeer {
peer: _,
address: _,
} => {}
}
}
fn process_identify_event(&mut self, event: IdentifyEvent) {
if let IdentifyEvent::Received { peer_id, info } = event {
if info
.protocols
.iter()
.any(|p| p.as_bytes() == kad::protocol::DEFAULT_PROTO_NAME)
{
for addr in &info.listen_addrs {
self.swarm
.behaviour_mut()
.kad
.add_address(&peer_id, addr.clone());
}
}
}
}
/// Traverses the kbuckets to dial potential peers that
/// are not yet connected. Implementation inspired by iroh:
/// https://github.com/n0-computer/iroh/blob/main/iroh-p2p/src/node.rs
fn dial_next_peer(&mut self) {
let mut to_dial = None;
for kbucket in self.swarm.behaviour_mut().kad.kbuckets() {
if let Some(range) = self.kad_last_range {
if kbucket.range() == range {
continue;
}
}
// find the first disconnected node
for entry in kbucket.iter() {
if entry.status == NodeStatus::Disconnected {
let peer_id = entry.node.key.preimage();
let dial_opts = DialOpts::peer_id(*peer_id)
.condition(PeerCondition::Disconnected)
.addresses(entry.node.value.clone().into_vec())
.extend_addresses_through_behaviour()
.build();
to_dial = Some((dial_opts, kbucket.range()));
break;
}
}
}
if let Some((dial_opts, range)) = to_dial {
if let Err(e) = self.swarm.dial(dial_opts) {
warn!("failed to dial: {:?}", e);
}
self.kad_last_range = Some(range);
}
}
/// Starts listening on the provided address.
fn start_listening(&mut self, address: &libp2p::Multiaddr) -> Result<(), DHTError> {
dht_event_trace(self, &format!("Start listening on {}", address));
let listener_id = self.swarm.listen_on(address.to_owned())?;
// The swarm's `listeners()` iterator does not contain ListenerId,
// needed for `remove_listener()`, so we track redundantly here.
if let Some(previous_id) = self.listeners.insert(address.to_owned(), listener_id) {
assert!(self.swarm.remove_listener(previous_id));
}
Ok(())
}
/// Stops listening on the provided address.
fn stop_listening(&mut self, address: &libp2p::Multiaddr) -> Result<(), DHTError> {
dht_event_trace(self, &format!("Stop listening on {}", address));
if let Some(listener_id) = self.listeners.get(address) {
assert!(self.swarm.remove_listener(listener_id.to_owned()));
}
Ok(())
}
/// Adds bootstrap peers to the routing table.
async fn add_peers(&mut self, peers: &[libp2p::Multiaddr]) -> Result<(), DHTError> {
for multiaddress in peers {
let mut addr = multiaddress.to_owned();
if let Some(libp2p::multiaddr::Protocol::P2p(p2p_hash)) = addr.pop() {
let peer_id = PeerId::from_multihash(p2p_hash).unwrap();
// Do not add a peer with the same peer id, for example
// a set of N bootstrap nodes using a static list of
// N addresses/peer IDs.
if peer_id != self.peer_id {
self.swarm.behaviour_mut().kad.add_address(&peer_id, addr);
}
}
}
Ok(())
}
fn execute_bootstrap(&mut self) -> Result<(), DHTError> {
dht_event_trace(self, &"Execute bootstrap");
match self.swarm.behaviour_mut().kad.bootstrap() {
Ok(_) => Ok(()),
Err(_) => {
// `NoKnownPeers` error is expected without any bootstrap peers.
Ok(())
}
}
}
async fn validate(&mut self, data: &[u8]) -> bool {
if let Some(v) = self.validator.as_mut() {
v.validate(data).await
} else {
true
}
}
}
impl<V> fmt::Debug for DHTProcessor<V>
where
V: RecordValidator + 'static,
{
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
f.debug_struct("DHTNode")
.field("peer_id", &self.peer_id)
.field("config", &self.config)
.finish()
}
}
impl<V> Drop for DHTProcessor<V>
where
V: RecordValidator + 'static,
{
fn drop(&mut self) {}
}
// #[cfg(test)]
/// Logging utility. Unfortunately, integration tests do not work
/// with `#[cfg(test)]` to enable the option of rendering the full
/// peer id during non-testing (one process, one peer id) scenarios.
/// https://doc.rust-lang.org/book/ch11-03-test-organization.html
fn dht_event_trace<V: RecordValidator, T: std::fmt::Debug>(processor: &DHTProcessor<V>, data: &T) {
// Convert a full PeerId to a shorter, more identifiable
// string for comparison in logs during tests, where multiple nodes
// are shared by a single process. All Ed25519 keys have
// the prefix `12D3KooW`, so skip the commonalities and use
// the next 6 characters for logging.
let peer_id_b58 = processor.peer_id.to_base58();
trace!(
"\nFrom ..{:#?}..\n{:#?}",
peer_id_b58.get(8..14).unwrap_or("INVALID PEER ID"),
data
);
}
/*
#[cfg(not(test))]
fn dht_event_trace<T: std::fmt::Debug>(processor: &DHTProcessor, data: &T) {
trace!(
"\nFrom ..{:#?}..\n{:#?}",
processor.peer_id.to_base58(),
data
);
}
*/