show.c revision 1.35 1 1.35 kre /* $NetBSD: show.c,v 1.35 2017/03/16 13:09:06 kre Exp $ */
2 1.10 cgd
3 1.1 cgd /*-
4 1.5 jtc * Copyright (c) 1991, 1993
5 1.5 jtc * The Regents of the University of California. All rights reserved.
6 1.1 cgd *
7 1.35 kre * Copyright (c) 2016,2017 The NetBSD Foundation, Inc. All rights reserved.
8 1.35 kre *
9 1.1 cgd * This code is derived from software contributed to Berkeley by
10 1.1 cgd * Kenneth Almquist.
11 1.1 cgd *
12 1.1 cgd * Redistribution and use in source and binary forms, with or without
13 1.1 cgd * modification, are permitted provided that the following conditions
14 1.1 cgd * are met:
15 1.1 cgd * 1. Redistributions of source code must retain the above copyright
16 1.1 cgd * notice, this list of conditions and the following disclaimer.
17 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
18 1.1 cgd * notice, this list of conditions and the following disclaimer in the
19 1.1 cgd * documentation and/or other materials provided with the distribution.
20 1.35 kre * 3. Neither the name of the University, the NetBSD Foundation, nor the
21 1.35 kre * names of their contributors may be used to endorse or promote products
22 1.35 kre * derived from this software without specific prior written permission.
23 1.35 kre *
24 1.35 kre * THIS SOFTWARE IS PROVIDED BY THE REGENTS, FOUNDATION, AND CONTRIBUTORS
25 1.35 kre * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
26 1.35 kre * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
27 1.35 kre * A PARTICULAR PURPOSE ARE DISCLAIMED.
28 1.1 cgd *
29 1.35 kre * IN NO EVENT SHALL THE REGENTS, FOUNDATION OR CONTRIBUTORS BE LIABLE
30 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
31 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 1.1 cgd * SUCH DAMAGE.
37 1.1 cgd */
38 1.1 cgd
39 1.15 christos #include <sys/cdefs.h>
40 1.1 cgd #ifndef lint
41 1.10 cgd #if 0
42 1.11 christos static char sccsid[] = "@(#)show.c 8.3 (Berkeley) 5/4/95";
43 1.10 cgd #else
44 1.35 kre __RCSID("$NetBSD: show.c,v 1.35 2017/03/16 13:09:06 kre Exp $");
45 1.10 cgd #endif
46 1.1 cgd #endif /* not lint */
47 1.1 cgd
48 1.1 cgd #include <stdio.h>
49 1.11 christos #include <stdarg.h>
50 1.26 dsl #include <stdlib.h>
51 1.28 christos #include <unistd.h>
52 1.35 kre #include <fcntl.h>
53 1.35 kre #include <errno.h>
54 1.35 kre
55 1.35 kre #include <sys/uio.h>
56 1.11 christos
57 1.1 cgd #include "shell.h"
58 1.1 cgd #include "parser.h"
59 1.1 cgd #include "nodes.h"
60 1.1 cgd #include "mystring.h"
61 1.11 christos #include "show.h"
62 1.23 christos #include "options.h"
63 1.35 kre #include "redir.h"
64 1.35 kre #include "error.h"
65 1.35 kre
66 1.35 kre #if defined(DEBUG) && !defined(DBG_PID)
67 1.35 kre /*
68 1.35 kre * If this is compiled, it means this is being compiled in a shell that still
69 1.35 kre * has an older shell.h (a simpler TRACE() mechanism than is coming soon.)
70 1.35 kre *
71 1.35 kre * Compensate for as much of that as is missing and is needed here
72 1.35 kre * to compile and operate at all. After the other changes have appeared,
73 1.35 kre * this little block can (and should be) deleted (sometime).
74 1.35 kre *
75 1.35 kre * Try to avoid waiting 22 years...
76 1.35 kre */
77 1.35 kre #define DBG_PID 1
78 1.35 kre #define DBG_NEST 2
79 1.35 kre
80 1.35 kre /* decide at compile time for now (DBG_NEST won't work) */
81 1.35 kre static int DFlags = DBG_PID;
82 1.35 kre static int ShNest = 0;
83 1.35 kre #endif
84 1.35 kre
85 1.30 christos #define DEFINE_NODENAMES
86 1.30 christos #include "nodenames.h"
87 1.35 kre
88 1.35 kre #define TR_STD_WIDTH 60 /* tend to fold lines wider than this */
89 1.35 kre #define TR_IOVECS 10 /* number of lines or trace (max) / write */
90 1.35 kre
91 1.35 kre typedef struct traceinfo {
92 1.35 kre int tfd; /* file descriptor for open trace file */
93 1.35 kre int nxtiov; /* the buffer we should be writing to */
94 1.35 kre char lastc; /* the last non-white character output */
95 1.35 kre uint8_t supr; /* char classes to supress after \n */
96 1.35 kre pid_t pid; /* process id of process that opened that file */
97 1.35 kre size_t llen; /* number of chars in current output line */
98 1.35 kre size_t blen; /* chars used in current buffer being filled */
99 1.35 kre char * tracefile; /* name of the tracefile */
100 1.35 kre struct iovec lines[TR_IOVECS]; /* filled, flling, pending buffers */
101 1.35 kre } TFILE;
102 1.35 kre
103 1.35 kre /* These are auto turned off when non white space is printed */
104 1.35 kre #define SUP_NL 0x01 /* don't print \n */
105 1.35 kre #define SUP_SP 0x03 /* supress spaces */
106 1.35 kre #define SUP_WSP 0x04 /* supress all white space */
107 1.35 kre
108 1.35 kre #ifdef DEBUG
109 1.35 kre TFILE tracedata, *tracetfile;
110 1.35 kre FILE *tracefile; /* just for histedit */
111 1.30 christos #endif
112 1.1 cgd
113 1.35 kre #ifdef DEBUG
114 1.35 kre static void shtree(union node *, int, int, int, TFILE *);
115 1.35 kre static void shcmd(union node *, TFILE *);
116 1.35 kre static void shsubsh(union node *, TFILE *);
117 1.35 kre static void shredir(union node *, TFILE *, int);
118 1.35 kre static void sharg(union node *, TFILE *);
119 1.35 kre static void indent(int, TFILE *);
120 1.35 kre static void trstring(const char *);
121 1.35 kre static void trace_putc(char, TFILE *);
122 1.35 kre static void trace_puts(const char *, TFILE *);
123 1.35 kre static void trace_flush(TFILE *, int);
124 1.35 kre static char *trace_id(TFILE *);
125 1.35 kre
126 1.35 kre inline static int trlinelen(TFILE *);
127 1.35 kre #endif
128 1.1 cgd
129 1.35 kre
130 1.35 kre /*
131 1.35 kre * These functions are the externally visible interface
132 1.35 kre */
133 1.29 christos
134 1.1 cgd #ifdef DEBUG
135 1.35 kre void
136 1.35 kre opentrace(void)
137 1.35 kre {
138 1.35 kre char *s;
139 1.35 kre int fd;
140 1.35 kre int i;
141 1.35 kre pid_t pid;
142 1.35 kre
143 1.35 kre if (debug != 1) {
144 1.35 kre /* leave open because libedit might be using it */
145 1.35 kre if (tracefile)
146 1.35 kre fflush(tracefile);
147 1.35 kre if (tracetfile)
148 1.35 kre trace_flush(tracetfile, 1);
149 1.35 kre return;
150 1.35 kre }
151 1.35 kre pid = getpid();
152 1.35 kre if (asprintf(&s, "trace.%jd", (intmax_t)pid) <= 0) {
153 1.35 kre debug = 0;
154 1.35 kre error("Cannot asprintf tracefilename");
155 1.35 kre };
156 1.35 kre
157 1.35 kre fd = open(s, O_WRONLY|O_APPEND|O_CREAT, 0666);
158 1.35 kre if (fd == -1) {
159 1.35 kre debug = 0;
160 1.35 kre error("Can't open tracefile: %s (%s)\n", s, strerror(errno));
161 1.35 kre }
162 1.35 kre fd = to_upper_fd(fd);
163 1.35 kre if (fd <= 2) {
164 1.35 kre (void) close(fd);
165 1.35 kre debug = 0;
166 1.35 kre error("Attempt to use fd %d as tracefile thwarted\n", fd);
167 1.35 kre }
168 1.35 kre
169 1.35 kre /*
170 1.35 kre * This stuff is just so histedit has a FILE * to use
171 1.35 kre */
172 1.35 kre if (tracefile)
173 1.35 kre (void) fclose(tracefile); /* also closes tfd */
174 1.35 kre tracefile = fdopen(fd, "a"); /* don't care if it is NULL */
175 1.35 kre if (tracefile) /* except here... */
176 1.35 kre setlinebuf(tracefile);
177 1.35 kre
178 1.35 kre /*
179 1.35 kre * Now the real tracing setup
180 1.35 kre */
181 1.35 kre if (tracedata.tfd > 0 && tracedata.tfd != fd)
182 1.35 kre (void) close(tracedata.tfd); /* usually done by fclose() */
183 1.35 kre tracedata.tfd = fd;
184 1.35 kre tracedata.pid = pid;
185 1.35 kre tracedata.nxtiov = 0;
186 1.35 kre tracedata.blen = 0;
187 1.35 kre tracedata.llen = 0;
188 1.35 kre tracedata.lastc = '\0';
189 1.35 kre tracedata.supr = SUP_NL | SUP_WSP;
190 1.35 kre
191 1.35 kre #define replace(f, v) do { \
192 1.35 kre if (tracedata.f != NULL) \
193 1.35 kre free(tracedata.f); \
194 1.35 kre tracedata.f = v; \
195 1.35 kre } while (/*CONSTCOND*/ 0)
196 1.35 kre
197 1.35 kre replace(tracefile, s);
198 1.35 kre
199 1.35 kre for (i = 0; i < TR_IOVECS; i++) {
200 1.35 kre replace(lines[i].iov_base, NULL);
201 1.35 kre tracedata.lines[i].iov_len = 0;
202 1.35 kre }
203 1.35 kre
204 1.35 kre #undef replace
205 1.35 kre
206 1.35 kre tracetfile = &tracedata;
207 1.35 kre
208 1.35 kre trace_puts("\nTracing started.\n", tracetfile);
209 1.35 kre }
210 1.35 kre
211 1.35 kre void
212 1.35 kre trace(const char *fmt, ...)
213 1.35 kre {
214 1.35 kre va_list va;
215 1.35 kre char *s;
216 1.35 kre
217 1.35 kre if (debug != 1 || !tracetfile)
218 1.35 kre return;
219 1.35 kre va_start(va, fmt);
220 1.35 kre (void) vasprintf(&s, fmt, va);
221 1.35 kre va_end(va);
222 1.35 kre
223 1.35 kre trace_puts(s, tracetfile);
224 1.35 kre free(s);
225 1.35 kre if (tracetfile->llen == 0)
226 1.35 kre trace_flush(tracetfile, 0);
227 1.35 kre }
228 1.35 kre
229 1.35 kre void
230 1.35 kre tracev(const char *fmt, va_list va)
231 1.35 kre {
232 1.35 kre va_list ap;
233 1.35 kre char *s;
234 1.35 kre
235 1.35 kre if (debug != 1 || !tracetfile)
236 1.35 kre return;
237 1.35 kre va_copy(ap, va);
238 1.35 kre (void) vasprintf(&s, fmt, ap);
239 1.35 kre va_end(ap);
240 1.35 kre
241 1.35 kre trace_puts(s, tracetfile);
242 1.35 kre free(s);
243 1.35 kre if (tracetfile->llen == 0)
244 1.35 kre trace_flush(tracetfile, 0);
245 1.35 kre }
246 1.35 kre
247 1.35 kre
248 1.35 kre void
249 1.35 kre trputs(const char *s)
250 1.35 kre {
251 1.35 kre if (debug != 1 || !tracetfile)
252 1.35 kre return;
253 1.35 kre trace_puts(s, tracetfile);
254 1.35 kre }
255 1.35 kre
256 1.35 kre void
257 1.35 kre trputc(int c)
258 1.35 kre {
259 1.35 kre if (debug != 1 || !tracetfile)
260 1.35 kre return;
261 1.35 kre trace_putc(c, tracetfile);
262 1.35 kre }
263 1.1 cgd
264 1.11 christos void
265 1.23 christos showtree(union node *n)
266 1.8 cgd {
267 1.35 kre TFILE *fp;
268 1.29 christos
269 1.35 kre if ((fp = tracetfile) == NULL)
270 1.35 kre return;
271 1.29 christos
272 1.35 kre trace_puts("showtree(", fp);
273 1.29 christos if (n == NULL)
274 1.35 kre trace_puts("NULL", fp);
275 1.29 christos else if (n == NEOF)
276 1.35 kre trace_puts("NEOF", fp);
277 1.35 kre else
278 1.35 kre trace("%p", n);
279 1.35 kre trace_puts(") called\n", fp);
280 1.29 christos if (n != NULL && n != NEOF)
281 1.35 kre shtree(n, 1, 1, 1, fp);
282 1.1 cgd }
283 1.1 cgd
284 1.35 kre void
285 1.35 kre trargs(char **ap)
286 1.35 kre {
287 1.35 kre if (debug != 1 || !tracetfile)
288 1.35 kre return;
289 1.35 kre while (*ap) {
290 1.35 kre trstring(*ap++);
291 1.35 kre if (*ap)
292 1.35 kre trace_putc(' ', tracetfile);
293 1.35 kre else
294 1.35 kre trace_putc('\n', tracetfile);
295 1.35 kre }
296 1.35 kre }
297 1.35 kre #endif
298 1.35 kre
299 1.35 kre
300 1.35 kre /*
301 1.35 kre * Beyond here we just have the implementation of all of that
302 1.35 kre */
303 1.1 cgd
304 1.35 kre
305 1.35 kre #ifdef DEBUG
306 1.35 kre
307 1.35 kre inline static int
308 1.35 kre trlinelen(TFILE * fp)
309 1.35 kre {
310 1.35 kre return fp->llen;
311 1.35 kre }
312 1.35 kre
313 1.35 kre static void
314 1.35 kre shtree(union node *n, int ind, int ilvl, int nl, TFILE *fp)
315 1.8 cgd {
316 1.1 cgd struct nodelist *lp;
317 1.18 pk const char *s;
318 1.1 cgd
319 1.29 christos if (n == NULL) {
320 1.29 christos if (nl)
321 1.35 kre trace_putc('\n', fp);
322 1.35 kre return;
323 1.29 christos }
324 1.9 christos
325 1.35 kre indent(ind, fp);
326 1.29 christos switch (n->type) {
327 1.1 cgd case NSEMI:
328 1.35 kre s = NULL;
329 1.1 cgd goto binop;
330 1.1 cgd case NAND:
331 1.1 cgd s = " && ";
332 1.1 cgd goto binop;
333 1.1 cgd case NOR:
334 1.1 cgd s = " || ";
335 1.1 cgd binop:
336 1.35 kre shtree(n->nbinary.ch1, 0, ilvl, 0, fp);
337 1.35 kre if (s != NULL)
338 1.35 kre trace_puts(s, fp);
339 1.35 kre if (trlinelen(fp) >= TR_STD_WIDTH) {
340 1.35 kre trace_putc('\n', fp);
341 1.35 kre indent(ind < 0 ? 2 : ind + 1, fp);
342 1.35 kre } else if (s == NULL) {
343 1.35 kre if (fp->lastc != '&')
344 1.35 kre trace_puts("; ", fp);
345 1.35 kre else
346 1.35 kre trace_putc(' ', fp);
347 1.29 christos }
348 1.35 kre shtree(n->nbinary.ch2, 0, ilvl, nl, fp);
349 1.1 cgd break;
350 1.1 cgd case NCMD:
351 1.35 kre shcmd(n, fp);
352 1.35 kre if (n->ncmd.backgnd)
353 1.35 kre trace_puts(" &", fp);
354 1.35 kre if (nl && trlinelen(fp) > 0)
355 1.35 kre trace_putc('\n', fp);
356 1.1 cgd break;
357 1.1 cgd case NPIPE:
358 1.1 cgd for (lp = n->npipe.cmdlist ; lp ; lp = lp->next) {
359 1.35 kre shtree(lp->n, 0, ilvl, 0, fp);
360 1.29 christos if (lp->next) {
361 1.35 kre trace_puts(" |", fp);
362 1.35 kre if (trlinelen(fp) >= TR_STD_WIDTH) {
363 1.35 kre trace_putc('\n', fp);
364 1.35 kre indent((ind < 0 ? ilvl : ind) + 1, fp);
365 1.35 kre } else
366 1.35 kre trace_putc(' ', fp);
367 1.29 christos }
368 1.1 cgd }
369 1.1 cgd if (n->npipe.backgnd)
370 1.35 kre trace_puts(" &", fp);
371 1.35 kre if (nl || trlinelen(fp) >= TR_STD_WIDTH)
372 1.35 kre trace_putc('\n', fp);
373 1.1 cgd break;
374 1.35 kre case NBACKGND:
375 1.32 christos case NSUBSHELL:
376 1.35 kre shsubsh(n, fp);
377 1.35 kre if (n->type == NBACKGND)
378 1.35 kre trace_puts(" &", fp);
379 1.35 kre if (nl && trlinelen(fp) > 0)
380 1.35 kre trace_putc('\n', fp);
381 1.35 kre break;
382 1.35 kre case NDEFUN:
383 1.35 kre trace_puts(n->narg.text, fp);
384 1.35 kre trace_puts("() {\n", fp);
385 1.35 kre indent(ind, fp);
386 1.35 kre shtree(n->narg.next, (ind < 0 ? ilvl : ind) + 1, ilvl+1, 1, fp);
387 1.35 kre indent(ind, fp);
388 1.35 kre trace_puts("}\n", fp);
389 1.35 kre break;
390 1.35 kre case NNOT:
391 1.35 kre trace_puts("! ", fp);
392 1.35 kre shtree(n->nnot.com, -1, ilvl, nl, fp);
393 1.35 kre break;
394 1.35 kre case NREDIR:
395 1.35 kre shtree(n->nredir.n, -1, ilvl, 0, fp);
396 1.35 kre shredir(n->nredir.redirect, fp, n->nredir.n == NULL);
397 1.35 kre if (nl)
398 1.35 kre trace_putc('\n', fp);
399 1.35 kre break;
400 1.35 kre
401 1.35 kre case NIF:
402 1.35 kre itsif:
403 1.35 kre trace_puts("if ", fp);
404 1.35 kre shtree(n->nif.test, -1, ilvl, 0, fp);
405 1.35 kre if (trlinelen(fp) > 0 && trlinelen(fp) < TR_STD_WIDTH) {
406 1.35 kre if (fp->lastc != '&')
407 1.35 kre trace_puts(" ;", fp);
408 1.35 kre } else
409 1.35 kre indent(ilvl, fp);
410 1.35 kre trace_puts(" then ", fp);
411 1.35 kre if (nl || trlinelen(fp) > TR_STD_WIDTH - 24)
412 1.35 kre indent(ilvl+1, fp);
413 1.35 kre shtree(n->nif.ifpart, -1, ilvl + 1, 0, fp);
414 1.35 kre if (trlinelen(fp) > 0 && trlinelen(fp) < TR_STD_WIDTH) {
415 1.35 kre if (fp->lastc != '&')
416 1.35 kre trace_puts(" ;", fp);
417 1.35 kre } else
418 1.35 kre indent(ilvl, fp);
419 1.35 kre if (n->nif.elsepart && n->nif.elsepart->type == NIF) {
420 1.35 kre if (nl || trlinelen(fp) > TR_STD_WIDTH - 24)
421 1.35 kre indent(ilvl, fp);
422 1.35 kre n = n->nif.elsepart;
423 1.35 kre trace_puts(" el", fp);
424 1.35 kre goto itsif;
425 1.35 kre }
426 1.35 kre if (n->nif.elsepart) {
427 1.35 kre if (nl || trlinelen(fp) > TR_STD_WIDTH - 24)
428 1.35 kre indent(ilvl+1, fp);
429 1.35 kre trace_puts(" else ", fp);
430 1.35 kre shtree(n->nif.elsepart, -1, ilvl + 1, 0, fp);
431 1.35 kre if (fp->lastc != '&')
432 1.35 kre trace_puts(" ;", fp);
433 1.35 kre }
434 1.35 kre trace_puts(" fi", fp);
435 1.35 kre if (nl)
436 1.35 kre trace_putc('\n', fp);
437 1.35 kre break;
438 1.35 kre
439 1.35 kre case NWHILE:
440 1.35 kre trace_puts("while ", fp);
441 1.35 kre goto aloop;
442 1.35 kre case NUNTIL:
443 1.35 kre trace_puts("until ", fp);
444 1.35 kre aloop:
445 1.35 kre shtree(n->nbinary.ch1, -1, ilvl, 0, fp);
446 1.35 kre if (trlinelen(fp) > 0 && trlinelen(fp) < TR_STD_WIDTH) {
447 1.35 kre if (fp->lastc != '&')
448 1.35 kre trace_puts(" ;", fp);
449 1.35 kre } else
450 1.35 kre trace_putc('\n', fp);
451 1.35 kre trace_puts(" do ", fp);
452 1.35 kre shtree(n->nbinary.ch1, -1, ilvl + 1, 1, fp);
453 1.35 kre trace_puts(" done ", fp);
454 1.35 kre if (nl)
455 1.35 kre trace_putc('\n', fp);
456 1.35 kre break;
457 1.35 kre
458 1.35 kre case NFOR:
459 1.35 kre trace_puts("for ", fp);
460 1.35 kre trace_puts(n->nfor.var, fp);
461 1.35 kre if (n->nfor.args) {
462 1.35 kre union node *argp;
463 1.35 kre
464 1.35 kre trace_puts(" in ", fp);
465 1.35 kre for (argp = n->nfor.args; argp; argp=argp->narg.next) {
466 1.35 kre sharg(argp, fp);
467 1.35 kre trace_putc(' ', fp);
468 1.35 kre }
469 1.35 kre if (trlinelen(fp) > 0 && trlinelen(fp) < TR_STD_WIDTH) {
470 1.35 kre if (fp->lastc != '&')
471 1.35 kre trace_putc(';', fp);
472 1.35 kre } else
473 1.35 kre trace_putc('\n', fp);
474 1.35 kre }
475 1.35 kre trace_puts(" do ", fp);
476 1.35 kre shtree(n->nfor.body, -1, ilvl + 1, 0, fp);
477 1.35 kre if (fp->lastc != '&')
478 1.35 kre trace_putc(';', fp);
479 1.35 kre trace_puts(" done", fp);
480 1.35 kre if (nl)
481 1.35 kre trace_putc('\n', fp);
482 1.35 kre break;
483 1.35 kre
484 1.35 kre case NCASE:
485 1.35 kre trace_puts("case ", fp);
486 1.35 kre sharg(n->ncase.expr, fp);
487 1.35 kre trace_puts(" in", fp);
488 1.35 kre if (nl)
489 1.35 kre trace_putc('\n', fp);
490 1.35 kre {
491 1.35 kre union node *cp;
492 1.35 kre
493 1.35 kre for (cp = n->ncase.cases ; cp ; cp = cp->nclist.next) {
494 1.35 kre union node *patp;
495 1.35 kre
496 1.35 kre if (nl || trlinelen(fp) > TR_STD_WIDTH - 16)
497 1.35 kre indent(ilvl, fp);
498 1.35 kre else
499 1.35 kre trace_putc(' ', fp);
500 1.35 kre trace_putc('(', fp);
501 1.35 kre patp = cp->nclist.pattern;
502 1.35 kre while (patp != NULL) {
503 1.35 kre trace_putc(' ', fp);
504 1.35 kre sharg(patp, fp);
505 1.35 kre trace_putc(' ', fp);
506 1.35 kre if ((patp = patp->narg.next) != NULL)
507 1.35 kre trace_putc('|', fp);
508 1.35 kre }
509 1.35 kre trace_putc(')', fp);
510 1.35 kre if (nl)
511 1.35 kre indent(ilvl + 1, fp);
512 1.35 kre else
513 1.35 kre trace_putc(' ', fp);
514 1.35 kre shtree(cp->nclist.body, -1, ilvl+2, 0, fp);
515 1.35 kre trace_puts(" ;;", fp);
516 1.35 kre if (nl)
517 1.35 kre trace_putc('\n', fp);
518 1.35 kre }
519 1.35 kre }
520 1.35 kre if (nl) {
521 1.35 kre trace_putc('\n', fp);
522 1.35 kre indent(ind, fp);
523 1.35 kre } else
524 1.35 kre trace_putc(' ', fp);
525 1.35 kre trace_puts("esac", fp);
526 1.29 christos if (nl)
527 1.35 kre trace_putc('\n', fp);
528 1.35 kre break;
529 1.35 kre
530 1.35 kre default: {
531 1.35 kre char *str;
532 1.35 kre
533 1.35 kre asprintf(&str, "<node type %d [%s]>", n->type,
534 1.35 kre NODETYPENAME(n->type));
535 1.35 kre trace_puts(str, fp);
536 1.35 kre free(str);
537 1.35 kre if (nl)
538 1.35 kre trace_putc('\n', fp);
539 1.35 kre }
540 1.1 cgd break;
541 1.1 cgd }
542 1.1 cgd }
543 1.1 cgd
544 1.1 cgd
545 1.35 kre static void
546 1.35 kre shcmd(union node *cmd, TFILE *fp)
547 1.11 christos {
548 1.1 cgd union node *np;
549 1.1 cgd int first;
550 1.1 cgd
551 1.1 cgd first = 1;
552 1.1 cgd for (np = cmd->ncmd.args ; np ; np = np->narg.next) {
553 1.1 cgd if (! first)
554 1.35 kre trace_putc(' ', fp);
555 1.35 kre sharg(np, fp);
556 1.1 cgd first = 0;
557 1.1 cgd }
558 1.35 kre shredir(cmd->ncmd.redirect, fp, first);
559 1.32 christos }
560 1.32 christos
561 1.35 kre static void
562 1.35 kre shsubsh(union node *cmd, TFILE *fp)
563 1.32 christos {
564 1.35 kre trace_puts(" ( ", fp);
565 1.35 kre shtree(cmd->nredir.n, -1, 3, 0, fp);
566 1.35 kre trace_puts(" ) ", fp);
567 1.35 kre shredir(cmd->ncmd.redirect, fp, 1);
568 1.32 christos }
569 1.32 christos
570 1.35 kre static void
571 1.35 kre shredir(union node *np, TFILE *fp, int first)
572 1.32 christos {
573 1.32 christos const char *s;
574 1.32 christos int dftfd;
575 1.32 christos char buf[106];
576 1.32 christos
577 1.35 kre for ( ; np ; np = np->nfile.next) {
578 1.1 cgd if (! first)
579 1.35 kre trace_putc(' ', fp);
580 1.1 cgd switch (np->nfile.type) {
581 1.35 kre case NTO: s = ">"; dftfd = 1; break;
582 1.35 kre case NCLOBBER: s = ">|"; dftfd = 1; break;
583 1.35 kre case NAPPEND: s = ">>"; dftfd = 1; break;
584 1.35 kre case NTOFD: s = ">&"; dftfd = 1; break;
585 1.35 kre case NFROM: s = "<"; dftfd = 0; break;
586 1.35 kre case NFROMFD: s = "<&"; dftfd = 0; break;
587 1.35 kre case NFROMTO: s = "<>"; dftfd = 0; break;
588 1.35 kre case NXHERE: /* FALLTHROUGH */
589 1.35 kre case NHERE: s = "<<"; dftfd = 0; break;
590 1.35 kre default: s = "*error*"; dftfd = 0; break;
591 1.35 kre }
592 1.35 kre if (np->nfile.fd != dftfd) {
593 1.35 kre sprintf(buf, "%d", np->nfile.fd);
594 1.35 kre trace_puts(buf, fp);
595 1.35 kre }
596 1.35 kre trace_puts(s, fp);
597 1.1 cgd if (np->nfile.type == NTOFD || np->nfile.type == NFROMFD) {
598 1.35 kre if (np->ndup.vname)
599 1.35 kre sharg(np->ndup.vname, fp);
600 1.35 kre else {
601 1.35 kre sprintf(buf, "%d", np->ndup.dupfd);
602 1.35 kre trace_puts(buf, fp);
603 1.35 kre }
604 1.31 christos } else
605 1.31 christos if (np->nfile.type == NHERE || np->nfile.type == NXHERE) {
606 1.31 christos if (np->nfile.type == NHERE)
607 1.35 kre trace_putc('\\', fp);
608 1.35 kre trace_puts("!!!\n", fp);
609 1.32 christos s = np->nhere.doc->narg.text;
610 1.32 christos if (strlen(s) > 100) {
611 1.32 christos memmove(buf, s, 100);
612 1.32 christos buf[100] = '\0';
613 1.35 kre strcat(buf, " ...\n");
614 1.32 christos s = buf;
615 1.32 christos }
616 1.35 kre trace_puts(s, fp);
617 1.35 kre trace_puts("!!! ", fp);
618 1.1 cgd } else {
619 1.35 kre sharg(np->nfile.fname, fp);
620 1.1 cgd }
621 1.1 cgd first = 0;
622 1.1 cgd }
623 1.1 cgd }
624 1.1 cgd
625 1.35 kre static void
626 1.35 kre sharg(union node *arg, TFILE *fp)
627 1.23 christos {
628 1.35 kre char *p, *s;
629 1.1 cgd struct nodelist *bqlist;
630 1.35 kre int subtype = 0;
631 1.35 kre int quoted = 0;
632 1.1 cgd
633 1.1 cgd if (arg->type != NARG) {
634 1.35 kre asprintf(&s, "<node type %d> ! NARG\n", arg->type);
635 1.35 kre trace_puts(s, fp);
636 1.35 kre abort(); /* no need to free s, better not to */
637 1.1 cgd }
638 1.35 kre
639 1.1 cgd bqlist = arg->narg.backquote;
640 1.1 cgd for (p = arg->narg.text ; *p ; p++) {
641 1.1 cgd switch (*p) {
642 1.1 cgd case CTLESC:
643 1.35 kre trace_putc('\\', fp);
644 1.35 kre trace_putc(*++p, fp);
645 1.1 cgd break;
646 1.35 kre
647 1.1 cgd case CTLVAR:
648 1.1 cgd subtype = *++p;
649 1.35 kre if (!quoted != !(subtype & VSQUOTE))
650 1.35 kre trace_putc('"', fp);
651 1.35 kre trace_putc('$', fp);
652 1.35 kre trace_putc('{', fp);
653 1.35 kre if ((subtype & VSTYPE) == VSLENGTH)
654 1.35 kre trace_putc('#', fp);
655 1.9 christos
656 1.29 christos while (*++p != '=')
657 1.35 kre trace_putc(*p, fp);
658 1.9 christos
659 1.1 cgd if (subtype & VSNUL)
660 1.35 kre trace_putc(':', fp);
661 1.9 christos
662 1.1 cgd switch (subtype & VSTYPE) {
663 1.1 cgd case VSNORMAL:
664 1.35 kre /* { */
665 1.35 kre trace_putc('}', fp);
666 1.35 kre if (!quoted != !(subtype & VSQUOTE))
667 1.35 kre trace_putc('"', fp);
668 1.1 cgd break;
669 1.1 cgd case VSMINUS:
670 1.35 kre trace_putc('-', fp);
671 1.1 cgd break;
672 1.1 cgd case VSPLUS:
673 1.35 kre trace_putc('+', fp);
674 1.1 cgd break;
675 1.1 cgd case VSQUESTION:
676 1.35 kre trace_putc('?', fp);
677 1.1 cgd break;
678 1.1 cgd case VSASSIGN:
679 1.35 kre trace_putc('=', fp);
680 1.9 christos break;
681 1.35 kre case VSTRIMLEFTMAX:
682 1.35 kre trace_putc('#', fp);
683 1.35 kre /* FALLTHRU */
684 1.9 christos case VSTRIMLEFT:
685 1.35 kre trace_putc('#', fp);
686 1.9 christos break;
687 1.35 kre case VSTRIMRIGHTMAX:
688 1.35 kre trace_putc('%', fp);
689 1.35 kre /* FALLTHRU */
690 1.9 christos case VSTRIMRIGHT:
691 1.35 kre trace_putc('%', fp);
692 1.9 christos break;
693 1.35 kre case VSLENGTH:
694 1.9 christos break;
695 1.35 kre default: {
696 1.35 kre char str[32];
697 1.35 kre
698 1.35 kre snprintf(str, sizeof str,
699 1.35 kre "<subtype %d>", subtype);
700 1.35 kre trace_puts(str, fp);
701 1.35 kre }
702 1.1 cgd break;
703 1.1 cgd }
704 1.1 cgd break;
705 1.1 cgd case CTLENDVAR:
706 1.35 kre /* { */
707 1.35 kre trace_putc('}', fp);
708 1.35 kre if (!quoted != !(subtype & VSQUOTE))
709 1.35 kre trace_putc('"', fp);
710 1.35 kre subtype = 0;
711 1.35 kre break;
712 1.35 kre
713 1.35 kre case CTLBACKQ|CTLQUOTE:
714 1.35 kre if (!quoted)
715 1.35 kre trace_putc('"', fp);
716 1.35 kre /* FALLTHRU */
717 1.1 cgd case CTLBACKQ:
718 1.35 kre trace_putc('$', fp);
719 1.35 kre trace_putc('(', fp);
720 1.35 kre if (bqlist) {
721 1.35 kre shtree(bqlist->n, -1, 3, 0, fp);
722 1.35 kre bqlist = bqlist->next;
723 1.35 kre } else
724 1.35 kre trace_puts("???", fp);
725 1.35 kre trace_putc(')', fp);
726 1.35 kre if (!quoted && *p == (CTLBACKQ|CTLQUOTE))
727 1.35 kre trace_putc('"', fp);
728 1.35 kre break;
729 1.35 kre
730 1.35 kre case CTLQUOTEMARK:
731 1.35 kre if (subtype != 0 || !quoted) {
732 1.35 kre trace_putc('"', fp);
733 1.35 kre quoted++;
734 1.35 kre }
735 1.35 kre break;
736 1.35 kre case CTLQUOTEEND:
737 1.35 kre trace_putc('"', fp);
738 1.35 kre quoted--;
739 1.35 kre break;
740 1.35 kre case CTLARI:
741 1.35 kre trace_puts("$(( ", fp);
742 1.35 kre break;
743 1.35 kre case CTLENDARI:
744 1.35 kre trace_puts(" ))", fp);
745 1.1 cgd break;
746 1.35 kre
747 1.1 cgd default:
748 1.35 kre if (*p == '$')
749 1.35 kre trace_putc('\\', fp);
750 1.35 kre trace_putc(*p, fp);
751 1.1 cgd break;
752 1.1 cgd }
753 1.1 cgd }
754 1.35 kre if (quoted)
755 1.35 kre trace_putc('"', fp);
756 1.1 cgd }
757 1.1 cgd
758 1.1 cgd
759 1.35 kre static void
760 1.35 kre indent(int amount, TFILE *fp)
761 1.8 cgd {
762 1.1 cgd int i;
763 1.1 cgd
764 1.35 kre if (amount <= 0)
765 1.35 kre return;
766 1.35 kre
767 1.35 kre amount <<= 2; /* indent slots -> chars */
768 1.35 kre
769 1.35 kre i = trlinelen(fp);
770 1.35 kre fp->supr = SUP_NL;
771 1.35 kre if (i > amount) {
772 1.35 kre trace_putc('\n', fp);
773 1.35 kre i = 0;
774 1.35 kre }
775 1.35 kre fp->supr = 0;
776 1.35 kre for (; i < amount - 7 ; i++) {
777 1.35 kre trace_putc('\t', fp);
778 1.35 kre i |= 7;
779 1.35 kre }
780 1.35 kre while (i < amount) {
781 1.35 kre trace_putc(' ', fp);
782 1.35 kre i++;
783 1.1 cgd }
784 1.35 kre fp->supr = SUP_WSP;
785 1.1 cgd }
786 1.1 cgd
787 1.35 kre static void
788 1.35 kre trace_putc(char c, TFILE *fp)
789 1.35 kre {
790 1.35 kre char *p;
791 1.1 cgd
792 1.35 kre if (c == '\0')
793 1.35 kre return;
794 1.35 kre if (debug == 0 || fp == NULL)
795 1.35 kre return;
796 1.1 cgd
797 1.35 kre if (fp->llen == 0) {
798 1.35 kre if (fp->blen != 0)
799 1.35 kre abort();
800 1.1 cgd
801 1.35 kre if ((fp->supr & SUP_NL) && c == '\n')
802 1.35 kre return;
803 1.35 kre if ((fp->supr & (SUP_WSP|SUP_SP)) && c == ' ')
804 1.35 kre return;
805 1.35 kre if ((fp->supr & SUP_WSP) && c == '\t')
806 1.35 kre return;
807 1.1 cgd
808 1.35 kre if (fp->nxtiov >= TR_IOVECS - 1) /* should be rare */
809 1.35 kre trace_flush(fp, 0);
810 1.1 cgd
811 1.35 kre p = trace_id(fp);
812 1.35 kre if (p != NULL) {
813 1.35 kre fp->lines[fp->nxtiov].iov_base = p;
814 1.35 kre fp->lines[fp->nxtiov].iov_len = strlen(p);
815 1.35 kre fp->nxtiov++;
816 1.35 kre }
817 1.35 kre } else if (fp->blen && fp->blen >= fp->lines[fp->nxtiov].iov_len) {
818 1.35 kre fp->blen = 0;
819 1.35 kre if (++fp->nxtiov >= TR_IOVECS)
820 1.35 kre trace_flush(fp, 0);
821 1.35 kre }
822 1.1 cgd
823 1.35 kre if (fp->lines[fp->nxtiov].iov_len == 0) {
824 1.35 kre p = (char *)malloc(2 * TR_STD_WIDTH);
825 1.35 kre if (p == NULL) {
826 1.35 kre trace_flush(fp, 1);
827 1.35 kre debug = 0;
828 1.35 kre return;
829 1.35 kre }
830 1.35 kre *p = '\0';
831 1.35 kre fp->lines[fp->nxtiov].iov_base = p;
832 1.35 kre fp->lines[fp->nxtiov].iov_len = 2 * TR_STD_WIDTH;
833 1.35 kre fp->blen = 0;
834 1.35 kre }
835 1.35 kre
836 1.35 kre p = (char *)fp->lines[fp->nxtiov].iov_base + fp->blen++;
837 1.35 kre *p++ = c;
838 1.35 kre *p = 0;
839 1.35 kre
840 1.35 kre if (c != ' ' && c != '\t' && c != '\n') {
841 1.35 kre fp->lastc = c;
842 1.35 kre fp->supr = 0;
843 1.35 kre }
844 1.35 kre
845 1.35 kre if (c == '\n') {
846 1.35 kre fp->lines[fp->nxtiov++].iov_len = fp->blen;
847 1.35 kre fp->blen = 0;
848 1.35 kre fp->llen = 0;
849 1.35 kre fp->supr |= SUP_NL;
850 1.1 cgd return;
851 1.35 kre }
852 1.35 kre
853 1.35 kre if (c == '\t')
854 1.35 kre fp->llen |= 7;
855 1.35 kre fp->llen++;
856 1.12 christos }
857 1.1 cgd
858 1.11 christos void
859 1.35 kre trace_flush(TFILE *fp, int all)
860 1.11 christos {
861 1.35 kre int niov, i;
862 1.35 kre ssize_t written;
863 1.22 wiz
864 1.35 kre niov = fp->nxtiov;
865 1.35 kre if (all && fp->blen > 0) {
866 1.35 kre fp->lines[niov].iov_len = fp->blen;
867 1.35 kre fp->blen = 0;
868 1.35 kre fp->llen = 0;
869 1.35 kre niov++;
870 1.35 kre }
871 1.35 kre if (niov == 0)
872 1.35 kre return;
873 1.35 kre if (fp->blen > 0 && --niov == 0)
874 1.23 christos return;
875 1.35 kre written = writev(fp->tfd, fp->lines, niov);
876 1.35 kre for (i = 0; i < niov; i++) {
877 1.35 kre free(fp->lines[i].iov_base);
878 1.35 kre fp->lines[i].iov_base = NULL;
879 1.35 kre fp->lines[i].iov_len = 0;
880 1.35 kre }
881 1.35 kre if (written == -1) {
882 1.35 kre if (fp->blen > 0) {
883 1.35 kre free(fp->lines[niov].iov_base);
884 1.35 kre fp->lines[niov].iov_base = NULL;
885 1.35 kre fp->lines[niov].iov_len = 0;
886 1.35 kre }
887 1.35 kre debug = 0;
888 1.35 kre fp->blen = 0;
889 1.35 kre fp->llen = 0;
890 1.35 kre return;
891 1.35 kre }
892 1.35 kre if (fp->blen > 0) {
893 1.35 kre fp->lines[0].iov_base = fp->lines[niov].iov_base;
894 1.35 kre fp->lines[0].iov_len = fp->lines[niov].iov_len;
895 1.35 kre fp->lines[niov].iov_base = NULL;
896 1.35 kre fp->lines[niov].iov_len = 0;
897 1.35 kre }
898 1.35 kre fp->nxtiov = 0;
899 1.1 cgd }
900 1.1 cgd
901 1.24 dsl void
902 1.35 kre trace_puts(const char *s, TFILE *fp)
903 1.24 dsl {
904 1.35 kre char c;
905 1.35 kre
906 1.35 kre while ((c = *s++) != '\0')
907 1.35 kre trace_putc(c, fp);
908 1.24 dsl }
909 1.24 dsl
910 1.35 kre inline static char *
911 1.35 kre trace_id(TFILE *tf)
912 1.35 kre {
913 1.35 kre int i;
914 1.35 kre char indent[16];
915 1.35 kre char *p;
916 1.1 cgd
917 1.35 kre if (DFlags & DBG_NEST) {
918 1.35 kre p = indent;
919 1.35 kre for (i = 0; i < 6; i++)
920 1.35 kre *p++ = (i < ShNest) ? '#' : ' ';
921 1.35 kre while (i++ < ShNest && p < &indent[sizeof indent - 1])
922 1.35 kre *p++ = '#';
923 1.35 kre *p = '\0';
924 1.35 kre } else
925 1.35 kre indent[0] = '\0';
926 1.35 kre
927 1.35 kre if (DFlags & DBG_PID) {
928 1.35 kre i = getpid();
929 1.35 kre (void) asprintf(&p, "%5d%c%s\t", i,
930 1.35 kre i == tf->pid ? ':' : '=', indent);
931 1.35 kre return p;
932 1.35 kre } else if (DFlags & DBG_NEST) {
933 1.35 kre *p++ = '\t';
934 1.35 kre *p = '\0';
935 1.35 kre (void) asprintf(&p, "%s\t", indent);
936 1.35 kre return p;
937 1.35 kre }
938 1.35 kre return NULL;
939 1.1 cgd }
940 1.1 cgd
941 1.35 kre /*
942 1.35 kre * Used only from trargs(), which itself is used only to print
943 1.35 kre * arg lists (argv[]) either that were passed into this shell, or
944 1.35 kre * the arg list about to be given to some other command (incl
945 1.35 kre * builtins, and functions) as their argv[]. If any of the CTL*
946 1.35 kre * chars seem to appear, they really should be just treated as data,
947 1.35 kre * not special... But this is just debug, so, who cares!
948 1.35 kre */
949 1.8 cgd static void
950 1.35 kre trstring(const char *s)
951 1.8 cgd {
952 1.35 kre const char *p;
953 1.1 cgd char c;
954 1.35 kre TFILE *fp;
955 1.1 cgd
956 1.35 kre if (debug != 1 || !tracetfile)
957 1.1 cgd return;
958 1.35 kre fp = tracetfile;
959 1.35 kre trace_putc('"', fp);
960 1.1 cgd for (p = s ; *p ; p++) {
961 1.1 cgd switch (*p) {
962 1.1 cgd case '\n': c = 'n'; goto backslash;
963 1.1 cgd case '\t': c = 't'; goto backslash;
964 1.1 cgd case '\r': c = 'r'; goto backslash;
965 1.1 cgd case '"': c = '"'; goto backslash;
966 1.1 cgd case '\\': c = '\\'; goto backslash;
967 1.1 cgd case CTLESC: c = 'e'; goto backslash;
968 1.1 cgd case CTLVAR: c = 'v'; goto backslash;
969 1.1 cgd case CTLVAR+CTLQUOTE: c = 'V'; goto backslash;
970 1.1 cgd case CTLBACKQ: c = 'q'; goto backslash;
971 1.1 cgd case CTLBACKQ+CTLQUOTE: c = 'Q'; goto backslash;
972 1.35 kre backslash: trace_putc('\\', fp);
973 1.35 kre trace_putc(c, fp);
974 1.1 cgd break;
975 1.1 cgd default:
976 1.1 cgd if (*p >= ' ' && *p <= '~')
977 1.35 kre trace_putc(*p, fp);
978 1.1 cgd else {
979 1.35 kre trace_putc('\\', fp);
980 1.35 kre trace_putc(*p >> 6 & 03, fp);
981 1.35 kre trace_putc(*p >> 3 & 07, fp);
982 1.35 kre trace_putc(*p & 07, fp);
983 1.1 cgd }
984 1.1 cgd break;
985 1.1 cgd }
986 1.1 cgd }
987 1.35 kre trace_putc('"', fp);
988 1.1 cgd }
989 1.1 cgd
990 1.5 jtc #endif /* DEBUG */
991