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
use crate::{
header::Header,
transaction::UnverifiedTransaction,
};
use bytes::Bytes;
use tetsy_util_mem::MallocSizeOf;
#[derive(Debug, Clone)]
pub struct VerificationQueueInfo {
pub unverified_queue_size: usize,
pub verified_queue_size: usize,
pub verifying_queue_size: usize,
pub max_queue_size: usize,
pub max_mem_use: usize,
pub mem_used: usize,
}
impl VerificationQueueInfo {
pub fn total_queue_size(&self) -> usize { self.unverified_queue_size + self.verified_queue_size + self.verifying_queue_size }
pub fn is_full(&self) -> bool {
self.unverified_queue_size + self.verified_queue_size + self.verifying_queue_size > self.max_queue_size ||
self.mem_used > self.max_mem_use
}
pub fn is_empty(&self) -> bool {
self.unverified_queue_size + self.verified_queue_size + self.verifying_queue_size == 0
}
}
#[derive(Clone, PartialEq, Debug, MallocSizeOf)]
pub struct Unverified {
pub header: Header,
pub transactions: Vec<UnverifiedTransaction>,
pub uncles: Vec<Header>,
pub bytes: Bytes,
}
impl Unverified {
pub fn from_rlp(bytes: Bytes) -> Result<Self, tetsy_rlp::DecoderError> {
use tetsy_rlp::Rlp;
let (header, transactions, uncles) = {
let rlp = Rlp::new(&bytes);
let header = rlp.val_at(0)?;
let transactions = rlp.list_at(1)?;
let uncles = rlp.list_at(2)?;
(header, transactions, uncles)
};
Ok(Unverified {
header,
transactions,
uncles,
bytes,
})
}
}