reth_trie_common/hash_builder/
state.rs1use crate::TrieMask;
2use alloc::vec::Vec;
3use alloy_trie::{hash_builder::HashBuilderValue, nodes::RlpNode, HashBuilder};
4use nybbles::Nibbles;
5
6#[derive(Debug, Clone, PartialEq, Eq, Default)]
9#[cfg_attr(any(test, feature = "serde"), derive(serde::Serialize, serde::Deserialize))]
10#[cfg_attr(feature = "arbitrary", derive(arbitrary::Arbitrary))]
11pub struct HashBuilderState {
12 pub key: Vec<u8>,
14 pub value: HashBuilderValue,
16 pub stack: Vec<RlpNode>,
18
19 pub groups: Vec<TrieMask>,
21 pub tree_masks: Vec<TrieMask>,
23 pub hash_masks: Vec<TrieMask>,
25
26 pub stored_in_database: bool,
28}
29
30impl From<HashBuilderState> for HashBuilder {
31 fn from(state: HashBuilderState) -> Self {
32 Self {
33 key: Nibbles::from_nibbles_unchecked(state.key),
34 stack: state.stack,
35 value: state.value,
36 state_masks: state.groups,
37 tree_masks: state.tree_masks,
38 hash_masks: state.hash_masks,
39 stored_in_database: state.stored_in_database,
40 updated_branch_nodes: None,
41 proof_retainer: None,
42 rlp_buf: Vec::with_capacity(32),
43 }
44 }
45}
46
47impl From<HashBuilder> for HashBuilderState {
48 fn from(state: HashBuilder) -> Self {
49 Self {
50 key: state.key.to_vec(),
51 stack: state.stack,
52 value: state.value,
53 groups: state.state_masks,
54 tree_masks: state.tree_masks,
55 hash_masks: state.hash_masks,
56 stored_in_database: state.stored_in_database,
57 }
58 }
59}
60
61#[cfg(any(test, feature = "reth-codec"))]
62impl reth_codecs::Compact for HashBuilderState {
63 fn to_compact<B>(&self, buf: &mut B) -> usize
64 where
65 B: bytes::BufMut + AsMut<[u8]>,
66 {
67 let mut len = 0;
68
69 let start = buf.remaining_mut();
71 self.key.to_compact(buf);
72 len += start - buf.remaining_mut();
73
74 buf.put_u16(self.stack.len() as u16);
75 len += 2;
76 for item in &self.stack {
77 buf.put_u16(item.len() as u16);
78 buf.put_slice(&item[..]);
79 len += 2 + item.len();
80 }
81
82 let start = buf.remaining_mut();
83 self.value.to_compact(buf);
84 len += start - buf.remaining_mut();
85
86 buf.put_u16(self.groups.len() as u16);
87 len += 2;
88 for item in &self.groups {
89 len += (*item).to_compact(buf);
90 }
91
92 buf.put_u16(self.tree_masks.len() as u16);
93 len += 2;
94 for item in &self.tree_masks {
95 len += (*item).to_compact(buf);
96 }
97
98 buf.put_u16(self.hash_masks.len() as u16);
99 len += 2;
100 for item in &self.hash_masks {
101 len += (*item).to_compact(buf);
102 }
103
104 buf.put_u8(self.stored_in_database as u8);
105 len += 1;
106 len
107 }
108
109 fn from_compact(buf: &[u8], _len: usize) -> (Self, &[u8]) {
110 use bytes::Buf;
111
112 let (key, mut buf) = Vec::from_compact(buf, 0);
113
114 let stack_len = buf.get_u16() as usize;
115 let mut stack = Vec::with_capacity(stack_len);
116 for _ in 0..stack_len {
117 let item_len = buf.get_u16() as usize;
118 stack.push(RlpNode::from_raw(&buf[..item_len]).unwrap());
119 buf.advance(item_len);
120 }
121
122 let (value, mut buf) = HashBuilderValue::from_compact(buf, 0);
123
124 let groups_len = buf.get_u16() as usize;
125 let mut groups = Vec::with_capacity(groups_len);
126 for _ in 0..groups_len {
127 let (item, rest) = TrieMask::from_compact(buf, 0);
128 groups.push(item);
129 buf = rest;
130 }
131
132 let tree_masks_len = buf.get_u16() as usize;
133 let mut tree_masks = Vec::with_capacity(tree_masks_len);
134 for _ in 0..tree_masks_len {
135 let (item, rest) = TrieMask::from_compact(buf, 0);
136 tree_masks.push(item);
137 buf = rest;
138 }
139
140 let hash_masks_len = buf.get_u16() as usize;
141 let mut hash_masks = Vec::with_capacity(hash_masks_len);
142 for _ in 0..hash_masks_len {
143 let (item, rest) = TrieMask::from_compact(buf, 0);
144 hash_masks.push(item);
145 buf = rest;
146 }
147
148 let stored_in_database = buf.get_u8() != 0;
149 (Self { key, stack, value, groups, tree_masks, hash_masks, stored_in_database }, buf)
150 }
151}
152
153#[cfg(test)]
154mod tests {
155 use super::*;
156 #[cfg(feature = "arbitrary")]
157 use proptest::{collection::vec, prelude::*};
158 use reth_codecs::Compact;
159
160 #[test]
161 fn hash_builder_state_regression() {
162 let mut state = HashBuilderState::default();
163 state.stack.push(Default::default());
164 let mut buf = vec![];
165 let len = state.clone().to_compact(&mut buf);
166 let (decoded, _) = HashBuilderState::from_compact(&buf, len);
167 assert_eq!(state, decoded);
168 }
169
170 #[test]
171 fn hash_builder_state_fixed_slice() {
172 let mut state = HashBuilderState { key: vec![1, 2, 3], ..Default::default() };
173 state.value.set_bytes_owned(vec![42; 128]);
174 let mut expected = vec![];
175 assert_eq!(state.to_compact(&mut expected), expected.len());
176
177 let mut storage = vec![0; expected.len() + 1];
178 let mut remaining = storage.as_mut_slice();
179 let len = state.to_compact(&mut remaining);
180 assert_eq!(len, expected.len());
181 assert_eq!(remaining.len(), 1);
182 assert_eq!(&storage[..len], expected);
183 let (decoded, rest) = HashBuilderState::from_compact(&storage[..len], len);
184 assert_eq!(decoded, state);
185 assert!(rest.is_empty());
186 }
187
188 #[cfg(feature = "arbitrary")]
191 proptest::proptest! {
192 #[test]
193 fn hash_builder_state_roundtrip(
194 key in vec(0u8..16, 0..=64),
195 value in any::<HashBuilderValue>(),
196 stack in vec(any::<RlpNode>(), 0..=64),
197 groups in vec(any::<TrieMask>(), 0..=64),
198 tree_masks in vec(any::<TrieMask>(), 0..=64),
199 hash_masks in vec(any::<TrieMask>(), 0..=64),
200 stored_in_database in any::<bool>(),
201 ) {
202 let state = HashBuilderState {
203 key, value, stack, groups, tree_masks, hash_masks, stored_in_database,
204 };
205 let mut buf = vec![];
206 let len = state.to_compact(&mut buf);
207 prop_assert_eq!(len, buf.len());
208 let (decoded, rest) = HashBuilderState::from_compact(&buf, len);
209 prop_assert_eq!(state, decoded);
210 prop_assert!(rest.is_empty());
211 }
212 }
213}