/* $OpenBSD: tree.c,v 1.5 1997/09/01 18:30:15 deraadt Exp $ */ /* * command tree climbing */ #include "sh.h" #define INDENT 4 #define tputc(c, shf) shf_putchar(c, shf); static void ptree ARGS((struct op *t, int indent, struct shf *f)); static void pioact ARGS((struct shf *f, int indent, struct ioword *iop)); static void tputC ARGS((int c, struct shf *shf)); static void tputS ARGS((char *wp, struct shf *shf)); static void vfptreef ARGS((struct shf *shf, int indent, const char *fmt, va_list va)); static struct ioword **iocopy ARGS((struct ioword **iow, Area *ap)); static void iofree ARGS((struct ioword **iow, Area *ap)); /* * print a command tree */ static void ptree(t, indent, shf) register struct op *t; int indent; register struct shf *shf; { register char **w; struct ioword **ioact; struct op *t1; Chain: if (t == NULL) return; switch (t->type) { case TCOM: if (t->vars) for (w = t->vars; *w != NULL; ) fptreef(shf, indent, "%S ", *w++); else fptreef(shf, indent, "#no-vars# "); if (t->args) for (w = t->args; *w != NULL; ) fptreef(shf, indent, "%S ", *w++); else fptreef(shf, indent, "#no-args# "); break; case TEXEC: t = t->left; goto Chain; case TPAREN: fptreef(shf, indent + 2, "( %T) ", t->left); break; case TPIPE: fptreef(shf, indent, "%T| ", t->left); t = t->right; goto Chain; case TLIST: fptreef(shf, indent, "%T%;", t->left); t = t->right; goto Chain; case TOR: case TAND: fptreef(shf, indent, "%T%s %T", t->left, (t->type==TOR) ? "||" : "&&", t->right); break; case TBANG: fptreef(shf, indent, "! "); t = t->right; goto Chain; case TDBRACKET: { int i; fptreef(shf, indent, "[["); for (i = 0; t->args[i]; i++) fptreef(shf, indent, " %S", t->args[i]); fptreef(shf, indent, " ]] "); break; } #ifdef KSH case TSELECT: fptreef(shf, indent, "select %s ", t->str); /* fall through */ #endif /* KSH */ case TFOR: if (t->type == TFOR) fptreef(shf, indent, "for %s ", t->str); if (t->vars != NULL) { fptreef(shf, indent, "in "); for (w = t->vars; *w; ) fptreef(shf, indent, "%S ", *w++); fptreef(shf, indent, "%;"); } fptreef(shf, indent + INDENT, "do%N%T", t->left); fptreef(shf, indent, "%;done "); break; case TCASE: fptreef(shf, indent, "case %S in", t->str); for (t1 = t->left; t1 != NULL; t1 = t1->right) { fptreef(shf, indent, "%N("); for (w = t1->vars; *w != NULL; w++) fptreef(shf, indent, "%S%c", *w, (w[1] != NULL) ? '|' : ')'); fptreef(shf, indent + INDENT, "%;%T%N;;", t1->left); } fptreef(shf, indent, "%Nesac "); break; case TIF: case TELIF: /* 3 == strlen("if ") */ fptreef(shf, indent + 3, "if %T", t->left); for (;;) { t = t->right; if (t->left != NULL) { fptreef(shf, indent, "%;"); fptreef(shf, indent + INDENT, "then%N%T", t->left); } if (t->right == NULL || t->right->type != TELIF) break; t = t->right; fptreef(shf, indent, "%;"); /* 5 == strlen("elif ") */ fptreef(shf, indent + 5, "elif %T", t->left); } if (t->right != NULL) { fptreef(shf, indent, "%;"); fptreef(shf, indent + INDENT, "else%;%T", t->right); } fptreef(shf, indent, "%;fi "); break; case TWHILE: case TUNTIL: /* 6 == strlen("while"/"until") */ fptreef(shf, indent + 6, "%s %T", (t->type==TWHILE) ? "while" : "until", t->left); fptreef(shf, indent, "%;do"); fptreef(shf, indent + INDENT, "%;%T", t->right); fptreef(shf, indent, "%;done "); break; case TBRACE: fptreef(shf, indent + INDENT, "{%;%T", t->left); fptreef(shf, indent, "%;} "); break; case TCOPROC: fptreef(shf, indent, "%T|& ", t->left); break; case TASYNC: fptreef(shf, indent, "%T& ", t->left); break; case TFUNCT: fptreef(shf, indent, "function %s %T", t->str, t->left); break; case TTIME: fptreef(shf, indent, "time %T", t->left); break; default: fptreef(shf, indent, ""); break; } if ((ioact = t->ioact) != NULL) { int need_nl = 0; while (*ioact != NULL) pioact(shf, indent, *ioact++); /* Print here documents after everything else... */ for (ioact = t->ioact; *ioact != NULL; ) { struct ioword *iop = *ioact++; /* name is 0 when tracing (set -x) */ if ((iop->flag & IOTYPE) == IOHERE && iop->name) { struct shf *rshf; char buf[1024]; int n; tputc('\n', shf); if ((rshf = shf_open(iop->name, O_RDONLY, 0, 0))) { while ((n = shf_read(buf, sizeof(buf), rshf)) > 0) shf_write(buf, n, shf); shf_close(rshf); } else errorf("can't open %s - %s", iop->name, strerror(errno)); fptreef(shf, indent, "%s", evalstr(iop->delim, 0)); need_nl = 1; } } /* Last delimiter must be followed by a newline (this often * leads to an extra blank line, but its not worth worrying * about) */ if (need_nl) tputc('\n', shf); } } static void pioact(shf, indent, iop) register struct shf *shf; int indent; register struct ioword *iop; { int flag = iop->flag; int type = flag & IOTYPE; int expected; expected = (type == IOREAD || type == IORDWR || type == IOHERE) ? 0 : (type == IOCAT || type == IOWRITE) ? 1 : (type == IODUP && (iop->unit == !(flag & IORDUP))) ? iop->unit : iop->unit + 1; if (iop->unit != expected) tputc('0' + iop->unit, shf); switch (type) { case IOREAD: fptreef(shf, indent, "< "); break; case IOHERE: if (flag&IOSKIP) fptreef(shf, indent, "<<- "); else fptreef(shf, indent, "<< "); break; case IOCAT: fptreef(shf, indent, ">> "); break; case IOWRITE: if (flag&IOCLOB) fptreef(shf, indent, ">| "); else fptreef(shf, indent, "> "); break; case IORDWR: fptreef(shf, indent, "<> "); break; case IODUP: if (flag & IORDUP) fptreef(shf, indent, "<&"); else fptreef(shf, indent, ">&"); break; } /* name/delim are 0 when printing syntax errors */ if (type == IOHERE) { if (iop->delim) fptreef(shf, indent, "%S ", iop->delim); } else if (iop->name) fptreef(shf, indent, (iop->flag & IONAMEXP) ? "%s " : "%S ", iop->name); } /* * variants of fputc, fputs for ptreef and snptreef */ static void tputC(c, shf) register int c; register struct shf *shf; { if ((c&0x60) == 0) { /* C0|C1 */ tputc((c&0x80) ? '$' : '^', shf); tputc(((c&0x7F)|0x40), shf); } else if ((c&0x7F) == 0x7F) { /* DEL */ tputc((c&0x80) ? '$' : '^', shf); tputc('?', shf); } else tputc(c, shf); } static void tputS(wp, shf) register char *wp; register struct shf *shf; { register int c, quoted=0; while (1) switch ((c = *wp++)) { case EOS: return; case CHAR: tputC(*wp++, shf); break; case QCHAR: c = *wp++; if (!quoted || (c == '"' || c == '`' || c == '$')) tputc('\\', shf); tputC(c, shf); break; case COMSUB: tputc('$', shf); tputc('(', shf); while (*wp != 0) tputC(*wp++, shf); tputc(')', shf); break; case EXPRSUB: tputc('$', shf); tputc('(', shf); tputc('(', shf); while (*wp != 0) tputC(*wp++, shf); tputc(')', shf); tputc(')', shf); break; case OQUOTE: quoted = 1; tputc('"', shf); break; case CQUOTE: quoted = 0; tputc('"', shf); break; case OSUBST: tputc('$', shf); tputc('{', shf); while ((c = *wp++) != 0) tputC(c, shf); break; case CSUBST: tputc('}', shf); break; #ifdef KSH case OPAT: tputc(*wp++, shf); tputc('(', shf); break; case SPAT: tputc('|', shf); break; case CPAT: tputc(')', shf); break; #endif /* KSH */ } } /* * this is the _only_ way to reliably handle * variable args with an ANSI compiler */ /* VARARGS */ int #ifdef HAVE_PROTOTYPES fptreef(struct shf *shf, int indent, const char *fmt, ...) #else fptreef(shf, indent, fmt, va_alist) struct shf *shf; int indent; const char *fmt; va_dcl #endif { va_list va; SH_VA_START(va, fmt); vfptreef(shf, indent, fmt, va); va_end(va); return 0; } /* VARARGS */ char * #ifdef HAVE_PROTOTYPES snptreef(char *s, int n, const char *fmt, ...) #else snptreef(s, n, fmt, va_alist) char *s; int n; const char *fmt; va_dcl #endif { va_list va; struct shf shf; shf_sopen(s, n, SHF_WR | (s ? 0 : SHF_DYNAMIC), &shf); SH_VA_START(va, fmt); vfptreef(&shf, 0, fmt, va); va_end(va); return shf_sclose(&shf); /* null terminates */ } static void vfptreef(shf, indent, fmt, va) register struct shf *shf; int indent; const char *fmt; register va_list va; { register int c; while ((c = *fmt++)) if (c == '%') { register long n; register char *p; int neg; switch ((c = *fmt++)) { case 'c': tputc(va_arg(va, int), shf); break; case 's': p = va_arg(va, char *); while (*p) tputc(*p++, shf); break; case 'S': /* word */ p = va_arg(va, char *); tputS(p, shf); break; case 'd': case 'u': /* decimal */ n = (c == 'd') ? va_arg(va, int) : va_arg(va, unsigned int); neg = c=='d' && n<0; p = ulton((neg) ? -n : n, 10); if (neg) *--p = '-'; while (*p) tputc(*p++, shf); break; case 'T': /* format tree */ ptree(va_arg(va, struct op *), indent, shf); break; case ';': /* newline or ; */ case 'N': /* newline or space */ if (shf->flags & SHF_STRING) { if (c == ';') tputc(';', shf); tputc(' ', shf); } else { int i; tputc('\n', shf); for (i = indent; i >= 8; i -= 8) tputc('\t', shf); for (; i > 0; --i) tputc(' ', shf); } break; case 'R': pioact(shf, indent, va_arg(va, struct ioword *)); break; default: tputc(c, shf); break; } } else tputc(c, shf); } /* * copy tree (for function definition) */ struct op * tcopy(t, ap) register struct op *t; Area *ap; { register struct op *r; register char **tw, **rw; if (t == NULL) return NULL; r = (struct op *) alloc(sizeof(struct op), ap); r->type = t->type; r->u.evalflags = t->u.evalflags; r->str = t->type == TCASE ? wdcopy(t->str, ap) : str_save(t->str, ap); if (t->vars == NULL) r->vars = NULL; else { for (tw = t->vars; *tw++ != NULL; ) ; rw = r->vars = (char **) alloc((int)(tw - t->vars) * sizeof(*tw), ap); for (tw = t->vars; *tw != NULL; ) *rw++ = wdcopy(*tw++, ap); *rw = NULL; } if (t->args == NULL) r->args = NULL; else { for (tw = t->args; *tw++ != NULL; ) ; rw = r->args = (char **) alloc((int)(tw - t->args) * sizeof(*tw), ap); for (tw = t->args; *tw != NULL; ) *rw++ = wdcopy(*tw++, ap); *rw = NULL; } r->ioact = (t->ioact == NULL) ? NULL : iocopy(t->ioact, ap); r->left = tcopy(t->left, ap); r->right = tcopy(t->right, ap); return r; } char * wdcopy(wp, ap) const char *wp; Area *ap; { size_t len = wdscan(wp, EOS) - wp; return memcpy(alloc(len, ap), wp, len); } /* return the position of prefix c in wp plus 1 */ char * wdscan(wp, c) register const char *wp; register int c; { register int nest = 0; while (1) switch (*wp++) { case EOS: return (char *) wp; case CHAR: case QCHAR: wp++; break; case COMSUB: case EXPRSUB: while (*wp++ != 0) ; break; case OQUOTE: case CQUOTE: break; case OSUBST: nest++; while (*wp++ != '\0') ; break; case CSUBST: if (c == CSUBST && nest == 0) return (char *) wp; nest--; break; #ifdef KSH case OPAT: nest++; wp++; break; case SPAT: case CPAT: if (c == wp[-1] && nest == 0) return (char *) wp; if (wp[-1] == CPAT) nest--; break; #endif /* KSH */ } } static struct ioword ** iocopy(iow, ap) register struct ioword **iow; Area *ap; { register struct ioword **ior; register int i; for (ior = iow; *ior++ != NULL; ) ; ior = (struct ioword **) alloc((int)(ior - iow) * sizeof(*ior), ap); for (i = 0; iow[i] != NULL; i++) { register struct ioword *p, *q; p = iow[i]; q = (struct ioword *) alloc(sizeof(*p), ap); ior[i] = q; *q = *p; if (p->name != (char *) 0) q->name = wdcopy(p->name, ap); if (p->delim != (char *) 0) q->delim = wdcopy(p->delim, ap); } ior[i] = NULL; return ior; } /* * free tree (for function definition) */ void tfree(t, ap) register struct op *t; Area *ap; { register char **w; if (t == NULL) return; if (t->str != NULL) afree((void*)t->str, ap); if (t->vars != NULL) { for (w = t->vars; *w != NULL; w++) afree((void*)*w, ap); afree((void*)t->vars, ap); } if (t->args != NULL) { for (w = t->args; *w != NULL; w++) afree((void*)*w, ap); afree((void*)t->args, ap); } if (t->ioact != NULL) iofree(t->ioact, ap); tfree(t->left, ap); tfree(t->right, ap); afree((void*)t, ap); } static void iofree(iow, ap) struct ioword **iow; Area *ap; { register struct ioword **iop; register struct ioword *p; for (iop = iow; (p = *iop++) != NULL; ) { if (p->name != NULL) afree((void*)p->name, ap); afree((void*)p, ap); } }