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
crate::ix!();
//-------------------------------------------[.cpp/bitcoin/src/addrman_impl.h]
pub struct AddrManImpl {
/**
| A mutex to protect the inner data structures.
|
*/
pub cs: Mutex<AddrManInner>,
/**
| secret key to randomize bucket select
| with
|
*/
pub n_key: u256,
/**
| Holds addrs inserted into tried table that
| collide with existing
| entries. Test-before-evict discipline used
| to resolve these collisions.
*/
pub tried_collisions: HashSet<i32>,
/**
| Perform consistency checks every
| m_consistency_check_ratio operations (if
| non-zero).
|
*/
pub consistency_check_ratio: i32,
/**
| Compressed IP->ASN mapping, loaded from
| a file when a node starts.
|
| Should be always empty if no file was
| provided.
|
| This mapping is then used for bucketing
| nodes in Addrman.
|
| If asmap is provided, nodes will be
| bucketed by AS they belong to, in order to
| make impossible for a node to connect to
| several nodes hosted in a single AS.
|
| This is done in response to Erebus attack,
| but also to generally diversify the
| connections every node creates, especially
| useful when a large fraction of nodes
| operate under a couple of cloud providers.
|
| If a new asmap was provided, the existing
| records would be re-bucketed accordingly.
*/
pub asmap: Vec<bool>,
}
impl Drop for AddrManImpl {
fn drop(&mut self) {
self.n_key.blob.set_null();
}
}
impl AddrManImpl {
pub fn new(
asmap: Vec<bool>,
deterministic: bool,
consistency_check_ratio: i32) -> Self {
let mut insecure_rand
= FastRandomContext::new(deterministic);
let n_key: u256 = match deterministic {
true => u256::from(1),
false => insecure_rand.rand256(),
};
Self {
cs: Mutex::new(AddrManInner::new(deterministic, insecure_rand)),
n_key: n_key,
tried_collisions: HashSet::<i32>::default(),
consistency_check_ratio: consistency_check_ratio,
asmap: asmap,
}
}
#[EXCLUSIVE_LOCKS_REQUIRED(!cs)]
pub fn len(&self) -> usize {
let inner = self.cs.lock();
// TODO: Cache this in an atomic to avoid
// this overhead
let result = inner.random.borrow().len();
result
}
#[EXCLUSIVE_LOCKS_REQUIRED(!cs)]
pub fn add(&mut self,
addrs: &Vec<Address>,
source: &NetAddr,
n_time_penalty: i64) -> bool {
let mut inner = self.cs.lock();
let mut n_add: i32 = 0;
inner.check(self.consistency_check_ratio, &self.n_key, &self.asmap);
for addr in addrs.iter() {
n_add += match inner.add(
addr,
source,
&self.n_key,
&self.asmap,
n_time_penalty) {
true => 1,
false => 0,
};
}
inner.check(self.consistency_check_ratio, &self.n_key, &self.asmap);
if n_add != 0 {
log_print!(
BCLog::ADDRMAN,
format!{
"Added {} addresses from {}: {} tried, {} new\n",
n_add,
source.ToString(),
n_tried,
n_new
}
);
}
return n_add > 0;
panic!("could not get lock");
}
#[EXCLUSIVE_LOCKS_REQUIRED(!cs)]
pub fn good(&mut self,
addr: &Service,
n_time: i64) {
let test_before_evict = true;
let mut inner = self.cs.lock();
inner.check(self.consistency_check_ratio, &self.n_key, &self.asmap);
unsafe {
inner.good(addr, test_before_evict, n_time, &self.n_key, &self.asmap, &mut self.tried_collisions);
}
inner.check(self.consistency_check_ratio, &self.n_key, &self.asmap);
}
#[EXCLUSIVE_LOCKS_REQUIRED(!cs)]
pub fn attempt(&mut self,
addr: &Service,
count_failure: bool,
n_time: i64) {
let mut inner = self.cs.lock();
inner.check(self.consistency_check_ratio, &self.n_key, &self.asmap);
inner.attempt(addr, count_failure, n_time);
inner.check(self.consistency_check_ratio, &self.n_key, &self.asmap);
}
#[EXCLUSIVE_LOCKS_REQUIRED(!cs)]
pub fn resolve_collisions(&mut self) {
let mut inner = self.cs.lock();
inner.check(self.consistency_check_ratio, &self.n_key, &self.asmap);
//I think this is probably unsafe because
//we iterate over the set, removing
//certain items which don't match
//a criteria, but then we try to mutably
//borrow this same set within the removal
//procedure, updating and possibly
//inserting items with good. in any case,
//this routine (and the routine "good")
//needs to be checked for bugs
unsafe {
inner.resolve_collisions(&self.n_key, &self.asmap, &mut self.tried_collisions);
}
inner.check(self.consistency_check_ratio, &self.n_key, &self.asmap);
}
#[EXCLUSIVE_LOCKS_REQUIRED(!cs)]
pub fn select_tried_collision(&mut self) -> (Address,i64) {
let mut inner = self.cs.lock();
inner.check(self.consistency_check_ratio, &self.n_key, &self.asmap);
let ret = inner.select_tried_collision(&self.n_key, &self.asmap, &mut self.tried_collisions);
inner.check(self.consistency_check_ratio, &self.n_key, &self.asmap);
ret
}
#[EXCLUSIVE_LOCKS_REQUIRED(cs)]
pub fn select(&self, new_only: bool) -> (Address,i64) {
let inner = self.cs.lock();
inner.check(self.consistency_check_ratio, &self.n_key, &self.asmap);
let addr_ret = inner.select(new_only);
inner.check(self.consistency_check_ratio, &self.n_key, &self.asmap);
addr_ret
}
#[EXCLUSIVE_LOCKS_REQUIRED(!cs)]
pub fn get_addr(&self,
max_addresses: usize,
max_pct: usize,
network: Option<Network>) -> Vec<Address> {
let inner = self.cs.lock();
inner.check(self.consistency_check_ratio, &self.n_key, &self.asmap);
let addresses = inner.get_addr(max_addresses,max_pct,network);
inner.check(self.consistency_check_ratio, &self.n_key, &self.asmap);
addresses
}
#[EXCLUSIVE_LOCKS_REQUIRED(!cs)]
pub fn connected(&mut self,
addr: &Service,
n_time: i64) {
let mut inner = self.cs.lock();
inner.check(self.consistency_check_ratio, &self.n_key, &self.asmap);
inner.connected(addr, n_time);
inner.check(self.consistency_check_ratio, &self.n_key, &self.asmap);
}
#[EXCLUSIVE_LOCKS_REQUIRED(!cs)]
pub fn set_services(&mut self,
addr: &Service,
n_services: ServiceFlags) {
let mut inner = self.cs.lock();
inner.check(self.consistency_check_ratio, &self.n_key, &self.asmap);
inner.set_services(addr, n_services);
inner.check(self.consistency_check_ratio, &self.n_key, &self.asmap);
}
pub fn get_asmap(&self) -> &Vec<bool> {
&self.asmap
}
}