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
use crate::{Id, Node, Policy, PolicyReport};
use std::collections::{BTreeSet, HashMap, HashSet};
#[derive(Default, Debug)]
pub struct Nodes {
all: HashMap<Id, Node>,
quarantined: HashSet<Id>,
not_reachable: BTreeSet<Id>,
available: BTreeSet<Id>,
}
pub enum Entry<'a> {
Vacant(VacantEntry<'a>),
Occupied(OccupiedEntry<'a>),
}
pub struct VacantEntry<'a> {
nodes: &'a mut Nodes,
id: Id,
}
pub struct OccupiedEntry<'a> {
id: Id,
nodes: &'a mut Nodes,
}
impl Nodes {
pub(crate) fn get<'a>(&'a self, id: &Id) -> Option<&'a Node> {
self.all.get(id)
}
pub(crate) fn get_mut<'a>(&'a mut self, id: &Id) -> Option<&'a mut Node> {
self.all.get_mut(id)
}
pub fn entry(&mut self, public_id: Id) -> Entry<'_> {
if self.all.contains_key(&public_id) {
Entry::Occupied(OccupiedEntry::new(self, public_id))
} else {
Entry::Vacant(VacantEntry::new(self, public_id))
}
}
pub fn available_nodes(&self) -> &BTreeSet<Id> {
&self.available
}
pub fn unreachable_nodes(&self) -> &BTreeSet<Id> {
&self.not_reachable
}
pub fn quarantined_nodes(&self) -> &HashSet<Id> {
&self.quarantined
}
fn insert(&mut self, node: Node) -> Option<Node> {
let id = *node.id();
if node.address().is_some() {
self.available.insert(id);
} else {
self.not_reachable.insert(id);
}
self.all.insert(id, node.clone())
}
}
impl<'a> VacantEntry<'a> {
fn new(nodes: &'a mut Nodes, id: Id) -> Self {
VacantEntry { nodes, id }
}
pub(crate) fn insert(&mut self, default: Node) {
debug_assert_eq!(self.key(), default.id());
assert!(self.nodes.insert(default).is_none());
}
fn key(&self) -> &Id {
&self.id
}
}
impl<'a> OccupiedEntry<'a> {
fn new(nodes: &'a mut Nodes, id: Id) -> Self {
OccupiedEntry { nodes, id }
}
fn key(&self) -> &Id {
&self.id
}
pub(crate) fn modify<P, F>(&mut self, policy: &mut P, f: F) -> PolicyReport
where
F: FnOnce(&mut Node),
P: Policy,
{
let node = self.nodes.all.get_mut(&self.id).unwrap();
let was_reachable = node.address().is_some();
f(node);
let report = policy.check(node);
match report {
PolicyReport::None => {
let now_reachable = node.address().is_some();
if was_reachable && !now_reachable {
if self.nodes.available.remove(&self.id) {
self.nodes.not_reachable.insert(self.id);
}
} else if !was_reachable
&& now_reachable
&& self.nodes.not_reachable.remove(&self.id)
{
self.nodes.available.insert(self.id);
}
}
PolicyReport::Forget => {
self.nodes.available.remove(&self.id);
self.nodes.not_reachable.remove(&self.id);
self.nodes.quarantined.remove(&self.id);
self.nodes.all.remove(&self.id);
}
PolicyReport::Quarantine => {
self.nodes.available.remove(&self.id);
self.nodes.not_reachable.remove(&self.id);
self.nodes.quarantined.insert(self.id);
node.logs_mut().quarantine();
}
PolicyReport::LiftQuarantine => {
if node.address().is_some() {
self.nodes.available.insert(self.id);
} else {
self.nodes.not_reachable.insert(self.id);
}
self.nodes.quarantined.remove(&self.id);
node.logs_mut().lift_quarantine();
}
}
report
}
}
impl<'a> Entry<'a> {
pub fn or_insert(self, default: Node) {
match self {
Entry::Vacant(mut node_entry) => node_entry.insert(default),
Entry::Occupied(_node_entry) => {}
}
}
pub fn or_insert_with<F>(self, default: F)
where
F: FnOnce() -> Node,
{
match self {
Entry::Vacant(mut node_entry) => node_entry.insert(default()),
Entry::Occupied(_node_entry) => {}
}
}
pub fn key(&self) -> &Id {
match self {
Entry::Vacant(node_entry) => node_entry.key(),
Entry::Occupied(node_entry) => node_entry.key(),
}
}
pub fn and_modify<P, F>(self, policy: &mut P, f: F) -> Option<PolicyReport>
where
F: FnOnce(&mut Node),
P: Policy,
{
match self {
Entry::Occupied(mut node_entry) => Some(node_entry.modify(policy, f)),
Entry::Vacant(_) => None,
}
}
}