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
|
//! The member registry: every node that has joined the swarm, under
//! `_continuum/members/<pk>`, replicated with the document (and carried into new
//! epochs with the rest of `_continuum`).
//!
//! A pure registry: it decides nothing about admission (that's the swarm key). Each
//! node registers itself once it is ready, and re-registers if its entry disappears
//! while it is alive. An operator's forget (`DELETE /peers/{pk}`) removes the entry
//! together with writing the forget record; a forgotten node that turns out to be alive
//! cancels the record and registers again.
//!
//! Besides its tier, an entry holds the alias a node gives itself (`--alias`), a name
//! for people reading /peers and metrics (not unique and never an identity: the public
//! key stays that), where it can be reached (`addresses`, as its transport gives them:
//! hints for the others' transports), and an `alive` stamp the node renews now and
//! then: the members renewed within `--electorate-window` are the electorate of a
//! remake.
use std::collections::HashMap;
use std::time::Duration;
use automerge::AutoCommit;
use serde_json::{Value as JsonValue, json};
use tracing::{debug, info, warn};
use crate::document::meta;
use crate::document::store::{self, StoreError};
use crate::state::AppState;
pub(crate) fn members_dir() -> Vec<String> {
meta::path(&[meta::MEMBERS])
}
pub(crate) fn member_path(pk: &str) -> Vec<String> {
let mut path = members_dir();
path.push(pk.to_owned());
path
}
/// Public keys of all registered members, sorted.
pub(crate) fn members(doc: &AutoCommit) -> Vec<String> {
let mut members = store::keys_at(doc, &members_dir()).unwrap_or_default();
members.sort();
members
}
/// A member's stability tier, judged by itself (`swarm::stability`).
#[derive(Clone, Copy, Debug, Default, PartialEq, Eq)]
pub(crate) enum Tier {
Stable,
#[default]
Transient,
}
impl Tier {
pub(crate) fn as_str(self) -> &'static str {
match self {
Self::Stable => "stable",
Self::Transient => "transient",
}
}
}
fn tier_path(pk: &str) -> Vec<String> {
let mut path = member_path(pk);
path.push("tier".to_owned());
path
}
/// `pk`'s tier; transient unless its entry says stable.
pub(crate) fn tier(doc: &AutoCommit, pk: &str) -> Tier {
match store::read_path(doc, &tier_path(pk)) {
Ok(Some(JsonValue::String(tier))) if tier == "stable" => Tier::Stable,
_ => Tier::Transient,
}
}
pub(crate) fn set_tier(doc: &mut AutoCommit, pk: &str, tier: Tier) -> Result<(), StoreError> {
store::write_path(doc, &tier_path(pk), &json!(tier.as_str()))
}
fn alias_path(pk: &str) -> Vec<String> {
let mut path = member_path(pk);
path.push("alias".to_owned());
path
}
/// `pk`'s alias, if it gave itself one.
pub(crate) fn alias(doc: &AutoCommit, pk: &str) -> Option<String> {
match store::read_path(doc, &alias_path(pk)) {
Ok(Some(JsonValue::String(alias))) => Some(alias),
_ => None,
}
}
/// The aliases of all members that have one.
pub(crate) fn aliases(doc: &AutoCommit) -> HashMap<String, String> {
members(doc)
.into_iter()
.filter_map(|pk| alias(doc, &pk).map(|alias| (pk, alias)))
.collect()
}
fn set_alias(doc: &mut AutoCommit, pk: &str, alias: Option<&str>) -> Result<(), StoreError> {
match alias {
Some(alias) => store::write_path(doc, &alias_path(pk), &json!(alias)),
None => match store::delete_path(doc, &alias_path(pk), false) {
Err(StoreError::NotFound) => Ok(()),
result => result,
},
}
}
fn addresses_path(pk: &str) -> Vec<String> {
let mut path = member_path(pk);
path.push("addresses".to_owned());
path
}
/// Addresses a member most likely has, at most: one per transport.
const MAX_ADDRESSES: usize = 8;
/// Where `pk` says it can be reached (at most `MAX_ADDRESSES`); none if its entry
/// doesn't say.
pub(crate) fn addresses(doc: &AutoCommit, pk: &str) -> Vec<String> {
match store::read_path(doc, &addresses_path(pk)) {
Ok(Some(JsonValue::Array(items))) => items
.into_iter()
.filter_map(|item| match item {
JsonValue::String(address) => Some(address),
_ => None,
})
.take(MAX_ADDRESSES)
.collect(),
_ => Vec::new(),
}
}
/// Hands every other member's addresses to the transport (`Transport::learn_addresses`):
/// the member list is how a node finds where members it never met are.
pub(crate) fn learn_addresses(state: &AppState, doc: &AutoCommit) {
let me = state.local_id();
for pk in members(doc) {
if pk != me {
state.transport.learn_addresses(&pk, &addresses(doc, &pk));
}
}
}
/// Relays listed for the swarm, at most this many.
const MAX_RELAYS: usize = 32;
/// The relays listed for the swarm under `_continuum/relays` (by `--protocol-writers`):
/// addresses (`libp2p:<multiaddr>`, with or without the relay's peer ID) of relays that
/// aren't members, e.g. nodes that only relay. Every member's transport may
/// pick them (`Transport::learn_relays`), after the relays it is configured with.
pub(crate) fn relays(doc: &AutoCommit) -> Vec<String> {
match store::read_path(doc, &meta::path(&[meta::RELAYS])) {
Ok(Some(JsonValue::Array(items))) => items
.into_iter()
.filter_map(|item| match item {
JsonValue::String(address) => Some(address),
_ => None,
})
.take(MAX_RELAYS)
.collect(),
_ => Vec::new(),
}
}
fn alive_path(pk: &str) -> Vec<String> {
let mut path = member_path(pk);
path.push("alive".to_owned());
path
}
fn millis_at(doc: &AutoCommit, path: &[String]) -> Option<u64> {
match store::read_path(doc, path) {
Ok(Some(JsonValue::Number(number))) => number.as_u64(),
_ => None,
}
}
/// When `pk` last said it is alive (Unix ms): its last renewal, or its registration.
pub(crate) fn alive_at(doc: &AutoCommit, pk: &str) -> Option<u64> {
let mut since = member_path(pk);
since.push("since".to_owned());
millis_at(doc, &alive_path(pk)).max(millis_at(doc, &since))
}
/// The members that said they are alive within `window` before `now_ms` (sorted): the
/// electorate of a remake (`remake::coordinator`).
pub(crate) fn electorate(doc: &AutoCommit, now_ms: u64, window: Duration) -> Vec<String> {
let oldest = now_ms.saturating_sub(window.as_millis() as u64);
members(doc)
.into_iter()
.filter(|pk| alive_at(doc, pk).is_some_and(|at| at >= oldest))
.collect()
}
/// How often a node renews its `alive` stamp: often enough that a live node never
/// drops out of the electorate (a seventh of the window), but at most hourly and at
/// least daily, so idle swarms stay quiet.
fn alive_renewal(window: Duration) -> Duration {
(window / 7).clamp(Duration::from_secs(3600), Duration::from_secs(24 * 3600))
}
/// Registers this node if it is ready and its entry is missing, keeps its alias as
/// configured (set, changed or removed after a restart with another `--alias`) and its
/// addresses as the transport gives them, and renews its `alive` stamp now and then
/// (see `electorate`).
pub(crate) async fn ensure_registered(state: &AppState) {
if !state.is_ready().await {
return;
}
let local = state.local_id().to_owned();
let own = member_path(&local);
let (registered, recorded_alias, recorded_addresses, alive) = {
let replica = state.doc.read().await;
let registered = store::read_path(&replica.doc, &own)
.ok()
.flatten()
.is_some();
(
registered,
alias(&replica.doc, &local),
addresses(&replica.doc, &local),
millis_at(&replica.doc, &alive_path(&local)),
)
};
let wanted = state.alias.clone();
let mut own_addresses = state.transport.local_addresses();
own_addresses.truncate(MAX_ADDRESSES);
let now = state.clock.now_millis().as_u64();
if !registered {
let mut entry = json!({ "since": now, "alive": now, "addresses": own_addresses });
if let Some(alias) = &wanted {
entry["alias"] = json!(alias);
}
match state
.mutate_doc(move |doc| store::write_path(doc, &own, &entry))
.await
{
Ok(()) => info!(
alias = wanted.as_deref(),
"Registered in the swarm's member list"
),
Err(error) => warn!(error = %error, "Failed to register in the member list"),
}
return;
}
let renewal = alive_renewal(state.electorate_window).as_millis() as u64;
if alive.is_none_or(|at| now.saturating_sub(at) >= renewal) {
let path = alive_path(&local);
match state
.mutate_doc(move |doc| store::write_path(doc, &path, &json!(now)))
.await
{
Ok(()) => debug!("Renewed our alive stamp in the member list"),
Err(error) => warn!(error = %error, "Failed to renew our alive stamp"),
}
}
if recorded_addresses != own_addresses {
let path = addresses_path(&local);
let value = json!(own_addresses);
match state
.mutate_doc(move |doc| store::write_path(doc, &path, &value))
.await
{
Ok(()) => info!(addresses = ?own_addresses, "Addresses updated in the member list"),
Err(error) => warn!(error = %error, "Failed to record our addresses"),
}
}
if recorded_alias == wanted {
return;
}
let alias = wanted.clone();
match state
.mutate_doc(move |doc| set_alias(doc, &local, alias.as_deref()))
.await
{
Ok(()) => info!(
alias = wanted.as_deref(),
previous = recorded_alias.as_deref(),
"Alias updated in the member list"
),
Err(error) => warn!(error = %error, "Failed to record our alias"),
}
}
/// Removes `pk`'s entry (an operator forgot it). Absent is fine.
pub(crate) fn unregister(doc: &mut AutoCommit, pk: &str) -> Result<(), StoreError> {
match store::delete_path(doc, &member_path(pk), false) {
Err(StoreError::NotFound) => Ok(()),
result => result,
}
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn electorate_by_alive_stamp() {
let day = 24 * 3600 * 1000;
let now = 100 * day;
let mut doc = AutoCommit::new();
let entries = [
("fresh", json!({ "since": 1, "alive": now - day })),
("stale", json!({ "since": 1, "alive": now - 8 * day })),
("new", json!({ "since": now - day })),
("old", json!({ "since": 1 })),
];
for (pk, entry) in entries {
store::write_path(&mut doc, &member_path(pk), &entry).unwrap();
}
assert_eq!(
electorate(&doc, now, Duration::from_secs(7 * 24 * 3600)),
["fresh", "new"]
);
}
#[test]
fn listed_relays() {
let mut doc = AutoCommit::new();
assert!(relays(&doc).is_empty());
let relay = "libp2p:/ip6/fd00::1/tcp/9661";
store::write_path(&mut doc, &meta::path(&[meta::RELAYS]), &json!([relay, 7])).unwrap();
assert_eq!(relays(&doc), [relay]); // Anything but text is ignored.
store::write_path(&mut doc, &meta::path(&[meta::RELAYS]), &json!(relay)).unwrap();
assert!(relays(&doc).is_empty()); // Not a list.
}
#[test]
fn renewal_interval() {
let day = Duration::from_secs(24 * 3600);
assert_eq!(alive_renewal(7 * day), day);
assert_eq!(alive_renewal(70 * day), day);
assert_eq!(alive_renewal(day), day / 7);
// The hourly floor only matters for windows shorter than the option allows.
let hour = Duration::from_secs(3600);
assert_eq!(alive_renewal(2 * hour), hour);
}
}
|