2014-02-28 18:15:24 +08:00
|
|
|
/** \file io.c
|
2005-10-08 19:20:51 +08:00
|
|
|
|
|
|
|
Utilities for io redirection.
|
2012-11-18 18:23:22 +08:00
|
|
|
|
2005-10-08 19:20:51 +08:00
|
|
|
*/
|
|
|
|
#include "config.h"
|
|
|
|
|
2006-02-28 21:17:16 +08:00
|
|
|
|
2005-10-08 19:20:51 +08:00
|
|
|
#include <stdlib.h>
|
|
|
|
#include <stdio.h>
|
|
|
|
#include <wchar.h>
|
|
|
|
#include <string.h>
|
|
|
|
#include <errno.h>
|
|
|
|
#include <sys/types.h>
|
2012-08-15 15:57:56 +08:00
|
|
|
#include <set>
|
|
|
|
#include <algorithm>
|
2006-08-10 06:53:38 +08:00
|
|
|
|
|
|
|
#ifdef HAVE_SYS_IOCTL_H
|
2005-10-08 19:20:51 +08:00
|
|
|
#include <sys/ioctl.h>
|
2006-08-10 06:53:38 +08:00
|
|
|
#endif
|
|
|
|
|
2005-10-08 19:20:51 +08:00
|
|
|
#include <unistd.h>
|
|
|
|
#include <fcntl.h>
|
|
|
|
|
|
|
|
#if HAVE_NCURSES_H
|
|
|
|
#include <ncurses.h>
|
|
|
|
#else
|
|
|
|
#include <curses.h>
|
|
|
|
#endif
|
|
|
|
|
2006-01-19 20:22:07 +08:00
|
|
|
#if HAVE_TERM_H
|
2005-10-08 19:20:51 +08:00
|
|
|
#include <term.h>
|
2006-01-19 20:22:07 +08:00
|
|
|
#elif HAVE_NCURSES_TERM_H
|
|
|
|
#include <ncurses/term.h>
|
|
|
|
#endif
|
2005-10-08 19:20:51 +08:00
|
|
|
|
2006-02-28 21:17:16 +08:00
|
|
|
#include "fallback.h"
|
2005-10-08 19:20:51 +08:00
|
|
|
#include "util.h"
|
2006-02-28 21:17:16 +08:00
|
|
|
|
2005-10-08 19:20:51 +08:00
|
|
|
#include "wutil.h"
|
|
|
|
#include "exec.h"
|
|
|
|
#include "common.h"
|
|
|
|
#include "io.h"
|
2006-07-20 06:55:49 +08:00
|
|
|
|
2005-10-08 19:20:51 +08:00
|
|
|
|
2013-01-15 17:39:20 +08:00
|
|
|
io_data_t::~io_data_t()
|
2013-01-09 15:49:12 +08:00
|
|
|
{
|
|
|
|
}
|
|
|
|
|
2013-01-09 16:02:04 +08:00
|
|
|
void io_close_t::print() const
|
|
|
|
{
|
|
|
|
fprintf(stderr, "close %d\n", fd);
|
|
|
|
}
|
|
|
|
|
2013-01-15 15:37:33 +08:00
|
|
|
void io_fd_t::print() const
|
|
|
|
{
|
|
|
|
fprintf(stderr, "FD map %d -> %d\n", old_fd, fd);
|
|
|
|
}
|
|
|
|
|
2013-01-15 16:18:03 +08:00
|
|
|
void io_file_t::print() const
|
|
|
|
{
|
|
|
|
fprintf(stderr, "file (%s)\n", filename_cstr);
|
|
|
|
}
|
|
|
|
|
2013-01-15 17:31:36 +08:00
|
|
|
void io_pipe_t::print() const
|
|
|
|
{
|
2013-01-16 11:55:57 +08:00
|
|
|
fprintf(stderr, "pipe {%d, %d} (input: %s)\n", pipe_fd[0], pipe_fd[1],
|
|
|
|
is_input ? "yes" : "no");
|
2013-01-15 17:31:36 +08:00
|
|
|
}
|
|
|
|
|
2013-01-15 16:44:31 +08:00
|
|
|
void io_buffer_t::print() const
|
|
|
|
{
|
2013-01-16 11:55:57 +08:00
|
|
|
fprintf(stderr, "buffer %p (input: %s, size %lu)\n", out_buffer_ptr(),
|
2013-11-25 23:10:14 +08:00
|
|
|
is_input ? "yes" : "no", (unsigned long) out_buffer_size());
|
2013-01-15 16:44:31 +08:00
|
|
|
}
|
|
|
|
|
2013-01-15 17:10:40 +08:00
|
|
|
void io_buffer_t::read()
|
2005-10-08 19:20:51 +08:00
|
|
|
{
|
2013-01-15 17:31:36 +08:00
|
|
|
exec_close(pipe_fd[1]);
|
2012-11-18 18:23:22 +08:00
|
|
|
|
2013-01-15 17:10:40 +08:00
|
|
|
if (io_mode == IO_BUFFER)
|
2012-11-18 18:23:22 +08:00
|
|
|
{
|
2013-01-15 17:31:36 +08:00
|
|
|
/* if( fcntl( pipe_fd[0], F_SETFL, 0 ) )
|
2012-11-19 08:30:30 +08:00
|
|
|
{
|
|
|
|
wperror( L"fcntl" );
|
|
|
|
return;
|
|
|
|
} */
|
2013-01-15 17:31:36 +08:00
|
|
|
debug(4, L"io_buffer_t::read: blocking read on fd %d", pipe_fd[0]);
|
2012-11-19 08:30:30 +08:00
|
|
|
while (1)
|
2012-11-18 18:23:22 +08:00
|
|
|
{
|
2012-11-19 08:30:30 +08:00
|
|
|
char b[4096];
|
|
|
|
long l;
|
2013-01-15 17:31:36 +08:00
|
|
|
l=read_blocked(pipe_fd[0], b, 4096);
|
2012-11-19 08:30:30 +08:00
|
|
|
if (l==0)
|
|
|
|
{
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
else if (l<0)
|
|
|
|
{
|
|
|
|
/*
|
|
|
|
exec_read_io_buffer is only called on jobs that have
|
|
|
|
exited, and will therefore never block. But a broken
|
|
|
|
pipe seems to cause some flags to reset, causing the
|
|
|
|
EOF flag to not be set. Therefore, EAGAIN is ignored
|
|
|
|
and we exit anyway.
|
|
|
|
*/
|
|
|
|
if (errno != EAGAIN)
|
|
|
|
{
|
|
|
|
debug(1,
|
|
|
|
_(L"An error occured while reading output from code block on file descriptor %d"),
|
2013-01-15 17:31:36 +08:00
|
|
|
pipe_fd[0]);
|
2013-01-15 17:10:40 +08:00
|
|
|
wperror(L"io_buffer_t::read");
|
2012-11-19 08:30:30 +08:00
|
|
|
}
|
2012-11-18 18:23:22 +08:00
|
|
|
|
2012-11-19 08:30:30 +08:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2013-01-15 17:10:40 +08:00
|
|
|
out_buffer_append(b, l);
|
2012-11-19 08:30:30 +08:00
|
|
|
}
|
|
|
|
}
|
2012-11-18 18:23:22 +08:00
|
|
|
}
|
2005-10-08 19:20:51 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2014-03-16 10:49:55 +08:00
|
|
|
io_buffer_t *io_buffer_t::create(int fd)
|
2005-10-08 19:20:51 +08:00
|
|
|
{
|
2012-08-15 15:57:56 +08:00
|
|
|
bool success = true;
|
2014-03-16 10:49:55 +08:00
|
|
|
assert(fd >= 0);
|
|
|
|
io_buffer_t *buffer_redirect = new io_buffer_t(fd);
|
2012-11-19 08:30:30 +08:00
|
|
|
|
2013-01-15 17:31:36 +08:00
|
|
|
if (exec_pipe(buffer_redirect->pipe_fd) == -1)
|
2012-11-19 08:30:30 +08:00
|
|
|
{
|
|
|
|
debug(1, PIPE_ERROR);
|
|
|
|
wperror(L"pipe");
|
|
|
|
success = false;
|
|
|
|
}
|
2013-04-08 03:40:08 +08:00
|
|
|
else if (make_fd_nonblocking(buffer_redirect->pipe_fd[0]) != 0)
|
2012-11-19 08:30:30 +08:00
|
|
|
{
|
|
|
|
debug(1, PIPE_ERROR);
|
|
|
|
wperror(L"fcntl");
|
|
|
|
success = false;
|
|
|
|
}
|
2012-11-18 18:23:22 +08:00
|
|
|
|
2012-08-15 15:57:56 +08:00
|
|
|
if (! success)
|
|
|
|
{
|
|
|
|
delete buffer_redirect;
|
|
|
|
buffer_redirect = NULL;
|
|
|
|
}
|
2013-01-30 18:22:38 +08:00
|
|
|
else
|
|
|
|
{
|
|
|
|
//fprintf(stderr, "Created pipes {%d, %d} for %p\n", buffer_redirect->pipe_fd[0], buffer_redirect->pipe_fd[1], buffer_redirect);
|
|
|
|
}
|
2012-11-18 18:23:22 +08:00
|
|
|
|
2012-11-19 08:30:30 +08:00
|
|
|
return buffer_redirect;
|
2005-10-08 19:20:51 +08:00
|
|
|
}
|
|
|
|
|
2013-01-15 17:02:46 +08:00
|
|
|
io_buffer_t::~io_buffer_t()
|
2005-10-08 19:20:51 +08:00
|
|
|
{
|
2006-11-12 20:16:13 +08:00
|
|
|
|
2013-01-30 18:22:38 +08:00
|
|
|
//fprintf(stderr, "Deallocating pipes {%d, %d} for %p\n", this->pipe_fd[0], this->pipe_fd[1], this);
|
2012-11-19 08:30:30 +08:00
|
|
|
/**
|
|
|
|
If this is an input buffer, then io_read_buffer will not have
|
|
|
|
been called, and we need to close the output fd as well.
|
|
|
|
*/
|
2013-01-30 18:22:38 +08:00
|
|
|
if (is_input && pipe_fd[1] >= 0)
|
2012-11-19 08:30:30 +08:00
|
|
|
{
|
2013-01-15 17:31:36 +08:00
|
|
|
exec_close(pipe_fd[1]);
|
2012-11-19 08:30:30 +08:00
|
|
|
}
|
|
|
|
|
2013-01-30 18:22:38 +08:00
|
|
|
if (pipe_fd[0] >= 0)
|
|
|
|
{
|
|
|
|
exec_close(pipe_fd[0]);
|
|
|
|
}
|
2012-11-19 08:30:30 +08:00
|
|
|
|
|
|
|
/*
|
|
|
|
Dont free fd for writing. This should already be free'd before
|
|
|
|
calling exec_read_io_buffer on the buffer
|
|
|
|
*/
|
2005-10-08 19:20:51 +08:00
|
|
|
}
|
|
|
|
|
2013-01-07 23:04:55 +08:00
|
|
|
void io_chain_t::remove(const shared_ptr<const io_data_t> &element)
|
2012-08-15 15:57:56 +08:00
|
|
|
{
|
|
|
|
// See if you can guess why std::find doesn't work here
|
|
|
|
for (io_chain_t::iterator iter = this->begin(); iter != this->end(); ++iter)
|
|
|
|
{
|
|
|
|
if (*iter == element)
|
|
|
|
{
|
|
|
|
this->erase(iter);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2005-10-08 19:20:51 +08:00
|
|
|
|
2013-01-30 18:22:38 +08:00
|
|
|
void io_chain_t::push_back(const shared_ptr<io_data_t> &element)
|
|
|
|
{
|
|
|
|
// Ensure we never push back NULL
|
|
|
|
assert(element.get() != NULL);
|
2013-02-23 05:20:27 +08:00
|
|
|
std::vector<shared_ptr<io_data_t> >::push_back(element);
|
2013-01-30 18:22:38 +08:00
|
|
|
}
|
|
|
|
|
2013-08-19 07:55:01 +08:00
|
|
|
void io_chain_t::push_front(const shared_ptr<io_data_t> &element)
|
|
|
|
{
|
|
|
|
assert(element.get() != NULL);
|
|
|
|
this->insert(this->begin(), element);
|
|
|
|
}
|
|
|
|
|
Big fat refactoring of how redirections work. In fish 1.x and 2.0.0, the redirections for a process were flattened into a big list associated with the job, so there was no way to tell which redirections applied to each process. Each process therefore got all the redirections associated with the job. See https://github.com/fish-shell/fish-shell/issues/877 for how this could manifest.
With this change, jobs only track their block-level redirections. Process level redirections are correctly associated with the process, and at exec time we stitch them together (block, pipe, and process redirects).
This fixes the weird issues where redirects bleed across pipelines (like #877), and also allows us to play with the order in which redirections are applied, since the final list is constructed right before it's needed. This lets us put pipes after block level redirections but before process level redirections, so that a 2>&1-type redirection gets picked up after the pipe, i.e. it should fix https://github.com/fish-shell/fish-shell/issues/110
This is a significant change. The tests all pass. Cross your fingers.
2013-08-20 07:16:41 +08:00
|
|
|
void io_chain_t::append(const io_chain_t &chain)
|
|
|
|
{
|
|
|
|
this->insert(this->end(), chain.begin(), chain.end());
|
|
|
|
}
|
|
|
|
|
2013-01-07 23:04:55 +08:00
|
|
|
void io_remove(io_chain_t &list, const shared_ptr<const io_data_t> &element)
|
2005-10-08 19:20:51 +08:00
|
|
|
{
|
2012-08-15 15:57:56 +08:00
|
|
|
list.remove(element);
|
|
|
|
}
|
2005-10-08 19:20:51 +08:00
|
|
|
|
2012-08-15 15:57:56 +08:00
|
|
|
void io_print(const io_chain_t &chain)
|
2005-10-08 19:20:51 +08:00
|
|
|
{
|
2012-08-15 15:57:56 +08:00
|
|
|
if (chain.empty())
|
|
|
|
{
|
|
|
|
fprintf(stderr, "Empty chain %p\n", &chain);
|
|
|
|
return;
|
|
|
|
}
|
2012-11-18 18:23:22 +08:00
|
|
|
|
2012-08-15 15:57:56 +08:00
|
|
|
fprintf(stderr, "Chain %p (%ld items):\n", &chain, (long)chain.size());
|
2012-11-19 08:30:30 +08:00
|
|
|
for (size_t i=0; i < chain.size(); i++)
|
|
|
|
{
|
2013-01-07 23:04:55 +08:00
|
|
|
const shared_ptr<const io_data_t> &io = chain.at(i);
|
2013-02-23 05:20:27 +08:00
|
|
|
if (io.get() == NULL)
|
|
|
|
{
|
|
|
|
fprintf(stderr, "\t(null)\n");
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
fprintf(stderr, "\t%lu: fd:%d, ", (unsigned long)i, io->fd);
|
|
|
|
io->print();
|
|
|
|
}
|
2012-08-15 15:57:56 +08:00
|
|
|
}
|
|
|
|
}
|
2005-10-08 19:20:51 +08:00
|
|
|
|
2012-08-15 15:57:56 +08:00
|
|
|
/* Return the last IO for the given fd */
|
2013-01-07 23:04:55 +08:00
|
|
|
shared_ptr<const io_data_t> io_chain_t::get_io_for_fd(int fd) const
|
2005-10-09 19:48:16 +08:00
|
|
|
{
|
2012-08-15 15:57:56 +08:00
|
|
|
size_t idx = this->size();
|
|
|
|
while (idx--)
|
|
|
|
{
|
2013-01-07 23:04:55 +08:00
|
|
|
const shared_ptr<const io_data_t> &data = this->at(idx);
|
2012-11-19 08:30:30 +08:00
|
|
|
if (data->fd == fd)
|
|
|
|
{
|
2012-08-15 15:57:56 +08:00
|
|
|
return data;
|
|
|
|
}
|
|
|
|
}
|
2013-01-07 23:04:55 +08:00
|
|
|
return shared_ptr<const io_data_t>();
|
2012-08-15 15:57:56 +08:00
|
|
|
}
|
2005-10-09 19:48:16 +08:00
|
|
|
|
2013-01-07 23:04:55 +08:00
|
|
|
shared_ptr<io_data_t> io_chain_t::get_io_for_fd(int fd)
|
2012-08-15 15:57:56 +08:00
|
|
|
{
|
|
|
|
size_t idx = this->size();
|
|
|
|
while (idx--)
|
|
|
|
{
|
2013-01-07 23:04:55 +08:00
|
|
|
const shared_ptr<io_data_t> &data = this->at(idx);
|
2012-11-19 08:30:30 +08:00
|
|
|
if (data->fd == fd)
|
|
|
|
{
|
2012-08-15 15:57:56 +08:00
|
|
|
return data;
|
|
|
|
}
|
|
|
|
}
|
2013-01-07 23:04:55 +08:00
|
|
|
return shared_ptr<io_data_t>();
|
2012-08-15 15:57:56 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/* The old function returned the last match, so we mimic that. */
|
2013-01-07 23:04:55 +08:00
|
|
|
shared_ptr<const io_data_t> io_chain_get(const io_chain_t &src, int fd)
|
2012-08-15 15:57:56 +08:00
|
|
|
{
|
|
|
|
return src.get_io_for_fd(fd);
|
|
|
|
}
|
|
|
|
|
2013-01-07 23:04:55 +08:00
|
|
|
shared_ptr<io_data_t> io_chain_get(io_chain_t &src, int fd)
|
2012-08-15 15:57:56 +08:00
|
|
|
{
|
|
|
|
return src.get_io_for_fd(fd);
|
|
|
|
}
|
|
|
|
|
2013-01-07 23:04:55 +08:00
|
|
|
io_chain_t::io_chain_t(const shared_ptr<io_data_t> &data) :
|
|
|
|
std::vector<shared_ptr<io_data_t> >(1, data)
|
2012-08-15 15:57:56 +08:00
|
|
|
{
|
|
|
|
|
|
|
|
}
|
|
|
|
|
2013-01-07 23:04:55 +08:00
|
|
|
io_chain_t::io_chain_t() : std::vector<shared_ptr<io_data_t> >()
|
2012-08-15 15:57:56 +08:00
|
|
|
{
|
2005-10-09 19:48:16 +08:00
|
|
|
}
|