sosistab 0.5.43

An obfuscated datagram transport for horrible networks
Documentation 
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

use std::{
    collections::{HashMap, VecDeque},
    time::{Duration, Instant},
};

use dashmap::DashMap;
use once_cell::sync::Lazy;
use parking_lot::Mutex;

// recently seen tracker
pub(crate) struct RecentFilter {
    seen: HashMap<blake3::Hash, Instant>,
    expiry: VecDeque<(Instant, blake3::Hash)>,
}

impl RecentFilter {
    fn new() -> Self {
        RecentFilter {
            seen: Default::default(),
            expiry: Default::default(),
        }
    }

    pub fn check(&mut self, val: &[u8]) -> bool {
        // clean up first
        while let Some(to_delete) = self.expiry.front().and_then(|(expiry, hash)| {
            if expiry.elapsed() > Duration::from_secs(600) {
                Some(*hash)
            } else {
                None
            }
        }) {
            let _ = self.expiry.pop_front();
            self.seen.remove(&to_delete);
        }
        // then add
        let key = blake3::hash(val);
        if let Some(time) = self.seen.get(&key) {
            tracing::error!("replay from {:?} ago", time.elapsed());
            false
        } else {
            let now = Instant::now();
            self.seen.insert(key, now);
            self.expiry.push_back((now, key));
            true
        }
    }
}

/// A global recent filter.
pub(crate) static RECENT_FILTER: Lazy<Mutex<RecentFilter>> =
    Lazy::new(|| Mutex::new(RecentFilter::new()));