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 fcntl(fd, F_SETFD, FD_CLOEXEC);
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);
4383 /* Called after fork(), in child */
4385 forkchild(struct job *jp, union node *n, int mode)
4389 TRACE(("Child shell %d\n", getpid()));
4396 /* do job control only in root shell */
4398 if (mode != FORK_NOJOB && jp->jobctl && !oldlvl) {
4401 if (jp->nprocs == 0)
4404 pgrp = jp->ps[0].pid;
4405 /* This can fail because we are doing it in the parent also */
4406 (void)setpgid(0, pgrp);
4407 if (mode == FORK_FG)
4408 xtcsetpgrp(ttyfd, pgrp);
4413 if (mode == FORK_BG) {
4416 if (jp->nprocs == 0) {
4418 if (open(bb_dev_null, O_RDONLY) != 0)
4419 ash_msg_and_raise_error("can't open %s", bb_dev_null);
4422 if (!oldlvl && iflag) {
4428 /* For "jobs | cat" to work like in bash, we must retain list of jobs
4429 * in child, but we do need to remove ourself */
4433 for (jp = curjob; jp; jp = jp->prev_job)
4439 /* Called after fork(), in parent */
4441 forkparent(struct job *jp, union node *n, int mode, pid_t pid)
4443 TRACE(("In parent shell: child = %d\n", pid));
4445 while (jobless && dowait(DOWAIT_NORMAL, 0) > 0);
4450 if (mode != FORK_NOJOB && jp->jobctl) {
4453 if (jp->nprocs == 0)
4456 pgrp = jp->ps[0].pid;
4457 /* This can fail because we are doing it in the child also */
4461 if (mode == FORK_BG) {
4462 backgndpid = pid; /* set $! */
4463 set_curjob(jp, CUR_RUNNING);
4466 struct procstat *ps = &jp->ps[jp->nprocs++];
4472 ps->cmd = commandtext(n);
4478 forkshell(struct job *jp, union node *n, int mode)
4482 TRACE(("forkshell(%%%d, %p, %d) called\n", jobno(jp), n, mode));
4485 TRACE(("Fork failed, errno=%d", errno));
4488 ash_msg_and_raise_error("cannot fork");
4491 forkchild(jp, n, mode);
4493 forkparent(jp, n, mode, pid);
4498 * Wait for job to finish.
4500 * Under job control we have the problem that while a child process is
4501 * running interrupts generated by the user are sent to the child but not
4502 * to the shell. This means that an infinite loop started by an inter-
4503 * active user may be hard to kill. With job control turned off, an
4504 * interactive user may place an interactive program inside a loop. If
4505 * the interactive program catches interrupts, the user doesn't want
4506 * these interrupts to also abort the loop. The approach we take here
4507 * is to have the shell ignore interrupt signals while waiting for a
4508 * foreground process to terminate, and then send itself an interrupt
4509 * signal if the child process was terminated by an interrupt signal.
4510 * Unfortunately, some programs want to do a bit of cleanup and then
4511 * exit on interrupt; unless these processes terminate themselves by
4512 * sending a signal to themselves (instead of calling exit) they will
4513 * confuse this approach.
4515 * Called with interrupts off.
4518 waitforjob(struct job *jp)
4522 TRACE(("waitforjob(%%%d) called\n", jobno(jp)));
4523 while (jp->state == JOBRUNNING) {
4524 dowait(DOWAIT_BLOCK, jp);
4529 xtcsetpgrp(ttyfd, rootpid);
4531 * This is truly gross.
4532 * If we're doing job control, then we did a TIOCSPGRP which
4533 * caused us (the shell) to no longer be in the controlling
4534 * session -- so we wouldn't have seen any ^C/SIGINT. So, we
4535 * intuit from the subprocess exit status whether a SIGINT
4536 * occurred, and if so interrupt ourselves. Yuck. - mycroft
4541 if (jp->state == JOBDONE)
4548 * return 1 if there are stopped jobs, otherwise 0
4560 if (jp && jp->state == JOBSTOPPED) {
4561 out2str("You have stopped jobs.\n");
4570 /* ============ redir.c
4572 * Code for dealing with input/output redirection.
4575 #define EMPTY -2 /* marks an unused slot in redirtab */
4577 # define PIPESIZE 4096 /* amount of buffering in a pipe */
4579 # define PIPESIZE PIPE_BUF
4583 * Open a file in noclobber mode.
4584 * The code was copied from bash.
4587 noclobberopen(const char *fname)
4590 struct stat finfo, finfo2;
4593 * If the file exists and is a regular file, return an error
4596 r = stat(fname, &finfo);
4597 if (r == 0 && S_ISREG(finfo.st_mode)) {
4603 * If the file was not present (r != 0), make sure we open it
4604 * exclusively so that if it is created before we open it, our open
4605 * will fail. Make sure that we do not truncate an existing file.
4606 * Note that we don't turn on O_EXCL unless the stat failed -- if the
4607 * file was not a regular file, we leave O_EXCL off.
4610 return open(fname, O_WRONLY|O_CREAT|O_EXCL, 0666);
4611 fd = open(fname, O_WRONLY|O_CREAT, 0666);
4613 /* If the open failed, return the file descriptor right away. */
4618 * OK, the open succeeded, but the file may have been changed from a
4619 * non-regular file to a regular file between the stat and the open.
4620 * We are assuming that the O_EXCL open handles the case where FILENAME
4621 * did not exist and is symlinked to an existing file between the stat
4626 * If we can open it and fstat the file descriptor, and neither check
4627 * revealed that it was a regular file, and the file has not been
4628 * replaced, return the file descriptor.
4630 if (fstat(fd, &finfo2) == 0 && !S_ISREG(finfo2.st_mode)
4631 && finfo.st_dev == finfo2.st_dev && finfo.st_ino == finfo2.st_ino)
4634 /* The file has been replaced. badness. */
4641 * Handle here documents. Normally we fork off a process to write the
4642 * data to a pipe. If the document is short, we can stuff the data in
4643 * the pipe without forking.
4645 /* openhere needs this forward reference */
4646 static void expandhere(union node *arg, int fd);
4648 openhere(union node *redir)
4654 ash_msg_and_raise_error("pipe call failed");
4655 if (redir->type == NHERE) {
4656 len = strlen(redir->nhere.doc->narg.text);
4657 if (len <= PIPESIZE) {
4658 full_write(pip[1], redir->nhere.doc->narg.text, len);
4662 if (forkshell((struct job *)NULL, (union node *)NULL, FORK_NOJOB) == 0) {
4664 signal(SIGINT, SIG_IGN);
4665 signal(SIGQUIT, SIG_IGN);
4666 signal(SIGHUP, SIG_IGN);
4668 signal(SIGTSTP, SIG_IGN);
4670 signal(SIGPIPE, SIG_DFL);
4671 if (redir->type == NHERE)
4672 full_write(pip[1], redir->nhere.doc->narg.text, len);
4674 expandhere(redir->nhere.doc, pip[1]);
4683 openredirect(union node *redir)
4688 switch (redir->nfile.type) {
4690 fname = redir->nfile.expfname;
4691 f = open(fname, O_RDONLY);
4696 fname = redir->nfile.expfname;
4697 f = open(fname, O_RDWR|O_CREAT|O_TRUNC, 0666);
4702 /* Take care of noclobber mode. */
4704 fname = redir->nfile.expfname;
4705 f = noclobberopen(fname);
4712 fname = redir->nfile.expfname;
4713 f = open(fname, O_WRONLY|O_CREAT|O_TRUNC, 0666);
4718 fname = redir->nfile.expfname;
4719 f = open(fname, O_WRONLY|O_CREAT|O_APPEND, 0666);
4727 /* Fall through to eliminate warning. */
4734 f = openhere(redir);
4740 ash_msg_and_raise_error("cannot create %s: %s", fname, errmsg(errno, "nonexistent directory"));
4742 ash_msg_and_raise_error("cannot open %s: %s", fname, errmsg(errno, "no such file"));
4746 * Copy a file descriptor to be >= to. Returns -1
4747 * if the source file descriptor is closed, EMPTY if there are no unused
4748 * file descriptors left.
4751 copyfd(int from, int to)
4755 newfd = fcntl(from, F_DUPFD, to);
4757 if (errno == EMFILE)
4759 ash_msg_and_raise_error("%d: %m", from);
4765 dupredirect(union node *redir, int f)
4767 int fd = redir->nfile.fd;
4769 if (redir->nfile.type == NTOFD || redir->nfile.type == NFROMFD) {
4770 if (redir->ndup.dupfd >= 0) { /* if not ">&-" */
4771 copyfd(redir->ndup.dupfd, fd);
4783 * Process a list of redirection commands. If the REDIR_PUSH flag is set,
4784 * old file descriptors are stashed away so that the redirection can be
4785 * undone by calling popredir. If the REDIR_BACKQ flag is set, then the
4786 * standard output, and the standard error if it becomes a duplicate of
4787 * stdout, is saved in memory.
4789 /* flags passed to redirect */
4790 #define REDIR_PUSH 01 /* save previous values of file descriptors */
4791 #define REDIR_SAVEFD2 03 /* set preverrout */
4793 redirect(union node *redir, int flags)
4796 struct redirtab *sv;
4807 if (flags & REDIR_PUSH) {
4809 q = ckmalloc(sizeof(struct redirtab));
4810 q->next = redirlist;
4812 q->nullredirs = nullredirs - 1;
4813 for (i = 0; i < 10; i++)
4814 q->renamed[i] = EMPTY;
4821 if ((n->nfile.type == NTOFD || n->nfile.type == NFROMFD)
4822 && n->ndup.dupfd == fd)
4823 continue; /* redirect from/to same file descriptor */
4825 newfd = openredirect(n);
4828 if (sv && *(p = &sv->renamed[fd]) == EMPTY) {
4829 i = fcntl(fd, F_DUPFD, 10);
4836 ash_msg_and_raise_error("%d: %m", fd);
4846 dupredirect(n, newfd);
4847 } while ((n = n->nfile.next));
4849 if (flags & REDIR_SAVEFD2 && sv && sv->renamed[2] >= 0)
4850 preverrout_fd = sv->renamed[2];
4854 * Undo the effects of the last redirection.
4859 struct redirtab *rp;
4862 if (--nullredirs >= 0)
4866 for (i = 0; i < 10; i++) {
4867 if (rp->renamed[i] != EMPTY) {
4870 copyfd(rp->renamed[i], i);
4872 close(rp->renamed[i]);
4875 redirlist = rp->next;
4876 nullredirs = rp->nullredirs;
4882 * Undo all redirections. Called on error or interrupt.
4886 * Discard all saved file descriptors.
4889 clearredir(int drop)
4900 redirectsafe(union node *redir, int flags)
4903 volatile int saveint;
4904 struct jmploc *volatile savehandler = exception_handler;
4905 struct jmploc jmploc;
4908 err = setjmp(jmploc.loc) * 2;
4910 exception_handler = &jmploc;
4911 redirect(redir, flags);
4913 exception_handler = savehandler;
4914 if (err && exception != EXERROR)
4915 longjmp(exception_handler->loc, 1);
4916 RESTORE_INT(saveint);
4921 /* ============ Routines to expand arguments to commands
4923 * We have to deal with backquotes, shell variables, and file metacharacters.
4929 #define EXP_FULL 0x1 /* perform word splitting & file globbing */
4930 #define EXP_TILDE 0x2 /* do normal tilde expansion */
4931 #define EXP_VARTILDE 0x4 /* expand tildes in an assignment */
4932 #define EXP_REDIR 0x8 /* file glob for a redirection (1 match only) */
4933 #define EXP_CASE 0x10 /* keeps quotes around for CASE pattern */
4934 #define EXP_RECORD 0x20 /* need to record arguments for ifs breakup */
4935 #define EXP_VARTILDE2 0x40 /* expand tildes after colons only */
4936 #define EXP_WORD 0x80 /* expand word in parameter expansion */
4937 #define EXP_QWORD 0x100 /* expand word in quoted parameter expansion */
4941 #define RMESCAPE_ALLOC 0x1 /* Allocate a new string */
4942 #define RMESCAPE_GLOB 0x2 /* Add backslashes for glob */
4943 #define RMESCAPE_QUOTED 0x4 /* Remove CTLESC unless in quotes */
4944 #define RMESCAPE_GROW 0x8 /* Grow strings instead of stalloc */
4945 #define RMESCAPE_HEAP 0x10 /* Malloc strings instead of stalloc */
4948 * Structure specifying which parts of the string should be searched
4949 * for IFS characters.
4952 struct ifsregion *next; /* next region in list */
4953 int begoff; /* offset of start of region */
4954 int endoff; /* offset of end of region */
4955 int nulonly; /* search for nul bytes only */
4959 struct strlist *list;
4960 struct strlist **lastp;
4963 /* output of current string */
4964 static char *expdest;
4965 /* list of back quote expressions */
4966 static struct nodelist *argbackq;
4967 /* first struct in list of ifs regions */
4968 static struct ifsregion ifsfirst;
4969 /* last struct in list */
4970 static struct ifsregion *ifslastp;
4971 /* holds expanded arg list */
4972 static struct arglist exparg;
4982 expdest = makestrspace(32, expdest);
4983 #if ENABLE_ASH_MATH_SUPPORT_64
4984 len = fmtstr(expdest, 32, "%lld", (long long) num);
4986 len = fmtstr(expdest, 32, "%ld", num);
4988 STADJUST(len, expdest);
4993 esclen(const char *start, const char *p)
4997 while (p > start && *--p == CTLESC) {
5004 * Remove any CTLESC characters from a string.
5007 _rmescapes(char *str, int flag)
5009 static const char qchars[] ALIGN1 = { CTLESC, CTLQUOTEMARK, '\0' };
5016 p = strpbrk(str, qchars);
5022 if (flag & RMESCAPE_ALLOC) {
5023 size_t len = p - str;
5024 size_t fulllen = len + strlen(p) + 1;
5026 if (flag & RMESCAPE_GROW) {
5027 r = makestrspace(fulllen, expdest);
5028 } else if (flag & RMESCAPE_HEAP) {
5029 r = ckmalloc(fulllen);
5031 r = stalloc(fulllen);
5035 q = memcpy(q, str, len) + len;
5038 inquotes = (flag & RMESCAPE_QUOTED) ^ RMESCAPE_QUOTED;
5039 globbing = flag & RMESCAPE_GLOB;
5040 notescaped = globbing;
5042 if (*p == CTLQUOTEMARK) {
5043 inquotes = ~inquotes;
5045 notescaped = globbing;
5049 /* naked back slash */
5055 if (notescaped && inquotes && *p != '/') {
5059 notescaped = globbing;
5064 if (flag & RMESCAPE_GROW) {
5066 STADJUST(q - r + 1, expdest);
5070 #define rmescapes(p) _rmescapes((p), 0)
5072 #define pmatch(a, b) !fnmatch((a), (b), 0)
5075 * Prepare a pattern for a expmeta (internal glob(3)) call.
5077 * Returns an stalloced string.
5080 preglob(const char *pattern, int quoted, int flag)
5082 flag |= RMESCAPE_GLOB;
5084 flag |= RMESCAPE_QUOTED;
5086 return _rmescapes((char *)pattern, flag);
5090 * Put a string on the stack.
5093 memtodest(const char *p, size_t len, int syntax, int quotes)
5097 q = makestrspace(len * 2, q);
5100 int c = signed_char2int(*p++);
5103 if (quotes && (SIT(c, syntax) == CCTL || SIT(c, syntax) == CBACK))
5112 strtodest(const char *p, int syntax, int quotes)
5114 memtodest(p, strlen(p), syntax, quotes);
5118 * Record the fact that we have to scan this region of the
5119 * string for IFS characters.
5122 recordregion(int start, int end, int nulonly)
5124 struct ifsregion *ifsp;
5126 if (ifslastp == NULL) {
5130 ifsp = ckmalloc(sizeof(*ifsp));
5132 ifslastp->next = ifsp;
5136 ifslastp->begoff = start;
5137 ifslastp->endoff = end;
5138 ifslastp->nulonly = nulonly;
5142 removerecordregions(int endoff)
5144 if (ifslastp == NULL)
5147 if (ifsfirst.endoff > endoff) {
5148 while (ifsfirst.next != NULL) {
5149 struct ifsregion *ifsp;
5151 ifsp = ifsfirst.next->next;
5152 free(ifsfirst.next);
5153 ifsfirst.next = ifsp;
5156 if (ifsfirst.begoff > endoff)
5159 ifslastp = &ifsfirst;
5160 ifsfirst.endoff = endoff;
5165 ifslastp = &ifsfirst;
5166 while (ifslastp->next && ifslastp->next->begoff < endoff)
5167 ifslastp=ifslastp->next;
5168 while (ifslastp->next != NULL) {
5169 struct ifsregion *ifsp;
5171 ifsp = ifslastp->next->next;
5172 free(ifslastp->next);
5173 ifslastp->next = ifsp;
5176 if (ifslastp->endoff > endoff)
5177 ifslastp->endoff = endoff;
5181 exptilde(char *startp, char *p, int flag)
5187 int quotes = flag & (EXP_FULL | EXP_CASE);
5192 while ((c = *++p) != '\0') {
5199 if (flag & EXP_VARTILDE)
5209 if (*name == '\0') {
5210 home = lookupvar(homestr);
5212 pw = getpwnam(name);
5217 if (!home || !*home)
5220 startloc = expdest - (char *)stackblock();
5221 strtodest(home, SQSYNTAX, quotes);
5222 recordregion(startloc, expdest - (char *)stackblock(), 0);
5230 * Execute a command inside back quotes. If it's a builtin command, we
5231 * want to save its output in a block obtained from malloc. Otherwise
5232 * we fork off a subprocess and get the output of the command via a pipe.
5233 * Should be called with interrupts off.
5235 struct backcmd { /* result of evalbackcmd */
5236 int fd; /* file descriptor to read from */
5237 char *buf; /* buffer */
5238 int nleft; /* number of chars in buffer */
5239 struct job *jp; /* job structure for command */
5242 /* These forward decls are needed to use "eval" code for backticks handling: */
5243 static int back_exitstatus; /* exit status of backquoted command */
5244 #define EV_EXIT 01 /* exit after evaluating tree */
5245 static void evaltree(union node *, int);
5248 evalbackcmd(union node *n, struct backcmd *result)
5260 saveherefd = herefd;
5268 ash_msg_and_raise_error("pipe call failed");
5270 if (forkshell(jp, n, FORK_NOJOB) == 0) {
5279 evaltree(n, EV_EXIT); /* actually evaltreenr... */
5283 result->fd = pip[0];
5286 herefd = saveherefd;
5288 TRACE(("evalbackcmd done: fd=%d buf=0x%x nleft=%d jp=0x%x\n",
5289 result->fd, result->buf, result->nleft, result->jp));
5293 * Expand stuff in backwards quotes.
5296 expbackq(union node *cmd, int quoted, int quotes)
5304 int syntax = quoted? DQSYNTAX : BASESYNTAX;
5305 struct stackmark smark;
5308 setstackmark(&smark);
5310 startloc = dest - (char *)stackblock();
5312 evalbackcmd(cmd, &in);
5313 popstackmark(&smark);
5320 memtodest(p, i, syntax, quotes);
5324 i = safe_read(in.fd, buf, sizeof(buf));
5325 TRACE(("expbackq: read returns %d\n", i));
5335 back_exitstatus = waitforjob(in.jp);
5339 /* Eat all trailing newlines */
5341 for (; dest > (char *)stackblock() && dest[-1] == '\n';)
5346 recordregion(startloc, dest - (char *)stackblock(), 0);
5347 TRACE(("evalbackq: size=%d: \"%.*s\"\n",
5348 (dest - (char *)stackblock()) - startloc,
5349 (dest - (char *)stackblock()) - startloc,
5350 stackblock() + startloc));
5353 #if ENABLE_ASH_MATH_SUPPORT
5355 * Expand arithmetic expression. Backup to start of expression,
5356 * evaluate, place result in (backed up) result, adjust string position.
5369 * This routine is slightly over-complicated for
5370 * efficiency. Next we scan backwards looking for the
5371 * start of arithmetic.
5373 start = stackblock();
5380 while (*p != CTLARI) {
5384 ash_msg_and_raise_error("missing CTLARI (shouldn't happen)");
5389 esc = esclen(start, p);
5399 removerecordregions(begoff);
5408 len = cvtnum(dash_arith(p + 2));
5411 recordregion(begoff, begoff + len, 0);
5415 /* argstr needs it */
5416 static char *evalvar(char *p, int flag);
5419 * Perform variable and command substitution. If EXP_FULL is set, output CTLESC
5420 * characters to allow for further processing. Otherwise treat
5421 * $@ like $* since no splitting will be performed.
5424 argstr(char *p, int flag)
5426 static const char spclchars[] ALIGN1 = {
5434 CTLBACKQ | CTLQUOTE,
5435 #if ENABLE_ASH_MATH_SUPPORT
5440 const char *reject = spclchars;
5442 int quotes = flag & (EXP_FULL | EXP_CASE); /* do CTLESC */
5443 int breakall = flag & EXP_WORD;
5448 if (!(flag & EXP_VARTILDE)) {
5450 } else if (flag & EXP_VARTILDE2) {
5455 if (flag & EXP_TILDE) {
5461 if (*q == CTLESC && (flag & EXP_QWORD))
5464 p = exptilde(p, q, flag);
5467 startloc = expdest - (char *)stackblock();
5469 length += strcspn(p + length, reject);
5471 if (c && (!(c & 0x80)
5472 #if ENABLE_ASH_MATH_SUPPORT
5476 /* c == '=' || c == ':' || c == CTLENDARI */
5481 expdest = stack_nputstr(p, length, expdest);
5482 newloc = expdest - (char *)stackblock();
5483 if (breakall && !inquotes && newloc > startloc) {
5484 recordregion(startloc, newloc, 0);
5495 if (flag & EXP_VARTILDE2) {
5499 flag |= EXP_VARTILDE2;
5504 * sort of a hack - expand tildes in variable
5505 * assignments (after the first '=' and after ':'s).
5514 case CTLENDVAR: /* ??? */
5517 /* "$@" syntax adherence hack */
5520 !memcmp(p, dolatstr, 4) &&
5521 (p[4] == CTLQUOTEMARK || (
5522 p[4] == CTLENDVAR &&
5523 p[5] == CTLQUOTEMARK
5526 p = evalvar(p + 1, flag) + 1;
5529 inquotes = !inquotes;
5542 p = evalvar(p, flag);
5546 case CTLBACKQ|CTLQUOTE:
5547 expbackq(argbackq->n, c, quotes);
5548 argbackq = argbackq->next;
5550 #if ENABLE_ASH_MATH_SUPPORT
5563 scanleft(char *startp, char *rmesc, char *rmescend, char *str, int quotes,
5574 const char *s = loc2;
5580 match = pmatch(str, s);
5584 if (quotes && *loc == CTLESC)
5593 scanright(char *startp, char *rmesc, char *rmescend, char *str, int quotes,
5600 for (loc = str - 1, loc2 = rmescend; loc >= startp; loc2--) {
5603 const char *s = loc2;
5608 match = pmatch(str, s);
5615 esc = esclen(startp, loc);
5626 static void varunset(const char *, const char *, const char *, int) ATTRIBUTE_NORETURN;
5628 varunset(const char *end, const char *var, const char *umsg, int varflags)
5634 msg = "parameter not set";
5636 if (*end == CTLENDVAR) {
5637 if (varflags & VSNUL)
5642 ash_msg_and_raise_error("%.*s: %s%s", end - var - 1, var, msg, tail);
5646 subevalvar(char *p, char *str, int strloc, int subtype, int startloc, int varflags, int quotes)
5650 int saveherefd = herefd;
5651 struct nodelist *saveargbackq = argbackq;
5653 char *rmesc, *rmescend;
5655 char *(*scan)(char *, char *, char *, char *, int , int);
5658 argstr(p, subtype != VSASSIGN && subtype != VSQUESTION ? EXP_CASE : 0);
5659 STPUTC('\0', expdest);
5660 herefd = saveherefd;
5661 argbackq = saveargbackq;
5662 startp = stackblock() + startloc;
5666 setvar(str, startp, 0);
5667 amount = startp - expdest;
5668 STADJUST(amount, expdest);
5672 varunset(p, str, startp, varflags);
5676 subtype -= VSTRIMRIGHT;
5678 if (subtype < 0 || subtype > 3)
5683 rmescend = stackblock() + strloc;
5685 rmesc = _rmescapes(startp, RMESCAPE_ALLOC | RMESCAPE_GROW);
5686 if (rmesc != startp) {
5688 startp = stackblock() + startloc;
5692 str = stackblock() + strloc;
5693 preglob(str, varflags & VSQUOTE, 0);
5695 /* zero = subtype == VSTRIMLEFT || subtype == VSTRIMLEFTMAX */
5696 zero = subtype >> 1;
5697 /* VSTRIMLEFT/VSTRIMRIGHTMAX -> scanleft */
5698 scan = (subtype & 1) ^ zero ? scanleft : scanright;
5700 loc = scan(startp, rmesc, rmescend, str, quotes, zero);
5703 memmove(startp, loc, str - loc);
5704 loc = startp + (str - loc) - 1;
5707 amount = loc - expdest;
5708 STADJUST(amount, expdest);
5714 * Add the value of a specialized variable to the stack string.
5717 varvalue(char *name, int varflags, int flags)
5727 int quoted = varflags & VSQUOTE;
5728 int subtype = varflags & VSTYPE;
5729 int quotes = flags & (EXP_FULL | EXP_CASE);
5731 if (quoted && (flags & EXP_FULL))
5732 sep = 1 << CHAR_BIT;
5734 syntax = quoted ? DQSYNTAX : BASESYNTAX;
5743 num = shellparam.nparam;
5753 p = makestrspace(NOPTS, expdest);
5754 for (i = NOPTS - 1; i >= 0; i--) {
5756 USTPUTC(optletters(i), p);
5767 sep = ifsset() ? signed_char2int(ifsval()[0]) : ' ';
5768 if (quotes && (SIT(sep, syntax) == CCTL || SIT(sep, syntax) == CBACK))
5774 while ((p = *ap++)) {
5777 partlen = strlen(p);
5780 if (!(subtype == VSPLUS || subtype == VSLENGTH))
5781 memtodest(p, partlen, syntax, quotes);
5787 if (subtype == VSPLUS || subtype == VSLENGTH) {
5809 if (num < 0 || num > shellparam.nparam)
5811 p = num ? shellparam.p[num - 1] : arg0;
5814 p = lookupvar(name);
5820 if (!(subtype == VSPLUS || subtype == VSLENGTH))
5821 memtodest(p, len, syntax, quotes);
5825 if (subtype == VSPLUS || subtype == VSLENGTH)
5826 STADJUST(-len, expdest);
5831 * Expand a variable, and return a pointer to the next character in the
5835 evalvar(char *p, int flag)
5848 quotes = flag & (EXP_FULL | EXP_CASE);
5850 subtype = varflags & VSTYPE;
5851 quoted = varflags & VSQUOTE;
5853 easy = (!quoted || (*var == '@' && shellparam.nparam));
5854 startloc = expdest - (char *)stackblock();
5855 p = strchr(p, '=') + 1;
5858 varlen = varvalue(var, varflags, flag);
5859 if (varflags & VSNUL)
5862 if (subtype == VSPLUS) {
5863 varlen = -1 - varlen;
5867 if (subtype == VSMINUS) {
5871 p, flag | EXP_TILDE |
5872 (quoted ? EXP_QWORD : EXP_WORD)
5881 if (subtype == VSASSIGN || subtype == VSQUESTION) {
5883 if (subevalvar(p, var, 0, subtype, startloc, varflags, 0)) {
5886 * Remove any recorded regions beyond
5889 removerecordregions(startloc);
5899 if (varlen < 0 && uflag)
5900 varunset(p, var, 0, 0);
5902 if (subtype == VSLENGTH) {
5903 cvtnum(varlen > 0 ? varlen : 0);
5907 if (subtype == VSNORMAL) {
5911 recordregion(startloc, expdest - (char *)stackblock(), quoted);
5920 case VSTRIMRIGHTMAX:
5929 * Terminate the string and start recording the pattern
5932 STPUTC('\0', expdest);
5933 patloc = expdest - (char *)stackblock();
5934 if (subevalvar(p, NULL, patloc, subtype,
5935 startloc, varflags, quotes) == 0) {
5936 int amount = expdest - (
5937 (char *)stackblock() + patloc - 1
5939 STADJUST(-amount, expdest);
5941 /* Remove any recorded regions beyond start of variable */
5942 removerecordregions(startloc);
5947 if (subtype != VSNORMAL) { /* skip to end of alternative */
5953 else if (c == CTLBACKQ || c == (CTLBACKQ|CTLQUOTE)) {
5955 argbackq = argbackq->next;
5956 } else if (c == CTLVAR) {
5957 if ((*p++ & VSTYPE) != VSNORMAL)
5959 } else if (c == CTLENDVAR) {
5969 * Break the argument string into pieces based upon IFS and add the
5970 * strings to the argument list. The regions of the string to be
5971 * searched for IFS characters have been stored by recordregion.
5974 ifsbreakup(char *string, struct arglist *arglist)
5976 struct ifsregion *ifsp;
5981 const char *ifs, *realifs;
5986 if (ifslastp != NULL) {
5989 realifs = ifsset() ? ifsval() : defifs;
5992 p = string + ifsp->begoff;
5993 nulonly = ifsp->nulonly;
5994 ifs = nulonly ? nullstr : realifs;
5996 while (p < string + ifsp->endoff) {
6000 if (!strchr(ifs, *p)) {
6005 ifsspc = (strchr(defifs, *p) != NULL);
6006 /* Ignore IFS whitespace at start */
6007 if (q == start && ifsspc) {
6013 sp = stalloc(sizeof(*sp));
6015 *arglist->lastp = sp;
6016 arglist->lastp = &sp->next;
6020 if (p >= string + ifsp->endoff) {
6026 if (strchr(ifs, *p) == NULL ) {
6029 } else if (strchr(defifs, *p) == NULL) {
6044 } while (ifsp != NULL);
6053 sp = stalloc(sizeof(*sp));
6055 *arglist->lastp = sp;
6056 arglist->lastp = &sp->next;
6062 struct ifsregion *p;
6067 struct ifsregion *ifsp;
6073 ifsfirst.next = NULL;
6078 * Add a file name to the list.
6081 addfname(const char *name)
6085 sp = stalloc(sizeof(*sp));
6086 sp->text = ststrdup(name);
6088 exparg.lastp = &sp->next;
6091 static char *expdir;
6094 * Do metacharacter (i.e. *, ?, [...]) expansion.
6097 expmeta(char *enddir, char *name)
6112 for (p = name; *p; p++) {
6113 if (*p == '*' || *p == '?')
6115 else if (*p == '[') {
6122 if (*q == '/' || *q == '\0')
6129 } else if (*p == '\\')
6131 else if (*p == '/') {
6138 if (metaflag == 0) { /* we've reached the end of the file name */
6139 if (enddir != expdir)
6147 if (metaflag == 0 || lstat(expdir, &statb) >= 0)
6158 } while (p < start);
6160 if (enddir == expdir) {
6162 } else if (enddir == expdir + 1 && *expdir == '/') {
6171 if (enddir != expdir)
6173 if (*endname == 0) {
6185 while (! intpending && (dp = readdir(dirp)) != NULL) {
6186 if (dp->d_name[0] == '.' && ! matchdot)
6188 if (pmatch(start, dp->d_name)) {
6190 strcpy(enddir, dp->d_name);
6193 for (p = enddir, cp = dp->d_name; (*p++ = *cp++) != '\0';)
6196 expmeta(p, endname);
6205 static struct strlist *
6206 msort(struct strlist *list, int len)
6208 struct strlist *p, *q = NULL;
6209 struct strlist **lpp;
6217 for (n = half; --n >= 0; ) {
6221 q->next = NULL; /* terminate first half of list */
6222 q = msort(list, half); /* sort first half of list */
6223 p = msort(p, len - half); /* sort second half */
6226 #if ENABLE_LOCALE_SUPPORT
6227 if (strcoll(p->text, q->text) < 0)
6229 if (strcmp(p->text, q->text) < 0)
6253 * Sort the results of file name expansion. It calculates the number of
6254 * strings to sort and then calls msort (short for merge sort) to do the
6257 static struct strlist *
6258 expsort(struct strlist *str)
6264 for (sp = str; sp; sp = sp->next)
6266 return msort(str, len);
6270 expandmeta(struct strlist *str, int flag)
6272 static const char metachars[] ALIGN1 = {
6275 /* TODO - EXP_REDIR */
6278 struct strlist **savelastp;
6284 if (!strpbrk(str->text, metachars))
6286 savelastp = exparg.lastp;
6289 p = preglob(str->text, 0, RMESCAPE_ALLOC | RMESCAPE_HEAP);
6291 int i = strlen(str->text);
6292 expdir = ckmalloc(i < 2048 ? 2048 : i); /* XXX */
6300 if (exparg.lastp == savelastp) {
6305 *exparg.lastp = str;
6306 rmescapes(str->text);
6307 exparg.lastp = &str->next;
6309 *exparg.lastp = NULL;
6310 *savelastp = sp = expsort(*savelastp);
6311 while (sp->next != NULL)
6313 exparg.lastp = &sp->next;
6320 * Perform variable substitution and command substitution on an argument,
6321 * placing the resulting list of arguments in arglist. If EXP_FULL is true,
6322 * perform splitting and file name expansion. When arglist is NULL, perform
6323 * here document expansion.
6326 expandarg(union node *arg, struct arglist *arglist, int flag)
6331 argbackq = arg->narg.backquote;
6332 STARTSTACKSTR(expdest);
6333 ifsfirst.next = NULL;
6335 argstr(arg->narg.text, flag);
6336 p = _STPUTC('\0', expdest);
6338 if (arglist == NULL) {
6339 return; /* here document expanded */
6341 p = grabstackstr(p);
6342 exparg.lastp = &exparg.list;
6346 if (flag & EXP_FULL) {
6347 ifsbreakup(p, &exparg);
6348 *exparg.lastp = NULL;
6349 exparg.lastp = &exparg.list;
6350 expandmeta(exparg.list, flag);
6352 if (flag & EXP_REDIR) /*XXX - for now, just remove escapes */
6354 sp = stalloc(sizeof(*sp));
6357 exparg.lastp = &sp->next;
6361 *exparg.lastp = NULL;
6363 *arglist->lastp = exparg.list;
6364 arglist->lastp = exparg.lastp;
6369 * Expand shell variables and backquotes inside a here document.
6372 expandhere(union node *arg, int fd)
6375 expandarg(arg, (struct arglist *)NULL, 0);
6376 full_write(fd, stackblock(), expdest - (char *)stackblock());
6380 * Returns true if the pattern matches the string.
6383 patmatch(char *pattern, const char *string)
6385 return pmatch(preglob(pattern, 0, 0), string);
6389 * See if a pattern matches in a case statement.
6392 casematch(union node *pattern, char *val)
6394 struct stackmark smark;
6397 setstackmark(&smark);
6398 argbackq = pattern->narg.backquote;
6399 STARTSTACKSTR(expdest);
6401 argstr(pattern->narg.text, EXP_TILDE | EXP_CASE);
6402 STACKSTRNUL(expdest);
6403 result = patmatch(stackblock(), val);
6404 popstackmark(&smark);
6409 /* ============ find_command */
6413 int (*builtin)(int, char **);
6414 /* unsigned flags; */
6416 #define IS_BUILTIN_SPECIAL(b) ((b)->name[0] & 1)
6417 #define IS_BUILTIN_REGULAR(b) ((b)->name[0] & 2)
6418 #define IS_BUILTIN_ASSIGN(b) ((b)->name[0] & 4)
6424 const struct builtincmd *cmd;
6425 struct funcnode *func;
6428 /* values of cmdtype */
6429 #define CMDUNKNOWN -1 /* no entry in table for command */
6430 #define CMDNORMAL 0 /* command is an executable program */
6431 #define CMDFUNCTION 1 /* command is a shell function */
6432 #define CMDBUILTIN 2 /* command is a shell builtin */
6434 /* action to find_command() */
6435 #define DO_ERR 0x01 /* prints errors */
6436 #define DO_ABS 0x02 /* checks absolute paths */
6437 #define DO_NOFUNC 0x04 /* don't return shell functions, for command */
6438 #define DO_ALTPATH 0x08 /* using alternate path */
6439 #define DO_ALTBLTIN 0x20 /* %builtin in alt. path */
6441 static void find_command(char *, struct cmdentry *, int, const char *);
6444 /* ============ Hashing commands */
6447 * When commands are first encountered, they are entered in a hash table.
6448 * This ensures that a full path search will not have to be done for them
6449 * on each invocation.
6451 * We should investigate converting to a linear search, even though that
6452 * would make the command name "hash" a misnomer.
6455 #define CMDTABLESIZE 31 /* should be prime */
6456 #define ARB 1 /* actual size determined at run time */
6459 struct tblentry *next; /* next entry in hash chain */
6460 union param param; /* definition of builtin function */
6461 short cmdtype; /* index identifying command */
6462 char rehash; /* if set, cd done since entry created */
6463 char cmdname[ARB]; /* name of command */
6466 static struct tblentry *cmdtable[CMDTABLESIZE];
6467 static int builtinloc = -1; /* index in path of %builtin, or -1 */
6470 tryexec(char *cmd, char **argv, char **envp)
6474 #if ENABLE_FEATURE_SH_STANDALONE
6475 if (strchr(cmd, '/') == NULL) {
6476 const struct bb_applet *a;
6478 a = find_applet_by_name(cmd);
6482 run_current_applet_and_exit(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 dprintf(preverrout_fd, p, expandstr(ps4val()));
8252 for (n = 0; n < 2; n++) {
8254 dprintf(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;
8795 parsefile = pf->prev;
8797 parsenleft = parsefile->nleft;
8798 parselleft = parsefile->lleft;
8799 parsenextc = parsefile->nextc;
8800 plinno = parsefile->linno;
8805 * Return to top level.
8810 while (parsefile != &basepf)
8815 * Close the file(s) that the shell is reading commands from. Called
8816 * after a fork is done.
8822 if (parsefile->fd > 0) {
8823 close(parsefile->fd);
8829 * Like setinputfile, but takes an open file descriptor. Call this with
8833 setinputfd(int fd, int push)
8835 fcntl(fd, F_SETFD, FD_CLOEXEC);
8841 if (parsefile->buf == NULL)
8842 parsefile->buf = ckmalloc(IBUFSIZ);
8843 parselleft = parsenleft = 0;
8848 * Set the input to take input from a file. If push is set, push the
8849 * old input onto the stack first.
8852 setinputfile(const char *fname, int flags)
8858 fd = open(fname, O_RDONLY);
8860 if (flags & INPUT_NOFILE_OK)
8862 ash_msg_and_raise_error("can't open %s", fname);
8865 fd2 = copyfd(fd, 10);
8868 ash_msg_and_raise_error("out of file descriptors");
8871 setinputfd(fd, flags & INPUT_PUSH_FILE);
8878 * Like setinputfile, but takes input from a string.
8881 setinputstring(char *string)
8885 parsenextc = string;
8886 parsenleft = strlen(string);
8887 parsefile->buf = NULL;
8893 /* ============ mail.c
8895 * Routines to check for mail.
8900 #define MAXMBOXES 10
8902 /* times of mailboxes */
8903 static time_t mailtime[MAXMBOXES];
8904 /* Set if MAIL or MAILPATH is changed. */
8905 static smallint mail_var_path_changed;
8908 * Print appropriate message(s) if mail has arrived.
8909 * If mail_var_path_changed is set,
8910 * then the value of MAIL has mail_var_path_changed,
8911 * so we just update the values.
8920 struct stackmark smark;
8923 setstackmark(&smark);
8924 mpath = mpathset() ? mpathval() : mailval();
8925 for (mtp = mailtime; mtp < mailtime + MAXMBOXES; mtp++) {
8926 p = padvance(&mpath, nullstr);
8931 for (q = p; *q; q++);
8936 q[-1] = '\0'; /* delete trailing '/' */
8937 if (stat(p, &statb) < 0) {
8941 if (!mail_var_path_changed && statb.st_mtime != *mtp) {
8944 pathopt ? pathopt : "you have mail"
8947 *mtp = statb.st_mtime;
8949 mail_var_path_changed = 0;
8950 popstackmark(&smark);
8954 changemail(const char *val)
8956 mail_var_path_changed = 1;
8959 #endif /* ASH_MAIL */
8962 /* ============ ??? */
8965 * Set the shell parameters.
8968 setparam(char **argv)
8974 for (nparam = 0; argv[nparam]; nparam++);
8975 ap = newparam = ckmalloc((nparam + 1) * sizeof(*ap));
8977 *ap++ = ckstrdup(*argv++);
8980 freeparam(&shellparam);
8981 shellparam.malloc = 1;
8982 shellparam.nparam = nparam;
8983 shellparam.p = newparam;
8984 #if ENABLE_ASH_GETOPTS
8985 shellparam.optind = 1;
8986 shellparam.optoff = -1;
8991 * Process shell options. The global variable argptr contains a pointer
8992 * to the argument list; we advance it past the options.
8995 minus_o(char *name, int val)
9000 for (i = 0; i < NOPTS; i++) {
9001 if (strcmp(name, optnames(i)) == 0) {
9006 ash_msg_and_raise_error("illegal option -o %s", name);
9008 out1str("Current option settings\n");
9009 for (i = 0; i < NOPTS; i++)
9010 out1fmt("%-16s%s\n", optnames(i),
9011 optlist[i] ? "on" : "off");
9014 setoption(int flag, int val)
9018 for (i = 0; i < NOPTS; i++) {
9019 if (optletters(i) == flag) {
9024 ash_msg_and_raise_error("illegal option -%c", flag);
9028 options(int cmdline)
9036 while ((p = *argptr) != NULL) {
9038 if (c != '-' && c != '+')
9041 val = 0; /* val = 0 if c == '+' */
9044 if (p[0] == '\0' || LONE_DASH(p)) {
9046 /* "-" means turn off -x and -v */
9049 /* "--" means reset params */
9050 else if (*argptr == NULL)
9053 break; /* "-" or "--" terminates options */
9056 /* first char was + or - */
9057 while ((c = *p++) != '\0') {
9058 /* bash 3.2 indeed handles -c CMD and +c CMD the same */
9059 if (c == 'c' && cmdline) {
9060 minusc = p; /* command is after shell args */
9061 } else if (c == 'o') {
9062 minus_o(*argptr, val);
9065 } else if (cmdline && (c == 'l')) { /* -l or +l == --login */
9067 /* bash does not accept +-login, we also won't */
9068 } else if (cmdline && val && (c == '-')) { /* long options */
9069 if (strcmp(p, "login") == 0)
9080 * The shift builtin command.
9083 shiftcmd(int argc, char **argv)
9090 n = number(argv[1]);
9091 if (n > shellparam.nparam)
9092 ash_msg_and_raise_error("can't shift that many");
9094 shellparam.nparam -= n;
9095 for (ap1 = shellparam.p; --n >= 0; ap1++) {
9096 if (shellparam.malloc)
9100 while ((*ap2++ = *ap1++) != NULL);
9101 #if ENABLE_ASH_GETOPTS
9102 shellparam.optind = 1;
9103 shellparam.optoff = -1;
9110 * POSIX requires that 'set' (but not export or readonly) output the
9111 * variables in lexicographic order - by the locale's collating order (sigh).
9112 * Maybe we could keep them in an ordered balanced binary tree
9113 * instead of hashed lists.
9114 * For now just roll 'em through qsort for printing...
9117 showvars(const char *sep_prefix, int on, int off)
9122 ep = listvars(on, off, &epend);
9123 qsort(ep, epend - ep, sizeof(char *), vpcmp);
9125 sep = *sep_prefix ? " " : sep_prefix;
9127 for (; ep < epend; ep++) {
9131 p = strchrnul(*ep, '=');
9134 q = single_quote(++p);
9135 out1fmt("%s%s%.*s%s\n", sep_prefix, sep, (int)(p - *ep), *ep, q);
9141 * The set command builtin.
9144 setcmd(int argc, char **argv)
9147 return showvars(nullstr, 0, VUNSET);
9151 if (*argptr != NULL) {
9158 #if ENABLE_ASH_RANDOM_SUPPORT
9159 /* Roughly copied from bash.. */
9161 change_random(const char *value)
9163 if (value == NULL) {
9164 /* "get", generate */
9167 rseed = rseed * 1103515245 + 12345;
9168 sprintf(buf, "%d", (unsigned int)((rseed & 32767)));
9169 /* set without recursion */
9170 setvar(vrandom.text, buf, VNOFUNC);
9171 vrandom.flags &= ~VNOFUNC;
9174 rseed = strtoul(value, (char **)NULL, 10);
9179 #if ENABLE_ASH_GETOPTS
9181 getopts(char *optstr, char *optvar, char **optfirst, int *param_optind, int *optoff)
9190 if (*param_optind < 1)
9192 optnext = optfirst + *param_optind - 1;
9194 if (*param_optind <= 1 || *optoff < 0 || strlen(optnext[-1]) < *optoff)
9197 p = optnext[-1] + *optoff;
9198 if (p == NULL || *p == '\0') {
9199 /* Current word is done, advance */
9201 if (p == NULL || *p != '-' || *++p == '\0') {
9208 if (LONE_DASH(p)) /* check for "--" */
9213 for (q = optstr; *q != c; ) {
9215 if (optstr[0] == ':') {
9218 err |= setvarsafe("OPTARG", s, 0);
9220 fprintf(stderr, "Illegal option -%c\n", c);
9231 if (*p == '\0' && (p = *optnext) == NULL) {
9232 if (optstr[0] == ':') {
9235 err |= setvarsafe("OPTARG", s, 0);
9238 fprintf(stderr, "No arg for -%c option\n", c);
9247 err |= setvarsafe("OPTARG", p, 0);
9250 err |= setvarsafe("OPTARG", nullstr, 0);
9252 *optoff = p ? p - *(optnext - 1) : -1;
9253 *param_optind = optnext - optfirst + 1;
9254 fmtstr(s, sizeof(s), "%d", *param_optind);
9255 err |= setvarsafe("OPTIND", s, VNOFUNC);
9258 err |= setvarsafe(optvar, s, 0);
9262 flush_stdout_stderr();
9263 raise_exception(EXERROR);
9269 * The getopts builtin. Shellparam.optnext points to the next argument
9270 * to be processed. Shellparam.optptr points to the next character to
9271 * be processed in the current argument. If shellparam.optnext is NULL,
9272 * then it's the first time getopts has been called.
9275 getoptscmd(int argc, char **argv)
9280 ash_msg_and_raise_error("usage: getopts optstring var [arg]");
9282 optbase = shellparam.p;
9283 if (shellparam.optind > shellparam.nparam + 1) {
9284 shellparam.optind = 1;
9285 shellparam.optoff = -1;
9289 if (shellparam.optind > argc - 2) {
9290 shellparam.optind = 1;
9291 shellparam.optoff = -1;
9295 return getopts(argv[1], argv[2], optbase, &shellparam.optind,
9296 &shellparam.optoff);
9298 #endif /* ASH_GETOPTS */
9301 /* ============ Shell parser */
9304 * NEOF is returned by parsecmd when it encounters an end of file. It
9305 * must be distinct from NULL, so we use the address of a variable that
9306 * happens to be handy.
9308 static smallint tokpushback; /* last token pushed back */
9309 #define NEOF ((union node *)&tokpushback)
9310 static smallint parsebackquote; /* nonzero if we are inside backquotes */
9311 static int lasttoken; /* last token read */
9312 static char *wordtext; /* text of last word returned by readtoken */
9313 static struct nodelist *backquotelist;
9314 static union node *redirnode;
9315 static struct heredoc *heredoc;
9316 static smallint quoteflag; /* set if (part of) last token was quoted */
9318 static void raise_error_syntax(const char *) ATTRIBUTE_NORETURN;
9320 raise_error_syntax(const char *msg)
9322 ash_msg_and_raise_error("syntax error: %s", msg);
9327 * Called when an unexpected token is read during the parse. The argument
9328 * is the token that is expected, or -1 if more than one type of token can
9329 * occur at this point.
9331 static void raise_error_unexpected_syntax(int) ATTRIBUTE_NORETURN;
9333 raise_error_unexpected_syntax(int token)
9338 l = sprintf(msg, "%s unexpected", tokname(lasttoken));
9340 sprintf(msg + l, " (expecting %s)", tokname(token));
9341 raise_error_syntax(msg);
9345 #define EOFMARKLEN 79
9348 struct heredoc *next; /* next here document in list */
9349 union node *here; /* redirection node */
9350 char *eofmark; /* string indicating end of input */
9351 int striptabs; /* if set, strip leading tabs */
9354 static struct heredoc *heredoclist; /* list of here documents to read */
9356 /* parsing is heavily cross-recursive, need these forward decls */
9357 static union node *andor(void);
9358 static union node *pipeline(void);
9359 static union node *parse_command(void);
9360 static void parseheredoc(void);
9361 static char peektoken(void);
9362 static int readtoken(void);
9367 union node *n1, *n2, *n3;
9370 checkkwd = CHKNL | CHKKWD | CHKALIAS;
9371 if (nlflag == 2 && peektoken())
9377 if (tok == TBACKGND) {
9378 if (n2->type == NPIPE) {
9379 n2->npipe.backgnd = 1;
9381 if (n2->type != NREDIR) {
9382 n3 = stalloc(sizeof(struct nredir));
9384 n3->nredir.redirect = NULL;
9387 n2->type = NBACKGND;
9393 n3 = stalloc(sizeof(struct nbinary));
9395 n3->nbinary.ch1 = n1;
9396 n3->nbinary.ch2 = n2;
9412 checkkwd = CHKNL | CHKKWD | CHKALIAS;
9420 pungetc(); /* push back EOF on input */
9424 raise_error_unexpected_syntax(-1);
9434 union node *n1, *n2, *n3;
9442 } else if (t == TOR) {
9448 checkkwd = CHKNL | CHKKWD | CHKALIAS;
9450 n3 = stalloc(sizeof(struct nbinary));
9452 n3->nbinary.ch1 = n1;
9453 n3->nbinary.ch2 = n2;
9461 union node *n1, *n2, *pipenode;
9462 struct nodelist *lp, *prev;
9466 TRACE(("pipeline: entered\n"));
9467 if (readtoken() == TNOT) {
9469 checkkwd = CHKKWD | CHKALIAS;
9472 n1 = parse_command();
9473 if (readtoken() == TPIPE) {
9474 pipenode = stalloc(sizeof(struct npipe));
9475 pipenode->type = NPIPE;
9476 pipenode->npipe.backgnd = 0;
9477 lp = stalloc(sizeof(struct nodelist));
9478 pipenode->npipe.cmdlist = lp;
9482 lp = stalloc(sizeof(struct nodelist));
9483 checkkwd = CHKNL | CHKKWD | CHKALIAS;
9484 lp->n = parse_command();
9486 } while (readtoken() == TPIPE);
9492 n2 = stalloc(sizeof(struct nnot));
9505 n = stalloc(sizeof(struct narg));
9507 n->narg.next = NULL;
9508 n->narg.text = wordtext;
9509 n->narg.backquote = backquotelist;
9514 fixredir(union node *n, const char *text, int err)
9516 TRACE(("Fix redir %s %d\n", text, err));
9518 n->ndup.vname = NULL;
9520 if (isdigit(text[0]) && text[1] == '\0')
9521 n->ndup.dupfd = text[0] - '0';
9522 else if (LONE_DASH(text))
9526 raise_error_syntax("Bad fd number");
9527 n->ndup.vname = makename();
9532 * Returns true if the text contains nothing to expand (no dollar signs
9536 noexpand(char *text)
9542 while ((c = *p++) != '\0') {
9543 if (c == CTLQUOTEMARK)
9547 else if (SIT(c, BASESYNTAX) == CCTL)
9556 union node *n = redirnode;
9558 if (readtoken() != TWORD)
9559 raise_error_unexpected_syntax(-1);
9560 if (n->type == NHERE) {
9561 struct heredoc *here = heredoc;
9567 TRACE(("Here document %d\n", n->type));
9568 if (!noexpand(wordtext) || (i = strlen(wordtext)) == 0 || i > EOFMARKLEN)
9569 raise_error_syntax("Illegal eof marker for << redirection");
9570 rmescapes(wordtext);
9571 here->eofmark = wordtext;
9573 if (heredoclist == NULL)
9576 for (p = heredoclist; p->next; p = p->next);
9579 } else if (n->type == NTOFD || n->type == NFROMFD) {
9580 fixredir(n, wordtext, 0);
9582 n->nfile.fname = makename();
9589 union node *args, **app;
9590 union node *n = NULL;
9591 union node *vars, **vpp;
9592 union node **rpp, *redir;
9602 savecheckkwd = CHKALIAS;
9604 checkkwd = savecheckkwd;
9605 switch (readtoken()) {
9607 n = stalloc(sizeof(struct narg));
9609 n->narg.text = wordtext;
9610 n->narg.backquote = backquotelist;
9611 if (savecheckkwd && isassignment(wordtext)) {
9613 vpp = &n->narg.next;
9616 app = &n->narg.next;
9621 *rpp = n = redirnode;
9622 rpp = &n->nfile.next;
9623 parsefname(); /* read name of redirection file */
9626 if (args && app == &args->narg.next
9629 struct builtincmd *bcmd;
9632 /* We have a function */
9633 if (readtoken() != TRP)
9634 raise_error_unexpected_syntax(TRP);
9635 name = n->narg.text;
9637 || ((bcmd = find_builtin(name)) && IS_BUILTIN_SPECIAL(bcmd))
9639 raise_error_syntax("Bad function name");
9642 checkkwd = CHKNL | CHKKWD | CHKALIAS;
9643 n->narg.next = parse_command();
9656 n = stalloc(sizeof(struct ncmd));
9658 n->ncmd.args = args;
9659 n->ncmd.assign = vars;
9660 n->ncmd.redirect = redir;
9667 union node *n1, *n2;
9668 union node *ap, **app;
9669 union node *cp, **cpp;
9670 union node *redir, **rpp;
9677 switch (readtoken()) {
9679 raise_error_unexpected_syntax(-1);
9682 n1 = stalloc(sizeof(struct nif));
9684 n1->nif.test = list(0);
9685 if (readtoken() != TTHEN)
9686 raise_error_unexpected_syntax(TTHEN);
9687 n1->nif.ifpart = list(0);
9689 while (readtoken() == TELIF) {
9690 n2->nif.elsepart = stalloc(sizeof(struct nif));
9691 n2 = n2->nif.elsepart;
9693 n2->nif.test = list(0);
9694 if (readtoken() != TTHEN)
9695 raise_error_unexpected_syntax(TTHEN);
9696 n2->nif.ifpart = list(0);
9698 if (lasttoken == TELSE)
9699 n2->nif.elsepart = list(0);
9701 n2->nif.elsepart = NULL;
9709 n1 = stalloc(sizeof(struct nbinary));
9710 n1->type = (lasttoken == TWHILE) ? NWHILE : NUNTIL;
9711 n1->nbinary.ch1 = list(0);
9714 TRACE(("expecting DO got %s %s\n", tokname(got),
9715 got == TWORD ? wordtext : ""));
9716 raise_error_unexpected_syntax(TDO);
9718 n1->nbinary.ch2 = list(0);
9723 if (readtoken() != TWORD || quoteflag || ! goodname(wordtext))
9724 raise_error_syntax("Bad for loop variable");
9725 n1 = stalloc(sizeof(struct nfor));
9727 n1->nfor.var = wordtext;
9728 checkkwd = CHKKWD | CHKALIAS;
9729 if (readtoken() == TIN) {
9731 while (readtoken() == TWORD) {
9732 n2 = stalloc(sizeof(struct narg));
9734 n2->narg.text = wordtext;
9735 n2->narg.backquote = backquotelist;
9737 app = &n2->narg.next;
9741 if (lasttoken != TNL && lasttoken != TSEMI)
9742 raise_error_unexpected_syntax(-1);
9744 n2 = stalloc(sizeof(struct narg));
9746 n2->narg.text = (char *)dolatstr;
9747 n2->narg.backquote = NULL;
9748 n2->narg.next = NULL;
9751 * Newline or semicolon here is optional (but note
9752 * that the original Bourne shell only allowed NL).
9754 if (lasttoken != TNL && lasttoken != TSEMI)
9757 checkkwd = CHKNL | CHKKWD | CHKALIAS;
9758 if (readtoken() != TDO)
9759 raise_error_unexpected_syntax(TDO);
9760 n1->nfor.body = list(0);
9764 n1 = stalloc(sizeof(struct ncase));
9766 if (readtoken() != TWORD)
9767 raise_error_unexpected_syntax(TWORD);
9768 n1->ncase.expr = n2 = stalloc(sizeof(struct narg));
9770 n2->narg.text = wordtext;
9771 n2->narg.backquote = backquotelist;
9772 n2->narg.next = NULL;
9774 checkkwd = CHKKWD | CHKALIAS;
9775 } while (readtoken() == TNL);
9776 if (lasttoken != TIN)
9777 raise_error_unexpected_syntax(TIN);
9778 cpp = &n1->ncase.cases;
9780 checkkwd = CHKNL | CHKKWD;
9782 while (t != TESAC) {
9783 if (lasttoken == TLP)
9785 *cpp = cp = stalloc(sizeof(struct nclist));
9787 app = &cp->nclist.pattern;
9789 *app = ap = stalloc(sizeof(struct narg));
9791 ap->narg.text = wordtext;
9792 ap->narg.backquote = backquotelist;
9793 if (readtoken() != TPIPE)
9795 app = &ap->narg.next;
9798 ap->narg.next = NULL;
9799 if (lasttoken != TRP)
9800 raise_error_unexpected_syntax(TRP);
9801 cp->nclist.body = list(2);
9803 cpp = &cp->nclist.next;
9805 checkkwd = CHKNL | CHKKWD;
9809 raise_error_unexpected_syntax(TENDCASE);
9816 n1 = stalloc(sizeof(struct nredir));
9817 n1->type = NSUBSHELL;
9818 n1->nredir.n = list(0);
9819 n1->nredir.redirect = NULL;
9832 if (readtoken() != t)
9833 raise_error_unexpected_syntax(t);
9836 /* Now check for redirection which may follow command */
9837 checkkwd = CHKKWD | CHKALIAS;
9839 while (readtoken() == TREDIR) {
9840 *rpp = n2 = redirnode;
9841 rpp = &n2->nfile.next;
9847 if (n1->type != NSUBSHELL) {
9848 n2 = stalloc(sizeof(struct nredir));
9853 n1->nredir.redirect = redir;
9859 * If eofmark is NULL, read a word or a redirection symbol. If eofmark
9860 * is not NULL, read a here document. In the latter case, eofmark is the
9861 * word which marks the end of the document and striptabs is true if
9862 * leading tabs should be stripped from the document. The argument firstc
9863 * is the first character of the input token or document.
9865 * Because C does not have internal subroutines, I have simulated them
9866 * using goto's to implement the subroutine linkage. The following macros
9867 * will run code that appears at the end of readtoken1.
9870 #define CHECKEND() {goto checkend; checkend_return:;}
9871 #define PARSEREDIR() {goto parseredir; parseredir_return:;}
9872 #define PARSESUB() {goto parsesub; parsesub_return:;}
9873 #define PARSEBACKQOLD() {oldstyle = 1; goto parsebackq; parsebackq_oldreturn:;}
9874 #define PARSEBACKQNEW() {oldstyle = 0; goto parsebackq; parsebackq_newreturn:;}
9875 #define PARSEARITH() {goto parsearith; parsearith_return:;}
9878 readtoken1(int firstc, int syntax, char *eofmark, int striptabs)
9880 /* NB: syntax parameter fits into smallint */
9884 char line[EOFMARKLEN + 1];
9885 struct nodelist *bqlist;
9889 smallint prevsyntax; /* syntax before arithmetic */
9890 #if ENABLE_ASH_EXPAND_PRMT
9891 smallint pssyntax; /* we are expanding a prompt string */
9893 int varnest; /* levels of variables expansion */
9894 int arinest; /* levels of arithmetic expansion */
9895 int parenlevel; /* levels of parens in arithmetic */
9896 int dqvarnest; /* levels of variables expansion within double quotes */
9899 /* Avoid longjmp clobbering */
9911 startlinno = plinno;
9916 #if ENABLE_ASH_EXPAND_PRMT
9917 pssyntax = (syntax == PSSYNTAX);
9921 dblquote = (syntax == DQSYNTAX);
9928 loop: { /* for each line, until end of word */
9929 CHECKEND(); /* set c to PEOF if at end of here document */
9930 for (;;) { /* until end of line or end of word */
9931 CHECKSTRSPACE(4, out); /* permit 4 calls to USTPUTC */
9932 switch (SIT(c, syntax)) {
9933 case CNL: /* '\n' */
9934 if (syntax == BASESYNTAX)
9935 goto endword; /* exit outer loop */
9941 goto loop; /* continue outer loop */
9946 if (eofmark == NULL || dblquote)
9947 USTPUTC(CTLESC, out);
9950 case CBACK: /* backslash */
9953 USTPUTC(CTLESC, out);
9956 } else if (c == '\n') {
9960 #if ENABLE_ASH_EXPAND_PRMT
9961 if (c == '$' && pssyntax) {
9962 USTPUTC(CTLESC, out);
9967 c != '\\' && c != '`' &&
9972 USTPUTC(CTLESC, out);
9975 if (SIT(c, SQSYNTAX) == CCTL)
9976 USTPUTC(CTLESC, out);
9984 if (eofmark == NULL) {
9985 USTPUTC(CTLQUOTEMARK, out);
9993 if (eofmark != NULL && arinest == 0
9998 if (dqvarnest == 0) {
9999 syntax = BASESYNTAX;
10006 case CVAR: /* '$' */
10007 PARSESUB(); /* parse substitution */
10009 case CENDVAR: /* '}' */
10012 if (dqvarnest > 0) {
10015 USTPUTC(CTLENDVAR, out);
10020 #if ENABLE_ASH_MATH_SUPPORT
10021 case CLP: /* '(' in arithmetic */
10025 case CRP: /* ')' in arithmetic */
10026 if (parenlevel > 0) {
10030 if (pgetc() == ')') {
10031 if (--arinest == 0) {
10032 USTPUTC(CTLENDARI, out);
10033 syntax = prevsyntax;
10034 dblquote = (syntax == DQSYNTAX);
10039 * unbalanced parens
10040 * (don't 2nd guess - no error)
10048 case CBQUOTE: /* '`' */
10052 goto endword; /* exit outer loop */
10057 goto endword; /* exit outer loop */
10058 #if ENABLE_ASH_ALIAS
10068 #if ENABLE_ASH_MATH_SUPPORT
10069 if (syntax == ARISYNTAX)
10070 raise_error_syntax("Missing '))'");
10072 if (syntax != BASESYNTAX && !parsebackquote && eofmark == NULL)
10073 raise_error_syntax("Unterminated quoted string");
10074 if (varnest != 0) {
10075 startlinno = plinno;
10077 raise_error_syntax("Missing '}'");
10079 USTPUTC('\0', out);
10080 len = out - (char *)stackblock();
10081 out = stackblock();
10082 if (eofmark == NULL) {
10083 if ((c == '>' || c == '<')
10086 && (*out == '\0' || isdigit(*out))) {
10088 return lasttoken = TREDIR;
10093 quoteflag = quotef;
10094 backquotelist = bqlist;
10095 grabstackblock(len);
10099 /* end of readtoken routine */
10102 * Check to see whether we are at the end of the here document. When this
10103 * is called, c is set to the first character of the next input line. If
10104 * we are at the end of the here document, this routine sets the c to PEOF.
10108 #if ENABLE_ASH_ALIAS
10114 while (c == '\t') {
10118 if (c == *eofmark) {
10119 if (pfgets(line, sizeof(line)) != NULL) {
10123 for (q = eofmark + 1; *q && *p == *q; p++, q++);
10124 if (*p == '\n' && *q == '\0') {
10127 needprompt = doprompt;
10129 pushstring(line, NULL);
10134 goto checkend_return;
10138 * Parse a redirection operator. The variable "out" points to a string
10139 * specifying the fd to be redirected. The variable "c" contains the
10140 * first character of the redirection operator.
10146 np = stalloc(sizeof(struct nfile));
10151 np->type = NAPPEND;
10153 np->type = NCLOBBER;
10160 } else { /* c == '<' */
10165 if (sizeof(struct nfile) != sizeof(struct nhere)) {
10166 np = stalloc(sizeof(struct nhere));
10170 heredoc = stalloc(sizeof(struct heredoc));
10171 heredoc->here = np;
10174 heredoc->striptabs = 1;
10176 heredoc->striptabs = 0;
10182 np->type = NFROMFD;
10186 np->type = NFROMTO;
10196 np->nfile.fd = fd - '0';
10198 goto parseredir_return;
10202 * Parse a substitution. At this point, we have read the dollar sign
10203 * and nothing else.
10206 /* is_special(c) evaluates to 1 for c in "!#$*-0123456789?@"; 0 otherwise
10207 * (assuming ascii char codes, as the original implementation did) */
10208 #define is_special(c) \
10209 ((((unsigned int)c) - 33 < 32) \
10210 && ((0xc1ff920dUL >> (((unsigned int)c) - 33)) & 1))
10216 static const char types[] ALIGN1 = "}-+?=";
10220 c <= PEOA_OR_PEOF ||
10221 (c != '(' && c != '{' && !is_name(c) && !is_special(c))
10225 } else if (c == '(') { /* $(command) or $((arith)) */
10226 if (pgetc() == '(') {
10227 #if ENABLE_ASH_MATH_SUPPORT
10230 raise_error_syntax("We unsupport $((arith))");
10237 USTPUTC(CTLVAR, out);
10238 typeloc = out - (char *)stackblock();
10239 USTPUTC(VSNORMAL, out);
10240 subtype = VSNORMAL;
10248 subtype = VSLENGTH;
10252 if (c > PEOA_OR_PEOF && is_name(c)) {
10256 } while (c > PEOA_OR_PEOF && is_in_name(c));
10257 } else if (isdigit(c)) {
10261 } while (isdigit(c));
10262 } else if (is_special(c)) {
10266 badsub: raise_error_syntax("Bad substitution");
10270 if (subtype == 0) {
10277 p = strchr(types, c);
10280 subtype = p - types + VSNORMAL;
10286 subtype = c == '#' ? VSTRIMLEFT :
10299 if (dblquote || arinest)
10301 *((char *)stackblock() + typeloc) = subtype | flags;
10302 if (subtype != VSNORMAL) {
10304 if (dblquote || arinest) {
10309 goto parsesub_return;
10313 * Called to parse command substitutions. Newstyle is set if the command
10314 * is enclosed inside $(...); nlpp is a pointer to the head of the linked
10315 * list of commands (passed by reference), and savelen is the number of
10316 * characters on the top of the stack which must be preserved.
10319 struct nodelist **nlpp;
10322 char *volatile str;
10323 struct jmploc jmploc;
10324 struct jmploc *volatile savehandler;
10326 smallint saveprompt = 0;
10329 (void) &saveprompt;
10331 savepbq = parsebackquote;
10332 if (setjmp(jmploc.loc)) {
10335 parsebackquote = 0;
10336 exception_handler = savehandler;
10337 longjmp(exception_handler->loc, 1);
10341 savelen = out - (char *)stackblock();
10343 str = ckmalloc(savelen);
10344 memcpy(str, stackblock(), savelen);
10346 savehandler = exception_handler;
10347 exception_handler = &jmploc;
10350 /* We must read until the closing backquote, giving special
10351 treatment to some slashes, and then push the string and
10352 reread it as input, interpreting it normally. */
10359 STARTSTACKSTR(pout);
10376 * If eating a newline, avoid putting
10377 * the newline into the new character
10378 * stream (via the STPUTC after the
10383 if (pc != '\\' && pc != '`' && pc != '$'
10384 && (!dblquote || pc != '"'))
10385 STPUTC('\\', pout);
10386 if (pc > PEOA_OR_PEOF) {
10392 #if ENABLE_ASH_ALIAS
10395 startlinno = plinno;
10396 raise_error_syntax("EOF in backquote substitution");
10400 needprompt = doprompt;
10409 STPUTC('\0', pout);
10410 psavelen = pout - (char *)stackblock();
10411 if (psavelen > 0) {
10412 pstr = grabstackstr(pout);
10413 setinputstring(pstr);
10418 nlpp = &(*nlpp)->next;
10419 *nlpp = stalloc(sizeof(**nlpp));
10420 (*nlpp)->next = NULL;
10421 parsebackquote = oldstyle;
10424 saveprompt = doprompt;
10431 doprompt = saveprompt;
10432 else if (readtoken() != TRP)
10433 raise_error_unexpected_syntax(TRP);
10438 * Start reading from old file again, ignoring any pushed back
10439 * tokens left from the backquote parsing
10444 while (stackblocksize() <= savelen)
10446 STARTSTACKSTR(out);
10448 memcpy(out, str, savelen);
10449 STADJUST(savelen, out);
10455 parsebackquote = savepbq;
10456 exception_handler = savehandler;
10457 if (arinest || dblquote)
10458 USTPUTC(CTLBACKQ | CTLQUOTE, out);
10460 USTPUTC(CTLBACKQ, out);
10462 goto parsebackq_oldreturn;
10463 goto parsebackq_newreturn;
10466 #if ENABLE_ASH_MATH_SUPPORT
10468 * Parse an arithmetic expansion (indicate start of one and set state)
10471 if (++arinest == 1) {
10472 prevsyntax = syntax;
10473 syntax = ARISYNTAX;
10474 USTPUTC(CTLARI, out);
10481 * we collapse embedded arithmetic expansion to
10482 * parenthesis, which should be equivalent
10486 goto parsearith_return;
10490 } /* end of readtoken */
10493 * Read the next input token.
10494 * If the token is a word, we set backquotelist to the list of cmds in
10495 * backquotes. We set quoteflag to true if any part of the word was
10497 * If the token is TREDIR, then we set redirnode to a structure containing
10499 * In all cases, the variable startlinno is set to the number of the line
10500 * on which the token starts.
10502 * [Change comment: here documents and internal procedures]
10503 * [Readtoken shouldn't have any arguments. Perhaps we should make the
10504 * word parsing code into a separate routine. In this case, readtoken
10505 * doesn't need to have any internal procedures, but parseword does.
10506 * We could also make parseoperator in essence the main routine, and
10507 * have parseword (readtoken1?) handle both words and redirection.]
10509 #define NEW_xxreadtoken
10510 #ifdef NEW_xxreadtoken
10511 /* singles must be first! */
10512 static const char xxreadtoken_chars[7] ALIGN1 = {
10513 '\n', '(', ')', '&', '|', ';', 0
10516 static const char xxreadtoken_tokens[] ALIGN1 = {
10517 TNL, TLP, TRP, /* only single occurrence allowed */
10518 TBACKGND, TPIPE, TSEMI, /* if single occurrence */
10519 TEOF, /* corresponds to trailing nul */
10520 TAND, TOR, TENDCASE /* if double occurrence */
10523 #define xxreadtoken_doubles \
10524 (sizeof(xxreadtoken_tokens) - sizeof(xxreadtoken_chars))
10525 #define xxreadtoken_singles \
10526 (sizeof(xxreadtoken_chars) - xxreadtoken_doubles - 1)
10540 startlinno = plinno;
10541 for (;;) { /* until token or start of word found */
10544 if ((c != ' ') && (c != '\t')
10545 #if ENABLE_ASH_ALIAS
10550 while ((c = pgetc()) != '\n' && c != PEOF);
10552 } else if (c == '\\') {
10553 if (pgetc() != '\n') {
10557 startlinno = ++plinno;
10562 = xxreadtoken_chars + sizeof(xxreadtoken_chars) - 1;
10567 needprompt = doprompt;
10570 p = strchr(xxreadtoken_chars, c);
10573 return readtoken1(c, BASESYNTAX, (char *) NULL, 0);
10576 if (p - xxreadtoken_chars >= xxreadtoken_singles) {
10577 if (pgetc() == *p) { /* double occurrence? */
10578 p += xxreadtoken_doubles + 1;
10584 return lasttoken = xxreadtoken_tokens[p - xxreadtoken_chars];
10590 #define RETURN(token) return lasttoken = token
10603 startlinno = plinno;
10604 for (;;) { /* until token or start of word found */
10607 case ' ': case '\t':
10608 #if ENABLE_ASH_ALIAS
10613 while ((c = pgetc()) != '\n' && c != PEOF);
10617 if (pgetc() == '\n') {
10618 startlinno = ++plinno;
10627 needprompt = doprompt;
10632 if (pgetc() == '&')
10637 if (pgetc() == '|')
10642 if (pgetc() == ';')
10655 return readtoken1(c, BASESYNTAX, (char *)NULL, 0);
10658 #endif /* NEW_xxreadtoken */
10665 smallint alreadyseen = tokpushback;
10668 #if ENABLE_ASH_ALIAS
10677 if (checkkwd & CHKNL) {
10684 if (t != TWORD || quoteflag) {
10689 * check for keywords
10691 if (checkkwd & CHKKWD) {
10692 const char *const *pp;
10694 pp = findkwd(wordtext);
10696 lasttoken = t = pp - tokname_array;
10697 TRACE(("keyword %s recognized\n", tokname(t)));
10702 if (checkkwd & CHKALIAS) {
10703 #if ENABLE_ASH_ALIAS
10705 ap = lookupalias(wordtext, 1);
10708 pushstring(ap->val, ap);
10718 TRACE(("token %s %s\n", tokname(t), t == TWORD ? wordtext : ""));
10720 TRACE(("reread token %s %s\n", tokname(t), t == TWORD ? wordtext : ""));
10732 return tokname_array[t][0];
10736 * Read and parse a command. Returns NEOF on end of file. (NULL is a
10737 * valid parse tree indicating a blank line.)
10739 static union node *
10740 parsecmd(int interact)
10745 doprompt = interact;
10747 setprompt(doprompt);
10759 * Input any here documents.
10764 struct heredoc *here;
10767 here = heredoclist;
10774 readtoken1(pgetc(), here->here->type == NHERE? SQSYNTAX : DQSYNTAX,
10775 here->eofmark, here->striptabs);
10776 n = stalloc(sizeof(struct narg));
10777 n->narg.type = NARG;
10778 n->narg.next = NULL;
10779 n->narg.text = wordtext;
10780 n->narg.backquote = backquotelist;
10781 here->here->nhere.doc = n;
10788 * called by editline -- any expansions to the prompt should be added here.
10790 #if ENABLE_ASH_EXPAND_PRMT
10791 static const char *
10792 expandstr(const char *ps)
10796 /* XXX Fix (char *) cast. */
10797 setinputstring((char *)ps);
10798 readtoken1(pgetc(), PSSYNTAX, nullstr, 0);
10801 n.narg.type = NARG;
10802 n.narg.next = NULL;
10803 n.narg.text = wordtext;
10804 n.narg.backquote = backquotelist;
10806 expandarg(&n, NULL, 0);
10807 return stackblock();
10812 * Execute a command or commands contained in a string.
10815 evalstring(char *s, int mask)
10818 struct stackmark smark;
10822 setstackmark(&smark);
10825 while ((n = parsecmd(0)) != NEOF) {
10827 popstackmark(&smark);
10840 * The eval command.
10843 evalcmd(int argc, char **argv)
10852 STARTSTACKSTR(concat);
10855 concat = stack_putstr(p, concat);
10859 STPUTC(' ', concat);
10861 STPUTC('\0', concat);
10862 p = grabstackstr(concat);
10864 evalstring(p, ~SKIPEVAL);
10871 * Read and execute commands. "Top" is nonzero for the top level command
10872 * loop; it turns on prompting if the shell is interactive.
10878 struct stackmark smark;
10882 TRACE(("cmdloop(%d) called\n", top));
10886 setstackmark(&smark);
10889 showjobs(stderr, SHOW_CHANGED);
10892 if (iflag && top) {
10894 #if ENABLE_ASH_MAIL
10898 n = parsecmd(inter);
10899 /* showtree(n); DEBUG */
10901 if (!top || numeof >= 50)
10903 if (!stoppedjobs()) {
10906 out2str("\nUse \"exit\" to leave shell.\n");
10909 } else if (nflag == 0) {
10910 /* job_warning can only be 2,1,0. Here 2->1, 1/0->0 */
10915 popstackmark(&smark);
10920 return skip & SKIPEVAL;
10927 * Take commands from a file. To be compatible we should do a path
10928 * search for the file, which is necessary to find sub-commands.
10931 find_dot_file(char *name)
10934 const char *path = pathval();
10937 /* don't try this for absolute or relative paths */
10938 if (strchr(name, '/'))
10941 while ((fullname = padvance(&path, name)) != NULL) {
10942 if ((stat(fullname, &statb) == 0) && S_ISREG(statb.st_mode)) {
10944 * Don't bother freeing here, since it will
10945 * be freed by the caller.
10949 stunalloc(fullname);
10952 /* not found in the PATH */
10953 ash_msg_and_raise_error("%s: not found", name);
10958 dotcmd(int argc, char **argv)
10960 struct strlist *sp;
10961 volatile struct shparam saveparam;
10964 for (sp = cmdenviron; sp; sp = sp->next)
10965 setvareq(ckstrdup(sp->text), VSTRFIXED | VTEXTFIXED);
10967 if (argc >= 2) { /* That's what SVR2 does */
10970 fullname = find_dot_file(argv[1]);
10973 saveparam = shellparam;
10974 shellparam.malloc = 0;
10975 shellparam.nparam = argc - 2;
10976 shellparam.p = argv + 2;
10979 setinputfile(fullname, INPUT_PUSH_FILE);
10980 commandname = fullname;
10985 freeparam(&shellparam);
10986 shellparam = saveparam;
10988 status = exitstatus;
10994 exitcmd(int argc, char **argv)
10999 exitstatus = number(argv[1]);
11000 raise_exception(EXEXIT);
11004 #if ENABLE_ASH_BUILTIN_ECHO
11006 echocmd(int argc, char **argv)
11008 return bb_echo(argv);
11012 #if ENABLE_ASH_BUILTIN_TEST
11014 testcmd(int argc, char **argv)
11016 return test_main(argc, argv);
11021 * Read a file containing shell functions.
11024 readcmdfile(char *name)
11026 setinputfile(name, INPUT_PUSH_FILE);
11032 /* ============ find_command inplementation */
11035 * Resolve a command name. If you change this routine, you may have to
11036 * change the shellexec routine as well.
11039 find_command(char *name, struct cmdentry *entry, int act, const char *path)
11041 struct tblentry *cmdp;
11048 struct builtincmd *bcmd;
11050 /* If name contains a slash, don't use PATH or hash table */
11051 if (strchr(name, '/') != NULL) {
11052 entry->u.index = -1;
11053 if (act & DO_ABS) {
11054 while (stat(name, &statb) < 0) {
11056 if (errno == EINTR)
11059 entry->cmdtype = CMDUNKNOWN;
11063 entry->cmdtype = CMDNORMAL;
11067 /* #if ENABLE_FEATURE_SH_STANDALONE... moved after builtin check */
11069 updatetbl = (path == pathval());
11072 if (strstr(path, "%builtin") != NULL)
11073 act |= DO_ALTBLTIN;
11076 /* If name is in the table, check answer will be ok */
11077 cmdp = cmdlookup(name, 0);
11078 if (cmdp != NULL) {
11081 switch (cmdp->cmdtype) {
11099 } else if (cmdp->rehash == 0)
11100 /* if not invalidated by cd, we're done */
11104 /* If %builtin not in path, check for builtin next */
11105 bcmd = find_builtin(name);
11107 if (IS_BUILTIN_REGULAR(bcmd))
11108 goto builtin_success;
11109 if (act & DO_ALTPATH) {
11110 if (!(act & DO_ALTBLTIN))
11111 goto builtin_success;
11112 } else if (builtinloc <= 0) {
11113 goto builtin_success;
11117 #if ENABLE_FEATURE_SH_STANDALONE
11118 if (find_applet_by_name(name)) {
11119 entry->cmdtype = CMDNORMAL;
11120 entry->u.index = -1;
11125 /* We have to search path. */
11126 prev = -1; /* where to start */
11127 if (cmdp && cmdp->rehash) { /* doing a rehash */
11128 if (cmdp->cmdtype == CMDBUILTIN)
11131 prev = cmdp->param.index;
11137 while ((fullname = padvance(&path, name)) != NULL) {
11138 stunalloc(fullname);
11139 /* NB: code below will still use fullname
11140 * despite it being "unallocated" */
11143 if (prefix(pathopt, "builtin")) {
11145 goto builtin_success;
11147 } else if (!(act & DO_NOFUNC)
11148 && prefix(pathopt, "func")) {
11149 /* handled below */
11151 /* ignore unimplemented options */
11155 /* if rehash, don't redo absolute path names */
11156 if (fullname[0] == '/' && idx <= prev) {
11159 TRACE(("searchexec \"%s\": no change\n", name));
11162 while (stat(fullname, &statb) < 0) {
11164 if (errno == EINTR)
11167 if (errno != ENOENT && errno != ENOTDIR)
11171 e = EACCES; /* if we fail, this will be the error */
11172 if (!S_ISREG(statb.st_mode))
11174 if (pathopt) { /* this is a %func directory */
11175 stalloc(strlen(fullname) + 1);
11176 /* NB: stalloc will return space pointed by fullname
11177 * (because we don't have any intervening allocations
11178 * between stunalloc above and this stalloc) */
11179 readcmdfile(fullname);
11180 cmdp = cmdlookup(name, 0);
11181 if (cmdp == NULL || cmdp->cmdtype != CMDFUNCTION)
11182 ash_msg_and_raise_error("%s not defined in %s", name, fullname);
11183 stunalloc(fullname);
11186 TRACE(("searchexec \"%s\" returns \"%s\"\n", name, fullname));
11188 entry->cmdtype = CMDNORMAL;
11189 entry->u.index = idx;
11193 cmdp = cmdlookup(name, 1);
11194 cmdp->cmdtype = CMDNORMAL;
11195 cmdp->param.index = idx;
11200 /* We failed. If there was an entry for this command, delete it */
11201 if (cmdp && updatetbl)
11202 delete_cmd_entry();
11204 ash_msg("%s: %s", name, errmsg(e, "not found"));
11205 entry->cmdtype = CMDUNKNOWN;
11210 entry->cmdtype = CMDBUILTIN;
11211 entry->u.cmd = bcmd;
11215 cmdp = cmdlookup(name, 1);
11216 cmdp->cmdtype = CMDBUILTIN;
11217 cmdp->param.cmd = bcmd;
11221 entry->cmdtype = cmdp->cmdtype;
11222 entry->u = cmdp->param;
11226 /* ============ trap.c */
11229 * The trap builtin.
11232 trapcmd(int argc, char **argv)
11241 for (signo = 0; signo < NSIG; signo++) {
11242 if (trap[signo] != NULL) {
11245 sn = get_signame(signo);
11246 out1fmt("trap -- %s %s\n",
11247 single_quote(trap[signo]), sn);
11257 signo = get_signum(*ap);
11259 ash_msg_and_raise_error("%s: bad trap", *ap);
11262 if (LONE_DASH(action))
11265 action = ckstrdup(action);
11269 trap[signo] = action;
11279 /* ============ Builtins */
11281 #if !ENABLE_FEATURE_SH_EXTRA_QUIET
11283 * Lists available builtins
11286 helpcmd(int argc, char **argv)
11290 out1fmt("\nBuilt-in commands:\n-------------------\n");
11291 for (col = 0, i = 0; i < ARRAY_SIZE(builtintab); i++) {
11292 col += out1fmt("%c%s", ((col == 0) ? '\t' : ' '),
11293 builtintab[i].name + 1);
11299 #if ENABLE_FEATURE_SH_STANDALONE
11300 for (i = 0; i < NUM_APPLETS; i++) {
11301 col += out1fmt("%c%s", ((col == 0) ? '\t' : ' '), applets[i].name);
11309 return EXIT_SUCCESS;
11311 #endif /* FEATURE_SH_EXTRA_QUIET */
11314 * The export and readonly commands.
11317 exportcmd(int argc, char **argv)
11323 int flag = argv[0][0] == 'r'? VREADONLY : VEXPORT;
11325 if (nextopt("p") != 'p') {
11330 p = strchr(name, '=');
11334 vp = *findvar(hashvar(name), name);
11340 setvar(name, p, flag);
11341 } while ((name = *++aptr) != NULL);
11345 showvars(argv[0], flag, 0);
11350 * Delete a function if it exists.
11353 unsetfunc(const char *name)
11355 struct tblentry *cmdp;
11357 cmdp = cmdlookup(name, 0);
11358 if (cmdp!= NULL && cmdp->cmdtype == CMDFUNCTION)
11359 delete_cmd_entry();
11363 * The unset builtin command. We unset the function before we unset the
11364 * variable to allow a function to be unset when there is a readonly variable
11365 * with the same name.
11368 unsetcmd(int argc, char **argv)
11375 while ((i = nextopt("vf")) != '\0') {
11379 for (ap = argptr; *ap; ap++) {
11395 #include <sys/times.h>
11397 static const unsigned char timescmd_str[] ALIGN1 = {
11398 ' ', offsetof(struct tms, tms_utime),
11399 '\n', offsetof(struct tms, tms_stime),
11400 ' ', offsetof(struct tms, tms_cutime),
11401 '\n', offsetof(struct tms, tms_cstime),
11406 timescmd(int ac, char **av)
11408 long clk_tck, s, t;
11409 const unsigned char *p;
11412 clk_tck = sysconf(_SC_CLK_TCK);
11417 t = *(clock_t *)(((char *) &buf) + p[1]);
11419 out1fmt("%ldm%ld.%.3lds%c",
11421 ((t - s * clk_tck) * 1000) / clk_tck,
11423 } while (*(p += 2));
11428 #if ENABLE_ASH_MATH_SUPPORT
11430 dash_arith(const char *s)
11436 result = arith(s, &errcode);
11439 ash_msg_and_raise_error("exponent less than 0");
11441 ash_msg_and_raise_error("divide by zero");
11443 ash_msg_and_raise_error("expression recursion loop detected");
11444 raise_error_syntax(s);
11452 * The let builtin. partial stolen from GNU Bash, the Bourne Again SHell.
11453 * Copyright (C) 1987, 1989, 1991 Free Software Foundation, Inc.
11455 * Copyright (C) 2003 Vladimir Oleynik <dzo@simtreas.ru>
11458 letcmd(int argc, char **argv)
11465 ash_msg_and_raise_error("expression expected");
11466 for (ap = argv + 1; *ap; ap++) {
11467 i = dash_arith(*ap);
11472 #endif /* ASH_MATH_SUPPORT */
11475 /* ============ miscbltin.c
11477 * Miscellaneous builtins.
11482 #if defined(__GLIBC__) && __GLIBC__ == 2 && __GLIBC_MINOR__ < 1
11483 typedef enum __rlimit_resource rlim_t;
11487 * The read builtin. The -e option causes backslashes to escape the
11488 * following character.
11490 * This uses unbuffered input, which may be avoidable in some cases.
11493 readcmd(int argc, char **argv)
11505 #if ENABLE_ASH_READ_NCHARS
11509 struct termios tty, old_tty;
11511 #if ENABLE_ASH_READ_TIMEOUT
11515 ts.tv_sec = ts.tv_usec = 0;
11520 #if ENABLE_ASH_READ_NCHARS && ENABLE_ASH_READ_TIMEOUT
11521 while ((i = nextopt("p:rt:n:s")) != '\0')
11522 #elif ENABLE_ASH_READ_NCHARS
11523 while ((i = nextopt("p:rn:s")) != '\0')
11524 #elif ENABLE_ASH_READ_TIMEOUT
11525 while ((i = nextopt("p:rt:")) != '\0')
11527 while ((i = nextopt("p:r")) != '\0')
11532 prompt = optionarg;
11534 #if ENABLE_ASH_READ_NCHARS
11536 nchars = strtol(optionarg, &p, 10);
11538 ash_msg_and_raise_error("invalid count");
11539 nch_flag = (nchars > 0);
11545 #if ENABLE_ASH_READ_TIMEOUT
11547 ts.tv_sec = strtol(optionarg, &p, 10);
11553 ts.tv_usec = strtol(p, &p2, 10);
11555 ash_msg_and_raise_error("invalid timeout");
11557 /* normalize to usec */
11559 ash_msg_and_raise_error("invalid timeout");
11560 while (scale++ < 6)
11564 ash_msg_and_raise_error("invalid timeout");
11566 if ( ! ts.tv_sec && ! ts.tv_usec)
11567 ash_msg_and_raise_error("invalid timeout");
11577 if (prompt && isatty(0)) {
11582 ash_msg_and_raise_error("arg count");
11583 ifs = bltinlookup("IFS");
11586 #if ENABLE_ASH_READ_NCHARS
11587 if (nch_flag || silent) {
11588 tcgetattr(0, &tty);
11591 tty.c_lflag &= ~ICANON;
11592 tty.c_cc[VMIN] = nchars;
11595 tty.c_lflag &= ~(ECHO|ECHOK|ECHONL);
11598 tcsetattr(0, TCSANOW, &tty);
11601 #if ENABLE_ASH_READ_TIMEOUT
11602 if (ts.tv_sec || ts.tv_usec) {
11603 // TODO: replace with poll, it is smaller
11607 i = select(FD_SETSIZE, &set, NULL, NULL, &ts);
11609 #if ENABLE_ASH_READ_NCHARS
11611 tcsetattr(0, TCSANOW, &old_tty);
11621 #if ENABLE_ASH_READ_NCHARS
11622 while (!nch_flag || nchars--)
11627 if (read(0, &c, 1) != 1) {
11639 if (!rflag && c == '\\') {
11645 if (startword && *ifs == ' ' && strchr(ifs, c)) {
11649 if (ap[1] != NULL && strchr(ifs, c) != NULL) {
11651 setvar(*ap, stackblock(), 0);
11660 #if ENABLE_ASH_READ_NCHARS
11661 if (nch_flag || silent)
11662 tcsetattr(0, TCSANOW, &old_tty);
11666 /* Remove trailing blanks */
11667 while ((char *)stackblock() <= --p && strchr(ifs, *p) != NULL)
11669 setvar(*ap, stackblock(), 0);
11670 while (*++ap != NULL)
11671 setvar(*ap, nullstr, 0);
11676 umaskcmd(int argc, char **argv)
11678 static const char permuser[3] ALIGN1 = "ugo";
11679 static const char permmode[3] ALIGN1 = "rwx";
11680 static const short permmask[] ALIGN2 = {
11681 S_IRUSR, S_IWUSR, S_IXUSR,
11682 S_IRGRP, S_IWGRP, S_IXGRP,
11683 S_IROTH, S_IWOTH, S_IXOTH
11689 int symbolic_mode = 0;
11691 while (nextopt("S") != '\0') {
11702 if (symbolic_mode) {
11706 for (i = 0; i < 3; i++) {
11709 *p++ = permuser[i];
11711 for (j = 0; j < 3; j++) {
11712 if ((mask & permmask[3 * i + j]) == 0) {
11713 *p++ = permmode[j];
11721 out1fmt("%.4o\n", mask);
11724 if (isdigit((unsigned char) *ap)) {
11727 if (*ap >= '8' || *ap < '0')
11728 ash_msg_and_raise_error(illnum, argv[1]);
11729 mask = (mask << 3) + (*ap - '0');
11730 } while (*++ap != '\0');
11733 mask = ~mask & 0777;
11734 if (!bb_parse_mode(ap, &mask)) {
11735 ash_msg_and_raise_error("illegal mode: %s", ap);
11737 umask(~mask & 0777);
11746 * This code, originally by Doug Gwyn, Doug Kingston, Eric Gisin, and
11747 * Michael Rendell was ripped from pdksh 5.0.8 and hacked for use with
11748 * ash by J.T. Conklin.
11756 int factor; /* multiply by to get rlim_{cur,max} values */
11760 static const struct limits limits[] = {
11762 { "time(seconds)", RLIMIT_CPU, 1, 't' },
11764 #ifdef RLIMIT_FSIZE
11765 { "file(blocks)", RLIMIT_FSIZE, 512, 'f' },
11768 { "data(kbytes)", RLIMIT_DATA, 1024, 'd' },
11770 #ifdef RLIMIT_STACK
11771 { "stack(kbytes)", RLIMIT_STACK, 1024, 's' },
11774 { "coredump(blocks)", RLIMIT_CORE, 512, 'c' },
11777 { "memory(kbytes)", RLIMIT_RSS, 1024, 'm' },
11779 #ifdef RLIMIT_MEMLOCK
11780 { "locked memory(kbytes)", RLIMIT_MEMLOCK, 1024, 'l' },
11782 #ifdef RLIMIT_NPROC
11783 { "process", RLIMIT_NPROC, 1, 'p' },
11785 #ifdef RLIMIT_NOFILE
11786 { "nofiles", RLIMIT_NOFILE, 1, 'n' },
11789 { "vmemory(kbytes)", RLIMIT_AS, 1024, 'v' },
11791 #ifdef RLIMIT_LOCKS
11792 { "locks", RLIMIT_LOCKS, 1, 'w' },
11794 { NULL, 0, 0, '\0' }
11797 enum limtype { SOFT = 0x1, HARD = 0x2 };
11800 printlim(enum limtype how, const struct rlimit *limit,
11801 const struct limits *l)
11805 val = limit->rlim_max;
11807 val = limit->rlim_cur;
11809 if (val == RLIM_INFINITY)
11810 out1fmt("unlimited\n");
11813 out1fmt("%lld\n", (long long) val);
11818 ulimitcmd(int argc, char **argv)
11822 enum limtype how = SOFT | HARD;
11823 const struct limits *l;
11826 struct rlimit limit;
11829 while ((optc = nextopt("HSa"
11833 #ifdef RLIMIT_FSIZE
11839 #ifdef RLIMIT_STACK
11848 #ifdef RLIMIT_MEMLOCK
11851 #ifdef RLIMIT_NPROC
11854 #ifdef RLIMIT_NOFILE
11860 #ifdef RLIMIT_LOCKS
11878 for (l = limits; l->option != what; l++)
11881 set = *argptr ? 1 : 0;
11885 if (all || argptr[1])
11886 ash_msg_and_raise_error("too many arguments");
11887 if (strncmp(p, "unlimited\n", 9) == 0)
11888 val = RLIM_INFINITY;
11892 while ((c = *p++) >= '0' && c <= '9') {
11893 val = (val * 10) + (long)(c - '0');
11894 if (val < (rlim_t) 0)
11898 ash_msg_and_raise_error("bad number");
11903 for (l = limits; l->name; l++) {
11904 getrlimit(l->cmd, &limit);
11905 out1fmt("%-20s ", l->name);
11906 printlim(how, &limit, l);
11911 getrlimit(l->cmd, &limit);
11914 limit.rlim_max = val;
11916 limit.rlim_cur = val;
11917 if (setrlimit(l->cmd, &limit) < 0)
11918 ash_msg_and_raise_error("error setting limit (%m)");
11920 printlim(how, &limit, l);
11926 /* ============ Math support */
11928 #if ENABLE_ASH_MATH_SUPPORT
11930 /* Copyright (c) 2001 Aaron Lehmann <aaronl@vitelus.com>
11932 Permission is hereby granted, free of charge, to any person obtaining
11933 a copy of this software and associated documentation files (the
11934 "Software"), to deal in the Software without restriction, including
11935 without limitation the rights to use, copy, modify, merge, publish,
11936 distribute, sublicense, and/or sell copies of the Software, and to
11937 permit persons to whom the Software is furnished to do so, subject to
11938 the following conditions:
11940 The above copyright notice and this permission notice shall be
11941 included in all copies or substantial portions of the Software.
11943 THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
11944 EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
11945 MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
11946 IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
11947 CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
11948 TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
11949 SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
11952 /* This is my infix parser/evaluator. It is optimized for size, intended
11953 * as a replacement for yacc-based parsers. However, it may well be faster
11954 * than a comparable parser written in yacc. The supported operators are
11955 * listed in #defines below. Parens, order of operations, and error handling
11956 * are supported. This code is thread safe. The exact expression format should
11957 * be that which POSIX specifies for shells. */
11959 /* The code uses a simple two-stack algorithm. See
11960 * http://www.onthenet.com.au/~grahamis/int2008/week02/lect02.html
11961 * for a detailed explanation of the infix-to-postfix algorithm on which
11962 * this is based (this code differs in that it applies operators immediately
11963 * to the stack instead of adding them to a queue to end up with an
11966 /* To use the routine, call it with an expression string and error return
11970 * Aug 24, 2001 Manuel Novoa III
11972 * Reduced the generated code size by about 30% (i386) and fixed several bugs.
11974 * 1) In arith_apply():
11975 * a) Cached values of *numptr and &(numptr[-1]).
11976 * b) Removed redundant test for zero denominator.
11979 * a) Eliminated redundant code for processing operator tokens by moving
11980 * to a table-based implementation. Also folded handling of parens
11982 * b) Combined all 3 loops which called arith_apply to reduce generated
11983 * code size at the cost of speed.
11985 * 3) The following expressions were treated as valid by the original code:
11986 * 1() , 0! , 1 ( *3 ) .
11987 * These bugs have been fixed by internally enclosing the expression in
11988 * parens and then checking that all binary ops and right parens are
11989 * preceded by a valid expression (NUM_TOKEN).
11991 * Note: It may be desirable to replace Aaron's test for whitespace with
11992 * ctype's isspace() if it is used by another busybox applet or if additional
11993 * whitespace chars should be considered. Look below the "#include"s for a
11994 * precompiler test.
11998 * Aug 26, 2001 Manuel Novoa III
12000 * Return 0 for null expressions. Pointed out by Vladimir Oleynik.
12002 * Merge in Aaron's comments previously posted to the busybox list,
12003 * modified slightly to take account of my changes to the code.
12008 * (C) 2003 Vladimir Oleynik <dzo@simtreas.ru>
12010 * - allow access to variable,
12011 * used recursive find value indirection (c=2*2; a="c"; $((a+=2)) produce 6)
12012 * - realize assign syntax (VAR=expr, +=, *= etc)
12013 * - realize exponentiation (** operator)
12014 * - realize comma separated - expr, expr
12015 * - realise ++expr --expr expr++ expr--
12016 * - realise expr ? expr : expr (but, second expr calculate always)
12017 * - allow hexadecimal and octal numbers
12018 * - was restored loses XOR operator
12019 * - remove one goto label, added three ;-)
12020 * - protect $((num num)) as true zero expr (Manuel`s error)
12021 * - always use special isspace(), see comment from bash ;-)
12024 #define arith_isspace(arithval) \
12025 (arithval == ' ' || arithval == '\n' || arithval == '\t')
12027 typedef unsigned char operator;
12029 /* An operator's token id is a bit of a bitfield. The lower 5 bits are the
12030 * precedence, and 3 high bits are an ID unique across operators of that
12031 * precedence. The ID portion is so that multiple operators can have the
12032 * same precedence, ensuring that the leftmost one is evaluated first.
12033 * Consider * and /. */
12035 #define tok_decl(prec,id) (((id)<<5)|(prec))
12036 #define PREC(op) ((op) & 0x1F)
12038 #define TOK_LPAREN tok_decl(0,0)
12040 #define TOK_COMMA tok_decl(1,0)
12042 #define TOK_ASSIGN tok_decl(2,0)
12043 #define TOK_AND_ASSIGN tok_decl(2,1)
12044 #define TOK_OR_ASSIGN tok_decl(2,2)
12045 #define TOK_XOR_ASSIGN tok_decl(2,3)
12046 #define TOK_PLUS_ASSIGN tok_decl(2,4)
12047 #define TOK_MINUS_ASSIGN tok_decl(2,5)
12048 #define TOK_LSHIFT_ASSIGN tok_decl(2,6)
12049 #define TOK_RSHIFT_ASSIGN tok_decl(2,7)
12051 #define TOK_MUL_ASSIGN tok_decl(3,0)
12052 #define TOK_DIV_ASSIGN tok_decl(3,1)
12053 #define TOK_REM_ASSIGN tok_decl(3,2)
12055 /* all assign is right associativity and precedence eq, but (7+3)<<5 > 256 */
12056 #define convert_prec_is_assing(prec) do { if (prec == 3) prec = 2; } while (0)
12058 /* conditional is right associativity too */
12059 #define TOK_CONDITIONAL tok_decl(4,0)
12060 #define TOK_CONDITIONAL_SEP tok_decl(4,1)
12062 #define TOK_OR tok_decl(5,0)
12064 #define TOK_AND tok_decl(6,0)
12066 #define TOK_BOR tok_decl(7,0)
12068 #define TOK_BXOR tok_decl(8,0)
12070 #define TOK_BAND tok_decl(9,0)
12072 #define TOK_EQ tok_decl(10,0)
12073 #define TOK_NE tok_decl(10,1)
12075 #define TOK_LT tok_decl(11,0)
12076 #define TOK_GT tok_decl(11,1)
12077 #define TOK_GE tok_decl(11,2)
12078 #define TOK_LE tok_decl(11,3)
12080 #define TOK_LSHIFT tok_decl(12,0)
12081 #define TOK_RSHIFT tok_decl(12,1)
12083 #define TOK_ADD tok_decl(13,0)
12084 #define TOK_SUB tok_decl(13,1)
12086 #define TOK_MUL tok_decl(14,0)
12087 #define TOK_DIV tok_decl(14,1)
12088 #define TOK_REM tok_decl(14,2)
12090 /* exponent is right associativity */
12091 #define TOK_EXPONENT tok_decl(15,1)
12093 /* For now unary operators. */
12094 #define UNARYPREC 16
12095 #define TOK_BNOT tok_decl(UNARYPREC,0)
12096 #define TOK_NOT tok_decl(UNARYPREC,1)
12098 #define TOK_UMINUS tok_decl(UNARYPREC+1,0)
12099 #define TOK_UPLUS tok_decl(UNARYPREC+1,1)
12101 #define PREC_PRE (UNARYPREC+2)
12103 #define TOK_PRE_INC tok_decl(PREC_PRE, 0)
12104 #define TOK_PRE_DEC tok_decl(PREC_PRE, 1)
12106 #define PREC_POST (UNARYPREC+3)
12108 #define TOK_POST_INC tok_decl(PREC_POST, 0)
12109 #define TOK_POST_DEC tok_decl(PREC_POST, 1)
12111 #define SPEC_PREC (UNARYPREC+4)
12113 #define TOK_NUM tok_decl(SPEC_PREC, 0)
12114 #define TOK_RPAREN tok_decl(SPEC_PREC, 1)
12116 #define NUMPTR (*numstackptr)
12119 tok_have_assign(operator op)
12121 operator prec = PREC(op);
12123 convert_prec_is_assing(prec);
12124 return (prec == PREC(TOK_ASSIGN) ||
12125 prec == PREC_PRE || prec == PREC_POST);
12129 is_right_associativity(operator prec)
12131 return (prec == PREC(TOK_ASSIGN) || prec == PREC(TOK_EXPONENT)
12132 || prec == PREC(TOK_CONDITIONAL));
12135 typedef struct ARITCH_VAR_NUM {
12137 arith_t contidional_second_val;
12138 char contidional_second_val_initialized;
12139 char *var; /* if NULL then is regular number,
12140 else is variable name */
12143 typedef struct CHK_VAR_RECURSIVE_LOOPED {
12145 struct CHK_VAR_RECURSIVE_LOOPED *next;
12146 } chk_var_recursive_looped_t;
12148 static chk_var_recursive_looped_t *prev_chk_var_recursive;
12151 arith_lookup_val(v_n_t *t)
12154 const char * p = lookupvar(t->var);
12159 /* recursive try as expression */
12160 chk_var_recursive_looped_t *cur;
12161 chk_var_recursive_looped_t cur_save;
12163 for (cur = prev_chk_var_recursive; cur; cur = cur->next) {
12164 if (strcmp(cur->var, t->var) == 0) {
12165 /* expression recursion loop detected */
12169 /* save current lookuped var name */
12170 cur = prev_chk_var_recursive;
12171 cur_save.var = t->var;
12172 cur_save.next = cur;
12173 prev_chk_var_recursive = &cur_save;
12175 t->val = arith (p, &errcode);
12176 /* restore previous ptr after recursiving */
12177 prev_chk_var_recursive = cur;
12180 /* allow undefined var as 0 */
12186 /* "applying" a token means performing it on the top elements on the integer
12187 * stack. For a unary operator it will only change the top element, but a
12188 * binary operator will pop two arguments and push a result */
12190 arith_apply(operator op, v_n_t *numstack, v_n_t **numstackptr)
12193 arith_t numptr_val, rez;
12194 int ret_arith_lookup_val;
12196 /* There is no operator that can work without arguments */
12197 if (NUMPTR == numstack) goto err;
12198 numptr_m1 = NUMPTR - 1;
12200 /* check operand is var with noninteger value */
12201 ret_arith_lookup_val = arith_lookup_val(numptr_m1);
12202 if (ret_arith_lookup_val)
12203 return ret_arith_lookup_val;
12205 rez = numptr_m1->val;
12206 if (op == TOK_UMINUS)
12208 else if (op == TOK_NOT)
12210 else if (op == TOK_BNOT)
12212 else if (op == TOK_POST_INC || op == TOK_PRE_INC)
12214 else if (op == TOK_POST_DEC || op == TOK_PRE_DEC)
12216 else if (op != TOK_UPLUS) {
12217 /* Binary operators */
12219 /* check and binary operators need two arguments */
12220 if (numptr_m1 == numstack) goto err;
12222 /* ... and they pop one */
12225 if (op == TOK_CONDITIONAL) {
12226 if (! numptr_m1->contidional_second_val_initialized) {
12227 /* protect $((expr1 ? expr2)) without ": expr" */
12230 rez = numptr_m1->contidional_second_val;
12231 } else if (numptr_m1->contidional_second_val_initialized) {
12232 /* protect $((expr1 : expr2)) without "expr ? " */
12235 numptr_m1 = NUMPTR - 1;
12236 if (op != TOK_ASSIGN) {
12237 /* check operand is var with noninteger value for not '=' */
12238 ret_arith_lookup_val = arith_lookup_val(numptr_m1);
12239 if (ret_arith_lookup_val)
12240 return ret_arith_lookup_val;
12242 if (op == TOK_CONDITIONAL) {
12243 numptr_m1->contidional_second_val = rez;
12245 rez = numptr_m1->val;
12246 if (op == TOK_BOR || op == TOK_OR_ASSIGN)
12248 else if (op == TOK_OR)
12249 rez = numptr_val || rez;
12250 else if (op == TOK_BAND || op == TOK_AND_ASSIGN)
12252 else if (op == TOK_BXOR || op == TOK_XOR_ASSIGN)
12254 else if (op == TOK_AND)
12255 rez = rez && numptr_val;
12256 else if (op == TOK_EQ)
12257 rez = (rez == numptr_val);
12258 else if (op == TOK_NE)
12259 rez = (rez != numptr_val);
12260 else if (op == TOK_GE)
12261 rez = (rez >= numptr_val);
12262 else if (op == TOK_RSHIFT || op == TOK_RSHIFT_ASSIGN)
12263 rez >>= numptr_val;
12264 else if (op == TOK_LSHIFT || op == TOK_LSHIFT_ASSIGN)
12265 rez <<= numptr_val;
12266 else if (op == TOK_GT)
12267 rez = (rez > numptr_val);
12268 else if (op == TOK_LT)
12269 rez = (rez < numptr_val);
12270 else if (op == TOK_LE)
12271 rez = (rez <= numptr_val);
12272 else if (op == TOK_MUL || op == TOK_MUL_ASSIGN)
12274 else if (op == TOK_ADD || op == TOK_PLUS_ASSIGN)
12276 else if (op == TOK_SUB || op == TOK_MINUS_ASSIGN)
12278 else if (op == TOK_ASSIGN || op == TOK_COMMA)
12280 else if (op == TOK_CONDITIONAL_SEP) {
12281 if (numptr_m1 == numstack) {
12282 /* protect $((expr : expr)) without "expr ? " */
12285 numptr_m1->contidional_second_val_initialized = op;
12286 numptr_m1->contidional_second_val = numptr_val;
12287 } else if (op == TOK_CONDITIONAL) {
12289 numptr_val : numptr_m1->contidional_second_val;
12290 } else if (op == TOK_EXPONENT) {
12291 if (numptr_val < 0)
12292 return -3; /* exponent less than 0 */
12297 while (numptr_val--)
12301 } else if (numptr_val==0) /* zero divisor check */
12303 else if (op == TOK_DIV || op == TOK_DIV_ASSIGN)
12305 else if (op == TOK_REM || op == TOK_REM_ASSIGN)
12308 if (tok_have_assign(op)) {
12309 char buf[sizeof(arith_t_type)*3 + 2];
12311 if (numptr_m1->var == NULL) {
12315 /* save to shell variable */
12316 #if ENABLE_ASH_MATH_SUPPORT_64
12317 snprintf(buf, sizeof(buf), "%lld", (arith_t_type) rez);
12319 snprintf(buf, sizeof(buf), "%ld", (arith_t_type) rez);
12321 setvar(numptr_m1->var, buf, 0);
12322 /* after saving, make previous value for v++ or v-- */
12323 if (op == TOK_POST_INC)
12325 else if (op == TOK_POST_DEC)
12328 numptr_m1->val = rez;
12329 /* protect geting var value, is number now */
12330 numptr_m1->var = NULL;
12336 /* longest must be first */
12337 static const char op_tokens[] ALIGN1 = {
12338 '<','<','=',0, TOK_LSHIFT_ASSIGN,
12339 '>','>','=',0, TOK_RSHIFT_ASSIGN,
12340 '<','<', 0, TOK_LSHIFT,
12341 '>','>', 0, TOK_RSHIFT,
12342 '|','|', 0, TOK_OR,
12343 '&','&', 0, TOK_AND,
12344 '!','=', 0, TOK_NE,
12345 '<','=', 0, TOK_LE,
12346 '>','=', 0, TOK_GE,
12347 '=','=', 0, TOK_EQ,
12348 '|','=', 0, TOK_OR_ASSIGN,
12349 '&','=', 0, TOK_AND_ASSIGN,
12350 '*','=', 0, TOK_MUL_ASSIGN,
12351 '/','=', 0, TOK_DIV_ASSIGN,
12352 '%','=', 0, TOK_REM_ASSIGN,
12353 '+','=', 0, TOK_PLUS_ASSIGN,
12354 '-','=', 0, TOK_MINUS_ASSIGN,
12355 '-','-', 0, TOK_POST_DEC,
12356 '^','=', 0, TOK_XOR_ASSIGN,
12357 '+','+', 0, TOK_POST_INC,
12358 '*','*', 0, TOK_EXPONENT,
12362 '=', 0, TOK_ASSIGN,
12374 '?', 0, TOK_CONDITIONAL,
12375 ':', 0, TOK_CONDITIONAL_SEP,
12376 ')', 0, TOK_RPAREN,
12377 '(', 0, TOK_LPAREN,
12381 #define endexpression &op_tokens[sizeof(op_tokens)-7]
12384 arith(const char *expr, int *perrcode)
12386 char arithval; /* Current character under analysis */
12387 operator lasttok, op;
12390 const char *p = endexpression;
12393 size_t datasizes = strlen(expr) + 2;
12395 /* Stack of integers */
12396 /* The proof that there can be no more than strlen(startbuf)/2+1 integers
12397 * in any given correct or incorrect expression is left as an exercise to
12399 v_n_t *numstack = alloca(((datasizes)/2)*sizeof(v_n_t)),
12400 *numstackptr = numstack;
12401 /* Stack of operator tokens */
12402 operator *stack = alloca((datasizes) * sizeof(operator)),
12405 *stackptr++ = lasttok = TOK_LPAREN; /* start off with a left paren */
12406 *perrcode = errcode = 0;
12410 if (arithval == 0) {
12411 if (p == endexpression) {
12412 /* Null expression. */
12416 /* This is only reached after all tokens have been extracted from the
12417 * input stream. If there are still tokens on the operator stack, they
12418 * are to be applied in order. At the end, there should be a final
12419 * result on the integer stack */
12421 if (expr != endexpression + 1) {
12422 /* If we haven't done so already, */
12423 /* append a closing right paren */
12424 expr = endexpression;
12425 /* and let the loop process it. */
12428 /* At this point, we're done with the expression. */
12429 if (numstackptr != numstack+1) {
12430 /* ... but if there isn't, it's bad */
12432 return (*perrcode = -1);
12434 if (numstack->var) {
12435 /* expression is $((var)) only, lookup now */
12436 errcode = arith_lookup_val(numstack);
12439 *perrcode = errcode;
12440 return numstack->val;
12443 /* Continue processing the expression. */
12444 if (arith_isspace(arithval)) {
12445 /* Skip whitespace */
12448 p = endofname(expr);
12450 size_t var_name_size = (p-expr) + 1; /* trailing zero */
12452 numstackptr->var = alloca(var_name_size);
12453 safe_strncpy(numstackptr->var, expr, var_name_size);
12456 numstackptr->contidional_second_val_initialized = 0;
12461 if (isdigit(arithval)) {
12462 numstackptr->var = NULL;
12463 #if ENABLE_ASH_MATH_SUPPORT_64
12464 numstackptr->val = strtoll(expr, (char **) &expr, 0);
12466 numstackptr->val = strtol(expr, (char **) &expr, 0);
12470 for (p = op_tokens; ; p++) {
12474 /* strange operator not found */
12477 for (o = expr; *p && *o == *p; p++)
12484 /* skip tail uncompared token */
12487 /* skip zero delim */
12492 /* post grammar: a++ reduce to num */
12493 if (lasttok == TOK_POST_INC || lasttok == TOK_POST_DEC)
12496 /* Plus and minus are binary (not unary) _only_ if the last
12497 * token was as number, or a right paren (which pretends to be
12498 * a number, since it evaluates to one). Think about it.
12499 * It makes sense. */
12500 if (lasttok != TOK_NUM) {
12516 /* We don't want a unary operator to cause recursive descent on the
12517 * stack, because there can be many in a row and it could cause an
12518 * operator to be evaluated before its argument is pushed onto the
12519 * integer stack. */
12520 /* But for binary operators, "apply" everything on the operator
12521 * stack until we find an operator with a lesser priority than the
12522 * one we have just extracted. */
12523 /* Left paren is given the lowest priority so it will never be
12524 * "applied" in this way.
12525 * if associativity is right and priority eq, applied also skip
12528 if ((prec > 0 && prec < UNARYPREC) || prec == SPEC_PREC) {
12529 /* not left paren or unary */
12530 if (lasttok != TOK_NUM) {
12531 /* binary op must be preceded by a num */
12534 while (stackptr != stack) {
12535 if (op == TOK_RPAREN) {
12536 /* The algorithm employed here is simple: while we don't
12537 * hit an open paren nor the bottom of the stack, pop
12538 * tokens and apply them */
12539 if (stackptr[-1] == TOK_LPAREN) {
12541 /* Any operator directly after a */
12543 /* close paren should consider itself binary */
12547 operator prev_prec = PREC(stackptr[-1]);
12549 convert_prec_is_assing(prec);
12550 convert_prec_is_assing(prev_prec);
12551 if (prev_prec < prec)
12553 /* check right assoc */
12554 if (prev_prec == prec && is_right_associativity(prec))
12557 errcode = arith_apply(*--stackptr, numstack, &numstackptr);
12558 if (errcode) goto ret;
12560 if (op == TOK_RPAREN) {
12565 /* Push this operator to the stack and remember it. */
12566 *stackptr++ = lasttok = op;
12571 #endif /* ASH_MATH_SUPPORT */
12574 /* ============ main() and helpers */
12577 * Called to exit the shell.
12579 static void exitshell(void) ATTRIBUTE_NORETURN;
12587 status = exitstatus;
12588 TRACE(("pid %d, exitshell(%d)\n", getpid(), status));
12589 if (setjmp(loc.loc)) {
12590 if (exception == EXEXIT)
12591 /* dash bug: it just does _exit(exitstatus) here
12592 * but we have to do setjobctl(0) first!
12593 * (bug is still not fixed in dash-0.5.3 - if you run dash
12594 * under Midnight Commander, on exit from dash MC is backgrounded) */
12595 status = exitstatus;
12598 exception_handler = &loc;
12604 flush_stdout_stderr();
12614 /* from input.c: */
12615 basepf.nextc = basepf.buf = basebuf;
12618 signal(SIGCHLD, SIG_DFL);
12623 char ppid[sizeof(int)*3 + 1];
12625 struct stat st1, st2;
12628 for (envp = environ; envp && *envp; envp++) {
12629 if (strchr(*envp, '=')) {
12630 setvareq(*envp, VEXPORT|VTEXTFIXED);
12634 snprintf(ppid, sizeof(ppid), "%u", (unsigned) getppid());
12635 setvar("PPID", ppid, 0);
12637 p = lookupvar("PWD");
12639 if (*p != '/' || stat(p, &st1) || stat(".", &st2)
12640 || st1.st_dev != st2.st_dev || st1.st_ino != st2.st_ino)
12647 * Process the shell command line arguments.
12650 procargs(int argc, char **argv)
12653 const char *xminusc;
12660 for (i = 0; i < NOPTS; i++)
12666 if (*xargv == NULL) {
12668 ash_msg_and_raise_error(bb_msg_requires_arg, "-c");
12671 if (iflag == 2 && sflag == 1 && isatty(0) && isatty(1))
12675 for (i = 0; i < NOPTS; i++)
12676 if (optlist[i] == 2)
12681 /* POSIX 1003.2: first arg after -c cmd is $0, remainder $1... */
12686 } else if (!sflag) {
12687 setinputfile(*xargv, 0);
12690 commandname = arg0;
12693 shellparam.p = xargv;
12694 #if ENABLE_ASH_GETOPTS
12695 shellparam.optind = 1;
12696 shellparam.optoff = -1;
12698 /* assert(shellparam.malloc == 0 && shellparam.nparam == 0); */
12700 shellparam.nparam++;
12707 * Read /etc/profile or .profile.
12710 read_profile(const char *name)
12714 if (setinputfile(name, INPUT_PUSH_FILE | INPUT_NOFILE_OK) < 0)
12723 * This routine is called when an error or an interrupt occurs in an
12724 * interactive shell and control is returned to the main command loop.
12732 /* from input.c: */
12733 parselleft = parsenleft = 0; /* clear input buffer */
12735 /* from parser.c: */
12738 /* from redir.c: */
12743 static short profile_buf[16384];
12744 extern int etext();
12748 * Main routine. We initialize things, parse the arguments, execute
12749 * profiles if we're a login shell, and then call cmdloop to execute
12750 * commands. The setjmp call sets up the location to jump to when an
12751 * exception occurs. When an exception occurs the variable "state"
12752 * is used to figure out how far we had gotten.
12754 int ash_main(int argc, char **argv);
12755 int ash_main(int argc, char **argv)
12758 volatile int state;
12759 struct jmploc jmploc;
12760 struct stackmark smark;
12763 monitor(4, etext, profile_buf, sizeof(profile_buf), 50);
12766 #if ENABLE_FEATURE_EDITING
12767 line_input_state = new_line_input_t(FOR_SHELL | WITH_PATH_LOOKUP);
12770 if (setjmp(jmploc.loc)) {
12780 if (e == EXEXIT || s == 0 || iflag == 0 || shlvl)
12784 outcslow('\n', stderr);
12786 popstackmark(&smark);
12787 FORCE_INT_ON; /* enable interrupts */
12796 exception_handler = &jmploc;
12799 trace_puts("Shell args: ");
12800 trace_puts_args(argv);
12802 rootpid = getpid();
12804 #if ENABLE_ASH_RANDOM_SUPPORT
12805 rseed = rootpid + time(NULL);
12808 setstackmark(&smark);
12809 procargs(argc, argv);
12810 #if ENABLE_FEATURE_EDITING_SAVEHISTORY
12812 const char *hp = lookupvar("HISTFILE");
12815 hp = lookupvar("HOME");
12817 char *defhp = concat_path_file(hp, ".ash_history");
12818 setvar("HISTFILE", defhp, 0);
12824 if (argv[0] && argv[0][0] == '-')
12828 read_profile("/etc/profile");
12831 read_profile(".profile");
12837 getuid() == geteuid() && getgid() == getegid() &&
12841 shinit = lookupvar("ENV");
12842 if (shinit != NULL && *shinit != '\0') {
12843 read_profile(shinit);
12849 evalstring(minusc, 0);
12851 if (sflag || minusc == NULL) {
12852 #if ENABLE_FEATURE_EDITING_SAVEHISTORY
12854 const char *hp = lookupvar("HISTFILE");
12857 line_input_state->hist_file = hp;
12860 state4: /* XXX ??? - why isn't this before the "if" statement */
12868 extern void _mcleanup(void);
12877 const char *applet_name = "debug stuff usage";
12878 int main(int argc, char **argv)
12880 return ash_main(argc, argv);
12886 * Copyright (c) 1989, 1991, 1993, 1994
12887 * The Regents of the University of California. All rights reserved.
12889 * This code is derived from software contributed to Berkeley by
12890 * Kenneth Almquist.
12892 * Redistribution and use in source and binary forms, with or without
12893 * modification, are permitted provided that the following conditions
12895 * 1. Redistributions of source code must retain the above copyright
12896 * notice, this list of conditions and the following disclaimer.
12897 * 2. Redistributions in binary form must reproduce the above copyright
12898 * notice, this list of conditions and the following disclaimer in the
12899 * documentation and/or other materials provided with the distribution.
12900 * 3. Neither the name of the University nor the names of its contributors
12901 * may be used to endorse or promote products derived from this software
12902 * without specific prior written permission.
12904 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
12905 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
12906 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
12907 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
12908 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
12909 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
12910 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
12911 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
12912 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
12913 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF