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
use linked_hash_map::LinkedHashMap;
use primitives::hash::H256;
pub const MAX_KNOWN_HASHES_LEN: usize = 2048;
#[derive(Debug, PartialEq, Clone, Copy)]
pub enum KnownHashType {
Transaction,
Block,
CompactBlock,
}
#[derive(Debug, Default)]
pub struct KnownHashFilter {
known_hashes: LinkedHashMap<H256, KnownHashType>,
}
impl KnownHashFilter {
pub fn insert(&mut self, hash: H256, hash_type: KnownHashType) {
if !self.known_hashes.contains_key(&hash) {
self.known_hashes.insert(hash, hash_type);
if self.known_hashes.len() > MAX_KNOWN_HASHES_LEN {
self.known_hashes.pop_front();
}
}
}
#[cfg(test)]
pub fn len(&self) -> usize {
self.known_hashes.len()
}
pub fn contains(&self, hash: &H256, hash_type: KnownHashType) -> bool {
self.known_hashes.get(hash)
.map(|stored_hash_type| *stored_hash_type == hash_type)
.unwrap_or(false)
}
pub fn filter_block(&self, hash: &H256) -> bool {
self.known_hashes.get(hash)
.map(|stored_hash_type| *stored_hash_type != KnownHashType::Block
&& *stored_hash_type != KnownHashType::CompactBlock)
.unwrap_or(true)
}
pub fn filter_transaction(&self, hash: &H256) -> bool {
self.known_hashes.get(hash)
.map(|stored_hash_type| *stored_hash_type != KnownHashType::Transaction)
.unwrap_or(true)
}
}
#[cfg(test)]
mod tests {
use primitives::hash::H256;
use super::{KnownHashFilter, KnownHashType, MAX_KNOWN_HASHES_LEN};
#[test]
fn known_hash_filter_empty() {
assert!(KnownHashFilter::default().filter_transaction(&H256::from(0)));
assert!(KnownHashFilter::default().filter_block(&H256::from(0)));
}
#[test]
fn known_hash_filter_block() {
let mut filter = KnownHashFilter::default();
filter.insert(H256::from(0), KnownHashType::Block);
filter.insert(H256::from(1), KnownHashType::CompactBlock);
filter.insert(H256::from(2), KnownHashType::Transaction);
assert!(!filter.filter_block(&H256::from(0)));
assert!(!filter.filter_block(&H256::from(1)));
assert!(filter.filter_block(&H256::from(2)));
assert!(filter.filter_block(&H256::from(3)));
}
#[test]
fn known_hash_filter_transaction() {
let mut filter = KnownHashFilter::default();
filter.insert(H256::from(0), KnownHashType::Block);
filter.insert(H256::from(1), KnownHashType::CompactBlock);
filter.insert(H256::from(2), KnownHashType::Transaction);
assert!(filter.filter_transaction(&H256::from(0)));
assert!(filter.filter_transaction(&H256::from(1)));
assert!(!filter.filter_transaction(&H256::from(2)));
assert!(filter.filter_transaction(&H256::from(3)));
}
#[test]
fn known_hash_filter_contains() {
let mut filter = KnownHashFilter::default();
filter.insert(H256::from(0), KnownHashType::Block);
filter.insert(H256::from(1), KnownHashType::CompactBlock);
filter.insert(H256::from(2), KnownHashType::Transaction);
assert!(filter.contains(&H256::from(0), KnownHashType::Block));
assert!(!filter.contains(&H256::from(0), KnownHashType::CompactBlock));
assert!(filter.contains(&H256::from(1), KnownHashType::CompactBlock));
assert!(!filter.contains(&H256::from(1), KnownHashType::Block));
assert!(filter.contains(&H256::from(2), KnownHashType::Transaction));
assert!(!filter.contains(&H256::from(2), KnownHashType::Block));
assert!(!filter.contains(&H256::from(3), KnownHashType::Block));
assert!(!filter.contains(&H256::from(3), KnownHashType::CompactBlock));
assert!(!filter.contains(&H256::from(3), KnownHashType::Transaction));
}
#[test]
fn known_hash_filter_insert() {
let mut hash_data = [0u8; 32];
let mut filter = KnownHashFilter::default();
assert_eq!(filter.len(), 0);
filter.insert(H256::from(hash_data.clone()), KnownHashType::Block);
assert_eq!(filter.len(), 1);
filter.insert(H256::from(hash_data.clone()), KnownHashType::Block);
assert_eq!(filter.len(), 1);
for i in 1..MAX_KNOWN_HASHES_LEN {
hash_data[0] = (i % 255) as u8;
hash_data[1] = ((i / 255) % 255) as u8;
filter.insert(H256::from(hash_data.clone()), KnownHashType::Block);
assert_eq!(filter.len(), i + 1);
}
hash_data[0] = ((MAX_KNOWN_HASHES_LEN + 1) % 255) as u8;
hash_data[1] = (((MAX_KNOWN_HASHES_LEN + 1) / 255) % 255) as u8;
filter.insert(H256::from(hash_data.clone()), KnownHashType::Block);
assert_eq!(filter.len(), MAX_KNOWN_HASHES_LEN);
hash_data[0] = 0; hash_data[1] = 0;
assert!(!filter.contains(&H256::from(hash_data.clone()), KnownHashType::Block));
hash_data[0] = 1; hash_data[1] = 0;
assert!(filter.contains(&H256::from(hash_data.clone()), KnownHashType::Block));
}
}