/* @(#)sh.func.c 2.1 SCCS id keyword */ /* Copyright (c) 1980 Regents of the University of California */ #include "sh.h" /* * C shell */ struct biltins * isbfunc(cp) register char *cp; { register char *dp; register struct biltins *bp; if (lastchr(cp) == ':') return ((struct biltins *) 1); for (bp = bfunc; dp = bp->bname; bp++) { if (dp[0] == cp[0] && eq(dp, cp)) return (bp); if (dp[0] > cp[0]) break; } return (0); } func(t) register struct command *t; { register struct biltins *bp; int i; bp = bfunc; if (lastchr(t->t_dcom[0]) == ':') { xechoit(t->t_dcom); if (!eq(t->t_dcom[0], ":") && t->t_dcom[1]) error("No args on labels"); return (1); } bp = isbfunc(t->t_dcom[0]); if (bp == 0) return (0); /* timed builtins must go in background if output is pipe, or &'ed */ if (eq(bp->bname, "time")) if ((t->t_dflg & FAND) || (t->t_dflg & FPOU)) return (0); if (eq(bp->bname, "nohup") && t->t_dcom[1]) return (0); xechoit(t->t_dcom); setname(bp->bname); i = blklen(t->t_dcom) - 1; if (i < bp->minargs) bferr("Too few arguments"); if (i > bp->maxargs) bferr("Too many arguments"); i = (*bp->bfunct)(t->t_dcom, t); /* time and nice may not do their deeds, all others guarantee too */ return (eq(bp->bname, "time") || eq(bp->bname, "nice") ? i : 1); } doonintr(v) char **v; { register char *cp; register char *vv = v[1]; if (parintr == SIG_IGN) return; if (setintr && intty) bferr("Can't from terminal"); cp = gointr, gointr = 0, xfree(cp); if (vv == 0) { signal(SIGINT, setintr ? SIG_IGN : SIG_DFL); gointr = 0; } else if (eq((vv = strip(vv)), "-")) { signal(SIGINT, SIG_IGN); gointr = "-"; } else { gointr = savestr(vv); signal(SIGINT, pintr); } } donohup() { if (intty) bferr("Can't from terminal"); if (setintr == 0) { signal(SIGHUP, SIG_IGN); #ifdef CC submit(getpid()); #endif } } dozip() { ; } chngd(vp) register char **vp; { register int i; register char *dp; register char **cdp; vp++; dp = *vp; if (dp) dp = globone(dp); else { dp = value("home"); if (*dp == 0) bferr("No home"); } i = chdir(dp); if (i < 0 && dp[0] != '/') { struct varent *c = adrof("cdpath"); if (c == 0) goto simple; for (cdp = c->vec; *cdp; cdp++) { char buf[BUFSIZ]; strcpy(buf, *cdp); strcat(buf, "/"); strcat(buf, dp); i = chdir(buf); if (i >= 0) goto simple; } } simple: if (i < 0 && adrof(dp)) { char *cp = value(dp); if (cp[0] == '/') i = chdir(cp); } if (*vp) xfree(dp); if (i < 0) Perror(dp); } prvars() { plist(&shvhed); } doalias(v) register char **v; { register struct varent *vp; register char *p; v++; p = *v++; if (p == 0) plist(&aliases); else if (*v == 0) { vp = adrof1(strip(p), &aliases); if (vp) blkpr(vp->vec), printf("\n"); } else { if (eq(p, "alias") || eq(p, "unalias")) { setname(p); bferr("Too dangerous to alias that"); } set1(strip(p), saveblk(v), &aliases); } } unalias(v) char **v; { unset1(v, &aliases); } dologout() { islogin(); goodbye(); } dologin(v) char **v; { islogin(); execl("/bin/login", "login", v[1], 0); exit(1); } donewgrp(v) char **v; { #ifndef V6 execlp("newgrp", "newgrp", v[1], 0); #endif execl("/bin/newgrp", "newgrp", v[1], 0); /* just in case */ execl("/usr/bin/newgrp", "newgrp", v[1], 0); } islogin() { if (loginsh) return; error("Not login shell"); } doif(v, kp) char **v; struct command *kp; { register int i; register char **vv; v++; i = exp(&v); vv = v; if (*vv && eq(*vv, "then")) { vv++; if (*vv) bferr("Improper then"); setname("then"); /* * If expression was zero, then scan to else, * otherwise just fall into following code. */ if (!i) search(ZIF, 0); return; } /* * Simple command attached to this if. * Left shift the node in this tree, munging it * so we can reexecute it. */ if (i) { lshift(kp->t_dcom, vv - kp->t_dcom); reexecute(kp); donefds(); } } /* * Reexecute a command, being careful not * to redo i/o redirection, which is already set up. */ reexecute(kp) register struct command *kp; { kp->t_dflg = FREDO; execute(kp); } doelse() { search(ZELSE, 0); } dogoto(v) char **v; { register struct whyle *wp; char *lp; /* * While we still can, locate any unknown ends of existing loops. * This obscure code is the WORST result of the fact that we * don't really parse. */ for (wp = whyles; wp; wp = wp->w_next) if (wp->w_end == 0) wp->w_end = search(ZBREAK, 0); else bseek(wp->w_end); search(ZGOTO, 0, lp = globone(v[1])); xfree(lp); /* * Eliminate loops which were exited. */ wfree(); } doswitch(v) register char **v; { register char *cp, *lp; v++; if (!*v || *(*v++) != '(') goto syntax; cp = **v == ')' ? "" : *v++; if (*(*v++) != ')') v--; if (*v) syntax: error("Syntax error"); search(ZSWITCH, 0, lp = globone(cp)); xfree(lp); } dobreak() { if (whyles) toend(); else bferr("Not in while/foreach"); } doexit(v) char **v; { /* * Don't DEMAND parentheses here either. */ v++; if (*v) { set("status", putn(exp(&v))); if (*v) bferr("Expression syntax"); } btoeof(); if (intty) close(SHIN); } doforeach(v) register char **v; { register char *cp; register struct whyle *nwp; v++; cp = strip(*v); while (*cp && letter(*cp)) cp++; if (*cp || strlen(*v) >= 20) bferr("Invalid variable"); cp = *v++; if (v[0][0] != '(' || v[blklen(v) - 1][0] != ')') bferr("Words not ()'ed"); v++; gflag = 0, rscan(v, tglob); v = glob(v); if (v == 0) bferr("No match"); nwp = (struct whyle *) calloc(1, sizeof *nwp); nwp->w_fe = nwp->w_fe0 = v; gargv = 0; nwp->w_start = btell(); nwp->w_fename = savestr(cp); nwp->w_next = whyles; whyles = nwp; /* * Pre-read the loop so as to be more * comprehensible to a terminal user. */ if (intty) preread(); doagain(); } dowhile(v) char **v; { register int status; register bool again = whyles && whyles->w_start == lineloc && whyles->w_fename == 0; v++; /* * Implement prereading here also, taking care not to * evaluate the expression before the loop has been read up * from a terminal. */ if (intty && !again) status = !exp0(&v, 1); else status = !exp(&v); if (*v) bferr("Expression syntax"); if (!again) { register struct whyle *nwp = (struct whyle *) calloc(1, sizeof (*nwp)); nwp->w_start = lineloc; nwp->w_end = 0; nwp->w_next = whyles; whyles = nwp; if (intty) { /* * The tty preread */ preread(); doagain(); return; } } if (status) /* We ain't gonna loop no more, no more! */ toend(); } preread() { register int (*oldint)(); whyles->w_end = -1; if (setintr) oldint = signal(SIGINT, pintr); search(ZBREAK, 0); if (setintr) signal(SIGINT, oldint); whyles->w_end = btell(); } doend() { if (!whyles) bferr("Not in while/foreach"); whyles->w_end = btell(); doagain(); } docontin() { if (!whyles) bferr("Not in while/foreach"); doagain(); } doagain() { /* Repeating a while is simple */ if (whyles->w_fename == 0) { bseek(whyles->w_start); return; } /* * The foreach variable list actually has a spurious word * ")" at the end of the w_fe list. Thus we are at the * of the list if one word beyond this is 0. */ if (!whyles->w_fe[1]) { dobreak(); return; } set(whyles->w_fename, savestr(*whyles->w_fe++)); bseek(whyles->w_start); } dorepeat(v, kp) char **v; struct command *kp; { register int i; register int (*saveintr)(); i = getn(v[1]); if (setintr) saveintr = signal(SIGINT, SIG_IGN); lshift(v, 2); while (i > 0) { if (setintr) signal(SIGINT, pintr); reexecute(kp); --i; } donefds(); if (setintr) signal(SIGINT, saveintr); } doswbrk() { search(ZBRKSW, 0); } srchx(cp) register char *cp; { register struct srch *sp; for (sp = srchn; sp->s_name; sp++) if (eq(cp, sp->s_name)) return (sp->s_value); return (-1); } char Stype; char *Sgoal; /*VARARGS2*/ search(type, level, goal) int type; register int level; char *goal; { char wordbuf[BUFSIZ]; register char *aword = wordbuf; register char *cp; Stype = type; Sgoal = goal; if (type == ZGOTO) bseek(0l); do { if (intty && fseekp == feobp) printf("? "), flush(); aword[0] = 0, getword(aword); switch (srchx(aword)) { case ZELSE: if (level == 0 && type == ZIF) return; break; case ZIF: while (getword(aword)) continue; if ((type == ZIF || type == ZELSE) && eq(aword, "then")) level++; break; case ZENDIF: if (type == ZIF || type == ZELSE) level--; break; case ZFOREACH: case ZWHILE: if (type == ZBREAK) level++; break; case ZEND: if (type == ZBREAK) level--; break; case ZSWITCH: if (type == ZSWITCH || type == ZBRKSW) level++; break; case ZENDSW: if (type == ZSWITCH || type == ZBRKSW) level--; break; case ZLABEL: if (type == ZGOTO && getword(aword) && eq(aword, goal)) level = -1; break; default: if (type != ZGOTO && (type != ZSWITCH || level != 0)) break; if (lastchr(aword) != ':') break; aword[strlen(aword) - 1] = 0; if (type == ZGOTO && eq(aword, goal) || type == ZSWITCH && eq(aword, "default")) level = -1; break; case ZCASE: if (type != ZSWITCH || level != 0) break; getword(aword); if (lastchr(aword) == ':') aword[strlen(aword) - 1] = 0; cp = strip(Dfix1(aword)); if (Gmatch(goal, cp)) level = -1; xfree(cp); break; case ZDEFAULT: if (type == ZSWITCH && level == 0) level = -1; break; } getword(0); } while (level >= 0); } getword(wp) register char *wp; { register int found = 0; register int c, d; c = readc(1); d = 0; do { while (c == ' ' || c == '\t') c = readc(1); if (c < 0) goto past; if (c == '\n') { if (wp) break; return (0); } unreadc(c); found = 1; do { c = readc(1); if (c == '\\' && (c = readc(1)) == '\n') c = ' '; if (any(c, "'\"")) if (d == 0) d = c; else if (d == c) d = 0; if (c < 0) goto past; if (wp) *wp++ = c; } while ((d || c != ' ' && c != '\t') && c != '\n'); } while (wp == 0); unreadc(c); if (found) *--wp = 0; return (found); past: switch (Stype) { case ZIF: bferr("then/endif not found"); case ZELSE: bferr("endif not found"); case ZBRKSW: case ZSWITCH: bferr("endsw not found"); case ZBREAK: bferr("end not found"); case ZGOTO: setname(Sgoal); bferr("label not found"); } /*NOTREACHED*/ } toend() { if (whyles->w_end == 0) { search(ZBREAK, 0); whyles->w_end = btell() - 1; } else bseek(whyles->w_end); wfree(); } wfree() { long o = btell(); while (whyles) { register struct whyle *wp = whyles; register struct whyle *nwp = wp->w_next; if (o >= wp->w_start && (wp->w_end == 0 || o < wp->w_end)) break; if (wp->w_fe0) blkfree(wp->w_fe0); if (wp->w_fename) xfree(wp->w_fename); xfree(wp); whyles = nwp; } } doecho(v) char **v; { echo(' ', v); } doglob(v) char **v; { echo(0, v); flush(); } echo(sep, v) char sep; register char **v; { register char *cp; int (*saveintr)(); if (setintr) saveintr = signal(SIGINT, pintr); v++; if (*v == 0) return; gflag = 0; rscan(v, tglob); if (gflag) { v = glob(v); if (v == 0) bferr("No match"); } else scan(v, trim); while (cp = *v++) { register int c; while (c = *cp++) { if (sep == ' ' && *cp && c == '\\') { c = *cp++; if (c == 'c') { flush(); return; } else if (c == 'n') c = '\n'; else putchar('\\'); } putchar(c | QUOTE); } if (*v) putchar(sep | QUOTE); } if (sep) putchar('\n'); if (setintr) signal(SIGINT, saveintr); if (gargv) blkfree(gargv), gargv = 0; } #ifndef V6 char **environ; dosetenv(v) register char **v; { char *lp = globone(v[2]); setenv(v[1], lp); if (eq(v[1], "PATH")) importpath(lp); xfree(lp); } setenv(name, value) char *name, *value; { register char **ep = environ; register char *cp, *dp; char *blk[2], **oep = ep; for (; *ep; ep++) { for (cp = name, dp = *ep; *cp && *cp == *dp; cp++, dp++) continue; if (*cp != 0 || *dp != '=') continue; cp = strspl("=", value); xfree(*ep); *ep = strspl(name, cp); xfree(cp); scan(ep, trim); return; } blk[0] = strspl(name, "="); blk[1] = 0; environ = blkspl(environ, blk); xfree(oep); setenv(name, value); } doumask(v) register char **v; { register char *cp = v[1]; register int i; if (cp == 0) { i = umask(0); umask(i); printf("%o\n", i); return; } i = 0; while (digit(*cp) && *cp != '8' && *cp != '9') i = i * 8 + *cp++ - '0'; if (*cp || i < 0 || i > 0777) bferr("Improper mask"); umask(i); } #endif