/
pool.rs
733 lines (647 loc) · 25.6 KB
/
pool.rs
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
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
use crate::{
blockcfg::{ApplyBlockLedger, LedgerParameters},
blockchain::{Ref, Tip},
fragment::{
selection::{
FragmentSelectionAlgorithm, FragmentSelectionAlgorithmParams, FragmentSelectionResult,
OldestFirst,
},
Fragment, FragmentId, Logs,
},
intercom::{NetworkMsg, PropagateMsg},
metrics::{Metrics, MetricsBackend},
utils::async_msg::MessageBox,
};
use chain_core::property::Fragment as _;
use chain_impl_mockchain::{block::BlockDate, fragment::Contents, transaction::Transaction};
use futures::channel::mpsc::SendError;
use futures::sink::SinkExt;
use jormungandr_lib::{
interfaces::{
BlockDate as BlockDateDto, FragmentLog, FragmentOrigin, FragmentRejectionReason,
FragmentStatus, FragmentsProcessingSummary, PersistentFragmentLog, RejectedFragmentInfo,
},
time::SecondsSinceUnixEpoch,
};
use thiserror::Error;
use std::mem;
use tokio::fs::File;
use tokio::io::{AsyncWriteExt, BufWriter};
// It's a pretty big buffer, but common cloud based storage solutions (like EBS or GlusterFS) benefits from
// this and it's currently flushed after every request, so the possibility of losing fragments due to a crash
// should be minimal.
// Its main purpose is to avoid unnecessary flushing while processing a single batch of fragments.
const DEFAULT_BUF_SIZE: usize = 128 * 1024; // 128 KiB
pub struct Pool {
logs: Logs,
pool: internal::Pool,
network_msg_box: MessageBox<NetworkMsg>,
persistent_log: Option<BufWriter<File>>,
tip: Tip,
metrics: Metrics,
}
#[derive(Debug, Error)]
pub enum Error {
#[error("cannot propagate a fragment to the network")]
CannotPropagate(#[source] SendError),
}
impl Pool {
pub fn new(
max_entries: usize,
logs: Logs,
network_msg_box: MessageBox<NetworkMsg>,
persistent_log: Option<File>,
tip: Tip,
metrics: Metrics,
) -> Self {
Pool {
logs,
pool: internal::Pool::new(max_entries),
network_msg_box,
persistent_log: persistent_log
.map(|file| BufWriter::with_capacity(DEFAULT_BUF_SIZE, file)),
tip,
metrics,
}
}
pub fn logs(&mut self) -> &mut Logs {
&mut self.logs
}
/// Sets the persistent log to a file.
/// The file must be opened for writing.
pub fn set_persistent_log(&mut self, file: File) {
self.persistent_log = Some(BufWriter::with_capacity(DEFAULT_BUF_SIZE, file));
}
/// Synchronizes the persistent log file contents and metadata
/// to the file system and closes the file.
pub async fn close_persistent_log(&mut self) {
if let Some(mut persistent_log) = mem::replace(&mut self.persistent_log, None) {
if let Err(error) = persistent_log.flush().await {
tracing::error!(%error, "failed to flush persistent log");
}
if let Err(error) = persistent_log.into_inner().sync_all().await {
tracing::error!(%error, "failed to sync persistent log file");
}
}
}
/// Returns number of registered fragments. Setting `fail_fast` to `true` will force this
/// method to reject all fragments after the first invalid fragments was met.
pub async fn insert_and_propagate_all(
&mut self,
origin: FragmentOrigin,
fragments: Vec<Fragment>,
fail_fast: bool,
) -> Result<FragmentsProcessingSummary, Error> {
tracing::debug!(origin = ?origin, "received {} fragments", fragments.len());
use bincode::Options;
let mut filtered_fragments = Vec::new();
let mut rejected = Vec::new();
let mut fragments = fragments.into_iter();
let tip = self.tip.get_ref().await;
let ledger = tip.ledger();
let ledger_settings = ledger.settings();
let block_date = get_current_block_date(&tip);
for fragment in fragments.by_ref() {
let id = fragment.id();
let span = tracing::debug_span!("pool_filter_fragment", %id);
let _enter = span.enter();
if self.logs.exists(id) {
rejected.push(RejectedFragmentInfo {
id,
reason: FragmentRejectionReason::FragmentAlreadyInLog,
});
tracing::debug!("fragment is already logged");
continue;
}
if let Some(valid_until) = get_transaction_expiry_date(&fragment) {
use chain_impl_mockchain::ledger::check::{valid_transaction_date, TxVerifyError};
match valid_transaction_date(ledger_settings, valid_until, block_date) {
Ok(_) => {}
Err(TxVerifyError::TransactionExpired) => {
rejected.push(RejectedFragmentInfo {
id,
reason: FragmentRejectionReason::FragmentExpired,
});
tracing::debug!("fragment is expired at the time of receiving");
continue;
}
Err(TxVerifyError::TransactionValidForTooLong) => {
rejected.push(RejectedFragmentInfo {
id,
reason: FragmentRejectionReason::FragmentValidForTooLong,
});
tracing::debug!("fragment is valid for too long");
continue;
}
Err(_) => unreachable!(),
}
}
if !is_fragment_valid(&fragment) {
rejected.push(RejectedFragmentInfo {
id,
reason: FragmentRejectionReason::FragmentInvalid,
});
tracing::debug!("fragment is invalid, not including to the pool");
if fail_fast {
tracing::debug!("fail_fast is enabled; rejecting all downstream fragments");
break;
}
continue;
}
if let Some(persistent_log) = self.persistent_log.as_mut() {
let entry = PersistentFragmentLog {
time: SecondsSinceUnixEpoch::now(),
fragment: fragment.clone(),
};
// this must be sufficient: the PersistentFragmentLog format is using byte array
// for serialization so we do not expect any problems during deserialization
let codec = bincode::DefaultOptions::new().with_fixint_encoding();
let serialized = codec.serialize(&entry).unwrap();
if let Err(err) = persistent_log.write_all(&serialized).await {
tracing::error!(err = %err, "failed to write persistent fragment log entry");
}
}
tracing::debug!("including fragment to the pool");
filtered_fragments.push(fragment);
}
// flush every request to minimize possibility of losing fragments at the expense of non optimal performance
if let Some(persistent_log) = self.persistent_log.as_mut() {
if let Err(error) = persistent_log.flush().await {
tracing::error!(%error, "failed to flush persistent logs");
}
}
if fail_fast {
for fragment in fragments {
let id = fragment.id();
tracing::error!(
fragment_id=%id, "rejected due to fail_fast and one of previous fragments being invalid"
);
rejected.push(RejectedFragmentInfo {
id,
reason: FragmentRejectionReason::PreviousFragmentInvalid,
})
}
}
let span = tracing::trace_span!("pool_insert_fragment");
let _enter = span.enter();
let mut fragments = filtered_fragments.into_iter();
let new_fragments = self.pool.insert_all(fragments.by_ref());
let count = new_fragments.len();
tracing::debug!("{} of the received fragments were added to the pool", count);
let fragment_logs: Vec<_> = new_fragments
.iter()
.map(move |fragment| FragmentLog::new(fragment.id(), origin))
.collect();
self.logs.insert_all_pending(fragment_logs);
self.update_metrics();
let mut accepted = Vec::new();
let mut network_msg_box = self.network_msg_box.clone();
for fragment in new_fragments {
let id = fragment.id();
tracing::debug!(fragment_id=?id, "inserted fragment to the pool");
accepted.push(id);
let fragment_msg = NetworkMsg::Propagate(PropagateMsg::Fragment(fragment));
network_msg_box
.send(fragment_msg)
.await
.map_err(Error::CannotPropagate)?;
}
for fragment in fragments {
let id = fragment.id();
tracing::debug!(fragment_id=?id, "rejecting fragment due to pool overflow");
rejected.push(RejectedFragmentInfo {
id,
reason: FragmentRejectionReason::PoolOverflow,
});
}
Ok(FragmentsProcessingSummary { accepted, rejected })
}
pub fn remove_added_to_block(&mut self, fragment_ids: Vec<FragmentId>, status: FragmentStatus) {
let date = if let FragmentStatus::InABlock { date, .. } = status {
date
} else {
panic!("expected status to be in block, found {:?}", status);
};
self.pool.remove_all(fragment_ids.iter());
self.logs.modify_all(fragment_ids, status, date);
self.update_metrics();
}
pub async fn select(
&mut self,
ledger: ApplyBlockLedger,
ledger_params: LedgerParameters,
selection_alg: FragmentSelectionAlgorithmParams,
soft_deadline_future: futures::channel::oneshot::Receiver<()>,
hard_deadline_future: futures::channel::oneshot::Receiver<()>,
) -> (Contents, ApplyBlockLedger) {
let Pool { logs, pool, .. } = self;
let FragmentSelectionResult {
contents,
ledger,
rejected_fragments_cnt,
} = match selection_alg {
FragmentSelectionAlgorithmParams::OldestFirst => {
let mut selection_alg = OldestFirst::new();
selection_alg
.select(
ledger,
&ledger_params,
logs,
pool,
soft_deadline_future,
hard_deadline_future,
)
.await
}
};
self.metrics.add_tx_rejected_cnt(rejected_fragments_cnt);
self.update_metrics();
(contents, ledger)
}
// Remove from logs fragments that were confirmed (or rejected) in a branch
pub fn prune_after_ledger_branch(&mut self, branch_date: BlockDateDto) {
self.logs.remove_logs_after_date(branch_date);
self.update_metrics();
}
pub async fn remove_expired_txs(&mut self) {
let tip = self.tip.get_ref().await;
let block_date = get_current_block_date(&tip);
let fragment_ids = self.pool.remove_expired_txs(block_date);
self.logs.modify_all(
fragment_ids,
FragmentStatus::Rejected {
reason: "fragment expired".to_string(),
},
block_date.into(),
);
self.update_metrics();
}
fn update_metrics(&self) {
self.metrics.set_tx_pending_cnt(self.pool.len())
}
}
fn get_current_block_date(tip: &Ref) -> BlockDate {
let time = std::time::SystemTime::now();
let era = tip.epoch_leadership_schedule().era();
let epoch_position = tip
.time_frame()
.slot_at(&time)
.and_then(|slot| era.from_slot_to_era(slot))
.expect("the current time and blockchain state should produce a valid blockchain date");
let block_date: BlockDate = epoch_position.into();
BlockDate {
slot_id: block_date.slot_id + 1,
..block_date
}
}
fn is_fragment_valid(fragment: &Fragment) -> bool {
match fragment {
// never valid in the pool, only acceptable in genesis
Fragment::Initial(_) => false,
Fragment::OldUtxoDeclaration(_) => false,
// general transactions stuff
Fragment::Transaction(ref tx) => is_transaction_valid(tx),
Fragment::StakeDelegation(ref tx) => is_transaction_valid(tx),
Fragment::OwnerStakeDelegation(ref tx) => is_transaction_valid(tx),
Fragment::PoolRegistration(ref tx) => is_transaction_valid(tx),
Fragment::PoolRetirement(ref tx) => is_transaction_valid(tx),
Fragment::PoolUpdate(ref tx) => is_transaction_valid(tx),
// vote stuff
Fragment::UpdateProposal(_) => false, // TODO: enable when ready
Fragment::UpdateVote(_) => false, // TODO: enable when ready
Fragment::VotePlan(ref tx) => is_transaction_valid(tx),
Fragment::VoteCast(ref tx) => is_transaction_valid(tx),
Fragment::VoteTally(ref tx) => is_transaction_valid(tx),
Fragment::EncryptedVoteTally(ref tx) => is_transaction_valid(tx),
}
}
fn is_transaction_valid<E>(tx: &Transaction<E>) -> bool {
tx.verify_possibly_balanced().is_ok()
}
fn get_transaction_expiry_date(fragment: &Fragment) -> Option<BlockDate> {
match fragment {
Fragment::Initial(_) => None,
Fragment::OldUtxoDeclaration(_) => None,
Fragment::Transaction(tx) => Some(tx.as_slice().valid_until()),
Fragment::OwnerStakeDelegation(tx) => Some(tx.as_slice().valid_until()),
Fragment::StakeDelegation(tx) => Some(tx.as_slice().valid_until()),
Fragment::PoolRegistration(tx) => Some(tx.as_slice().valid_until()),
Fragment::PoolRetirement(tx) => Some(tx.as_slice().valid_until()),
Fragment::PoolUpdate(tx) => Some(tx.as_slice().valid_until()),
Fragment::UpdateProposal(_) => None,
Fragment::UpdateVote(_) => None,
Fragment::VotePlan(tx) => Some(tx.as_slice().valid_until()),
Fragment::VoteCast(tx) => Some(tx.as_slice().valid_until()),
Fragment::VoteTally(tx) => Some(tx.as_slice().valid_until()),
Fragment::EncryptedVoteTally(tx) => Some(tx.as_slice().valid_until()),
}
}
pub(super) mod internal {
use super::*;
use std::{
cmp::Ordering,
collections::{BTreeSet, HashMap},
hash::{Hash, Hasher},
ptr,
};
/// Doubly-linked queue with the possibility to remove elements from the middle of the list by
/// their keys.
struct IndexedDeqeue<K, V> {
head: *mut IndexedDequeueEntry<K, V>,
tail: *mut IndexedDequeueEntry<K, V>,
index: HashMap<IndexedDequeueKeyRef<K>, Box<IndexedDequeueEntry<K, V>>>,
}
struct IndexedDequeueEntry<K, V> {
key: K,
value: V,
prev: *mut IndexedDequeueEntry<K, V>,
next: *mut IndexedDequeueEntry<K, V>,
}
/// A wrapper around the pointer to the key of the queue element. This wrapper forwards the
/// implementations of `Eq` and `Hash` to `K`. This is required becuase by default the
/// implementations of `Eq` and `Hash` from the pointer itself will be used.
struct IndexedDequeueKeyRef<K>(*const K);
impl<K, V> IndexedDeqeue<K, V>
where
K: Eq + Hash,
{
fn new() -> Self {
Self {
head: ptr::null_mut(),
tail: ptr::null_mut(),
index: HashMap::new(),
}
}
fn push_front(&mut self, key: K, value: V) {
let mut entry = Box::new(IndexedDequeueEntry {
key,
value,
prev: ptr::null_mut(),
next: self.head,
});
if let Some(head) = unsafe { self.head.as_mut() } {
head.prev = &mut *entry;
} else {
self.tail = &mut *entry;
}
self.head = &mut *entry;
if self
.index
.insert(IndexedDequeueKeyRef(&entry.key), entry)
.is_some()
{
panic!("inserted an already existing key");
}
}
fn push_back(&mut self, key: K, value: V) {
let mut entry = Box::new(IndexedDequeueEntry {
key,
value,
prev: self.tail,
next: ptr::null_mut(),
});
if let Some(tail) = unsafe { self.tail.as_mut() } {
tail.next = &mut *entry;
} else {
self.head = &mut *entry;
}
self.tail = &mut *entry;
if self
.index
.insert(IndexedDequeueKeyRef(&entry.key), entry)
.is_some()
{
panic!("inserted an already existing key");
}
}
fn pop_back(&mut self) -> Option<(K, V)> {
let tail = unsafe { self.tail.as_mut() }?;
self.tail = tail.prev;
if let Some(prev) = unsafe { tail.prev.as_mut() } {
prev.next = ptr::null_mut();
} else {
self.head = ptr::null_mut();
}
let entry = self.index.remove(&IndexedDequeueKeyRef(&tail.key)).unwrap();
Some((entry.key, entry.value))
}
fn remove(&mut self, key: &K) -> Option<V> {
let entry = self.index.remove(&IndexedDequeueKeyRef(key))?;
if let Some(prev) = unsafe { entry.prev.as_mut() } {
prev.next = entry.next;
} else {
self.head = entry.next;
}
if let Some(next) = unsafe { entry.next.as_mut() } {
next.prev = entry.prev;
} else {
self.tail = entry.prev;
}
Some(entry.value)
}
fn len(&self) -> usize {
self.index.len()
}
fn contains(&self, key: &K) -> bool {
self.index.contains_key(&IndexedDequeueKeyRef(key))
}
}
unsafe impl<K: Send, V: Send> Send for IndexedDeqeue<K, V> {}
unsafe impl<K: Sync, V: Sync> Sync for IndexedDeqeue<K, V> {}
impl<K: PartialEq> PartialEq for IndexedDequeueKeyRef<K> {
fn eq(&self, other: &IndexedDequeueKeyRef<K>) -> bool {
unsafe { (*self.0).eq(&*other.0) }
}
}
impl<K: PartialEq> Eq for IndexedDequeueKeyRef<K> {}
impl<K: Hash> Hash for IndexedDequeueKeyRef<K> {
fn hash<H: Hasher>(&self, state: &mut H) {
unsafe { (*self.0).hash(state) }
}
}
#[derive(Clone, PartialEq, Eq)]
struct TimeoutQueueItem {
valid_until: BlockDate,
id: FragmentId,
}
impl Ord for TimeoutQueueItem {
fn cmp(&self, other: &Self) -> Ordering {
let res = self.valid_until.cmp(&other.valid_until);
if res != Ordering::Equal {
return res;
}
self.id.cmp(&other.id)
}
}
impl PartialOrd for TimeoutQueueItem {
fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
Some(self.cmp(other))
}
}
pub struct Pool {
entries: IndexedDeqeue<FragmentId, Fragment>,
timeout_queue: BTreeSet<TimeoutQueueItem>,
max_entries: usize,
}
impl Pool {
pub fn new(max_entries: usize) -> Self {
Pool {
entries: IndexedDeqeue::new(),
// Using BTreeSet is a nasty hack so that we are able to to efficiently remove items
// out of their order in a queue. BinaryHeap does not allow that.
timeout_queue: BTreeSet::new(),
max_entries,
}
}
/// Returns clones of registered fragments
pub fn insert_all(
&mut self,
fragments: impl IntoIterator<Item = Fragment>,
) -> Vec<Fragment> {
let max_fragments = self.max_entries - self.entries.len();
fragments
.into_iter()
.filter(|fragment| {
let fragment_id = fragment.id();
if self.entries.contains(&fragment_id) {
false
} else {
self.timeout_queue_insert(fragment);
self.entries.push_front(fragment_id, fragment.clone());
true
}
})
.take(max_fragments)
.collect()
}
pub fn remove_all<'a>(&mut self, fragment_ids: impl IntoIterator<Item = &'a FragmentId>) {
for fragment_id in fragment_ids {
let maybe_fragment = self.entries.remove(fragment_id);
if let Some(fragment) = maybe_fragment {
self.timeout_queue_remove(&fragment);
}
}
}
pub fn remove_oldest(&mut self) -> Option<Fragment> {
let fragment = self.entries.pop_back().map(|(_, value)| value)?;
self.timeout_queue_remove(&fragment);
Some(fragment)
}
pub fn return_to_pool(&mut self, fragments: impl IntoIterator<Item = Fragment>) {
for fragment in fragments.into_iter() {
self.timeout_queue_insert(&fragment);
self.entries.push_back(fragment.id(), fragment);
}
}
fn timeout_queue_insert(&mut self, fragment: &Fragment) {
if let Some(valid_until) = get_transaction_expiry_date(fragment) {
let item = TimeoutQueueItem {
valid_until,
id: fragment.id(),
};
self.timeout_queue.insert(item);
}
}
fn timeout_queue_remove(&mut self, fragment: &Fragment) {
if let Some(valid_until) = get_transaction_expiry_date(fragment) {
let item = TimeoutQueueItem {
valid_until,
id: fragment.id(),
};
self.timeout_queue.remove(&item);
}
}
pub fn remove_expired_txs(&mut self, block_date: BlockDate) -> Vec<FragmentId> {
let to_remove: Vec<_> = self
.timeout_queue
.iter()
.take_while(|x| x.valid_until < block_date)
.cloned()
.collect();
for item in &to_remove {
self.timeout_queue.remove(item);
self.entries.remove(&item.id);
}
to_remove.into_iter().map(|x| x.id).collect()
// TODO convert to something like this when .first() and .pop_first() are stabilized. This does not have unnecessary clones.
// https://github.com/rust-lang/rust/issues/62924
// loop {
// if let Some(item) = self.timeout_queue.first() {
// if item.valid_until < block_date {
// break;
// }
// } else {
// break;
// }
// let item = self.timeout_queue.pop_first().unwrap();
// self.entries.remove(&item.id);
// }
}
pub fn len(&self) -> usize {
self.entries.len()
}
}
#[cfg(test)]
mod tests {
use super::*;
use chain_impl_mockchain::transaction::TxBuilder;
use quickcheck_macros::quickcheck;
#[quickcheck]
fn overflowing_pool_should_reject_new_fragments(
fragments1_in: (Fragment, Fragment, Fragment),
fragments2_in: (Fragment, Fragment),
) {
let fragments1 = vec![
fragments1_in.0.clone(),
fragments1_in.1.clone(),
fragments1_in.2.clone(),
];
let fragments2 = vec![
fragments1_in.2.clone(),
fragments2_in.0.clone(),
fragments2_in.1.clone(),
];
let fragments2_expected = vec![fragments2_in.0.clone()];
let final_expected = vec![
fragments1_in.0,
fragments1_in.1,
fragments1_in.2,
fragments2_in.0,
];
let mut pool = Pool::new(4);
assert_eq!(fragments1, pool.insert_all(fragments1.clone()));
assert_eq!(fragments2_expected, pool.insert_all(fragments2));
for expected in final_expected.into_iter() {
assert_eq!(expected, pool.remove_oldest().unwrap());
}
assert!(pool.remove_oldest().is_none());
}
#[test]
fn expired_transactions_are_removed() {
let mut pool = Pool::new(1);
let tx = Fragment::Transaction(
TxBuilder::new()
.set_nopayload()
.set_expiry_date(BlockDate {
epoch: 0,
slot_id: 1,
})
.set_ios(&[], &[])
.set_witnesses(&[])
.set_payload_auth(&()),
);
pool.insert_all([tx]);
assert_eq!(pool.entries.len(), 1, "Fragment should be in pool");
pool.remove_expired_txs(BlockDate {
epoch: 0,
slot_id: 1,
});
assert_eq!(pool.entries.len(), 1, "Fragment has not expired yet");
pool.remove_expired_txs(BlockDate {
epoch: 0,
slot_id: 2,
});
assert_eq!(pool.entries.len(), 0, "Expired fragment should be removed");
}
}
}