-
Notifications
You must be signed in to change notification settings - Fork 212
Expand file tree
/
Copy pathlibmdbx.rs
More file actions
225 lines (180 loc) · 8.06 KB
/
Copy pathlibmdbx.rs
File metadata and controls
225 lines (180 loc) · 8.06 KB
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
use ethrex_trie::{error::TrieError, NodeHash};
use libmdbx::orm::{Database, Table};
use std::{marker::PhantomData, sync::Arc};
/// Libmdbx implementation for the TrieDB trait, with get and put operations.
pub struct LibmdbxTrieDB<T: Table> {
db: Arc<Database>,
phantom: PhantomData<T>,
}
use ethrex_trie::TrieDB;
impl<T> LibmdbxTrieDB<T>
where
T: Table<Key = NodeHash, Value = Vec<u8>>,
{
pub fn new(db: Arc<Database>) -> Self {
Self {
db,
phantom: PhantomData,
}
}
}
impl<T> TrieDB for LibmdbxTrieDB<T>
where
T: Table<Key = NodeHash, Value = Vec<u8>>,
{
fn get(&self, key: NodeHash) -> Result<Option<Vec<u8>>, TrieError> {
let txn = self.db.begin_read().map_err(TrieError::DbError)?;
txn.get::<T>(key).map_err(TrieError::DbError)
}
fn put(&self, key: NodeHash, value: Vec<u8>) -> Result<(), TrieError> {
let txn = self.db.begin_readwrite().map_err(TrieError::DbError)?;
txn.upsert::<T>(key, value).map_err(TrieError::DbError)?;
txn.commit().map_err(TrieError::DbError)
}
fn put_batch(&self, key_values: Vec<(NodeHash, Vec<u8>)>) -> Result<(), TrieError> {
let txn = self.db.begin_readwrite().map_err(TrieError::DbError)?;
for (key, value) in key_values {
txn.upsert::<T>(key, value).map_err(TrieError::DbError)?;
}
txn.commit().map_err(TrieError::DbError)
}
}
#[cfg(test)]
mod test {
use super::LibmdbxTrieDB;
use crate::trie_db::test_utils::libmdbx::{new_db, TestNodes};
use ethrex_trie::NodeHash;
use ethrex_trie::Trie;
use ethrex_trie::TrieDB;
use libmdbx::{
orm::{table, Database},
table_info,
};
use std::sync::Arc;
use tempdir::TempDir;
#[test]
fn simple_addition() {
table!(
/// NodeHash to Node table
( Nodes ) NodeHash => Vec<u8>
);
let inner_db = new_db::<Nodes>();
let key = NodeHash::from_encoded_raw(b"hello");
let db = LibmdbxTrieDB::<Nodes>::new(inner_db);
assert_eq!(db.get(key).unwrap(), None);
db.put(key, "value".into()).unwrap();
assert_eq!(db.get(key).unwrap(), Some("value".into()));
}
#[test]
fn different_tables() {
table!(
/// vec to vec
( TableA ) NodeHash => Vec<u8>
);
table!(
/// vec to vec
( TableB ) NodeHash => Vec<u8>
);
let tables = [table_info!(TableA), table_info!(TableB)]
.into_iter()
.collect();
let inner_db = Arc::new(Database::create(None, &tables).unwrap());
let db_a = LibmdbxTrieDB::<TableA>::new(inner_db.clone());
let db_b = LibmdbxTrieDB::<TableB>::new(inner_db.clone());
let key = NodeHash::from_encoded_raw(b"hello");
db_a.put(key, "value".into()).unwrap();
assert_eq!(db_b.get(key).unwrap(), None);
}
#[test]
fn get_old_state() {
let db = new_db::<TestNodes>();
let mut trie = Trie::new(Box::new(LibmdbxTrieDB::<TestNodes>::new(db.clone())));
trie.insert([0; 32].to_vec(), [0; 32].to_vec()).unwrap();
trie.insert([1; 32].to_vec(), [1; 32].to_vec()).unwrap();
let root = trie.hash().unwrap();
trie.insert([0; 32].to_vec(), [2; 32].to_vec()).unwrap();
trie.insert([1; 32].to_vec(), [3; 32].to_vec()).unwrap();
assert_eq!(trie.get(&[0; 32].to_vec()).unwrap(), Some([2; 32].to_vec()));
assert_eq!(trie.get(&[1; 32].to_vec()).unwrap(), Some([3; 32].to_vec()));
let trie = Trie::open(Box::new(LibmdbxTrieDB::<TestNodes>::new(db.clone())), root);
assert_eq!(trie.get(&[0; 32].to_vec()).unwrap(), Some([0; 32].to_vec()));
assert_eq!(trie.get(&[1; 32].to_vec()).unwrap(), Some([1; 32].to_vec()));
}
#[test]
fn get_old_state_with_removals() {
let db = new_db::<TestNodes>();
let mut trie = Trie::new(Box::new(LibmdbxTrieDB::<TestNodes>::new(db.clone())));
trie.insert([0; 32].to_vec(), [0; 32].to_vec()).unwrap();
trie.insert([1; 32].to_vec(), [1; 32].to_vec()).unwrap();
trie.insert([2; 32].to_vec(), [2; 32].to_vec()).unwrap();
let root = trie.hash().unwrap();
trie.insert([0; 32].to_vec(), vec![0x04]).unwrap();
trie.remove([1; 32].to_vec()).unwrap();
trie.insert([2; 32].to_vec(), vec![0x05]).unwrap();
trie.remove([0; 32].to_vec()).unwrap();
assert_eq!(trie.get(&[0; 32].to_vec()).unwrap(), None);
assert_eq!(trie.get(&[1; 32].to_vec()).unwrap(), None);
assert_eq!(trie.get(&[2; 32].to_vec()).unwrap(), Some(vec![0x05]));
let trie = Trie::open(Box::new(LibmdbxTrieDB::<TestNodes>::new(db.clone())), root);
assert_eq!(trie.get(&[0; 32].to_vec()).unwrap(), Some([0; 32].to_vec()));
assert_eq!(trie.get(&[1; 32].to_vec()).unwrap(), Some([1; 32].to_vec()));
assert_eq!(trie.get(&[2; 32].to_vec()).unwrap(), Some([2; 32].to_vec()));
}
#[test]
fn revert() {
let db = new_db::<TestNodes>();
let mut trie = Trie::new(Box::new(LibmdbxTrieDB::<TestNodes>::new(db.clone())));
trie.insert([0; 32].to_vec(), [0; 32].to_vec()).unwrap();
trie.insert([1; 32].to_vec(), [1; 32].to_vec()).unwrap();
let root = trie.hash().unwrap();
trie.insert([0; 32].to_vec(), [2; 32].to_vec()).unwrap();
trie.insert([1; 32].to_vec(), [3; 32].to_vec()).unwrap();
let mut trie = Trie::open(Box::new(LibmdbxTrieDB::<TestNodes>::new(db.clone())), root);
trie.insert([2; 32].to_vec(), [4; 32].to_vec()).unwrap();
assert_eq!(trie.get(&[0; 32].to_vec()).unwrap(), Some([0; 32].to_vec()));
assert_eq!(trie.get(&[1; 32].to_vec()).unwrap(), Some([1; 32].to_vec()));
assert_eq!(trie.get(&[2; 32].to_vec()).unwrap(), Some([4; 32].to_vec()));
}
#[test]
fn revert_with_removals() {
let db = new_db::<TestNodes>();
let mut trie = Trie::new(Box::new(LibmdbxTrieDB::<TestNodes>::new(db.clone())));
trie.insert([0; 32].to_vec(), [0; 32].to_vec()).unwrap();
trie.insert([1; 32].to_vec(), [1; 32].to_vec()).unwrap();
trie.insert([2; 32].to_vec(), [2; 32].to_vec()).unwrap();
let root = trie.hash().unwrap();
trie.insert([0; 32].to_vec(), [4; 32].to_vec()).unwrap();
trie.remove([1; 32].to_vec()).unwrap();
trie.insert([2; 32].to_vec(), [5; 32].to_vec()).unwrap();
trie.remove([0; 32].to_vec()).unwrap();
let mut trie = Trie::open(Box::new(LibmdbxTrieDB::<TestNodes>::new(db.clone())), root);
trie.remove([2; 32].to_vec()).unwrap();
assert_eq!(trie.get(&[0; 32].to_vec()).unwrap(), Some([0; 32].to_vec()));
assert_eq!(trie.get(&[1; 32].to_vec()).unwrap(), Some([1; 32].to_vec()));
assert_eq!(trie.get(&vec![0x02]).unwrap(), None);
}
#[test]
fn resume_trie() {
use crate::trie_db::test_utils::libmdbx::{new_db_with_path, open_db};
const TRIE_DIR: &str = "trie-db-resume-trie-test";
let trie_dir = TempDir::new(TRIE_DIR).expect("Failed to create temp dir");
let trie_dir = trie_dir.path();
// Create new trie from clean DB
let db = new_db_with_path::<TestNodes>(trie_dir.into());
let mut trie = Trie::new(Box::new(LibmdbxTrieDB::<TestNodes>::new(db.clone())));
trie.insert([0; 32].to_vec(), [1; 32].to_vec()).unwrap();
trie.insert([1; 32].to_vec(), [2; 32].to_vec()).unwrap();
trie.insert([2; 32].to_vec(), [4; 32].to_vec()).unwrap();
// Save current root
let root = trie.hash().unwrap();
// Release DB
drop(db);
drop(trie);
let db2 = open_db::<TestNodes>(trie_dir.to_str().unwrap());
// Create a new trie based on the previous trie's DB
let trie = Trie::open(Box::new(LibmdbxTrieDB::<TestNodes>::new(db2)), root);
assert_eq!(trie.get(&[0; 32].to_vec()).unwrap(), Some([1; 32].to_vec()));
assert_eq!(trie.get(&[1; 32].to_vec()).unwrap(), Some([2; 32].to_vec()));
assert_eq!(trie.get(&[2; 32].to_vec()).unwrap(), Some([4; 32].to_vec()));
}
}