1 /* vi: set sw=4 ts=4: */
3 * ash shell port for busybox
5 * Copyright (c) 1989, 1991, 1993, 1994
6 * The Regents of the University of California. All rights reserved.
8 * Copyright (c) 1997-2005 Herbert Xu <herbert@gondor.apana.org.au>
9 * was re-ported from NetBSD and debianized.
12 * This code is derived from software contributed to Berkeley by
15 * Licensed under the GPL v2 or later, see the file LICENSE in this tarball.
17 * Original BSD copyright notice is retained at the end of this file.
21 * rewrite arith.y to micro stack based cryptic algorithm by
22 * Copyright (c) 2001 Aaron Lehmann <aaronl@vitelus.com>
24 * Modified by Paul Mundt <lethal@linux-sh.org> (c) 2004 to support
27 * Modified by Vladimir Oleynik <dzo@simtreas.ru> (c) 2001-2005 to be
28 * used in busybox and size optimizations,
29 * rewrote arith (see notes to this), added locale support,
30 * rewrote dynamic variables.
35 * The follow should be set to reflect the type of system you have:
36 * JOBS -> 1 if you have Berkeley job control, 0 otherwise.
37 * define SYSV if you are running under System V.
38 * define DEBUG=1 to compile in debugging ('set -o debug' to turn on)
39 * define DEBUG=2 to compile in and turn on debugging.
41 * When debugging is on, debugging info will be written to ./trace and
42 * a quit signal will generate a core dump.
47 #if ENABLE_ASH_JOB_CONTROL
56 #include "busybox.h" /* for struct bb_applet */
60 #if JOBS || ENABLE_ASH_READ_NCHARS
63 extern char **environ;
65 #if defined(__uClinux__)
66 #error "Do not even bother, ash will not run on uClinux"
70 /* ============ Misc helpers */
72 #define xbarrier() do { __asm__ __volatile__ ("": : :"memory"); } while (0)
74 /* C99 say: "char" declaration may be signed or unsigned default */
75 #define signed_char2int(sc) ((int)((signed char)sc))
78 /* ============ Shell options */
80 static const char *const optletters_optnames[] = {
101 #define optletters(n) optletters_optnames[(n)][0]
102 #define optnames(n) (&optletters_optnames[(n)][1])
104 enum { NOPTS = ARRAY_SIZE(optletters_optnames) };
106 static char optlist[NOPTS] ALIGN1;
108 #define eflag optlist[0]
109 #define fflag optlist[1]
110 #define Iflag optlist[2]
111 #define iflag optlist[3]
112 #define mflag optlist[4]
113 #define nflag optlist[5]
114 #define sflag optlist[6]
115 #define xflag optlist[7]
116 #define vflag optlist[8]
117 #define Cflag optlist[9]
118 #define aflag optlist[10]
119 #define bflag optlist[11]
120 #define uflag optlist[12]
121 #define viflag optlist[13]
123 #define nolog optlist[14]
124 #define debug optlist[15]
128 /* ============ Misc data */
130 static char nullstr[1] ALIGN1; /* zero length string */
131 static const char homestr[] ALIGN1 = "HOME";
132 static const char snlfmt[] ALIGN1 = "%s\n";
133 static const char illnum[] ALIGN1 = "Illegal number: %s";
135 static char *minusc; /* argument to -c option */
137 /* pid of main shell */
139 /* shell level: 0 for the main shell, 1 for its children, and so on */
141 #define rootshell (!shlvl)
142 /* trap handler commands */
143 static char *trap[NSIG];
144 static smallint isloginsh;
145 /* current value of signal */
146 static char sigmode[NSIG - 1];
147 /* indicates specified signal received */
148 static char gotsig[NSIG - 1];
149 static char *arg0; /* value of $0 */
152 /* ============ Interrupts / exceptions */
155 * We enclose jmp_buf in a structure so that we can declare pointers to
156 * jump locations. The global variable handler contains the location to
157 * jump to when an exception occurs, and the global variable exception
158 * contains a code identifying the exception. To implement nested
159 * exception handlers, the user should save the value of handler on entry
160 * to an inner scope, set handler to point to a jmploc structure for the
161 * inner scope, and restore handler on exit from the scope.
166 static struct jmploc *exception_handler;
167 static int exception;
169 #define EXINT 0 /* SIGINT received */
170 #define EXERROR 1 /* a generic error */
171 #define EXSHELLPROC 2 /* execute a shell procedure */
172 #define EXEXEC 3 /* command execution failed */
173 #define EXEXIT 4 /* exit the shell */
174 #define EXSIG 5 /* trapped signal in wait(1) */
175 static volatile int suppressint;
176 static volatile sig_atomic_t intpending;
177 /* do we generate EXSIG events */
179 /* last pending signal */
180 static volatile sig_atomic_t pendingsig;
183 * Sigmode records the current value of the signal handlers for the various
184 * modes. A value of zero means that the current handler is not known.
185 * S_HARD_IGN indicates that the signal was ignored on entry to the shell,
188 #define S_DFL 1 /* default signal handling (SIG_DFL) */
189 #define S_CATCH 2 /* signal is caught */
190 #define S_IGN 3 /* signal is ignored (SIG_IGN) */
191 #define S_HARD_IGN 4 /* signal is ignored permenantly */
192 #define S_RESET 5 /* temporary - to reset a hard ignored sig */
195 * These macros allow the user to suspend the handling of interrupt signals
196 * over a period of time. This is similar to SIGHOLD to or sigblock, but
197 * much more efficient and portable. (But hacking the kernel is so much
198 * more fun than worrying about efficiency and portability. :-))
207 * Called to raise an exception. Since C doesn't include exceptions, we
208 * just do a longjmp to the exception handler. The type of exception is
209 * stored in the global variable "exception".
211 static void raise_exception(int) ATTRIBUTE_NORETURN;
213 raise_exception(int e)
216 if (exception_handler == NULL)
221 longjmp(exception_handler->loc, 1);
225 * Called from trap.c when a SIGINT is received. (If the user specifies
226 * that SIGINT is to be trapped or ignored using the trap builtin, then
227 * this routine is not called.) Suppressint is nonzero when interrupts
228 * are held using the INT_OFF macro. (The test for iflag is just
229 * defensive programming.)
231 static void raise_interrupt(void) ATTRIBUTE_NORETURN;
233 raise_interrupt(void)
239 /* Signal is not automatically re-enabled after it is raised,
242 sigprocmask(SIG_SETMASK, &mask, 0);
243 /* pendingsig = 0; - now done in onsig() */
246 if (gotsig[SIGINT - 1] && !trap[SIGINT]) {
247 if (!(rootshell && iflag)) {
248 signal(SIGINT, SIG_DFL);
257 #if ENABLE_ASH_OPTIMIZE_FOR_SIZE
261 if (--suppressint == 0 && intpending) {
265 #define INT_ON int_on()
273 #define FORCE_INT_ON force_int_on()
278 if (--suppressint == 0 && intpending) \
281 #define FORCE_INT_ON \
288 #endif /* ASH_OPTIMIZE_FOR_SIZE */
290 #define SAVE_INT(v) ((v) = suppressint)
292 #define RESTORE_INT(v) \
296 if (suppressint == 0 && intpending) \
305 raise_exception(EXSIG); \
307 /* EXSIG is turned off by evalbltin(). */
310 * Ignore a signal. Only one usage site - in forkchild()
315 if (sigmode[signo - 1] != S_IGN && sigmode[signo - 1] != S_HARD_IGN) {
316 signal(signo, SIG_IGN);
318 sigmode[signo - 1] = S_HARD_IGN;
322 * Signal handler. Only one usage site - in setsignal()
327 gotsig[signo - 1] = 1;
330 if (exsig || (signo == SIGINT && !trap[SIGINT])) {
340 /* ============ Stdout/stderr output */
343 outstr(const char *p, FILE *file)
351 flush_stdout_stderr(void)
368 outcslow(int c, FILE *dest)
376 static int out1fmt(const char *, ...) __attribute__((__format__(__printf__,1,2)));
378 out1fmt(const char *fmt, ...)
385 r = vprintf(fmt, ap);
391 static int fmtstr(char *, size_t, const char *, ...) __attribute__((__format__(__printf__,3,4)));
393 fmtstr(char *outbuf, size_t length, const char *fmt, ...)
400 ret = vsnprintf(outbuf, length, fmt, ap);
407 out1str(const char *p)
413 out2str(const char *p)
420 /* ============ Parser structures */
422 /* control characters in argument strings */
423 #define CTLESC '\201' /* escape next character */
424 #define CTLVAR '\202' /* variable defn */
425 #define CTLENDVAR '\203'
426 #define CTLBACKQ '\204'
427 #define CTLQUOTE 01 /* ored with CTLBACKQ code if in quotes */
428 /* CTLBACKQ | CTLQUOTE == '\205' */
429 #define CTLARI '\206' /* arithmetic expression */
430 #define CTLENDARI '\207'
431 #define CTLQUOTEMARK '\210'
433 /* variable substitution byte (follows CTLVAR) */
434 #define VSTYPE 0x0f /* type of variable substitution */
435 #define VSNUL 0x10 /* colon--treat the empty string as unset */
436 #define VSQUOTE 0x80 /* inside double quotes--suppress splitting */
438 /* values of VSTYPE field */
439 #define VSNORMAL 0x1 /* normal variable: $var or ${var} */
440 #define VSMINUS 0x2 /* ${var-text} */
441 #define VSPLUS 0x3 /* ${var+text} */
442 #define VSQUESTION 0x4 /* ${var?message} */
443 #define VSASSIGN 0x5 /* ${var=text} */
444 #define VSTRIMRIGHT 0x6 /* ${var%pattern} */
445 #define VSTRIMRIGHTMAX 0x7 /* ${var%%pattern} */
446 #define VSTRIMLEFT 0x8 /* ${var#pattern} */
447 #define VSTRIMLEFTMAX 0x9 /* ${var##pattern} */
448 #define VSLENGTH 0xa /* ${#var} */
450 static const char dolatstr[] ALIGN1 = {
451 CTLVAR, VSNORMAL|VSQUOTE, '@', '=', '\0'
487 union node *redirect;
493 struct nodelist *cmdlist;
499 union node *redirect;
512 union node *elsepart;
539 struct nodelist *backquote;
574 struct nredir nredir;
575 struct nbinary nbinary;
579 struct nclist nclist;
588 struct nodelist *next;
601 freefunc(struct funcnode *f)
603 if (f && --f->count < 0)
608 /* ============ Debugging output */
612 static FILE *tracefile;
615 trace_printf(const char *fmt, ...)
622 vfprintf(tracefile, fmt, va);
627 trace_vprintf(const char *fmt, va_list va)
631 vfprintf(tracefile, fmt, va);
635 trace_puts(const char *s)
643 trace_puts_quoted(char *s)
650 putc('"', tracefile);
651 for (p = s; *p; p++) {
653 case '\n': c = 'n'; goto backslash;
654 case '\t': c = 't'; goto backslash;
655 case '\r': c = 'r'; goto backslash;
656 case '"': c = '"'; goto backslash;
657 case '\\': c = '\\'; goto backslash;
658 case CTLESC: c = 'e'; goto backslash;
659 case CTLVAR: c = 'v'; goto backslash;
660 case CTLVAR+CTLQUOTE: c = 'V'; goto backslash;
661 case CTLBACKQ: c = 'q'; goto backslash;
662 case CTLBACKQ+CTLQUOTE: c = 'Q'; goto backslash;
664 putc('\\', tracefile);
668 if (*p >= ' ' && *p <= '~')
671 putc('\\', tracefile);
672 putc(*p >> 6 & 03, tracefile);
673 putc(*p >> 3 & 07, tracefile);
674 putc(*p & 07, tracefile);
679 putc('"', tracefile);
683 trace_puts_args(char **ap)
690 trace_puts_quoted(*ap);
692 putc('\n', tracefile);
695 putc(' ', tracefile);
710 /* leave open because libedit might be using it */
713 strcpy(s, "./trace");
715 if (!freopen(s, "a", tracefile)) {
716 fprintf(stderr, "Can't re-open %s\n", s);
721 tracefile = fopen(s, "a");
722 if (tracefile == NULL) {
723 fprintf(stderr, "Can't open %s\n", s);
729 flags = fcntl(fileno(tracefile), F_GETFL);
731 fcntl(fileno(tracefile), F_SETFL, flags | O_APPEND);
733 setlinebuf(tracefile);
734 fputs("\nTracing started.\n", tracefile);
738 indent(int amount, char *pfx, FILE *fp)
742 for (i = 0; i < amount; i++) {
743 if (pfx && i == amount - 1)
749 /* little circular references here... */
750 static void shtree(union node *n, int ind, char *pfx, FILE *fp);
753 sharg(union node *arg, FILE *fp)
756 struct nodelist *bqlist;
759 if (arg->type != NARG) {
760 out1fmt("<node type %d>\n", arg->type);
763 bqlist = arg->narg.backquote;
764 for (p = arg->narg.text; *p; p++) {
773 if (subtype == VSLENGTH)
782 switch (subtype & VSTYPE) {
815 out1fmt("<subtype %d>", subtype);
822 case CTLBACKQ|CTLQUOTE:
825 shtree(bqlist->n, -1, NULL, fp);
836 shcmd(union node *cmd, FILE *fp)
844 for (np = cmd->ncmd.args; np; np = np->narg.next) {
850 for (np = cmd->ncmd.redirect; np; np = np->nfile.next) {
854 switch (np->nfile.type) {
855 case NTO: s = ">>"+1; dftfd = 1; break;
856 case NCLOBBER: s = ">|"; dftfd = 1; break;
857 case NAPPEND: s = ">>"; dftfd = 1; break;
858 case NTOFD: s = ">&"; dftfd = 1; break;
859 case NFROM: s = "<"; break;
860 case NFROMFD: s = "<&"; break;
861 case NFROMTO: s = "<>"; break;
862 default: s = "*error*"; break;
864 if (np->nfile.fd != dftfd)
865 fprintf(fp, "%d", np->nfile.fd);
867 if (np->nfile.type == NTOFD || np->nfile.type == NFROMFD) {
868 fprintf(fp, "%d", np->ndup.dupfd);
870 sharg(np->nfile.fname, fp);
877 shtree(union node *n, int ind, char *pfx, FILE *fp)
885 indent(ind, pfx, fp);
896 shtree(n->nbinary.ch1, ind, NULL, fp);
899 shtree(n->nbinary.ch2, ind, NULL, fp);
907 for (lp = n->npipe.cmdlist; lp; lp = lp->next) {
912 if (n->npipe.backgnd)
918 fprintf(fp, "<node type %d>", n->type);
926 showtree(union node *n)
928 trace_puts("showtree called\n");
929 shtree(n, 1, NULL, stdout);
932 #define TRACE(param) trace_printf param
933 #define TRACEV(param) trace_vprintf param
938 #define TRACEV(param)
943 /* ============ Parser data */
946 * ash_vmsg() needs parsefile->fd, hence parsefile definition is moved up.
949 struct strlist *next;
958 struct strpush *prev; /* preceding string on stack */
962 struct alias *ap; /* if push was associated with an alias */
964 char *string; /* remember the string since it may change */
968 struct parsefile *prev; /* preceding file on stack */
969 int linno; /* current line */
970 int fd; /* file descriptor (or -1 if string) */
971 int nleft; /* number of chars left in this line */
972 int lleft; /* number of chars left in this buffer */
973 char *nextc; /* next char in buffer */
974 char *buf; /* input buffer */
975 struct strpush *strpush; /* for pushing strings at this level */
976 struct strpush basestrpush; /* so pushing one is fast */
979 static struct parsefile basepf; /* top level input file */
980 static struct parsefile *parsefile = &basepf; /* current input file */
981 static int startlinno; /* line # where last token started */
982 static char *commandname; /* currently executing command */
983 static struct strlist *cmdenviron; /* environment for builtin command */
984 static int exitstatus; /* exit status of last command */
987 /* ============ Message printing */
990 ash_vmsg(const char *msg, va_list ap)
992 fprintf(stderr, "%s: ", arg0);
994 if (strcmp(arg0, commandname))
995 fprintf(stderr, "%s: ", commandname);
996 if (!iflag || parsefile->fd)
997 fprintf(stderr, "line %d: ", startlinno);
999 vfprintf(stderr, msg, ap);
1000 outcslow('\n', stderr);
1004 * Exverror is called to raise the error exception. If the second argument
1005 * is not NULL then error prints an error message using printf style
1006 * formatting. It then raises the error exception.
1008 static void ash_vmsg_and_raise(int, const char *, va_list) ATTRIBUTE_NORETURN;
1010 ash_vmsg_and_raise(int cond, const char *msg, va_list ap)
1014 TRACE(("ash_vmsg_and_raise(%d, \"", cond));
1016 TRACE(("\") pid=%d\n", getpid()));
1018 TRACE(("ash_vmsg_and_raise(%d, NULL) pid=%d\n", cond, getpid()));
1023 flush_stdout_stderr();
1024 raise_exception(cond);
1028 static void ash_msg_and_raise_error(const char *, ...) ATTRIBUTE_NORETURN;
1030 ash_msg_and_raise_error(const char *msg, ...)
1035 ash_vmsg_and_raise(EXERROR, msg, ap);
1040 static void ash_msg_and_raise(int, const char *, ...) ATTRIBUTE_NORETURN;
1042 ash_msg_and_raise(int cond, const char *msg, ...)
1047 ash_vmsg_and_raise(cond, msg, ap);
1053 * error/warning routines for external builtins
1056 ash_msg(const char *fmt, ...)
1066 * Return a string describing an error. The returned string may be a
1067 * pointer to a static buffer that will be overwritten on the next call.
1068 * Action describes the operation that got the error.
1071 errmsg(int e, const char *em)
1073 if (e == ENOENT || e == ENOTDIR) {
1080 /* ============ Memory allocation */
1083 * It appears that grabstackstr() will barf with such alignments
1084 * because stalloc() will return a string allocated in a new stackblock.
1086 #define SHELL_ALIGN(nbytes) (((nbytes) + SHELL_SIZE) & ~SHELL_SIZE)
1088 /* Most machines require the value returned from malloc to be aligned
1089 * in some way. The following macro will get this right
1090 * on many machines. */
1091 SHELL_SIZE = sizeof(union {int i; char *cp; double d; }) - 1,
1092 /* Minimum size of a block */
1093 MINSIZE = SHELL_ALIGN(504),
1096 struct stack_block {
1097 struct stack_block *prev;
1098 char space[MINSIZE];
1102 struct stack_block *stackp;
1105 struct stackmark *marknext;
1108 static struct stack_block stackbase;
1109 static struct stack_block *stackp = &stackbase;
1110 static struct stackmark *markp;
1111 static char *stacknxt = stackbase.space;
1112 static size_t stacknleft = MINSIZE;
1113 static char *sstrend = stackbase.space + MINSIZE;
1114 static int herefd = -1;
1116 #define stackblock() ((void *)stacknxt)
1117 #define stackblocksize() stacknleft
1120 ckrealloc(void * p, size_t nbytes)
1122 p = realloc(p, nbytes);
1124 ash_msg_and_raise_error(bb_msg_memory_exhausted);
1129 ckmalloc(size_t nbytes)
1131 return ckrealloc(NULL, nbytes);
1135 * Make a copy of a string in safe storage.
1138 ckstrdup(const char *s)
1140 char *p = strdup(s);
1142 ash_msg_and_raise_error(bb_msg_memory_exhausted);
1147 * Parse trees for commands are allocated in lifo order, so we use a stack
1148 * to make this more efficient, and also to avoid all sorts of exception
1149 * handling code to handle interrupts in the middle of a parse.
1151 * The size 504 was chosen because the Ultrix malloc handles that size
1155 stalloc(size_t nbytes)
1160 aligned = SHELL_ALIGN(nbytes);
1161 if (aligned > stacknleft) {
1164 struct stack_block *sp;
1166 blocksize = aligned;
1167 if (blocksize < MINSIZE)
1168 blocksize = MINSIZE;
1169 len = sizeof(struct stack_block) - MINSIZE + blocksize;
1170 if (len < blocksize)
1171 ash_msg_and_raise_error(bb_msg_memory_exhausted);
1175 stacknxt = sp->space;
1176 stacknleft = blocksize;
1177 sstrend = stacknxt + blocksize;
1182 stacknxt += aligned;
1183 stacknleft -= aligned;
1191 if (!p || (stacknxt < (char *)p) || ((char *)p < stackp->space)) {
1192 write(2, "stunalloc\n", 10);
1196 stacknleft += stacknxt - (char *)p;
1201 * Like strdup but works with the ash stack.
1204 ststrdup(const char *p)
1206 size_t len = strlen(p) + 1;
1207 return memcpy(stalloc(len), p, len);
1211 setstackmark(struct stackmark *mark)
1213 mark->stackp = stackp;
1214 mark->stacknxt = stacknxt;
1215 mark->stacknleft = stacknleft;
1216 mark->marknext = markp;
1221 popstackmark(struct stackmark *mark)
1223 struct stack_block *sp;
1229 markp = mark->marknext;
1230 while (stackp != mark->stackp) {
1235 stacknxt = mark->stacknxt;
1236 stacknleft = mark->stacknleft;
1237 sstrend = mark->stacknxt + mark->stacknleft;
1242 * When the parser reads in a string, it wants to stick the string on the
1243 * stack and only adjust the stack pointer when it knows how big the
1244 * string is. Stackblock (defined in stack.h) returns a pointer to a block
1245 * of space on top of the stack and stackblocklen returns the length of
1246 * this block. Growstackblock will grow this space by at least one byte,
1247 * possibly moving it (like realloc). Grabstackblock actually allocates the
1248 * part of the block that has been used.
1251 growstackblock(void)
1255 newlen = stacknleft * 2;
1256 if (newlen < stacknleft)
1257 ash_msg_and_raise_error(bb_msg_memory_exhausted);
1261 if (stacknxt == stackp->space && stackp != &stackbase) {
1262 struct stack_block *oldstackp;
1263 struct stackmark *xmark;
1264 struct stack_block *sp;
1265 struct stack_block *prevstackp;
1271 prevstackp = sp->prev;
1272 grosslen = newlen + sizeof(struct stack_block) - MINSIZE;
1273 sp = ckrealloc(sp, grosslen);
1274 sp->prev = prevstackp;
1276 stacknxt = sp->space;
1277 stacknleft = newlen;
1278 sstrend = sp->space + newlen;
1281 * Stack marks pointing to the start of the old block
1282 * must be relocated to point to the new block
1285 while (xmark != NULL && xmark->stackp == oldstackp) {
1286 xmark->stackp = stackp;
1287 xmark->stacknxt = stacknxt;
1288 xmark->stacknleft = stacknleft;
1289 xmark = xmark->marknext;
1293 char *oldspace = stacknxt;
1294 int oldlen = stacknleft;
1295 char *p = stalloc(newlen);
1297 /* free the space we just allocated */
1298 stacknxt = memcpy(p, oldspace, oldlen);
1299 stacknleft += newlen;
1304 grabstackblock(size_t len)
1306 len = SHELL_ALIGN(len);
1312 * The following routines are somewhat easier to use than the above.
1313 * The user declares a variable of type STACKSTR, which may be declared
1314 * to be a register. The macro STARTSTACKSTR initializes things. Then
1315 * the user uses the macro STPUTC to add characters to the string. In
1316 * effect, STPUTC(c, p) is the same as *p++ = c except that the stack is
1317 * grown as necessary. When the user is done, she can just leave the
1318 * string there and refer to it using stackblock(). Or she can allocate
1319 * the space for it using grabstackstr(). If it is necessary to allow
1320 * someone else to use the stack temporarily and then continue to grow
1321 * the string, the user should use grabstack to allocate the space, and
1322 * then call ungrabstr(p) to return to the previous mode of operation.
1324 * USTPUTC is like STPUTC except that it doesn't check for overflow.
1325 * CHECKSTACKSPACE can be called before USTPUTC to ensure that there
1326 * is space for at least one character.
1331 size_t len = stackblocksize();
1332 if (herefd >= 0 && len >= 1024) {
1333 full_write(herefd, stackblock(), len);
1334 return stackblock();
1337 return stackblock() + len;
1341 * Called from CHECKSTRSPACE.
1344 makestrspace(size_t newlen, char *p)
1346 size_t len = p - stacknxt;
1347 size_t size = stackblocksize();
1352 size = stackblocksize();
1354 if (nleft >= newlen)
1358 return stackblock() + len;
1362 stack_nputstr(const char *s, size_t n, char *p)
1364 p = makestrspace(n, p);
1365 p = memcpy(p, s, n) + n;
1370 stack_putstr(const char *s, char *p)
1372 return stack_nputstr(s, strlen(s), p);
1376 _STPUTC(int c, char *p)
1384 #define STARTSTACKSTR(p) ((p) = stackblock())
1385 #define STPUTC(c, p) ((p) = _STPUTC((c), (p)))
1386 #define CHECKSTRSPACE(n, p) \
1390 size_t m = sstrend - q; \
1392 (p) = makestrspace(l, q); \
1394 #define USTPUTC(c, p) (*p++ = (c))
1395 #define STACKSTRNUL(p) \
1397 if ((p) == sstrend) \
1398 p = growstackstr(); \
1401 #define STUNPUTC(p) (--p)
1402 #define STTOPC(p) (p[-1])
1403 #define STADJUST(amount, p) (p += (amount))
1405 #define grabstackstr(p) stalloc((char *)(p) - (char *)stackblock())
1406 #define ungrabstackstr(s, p) stunalloc((s))
1407 #define stackstrend() ((void *)sstrend)
1410 /* ============ String helpers */
1413 * prefix -- see if pfx is a prefix of string.
1416 prefix(const char *string, const char *pfx)
1419 if (*pfx++ != *string++)
1422 return (char *) string;
1426 * Check for a valid number. This should be elsewhere.
1429 is_number(const char *p)
1434 } while (*++p != '\0');
1439 * Convert a string of digits to an integer, printing an error message on
1443 number(const char *s)
1446 ash_msg_and_raise_error(illnum, s);
1451 * Produce a possibly single quoted string suitable as input to the shell.
1452 * The return string is allocated on the stack.
1455 single_quote(const char *s)
1465 len = strchrnul(s, '\'') - s;
1467 q = p = makestrspace(len + 3, p);
1470 q = memcpy(q, s, len) + len;
1476 len = strspn(s, "'");
1480 q = p = makestrspace(len + 3, p);
1483 q = memcpy(q, s, len) + len;
1492 return stackblock();
1496 /* ============ nextopt */
1498 static char **argptr; /* argument list for builtin commands */
1499 static char *optionarg; /* set by nextopt (like getopt) */
1500 static char *optptr; /* used by nextopt */
1503 * XXX - should get rid of. have all builtins use getopt(3). the
1504 * library getopt must have the BSD extension static variable "optreset"
1505 * otherwise it can't be used within the shell safely.
1507 * Standard option processing (a la getopt) for builtin routines. The
1508 * only argument that is passed to nextopt is the option string; the
1509 * other arguments are unnecessary. It return the character, or '\0' on
1513 nextopt(const char *optstring)
1520 if (p == NULL || *p == '\0') {
1522 if (p == NULL || *p != '-' || *++p == '\0')
1525 if (LONE_DASH(p)) /* check for "--" */
1529 for (q = optstring; *q != c; ) {
1531 ash_msg_and_raise_error("illegal option -%c", c);
1536 if (*p == '\0' && (p = *argptr++) == NULL)
1537 ash_msg_and_raise_error("no arg for -%c option", c);
1546 /* ============ Math support definitions */
1548 #if ENABLE_ASH_MATH_SUPPORT_64
1549 typedef int64_t arith_t;
1550 #define arith_t_type long long
1552 typedef long arith_t;
1553 #define arith_t_type long
1556 #if ENABLE_ASH_MATH_SUPPORT
1557 static arith_t dash_arith(const char *);
1558 static arith_t arith(const char *expr, int *perrcode);
1561 #if ENABLE_ASH_RANDOM_SUPPORT
1562 static unsigned long rseed;
1569 /* ============ Shell variables */
1572 #define VEXPORT 0x01 /* variable is exported */
1573 #define VREADONLY 0x02 /* variable cannot be modified */
1574 #define VSTRFIXED 0x04 /* variable struct is statically allocated */
1575 #define VTEXTFIXED 0x08 /* text is statically allocated */
1576 #define VSTACK 0x10 /* text is allocated on the stack */
1577 #define VUNSET 0x20 /* the variable is not set */
1578 #define VNOFUNC 0x40 /* don't call the callback function */
1579 #define VNOSET 0x80 /* do not set variable - just readonly test */
1580 #define VNOSAVE 0x100 /* when text is on the heap before setvareq */
1582 # define VDYNAMIC 0x200 /* dynamic variable */
1588 static const char defifsvar[] ALIGN1 = "IFS= \t\n";
1589 #define defifs (defifsvar + 4)
1591 static const char defifs[] ALIGN1 = " \t\n";
1595 int nparam; /* # of positional parameters (without $0) */
1596 unsigned char malloc; /* if parameter list dynamically allocated */
1597 char **p; /* parameter list */
1598 #if ENABLE_ASH_GETOPTS
1599 int optind; /* next parameter to be processed by getopts */
1600 int optoff; /* used by getopts */
1604 static struct shparam shellparam; /* $@ current positional parameters */
1607 * Free the list of positional parameters.
1610 freeparam(volatile struct shparam *param)
1614 if (param->malloc) {
1615 for (ap = param->p; *ap; ap++)
1621 #if ENABLE_ASH_GETOPTS
1623 getoptsreset(const char *value)
1625 shellparam.optind = number(value);
1626 shellparam.optoff = -1;
1631 struct var *next; /* next entry in hash list */
1632 int flags; /* flags are defined above */
1633 const char *text; /* name=value */
1634 void (*func)(const char *); /* function to be called when */
1635 /* the variable gets set/unset */
1639 struct localvar *next; /* next local variable in list */
1640 struct var *vp; /* the variable that was made local */
1641 int flags; /* saved flags */
1642 const char *text; /* saved text */
1645 /* Forward decls for varinit[] */
1646 #if ENABLE_LOCALE_SUPPORT
1648 change_lc_all(const char *value)
1650 if (value && *value != '\0')
1651 setlocale(LC_ALL, value);
1654 change_lc_ctype(const char *value)
1656 if (value && *value != '\0')
1657 setlocale(LC_CTYPE, value);
1661 static void chkmail(void);
1662 static void changemail(const char *);
1664 static void changepath(const char *);
1665 #if ENABLE_ASH_RANDOM_SUPPORT
1666 static void change_random(const char *);
1669 static struct var varinit[] = {
1671 { NULL, VSTRFIXED|VTEXTFIXED, defifsvar, NULL },
1673 { NULL, VSTRFIXED|VTEXTFIXED|VUNSET, "IFS\0", NULL },
1676 { NULL, VSTRFIXED|VTEXTFIXED|VUNSET, "MAIL\0", changemail },
1677 { NULL, VSTRFIXED|VTEXTFIXED|VUNSET, "MAILPATH\0", changemail },
1679 { NULL, VSTRFIXED|VTEXTFIXED, bb_PATH_root_path, changepath },
1680 { NULL, VSTRFIXED|VTEXTFIXED, "PS1=$ ", NULL },
1681 { NULL, VSTRFIXED|VTEXTFIXED, "PS2=> ", NULL },
1682 { NULL, VSTRFIXED|VTEXTFIXED, "PS4=+ ", NULL },
1683 #if ENABLE_ASH_GETOPTS
1684 { NULL, VSTRFIXED|VTEXTFIXED, "OPTIND=1", getoptsreset },
1686 #if ENABLE_ASH_RANDOM_SUPPORT
1687 { NULL, VSTRFIXED|VTEXTFIXED|VUNSET|VDYNAMIC, "RANDOM\0", change_random },
1689 #if ENABLE_LOCALE_SUPPORT
1690 { NULL, VSTRFIXED | VTEXTFIXED | VUNSET, "LC_ALL\0", change_lc_all },
1691 { NULL, VSTRFIXED | VTEXTFIXED | VUNSET, "LC_CTYPE\0", change_lc_ctype },
1693 #if ENABLE_FEATURE_EDITING_SAVEHISTORY
1694 { NULL, VSTRFIXED | VTEXTFIXED | VUNSET, "HISTFILE\0", NULL },
1698 #define vifs varinit[0]
1700 #define vmail (&vifs)[1]
1701 #define vmpath (&vmail)[1]
1705 #define vpath (&vmpath)[1]
1706 #define vps1 (&vpath)[1]
1707 #define vps2 (&vps1)[1]
1708 #define vps4 (&vps2)[1]
1709 #define voptind (&vps4)[1]
1710 #if ENABLE_ASH_GETOPTS
1711 #define vrandom (&voptind)[1]
1713 #define vrandom (&vps4)[1]
1717 * The following macros access the values of the above variables.
1718 * They have to skip over the name. They return the null string
1719 * for unset variables.
1721 #define ifsval() (vifs.text + 4)
1722 #define ifsset() ((vifs.flags & VUNSET) == 0)
1723 #define mailval() (vmail.text + 5)
1724 #define mpathval() (vmpath.text + 9)
1725 #define pathval() (vpath.text + 5)
1726 #define ps1val() (vps1.text + 4)
1727 #define ps2val() (vps2.text + 4)
1728 #define ps4val() (vps4.text + 4)
1729 #define optindval() (voptind.text + 7)
1731 #define mpathset() ((vmpath.flags & VUNSET) == 0)
1734 * The parsefile structure pointed to by the global variable parsefile
1735 * contains information about the current file being read.
1738 struct redirtab *next;
1743 static struct redirtab *redirlist;
1744 static int nullredirs;
1745 static int preverrout_fd; /* save fd2 before print debug if xflag is set. */
1749 static struct var *vartab[VTABSIZE];
1751 #define is_name(c) ((c) == '_' || isalpha((unsigned char)(c)))
1752 #define is_in_name(c) ((c) == '_' || isalnum((unsigned char)(c)))
1755 * Return of a legal variable name (a letter or underscore followed by zero or
1756 * more letters, underscores, and digits).
1759 endofname(const char *name)
1767 if (!is_in_name(*p))
1774 * Compares two strings up to the first = or '\0'. The first
1775 * string must be terminated by '='; the second may be terminated by
1776 * either '=' or '\0'.
1779 varcmp(const char *p, const char *q)
1783 while ((c = *p) == (d = *q)) {
1798 varequal(const char *a, const char *b)
1800 return !varcmp(a, b);
1804 * Find the appropriate entry in the hash table from the name.
1806 static struct var **
1807 hashvar(const char *p)
1811 hashval = ((unsigned char) *p) << 4;
1812 while (*p && *p != '=')
1813 hashval += (unsigned char) *p++;
1814 return &vartab[hashval % VTABSIZE];
1818 vpcmp(const void *a, const void *b)
1820 return varcmp(*(const char **)a, *(const char **)b);
1824 * This routine initializes the builtin variables.
1834 * PS1 depends on uid
1836 #if ENABLE_FEATURE_EDITING && ENABLE_FEATURE_EDITING_FANCY_PROMPT
1837 vps1.text = "PS1=\\w \\$ ";
1840 vps1.text = "PS1=# ";
1843 end = vp + ARRAY_SIZE(varinit);
1845 vpp = hashvar(vp->text);
1848 } while (++vp < end);
1851 static struct var **
1852 findvar(struct var **vpp, const char *name)
1854 for (; *vpp; vpp = &(*vpp)->next) {
1855 if (varequal((*vpp)->text, name)) {
1863 * Find the value of a variable. Returns NULL if not set.
1866 lookupvar(const char *name)
1870 v = *findvar(hashvar(name), name);
1874 * Dynamic variables are implemented roughly the same way they are
1875 * in bash. Namely, they're "special" so long as they aren't unset.
1876 * As soon as they're unset, they're no longer dynamic, and dynamic
1877 * lookup will no longer happen at that point. -- PFM.
1879 if ((v->flags & VDYNAMIC))
1882 if (!(v->flags & VUNSET))
1883 return strchrnul(v->text, '=') + 1;
1889 * Search the environment of a builtin command.
1892 bltinlookup(const char *name)
1896 for (sp = cmdenviron; sp; sp = sp->next) {
1897 if (varequal(sp->text, name))
1898 return strchrnul(sp->text, '=') + 1;
1900 return lookupvar(name);
1904 * Same as setvar except that the variable and value are passed in
1905 * the first argument as name=value. Since the first argument will
1906 * be actually stored in the table, it should not be a string that
1908 * Called with interrupts off.
1911 setvareq(char *s, int flags)
1913 struct var *vp, **vpp;
1916 flags |= (VEXPORT & (((unsigned) (1 - aflag)) - 1));
1917 vp = *findvar(vpp, s);
1919 if ((vp->flags & (VREADONLY|VDYNAMIC)) == VREADONLY) {
1922 if (flags & VNOSAVE)
1925 ash_msg_and_raise_error("%.*s: is read only", strchrnul(n, '=') - n, n);
1931 if (vp->func && (flags & VNOFUNC) == 0)
1932 (*vp->func)(strchrnul(s, '=') + 1);
1934 if ((vp->flags & (VTEXTFIXED|VSTACK)) == 0)
1935 free((char*)vp->text);
1937 flags |= vp->flags & ~(VTEXTFIXED|VSTACK|VNOSAVE|VUNSET);
1942 vp = ckmalloc(sizeof(*vp));
1947 if (!(flags & (VTEXTFIXED|VSTACK|VNOSAVE)))
1954 * Set the value of a variable. The flags argument is ored with the
1955 * flags of the variable. If val is NULL, the variable is unset.
1958 setvar(const char *name, const char *val, int flags)
1965 q = endofname(name);
1966 p = strchrnul(q, '=');
1968 if (!namelen || p != q)
1969 ash_msg_and_raise_error("%.*s: bad variable name", namelen, name);
1974 vallen = strlen(val);
1977 nameeq = ckmalloc(namelen + vallen + 2);
1978 p = memcpy(nameeq, name, namelen) + namelen;
1981 p = memcpy(p, val, vallen) + vallen;
1984 setvareq(nameeq, flags | VNOSAVE);
1988 #if ENABLE_ASH_GETOPTS
1990 * Safe version of setvar, returns 1 on success 0 on failure.
1993 setvarsafe(const char *name, const char *val, int flags)
1996 volatile int saveint;
1997 struct jmploc *volatile savehandler = exception_handler;
1998 struct jmploc jmploc;
2001 if (setjmp(jmploc.loc))
2004 exception_handler = &jmploc;
2005 setvar(name, val, flags);
2008 exception_handler = savehandler;
2009 RESTORE_INT(saveint);
2015 * Unset the specified variable.
2018 unsetvar(const char *s)
2024 vpp = findvar(hashvar(s), s);
2028 int flags = vp->flags;
2031 if (flags & VREADONLY)
2034 vp->flags &= ~VDYNAMIC;
2038 if ((flags & VSTRFIXED) == 0) {
2040 if ((flags & (VTEXTFIXED|VSTACK)) == 0)
2041 free((char*)vp->text);
2047 vp->flags &= ~VEXPORT;
2057 * Process a linked list of variable assignments.
2060 listsetvar(struct strlist *list_set_var, int flags)
2062 struct strlist *lp = list_set_var;
2068 setvareq(lp->text, flags);
2075 * Generate a list of variables satisfying the given conditions.
2078 listvars(int on, int off, char ***end)
2089 for (vp = *vpp; vp; vp = vp->next) {
2090 if ((vp->flags & mask) == on) {
2091 if (ep == stackstrend())
2092 ep = growstackstr();
2093 *ep++ = (char *) vp->text;
2096 } while (++vpp < vartab + VTABSIZE);
2097 if (ep == stackstrend())
2098 ep = growstackstr();
2102 return grabstackstr(ep);
2106 /* ============ Path search helper
2108 * The variable path (passed by reference) should be set to the start
2109 * of the path before the first call; padvance will update
2110 * this value as it proceeds. Successive calls to padvance will return
2111 * the possible path expansions in sequence. If an option (indicated by
2112 * a percent sign) appears in the path entry then the global variable
2113 * pathopt will be set to point to it; otherwise pathopt will be set to
2116 static const char *pathopt; /* set by padvance */
2119 padvance(const char **path, const char *name)
2129 for (p = start; *p && *p != ':' && *p != '%'; p++);
2130 len = p - start + strlen(name) + 2; /* "2" is for '/' and '\0' */
2131 while (stackblocksize() < len)
2135 memcpy(q, start, p - start);
2143 while (*p && *p != ':') p++;
2149 return stalloc(len);
2153 /* ============ Prompt */
2155 static smallint doprompt; /* if set, prompt the user */
2156 static smallint needprompt; /* true if interactive and at start of line */
2158 #if ENABLE_FEATURE_EDITING
2159 static line_input_t *line_input_state;
2160 static const char *cmdedit_prompt;
2162 putprompt(const char *s)
2164 if (ENABLE_ASH_EXPAND_PRMT) {
2165 free((char*)cmdedit_prompt);
2166 cmdedit_prompt = ckstrdup(s);
2173 putprompt(const char *s)
2179 #if ENABLE_ASH_EXPAND_PRMT
2180 /* expandstr() needs parsing machinery, so it is far away ahead... */
2181 static const char *expandstr(const char *ps);
2183 #define expandstr(s) s
2187 setprompt(int whichprompt)
2190 #if ENABLE_ASH_EXPAND_PRMT
2191 struct stackmark smark;
2196 switch (whichprompt) {
2206 #if ENABLE_ASH_EXPAND_PRMT
2207 setstackmark(&smark);
2208 stalloc(stackblocksize());
2210 putprompt(expandstr(prompt));
2211 #if ENABLE_ASH_EXPAND_PRMT
2212 popstackmark(&smark);
2217 /* ============ The cd and pwd commands */
2219 #define CD_PHYSICAL 1
2222 static int docd(const char *, int);
2224 static char *curdir = nullstr; /* current working directory */
2225 static char *physdir = nullstr; /* physical working directory */
2234 while ((i = nextopt("LP"))) {
2236 flags ^= CD_PHYSICAL;
2245 * Update curdir (the name of the current directory) in response to a
2249 updatepwd(const char *dir)
2256 cdcomppath = ststrdup(dir);
2259 if (curdir == nullstr)
2261 new = stack_putstr(curdir, new);
2263 new = makestrspace(strlen(dir) + 2, new);
2264 lim = stackblock() + 1;
2268 if (new > lim && *lim == '/')
2273 if (dir[1] == '/' && dir[2] != '/') {
2279 p = strtok(cdcomppath, "/");
2283 if (p[1] == '.' && p[2] == '\0') {
2295 new = stack_putstr(p, new);
2303 return stackblock();
2307 * Find out what the current directory is. If we already know the current
2308 * directory, this routine returns immediately.
2313 char *dir = getcwd(0, 0);
2314 return dir ? dir : nullstr;
2318 setpwd(const char *val, int setold)
2322 oldcur = dir = curdir;
2325 setvar("OLDPWD", oldcur, VEXPORT);
2328 if (physdir != nullstr) {
2329 if (physdir != oldcur)
2333 if (oldcur == val || !val) {
2339 dir = ckstrdup(val);
2340 if (oldcur != dir && oldcur != nullstr) {
2345 setvar("PWD", dir, VEXPORT);
2348 static void hashcd(void);
2351 * Actually do the chdir. We also call hashcd to let the routines in exec.c
2352 * know that the current directory has changed.
2355 docd(const char *dest, int flags)
2357 const char *dir = 0;
2360 TRACE(("docd(\"%s\", %d) called\n", dest, flags));
2363 if (!(flags & CD_PHYSICAL)) {
2364 dir = updatepwd(dest);
2379 cdcmd(int argc, char **argv)
2391 dest = bltinlookup(homestr);
2392 else if (LONE_DASH(dest)) {
2393 dest = bltinlookup("OLDPWD");
2415 path = bltinlookup("CDPATH");
2424 p = padvance(&path, dest);
2425 if (stat(p, &statb) >= 0 && S_ISDIR(statb.st_mode)) {
2429 if (!docd(p, flags))
2434 ash_msg_and_raise_error("can't cd to %s", dest);
2437 if (flags & CD_PRINT)
2438 out1fmt(snlfmt, curdir);
2443 pwdcmd(int argc, char **argv)
2446 const char *dir = curdir;
2450 if (physdir == nullstr)
2454 out1fmt(snlfmt, dir);
2459 /* ============ ... */
2461 #define IBUFSIZ COMMON_BUFSIZE
2462 #define basebuf bb_common_bufsiz1 /* buffer for top level input file */
2464 /* Syntax classes */
2465 #define CWORD 0 /* character is nothing special */
2466 #define CNL 1 /* newline character */
2467 #define CBACK 2 /* a backslash character */
2468 #define CSQUOTE 3 /* single quote */
2469 #define CDQUOTE 4 /* double quote */
2470 #define CENDQUOTE 5 /* a terminating quote */
2471 #define CBQUOTE 6 /* backwards single quote */
2472 #define CVAR 7 /* a dollar sign */
2473 #define CENDVAR 8 /* a '}' character */
2474 #define CLP 9 /* a left paren in arithmetic */
2475 #define CRP 10 /* a right paren in arithmetic */
2476 #define CENDFILE 11 /* end of file */
2477 #define CCTL 12 /* like CWORD, except it must be escaped */
2478 #define CSPCL 13 /* these terminate a word */
2479 #define CIGN 14 /* character should be ignored */
2481 #if ENABLE_ASH_ALIAS
2485 #define PEOA_OR_PEOF PEOA
2489 #define PEOA_OR_PEOF PEOF
2492 /* number syntax index */
2493 #define BASESYNTAX 0 /* not in quotes */
2494 #define DQSYNTAX 1 /* in double quotes */
2495 #define SQSYNTAX 2 /* in single quotes */
2496 #define ARISYNTAX 3 /* in arithmetic */
2497 #define PSSYNTAX 4 /* prompt */
2499 #if ENABLE_ASH_OPTIMIZE_FOR_SIZE
2500 #define USE_SIT_FUNCTION
2503 #if ENABLE_ASH_MATH_SUPPORT
2504 static const char S_I_T[][4] = {
2505 #if ENABLE_ASH_ALIAS
2506 { CSPCL, CIGN, CIGN, CIGN }, /* 0, PEOA */
2508 { CSPCL, CWORD, CWORD, CWORD }, /* 1, ' ' */
2509 { CNL, CNL, CNL, CNL }, /* 2, \n */
2510 { CWORD, CCTL, CCTL, CWORD }, /* 3, !*-/:=?[]~ */
2511 { CDQUOTE, CENDQUOTE, CWORD, CWORD }, /* 4, '"' */
2512 { CVAR, CVAR, CWORD, CVAR }, /* 5, $ */
2513 { CSQUOTE, CWORD, CENDQUOTE, CWORD }, /* 6, "'" */
2514 { CSPCL, CWORD, CWORD, CLP }, /* 7, ( */
2515 { CSPCL, CWORD, CWORD, CRP }, /* 8, ) */
2516 { CBACK, CBACK, CCTL, CBACK }, /* 9, \ */
2517 { CBQUOTE, CBQUOTE, CWORD, CBQUOTE }, /* 10, ` */
2518 { CENDVAR, CENDVAR, CWORD, CENDVAR }, /* 11, } */
2519 #ifndef USE_SIT_FUNCTION
2520 { CENDFILE, CENDFILE, CENDFILE, CENDFILE }, /* 12, PEOF */
2521 { CWORD, CWORD, CWORD, CWORD }, /* 13, 0-9A-Za-z */
2522 { CCTL, CCTL, CCTL, CCTL } /* 14, CTLESC ... */
2526 static const char S_I_T[][3] = {
2527 #if ENABLE_ASH_ALIAS
2528 { CSPCL, CIGN, CIGN }, /* 0, PEOA */
2530 { CSPCL, CWORD, CWORD }, /* 1, ' ' */
2531 { CNL, CNL, CNL }, /* 2, \n */
2532 { CWORD, CCTL, CCTL }, /* 3, !*-/:=?[]~ */
2533 { CDQUOTE, CENDQUOTE, CWORD }, /* 4, '"' */
2534 { CVAR, CVAR, CWORD }, /* 5, $ */
2535 { CSQUOTE, CWORD, CENDQUOTE }, /* 6, "'" */
2536 { CSPCL, CWORD, CWORD }, /* 7, ( */
2537 { CSPCL, CWORD, CWORD }, /* 8, ) */
2538 { CBACK, CBACK, CCTL }, /* 9, \ */
2539 { CBQUOTE, CBQUOTE, CWORD }, /* 10, ` */
2540 { CENDVAR, CENDVAR, CWORD }, /* 11, } */
2541 #ifndef USE_SIT_FUNCTION
2542 { CENDFILE, CENDFILE, CENDFILE }, /* 12, PEOF */
2543 { CWORD, CWORD, CWORD }, /* 13, 0-9A-Za-z */
2544 { CCTL, CCTL, CCTL } /* 14, CTLESC ... */
2547 #endif /* ASH_MATH_SUPPORT */
2549 #ifdef USE_SIT_FUNCTION
2552 SIT(int c, int syntax)
2554 static const char spec_symbls[] ALIGN1 = "\t\n !\"$&'()*-/:;<=>?[\\]`|}~";
2555 #if ENABLE_ASH_ALIAS
2556 static const char syntax_index_table[] ALIGN1 = {
2557 1, 2, 1, 3, 4, 5, 1, 6, /* "\t\n !\"$&'" */
2558 7, 8, 3, 3, 3, 3, 1, 1, /* "()*-/:;<" */
2559 3, 1, 3, 3, 9, 3, 10, 1, /* "=>?[\\]`|" */
2563 static const char syntax_index_table[] ALIGN1 = {
2564 0, 1, 0, 2, 3, 4, 0, 5, /* "\t\n !\"$&'" */
2565 6, 7, 2, 2, 2, 2, 0, 0, /* "()*-/:;<" */
2566 2, 0, 2, 2, 8, 2, 9, 0, /* "=>?[\\]`|" */
2573 if (c == PEOF) /* 2^8+2 */
2575 #if ENABLE_ASH_ALIAS
2576 if (c == PEOA) /* 2^8+1 */
2580 #define U_C(c) ((unsigned char)(c))
2582 if ((unsigned char)c >= (unsigned char)(CTLESC)
2583 && (unsigned char)c <= (unsigned char)(CTLQUOTEMARK)
2587 s = strchr(spec_symbls, c);
2588 if (s == NULL || *s == '\0')
2590 indx = syntax_index_table[(s - spec_symbls)];
2592 return S_I_T[indx][syntax];
2595 #else /* !USE_SIT_FUNCTION */
2597 #if ENABLE_ASH_ALIAS
2598 #define CSPCL_CIGN_CIGN_CIGN 0
2599 #define CSPCL_CWORD_CWORD_CWORD 1
2600 #define CNL_CNL_CNL_CNL 2
2601 #define CWORD_CCTL_CCTL_CWORD 3
2602 #define CDQUOTE_CENDQUOTE_CWORD_CWORD 4
2603 #define CVAR_CVAR_CWORD_CVAR 5
2604 #define CSQUOTE_CWORD_CENDQUOTE_CWORD 6
2605 #define CSPCL_CWORD_CWORD_CLP 7
2606 #define CSPCL_CWORD_CWORD_CRP 8
2607 #define CBACK_CBACK_CCTL_CBACK 9
2608 #define CBQUOTE_CBQUOTE_CWORD_CBQUOTE 10
2609 #define CENDVAR_CENDVAR_CWORD_CENDVAR 11
2610 #define CENDFILE_CENDFILE_CENDFILE_CENDFILE 12
2611 #define CWORD_CWORD_CWORD_CWORD 13
2612 #define CCTL_CCTL_CCTL_CCTL 14
2614 #define CSPCL_CWORD_CWORD_CWORD 0
2615 #define CNL_CNL_CNL_CNL 1
2616 #define CWORD_CCTL_CCTL_CWORD 2
2617 #define CDQUOTE_CENDQUOTE_CWORD_CWORD 3
2618 #define CVAR_CVAR_CWORD_CVAR 4
2619 #define CSQUOTE_CWORD_CENDQUOTE_CWORD 5
2620 #define CSPCL_CWORD_CWORD_CLP 6
2621 #define CSPCL_CWORD_CWORD_CRP 7
2622 #define CBACK_CBACK_CCTL_CBACK 8
2623 #define CBQUOTE_CBQUOTE_CWORD_CBQUOTE 9
2624 #define CENDVAR_CENDVAR_CWORD_CENDVAR 10
2625 #define CENDFILE_CENDFILE_CENDFILE_CENDFILE 11
2626 #define CWORD_CWORD_CWORD_CWORD 12
2627 #define CCTL_CCTL_CCTL_CCTL 13
2630 static const char syntax_index_table[258] = {
2631 /* BASESYNTAX_DQSYNTAX_SQSYNTAX_ARISYNTAX */
2632 /* 0 PEOF */ CENDFILE_CENDFILE_CENDFILE_CENDFILE,
2633 #if ENABLE_ASH_ALIAS
2634 /* 1 PEOA */ CSPCL_CIGN_CIGN_CIGN,
2636 /* 2 -128 0x80 */ CWORD_CWORD_CWORD_CWORD,
2637 /* 3 -127 CTLESC */ CCTL_CCTL_CCTL_CCTL,
2638 /* 4 -126 CTLVAR */ CCTL_CCTL_CCTL_CCTL,
2639 /* 5 -125 CTLENDVAR */ CCTL_CCTL_CCTL_CCTL,
2640 /* 6 -124 CTLBACKQ */ CCTL_CCTL_CCTL_CCTL,
2641 /* 7 -123 CTLQUOTE */ CCTL_CCTL_CCTL_CCTL,
2642 /* 8 -122 CTLARI */ CCTL_CCTL_CCTL_CCTL,
2643 /* 9 -121 CTLENDARI */ CCTL_CCTL_CCTL_CCTL,
2644 /* 10 -120 CTLQUOTEMARK */ CCTL_CCTL_CCTL_CCTL,
2645 /* 11 -119 */ CWORD_CWORD_CWORD_CWORD,
2646 /* 12 -118 */ CWORD_CWORD_CWORD_CWORD,
2647 /* 13 -117 */ CWORD_CWORD_CWORD_CWORD,
2648 /* 14 -116 */ CWORD_CWORD_CWORD_CWORD,
2649 /* 15 -115 */ CWORD_CWORD_CWORD_CWORD,
2650 /* 16 -114 */ CWORD_CWORD_CWORD_CWORD,
2651 /* 17 -113 */ CWORD_CWORD_CWORD_CWORD,
2652 /* 18 -112 */ CWORD_CWORD_CWORD_CWORD,
2653 /* 19 -111 */ CWORD_CWORD_CWORD_CWORD,
2654 /* 20 -110 */ CWORD_CWORD_CWORD_CWORD,
2655 /* 21 -109 */ CWORD_CWORD_CWORD_CWORD,
2656 /* 22 -108 */ CWORD_CWORD_CWORD_CWORD,
2657 /* 23 -107 */ CWORD_CWORD_CWORD_CWORD,
2658 /* 24 -106 */ CWORD_CWORD_CWORD_CWORD,
2659 /* 25 -105 */ CWORD_CWORD_CWORD_CWORD,
2660 /* 26 -104 */ CWORD_CWORD_CWORD_CWORD,
2661 /* 27 -103 */ CWORD_CWORD_CWORD_CWORD,
2662 /* 28 -102 */ CWORD_CWORD_CWORD_CWORD,
2663 /* 29 -101 */ CWORD_CWORD_CWORD_CWORD,
2664 /* 30 -100 */ CWORD_CWORD_CWORD_CWORD,
2665 /* 31 -99 */ CWORD_CWORD_CWORD_CWORD,
2666 /* 32 -98 */ CWORD_CWORD_CWORD_CWORD,
2667 /* 33 -97 */ CWORD_CWORD_CWORD_CWORD,
2668 /* 34 -96 */ CWORD_CWORD_CWORD_CWORD,
2669 /* 35 -95 */ CWORD_CWORD_CWORD_CWORD,
2670 /* 36 -94 */ CWORD_CWORD_CWORD_CWORD,
2671 /* 37 -93 */ CWORD_CWORD_CWORD_CWORD,
2672 /* 38 -92 */ CWORD_CWORD_CWORD_CWORD,
2673 /* 39 -91 */ CWORD_CWORD_CWORD_CWORD,
2674 /* 40 -90 */ CWORD_CWORD_CWORD_CWORD,
2675 /* 41 -89 */ CWORD_CWORD_CWORD_CWORD,
2676 /* 42 -88 */ CWORD_CWORD_CWORD_CWORD,
2677 /* 43 -87 */ CWORD_CWORD_CWORD_CWORD,
2678 /* 44 -86 */ CWORD_CWORD_CWORD_CWORD,
2679 /* 45 -85 */ CWORD_CWORD_CWORD_CWORD,
2680 /* 46 -84 */ CWORD_CWORD_CWORD_CWORD,
2681 /* 47 -83 */ CWORD_CWORD_CWORD_CWORD,
2682 /* 48 -82 */ CWORD_CWORD_CWORD_CWORD,
2683 /* 49 -81 */ CWORD_CWORD_CWORD_CWORD,
2684 /* 50 -80 */ CWORD_CWORD_CWORD_CWORD,
2685 /* 51 -79 */ CWORD_CWORD_CWORD_CWORD,
2686 /* 52 -78 */ CWORD_CWORD_CWORD_CWORD,
2687 /* 53 -77 */ CWORD_CWORD_CWORD_CWORD,
2688 /* 54 -76 */ CWORD_CWORD_CWORD_CWORD,
2689 /* 55 -75 */ CWORD_CWORD_CWORD_CWORD,
2690 /* 56 -74 */ CWORD_CWORD_CWORD_CWORD,
2691 /* 57 -73 */ CWORD_CWORD_CWORD_CWORD,
2692 /* 58 -72 */ CWORD_CWORD_CWORD_CWORD,
2693 /* 59 -71 */ CWORD_CWORD_CWORD_CWORD,
2694 /* 60 -70 */ CWORD_CWORD_CWORD_CWORD,
2695 /* 61 -69 */ CWORD_CWORD_CWORD_CWORD,
2696 /* 62 -68 */ CWORD_CWORD_CWORD_CWORD,
2697 /* 63 -67 */ CWORD_CWORD_CWORD_CWORD,
2698 /* 64 -66 */ CWORD_CWORD_CWORD_CWORD,
2699 /* 65 -65 */ CWORD_CWORD_CWORD_CWORD,
2700 /* 66 -64 */ CWORD_CWORD_CWORD_CWORD,
2701 /* 67 -63 */ CWORD_CWORD_CWORD_CWORD,
2702 /* 68 -62 */ CWORD_CWORD_CWORD_CWORD,
2703 /* 69 -61 */ CWORD_CWORD_CWORD_CWORD,
2704 /* 70 -60 */ CWORD_CWORD_CWORD_CWORD,
2705 /* 71 -59 */ CWORD_CWORD_CWORD_CWORD,
2706 /* 72 -58 */ CWORD_CWORD_CWORD_CWORD,
2707 /* 73 -57 */ CWORD_CWORD_CWORD_CWORD,
2708 /* 74 -56 */ CWORD_CWORD_CWORD_CWORD,
2709 /* 75 -55 */ CWORD_CWORD_CWORD_CWORD,
2710 /* 76 -54 */ CWORD_CWORD_CWORD_CWORD,
2711 /* 77 -53 */ CWORD_CWORD_CWORD_CWORD,
2712 /* 78 -52 */ CWORD_CWORD_CWORD_CWORD,
2713 /* 79 -51 */ CWORD_CWORD_CWORD_CWORD,
2714 /* 80 -50 */ CWORD_CWORD_CWORD_CWORD,
2715 /* 81 -49 */ CWORD_CWORD_CWORD_CWORD,
2716 /* 82 -48 */ CWORD_CWORD_CWORD_CWORD,
2717 /* 83 -47 */ CWORD_CWORD_CWORD_CWORD,
2718 /* 84 -46 */ CWORD_CWORD_CWORD_CWORD,
2719 /* 85 -45 */ CWORD_CWORD_CWORD_CWORD,
2720 /* 86 -44 */ CWORD_CWORD_CWORD_CWORD,
2721 /* 87 -43 */ CWORD_CWORD_CWORD_CWORD,
2722 /* 88 -42 */ CWORD_CWORD_CWORD_CWORD,
2723 /* 89 -41 */ CWORD_CWORD_CWORD_CWORD,
2724 /* 90 -40 */ CWORD_CWORD_CWORD_CWORD,
2725 /* 91 -39 */ CWORD_CWORD_CWORD_CWORD,
2726 /* 92 -38 */ CWORD_CWORD_CWORD_CWORD,
2727 /* 93 -37 */ CWORD_CWORD_CWORD_CWORD,
2728 /* 94 -36 */ CWORD_CWORD_CWORD_CWORD,
2729 /* 95 -35 */ CWORD_CWORD_CWORD_CWORD,
2730 /* 96 -34 */ CWORD_CWORD_CWORD_CWORD,
2731 /* 97 -33 */ CWORD_CWORD_CWORD_CWORD,
2732 /* 98 -32 */ CWORD_CWORD_CWORD_CWORD,
2733 /* 99 -31 */ CWORD_CWORD_CWORD_CWORD,
2734 /* 100 -30 */ CWORD_CWORD_CWORD_CWORD,
2735 /* 101 -29 */ CWORD_CWORD_CWORD_CWORD,
2736 /* 102 -28 */ CWORD_CWORD_CWORD_CWORD,
2737 /* 103 -27 */ CWORD_CWORD_CWORD_CWORD,
2738 /* 104 -26 */ CWORD_CWORD_CWORD_CWORD,
2739 /* 105 -25 */ CWORD_CWORD_CWORD_CWORD,
2740 /* 106 -24 */ CWORD_CWORD_CWORD_CWORD,
2741 /* 107 -23 */ CWORD_CWORD_CWORD_CWORD,
2742 /* 108 -22 */ CWORD_CWORD_CWORD_CWORD,
2743 /* 109 -21 */ CWORD_CWORD_CWORD_CWORD,
2744 /* 110 -20 */ CWORD_CWORD_CWORD_CWORD,
2745 /* 111 -19 */ CWORD_CWORD_CWORD_CWORD,
2746 /* 112 -18 */ CWORD_CWORD_CWORD_CWORD,
2747 /* 113 -17 */ CWORD_CWORD_CWORD_CWORD,
2748 /* 114 -16 */ CWORD_CWORD_CWORD_CWORD,
2749 /* 115 -15 */ CWORD_CWORD_CWORD_CWORD,
2750 /* 116 -14 */ CWORD_CWORD_CWORD_CWORD,
2751 /* 117 -13 */ CWORD_CWORD_CWORD_CWORD,
2752 /* 118 -12 */ CWORD_CWORD_CWORD_CWORD,
2753 /* 119 -11 */ CWORD_CWORD_CWORD_CWORD,
2754 /* 120 -10 */ CWORD_CWORD_CWORD_CWORD,
2755 /* 121 -9 */ CWORD_CWORD_CWORD_CWORD,
2756 /* 122 -8 */ CWORD_CWORD_CWORD_CWORD,
2757 /* 123 -7 */ CWORD_CWORD_CWORD_CWORD,
2758 /* 124 -6 */ CWORD_CWORD_CWORD_CWORD,
2759 /* 125 -5 */ CWORD_CWORD_CWORD_CWORD,
2760 /* 126 -4 */ CWORD_CWORD_CWORD_CWORD,
2761 /* 127 -3 */ CWORD_CWORD_CWORD_CWORD,
2762 /* 128 -2 */ CWORD_CWORD_CWORD_CWORD,
2763 /* 129 -1 */ CWORD_CWORD_CWORD_CWORD,
2764 /* 130 0 */ CWORD_CWORD_CWORD_CWORD,
2765 /* 131 1 */ CWORD_CWORD_CWORD_CWORD,
2766 /* 132 2 */ CWORD_CWORD_CWORD_CWORD,
2767 /* 133 3 */ CWORD_CWORD_CWORD_CWORD,
2768 /* 134 4 */ CWORD_CWORD_CWORD_CWORD,
2769 /* 135 5 */ CWORD_CWORD_CWORD_CWORD,
2770 /* 136 6 */ CWORD_CWORD_CWORD_CWORD,
2771 /* 137 7 */ CWORD_CWORD_CWORD_CWORD,
2772 /* 138 8 */ CWORD_CWORD_CWORD_CWORD,
2773 /* 139 9 "\t" */ CSPCL_CWORD_CWORD_CWORD,
2774 /* 140 10 "\n" */ CNL_CNL_CNL_CNL,
2775 /* 141 11 */ CWORD_CWORD_CWORD_CWORD,
2776 /* 142 12 */ CWORD_CWORD_CWORD_CWORD,
2777 /* 143 13 */ CWORD_CWORD_CWORD_CWORD,
2778 /* 144 14 */ CWORD_CWORD_CWORD_CWORD,
2779 /* 145 15 */ CWORD_CWORD_CWORD_CWORD,
2780 /* 146 16 */ CWORD_CWORD_CWORD_CWORD,
2781 /* 147 17 */ CWORD_CWORD_CWORD_CWORD,
2782 /* 148 18 */ CWORD_CWORD_CWORD_CWORD,
2783 /* 149 19 */ CWORD_CWORD_CWORD_CWORD,
2784 /* 150 20 */ CWORD_CWORD_CWORD_CWORD,
2785 /* 151 21 */ CWORD_CWORD_CWORD_CWORD,
2786 /* 152 22 */ CWORD_CWORD_CWORD_CWORD,
2787 /* 153 23 */ CWORD_CWORD_CWORD_CWORD,
2788 /* 154 24 */ CWORD_CWORD_CWORD_CWORD,
2789 /* 155 25 */ CWORD_CWORD_CWORD_CWORD,
2790 /* 156 26 */ CWORD_CWORD_CWORD_CWORD,
2791 /* 157 27 */ CWORD_CWORD_CWORD_CWORD,
2792 /* 158 28 */ CWORD_CWORD_CWORD_CWORD,
2793 /* 159 29 */ CWORD_CWORD_CWORD_CWORD,
2794 /* 160 30 */ CWORD_CWORD_CWORD_CWORD,
2795 /* 161 31 */ CWORD_CWORD_CWORD_CWORD,
2796 /* 162 32 " " */ CSPCL_CWORD_CWORD_CWORD,
2797 /* 163 33 "!" */ CWORD_CCTL_CCTL_CWORD,
2798 /* 164 34 """ */ CDQUOTE_CENDQUOTE_CWORD_CWORD,
2799 /* 165 35 "#" */ CWORD_CWORD_CWORD_CWORD,
2800 /* 166 36 "$" */ CVAR_CVAR_CWORD_CVAR,
2801 /* 167 37 "%" */ CWORD_CWORD_CWORD_CWORD,
2802 /* 168 38 "&" */ CSPCL_CWORD_CWORD_CWORD,
2803 /* 169 39 "'" */ CSQUOTE_CWORD_CENDQUOTE_CWORD,
2804 /* 170 40 "(" */ CSPCL_CWORD_CWORD_CLP,
2805 /* 171 41 ")" */ CSPCL_CWORD_CWORD_CRP,
2806 /* 172 42 "*" */ CWORD_CCTL_CCTL_CWORD,
2807 /* 173 43 "+" */ CWORD_CWORD_CWORD_CWORD,
2808 /* 174 44 "," */ CWORD_CWORD_CWORD_CWORD,
2809 /* 175 45 "-" */ CWORD_CCTL_CCTL_CWORD,
2810 /* 176 46 "." */ CWORD_CWORD_CWORD_CWORD,
2811 /* 177 47 "/" */ CWORD_CCTL_CCTL_CWORD,
2812 /* 178 48 "0" */ CWORD_CWORD_CWORD_CWORD,
2813 /* 179 49 "1" */ CWORD_CWORD_CWORD_CWORD,
2814 /* 180 50 "2" */ CWORD_CWORD_CWORD_CWORD,
2815 /* 181 51 "3" */ CWORD_CWORD_CWORD_CWORD,
2816 /* 182 52 "4" */ CWORD_CWORD_CWORD_CWORD,
2817 /* 183 53 "5" */ CWORD_CWORD_CWORD_CWORD,
2818 /* 184 54 "6" */ CWORD_CWORD_CWORD_CWORD,
2819 /* 185 55 "7" */ CWORD_CWORD_CWORD_CWORD,
2820 /* 186 56 "8" */ CWORD_CWORD_CWORD_CWORD,
2821 /* 187 57 "9" */ CWORD_CWORD_CWORD_CWORD,
2822 /* 188 58 ":" */ CWORD_CCTL_CCTL_CWORD,
2823 /* 189 59 ";" */ CSPCL_CWORD_CWORD_CWORD,
2824 /* 190 60 "<" */ CSPCL_CWORD_CWORD_CWORD,
2825 /* 191 61 "=" */ CWORD_CCTL_CCTL_CWORD,
2826 /* 192 62 ">" */ CSPCL_CWORD_CWORD_CWORD,
2827 /* 193 63 "?" */ CWORD_CCTL_CCTL_CWORD,
2828 /* 194 64 "@" */ CWORD_CWORD_CWORD_CWORD,
2829 /* 195 65 "A" */ CWORD_CWORD_CWORD_CWORD,
2830 /* 196 66 "B" */ CWORD_CWORD_CWORD_CWORD,
2831 /* 197 67 "C" */ CWORD_CWORD_CWORD_CWORD,
2832 /* 198 68 "D" */ CWORD_CWORD_CWORD_CWORD,
2833 /* 199 69 "E" */ CWORD_CWORD_CWORD_CWORD,
2834 /* 200 70 "F" */ CWORD_CWORD_CWORD_CWORD,
2835 /* 201 71 "G" */ CWORD_CWORD_CWORD_CWORD,
2836 /* 202 72 "H" */ CWORD_CWORD_CWORD_CWORD,
2837 /* 203 73 "I" */ CWORD_CWORD_CWORD_CWORD,
2838 /* 204 74 "J" */ CWORD_CWORD_CWORD_CWORD,
2839 /* 205 75 "K" */ CWORD_CWORD_CWORD_CWORD,
2840 /* 206 76 "L" */ CWORD_CWORD_CWORD_CWORD,
2841 /* 207 77 "M" */ CWORD_CWORD_CWORD_CWORD,
2842 /* 208 78 "N" */ CWORD_CWORD_CWORD_CWORD,
2843 /* 209 79 "O" */ CWORD_CWORD_CWORD_CWORD,
2844 /* 210 80 "P" */ CWORD_CWORD_CWORD_CWORD,
2845 /* 211 81 "Q" */ CWORD_CWORD_CWORD_CWORD,
2846 /* 212 82 "R" */ CWORD_CWORD_CWORD_CWORD,
2847 /* 213 83 "S" */ CWORD_CWORD_CWORD_CWORD,
2848 /* 214 84 "T" */ CWORD_CWORD_CWORD_CWORD,
2849 /* 215 85 "U" */ CWORD_CWORD_CWORD_CWORD,
2850 /* 216 86 "V" */ CWORD_CWORD_CWORD_CWORD,
2851 /* 217 87 "W" */ CWORD_CWORD_CWORD_CWORD,
2852 /* 218 88 "X" */ CWORD_CWORD_CWORD_CWORD,
2853 /* 219 89 "Y" */ CWORD_CWORD_CWORD_CWORD,
2854 /* 220 90 "Z" */ CWORD_CWORD_CWORD_CWORD,
2855 /* 221 91 "[" */ CWORD_CCTL_CCTL_CWORD,
2856 /* 222 92 "\" */ CBACK_CBACK_CCTL_CBACK,
2857 /* 223 93 "]" */ CWORD_CCTL_CCTL_CWORD,
2858 /* 224 94 "^" */ CWORD_CWORD_CWORD_CWORD,
2859 /* 225 95 "_" */ CWORD_CWORD_CWORD_CWORD,
2860 /* 226 96 "`" */ CBQUOTE_CBQUOTE_CWORD_CBQUOTE,
2861 /* 227 97 "a" */ CWORD_CWORD_CWORD_CWORD,
2862 /* 228 98 "b" */ CWORD_CWORD_CWORD_CWORD,
2863 /* 229 99 "c" */ CWORD_CWORD_CWORD_CWORD,
2864 /* 230 100 "d" */ CWORD_CWORD_CWORD_CWORD,
2865 /* 231 101 "e" */ CWORD_CWORD_CWORD_CWORD,
2866 /* 232 102 "f" */ CWORD_CWORD_CWORD_CWORD,
2867 /* 233 103 "g" */ CWORD_CWORD_CWORD_CWORD,
2868 /* 234 104 "h" */ CWORD_CWORD_CWORD_CWORD,
2869 /* 235 105 "i" */ CWORD_CWORD_CWORD_CWORD,
2870 /* 236 106 "j" */ CWORD_CWORD_CWORD_CWORD,
2871 /* 237 107 "k" */ CWORD_CWORD_CWORD_CWORD,
2872 /* 238 108 "l" */ CWORD_CWORD_CWORD_CWORD,
2873 /* 239 109 "m" */ CWORD_CWORD_CWORD_CWORD,
2874 /* 240 110 "n" */ CWORD_CWORD_CWORD_CWORD,
2875 /* 241 111 "o" */ CWORD_CWORD_CWORD_CWORD,
2876 /* 242 112 "p" */ CWORD_CWORD_CWORD_CWORD,
2877 /* 243 113 "q" */ CWORD_CWORD_CWORD_CWORD,
2878 /* 244 114 "r" */ CWORD_CWORD_CWORD_CWORD,
2879 /* 245 115 "s" */ CWORD_CWORD_CWORD_CWORD,
2880 /* 246 116 "t" */ CWORD_CWORD_CWORD_CWORD,
2881 /* 247 117 "u" */ CWORD_CWORD_CWORD_CWORD,
2882 /* 248 118 "v" */ CWORD_CWORD_CWORD_CWORD,
2883 /* 249 119 "w" */ CWORD_CWORD_CWORD_CWORD,
2884 /* 250 120 "x" */ CWORD_CWORD_CWORD_CWORD,
2885 /* 251 121 "y" */ CWORD_CWORD_CWORD_CWORD,
2886 /* 252 122 "z" */ CWORD_CWORD_CWORD_CWORD,
2887 /* 253 123 "{" */ CWORD_CWORD_CWORD_CWORD,
2888 /* 254 124 "|" */ CSPCL_CWORD_CWORD_CWORD,
2889 /* 255 125 "}" */ CENDVAR_CENDVAR_CWORD_CENDVAR,
2890 /* 256 126 "~" */ CWORD_CCTL_CCTL_CWORD,
2891 /* 257 127 */ CWORD_CWORD_CWORD_CWORD,
2894 #define SIT(c, syntax) (S_I_T[(int)syntax_index_table[((int)c)+SYNBASE]][syntax])
2896 #endif /* USE_SIT_FUNCTION */
2899 /* ============ Alias handling */
2901 #if ENABLE_ASH_ALIAS
2903 #define ALIASINUSE 1
2915 static struct alias *atab[ATABSIZE];
2917 static struct alias **
2918 __lookupalias(const char *name) {
2919 unsigned int hashval;
2926 ch = (unsigned char)*p;
2930 ch = (unsigned char)*++p;
2932 app = &atab[hashval % ATABSIZE];
2934 for (; *app; app = &(*app)->next) {
2935 if (strcmp(name, (*app)->name) == 0) {
2943 static struct alias *
2944 lookupalias(const char *name, int check)
2946 struct alias *ap = *__lookupalias(name);
2948 if (check && ap && (ap->flag & ALIASINUSE))
2953 static struct alias *
2954 freealias(struct alias *ap)
2958 if (ap->flag & ALIASINUSE) {
2959 ap->flag |= ALIASDEAD;
2971 setalias(const char *name, const char *val)
2973 struct alias *ap, **app;
2975 app = __lookupalias(name);
2979 if (!(ap->flag & ALIASINUSE)) {
2982 ap->val = ckstrdup(val);
2983 ap->flag &= ~ALIASDEAD;
2986 ap = ckmalloc(sizeof(struct alias));
2987 ap->name = ckstrdup(name);
2988 ap->val = ckstrdup(val);
2997 unalias(const char *name)
3001 app = __lookupalias(name);
3005 *app = freealias(*app);
3016 struct alias *ap, **app;
3020 for (i = 0; i < ATABSIZE; i++) {
3022 for (ap = *app; ap; ap = *app) {
3023 *app = freealias(*app);
3033 printalias(const struct alias *ap)
3035 out1fmt("%s=%s\n", ap->name, single_quote(ap->val));
3039 * TODO - sort output
3042 aliascmd(int argc, char **argv)
3051 for (i = 0; i < ATABSIZE; i++)
3052 for (ap = atab[i]; ap; ap = ap->next) {
3057 while ((n = *++argv) != NULL) {
3058 v = strchr(n+1, '=');
3059 if (v == NULL) { /* n+1: funny ksh stuff */
3060 ap = *__lookupalias(n);
3062 fprintf(stderr, "%s: %s not found\n", "alias", n);
3076 unaliascmd(int argc, char **argv)
3080 while ((i = nextopt("a")) != '\0') {
3086 for (i = 0; *argptr; argptr++) {
3087 if (unalias(*argptr)) {
3088 fprintf(stderr, "%s: %s not found\n", "unalias", *argptr);
3096 #endif /* ASH_ALIAS */
3099 /* ============ jobs.c */
3101 /* Mode argument to forkshell. Don't change FORK_FG or FORK_BG. */
3104 #define FORK_NOJOB 2
3106 /* mode flags for showjob(s) */
3107 #define SHOW_PGID 0x01 /* only show pgid - for jobs -p */
3108 #define SHOW_PID 0x04 /* include process pid */
3109 #define SHOW_CHANGED 0x08 /* only jobs whose state has changed */
3112 * A job structure contains information about a job. A job is either a
3113 * single process or a set of processes contained in a pipeline. In the
3114 * latter case, pidlist will be non-NULL, and will point to a -1 terminated
3119 pid_t pid; /* process id */
3120 int status; /* last process status from wait() */
3121 char *cmd; /* text of command being run */
3125 struct procstat ps0; /* status of process */
3126 struct procstat *ps; /* status or processes when more than one */
3128 int stopstatus; /* status of a stopped job */
3131 nprocs: 16, /* number of processes */
3133 #define JOBRUNNING 0 /* at least one proc running */
3134 #define JOBSTOPPED 1 /* all procs are stopped */
3135 #define JOBDONE 2 /* all procs are completed */
3137 sigint: 1, /* job was killed by SIGINT */
3138 jobctl: 1, /* job running under job control */
3140 waited: 1, /* true if this entry has been waited for */
3141 used: 1, /* true if this entry is in used */
3142 changed: 1; /* true if status has changed */
3143 struct job *prev_job; /* previous job */
3146 static pid_t backgndpid; /* pid of last background process */
3147 static smallint job_warning; /* user was warned about stopped jobs (can be 2, 1 or 0). */
3149 static struct job *makejob(union node *, int);
3150 static int forkshell(struct job *, union node *, int);
3151 static int waitforjob(struct job *);
3154 enum { jobctl = 0 };
3155 #define setjobctl(on) do {} while (0)
3157 static smallint jobctl; /* true if doing job control */
3158 static void setjobctl(int);
3162 * Set the signal handler for the specified signal. The routine figures
3163 * out what it should be set to.
3166 setsignal(int signo)
3170 struct sigaction act;
3175 else if (*t != '\0')
3179 if (rootshell && action == S_DFL) {
3182 if (iflag || minusc || sflag == 0)
3205 t = &sigmode[signo - 1];
3209 * current setting unknown
3211 if (sigaction(signo, 0, &act) == -1) {
3213 * Pretend it worked; maybe we should give a warning
3214 * here, but other shells don't. We don't alter
3215 * sigmode, so that we retry every time.
3219 if (act.sa_handler == SIG_IGN) {
3221 && (signo == SIGTSTP || signo == SIGTTIN || signo == SIGTTOU)
3223 tsig = S_IGN; /* don't hard ignore these */
3227 tsig = S_RESET; /* force to be set */
3230 if (tsig == S_HARD_IGN || tsig == action)
3234 act.sa_handler = onsig;
3237 act.sa_handler = SIG_IGN;
3240 act.sa_handler = SIG_DFL;
3244 sigfillset(&act.sa_mask);
3245 sigaction(signo, &act, 0);
3248 /* mode flags for set_curjob */
3249 #define CUR_DELETE 2
3250 #define CUR_RUNNING 1
3251 #define CUR_STOPPED 0
3253 /* mode flags for dowait */
3254 #define DOWAIT_NORMAL 0
3255 #define DOWAIT_BLOCK 1
3258 /* pgrp of shell on invocation */
3259 static int initialpgrp;
3260 static int ttyfd = -1;
3263 static struct job *jobtab;
3265 static unsigned njobs;
3267 static struct job *curjob;
3268 /* number of presumed living untracked jobs */
3272 set_curjob(struct job *jp, unsigned mode)
3275 struct job **jpp, **curp;
3277 /* first remove from list */
3278 jpp = curp = &curjob;
3283 jpp = &jp1->prev_job;
3285 *jpp = jp1->prev_job;
3287 /* Then re-insert in correct position */
3295 /* job being deleted */
3298 /* newly created job or backgrounded job,
3299 put after all stopped jobs. */
3303 if (!jp1 || jp1->state != JOBSTOPPED)
3306 jpp = &jp1->prev_job;
3312 /* newly stopped job - becomes curjob */
3313 jp->prev_job = *jpp;
3321 jobno(const struct job *jp)
3323 return jp - jobtab + 1;
3328 * Convert a job name to a job structure.
3331 getjob(const char *name, int getctl)
3335 const char *err_msg = "No such job: %s";
3339 char *(*match)(const char *, const char *);
3354 if (c == '+' || c == '%') {
3356 err_msg = "No current job";
3362 err_msg = "No previous job";
3373 jp = jobtab + num - 1;
3390 if (match(jp->ps[0].cmd, p)) {
3394 err_msg = "%s: ambiguous";
3401 err_msg = "job %s not created under job control";
3402 if (getctl && jp->jobctl == 0)
3407 ash_msg_and_raise_error(err_msg, name);
3411 * Mark a job structure as unused.
3414 freejob(struct job *jp)
3416 struct procstat *ps;
3420 for (i = jp->nprocs, ps = jp->ps; --i >= 0; ps++) {
3421 if (ps->cmd != nullstr)
3424 if (jp->ps != &jp->ps0)
3427 set_curjob(jp, CUR_DELETE);
3433 xtcsetpgrp(int fd, pid_t pgrp)
3435 if (tcsetpgrp(fd, pgrp))
3436 ash_msg_and_raise_error("cannot set tty process group (%m)");
3440 * Turn job control on and off.
3442 * Note: This code assumes that the third arg to ioctl is a character
3443 * pointer, which is true on Berkeley systems but not System V. Since
3444 * System V doesn't have job control yet, this isn't a problem now.
3446 * Called with interrupts off.
3454 if (on == jobctl || rootshell == 0)
3458 ofd = fd = open(_PATH_TTY, O_RDWR);
3460 /* BTW, bash will try to open(ttyname(0)) if open("/dev/tty") fails.
3461 * That sometimes helps to acquire controlling tty.
3462 * Obviously, a workaround for bugs when someone
3463 * failed to provide a controlling tty to bash! :) */
3465 while (!isatty(fd) && --fd >= 0)
3468 fd = fcntl(fd, F_DUPFD, 10);
3472 close_on_exec_on(fd);
3473 do { /* while we are in the background */
3474 pgrp = tcgetpgrp(fd);
3477 ash_msg("can't access tty; job control turned off");
3481 if (pgrp == getpgrp())
3492 xtcsetpgrp(fd, pgrp);
3494 /* turning job control off */
3497 /* was xtcsetpgrp, but this can make exiting ash
3498 * with pty already deleted loop forever */
3499 tcsetpgrp(fd, pgrp);
3513 killcmd(int argc, char **argv)
3515 if (argv[1] && strcmp(argv[1], "-l") != 0) {
3518 if (argv[i][0] == '%') {
3519 struct job *jp = getjob(argv[i], 0);
3520 unsigned pid = jp->ps[0].pid;
3521 /* Enough space for ' -NNN<nul>' */
3522 argv[i] = alloca(sizeof(int)*3 + 3);
3523 /* kill_main has matching code to expect
3524 * leading space. Needed to not confuse
3525 * negative pids with "kill -SIGNAL_NO" syntax */
3526 sprintf(argv[i], " -%u", pid);
3528 } while (argv[++i]);
3530 return kill_main(argc, argv);
3534 showpipe(struct job *jp, FILE *out)
3536 struct procstat *sp;
3537 struct procstat *spend;
3539 spend = jp->ps + jp->nprocs;
3540 for (sp = jp->ps + 1; sp < spend; sp++)
3541 fprintf(out, " | %s", sp->cmd);
3542 outcslow('\n', out);
3543 flush_stdout_stderr();
3548 restartjob(struct job *jp, int mode)
3550 struct procstat *ps;
3556 if (jp->state == JOBDONE)
3558 jp->state = JOBRUNNING;
3560 if (mode == FORK_FG)
3561 xtcsetpgrp(ttyfd, pgid);
3562 killpg(pgid, SIGCONT);
3566 if (WIFSTOPPED(ps->status)) {
3572 status = (mode == FORK_FG) ? waitforjob(jp) : 0;
3578 fg_bgcmd(int argc, char **argv)
3585 mode = (**argv == 'f') ? FORK_FG : FORK_BG;
3590 jp = getjob(*argv, 1);
3591 if (mode == FORK_BG) {
3592 set_curjob(jp, CUR_RUNNING);
3593 fprintf(out, "[%d] ", jobno(jp));
3595 outstr(jp->ps->cmd, out);
3597 retval = restartjob(jp, mode);
3598 } while (*argv && *++argv);
3604 sprint_status(char *s, int status, int sigonly)
3610 if (!WIFEXITED(status)) {
3612 if (WIFSTOPPED(status))
3613 st = WSTOPSIG(status);
3616 st = WTERMSIG(status);
3618 if (st == SIGINT || st == SIGPIPE)
3621 if (WIFSTOPPED(status))
3626 col = fmtstr(s, 32, strsignal(st));
3627 if (WCOREDUMP(status)) {
3628 col += fmtstr(s + col, 16, " (core dumped)");
3630 } else if (!sigonly) {
3631 st = WEXITSTATUS(status);
3633 col = fmtstr(s, 16, "Done(%d)", st);
3635 col = fmtstr(s, 16, "Done");
3642 * Do a wait system call. If job control is compiled in, we accept
3643 * stopped processes. If block is zero, we return a value of zero
3644 * rather than blocking.
3646 * System V doesn't have a non-blocking wait system call. It does
3647 * have a SIGCLD signal that is sent to a process when one of it's
3648 * children dies. The obvious way to use SIGCLD would be to install
3649 * a handler for SIGCLD which simply bumped a counter when a SIGCLD
3650 * was received, and have waitproc bump another counter when it got
3651 * the status of a process. Waitproc would then know that a wait
3652 * system call would not block if the two counters were different.
3653 * This approach doesn't work because if a process has children that
3654 * have not been waited for, System V will send it a SIGCLD when it
3655 * installs a signal handler for SIGCLD. What this means is that when
3656 * a child exits, the shell will be sent SIGCLD signals continuously
3657 * until is runs out of stack space, unless it does a wait call before
3658 * restoring the signal handler. The code below takes advantage of
3659 * this (mis)feature by installing a signal handler for SIGCLD and
3660 * then checking to see whether it was called. If there are any
3661 * children to be waited for, it will be.
3663 * If neither SYSV nor BSD is defined, we don't implement nonblocking
3664 * waits at all. In this case, the user will not be informed when
3665 * a background process until the next time she runs a real program
3666 * (as opposed to running a builtin command or just typing return),
3667 * and the jobs command may give out of date information.
3670 waitproc(int block, int *status)
3680 return wait3(status, flags, (struct rusage *)NULL);
3684 * Wait for a process to terminate.
3687 dowait(int block, struct job *job)
3692 struct job *thisjob;
3695 TRACE(("dowait(%d) called\n", block));
3696 pid = waitproc(block, &status);
3697 TRACE(("wait returns pid %d, status=%d\n", pid, status));
3702 for (jp = curjob; jp; jp = jp->prev_job) {
3703 struct procstat *sp;
3704 struct procstat *spend;
3705 if (jp->state == JOBDONE)
3708 spend = jp->ps + jp->nprocs;
3711 if (sp->pid == pid) {
3712 TRACE(("Job %d: changing status of proc %d "
3713 "from 0x%x to 0x%x\n",
3714 jobno(jp), pid, sp->status, status));
3715 sp->status = status;
3718 if (sp->status == -1)
3721 if (state == JOBRUNNING)
3723 if (WIFSTOPPED(sp->status)) {
3724 jp->stopstatus = sp->status;
3728 } while (++sp < spend);
3733 if (!WIFSTOPPED(status))
3740 if (state != JOBRUNNING) {
3741 thisjob->changed = 1;
3743 if (thisjob->state != state) {
3744 TRACE(("Job %d: changing state from %d to %d\n",
3745 jobno(thisjob), thisjob->state, state));
3746 thisjob->state = state;
3748 if (state == JOBSTOPPED) {
3749 set_curjob(thisjob, CUR_STOPPED);
3758 if (thisjob && thisjob == job) {
3762 len = sprint_status(s, status, 1);
3774 showjob(FILE *out, struct job *jp, int mode)
3776 struct procstat *ps;
3777 struct procstat *psend;
3784 if (mode & SHOW_PGID) {
3785 /* just output process (group) id of pipeline */
3786 fprintf(out, "%d\n", ps->pid);
3790 col = fmtstr(s, 16, "[%d] ", jobno(jp));
3795 else if (curjob && jp == curjob->prev_job)
3798 if (mode & SHOW_PID)
3799 col += fmtstr(s + col, 16, "%d ", ps->pid);
3801 psend = ps + jp->nprocs;
3803 if (jp->state == JOBRUNNING) {
3804 strcpy(s + col, "Running");
3805 col += sizeof("Running") - 1;
3807 int status = psend[-1].status;
3808 if (jp->state == JOBSTOPPED)
3809 status = jp->stopstatus;
3810 col += sprint_status(s + col, status, 0);
3816 /* for each process */
3817 col = fmtstr(s, 48, " |\n%*c%d ", indent_col, ' ', ps->pid) - 3;
3819 fprintf(out, "%s%*c%s",
3820 s, 33 - col >= 0 ? 33 - col : 0, ' ', ps->cmd
3822 if (!(mode & SHOW_PID)) {
3826 if (++ps == psend) {
3827 outcslow('\n', out);
3834 if (jp->state == JOBDONE) {
3835 TRACE(("showjob: freeing job %d\n", jobno(jp)));
3841 * Print a list of jobs. If "change" is nonzero, only print jobs whose
3842 * statuses have changed since the last call to showjobs.
3845 showjobs(FILE *out, int mode)
3849 TRACE(("showjobs(%x) called\n", mode));
3851 /* If not even one one job changed, there is nothing to do */
3852 while (dowait(DOWAIT_NORMAL, NULL) > 0)
3855 for (jp = curjob; jp; jp = jp->prev_job) {
3856 if (!(mode & SHOW_CHANGED) || jp->changed) {
3857 showjob(out, jp, mode);
3863 jobscmd(int argc, char **argv)
3868 while ((m = nextopt("lp"))) {
3878 showjob(stdout, getjob(*argv,0), mode);
3881 showjobs(stdout, mode);
3888 getstatus(struct job *job)
3893 status = job->ps[job->nprocs - 1].status;
3894 retval = WEXITSTATUS(status);
3895 if (!WIFEXITED(status)) {
3897 retval = WSTOPSIG(status);
3898 if (!WIFSTOPPED(status))
3901 /* XXX: limits number of signals */
3902 retval = WTERMSIG(status);
3904 if (retval == SIGINT)
3910 TRACE(("getstatus: job %d, nproc %d, status %x, retval %x\n",
3911 jobno(job), job->nprocs, status, retval));
3916 waitcmd(int argc, char **argv)
3929 /* wait for all jobs */
3934 /* no running procs */
3937 if (jp->state == JOBRUNNING)
3942 dowait(DOWAIT_BLOCK, 0);
3948 if (**argv != '%') {
3949 pid_t pid = number(*argv);
3953 if (job->ps[job->nprocs - 1].pid == pid)
3955 job = job->prev_job;
3961 job = getjob(*argv, 0);
3962 /* loop until process terminated or stopped */
3963 while (job->state == JOBRUNNING)
3964 dowait(DOWAIT_BLOCK, 0);
3966 retval = getstatus(job);
3980 struct job *jp, *jq;
3982 len = njobs * sizeof(*jp);
3984 jp = ckrealloc(jq, len + 4 * sizeof(*jp));
3986 offset = (char *)jp - (char *)jq;
3988 /* Relocate pointers */
3991 jq = (struct job *)((char *)jq + l);
3995 #define joff(p) ((struct job *)((char *)(p) + l))
3996 #define jmove(p) (p) = (void *)((char *)(p) + offset)
3997 if (joff(jp)->ps == &jq->ps0)
3998 jmove(joff(jp)->ps);
3999 if (joff(jp)->prev_job)
4000 jmove(joff(jp)->prev_job);
4010 jp = (struct job *)((char *)jp + len);
4014 } while (--jq >= jp);
4019 * Return a new job structure.
4020 * Called with interrupts off.
4023 makejob(union node *node, int nprocs)
4028 for (i = njobs, jp = jobtab; ; jp++) {
4035 if (jp->state != JOBDONE || !jp->waited)
4044 memset(jp, 0, sizeof(*jp));
4046 /* jp->jobctl is a bitfield.
4047 * "jp->jobctl |= jobctl" likely to give awful code */
4051 jp->prev_job = curjob;
4056 jp->ps = ckmalloc(nprocs * sizeof(struct procstat));
4058 TRACE(("makejob(0x%lx, %d) returns %%%d\n", (long)node, nprocs,
4065 * Return a string identifying a command (to be printed by the
4068 static char *cmdnextc;
4071 cmdputs(const char *s)
4073 const char *p, *str;
4074 char c, cc[2] = " ";
4078 static const char vstype[VSTYPE + 1][4] = {
4079 "", "}", "-", "+", "?", "=",
4080 "%", "%%", "#", "##"
4083 nextc = makestrspace((strlen(s) + 1) * 8, cmdnextc);
4085 while ((c = *p++) != 0) {
4093 if ((subtype & VSTYPE) == VSLENGTH)
4097 if (!(subtype & VSQUOTE) == !(quoted & 1))
4103 str = "\"}" + !(quoted & 1);
4110 case CTLBACKQ+CTLQUOTE:
4113 #if ENABLE_ASH_MATH_SUPPORT
4128 if ((subtype & VSTYPE) != VSNORMAL)
4130 str = vstype[subtype & VSTYPE];
4131 if (subtype & VSNUL)
4140 /* These can only happen inside quotes */
4153 while ((c = *str++)) {
4158 USTPUTC('"', nextc);
4164 /* cmdtxt() and cmdlist() call each other */
4165 static void cmdtxt(union node *n);
4168 cmdlist(union node *np, int sep)
4170 for (; np; np = np->narg.next) {
4174 if (sep && np->narg.next)
4180 cmdtxt(union node *n)
4183 struct nodelist *lp;
4195 lp = n->npipe.cmdlist;
4213 cmdtxt(n->nbinary.ch1);
4229 cmdtxt(n->nif.test);
4232 if (n->nif.elsepart) {
4235 n = n->nif.elsepart;
4251 cmdtxt(n->nbinary.ch1);
4261 cmdputs(n->nfor.var);
4263 cmdlist(n->nfor.args, 1);
4268 cmdputs(n->narg.text);
4272 cmdlist(n->ncmd.args, 1);
4273 cmdlist(n->ncmd.redirect, 0);
4286 cmdputs(n->ncase.expr->narg.text);
4288 for (np = n->ncase.cases; np; np = np->nclist.next) {
4289 cmdtxt(np->nclist.pattern);
4291 cmdtxt(np->nclist.body);
4317 s[0] = n->nfile.fd + '0';
4321 if (n->type == NTOFD || n->type == NFROMFD) {
4322 s[0] = n->ndup.dupfd + '0';
4332 commandtext(union node *n)
4336 STARTSTACKSTR(cmdnextc);
4338 name = stackblock();
4339 TRACE(("commandtext: name %p, end %p\n\t\"%s\"\n",
4340 name, cmdnextc, cmdnextc));
4341 return ckstrdup(name);
4346 * Fork off a subshell. If we are doing job control, give the subshell its
4347 * own process group. Jp is a job structure that the job is to be added to.
4348 * N is the command that will be evaluated by the child. Both jp and n may
4349 * be NULL. The mode parameter can be one of the following:
4350 * FORK_FG - Fork off a foreground process.
4351 * FORK_BG - Fork off a background process.
4352 * FORK_NOJOB - Like FORK_FG, but don't give the process its own
4353 * process group even if job control is on.
4355 * When job control is turned off, background processes have their standard
4356 * input redirected to /dev/null (except for the second and later processes
4359 * Called with interrupts off.
4362 * Clear traps on a fork.
4369 for (tp = trap; tp < &trap[NSIG]; tp++) {
4370 if (*tp && **tp) { /* trap not NULL or SIG_IGN */
4375 setsignal(tp - trap);
4381 /* Lives far away from here, needed for forkchild */
4382 static void closescript(void);
4384 /* Called after fork(), in child */
4386 forkchild(struct job *jp, union node *n, int mode)
4390 TRACE(("Child shell %d\n", getpid()));
4397 /* do job control only in root shell */
4399 if (mode != FORK_NOJOB && jp->jobctl && !oldlvl) {
4402 if (jp->nprocs == 0)
4405 pgrp = jp->ps[0].pid;
4406 /* This can fail because we are doing it in the parent also */
4407 (void)setpgid(0, pgrp);
4408 if (mode == FORK_FG)
4409 xtcsetpgrp(ttyfd, pgrp);
4414 if (mode == FORK_BG) {
4417 if (jp->nprocs == 0) {
4419 if (open(bb_dev_null, O_RDONLY) != 0)
4420 ash_msg_and_raise_error("can't open %s", bb_dev_null);
4423 if (!oldlvl && iflag) {
4428 for (jp = curjob; jp; jp = jp->prev_job)
4433 /* Called after fork(), in parent */
4435 forkparent(struct job *jp, union node *n, int mode, pid_t pid)
4437 TRACE(("In parent shell: child = %d\n", pid));
4439 while (jobless && dowait(DOWAIT_NORMAL, 0) > 0);
4444 if (mode != FORK_NOJOB && jp->jobctl) {
4447 if (jp->nprocs == 0)
4450 pgrp = jp->ps[0].pid;
4451 /* This can fail because we are doing it in the child also */
4455 if (mode == FORK_BG) {
4456 backgndpid = pid; /* set $! */
4457 set_curjob(jp, CUR_RUNNING);
4460 struct procstat *ps = &jp->ps[jp->nprocs++];
4466 ps->cmd = commandtext(n);
4472 forkshell(struct job *jp, union node *n, int mode)
4476 TRACE(("forkshell(%%%d, %p, %d) called\n", jobno(jp), n, mode));
4479 TRACE(("Fork failed, errno=%d", errno));
4482 ash_msg_and_raise_error("cannot fork");
4485 forkchild(jp, n, mode);
4487 forkparent(jp, n, mode, pid);
4492 * Wait for job to finish.
4494 * Under job control we have the problem that while a child process is
4495 * running interrupts generated by the user are sent to the child but not
4496 * to the shell. This means that an infinite loop started by an inter-
4497 * active user may be hard to kill. With job control turned off, an
4498 * interactive user may place an interactive program inside a loop. If
4499 * the interactive program catches interrupts, the user doesn't want
4500 * these interrupts to also abort the loop. The approach we take here
4501 * is to have the shell ignore interrupt signals while waiting for a
4502 * foreground process to terminate, and then send itself an interrupt
4503 * signal if the child process was terminated by an interrupt signal.
4504 * Unfortunately, some programs want to do a bit of cleanup and then
4505 * exit on interrupt; unless these processes terminate themselves by
4506 * sending a signal to themselves (instead of calling exit) they will
4507 * confuse this approach.
4509 * Called with interrupts off.
4512 waitforjob(struct job *jp)
4516 TRACE(("waitforjob(%%%d) called\n", jobno(jp)));
4517 while (jp->state == JOBRUNNING) {
4518 dowait(DOWAIT_BLOCK, jp);
4523 xtcsetpgrp(ttyfd, rootpid);
4525 * This is truly gross.
4526 * If we're doing job control, then we did a TIOCSPGRP which
4527 * caused us (the shell) to no longer be in the controlling
4528 * session -- so we wouldn't have seen any ^C/SIGINT. So, we
4529 * intuit from the subprocess exit status whether a SIGINT
4530 * occurred, and if so interrupt ourselves. Yuck. - mycroft
4535 if (jp->state == JOBDONE)
4542 * return 1 if there are stopped jobs, otherwise 0
4554 if (jp && jp->state == JOBSTOPPED) {
4555 out2str("You have stopped jobs.\n");
4564 /* ============ redir.c
4566 * Code for dealing with input/output redirection.
4569 #define EMPTY -2 /* marks an unused slot in redirtab */
4570 #define CLOSED -3 /* marks a slot of previously-closed fd */
4572 # define PIPESIZE 4096 /* amount of buffering in a pipe */
4574 # define PIPESIZE PIPE_BUF
4578 * Open a file in noclobber mode.
4579 * The code was copied from bash.
4582 noclobberopen(const char *fname)
4585 struct stat finfo, finfo2;
4588 * If the file exists and is a regular file, return an error
4591 r = stat(fname, &finfo);
4592 if (r == 0 && S_ISREG(finfo.st_mode)) {
4598 * If the file was not present (r != 0), make sure we open it
4599 * exclusively so that if it is created before we open it, our open
4600 * will fail. Make sure that we do not truncate an existing file.
4601 * Note that we don't turn on O_EXCL unless the stat failed -- if the
4602 * file was not a regular file, we leave O_EXCL off.
4605 return open(fname, O_WRONLY|O_CREAT|O_EXCL, 0666);
4606 fd = open(fname, O_WRONLY|O_CREAT, 0666);
4608 /* If the open failed, return the file descriptor right away. */
4613 * OK, the open succeeded, but the file may have been changed from a
4614 * non-regular file to a regular file between the stat and the open.
4615 * We are assuming that the O_EXCL open handles the case where FILENAME
4616 * did not exist and is symlinked to an existing file between the stat
4621 * If we can open it and fstat the file descriptor, and neither check
4622 * revealed that it was a regular file, and the file has not been
4623 * replaced, return the file descriptor.
4625 if (fstat(fd, &finfo2) == 0 && !S_ISREG(finfo2.st_mode)
4626 && finfo.st_dev == finfo2.st_dev && finfo.st_ino == finfo2.st_ino)
4629 /* The file has been replaced. badness. */
4636 * Handle here documents. Normally we fork off a process to write the
4637 * data to a pipe. If the document is short, we can stuff the data in
4638 * the pipe without forking.
4640 /* openhere needs this forward reference */
4641 static void expandhere(union node *arg, int fd);
4643 openhere(union node *redir)
4649 ash_msg_and_raise_error("pipe call failed");
4650 if (redir->type == NHERE) {
4651 len = strlen(redir->nhere.doc->narg.text);
4652 if (len <= PIPESIZE) {
4653 full_write(pip[1], redir->nhere.doc->narg.text, len);
4657 if (forkshell((struct job *)NULL, (union node *)NULL, FORK_NOJOB) == 0) {
4659 signal(SIGINT, SIG_IGN);
4660 signal(SIGQUIT, SIG_IGN);
4661 signal(SIGHUP, SIG_IGN);
4663 signal(SIGTSTP, SIG_IGN);
4665 signal(SIGPIPE, SIG_DFL);
4666 if (redir->type == NHERE)
4667 full_write(pip[1], redir->nhere.doc->narg.text, len);
4669 expandhere(redir->nhere.doc, pip[1]);
4678 openredirect(union node *redir)
4683 switch (redir->nfile.type) {
4685 fname = redir->nfile.expfname;
4686 f = open(fname, O_RDONLY);
4691 fname = redir->nfile.expfname;
4692 f = open(fname, O_RDWR|O_CREAT|O_TRUNC, 0666);
4697 /* Take care of noclobber mode. */
4699 fname = redir->nfile.expfname;
4700 f = noclobberopen(fname);
4707 fname = redir->nfile.expfname;
4708 f = open(fname, O_WRONLY|O_CREAT|O_TRUNC, 0666);
4713 fname = redir->nfile.expfname;
4714 f = open(fname, O_WRONLY|O_CREAT|O_APPEND, 0666);
4722 /* Fall through to eliminate warning. */
4729 f = openhere(redir);
4735 ash_msg_and_raise_error("cannot create %s: %s", fname, errmsg(errno, "nonexistent directory"));
4737 ash_msg_and_raise_error("cannot open %s: %s", fname, errmsg(errno, "no such file"));
4741 * Copy a file descriptor to be >= to. Returns -1
4742 * if the source file descriptor is closed, EMPTY if there are no unused
4743 * file descriptors left.
4746 copyfd(int from, int to)
4750 newfd = fcntl(from, F_DUPFD, to);
4752 if (errno == EMFILE)
4754 ash_msg_and_raise_error("%d: %m", from);
4760 dupredirect(union node *redir, int f)
4762 int fd = redir->nfile.fd;
4764 if (redir->nfile.type == NTOFD || redir->nfile.type == NFROMFD) {
4765 if (redir->ndup.dupfd >= 0) { /* if not ">&-" */
4766 copyfd(redir->ndup.dupfd, fd);
4778 * Process a list of redirection commands. If the REDIR_PUSH flag is set,
4779 * old file descriptors are stashed away so that the redirection can be
4780 * undone by calling popredir. If the REDIR_BACKQ flag is set, then the
4781 * standard output, and the standard error if it becomes a duplicate of
4782 * stdout, is saved in memory.
4784 /* flags passed to redirect */
4785 #define REDIR_PUSH 01 /* save previous values of file descriptors */
4786 #define REDIR_SAVEFD2 03 /* set preverrout */
4788 redirect(union node *redir, int flags)
4791 struct redirtab *sv;
4802 if (flags & REDIR_PUSH) {
4803 sv = ckmalloc(sizeof(*sv));
4804 sv->next = redirlist;
4806 sv->nullredirs = nullredirs - 1;
4807 for (i = 0; i < 10; i++)
4808 sv->renamed[i] = EMPTY;
4814 if ((n->nfile.type == NTOFD || n->nfile.type == NFROMFD)
4815 && n->ndup.dupfd == fd)
4816 continue; /* redirect from/to same file descriptor */
4818 newfd = openredirect(n);
4820 /* Descriptor wasn't open before redirect.
4821 * Mark it for close in the future */
4822 if (sv && sv->renamed[fd] == EMPTY)
4823 sv->renamed[fd] = CLOSED;
4826 if (sv && sv->renamed[fd] == EMPTY) {
4827 i = fcntl(fd, F_DUPFD, 10);
4834 ash_msg_and_raise_error("%d: %m", fd);
4838 sv->renamed[fd] = i;
4844 dupredirect(n, newfd);
4845 } while ((n = n->nfile.next));
4847 if ((flags & REDIR_SAVEFD2) && sv && sv->renamed[2] >= 0)
4848 preverrout_fd = sv->renamed[2];
4852 * Undo the effects of the last redirection.
4857 struct redirtab *rp;
4860 if (--nullredirs >= 0)
4864 for (i = 0; i < 10; i++) {
4865 if (rp->renamed[i] == CLOSED) {
4870 if (rp->renamed[i] != EMPTY) {
4873 copyfd(rp->renamed[i], i);
4875 close(rp->renamed[i]);
4878 redirlist = rp->next;
4879 nullredirs = rp->nullredirs;
4885 * Undo all redirections. Called on error or interrupt.
4889 * Discard all saved file descriptors.
4892 clearredir(int drop)
4903 redirectsafe(union node *redir, int flags)
4906 volatile int saveint;
4907 struct jmploc *volatile savehandler = exception_handler;
4908 struct jmploc jmploc;
4911 err = setjmp(jmploc.loc) * 2;
4913 exception_handler = &jmploc;
4914 redirect(redir, flags);
4916 exception_handler = savehandler;
4917 if (err && exception != EXERROR)
4918 longjmp(exception_handler->loc, 1);
4919 RESTORE_INT(saveint);
4924 /* ============ Routines to expand arguments to commands
4926 * We have to deal with backquotes, shell variables, and file metacharacters.
4932 #define EXP_FULL 0x1 /* perform word splitting & file globbing */
4933 #define EXP_TILDE 0x2 /* do normal tilde expansion */
4934 #define EXP_VARTILDE 0x4 /* expand tildes in an assignment */
4935 #define EXP_REDIR 0x8 /* file glob for a redirection (1 match only) */
4936 #define EXP_CASE 0x10 /* keeps quotes around for CASE pattern */
4937 #define EXP_RECORD 0x20 /* need to record arguments for ifs breakup */
4938 #define EXP_VARTILDE2 0x40 /* expand tildes after colons only */
4939 #define EXP_WORD 0x80 /* expand word in parameter expansion */
4940 #define EXP_QWORD 0x100 /* expand word in quoted parameter expansion */
4944 #define RMESCAPE_ALLOC 0x1 /* Allocate a new string */
4945 #define RMESCAPE_GLOB 0x2 /* Add backslashes for glob */
4946 #define RMESCAPE_QUOTED 0x4 /* Remove CTLESC unless in quotes */
4947 #define RMESCAPE_GROW 0x8 /* Grow strings instead of stalloc */
4948 #define RMESCAPE_HEAP 0x10 /* Malloc strings instead of stalloc */
4951 * Structure specifying which parts of the string should be searched
4952 * for IFS characters.
4955 struct ifsregion *next; /* next region in list */
4956 int begoff; /* offset of start of region */
4957 int endoff; /* offset of end of region */
4958 int nulonly; /* search for nul bytes only */
4962 struct strlist *list;
4963 struct strlist **lastp;
4966 /* output of current string */
4967 static char *expdest;
4968 /* list of back quote expressions */
4969 static struct nodelist *argbackq;
4970 /* first struct in list of ifs regions */
4971 static struct ifsregion ifsfirst;
4972 /* last struct in list */
4973 static struct ifsregion *ifslastp;
4974 /* holds expanded arg list */
4975 static struct arglist exparg;
4985 expdest = makestrspace(32, expdest);
4986 #if ENABLE_ASH_MATH_SUPPORT_64
4987 len = fmtstr(expdest, 32, "%lld", (long long) num);
4989 len = fmtstr(expdest, 32, "%ld", num);
4991 STADJUST(len, expdest);
4996 esclen(const char *start, const char *p)
5000 while (p > start && *--p == CTLESC) {
5007 * Remove any CTLESC characters from a string.
5010 _rmescapes(char *str, int flag)
5012 static const char qchars[] ALIGN1 = { CTLESC, CTLQUOTEMARK, '\0' };
5019 p = strpbrk(str, qchars);
5025 if (flag & RMESCAPE_ALLOC) {
5026 size_t len = p - str;
5027 size_t fulllen = len + strlen(p) + 1;
5029 if (flag & RMESCAPE_GROW) {
5030 r = makestrspace(fulllen, expdest);
5031 } else if (flag & RMESCAPE_HEAP) {
5032 r = ckmalloc(fulllen);
5034 r = stalloc(fulllen);
5038 q = memcpy(q, str, len) + len;
5041 inquotes = (flag & RMESCAPE_QUOTED) ^ RMESCAPE_QUOTED;
5042 globbing = flag & RMESCAPE_GLOB;
5043 notescaped = globbing;
5045 if (*p == CTLQUOTEMARK) {
5046 inquotes = ~inquotes;
5048 notescaped = globbing;
5052 /* naked back slash */
5058 if (notescaped && inquotes && *p != '/') {
5062 notescaped = globbing;
5067 if (flag & RMESCAPE_GROW) {
5069 STADJUST(q - r + 1, expdest);
5073 #define rmescapes(p) _rmescapes((p), 0)
5075 #define pmatch(a, b) !fnmatch((a), (b), 0)
5078 * Prepare a pattern for a expmeta (internal glob(3)) call.
5080 * Returns an stalloced string.
5083 preglob(const char *pattern, int quoted, int flag)
5085 flag |= RMESCAPE_GLOB;
5087 flag |= RMESCAPE_QUOTED;
5089 return _rmescapes((char *)pattern, flag);
5093 * Put a string on the stack.
5096 memtodest(const char *p, size_t len, int syntax, int quotes)
5100 q = makestrspace(len * 2, q);
5103 int c = signed_char2int(*p++);
5106 if (quotes && (SIT(c, syntax) == CCTL || SIT(c, syntax) == CBACK))
5115 strtodest(const char *p, int syntax, int quotes)
5117 memtodest(p, strlen(p), syntax, quotes);
5121 * Record the fact that we have to scan this region of the
5122 * string for IFS characters.
5125 recordregion(int start, int end, int nulonly)
5127 struct ifsregion *ifsp;
5129 if (ifslastp == NULL) {
5133 ifsp = ckmalloc(sizeof(*ifsp));
5135 ifslastp->next = ifsp;
5139 ifslastp->begoff = start;
5140 ifslastp->endoff = end;
5141 ifslastp->nulonly = nulonly;
5145 removerecordregions(int endoff)
5147 if (ifslastp == NULL)
5150 if (ifsfirst.endoff > endoff) {
5151 while (ifsfirst.next != NULL) {
5152 struct ifsregion *ifsp;
5154 ifsp = ifsfirst.next->next;
5155 free(ifsfirst.next);
5156 ifsfirst.next = ifsp;
5159 if (ifsfirst.begoff > endoff)
5162 ifslastp = &ifsfirst;
5163 ifsfirst.endoff = endoff;
5168 ifslastp = &ifsfirst;
5169 while (ifslastp->next && ifslastp->next->begoff < endoff)
5170 ifslastp=ifslastp->next;
5171 while (ifslastp->next != NULL) {
5172 struct ifsregion *ifsp;
5174 ifsp = ifslastp->next->next;
5175 free(ifslastp->next);
5176 ifslastp->next = ifsp;
5179 if (ifslastp->endoff > endoff)
5180 ifslastp->endoff = endoff;
5184 exptilde(char *startp, char *p, int flag)
5190 int quotes = flag & (EXP_FULL | EXP_CASE);
5195 while ((c = *++p) != '\0') {
5202 if (flag & EXP_VARTILDE)
5212 if (*name == '\0') {
5213 home = lookupvar(homestr);
5215 pw = getpwnam(name);
5220 if (!home || !*home)
5223 startloc = expdest - (char *)stackblock();
5224 strtodest(home, SQSYNTAX, quotes);
5225 recordregion(startloc, expdest - (char *)stackblock(), 0);
5233 * Execute a command inside back quotes. If it's a builtin command, we
5234 * want to save its output in a block obtained from malloc. Otherwise
5235 * we fork off a subprocess and get the output of the command via a pipe.
5236 * Should be called with interrupts off.
5238 struct backcmd { /* result of evalbackcmd */
5239 int fd; /* file descriptor to read from */
5240 char *buf; /* buffer */
5241 int nleft; /* number of chars in buffer */
5242 struct job *jp; /* job structure for command */
5245 /* These forward decls are needed to use "eval" code for backticks handling: */
5246 static int back_exitstatus; /* exit status of backquoted command */
5247 #define EV_EXIT 01 /* exit after evaluating tree */
5248 static void evaltree(union node *, int);
5251 evalbackcmd(union node *n, struct backcmd *result)
5263 saveherefd = herefd;
5271 ash_msg_and_raise_error("pipe call failed");
5273 if (forkshell(jp, n, FORK_NOJOB) == 0) {
5282 evaltree(n, EV_EXIT); /* actually evaltreenr... */
5286 result->fd = pip[0];
5289 herefd = saveherefd;
5291 TRACE(("evalbackcmd done: fd=%d buf=0x%x nleft=%d jp=0x%x\n",
5292 result->fd, result->buf, result->nleft, result->jp));
5296 * Expand stuff in backwards quotes.
5299 expbackq(union node *cmd, int quoted, int quotes)
5307 int syntax = quoted? DQSYNTAX : BASESYNTAX;
5308 struct stackmark smark;
5311 setstackmark(&smark);
5313 startloc = dest - (char *)stackblock();
5315 evalbackcmd(cmd, &in);
5316 popstackmark(&smark);
5323 memtodest(p, i, syntax, quotes);
5327 i = safe_read(in.fd, buf, sizeof(buf));
5328 TRACE(("expbackq: read returns %d\n", i));
5337 back_exitstatus = waitforjob(in.jp);
5341 /* Eat all trailing newlines */
5343 for (; dest > (char *)stackblock() && dest[-1] == '\n';)
5348 recordregion(startloc, dest - (char *)stackblock(), 0);
5349 TRACE(("evalbackq: size=%d: \"%.*s\"\n",
5350 (dest - (char *)stackblock()) - startloc,
5351 (dest - (char *)stackblock()) - startloc,
5352 stackblock() + startloc));
5355 #if ENABLE_ASH_MATH_SUPPORT
5357 * Expand arithmetic expression. Backup to start of expression,
5358 * evaluate, place result in (backed up) result, adjust string position.
5371 * This routine is slightly over-complicated for
5372 * efficiency. Next we scan backwards looking for the
5373 * start of arithmetic.
5375 start = stackblock();
5382 while (*p != CTLARI) {
5386 ash_msg_and_raise_error("missing CTLARI (shouldn't happen)");
5391 esc = esclen(start, p);
5401 removerecordregions(begoff);
5410 len = cvtnum(dash_arith(p + 2));
5413 recordregion(begoff, begoff + len, 0);
5417 /* argstr needs it */
5418 static char *evalvar(char *p, int flag);
5421 * Perform variable and command substitution. If EXP_FULL is set, output CTLESC
5422 * characters to allow for further processing. Otherwise treat
5423 * $@ like $* since no splitting will be performed.
5426 argstr(char *p, int flag)
5428 static const char spclchars[] ALIGN1 = {
5436 CTLBACKQ | CTLQUOTE,
5437 #if ENABLE_ASH_MATH_SUPPORT
5442 const char *reject = spclchars;
5444 int quotes = flag & (EXP_FULL | EXP_CASE); /* do CTLESC */
5445 int breakall = flag & EXP_WORD;
5450 if (!(flag & EXP_VARTILDE)) {
5452 } else if (flag & EXP_VARTILDE2) {
5457 if (flag & EXP_TILDE) {
5463 if (*q == CTLESC && (flag & EXP_QWORD))
5466 p = exptilde(p, q, flag);
5469 startloc = expdest - (char *)stackblock();
5471 length += strcspn(p + length, reject);
5473 if (c && (!(c & 0x80)
5474 #if ENABLE_ASH_MATH_SUPPORT
5478 /* c == '=' || c == ':' || c == CTLENDARI */
5483 expdest = stack_nputstr(p, length, expdest);
5484 newloc = expdest - (char *)stackblock();
5485 if (breakall && !inquotes && newloc > startloc) {
5486 recordregion(startloc, newloc, 0);
5497 if (flag & EXP_VARTILDE2) {
5501 flag |= EXP_VARTILDE2;
5506 * sort of a hack - expand tildes in variable
5507 * assignments (after the first '=' and after ':'s).
5516 case CTLENDVAR: /* ??? */
5519 /* "$@" syntax adherence hack */
5522 !memcmp(p, dolatstr, 4) &&
5523 (p[4] == CTLQUOTEMARK || (
5524 p[4] == CTLENDVAR &&
5525 p[5] == CTLQUOTEMARK
5528 p = evalvar(p + 1, flag) + 1;
5531 inquotes = !inquotes;
5544 p = evalvar(p, flag);
5548 case CTLBACKQ|CTLQUOTE:
5549 expbackq(argbackq->n, c, quotes);
5550 argbackq = argbackq->next;
5552 #if ENABLE_ASH_MATH_SUPPORT
5565 scanleft(char *startp, char *rmesc, char *rmescend, char *str, int quotes,
5576 const char *s = loc2;
5582 match = pmatch(str, s);
5586 if (quotes && *loc == CTLESC)
5595 scanright(char *startp, char *rmesc, char *rmescend, char *str, int quotes,
5602 for (loc = str - 1, loc2 = rmescend; loc >= startp; loc2--) {
5605 const char *s = loc2;
5610 match = pmatch(str, s);
5617 esc = esclen(startp, loc);
5628 static void varunset(const char *, const char *, const char *, int) ATTRIBUTE_NORETURN;
5630 varunset(const char *end, const char *var, const char *umsg, int varflags)
5636 msg = "parameter not set";
5638 if (*end == CTLENDVAR) {
5639 if (varflags & VSNUL)
5644 ash_msg_and_raise_error("%.*s: %s%s", end - var - 1, var, msg, tail);
5648 subevalvar(char *p, char *str, int strloc, int subtype, int startloc, int varflags, int quotes)
5652 int saveherefd = herefd;
5653 struct nodelist *saveargbackq = argbackq;
5655 char *rmesc, *rmescend;
5657 char *(*scan)(char *, char *, char *, char *, int , int);
5660 argstr(p, subtype != VSASSIGN && subtype != VSQUESTION ? EXP_CASE : 0);
5661 STPUTC('\0', expdest);
5662 herefd = saveherefd;
5663 argbackq = saveargbackq;
5664 startp = stackblock() + startloc;
5668 setvar(str, startp, 0);
5669 amount = startp - expdest;
5670 STADJUST(amount, expdest);
5674 varunset(p, str, startp, varflags);
5678 subtype -= VSTRIMRIGHT;
5680 if (subtype < 0 || subtype > 3)
5685 rmescend = stackblock() + strloc;
5687 rmesc = _rmescapes(startp, RMESCAPE_ALLOC | RMESCAPE_GROW);
5688 if (rmesc != startp) {
5690 startp = stackblock() + startloc;
5694 str = stackblock() + strloc;
5695 preglob(str, varflags & VSQUOTE, 0);
5697 /* zero = subtype == VSTRIMLEFT || subtype == VSTRIMLEFTMAX */
5698 zero = subtype >> 1;
5699 /* VSTRIMLEFT/VSTRIMRIGHTMAX -> scanleft */
5700 scan = (subtype & 1) ^ zero ? scanleft : scanright;
5702 loc = scan(startp, rmesc, rmescend, str, quotes, zero);
5705 memmove(startp, loc, str - loc);
5706 loc = startp + (str - loc) - 1;
5709 amount = loc - expdest;
5710 STADJUST(amount, expdest);
5716 * Add the value of a specialized variable to the stack string.
5719 varvalue(char *name, int varflags, int flags)
5729 int quoted = varflags & VSQUOTE;
5730 int subtype = varflags & VSTYPE;
5731 int quotes = flags & (EXP_FULL | EXP_CASE);
5733 if (quoted && (flags & EXP_FULL))
5734 sep = 1 << CHAR_BIT;
5736 syntax = quoted ? DQSYNTAX : BASESYNTAX;
5745 num = shellparam.nparam;
5755 p = makestrspace(NOPTS, expdest);
5756 for (i = NOPTS - 1; i >= 0; i--) {
5758 USTPUTC(optletters(i), p);
5769 sep = ifsset() ? signed_char2int(ifsval()[0]) : ' ';
5770 if (quotes && (SIT(sep, syntax) == CCTL || SIT(sep, syntax) == CBACK))
5776 while ((p = *ap++)) {
5779 partlen = strlen(p);
5782 if (!(subtype == VSPLUS || subtype == VSLENGTH))
5783 memtodest(p, partlen, syntax, quotes);
5789 if (subtype == VSPLUS || subtype == VSLENGTH) {
5811 if (num < 0 || num > shellparam.nparam)
5813 p = num ? shellparam.p[num - 1] : arg0;
5816 p = lookupvar(name);
5822 if (!(subtype == VSPLUS || subtype == VSLENGTH))
5823 memtodest(p, len, syntax, quotes);
5827 if (subtype == VSPLUS || subtype == VSLENGTH)
5828 STADJUST(-len, expdest);
5833 * Expand a variable, and return a pointer to the next character in the
5837 evalvar(char *p, int flag)
5850 quotes = flag & (EXP_FULL | EXP_CASE);
5852 subtype = varflags & VSTYPE;
5853 quoted = varflags & VSQUOTE;
5855 easy = (!quoted || (*var == '@' && shellparam.nparam));
5856 startloc = expdest - (char *)stackblock();
5857 p = strchr(p, '=') + 1;
5860 varlen = varvalue(var, varflags, flag);
5861 if (varflags & VSNUL)
5864 if (subtype == VSPLUS) {
5865 varlen = -1 - varlen;
5869 if (subtype == VSMINUS) {
5873 p, flag | EXP_TILDE |
5874 (quoted ? EXP_QWORD : EXP_WORD)
5883 if (subtype == VSASSIGN || subtype == VSQUESTION) {
5885 if (subevalvar(p, var, 0, subtype, startloc, varflags, 0)) {
5888 * Remove any recorded regions beyond
5891 removerecordregions(startloc);
5901 if (varlen < 0 && uflag)
5902 varunset(p, var, 0, 0);
5904 if (subtype == VSLENGTH) {
5905 cvtnum(varlen > 0 ? varlen : 0);
5909 if (subtype == VSNORMAL) {
5913 recordregion(startloc, expdest - (char *)stackblock(), quoted);
5922 case VSTRIMRIGHTMAX:
5931 * Terminate the string and start recording the pattern
5934 STPUTC('\0', expdest);
5935 patloc = expdest - (char *)stackblock();
5936 if (subevalvar(p, NULL, patloc, subtype,
5937 startloc, varflags, quotes) == 0) {
5938 int amount = expdest - (
5939 (char *)stackblock() + patloc - 1
5941 STADJUST(-amount, expdest);
5943 /* Remove any recorded regions beyond start of variable */
5944 removerecordregions(startloc);
5949 if (subtype != VSNORMAL) { /* skip to end of alternative */
5955 else if (c == CTLBACKQ || c == (CTLBACKQ|CTLQUOTE)) {
5957 argbackq = argbackq->next;
5958 } else if (c == CTLVAR) {
5959 if ((*p++ & VSTYPE) != VSNORMAL)
5961 } else if (c == CTLENDVAR) {
5971 * Break the argument string into pieces based upon IFS and add the
5972 * strings to the argument list. The regions of the string to be
5973 * searched for IFS characters have been stored by recordregion.
5976 ifsbreakup(char *string, struct arglist *arglist)
5978 struct ifsregion *ifsp;
5983 const char *ifs, *realifs;
5988 if (ifslastp != NULL) {
5991 realifs = ifsset() ? ifsval() : defifs;
5994 p = string + ifsp->begoff;
5995 nulonly = ifsp->nulonly;
5996 ifs = nulonly ? nullstr : realifs;
5998 while (p < string + ifsp->endoff) {
6002 if (!strchr(ifs, *p)) {
6007 ifsspc = (strchr(defifs, *p) != NULL);
6008 /* Ignore IFS whitespace at start */
6009 if (q == start && ifsspc) {
6015 sp = stalloc(sizeof(*sp));
6017 *arglist->lastp = sp;
6018 arglist->lastp = &sp->next;
6022 if (p >= string + ifsp->endoff) {
6028 if (strchr(ifs, *p) == NULL ) {
6031 } else if (strchr(defifs, *p) == NULL) {
6046 } while (ifsp != NULL);
6055 sp = stalloc(sizeof(*sp));
6057 *arglist->lastp = sp;
6058 arglist->lastp = &sp->next;
6064 struct ifsregion *p;
6069 struct ifsregion *ifsp;
6075 ifsfirst.next = NULL;
6080 * Add a file name to the list.
6083 addfname(const char *name)
6087 sp = stalloc(sizeof(*sp));
6088 sp->text = ststrdup(name);
6090 exparg.lastp = &sp->next;
6093 static char *expdir;
6096 * Do metacharacter (i.e. *, ?, [...]) expansion.
6099 expmeta(char *enddir, char *name)
6114 for (p = name; *p; p++) {
6115 if (*p == '*' || *p == '?')
6117 else if (*p == '[') {
6124 if (*q == '/' || *q == '\0')
6131 } else if (*p == '\\')
6133 else if (*p == '/') {
6140 if (metaflag == 0) { /* we've reached the end of the file name */
6141 if (enddir != expdir)
6149 if (metaflag == 0 || lstat(expdir, &statb) >= 0)
6160 } while (p < start);
6162 if (enddir == expdir) {
6164 } else if (enddir == expdir + 1 && *expdir == '/') {
6173 if (enddir != expdir)
6175 if (*endname == 0) {
6187 while (! intpending && (dp = readdir(dirp)) != NULL) {
6188 if (dp->d_name[0] == '.' && ! matchdot)
6190 if (pmatch(start, dp->d_name)) {
6192 strcpy(enddir, dp->d_name);
6195 for (p = enddir, cp = dp->d_name; (*p++ = *cp++) != '\0';)
6198 expmeta(p, endname);
6207 static struct strlist *
6208 msort(struct strlist *list, int len)
6210 struct strlist *p, *q = NULL;
6211 struct strlist **lpp;
6219 for (n = half; --n >= 0; ) {
6223 q->next = NULL; /* terminate first half of list */
6224 q = msort(list, half); /* sort first half of list */
6225 p = msort(p, len - half); /* sort second half */
6228 #if ENABLE_LOCALE_SUPPORT
6229 if (strcoll(p->text, q->text) < 0)
6231 if (strcmp(p->text, q->text) < 0)
6255 * Sort the results of file name expansion. It calculates the number of
6256 * strings to sort and then calls msort (short for merge sort) to do the
6259 static struct strlist *
6260 expsort(struct strlist *str)
6266 for (sp = str; sp; sp = sp->next)
6268 return msort(str, len);
6272 expandmeta(struct strlist *str, int flag)
6274 static const char metachars[] ALIGN1 = {
6277 /* TODO - EXP_REDIR */
6280 struct strlist **savelastp;
6286 if (!strpbrk(str->text, metachars))
6288 savelastp = exparg.lastp;
6291 p = preglob(str->text, 0, RMESCAPE_ALLOC | RMESCAPE_HEAP);
6293 int i = strlen(str->text);
6294 expdir = ckmalloc(i < 2048 ? 2048 : i); /* XXX */
6302 if (exparg.lastp == savelastp) {
6307 *exparg.lastp = str;
6308 rmescapes(str->text);
6309 exparg.lastp = &str->next;
6311 *exparg.lastp = NULL;
6312 *savelastp = sp = expsort(*savelastp);
6313 while (sp->next != NULL)
6315 exparg.lastp = &sp->next;
6322 * Perform variable substitution and command substitution on an argument,
6323 * placing the resulting list of arguments in arglist. If EXP_FULL is true,
6324 * perform splitting and file name expansion. When arglist is NULL, perform
6325 * here document expansion.
6328 expandarg(union node *arg, struct arglist *arglist, int flag)
6333 argbackq = arg->narg.backquote;
6334 STARTSTACKSTR(expdest);
6335 ifsfirst.next = NULL;
6337 argstr(arg->narg.text, flag);
6338 p = _STPUTC('\0', expdest);
6340 if (arglist == NULL) {
6341 return; /* here document expanded */
6343 p = grabstackstr(p);
6344 exparg.lastp = &exparg.list;
6348 if (flag & EXP_FULL) {
6349 ifsbreakup(p, &exparg);
6350 *exparg.lastp = NULL;
6351 exparg.lastp = &exparg.list;
6352 expandmeta(exparg.list, flag);
6354 if (flag & EXP_REDIR) /*XXX - for now, just remove escapes */
6356 sp = stalloc(sizeof(*sp));
6359 exparg.lastp = &sp->next;
6363 *exparg.lastp = NULL;
6365 *arglist->lastp = exparg.list;
6366 arglist->lastp = exparg.lastp;
6371 * Expand shell variables and backquotes inside a here document.
6374 expandhere(union node *arg, int fd)
6377 expandarg(arg, (struct arglist *)NULL, 0);
6378 full_write(fd, stackblock(), expdest - (char *)stackblock());
6382 * Returns true if the pattern matches the string.
6385 patmatch(char *pattern, const char *string)
6387 return pmatch(preglob(pattern, 0, 0), string);
6391 * See if a pattern matches in a case statement.
6394 casematch(union node *pattern, char *val)
6396 struct stackmark smark;
6399 setstackmark(&smark);
6400 argbackq = pattern->narg.backquote;
6401 STARTSTACKSTR(expdest);
6403 argstr(pattern->narg.text, EXP_TILDE | EXP_CASE);
6404 STACKSTRNUL(expdest);
6405 result = patmatch(stackblock(), val);
6406 popstackmark(&smark);
6411 /* ============ find_command */
6415 int (*builtin)(int, char **);
6416 /* unsigned flags; */
6418 #define IS_BUILTIN_SPECIAL(b) ((b)->name[0] & 1)
6419 #define IS_BUILTIN_REGULAR(b) ((b)->name[0] & 2)
6420 #define IS_BUILTIN_ASSIGN(b) ((b)->name[0] & 4)
6426 const struct builtincmd *cmd;
6427 struct funcnode *func;
6430 /* values of cmdtype */
6431 #define CMDUNKNOWN -1 /* no entry in table for command */
6432 #define CMDNORMAL 0 /* command is an executable program */
6433 #define CMDFUNCTION 1 /* command is a shell function */
6434 #define CMDBUILTIN 2 /* command is a shell builtin */
6436 /* action to find_command() */
6437 #define DO_ERR 0x01 /* prints errors */
6438 #define DO_ABS 0x02 /* checks absolute paths */
6439 #define DO_NOFUNC 0x04 /* don't return shell functions, for command */
6440 #define DO_ALTPATH 0x08 /* using alternate path */
6441 #define DO_ALTBLTIN 0x20 /* %builtin in alt. path */
6443 static void find_command(char *, struct cmdentry *, int, const char *);
6446 /* ============ Hashing commands */
6449 * When commands are first encountered, they are entered in a hash table.
6450 * This ensures that a full path search will not have to be done for them
6451 * on each invocation.
6453 * We should investigate converting to a linear search, even though that
6454 * would make the command name "hash" a misnomer.
6457 #define CMDTABLESIZE 31 /* should be prime */
6458 #define ARB 1 /* actual size determined at run time */
6461 struct tblentry *next; /* next entry in hash chain */
6462 union param param; /* definition of builtin function */
6463 short cmdtype; /* index identifying command */
6464 char rehash; /* if set, cd done since entry created */
6465 char cmdname[ARB]; /* name of command */
6468 static struct tblentry *cmdtable[CMDTABLESIZE];
6469 static int builtinloc = -1; /* index in path of %builtin, or -1 */
6472 tryexec(char *cmd, char **argv, char **envp)
6476 #if ENABLE_FEATURE_SH_STANDALONE
6477 if (strchr(cmd, '/') == NULL) {
6478 const struct bb_applet *a;
6480 a = find_applet_by_name(cmd);
6483 run_appletstruct_and_exit(a, argv);
6484 /* re-exec ourselves with the new arguments */
6485 execve(bb_busybox_exec_path, argv, envp);
6486 /* If they called chroot or otherwise made the binary no longer
6487 * executable, fall through */
6495 execve(cmd, argv, envp);
6496 } while (errno == EINTR);
6498 execve(cmd, argv, envp);
6502 } else if (errno == ENOEXEC) {
6506 for (ap = argv; *ap; ap++)
6508 ap = new = ckmalloc((ap - argv + 2) * sizeof(char *));
6510 ap[0] = cmd = (char *)DEFAULT_SHELL;
6513 while ((*ap++ = *argv++))
6521 * Exec a program. Never returns. If you change this routine, you may
6522 * have to change the find_command routine as well.
6524 #define environment() listvars(VEXPORT, VUNSET, 0)
6525 static void shellexec(char **, const char *, int) ATTRIBUTE_NORETURN;
6527 shellexec(char **argv, const char *path, int idx)
6535 envp = environment();
6536 if (strchr(argv[0], '/')
6537 #if ENABLE_FEATURE_SH_STANDALONE
6538 || find_applet_by_name(argv[0])
6541 tryexec(argv[0], argv, envp);
6545 while ((cmdname = padvance(&path, argv[0])) != NULL) {
6546 if (--idx < 0 && pathopt == NULL) {
6547 tryexec(cmdname, argv, envp);
6548 if (errno != ENOENT && errno != ENOTDIR)
6555 /* Map to POSIX errors */
6567 exitstatus = exerrno;
6568 TRACE(("shellexec failed for %s, errno %d, suppressint %d\n",
6569 argv[0], e, suppressint ));
6570 ash_msg_and_raise(EXEXEC, "%s: %s", argv[0], errmsg(e, "not found"));
6575 printentry(struct tblentry *cmdp)
6581 idx = cmdp->param.index;
6584 name = padvance(&path, cmdp->cmdname);
6586 } while (--idx >= 0);
6587 out1fmt("%s%s\n", name, (cmdp->rehash ? "*" : nullstr));
6591 * Clear out command entries. The argument specifies the first entry in
6592 * PATH which has changed.
6595 clearcmdentry(int firstchange)
6597 struct tblentry **tblp;
6598 struct tblentry **pp;
6599 struct tblentry *cmdp;
6602 for (tblp = cmdtable; tblp < &cmdtable[CMDTABLESIZE]; tblp++) {
6604 while ((cmdp = *pp) != NULL) {
6605 if ((cmdp->cmdtype == CMDNORMAL &&
6606 cmdp->param.index >= firstchange)
6607 || (cmdp->cmdtype == CMDBUILTIN &&
6608 builtinloc >= firstchange)
6621 * Locate a command in the command hash table. If "add" is nonzero,
6622 * add the command to the table if it is not already present. The
6623 * variable "lastcmdentry" is set to point to the address of the link
6624 * pointing to the entry, so that delete_cmd_entry can delete the
6627 * Interrupts must be off if called with add != 0.
6629 static struct tblentry **lastcmdentry;
6631 static struct tblentry *
6632 cmdlookup(const char *name, int add)
6634 unsigned int hashval;
6636 struct tblentry *cmdp;
6637 struct tblentry **pp;
6640 hashval = (unsigned char)*p << 4;
6642 hashval += (unsigned char)*p++;
6644 pp = &cmdtable[hashval % CMDTABLESIZE];
6645 for (cmdp = *pp; cmdp; cmdp = cmdp->next) {
6646 if (strcmp(cmdp->cmdname, name) == 0)
6650 if (add && cmdp == NULL) {
6651 cmdp = *pp = ckmalloc(sizeof(struct tblentry) - ARB
6652 + strlen(name) + 1);
6654 cmdp->cmdtype = CMDUNKNOWN;
6655 strcpy(cmdp->cmdname, name);
6662 * Delete the command entry returned on the last lookup.
6665 delete_cmd_entry(void)
6667 struct tblentry *cmdp;
6670 cmdp = *lastcmdentry;
6671 *lastcmdentry = cmdp->next;
6672 if (cmdp->cmdtype == CMDFUNCTION)
6673 freefunc(cmdp->param.func);
6679 * Add a new command entry, replacing any existing command entry for
6680 * the same name - except special builtins.
6683 addcmdentry(char *name, struct cmdentry *entry)
6685 struct tblentry *cmdp;
6687 cmdp = cmdlookup(name, 1);
6688 if (cmdp->cmdtype == CMDFUNCTION) {
6689 freefunc(cmdp->param.func);
6691 cmdp->cmdtype = entry->cmdtype;
6692 cmdp->param = entry->u;
6697 hashcmd(int argc, char **argv)
6699 struct tblentry **pp;
6700 struct tblentry *cmdp;
6702 struct cmdentry entry;
6705 while ((c = nextopt("r")) != '\0') {
6709 if (*argptr == NULL) {
6710 for (pp = cmdtable; pp < &cmdtable[CMDTABLESIZE]; pp++) {
6711 for (cmdp = *pp; cmdp; cmdp = cmdp->next) {
6712 if (cmdp->cmdtype == CMDNORMAL)
6719 while ((name = *argptr) != NULL) {
6720 cmdp = cmdlookup(name, 0);
6722 && (cmdp->cmdtype == CMDNORMAL
6723 || (cmdp->cmdtype == CMDBUILTIN && builtinloc >= 0)))
6725 find_command(name, &entry, DO_ERR, pathval());
6726 if (entry.cmdtype == CMDUNKNOWN)
6734 * Called when a cd is done. Marks all commands so the next time they
6735 * are executed they will be rehashed.
6740 struct tblentry **pp;
6741 struct tblentry *cmdp;
6743 for (pp = cmdtable; pp < &cmdtable[CMDTABLESIZE]; pp++) {
6744 for (cmdp = *pp; cmdp; cmdp = cmdp->next) {
6745 if (cmdp->cmdtype == CMDNORMAL || (
6746 cmdp->cmdtype == CMDBUILTIN &&
6747 !(IS_BUILTIN_REGULAR(cmdp->param.cmd)) &&
6756 * Fix command hash table when PATH changed.
6757 * Called before PATH is changed. The argument is the new value of PATH;
6758 * pathval() still returns the old value at this point.
6759 * Called with interrupts off.
6762 changepath(const char *newval)
6764 const char *old, *new;
6771 firstchange = 9999; /* assume no change */
6777 if ((*old == '\0' && *new == ':')
6778 || (*old == ':' && *new == '\0'))
6780 old = new; /* ignore subsequent differences */
6784 if (*new == '%' && idx_bltin < 0 && prefix(new + 1, "builtin"))
6791 if (builtinloc < 0 && idx_bltin >= 0)
6792 builtinloc = idx_bltin; /* zap builtins */
6793 if (builtinloc >= 0 && idx_bltin < 0)
6795 clearcmdentry(firstchange);
6796 builtinloc = idx_bltin;
6811 #define TENDBQUOTE 12
6829 /* first char is indicating which tokens mark the end of a list */
6830 static const char *const tokname_array[] = {
6844 #define KWDOFFSET 13
6845 /* the following are keywords */
6867 static char buf[16];
6870 //if (tok < TSEMI) return tokname_array[tok] + 1;
6871 //sprintf(buf, "\"%s\"", tokname_array[tok] + 1);
6876 sprintf(buf + (tok >= TSEMI), "%s%c",
6877 tokname_array[tok] + 1, (tok >= TSEMI ? '"' : 0));
6881 /* Wrapper around strcmp for qsort/bsearch/... */
6883 pstrcmp(const void *a, const void *b)
6885 return strcmp((char*) a, (*(char**) b) + 1);
6888 static const char *const *
6889 findkwd(const char *s)
6891 return bsearch(s, tokname_array + KWDOFFSET,
6892 ARRAY_SIZE(tokname_array) - KWDOFFSET,
6893 sizeof(tokname_array[0]), pstrcmp);
6897 * Locate and print what a word is...
6900 describe_command(char *command, int describe_command_verbose)
6902 struct cmdentry entry;
6903 struct tblentry *cmdp;
6904 #if ENABLE_ASH_ALIAS
6905 const struct alias *ap;
6907 const char *path = pathval();
6909 if (describe_command_verbose) {
6913 /* First look at the keywords */
6914 if (findkwd(command)) {
6915 out1str(describe_command_verbose ? " is a shell keyword" : command);
6919 #if ENABLE_ASH_ALIAS
6920 /* Then look at the aliases */
6921 ap = lookupalias(command, 0);
6923 if (!describe_command_verbose) {
6928 out1fmt(" is an alias for %s", ap->val);
6932 /* Then check if it is a tracked alias */
6933 cmdp = cmdlookup(command, 0);
6935 entry.cmdtype = cmdp->cmdtype;
6936 entry.u = cmdp->param;
6938 /* Finally use brute force */
6939 find_command(command, &entry, DO_ABS, path);
6942 switch (entry.cmdtype) {
6944 int j = entry.u.index;
6950 p = padvance(&path, command);
6954 if (describe_command_verbose) {
6956 (cmdp ? " a tracked alias for" : nullstr), p
6965 if (describe_command_verbose) {
6966 out1str(" is a shell function");
6973 if (describe_command_verbose) {
6974 out1fmt(" is a %sshell builtin",
6975 IS_BUILTIN_SPECIAL(entry.u.cmd) ?
6976 "special " : nullstr
6984 if (describe_command_verbose) {
6985 out1str(": not found\n");
6990 outstr("\n", stdout);
6995 typecmd(int argc, char **argv)
7001 /* type -p ... ? (we don't bother checking for 'p') */
7002 if (argv[1] && argv[1][0] == '-') {
7007 err |= describe_command(argv[i++], verbose);
7012 #if ENABLE_ASH_CMDCMD
7014 commandcmd(int argc, char **argv)
7022 while ((c = nextopt("pvV")) != '\0')
7024 verify |= VERIFY_VERBOSE;
7026 verify |= VERIFY_BRIEF;
7032 return describe_command(*argptr, verify - VERIFY_BRIEF);
7039 /* ============ eval.c */
7041 static int funcblocksize; /* size of structures in function */
7042 static int funcstringsize; /* size of strings in node */
7043 static void *funcblock; /* block to allocate function from */
7044 static char *funcstring; /* block to allocate strings from */
7046 /* flags in argument to evaltree */
7047 #define EV_EXIT 01 /* exit after evaluating tree */
7048 #define EV_TESTED 02 /* exit status is checked; ignore -e flag */
7049 #define EV_BACKCMD 04 /* command executing within back quotes */
7051 static const short nodesize[26] = {
7052 SHELL_ALIGN(sizeof(struct ncmd)),
7053 SHELL_ALIGN(sizeof(struct npipe)),
7054 SHELL_ALIGN(sizeof(struct nredir)),
7055 SHELL_ALIGN(sizeof(struct nredir)),
7056 SHELL_ALIGN(sizeof(struct nredir)),
7057 SHELL_ALIGN(sizeof(struct nbinary)),
7058 SHELL_ALIGN(sizeof(struct nbinary)),
7059 SHELL_ALIGN(sizeof(struct nbinary)),
7060 SHELL_ALIGN(sizeof(struct nif)),
7061 SHELL_ALIGN(sizeof(struct nbinary)),
7062 SHELL_ALIGN(sizeof(struct nbinary)),
7063 SHELL_ALIGN(sizeof(struct nfor)),
7064 SHELL_ALIGN(sizeof(struct ncase)),
7065 SHELL_ALIGN(sizeof(struct nclist)),
7066 SHELL_ALIGN(sizeof(struct narg)),
7067 SHELL_ALIGN(sizeof(struct narg)),
7068 SHELL_ALIGN(sizeof(struct nfile)),
7069 SHELL_ALIGN(sizeof(struct nfile)),
7070 SHELL_ALIGN(sizeof(struct nfile)),
7071 SHELL_ALIGN(sizeof(struct nfile)),
7072 SHELL_ALIGN(sizeof(struct nfile)),
7073 SHELL_ALIGN(sizeof(struct ndup)),
7074 SHELL_ALIGN(sizeof(struct ndup)),
7075 SHELL_ALIGN(sizeof(struct nhere)),
7076 SHELL_ALIGN(sizeof(struct nhere)),
7077 SHELL_ALIGN(sizeof(struct nnot)),
7080 static void calcsize(union node *n);
7083 sizenodelist(struct nodelist *lp)
7086 funcblocksize += SHELL_ALIGN(sizeof(struct nodelist));
7093 calcsize(union node *n)
7097 funcblocksize += nodesize[n->type];
7100 calcsize(n->ncmd.redirect);
7101 calcsize(n->ncmd.args);
7102 calcsize(n->ncmd.assign);
7105 sizenodelist(n->npipe.cmdlist);
7110 calcsize(n->nredir.redirect);
7111 calcsize(n->nredir.n);
7118 calcsize(n->nbinary.ch2);
7119 calcsize(n->nbinary.ch1);
7122 calcsize(n->nif.elsepart);
7123 calcsize(n->nif.ifpart);
7124 calcsize(n->nif.test);
7127 funcstringsize += strlen(n->nfor.var) + 1;
7128 calcsize(n->nfor.body);
7129 calcsize(n->nfor.args);
7132 calcsize(n->ncase.cases);
7133 calcsize(n->ncase.expr);
7136 calcsize(n->nclist.body);
7137 calcsize(n->nclist.pattern);
7138 calcsize(n->nclist.next);
7142 sizenodelist(n->narg.backquote);
7143 funcstringsize += strlen(n->narg.text) + 1;
7144 calcsize(n->narg.next);
7151 calcsize(n->nfile.fname);
7152 calcsize(n->nfile.next);
7156 calcsize(n->ndup.vname);
7157 calcsize(n->ndup.next);
7161 calcsize(n->nhere.doc);
7162 calcsize(n->nhere.next);
7165 calcsize(n->nnot.com);
7171 nodeckstrdup(char *s)
7173 char *rtn = funcstring;
7175 strcpy(funcstring, s);
7176 funcstring += strlen(s) + 1;
7180 static union node *copynode(union node *);
7182 static struct nodelist *
7183 copynodelist(struct nodelist *lp)
7185 struct nodelist *start;
7186 struct nodelist **lpp;
7191 funcblock = (char *) funcblock + SHELL_ALIGN(sizeof(struct nodelist));
7192 (*lpp)->n = copynode(lp->n);
7194 lpp = &(*lpp)->next;
7201 copynode(union node *n)
7208 funcblock = (char *) funcblock + nodesize[n->type];
7212 new->ncmd.redirect = copynode(n->ncmd.redirect);
7213 new->ncmd.args = copynode(n->ncmd.args);
7214 new->ncmd.assign = copynode(n->ncmd.assign);
7217 new->npipe.cmdlist = copynodelist(n->npipe.cmdlist);
7218 new->npipe.backgnd = n->npipe.backgnd;
7223 new->nredir.redirect = copynode(n->nredir.redirect);
7224 new->nredir.n = copynode(n->nredir.n);
7231 new->nbinary.ch2 = copynode(n->nbinary.ch2);
7232 new->nbinary.ch1 = copynode(n->nbinary.ch1);
7235 new->nif.elsepart = copynode(n->nif.elsepart);
7236 new->nif.ifpart = copynode(n->nif.ifpart);
7237 new->nif.test = copynode(n->nif.test);
7240 new->nfor.var = nodeckstrdup(n->nfor.var);
7241 new->nfor.body = copynode(n->nfor.body);
7242 new->nfor.args = copynode(n->nfor.args);
7245 new->ncase.cases = copynode(n->ncase.cases);
7246 new->ncase.expr = copynode(n->ncase.expr);
7249 new->nclist.body = copynode(n->nclist.body);
7250 new->nclist.pattern = copynode(n->nclist.pattern);
7251 new->nclist.next = copynode(n->nclist.next);
7255 new->narg.backquote = copynodelist(n->narg.backquote);
7256 new->narg.text = nodeckstrdup(n->narg.text);
7257 new->narg.next = copynode(n->narg.next);
7264 new->nfile.fname = copynode(n->nfile.fname);
7265 new->nfile.fd = n->nfile.fd;
7266 new->nfile.next = copynode(n->nfile.next);
7270 new->ndup.vname = copynode(n->ndup.vname);
7271 new->ndup.dupfd = n->ndup.dupfd;
7272 new->ndup.fd = n->ndup.fd;
7273 new->ndup.next = copynode(n->ndup.next);
7277 new->nhere.doc = copynode(n->nhere.doc);
7278 new->nhere.fd = n->nhere.fd;
7279 new->nhere.next = copynode(n->nhere.next);
7282 new->nnot.com = copynode(n->nnot.com);
7285 new->type = n->type;
7290 * Make a copy of a parse tree.
7292 static struct funcnode *
7293 copyfunc(union node *n)
7298 funcblocksize = offsetof(struct funcnode, n);
7301 blocksize = funcblocksize;
7302 f = ckmalloc(blocksize + funcstringsize);
7303 funcblock = (char *) f + offsetof(struct funcnode, n);
7304 funcstring = (char *) f + blocksize;
7311 * Define a shell function.
7314 defun(char *name, union node *func)
7316 struct cmdentry entry;
7319 entry.cmdtype = CMDFUNCTION;
7320 entry.u.func = copyfunc(func);
7321 addcmdentry(name, &entry);
7325 static int evalskip; /* set if we are skipping commands */
7326 /* reasons for skipping commands (see comment on breakcmd routine) */
7327 #define SKIPBREAK (1 << 0)
7328 #define SKIPCONT (1 << 1)
7329 #define SKIPFUNC (1 << 2)
7330 #define SKIPFILE (1 << 3)
7331 #define SKIPEVAL (1 << 4)
7332 static int skipcount; /* number of levels to skip */
7333 static int funcnest; /* depth of function calls */
7335 /* forward decl way out to parsing code - dotrap needs it */
7336 static int evalstring(char *s, int mask);
7339 * Called to execute a trap. Perhaps we should avoid entering new trap
7340 * handlers while we are executing a trap handler.
7351 savestatus = exitstatus;
7355 for (i = 0, q = gotsig; i < NSIG - 1; i++, q++) {
7363 skip = evalstring(p, SKIPEVAL);
7364 exitstatus = savestatus;
7372 /* forward declarations - evaluation is fairly recursive business... */
7373 static void evalloop(union node *, int);
7374 static void evalfor(union node *, int);
7375 static void evalcase(union node *, int);
7376 static void evalsubshell(union node *, int);
7377 static void expredir(union node *);
7378 static void evalpipe(union node *, int);
7379 static void evalcommand(union node *, int);
7380 static int evalbltin(const struct builtincmd *, int, char **);
7381 static void prehash(union node *);
7384 * Evaluate a parse tree. The value is left in the global variable
7388 evaltree(union node *n, int flags)
7391 void (*evalfn)(union node *, int);
7395 TRACE(("evaltree(NULL) called\n"));
7398 TRACE(("pid %d, evaltree(%p: %d, %d) called\n",
7399 getpid(), n, n->type, flags));
7403 out1fmt("Node type = %d\n", n->type);
7408 evaltree(n->nnot.com, EV_TESTED);
7409 status = !exitstatus;
7412 expredir(n->nredir.redirect);
7413 status = redirectsafe(n->nredir.redirect, REDIR_PUSH);
7415 evaltree(n->nredir.n, flags & EV_TESTED);
7416 status = exitstatus;
7421 evalfn = evalcommand;
7423 if (eflag && !(flags & EV_TESTED))
7435 evalfn = evalsubshell;
7447 #error NAND + 1 != NOR
7449 #if NOR + 1 != NSEMI
7450 #error NOR + 1 != NSEMI
7452 isor = n->type - NAND;
7455 (flags | ((isor >> 1) - 1)) & EV_TESTED
7457 if (!exitstatus == isor)
7469 evaltree(n->nif.test, EV_TESTED);
7472 if (exitstatus == 0) {
7475 } else if (n->nif.elsepart) {
7476 n = n->nif.elsepart;
7481 defun(n->narg.text, n->narg.next);
7485 exitstatus = status;
7489 if ((checkexit & exitstatus))
7490 evalskip |= SKIPEVAL;
7491 else if (pendingsig && dotrap())
7494 if (flags & EV_EXIT) {
7496 raise_exception(EXEXIT);
7500 #if !defined(__alpha__) || (defined(__GNUC__) && __GNUC__ >= 3)
7503 void evaltreenr(union node *, int) __attribute__ ((alias("evaltree"),__noreturn__));
7505 static int loopnest; /* current loop nesting level */
7508 evalloop(union node *n, int flags)
7518 evaltree(n->nbinary.ch1, EV_TESTED);
7521 if (evalskip == SKIPCONT && --skipcount <= 0) {
7525 if (evalskip == SKIPBREAK && --skipcount <= 0)
7530 if (n->type != NWHILE)
7534 evaltree(n->nbinary.ch2, flags);
7535 status = exitstatus;
7540 exitstatus = status;
7544 evalfor(union node *n, int flags)
7546 struct arglist arglist;
7549 struct stackmark smark;
7551 setstackmark(&smark);
7552 arglist.lastp = &arglist.list;
7553 for (argp = n->nfor.args; argp; argp = argp->narg.next) {
7554 expandarg(argp, &arglist, EXP_FULL | EXP_TILDE | EXP_RECORD);
7559 *arglist.lastp = NULL;
7564 for (sp = arglist.list; sp; sp = sp->next) {
7565 setvar(n->nfor.var, sp->text, 0);
7566 evaltree(n->nfor.body, flags);
7568 if (evalskip == SKIPCONT && --skipcount <= 0) {
7572 if (evalskip == SKIPBREAK && --skipcount <= 0)
7579 popstackmark(&smark);
7583 evalcase(union node *n, int flags)
7587 struct arglist arglist;
7588 struct stackmark smark;
7590 setstackmark(&smark);
7591 arglist.lastp = &arglist.list;
7592 expandarg(n->ncase.expr, &arglist, EXP_TILDE);
7594 for (cp = n->ncase.cases; cp && evalskip == 0; cp = cp->nclist.next) {
7595 for (patp = cp->nclist.pattern; patp; patp = patp->narg.next) {
7596 if (casematch(patp, arglist.list->text)) {
7597 if (evalskip == 0) {
7598 evaltree(cp->nclist.body, flags);
7605 popstackmark(&smark);
7609 * Kick off a subshell to evaluate a tree.
7612 evalsubshell(union node *n, int flags)
7615 int backgnd = (n->type == NBACKGND);
7618 expredir(n->nredir.redirect);
7619 if (!backgnd && flags & EV_EXIT && !trap[0])
7623 if (forkshell(jp, n, backgnd) == 0) {
7627 flags &=~ EV_TESTED;
7629 redirect(n->nredir.redirect, 0);
7630 evaltreenr(n->nredir.n, flags);
7635 status = waitforjob(jp);
7636 exitstatus = status;
7641 * Compute the names of the files in a redirection list.
7643 static void fixredir(union node *, const char *, int);
7645 expredir(union node *n)
7649 for (redir = n; redir; redir = redir->nfile.next) {
7652 memset(&fn, 0, sizeof(fn));
7653 fn.lastp = &fn.list;
7654 switch (redir->type) {
7660 expandarg(redir->nfile.fname, &fn, EXP_TILDE | EXP_REDIR);
7661 redir->nfile.expfname = fn.list->text;
7665 if (redir->ndup.vname) {
7666 expandarg(redir->ndup.vname, &fn, EXP_FULL | EXP_TILDE);
7667 if (fn.list == NULL)
7668 ash_msg_and_raise_error("redir error");
7669 fixredir(redir, fn.list->text, 1);
7677 * Evaluate a pipeline. All the processes in the pipeline are children
7678 * of the process creating the pipeline. (This differs from some versions
7679 * of the shell, which make the last process in a pipeline the parent
7683 evalpipe(union node *n, int flags)
7686 struct nodelist *lp;
7691 TRACE(("evalpipe(0x%lx) called\n", (long)n));
7693 for (lp = n->npipe.cmdlist; lp; lp = lp->next)
7697 jp = makejob(n, pipelen);
7699 for (lp = n->npipe.cmdlist; lp; lp = lp->next) {
7703 if (pipe(pip) < 0) {
7705 ash_msg_and_raise_error("pipe call failed");
7708 if (forkshell(jp, lp->n, n->npipe.backgnd) == 0) {
7721 evaltreenr(lp->n, flags);
7729 if (n->npipe.backgnd == 0) {
7730 exitstatus = waitforjob(jp);
7731 TRACE(("evalpipe: job done exit status %d\n", exitstatus));
7737 * Controls whether the shell is interactive or not.
7740 setinteractive(int on)
7742 static int is_interactive;
7744 if (++on == is_interactive)
7746 is_interactive = on;
7750 #if !ENABLE_FEATURE_SH_EXTRA_QUIET
7751 if (is_interactive > 1) {
7752 /* Looks like they want an interactive shell */
7753 static smallint did_banner;
7758 "%s built-in shell (ash)\n"
7759 "Enter 'help' for a list of built-in commands."
7768 #if ENABLE_FEATURE_EDITING_VI
7769 #define setvimode(on) do { \
7770 if (on) line_input_state->flags |= VI_MODE; \
7771 else line_input_state->flags &= ~VI_MODE; \
7774 #define setvimode(on) viflag = 0 /* forcibly keep the option off */
7783 setinteractive(iflag);
7788 static struct localvar *localvars;
7791 * Called after a function returns.
7792 * Interrupts must be off.
7797 struct localvar *lvp;
7800 while ((lvp = localvars) != NULL) {
7801 localvars = lvp->next;
7803 TRACE(("poplocalvar %s", vp ? vp->text : "-"));
7804 if (vp == NULL) { /* $- saved */
7805 memcpy(optlist, lvp->text, sizeof(optlist));
7806 free((char*)lvp->text);
7808 } else if ((lvp->flags & (VUNSET|VSTRFIXED)) == VUNSET) {
7812 (*vp->func)(strchrnul(lvp->text, '=') + 1);
7813 if ((vp->flags & (VTEXTFIXED|VSTACK)) == 0)
7814 free((char*)vp->text);
7815 vp->flags = lvp->flags;
7816 vp->text = lvp->text;
7823 evalfun(struct funcnode *func, int argc, char **argv, int flags)
7825 volatile struct shparam saveparam;
7826 struct localvar *volatile savelocalvars;
7827 struct jmploc *volatile savehandler;
7828 struct jmploc jmploc;
7831 saveparam = shellparam;
7832 savelocalvars = localvars;
7833 e = setjmp(jmploc.loc);
7838 savehandler = exception_handler;
7839 exception_handler = &jmploc;
7841 shellparam.malloc = 0;
7845 shellparam.nparam = argc - 1;
7846 shellparam.p = argv + 1;
7847 #if ENABLE_ASH_GETOPTS
7848 shellparam.optind = 1;
7849 shellparam.optoff = -1;
7851 evaltree(&func->n, flags & EV_TESTED);
7857 localvars = savelocalvars;
7858 freeparam(&shellparam);
7859 shellparam = saveparam;
7860 exception_handler = savehandler;
7862 evalskip &= ~SKIPFUNC;
7866 #if ENABLE_ASH_CMDCMD
7868 parse_command_args(char **argv, const char **path)
7881 if (c == '-' && !*cp) {
7888 *path = bb_default_path;
7891 /* run 'typecmd' for other options */
7902 * Make a variable a local variable. When a variable is made local, it's
7903 * value and flags are saved in a localvar structure. The saved values
7904 * will be restored when the shell function returns. We handle the name
7905 * "-" as a special case.
7910 struct localvar *lvp;
7915 lvp = ckmalloc(sizeof(struct localvar));
7916 if (LONE_DASH(name)) {
7918 p = ckmalloc(sizeof(optlist));
7919 lvp->text = memcpy(p, optlist, sizeof(optlist));
7924 vpp = hashvar(name);
7925 vp = *findvar(vpp, name);
7926 eq = strchr(name, '=');
7929 setvareq(name, VSTRFIXED);
7931 setvar(name, NULL, VSTRFIXED);
7932 vp = *vpp; /* the new variable */
7933 lvp->flags = VUNSET;
7935 lvp->text = vp->text;
7936 lvp->flags = vp->flags;
7937 vp->flags |= VSTRFIXED|VTEXTFIXED;
7943 lvp->next = localvars;
7949 * The "local" command.
7952 localcmd(int argc, char **argv)
7957 while ((name = *argv++) != NULL) {
7964 falsecmd(int argc, char **argv)
7970 truecmd(int argc, char **argv)
7976 execcmd(int argc, char **argv)
7979 iflag = 0; /* exit on error */
7982 shellexec(argv + 1, pathval(), 0);
7988 * The return command.
7991 returncmd(int argc, char **argv)
7994 * If called outside a function, do what ksh does;
7995 * skip the rest of the file.
7997 evalskip = funcnest ? SKIPFUNC : SKIPFILE;
7998 return argv[1] ? number(argv[1]) : exitstatus;
8001 /* Forward declarations for builtintab[] */
8002 static int breakcmd(int, char **);
8003 static int dotcmd(int, char **);
8004 static int evalcmd(int, char **);
8005 #if ENABLE_ASH_BUILTIN_ECHO
8006 static int echocmd(int, char **);
8008 #if ENABLE_ASH_BUILTIN_TEST
8009 static int testcmd(int, char **);
8011 static int exitcmd(int, char **);
8012 static int exportcmd(int, char **);
8013 #if ENABLE_ASH_GETOPTS
8014 static int getoptscmd(int, char **);
8016 #if !ENABLE_FEATURE_SH_EXTRA_QUIET
8017 static int helpcmd(int argc, char **argv);
8019 #if ENABLE_ASH_MATH_SUPPORT
8020 static int letcmd(int, char **);
8022 static int readcmd(int, char **);
8023 static int setcmd(int, char **);
8024 static int shiftcmd(int, char **);
8025 static int timescmd(int, char **);
8026 static int trapcmd(int, char **);
8027 static int umaskcmd(int, char **);
8028 static int unsetcmd(int, char **);
8029 static int ulimitcmd(int, char **);
8031 #define BUILTIN_NOSPEC "0"
8032 #define BUILTIN_SPECIAL "1"
8033 #define BUILTIN_REGULAR "2"
8034 #define BUILTIN_SPEC_REG "3"
8035 #define BUILTIN_ASSIGN "4"
8036 #define BUILTIN_SPEC_ASSG "5"
8037 #define BUILTIN_REG_ASSG "6"
8038 #define BUILTIN_SPEC_REG_ASSG "7"
8040 /* make sure to keep these in proper order since it is searched via bsearch() */
8041 static const struct builtincmd builtintab[] = {
8042 { BUILTIN_SPEC_REG ".", dotcmd },
8043 { BUILTIN_SPEC_REG ":", truecmd },
8044 #if ENABLE_ASH_BUILTIN_TEST
8045 { BUILTIN_REGULAR "[", testcmd },
8046 { BUILTIN_REGULAR "[[", testcmd },
8048 #if ENABLE_ASH_ALIAS
8049 { BUILTIN_REG_ASSG "alias", aliascmd },
8052 { BUILTIN_REGULAR "bg", fg_bgcmd },
8054 { BUILTIN_SPEC_REG "break", breakcmd },
8055 { BUILTIN_REGULAR "cd", cdcmd },
8056 { BUILTIN_NOSPEC "chdir", cdcmd },
8057 #if ENABLE_ASH_CMDCMD
8058 { BUILTIN_REGULAR "command", commandcmd },
8060 { BUILTIN_SPEC_REG "continue", breakcmd },
8061 #if ENABLE_ASH_BUILTIN_ECHO
8062 { BUILTIN_REGULAR "echo", echocmd },
8064 { BUILTIN_SPEC_REG "eval", evalcmd },
8065 { BUILTIN_SPEC_REG "exec", execcmd },
8066 { BUILTIN_SPEC_REG "exit", exitcmd },
8067 { BUILTIN_SPEC_REG_ASSG "export", exportcmd },
8068 { BUILTIN_REGULAR "false", falsecmd },
8070 { BUILTIN_REGULAR "fg", fg_bgcmd },
8072 #if ENABLE_ASH_GETOPTS
8073 { BUILTIN_REGULAR "getopts", getoptscmd },
8075 { BUILTIN_NOSPEC "hash", hashcmd },
8076 #if !ENABLE_FEATURE_SH_EXTRA_QUIET
8077 { BUILTIN_NOSPEC "help", helpcmd },
8080 { BUILTIN_REGULAR "jobs", jobscmd },
8081 { BUILTIN_REGULAR "kill", killcmd },
8083 #if ENABLE_ASH_MATH_SUPPORT
8084 { BUILTIN_NOSPEC "let", letcmd },
8086 { BUILTIN_ASSIGN "local", localcmd },
8087 { BUILTIN_NOSPEC "pwd", pwdcmd },
8088 { BUILTIN_REGULAR "read", readcmd },
8089 { BUILTIN_SPEC_REG_ASSG "readonly", exportcmd },
8090 { BUILTIN_SPEC_REG "return", returncmd },
8091 { BUILTIN_SPEC_REG "set", setcmd },
8092 { BUILTIN_SPEC_REG "shift", shiftcmd },
8093 { BUILTIN_SPEC_REG "source", dotcmd },
8094 #if ENABLE_ASH_BUILTIN_TEST
8095 { BUILTIN_REGULAR "test", testcmd },
8097 { BUILTIN_SPEC_REG "times", timescmd },
8098 { BUILTIN_SPEC_REG "trap", trapcmd },
8099 { BUILTIN_REGULAR "true", truecmd },
8100 { BUILTIN_NOSPEC "type", typecmd },
8101 { BUILTIN_NOSPEC "ulimit", ulimitcmd },
8102 { BUILTIN_REGULAR "umask", umaskcmd },
8103 #if ENABLE_ASH_ALIAS
8104 { BUILTIN_REGULAR "unalias", unaliascmd },
8106 { BUILTIN_SPEC_REG "unset", unsetcmd },
8107 { BUILTIN_REGULAR "wait", waitcmd },
8111 #define COMMANDCMD (builtintab + 5 + \
8112 2 * ENABLE_ASH_BUILTIN_TEST + \
8113 ENABLE_ASH_ALIAS + \
8114 ENABLE_ASH_JOB_CONTROL)
8115 #define EXECCMD (builtintab + 7 + \
8116 2 * ENABLE_ASH_BUILTIN_TEST + \
8117 ENABLE_ASH_ALIAS + \
8118 ENABLE_ASH_JOB_CONTROL + \
8119 ENABLE_ASH_CMDCMD + \
8120 ENABLE_ASH_BUILTIN_ECHO)
8123 * Search the table of builtin commands.
8125 static struct builtincmd *
8126 find_builtin(const char *name)
8128 struct builtincmd *bp;
8131 name, builtintab, ARRAY_SIZE(builtintab), sizeof(builtintab[0]),
8138 * Execute a simple command.
8140 static int back_exitstatus; /* exit status of backquoted command */
8142 isassignment(const char *p)
8144 const char *q = endofname(p);
8150 bltincmd(int argc, char **argv)
8152 /* Preserve exitstatus of a previous possible redirection
8153 * as POSIX mandates */
8154 return back_exitstatus;
8157 evalcommand(union node *cmd, int flags)
8159 static const struct builtincmd bltin = {
8162 struct stackmark smark;
8164 struct arglist arglist;
8165 struct arglist varlist;
8168 const struct strlist *sp;
8169 struct cmdentry cmdentry;
8177 struct builtincmd *bcmd;
8178 int pseudovarflag = 0;
8180 /* First expand the arguments. */
8181 TRACE(("evalcommand(0x%lx, %d) called\n", (long)cmd, flags));
8182 setstackmark(&smark);
8183 back_exitstatus = 0;
8185 cmdentry.cmdtype = CMDBUILTIN;
8186 cmdentry.u.cmd = &bltin;
8187 varlist.lastp = &varlist.list;
8188 *varlist.lastp = NULL;
8189 arglist.lastp = &arglist.list;
8190 *arglist.lastp = NULL;
8193 if (cmd->ncmd.args) {
8194 bcmd = find_builtin(cmd->ncmd.args->narg.text);
8195 pseudovarflag = bcmd && IS_BUILTIN_ASSIGN(bcmd);
8198 for (argp = cmd->ncmd.args; argp; argp = argp->narg.next) {
8199 struct strlist **spp;
8201 spp = arglist.lastp;
8202 if (pseudovarflag && isassignment(argp->narg.text))
8203 expandarg(argp, &arglist, EXP_VARTILDE);
8205 expandarg(argp, &arglist, EXP_FULL | EXP_TILDE);
8207 for (sp = *spp; sp; sp = sp->next)
8211 argv = nargv = stalloc(sizeof(char *) * (argc + 1));
8212 for (sp = arglist.list; sp; sp = sp->next) {
8213 TRACE(("evalcommand arg: %s\n", sp->text));
8214 *nargv++ = sp->text;
8219 if (iflag && funcnest == 0 && argc > 0)
8220 lastarg = nargv[-1];
8223 expredir(cmd->ncmd.redirect);
8224 status = redirectsafe(cmd->ncmd.redirect, REDIR_PUSH | REDIR_SAVEFD2);
8227 for (argp = cmd->ncmd.assign; argp; argp = argp->narg.next) {
8228 struct strlist **spp;
8231 spp = varlist.lastp;
8232 expandarg(argp, &varlist, EXP_VARTILDE);
8235 * Modify the command lookup path, if a PATH= assignment
8239 if (varequal(p, path))
8243 /* Print the command if xflag is set. */
8246 const char *p = " %s";
8249 fdprintf(preverrout_fd, p, expandstr(ps4val()));
8252 for (n = 0; n < 2; n++) {
8254 fdprintf(preverrout_fd, p, sp->text);
8262 full_write(preverrout_fd, "\n", 1);
8268 /* Now locate the command. */
8270 const char *oldpath;
8271 int cmd_flag = DO_ERR;
8276 find_command(argv[0], &cmdentry, cmd_flag, path);
8277 if (cmdentry.cmdtype == CMDUNKNOWN) {
8283 /* implement bltin and command here */
8284 if (cmdentry.cmdtype != CMDBUILTIN)
8287 spclbltin = IS_BUILTIN_SPECIAL(cmdentry.u.cmd);
8288 if (cmdentry.u.cmd == EXECCMD)
8290 #if ENABLE_ASH_CMDCMD
8291 if (cmdentry.u.cmd == COMMANDCMD) {
8293 nargv = parse_command_args(argv, &path);
8296 argc -= nargv - argv;
8298 cmd_flag |= DO_NOFUNC;
8306 /* We have a redirection error. */
8308 raise_exception(EXERROR);
8310 exitstatus = status;
8314 /* Execute the command. */
8315 switch (cmdentry.cmdtype) {
8317 /* Fork off a child process if necessary. */
8318 if (!(flags & EV_EXIT) || trap[0]) {
8320 jp = makejob(cmd, 1);
8321 if (forkshell(jp, cmd, FORK_FG) != 0) {
8322 exitstatus = waitforjob(jp);
8328 listsetvar(varlist.list, VEXPORT|VSTACK);
8329 shellexec(argv, path, cmdentry.u.index);
8333 cmdenviron = varlist.list;
8335 struct strlist *list = cmdenviron;
8337 if (spclbltin > 0 || argc == 0) {
8339 if (cmd_is_exec && argc > 1)
8342 listsetvar(list, i);
8344 if (evalbltin(cmdentry.u.cmd, argc, argv)) {
8359 exit_status = j + 128;
8360 exitstatus = exit_status;
8362 if (i == EXINT || spclbltin > 0) {
8364 longjmp(exception_handler->loc, 1);
8371 listsetvar(varlist.list, 0);
8372 if (evalfun(cmdentry.u.func, argc, argv, flags))
8378 popredir(cmd_is_exec);
8380 /* dsl: I think this is intended to be used to support
8381 * '_' in 'vi' command mode during line editing...
8382 * However I implemented that within libedit itself.
8384 setvar("_", lastarg, 0);
8385 popstackmark(&smark);
8389 evalbltin(const struct builtincmd *cmd, int argc, char **argv)
8391 char *volatile savecmdname;
8392 struct jmploc *volatile savehandler;
8393 struct jmploc jmploc;
8396 savecmdname = commandname;
8397 i = setjmp(jmploc.loc);
8400 savehandler = exception_handler;
8401 exception_handler = &jmploc;
8402 commandname = argv[0];
8404 optptr = NULL; /* initialize nextopt */
8405 exitstatus = (*cmd->builtin)(argc, argv);
8406 flush_stdout_stderr();
8408 exitstatus |= ferror(stdout);
8410 commandname = savecmdname;
8412 exception_handler = savehandler;
8418 goodname(const char *p)
8420 return !*endofname(p);
8425 * Search for a command. This is called before we fork so that the
8426 * location of the command will be available in the parent as well as
8427 * the child. The check for "goodname" is an overly conservative
8428 * check that the name will not be subject to expansion.
8431 prehash(union node *n)
8433 struct cmdentry entry;
8435 if (n->type == NCMD && n->ncmd.args && goodname(n->ncmd.args->narg.text))
8436 find_command(n->ncmd.args->narg.text, &entry, 0, pathval());
8440 /* ============ Builtin commands
8442 * Builtin commands whose functions are closely tied to evaluation
8443 * are implemented here.
8447 * Handle break and continue commands. Break, continue, and return are
8448 * all handled by setting the evalskip flag. The evaluation routines
8449 * above all check this flag, and if it is set they start skipping
8450 * commands rather than executing them. The variable skipcount is
8451 * the number of loops to break/continue, or the number of function
8452 * levels to return. (The latter is always 1.) It should probably
8453 * be an error to break out of more loops than exist, but it isn't
8454 * in the standard shell so we don't make it one here.
8457 breakcmd(int argc, char **argv)
8459 int n = argc > 1 ? number(argv[1]) : 1;
8462 ash_msg_and_raise_error(illnum, argv[1]);
8466 evalskip = (**argv == 'c') ? SKIPCONT : SKIPBREAK;
8473 /* ============ input.c
8475 * This implements the input routines used by the parser.
8478 #define EOF_NLEFT -99 /* value of parsenleft when EOF pushed back */
8481 INPUT_PUSH_FILE = 1,
8482 INPUT_NOFILE_OK = 2,
8485 static int plinno = 1; /* input line number */
8486 /* number of characters left in input buffer */
8487 static int parsenleft; /* copy of parsefile->nleft */
8488 static int parselleft; /* copy of parsefile->lleft */
8489 /* next character in input buffer */
8490 static char *parsenextc; /* copy of parsefile->nextc */
8492 static int checkkwd;
8493 /* values of checkkwd variable */
8494 #define CHKALIAS 0x1
8501 struct strpush *sp = parsefile->strpush;
8504 #if ENABLE_ASH_ALIAS
8506 if (parsenextc[-1] == ' ' || parsenextc[-1] == '\t') {
8507 checkkwd |= CHKALIAS;
8509 if (sp->string != sp->ap->val) {
8512 sp->ap->flag &= ~ALIASINUSE;
8513 if (sp->ap->flag & ALIASDEAD) {
8514 unalias(sp->ap->name);
8518 parsenextc = sp->prevstring;
8519 parsenleft = sp->prevnleft;
8520 /*dprintf("*** calling popstring: restoring to '%s'\n", parsenextc);*/
8521 parsefile->strpush = sp->prev;
8522 if (sp != &(parsefile->basestrpush))
8531 char *buf = parsefile->buf;
8535 #if ENABLE_FEATURE_EDITING
8536 if (!iflag || parsefile->fd)
8537 nr = safe_read(parsefile->fd, buf, BUFSIZ - 1);
8539 #if ENABLE_FEATURE_TAB_COMPLETION
8540 line_input_state->path_lookup = pathval();
8542 nr = read_line_input(cmdedit_prompt, buf, BUFSIZ, line_input_state);
8544 /* Ctrl+C pressed */
8553 if (nr < 0 && errno == 0) {
8554 /* Ctrl+D presend */
8559 nr = safe_read(parsefile->fd, buf, BUFSIZ - 1);
8563 if (parsefile->fd == 0 && errno == EWOULDBLOCK) {
8564 int flags = fcntl(0, F_GETFL);
8565 if (flags >= 0 && flags & O_NONBLOCK) {
8566 flags &=~ O_NONBLOCK;
8567 if (fcntl(0, F_SETFL, flags) >= 0) {
8568 out2str("sh: turning off NDELAY mode\n");
8578 * Refill the input buffer and return the next input character:
8580 * 1) If a string was pushed back on the input, pop it;
8581 * 2) If an EOF was pushed back (parsenleft == EOF_NLEFT) or we are reading
8582 * from a string so we can't refill the buffer, return EOF.
8583 * 3) If the is more stuff in this buffer, use it else call read to fill it.
8584 * 4) Process input up to the next newline, deleting nul characters.
8593 while (parsefile->strpush) {
8594 #if ENABLE_ASH_ALIAS
8595 if (parsenleft == -1 && parsefile->strpush->ap &&
8596 parsenextc[-1] != ' ' && parsenextc[-1] != '\t') {
8601 if (--parsenleft >= 0)
8602 return signed_char2int(*parsenextc++);
8604 if (parsenleft == EOF_NLEFT || parsefile->buf == NULL)
8606 flush_stdout_stderr();
8613 parselleft = parsenleft = EOF_NLEFT;
8620 /* delete nul characters */
8628 memmove(q, q + 1, more);
8632 parsenleft = q - parsenextc - 1;
8638 parsenleft = q - parsenextc - 1;
8650 out2str(parsenextc);
8655 return signed_char2int(*parsenextc++);
8658 #define pgetc_as_macro() (--parsenleft >= 0? signed_char2int(*parsenextc++) : preadbuffer())
8662 return pgetc_as_macro();
8665 #if ENABLE_ASH_OPTIMIZE_FOR_SIZE
8666 #define pgetc_macro() pgetc()
8668 #define pgetc_macro() pgetc_as_macro()
8672 * Same as pgetc(), but ignores PEOA.
8674 #if ENABLE_ASH_ALIAS
8682 } while (c == PEOA);
8689 return pgetc_macro();
8694 * Read a line from the script.
8697 pfgets(char *line, int len)
8703 while (--nleft > 0) {
8719 * Undo the last call to pgetc. Only one character may be pushed back.
8720 * PEOF may be pushed back.
8730 * Push a string back onto the input at this current parsefile level.
8731 * We handle aliases this way.
8734 pushstring(char *s, void *ap)
8741 /*dprintf("*** calling pushstring: %s, %d\n", s, len);*/
8742 if (parsefile->strpush) {
8743 sp = ckmalloc(sizeof(struct strpush));
8744 sp->prev = parsefile->strpush;
8745 parsefile->strpush = sp;
8747 sp = parsefile->strpush = &(parsefile->basestrpush);
8748 sp->prevstring = parsenextc;
8749 sp->prevnleft = parsenleft;
8750 #if ENABLE_ASH_ALIAS
8751 sp->ap = (struct alias *)ap;
8753 ((struct alias *)ap)->flag |= ALIASINUSE;
8763 * To handle the "." command, a stack of input files is used. Pushfile
8764 * adds a new entry to the stack and popfile restores the previous level.
8769 struct parsefile *pf;
8771 parsefile->nleft = parsenleft;
8772 parsefile->lleft = parselleft;
8773 parsefile->nextc = parsenextc;
8774 parsefile->linno = plinno;
8775 pf = ckmalloc(sizeof(*pf));
8776 pf->prev = parsefile;
8779 pf->basestrpush.prev = NULL;
8786 struct parsefile *pf = parsefile;
8794 parsefile = pf->prev;
8796 parsenleft = parsefile->nleft;
8797 parselleft = parsefile->lleft;
8798 parsenextc = parsefile->nextc;
8799 plinno = parsefile->linno;
8804 * Return to top level.
8809 while (parsefile != &basepf)
8814 * Close the file(s) that the shell is reading commands from. Called
8815 * after a fork is done.
8821 if (parsefile->fd > 0) {
8822 close(parsefile->fd);
8828 * Like setinputfile, but takes an open file descriptor. Call this with
8832 setinputfd(int fd, int push)
8834 close_on_exec_on(fd);
8840 if (parsefile->buf == NULL)
8841 parsefile->buf = ckmalloc(IBUFSIZ);
8842 parselleft = parsenleft = 0;
8847 * Set the input to take input from a file. If push is set, push the
8848 * old input onto the stack first.
8851 setinputfile(const char *fname, int flags)
8857 fd = open(fname, O_RDONLY);
8859 if (flags & INPUT_NOFILE_OK)
8861 ash_msg_and_raise_error("can't open %s", fname);
8864 fd2 = copyfd(fd, 10);
8867 ash_msg_and_raise_error("out of file descriptors");
8870 setinputfd(fd, flags & INPUT_PUSH_FILE);
8877 * Like setinputfile, but takes input from a string.
8880 setinputstring(char *string)
8884 parsenextc = string;
8885 parsenleft = strlen(string);
8886 parsefile->buf = NULL;
8892 /* ============ mail.c
8894 * Routines to check for mail.
8899 #define MAXMBOXES 10
8901 /* times of mailboxes */
8902 static time_t mailtime[MAXMBOXES];
8903 /* Set if MAIL or MAILPATH is changed. */
8904 static smallint mail_var_path_changed;
8907 * Print appropriate message(s) if mail has arrived.
8908 * If mail_var_path_changed is set,
8909 * then the value of MAIL has mail_var_path_changed,
8910 * so we just update the values.
8919 struct stackmark smark;
8922 setstackmark(&smark);
8923 mpath = mpathset() ? mpathval() : mailval();
8924 for (mtp = mailtime; mtp < mailtime + MAXMBOXES; mtp++) {
8925 p = padvance(&mpath, nullstr);
8930 for (q = p; *q; q++);
8935 q[-1] = '\0'; /* delete trailing '/' */
8936 if (stat(p, &statb) < 0) {
8940 if (!mail_var_path_changed && statb.st_mtime != *mtp) {
8943 pathopt ? pathopt : "you have mail"
8946 *mtp = statb.st_mtime;
8948 mail_var_path_changed = 0;
8949 popstackmark(&smark);
8953 changemail(const char *val)
8955 mail_var_path_changed = 1;
8958 #endif /* ASH_MAIL */
8961 /* ============ ??? */
8964 * Set the shell parameters.
8967 setparam(char **argv)
8973 for (nparam = 0; argv[nparam]; nparam++);
8974 ap = newparam = ckmalloc((nparam + 1) * sizeof(*ap));
8976 *ap++ = ckstrdup(*argv++);
8979 freeparam(&shellparam);
8980 shellparam.malloc = 1;
8981 shellparam.nparam = nparam;
8982 shellparam.p = newparam;
8983 #if ENABLE_ASH_GETOPTS
8984 shellparam.optind = 1;
8985 shellparam.optoff = -1;
8990 * Process shell options. The global variable argptr contains a pointer
8991 * to the argument list; we advance it past the options.
8994 minus_o(char *name, int val)
8999 for (i = 0; i < NOPTS; i++) {
9000 if (strcmp(name, optnames(i)) == 0) {
9005 ash_msg_and_raise_error("illegal option -o %s", name);
9007 out1str("Current option settings\n");
9008 for (i = 0; i < NOPTS; i++)
9009 out1fmt("%-16s%s\n", optnames(i),
9010 optlist[i] ? "on" : "off");
9013 setoption(int flag, int val)
9017 for (i = 0; i < NOPTS; i++) {
9018 if (optletters(i) == flag) {
9023 ash_msg_and_raise_error("illegal option -%c", flag);
9027 options(int cmdline)
9035 while ((p = *argptr) != NULL) {
9037 if (c != '-' && c != '+')
9040 val = 0; /* val = 0 if c == '+' */
9043 if (p[0] == '\0' || LONE_DASH(p)) {
9045 /* "-" means turn off -x and -v */
9048 /* "--" means reset params */
9049 else if (*argptr == NULL)
9052 break; /* "-" or "--" terminates options */
9055 /* first char was + or - */
9056 while ((c = *p++) != '\0') {
9057 /* bash 3.2 indeed handles -c CMD and +c CMD the same */
9058 if (c == 'c' && cmdline) {
9059 minusc = p; /* command is after shell args */
9060 } else if (c == 'o') {
9061 minus_o(*argptr, val);
9064 } else if (cmdline && (c == 'l')) { /* -l or +l == --login */
9066 /* bash does not accept +-login, we also won't */
9067 } else if (cmdline && val && (c == '-')) { /* long options */
9068 if (strcmp(p, "login") == 0)
9079 * The shift builtin command.
9082 shiftcmd(int argc, char **argv)
9089 n = number(argv[1]);
9090 if (n > shellparam.nparam)
9091 ash_msg_and_raise_error("can't shift that many");
9093 shellparam.nparam -= n;
9094 for (ap1 = shellparam.p; --n >= 0; ap1++) {
9095 if (shellparam.malloc)
9099 while ((*ap2++ = *ap1++) != NULL);
9100 #if ENABLE_ASH_GETOPTS
9101 shellparam.optind = 1;
9102 shellparam.optoff = -1;
9109 * POSIX requires that 'set' (but not export or readonly) output the
9110 * variables in lexicographic order - by the locale's collating order (sigh).
9111 * Maybe we could keep them in an ordered balanced binary tree
9112 * instead of hashed lists.
9113 * For now just roll 'em through qsort for printing...
9116 showvars(const char *sep_prefix, int on, int off)
9121 ep = listvars(on, off, &epend);
9122 qsort(ep, epend - ep, sizeof(char *), vpcmp);
9124 sep = *sep_prefix ? " " : sep_prefix;
9126 for (; ep < epend; ep++) {
9130 p = strchrnul(*ep, '=');
9133 q = single_quote(++p);
9134 out1fmt("%s%s%.*s%s\n", sep_prefix, sep, (int)(p - *ep), *ep, q);
9140 * The set command builtin.
9143 setcmd(int argc, char **argv)
9146 return showvars(nullstr, 0, VUNSET);
9150 if (*argptr != NULL) {
9157 #if ENABLE_ASH_RANDOM_SUPPORT
9158 /* Roughly copied from bash.. */
9160 change_random(const char *value)
9162 if (value == NULL) {
9163 /* "get", generate */
9166 rseed = rseed * 1103515245 + 12345;
9167 sprintf(buf, "%d", (unsigned int)((rseed & 32767)));
9168 /* set without recursion */
9169 setvar(vrandom.text, buf, VNOFUNC);
9170 vrandom.flags &= ~VNOFUNC;
9173 rseed = strtoul(value, (char **)NULL, 10);
9178 #if ENABLE_ASH_GETOPTS
9180 getopts(char *optstr, char *optvar, char **optfirst, int *param_optind, int *optoff)
9189 if (*param_optind < 1)
9191 optnext = optfirst + *param_optind - 1;
9193 if (*param_optind <= 1 || *optoff < 0 || strlen(optnext[-1]) < *optoff)
9196 p = optnext[-1] + *optoff;
9197 if (p == NULL || *p == '\0') {
9198 /* Current word is done, advance */
9200 if (p == NULL || *p != '-' || *++p == '\0') {
9207 if (LONE_DASH(p)) /* check for "--" */
9212 for (q = optstr; *q != c; ) {
9214 if (optstr[0] == ':') {
9217 err |= setvarsafe("OPTARG", s, 0);
9219 fprintf(stderr, "Illegal option -%c\n", c);
9230 if (*p == '\0' && (p = *optnext) == NULL) {
9231 if (optstr[0] == ':') {
9234 err |= setvarsafe("OPTARG", s, 0);
9237 fprintf(stderr, "No arg for -%c option\n", c);
9246 err |= setvarsafe("OPTARG", p, 0);
9249 err |= setvarsafe("OPTARG", nullstr, 0);
9251 *optoff = p ? p - *(optnext - 1) : -1;
9252 *param_optind = optnext - optfirst + 1;
9253 fmtstr(s, sizeof(s), "%d", *param_optind);
9254 err |= setvarsafe("OPTIND", s, VNOFUNC);
9257 err |= setvarsafe(optvar, s, 0);
9261 flush_stdout_stderr();
9262 raise_exception(EXERROR);
9268 * The getopts builtin. Shellparam.optnext points to the next argument
9269 * to be processed. Shellparam.optptr points to the next character to
9270 * be processed in the current argument. If shellparam.optnext is NULL,
9271 * then it's the first time getopts has been called.
9274 getoptscmd(int argc, char **argv)
9279 ash_msg_and_raise_error("usage: getopts optstring var [arg]");
9281 optbase = shellparam.p;
9282 if (shellparam.optind > shellparam.nparam + 1) {
9283 shellparam.optind = 1;
9284 shellparam.optoff = -1;
9288 if (shellparam.optind > argc - 2) {
9289 shellparam.optind = 1;
9290 shellparam.optoff = -1;
9294 return getopts(argv[1], argv[2], optbase, &shellparam.optind,
9295 &shellparam.optoff);
9297 #endif /* ASH_GETOPTS */
9300 /* ============ Shell parser */
9303 * NEOF is returned by parsecmd when it encounters an end of file. It
9304 * must be distinct from NULL, so we use the address of a variable that
9305 * happens to be handy.
9307 static smallint tokpushback; /* last token pushed back */
9308 #define NEOF ((union node *)&tokpushback)
9309 static smallint parsebackquote; /* nonzero if we are inside backquotes */
9310 static int lasttoken; /* last token read */
9311 static char *wordtext; /* text of last word returned by readtoken */
9312 static struct nodelist *backquotelist;
9313 static union node *redirnode;
9314 static struct heredoc *heredoc;
9315 static smallint quoteflag; /* set if (part of) last token was quoted */
9317 static void raise_error_syntax(const char *) ATTRIBUTE_NORETURN;
9319 raise_error_syntax(const char *msg)
9321 ash_msg_and_raise_error("syntax error: %s", msg);
9326 * Called when an unexpected token is read during the parse. The argument
9327 * is the token that is expected, or -1 if more than one type of token can
9328 * occur at this point.
9330 static void raise_error_unexpected_syntax(int) ATTRIBUTE_NORETURN;
9332 raise_error_unexpected_syntax(int token)
9337 l = sprintf(msg, "%s unexpected", tokname(lasttoken));
9339 sprintf(msg + l, " (expecting %s)", tokname(token));
9340 raise_error_syntax(msg);
9344 #define EOFMARKLEN 79
9347 struct heredoc *next; /* next here document in list */
9348 union node *here; /* redirection node */
9349 char *eofmark; /* string indicating end of input */
9350 int striptabs; /* if set, strip leading tabs */
9353 static struct heredoc *heredoclist; /* list of here documents to read */
9355 /* parsing is heavily cross-recursive, need these forward decls */
9356 static union node *andor(void);
9357 static union node *pipeline(void);
9358 static union node *parse_command(void);
9359 static void parseheredoc(void);
9360 static char peektoken(void);
9361 static int readtoken(void);
9366 union node *n1, *n2, *n3;
9369 checkkwd = CHKNL | CHKKWD | CHKALIAS;
9370 if (nlflag == 2 && peektoken())
9376 if (tok == TBACKGND) {
9377 if (n2->type == NPIPE) {
9378 n2->npipe.backgnd = 1;
9380 if (n2->type != NREDIR) {
9381 n3 = stalloc(sizeof(struct nredir));
9383 n3->nredir.redirect = NULL;
9386 n2->type = NBACKGND;
9392 n3 = stalloc(sizeof(struct nbinary));
9394 n3->nbinary.ch1 = n1;
9395 n3->nbinary.ch2 = n2;
9411 checkkwd = CHKNL | CHKKWD | CHKALIAS;
9419 pungetc(); /* push back EOF on input */
9423 raise_error_unexpected_syntax(-1);
9433 union node *n1, *n2, *n3;
9441 } else if (t == TOR) {
9447 checkkwd = CHKNL | CHKKWD | CHKALIAS;
9449 n3 = stalloc(sizeof(struct nbinary));
9451 n3->nbinary.ch1 = n1;
9452 n3->nbinary.ch2 = n2;
9460 union node *n1, *n2, *pipenode;
9461 struct nodelist *lp, *prev;
9465 TRACE(("pipeline: entered\n"));
9466 if (readtoken() == TNOT) {
9468 checkkwd = CHKKWD | CHKALIAS;
9471 n1 = parse_command();
9472 if (readtoken() == TPIPE) {
9473 pipenode = stalloc(sizeof(struct npipe));
9474 pipenode->type = NPIPE;
9475 pipenode->npipe.backgnd = 0;
9476 lp = stalloc(sizeof(struct nodelist));
9477 pipenode->npipe.cmdlist = lp;
9481 lp = stalloc(sizeof(struct nodelist));
9482 checkkwd = CHKNL | CHKKWD | CHKALIAS;
9483 lp->n = parse_command();
9485 } while (readtoken() == TPIPE);
9491 n2 = stalloc(sizeof(struct nnot));
9504 n = stalloc(sizeof(struct narg));
9506 n->narg.next = NULL;
9507 n->narg.text = wordtext;
9508 n->narg.backquote = backquotelist;
9513 fixredir(union node *n, const char *text, int err)
9515 TRACE(("Fix redir %s %d\n", text, err));
9517 n->ndup.vname = NULL;
9519 if (isdigit(text[0]) && text[1] == '\0')
9520 n->ndup.dupfd = text[0] - '0';
9521 else if (LONE_DASH(text))
9525 raise_error_syntax("Bad fd number");
9526 n->ndup.vname = makename();
9531 * Returns true if the text contains nothing to expand (no dollar signs
9535 noexpand(char *text)
9541 while ((c = *p++) != '\0') {
9542 if (c == CTLQUOTEMARK)
9546 else if (SIT(c, BASESYNTAX) == CCTL)
9555 union node *n = redirnode;
9557 if (readtoken() != TWORD)
9558 raise_error_unexpected_syntax(-1);
9559 if (n->type == NHERE) {
9560 struct heredoc *here = heredoc;
9566 TRACE(("Here document %d\n", n->type));
9567 if (!noexpand(wordtext) || (i = strlen(wordtext)) == 0 || i > EOFMARKLEN)
9568 raise_error_syntax("Illegal eof marker for << redirection");
9569 rmescapes(wordtext);
9570 here->eofmark = wordtext;
9572 if (heredoclist == NULL)
9575 for (p = heredoclist; p->next; p = p->next);
9578 } else if (n->type == NTOFD || n->type == NFROMFD) {
9579 fixredir(n, wordtext, 0);
9581 n->nfile.fname = makename();
9588 union node *args, **app;
9589 union node *n = NULL;
9590 union node *vars, **vpp;
9591 union node **rpp, *redir;
9601 savecheckkwd = CHKALIAS;
9603 checkkwd = savecheckkwd;
9604 switch (readtoken()) {
9606 n = stalloc(sizeof(struct narg));
9608 n->narg.text = wordtext;
9609 n->narg.backquote = backquotelist;
9610 if (savecheckkwd && isassignment(wordtext)) {
9612 vpp = &n->narg.next;
9615 app = &n->narg.next;
9620 *rpp = n = redirnode;
9621 rpp = &n->nfile.next;
9622 parsefname(); /* read name of redirection file */
9625 if (args && app == &args->narg.next
9628 struct builtincmd *bcmd;
9631 /* We have a function */
9632 if (readtoken() != TRP)
9633 raise_error_unexpected_syntax(TRP);
9634 name = n->narg.text;
9636 || ((bcmd = find_builtin(name)) && IS_BUILTIN_SPECIAL(bcmd))
9638 raise_error_syntax("Bad function name");
9641 checkkwd = CHKNL | CHKKWD | CHKALIAS;
9642 n->narg.next = parse_command();
9655 n = stalloc(sizeof(struct ncmd));
9657 n->ncmd.args = args;
9658 n->ncmd.assign = vars;
9659 n->ncmd.redirect = redir;
9666 union node *n1, *n2;
9667 union node *ap, **app;
9668 union node *cp, **cpp;
9669 union node *redir, **rpp;
9676 switch (readtoken()) {
9678 raise_error_unexpected_syntax(-1);
9681 n1 = stalloc(sizeof(struct nif));
9683 n1->nif.test = list(0);
9684 if (readtoken() != TTHEN)
9685 raise_error_unexpected_syntax(TTHEN);
9686 n1->nif.ifpart = list(0);
9688 while (readtoken() == TELIF) {
9689 n2->nif.elsepart = stalloc(sizeof(struct nif));
9690 n2 = n2->nif.elsepart;
9692 n2->nif.test = list(0);
9693 if (readtoken() != TTHEN)
9694 raise_error_unexpected_syntax(TTHEN);
9695 n2->nif.ifpart = list(0);
9697 if (lasttoken == TELSE)
9698 n2->nif.elsepart = list(0);
9700 n2->nif.elsepart = NULL;
9708 n1 = stalloc(sizeof(struct nbinary));
9709 n1->type = (lasttoken == TWHILE) ? NWHILE : NUNTIL;
9710 n1->nbinary.ch1 = list(0);
9713 TRACE(("expecting DO got %s %s\n", tokname(got),
9714 got == TWORD ? wordtext : ""));
9715 raise_error_unexpected_syntax(TDO);
9717 n1->nbinary.ch2 = list(0);
9722 if (readtoken() != TWORD || quoteflag || ! goodname(wordtext))
9723 raise_error_syntax("Bad for loop variable");
9724 n1 = stalloc(sizeof(struct nfor));
9726 n1->nfor.var = wordtext;
9727 checkkwd = CHKKWD | CHKALIAS;
9728 if (readtoken() == TIN) {
9730 while (readtoken() == TWORD) {
9731 n2 = stalloc(sizeof(struct narg));
9733 n2->narg.text = wordtext;
9734 n2->narg.backquote = backquotelist;
9736 app = &n2->narg.next;
9740 if (lasttoken != TNL && lasttoken != TSEMI)
9741 raise_error_unexpected_syntax(-1);
9743 n2 = stalloc(sizeof(struct narg));
9745 n2->narg.text = (char *)dolatstr;
9746 n2->narg.backquote = NULL;
9747 n2->narg.next = NULL;
9750 * Newline or semicolon here is optional (but note
9751 * that the original Bourne shell only allowed NL).
9753 if (lasttoken != TNL && lasttoken != TSEMI)
9756 checkkwd = CHKNL | CHKKWD | CHKALIAS;
9757 if (readtoken() != TDO)
9758 raise_error_unexpected_syntax(TDO);
9759 n1->nfor.body = list(0);
9763 n1 = stalloc(sizeof(struct ncase));
9765 if (readtoken() != TWORD)
9766 raise_error_unexpected_syntax(TWORD);
9767 n1->ncase.expr = n2 = stalloc(sizeof(struct narg));
9769 n2->narg.text = wordtext;
9770 n2->narg.backquote = backquotelist;
9771 n2->narg.next = NULL;
9773 checkkwd = CHKKWD | CHKALIAS;
9774 } while (readtoken() == TNL);
9775 if (lasttoken != TIN)
9776 raise_error_unexpected_syntax(TIN);
9777 cpp = &n1->ncase.cases;
9779 checkkwd = CHKNL | CHKKWD;
9781 while (t != TESAC) {
9782 if (lasttoken == TLP)
9784 *cpp = cp = stalloc(sizeof(struct nclist));
9786 app = &cp->nclist.pattern;
9788 *app = ap = stalloc(sizeof(struct narg));
9790 ap->narg.text = wordtext;
9791 ap->narg.backquote = backquotelist;
9792 if (readtoken() != TPIPE)
9794 app = &ap->narg.next;
9797 ap->narg.next = NULL;
9798 if (lasttoken != TRP)
9799 raise_error_unexpected_syntax(TRP);
9800 cp->nclist.body = list(2);
9802 cpp = &cp->nclist.next;
9804 checkkwd = CHKNL | CHKKWD;
9808 raise_error_unexpected_syntax(TENDCASE);
9815 n1 = stalloc(sizeof(struct nredir));
9816 n1->type = NSUBSHELL;
9817 n1->nredir.n = list(0);
9818 n1->nredir.redirect = NULL;
9831 if (readtoken() != t)
9832 raise_error_unexpected_syntax(t);
9835 /* Now check for redirection which may follow command */
9836 checkkwd = CHKKWD | CHKALIAS;
9838 while (readtoken() == TREDIR) {
9839 *rpp = n2 = redirnode;
9840 rpp = &n2->nfile.next;
9846 if (n1->type != NSUBSHELL) {
9847 n2 = stalloc(sizeof(struct nredir));
9852 n1->nredir.redirect = redir;
9858 * If eofmark is NULL, read a word or a redirection symbol. If eofmark
9859 * is not NULL, read a here document. In the latter case, eofmark is the
9860 * word which marks the end of the document and striptabs is true if
9861 * leading tabs should be stripped from the document. The argument firstc
9862 * is the first character of the input token or document.
9864 * Because C does not have internal subroutines, I have simulated them
9865 * using goto's to implement the subroutine linkage. The following macros
9866 * will run code that appears at the end of readtoken1.
9869 #define CHECKEND() {goto checkend; checkend_return:;}
9870 #define PARSEREDIR() {goto parseredir; parseredir_return:;}
9871 #define PARSESUB() {goto parsesub; parsesub_return:;}
9872 #define PARSEBACKQOLD() {oldstyle = 1; goto parsebackq; parsebackq_oldreturn:;}
9873 #define PARSEBACKQNEW() {oldstyle = 0; goto parsebackq; parsebackq_newreturn:;}
9874 #define PARSEARITH() {goto parsearith; parsearith_return:;}
9877 readtoken1(int firstc, int syntax, char *eofmark, int striptabs)
9879 /* NB: syntax parameter fits into smallint */
9883 char line[EOFMARKLEN + 1];
9884 struct nodelist *bqlist;
9888 smallint prevsyntax; /* syntax before arithmetic */
9889 #if ENABLE_ASH_EXPAND_PRMT
9890 smallint pssyntax; /* we are expanding a prompt string */
9892 int varnest; /* levels of variables expansion */
9893 int arinest; /* levels of arithmetic expansion */
9894 int parenlevel; /* levels of parens in arithmetic */
9895 int dqvarnest; /* levels of variables expansion within double quotes */
9898 /* Avoid longjmp clobbering */
9910 startlinno = plinno;
9915 #if ENABLE_ASH_EXPAND_PRMT
9916 pssyntax = (syntax == PSSYNTAX);
9920 dblquote = (syntax == DQSYNTAX);
9927 loop: { /* for each line, until end of word */
9928 CHECKEND(); /* set c to PEOF if at end of here document */
9929 for (;;) { /* until end of line or end of word */
9930 CHECKSTRSPACE(4, out); /* permit 4 calls to USTPUTC */
9931 switch (SIT(c, syntax)) {
9932 case CNL: /* '\n' */
9933 if (syntax == BASESYNTAX)
9934 goto endword; /* exit outer loop */
9940 goto loop; /* continue outer loop */
9945 if (eofmark == NULL || dblquote)
9946 USTPUTC(CTLESC, out);
9949 case CBACK: /* backslash */
9952 USTPUTC(CTLESC, out);
9955 } else if (c == '\n') {
9959 #if ENABLE_ASH_EXPAND_PRMT
9960 if (c == '$' && pssyntax) {
9961 USTPUTC(CTLESC, out);
9966 c != '\\' && c != '`' &&
9971 USTPUTC(CTLESC, out);
9974 if (SIT(c, SQSYNTAX) == CCTL)
9975 USTPUTC(CTLESC, out);
9983 if (eofmark == NULL) {
9984 USTPUTC(CTLQUOTEMARK, out);
9992 if (eofmark != NULL && arinest == 0
9997 if (dqvarnest == 0) {
9998 syntax = BASESYNTAX;
10005 case CVAR: /* '$' */
10006 PARSESUB(); /* parse substitution */
10008 case CENDVAR: /* '}' */
10011 if (dqvarnest > 0) {
10014 USTPUTC(CTLENDVAR, out);
10019 #if ENABLE_ASH_MATH_SUPPORT
10020 case CLP: /* '(' in arithmetic */
10024 case CRP: /* ')' in arithmetic */
10025 if (parenlevel > 0) {
10029 if (pgetc() == ')') {
10030 if (--arinest == 0) {
10031 USTPUTC(CTLENDARI, out);
10032 syntax = prevsyntax;
10033 dblquote = (syntax == DQSYNTAX);
10038 * unbalanced parens
10039 * (don't 2nd guess - no error)
10047 case CBQUOTE: /* '`' */
10051 goto endword; /* exit outer loop */
10056 goto endword; /* exit outer loop */
10057 #if ENABLE_ASH_ALIAS
10067 #if ENABLE_ASH_MATH_SUPPORT
10068 if (syntax == ARISYNTAX)
10069 raise_error_syntax("Missing '))'");
10071 if (syntax != BASESYNTAX && !parsebackquote && eofmark == NULL)
10072 raise_error_syntax("Unterminated quoted string");
10073 if (varnest != 0) {
10074 startlinno = plinno;
10076 raise_error_syntax("Missing '}'");
10078 USTPUTC('\0', out);
10079 len = out - (char *)stackblock();
10080 out = stackblock();
10081 if (eofmark == NULL) {
10082 if ((c == '>' || c == '<')
10085 && (*out == '\0' || isdigit(*out))) {
10087 return lasttoken = TREDIR;
10092 quoteflag = quotef;
10093 backquotelist = bqlist;
10094 grabstackblock(len);
10098 /* end of readtoken routine */
10101 * Check to see whether we are at the end of the here document. When this
10102 * is called, c is set to the first character of the next input line. If
10103 * we are at the end of the here document, this routine sets the c to PEOF.
10107 #if ENABLE_ASH_ALIAS
10113 while (c == '\t') {
10117 if (c == *eofmark) {
10118 if (pfgets(line, sizeof(line)) != NULL) {
10122 for (q = eofmark + 1; *q && *p == *q; p++, q++);
10123 if (*p == '\n' && *q == '\0') {
10126 needprompt = doprompt;
10128 pushstring(line, NULL);
10133 goto checkend_return;
10137 * Parse a redirection operator. The variable "out" points to a string
10138 * specifying the fd to be redirected. The variable "c" contains the
10139 * first character of the redirection operator.
10145 np = stalloc(sizeof(struct nfile));
10150 np->type = NAPPEND;
10152 np->type = NCLOBBER;
10159 } else { /* c == '<' */
10164 if (sizeof(struct nfile) != sizeof(struct nhere)) {
10165 np = stalloc(sizeof(struct nhere));
10169 heredoc = stalloc(sizeof(struct heredoc));
10170 heredoc->here = np;
10173 heredoc->striptabs = 1;
10175 heredoc->striptabs = 0;
10181 np->type = NFROMFD;
10185 np->type = NFROMTO;
10195 np->nfile.fd = fd - '0';
10197 goto parseredir_return;
10201 * Parse a substitution. At this point, we have read the dollar sign
10202 * and nothing else.
10205 /* is_special(c) evaluates to 1 for c in "!#$*-0123456789?@"; 0 otherwise
10206 * (assuming ascii char codes, as the original implementation did) */
10207 #define is_special(c) \
10208 ((((unsigned int)c) - 33 < 32) \
10209 && ((0xc1ff920dUL >> (((unsigned int)c) - 33)) & 1))
10215 static const char types[] ALIGN1 = "}-+?=";
10219 c <= PEOA_OR_PEOF ||
10220 (c != '(' && c != '{' && !is_name(c) && !is_special(c))
10224 } else if (c == '(') { /* $(command) or $((arith)) */
10225 if (pgetc() == '(') {
10226 #if ENABLE_ASH_MATH_SUPPORT
10229 raise_error_syntax("We unsupport $((arith))");
10236 USTPUTC(CTLVAR, out);
10237 typeloc = out - (char *)stackblock();
10238 USTPUTC(VSNORMAL, out);
10239 subtype = VSNORMAL;
10247 subtype = VSLENGTH;
10251 if (c > PEOA_OR_PEOF && is_name(c)) {
10255 } while (c > PEOA_OR_PEOF && is_in_name(c));
10256 } else if (isdigit(c)) {
10260 } while (isdigit(c));
10261 } else if (is_special(c)) {
10265 badsub: raise_error_syntax("Bad substitution");
10269 if (subtype == 0) {
10276 p = strchr(types, c);
10279 subtype = p - types + VSNORMAL;
10285 subtype = c == '#' ? VSTRIMLEFT :
10298 if (dblquote || arinest)
10300 *((char *)stackblock() + typeloc) = subtype | flags;
10301 if (subtype != VSNORMAL) {
10303 if (dblquote || arinest) {
10308 goto parsesub_return;
10312 * Called to parse command substitutions. Newstyle is set if the command
10313 * is enclosed inside $(...); nlpp is a pointer to the head of the linked
10314 * list of commands (passed by reference), and savelen is the number of
10315 * characters on the top of the stack which must be preserved.
10318 struct nodelist **nlpp;
10321 char *volatile str;
10322 struct jmploc jmploc;
10323 struct jmploc *volatile savehandler;
10325 smallint saveprompt = 0;
10328 (void) &saveprompt;
10330 savepbq = parsebackquote;
10331 if (setjmp(jmploc.loc)) {
10333 parsebackquote = 0;
10334 exception_handler = savehandler;
10335 longjmp(exception_handler->loc, 1);
10339 savelen = out - (char *)stackblock();
10341 str = ckmalloc(savelen);
10342 memcpy(str, stackblock(), savelen);
10344 savehandler = exception_handler;
10345 exception_handler = &jmploc;
10348 /* We must read until the closing backquote, giving special
10349 treatment to some slashes, and then push the string and
10350 reread it as input, interpreting it normally. */
10357 STARTSTACKSTR(pout);
10374 * If eating a newline, avoid putting
10375 * the newline into the new character
10376 * stream (via the STPUTC after the
10381 if (pc != '\\' && pc != '`' && pc != '$'
10382 && (!dblquote || pc != '"'))
10383 STPUTC('\\', pout);
10384 if (pc > PEOA_OR_PEOF) {
10390 #if ENABLE_ASH_ALIAS
10393 startlinno = plinno;
10394 raise_error_syntax("EOF in backquote substitution");
10398 needprompt = doprompt;
10407 STPUTC('\0', pout);
10408 psavelen = pout - (char *)stackblock();
10409 if (psavelen > 0) {
10410 pstr = grabstackstr(pout);
10411 setinputstring(pstr);
10416 nlpp = &(*nlpp)->next;
10417 *nlpp = stalloc(sizeof(**nlpp));
10418 (*nlpp)->next = NULL;
10419 parsebackquote = oldstyle;
10422 saveprompt = doprompt;
10429 doprompt = saveprompt;
10430 else if (readtoken() != TRP)
10431 raise_error_unexpected_syntax(TRP);
10436 * Start reading from old file again, ignoring any pushed back
10437 * tokens left from the backquote parsing
10442 while (stackblocksize() <= savelen)
10444 STARTSTACKSTR(out);
10446 memcpy(out, str, savelen);
10447 STADJUST(savelen, out);
10453 parsebackquote = savepbq;
10454 exception_handler = savehandler;
10455 if (arinest || dblquote)
10456 USTPUTC(CTLBACKQ | CTLQUOTE, out);
10458 USTPUTC(CTLBACKQ, out);
10460 goto parsebackq_oldreturn;
10461 goto parsebackq_newreturn;
10464 #if ENABLE_ASH_MATH_SUPPORT
10466 * Parse an arithmetic expansion (indicate start of one and set state)
10469 if (++arinest == 1) {
10470 prevsyntax = syntax;
10471 syntax = ARISYNTAX;
10472 USTPUTC(CTLARI, out);
10479 * we collapse embedded arithmetic expansion to
10480 * parenthesis, which should be equivalent
10484 goto parsearith_return;
10488 } /* end of readtoken */
10491 * Read the next input token.
10492 * If the token is a word, we set backquotelist to the list of cmds in
10493 * backquotes. We set quoteflag to true if any part of the word was
10495 * If the token is TREDIR, then we set redirnode to a structure containing
10497 * In all cases, the variable startlinno is set to the number of the line
10498 * on which the token starts.
10500 * [Change comment: here documents and internal procedures]
10501 * [Readtoken shouldn't have any arguments. Perhaps we should make the
10502 * word parsing code into a separate routine. In this case, readtoken
10503 * doesn't need to have any internal procedures, but parseword does.
10504 * We could also make parseoperator in essence the main routine, and
10505 * have parseword (readtoken1?) handle both words and redirection.]
10507 #define NEW_xxreadtoken
10508 #ifdef NEW_xxreadtoken
10509 /* singles must be first! */
10510 static const char xxreadtoken_chars[7] ALIGN1 = {
10511 '\n', '(', ')', '&', '|', ';', 0
10514 static const char xxreadtoken_tokens[] ALIGN1 = {
10515 TNL, TLP, TRP, /* only single occurrence allowed */
10516 TBACKGND, TPIPE, TSEMI, /* if single occurrence */
10517 TEOF, /* corresponds to trailing nul */
10518 TAND, TOR, TENDCASE /* if double occurrence */
10521 #define xxreadtoken_doubles \
10522 (sizeof(xxreadtoken_tokens) - sizeof(xxreadtoken_chars))
10523 #define xxreadtoken_singles \
10524 (sizeof(xxreadtoken_chars) - xxreadtoken_doubles - 1)
10538 startlinno = plinno;
10539 for (;;) { /* until token or start of word found */
10542 if ((c != ' ') && (c != '\t')
10543 #if ENABLE_ASH_ALIAS
10548 while ((c = pgetc()) != '\n' && c != PEOF);
10550 } else if (c == '\\') {
10551 if (pgetc() != '\n') {
10555 startlinno = ++plinno;
10560 = xxreadtoken_chars + sizeof(xxreadtoken_chars) - 1;
10565 needprompt = doprompt;
10568 p = strchr(xxreadtoken_chars, c);
10571 return readtoken1(c, BASESYNTAX, (char *) NULL, 0);
10574 if (p - xxreadtoken_chars >= xxreadtoken_singles) {
10575 if (pgetc() == *p) { /* double occurrence? */
10576 p += xxreadtoken_doubles + 1;
10582 return lasttoken = xxreadtoken_tokens[p - xxreadtoken_chars];
10588 #define RETURN(token) return lasttoken = token
10601 startlinno = plinno;
10602 for (;;) { /* until token or start of word found */
10605 case ' ': case '\t':
10606 #if ENABLE_ASH_ALIAS
10611 while ((c = pgetc()) != '\n' && c != PEOF);
10615 if (pgetc() == '\n') {
10616 startlinno = ++plinno;
10625 needprompt = doprompt;
10630 if (pgetc() == '&')
10635 if (pgetc() == '|')
10640 if (pgetc() == ';')
10653 return readtoken1(c, BASESYNTAX, (char *)NULL, 0);
10656 #endif /* NEW_xxreadtoken */
10663 smallint alreadyseen = tokpushback;
10666 #if ENABLE_ASH_ALIAS
10675 if (checkkwd & CHKNL) {
10682 if (t != TWORD || quoteflag) {
10687 * check for keywords
10689 if (checkkwd & CHKKWD) {
10690 const char *const *pp;
10692 pp = findkwd(wordtext);
10694 lasttoken = t = pp - tokname_array;
10695 TRACE(("keyword %s recognized\n", tokname(t)));
10700 if (checkkwd & CHKALIAS) {
10701 #if ENABLE_ASH_ALIAS
10703 ap = lookupalias(wordtext, 1);
10706 pushstring(ap->val, ap);
10716 TRACE(("token %s %s\n", tokname(t), t == TWORD ? wordtext : ""));
10718 TRACE(("reread token %s %s\n", tokname(t), t == TWORD ? wordtext : ""));
10730 return tokname_array[t][0];
10734 * Read and parse a command. Returns NEOF on end of file. (NULL is a
10735 * valid parse tree indicating a blank line.)
10737 static union node *
10738 parsecmd(int interact)
10743 doprompt = interact;
10745 setprompt(doprompt);
10757 * Input any here documents.
10762 struct heredoc *here;
10765 here = heredoclist;
10772 readtoken1(pgetc(), here->here->type == NHERE? SQSYNTAX : DQSYNTAX,
10773 here->eofmark, here->striptabs);
10774 n = stalloc(sizeof(struct narg));
10775 n->narg.type = NARG;
10776 n->narg.next = NULL;
10777 n->narg.text = wordtext;
10778 n->narg.backquote = backquotelist;
10779 here->here->nhere.doc = n;
10786 * called by editline -- any expansions to the prompt should be added here.
10788 #if ENABLE_ASH_EXPAND_PRMT
10789 static const char *
10790 expandstr(const char *ps)
10794 /* XXX Fix (char *) cast. */
10795 setinputstring((char *)ps);
10796 readtoken1(pgetc(), PSSYNTAX, nullstr, 0);
10799 n.narg.type = NARG;
10800 n.narg.next = NULL;
10801 n.narg.text = wordtext;
10802 n.narg.backquote = backquotelist;
10804 expandarg(&n, NULL, 0);
10805 return stackblock();
10810 * Execute a command or commands contained in a string.
10813 evalstring(char *s, int mask)
10816 struct stackmark smark;
10820 setstackmark(&smark);
10823 while ((n = parsecmd(0)) != NEOF) {
10825 popstackmark(&smark);
10838 * The eval command.
10841 evalcmd(int argc, char **argv)
10850 STARTSTACKSTR(concat);
10853 concat = stack_putstr(p, concat);
10857 STPUTC(' ', concat);
10859 STPUTC('\0', concat);
10860 p = grabstackstr(concat);
10862 evalstring(p, ~SKIPEVAL);
10869 * Read and execute commands. "Top" is nonzero for the top level command
10870 * loop; it turns on prompting if the shell is interactive.
10876 struct stackmark smark;
10880 TRACE(("cmdloop(%d) called\n", top));
10884 setstackmark(&smark);
10887 showjobs(stderr, SHOW_CHANGED);
10890 if (iflag && top) {
10892 #if ENABLE_ASH_MAIL
10896 n = parsecmd(inter);
10897 /* showtree(n); DEBUG */
10899 if (!top || numeof >= 50)
10901 if (!stoppedjobs()) {
10904 out2str("\nUse \"exit\" to leave shell.\n");
10907 } else if (nflag == 0) {
10908 /* job_warning can only be 2,1,0. Here 2->1, 1/0->0 */
10913 popstackmark(&smark);
10918 return skip & SKIPEVAL;
10925 * Take commands from a file. To be compatible we should do a path
10926 * search for the file, which is necessary to find sub-commands.
10929 find_dot_file(char *name)
10932 const char *path = pathval();
10935 /* don't try this for absolute or relative paths */
10936 if (strchr(name, '/'))
10939 while ((fullname = padvance(&path, name)) != NULL) {
10940 if ((stat(fullname, &statb) == 0) && S_ISREG(statb.st_mode)) {
10942 * Don't bother freeing here, since it will
10943 * be freed by the caller.
10947 stunalloc(fullname);
10950 /* not found in the PATH */
10951 ash_msg_and_raise_error("%s: not found", name);
10956 dotcmd(int argc, char **argv)
10958 struct strlist *sp;
10959 volatile struct shparam saveparam;
10962 for (sp = cmdenviron; sp; sp = sp->next)
10963 setvareq(ckstrdup(sp->text), VSTRFIXED | VTEXTFIXED);
10965 if (argc >= 2) { /* That's what SVR2 does */
10968 fullname = find_dot_file(argv[1]);
10971 saveparam = shellparam;
10972 shellparam.malloc = 0;
10973 shellparam.nparam = argc - 2;
10974 shellparam.p = argv + 2;
10977 setinputfile(fullname, INPUT_PUSH_FILE);
10978 commandname = fullname;
10983 freeparam(&shellparam);
10984 shellparam = saveparam;
10986 status = exitstatus;
10992 exitcmd(int argc, char **argv)
10997 exitstatus = number(argv[1]);
10998 raise_exception(EXEXIT);
11002 #if ENABLE_ASH_BUILTIN_ECHO
11004 echocmd(int argc, char **argv)
11006 return bb_echo(argc, argv);
11010 #if ENABLE_ASH_BUILTIN_TEST
11012 testcmd(int argc, char **argv)
11014 return test_main(argc, argv);
11019 * Read a file containing shell functions.
11022 readcmdfile(char *name)
11024 setinputfile(name, INPUT_PUSH_FILE);
11030 /* ============ find_command inplementation */
11033 * Resolve a command name. If you change this routine, you may have to
11034 * change the shellexec routine as well.
11037 find_command(char *name, struct cmdentry *entry, int act, const char *path)
11039 struct tblentry *cmdp;
11046 struct builtincmd *bcmd;
11048 /* If name contains a slash, don't use PATH or hash table */
11049 if (strchr(name, '/') != NULL) {
11050 entry->u.index = -1;
11051 if (act & DO_ABS) {
11052 while (stat(name, &statb) < 0) {
11054 if (errno == EINTR)
11057 entry->cmdtype = CMDUNKNOWN;
11061 entry->cmdtype = CMDNORMAL;
11065 /* #if ENABLE_FEATURE_SH_STANDALONE... moved after builtin check */
11067 updatetbl = (path == pathval());
11070 if (strstr(path, "%builtin") != NULL)
11071 act |= DO_ALTBLTIN;
11074 /* If name is in the table, check answer will be ok */
11075 cmdp = cmdlookup(name, 0);
11076 if (cmdp != NULL) {
11079 switch (cmdp->cmdtype) {
11097 } else if (cmdp->rehash == 0)
11098 /* if not invalidated by cd, we're done */
11102 /* If %builtin not in path, check for builtin next */
11103 bcmd = find_builtin(name);
11105 if (IS_BUILTIN_REGULAR(bcmd))
11106 goto builtin_success;
11107 if (act & DO_ALTPATH) {
11108 if (!(act & DO_ALTBLTIN))
11109 goto builtin_success;
11110 } else if (builtinloc <= 0) {
11111 goto builtin_success;
11115 #if ENABLE_FEATURE_SH_STANDALONE
11116 if (find_applet_by_name(name)) {
11117 entry->cmdtype = CMDNORMAL;
11118 entry->u.index = -1;
11123 /* We have to search path. */
11124 prev = -1; /* where to start */
11125 if (cmdp && cmdp->rehash) { /* doing a rehash */
11126 if (cmdp->cmdtype == CMDBUILTIN)
11129 prev = cmdp->param.index;
11135 while ((fullname = padvance(&path, name)) != NULL) {
11136 stunalloc(fullname);
11137 /* NB: code below will still use fullname
11138 * despite it being "unallocated" */
11141 if (prefix(pathopt, "builtin")) {
11143 goto builtin_success;
11145 } else if (!(act & DO_NOFUNC)
11146 && prefix(pathopt, "func")) {
11147 /* handled below */
11149 /* ignore unimplemented options */
11153 /* if rehash, don't redo absolute path names */
11154 if (fullname[0] == '/' && idx <= prev) {
11157 TRACE(("searchexec \"%s\": no change\n", name));
11160 while (stat(fullname, &statb) < 0) {
11162 if (errno == EINTR)
11165 if (errno != ENOENT && errno != ENOTDIR)
11169 e = EACCES; /* if we fail, this will be the error */
11170 if (!S_ISREG(statb.st_mode))
11172 if (pathopt) { /* this is a %func directory */
11173 stalloc(strlen(fullname) + 1);
11174 /* NB: stalloc will return space pointed by fullname
11175 * (because we don't have any intervening allocations
11176 * between stunalloc above and this stalloc) */
11177 readcmdfile(fullname);
11178 cmdp = cmdlookup(name, 0);
11179 if (cmdp == NULL || cmdp->cmdtype != CMDFUNCTION)
11180 ash_msg_and_raise_error("%s not defined in %s", name, fullname);
11181 stunalloc(fullname);
11184 TRACE(("searchexec \"%s\" returns \"%s\"\n", name, fullname));
11186 entry->cmdtype = CMDNORMAL;
11187 entry->u.index = idx;
11191 cmdp = cmdlookup(name, 1);
11192 cmdp->cmdtype = CMDNORMAL;
11193 cmdp->param.index = idx;
11198 /* We failed. If there was an entry for this command, delete it */
11199 if (cmdp && updatetbl)
11200 delete_cmd_entry();
11202 ash_msg("%s: %s", name, errmsg(e, "not found"));
11203 entry->cmdtype = CMDUNKNOWN;
11208 entry->cmdtype = CMDBUILTIN;
11209 entry->u.cmd = bcmd;
11213 cmdp = cmdlookup(name, 1);
11214 cmdp->cmdtype = CMDBUILTIN;
11215 cmdp->param.cmd = bcmd;
11219 entry->cmdtype = cmdp->cmdtype;
11220 entry->u = cmdp->param;
11224 /* ============ trap.c */
11227 * The trap builtin.
11230 trapcmd(int argc, char **argv)
11239 for (signo = 0; signo < NSIG; signo++) {
11240 if (trap[signo] != NULL) {
11243 sn = get_signame(signo);
11244 out1fmt("trap -- %s %s\n",
11245 single_quote(trap[signo]), sn);
11255 signo = get_signum(*ap);
11257 ash_msg_and_raise_error("%s: bad trap", *ap);
11260 if (LONE_DASH(action))
11263 action = ckstrdup(action);
11266 trap[signo] = action;
11276 /* ============ Builtins */
11278 #if !ENABLE_FEATURE_SH_EXTRA_QUIET
11280 * Lists available builtins
11283 helpcmd(int argc, char **argv)
11287 out1fmt("\nBuilt-in commands:\n-------------------\n");
11288 for (col = 0, i = 0; i < ARRAY_SIZE(builtintab); i++) {
11289 col += out1fmt("%c%s", ((col == 0) ? '\t' : ' '),
11290 builtintab[i].name + 1);
11296 #if ENABLE_FEATURE_SH_STANDALONE
11297 for (i = 0; i < NUM_APPLETS; i++) {
11298 col += out1fmt("%c%s", ((col == 0) ? '\t' : ' '), applets[i].name);
11306 return EXIT_SUCCESS;
11308 #endif /* FEATURE_SH_EXTRA_QUIET */
11311 * The export and readonly commands.
11314 exportcmd(int argc, char **argv)
11320 int flag = argv[0][0] == 'r'? VREADONLY : VEXPORT;
11322 if (nextopt("p") != 'p') {
11327 p = strchr(name, '=');
11331 vp = *findvar(hashvar(name), name);
11337 setvar(name, p, flag);
11338 } while ((name = *++aptr) != NULL);
11342 showvars(argv[0], flag, 0);
11347 * Delete a function if it exists.
11350 unsetfunc(const char *name)
11352 struct tblentry *cmdp;
11354 cmdp = cmdlookup(name, 0);
11355 if (cmdp!= NULL && cmdp->cmdtype == CMDFUNCTION)
11356 delete_cmd_entry();
11360 * The unset builtin command. We unset the function before we unset the
11361 * variable to allow a function to be unset when there is a readonly variable
11362 * with the same name.
11365 unsetcmd(int argc, char **argv)
11372 while ((i = nextopt("vf")) != '\0') {
11376 for (ap = argptr; *ap; ap++) {
11392 #include <sys/times.h>
11394 static const unsigned char timescmd_str[] ALIGN1 = {
11395 ' ', offsetof(struct tms, tms_utime),
11396 '\n', offsetof(struct tms, tms_stime),
11397 ' ', offsetof(struct tms, tms_cutime),
11398 '\n', offsetof(struct tms, tms_cstime),
11403 timescmd(int ac, char **av)
11405 long clk_tck, s, t;
11406 const unsigned char *p;
11409 clk_tck = sysconf(_SC_CLK_TCK);
11414 t = *(clock_t *)(((char *) &buf) + p[1]);
11416 out1fmt("%ldm%ld.%.3lds%c",
11418 ((t - s * clk_tck) * 1000) / clk_tck,
11420 } while (*(p += 2));
11425 #if ENABLE_ASH_MATH_SUPPORT
11427 dash_arith(const char *s)
11433 result = arith(s, &errcode);
11436 ash_msg_and_raise_error("exponent less than 0");
11438 ash_msg_and_raise_error("divide by zero");
11440 ash_msg_and_raise_error("expression recursion loop detected");
11441 raise_error_syntax(s);
11449 * The let builtin. partial stolen from GNU Bash, the Bourne Again SHell.
11450 * Copyright (C) 1987, 1989, 1991 Free Software Foundation, Inc.
11452 * Copyright (C) 2003 Vladimir Oleynik <dzo@simtreas.ru>
11455 letcmd(int argc, char **argv)
11462 ash_msg_and_raise_error("expression expected");
11463 for (ap = argv + 1; *ap; ap++) {
11464 i = dash_arith(*ap);
11469 #endif /* ASH_MATH_SUPPORT */
11472 /* ============ miscbltin.c
11474 * Miscellaneous builtins.
11479 #if defined(__GLIBC__) && __GLIBC__ == 2 && __GLIBC_MINOR__ < 1
11480 typedef enum __rlimit_resource rlim_t;
11484 * The read builtin. The -e option causes backslashes to escape the
11485 * following character.
11487 * This uses unbuffered input, which may be avoidable in some cases.
11490 readcmd(int argc, char **argv)
11502 #if ENABLE_ASH_READ_NCHARS
11506 struct termios tty, old_tty;
11508 #if ENABLE_ASH_READ_TIMEOUT
11512 ts.tv_sec = ts.tv_usec = 0;
11517 #if ENABLE_ASH_READ_NCHARS && ENABLE_ASH_READ_TIMEOUT
11518 while ((i = nextopt("p:rt:n:s")) != '\0')
11519 #elif ENABLE_ASH_READ_NCHARS
11520 while ((i = nextopt("p:rn:s")) != '\0')
11521 #elif ENABLE_ASH_READ_TIMEOUT
11522 while ((i = nextopt("p:rt:")) != '\0')
11524 while ((i = nextopt("p:r")) != '\0')
11529 prompt = optionarg;
11531 #if ENABLE_ASH_READ_NCHARS
11533 nchars = bb_strtou(optionarg, NULL, 10);
11534 if (nchars < 0 || errno)
11535 ash_msg_and_raise_error("invalid count");
11536 n_flag = nchars; /* just a flag "nchars is nonzero" */
11542 #if ENABLE_ASH_READ_TIMEOUT
11544 ts.tv_sec = bb_strtou(optionarg, &p, 10);
11546 /* EINVAL means number is ok, but not terminated by NUL */
11547 if (*p == '.' && errno == EINVAL) {
11551 ts.tv_usec = bb_strtou(p, &p2, 10);
11553 ash_msg_and_raise_error("invalid timeout");
11555 /* normalize to usec */
11557 ash_msg_and_raise_error("invalid timeout");
11558 while (scale++ < 6)
11561 } else if (ts.tv_sec < 0 || errno) {
11562 ash_msg_and_raise_error("invalid timeout");
11564 if (!(ts.tv_sec | ts.tv_usec)) { /* both are 0? */
11565 ash_msg_and_raise_error("invalid timeout");
11576 if (prompt && isatty(0)) {
11581 ash_msg_and_raise_error("arg count");
11582 ifs = bltinlookup("IFS");
11585 #if ENABLE_ASH_READ_NCHARS
11586 if (n_flag || silent) {
11587 if (tcgetattr(0, &tty) != 0) {
11594 tty.c_lflag &= ~ICANON;
11595 tty.c_cc[VMIN] = nchars < 256 ? nchars : 255;
11598 tty.c_lflag &= ~(ECHO | ECHOK | ECHONL);
11600 tcsetattr(0, TCSANOW, &tty);
11604 #if ENABLE_ASH_READ_TIMEOUT
11605 if (ts.tv_sec || ts.tv_usec) {
11609 /* poll-based wait produces bigger code, using select */
11610 i = select(1, &set, NULL, NULL, &ts);
11611 if (!i) { /* timed out! */
11612 #if ENABLE_ASH_READ_NCHARS
11614 tcsetattr(0, TCSANOW, &old_tty);
11625 if (read(0, &c, 1) != 1) {
11637 if (!rflag && c == '\\') {
11643 if (startword && *ifs == ' ' && strchr(ifs, c)) {
11647 if (ap[1] != NULL && strchr(ifs, c) != NULL) {
11649 setvar(*ap, stackblock(), 0);
11658 /* end of do {} while: */
11659 #if ENABLE_ASH_READ_NCHARS
11660 while (!n_flag || --nchars);
11665 #if ENABLE_ASH_READ_NCHARS
11666 if (n_flag || silent)
11667 tcsetattr(0, TCSANOW, &old_tty);
11671 /* Remove trailing blanks */
11672 while ((char *)stackblock() <= --p && strchr(ifs, *p) != NULL)
11674 setvar(*ap, stackblock(), 0);
11675 while (*++ap != NULL)
11676 setvar(*ap, nullstr, 0);
11681 umaskcmd(int argc, char **argv)
11683 static const char permuser[3] ALIGN1 = "ugo";
11684 static const char permmode[3] ALIGN1 = "rwx";
11685 static const short permmask[] ALIGN2 = {
11686 S_IRUSR, S_IWUSR, S_IXUSR,
11687 S_IRGRP, S_IWGRP, S_IXGRP,
11688 S_IROTH, S_IWOTH, S_IXOTH
11694 int symbolic_mode = 0;
11696 while (nextopt("S") != '\0') {
11707 if (symbolic_mode) {
11711 for (i = 0; i < 3; i++) {
11714 *p++ = permuser[i];
11716 for (j = 0; j < 3; j++) {
11717 if ((mask & permmask[3 * i + j]) == 0) {
11718 *p++ = permmode[j];
11726 out1fmt("%.4o\n", mask);
11729 if (isdigit((unsigned char) *ap)) {
11732 if (*ap >= '8' || *ap < '0')
11733 ash_msg_and_raise_error(illnum, argv[1]);
11734 mask = (mask << 3) + (*ap - '0');
11735 } while (*++ap != '\0');
11738 mask = ~mask & 0777;
11739 if (!bb_parse_mode(ap, &mask)) {
11740 ash_msg_and_raise_error("illegal mode: %s", ap);
11742 umask(~mask & 0777);
11751 * This code, originally by Doug Gwyn, Doug Kingston, Eric Gisin, and
11752 * Michael Rendell was ripped from pdksh 5.0.8 and hacked for use with
11753 * ash by J.T. Conklin.
11759 uint8_t cmd; /* RLIMIT_xxx fit into it */
11760 uint8_t factor_shift; /* shift by to get rlim_{cur,max} values */
11764 static const struct limits limits_tbl[] = {
11766 { RLIMIT_CPU, 0, 't' },
11768 #ifdef RLIMIT_FSIZE
11769 { RLIMIT_FSIZE, 9, 'f' },
11772 { RLIMIT_DATA, 10, 'd' },
11774 #ifdef RLIMIT_STACK
11775 { RLIMIT_STACK, 10, 's' },
11778 { RLIMIT_CORE, 9, 'c' },
11781 { RLIMIT_RSS, 10, 'm' },
11783 #ifdef RLIMIT_MEMLOCK
11784 { RLIMIT_MEMLOCK, 10, 'l' },
11786 #ifdef RLIMIT_NPROC
11787 { RLIMIT_NPROC, 0, 'p' },
11789 #ifdef RLIMIT_NOFILE
11790 { RLIMIT_NOFILE, 0, 'n' },
11793 { RLIMIT_AS, 10, 'v' },
11795 #ifdef RLIMIT_LOCKS
11796 { RLIMIT_LOCKS, 0, 'w' },
11799 static const char limits_name[] =
11801 "time(seconds)" "\0"
11803 #ifdef RLIMIT_FSIZE
11804 "file(blocks)" "\0"
11809 #ifdef RLIMIT_STACK
11813 "coredump(blocks)" "\0"
11818 #ifdef RLIMIT_MEMLOCK
11819 "locked memory(kb)" "\0"
11821 #ifdef RLIMIT_NPROC
11824 #ifdef RLIMIT_NOFILE
11830 #ifdef RLIMIT_LOCKS
11835 enum limtype { SOFT = 0x1, HARD = 0x2 };
11838 printlim(enum limtype how, const struct rlimit *limit,
11839 const struct limits *l)
11843 val = limit->rlim_max;
11845 val = limit->rlim_cur;
11847 if (val == RLIM_INFINITY)
11848 out1fmt("unlimited\n");
11850 val >>= l->factor_shift;
11851 out1fmt("%lld\n", (long long) val);
11856 ulimitcmd(int argc, char **argv)
11860 enum limtype how = SOFT | HARD;
11861 const struct limits *l;
11864 struct rlimit limit;
11867 while ((optc = nextopt("HSa"
11871 #ifdef RLIMIT_FSIZE
11877 #ifdef RLIMIT_STACK
11886 #ifdef RLIMIT_MEMLOCK
11889 #ifdef RLIMIT_NPROC
11892 #ifdef RLIMIT_NOFILE
11898 #ifdef RLIMIT_LOCKS
11916 for (l = limits_tbl; l->option != what; l++)
11919 set = *argptr ? 1 : 0;
11923 if (all || argptr[1])
11924 ash_msg_and_raise_error("too many arguments");
11925 if (strncmp(p, "unlimited\n", 9) == 0)
11926 val = RLIM_INFINITY;
11930 while ((c = *p++) >= '0' && c <= '9') {
11931 val = (val * 10) + (long)(c - '0');
11932 if (val < (rlim_t) 0)
11936 ash_msg_and_raise_error("bad number");
11937 val <<= l->factor_shift;
11941 const char *lname = limits_name;
11942 for (l = limits_tbl; l != &limits_tbl[ARRAY_SIZE(limits_tbl)]; l++) {
11943 getrlimit(l->cmd, &limit);
11944 out1fmt("%-20s ", lname);
11945 lname += strlen(lname) + 1;
11946 printlim(how, &limit, l);
11951 getrlimit(l->cmd, &limit);
11954 limit.rlim_max = val;
11956 limit.rlim_cur = val;
11957 if (setrlimit(l->cmd, &limit) < 0)
11958 ash_msg_and_raise_error("error setting limit (%m)");
11960 printlim(how, &limit, l);
11966 /* ============ Math support */
11968 #if ENABLE_ASH_MATH_SUPPORT
11970 /* Copyright (c) 2001 Aaron Lehmann <aaronl@vitelus.com>
11972 Permission is hereby granted, free of charge, to any person obtaining
11973 a copy of this software and associated documentation files (the
11974 "Software"), to deal in the Software without restriction, including
11975 without limitation the rights to use, copy, modify, merge, publish,
11976 distribute, sublicense, and/or sell copies of the Software, and to
11977 permit persons to whom the Software is furnished to do so, subject to
11978 the following conditions:
11980 The above copyright notice and this permission notice shall be
11981 included in all copies or substantial portions of the Software.
11983 THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
11984 EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
11985 MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
11986 IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
11987 CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
11988 TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
11989 SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
11992 /* This is my infix parser/evaluator. It is optimized for size, intended
11993 * as a replacement for yacc-based parsers. However, it may well be faster
11994 * than a comparable parser written in yacc. The supported operators are
11995 * listed in #defines below. Parens, order of operations, and error handling
11996 * are supported. This code is thread safe. The exact expression format should
11997 * be that which POSIX specifies for shells. */
11999 /* The code uses a simple two-stack algorithm. See
12000 * http://www.onthenet.com.au/~grahamis/int2008/week02/lect02.html
12001 * for a detailed explanation of the infix-to-postfix algorithm on which
12002 * this is based (this code differs in that it applies operators immediately
12003 * to the stack instead of adding them to a queue to end up with an
12006 /* To use the routine, call it with an expression string and error return
12010 * Aug 24, 2001 Manuel Novoa III
12012 * Reduced the generated code size by about 30% (i386) and fixed several bugs.
12014 * 1) In arith_apply():
12015 * a) Cached values of *numptr and &(numptr[-1]).
12016 * b) Removed redundant test for zero denominator.
12019 * a) Eliminated redundant code for processing operator tokens by moving
12020 * to a table-based implementation. Also folded handling of parens
12022 * b) Combined all 3 loops which called arith_apply to reduce generated
12023 * code size at the cost of speed.
12025 * 3) The following expressions were treated as valid by the original code:
12026 * 1() , 0! , 1 ( *3 ) .
12027 * These bugs have been fixed by internally enclosing the expression in
12028 * parens and then checking that all binary ops and right parens are
12029 * preceded by a valid expression (NUM_TOKEN).
12031 * Note: It may be desirable to replace Aaron's test for whitespace with
12032 * ctype's isspace() if it is used by another busybox applet or if additional
12033 * whitespace chars should be considered. Look below the "#include"s for a
12034 * precompiler test.
12038 * Aug 26, 2001 Manuel Novoa III
12040 * Return 0 for null expressions. Pointed out by Vladimir Oleynik.
12042 * Merge in Aaron's comments previously posted to the busybox list,
12043 * modified slightly to take account of my changes to the code.
12048 * (C) 2003 Vladimir Oleynik <dzo@simtreas.ru>
12050 * - allow access to variable,
12051 * used recursive find value indirection (c=2*2; a="c"; $((a+=2)) produce 6)
12052 * - realize assign syntax (VAR=expr, +=, *= etc)
12053 * - realize exponentiation (** operator)
12054 * - realize comma separated - expr, expr
12055 * - realise ++expr --expr expr++ expr--
12056 * - realise expr ? expr : expr (but, second expr calculate always)
12057 * - allow hexadecimal and octal numbers
12058 * - was restored loses XOR operator
12059 * - remove one goto label, added three ;-)
12060 * - protect $((num num)) as true zero expr (Manuel`s error)
12061 * - always use special isspace(), see comment from bash ;-)
12064 #define arith_isspace(arithval) \
12065 (arithval == ' ' || arithval == '\n' || arithval == '\t')
12067 typedef unsigned char operator;
12069 /* An operator's token id is a bit of a bitfield. The lower 5 bits are the
12070 * precedence, and 3 high bits are an ID unique across operators of that
12071 * precedence. The ID portion is so that multiple operators can have the
12072 * same precedence, ensuring that the leftmost one is evaluated first.
12073 * Consider * and /. */
12075 #define tok_decl(prec,id) (((id)<<5)|(prec))
12076 #define PREC(op) ((op) & 0x1F)
12078 #define TOK_LPAREN tok_decl(0,0)
12080 #define TOK_COMMA tok_decl(1,0)
12082 #define TOK_ASSIGN tok_decl(2,0)
12083 #define TOK_AND_ASSIGN tok_decl(2,1)
12084 #define TOK_OR_ASSIGN tok_decl(2,2)
12085 #define TOK_XOR_ASSIGN tok_decl(2,3)
12086 #define TOK_PLUS_ASSIGN tok_decl(2,4)
12087 #define TOK_MINUS_ASSIGN tok_decl(2,5)
12088 #define TOK_LSHIFT_ASSIGN tok_decl(2,6)
12089 #define TOK_RSHIFT_ASSIGN tok_decl(2,7)
12091 #define TOK_MUL_ASSIGN tok_decl(3,0)
12092 #define TOK_DIV_ASSIGN tok_decl(3,1)
12093 #define TOK_REM_ASSIGN tok_decl(3,2)
12095 /* all assign is right associativity and precedence eq, but (7+3)<<5 > 256 */
12096 #define convert_prec_is_assing(prec) do { if (prec == 3) prec = 2; } while (0)
12098 /* conditional is right associativity too */
12099 #define TOK_CONDITIONAL tok_decl(4,0)
12100 #define TOK_CONDITIONAL_SEP tok_decl(4,1)
12102 #define TOK_OR tok_decl(5,0)
12104 #define TOK_AND tok_decl(6,0)
12106 #define TOK_BOR tok_decl(7,0)
12108 #define TOK_BXOR tok_decl(8,0)
12110 #define TOK_BAND tok_decl(9,0)
12112 #define TOK_EQ tok_decl(10,0)
12113 #define TOK_NE tok_decl(10,1)
12115 #define TOK_LT tok_decl(11,0)
12116 #define TOK_GT tok_decl(11,1)
12117 #define TOK_GE tok_decl(11,2)
12118 #define TOK_LE tok_decl(11,3)
12120 #define TOK_LSHIFT tok_decl(12,0)
12121 #define TOK_RSHIFT tok_decl(12,1)
12123 #define TOK_ADD tok_decl(13,0)
12124 #define TOK_SUB tok_decl(13,1)
12126 #define TOK_MUL tok_decl(14,0)
12127 #define TOK_DIV tok_decl(14,1)
12128 #define TOK_REM tok_decl(14,2)
12130 /* exponent is right associativity */
12131 #define TOK_EXPONENT tok_decl(15,1)
12133 /* For now unary operators. */
12134 #define UNARYPREC 16
12135 #define TOK_BNOT tok_decl(UNARYPREC,0)
12136 #define TOK_NOT tok_decl(UNARYPREC,1)
12138 #define TOK_UMINUS tok_decl(UNARYPREC+1,0)
12139 #define TOK_UPLUS tok_decl(UNARYPREC+1,1)
12141 #define PREC_PRE (UNARYPREC+2)
12143 #define TOK_PRE_INC tok_decl(PREC_PRE, 0)
12144 #define TOK_PRE_DEC tok_decl(PREC_PRE, 1)
12146 #define PREC_POST (UNARYPREC+3)
12148 #define TOK_POST_INC tok_decl(PREC_POST, 0)
12149 #define TOK_POST_DEC tok_decl(PREC_POST, 1)
12151 #define SPEC_PREC (UNARYPREC+4)
12153 #define TOK_NUM tok_decl(SPEC_PREC, 0)
12154 #define TOK_RPAREN tok_decl(SPEC_PREC, 1)
12156 #define NUMPTR (*numstackptr)
12159 tok_have_assign(operator op)
12161 operator prec = PREC(op);
12163 convert_prec_is_assing(prec);
12164 return (prec == PREC(TOK_ASSIGN) ||
12165 prec == PREC_PRE || prec == PREC_POST);
12169 is_right_associativity(operator prec)
12171 return (prec == PREC(TOK_ASSIGN) || prec == PREC(TOK_EXPONENT)
12172 || prec == PREC(TOK_CONDITIONAL));
12175 typedef struct ARITCH_VAR_NUM {
12177 arith_t contidional_second_val;
12178 char contidional_second_val_initialized;
12179 char *var; /* if NULL then is regular number,
12180 else is variable name */
12183 typedef struct CHK_VAR_RECURSIVE_LOOPED {
12185 struct CHK_VAR_RECURSIVE_LOOPED *next;
12186 } chk_var_recursive_looped_t;
12188 static chk_var_recursive_looped_t *prev_chk_var_recursive;
12191 arith_lookup_val(v_n_t *t)
12194 const char * p = lookupvar(t->var);
12199 /* recursive try as expression */
12200 chk_var_recursive_looped_t *cur;
12201 chk_var_recursive_looped_t cur_save;
12203 for (cur = prev_chk_var_recursive; cur; cur = cur->next) {
12204 if (strcmp(cur->var, t->var) == 0) {
12205 /* expression recursion loop detected */
12209 /* save current lookuped var name */
12210 cur = prev_chk_var_recursive;
12211 cur_save.var = t->var;
12212 cur_save.next = cur;
12213 prev_chk_var_recursive = &cur_save;
12215 t->val = arith (p, &errcode);
12216 /* restore previous ptr after recursiving */
12217 prev_chk_var_recursive = cur;
12220 /* allow undefined var as 0 */
12226 /* "applying" a token means performing it on the top elements on the integer
12227 * stack. For a unary operator it will only change the top element, but a
12228 * binary operator will pop two arguments and push a result */
12230 arith_apply(operator op, v_n_t *numstack, v_n_t **numstackptr)
12233 arith_t numptr_val, rez;
12234 int ret_arith_lookup_val;
12236 /* There is no operator that can work without arguments */
12237 if (NUMPTR == numstack) goto err;
12238 numptr_m1 = NUMPTR - 1;
12240 /* check operand is var with noninteger value */
12241 ret_arith_lookup_val = arith_lookup_val(numptr_m1);
12242 if (ret_arith_lookup_val)
12243 return ret_arith_lookup_val;
12245 rez = numptr_m1->val;
12246 if (op == TOK_UMINUS)
12248 else if (op == TOK_NOT)
12250 else if (op == TOK_BNOT)
12252 else if (op == TOK_POST_INC || op == TOK_PRE_INC)
12254 else if (op == TOK_POST_DEC || op == TOK_PRE_DEC)
12256 else if (op != TOK_UPLUS) {
12257 /* Binary operators */
12259 /* check and binary operators need two arguments */
12260 if (numptr_m1 == numstack) goto err;
12262 /* ... and they pop one */
12265 if (op == TOK_CONDITIONAL) {
12266 if (! numptr_m1->contidional_second_val_initialized) {
12267 /* protect $((expr1 ? expr2)) without ": expr" */
12270 rez = numptr_m1->contidional_second_val;
12271 } else if (numptr_m1->contidional_second_val_initialized) {
12272 /* protect $((expr1 : expr2)) without "expr ? " */
12275 numptr_m1 = NUMPTR - 1;
12276 if (op != TOK_ASSIGN) {
12277 /* check operand is var with noninteger value for not '=' */
12278 ret_arith_lookup_val = arith_lookup_val(numptr_m1);
12279 if (ret_arith_lookup_val)
12280 return ret_arith_lookup_val;
12282 if (op == TOK_CONDITIONAL) {
12283 numptr_m1->contidional_second_val = rez;
12285 rez = numptr_m1->val;
12286 if (op == TOK_BOR || op == TOK_OR_ASSIGN)
12288 else if (op == TOK_OR)
12289 rez = numptr_val || rez;
12290 else if (op == TOK_BAND || op == TOK_AND_ASSIGN)
12292 else if (op == TOK_BXOR || op == TOK_XOR_ASSIGN)
12294 else if (op == TOK_AND)
12295 rez = rez && numptr_val;
12296 else if (op == TOK_EQ)
12297 rez = (rez == numptr_val);
12298 else if (op == TOK_NE)
12299 rez = (rez != numptr_val);
12300 else if (op == TOK_GE)
12301 rez = (rez >= numptr_val);
12302 else if (op == TOK_RSHIFT || op == TOK_RSHIFT_ASSIGN)
12303 rez >>= numptr_val;
12304 else if (op == TOK_LSHIFT || op == TOK_LSHIFT_ASSIGN)
12305 rez <<= numptr_val;
12306 else if (op == TOK_GT)
12307 rez = (rez > numptr_val);
12308 else if (op == TOK_LT)
12309 rez = (rez < numptr_val);
12310 else if (op == TOK_LE)
12311 rez = (rez <= numptr_val);
12312 else if (op == TOK_MUL || op == TOK_MUL_ASSIGN)
12314 else if (op == TOK_ADD || op == TOK_PLUS_ASSIGN)
12316 else if (op == TOK_SUB || op == TOK_MINUS_ASSIGN)
12318 else if (op == TOK_ASSIGN || op == TOK_COMMA)
12320 else if (op == TOK_CONDITIONAL_SEP) {
12321 if (numptr_m1 == numstack) {
12322 /* protect $((expr : expr)) without "expr ? " */
12325 numptr_m1->contidional_second_val_initialized = op;
12326 numptr_m1->contidional_second_val = numptr_val;
12327 } else if (op == TOK_CONDITIONAL) {
12329 numptr_val : numptr_m1->contidional_second_val;
12330 } else if (op == TOK_EXPONENT) {
12331 if (numptr_val < 0)
12332 return -3; /* exponent less than 0 */
12337 while (numptr_val--)
12341 } else if (numptr_val==0) /* zero divisor check */
12343 else if (op == TOK_DIV || op == TOK_DIV_ASSIGN)
12345 else if (op == TOK_REM || op == TOK_REM_ASSIGN)
12348 if (tok_have_assign(op)) {
12349 char buf[sizeof(arith_t_type)*3 + 2];
12351 if (numptr_m1->var == NULL) {
12355 /* save to shell variable */
12356 #if ENABLE_ASH_MATH_SUPPORT_64
12357 snprintf(buf, sizeof(buf), "%lld", (arith_t_type) rez);
12359 snprintf(buf, sizeof(buf), "%ld", (arith_t_type) rez);
12361 setvar(numptr_m1->var, buf, 0);
12362 /* after saving, make previous value for v++ or v-- */
12363 if (op == TOK_POST_INC)
12365 else if (op == TOK_POST_DEC)
12368 numptr_m1->val = rez;
12369 /* protect geting var value, is number now */
12370 numptr_m1->var = NULL;
12376 /* longest must be first */
12377 static const char op_tokens[] ALIGN1 = {
12378 '<','<','=',0, TOK_LSHIFT_ASSIGN,
12379 '>','>','=',0, TOK_RSHIFT_ASSIGN,
12380 '<','<', 0, TOK_LSHIFT,
12381 '>','>', 0, TOK_RSHIFT,
12382 '|','|', 0, TOK_OR,
12383 '&','&', 0, TOK_AND,
12384 '!','=', 0, TOK_NE,
12385 '<','=', 0, TOK_LE,
12386 '>','=', 0, TOK_GE,
12387 '=','=', 0, TOK_EQ,
12388 '|','=', 0, TOK_OR_ASSIGN,
12389 '&','=', 0, TOK_AND_ASSIGN,
12390 '*','=', 0, TOK_MUL_ASSIGN,
12391 '/','=', 0, TOK_DIV_ASSIGN,
12392 '%','=', 0, TOK_REM_ASSIGN,
12393 '+','=', 0, TOK_PLUS_ASSIGN,
12394 '-','=', 0, TOK_MINUS_ASSIGN,
12395 '-','-', 0, TOK_POST_DEC,
12396 '^','=', 0, TOK_XOR_ASSIGN,
12397 '+','+', 0, TOK_POST_INC,
12398 '*','*', 0, TOK_EXPONENT,
12402 '=', 0, TOK_ASSIGN,
12414 '?', 0, TOK_CONDITIONAL,
12415 ':', 0, TOK_CONDITIONAL_SEP,
12416 ')', 0, TOK_RPAREN,
12417 '(', 0, TOK_LPAREN,
12421 #define endexpression &op_tokens[sizeof(op_tokens)-7]
12424 arith(const char *expr, int *perrcode)
12426 char arithval; /* Current character under analysis */
12427 operator lasttok, op;
12430 const char *p = endexpression;
12433 size_t datasizes = strlen(expr) + 2;
12435 /* Stack of integers */
12436 /* The proof that there can be no more than strlen(startbuf)/2+1 integers
12437 * in any given correct or incorrect expression is left as an exercise to
12439 v_n_t *numstack = alloca(((datasizes)/2)*sizeof(v_n_t)),
12440 *numstackptr = numstack;
12441 /* Stack of operator tokens */
12442 operator *stack = alloca((datasizes) * sizeof(operator)),
12445 *stackptr++ = lasttok = TOK_LPAREN; /* start off with a left paren */
12446 *perrcode = errcode = 0;
12450 if (arithval == 0) {
12451 if (p == endexpression) {
12452 /* Null expression. */
12456 /* This is only reached after all tokens have been extracted from the
12457 * input stream. If there are still tokens on the operator stack, they
12458 * are to be applied in order. At the end, there should be a final
12459 * result on the integer stack */
12461 if (expr != endexpression + 1) {
12462 /* If we haven't done so already, */
12463 /* append a closing right paren */
12464 expr = endexpression;
12465 /* and let the loop process it. */
12468 /* At this point, we're done with the expression. */
12469 if (numstackptr != numstack+1) {
12470 /* ... but if there isn't, it's bad */
12472 return (*perrcode = -1);
12474 if (numstack->var) {
12475 /* expression is $((var)) only, lookup now */
12476 errcode = arith_lookup_val(numstack);
12479 *perrcode = errcode;
12480 return numstack->val;
12483 /* Continue processing the expression. */
12484 if (arith_isspace(arithval)) {
12485 /* Skip whitespace */
12488 p = endofname(expr);
12490 size_t var_name_size = (p-expr) + 1; /* trailing zero */
12492 numstackptr->var = alloca(var_name_size);
12493 safe_strncpy(numstackptr->var, expr, var_name_size);
12496 numstackptr->contidional_second_val_initialized = 0;
12501 if (isdigit(arithval)) {
12502 numstackptr->var = NULL;
12503 #if ENABLE_ASH_MATH_SUPPORT_64
12504 numstackptr->val = strtoll(expr, (char **) &expr, 0);
12506 numstackptr->val = strtol(expr, (char **) &expr, 0);
12510 for (p = op_tokens; ; p++) {
12514 /* strange operator not found */
12517 for (o = expr; *p && *o == *p; p++)
12524 /* skip tail uncompared token */
12527 /* skip zero delim */
12532 /* post grammar: a++ reduce to num */
12533 if (lasttok == TOK_POST_INC || lasttok == TOK_POST_DEC)
12536 /* Plus and minus are binary (not unary) _only_ if the last
12537 * token was as number, or a right paren (which pretends to be
12538 * a number, since it evaluates to one). Think about it.
12539 * It makes sense. */
12540 if (lasttok != TOK_NUM) {
12556 /* We don't want a unary operator to cause recursive descent on the
12557 * stack, because there can be many in a row and it could cause an
12558 * operator to be evaluated before its argument is pushed onto the
12559 * integer stack. */
12560 /* But for binary operators, "apply" everything on the operator
12561 * stack until we find an operator with a lesser priority than the
12562 * one we have just extracted. */
12563 /* Left paren is given the lowest priority so it will never be
12564 * "applied" in this way.
12565 * if associativity is right and priority eq, applied also skip
12568 if ((prec > 0 && prec < UNARYPREC) || prec == SPEC_PREC) {
12569 /* not left paren or unary */
12570 if (lasttok != TOK_NUM) {
12571 /* binary op must be preceded by a num */
12574 while (stackptr != stack) {
12575 if (op == TOK_RPAREN) {
12576 /* The algorithm employed here is simple: while we don't
12577 * hit an open paren nor the bottom of the stack, pop
12578 * tokens and apply them */
12579 if (stackptr[-1] == TOK_LPAREN) {
12581 /* Any operator directly after a */
12583 /* close paren should consider itself binary */
12587 operator prev_prec = PREC(stackptr[-1]);
12589 convert_prec_is_assing(prec);
12590 convert_prec_is_assing(prev_prec);
12591 if (prev_prec < prec)
12593 /* check right assoc */
12594 if (prev_prec == prec && is_right_associativity(prec))
12597 errcode = arith_apply(*--stackptr, numstack, &numstackptr);
12598 if (errcode) goto ret;
12600 if (op == TOK_RPAREN) {
12605 /* Push this operator to the stack and remember it. */
12606 *stackptr++ = lasttok = op;
12611 #endif /* ASH_MATH_SUPPORT */
12614 /* ============ main() and helpers */
12617 * Called to exit the shell.
12619 static void exitshell(void) ATTRIBUTE_NORETURN;
12627 status = exitstatus;
12628 TRACE(("pid %d, exitshell(%d)\n", getpid(), status));
12629 if (setjmp(loc.loc)) {
12630 if (exception == EXEXIT)
12631 /* dash bug: it just does _exit(exitstatus) here
12632 * but we have to do setjobctl(0) first!
12633 * (bug is still not fixed in dash-0.5.3 - if you run dash
12634 * under Midnight Commander, on exit from dash MC is backgrounded) */
12635 status = exitstatus;
12638 exception_handler = &loc;
12644 flush_stdout_stderr();
12654 /* from input.c: */
12655 basepf.nextc = basepf.buf = basebuf;
12658 signal(SIGCHLD, SIG_DFL);
12663 char ppid[sizeof(int)*3 + 1];
12665 struct stat st1, st2;
12668 for (envp = environ; envp && *envp; envp++) {
12669 if (strchr(*envp, '=')) {
12670 setvareq(*envp, VEXPORT|VTEXTFIXED);
12674 snprintf(ppid, sizeof(ppid), "%u", (unsigned) getppid());
12675 setvar("PPID", ppid, 0);
12677 p = lookupvar("PWD");
12679 if (*p != '/' || stat(p, &st1) || stat(".", &st2)
12680 || st1.st_dev != st2.st_dev || st1.st_ino != st2.st_ino)
12687 * Process the shell command line arguments.
12690 procargs(int argc, char **argv)
12693 const char *xminusc;
12700 for (i = 0; i < NOPTS; i++)
12706 if (*xargv == NULL) {
12708 ash_msg_and_raise_error(bb_msg_requires_arg, "-c");
12711 if (iflag == 2 && sflag == 1 && isatty(0) && isatty(1))
12715 for (i = 0; i < NOPTS; i++)
12716 if (optlist[i] == 2)
12721 /* POSIX 1003.2: first arg after -c cmd is $0, remainder $1... */
12726 } else if (!sflag) {
12727 setinputfile(*xargv, 0);
12730 commandname = arg0;
12733 shellparam.p = xargv;
12734 #if ENABLE_ASH_GETOPTS
12735 shellparam.optind = 1;
12736 shellparam.optoff = -1;
12738 /* assert(shellparam.malloc == 0 && shellparam.nparam == 0); */
12740 shellparam.nparam++;
12747 * Read /etc/profile or .profile.
12750 read_profile(const char *name)
12754 if (setinputfile(name, INPUT_PUSH_FILE | INPUT_NOFILE_OK) < 0)
12763 * This routine is called when an error or an interrupt occurs in an
12764 * interactive shell and control is returned to the main command loop.
12772 /* from input.c: */
12773 parselleft = parsenleft = 0; /* clear input buffer */
12775 /* from parser.c: */
12778 /* from redir.c: */
12783 static short profile_buf[16384];
12784 extern int etext();
12788 * Main routine. We initialize things, parse the arguments, execute
12789 * profiles if we're a login shell, and then call cmdloop to execute
12790 * commands. The setjmp call sets up the location to jump to when an
12791 * exception occurs. When an exception occurs the variable "state"
12792 * is used to figure out how far we had gotten.
12794 int ash_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
12795 int ash_main(int argc, char **argv)
12798 volatile int state;
12799 struct jmploc jmploc;
12800 struct stackmark smark;
12803 monitor(4, etext, profile_buf, sizeof(profile_buf), 50);
12806 #if ENABLE_FEATURE_EDITING
12807 line_input_state = new_line_input_t(FOR_SHELL | WITH_PATH_LOOKUP);
12810 if (setjmp(jmploc.loc)) {
12820 if (e == EXEXIT || s == 0 || iflag == 0 || shlvl)
12824 outcslow('\n', stderr);
12826 popstackmark(&smark);
12827 FORCE_INT_ON; /* enable interrupts */
12836 exception_handler = &jmploc;
12839 trace_puts("Shell args: ");
12840 trace_puts_args(argv);
12842 rootpid = getpid();
12844 #if ENABLE_ASH_RANDOM_SUPPORT
12845 rseed = rootpid + time(NULL);
12848 setstackmark(&smark);
12849 procargs(argc, argv);
12850 #if ENABLE_FEATURE_EDITING_SAVEHISTORY
12852 const char *hp = lookupvar("HISTFILE");
12855 hp = lookupvar("HOME");
12857 char *defhp = concat_path_file(hp, ".ash_history");
12858 setvar("HISTFILE", defhp, 0);
12864 if (argv[0] && argv[0][0] == '-')
12868 read_profile("/etc/profile");
12871 read_profile(".profile");
12877 getuid() == geteuid() && getgid() == getegid() &&
12881 shinit = lookupvar("ENV");
12882 if (shinit != NULL && *shinit != '\0') {
12883 read_profile(shinit);
12889 evalstring(minusc, 0);
12891 if (sflag || minusc == NULL) {
12892 #if ENABLE_FEATURE_EDITING_SAVEHISTORY
12894 const char *hp = lookupvar("HISTFILE");
12897 line_input_state->hist_file = hp;
12900 state4: /* XXX ??? - why isn't this before the "if" statement */
12908 extern void _mcleanup(void);
12917 const char *applet_name = "debug stuff usage";
12918 int main(int argc, char **argv)
12920 return ash_main(argc, argv);
12926 * Copyright (c) 1989, 1991, 1993, 1994
12927 * The Regents of the University of California. All rights reserved.
12929 * This code is derived from software contributed to Berkeley by
12930 * Kenneth Almquist.
12932 * Redistribution and use in source and binary forms, with or without
12933 * modification, are permitted provided that the following conditions
12935 * 1. Redistributions of source code must retain the above copyright
12936 * notice, this list of conditions and the following disclaimer.
12937 * 2. Redistributions in binary form must reproduce the above copyright
12938 * notice, this list of conditions and the following disclaimer in the
12939 * documentation and/or other materials provided with the distribution.
12940 * 3. Neither the name of the University nor the names of its contributors
12941 * may be used to endorse or promote products derived from this software
12942 * without specific prior written permission.
12944 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
12945 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
12946 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
12947 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
12948 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
12949 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
12950 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
12951 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
12952 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
12953 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF