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 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485
//! A worker pool collectively handling a set of connections. //! //! This crate is written for the use-case where a server is listening for connections, and wants //! to spread the load of handling accepted connections across multiple threads. Specifically, this //! crate implements a worker pool that shares a single `mio::Poll` instance, and collectively //! accept new connections and handle events for existing ones. //! //! Users will want to start with the `PoolBuilder` struct, which allows creating a new pool from //! anything that can act as a `Listener` (basically, anything that can be polled and accept new //! connections that can themselves be polled; e.g., `mio::net::TcpListener`). //! //! # Examples //! //! ``` //! # extern crate mio; //! # extern crate mio_pool; //! # use mio_pool::PoolBuilder; //! # fn main() { //! use std::io::prelude::*; //! //! let addr = "127.0.0.1:0".parse().unwrap(); //! let server = mio::net::TcpListener::bind(&addr).unwrap(); //! let addr = server.local_addr().unwrap(); //! let pool = PoolBuilder::from(server).unwrap(); //! let h = pool.run(1 /* # workers */, |c: &mut mio::net::TcpStream, s: &mut Vec<u8>| { //! // new data is available on the connection `c`! //! let mut buf = [0u8; 1024]; //! //! // let's just echo back what we read //! let n = c.read(&mut buf)?; //! if n == 0 { //! return Ok(true); //! } //! c.write_all(&buf[..n])?; //! //! // keep some internal state //! s.extend(&buf[..n]); //! //! // assume there could be more data //! Ok(false) //! }); //! //! // new clients can now connect on `addr` //! use std::net::TcpStream; //! let mut c = TcpStream::connect(&addr).unwrap(); //! c.write_all(b"hello world").unwrap(); //! let mut buf = [0u8; 1024]; //! let n = c.read(&mut buf).unwrap(); //! assert_eq!(&buf[..n], b"hello world"); //! //! // we can terminate the pool at any time //! let results = h.terminate(); //! // results here contains the final state of each worker in the pool. //! // that is, the final value in each `s` passed to the closure in `run`. //! let result = results.into_iter().next().unwrap(); //! assert_eq!(&result.unwrap(), b"hello world"); //! # } //! ``` #![deny(missing_docs)] extern crate mio; extern crate slab; use std::io; use std::thread; use std::time::Duration; use std::sync::{atomic, Arc, Mutex}; use mio::*; use slab::Slab; const NO_EXIT: usize = 0; const EXIT_IMMEDIATE: usize = 1; const EXIT_EVENTUALLY: usize = 2; /// Used to configure a mio pool before launching it. /// /// Users will want to call `PoolBuilder::from` to start a new pool from a `Listener`, and then /// `PoolBuilder::run` to begin accepting and handling connections. /// /// # Examples /// /// ``` /// # extern crate mio; /// # extern crate mio_pool; /// # use mio_pool::PoolBuilder; /// # fn main() { /// let addr = "127.0.0.1:0".parse().unwrap(); /// let server = mio::net::TcpListener::bind(&addr).unwrap(); /// let pool = PoolBuilder::from(server).unwrap(); /// let h = pool.run(1 /* # workers */, |c: &mut mio::net::TcpStream, s: &mut ()| { /// use std::io::prelude::*; /// let mut buf = [0u8; 1024]; /// let n = c.read(&mut buf)?; /// if n == 0 { /// return Ok(true); /// } /// c.write_all(&buf[..n])?; /// Ok(false) /// }); /// /// // ... /// // during this period, new clients can connect /// // ... /// /// let results = h.terminate(); /// // results here contains the final state of each worker in the pool. /// // that is, the final value in each `s` passed to the closure in `run`. /// let result = results.into_iter().next().unwrap(); /// assert_eq!(result.unwrap(), ()); /// # } /// ``` pub struct PoolBuilder<L> where L: Listener, { listener: Arc<L>, epoch: Arc<atomic::AtomicUsize>, exit: Arc<atomic::AtomicUsize>, poll: Arc<Poll>, } /// Types that implement `Listener` are mio-pollable, and can accept new connections that are /// themselves mio-pollable. pub trait Listener: Evented + Sync + Send { /// The type of connections yielded by `accept`. type Connection: Evented + Send; /// Accept a new connection. /// /// This method will only be called when `mio::Ready::readable` is raised for the `Listener` by /// a `poll`. fn accept(&self) -> io::Result<Self::Connection>; } impl Listener for net::TcpListener { type Connection = net::TcpStream; fn accept(&self) -> io::Result<Self::Connection> { self.accept().map(|(c, _)| c) } } /// This is a bit of a hack, but allows mutable access to the underlying channels. /// /// Specifically, since EPOLL_ONESHOT (should) guarantee that only one thread is woken up when /// there's an event on a given socket, and we ensure that no thread touches a connection after it /// re-registers it, we know that a thread that is woken up for a given connection has exclusive /// access to that connection. This means that we are okay to hand out an `&mut C` to the /// `on_ready` function, since it cannot leak that mutable reference anywhere. struct OneshotConnection<C>(Arc<C>, *mut C); impl<C> Evented for OneshotConnection<C> where C: Evented, { fn register( &self, poll: &Poll, token: Token, interest: Ready, opts: PollOpt, ) -> io::Result<()> { self.0.register(poll, token, interest, opts) } fn reregister( &self, poll: &Poll, token: Token, interest: Ready, opts: PollOpt, ) -> io::Result<()> { self.0.reregister(poll, token, interest, opts) } fn deregister(&self, poll: &Poll) -> io::Result<()> { self.0.deregister(poll) } } impl<C> OneshotConnection<C> { pub fn new(conn: C) -> Self { let mut conn = Arc::new(conn); let c = { Arc::get_mut(&mut conn).unwrap() as *mut _ }; OneshotConnection(conn, c) } unsafe fn mut_given_epoll_oneshot<'a>(&'a self) -> &'a mut C { &mut *self.1 } } unsafe impl<C> Send for OneshotConnection<C> where C: Send, { } // This is *only* okay because no two threads should ever be referencing a given connection at the // same time. unsafe impl<C> Sync for OneshotConnection<C> where C: Send, { } impl<L> PoolBuilder<L> where L: 'static + Listener, { /// Prepare a new pool from the given listener. /// /// The pool will monitor the listener for new connections, and distribute the task of /// accepting them, and handling requests to accepted connections, among a pool of threads. pub fn from(listener: L) -> io::Result<Self> { let poll = Poll::new()?; poll.register( &listener, Token(0), Ready::readable(), PollOpt::level() | PollOpt::oneshot(), )?; Ok(PoolBuilder { listener: Arc::new(listener), epoch: Arc::new(atomic::AtomicUsize::new(1)), poll: Arc::new(poll), exit: Arc::new(atomic::AtomicUsize::new(NO_EXIT)), }) } /// Run the pool with a custom adapter for every newly accepted connection. /// /// This method behaves the same as `PoolBuilder::run`, except that a function for adapting /// accepted connections before using them can also be specified. This allows users to wrap /// something akin to an `TcpStream` into a more sophisticated connection type (e.g., by adding /// buffering). pub fn run_with_adapter<A, C, F, R>( self, workers: usize, adapter: A, on_ready: F, ) -> PoolHandle<R> where A: Fn(L::Connection) -> C + 'static + Send + Sync, C: Evented + Send + 'static, F: Fn(&mut C, &mut R) -> io::Result<bool> + 'static + Send + Sync, R: 'static + Default + Send, { let truth = Arc::new(Mutex::new(Slab::new())); let adapter = Arc::new(adapter); let on_ready = Arc::new(on_ready); let wrkrs: Vec<_> = (0..workers) .map(|i| { worker_main( i, &self, Arc::clone(&truth), Arc::clone(&adapter), Arc::clone(&on_ready), ) }) .collect(); PoolHandle { threads: wrkrs, exit: self.exit, } } /// Start accepting and handling connections using this pool. /// /// The pool will consist of `workers` worker threads that each accept new connections and /// handle requests arriving at existing ones. Every time a connection has available data, /// `on_ready` will be called by one of the workers. A connection will stay in the pool until /// `on_ready` returns an error, or `Ok(true)` indicating EOF. /// /// Each worker also has local state of type `R`. This state can be mutated by `on_ready`, and /// is returned when the pool exits. pub fn run<F, R>(self, workers: usize, on_ready: F) -> PoolHandle<R> where F: Fn(&mut L::Connection, &mut R) -> io::Result<bool> + 'static + Send + Sync, R: 'static + Default + Send, { self.run_with_adapter(workers, |c| c, on_ready) } } /// A handle to a currently executing mio pool. /// /// This handle can be used to terminate the running pool, and to wait for its completion. /// See `PoolHandle::terminate` and `PoolHandle::wait` for details. pub struct PoolHandle<R> { threads: Vec<thread::JoinHandle<R>>, exit: Arc<atomic::AtomicUsize>, } impl<R> PoolHandle<R> { /// Tell all running workers to terminate, and then wait for their completion. /// /// Note that this will *not* wait for existing connections to terminate, but termination may /// be delayed until the next time each worker is idle. pub fn terminate(self) -> Vec<thread::Result<R>> { self.exit.store(EXIT_IMMEDIATE, atomic::Ordering::SeqCst); self.wait() } /// Stop accepting connections and wait for existing connections to complete. /// /// This method will tell worker threads not to accept new connetions, and to exit once all /// current connections have been closed. /// /// Note that this method will *not* immediately drop the Listener, so new clients that try to /// connect will hang (i.e., not get a connection refused) until the workers have all exited. pub fn finish(self) -> Vec<thread::Result<R>> { self.exit.store(EXIT_EVENTUALLY, atomic::Ordering::SeqCst); self.wait() } /// Wait for all running workers to terminate. /// /// This method will *not* tell worker threads to exit, and so will only return once when all /// worker threads have crashed (which should not happen in general). Users may instead want to /// use `PoolHandle::terminate`. pub fn wait(self) -> Vec<thread::Result<R>> { self.threads.into_iter().map(|jh| jh.join()).collect() } } fn worker_main<A, C, L, F, R>( _i: usize, pool: &PoolBuilder<L>, truth: Arc<Mutex<Slab<Arc<OneshotConnection<C>>>>>, adapter: Arc<A>, on_ready: Arc<F>, ) -> thread::JoinHandle<R> where A: Fn(L::Connection) -> C + 'static + Send + Sync, C: Evented + Send + 'static, L: 'static + Listener, F: Fn(&mut C, &mut R) -> io::Result<bool> + 'static + Send + Sync, R: 'static + Default + Send, { let mut cache_epoch; let listener = Arc::clone(&pool.listener); let mut cache = { let truth = truth.lock().unwrap(); cache_epoch = pool.epoch.load(atomic::Ordering::SeqCst); truth.clone() }; let poll = Arc::clone(&pool.poll); let epoch = Arc::clone(&pool.epoch); let exit = Arc::clone(&pool.exit); thread::spawn(move || { let mut worker_result = R::default(); let mut events = Events::with_capacity(1); let mut status = NO_EXIT; while status != EXIT_IMMEDIATE { if let Err(e) = poll.poll(&mut events, Some(Duration::from_millis(200))) { if e.kind() == io::ErrorKind::Interrupted { // spurious wakeup continue; } else if e.kind() == io::ErrorKind::TimedOut { // *should* be handled by mio and return Ok() with no events continue; } else { panic!("{}", e); } } status = exit.load(atomic::Ordering::SeqCst); // check our epoch -- we may have a stale truth. // this is important: consider the case where an old connection has been dropped, // retiring token t, and then a new connection has been accepted, and has been assigned // the same token t. we (unaware of this), then get notified about an event for token // t. we *cannot* re-use the old connection for t, but must instead somehow realize // that there is a new connection for t, and that we need to update our truth. // // keep in mind that since we're using EPOLL_ONESHOT, no other thread can currently be // operating on the token we get from poll(), and so as long as we see any changes from // *before* we polled (which is guaranteed by the atomic read), we know that the truth // we end up reading if the epoch has changed must at least contain any changes to t. let cur_epoch = epoch.load(atomic::Ordering::SeqCst); if cur_epoch != cache_epoch || (status == EXIT_EVENTUALLY && cache.is_empty()) { let truth = truth.lock().unwrap(); cache_epoch = epoch.load(atomic::Ordering::SeqCst); cache = truth.clone(); if status == EXIT_EVENTUALLY && truth.is_empty() { break; } } for e in &events { let Token(t) = e.token(); if t == 0 { if status == NO_EXIT { let mut truth = truth.lock().unwrap(); // let's assume we accept at least one connection cache_epoch = 1 + epoch.fetch_add(1, atomic::Ordering::SeqCst); while let Ok(c) = listener.accept() { let c = adapter(c); let c = Arc::new(OneshotConnection::new(c)); // pick a token for this new connection let token = truth.insert(Arc::clone(&c)); // it's fine if some other thread gets notified about this, because they'll // see the updated epoch, and then block trying to update their truth. poll.register( &*c, Token(token + 1), Ready::readable(), PollOpt::level() | PollOpt::oneshot(), ).unwrap(); // also update our cache while we're at it cache = truth.clone(); } // need to re-register listening thread poll.reregister( &*listener, Token(0), Ready::readable(), PollOpt::level() | PollOpt::oneshot(), ).unwrap() } } else { let t = t - 1; let mut closed = false; if let Some(c) = cache.get(t) { let r = { let c = unsafe { c.mut_given_epoll_oneshot() }; on_ready(c, &mut worker_result) }; if let Ok(true) = r { closed = true; } if let Err(e) = r { match e.kind() { io::ErrorKind::BrokenPipe | io::ErrorKind::NotConnected | io::ErrorKind::UnexpectedEof | io::ErrorKind::ConnectionAborted | io::ErrorKind::ConnectionReset => { closed = true; } _ => {} } } if !closed { // need to re-register so we get later events poll.reregister( &**c, Token(t + 1), Ready::readable(), PollOpt::level() | PollOpt::oneshot(), ).unwrap() } } else { // mio is waking us up on a connection that has been dropped? // this shouldn't happen, but does.... //unreachable!(); } if closed { // connection was dropped; update truth let mut truth = truth.lock().unwrap(); cache_epoch = 1 + epoch.fetch_add(1, atomic::Ordering::SeqCst); truth.remove(t); // also update our cache while we're at it cache = truth.clone(); } } } } worker_result }) }