fips-core 0.4.49

Reusable FIPS mesh, endpoint, transport, and protocol library
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
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

use crate::NodeAddr;
use std::collections::HashMap;

/// Tracks a pending discovery lookup with retry state.
#[derive(Clone, Debug)]
pub struct PendingLookup {
    /// When the lookup was first initiated.
    pub initiated_ms: u64,
    /// When the last attempt was sent.
    pub last_sent_ms: u64,
    /// Current attempt number (1 = initial, 2 = first retry, ...).
    pub attempt: u8,
    origin_request_ids: Vec<u64>,
}

impl PendingLookup {
    pub fn new(now_ms: u64) -> Self {
        Self {
            initiated_ms: now_ms,
            last_sent_ms: now_ms,
            attempt: 1,
            origin_request_ids: Vec::new(),
        }
    }

    fn record_origin_request(&mut self, request_id: u64) {
        self.origin_request_ids.push(request_id);
    }

    fn matches_origin_request(&self, request_id: u64) -> bool {
        self.origin_request_ids.contains(&request_id)
    }

    #[cfg(test)]
    fn last_origin_request_id(&self) -> Option<u64> {
        self.origin_request_ids.last().copied()
    }
}

/// Admission result for the pending discovery lookup queue.
#[derive(Clone, Copy, Debug, PartialEq, Eq)]
pub(crate) struct PendingDiscoveryLookupAdmission {
    accepted: bool,
    deduplicated: bool,
    queue_full: bool,
}

impl PendingDiscoveryLookupAdmission {
    pub(crate) fn accepted(&self) -> bool {
        self.accepted
    }

    pub(crate) fn deduplicated(&self) -> bool {
        self.deduplicated
    }

    pub(crate) fn queue_full(&self) -> bool {
        self.queue_full
    }
}

/// In-flight discovery lookups keyed by target node address.
#[derive(Debug, Default)]
pub(crate) struct PendingDiscoveryLookups {
    entries: HashMap<NodeAddr, PendingLookup>,
}

impl PendingDiscoveryLookups {
    pub(crate) fn admission_for(
        &self,
        dest: &NodeAddr,
        max_pending: usize,
    ) -> PendingDiscoveryLookupAdmission {
        if self.entries.contains_key(dest) {
            return PendingDiscoveryLookupAdmission {
                accepted: false,
                deduplicated: true,
                queue_full: false,
            };
        }

        if self.entries.len() >= max_pending {
            return PendingDiscoveryLookupAdmission {
                accepted: false,
                deduplicated: false,
                queue_full: true,
            };
        }

        PendingDiscoveryLookupAdmission {
            accepted: true,
            deduplicated: false,
            queue_full: false,
        }
    }

    pub(crate) fn insert_new(&mut self, dest: NodeAddr, now_ms: u64) -> Option<PendingLookup> {
        self.entries.insert(dest, PendingLookup::new(now_ms))
    }

    #[cfg(test)]
    pub(crate) fn insert(
        &mut self,
        dest: NodeAddr,
        lookup: PendingLookup,
    ) -> Option<PendingLookup> {
        self.entries.insert(dest, lookup)
    }

    pub(crate) fn remove(&mut self, dest: &NodeAddr) -> Option<PendingLookup> {
        self.entries.remove(dest)
    }

    pub(crate) fn contains_key(&self, dest: &NodeAddr) -> bool {
        self.entries.contains_key(dest)
    }

    pub(crate) fn record_origin_request(&mut self, dest: &NodeAddr, request_id: u64) {
        if let Some(entry) = self.entries.get_mut(dest) {
            entry.record_origin_request(request_id);
        }
    }

    pub(crate) fn matches_origin_request(&self, dest: &NodeAddr, request_id: u64) -> bool {
        self.entries
            .get(dest)
            .is_some_and(|entry| entry.matches_origin_request(request_id))
    }

    #[cfg(test)]
    pub(crate) fn get(&self, dest: &NodeAddr) -> Option<&PendingLookup> {
        self.entries.get(dest)
    }

    #[cfg(test)]
    pub(crate) fn last_origin_request_id(&self, dest: &NodeAddr) -> Option<u64> {
        self.entries
            .get(dest)
            .and_then(PendingLookup::last_origin_request_id)
    }

    pub(crate) fn get_mut(&mut self, dest: &NodeAddr) -> Option<&mut PendingLookup> {
        self.entries.get_mut(dest)
    }

    pub(crate) fn iter(&self) -> impl Iterator<Item = (&NodeAddr, &PendingLookup)> {
        self.entries.iter()
    }

    pub(crate) fn len(&self) -> usize {
        self.entries.len()
    }
}