sem.c revision 1.5 1 1.1 cgd /*-
2 1.5 mycroft * Copyright (c) 1980, 1991, 1993
3 1.5 mycroft * The Regents of the University of California. All rights reserved.
4 1.1 cgd *
5 1.1 cgd * Redistribution and use in source and binary forms, with or without
6 1.1 cgd * modification, are permitted provided that the following conditions
7 1.1 cgd * are met:
8 1.1 cgd * 1. Redistributions of source code must retain the above copyright
9 1.1 cgd * notice, this list of conditions and the following disclaimer.
10 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer in the
12 1.1 cgd * documentation and/or other materials provided with the distribution.
13 1.1 cgd * 3. All advertising materials mentioning features or use of this software
14 1.1 cgd * must display the following acknowledgement:
15 1.1 cgd * This product includes software developed by the University of
16 1.1 cgd * California, Berkeley and its contributors.
17 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
18 1.1 cgd * may be used to endorse or promote products derived from this software
19 1.1 cgd * without specific prior written permission.
20 1.1 cgd *
21 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 1.1 cgd * SUCH DAMAGE.
32 1.1 cgd */
33 1.1 cgd
34 1.1 cgd #ifndef lint
35 1.5 mycroft /*static char sccsid[] = "from: @(#)sem.c 8.1 (Berkeley) 5/31/93";*/
36 1.5 mycroft static char *rcsid = "$Id: sem.c,v 1.5 1994/09/21 00:11:14 mycroft Exp $";
37 1.1 cgd #endif /* not lint */
38 1.1 cgd
39 1.1 cgd #include <sys/param.h>
40 1.1 cgd #include <sys/ioctl.h>
41 1.1 cgd #include <sys/stat.h>
42 1.1 cgd #include <errno.h>
43 1.1 cgd #include <fcntl.h>
44 1.1 cgd #include <stdlib.h>
45 1.1 cgd #include <string.h>
46 1.1 cgd #include <unistd.h>
47 1.1 cgd #if __STDC__
48 1.1 cgd # include <stdarg.h>
49 1.1 cgd #else
50 1.1 cgd # include <varargs.h>
51 1.1 cgd #endif
52 1.1 cgd
53 1.1 cgd #include "csh.h"
54 1.1 cgd #include "proc.h"
55 1.1 cgd #include "extern.h"
56 1.1 cgd
57 1.5 mycroft static void vffree __P((int));
58 1.5 mycroft static Char *splicepipe __P((struct command *t, Char *));
59 1.5 mycroft static void doio __P((struct command *t, int *, int *));
60 1.5 mycroft static void chkclob __P((char *));
61 1.1 cgd
62 1.1 cgd void
63 1.1 cgd execute(t, wanttty, pipein, pipeout)
64 1.1 cgd register struct command *t;
65 1.1 cgd int wanttty, *pipein, *pipeout;
66 1.1 cgd {
67 1.1 cgd bool forked = 0;
68 1.1 cgd struct biltins *bifunc;
69 1.1 cgd int pid = 0;
70 1.1 cgd int pv[2];
71 1.1 cgd
72 1.1 cgd static sigset_t csigmask;
73 1.1 cgd
74 1.1 cgd static sigset_t ocsigmask;
75 1.1 cgd static int onosigchld = 0;
76 1.1 cgd static int nosigchld = 0;
77 1.1 cgd
78 1.5 mycroft UNREGISTER(forked);
79 1.5 mycroft UNREGISTER(bifunc);
80 1.5 mycroft UNREGISTER(wanttty);
81 1.5 mycroft
82 1.1 cgd if (t == 0)
83 1.1 cgd return;
84 1.1 cgd
85 1.1 cgd if (t->t_dflg & F_AMPERSAND)
86 1.1 cgd wanttty = 0;
87 1.1 cgd switch (t->t_dtyp) {
88 1.1 cgd
89 1.1 cgd case NODE_COMMAND:
90 1.1 cgd if ((t->t_dcom[0][0] & (QUOTE | TRIM)) == QUOTE)
91 1.1 cgd (void) Strcpy(t->t_dcom[0], t->t_dcom[0] + 1);
92 1.1 cgd if ((t->t_dflg & F_REPEAT) == 0)
93 1.1 cgd Dfix(t); /* $ " ' \ */
94 1.1 cgd if (t->t_dcom[0] == 0)
95 1.1 cgd return;
96 1.1 cgd /* fall into... */
97 1.1 cgd
98 1.1 cgd case NODE_PAREN:
99 1.1 cgd if (t->t_dflg & F_PIPEOUT)
100 1.1 cgd mypipe(pipeout);
101 1.1 cgd /*
102 1.1 cgd * Must do << early so parent will know where input pointer should be.
103 1.1 cgd * If noexec then this is all we do.
104 1.1 cgd */
105 1.1 cgd if (t->t_dflg & F_READ) {
106 1.1 cgd (void) close(0);
107 1.1 cgd heredoc(t->t_dlef);
108 1.1 cgd if (noexec)
109 1.1 cgd (void) close(0);
110 1.1 cgd }
111 1.1 cgd
112 1.1 cgd set(STRstatus, Strsave(STR0));
113 1.1 cgd
114 1.1 cgd /*
115 1.1 cgd * This mess is the necessary kludge to handle the prefix builtins:
116 1.1 cgd * nice, nohup, time. These commands can also be used by themselves,
117 1.1 cgd * and this is not handled here. This will also work when loops are
118 1.1 cgd * parsed.
119 1.1 cgd */
120 1.1 cgd while (t->t_dtyp == NODE_COMMAND)
121 1.1 cgd if (eq(t->t_dcom[0], STRnice))
122 1.1 cgd if (t->t_dcom[1])
123 1.1 cgd if (strchr("+-", t->t_dcom[1][0]))
124 1.1 cgd if (t->t_dcom[2]) {
125 1.1 cgd setname("nice");
126 1.1 cgd t->t_nice =
127 1.1 cgd getn(t->t_dcom[1]);
128 1.1 cgd lshift(t->t_dcom, 2);
129 1.1 cgd t->t_dflg |= F_NICE;
130 1.1 cgd }
131 1.1 cgd else
132 1.1 cgd break;
133 1.1 cgd else {
134 1.1 cgd t->t_nice = 4;
135 1.1 cgd lshift(t->t_dcom, 1);
136 1.1 cgd t->t_dflg |= F_NICE;
137 1.1 cgd }
138 1.1 cgd else
139 1.1 cgd break;
140 1.1 cgd else if (eq(t->t_dcom[0], STRnohup))
141 1.1 cgd if (t->t_dcom[1]) {
142 1.1 cgd t->t_dflg |= F_NOHUP;
143 1.1 cgd lshift(t->t_dcom, 1);
144 1.1 cgd }
145 1.1 cgd else
146 1.1 cgd break;
147 1.1 cgd else if (eq(t->t_dcom[0], STRtime))
148 1.1 cgd if (t->t_dcom[1]) {
149 1.1 cgd t->t_dflg |= F_TIME;
150 1.1 cgd lshift(t->t_dcom, 1);
151 1.1 cgd }
152 1.1 cgd else
153 1.1 cgd break;
154 1.1 cgd else
155 1.1 cgd break;
156 1.1 cgd
157 1.5 mycroft /* is it a command */
158 1.1 cgd if (t->t_dtyp == NODE_COMMAND) {
159 1.1 cgd /*
160 1.1 cgd * Check if we have a builtin function and remember which one.
161 1.1 cgd */
162 1.1 cgd bifunc = isbfunc(t);
163 1.5 mycroft if (noexec) {
164 1.5 mycroft /*
165 1.5 mycroft * Continue for builtins that are part of the scripting language
166 1.5 mycroft */
167 1.5 mycroft if (bifunc->bfunct != dobreak && bifunc->bfunct != docontin &&
168 1.5 mycroft bifunc->bfunct != doelse && bifunc->bfunct != doend &&
169 1.5 mycroft bifunc->bfunct != doforeach && bifunc->bfunct != dogoto &&
170 1.5 mycroft bifunc->bfunct != doif && bifunc->bfunct != dorepeat &&
171 1.5 mycroft bifunc->bfunct != doswbrk && bifunc->bfunct != doswitch &&
172 1.5 mycroft bifunc->bfunct != dowhile && bifunc->bfunct != dozip)
173 1.5 mycroft break;
174 1.5 mycroft }
175 1.1 cgd }
176 1.1 cgd else { /* not a command */
177 1.1 cgd bifunc = NULL;
178 1.5 mycroft if (noexec)
179 1.5 mycroft break;
180 1.1 cgd }
181 1.1 cgd
182 1.1 cgd /*
183 1.1 cgd * We fork only if we are timed, or are not the end of a parenthesized
184 1.1 cgd * list and not a simple builtin function. Simple meaning one that is
185 1.1 cgd * not pipedout, niced, nohupped, or &'d. It would be nice(?) to not
186 1.1 cgd * fork in some of these cases.
187 1.1 cgd */
188 1.1 cgd /*
189 1.1 cgd * Prevent forking cd, pushd, popd, chdir cause this will cause the
190 1.1 cgd * shell not to change dir!
191 1.1 cgd */
192 1.1 cgd if (bifunc && (bifunc->bfunct == dochngd ||
193 1.1 cgd bifunc->bfunct == dopushd ||
194 1.1 cgd bifunc->bfunct == dopopd))
195 1.1 cgd t->t_dflg &= ~(F_NICE);
196 1.5 mycroft if (((t->t_dflg & F_TIME) || ((t->t_dflg & F_NOFORK) == 0 &&
197 1.1 cgd (!bifunc || t->t_dflg &
198 1.5 mycroft (F_PIPEOUT | F_AMPERSAND | F_NICE | F_NOHUP)))) ||
199 1.1 cgd /*
200 1.1 cgd * We have to fork for eval too.
201 1.1 cgd */
202 1.5 mycroft (bifunc && (t->t_dflg & (F_PIPEIN | F_PIPEOUT)) != 0 &&
203 1.1 cgd bifunc->bfunct == doeval))
204 1.1 cgd if (t->t_dtyp == NODE_PAREN ||
205 1.1 cgd t->t_dflg & (F_REPEAT | F_AMPERSAND) || bifunc) {
206 1.1 cgd forked++;
207 1.1 cgd /*
208 1.1 cgd * We need to block SIGCHLD here, so that if the process does
209 1.1 cgd * not die before we can set the process group
210 1.1 cgd */
211 1.1 cgd if (wanttty >= 0 && !nosigchld) {
212 1.1 cgd csigmask = sigblock(sigmask(SIGCHLD));
213 1.1 cgd nosigchld = 1;
214 1.1 cgd }
215 1.1 cgd
216 1.1 cgd pid = pfork(t, wanttty);
217 1.1 cgd if (pid == 0 && nosigchld) {
218 1.1 cgd (void) sigsetmask(csigmask);
219 1.1 cgd nosigchld = 0;
220 1.1 cgd }
221 1.5 mycroft else if (pid != 0 && (t->t_dflg & F_AMPERSAND))
222 1.5 mycroft backpid = pid;
223 1.5 mycroft
224 1.1 cgd }
225 1.1 cgd else {
226 1.1 cgd int ochild, osetintr, ohaderr, odidfds;
227 1.5 mycroft int oSHIN, oSHOUT, oSHERR, oOLDSTD, otpgrp;
228 1.1 cgd sigset_t omask;
229 1.1 cgd
230 1.1 cgd /*
231 1.1 cgd * Prepare for the vfork by saving everything that the child
232 1.1 cgd * corrupts before it exec's. Note that in some signal
233 1.1 cgd * implementations which keep the signal info in user space
234 1.1 cgd * (e.g. Sun's) it will also be necessary to save and restore
235 1.1 cgd * the current sigvec's for the signals the child touches
236 1.1 cgd * before it exec's.
237 1.1 cgd */
238 1.1 cgd if (wanttty >= 0 && !nosigchld && !noexec) {
239 1.1 cgd csigmask = sigblock(sigmask(SIGCHLD));
240 1.1 cgd nosigchld = 1;
241 1.1 cgd }
242 1.1 cgd omask = sigblock(sigmask(SIGCHLD) | sigmask(SIGINT));
243 1.1 cgd ochild = child;
244 1.1 cgd osetintr = setintr;
245 1.1 cgd ohaderr = haderr;
246 1.1 cgd odidfds = didfds;
247 1.1 cgd oSHIN = SHIN;
248 1.1 cgd oSHOUT = SHOUT;
249 1.5 mycroft oSHERR = SHERR;
250 1.1 cgd oOLDSTD = OLDSTD;
251 1.1 cgd otpgrp = tpgrp;
252 1.1 cgd ocsigmask = csigmask;
253 1.1 cgd onosigchld = nosigchld;
254 1.1 cgd Vsav = Vdp = 0;
255 1.1 cgd Vexpath = 0;
256 1.1 cgd Vt = 0;
257 1.1 cgd pid = vfork();
258 1.1 cgd
259 1.1 cgd if (pid < 0) {
260 1.1 cgd (void) sigsetmask(omask);
261 1.1 cgd stderror(ERR_NOPROC);
262 1.1 cgd }
263 1.1 cgd forked++;
264 1.1 cgd if (pid) { /* parent */
265 1.1 cgd child = ochild;
266 1.1 cgd setintr = osetintr;
267 1.1 cgd haderr = ohaderr;
268 1.1 cgd didfds = odidfds;
269 1.1 cgd SHIN = oSHIN;
270 1.1 cgd SHOUT = oSHOUT;
271 1.5 mycroft SHERR = oSHERR;
272 1.1 cgd OLDSTD = oOLDSTD;
273 1.1 cgd tpgrp = otpgrp;
274 1.1 cgd csigmask = ocsigmask;
275 1.1 cgd nosigchld = onosigchld;
276 1.1 cgd
277 1.1 cgd xfree((ptr_t) Vsav);
278 1.1 cgd Vsav = 0;
279 1.1 cgd xfree((ptr_t) Vdp);
280 1.1 cgd Vdp = 0;
281 1.1 cgd xfree((ptr_t) Vexpath);
282 1.1 cgd Vexpath = 0;
283 1.1 cgd blkfree((Char **) Vt);
284 1.1 cgd Vt = 0;
285 1.1 cgd /* this is from pfork() */
286 1.1 cgd palloc(pid, t);
287 1.1 cgd (void) sigsetmask(omask);
288 1.1 cgd }
289 1.1 cgd else { /* child */
290 1.1 cgd /* this is from pfork() */
291 1.1 cgd int pgrp;
292 1.1 cgd bool ignint = 0;
293 1.1 cgd
294 1.1 cgd if (nosigchld) {
295 1.1 cgd (void) sigsetmask(csigmask);
296 1.1 cgd nosigchld = 0;
297 1.1 cgd }
298 1.1 cgd
299 1.1 cgd if (setintr)
300 1.1 cgd ignint =
301 1.1 cgd (tpgrp == -1 &&
302 1.1 cgd (t->t_dflg & F_NOINTERRUPT))
303 1.5 mycroft || (gointr && eq(gointr, STRminus));
304 1.1 cgd pgrp = pcurrjob ? pcurrjob->p_jobid : getpid();
305 1.1 cgd child++;
306 1.1 cgd if (setintr) {
307 1.1 cgd setintr = 0;
308 1.1 cgd if (ignint) {
309 1.1 cgd (void) signal(SIGINT, SIG_IGN);
310 1.1 cgd (void) signal(SIGQUIT, SIG_IGN);
311 1.1 cgd }
312 1.1 cgd else {
313 1.1 cgd (void) signal(SIGINT, vffree);
314 1.1 cgd (void) signal(SIGQUIT, SIG_DFL);
315 1.1 cgd }
316 1.1 cgd
317 1.1 cgd if (wanttty >= 0) {
318 1.1 cgd (void) signal(SIGTSTP, SIG_DFL);
319 1.1 cgd (void) signal(SIGTTIN, SIG_DFL);
320 1.1 cgd (void) signal(SIGTTOU, SIG_DFL);
321 1.1 cgd }
322 1.1 cgd
323 1.1 cgd (void) signal(SIGTERM, parterm);
324 1.1 cgd }
325 1.1 cgd else if (tpgrp == -1 &&
326 1.1 cgd (t->t_dflg & F_NOINTERRUPT)) {
327 1.1 cgd (void) signal(SIGINT, SIG_IGN);
328 1.1 cgd (void) signal(SIGQUIT, SIG_IGN);
329 1.1 cgd }
330 1.1 cgd
331 1.1 cgd pgetty(wanttty, pgrp);
332 1.1 cgd if (t->t_dflg & F_NOHUP)
333 1.1 cgd (void) signal(SIGHUP, SIG_IGN);
334 1.1 cgd if (t->t_dflg & F_NICE)
335 1.1 cgd (void) setpriority(PRIO_PROCESS, 0, t->t_nice);
336 1.1 cgd }
337 1.1 cgd
338 1.1 cgd }
339 1.1 cgd if (pid != 0) {
340 1.1 cgd /*
341 1.1 cgd * It would be better if we could wait for the whole job when we
342 1.1 cgd * knew the last process had been started. Pwait, in fact, does
343 1.1 cgd * wait for the whole job anyway, but this test doesn't really
344 1.1 cgd * express our intentions.
345 1.1 cgd */
346 1.1 cgd if (didfds == 0 && t->t_dflg & F_PIPEIN) {
347 1.1 cgd (void) close(pipein[0]);
348 1.1 cgd (void) close(pipein[1]);
349 1.1 cgd }
350 1.1 cgd if ((t->t_dflg & F_PIPEOUT) == 0) {
351 1.1 cgd if (nosigchld) {
352 1.1 cgd (void) sigsetmask(csigmask);
353 1.1 cgd nosigchld = 0;
354 1.1 cgd }
355 1.1 cgd if ((t->t_dflg & F_AMPERSAND) == 0)
356 1.1 cgd pwait();
357 1.1 cgd }
358 1.1 cgd break;
359 1.1 cgd }
360 1.1 cgd doio(t, pipein, pipeout);
361 1.1 cgd if (t->t_dflg & F_PIPEOUT) {
362 1.1 cgd (void) close(pipeout[0]);
363 1.1 cgd (void) close(pipeout[1]);
364 1.1 cgd }
365 1.1 cgd /*
366 1.1 cgd * Perform a builtin function. If we are not forked, arrange for
367 1.1 cgd * possible stopping
368 1.1 cgd */
369 1.1 cgd if (bifunc) {
370 1.1 cgd func(t, bifunc);
371 1.1 cgd if (forked)
372 1.1 cgd exitstat();
373 1.1 cgd break;
374 1.1 cgd }
375 1.1 cgd if (t->t_dtyp != NODE_PAREN) {
376 1.5 mycroft doexec(NULL, t);
377 1.1 cgd /* NOTREACHED */
378 1.1 cgd }
379 1.1 cgd /*
380 1.1 cgd * For () commands must put new 0,1,2 in FSH* and recurse
381 1.1 cgd */
382 1.1 cgd OLDSTD = dcopy(0, FOLDSTD);
383 1.1 cgd SHOUT = dcopy(1, FSHOUT);
384 1.5 mycroft SHERR = dcopy(2, FSHERR);
385 1.1 cgd (void) close(SHIN);
386 1.1 cgd SHIN = -1;
387 1.1 cgd didfds = 0;
388 1.1 cgd wanttty = -1;
389 1.1 cgd t->t_dspr->t_dflg |= t->t_dflg & F_NOINTERRUPT;
390 1.1 cgd execute(t->t_dspr, wanttty, NULL, NULL);
391 1.1 cgd exitstat();
392 1.1 cgd
393 1.1 cgd case NODE_PIPE:
394 1.1 cgd t->t_dcar->t_dflg |= F_PIPEOUT |
395 1.1 cgd (t->t_dflg & (F_PIPEIN | F_AMPERSAND | F_STDERR | F_NOINTERRUPT));
396 1.1 cgd execute(t->t_dcar, wanttty, pipein, pv);
397 1.1 cgd t->t_dcdr->t_dflg |= F_PIPEIN | (t->t_dflg &
398 1.1 cgd (F_PIPEOUT | F_AMPERSAND | F_NOFORK | F_NOINTERRUPT));
399 1.1 cgd if (wanttty > 0)
400 1.1 cgd wanttty = 0; /* got tty already */
401 1.1 cgd execute(t->t_dcdr, wanttty, pv, pipeout);
402 1.1 cgd break;
403 1.1 cgd
404 1.1 cgd case NODE_LIST:
405 1.1 cgd if (t->t_dcar) {
406 1.1 cgd t->t_dcar->t_dflg |= t->t_dflg & F_NOINTERRUPT;
407 1.1 cgd execute(t->t_dcar, wanttty, NULL, NULL);
408 1.1 cgd /*
409 1.1 cgd * In strange case of A&B make a new job after A
410 1.1 cgd */
411 1.1 cgd if (t->t_dcar->t_dflg & F_AMPERSAND && t->t_dcdr &&
412 1.1 cgd (t->t_dcdr->t_dflg & F_AMPERSAND) == 0)
413 1.1 cgd pendjob();
414 1.1 cgd }
415 1.1 cgd if (t->t_dcdr) {
416 1.1 cgd t->t_dcdr->t_dflg |= t->t_dflg &
417 1.1 cgd (F_NOFORK | F_NOINTERRUPT);
418 1.1 cgd execute(t->t_dcdr, wanttty, NULL, NULL);
419 1.1 cgd }
420 1.1 cgd break;
421 1.1 cgd
422 1.1 cgd case NODE_OR:
423 1.1 cgd case NODE_AND:
424 1.1 cgd if (t->t_dcar) {
425 1.1 cgd t->t_dcar->t_dflg |= t->t_dflg & F_NOINTERRUPT;
426 1.1 cgd execute(t->t_dcar, wanttty, NULL, NULL);
427 1.1 cgd if ((getn(value(STRstatus)) == 0) !=
428 1.1 cgd (t->t_dtyp == NODE_AND))
429 1.1 cgd return;
430 1.1 cgd }
431 1.1 cgd if (t->t_dcdr) {
432 1.1 cgd t->t_dcdr->t_dflg |= t->t_dflg &
433 1.1 cgd (F_NOFORK | F_NOINTERRUPT);
434 1.1 cgd execute(t->t_dcdr, wanttty, NULL, NULL);
435 1.1 cgd }
436 1.1 cgd break;
437 1.1 cgd }
438 1.1 cgd /*
439 1.1 cgd * Fall through for all breaks from switch
440 1.1 cgd *
441 1.1 cgd * If there will be no more executions of this command, flush all file
442 1.1 cgd * descriptors. Places that turn on the F_REPEAT bit are responsible for
443 1.1 cgd * doing donefds after the last re-execution
444 1.1 cgd */
445 1.1 cgd if (didfds && !(t->t_dflg & F_REPEAT))
446 1.1 cgd donefds();
447 1.1 cgd }
448 1.1 cgd
449 1.1 cgd static void
450 1.1 cgd vffree(i)
451 1.1 cgd int i;
452 1.1 cgd {
453 1.1 cgd register Char **v;
454 1.1 cgd
455 1.5 mycroft if ((v = gargv) != NULL) {
456 1.1 cgd gargv = 0;
457 1.1 cgd xfree((ptr_t) v);
458 1.1 cgd }
459 1.5 mycroft if ((v = pargv) != NULL) {
460 1.1 cgd pargv = 0;
461 1.1 cgd xfree((ptr_t) v);
462 1.1 cgd }
463 1.1 cgd _exit(i);
464 1.1 cgd }
465 1.1 cgd
466 1.1 cgd /*
467 1.5 mycroft * Expand and glob the words after an i/o redirection.
468 1.5 mycroft * If more than one word is generated, then update the command vector.
469 1.5 mycroft *
470 1.5 mycroft * This is done differently in all the shells:
471 1.5 mycroft * 1. in the bourne shell and ksh globbing is not performed
472 1.5 mycroft * 2. Bash/csh say ambiguous
473 1.5 mycroft * 3. zsh does i/o to/from all the files
474 1.5 mycroft * 4. itcsh concatenates the words.
475 1.5 mycroft *
476 1.5 mycroft * I don't know what is best to do. I think that Ambiguous is better
477 1.5 mycroft * than restructuring the command vector, because the user can get
478 1.5 mycroft * unexpected results. In any case, the command vector restructuring
479 1.5 mycroft * code is present and the user can choose it by setting noambiguous
480 1.5 mycroft */
481 1.5 mycroft static Char *
482 1.5 mycroft splicepipe(t, cp)
483 1.5 mycroft register struct command *t;
484 1.5 mycroft Char *cp; /* word after < or > */
485 1.5 mycroft {
486 1.5 mycroft Char *blk[2];
487 1.5 mycroft
488 1.5 mycroft if (adrof(STRnoambiguous)) {
489 1.5 mycroft Char **pv;
490 1.5 mycroft
491 1.5 mycroft blk[0] = Dfix1(cp); /* expand $ */
492 1.5 mycroft blk[1] = NULL;
493 1.5 mycroft
494 1.5 mycroft gflag = 0, tglob(blk);
495 1.5 mycroft if (gflag) {
496 1.5 mycroft pv = globall(blk);
497 1.5 mycroft if (pv == NULL) {
498 1.5 mycroft setname(vis_str(blk[0]));
499 1.5 mycroft xfree((ptr_t) blk[0]);
500 1.5 mycroft stderror(ERR_NAME | ERR_NOMATCH);
501 1.5 mycroft }
502 1.5 mycroft gargv = NULL;
503 1.5 mycroft if (pv[1] != NULL) { /* we need to fix the command vector */
504 1.5 mycroft Char **av = blkspl(t->t_dcom, &pv[1]);
505 1.5 mycroft xfree((ptr_t) t->t_dcom);
506 1.5 mycroft t->t_dcom = av;
507 1.5 mycroft }
508 1.5 mycroft xfree((ptr_t) blk[0]);
509 1.5 mycroft blk[0] = pv[0];
510 1.5 mycroft xfree((ptr_t) pv);
511 1.5 mycroft }
512 1.5 mycroft }
513 1.5 mycroft else {
514 1.5 mycroft blk[0] = globone(blk[1] = Dfix1(cp), G_ERROR);
515 1.5 mycroft xfree((ptr_t) blk[1]);
516 1.5 mycroft }
517 1.5 mycroft return(blk[0]);
518 1.5 mycroft }
519 1.5 mycroft
520 1.5 mycroft /*
521 1.1 cgd * Perform io redirection.
522 1.1 cgd * We may or maynot be forked here.
523 1.1 cgd */
524 1.1 cgd static void
525 1.1 cgd doio(t, pipein, pipeout)
526 1.1 cgd register struct command *t;
527 1.1 cgd int *pipein, *pipeout;
528 1.1 cgd {
529 1.1 cgd register int fd;
530 1.1 cgd register Char *cp;
531 1.1 cgd register int flags = t->t_dflg;
532 1.1 cgd
533 1.1 cgd if (didfds || (flags & F_REPEAT))
534 1.1 cgd return;
535 1.1 cgd if ((flags & F_READ) == 0) {/* F_READ already done */
536 1.5 mycroft if (t->t_dlef) {
537 1.1 cgd char tmp[MAXPATHLEN+1];
538 1.1 cgd
539 1.1 cgd /*
540 1.1 cgd * so < /dev/std{in,out,err} work
541 1.1 cgd */
542 1.1 cgd (void) dcopy(SHIN, 0);
543 1.1 cgd (void) dcopy(SHOUT, 1);
544 1.5 mycroft (void) dcopy(SHERR, 2);
545 1.5 mycroft cp = splicepipe(t, t->t_dlef);
546 1.1 cgd (void) strncpy(tmp, short2str(cp), MAXPATHLEN);
547 1.1 cgd tmp[MAXPATHLEN] = '\0';
548 1.1 cgd xfree((ptr_t) cp);
549 1.1 cgd if ((fd = open(tmp, O_RDONLY)) < 0)
550 1.1 cgd stderror(ERR_SYSTEM, tmp, strerror(errno));
551 1.1 cgd (void) dmove(fd, 0);
552 1.1 cgd }
553 1.1 cgd else if (flags & F_PIPEIN) {
554 1.1 cgd (void) close(0);
555 1.1 cgd (void) dup(pipein[0]);
556 1.1 cgd (void) close(pipein[0]);
557 1.1 cgd (void) close(pipein[1]);
558 1.1 cgd }
559 1.1 cgd else if ((flags & F_NOINTERRUPT) && tpgrp == -1) {
560 1.1 cgd (void) close(0);
561 1.1 cgd (void) open(_PATH_DEVNULL, O_RDONLY);
562 1.1 cgd }
563 1.1 cgd else {
564 1.1 cgd (void) close(0);
565 1.1 cgd (void) dup(OLDSTD);
566 1.1 cgd (void) ioctl(0, FIONCLEX, NULL);
567 1.1 cgd }
568 1.1 cgd }
569 1.5 mycroft if (t->t_drit) {
570 1.1 cgd char tmp[MAXPATHLEN+1];
571 1.1 cgd
572 1.5 mycroft cp = splicepipe(t, t->t_drit);
573 1.1 cgd (void) strncpy(tmp, short2str(cp), MAXPATHLEN);
574 1.1 cgd tmp[MAXPATHLEN] = '\0';
575 1.1 cgd xfree((ptr_t) cp);
576 1.1 cgd /*
577 1.1 cgd * so > /dev/std{out,err} work
578 1.1 cgd */
579 1.1 cgd (void) dcopy(SHOUT, 1);
580 1.5 mycroft (void) dcopy(SHERR, 2);
581 1.1 cgd if ((flags & F_APPEND) &&
582 1.1 cgd #ifdef O_APPEND
583 1.1 cgd (fd = open(tmp, O_WRONLY | O_APPEND)) >= 0);
584 1.1 cgd #else
585 1.1 cgd (fd = open(tmp, O_WRONLY)) >= 0)
586 1.1 cgd (void) lseek(1, (off_t) 0, L_XTND);
587 1.1 cgd #endif
588 1.1 cgd else {
589 1.1 cgd if (!(flags & F_OVERWRITE) && adrof(STRnoclobber)) {
590 1.1 cgd if (flags & F_APPEND)
591 1.1 cgd stderror(ERR_SYSTEM, tmp, strerror(errno));
592 1.1 cgd chkclob(tmp);
593 1.1 cgd }
594 1.1 cgd if ((fd = creat(tmp, 0666)) < 0)
595 1.1 cgd stderror(ERR_SYSTEM, tmp, strerror(errno));
596 1.1 cgd }
597 1.1 cgd (void) dmove(fd, 1);
598 1.1 cgd }
599 1.1 cgd else if (flags & F_PIPEOUT) {
600 1.1 cgd (void) close(1);
601 1.1 cgd (void) dup(pipeout[1]);
602 1.1 cgd }
603 1.1 cgd else {
604 1.1 cgd (void) close(1);
605 1.1 cgd (void) dup(SHOUT);
606 1.1 cgd (void) ioctl(1, FIONCLEX, NULL);
607 1.1 cgd }
608 1.1 cgd
609 1.1 cgd (void) close(2);
610 1.1 cgd if (flags & F_STDERR) {
611 1.1 cgd (void) dup(1);
612 1.1 cgd }
613 1.1 cgd else {
614 1.5 mycroft (void) dup(SHERR);
615 1.1 cgd (void) ioctl(2, FIONCLEX, NULL);
616 1.1 cgd }
617 1.1 cgd didfds = 1;
618 1.1 cgd }
619 1.1 cgd
620 1.1 cgd void
621 1.1 cgd mypipe(pv)
622 1.1 cgd register int *pv;
623 1.1 cgd {
624 1.1 cgd
625 1.1 cgd if (pipe(pv) < 0)
626 1.1 cgd goto oops;
627 1.1 cgd pv[0] = dmove(pv[0], -1);
628 1.1 cgd pv[1] = dmove(pv[1], -1);
629 1.1 cgd if (pv[0] >= 0 && pv[1] >= 0)
630 1.1 cgd return;
631 1.1 cgd oops:
632 1.1 cgd stderror(ERR_PIPE);
633 1.1 cgd }
634 1.1 cgd
635 1.1 cgd static void
636 1.1 cgd chkclob(cp)
637 1.1 cgd register char *cp;
638 1.1 cgd {
639 1.1 cgd struct stat stb;
640 1.1 cgd
641 1.1 cgd if (stat(cp, &stb) < 0)
642 1.1 cgd return;
643 1.5 mycroft if (S_ISCHR(stb.st_mode))
644 1.1 cgd return;
645 1.1 cgd stderror(ERR_EXISTS, cp);
646 1.1 cgd }
647