/* * Copyright 2005 Sun Microsystems, Inc. All rights reserved. * Use is subject to license terms. */ /* Copyright (c) 1983, 1984, 1985, 1986, 1987, 1988, 1989 AT&T */ /* All Rights Reserved */ /* * Copyright (c) 1980 Regents of the University of California. * All rights reserved. The Berkeley Software License Agreement * specifies the terms and conditions for redistribution. */ #pragma ident "%Z%%M% %I% %E% SMI" #include "sh.h" #include "sh.tconst.h" /* * C shell */ void asyntax(struct wordent *, struct wordent *); void asyn0(struct wordent *, struct wordent *); void asyn3(struct wordent *, struct wordent *); void chr_blkfree(char **); struct command *syn0(struct wordent *, struct wordent *, int); struct command *syn1(struct wordent *, struct wordent *, int); struct command *syn1a(struct wordent *, struct wordent *, int); struct command *syn1b(struct wordent *, struct wordent *, int); struct command *syn2(struct wordent *, struct wordent *, int); struct command *syn3(struct wordent *, struct wordent *, int); struct wordent *freenod(struct wordent *, struct wordent *); /* * Perform aliasing on the word list lex * Do a (very rudimentary) parse to separate into commands. * If word 0 of a command has an alias, do it. * Repeat a maximum of 20 times. */ void alias(struct wordent *lex) { int aleft = 21; jmp_buf osetexit; #ifdef TRACE tprintf("TRACE- alias()\n"); #endif getexit(osetexit); setexit(); if (haderr) { resexit(osetexit); reset(); } if (--aleft == 0) error("Alias loop"); asyntax(lex->next, lex); resexit(osetexit); } void asyntax(struct wordent *p1, struct wordent *p2) { #ifdef TRACE tprintf("TRACE- asyntax()\n"); #endif while (p1 != p2) /* if (any(p1->word[0], ";&\n")) */ /* For char -> tchar */ if (p1->word[0] == ';' || p1->word[0] == '&' || p1->word[0] == '\n') p1 = p1->next; else { asyn0(p1, p2); return; } } void asyn0(struct wordent *p1, struct wordent *p2) { struct wordent *p; int l = 0; #ifdef TRACE tprintf("TRACE- asyn0()\n"); #endif for (p = p1; p != p2; p = p->next) switch (p->word[0]) { case '(': l++; continue; case ')': l--; if (l < 0) error("Too many )'s"); continue; case '>': if (p->next != p2 && eq(p->next->word, S_AND /* "&"*/)) p = p->next; continue; case '&': case '|': case ';': case '\n': if (l != 0) continue; asyn3(p1, p); asyntax(p->next, p2); return; } if (l == 0) asyn3(p1, p2); } void asyn3(struct wordent *p1, struct wordent *p2) { struct varent *ap; struct wordent alout; bool redid; #ifdef TRACE tprintf("TRACE- asyn3()\n"); #endif if (p1 == p2) return; if (p1->word[0] == '(') { for (p2 = p2->prev; p2->word[0] != ')'; p2 = p2->prev) if (p2 == p1) return; if (p2 == p1->next) return; asyn0(p1->next, p2); return; } ap = adrof1(p1->word, &aliases); if (ap == 0) return; alhistp = p1->prev; alhistt = p2; alvec = ap->vec; redid = lex(&alout); alhistp = alhistt = 0; alvec = 0; if (err) { freelex(&alout); error("%s", gettext(err)); } if (p1->word[0] && eq(p1->word, alout.next->word)) { tchar *cp = alout.next->word; alout.next->word = strspl(S_TOPBIT /* "\200" */, cp); xfree(cp); } p1 = freenod(p1, redid ? p2 : p1->next); if (alout.next != &alout) { p1->next->prev = alout.prev->prev; alout.prev->prev->next = p1->next; alout.next->prev = p1; p1->next = alout.next; xfree(alout.prev->word); xfree(alout.prev); } reset(); /* throw! */ } struct wordent * freenod(struct wordent *p1, struct wordent *p2) { struct wordent *retp = p1->prev; #ifdef TRACE tprintf("TRACE- freenod()\n"); #endif while (p1 != p2) { xfree(p1->word); p1 = p1->next; xfree(p1->prev); } retp->next = p2; p2->prev = retp; return (retp); } #define PHERE 1 #define PIN 2 #define POUT 4 #define PDIAG 8 /* * syntax * empty * syn0 */ struct command * syntax(struct wordent *p1, struct wordent *p2, int flags) { #ifdef TRACE tprintf("TRACE- syntax()\n"); #endif while (p1 != p2) /* if (any(p1->word[0], ";&\n")) */ /* for char -> tchar */ if (p1->word[0] == ';' || p1->word[0] == '&' || p1->word[0] == '\n') p1 = p1->next; else return (syn0(p1, p2, flags)); return (0); } /* * syn0 * syn1 * syn1 & syntax */ struct command * syn0(struct wordent *p1, struct wordent *p2, int flags) { struct wordent *p; struct command *t, *t1; int l; #ifdef TRACE tprintf("TRACE- syn0()\n"); #endif l = 0; for (p = p1; p != p2; p = p->next) switch (p->word[0]) { case '(': l++; continue; case ')': l--; if (l < 0) seterr("Too many )'s"); continue; case '|': if (p->word[1] == '|') continue; /* fall into ... */ case '>': if (p->next != p2 && eq(p->next->word, S_AND /* "&" */)) p = p->next; continue; case '&': if (l != 0) break; if (p->word[1] == '&') continue; t1 = syn1(p1, p, flags); if (t1->t_dtyp == TLST || t1->t_dtyp == TAND || t1->t_dtyp == TOR) { t = (struct command *)xcalloc(1, sizeof (*t)); t->t_dtyp = TPAR; t->t_dflg = FAND|FINT; t->t_dspr = t1; t1 = t; } else t1->t_dflg |= FAND|FINT; t = (struct command *)xcalloc(1, sizeof (*t)); t->t_dtyp = TLST; t->t_dflg = 0; t->t_dcar = t1; t->t_dcdr = syntax(p, p2, flags); return (t); } if (l == 0) return (syn1(p1, p2, flags)); seterr("Too many ('s"); return (0); } /* * syn1 * syn1a * syn1a ; syntax */ struct command * syn1(struct wordent *p1, struct wordent *p2, int flags) { struct wordent *p; struct command *t; int l; #ifdef TRACE tprintf("TRACE- syn1()\n"); #endif l = 0; for (p = p1; p != p2; p = p->next) switch (p->word[0]) { case '(': l++; continue; case ')': l--; continue; case ';': case '\n': if (l != 0) break; t = (struct command *)xcalloc(1, sizeof (*t)); t->t_dtyp = TLST; t->t_dcar = syn1a(p1, p, flags); t->t_dcdr = syntax(p->next, p2, flags); if (t->t_dcdr == 0) t->t_dcdr = t->t_dcar, t->t_dcar = 0; return (t); } return (syn1a(p1, p2, flags)); } /* * syn1a * syn1b * syn1b || syn1a */ struct command * syn1a(struct wordent *p1, struct wordent *p2, int flags) { struct wordent *p; struct command *t; int l = 0; #ifdef TRACE tprintf("TRACE- syn1a()\n"); #endif for (p = p1; p != p2; p = p->next) switch (p->word[0]) { case '(': l++; continue; case ')': l--; continue; case '|': if (p->word[1] != '|') continue; if (l == 0) { t = (struct command *)xcalloc(1, sizeof (*t)); t->t_dtyp = TOR; t->t_dcar = syn1b(p1, p, flags); t->t_dcdr = syn1a(p->next, p2, flags); t->t_dflg = 0; return (t); } continue; } return (syn1b(p1, p2, flags)); } /* * syn1b * syn2 * syn2 && syn1b */ struct command * syn1b(struct wordent *p1, struct wordent *p2, int flags) { struct wordent *p; struct command *t; int l = 0; #ifdef TRACE tprintf("TRACE- syn1b()\n"); #endif l = 0; for (p = p1; p != p2; p = p->next) switch (p->word[0]) { case '(': l++; continue; case ')': l--; continue; case '&': if (p->word[1] == '&' && l == 0) { t = (struct command *)xcalloc(1, sizeof (*t)); t->t_dtyp = TAND; t->t_dcar = syn2(p1, p, flags); t->t_dcdr = syn1b(p->next, p2, flags); t->t_dflg = 0; return (t); } continue; } return (syn2(p1, p2, flags)); } /* * syn2 * syn3 * syn3 | syn2 * syn3 |& syn2 */ struct command * syn2(struct wordent *p1, struct wordent *p2, int flags) { struct wordent *p, *pn; struct command *t; int l = 0; int f; #ifdef TRACE tprintf("TRACE- syn2()\n"); #endif for (p = p1; p != p2; p = p->next) switch (p->word[0]) { case '(': l++; continue; case ')': l--; continue; case '|': if (l != 0) continue; t = (struct command *)xcalloc(1, sizeof (*t)); f = flags | POUT; pn = p->next; if (pn != p2 && pn->word[0] == '&') { f |= PDIAG; t->t_dflg |= FDIAG; } t->t_dtyp = TFIL; t->t_dcar = syn3(p1, p, f); if (pn != p2 && pn->word[0] == '&') p = pn; t->t_dcdr = syn2(p->next, p2, flags | PIN); return (t); } return (syn3(p1, p2, flags)); } tchar RELPAR[] = {'<', '>', '(', ')', 0}; /* "<>()" */ /* * syn3 * ( syn0 ) [ < in ] [ > out ] * word word* [ < in ] [ > out ] * KEYWORD ( word* ) word* [ < in ] [ > out ] * * KEYWORD = (@ exit foreach if set switch test while) */ struct command * syn3(struct wordent *p1, struct wordent *p2, int flags) { struct wordent *p; struct wordent *lp, *rp; struct command *t; int l; tchar **av; int n, c; bool specp = 0; #ifdef TRACE tprintf("TRACE- syn3()\n"); #endif if (p1 != p2) { p = p1; again: switch (srchx(p->word)) { case ZELSE: p = p->next; if (p != p2) goto again; break; case ZEXIT: case ZFOREACH: case ZIF: case ZLET: case ZSET: case ZSWITCH: case ZWHILE: specp = 1; break; } } n = 0; l = 0; for (p = p1; p != p2; p = p->next) switch (p->word[0]) { case '(': if (specp) n++; l++; continue; case ')': if (specp) n++; l--; continue; case '>': case '<': if (l != 0) { if (specp) n++; continue; } if (p->next == p2) continue; if (any(p->next->word[0], RELPAR)) continue; n--; continue; default: if (!specp && l != 0) continue; n++; continue; } if (n < 0) n = 0; t = (struct command *)xcalloc(1, sizeof (*t)); av = (tchar **)xcalloc((unsigned)(n + 1), sizeof (tchar **)); t->t_dcom = av; n = 0; if (p2->word[0] == ')') t->t_dflg = FPAR; lp = 0; rp = 0; l = 0; for (p = p1; p != p2; p = p->next) { c = p->word[0]; switch (c) { case '(': if (l == 0) { if (lp != 0 && !specp) seterr("Badly placed ("); lp = p->next; } l++; goto savep; case ')': l--; if (l == 0) rp = p; goto savep; case '>': if (l != 0) goto savep; if (p->word[1] == '>') t->t_dflg |= FCAT; if (p->next != p2 && eq(p->next->word, S_AND /* "&" */)) { t->t_dflg |= FDIAG, p = p->next; if (flags & (POUT|PDIAG)) goto badout; } if (p->next != p2 && eq(p->next->word, S_EXAS /* "!" */)) t->t_dflg |= FANY, p = p->next; if (p->next == p2) { missfile: seterr("Missing name for redirect"); continue; } p = p->next; if (any(p->word[0], RELPAR)) goto missfile; if ((flags & POUT) && (flags & PDIAG) == 0 || t->t_drit) badout: seterr("Ambiguous output redirect"); else t->t_drit = savestr(p->word); continue; case '<': if (l != 0) goto savep; if (p->word[1] == '<') t->t_dflg |= FHERE; if (p->next == p2) goto missfile; p = p->next; if (any(p->word[0], RELPAR)) goto missfile; if ((flags & PHERE) && (t->t_dflg & FHERE)) seterr("Can't << within ()'s"); else if ((flags & PIN) || t->t_dlef) seterr("Ambiguous input redirect"); else t->t_dlef = savestr(p->word); continue; savep: if (!specp) continue; default: if (l != 0 && !specp) continue; if (err == 0) av[n] = savestr(p->word); n++; continue; } } if (lp != 0 && !specp) { if (n != 0) seterr("Badly placed ()'s"); t->t_dtyp = TPAR; t->t_dspr = syn0(lp, rp, PHERE); } else { if (n == 0) seterr("Invalid null command"); t->t_dtyp = TCOM; } return (t); } void freesyn(struct command *t) { #ifdef TRACE tprintf("TRACE- freesyn()\n"); #endif if (t == 0) return; switch (t->t_dtyp) { case TCOM: blkfree(t->t_dcom); if (t->cfname) xfree(t->cfname); if (t->cargs) chr_blkfree(t->cargs); goto lr; case TPAR: freesyn(t->t_dspr); /* fall into ... */ lr: xfree(t->t_dlef); xfree(t->t_drit); break; case TAND: case TOR: case TFIL: case TLST: freesyn(t->t_dcar), freesyn(t->t_dcdr); break; } xfree(t); } void chr_blkfree(char **vec) { char **av; for (av = vec; *av; av++) xfree(*av); xfree(vec); }