mirror of
https://github.com/YGGverse/aquatic.git
synced 2026-04-01 18:25:30 +00:00
221 lines
5.7 KiB
Rust
221 lines
5.7 KiB
Rust
use std::hash::Hash;
|
|
use std::net::{IpAddr, Ipv4Addr, Ipv6Addr};
|
|
use std::sync::Arc;
|
|
use std::time::Instant;
|
|
|
|
use aquatic_common::access_list::{create_access_list_cache, AccessListArcSwap};
|
|
use aquatic_common::AHashIndexMap;
|
|
|
|
pub use aquatic_common::{access_list::AccessList, ValidUntil};
|
|
pub use aquatic_udp_protocol::*;
|
|
|
|
use crate::config::Config;
|
|
|
|
pub mod handlers;
|
|
pub mod network;
|
|
|
|
pub const MAX_PACKET_SIZE: usize = 8192;
|
|
|
|
pub trait Ip: Hash + PartialEq + Eq + Clone + Copy {
|
|
fn ip_addr(self) -> IpAddr;
|
|
}
|
|
|
|
impl Ip for Ipv4Addr {
|
|
fn ip_addr(self) -> IpAddr {
|
|
IpAddr::V4(self)
|
|
}
|
|
}
|
|
|
|
impl Ip for Ipv6Addr {
|
|
fn ip_addr(self) -> IpAddr {
|
|
IpAddr::V6(self)
|
|
}
|
|
}
|
|
|
|
#[derive(PartialEq, Eq, Hash, Clone, Copy, Debug)]
|
|
pub enum PeerStatus {
|
|
Seeding,
|
|
Leeching,
|
|
Stopped,
|
|
}
|
|
|
|
impl PeerStatus {
|
|
/// Determine peer status from announce event and number of bytes left.
|
|
///
|
|
/// Likely, the last branch will be taken most of the time.
|
|
#[inline]
|
|
pub fn from_event_and_bytes_left(event: AnnounceEvent, bytes_left: NumberOfBytes) -> Self {
|
|
if event == AnnounceEvent::Stopped {
|
|
Self::Stopped
|
|
} else if bytes_left.0 == 0 {
|
|
Self::Seeding
|
|
} else {
|
|
Self::Leeching
|
|
}
|
|
}
|
|
}
|
|
|
|
#[derive(Clone, Debug)]
|
|
pub struct Peer<I: Ip> {
|
|
pub ip_address: I,
|
|
pub port: Port,
|
|
pub status: PeerStatus,
|
|
pub valid_until: ValidUntil,
|
|
}
|
|
|
|
impl<I: Ip> Peer<I> {
|
|
#[inline(always)]
|
|
pub fn to_response_peer(&self) -> ResponsePeer {
|
|
ResponsePeer {
|
|
ip_address: self.ip_address.ip_addr(),
|
|
port: self.port,
|
|
}
|
|
}
|
|
}
|
|
|
|
#[derive(PartialEq, Eq, Hash, Clone, Copy)]
|
|
pub struct PeerMapKey<I: Ip> {
|
|
pub ip: I,
|
|
pub peer_id: PeerId,
|
|
}
|
|
|
|
pub type PeerMap<I> = AHashIndexMap<PeerMapKey<I>, Peer<I>>;
|
|
|
|
pub struct TorrentData<I: Ip> {
|
|
pub peers: PeerMap<I>,
|
|
pub num_seeders: usize,
|
|
pub num_leechers: usize,
|
|
}
|
|
|
|
impl<I: Ip> Default for TorrentData<I> {
|
|
fn default() -> Self {
|
|
Self {
|
|
peers: Default::default(),
|
|
num_seeders: 0,
|
|
num_leechers: 0,
|
|
}
|
|
}
|
|
}
|
|
|
|
pub type TorrentMap<I> = AHashIndexMap<InfoHash, TorrentData<I>>;
|
|
|
|
#[derive(Default)]
|
|
pub struct TorrentMaps {
|
|
pub ipv4: TorrentMap<Ipv4Addr>,
|
|
pub ipv6: TorrentMap<Ipv6Addr>,
|
|
}
|
|
|
|
impl TorrentMaps {
|
|
/// Remove disallowed and inactive torrents
|
|
pub fn clean(&mut self, config: &Config, access_list: &Arc<AccessListArcSwap>) {
|
|
let now = Instant::now();
|
|
let access_list_mode = config.access_list.mode;
|
|
|
|
let mut access_list_cache = create_access_list_cache(access_list);
|
|
|
|
self.ipv4.retain(|info_hash, torrent| {
|
|
access_list_cache
|
|
.load()
|
|
.allows(access_list_mode, &info_hash.0)
|
|
&& Self::clean_torrent_and_peers(now, torrent)
|
|
});
|
|
self.ipv4.shrink_to_fit();
|
|
|
|
self.ipv6.retain(|info_hash, torrent| {
|
|
access_list_cache
|
|
.load()
|
|
.allows(access_list_mode, &info_hash.0)
|
|
&& Self::clean_torrent_and_peers(now, torrent)
|
|
});
|
|
self.ipv6.shrink_to_fit();
|
|
}
|
|
|
|
/// Returns true if torrent is to be kept
|
|
#[inline]
|
|
fn clean_torrent_and_peers<I: Ip>(now: Instant, torrent: &mut TorrentData<I>) -> bool {
|
|
let num_seeders = &mut torrent.num_seeders;
|
|
let num_leechers = &mut torrent.num_leechers;
|
|
|
|
torrent.peers.retain(|_, peer| {
|
|
let keep = peer.valid_until.0 > now;
|
|
|
|
if !keep {
|
|
match peer.status {
|
|
PeerStatus::Seeding => {
|
|
*num_seeders -= 1;
|
|
}
|
|
PeerStatus::Leeching => {
|
|
*num_leechers -= 1;
|
|
}
|
|
_ => (),
|
|
};
|
|
}
|
|
|
|
keep
|
|
});
|
|
|
|
torrent.peers.shrink_to_fit();
|
|
|
|
!torrent.peers.is_empty()
|
|
}
|
|
}
|
|
|
|
#[cfg(test)]
|
|
mod tests {
|
|
use std::net::{IpAddr, Ipv6Addr};
|
|
|
|
use crate::{common::MAX_PACKET_SIZE, config::Config};
|
|
|
|
#[test]
|
|
fn test_peer_status_from_event_and_bytes_left() {
|
|
use crate::common::*;
|
|
|
|
use PeerStatus::*;
|
|
|
|
let f = PeerStatus::from_event_and_bytes_left;
|
|
|
|
assert_eq!(Stopped, f(AnnounceEvent::Stopped, NumberOfBytes(0)));
|
|
assert_eq!(Stopped, f(AnnounceEvent::Stopped, NumberOfBytes(1)));
|
|
|
|
assert_eq!(Seeding, f(AnnounceEvent::Started, NumberOfBytes(0)));
|
|
assert_eq!(Leeching, f(AnnounceEvent::Started, NumberOfBytes(1)));
|
|
|
|
assert_eq!(Seeding, f(AnnounceEvent::Completed, NumberOfBytes(0)));
|
|
assert_eq!(Leeching, f(AnnounceEvent::Completed, NumberOfBytes(1)));
|
|
|
|
assert_eq!(Seeding, f(AnnounceEvent::None, NumberOfBytes(0)));
|
|
assert_eq!(Leeching, f(AnnounceEvent::None, NumberOfBytes(1)));
|
|
}
|
|
|
|
// Assumes that announce response with maximum amount of ipv6 peers will
|
|
// be the longest
|
|
#[test]
|
|
fn test_max_package_size() {
|
|
use aquatic_udp_protocol::*;
|
|
|
|
let config = Config::default();
|
|
|
|
let peers = ::std::iter::repeat(ResponsePeer {
|
|
ip_address: IpAddr::V6(Ipv6Addr::new(1, 1, 1, 1, 1, 1, 1, 1)),
|
|
port: Port(1),
|
|
})
|
|
.take(config.protocol.max_response_peers)
|
|
.collect();
|
|
|
|
let response = Response::Announce(AnnounceResponse {
|
|
transaction_id: TransactionId(1),
|
|
announce_interval: AnnounceInterval(1),
|
|
seeders: NumberOfPeers(1),
|
|
leechers: NumberOfPeers(1),
|
|
peers,
|
|
});
|
|
|
|
let mut buf = Vec::new();
|
|
|
|
response.write(&mut buf, IpVersion::IPv6).unwrap();
|
|
|
|
println!("Buffer len: {}", buf.len());
|
|
|
|
assert!(buf.len() <= MAX_PACKET_SIZE);
|
|
}
|
|
}
|