redir.c revision 1.10 1 1.1 cgd /*-
2 1.7 jtc * Copyright (c) 1991, 1993
3 1.7 jtc * The Regents of the University of California. All rights reserved.
4 1.1 cgd *
5 1.1 cgd * This code is derived from software contributed to Berkeley by
6 1.1 cgd * Kenneth Almquist.
7 1.1 cgd *
8 1.1 cgd * Redistribution and use in source and binary forms, with or without
9 1.1 cgd * modification, are permitted provided that the following conditions
10 1.1 cgd * are met:
11 1.1 cgd * 1. Redistributions of source code must retain the above copyright
12 1.1 cgd * notice, this list of conditions and the following disclaimer.
13 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
14 1.1 cgd * notice, this list of conditions and the following disclaimer in the
15 1.1 cgd * documentation and/or other materials provided with the distribution.
16 1.1 cgd * 3. All advertising materials mentioning features or use of this software
17 1.1 cgd * must display the following acknowledgement:
18 1.1 cgd * This product includes software developed by the University of
19 1.1 cgd * California, Berkeley and its contributors.
20 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
21 1.1 cgd * may be used to endorse or promote products derived from this software
22 1.1 cgd * without specific prior written permission.
23 1.1 cgd *
24 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 1.1 cgd * SUCH DAMAGE.
35 1.1 cgd */
36 1.1 cgd
37 1.1 cgd #ifndef lint
38 1.8 mycroft /*static char sccsid[] = "from: @(#)redir.c 8.1 (Berkeley) 5/31/93";*/
39 1.10 cgd static char *rcsid = "$Id: redir.c,v 1.10 1994/12/23 13:24:13 cgd Exp $";
40 1.1 cgd #endif /* not lint */
41 1.1 cgd
42 1.1 cgd /*
43 1.1 cgd * Code for dealing with input/output redirection.
44 1.1 cgd */
45 1.1 cgd
46 1.1 cgd #include "shell.h"
47 1.1 cgd #include "nodes.h"
48 1.1 cgd #include "jobs.h"
49 1.1 cgd #include "expand.h"
50 1.1 cgd #include "redir.h"
51 1.1 cgd #include "output.h"
52 1.1 cgd #include "memalloc.h"
53 1.1 cgd #include "error.h"
54 1.7 jtc #include <sys/types.h>
55 1.1 cgd #include <signal.h>
56 1.10 cgd #include <string.h>
57 1.1 cgd #include <fcntl.h>
58 1.1 cgd #include <errno.h>
59 1.7 jtc #include <unistd.h>
60 1.1 cgd
61 1.1 cgd
62 1.1 cgd #define EMPTY -2 /* marks an unused slot in redirtab */
63 1.1 cgd #define PIPESIZE 4096 /* amount of buffering in a pipe */
64 1.1 cgd
65 1.1 cgd
66 1.1 cgd MKINIT
67 1.1 cgd struct redirtab {
68 1.1 cgd struct redirtab *next;
69 1.1 cgd short renamed[10];
70 1.1 cgd };
71 1.1 cgd
72 1.1 cgd
73 1.1 cgd MKINIT struct redirtab *redirlist;
74 1.1 cgd
75 1.7 jtc /*
76 1.7 jtc * We keep track of whether or not fd0 has been redirected. This is for
77 1.7 jtc * background commands, where we want to redirect fd0 to /dev/null only
78 1.7 jtc * if it hasn't already been redirected.
79 1.7 jtc */
80 1.4 sef int fd0_redirected = 0;
81 1.1 cgd
82 1.1 cgd #ifdef __STDC__
83 1.1 cgd STATIC void openredirect(union node *, char *);
84 1.1 cgd STATIC int openhere(union node *);
85 1.1 cgd #else
86 1.1 cgd STATIC void openredirect();
87 1.1 cgd STATIC int openhere();
88 1.1 cgd #endif
89 1.1 cgd
90 1.1 cgd
91 1.1 cgd
92 1.1 cgd /*
93 1.1 cgd * Process a list of redirection commands. If the REDIR_PUSH flag is set,
94 1.1 cgd * old file descriptors are stashed away so that the redirection can be
95 1.1 cgd * undone by calling popredir. If the REDIR_BACKQ flag is set, then the
96 1.1 cgd * standard output, and the standard error if it becomes a duplicate of
97 1.1 cgd * stdout, is saved in memory.
98 1.1 cgd */
99 1.1 cgd
100 1.1 cgd void
101 1.1 cgd redirect(redir, flags)
102 1.1 cgd union node *redir;
103 1.1 cgd int flags;
104 1.1 cgd {
105 1.1 cgd union node *n;
106 1.1 cgd struct redirtab *sv;
107 1.1 cgd int i;
108 1.1 cgd int fd;
109 1.1 cgd char memory[10]; /* file descriptors to write to memory */
110 1.1 cgd
111 1.1 cgd for (i = 10 ; --i >= 0 ; )
112 1.1 cgd memory[i] = 0;
113 1.1 cgd memory[1] = flags & REDIR_BACKQ;
114 1.1 cgd if (flags & REDIR_PUSH) {
115 1.1 cgd sv = ckmalloc(sizeof (struct redirtab));
116 1.1 cgd for (i = 0 ; i < 10 ; i++)
117 1.1 cgd sv->renamed[i] = EMPTY;
118 1.1 cgd sv->next = redirlist;
119 1.1 cgd redirlist = sv;
120 1.1 cgd }
121 1.1 cgd for (n = redir ; n ; n = n->nfile.next) {
122 1.1 cgd fd = n->nfile.fd;
123 1.1 cgd if ((flags & REDIR_PUSH) && sv->renamed[fd] == EMPTY) {
124 1.1 cgd INTOFF;
125 1.1 cgd if ((i = copyfd(fd, 10)) != EMPTY) {
126 1.1 cgd sv->renamed[fd] = i;
127 1.1 cgd close(fd);
128 1.1 cgd }
129 1.1 cgd INTON;
130 1.1 cgd if (i == EMPTY)
131 1.1 cgd error("Out of file descriptors");
132 1.1 cgd } else {
133 1.1 cgd close(fd);
134 1.1 cgd }
135 1.7 jtc if (fd == 0)
136 1.7 jtc fd0_redirected++;
137 1.1 cgd openredirect(n, memory);
138 1.1 cgd }
139 1.1 cgd if (memory[1])
140 1.1 cgd out1 = &memout;
141 1.1 cgd if (memory[2])
142 1.1 cgd out2 = &memout;
143 1.1 cgd }
144 1.1 cgd
145 1.1 cgd
146 1.1 cgd STATIC void
147 1.1 cgd openredirect(redir, memory)
148 1.1 cgd union node *redir;
149 1.1 cgd char memory[10];
150 1.1 cgd {
151 1.1 cgd int fd = redir->nfile.fd;
152 1.1 cgd char *fname;
153 1.1 cgd int f;
154 1.1 cgd
155 1.1 cgd /*
156 1.1 cgd * We suppress interrupts so that we won't leave open file
157 1.1 cgd * descriptors around. This may not be such a good idea because
158 1.1 cgd * an open of a device or a fifo can block indefinitely.
159 1.1 cgd */
160 1.1 cgd INTOFF;
161 1.1 cgd memory[fd] = 0;
162 1.1 cgd switch (redir->nfile.type) {
163 1.1 cgd case NFROM:
164 1.1 cgd fname = redir->nfile.expfname;
165 1.1 cgd if ((f = open(fname, O_RDONLY)) < 0)
166 1.1 cgd error("cannot open %s: %s", fname, errmsg(errno, E_OPEN));
167 1.1 cgd movefd:
168 1.1 cgd if (f != fd) {
169 1.1 cgd copyfd(f, fd);
170 1.1 cgd close(f);
171 1.1 cgd }
172 1.1 cgd break;
173 1.1 cgd case NTO:
174 1.1 cgd fname = redir->nfile.expfname;
175 1.1 cgd #ifdef O_CREAT
176 1.1 cgd if ((f = open(fname, O_WRONLY|O_CREAT|O_TRUNC, 0666)) < 0)
177 1.1 cgd error("cannot create %s: %s", fname, errmsg(errno, E_CREAT));
178 1.1 cgd #else
179 1.1 cgd if ((f = creat(fname, 0666)) < 0)
180 1.1 cgd error("cannot create %s: %s", fname, errmsg(errno, E_CREAT));
181 1.1 cgd #endif
182 1.1 cgd goto movefd;
183 1.1 cgd case NAPPEND:
184 1.1 cgd fname = redir->nfile.expfname;
185 1.1 cgd #ifdef O_APPEND
186 1.1 cgd if ((f = open(fname, O_WRONLY|O_CREAT|O_APPEND, 0666)) < 0)
187 1.1 cgd error("cannot create %s: %s", fname, errmsg(errno, E_CREAT));
188 1.1 cgd #else
189 1.1 cgd if ((f = open(fname, O_WRONLY)) < 0
190 1.1 cgd && (f = creat(fname, 0666)) < 0)
191 1.1 cgd error("cannot create %s: %s", fname, errmsg(errno, E_CREAT));
192 1.7 jtc lseek(f, (off_t)0, 2);
193 1.1 cgd #endif
194 1.1 cgd goto movefd;
195 1.1 cgd case NTOFD:
196 1.1 cgd case NFROMFD:
197 1.1 cgd if (redir->ndup.dupfd >= 0) { /* if not ">&-" */
198 1.1 cgd if (memory[redir->ndup.dupfd])
199 1.1 cgd memory[fd] = 1;
200 1.1 cgd else
201 1.1 cgd copyfd(redir->ndup.dupfd, fd);
202 1.1 cgd }
203 1.1 cgd break;
204 1.1 cgd case NHERE:
205 1.1 cgd case NXHERE:
206 1.1 cgd f = openhere(redir);
207 1.1 cgd goto movefd;
208 1.1 cgd default:
209 1.1 cgd abort();
210 1.1 cgd }
211 1.1 cgd INTON;
212 1.1 cgd }
213 1.1 cgd
214 1.1 cgd
215 1.1 cgd /*
216 1.1 cgd * Handle here documents. Normally we fork off a process to write the
217 1.1 cgd * data to a pipe. If the document is short, we can stuff the data in
218 1.1 cgd * the pipe without forking.
219 1.1 cgd */
220 1.1 cgd
221 1.1 cgd STATIC int
222 1.1 cgd openhere(redir)
223 1.1 cgd union node *redir;
224 1.1 cgd {
225 1.1 cgd int pip[2];
226 1.1 cgd int len;
227 1.1 cgd
228 1.1 cgd if (pipe(pip) < 0)
229 1.1 cgd error("Pipe call failed");
230 1.1 cgd if (redir->type == NHERE) {
231 1.1 cgd len = strlen(redir->nhere.doc->narg.text);
232 1.1 cgd if (len <= PIPESIZE) {
233 1.1 cgd xwrite(pip[1], redir->nhere.doc->narg.text, len);
234 1.1 cgd goto out;
235 1.1 cgd }
236 1.1 cgd }
237 1.1 cgd if (forkshell((struct job *)NULL, (union node *)NULL, FORK_NOJOB) == 0) {
238 1.1 cgd close(pip[0]);
239 1.1 cgd signal(SIGINT, SIG_IGN);
240 1.1 cgd signal(SIGQUIT, SIG_IGN);
241 1.1 cgd signal(SIGHUP, SIG_IGN);
242 1.1 cgd #ifdef SIGTSTP
243 1.1 cgd signal(SIGTSTP, SIG_IGN);
244 1.1 cgd #endif
245 1.1 cgd signal(SIGPIPE, SIG_DFL);
246 1.1 cgd if (redir->type == NHERE)
247 1.1 cgd xwrite(pip[1], redir->nhere.doc->narg.text, len);
248 1.1 cgd else
249 1.1 cgd expandhere(redir->nhere.doc, pip[1]);
250 1.1 cgd _exit(0);
251 1.1 cgd }
252 1.1 cgd out:
253 1.1 cgd close(pip[1]);
254 1.1 cgd return pip[0];
255 1.1 cgd }
256 1.1 cgd
257 1.1 cgd
258 1.1 cgd
259 1.1 cgd /*
260 1.1 cgd * Undo the effects of the last redirection.
261 1.1 cgd */
262 1.1 cgd
263 1.1 cgd void
264 1.1 cgd popredir() {
265 1.1 cgd register struct redirtab *rp = redirlist;
266 1.1 cgd int i;
267 1.1 cgd
268 1.1 cgd for (i = 0 ; i < 10 ; i++) {
269 1.1 cgd if (rp->renamed[i] != EMPTY) {
270 1.7 jtc if (i == 0)
271 1.7 jtc fd0_redirected--;
272 1.1 cgd close(i);
273 1.1 cgd if (rp->renamed[i] >= 0) {
274 1.1 cgd copyfd(rp->renamed[i], i);
275 1.1 cgd close(rp->renamed[i]);
276 1.1 cgd }
277 1.1 cgd }
278 1.1 cgd }
279 1.1 cgd INTOFF;
280 1.1 cgd redirlist = rp->next;
281 1.1 cgd ckfree(rp);
282 1.1 cgd INTON;
283 1.1 cgd }
284 1.1 cgd
285 1.1 cgd /*
286 1.1 cgd * Undo all redirections. Called on error or interrupt.
287 1.1 cgd */
288 1.1 cgd
289 1.1 cgd #ifdef mkinit
290 1.1 cgd
291 1.1 cgd INCLUDE "redir.h"
292 1.1 cgd
293 1.1 cgd RESET {
294 1.1 cgd while (redirlist)
295 1.1 cgd popredir();
296 1.1 cgd }
297 1.1 cgd
298 1.1 cgd SHELLPROC {
299 1.1 cgd clearredir();
300 1.1 cgd }
301 1.1 cgd
302 1.1 cgd #endif
303 1.1 cgd
304 1.7 jtc /* Return true if fd 0 has already been redirected at least once. */
305 1.7 jtc int
306 1.7 jtc fd0_redirected_p () {
307 1.7 jtc return fd0_redirected != 0;
308 1.7 jtc }
309 1.1 cgd
310 1.1 cgd /*
311 1.1 cgd * Discard all saved file descriptors.
312 1.1 cgd */
313 1.1 cgd
314 1.1 cgd void
315 1.1 cgd clearredir() {
316 1.1 cgd register struct redirtab *rp;
317 1.1 cgd int i;
318 1.1 cgd
319 1.1 cgd for (rp = redirlist ; rp ; rp = rp->next) {
320 1.1 cgd for (i = 0 ; i < 10 ; i++) {
321 1.1 cgd if (rp->renamed[i] >= 0) {
322 1.1 cgd close(rp->renamed[i]);
323 1.1 cgd }
324 1.1 cgd rp->renamed[i] = EMPTY;
325 1.1 cgd }
326 1.1 cgd }
327 1.1 cgd }
328 1.1 cgd
329 1.1 cgd
330 1.1 cgd
331 1.1 cgd /*
332 1.7 jtc * Copy a file descriptor to be >= to. Returns -1
333 1.1 cgd * if the source file descriptor is closed, EMPTY if there are no unused
334 1.1 cgd * file descriptors left.
335 1.1 cgd */
336 1.1 cgd
337 1.1 cgd int
338 1.9 cgd copyfd(from, to)
339 1.9 cgd int from;
340 1.9 cgd int to;
341 1.9 cgd {
342 1.1 cgd int newfd;
343 1.1 cgd
344 1.1 cgd newfd = fcntl(from, F_DUPFD, to);
345 1.1 cgd if (newfd < 0 && errno == EMFILE)
346 1.1 cgd return EMPTY;
347 1.1 cgd return newfd;
348 1.1 cgd }
349