peer handling now works well
This commit is contained in:
parent
672dcce484
commit
ea8cd02a7a
1 changed files with 129 additions and 85 deletions
|
|
@ -1,8 +1,9 @@
|
||||||
use std::{
|
use std::{
|
||||||
|
any,
|
||||||
cmp::Reverse,
|
cmp::Reverse,
|
||||||
net::SocketAddr,
|
net::SocketAddr,
|
||||||
sync::{
|
sync::{
|
||||||
atomic::{AtomicU16, Ordering},
|
atomic::{AtomicBool, AtomicU16, Ordering},
|
||||||
Arc,
|
Arc,
|
||||||
},
|
},
|
||||||
task::Poll,
|
task::Poll,
|
||||||
|
|
@ -21,7 +22,9 @@ use anyhow::{bail, Context};
|
||||||
use backoff::{backoff::Backoff, ExponentialBackoffBuilder};
|
use backoff::{backoff::Backoff, ExponentialBackoffBuilder};
|
||||||
use bencode::ByteString;
|
use bencode::ByteString;
|
||||||
use dashmap::DashMap;
|
use dashmap::DashMap;
|
||||||
use futures::{future::BoxFuture, stream::FuturesUnordered, FutureExt, Stream, StreamExt};
|
use futures::{
|
||||||
|
future::BoxFuture, stream::FuturesUnordered, FutureExt, Stream, StreamExt, TryFutureExt,
|
||||||
|
};
|
||||||
use indexmap::IndexSet;
|
use indexmap::IndexSet;
|
||||||
use leaky_bucket::RateLimiter;
|
use leaky_bucket::RateLimiter;
|
||||||
use librqbit_core::{id20::Id20, peer_id::generate_peer_id, spawn_utils::spawn};
|
use librqbit_core::{id20::Id20, peer_id::generate_peer_id, spawn_utils::spawn};
|
||||||
|
|
@ -62,6 +65,7 @@ struct MaybeUsefulNode {
|
||||||
addr: SocketAddr,
|
addr: SocketAddr,
|
||||||
last_request: Instant,
|
last_request: Instant,
|
||||||
last_response: Option<Instant>,
|
last_response: Option<Instant>,
|
||||||
|
errors_in_a_row: usize,
|
||||||
returned_peers: bool,
|
returned_peers: bool,
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
@ -86,26 +90,31 @@ struct RequestPeers {
|
||||||
info_hash: Id20,
|
info_hash: Id20,
|
||||||
dht: Arc<DhtState>,
|
dht: Arc<DhtState>,
|
||||||
useful_nodes: RwLock<Vec<MaybeUsefulNode>>,
|
useful_nodes: RwLock<Vec<MaybeUsefulNode>>,
|
||||||
tx: tokio::sync::mpsc::UnboundedSender<SocketAddr>,
|
peer_tx: tokio::sync::mpsc::UnboundedSender<SocketAddr>,
|
||||||
|
node_tx: tokio::sync::mpsc::UnboundedSender<SocketAddr>,
|
||||||
}
|
}
|
||||||
|
|
||||||
struct RequestPeersStream {
|
struct RequestPeersStream {
|
||||||
rx: tokio::sync::mpsc::UnboundedReceiver<SocketAddr>,
|
rx: tokio::sync::mpsc::UnboundedReceiver<SocketAddr>,
|
||||||
cancel_join_handle: tokio::task::JoinHandle<()>,
|
cancel_join_handle: tokio::task::JoinHandle<()>,
|
||||||
|
request_peers: Arc<RequestPeers>,
|
||||||
}
|
}
|
||||||
|
|
||||||
impl RequestPeersStream {
|
impl RequestPeersStream {
|
||||||
fn new(dht: Arc<DhtState>, info_hash: Id20) -> Self {
|
fn new(dht: Arc<DhtState>, info_hash: Id20) -> Self {
|
||||||
let (tx, rx) = unbounded_channel();
|
let (peer_tx, peer_rx) = unbounded_channel();
|
||||||
|
let (node_tx, node_rx) = unbounded_channel();
|
||||||
let rp = Arc::new(RequestPeers {
|
let rp = Arc::new(RequestPeers {
|
||||||
info_hash,
|
info_hash,
|
||||||
dht,
|
dht,
|
||||||
useful_nodes: RwLock::new(Vec::new()),
|
useful_nodes: RwLock::new(Vec::new()),
|
||||||
tx,
|
peer_tx,
|
||||||
|
node_tx,
|
||||||
});
|
});
|
||||||
let join_handle = rp.request_peers_forever();
|
let join_handle = rp.clone().request_peers_forever(node_rx);
|
||||||
Self {
|
Self {
|
||||||
rx,
|
request_peers: rp,
|
||||||
|
rx: peer_rx,
|
||||||
cancel_join_handle: join_handle,
|
cancel_join_handle: join_handle,
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
@ -128,74 +137,100 @@ impl Stream for RequestPeersStream {
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// So what do I want to do?
|
||||||
|
// Every 60 seconds, we add root nodes to the queue.
|
||||||
|
// We poll the following things:
|
||||||
|
// 1. The queue. If got item from there, insert into the futures unordered.
|
||||||
|
// 2. Futures unordered.
|
||||||
|
// If received, send to the resulting one.
|
||||||
|
struct Tmp {}
|
||||||
|
|
||||||
impl RequestPeers {
|
impl RequestPeers {
|
||||||
fn request_peers_forever(self: Arc<Self>) -> tokio::task::JoinHandle<()> {
|
fn request_peers_forever(
|
||||||
|
self: Arc<Self>,
|
||||||
|
mut node_rx: tokio::sync::mpsc::UnboundedReceiver<SocketAddr>,
|
||||||
|
) -> tokio::task::JoinHandle<()> {
|
||||||
spawn(
|
spawn(
|
||||||
error_span!("request_peers", info_hash = format!("{:?}", self.info_hash)),
|
error_span!("request_peers", info_hash = format!("{:?}", self.info_hash)),
|
||||||
async move {
|
async move {
|
||||||
let mut iteration = 0;
|
// Looper adds root nodes to the queue every 60 seconds.
|
||||||
loop {
|
let looper = {
|
||||||
debug!("iteration {}", iteration);
|
let this = self.clone();
|
||||||
let sleep_duration = match self.get_peers_root().await {
|
async move {
|
||||||
Ok(_) => Duration::from_secs(60),
|
let mut iteration = 0;
|
||||||
Err(e) => {
|
loop {
|
||||||
debug!("error: {e:?}");
|
debug!("iteration {}", iteration);
|
||||||
Duration::from_secs(1)
|
let sleep = match this.get_peers_root() {
|
||||||
|
Ok(0) => Duration::from_secs(1),
|
||||||
|
Ok(n) if n < 8 => REQUERY_INTERVAL / 2,
|
||||||
|
Ok(_) => REQUERY_INTERVAL,
|
||||||
|
Err(e) => {
|
||||||
|
error!("error: {e:?}");
|
||||||
|
return Err::<(), anyhow::Error>(e);
|
||||||
|
}
|
||||||
|
};
|
||||||
|
tokio::time::sleep(sleep).await;
|
||||||
|
iteration += 1;
|
||||||
}
|
}
|
||||||
};
|
}
|
||||||
tokio::time::sleep(sleep_duration).await;
|
};
|
||||||
iteration += 1;
|
tokio::pin!(looper);
|
||||||
|
|
||||||
|
let mut futs = FuturesUnordered::new();
|
||||||
|
loop {
|
||||||
|
tokio::select! {
|
||||||
|
addr = node_rx.recv() => {
|
||||||
|
let addr = addr.unwrap();
|
||||||
|
futs.push(
|
||||||
|
self.get_peers_one(addr)
|
||||||
|
.map_err(|e| debug!("error: {e:?}"))
|
||||||
|
.instrument(error_span!("addr", addr=addr.to_string()))
|
||||||
|
);
|
||||||
|
}
|
||||||
|
Some(_) = futs.next(), if !futs.is_empty() => {}
|
||||||
|
_ = &mut looper => {}
|
||||||
|
}
|
||||||
}
|
}
|
||||||
},
|
},
|
||||||
)
|
)
|
||||||
}
|
}
|
||||||
fn request_peers_one<'a>(
|
|
||||||
self: &'a Arc<Self>,
|
|
||||||
addr: SocketAddr,
|
|
||||||
) -> BoxFuture<'a, anyhow::Result<()>> {
|
|
||||||
let fut = async move {
|
|
||||||
let response = self
|
|
||||||
.dht
|
|
||||||
.request(Request::GetPeers(self.info_hash), addr)
|
|
||||||
.await?;
|
|
||||||
let response = match response {
|
|
||||||
ResponseOrError::Response(r) => r,
|
|
||||||
ResponseOrError::Error(e) => {
|
|
||||||
bail!("error response: {:?}", e)
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
self.mark_node_responded(addr, &response);
|
async fn get_peers_one<'a>(self: &'a Arc<Self>, addr: SocketAddr) -> anyhow::Result<()> {
|
||||||
|
let response = self
|
||||||
if let Some(peers) = response.values {
|
.dht
|
||||||
for peer in peers {
|
.request(Request::GetPeers(self.info_hash), addr)
|
||||||
self.tx.send(SocketAddr::V4(peer.addr))?;
|
.await
|
||||||
}
|
.map_err(|e| {
|
||||||
|
self.mark_node_error(addr);
|
||||||
|
e
|
||||||
|
})?;
|
||||||
|
self.mark_node_responded(addr, &response);
|
||||||
|
let response = match response {
|
||||||
|
ResponseOrError::Response(r) => r,
|
||||||
|
ResponseOrError::Error(e) => {
|
||||||
|
bail!("error response: {:?}", e)
|
||||||
}
|
}
|
||||||
|
|
||||||
let mut futs = FuturesUnordered::new();
|
|
||||||
if let Some(nodes) = response.nodes {
|
|
||||||
for node in nodes.nodes {
|
|
||||||
let addr = SocketAddr::V4(node.addr);
|
|
||||||
if self.should_request_node(node.id, addr) {
|
|
||||||
futs.push(self.request_peers_one(addr));
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
while let Some(res) = futs.next().await {
|
|
||||||
if let Err(e) = res {
|
|
||||||
debug!("error: {e:?}")
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
Ok(())
|
|
||||||
};
|
};
|
||||||
fut.boxed()
|
|
||||||
|
if let Some(peers) = response.values {
|
||||||
|
for peer in peers {
|
||||||
|
self.peer_tx.send(SocketAddr::V4(peer.addr))?;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
if let Some(nodes) = response.nodes {
|
||||||
|
for node in nodes.nodes {
|
||||||
|
let addr = SocketAddr::V4(node.addr);
|
||||||
|
if self.should_request_node(node.id, addr) {
|
||||||
|
self.node_tx.send(addr)?;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
Ok(())
|
||||||
}
|
}
|
||||||
|
|
||||||
async fn get_peers_root(self: &Arc<Self>) -> anyhow::Result<()> {
|
fn get_peers_root(self: &Arc<Self>) -> anyhow::Result<usize> {
|
||||||
let mut futs = FuturesUnordered::new();
|
let mut count = 0;
|
||||||
for (_, addr) in self
|
for (_, addr) in self
|
||||||
.dht
|
.dht
|
||||||
.routing_table
|
.routing_table
|
||||||
|
|
@ -205,32 +240,42 @@ impl RequestPeers {
|
||||||
.map(|n| (n.id(), n.addr()))
|
.map(|n| (n.id(), n.addr()))
|
||||||
.take(8)
|
.take(8)
|
||||||
{
|
{
|
||||||
futs.push(self.request_peers_one(addr))
|
count += 1;
|
||||||
|
self.node_tx.send(addr)?;
|
||||||
}
|
}
|
||||||
if futs.is_empty() {
|
Ok(count)
|
||||||
bail!("no nodes in routing table")
|
|
||||||
}
|
|
||||||
while let Some(res) = futs.next().await {
|
|
||||||
if let Err(e) = res {
|
|
||||||
debug!("error: {e:?}")
|
|
||||||
}
|
|
||||||
}
|
|
||||||
Ok(())
|
|
||||||
}
|
}
|
||||||
|
|
||||||
fn mark_node_responded(&self, addr: SocketAddr, response: &Response<ByteString>) {
|
fn mark_node_error(&self, addr: SocketAddr) -> bool {
|
||||||
let mut closest_nodes = self.useful_nodes.write();
|
self.useful_nodes
|
||||||
for node in closest_nodes.iter_mut() {
|
.write()
|
||||||
if node.addr == addr {
|
.iter_mut()
|
||||||
|
.find(|n| n.addr == addr)
|
||||||
|
.map(|n| {
|
||||||
|
n.errors_in_a_row += 1;
|
||||||
|
})
|
||||||
|
.is_some()
|
||||||
|
}
|
||||||
|
|
||||||
|
fn mark_node_responded(&self, addr: SocketAddr, response: &ResponseOrError) -> bool {
|
||||||
|
self.useful_nodes
|
||||||
|
.write()
|
||||||
|
.iter_mut()
|
||||||
|
.find(|n| n.addr == addr)
|
||||||
|
.map(|node| {
|
||||||
node.last_response = Some(Instant::now());
|
node.last_response = Some(Instant::now());
|
||||||
node.returned_peers = response
|
node.errors_in_a_row = 0;
|
||||||
.values
|
match response {
|
||||||
.as_ref()
|
ResponseOrError::Response(r) => {
|
||||||
.map(|c| !c.is_empty())
|
node.returned_peers =
|
||||||
.unwrap_or(false);
|
r.values.as_ref().map(|c| !c.is_empty()).unwrap_or(false)
|
||||||
break;
|
}
|
||||||
}
|
ResponseOrError::Error(_) => {
|
||||||
}
|
node.returned_peers = false;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
})
|
||||||
|
.is_some()
|
||||||
}
|
}
|
||||||
|
|
||||||
fn should_request_node(&self, node_id: Id20, addr: SocketAddr) -> bool {
|
fn should_request_node(&self, node_id: Id20, addr: SocketAddr) -> bool {
|
||||||
|
|
@ -251,6 +296,7 @@ impl RequestPeers {
|
||||||
last_request: Instant::now(),
|
last_request: Instant::now(),
|
||||||
last_response: None,
|
last_response: None,
|
||||||
returned_peers: false,
|
returned_peers: false,
|
||||||
|
errors_in_a_row: 0,
|
||||||
});
|
});
|
||||||
|
|
||||||
const LIMIT: usize = 256;
|
const LIMIT: usize = 256;
|
||||||
|
|
@ -273,7 +319,6 @@ impl RequestPeers {
|
||||||
pub struct DhtState {
|
pub struct DhtState {
|
||||||
id: Id20,
|
id: Id20,
|
||||||
next_transaction_id: AtomicU16,
|
next_transaction_id: AtomicU16,
|
||||||
bootstrapped: Notify,
|
|
||||||
|
|
||||||
// Created requests: (transaction_id, addr) => Requests.
|
// Created requests: (transaction_id, addr) => Requests.
|
||||||
// If we get a response, it gets removed from here.
|
// If we get a response, it gets removed from here.
|
||||||
|
|
@ -297,7 +342,6 @@ impl DhtState {
|
||||||
let routing_table = routing_table.unwrap_or_else(|| RoutingTable::new(id));
|
let routing_table = routing_table.unwrap_or_else(|| RoutingTable::new(id));
|
||||||
Self {
|
Self {
|
||||||
id,
|
id,
|
||||||
bootstrapped: Default::default(),
|
|
||||||
next_transaction_id: AtomicU16::new(0),
|
next_transaction_id: AtomicU16::new(0),
|
||||||
inflight_by_transaction_id: Default::default(),
|
inflight_by_transaction_id: Default::default(),
|
||||||
routing_table: RwLock::new(routing_table),
|
routing_table: RwLock::new(routing_table),
|
||||||
|
|
|
||||||
Loading…
Add table
Add a link
Reference in a new issue