blob: ed9553e3446fcfe9622b14784bd63f5a4e8b254b (
plain)
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
|
//! Tracking for the path of a client circuit.
use std::sync::Mutex;
use tor_linkspec::OwnedChanTarget;
use crate::crypto::cell::HopNum;
/// Helper struct that shares information
#[derive(Debug, Default)]
pub(super) struct Path {
/// Information about the relays on this circuit.
///
/// We only store ChanTarget information here, because it doesn't matter
/// which ntor key we actually used with each hop.
hops: Mutex<Vec<OwnedChanTarget>>,
}
impl Path {
/// Return the number of hops in this path
pub(super) fn n_hops(&self) -> usize {
self.hops.lock().expect("poisoned lock").len()
}
/// Add a hop to this this path.
pub(super) fn push_hop(&self, target: OwnedChanTarget) {
self.hops.lock().expect("poisoned lock").push(target);
}
/// Return an OwnedChanTarget representing the first hop of this path.
pub(super) fn first_hop(&self) -> Option<OwnedChanTarget> {
self.hops
.lock()
.expect("poisoned lock")
.get(0)
.map(Clone::clone)
}
/// Return a copy of all the hops in this path.
pub(super) fn all_hops(&self) -> Vec<OwnedChanTarget> {
self.hops.lock().expect("poisoned lock").clone()
}
/// Return the index of the last hop on this path, or `None` if the path is
/// empty (or impossibly long).
pub(super) fn last_hop_num(&self) -> Option<HopNum> {
let n = self.n_hops();
let idx: u8 = n.checked_sub(1)?.try_into().ok()?;
Some(idx.into())
}
}
|
