2016-09-07 00:13:11 -07:00
|
|
|
extern crate libc;
|
|
|
|
|
extern crate tokio_signal;
|
|
|
|
|
|
|
|
|
|
use std::io;
|
|
|
|
|
use std::os::unix::prelude::*;
|
|
|
|
|
use std::process::{self, ExitStatus};
|
|
|
|
|
|
|
|
|
|
use futures::stream::Stream;
|
|
|
|
|
use futures::{Future, Poll, Async};
|
2016-11-18 20:57:31 +01:00
|
|
|
use tokio_core::reactor::{Handle,PollEvented};
|
2016-09-07 00:13:11 -07:00
|
|
|
use self::libc::c_int;
|
|
|
|
|
use self::tokio_signal::unix::Signal;
|
|
|
|
|
|
2016-12-04 18:47:48 +01:00
|
|
|
use mio;
|
|
|
|
|
use mio::{Evented, PollOpt, Ready, Token};
|
2016-11-18 20:57:31 +01:00
|
|
|
use mio::unix::EventedFd;
|
|
|
|
|
|
2016-09-07 00:13:11 -07:00
|
|
|
use Command;
|
|
|
|
|
|
|
|
|
|
pub struct Child {
|
|
|
|
|
child: process::Child,
|
|
|
|
|
reaped: bool,
|
|
|
|
|
sigchld: Signal,
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/// Spawns a new child process.
|
|
|
|
|
///
|
|
|
|
|
/// Right now the only "fancy" thing about this is how we implement the
|
|
|
|
|
/// `Future` implementation on `Child` to get the exit status. Unix offers
|
|
|
|
|
/// no way to register a child with epoll, and the only real way to get a
|
|
|
|
|
/// notification when a process exits is the SIGCHLD signal.
|
|
|
|
|
///
|
|
|
|
|
/// Signal handling in general is *super* hairy and complicated, and it's even
|
|
|
|
|
/// more complicated here with the fact that signals are coalesced, so we may
|
|
|
|
|
/// not get a SIGCHLD-per-child.
|
|
|
|
|
///
|
|
|
|
|
/// Our best approximation here is to check *all spawned processes* for all
|
|
|
|
|
/// SIGCHLD signals received. To do that we create a `Signal`, implemented in
|
|
|
|
|
/// the `tokio-signal` crate, which is a stream over signals being received.
|
|
|
|
|
///
|
|
|
|
|
/// Later when we poll the process's exit status we simply check to see if a
|
|
|
|
|
/// SIGCHLD has happened since we last checked, and while that returns "yes" we
|
|
|
|
|
/// keep trying.
|
|
|
|
|
///
|
|
|
|
|
/// Note that this means that this isn't really scalable, but then again
|
|
|
|
|
/// processes in general aren't scalable (e.g. millions) so it shouldn't be that
|
|
|
|
|
/// bad in theory...
|
2016-12-12 00:34:07 -08:00
|
|
|
pub fn spawn(mut cmd: Command) -> Box<Future<Item=::Child, Error=io::Error>> {
|
|
|
|
|
struct KillOnDrop(Option<process::Child>);
|
|
|
|
|
|
|
|
|
|
impl Drop for KillOnDrop {
|
|
|
|
|
fn drop(&mut self) {
|
|
|
|
|
if let Some(mut c) = self.0.take() {
|
|
|
|
|
drop(c.kill());
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2016-09-07 00:13:11 -07:00
|
|
|
Box::new(Signal::new(libc::SIGCHLD, &cmd.handle).and_then(move |sigchld| {
|
2016-11-18 20:57:31 +01:00
|
|
|
cmd.inner.spawn().and_then(|mut c| {
|
2016-12-12 00:34:07 -08:00
|
|
|
let stdin = c.stdin.take();
|
|
|
|
|
let stdout = c.stdout.take();
|
|
|
|
|
let stderr = c.stderr.take();
|
|
|
|
|
let mut c = KillOnDrop(Some(c));
|
|
|
|
|
let stdin = try!(stdio(stdin, &cmd.handle));
|
|
|
|
|
let stdout = try!(stdio(stdout, &cmd.handle));
|
|
|
|
|
let stderr = try!(stdio(stderr, &cmd.handle));
|
|
|
|
|
Ok(::Child {
|
|
|
|
|
inner: Child {
|
|
|
|
|
child: c.0.take().unwrap(),
|
|
|
|
|
reaped: false,
|
|
|
|
|
sigchld: sigchld,
|
|
|
|
|
},
|
|
|
|
|
stdin: stdin.map(|io| ::ChildStdin { inner: io }),
|
|
|
|
|
stdout: stdout.map(|io| ::ChildStdout { inner: io }),
|
|
|
|
|
stderr: stderr.map(|io| ::ChildStderr { inner: io }),
|
2016-11-18 20:57:31 +01:00
|
|
|
})
|
2016-09-07 00:13:11 -07:00
|
|
|
})
|
|
|
|
|
}))
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
impl Child {
|
|
|
|
|
pub fn id(&self) -> u32 {
|
|
|
|
|
self.child.id()
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
pub fn kill(&mut self) -> io::Result<()> {
|
|
|
|
|
if self.reaped {
|
|
|
|
|
Ok(())
|
|
|
|
|
} else {
|
|
|
|
|
self.child.kill()
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
impl Future for Child {
|
|
|
|
|
type Item = ExitStatus;
|
|
|
|
|
type Error = io::Error;
|
|
|
|
|
|
|
|
|
|
fn poll(&mut self) -> Poll<ExitStatus, io::Error> {
|
|
|
|
|
assert!(!self.reaped);
|
|
|
|
|
loop {
|
|
|
|
|
// Ensure that once we've successfully waited we won't try to
|
|
|
|
|
// `kill` above.
|
|
|
|
|
if let Some(e) = try!(try_wait(&self.child)) {
|
|
|
|
|
self.reaped = true;
|
|
|
|
|
return Ok(e.into())
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// If the child hasn't exited yet, then it's our responsibility to
|
|
|
|
|
// ensure the current task gets notified when it might be able to
|
|
|
|
|
// make progress.
|
|
|
|
|
//
|
|
|
|
|
// As described in `spawn` above, we just indicate that we can
|
|
|
|
|
// next make progress once a SIGCHLD is received.
|
|
|
|
|
if try!(self.sigchld.poll()).is_not_ready() {
|
|
|
|
|
return Ok(Async::NotReady)
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
pub fn try_wait(child: &process::Child) -> io::Result<Option<ExitStatus>> {
|
|
|
|
|
let id = child.id() as c_int;
|
|
|
|
|
let mut status = 0;
|
|
|
|
|
loop {
|
|
|
|
|
match unsafe { libc::waitpid(id, &mut status, libc::WNOHANG) } {
|
|
|
|
|
0 => return Ok(None),
|
|
|
|
|
n if n < 0 => {
|
|
|
|
|
let err = io::Error::last_os_error();
|
|
|
|
|
if err.kind() == io::ErrorKind::Interrupted {
|
|
|
|
|
continue
|
|
|
|
|
}
|
|
|
|
|
return Err(err)
|
|
|
|
|
}
|
|
|
|
|
n => {
|
|
|
|
|
assert_eq!(n, id);
|
|
|
|
|
return Ok(Some(ExitStatus::from_raw(status)))
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
2016-12-12 00:34:07 -08:00
|
|
|
|
|
|
|
|
pub struct Fd<T>(T);
|
|
|
|
|
|
|
|
|
|
impl<T: io::Read> io::Read for Fd<T> {
|
|
|
|
|
fn read(&mut self, bytes: &mut [u8]) -> io::Result<usize> {
|
|
|
|
|
self.0.read(bytes)
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
impl<T: io::Write> io::Write for Fd<T> {
|
|
|
|
|
fn write(&mut self, bytes: &[u8]) -> io::Result<usize> {
|
|
|
|
|
self.0.write(bytes)
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
fn flush(&mut self) -> io::Result<()> {
|
|
|
|
|
self.0.flush()
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
pub type ChildStdin = PollEvented<Fd<process::ChildStdin>>;
|
|
|
|
|
pub type ChildStdout = PollEvented<Fd<process::ChildStdout>>;
|
|
|
|
|
pub type ChildStderr = PollEvented<Fd<process::ChildStderr>>;
|
|
|
|
|
|
|
|
|
|
impl<T> Evented for Fd<T> where T: AsRawFd {
|
|
|
|
|
fn register(&self,
|
|
|
|
|
poll: &mio::Poll,
|
|
|
|
|
token: Token,
|
|
|
|
|
interest: Ready,
|
|
|
|
|
opts: PollOpt)
|
|
|
|
|
-> io::Result<()> {
|
|
|
|
|
EventedFd(&self.0.as_raw_fd()).register(poll,
|
|
|
|
|
token,
|
|
|
|
|
interest | Ready::hup(),
|
|
|
|
|
opts)
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
fn reregister(&self,
|
|
|
|
|
poll: &mio::Poll,
|
|
|
|
|
token: Token,
|
|
|
|
|
interest: Ready,
|
|
|
|
|
opts: PollOpt)
|
|
|
|
|
-> io::Result<()> {
|
|
|
|
|
EventedFd(&self.0.as_raw_fd()).reregister(poll,
|
|
|
|
|
token,
|
|
|
|
|
interest | Ready::hup(),
|
|
|
|
|
opts)
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
fn deregister(&self, poll: &mio::Poll) -> io::Result<()> {
|
|
|
|
|
EventedFd(&self.0.as_raw_fd()).deregister(poll)
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
fn stdio<T>(option: Option<T>, handle: &Handle)
|
|
|
|
|
-> io::Result<Option<PollEvented<Fd<T>>>>
|
|
|
|
|
where T: AsRawFd
|
|
|
|
|
{
|
|
|
|
|
let io = match option {
|
|
|
|
|
Some(io) => io,
|
|
|
|
|
None => return Ok(None),
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
// Set the fd to nonblocking before we pass it to the event loop
|
|
|
|
|
unsafe {
|
|
|
|
|
let fd = io.as_raw_fd();
|
|
|
|
|
let r = libc::fcntl(fd, libc::F_GETFL);
|
|
|
|
|
if r == -1 {
|
|
|
|
|
return Err(io::Error::last_os_error())
|
|
|
|
|
}
|
|
|
|
|
let r = libc::fcntl(fd, libc::F_SETFL, r | libc::O_NONBLOCK);
|
|
|
|
|
if r == -1 {
|
|
|
|
|
return Err(io::Error::last_os_error())
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
let io = try!(PollEvented::new(Fd(io), handle));
|
|
|
|
|
Ok(Some(io))
|
|
|
|
|
}
|