2015-02-06 09:42:57 -08:00
|
|
|
// Copyright 2015 The Rust Project Developers. See the COPYRIGHT
|
|
|
|
|
// file at the top-level directory of this distribution and at
|
|
|
|
|
// http://rust-lang.org/COPYRIGHT.
|
|
|
|
|
//
|
|
|
|
|
// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
|
|
|
|
|
// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
|
|
|
|
|
// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
|
|
|
|
|
// option. This file may not be copied, modified, or distributed
|
|
|
|
|
// except according to those terms.
|
|
|
|
|
|
2016-02-12 00:17:24 -08:00
|
|
|
use prelude::v1::*;
|
2016-02-12 10:29:25 -08:00
|
|
|
use os::windows::prelude::*;
|
2016-02-12 00:17:24 -08:00
|
|
|
|
2016-02-12 10:29:25 -08:00
|
|
|
use ffi::OsStr;
|
|
|
|
|
use path::Path;
|
2015-02-06 09:42:57 -08:00
|
|
|
use io;
|
2016-02-12 10:29:25 -08:00
|
|
|
use mem;
|
|
|
|
|
use rand::{self, Rng};
|
|
|
|
|
use slice;
|
2015-04-14 11:17:47 -07:00
|
|
|
use sys::c;
|
2016-02-12 10:29:25 -08:00
|
|
|
use sys::fs::{File, OpenOptions};
|
2015-04-14 11:17:47 -07:00
|
|
|
use sys::handle::Handle;
|
2015-02-06 09:42:57 -08:00
|
|
|
|
|
|
|
|
////////////////////////////////////////////////////////////////////////////////
|
|
|
|
|
// Anonymous pipes
|
|
|
|
|
////////////////////////////////////////////////////////////////////////////////
|
|
|
|
|
|
|
|
|
|
pub struct AnonPipe {
|
2015-04-14 11:17:47 -07:00
|
|
|
inner: Handle,
|
2015-02-06 09:42:57 -08:00
|
|
|
}
|
|
|
|
|
|
2015-04-03 15:34:15 -07:00
|
|
|
pub fn anon_pipe() -> io::Result<(AnonPipe, AnonPipe)> {
|
2016-02-12 10:29:25 -08:00
|
|
|
// Note that we specifically do *not* use `CreatePipe` here because
|
|
|
|
|
// unfortunately the anonymous pipes returned do not support overlapped
|
|
|
|
|
// operations.
|
|
|
|
|
//
|
|
|
|
|
// Instead, we create a "hopefully unique" name and create a named pipe
|
|
|
|
|
// which has overlapped operations enabled.
|
|
|
|
|
//
|
|
|
|
|
// Once we do this, we connect do it as usual via `CreateFileW`, and then we
|
|
|
|
|
// return those reader/writer halves.
|
|
|
|
|
unsafe {
|
|
|
|
|
let reader;
|
|
|
|
|
let mut name;
|
|
|
|
|
let mut tries = 0;
|
|
|
|
|
loop {
|
|
|
|
|
tries += 1;
|
|
|
|
|
let key: u64 = rand::thread_rng().gen();
|
|
|
|
|
name = format!(r"\\.\pipe\__rust_anonymous_pipe1__.{}.{}",
|
|
|
|
|
c::GetCurrentProcessId(),
|
|
|
|
|
key);
|
|
|
|
|
let wide_name = OsStr::new(&name)
|
|
|
|
|
.encode_wide()
|
|
|
|
|
.chain(Some(0))
|
|
|
|
|
.collect::<Vec<_>>();
|
|
|
|
|
|
|
|
|
|
let handle = c::CreateNamedPipeW(wide_name.as_ptr(),
|
|
|
|
|
c::PIPE_ACCESS_INBOUND |
|
|
|
|
|
c::FILE_FLAG_FIRST_PIPE_INSTANCE |
|
|
|
|
|
c::FILE_FLAG_OVERLAPPED,
|
|
|
|
|
c::PIPE_TYPE_BYTE |
|
|
|
|
|
c::PIPE_READMODE_BYTE |
|
|
|
|
|
c::PIPE_WAIT |
|
|
|
|
|
c::PIPE_REJECT_REMOTE_CLIENTS,
|
|
|
|
|
1,
|
|
|
|
|
4096,
|
|
|
|
|
4096,
|
|
|
|
|
0,
|
|
|
|
|
0 as *mut _);
|
|
|
|
|
|
|
|
|
|
// We pass the FILE_FLAG_FIRST_PIPE_INSTANCE flag above, and we're
|
|
|
|
|
// also just doing a best effort at selecting a unique name. If
|
|
|
|
|
// ERROR_ACCESS_DENIED is returned then it could mean that we
|
|
|
|
|
// accidentally conflicted with an already existing pipe, so we try
|
|
|
|
|
// again.
|
|
|
|
|
//
|
|
|
|
|
// Don't try again too much though as this could also perhaps be a
|
|
|
|
|
// legit error.
|
|
|
|
|
if handle == c::INVALID_HANDLE_VALUE {
|
|
|
|
|
let err = io::Error::last_os_error();
|
|
|
|
|
if tries < 10 &&
|
|
|
|
|
err.raw_os_error() == Some(c::ERROR_ACCESS_DENIED as i32) {
|
|
|
|
|
continue
|
|
|
|
|
}
|
|
|
|
|
return Err(err)
|
|
|
|
|
}
|
|
|
|
|
reader = Handle::new(handle);
|
|
|
|
|
break
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// Connect to the named pipe we just created in write-only mode (also
|
|
|
|
|
// overlapped for async I/O below).
|
|
|
|
|
let mut opts = OpenOptions::new();
|
|
|
|
|
opts.write(true);
|
|
|
|
|
opts.read(false);
|
|
|
|
|
opts.share_mode(0);
|
|
|
|
|
opts.attributes(c::FILE_FLAG_OVERLAPPED);
|
|
|
|
|
let writer = try!(File::open(Path::new(&name), &opts));
|
|
|
|
|
let writer = AnonPipe { inner: writer.into_handle() };
|
|
|
|
|
|
|
|
|
|
Ok((AnonPipe { inner: reader }, AnonPipe { inner: writer.into_handle() }))
|
|
|
|
|
}
|
2015-02-06 09:42:57 -08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
impl AnonPipe {
|
2015-04-14 11:17:47 -07:00
|
|
|
pub fn handle(&self) -> &Handle { &self.inner }
|
2015-07-15 23:31:24 -07:00
|
|
|
pub fn into_handle(self) -> Handle { self.inner }
|
2015-02-06 09:42:57 -08:00
|
|
|
|
|
|
|
|
pub fn read(&self, buf: &mut [u8]) -> io::Result<usize> {
|
2015-04-14 11:17:47 -07:00
|
|
|
self.inner.read(buf)
|
2015-02-06 09:42:57 -08:00
|
|
|
}
|
|
|
|
|
|
2016-02-12 00:17:24 -08:00
|
|
|
pub fn read_to_end(&self, buf: &mut Vec<u8>) -> io::Result<usize> {
|
|
|
|
|
self.inner.read_to_end(buf)
|
|
|
|
|
}
|
|
|
|
|
|
2015-02-06 09:42:57 -08:00
|
|
|
pub fn write(&self, buf: &[u8]) -> io::Result<usize> {
|
2015-04-14 11:17:47 -07:00
|
|
|
self.inner.write(buf)
|
2015-02-06 09:42:57 -08:00
|
|
|
}
|
|
|
|
|
}
|
2016-02-12 10:29:25 -08:00
|
|
|
|
|
|
|
|
pub fn read2(p1: AnonPipe,
|
|
|
|
|
v1: &mut Vec<u8>,
|
|
|
|
|
p2: AnonPipe,
|
|
|
|
|
v2: &mut Vec<u8>) -> io::Result<()> {
|
|
|
|
|
let p1 = p1.into_handle();
|
|
|
|
|
let p2 = p2.into_handle();
|
|
|
|
|
|
|
|
|
|
let mut p1 = try!(AsyncPipe::new(p1, v1));
|
|
|
|
|
let mut p2 = try!(AsyncPipe::new(p2, v2));
|
|
|
|
|
let objs = [p1.event.raw(), p2.event.raw()];
|
|
|
|
|
|
|
|
|
|
// In a loop we wait for either pipe's scheduled read operation to complete.
|
|
|
|
|
// If the operation completes with 0 bytes, that means EOF was reached, in
|
|
|
|
|
// which case we just finish out the other pipe entirely.
|
|
|
|
|
//
|
|
|
|
|
// Note that overlapped I/O is in general super unsafe because we have to
|
|
|
|
|
// be careful to ensure that all pointers in play are valid for the entire
|
|
|
|
|
// duration of the I/O operation (where tons of operations can also fail).
|
|
|
|
|
// The destructor for `AsyncPipe` ends up taking care of most of this.
|
|
|
|
|
loop {
|
|
|
|
|
let res = unsafe {
|
|
|
|
|
c::WaitForMultipleObjects(2, objs.as_ptr(), c::FALSE, c::INFINITE)
|
|
|
|
|
};
|
|
|
|
|
if res == c::WAIT_OBJECT_0 {
|
|
|
|
|
if !try!(p1.result()) || !try!(p1.schedule_read()) {
|
|
|
|
|
return p2.finish()
|
|
|
|
|
}
|
|
|
|
|
} else if res == c::WAIT_OBJECT_0 + 1 {
|
|
|
|
|
if !try!(p2.result()) || !try!(p2.schedule_read()) {
|
|
|
|
|
return p1.finish()
|
|
|
|
|
}
|
|
|
|
|
} else {
|
|
|
|
|
return Err(io::Error::last_os_error())
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
struct AsyncPipe<'a> {
|
|
|
|
|
pipe: Handle,
|
|
|
|
|
event: Handle,
|
|
|
|
|
overlapped: Box<c::OVERLAPPED>, // needs a stable address
|
|
|
|
|
dst: &'a mut Vec<u8>,
|
|
|
|
|
state: State,
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
#[derive(PartialEq, Debug)]
|
|
|
|
|
enum State {
|
|
|
|
|
NotReading,
|
|
|
|
|
Reading,
|
|
|
|
|
Read(usize),
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
impl<'a> AsyncPipe<'a> {
|
|
|
|
|
fn new(pipe: Handle, dst: &'a mut Vec<u8>) -> io::Result<AsyncPipe<'a>> {
|
|
|
|
|
// Create an event which we'll use to coordinate our overlapped
|
|
|
|
|
// opreations, this event will be used in WaitForMultipleObjects
|
|
|
|
|
// and passed as part of the OVERLAPPED handle.
|
|
|
|
|
//
|
|
|
|
|
// Note that we do a somewhat clever thing here by flagging the
|
|
|
|
|
// event as being manually reset and setting it initially to the
|
|
|
|
|
// signaled state. This means that we'll naturally fall through the
|
|
|
|
|
// WaitForMultipleObjects call above for pipes created initially,
|
|
|
|
|
// and the only time an even will go back to "unset" will be once an
|
|
|
|
|
// I/O operation is successfully scheduled (what we want).
|
|
|
|
|
let event = try!(Handle::new_event(true, true));
|
|
|
|
|
let mut overlapped: Box<c::OVERLAPPED> = unsafe {
|
|
|
|
|
Box::new(mem::zeroed())
|
|
|
|
|
};
|
|
|
|
|
overlapped.hEvent = event.raw();
|
|
|
|
|
Ok(AsyncPipe {
|
|
|
|
|
pipe: pipe,
|
|
|
|
|
overlapped: overlapped,
|
|
|
|
|
event: event,
|
|
|
|
|
dst: dst,
|
|
|
|
|
state: State::NotReading,
|
|
|
|
|
})
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/// Executes an overlapped read operation.
|
|
|
|
|
///
|
|
|
|
|
/// Must not currently be reading, and returns whether the pipe is currently
|
|
|
|
|
/// at EOF or not. If the pipe is not at EOF then `result()` must be called
|
|
|
|
|
/// to complete the read later on (may block), but if the pipe is at EOF
|
|
|
|
|
/// then `result()` should not be called as it will just block forever.
|
|
|
|
|
fn schedule_read(&mut self) -> io::Result<bool> {
|
|
|
|
|
assert_eq!(self.state, State::NotReading);
|
|
|
|
|
let amt = unsafe {
|
|
|
|
|
let slice = slice_to_end(self.dst);
|
|
|
|
|
try!(self.pipe.read_overlapped(slice, &mut *self.overlapped))
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
// If this read finished immediately then our overlapped event will
|
|
|
|
|
// remain signaled (it was signaled coming in here) and we'll progress
|
|
|
|
|
// down to the method below.
|
|
|
|
|
//
|
|
|
|
|
// Otherwise the I/O operation is scheduled and the system set our event
|
|
|
|
|
// to not signaled, so we flag ourselves into the reading state and move
|
|
|
|
|
// on.
|
|
|
|
|
self.state = match amt {
|
|
|
|
|
Some(0) => return Ok(false),
|
|
|
|
|
Some(amt) => State::Read(amt),
|
|
|
|
|
None => State::Reading,
|
|
|
|
|
};
|
|
|
|
|
Ok(true)
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/// Wait for the result of the overlapped operation previously executed.
|
|
|
|
|
///
|
|
|
|
|
/// Takes a parameter `wait` which indicates if this pipe is currently being
|
|
|
|
|
/// read whether the function should block waiting for the read to complete.
|
|
|
|
|
///
|
|
|
|
|
/// Return values:
|
|
|
|
|
///
|
|
|
|
|
/// * `true` - finished any pending read and the pipe is not at EOF (keep
|
|
|
|
|
/// going)
|
|
|
|
|
/// * `false` - finished any pending read and pipe is at EOF (stop issuing
|
|
|
|
|
/// reads)
|
|
|
|
|
fn result(&mut self) -> io::Result<bool> {
|
|
|
|
|
let amt = match self.state {
|
|
|
|
|
State::NotReading => return Ok(true),
|
|
|
|
|
State::Reading => {
|
|
|
|
|
try!(self.pipe.overlapped_result(&mut *self.overlapped, true))
|
|
|
|
|
}
|
|
|
|
|
State::Read(amt) => amt,
|
|
|
|
|
};
|
|
|
|
|
self.state = State::NotReading;
|
|
|
|
|
unsafe {
|
|
|
|
|
let len = self.dst.len();
|
|
|
|
|
self.dst.set_len(len + amt);
|
|
|
|
|
}
|
|
|
|
|
Ok(amt != 0)
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/// Finishes out reading this pipe entirely.
|
|
|
|
|
///
|
|
|
|
|
/// Waits for any pending and schedule read, and then calls `read_to_end`
|
|
|
|
|
/// if necessary to read all the remaining information.
|
|
|
|
|
fn finish(&mut self) -> io::Result<()> {
|
|
|
|
|
while try!(self.result()) && try!(self.schedule_read()) {
|
|
|
|
|
// ...
|
|
|
|
|
}
|
|
|
|
|
Ok(())
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
impl<'a> Drop for AsyncPipe<'a> {
|
|
|
|
|
fn drop(&mut self) {
|
|
|
|
|
match self.state {
|
|
|
|
|
State::Reading => {}
|
|
|
|
|
_ => return,
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// If we have a pending read operation, then we have to make sure that
|
|
|
|
|
// it's *done* before we actually drop this type. The kernel requires
|
|
|
|
|
// that the `OVERLAPPED` and buffer pointers are valid for the entire
|
|
|
|
|
// I/O operation.
|
|
|
|
|
//
|
|
|
|
|
// To do that, we call `CancelIo` to cancel any pending operation, and
|
|
|
|
|
// if that succeeds we wait for the overlapped result.
|
|
|
|
|
//
|
|
|
|
|
// If anything here fails, there's not really much we can do, so we leak
|
|
|
|
|
// the buffer/OVERLAPPED pointers to ensure we're at least memory safe.
|
|
|
|
|
if self.pipe.cancel_io().is_err() || self.result().is_err() {
|
|
|
|
|
let buf = mem::replace(self.dst, Vec::new());
|
|
|
|
|
let overlapped = Box::new(unsafe { mem::zeroed() });
|
|
|
|
|
let overlapped = mem::replace(&mut self.overlapped, overlapped);
|
|
|
|
|
mem::forget((buf, overlapped));
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
unsafe fn slice_to_end(v: &mut Vec<u8>) -> &mut [u8] {
|
|
|
|
|
if v.capacity() == 0 {
|
|
|
|
|
v.reserve(16);
|
|
|
|
|
}
|
|
|
|
|
if v.capacity() == v.len() {
|
|
|
|
|
v.reserve(1);
|
|
|
|
|
}
|
|
|
|
|
slice::from_raw_parts_mut(v.as_mut_ptr().offset(v.len() as isize),
|
|
|
|
|
v.capacity() - v.len())
|
|
|
|
|
}
|