feat: lift the client's concurrency ceiling from ~15 peers to 1024

The client had never been driven at scale. A stress harness that mixes
searches, downloads, uploads and browses against a local soulfind found four
ceilings, three of which lose work silently rather than merely being slow.

Peers were capped at one per core. ActorSystem ran each actor's whole lifetime
as one job on a fixed-size ThreadPool, and actor loops block until stopped, so
the pool acted as a semaphore: past the cap an actor never started, never
connected and never errored, and uploads stopped working entirely. The pool had
exactly one consumer and every job it received was non-terminating, so it is
gone; actors get their own thread.

TransferResponse raced the bookkeeping it depends on. It was sent straight back
to the peer while UpdateDownloadTokens was still queued for the client loop —
but the response is what invites the peer's file connection, and that connection
is matched by token. Under load the client loop lost, the file connection
matched nothing, and the download sat on Queued forever. The response now goes
out after the token is recorded.

Download tokens were md5(filename) truncated to 20 bits, and the store deletes
every entry matching a token, so two downloads sharing one destroyed each other
— which fetching the same filename from two peers does every time. They now
come from a counter.

Port 0 from GetPeerAddress means the server does not know where a user listens.
It was cached and dialled, and the upload waiting on it was dropped. It is no
longer cached or served against; the connect attempt stays, because its failure
is what makes an unreachable peer fall back to server brokering.

Mixed profile at 1024 peers: 512/512 downloads, 256/256 uploads, 400-850 MiB/s
in ~7s, against 71/96 downloads at 7.9 MiB/s and a 60s timeout before.
This commit is contained in:
Michel de Graaf
2026-07-26 17:01:32 +02:00
parent 38a231ffd1
commit 5b4ef30f08
12 changed files with 1539 additions and 191 deletions
+70 -31
View File
@@ -1,9 +1,8 @@
use std::sync::Arc;
use std::sync::mpsc::{Receiver, Sender, channel};
use std::thread;
use std::time::{Duration, Instant};
use crate::trace;
use crate::utils::thread_pool::ThreadPool;
use crate::{error, trace};
pub mod peer_actor;
pub mod peer_registry;
@@ -58,36 +57,37 @@ pub(crate) enum ActorMessage<M> {
Stop,
}
/// Actor system that manages actor lifecycle
pub struct ActorSystem {
thread_pool: Arc<ThreadPool>,
}
/// Stack size for an actor thread. An actor loop parses messages into
/// heap-allocated buffers and never recurses, so it needs a fraction of the
/// 2 MiB default — and at a thousand concurrent peers that difference is the
/// difference between 2 GiB of reserved address space and 256 MiB.
const ACTOR_STACK_SIZE: usize = 256 * 1024;
/// Actor system that manages actor lifecycle.
///
/// Each actor owns a thread for its whole lifetime. That is deliberate: an
/// actor loop blocks in `recv_timeout` until it is stopped, so running actors
/// on a fixed-size pool would make the pool a semaphore capping the client at
/// one peer per core — and every peer past the cap would silently never start.
#[derive(Default)]
pub struct ActorSystem;
impl ActorSystem {
#[must_use]
pub const fn new(thread_pool: Arc<ThreadPool>) -> Self {
Self { thread_pool }
pub const fn new() -> Self {
Self
}
/// Spawn a new actor and return its handle
pub fn spawn<A: Actor>(&self, mut actor: A) -> ActorHandle<A::Message> {
let (sender, receiver) = channel::<ActorMessage<A::Message>>();
let handle = ActorHandle { sender };
self.thread_pool.execute(move || {
actor.on_start();
Self::run_actor_loop(&mut actor, receiver);
actor.on_stop();
});
handle
pub fn spawn<A: Actor>(&self, actor: A) -> ActorHandle<A::Message> {
self.spawn_with_handle(actor, |_, _| {})
}
/// Spawn a new actor with initialization callback and return its handle
/// The callback receives the actor handle before `on_start` is called
pub fn spawn_with_handle<A: Actor, F>(
&self,
mut actor: A,
actor: A,
init: F,
) -> ActorHandle<A::Message>
where
@@ -96,13 +96,21 @@ impl ActorSystem {
let (sender, receiver) = channel::<ActorMessage<A::Message>>();
let handle = ActorHandle { sender };
let handle_for_init = handle.clone();
let mut actor = actor;
self.thread_pool.execute(move || {
init(&mut actor, handle_for_init);
actor.on_start();
Self::run_actor_loop(&mut actor, receiver);
actor.on_stop();
});
let spawned = thread::Builder::new()
.name("soulseek-actor".to_string())
.stack_size(ACTOR_STACK_SIZE)
.spawn(move || {
init(&mut actor, handle_for_init);
actor.on_start();
Self::run_actor_loop(&mut actor, receiver);
actor.on_stop();
});
if let Err(e) = spawned {
error!("[actor_system] failed to spawn actor thread: {}", e);
}
handle
}
@@ -153,6 +161,7 @@ impl ActorSystem {
#[cfg(test)]
mod tests {
use super::*;
use std::sync::Arc;
use std::sync::atomic::{AtomicUsize, Ordering};
struct CounterActor {
@@ -177,8 +186,7 @@ mod tests {
#[test]
fn test_actor_system() {
let thread_pool = Arc::new(ThreadPool::new(4));
let system = ActorSystem::new(thread_pool.clone());
let system = ActorSystem::new();
let count = Arc::new(AtomicUsize::new(0));
let actor = CounterActor {
@@ -201,8 +209,39 @@ mod tests {
// Give actor time to process the stop message
std::thread::sleep(Duration::from_millis(100));
}
// Drop the thread pool explicitly to wait for all threads
drop(thread_pool);
// Actors must not be capped by a worker count: every peer runs one, and a
// cap silently strands every peer past it. Far more actors than cores must
// all make progress concurrently.
#[test]
fn far_more_actors_than_cores_all_run() {
let system = ActorSystem::new();
let count = Arc::new(AtomicUsize::new(0));
let handles: Vec<_> = (0..256)
.map(|_| {
system.spawn(CounterActor {
count: count.clone(),
})
})
.collect();
for handle in &handles {
handle.send(1).unwrap();
}
let deadline = Instant::now() + Duration::from_secs(10);
while count.load(Ordering::SeqCst) < 256 && Instant::now() < deadline {
std::thread::sleep(Duration::from_millis(20));
}
assert_eq!(
count.load(Ordering::SeqCst),
256,
"every actor should have processed its message"
);
for handle in &handles {
handle.stop().unwrap();
}
}
}
+9 -14
View File
@@ -295,6 +295,14 @@ impl PeerActor {
}
}
/// A peer offers us a file. Record the peer's transfer token with the
/// client, and let *that* step send the TransferResponse.
///
/// The response is what invites the peer's file connection, and that
/// connection is matched by the peer's token — so replying here would race
/// the client loop that records the token. Under load the client loop is
/// the one that loses, the file connection finds no download, and the
/// transfer is dropped with the download stuck on Queued forever.
fn handle_transfer_request(&self, transfer: Transfer) {
let username = self.peer_username();
debug!("[peer:{}] TransferRequest for {}", username, transfer.token);
@@ -302,7 +310,7 @@ impl PeerActor {
if let Err(e) =
self.client_channel
.send(ClientOperation::UpdateDownloadTokens(
transfer.clone(),
transfer,
username.clone(),
))
{
@@ -311,19 +319,6 @@ impl PeerActor {
username, e
);
}
let transfer_response =
MessageFactory::build_transfer_response_message(transfer);
if let Some(ref handle) = self.self_handle
&& let Err(e) =
handle.send(PeerMessage::SendMessage(transfer_response))
{
error!(
"[peer:{}] Failed to send TransferResponse message: {}",
username, e
);
}
}
fn handle_transfer_response(
+1 -3
View File
@@ -215,14 +215,12 @@ mod tests {
use super::PeerRegistry;
use crate::actor::ActorSystem;
use crate::peer::{ConnectionType, Peer};
use crate::utils::thread_pool::ThreadPool;
use std::net::{TcpListener, TcpStream};
use std::sync::Arc;
#[test]
fn remove_peer_if_respects_actor_identity() {
let pool = Arc::new(ThreadPool::new(2));
let system = Arc::new(ActorSystem::new(pool));
let system = Arc::new(ActorSystem::new());
let (tx, _rx) = std::sync::mpsc::channel();
let registry = PeerRegistry::new(system, tx, "me".to_string());