1*a9fa9459Szrj /* Utilities to execute a program in a subprocess (possibly linked by pipes
2*a9fa9459Szrj with other subprocesses), and wait for it.
3*a9fa9459Szrj Copyright (C) 2004 Free Software Foundation, Inc.
4*a9fa9459Szrj
5*a9fa9459Szrj This file is part of the libiberty library.
6*a9fa9459Szrj Libiberty is free software; you can redistribute it and/or
7*a9fa9459Szrj modify it under the terms of the GNU Library General Public
8*a9fa9459Szrj License as published by the Free Software Foundation; either
9*a9fa9459Szrj version 2 of the License, or (at your option) any later version.
10*a9fa9459Szrj
11*a9fa9459Szrj Libiberty is distributed in the hope that it will be useful,
12*a9fa9459Szrj but WITHOUT ANY WARRANTY; without even the implied warranty of
13*a9fa9459Szrj MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14*a9fa9459Szrj Library General Public License for more details.
15*a9fa9459Szrj
16*a9fa9459Szrj You should have received a copy of the GNU Library General Public
17*a9fa9459Szrj License along with libiberty; see the file COPYING.LIB. If not,
18*a9fa9459Szrj write to the Free Software Foundation, Inc., 51 Franklin Street - Fifth Floor,
19*a9fa9459Szrj Boston, MA 02110-1301, USA. */
20*a9fa9459Szrj
21*a9fa9459Szrj /* pexecute is an old routine. This implementation uses the newer
22*a9fa9459Szrj pex_init/pex_run/pex_get_status/pex_free routines. Don't use
23*a9fa9459Szrj pexecute in new code. Use the newer routines instead. */
24*a9fa9459Szrj
25*a9fa9459Szrj #include "config.h"
26*a9fa9459Szrj #include "libiberty.h"
27*a9fa9459Szrj
28*a9fa9459Szrj #ifdef HAVE_STDLIB_H
29*a9fa9459Szrj #include <stdlib.h>
30*a9fa9459Szrj #endif
31*a9fa9459Szrj
32*a9fa9459Szrj /* We only permit a single pexecute chain to execute at a time. This
33*a9fa9459Szrj was always true anyhow, though it wasn't documented. */
34*a9fa9459Szrj
35*a9fa9459Szrj static struct pex_obj *pex;
36*a9fa9459Szrj static int idx;
37*a9fa9459Szrj
38*a9fa9459Szrj int
pexecute(const char * program,char * const * argv,const char * pname,const char * temp_base,char ** errmsg_fmt,char ** errmsg_arg,int flags)39*a9fa9459Szrj pexecute (const char *program, char * const *argv, const char *pname,
40*a9fa9459Szrj const char *temp_base, char **errmsg_fmt, char **errmsg_arg,
41*a9fa9459Szrj int flags)
42*a9fa9459Szrj {
43*a9fa9459Szrj const char *errmsg;
44*a9fa9459Szrj int err;
45*a9fa9459Szrj
46*a9fa9459Szrj if ((flags & PEXECUTE_FIRST) != 0)
47*a9fa9459Szrj {
48*a9fa9459Szrj if (pex != NULL)
49*a9fa9459Szrj {
50*a9fa9459Szrj *errmsg_fmt = (char *) "pexecute already in progress";
51*a9fa9459Szrj *errmsg_arg = NULL;
52*a9fa9459Szrj return -1;
53*a9fa9459Szrj }
54*a9fa9459Szrj pex = pex_init (PEX_USE_PIPES, pname, temp_base);
55*a9fa9459Szrj idx = 0;
56*a9fa9459Szrj }
57*a9fa9459Szrj else
58*a9fa9459Szrj {
59*a9fa9459Szrj if (pex == NULL)
60*a9fa9459Szrj {
61*a9fa9459Szrj *errmsg_fmt = (char *) "pexecute not in progress";
62*a9fa9459Szrj *errmsg_arg = NULL;
63*a9fa9459Szrj return -1;
64*a9fa9459Szrj }
65*a9fa9459Szrj }
66*a9fa9459Szrj
67*a9fa9459Szrj errmsg = pex_run (pex,
68*a9fa9459Szrj (((flags & PEXECUTE_LAST) != 0 ? PEX_LAST : 0)
69*a9fa9459Szrj | ((flags & PEXECUTE_SEARCH) != 0 ? PEX_SEARCH : 0)),
70*a9fa9459Szrj program, argv, NULL, NULL, &err);
71*a9fa9459Szrj if (errmsg != NULL)
72*a9fa9459Szrj {
73*a9fa9459Szrj *errmsg_fmt = (char *) errmsg;
74*a9fa9459Szrj *errmsg_arg = NULL;
75*a9fa9459Szrj return -1;
76*a9fa9459Szrj }
77*a9fa9459Szrj
78*a9fa9459Szrj /* Instead of a PID, we just return a one-based index into the
79*a9fa9459Szrj status values. We avoid zero just because the old pexecute would
80*a9fa9459Szrj never return it. */
81*a9fa9459Szrj return ++idx;
82*a9fa9459Szrj }
83*a9fa9459Szrj
84*a9fa9459Szrj int
pwait(int pid,int * status,int flags ATTRIBUTE_UNUSED)85*a9fa9459Szrj pwait (int pid, int *status, int flags ATTRIBUTE_UNUSED)
86*a9fa9459Szrj {
87*a9fa9459Szrj /* The PID returned by pexecute is one-based. */
88*a9fa9459Szrj --pid;
89*a9fa9459Szrj
90*a9fa9459Szrj if (pex == NULL || pid < 0 || pid >= idx)
91*a9fa9459Szrj return -1;
92*a9fa9459Szrj
93*a9fa9459Szrj if (pid == 0 && idx == 1)
94*a9fa9459Szrj {
95*a9fa9459Szrj if (!pex_get_status (pex, 1, status))
96*a9fa9459Szrj return -1;
97*a9fa9459Szrj }
98*a9fa9459Szrj else
99*a9fa9459Szrj {
100*a9fa9459Szrj int *vector;
101*a9fa9459Szrj
102*a9fa9459Szrj vector = XNEWVEC (int, idx);
103*a9fa9459Szrj if (!pex_get_status (pex, idx, vector))
104*a9fa9459Szrj {
105*a9fa9459Szrj free (vector);
106*a9fa9459Szrj return -1;
107*a9fa9459Szrj }
108*a9fa9459Szrj *status = vector[pid];
109*a9fa9459Szrj free (vector);
110*a9fa9459Szrj }
111*a9fa9459Szrj
112*a9fa9459Szrj /* Assume that we are done after the caller has retrieved the last
113*a9fa9459Szrj exit status. The original implementation did not require that
114*a9fa9459Szrj the exit statuses be retrieved in order, but this implementation
115*a9fa9459Szrj does. */
116*a9fa9459Szrj if (pid + 1 == idx)
117*a9fa9459Szrj {
118*a9fa9459Szrj pex_free (pex);
119*a9fa9459Szrj pex = NULL;
120*a9fa9459Szrj idx = 0;
121*a9fa9459Szrj }
122*a9fa9459Szrj
123*a9fa9459Szrj return pid + 1;
124*a9fa9459Szrj }
125