/* Utilities to execute a program in a subprocess (possibly linked by pipes
|
/* Utilities to execute a program in a subprocess (possibly linked by pipes
|
with other subprocesses), and wait for it.
|
with other subprocesses), and wait for it.
|
Copyright (C) 2004 Free Software Foundation, Inc.
|
Copyright (C) 2004 Free Software Foundation, Inc.
|
|
|
This file is part of the libiberty library.
|
This file is part of the libiberty library.
|
Libiberty is free software; you can redistribute it and/or
|
Libiberty is free software; you can redistribute it and/or
|
modify it under the terms of the GNU Library General Public
|
modify it under the terms of the GNU Library General Public
|
License as published by the Free Software Foundation; either
|
License as published by the Free Software Foundation; either
|
version 2 of the License, or (at your option) any later version.
|
version 2 of the License, or (at your option) any later version.
|
|
|
Libiberty is distributed in the hope that it will be useful,
|
Libiberty is distributed in the hope that it will be useful,
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
Library General Public License for more details.
|
Library General Public License for more details.
|
|
|
You should have received a copy of the GNU Library General Public
|
You should have received a copy of the GNU Library General Public
|
License along with libiberty; see the file COPYING.LIB. If not,
|
License along with libiberty; see the file COPYING.LIB. If not,
|
write to the Free Software Foundation, Inc., 51 Franklin Street - Fifth Floor,
|
write to the Free Software Foundation, Inc., 51 Franklin Street - Fifth Floor,
|
Boston, MA 02110-1301, USA. */
|
Boston, MA 02110-1301, USA. */
|
|
|
/* pexecute is an old routine. This implementation uses the newer
|
/* pexecute is an old routine. This implementation uses the newer
|
pex_init/pex_run/pex_get_status/pex_free routines. Don't use
|
pex_init/pex_run/pex_get_status/pex_free routines. Don't use
|
pexecute in new code. Use the newer routines instead. */
|
pexecute in new code. Use the newer routines instead. */
|
|
|
#include "config.h"
|
#include "config.h"
|
#include "libiberty.h"
|
#include "libiberty.h"
|
|
|
#ifdef HAVE_STDLIB_H
|
#ifdef HAVE_STDLIB_H
|
#include <stdlib.h>
|
#include <stdlib.h>
|
#endif
|
#endif
|
|
|
/* We only permit a single pexecute chain to execute at a time. This
|
/* We only permit a single pexecute chain to execute at a time. This
|
was always true anyhow, though it wasn't documented. */
|
was always true anyhow, though it wasn't documented. */
|
|
|
static struct pex_obj *pex;
|
static struct pex_obj *pex;
|
static int idx;
|
static int idx;
|
|
|
int
|
int
|
pexecute (const char *program, char * const *argv, const char *pname,
|
pexecute (const char *program, char * const *argv, const char *pname,
|
const char *temp_base, char **errmsg_fmt, char **errmsg_arg,
|
const char *temp_base, char **errmsg_fmt, char **errmsg_arg,
|
int flags)
|
int flags)
|
{
|
{
|
const char *errmsg;
|
const char *errmsg;
|
int err;
|
int err;
|
|
|
if ((flags & PEXECUTE_FIRST) != 0)
|
if ((flags & PEXECUTE_FIRST) != 0)
|
{
|
{
|
if (pex != NULL)
|
if (pex != NULL)
|
{
|
{
|
*errmsg_fmt = (char *) "pexecute already in progress";
|
*errmsg_fmt = (char *) "pexecute already in progress";
|
*errmsg_arg = NULL;
|
*errmsg_arg = NULL;
|
return -1;
|
return -1;
|
}
|
}
|
pex = pex_init (PEX_USE_PIPES, pname, temp_base);
|
pex = pex_init (PEX_USE_PIPES, pname, temp_base);
|
idx = 0;
|
idx = 0;
|
}
|
}
|
else
|
else
|
{
|
{
|
if (pex == NULL)
|
if (pex == NULL)
|
{
|
{
|
*errmsg_fmt = (char *) "pexecute not in progress";
|
*errmsg_fmt = (char *) "pexecute not in progress";
|
*errmsg_arg = NULL;
|
*errmsg_arg = NULL;
|
return -1;
|
return -1;
|
}
|
}
|
}
|
}
|
|
|
errmsg = pex_run (pex,
|
errmsg = pex_run (pex,
|
(((flags & PEXECUTE_LAST) != 0 ? PEX_LAST : 0)
|
(((flags & PEXECUTE_LAST) != 0 ? PEX_LAST : 0)
|
| ((flags & PEXECUTE_SEARCH) != 0 ? PEX_SEARCH : 0)),
|
| ((flags & PEXECUTE_SEARCH) != 0 ? PEX_SEARCH : 0)),
|
program, argv, NULL, NULL, &err);
|
program, argv, NULL, NULL, &err);
|
if (errmsg != NULL)
|
if (errmsg != NULL)
|
{
|
{
|
*errmsg_fmt = (char *) errmsg;
|
*errmsg_fmt = (char *) errmsg;
|
*errmsg_arg = NULL;
|
*errmsg_arg = NULL;
|
return -1;
|
return -1;
|
}
|
}
|
|
|
/* Instead of a PID, we just return a one-based index into the
|
/* Instead of a PID, we just return a one-based index into the
|
status values. We avoid zero just because the old pexecute would
|
status values. We avoid zero just because the old pexecute would
|
never return it. */
|
never return it. */
|
return ++idx;
|
return ++idx;
|
}
|
}
|
|
|
int
|
int
|
pwait (int pid, int *status, int flags ATTRIBUTE_UNUSED)
|
pwait (int pid, int *status, int flags ATTRIBUTE_UNUSED)
|
{
|
{
|
/* The PID returned by pexecute is one-based. */
|
/* The PID returned by pexecute is one-based. */
|
--pid;
|
--pid;
|
|
|
if (pex == NULL || pid < 0 || pid >= idx)
|
if (pex == NULL || pid < 0 || pid >= idx)
|
return -1;
|
return -1;
|
|
|
if (pid == 0 && idx == 1)
|
if (pid == 0 && idx == 1)
|
{
|
{
|
if (!pex_get_status (pex, 1, status))
|
if (!pex_get_status (pex, 1, status))
|
return -1;
|
return -1;
|
}
|
}
|
else
|
else
|
{
|
{
|
int *vector;
|
int *vector;
|
|
|
vector = XNEWVEC (int, idx);
|
vector = XNEWVEC (int, idx);
|
if (!pex_get_status (pex, idx, vector))
|
if (!pex_get_status (pex, idx, vector))
|
{
|
{
|
free (vector);
|
free (vector);
|
return -1;
|
return -1;
|
}
|
}
|
*status = vector[pid];
|
*status = vector[pid];
|
free (vector);
|
free (vector);
|
}
|
}
|
|
|
/* Assume that we are done after the caller has retrieved the last
|
/* Assume that we are done after the caller has retrieved the last
|
exit status. The original implementation did not require that
|
exit status. The original implementation did not require that
|
the exit statuses be retrieved in order, but this implementation
|
the exit statuses be retrieved in order, but this implementation
|
does. */
|
does. */
|
if (pid + 1 == idx)
|
if (pid + 1 == idx)
|
{
|
{
|
pex_free (pex);
|
pex_free (pex);
|
pex = NULL;
|
pex = NULL;
|
idx = 0;
|
idx = 0;
|
}
|
}
|
|
|
return pid + 1;
|
return pid + 1;
|
}
|
}
|
|
|
