spill 0.5.0

A single-user BitTorrent daemon for Linux and macOS
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

//! Byte-bounded LRU upload windows. Availability is owned by the downloader;
//! callers request cache loads only for verified pieces. Uploads do not rehash.
use std::{
    collections::VecDeque,
    io,
    ops::Range,
    sync::{Arc, RwLock},
};

pub(in crate::engine) const MAX_WINDOW: usize = 256 * 1024;

/// A bounded read-ahead window containing the entire request, including an
/// unaligned block crossing the normal window boundary or the piece's tail.
pub(in crate::engine) fn window(
    piece_len: usize,
    budget: usize,
    offset: u32,
    length: u32,
) -> Option<Range<usize>> {
    let end = u64::from(offset) + u64::from(length);
    let size = budget.min(MAX_WINDOW).min(piece_len);
    if length == 0 || length as usize > size || end > piece_len as u64 {
        return None;
    }
    let mut start = offset as usize / size * size;
    if end as usize > start + size {
        start = offset as usize;
    }
    Some(start..start + size.min(piece_len - start))
}

type Entries = VecDeque<(u32, u32, Arc<Vec<u8>>)>;
pub(in crate::engine) struct CachedBlock {
    pub(in crate::engine) bytes: Arc<Vec<u8>>,
    pub(in crate::engine) range: Range<usize>,
}
#[derive(Clone, Default)]
pub(in crate::engine) struct CacheView(Arc<RwLock<Entries>>);
impl CacheView {
    pub(in crate::engine) fn block(
        &self,
        index: u32,
        offset: u32,
        length: u32,
    ) -> io::Result<Option<CachedBlock>> {
        let end = u64::from(offset) + u64::from(length);
        let mut entries = self
            .0
            .write()
            .map_err(|_| io::Error::other("upload cache poisoned"))?;
        let Some(position) = entries.iter().position(|(i, start, bytes)| {
            *i == index && *start <= offset && end <= u64::from(*start) + bytes.len() as u64
        }) else {
            return Ok(None);
        };
        let entry = entries.remove(position).expect("cache hit");
        let begin = (offset - entry.1) as usize;
        let hit = CachedBlock {
            bytes: entry.2.clone(),
            range: begin..begin + length as usize,
        };
        entries.push_back(entry);
        Ok(Some(hit))
    }
    pub(in crate::engine) fn insert(
        &self,
        index: u32,
        offset: u32,
        bytes: Vec<u8>,
        budget: usize,
    ) -> io::Result<()> {
        if bytes.is_empty() || bytes.len() > budget {
            return Err(io::Error::other("invalid upload cache window"));
        }
        let mut entries = self
            .0
            .write()
            .map_err(|_| io::Error::other("upload cache poisoned"))?;
        entries.retain(|(i, start, _)| *i != index || *start != offset);
        let mut used = entries.iter().map(|(_, _, b)| b.len()).sum::<usize>();
        while used > budget - bytes.len() {
            used -= entries.pop_front().expect("cache eviction").2.len();
        }
        entries.push_back((index, offset, Arc::new(bytes)));
        Ok(())
    }
}