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.
49 #define JOBS ENABLE_ASH_JOB_CONTROL
57 #include "busybox.h" /* for applet_names */
61 #if JOBS || ENABLE_ASH_READ_NCHARS
65 #if defined(__uClinux__)
66 #error "Do not even bother, ash will not run on uClinux"
70 /* ============ Hash table sizes. Configurable. */
74 #define CMDTABLESIZE 31 /* should be prime */
77 /* ============ Misc helpers */
79 #define xbarrier() do { __asm__ __volatile__ ("": : :"memory"); } while (0)
81 /* C99 say: "char" declaration may be signed or unsigned default */
82 #define signed_char2int(sc) ((int)((signed char)sc))
85 /* ============ Shell options */
87 static const char *const optletters_optnames[] = {
108 #define optletters(n) optletters_optnames[(n)][0]
109 #define optnames(n) (&optletters_optnames[(n)][1])
111 enum { NOPTS = ARRAY_SIZE(optletters_optnames) };
113 static char optlist[NOPTS] ALIGN1;
115 #define eflag optlist[0]
116 #define fflag optlist[1]
117 #define Iflag optlist[2]
118 #define iflag optlist[3]
119 #define mflag optlist[4]
120 #define nflag optlist[5]
121 #define sflag optlist[6]
122 #define xflag optlist[7]
123 #define vflag optlist[8]
124 #define Cflag optlist[9]
125 #define aflag optlist[10]
126 #define bflag optlist[11]
127 #define uflag optlist[12]
128 #define viflag optlist[13]
130 #define nolog optlist[14]
131 #define debug optlist[15]
135 /* ============ Misc data */
137 static const char homestr[] ALIGN1 = "HOME";
138 static const char snlfmt[] ALIGN1 = "%s\n";
139 static const char illnum[] ALIGN1 = "Illegal number: %s";
142 * We enclose jmp_buf in a structure so that we can declare pointers to
143 * jump locations. The global variable handler contains the location to
144 * jump to when an exception occurs, and the global variable exception
145 * contains a code identifying the exception. To implement nested
146 * exception handlers, the user should save the value of handler on entry
147 * to an inner scope, set handler to point to a jmploc structure for the
148 * inner scope, and restore handler on exit from the scope.
154 struct globals_misc {
155 /* pid of main shell */
157 /* shell level: 0 for the main shell, 1 for its children, and so on */
159 #define rootshell (!shlvl)
160 char *minusc; /* argument to -c option */
162 char *curdir; // = nullstr; /* current working directory */
163 char *physdir; // = nullstr; /* physical working directory */
165 char *arg0; /* value of $0 */
167 struct jmploc *exception_handler;
169 // disabled by vda: cannot understand how it was supposed to work -
170 // cannot fix bugs. That's why you have to explain your non-trivial designs!
171 // /* do we generate EXSIG events */
172 // int exsig; /* counter */
173 volatile int suppressint; /* counter */
174 volatile /*sig_atomic_t*/ smallint intpending; /* 1 = got SIGINT */
175 /* last pending signal */
176 volatile /*sig_atomic_t*/ smallint pendingsig;
177 smallint exception; /* kind of exception (0..5) */
179 #define EXINT 0 /* SIGINT received */
180 #define EXERROR 1 /* a generic error */
181 #define EXSHELLPROC 2 /* execute a shell procedure */
182 #define EXEXEC 3 /* command execution failed */
183 #define EXEXIT 4 /* exit the shell */
184 #define EXSIG 5 /* trapped signal in wait(1) */
186 /* trap handler commands */
189 char nullstr[1]; /* zero length string */
191 * Sigmode records the current value of the signal handlers for the various
192 * modes. A value of zero means that the current handler is not known.
193 * S_HARD_IGN indicates that the signal was ignored on entry to the shell,
195 char sigmode[NSIG - 1];
196 #define S_DFL 1 /* default signal handling (SIG_DFL) */
197 #define S_CATCH 2 /* signal is caught */
198 #define S_IGN 3 /* signal is ignored (SIG_IGN) */
199 #define S_HARD_IGN 4 /* signal is ignored permenantly */
200 #define S_RESET 5 /* temporary - to reset a hard ignored sig */
202 /* indicates specified signal received */
203 char gotsig[NSIG - 1];
205 extern struct globals_misc *const ash_ptr_to_globals_misc;
206 #define G_misc (*ash_ptr_to_globals_misc)
207 #define rootpid (G_misc.rootpid )
208 #define shlvl (G_misc.shlvl )
209 #define minusc (G_misc.minusc )
210 #define curdir (G_misc.curdir )
211 #define physdir (G_misc.physdir )
212 #define arg0 (G_misc.arg0 )
213 #define exception_handler (G_misc.exception_handler)
214 #define exception (G_misc.exception )
215 #define suppressint (G_misc.suppressint )
216 #define intpending (G_misc.intpending )
217 //#define exsig (G_misc.exsig )
218 #define pendingsig (G_misc.pendingsig )
219 #define trap (G_misc.trap )
220 #define isloginsh (G_misc.isloginsh)
221 #define nullstr (G_misc.nullstr )
222 #define sigmode (G_misc.sigmode )
223 #define gotsig (G_misc.gotsig )
224 #define INIT_G_misc() do { \
225 (*(struct globals_misc**)&ash_ptr_to_globals_misc) = xzalloc(sizeof(G_misc)); \
232 /* ============ Interrupts / exceptions */
235 * These macros allow the user to suspend the handling of interrupt signals
236 * over a period of time. This is similar to SIGHOLD or to sigblock, but
237 * much more efficient and portable. (But hacking the kernel is so much
238 * more fun than worrying about efficiency and portability. :-))
247 * Called to raise an exception. Since C doesn't include exceptions, we
248 * just do a longjmp to the exception handler. The type of exception is
249 * stored in the global variable "exception".
251 static void raise_exception(int) ATTRIBUTE_NORETURN;
253 raise_exception(int e)
256 if (exception_handler == NULL)
261 longjmp(exception_handler->loc, 1);
265 * Called from trap.c when a SIGINT is received. (If the user specifies
266 * that SIGINT is to be trapped or ignored using the trap builtin, then
267 * this routine is not called.) Suppressint is nonzero when interrupts
268 * are held using the INT_OFF macro. (The test for iflag is just
269 * defensive programming.)
271 static void raise_interrupt(void) ATTRIBUTE_NORETURN;
273 raise_interrupt(void)
278 /* Signal is not automatically unmasked after it is raised,
279 * do it ourself - unmask all signals */
280 sigprocmask_allsigs(SIG_UNBLOCK);
281 /* pendingsig = 0; - now done in onsig() */
284 if (gotsig[SIGINT - 1] && !trap[SIGINT]) {
285 if (!(rootshell && iflag)) {
286 /* Kill ourself with SIGINT */
287 signal(SIGINT, SIG_DFL);
296 #if ENABLE_ASH_OPTIMIZE_FOR_SIZE
300 if (--suppressint == 0 && intpending) {
304 #define INT_ON int_on()
312 #define FORCE_INT_ON force_int_on()
317 if (--suppressint == 0 && intpending) \
320 #define FORCE_INT_ON \
327 #endif /* ASH_OPTIMIZE_FOR_SIZE */
329 #define SAVE_INT(v) ((v) = suppressint)
331 #define RESTORE_INT(v) \
335 if (suppressint == 0 && intpending) \
340 * Ignore a signal. Only one usage site - in forkchild()
345 if (sigmode[signo - 1] != S_IGN && sigmode[signo - 1] != S_HARD_IGN) {
346 signal(signo, SIG_IGN);
348 sigmode[signo - 1] = S_HARD_IGN;
352 * Signal handler. Only one usage site - in setsignal()
357 gotsig[signo - 1] = 1;
360 if ( /* exsig || */ (signo == SIGINT && !trap[SIGINT])) {
363 raise_interrupt(); /* does not return */
370 /* ============ Stdout/stderr output */
373 outstr(const char *p, FILE *file)
381 flush_stdout_stderr(void)
398 outcslow(int c, FILE *dest)
406 static int out1fmt(const char *, ...) __attribute__((__format__(__printf__,1,2)));
408 out1fmt(const char *fmt, ...)
415 r = vprintf(fmt, ap);
421 static int fmtstr(char *, size_t, const char *, ...) __attribute__((__format__(__printf__,3,4)));
423 fmtstr(char *outbuf, size_t length, const char *fmt, ...)
430 ret = vsnprintf(outbuf, length, fmt, ap);
437 out1str(const char *p)
443 out2str(const char *p)
450 /* ============ Parser structures */
452 /* control characters in argument strings */
453 #define CTLESC '\201' /* escape next character */
454 #define CTLVAR '\202' /* variable defn */
455 #define CTLENDVAR '\203'
456 #define CTLBACKQ '\204'
457 #define CTLQUOTE 01 /* ored with CTLBACKQ code if in quotes */
458 /* CTLBACKQ | CTLQUOTE == '\205' */
459 #define CTLARI '\206' /* arithmetic expression */
460 #define CTLENDARI '\207'
461 #define CTLQUOTEMARK '\210'
463 /* variable substitution byte (follows CTLVAR) */
464 #define VSTYPE 0x0f /* type of variable substitution */
465 #define VSNUL 0x10 /* colon--treat the empty string as unset */
466 #define VSQUOTE 0x80 /* inside double quotes--suppress splitting */
468 /* values of VSTYPE field */
469 #define VSNORMAL 0x1 /* normal variable: $var or ${var} */
470 #define VSMINUS 0x2 /* ${var-text} */
471 #define VSPLUS 0x3 /* ${var+text} */
472 #define VSQUESTION 0x4 /* ${var?message} */
473 #define VSASSIGN 0x5 /* ${var=text} */
474 #define VSTRIMRIGHT 0x6 /* ${var%pattern} */
475 #define VSTRIMRIGHTMAX 0x7 /* ${var%%pattern} */
476 #define VSTRIMLEFT 0x8 /* ${var#pattern} */
477 #define VSTRIMLEFTMAX 0x9 /* ${var##pattern} */
478 #define VSLENGTH 0xa /* ${#var} */
479 #if ENABLE_ASH_BASH_COMPAT
480 #define VSSUBSTR 0xc /* ${var:position:length} */
481 #define VSREPLACE 0xd /* ${var/pattern/replacement} */
482 #define VSREPLACEALL 0xe /* ${var//pattern/replacement} */
485 static const char dolatstr[] ALIGN1 = {
486 CTLVAR, VSNORMAL|VSQUOTE, '@', '=', '\0'
522 union node *redirect;
528 struct nodelist *cmdlist;
534 union node *redirect;
547 union node *elsepart;
574 struct nodelist *backquote;
609 struct nredir nredir;
610 struct nbinary nbinary;
614 struct nclist nclist;
623 struct nodelist *next;
636 freefunc(struct funcnode *f)
638 if (f && --f->count < 0)
643 /* ============ Debugging output */
647 static FILE *tracefile;
650 trace_printf(const char *fmt, ...)
657 vfprintf(tracefile, fmt, va);
662 trace_vprintf(const char *fmt, va_list va)
666 vfprintf(tracefile, fmt, va);
670 trace_puts(const char *s)
678 trace_puts_quoted(char *s)
685 putc('"', tracefile);
686 for (p = s; *p; p++) {
688 case '\n': c = 'n'; goto backslash;
689 case '\t': c = 't'; goto backslash;
690 case '\r': c = 'r'; goto backslash;
691 case '"': c = '"'; goto backslash;
692 case '\\': c = '\\'; goto backslash;
693 case CTLESC: c = 'e'; goto backslash;
694 case CTLVAR: c = 'v'; goto backslash;
695 case CTLVAR+CTLQUOTE: c = 'V'; goto backslash;
696 case CTLBACKQ: c = 'q'; goto backslash;
697 case CTLBACKQ+CTLQUOTE: c = 'Q'; goto backslash;
699 putc('\\', tracefile);
703 if (*p >= ' ' && *p <= '~')
706 putc('\\', tracefile);
707 putc(*p >> 6 & 03, tracefile);
708 putc(*p >> 3 & 07, tracefile);
709 putc(*p & 07, tracefile);
714 putc('"', tracefile);
718 trace_puts_args(char **ap)
725 trace_puts_quoted(*ap);
727 putc('\n', tracefile);
730 putc(' ', tracefile);
745 /* leave open because libedit might be using it */
748 strcpy(s, "./trace");
750 if (!freopen(s, "a", tracefile)) {
751 fprintf(stderr, "Can't re-open %s\n", s);
756 tracefile = fopen(s, "a");
757 if (tracefile == NULL) {
758 fprintf(stderr, "Can't open %s\n", s);
764 flags = fcntl(fileno(tracefile), F_GETFL);
766 fcntl(fileno(tracefile), F_SETFL, flags | O_APPEND);
768 setlinebuf(tracefile);
769 fputs("\nTracing started.\n", tracefile);
773 indent(int amount, char *pfx, FILE *fp)
777 for (i = 0; i < amount; i++) {
778 if (pfx && i == amount - 1)
784 /* little circular references here... */
785 static void shtree(union node *n, int ind, char *pfx, FILE *fp);
788 sharg(union node *arg, FILE *fp)
791 struct nodelist *bqlist;
794 if (arg->type != NARG) {
795 out1fmt("<node type %d>\n", arg->type);
798 bqlist = arg->narg.backquote;
799 for (p = arg->narg.text; *p; p++) {
808 if (subtype == VSLENGTH)
817 switch (subtype & VSTYPE) {
850 out1fmt("<subtype %d>", subtype);
857 case CTLBACKQ|CTLQUOTE:
860 shtree(bqlist->n, -1, NULL, fp);
871 shcmd(union node *cmd, FILE *fp)
879 for (np = cmd->ncmd.args; np; np = np->narg.next) {
885 for (np = cmd->ncmd.redirect; np; np = np->nfile.next) {
889 switch (np->nfile.type) {
890 case NTO: s = ">>"+1; dftfd = 1; break;
891 case NCLOBBER: s = ">|"; dftfd = 1; break;
892 case NAPPEND: s = ">>"; dftfd = 1; break;
893 case NTOFD: s = ">&"; dftfd = 1; break;
894 case NFROM: s = "<"; break;
895 case NFROMFD: s = "<&"; break;
896 case NFROMTO: s = "<>"; break;
897 default: s = "*error*"; break;
899 if (np->nfile.fd != dftfd)
900 fprintf(fp, "%d", np->nfile.fd);
902 if (np->nfile.type == NTOFD || np->nfile.type == NFROMFD) {
903 fprintf(fp, "%d", np->ndup.dupfd);
905 sharg(np->nfile.fname, fp);
912 shtree(union node *n, int ind, char *pfx, FILE *fp)
920 indent(ind, pfx, fp);
931 shtree(n->nbinary.ch1, ind, NULL, fp);
934 shtree(n->nbinary.ch2, ind, NULL, fp);
942 for (lp = n->npipe.cmdlist; lp; lp = lp->next) {
947 if (n->npipe.backgnd)
953 fprintf(fp, "<node type %d>", n->type);
961 showtree(union node *n)
963 trace_puts("showtree called\n");
964 shtree(n, 1, NULL, stdout);
967 #define TRACE(param) trace_printf param
968 #define TRACEV(param) trace_vprintf param
973 #define TRACEV(param)
978 /* ============ Parser data */
981 * ash_vmsg() needs parsefile->fd, hence parsefile definition is moved up.
984 struct strlist *next;
993 struct strpush *prev; /* preceding string on stack */
997 struct alias *ap; /* if push was associated with an alias */
999 char *string; /* remember the string since it may change */
1003 struct parsefile *prev; /* preceding file on stack */
1004 int linno; /* current line */
1005 int fd; /* file descriptor (or -1 if string) */
1006 int nleft; /* number of chars left in this line */
1007 int lleft; /* number of chars left in this buffer */
1008 char *nextc; /* next char in buffer */
1009 char *buf; /* input buffer */
1010 struct strpush *strpush; /* for pushing strings at this level */
1011 struct strpush basestrpush; /* so pushing one is fast */
1014 static struct parsefile basepf; /* top level input file */
1015 static struct parsefile *parsefile = &basepf; /* current input file */
1016 static int startlinno; /* line # where last token started */
1017 static char *commandname; /* currently executing command */
1018 static struct strlist *cmdenviron; /* environment for builtin command */
1019 static int exitstatus; /* exit status of last command */
1022 /* ============ Message printing */
1025 ash_vmsg(const char *msg, va_list ap)
1027 fprintf(stderr, "%s: ", arg0);
1029 if (strcmp(arg0, commandname))
1030 fprintf(stderr, "%s: ", commandname);
1031 if (!iflag || parsefile->fd)
1032 fprintf(stderr, "line %d: ", startlinno);
1034 vfprintf(stderr, msg, ap);
1035 outcslow('\n', stderr);
1039 * Exverror is called to raise the error exception. If the second argument
1040 * is not NULL then error prints an error message using printf style
1041 * formatting. It then raises the error exception.
1043 static void ash_vmsg_and_raise(int, const char *, va_list) ATTRIBUTE_NORETURN;
1045 ash_vmsg_and_raise(int cond, const char *msg, va_list ap)
1049 TRACE(("ash_vmsg_and_raise(%d, \"", cond));
1051 TRACE(("\") pid=%d\n", getpid()));
1053 TRACE(("ash_vmsg_and_raise(%d, NULL) pid=%d\n", cond, getpid()));
1058 flush_stdout_stderr();
1059 raise_exception(cond);
1063 static void ash_msg_and_raise_error(const char *, ...) ATTRIBUTE_NORETURN;
1065 ash_msg_and_raise_error(const char *msg, ...)
1070 ash_vmsg_and_raise(EXERROR, msg, ap);
1075 static void ash_msg_and_raise(int, const char *, ...) ATTRIBUTE_NORETURN;
1077 ash_msg_and_raise(int cond, const char *msg, ...)
1082 ash_vmsg_and_raise(cond, msg, ap);
1088 * error/warning routines for external builtins
1091 ash_msg(const char *fmt, ...)
1101 * Return a string describing an error. The returned string may be a
1102 * pointer to a static buffer that will be overwritten on the next call.
1103 * Action describes the operation that got the error.
1106 errmsg(int e, const char *em)
1108 if (e == ENOENT || e == ENOTDIR) {
1115 /* ============ Memory allocation */
1118 * It appears that grabstackstr() will barf with such alignments
1119 * because stalloc() will return a string allocated in a new stackblock.
1121 #define SHELL_ALIGN(nbytes) (((nbytes) + SHELL_SIZE) & ~SHELL_SIZE)
1123 /* Most machines require the value returned from malloc to be aligned
1124 * in some way. The following macro will get this right
1125 * on many machines. */
1126 SHELL_SIZE = sizeof(union {int i; char *cp; double d; }) - 1,
1127 /* Minimum size of a block */
1128 MINSIZE = SHELL_ALIGN(504),
1131 struct stack_block {
1132 struct stack_block *prev;
1133 char space[MINSIZE];
1137 struct stack_block *stackp;
1140 struct stackmark *marknext;
1144 struct globals_memstack {
1145 struct stack_block *g_stackp; // = &stackbase;
1146 struct stackmark *markp;
1147 char *g_stacknxt; // = stackbase.space;
1148 char *sstrend; // = stackbase.space + MINSIZE;
1149 size_t g_stacknleft; // = MINSIZE;
1150 int herefd; // = -1;
1151 struct stack_block stackbase;
1153 extern struct globals_memstack *const ash_ptr_to_globals_memstack;
1154 #define G_memstack (*ash_ptr_to_globals_memstack)
1155 #define g_stackp (G_memstack.g_stackp )
1156 #define markp (G_memstack.markp )
1157 #define g_stacknxt (G_memstack.g_stacknxt )
1158 #define sstrend (G_memstack.sstrend )
1159 #define g_stacknleft (G_memstack.g_stacknleft)
1160 #define herefd (G_memstack.herefd )
1161 #define stackbase (G_memstack.stackbase )
1162 #define INIT_G_memstack() do { \
1163 (*(struct globals_memstack**)&ash_ptr_to_globals_memstack) = xzalloc(sizeof(G_memstack)); \
1165 g_stackp = &stackbase; \
1166 g_stacknxt = stackbase.space; \
1167 g_stacknleft = MINSIZE; \
1168 sstrend = stackbase.space + MINSIZE; \
1172 #define stackblock() ((void *)g_stacknxt)
1173 #define stackblocksize() g_stacknleft
1177 ckrealloc(void * p, size_t nbytes)
1179 p = realloc(p, nbytes);
1181 ash_msg_and_raise_error(bb_msg_memory_exhausted);
1186 ckmalloc(size_t nbytes)
1188 return ckrealloc(NULL, nbytes);
1192 ckzalloc(size_t nbytes)
1194 return memset(ckmalloc(nbytes), 0, nbytes);
1198 * Make a copy of a string in safe storage.
1201 ckstrdup(const char *s)
1203 char *p = strdup(s);
1205 ash_msg_and_raise_error(bb_msg_memory_exhausted);
1210 * Parse trees for commands are allocated in lifo order, so we use a stack
1211 * to make this more efficient, and also to avoid all sorts of exception
1212 * handling code to handle interrupts in the middle of a parse.
1214 * The size 504 was chosen because the Ultrix malloc handles that size
1218 stalloc(size_t nbytes)
1223 aligned = SHELL_ALIGN(nbytes);
1224 if (aligned > g_stacknleft) {
1227 struct stack_block *sp;
1229 blocksize = aligned;
1230 if (blocksize < MINSIZE)
1231 blocksize = MINSIZE;
1232 len = sizeof(struct stack_block) - MINSIZE + blocksize;
1233 if (len < blocksize)
1234 ash_msg_and_raise_error(bb_msg_memory_exhausted);
1237 sp->prev = g_stackp;
1238 g_stacknxt = sp->space;
1239 g_stacknleft = blocksize;
1240 sstrend = g_stacknxt + blocksize;
1245 g_stacknxt += aligned;
1246 g_stacknleft -= aligned;
1251 stzalloc(size_t nbytes)
1253 return memset(stalloc(nbytes), 0, nbytes);
1260 if (!p || (g_stacknxt < (char *)p) || ((char *)p < g_stackp->space)) {
1261 write(STDERR_FILENO, "stunalloc\n", 10);
1265 g_stacknleft += g_stacknxt - (char *)p;
1270 * Like strdup but works with the ash stack.
1273 ststrdup(const char *p)
1275 size_t len = strlen(p) + 1;
1276 return memcpy(stalloc(len), p, len);
1280 setstackmark(struct stackmark *mark)
1282 mark->stackp = g_stackp;
1283 mark->stacknxt = g_stacknxt;
1284 mark->stacknleft = g_stacknleft;
1285 mark->marknext = markp;
1290 popstackmark(struct stackmark *mark)
1292 struct stack_block *sp;
1298 markp = mark->marknext;
1299 while (g_stackp != mark->stackp) {
1301 g_stackp = sp->prev;
1304 g_stacknxt = mark->stacknxt;
1305 g_stacknleft = mark->stacknleft;
1306 sstrend = mark->stacknxt + mark->stacknleft;
1311 * When the parser reads in a string, it wants to stick the string on the
1312 * stack and only adjust the stack pointer when it knows how big the
1313 * string is. Stackblock (defined in stack.h) returns a pointer to a block
1314 * of space on top of the stack and stackblocklen returns the length of
1315 * this block. Growstackblock will grow this space by at least one byte,
1316 * possibly moving it (like realloc). Grabstackblock actually allocates the
1317 * part of the block that has been used.
1320 growstackblock(void)
1324 newlen = g_stacknleft * 2;
1325 if (newlen < g_stacknleft)
1326 ash_msg_and_raise_error(bb_msg_memory_exhausted);
1330 if (g_stacknxt == g_stackp->space && g_stackp != &stackbase) {
1331 struct stack_block *oldstackp;
1332 struct stackmark *xmark;
1333 struct stack_block *sp;
1334 struct stack_block *prevstackp;
1338 oldstackp = g_stackp;
1340 prevstackp = sp->prev;
1341 grosslen = newlen + sizeof(struct stack_block) - MINSIZE;
1342 sp = ckrealloc(sp, grosslen);
1343 sp->prev = prevstackp;
1345 g_stacknxt = sp->space;
1346 g_stacknleft = newlen;
1347 sstrend = sp->space + newlen;
1350 * Stack marks pointing to the start of the old block
1351 * must be relocated to point to the new block
1354 while (xmark != NULL && xmark->stackp == oldstackp) {
1355 xmark->stackp = g_stackp;
1356 xmark->stacknxt = g_stacknxt;
1357 xmark->stacknleft = g_stacknleft;
1358 xmark = xmark->marknext;
1362 char *oldspace = g_stacknxt;
1363 size_t oldlen = g_stacknleft;
1364 char *p = stalloc(newlen);
1366 /* free the space we just allocated */
1367 g_stacknxt = memcpy(p, oldspace, oldlen);
1368 g_stacknleft += newlen;
1373 grabstackblock(size_t len)
1375 len = SHELL_ALIGN(len);
1377 g_stacknleft -= len;
1381 * The following routines are somewhat easier to use than the above.
1382 * The user declares a variable of type STACKSTR, which may be declared
1383 * to be a register. The macro STARTSTACKSTR initializes things. Then
1384 * the user uses the macro STPUTC to add characters to the string. In
1385 * effect, STPUTC(c, p) is the same as *p++ = c except that the stack is
1386 * grown as necessary. When the user is done, she can just leave the
1387 * string there and refer to it using stackblock(). Or she can allocate
1388 * the space for it using grabstackstr(). If it is necessary to allow
1389 * someone else to use the stack temporarily and then continue to grow
1390 * the string, the user should use grabstack to allocate the space, and
1391 * then call ungrabstr(p) to return to the previous mode of operation.
1393 * USTPUTC is like STPUTC except that it doesn't check for overflow.
1394 * CHECKSTACKSPACE can be called before USTPUTC to ensure that there
1395 * is space for at least one character.
1400 size_t len = stackblocksize();
1401 if (herefd >= 0 && len >= 1024) {
1402 full_write(herefd, stackblock(), len);
1403 return stackblock();
1406 return (char *)stackblock() + len;
1410 * Called from CHECKSTRSPACE.
1413 makestrspace(size_t newlen, char *p)
1415 size_t len = p - g_stacknxt;
1416 size_t size = stackblocksize();
1421 size = stackblocksize();
1423 if (nleft >= newlen)
1427 return (char *)stackblock() + len;
1431 stack_nputstr(const char *s, size_t n, char *p)
1433 p = makestrspace(n, p);
1434 p = (char *)memcpy(p, s, n) + n;
1439 stack_putstr(const char *s, char *p)
1441 return stack_nputstr(s, strlen(s), p);
1445 _STPUTC(int c, char *p)
1453 #define STARTSTACKSTR(p) ((p) = stackblock())
1454 #define STPUTC(c, p) ((p) = _STPUTC((c), (p)))
1455 #define CHECKSTRSPACE(n, p) \
1459 size_t m = sstrend - q; \
1461 (p) = makestrspace(l, q); \
1463 #define USTPUTC(c, p) (*p++ = (c))
1464 #define STACKSTRNUL(p) \
1466 if ((p) == sstrend) \
1467 p = growstackstr(); \
1470 #define STUNPUTC(p) (--p)
1471 #define STTOPC(p) (p[-1])
1472 #define STADJUST(amount, p) (p += (amount))
1474 #define grabstackstr(p) stalloc((char *)(p) - (char *)stackblock())
1475 #define ungrabstackstr(s, p) stunalloc((s))
1476 #define stackstrend() ((void *)sstrend)
1479 /* ============ String helpers */
1482 * prefix -- see if pfx is a prefix of string.
1485 prefix(const char *string, const char *pfx)
1488 if (*pfx++ != *string++)
1491 return (char *) string;
1495 * Check for a valid number. This should be elsewhere.
1498 is_number(const char *p)
1503 } while (*++p != '\0');
1508 * Convert a string of digits to an integer, printing an error message on
1512 number(const char *s)
1515 ash_msg_and_raise_error(illnum, s);
1520 * Produce a possibly single quoted string suitable as input to the shell.
1521 * The return string is allocated on the stack.
1524 single_quote(const char *s)
1534 len = strchrnul(s, '\'') - s;
1536 q = p = makestrspace(len + 3, p);
1539 q = (char *)memcpy(q, s, len) + len;
1545 len = strspn(s, "'");
1549 q = p = makestrspace(len + 3, p);
1552 q = (char *)memcpy(q, s, len) + len;
1561 return stackblock();
1565 /* ============ nextopt */
1567 static char **argptr; /* argument list for builtin commands */
1568 static char *optionarg; /* set by nextopt (like getopt) */
1569 static char *optptr; /* used by nextopt */
1572 * XXX - should get rid of. have all builtins use getopt(3). the
1573 * library getopt must have the BSD extension static variable "optreset"
1574 * otherwise it can't be used within the shell safely.
1576 * Standard option processing (a la getopt) for builtin routines. The
1577 * only argument that is passed to nextopt is the option string; the
1578 * other arguments are unnecessary. It return the character, or '\0' on
1582 nextopt(const char *optstring)
1589 if (p == NULL || *p == '\0') {
1591 if (p == NULL || *p != '-' || *++p == '\0')
1594 if (LONE_DASH(p)) /* check for "--" */
1598 for (q = optstring; *q != c; ) {
1600 ash_msg_and_raise_error("illegal option -%c", c);
1605 if (*p == '\0' && (p = *argptr++) == NULL)
1606 ash_msg_and_raise_error("no arg for -%c option", c);
1615 /* ============ Math support definitions */
1617 #if ENABLE_ASH_MATH_SUPPORT_64
1618 typedef int64_t arith_t;
1619 #define arith_t_type long long
1621 typedef long arith_t;
1622 #define arith_t_type long
1625 #if ENABLE_ASH_MATH_SUPPORT
1626 static arith_t dash_arith(const char *);
1627 static arith_t arith(const char *expr, int *perrcode);
1630 #if ENABLE_ASH_RANDOM_SUPPORT
1631 static unsigned long rseed;
1638 /* ============ Shell variables */
1641 * The parsefile structure pointed to by the global variable parsefile
1642 * contains information about the current file being read.
1645 struct redirtab *next;
1651 int nparam; /* # of positional parameters (without $0) */
1652 #if ENABLE_ASH_GETOPTS
1653 int optind; /* next parameter to be processed by getopts */
1654 int optoff; /* used by getopts */
1656 unsigned char malloced; /* if parameter list dynamically allocated */
1657 char **p; /* parameter list */
1661 * Free the list of positional parameters.
1664 freeparam(volatile struct shparam *param)
1668 if (param->malloced) {
1669 for (ap = param->p; *ap; ap++)
1675 #if ENABLE_ASH_GETOPTS
1676 static void getoptsreset(const char *value);
1680 struct var *next; /* next entry in hash list */
1681 int flags; /* flags are defined above */
1682 const char *text; /* name=value */
1683 void (*func)(const char *); /* function to be called when */
1684 /* the variable gets set/unset */
1688 struct localvar *next; /* next local variable in list */
1689 struct var *vp; /* the variable that was made local */
1690 int flags; /* saved flags */
1691 const char *text; /* saved text */
1695 #define VEXPORT 0x01 /* variable is exported */
1696 #define VREADONLY 0x02 /* variable cannot be modified */
1697 #define VSTRFIXED 0x04 /* variable struct is statically allocated */
1698 #define VTEXTFIXED 0x08 /* text is statically allocated */
1699 #define VSTACK 0x10 /* text is allocated on the stack */
1700 #define VUNSET 0x20 /* the variable is not set */
1701 #define VNOFUNC 0x40 /* don't call the callback function */
1702 #define VNOSET 0x80 /* do not set variable - just readonly test */
1703 #define VNOSAVE 0x100 /* when text is on the heap before setvareq */
1705 # define VDYNAMIC 0x200 /* dynamic variable */
1711 static const char defifsvar[] ALIGN1 = "IFS= \t\n";
1712 #define defifs (defifsvar + 4)
1714 static const char defifs[] ALIGN1 = " \t\n";
1718 /* Need to be before varinit_data[] */
1719 #if ENABLE_LOCALE_SUPPORT
1721 change_lc_all(const char *value)
1723 if (value && *value != '\0')
1724 setlocale(LC_ALL, value);
1727 change_lc_ctype(const char *value)
1729 if (value && *value != '\0')
1730 setlocale(LC_CTYPE, value);
1734 static void chkmail(void);
1735 static void changemail(const char *);
1737 static void changepath(const char *);
1738 #if ENABLE_ASH_RANDOM_SUPPORT
1739 static void change_random(const char *);
1742 static const struct {
1745 void (*func)(const char *);
1746 } varinit_data[] = {
1748 { VSTRFIXED|VTEXTFIXED , defifsvar , NULL },
1750 { VSTRFIXED|VTEXTFIXED|VUNSET, "IFS\0" , NULL },
1753 { VSTRFIXED|VTEXTFIXED|VUNSET, "MAIL\0" , changemail },
1754 { VSTRFIXED|VTEXTFIXED|VUNSET, "MAILPATH\0", changemail },
1756 { VSTRFIXED|VTEXTFIXED , bb_PATH_root_path, changepath },
1757 { VSTRFIXED|VTEXTFIXED , "PS1=$ " , NULL },
1758 { VSTRFIXED|VTEXTFIXED , "PS2=> " , NULL },
1759 { VSTRFIXED|VTEXTFIXED , "PS4=+ " , NULL },
1760 #if ENABLE_ASH_GETOPTS
1761 { VSTRFIXED|VTEXTFIXED , "OPTIND=1" , getoptsreset },
1763 #if ENABLE_ASH_RANDOM_SUPPORT
1764 { VSTRFIXED|VTEXTFIXED|VUNSET|VDYNAMIC, "RANDOM\0", change_random },
1766 #if ENABLE_LOCALE_SUPPORT
1767 { VSTRFIXED|VTEXTFIXED|VUNSET, "LC_ALL\0" , change_lc_all },
1768 { VSTRFIXED|VTEXTFIXED|VUNSET, "LC_CTYPE\0", change_lc_ctype },
1770 #if ENABLE_FEATURE_EDITING_SAVEHISTORY
1771 { VSTRFIXED|VTEXTFIXED|VUNSET, "HISTFILE\0", NULL },
1776 struct globals_var {
1777 struct shparam shellparam; /* $@ current positional parameters */
1778 struct redirtab *redirlist;
1780 int preverrout_fd; /* save fd2 before print debug if xflag is set. */
1781 struct var *vartab[VTABSIZE];
1782 struct var varinit[ARRAY_SIZE(varinit_data)];
1784 extern struct globals_var *const ash_ptr_to_globals_var;
1785 #define G_var (*ash_ptr_to_globals_var)
1786 #define shellparam (G_var.shellparam )
1787 #define redirlist (G_var.redirlist )
1788 #define g_nullredirs (G_var.g_nullredirs )
1789 #define preverrout_fd (G_var.preverrout_fd)
1790 #define vartab (G_var.vartab )
1791 #define varinit (G_var.varinit )
1792 #define INIT_G_var() do { \
1794 (*(struct globals_var**)&ash_ptr_to_globals_var) = xzalloc(sizeof(G_var)); \
1796 for (i = 0; i < ARRAY_SIZE(varinit_data); i++) { \
1797 varinit[i].flags = varinit_data[i].flags; \
1798 varinit[i].text = varinit_data[i].text; \
1799 varinit[i].func = varinit_data[i].func; \
1803 #define vifs varinit[0]
1805 # define vmail (&vifs)[1]
1806 # define vmpath (&vmail)[1]
1807 # define vpath (&vmpath)[1]
1809 # define vpath (&vifs)[1]
1811 #define vps1 (&vpath)[1]
1812 #define vps2 (&vps1)[1]
1813 #define vps4 (&vps2)[1]
1814 #if ENABLE_ASH_GETOPTS
1815 # define voptind (&vps4)[1]
1816 # if ENABLE_ASH_RANDOM_SUPPORT
1817 # define vrandom (&voptind)[1]
1820 # if ENABLE_ASH_RANDOM_SUPPORT
1821 # define vrandom (&vps4)[1]
1826 * The following macros access the values of the above variables.
1827 * They have to skip over the name. They return the null string
1828 * for unset variables.
1830 #define ifsval() (vifs.text + 4)
1831 #define ifsset() ((vifs.flags & VUNSET) == 0)
1833 # define mailval() (vmail.text + 5)
1834 # define mpathval() (vmpath.text + 9)
1835 # define mpathset() ((vmpath.flags & VUNSET) == 0)
1837 #define pathval() (vpath.text + 5)
1838 #define ps1val() (vps1.text + 4)
1839 #define ps2val() (vps2.text + 4)
1840 #define ps4val() (vps4.text + 4)
1841 #if ENABLE_ASH_GETOPTS
1842 # define optindval() (voptind.text + 7)
1846 #define is_name(c) ((c) == '_' || isalpha((unsigned char)(c)))
1847 #define is_in_name(c) ((c) == '_' || isalnum((unsigned char)(c)))
1849 #if ENABLE_ASH_GETOPTS
1851 getoptsreset(const char *value)
1853 shellparam.optind = number(value);
1854 shellparam.optoff = -1;
1859 * Return of a legal variable name (a letter or underscore followed by zero or
1860 * more letters, underscores, and digits).
1863 endofname(const char *name)
1871 if (!is_in_name(*p))
1878 * Compares two strings up to the first = or '\0'. The first
1879 * string must be terminated by '='; the second may be terminated by
1880 * either '=' or '\0'.
1883 varcmp(const char *p, const char *q)
1887 while ((c = *p) == (d = *q)) {
1902 varequal(const char *a, const char *b)
1904 return !varcmp(a, b);
1908 * Find the appropriate entry in the hash table from the name.
1910 static struct var **
1911 hashvar(const char *p)
1915 hashval = ((unsigned char) *p) << 4;
1916 while (*p && *p != '=')
1917 hashval += (unsigned char) *p++;
1918 return &vartab[hashval % VTABSIZE];
1922 vpcmp(const void *a, const void *b)
1924 return varcmp(*(const char **)a, *(const char **)b);
1928 * This routine initializes the builtin variables.
1938 * PS1 depends on uid
1940 #if ENABLE_FEATURE_EDITING && ENABLE_FEATURE_EDITING_FANCY_PROMPT
1941 vps1.text = "PS1=\\w \\$ ";
1944 vps1.text = "PS1=# ";
1947 end = vp + ARRAY_SIZE(varinit);
1949 vpp = hashvar(vp->text);
1952 } while (++vp < end);
1955 static struct var **
1956 findvar(struct var **vpp, const char *name)
1958 for (; *vpp; vpp = &(*vpp)->next) {
1959 if (varequal((*vpp)->text, name)) {
1967 * Find the value of a variable. Returns NULL if not set.
1970 lookupvar(const char *name)
1974 v = *findvar(hashvar(name), name);
1978 * Dynamic variables are implemented roughly the same way they are
1979 * in bash. Namely, they're "special" so long as they aren't unset.
1980 * As soon as they're unset, they're no longer dynamic, and dynamic
1981 * lookup will no longer happen at that point. -- PFM.
1983 if ((v->flags & VDYNAMIC))
1986 if (!(v->flags & VUNSET))
1987 return strchrnul(v->text, '=') + 1;
1993 * Search the environment of a builtin command.
1996 bltinlookup(const char *name)
2000 for (sp = cmdenviron; sp; sp = sp->next) {
2001 if (varequal(sp->text, name))
2002 return strchrnul(sp->text, '=') + 1;
2004 return lookupvar(name);
2008 * Same as setvar except that the variable and value are passed in
2009 * the first argument as name=value. Since the first argument will
2010 * be actually stored in the table, it should not be a string that
2012 * Called with interrupts off.
2015 setvareq(char *s, int flags)
2017 struct var *vp, **vpp;
2020 flags |= (VEXPORT & (((unsigned) (1 - aflag)) - 1));
2021 vp = *findvar(vpp, s);
2023 if ((vp->flags & (VREADONLY|VDYNAMIC)) == VREADONLY) {
2026 if (flags & VNOSAVE)
2029 ash_msg_and_raise_error("%.*s: is read only", strchrnul(n, '=') - n, n);
2035 if (vp->func && (flags & VNOFUNC) == 0)
2036 (*vp->func)(strchrnul(s, '=') + 1);
2038 if ((vp->flags & (VTEXTFIXED|VSTACK)) == 0)
2039 free((char*)vp->text);
2041 flags |= vp->flags & ~(VTEXTFIXED|VSTACK|VNOSAVE|VUNSET);
2046 vp = ckzalloc(sizeof(*vp));
2048 /*vp->func = NULL; - ckzalloc did it */
2051 if (!(flags & (VTEXTFIXED|VSTACK|VNOSAVE)))
2058 * Set the value of a variable. The flags argument is ored with the
2059 * flags of the variable. If val is NULL, the variable is unset.
2062 setvar(const char *name, const char *val, int flags)
2069 q = endofname(name);
2070 p = strchrnul(q, '=');
2072 if (!namelen || p != q)
2073 ash_msg_and_raise_error("%.*s: bad variable name", namelen, name);
2078 vallen = strlen(val);
2081 nameeq = ckmalloc(namelen + vallen + 2);
2082 p = (char *)memcpy(nameeq, name, namelen) + namelen;
2085 p = (char *)memcpy(p, val, vallen) + vallen;
2088 setvareq(nameeq, flags | VNOSAVE);
2092 #if ENABLE_ASH_GETOPTS
2094 * Safe version of setvar, returns 1 on success 0 on failure.
2097 setvarsafe(const char *name, const char *val, int flags)
2100 volatile int saveint;
2101 struct jmploc *volatile savehandler = exception_handler;
2102 struct jmploc jmploc;
2105 if (setjmp(jmploc.loc))
2108 exception_handler = &jmploc;
2109 setvar(name, val, flags);
2112 exception_handler = savehandler;
2113 RESTORE_INT(saveint);
2119 * Unset the specified variable.
2122 unsetvar(const char *s)
2128 vpp = findvar(hashvar(s), s);
2132 int flags = vp->flags;
2135 if (flags & VREADONLY)
2138 vp->flags &= ~VDYNAMIC;
2142 if ((flags & VSTRFIXED) == 0) {
2144 if ((flags & (VTEXTFIXED|VSTACK)) == 0)
2145 free((char*)vp->text);
2151 vp->flags &= ~VEXPORT;
2161 * Process a linked list of variable assignments.
2164 listsetvar(struct strlist *list_set_var, int flags)
2166 struct strlist *lp = list_set_var;
2172 setvareq(lp->text, flags);
2179 * Generate a list of variables satisfying the given conditions.
2182 listvars(int on, int off, char ***end)
2193 for (vp = *vpp; vp; vp = vp->next) {
2194 if ((vp->flags & mask) == on) {
2195 if (ep == stackstrend())
2196 ep = growstackstr();
2197 *ep++ = (char *) vp->text;
2200 } while (++vpp < vartab + VTABSIZE);
2201 if (ep == stackstrend())
2202 ep = growstackstr();
2206 return grabstackstr(ep);
2210 /* ============ Path search helper
2212 * The variable path (passed by reference) should be set to the start
2213 * of the path before the first call; padvance will update
2214 * this value as it proceeds. Successive calls to padvance will return
2215 * the possible path expansions in sequence. If an option (indicated by
2216 * a percent sign) appears in the path entry then the global variable
2217 * pathopt will be set to point to it; otherwise pathopt will be set to
2220 static const char *pathopt; /* set by padvance */
2223 padvance(const char **path, const char *name)
2233 for (p = start; *p && *p != ':' && *p != '%'; p++)
2235 len = p - start + strlen(name) + 2; /* "2" is for '/' and '\0' */
2236 while (stackblocksize() < len)
2240 memcpy(q, start, p - start);
2248 while (*p && *p != ':')
2255 return stalloc(len);
2259 /* ============ Prompt */
2261 static smallint doprompt; /* if set, prompt the user */
2262 static smallint needprompt; /* true if interactive and at start of line */
2264 #if ENABLE_FEATURE_EDITING
2265 static line_input_t *line_input_state;
2266 static const char *cmdedit_prompt;
2268 putprompt(const char *s)
2270 if (ENABLE_ASH_EXPAND_PRMT) {
2271 free((char*)cmdedit_prompt);
2272 cmdedit_prompt = ckstrdup(s);
2279 putprompt(const char *s)
2285 #if ENABLE_ASH_EXPAND_PRMT
2286 /* expandstr() needs parsing machinery, so it is far away ahead... */
2287 static const char *expandstr(const char *ps);
2289 #define expandstr(s) s
2293 setprompt(int whichprompt)
2296 #if ENABLE_ASH_EXPAND_PRMT
2297 struct stackmark smark;
2302 switch (whichprompt) {
2312 #if ENABLE_ASH_EXPAND_PRMT
2313 setstackmark(&smark);
2314 stalloc(stackblocksize());
2316 putprompt(expandstr(prompt));
2317 #if ENABLE_ASH_EXPAND_PRMT
2318 popstackmark(&smark);
2323 /* ============ The cd and pwd commands */
2325 #define CD_PHYSICAL 1
2328 static int docd(const char *, int);
2337 while ((i = nextopt("LP"))) {
2339 flags ^= CD_PHYSICAL;
2348 * Update curdir (the name of the current directory) in response to a
2352 updatepwd(const char *dir)
2359 cdcomppath = ststrdup(dir);
2362 if (curdir == nullstr)
2364 new = stack_putstr(curdir, new);
2366 new = makestrspace(strlen(dir) + 2, new);
2367 lim = (char *)stackblock() + 1;
2371 if (new > lim && *lim == '/')
2376 if (dir[1] == '/' && dir[2] != '/') {
2382 p = strtok(cdcomppath, "/");
2386 if (p[1] == '.' && p[2] == '\0') {
2398 new = stack_putstr(p, new);
2406 return stackblock();
2410 * Find out what the current directory is. If we already know the current
2411 * directory, this routine returns immediately.
2416 char *dir = getcwd(NULL, 0); /* huh, using glibc extension? */
2417 return dir ? dir : nullstr;
2421 setpwd(const char *val, int setold)
2425 oldcur = dir = curdir;
2428 setvar("OLDPWD", oldcur, VEXPORT);
2431 if (physdir != nullstr) {
2432 if (physdir != oldcur)
2436 if (oldcur == val || !val) {
2442 dir = ckstrdup(val);
2443 if (oldcur != dir && oldcur != nullstr) {
2448 setvar("PWD", dir, VEXPORT);
2451 static void hashcd(void);
2454 * Actually do the chdir. We also call hashcd to let the routines in exec.c
2455 * know that the current directory has changed.
2458 docd(const char *dest, int flags)
2460 const char *dir = 0;
2463 TRACE(("docd(\"%s\", %d) called\n", dest, flags));
2466 if (!(flags & CD_PHYSICAL)) {
2467 dir = updatepwd(dest);
2482 cdcmd(int argc ATTRIBUTE_UNUSED, char **argv ATTRIBUTE_UNUSED)
2494 dest = bltinlookup(homestr);
2495 else if (LONE_DASH(dest)) {
2496 dest = bltinlookup("OLDPWD");
2518 path = bltinlookup("CDPATH");
2527 p = padvance(&path, dest);
2528 if (stat(p, &statb) >= 0 && S_ISDIR(statb.st_mode)) {
2532 if (!docd(p, flags))
2537 ash_msg_and_raise_error("can't cd to %s", dest);
2540 if (flags & CD_PRINT)
2541 out1fmt(snlfmt, curdir);
2546 pwdcmd(int argc ATTRIBUTE_UNUSED, char **argv ATTRIBUTE_UNUSED)
2549 const char *dir = curdir;
2553 if (physdir == nullstr)
2557 out1fmt(snlfmt, dir);
2562 /* ============ ... */
2564 #define IBUFSIZ COMMON_BUFSIZE
2565 #define basebuf bb_common_bufsiz1 /* buffer for top level input file */
2567 /* Syntax classes */
2568 #define CWORD 0 /* character is nothing special */
2569 #define CNL 1 /* newline character */
2570 #define CBACK 2 /* a backslash character */
2571 #define CSQUOTE 3 /* single quote */
2572 #define CDQUOTE 4 /* double quote */
2573 #define CENDQUOTE 5 /* a terminating quote */
2574 #define CBQUOTE 6 /* backwards single quote */
2575 #define CVAR 7 /* a dollar sign */
2576 #define CENDVAR 8 /* a '}' character */
2577 #define CLP 9 /* a left paren in arithmetic */
2578 #define CRP 10 /* a right paren in arithmetic */
2579 #define CENDFILE 11 /* end of file */
2580 #define CCTL 12 /* like CWORD, except it must be escaped */
2581 #define CSPCL 13 /* these terminate a word */
2582 #define CIGN 14 /* character should be ignored */
2584 #if ENABLE_ASH_ALIAS
2588 #define PEOA_OR_PEOF PEOA
2592 #define PEOA_OR_PEOF PEOF
2595 /* number syntax index */
2596 #define BASESYNTAX 0 /* not in quotes */
2597 #define DQSYNTAX 1 /* in double quotes */
2598 #define SQSYNTAX 2 /* in single quotes */
2599 #define ARISYNTAX 3 /* in arithmetic */
2600 #define PSSYNTAX 4 /* prompt */
2602 #if ENABLE_ASH_OPTIMIZE_FOR_SIZE
2603 #define USE_SIT_FUNCTION
2606 #if ENABLE_ASH_MATH_SUPPORT
2607 static const char S_I_T[][4] = {
2608 #if ENABLE_ASH_ALIAS
2609 { CSPCL, CIGN, CIGN, CIGN }, /* 0, PEOA */
2611 { CSPCL, CWORD, CWORD, CWORD }, /* 1, ' ' */
2612 { CNL, CNL, CNL, CNL }, /* 2, \n */
2613 { CWORD, CCTL, CCTL, CWORD }, /* 3, !*-/:=?[]~ */
2614 { CDQUOTE, CENDQUOTE, CWORD, CWORD }, /* 4, '"' */
2615 { CVAR, CVAR, CWORD, CVAR }, /* 5, $ */
2616 { CSQUOTE, CWORD, CENDQUOTE, CWORD }, /* 6, "'" */
2617 { CSPCL, CWORD, CWORD, CLP }, /* 7, ( */
2618 { CSPCL, CWORD, CWORD, CRP }, /* 8, ) */
2619 { CBACK, CBACK, CCTL, CBACK }, /* 9, \ */
2620 { CBQUOTE, CBQUOTE, CWORD, CBQUOTE }, /* 10, ` */
2621 { CENDVAR, CENDVAR, CWORD, CENDVAR }, /* 11, } */
2622 #ifndef USE_SIT_FUNCTION
2623 { CENDFILE, CENDFILE, CENDFILE, CENDFILE }, /* 12, PEOF */
2624 { CWORD, CWORD, CWORD, CWORD }, /* 13, 0-9A-Za-z */
2625 { CCTL, CCTL, CCTL, CCTL } /* 14, CTLESC ... */
2629 static const char S_I_T[][3] = {
2630 #if ENABLE_ASH_ALIAS
2631 { CSPCL, CIGN, CIGN }, /* 0, PEOA */
2633 { CSPCL, CWORD, CWORD }, /* 1, ' ' */
2634 { CNL, CNL, CNL }, /* 2, \n */
2635 { CWORD, CCTL, CCTL }, /* 3, !*-/:=?[]~ */
2636 { CDQUOTE, CENDQUOTE, CWORD }, /* 4, '"' */
2637 { CVAR, CVAR, CWORD }, /* 5, $ */
2638 { CSQUOTE, CWORD, CENDQUOTE }, /* 6, "'" */
2639 { CSPCL, CWORD, CWORD }, /* 7, ( */
2640 { CSPCL, CWORD, CWORD }, /* 8, ) */
2641 { CBACK, CBACK, CCTL }, /* 9, \ */
2642 { CBQUOTE, CBQUOTE, CWORD }, /* 10, ` */
2643 { CENDVAR, CENDVAR, CWORD }, /* 11, } */
2644 #ifndef USE_SIT_FUNCTION
2645 { CENDFILE, CENDFILE, CENDFILE }, /* 12, PEOF */
2646 { CWORD, CWORD, CWORD }, /* 13, 0-9A-Za-z */
2647 { CCTL, CCTL, CCTL } /* 14, CTLESC ... */
2650 #endif /* ASH_MATH_SUPPORT */
2652 #ifdef USE_SIT_FUNCTION
2655 SIT(int c, int syntax)
2657 static const char spec_symbls[] ALIGN1 = "\t\n !\"$&'()*-/:;<=>?[\\]`|}~";
2658 #if ENABLE_ASH_ALIAS
2659 static const char syntax_index_table[] ALIGN1 = {
2660 1, 2, 1, 3, 4, 5, 1, 6, /* "\t\n !\"$&'" */
2661 7, 8, 3, 3, 3, 3, 1, 1, /* "()*-/:;<" */
2662 3, 1, 3, 3, 9, 3, 10, 1, /* "=>?[\\]`|" */
2666 static const char syntax_index_table[] ALIGN1 = {
2667 0, 1, 0, 2, 3, 4, 0, 5, /* "\t\n !\"$&'" */
2668 6, 7, 2, 2, 2, 2, 0, 0, /* "()*-/:;<" */
2669 2, 0, 2, 2, 8, 2, 9, 0, /* "=>?[\\]`|" */
2676 if (c == PEOF) /* 2^8+2 */
2678 #if ENABLE_ASH_ALIAS
2679 if (c == PEOA) /* 2^8+1 */
2683 #define U_C(c) ((unsigned char)(c))
2685 if ((unsigned char)c >= (unsigned char)(CTLESC)
2686 && (unsigned char)c <= (unsigned char)(CTLQUOTEMARK)
2690 s = strchr(spec_symbls, c);
2691 if (s == NULL || *s == '\0')
2693 indx = syntax_index_table[(s - spec_symbls)];
2695 return S_I_T[indx][syntax];
2698 #else /* !USE_SIT_FUNCTION */
2700 #if ENABLE_ASH_ALIAS
2701 #define CSPCL_CIGN_CIGN_CIGN 0
2702 #define CSPCL_CWORD_CWORD_CWORD 1
2703 #define CNL_CNL_CNL_CNL 2
2704 #define CWORD_CCTL_CCTL_CWORD 3
2705 #define CDQUOTE_CENDQUOTE_CWORD_CWORD 4
2706 #define CVAR_CVAR_CWORD_CVAR 5
2707 #define CSQUOTE_CWORD_CENDQUOTE_CWORD 6
2708 #define CSPCL_CWORD_CWORD_CLP 7
2709 #define CSPCL_CWORD_CWORD_CRP 8
2710 #define CBACK_CBACK_CCTL_CBACK 9
2711 #define CBQUOTE_CBQUOTE_CWORD_CBQUOTE 10
2712 #define CENDVAR_CENDVAR_CWORD_CENDVAR 11
2713 #define CENDFILE_CENDFILE_CENDFILE_CENDFILE 12
2714 #define CWORD_CWORD_CWORD_CWORD 13
2715 #define CCTL_CCTL_CCTL_CCTL 14
2717 #define CSPCL_CWORD_CWORD_CWORD 0
2718 #define CNL_CNL_CNL_CNL 1
2719 #define CWORD_CCTL_CCTL_CWORD 2
2720 #define CDQUOTE_CENDQUOTE_CWORD_CWORD 3
2721 #define CVAR_CVAR_CWORD_CVAR 4
2722 #define CSQUOTE_CWORD_CENDQUOTE_CWORD 5
2723 #define CSPCL_CWORD_CWORD_CLP 6
2724 #define CSPCL_CWORD_CWORD_CRP 7
2725 #define CBACK_CBACK_CCTL_CBACK 8
2726 #define CBQUOTE_CBQUOTE_CWORD_CBQUOTE 9
2727 #define CENDVAR_CENDVAR_CWORD_CENDVAR 10
2728 #define CENDFILE_CENDFILE_CENDFILE_CENDFILE 11
2729 #define CWORD_CWORD_CWORD_CWORD 12
2730 #define CCTL_CCTL_CCTL_CCTL 13
2733 static const char syntax_index_table[258] = {
2734 /* BASESYNTAX_DQSYNTAX_SQSYNTAX_ARISYNTAX */
2735 /* 0 PEOF */ CENDFILE_CENDFILE_CENDFILE_CENDFILE,
2736 #if ENABLE_ASH_ALIAS
2737 /* 1 PEOA */ CSPCL_CIGN_CIGN_CIGN,
2739 /* 2 -128 0x80 */ CWORD_CWORD_CWORD_CWORD,
2740 /* 3 -127 CTLESC */ CCTL_CCTL_CCTL_CCTL,
2741 /* 4 -126 CTLVAR */ CCTL_CCTL_CCTL_CCTL,
2742 /* 5 -125 CTLENDVAR */ CCTL_CCTL_CCTL_CCTL,
2743 /* 6 -124 CTLBACKQ */ CCTL_CCTL_CCTL_CCTL,
2744 /* 7 -123 CTLQUOTE */ CCTL_CCTL_CCTL_CCTL,
2745 /* 8 -122 CTLARI */ CCTL_CCTL_CCTL_CCTL,
2746 /* 9 -121 CTLENDARI */ CCTL_CCTL_CCTL_CCTL,
2747 /* 10 -120 CTLQUOTEMARK */ CCTL_CCTL_CCTL_CCTL,
2748 /* 11 -119 */ CWORD_CWORD_CWORD_CWORD,
2749 /* 12 -118 */ CWORD_CWORD_CWORD_CWORD,
2750 /* 13 -117 */ CWORD_CWORD_CWORD_CWORD,
2751 /* 14 -116 */ CWORD_CWORD_CWORD_CWORD,
2752 /* 15 -115 */ CWORD_CWORD_CWORD_CWORD,
2753 /* 16 -114 */ CWORD_CWORD_CWORD_CWORD,
2754 /* 17 -113 */ CWORD_CWORD_CWORD_CWORD,
2755 /* 18 -112 */ CWORD_CWORD_CWORD_CWORD,
2756 /* 19 -111 */ CWORD_CWORD_CWORD_CWORD,
2757 /* 20 -110 */ CWORD_CWORD_CWORD_CWORD,
2758 /* 21 -109 */ CWORD_CWORD_CWORD_CWORD,
2759 /* 22 -108 */ CWORD_CWORD_CWORD_CWORD,
2760 /* 23 -107 */ CWORD_CWORD_CWORD_CWORD,
2761 /* 24 -106 */ CWORD_CWORD_CWORD_CWORD,
2762 /* 25 -105 */ CWORD_CWORD_CWORD_CWORD,
2763 /* 26 -104 */ CWORD_CWORD_CWORD_CWORD,
2764 /* 27 -103 */ CWORD_CWORD_CWORD_CWORD,
2765 /* 28 -102 */ CWORD_CWORD_CWORD_CWORD,
2766 /* 29 -101 */ CWORD_CWORD_CWORD_CWORD,
2767 /* 30 -100 */ CWORD_CWORD_CWORD_CWORD,
2768 /* 31 -99 */ CWORD_CWORD_CWORD_CWORD,
2769 /* 32 -98 */ CWORD_CWORD_CWORD_CWORD,
2770 /* 33 -97 */ CWORD_CWORD_CWORD_CWORD,
2771 /* 34 -96 */ CWORD_CWORD_CWORD_CWORD,
2772 /* 35 -95 */ CWORD_CWORD_CWORD_CWORD,
2773 /* 36 -94 */ CWORD_CWORD_CWORD_CWORD,
2774 /* 37 -93 */ CWORD_CWORD_CWORD_CWORD,
2775 /* 38 -92 */ CWORD_CWORD_CWORD_CWORD,
2776 /* 39 -91 */ CWORD_CWORD_CWORD_CWORD,
2777 /* 40 -90 */ CWORD_CWORD_CWORD_CWORD,
2778 /* 41 -89 */ CWORD_CWORD_CWORD_CWORD,
2779 /* 42 -88 */ CWORD_CWORD_CWORD_CWORD,
2780 /* 43 -87 */ CWORD_CWORD_CWORD_CWORD,
2781 /* 44 -86 */ CWORD_CWORD_CWORD_CWORD,
2782 /* 45 -85 */ CWORD_CWORD_CWORD_CWORD,
2783 /* 46 -84 */ CWORD_CWORD_CWORD_CWORD,
2784 /* 47 -83 */ CWORD_CWORD_CWORD_CWORD,
2785 /* 48 -82 */ CWORD_CWORD_CWORD_CWORD,
2786 /* 49 -81 */ CWORD_CWORD_CWORD_CWORD,
2787 /* 50 -80 */ CWORD_CWORD_CWORD_CWORD,
2788 /* 51 -79 */ CWORD_CWORD_CWORD_CWORD,
2789 /* 52 -78 */ CWORD_CWORD_CWORD_CWORD,
2790 /* 53 -77 */ CWORD_CWORD_CWORD_CWORD,
2791 /* 54 -76 */ CWORD_CWORD_CWORD_CWORD,
2792 /* 55 -75 */ CWORD_CWORD_CWORD_CWORD,
2793 /* 56 -74 */ CWORD_CWORD_CWORD_CWORD,
2794 /* 57 -73 */ CWORD_CWORD_CWORD_CWORD,
2795 /* 58 -72 */ CWORD_CWORD_CWORD_CWORD,
2796 /* 59 -71 */ CWORD_CWORD_CWORD_CWORD,
2797 /* 60 -70 */ CWORD_CWORD_CWORD_CWORD,
2798 /* 61 -69 */ CWORD_CWORD_CWORD_CWORD,
2799 /* 62 -68 */ CWORD_CWORD_CWORD_CWORD,
2800 /* 63 -67 */ CWORD_CWORD_CWORD_CWORD,
2801 /* 64 -66 */ CWORD_CWORD_CWORD_CWORD,
2802 /* 65 -65 */ CWORD_CWORD_CWORD_CWORD,
2803 /* 66 -64 */ CWORD_CWORD_CWORD_CWORD,
2804 /* 67 -63 */ CWORD_CWORD_CWORD_CWORD,
2805 /* 68 -62 */ CWORD_CWORD_CWORD_CWORD,
2806 /* 69 -61 */ CWORD_CWORD_CWORD_CWORD,
2807 /* 70 -60 */ CWORD_CWORD_CWORD_CWORD,
2808 /* 71 -59 */ CWORD_CWORD_CWORD_CWORD,
2809 /* 72 -58 */ CWORD_CWORD_CWORD_CWORD,
2810 /* 73 -57 */ CWORD_CWORD_CWORD_CWORD,
2811 /* 74 -56 */ CWORD_CWORD_CWORD_CWORD,
2812 /* 75 -55 */ CWORD_CWORD_CWORD_CWORD,
2813 /* 76 -54 */ CWORD_CWORD_CWORD_CWORD,
2814 /* 77 -53 */ CWORD_CWORD_CWORD_CWORD,
2815 /* 78 -52 */ CWORD_CWORD_CWORD_CWORD,
2816 /* 79 -51 */ CWORD_CWORD_CWORD_CWORD,
2817 /* 80 -50 */ CWORD_CWORD_CWORD_CWORD,
2818 /* 81 -49 */ CWORD_CWORD_CWORD_CWORD,
2819 /* 82 -48 */ CWORD_CWORD_CWORD_CWORD,
2820 /* 83 -47 */ CWORD_CWORD_CWORD_CWORD,
2821 /* 84 -46 */ CWORD_CWORD_CWORD_CWORD,
2822 /* 85 -45 */ CWORD_CWORD_CWORD_CWORD,
2823 /* 86 -44 */ CWORD_CWORD_CWORD_CWORD,
2824 /* 87 -43 */ CWORD_CWORD_CWORD_CWORD,
2825 /* 88 -42 */ CWORD_CWORD_CWORD_CWORD,
2826 /* 89 -41 */ CWORD_CWORD_CWORD_CWORD,
2827 /* 90 -40 */ CWORD_CWORD_CWORD_CWORD,
2828 /* 91 -39 */ CWORD_CWORD_CWORD_CWORD,
2829 /* 92 -38 */ CWORD_CWORD_CWORD_CWORD,
2830 /* 93 -37 */ CWORD_CWORD_CWORD_CWORD,
2831 /* 94 -36 */ CWORD_CWORD_CWORD_CWORD,
2832 /* 95 -35 */ CWORD_CWORD_CWORD_CWORD,
2833 /* 96 -34 */ CWORD_CWORD_CWORD_CWORD,
2834 /* 97 -33 */ CWORD_CWORD_CWORD_CWORD,
2835 /* 98 -32 */ CWORD_CWORD_CWORD_CWORD,
2836 /* 99 -31 */ CWORD_CWORD_CWORD_CWORD,
2837 /* 100 -30 */ CWORD_CWORD_CWORD_CWORD,
2838 /* 101 -29 */ CWORD_CWORD_CWORD_CWORD,
2839 /* 102 -28 */ CWORD_CWORD_CWORD_CWORD,
2840 /* 103 -27 */ CWORD_CWORD_CWORD_CWORD,
2841 /* 104 -26 */ CWORD_CWORD_CWORD_CWORD,
2842 /* 105 -25 */ CWORD_CWORD_CWORD_CWORD,
2843 /* 106 -24 */ CWORD_CWORD_CWORD_CWORD,
2844 /* 107 -23 */ CWORD_CWORD_CWORD_CWORD,
2845 /* 108 -22 */ CWORD_CWORD_CWORD_CWORD,
2846 /* 109 -21 */ CWORD_CWORD_CWORD_CWORD,
2847 /* 110 -20 */ CWORD_CWORD_CWORD_CWORD,
2848 /* 111 -19 */ CWORD_CWORD_CWORD_CWORD,
2849 /* 112 -18 */ CWORD_CWORD_CWORD_CWORD,
2850 /* 113 -17 */ CWORD_CWORD_CWORD_CWORD,
2851 /* 114 -16 */ CWORD_CWORD_CWORD_CWORD,
2852 /* 115 -15 */ CWORD_CWORD_CWORD_CWORD,
2853 /* 116 -14 */ CWORD_CWORD_CWORD_CWORD,
2854 /* 117 -13 */ CWORD_CWORD_CWORD_CWORD,
2855 /* 118 -12 */ CWORD_CWORD_CWORD_CWORD,
2856 /* 119 -11 */ CWORD_CWORD_CWORD_CWORD,
2857 /* 120 -10 */ CWORD_CWORD_CWORD_CWORD,
2858 /* 121 -9 */ CWORD_CWORD_CWORD_CWORD,
2859 /* 122 -8 */ CWORD_CWORD_CWORD_CWORD,
2860 /* 123 -7 */ CWORD_CWORD_CWORD_CWORD,
2861 /* 124 -6 */ CWORD_CWORD_CWORD_CWORD,
2862 /* 125 -5 */ CWORD_CWORD_CWORD_CWORD,
2863 /* 126 -4 */ CWORD_CWORD_CWORD_CWORD,
2864 /* 127 -3 */ CWORD_CWORD_CWORD_CWORD,
2865 /* 128 -2 */ CWORD_CWORD_CWORD_CWORD,
2866 /* 129 -1 */ CWORD_CWORD_CWORD_CWORD,
2867 /* 130 0 */ CWORD_CWORD_CWORD_CWORD,
2868 /* 131 1 */ CWORD_CWORD_CWORD_CWORD,
2869 /* 132 2 */ CWORD_CWORD_CWORD_CWORD,
2870 /* 133 3 */ CWORD_CWORD_CWORD_CWORD,
2871 /* 134 4 */ CWORD_CWORD_CWORD_CWORD,
2872 /* 135 5 */ CWORD_CWORD_CWORD_CWORD,
2873 /* 136 6 */ CWORD_CWORD_CWORD_CWORD,
2874 /* 137 7 */ CWORD_CWORD_CWORD_CWORD,
2875 /* 138 8 */ CWORD_CWORD_CWORD_CWORD,
2876 /* 139 9 "\t" */ CSPCL_CWORD_CWORD_CWORD,
2877 /* 140 10 "\n" */ CNL_CNL_CNL_CNL,
2878 /* 141 11 */ CWORD_CWORD_CWORD_CWORD,
2879 /* 142 12 */ CWORD_CWORD_CWORD_CWORD,
2880 /* 143 13 */ CWORD_CWORD_CWORD_CWORD,
2881 /* 144 14 */ CWORD_CWORD_CWORD_CWORD,
2882 /* 145 15 */ CWORD_CWORD_CWORD_CWORD,
2883 /* 146 16 */ CWORD_CWORD_CWORD_CWORD,
2884 /* 147 17 */ CWORD_CWORD_CWORD_CWORD,
2885 /* 148 18 */ CWORD_CWORD_CWORD_CWORD,
2886 /* 149 19 */ CWORD_CWORD_CWORD_CWORD,
2887 /* 150 20 */ CWORD_CWORD_CWORD_CWORD,
2888 /* 151 21 */ CWORD_CWORD_CWORD_CWORD,
2889 /* 152 22 */ CWORD_CWORD_CWORD_CWORD,
2890 /* 153 23 */ CWORD_CWORD_CWORD_CWORD,
2891 /* 154 24 */ CWORD_CWORD_CWORD_CWORD,
2892 /* 155 25 */ CWORD_CWORD_CWORD_CWORD,
2893 /* 156 26 */ CWORD_CWORD_CWORD_CWORD,
2894 /* 157 27 */ CWORD_CWORD_CWORD_CWORD,
2895 /* 158 28 */ CWORD_CWORD_CWORD_CWORD,
2896 /* 159 29 */ CWORD_CWORD_CWORD_CWORD,
2897 /* 160 30 */ CWORD_CWORD_CWORD_CWORD,
2898 /* 161 31 */ CWORD_CWORD_CWORD_CWORD,
2899 /* 162 32 " " */ CSPCL_CWORD_CWORD_CWORD,
2900 /* 163 33 "!" */ CWORD_CCTL_CCTL_CWORD,
2901 /* 164 34 """ */ CDQUOTE_CENDQUOTE_CWORD_CWORD,
2902 /* 165 35 "#" */ CWORD_CWORD_CWORD_CWORD,
2903 /* 166 36 "$" */ CVAR_CVAR_CWORD_CVAR,
2904 /* 167 37 "%" */ CWORD_CWORD_CWORD_CWORD,
2905 /* 168 38 "&" */ CSPCL_CWORD_CWORD_CWORD,
2906 /* 169 39 "'" */ CSQUOTE_CWORD_CENDQUOTE_CWORD,
2907 /* 170 40 "(" */ CSPCL_CWORD_CWORD_CLP,
2908 /* 171 41 ")" */ CSPCL_CWORD_CWORD_CRP,
2909 /* 172 42 "*" */ CWORD_CCTL_CCTL_CWORD,
2910 /* 173 43 "+" */ CWORD_CWORD_CWORD_CWORD,
2911 /* 174 44 "," */ CWORD_CWORD_CWORD_CWORD,
2912 /* 175 45 "-" */ CWORD_CCTL_CCTL_CWORD,
2913 /* 176 46 "." */ CWORD_CWORD_CWORD_CWORD,
2914 /* 177 47 "/" */ CWORD_CCTL_CCTL_CWORD,
2915 /* 178 48 "0" */ CWORD_CWORD_CWORD_CWORD,
2916 /* 179 49 "1" */ CWORD_CWORD_CWORD_CWORD,
2917 /* 180 50 "2" */ CWORD_CWORD_CWORD_CWORD,
2918 /* 181 51 "3" */ CWORD_CWORD_CWORD_CWORD,
2919 /* 182 52 "4" */ CWORD_CWORD_CWORD_CWORD,
2920 /* 183 53 "5" */ CWORD_CWORD_CWORD_CWORD,
2921 /* 184 54 "6" */ CWORD_CWORD_CWORD_CWORD,
2922 /* 185 55 "7" */ CWORD_CWORD_CWORD_CWORD,
2923 /* 186 56 "8" */ CWORD_CWORD_CWORD_CWORD,
2924 /* 187 57 "9" */ CWORD_CWORD_CWORD_CWORD,
2925 /* 188 58 ":" */ CWORD_CCTL_CCTL_CWORD,
2926 /* 189 59 ";" */ CSPCL_CWORD_CWORD_CWORD,
2927 /* 190 60 "<" */ CSPCL_CWORD_CWORD_CWORD,
2928 /* 191 61 "=" */ CWORD_CCTL_CCTL_CWORD,
2929 /* 192 62 ">" */ CSPCL_CWORD_CWORD_CWORD,
2930 /* 193 63 "?" */ CWORD_CCTL_CCTL_CWORD,
2931 /* 194 64 "@" */ CWORD_CWORD_CWORD_CWORD,
2932 /* 195 65 "A" */ CWORD_CWORD_CWORD_CWORD,
2933 /* 196 66 "B" */ CWORD_CWORD_CWORD_CWORD,
2934 /* 197 67 "C" */ CWORD_CWORD_CWORD_CWORD,
2935 /* 198 68 "D" */ CWORD_CWORD_CWORD_CWORD,
2936 /* 199 69 "E" */ CWORD_CWORD_CWORD_CWORD,
2937 /* 200 70 "F" */ CWORD_CWORD_CWORD_CWORD,
2938 /* 201 71 "G" */ CWORD_CWORD_CWORD_CWORD,
2939 /* 202 72 "H" */ CWORD_CWORD_CWORD_CWORD,
2940 /* 203 73 "I" */ CWORD_CWORD_CWORD_CWORD,
2941 /* 204 74 "J" */ CWORD_CWORD_CWORD_CWORD,
2942 /* 205 75 "K" */ CWORD_CWORD_CWORD_CWORD,
2943 /* 206 76 "L" */ CWORD_CWORD_CWORD_CWORD,
2944 /* 207 77 "M" */ CWORD_CWORD_CWORD_CWORD,
2945 /* 208 78 "N" */ CWORD_CWORD_CWORD_CWORD,
2946 /* 209 79 "O" */ CWORD_CWORD_CWORD_CWORD,
2947 /* 210 80 "P" */ CWORD_CWORD_CWORD_CWORD,
2948 /* 211 81 "Q" */ CWORD_CWORD_CWORD_CWORD,
2949 /* 212 82 "R" */ CWORD_CWORD_CWORD_CWORD,
2950 /* 213 83 "S" */ CWORD_CWORD_CWORD_CWORD,
2951 /* 214 84 "T" */ CWORD_CWORD_CWORD_CWORD,
2952 /* 215 85 "U" */ CWORD_CWORD_CWORD_CWORD,
2953 /* 216 86 "V" */ CWORD_CWORD_CWORD_CWORD,
2954 /* 217 87 "W" */ CWORD_CWORD_CWORD_CWORD,
2955 /* 218 88 "X" */ CWORD_CWORD_CWORD_CWORD,
2956 /* 219 89 "Y" */ CWORD_CWORD_CWORD_CWORD,
2957 /* 220 90 "Z" */ CWORD_CWORD_CWORD_CWORD,
2958 /* 221 91 "[" */ CWORD_CCTL_CCTL_CWORD,
2959 /* 222 92 "\" */ CBACK_CBACK_CCTL_CBACK,
2960 /* 223 93 "]" */ CWORD_CCTL_CCTL_CWORD,
2961 /* 224 94 "^" */ CWORD_CWORD_CWORD_CWORD,
2962 /* 225 95 "_" */ CWORD_CWORD_CWORD_CWORD,
2963 /* 226 96 "`" */ CBQUOTE_CBQUOTE_CWORD_CBQUOTE,
2964 /* 227 97 "a" */ CWORD_CWORD_CWORD_CWORD,
2965 /* 228 98 "b" */ CWORD_CWORD_CWORD_CWORD,
2966 /* 229 99 "c" */ CWORD_CWORD_CWORD_CWORD,
2967 /* 230 100 "d" */ CWORD_CWORD_CWORD_CWORD,
2968 /* 231 101 "e" */ CWORD_CWORD_CWORD_CWORD,
2969 /* 232 102 "f" */ CWORD_CWORD_CWORD_CWORD,
2970 /* 233 103 "g" */ CWORD_CWORD_CWORD_CWORD,
2971 /* 234 104 "h" */ CWORD_CWORD_CWORD_CWORD,
2972 /* 235 105 "i" */ CWORD_CWORD_CWORD_CWORD,
2973 /* 236 106 "j" */ CWORD_CWORD_CWORD_CWORD,
2974 /* 237 107 "k" */ CWORD_CWORD_CWORD_CWORD,
2975 /* 238 108 "l" */ CWORD_CWORD_CWORD_CWORD,
2976 /* 239 109 "m" */ CWORD_CWORD_CWORD_CWORD,
2977 /* 240 110 "n" */ CWORD_CWORD_CWORD_CWORD,
2978 /* 241 111 "o" */ CWORD_CWORD_CWORD_CWORD,
2979 /* 242 112 "p" */ CWORD_CWORD_CWORD_CWORD,
2980 /* 243 113 "q" */ CWORD_CWORD_CWORD_CWORD,
2981 /* 244 114 "r" */ CWORD_CWORD_CWORD_CWORD,
2982 /* 245 115 "s" */ CWORD_CWORD_CWORD_CWORD,
2983 /* 246 116 "t" */ CWORD_CWORD_CWORD_CWORD,
2984 /* 247 117 "u" */ CWORD_CWORD_CWORD_CWORD,
2985 /* 248 118 "v" */ CWORD_CWORD_CWORD_CWORD,
2986 /* 249 119 "w" */ CWORD_CWORD_CWORD_CWORD,
2987 /* 250 120 "x" */ CWORD_CWORD_CWORD_CWORD,
2988 /* 251 121 "y" */ CWORD_CWORD_CWORD_CWORD,
2989 /* 252 122 "z" */ CWORD_CWORD_CWORD_CWORD,
2990 /* 253 123 "{" */ CWORD_CWORD_CWORD_CWORD,
2991 /* 254 124 "|" */ CSPCL_CWORD_CWORD_CWORD,
2992 /* 255 125 "}" */ CENDVAR_CENDVAR_CWORD_CENDVAR,
2993 /* 256 126 "~" */ CWORD_CCTL_CCTL_CWORD,
2994 /* 257 127 */ CWORD_CWORD_CWORD_CWORD,
2997 #define SIT(c, syntax) (S_I_T[(int)syntax_index_table[((int)c)+SYNBASE]][syntax])
2999 #endif /* USE_SIT_FUNCTION */
3002 /* ============ Alias handling */
3004 #if ENABLE_ASH_ALIAS
3006 #define ALIASINUSE 1
3017 static struct alias **atab; // [ATABSIZE];
3018 #define INIT_G_alias() do { \
3019 atab = xzalloc(ATABSIZE * sizeof(atab[0])); \
3023 static struct alias **
3024 __lookupalias(const char *name) {
3025 unsigned int hashval;
3032 ch = (unsigned char)*p;
3036 ch = (unsigned char)*++p;
3038 app = &atab[hashval % ATABSIZE];
3040 for (; *app; app = &(*app)->next) {
3041 if (strcmp(name, (*app)->name) == 0) {
3049 static struct alias *
3050 lookupalias(const char *name, int check)
3052 struct alias *ap = *__lookupalias(name);
3054 if (check && ap && (ap->flag & ALIASINUSE))
3059 static struct alias *
3060 freealias(struct alias *ap)
3064 if (ap->flag & ALIASINUSE) {
3065 ap->flag |= ALIASDEAD;
3077 setalias(const char *name, const char *val)
3079 struct alias *ap, **app;
3081 app = __lookupalias(name);
3085 if (!(ap->flag & ALIASINUSE)) {
3088 ap->val = ckstrdup(val);
3089 ap->flag &= ~ALIASDEAD;
3092 ap = ckzalloc(sizeof(struct alias));
3093 ap->name = ckstrdup(name);
3094 ap->val = ckstrdup(val);
3095 /*ap->flag = 0; - ckzalloc did it */
3096 /*ap->next = NULL;*/
3103 unalias(const char *name)
3107 app = __lookupalias(name);
3111 *app = freealias(*app);
3122 struct alias *ap, **app;
3126 for (i = 0; i < ATABSIZE; i++) {
3128 for (ap = *app; ap; ap = *app) {
3129 *app = freealias(*app);
3139 printalias(const struct alias *ap)
3141 out1fmt("%s=%s\n", ap->name, single_quote(ap->val));
3145 * TODO - sort output
3148 aliascmd(int argc ATTRIBUTE_UNUSED, char **argv)
3157 for (i = 0; i < ATABSIZE; i++) {
3158 for (ap = atab[i]; ap; ap = ap->next) {
3164 while ((n = *++argv) != NULL) {
3165 v = strchr(n+1, '=');
3166 if (v == NULL) { /* n+1: funny ksh stuff */
3167 ap = *__lookupalias(n);
3169 fprintf(stderr, "%s: %s not found\n", "alias", n);
3183 unaliascmd(int argc ATTRIBUTE_UNUSED, char **argv ATTRIBUTE_UNUSED)
3187 while ((i = nextopt("a")) != '\0') {
3193 for (i = 0; *argptr; argptr++) {
3194 if (unalias(*argptr)) {
3195 fprintf(stderr, "%s: %s not found\n", "unalias", *argptr);
3203 #endif /* ASH_ALIAS */
3206 /* ============ jobs.c */
3208 /* Mode argument to forkshell. Don't change FORK_FG or FORK_BG. */
3211 #define FORK_NOJOB 2
3213 /* mode flags for showjob(s) */
3214 #define SHOW_PGID 0x01 /* only show pgid - for jobs -p */
3215 #define SHOW_PID 0x04 /* include process pid */
3216 #define SHOW_CHANGED 0x08 /* only jobs whose state has changed */
3219 * A job structure contains information about a job. A job is either a
3220 * single process or a set of processes contained in a pipeline. In the
3221 * latter case, pidlist will be non-NULL, and will point to a -1 terminated
3226 pid_t pid; /* process id */
3227 int status; /* last process status from wait() */
3228 char *cmd; /* text of command being run */
3232 struct procstat ps0; /* status of process */
3233 struct procstat *ps; /* status or processes when more than one */
3235 int stopstatus; /* status of a stopped job */
3238 nprocs: 16, /* number of processes */
3240 #define JOBRUNNING 0 /* at least one proc running */
3241 #define JOBSTOPPED 1 /* all procs are stopped */
3242 #define JOBDONE 2 /* all procs are completed */
3244 sigint: 1, /* job was killed by SIGINT */
3245 jobctl: 1, /* job running under job control */
3247 waited: 1, /* true if this entry has been waited for */
3248 used: 1, /* true if this entry is in used */
3249 changed: 1; /* true if status has changed */
3250 struct job *prev_job; /* previous job */
3253 static pid_t backgndpid; /* pid of last background process */
3254 static smallint job_warning; /* user was warned about stopped jobs (can be 2, 1 or 0). */
3256 static struct job *makejob(/*union node *,*/ int);
3258 #define forkshell(job, node, mode) forkshell(job, mode)
3260 static int forkshell(struct job *, union node *, int);
3261 static int waitforjob(struct job *);
3264 enum { jobctl = 0 };
3265 #define setjobctl(on) do {} while (0)
3267 static smallint jobctl; /* true if doing job control */
3268 static void setjobctl(int);
3272 * Set the signal handler for the specified signal. The routine figures
3273 * out what it should be set to.
3276 setsignal(int signo)
3280 struct sigaction act;
3286 else if (*t != '\0')
3288 if (rootshell && action == S_DFL) {
3291 if (iflag || minusc || sflag == 0)
3314 t = &sigmode[signo - 1];
3318 * current setting unknown
3320 if (sigaction(signo, NULL, &act) == -1) {
3322 * Pretend it worked; maybe we should give a warning
3323 * here, but other shells don't. We don't alter
3324 * sigmode, so that we retry every time.
3328 tsig = S_RESET; /* force to be set */
3329 if (act.sa_handler == SIG_IGN) {
3332 && (signo == SIGTSTP || signo == SIGTTIN || signo == SIGTTOU)
3334 tsig = S_IGN; /* don't hard ignore these */
3338 if (tsig == S_HARD_IGN || tsig == action)
3340 act.sa_handler = SIG_DFL;
3343 act.sa_handler = onsig;
3346 act.sa_handler = SIG_IGN;
3351 sigfillset(&act.sa_mask);
3352 sigaction_set(signo, &act);
3355 /* mode flags for set_curjob */
3356 #define CUR_DELETE 2
3357 #define CUR_RUNNING 1
3358 #define CUR_STOPPED 0
3360 /* mode flags for dowait */
3361 #define DOWAIT_NONBLOCK WNOHANG
3362 #define DOWAIT_BLOCK 0
3365 /* pgrp of shell on invocation */
3366 static int initialpgrp;
3367 static int ttyfd = -1;
3370 static struct job *jobtab;
3372 static unsigned njobs;
3374 static struct job *curjob;
3375 /* number of presumed living untracked jobs */
3379 set_curjob(struct job *jp, unsigned mode)
3382 struct job **jpp, **curp;
3384 /* first remove from list */
3385 jpp = curp = &curjob;
3390 jpp = &jp1->prev_job;
3392 *jpp = jp1->prev_job;
3394 /* Then re-insert in correct position */
3402 /* job being deleted */
3405 /* newly created job or backgrounded job,
3406 put after all stopped jobs. */
3410 if (!jp1 || jp1->state != JOBSTOPPED)
3413 jpp = &jp1->prev_job;
3419 /* newly stopped job - becomes curjob */
3420 jp->prev_job = *jpp;
3428 jobno(const struct job *jp)
3430 return jp - jobtab + 1;
3435 * Convert a job name to a job structure.
3438 #define getjob(name, getctl) getjob(name)
3441 getjob(const char *name, int getctl)
3445 const char *err_msg = "No such job: %s";
3449 char *(*match)(const char *, const char *);
3464 if (c == '+' || c == '%') {
3466 err_msg = "No current job";
3472 err_msg = "No previous job";
3481 // TODO: number() instead? It does error checking...
3484 jp = jobtab + num - 1;
3501 if (match(jp->ps[0].cmd, p)) {
3505 err_msg = "%s: ambiguous";
3512 err_msg = "job %s not created under job control";
3513 if (getctl && jp->jobctl == 0)
3518 ash_msg_and_raise_error(err_msg, name);
3522 * Mark a job structure as unused.
3525 freejob(struct job *jp)
3527 struct procstat *ps;
3531 for (i = jp->nprocs, ps = jp->ps; --i >= 0; ps++) {
3532 if (ps->cmd != nullstr)
3535 if (jp->ps != &jp->ps0)
3538 set_curjob(jp, CUR_DELETE);
3544 xtcsetpgrp(int fd, pid_t pgrp)
3546 if (tcsetpgrp(fd, pgrp))
3547 ash_msg_and_raise_error("cannot set tty process group (%m)");
3551 * Turn job control on and off.
3553 * Note: This code assumes that the third arg to ioctl is a character
3554 * pointer, which is true on Berkeley systems but not System V. Since
3555 * System V doesn't have job control yet, this isn't a problem now.
3557 * Called with interrupts off.
3565 if (on == jobctl || rootshell == 0)
3569 ofd = fd = open(_PATH_TTY, O_RDWR);
3571 /* BTW, bash will try to open(ttyname(0)) if open("/dev/tty") fails.
3572 * That sometimes helps to acquire controlling tty.
3573 * Obviously, a workaround for bugs when someone
3574 * failed to provide a controlling tty to bash! :) */
3580 fd = fcntl(fd, F_DUPFD, 10);
3585 /* fd is a tty at this point */
3586 close_on_exec_on(fd);
3587 do { /* while we are in the background */
3588 pgrp = tcgetpgrp(fd);
3591 ash_msg("can't access tty; job control turned off");
3595 if (pgrp == getpgrp())
3606 xtcsetpgrp(fd, pgrp);
3608 /* turning job control off */
3611 /* was xtcsetpgrp, but this can make exiting ash
3612 * loop forever if pty is already deleted */
3613 tcsetpgrp(fd, pgrp);
3628 killcmd(int argc, char **argv)
3631 if (argv[1] && strcmp(argv[1], "-l") != 0) {
3633 if (argv[i][0] == '%') {
3634 struct job *jp = getjob(argv[i], 0);
3635 unsigned pid = jp->ps[0].pid;
3636 /* Enough space for ' -NNN<nul>' */
3637 argv[i] = alloca(sizeof(int)*3 + 3);
3638 /* kill_main has matching code to expect
3639 * leading space. Needed to not confuse
3640 * negative pids with "kill -SIGNAL_NO" syntax */
3641 sprintf(argv[i], " -%u", pid);
3643 } while (argv[++i]);
3645 return kill_main(argc, argv);
3649 showpipe(struct job *jp, FILE *out)
3651 struct procstat *sp;
3652 struct procstat *spend;
3654 spend = jp->ps + jp->nprocs;
3655 for (sp = jp->ps + 1; sp < spend; sp++)
3656 fprintf(out, " | %s", sp->cmd);
3657 outcslow('\n', out);
3658 flush_stdout_stderr();
3663 restartjob(struct job *jp, int mode)
3665 struct procstat *ps;
3671 if (jp->state == JOBDONE)
3673 jp->state = JOBRUNNING;
3675 if (mode == FORK_FG)
3676 xtcsetpgrp(ttyfd, pgid);
3677 killpg(pgid, SIGCONT);
3681 if (WIFSTOPPED(ps->status)) {
3687 status = (mode == FORK_FG) ? waitforjob(jp) : 0;
3693 fg_bgcmd(int argc ATTRIBUTE_UNUSED, char **argv)
3700 mode = (**argv == 'f') ? FORK_FG : FORK_BG;
3705 jp = getjob(*argv, 1);
3706 if (mode == FORK_BG) {
3707 set_curjob(jp, CUR_RUNNING);
3708 fprintf(out, "[%d] ", jobno(jp));
3710 outstr(jp->ps->cmd, out);
3712 retval = restartjob(jp, mode);
3713 } while (*argv && *++argv);
3719 sprint_status(char *s, int status, int sigonly)
3725 if (!WIFEXITED(status)) {
3727 if (WIFSTOPPED(status))
3728 st = WSTOPSIG(status);
3731 st = WTERMSIG(status);
3733 if (st == SIGINT || st == SIGPIPE)
3736 if (WIFSTOPPED(status))
3741 col = fmtstr(s, 32, strsignal(st));
3742 if (WCOREDUMP(status)) {
3743 col += fmtstr(s + col, 16, " (core dumped)");
3745 } else if (!sigonly) {
3746 st = WEXITSTATUS(status);
3748 col = fmtstr(s, 16, "Done(%d)", st);
3750 col = fmtstr(s, 16, "Done");
3757 * Do a wait system call. If job control is compiled in, we accept
3758 * stopped processes. If block is zero, we return a value of zero
3759 * rather than blocking.
3761 * System V doesn't have a non-blocking wait system call. It does
3762 * have a SIGCLD signal that is sent to a process when one of it's
3763 * children dies. The obvious way to use SIGCLD would be to install
3764 * a handler for SIGCLD which simply bumped a counter when a SIGCLD
3765 * was received, and have waitproc bump another counter when it got
3766 * the status of a process. Waitproc would then know that a wait
3767 * system call would not block if the two counters were different.
3768 * This approach doesn't work because if a process has children that
3769 * have not been waited for, System V will send it a SIGCLD when it
3770 * installs a signal handler for SIGCLD. What this means is that when
3771 * a child exits, the shell will be sent SIGCLD signals continuously
3772 * until is runs out of stack space, unless it does a wait call before
3773 * restoring the signal handler. The code below takes advantage of
3774 * this (mis)feature by installing a signal handler for SIGCLD and
3775 * then checking to see whether it was called. If there are any
3776 * children to be waited for, it will be.
3778 * If neither SYSV nor BSD is defined, we don't implement nonblocking
3779 * waits at all. In this case, the user will not be informed when
3780 * a background process until the next time she runs a real program
3781 * (as opposed to running a builtin command or just typing return),
3782 * and the jobs command may give out of date information.
3785 waitproc(int wait_flags, int *status)
3789 wait_flags |= WUNTRACED;
3791 /* NB: _not_ safe_waitpid, we need to detect EINTR */
3792 return waitpid(-1, status, wait_flags);
3796 * Wait for a process to terminate.
3799 dowait(int wait_flags, struct job *job)
3804 struct job *thisjob;
3807 TRACE(("dowait(%d) called\n", wait_flags));
3808 pid = waitproc(wait_flags, &status);
3809 TRACE(("wait returns pid=%d, status=%d\n", pid, status));
3811 /* If we were doing blocking wait and (probably) got EINTR,
3812 * check for pending sigs received while waiting.
3813 * (NB: can be moved into callers if needed) */
3814 if (wait_flags == DOWAIT_BLOCK && pendingsig)
3815 raise_exception(EXSIG);
3820 for (jp = curjob; jp; jp = jp->prev_job) {
3821 struct procstat *sp;
3822 struct procstat *spend;
3823 if (jp->state == JOBDONE)
3826 spend = jp->ps + jp->nprocs;
3829 if (sp->pid == pid) {
3830 TRACE(("Job %d: changing status of proc %d "
3831 "from 0x%x to 0x%x\n",
3832 jobno(jp), pid, sp->status, status));
3833 sp->status = status;
3836 if (sp->status == -1)
3839 if (state == JOBRUNNING)
3841 if (WIFSTOPPED(sp->status)) {
3842 jp->stopstatus = sp->status;
3846 } while (++sp < spend);
3851 if (!WIFSTOPPED(status))
3857 if (state != JOBRUNNING) {
3858 thisjob->changed = 1;
3860 if (thisjob->state != state) {
3861 TRACE(("Job %d: changing state from %d to %d\n",
3862 jobno(thisjob), thisjob->state, state));
3863 thisjob->state = state;
3865 if (state == JOBSTOPPED) {
3866 set_curjob(thisjob, CUR_STOPPED);
3875 if (thisjob && thisjob == job) {
3879 len = sprint_status(s, status, 1);
3891 showjob(FILE *out, struct job *jp, int mode)
3893 struct procstat *ps;
3894 struct procstat *psend;
3901 if (mode & SHOW_PGID) {
3902 /* just output process (group) id of pipeline */
3903 fprintf(out, "%d\n", ps->pid);
3907 col = fmtstr(s, 16, "[%d] ", jobno(jp));
3912 else if (curjob && jp == curjob->prev_job)
3915 if (mode & SHOW_PID)
3916 col += fmtstr(s + col, 16, "%d ", ps->pid);
3918 psend = ps + jp->nprocs;
3920 if (jp->state == JOBRUNNING) {
3921 strcpy(s + col, "Running");
3922 col += sizeof("Running") - 1;
3924 int status = psend[-1].status;
3925 if (jp->state == JOBSTOPPED)
3926 status = jp->stopstatus;
3927 col += sprint_status(s + col, status, 0);
3933 /* for each process */
3934 col = fmtstr(s, 48, " |\n%*c%d ", indent_col, ' ', ps->pid) - 3;
3936 fprintf(out, "%s%*c%s",
3937 s, 33 - col >= 0 ? 33 - col : 0, ' ', ps->cmd
3939 if (!(mode & SHOW_PID)) {
3943 if (++ps == psend) {
3944 outcslow('\n', out);
3951 if (jp->state == JOBDONE) {
3952 TRACE(("showjob: freeing job %d\n", jobno(jp)));
3958 * Print a list of jobs. If "change" is nonzero, only print jobs whose
3959 * statuses have changed since the last call to showjobs.
3962 showjobs(FILE *out, int mode)
3966 TRACE(("showjobs(%x) called\n", mode));
3968 /* If not even one job changed, there is nothing to do */
3969 while (dowait(DOWAIT_NONBLOCK, NULL) > 0)
3972 for (jp = curjob; jp; jp = jp->prev_job) {
3973 if (!(mode & SHOW_CHANGED) || jp->changed) {
3974 showjob(out, jp, mode);
3980 jobscmd(int argc ATTRIBUTE_UNUSED, char **argv)
3985 while ((m = nextopt("lp"))) {
3995 showjob(stdout, getjob(*argv,0), mode);
3998 showjobs(stdout, mode);
4005 getstatus(struct job *job)
4010 status = job->ps[job->nprocs - 1].status;
4011 retval = WEXITSTATUS(status);
4012 if (!WIFEXITED(status)) {
4014 retval = WSTOPSIG(status);
4015 if (!WIFSTOPPED(status))
4018 /* XXX: limits number of signals */
4019 retval = WTERMSIG(status);
4021 if (retval == SIGINT)
4027 TRACE(("getstatus: job %d, nproc %d, status %x, retval %x\n",
4028 jobno(job), job->nprocs, status, retval));
4033 waitcmd(int argc ATTRIBUTE_UNUSED, char **argv)
4042 raise_exception(EXSIG);
4049 /* wait for all jobs */
4053 if (!jp) /* no running procs */
4055 if (jp->state == JOBRUNNING)
4060 dowait(DOWAIT_BLOCK, NULL);
4066 if (**argv != '%') {
4067 pid_t pid = number(*argv);
4072 if (job->ps[job->nprocs - 1].pid == pid)
4074 job = job->prev_job;
4077 job = getjob(*argv, 0);
4078 /* loop until process terminated or stopped */
4079 while (job->state == JOBRUNNING)
4080 dowait(DOWAIT_BLOCK, NULL);
4082 retval = getstatus(job);
4096 struct job *jp, *jq;
4098 len = njobs * sizeof(*jp);
4100 jp = ckrealloc(jq, len + 4 * sizeof(*jp));
4102 offset = (char *)jp - (char *)jq;
4104 /* Relocate pointers */
4107 jq = (struct job *)((char *)jq + l);
4111 #define joff(p) ((struct job *)((char *)(p) + l))
4112 #define jmove(p) (p) = (void *)((char *)(p) + offset)
4113 if (joff(jp)->ps == &jq->ps0)
4114 jmove(joff(jp)->ps);
4115 if (joff(jp)->prev_job)
4116 jmove(joff(jp)->prev_job);
4126 jp = (struct job *)((char *)jp + len);
4130 } while (--jq >= jp);
4135 * Return a new job structure.
4136 * Called with interrupts off.
4139 makejob(/*union node *node,*/ int nprocs)
4144 for (i = njobs, jp = jobtab; ; jp++) {
4151 if (jp->state != JOBDONE || !jp->waited)
4160 memset(jp, 0, sizeof(*jp));
4162 /* jp->jobctl is a bitfield.
4163 * "jp->jobctl |= jobctl" likely to give awful code */
4167 jp->prev_job = curjob;
4172 jp->ps = ckmalloc(nprocs * sizeof(struct procstat));
4174 TRACE(("makejob(%d) returns %%%d\n", nprocs,
4181 * Return a string identifying a command (to be printed by the
4184 static char *cmdnextc;
4187 cmdputs(const char *s)
4189 static const char vstype[VSTYPE + 1][3] = {
4190 "", "}", "-", "+", "?", "=",
4191 "%", "%%", "#", "##"
4192 USE_ASH_BASH_COMPAT(, ":", "/", "//")
4195 const char *p, *str;
4196 char c, cc[2] = " ";
4201 nextc = makestrspace((strlen(s) + 1) * 8, cmdnextc);
4203 while ((c = *p++) != 0) {
4211 if ((subtype & VSTYPE) == VSLENGTH)
4215 if (!(subtype & VSQUOTE) == !(quoted & 1))
4221 str = "\"}" + !(quoted & 1);
4228 case CTLBACKQ+CTLQUOTE:
4231 #if ENABLE_ASH_MATH_SUPPORT
4246 if ((subtype & VSTYPE) != VSNORMAL)
4248 str = vstype[subtype & VSTYPE];
4249 if (subtype & VSNUL)
4258 /* These can only happen inside quotes */
4271 while ((c = *str++)) {
4276 USTPUTC('"', nextc);
4282 /* cmdtxt() and cmdlist() call each other */
4283 static void cmdtxt(union node *n);
4286 cmdlist(union node *np, int sep)
4288 for (; np; np = np->narg.next) {
4292 if (sep && np->narg.next)
4298 cmdtxt(union node *n)
4301 struct nodelist *lp;
4313 lp = n->npipe.cmdlist;
4331 cmdtxt(n->nbinary.ch1);
4347 cmdtxt(n->nif.test);
4350 if (n->nif.elsepart) {
4353 n = n->nif.elsepart;
4369 cmdtxt(n->nbinary.ch1);
4379 cmdputs(n->nfor.var);
4381 cmdlist(n->nfor.args, 1);
4386 cmdputs(n->narg.text);
4390 cmdlist(n->ncmd.args, 1);
4391 cmdlist(n->ncmd.redirect, 0);
4404 cmdputs(n->ncase.expr->narg.text);
4406 for (np = n->ncase.cases; np; np = np->nclist.next) {
4407 cmdtxt(np->nclist.pattern);
4409 cmdtxt(np->nclist.body);
4435 s[0] = n->nfile.fd + '0';
4439 if (n->type == NTOFD || n->type == NFROMFD) {
4440 s[0] = n->ndup.dupfd + '0';
4450 commandtext(union node *n)
4454 STARTSTACKSTR(cmdnextc);
4456 name = stackblock();
4457 TRACE(("commandtext: name %p, end %p\n\t\"%s\"\n",
4458 name, cmdnextc, cmdnextc));
4459 return ckstrdup(name);
4464 * Fork off a subshell. If we are doing job control, give the subshell its
4465 * own process group. Jp is a job structure that the job is to be added to.
4466 * N is the command that will be evaluated by the child. Both jp and n may
4467 * be NULL. The mode parameter can be one of the following:
4468 * FORK_FG - Fork off a foreground process.
4469 * FORK_BG - Fork off a background process.
4470 * FORK_NOJOB - Like FORK_FG, but don't give the process its own
4471 * process group even if job control is on.
4473 * When job control is turned off, background processes have their standard
4474 * input redirected to /dev/null (except for the second and later processes
4477 * Called with interrupts off.
4480 * Clear traps on a fork.
4487 for (tp = trap; tp < &trap[NSIG]; tp++) {
4488 if (*tp && **tp) { /* trap not NULL or "" (SIG_IGN) */
4493 setsignal(tp - trap);
4499 /* Lives far away from here, needed for forkchild */
4500 static void closescript(void);
4502 /* Called after fork(), in child */
4504 forkchild(struct job *jp, /*union node *n,*/ int mode)
4508 TRACE(("Child shell %d\n", getpid()));
4515 /* do job control only in root shell */
4517 if (mode != FORK_NOJOB && jp->jobctl && !oldlvl) {
4520 if (jp->nprocs == 0)
4523 pgrp = jp->ps[0].pid;
4524 /* This can fail because we are doing it in the parent also */
4525 (void)setpgid(0, pgrp);
4526 if (mode == FORK_FG)
4527 xtcsetpgrp(ttyfd, pgrp);
4532 if (mode == FORK_BG) {
4535 if (jp->nprocs == 0) {
4537 if (open(bb_dev_null, O_RDONLY) != 0)
4538 ash_msg_and_raise_error("can't open %s", bb_dev_null);
4541 if (!oldlvl && iflag) {
4546 for (jp = curjob; jp; jp = jp->prev_job)
4551 /* Called after fork(), in parent */
4553 #define forkparent(jp, n, mode, pid) forkparent(jp, mode, pid)
4556 forkparent(struct job *jp, union node *n, int mode, pid_t pid)
4558 TRACE(("In parent shell: child = %d\n", pid));
4560 while (jobless && dowait(DOWAIT_NONBLOCK, NULL) > 0)
4566 if (mode != FORK_NOJOB && jp->jobctl) {
4569 if (jp->nprocs == 0)
4572 pgrp = jp->ps[0].pid;
4573 /* This can fail because we are doing it in the child also */
4577 if (mode == FORK_BG) {
4578 backgndpid = pid; /* set $! */
4579 set_curjob(jp, CUR_RUNNING);
4582 struct procstat *ps = &jp->ps[jp->nprocs++];
4588 ps->cmd = commandtext(n);
4594 forkshell(struct job *jp, union node *n, int mode)
4598 TRACE(("forkshell(%%%d, %p, %d) called\n", jobno(jp), n, mode));
4601 TRACE(("Fork failed, errno=%d", errno));
4604 ash_msg_and_raise_error("cannot fork");
4607 forkchild(jp, /*n,*/ mode);
4609 forkparent(jp, n, mode, pid);
4614 * Wait for job to finish.
4616 * Under job control we have the problem that while a child process is
4617 * running interrupts generated by the user are sent to the child but not
4618 * to the shell. This means that an infinite loop started by an inter-
4619 * active user may be hard to kill. With job control turned off, an
4620 * interactive user may place an interactive program inside a loop. If
4621 * the interactive program catches interrupts, the user doesn't want
4622 * these interrupts to also abort the loop. The approach we take here
4623 * is to have the shell ignore interrupt signals while waiting for a
4624 * foreground process to terminate, and then send itself an interrupt
4625 * signal if the child process was terminated by an interrupt signal.
4626 * Unfortunately, some programs want to do a bit of cleanup and then
4627 * exit on interrupt; unless these processes terminate themselves by
4628 * sending a signal to themselves (instead of calling exit) they will
4629 * confuse this approach.
4631 * Called with interrupts off.
4634 waitforjob(struct job *jp)
4638 TRACE(("waitforjob(%%%d) called\n", jobno(jp)));
4639 while (jp->state == JOBRUNNING) {
4640 dowait(DOWAIT_BLOCK, jp);
4645 xtcsetpgrp(ttyfd, rootpid);
4647 * This is truly gross.
4648 * If we're doing job control, then we did a TIOCSPGRP which
4649 * caused us (the shell) to no longer be in the controlling
4650 * session -- so we wouldn't have seen any ^C/SIGINT. So, we
4651 * intuit from the subprocess exit status whether a SIGINT
4652 * occurred, and if so interrupt ourselves. Yuck. - mycroft
4654 if (jp->sigint) /* TODO: do the same with all signals */
4655 raise(SIGINT); /* ... by raise(jp->sig) instead? */
4657 if (jp->state == JOBDONE)
4664 * return 1 if there are stopped jobs, otherwise 0
4676 if (jp && jp->state == JOBSTOPPED) {
4677 out2str("You have stopped jobs.\n");
4686 /* ============ redir.c
4688 * Code for dealing with input/output redirection.
4691 #define EMPTY -2 /* marks an unused slot in redirtab */
4692 #define CLOSED -3 /* marks a slot of previously-closed fd */
4694 # define PIPESIZE 4096 /* amount of buffering in a pipe */
4696 # define PIPESIZE PIPE_BUF
4700 * Open a file in noclobber mode.
4701 * The code was copied from bash.
4704 noclobberopen(const char *fname)
4707 struct stat finfo, finfo2;
4710 * If the file exists and is a regular file, return an error
4713 r = stat(fname, &finfo);
4714 if (r == 0 && S_ISREG(finfo.st_mode)) {
4720 * If the file was not present (r != 0), make sure we open it
4721 * exclusively so that if it is created before we open it, our open
4722 * will fail. Make sure that we do not truncate an existing file.
4723 * Note that we don't turn on O_EXCL unless the stat failed -- if the
4724 * file was not a regular file, we leave O_EXCL off.
4727 return open(fname, O_WRONLY|O_CREAT|O_EXCL, 0666);
4728 fd = open(fname, O_WRONLY|O_CREAT, 0666);
4730 /* If the open failed, return the file descriptor right away. */
4735 * OK, the open succeeded, but the file may have been changed from a
4736 * non-regular file to a regular file between the stat and the open.
4737 * We are assuming that the O_EXCL open handles the case where FILENAME
4738 * did not exist and is symlinked to an existing file between the stat
4743 * If we can open it and fstat the file descriptor, and neither check
4744 * revealed that it was a regular file, and the file has not been
4745 * replaced, return the file descriptor.
4747 if (fstat(fd, &finfo2) == 0 && !S_ISREG(finfo2.st_mode)
4748 && finfo.st_dev == finfo2.st_dev && finfo.st_ino == finfo2.st_ino)
4751 /* The file has been replaced. badness. */
4758 * Handle here documents. Normally we fork off a process to write the
4759 * data to a pipe. If the document is short, we can stuff the data in
4760 * the pipe without forking.
4762 /* openhere needs this forward reference */
4763 static void expandhere(union node *arg, int fd);
4765 openhere(union node *redir)
4771 ash_msg_and_raise_error("pipe call failed");
4772 if (redir->type == NHERE) {
4773 len = strlen(redir->nhere.doc->narg.text);
4774 if (len <= PIPESIZE) {
4775 full_write(pip[1], redir->nhere.doc->narg.text, len);
4779 if (forkshell((struct job *)NULL, (union node *)NULL, FORK_NOJOB) == 0) {
4781 signal(SIGINT, SIG_IGN);
4782 signal(SIGQUIT, SIG_IGN);
4783 signal(SIGHUP, SIG_IGN);
4785 signal(SIGTSTP, SIG_IGN);
4787 signal(SIGPIPE, SIG_DFL);
4788 if (redir->type == NHERE)
4789 full_write(pip[1], redir->nhere.doc->narg.text, len);
4791 expandhere(redir->nhere.doc, pip[1]);
4792 _exit(EXIT_SUCCESS);
4800 openredirect(union node *redir)
4805 switch (redir->nfile.type) {
4807 fname = redir->nfile.expfname;
4808 f = open(fname, O_RDONLY);
4813 fname = redir->nfile.expfname;
4814 f = open(fname, O_RDWR|O_CREAT|O_TRUNC, 0666);
4819 /* Take care of noclobber mode. */
4821 fname = redir->nfile.expfname;
4822 f = noclobberopen(fname);
4829 fname = redir->nfile.expfname;
4830 f = open(fname, O_WRONLY|O_CREAT|O_TRUNC, 0666);
4835 fname = redir->nfile.expfname;
4836 f = open(fname, O_WRONLY|O_CREAT|O_APPEND, 0666);
4844 /* Fall through to eliminate warning. */
4851 f = openhere(redir);
4857 ash_msg_and_raise_error("cannot create %s: %s", fname, errmsg(errno, "nonexistent directory"));
4859 ash_msg_and_raise_error("cannot open %s: %s", fname, errmsg(errno, "no such file"));
4863 * Copy a file descriptor to be >= to. Returns -1
4864 * if the source file descriptor is closed, EMPTY if there are no unused
4865 * file descriptors left.
4868 copyfd(int from, int to)
4872 newfd = fcntl(from, F_DUPFD, to);
4874 if (errno == EMFILE)
4876 ash_msg_and_raise_error("%d: %m", from);
4882 dupredirect(union node *redir, int f)
4884 int fd = redir->nfile.fd;
4886 if (redir->nfile.type == NTOFD || redir->nfile.type == NFROMFD) {
4887 if (redir->ndup.dupfd >= 0) { /* if not ">&-" */
4888 copyfd(redir->ndup.dupfd, fd);
4900 * Process a list of redirection commands. If the REDIR_PUSH flag is set,
4901 * old file descriptors are stashed away so that the redirection can be
4902 * undone by calling popredir. If the REDIR_BACKQ flag is set, then the
4903 * standard output, and the standard error if it becomes a duplicate of
4904 * stdout, is saved in memory.
4906 /* flags passed to redirect */
4907 #define REDIR_PUSH 01 /* save previous values of file descriptors */
4908 #define REDIR_SAVEFD2 03 /* set preverrout */
4910 redirect(union node *redir, int flags)
4913 struct redirtab *sv;
4924 if (flags & REDIR_PUSH) {
4925 sv = ckmalloc(sizeof(*sv));
4926 sv->next = redirlist;
4928 sv->nullredirs = g_nullredirs - 1;
4929 for (i = 0; i < 10; i++)
4930 sv->renamed[i] = EMPTY;
4936 if ((n->nfile.type == NTOFD || n->nfile.type == NFROMFD)
4937 && n->ndup.dupfd == fd)
4938 continue; /* redirect from/to same file descriptor */
4940 newfd = openredirect(n);
4942 /* Descriptor wasn't open before redirect.
4943 * Mark it for close in the future */
4944 if (sv && sv->renamed[fd] == EMPTY)
4945 sv->renamed[fd] = CLOSED;
4948 if (sv && sv->renamed[fd] == EMPTY) {
4949 i = fcntl(fd, F_DUPFD, 10);
4956 ash_msg_and_raise_error("%d: %m", fd);
4960 sv->renamed[fd] = i;
4966 dupredirect(n, newfd);
4967 } while ((n = n->nfile.next));
4969 if ((flags & REDIR_SAVEFD2) && sv && sv->renamed[2] >= 0)
4970 preverrout_fd = sv->renamed[2];
4974 * Undo the effects of the last redirection.
4979 struct redirtab *rp;
4982 if (--g_nullredirs >= 0)
4986 for (i = 0; i < 10; i++) {
4987 if (rp->renamed[i] == CLOSED) {
4992 if (rp->renamed[i] != EMPTY) {
4995 copyfd(rp->renamed[i], i);
4997 close(rp->renamed[i]);
5000 redirlist = rp->next;
5001 g_nullredirs = rp->nullredirs;
5007 * Undo all redirections. Called on error or interrupt.
5011 * Discard all saved file descriptors.
5014 clearredir(int drop)
5025 redirectsafe(union node *redir, int flags)
5028 volatile int saveint;
5029 struct jmploc *volatile savehandler = exception_handler;
5030 struct jmploc jmploc;
5033 err = setjmp(jmploc.loc) * 2;
5035 exception_handler = &jmploc;
5036 redirect(redir, flags);
5038 exception_handler = savehandler;
5039 if (err && exception != EXERROR)
5040 longjmp(exception_handler->loc, 1);
5041 RESTORE_INT(saveint);
5046 /* ============ Routines to expand arguments to commands
5048 * We have to deal with backquotes, shell variables, and file metacharacters.
5054 #define EXP_FULL 0x1 /* perform word splitting & file globbing */
5055 #define EXP_TILDE 0x2 /* do normal tilde expansion */
5056 #define EXP_VARTILDE 0x4 /* expand tildes in an assignment */
5057 #define EXP_REDIR 0x8 /* file glob for a redirection (1 match only) */
5058 #define EXP_CASE 0x10 /* keeps quotes around for CASE pattern */
5059 #define EXP_RECORD 0x20 /* need to record arguments for ifs breakup */
5060 #define EXP_VARTILDE2 0x40 /* expand tildes after colons only */
5061 #define EXP_WORD 0x80 /* expand word in parameter expansion */
5062 #define EXP_QWORD 0x100 /* expand word in quoted parameter expansion */
5066 #define RMESCAPE_ALLOC 0x1 /* Allocate a new string */
5067 #define RMESCAPE_GLOB 0x2 /* Add backslashes for glob */
5068 #define RMESCAPE_QUOTED 0x4 /* Remove CTLESC unless in quotes */
5069 #define RMESCAPE_GROW 0x8 /* Grow strings instead of stalloc */
5070 #define RMESCAPE_HEAP 0x10 /* Malloc strings instead of stalloc */
5073 * Structure specifying which parts of the string should be searched
5074 * for IFS characters.
5077 struct ifsregion *next; /* next region in list */
5078 int begoff; /* offset of start of region */
5079 int endoff; /* offset of end of region */
5080 int nulonly; /* search for nul bytes only */
5084 struct strlist *list;
5085 struct strlist **lastp;
5088 /* output of current string */
5089 static char *expdest;
5090 /* list of back quote expressions */
5091 static struct nodelist *argbackq;
5092 /* first struct in list of ifs regions */
5093 static struct ifsregion ifsfirst;
5094 /* last struct in list */
5095 static struct ifsregion *ifslastp;
5096 /* holds expanded arg list */
5097 static struct arglist exparg;
5107 expdest = makestrspace(32, expdest);
5108 #if ENABLE_ASH_MATH_SUPPORT_64
5109 len = fmtstr(expdest, 32, "%lld", (long long) num);
5111 len = fmtstr(expdest, 32, "%ld", num);
5113 STADJUST(len, expdest);
5118 esclen(const char *start, const char *p)
5122 while (p > start && *--p == CTLESC) {
5129 * Remove any CTLESC characters from a string.
5132 _rmescapes(char *str, int flag)
5134 static const char qchars[] ALIGN1 = { CTLESC, CTLQUOTEMARK, '\0' };
5141 p = strpbrk(str, qchars);
5147 if (flag & RMESCAPE_ALLOC) {
5148 size_t len = p - str;
5149 size_t fulllen = len + strlen(p) + 1;
5151 if (flag & RMESCAPE_GROW) {
5152 r = makestrspace(fulllen, expdest);
5153 } else if (flag & RMESCAPE_HEAP) {
5154 r = ckmalloc(fulllen);
5156 r = stalloc(fulllen);
5160 q = (char *)memcpy(q, str, len) + len;
5163 inquotes = (flag & RMESCAPE_QUOTED) ^ RMESCAPE_QUOTED;
5164 globbing = flag & RMESCAPE_GLOB;
5165 notescaped = globbing;
5167 if (*p == CTLQUOTEMARK) {
5168 inquotes = ~inquotes;
5170 notescaped = globbing;
5174 /* naked back slash */
5180 if (notescaped && inquotes && *p != '/') {
5184 notescaped = globbing;
5189 if (flag & RMESCAPE_GROW) {
5191 STADJUST(q - r + 1, expdest);
5195 #define rmescapes(p) _rmescapes((p), 0)
5197 #define pmatch(a, b) !fnmatch((a), (b), 0)
5200 * Prepare a pattern for a expmeta (internal glob(3)) call.
5202 * Returns an stalloced string.
5205 preglob(const char *pattern, int quoted, int flag)
5207 flag |= RMESCAPE_GLOB;
5209 flag |= RMESCAPE_QUOTED;
5211 return _rmescapes((char *)pattern, flag);
5215 * Put a string on the stack.
5218 memtodest(const char *p, size_t len, int syntax, int quotes)
5222 q = makestrspace(len * 2, q);
5225 int c = signed_char2int(*p++);
5228 if (quotes && (SIT(c, syntax) == CCTL || SIT(c, syntax) == CBACK))
5237 strtodest(const char *p, int syntax, int quotes)
5239 memtodest(p, strlen(p), syntax, quotes);
5243 * Record the fact that we have to scan this region of the
5244 * string for IFS characters.
5247 recordregion(int start, int end, int nulonly)
5249 struct ifsregion *ifsp;
5251 if (ifslastp == NULL) {
5255 ifsp = ckzalloc(sizeof(*ifsp));
5256 /*ifsp->next = NULL; - ckzalloc did it */
5257 ifslastp->next = ifsp;
5261 ifslastp->begoff = start;
5262 ifslastp->endoff = end;
5263 ifslastp->nulonly = nulonly;
5267 removerecordregions(int endoff)
5269 if (ifslastp == NULL)
5272 if (ifsfirst.endoff > endoff) {
5273 while (ifsfirst.next != NULL) {
5274 struct ifsregion *ifsp;
5276 ifsp = ifsfirst.next->next;
5277 free(ifsfirst.next);
5278 ifsfirst.next = ifsp;
5281 if (ifsfirst.begoff > endoff)
5284 ifslastp = &ifsfirst;
5285 ifsfirst.endoff = endoff;
5290 ifslastp = &ifsfirst;
5291 while (ifslastp->next && ifslastp->next->begoff < endoff)
5292 ifslastp=ifslastp->next;
5293 while (ifslastp->next != NULL) {
5294 struct ifsregion *ifsp;
5296 ifsp = ifslastp->next->next;
5297 free(ifslastp->next);
5298 ifslastp->next = ifsp;
5301 if (ifslastp->endoff > endoff)
5302 ifslastp->endoff = endoff;
5306 exptilde(char *startp, char *p, int flag)
5312 int quotes = flag & (EXP_FULL | EXP_CASE);
5317 while ((c = *++p) != '\0') {
5324 if (flag & EXP_VARTILDE)
5334 if (*name == '\0') {
5335 home = lookupvar(homestr);
5337 pw = getpwnam(name);
5342 if (!home || !*home)
5345 startloc = expdest - (char *)stackblock();
5346 strtodest(home, SQSYNTAX, quotes);
5347 recordregion(startloc, expdest - (char *)stackblock(), 0);
5355 * Execute a command inside back quotes. If it's a builtin command, we
5356 * want to save its output in a block obtained from malloc. Otherwise
5357 * we fork off a subprocess and get the output of the command via a pipe.
5358 * Should be called with interrupts off.
5360 struct backcmd { /* result of evalbackcmd */
5361 int fd; /* file descriptor to read from */
5362 char *buf; /* buffer */
5363 int nleft; /* number of chars in buffer */
5364 struct job *jp; /* job structure for command */
5367 /* These forward decls are needed to use "eval" code for backticks handling: */
5368 static int back_exitstatus; /* exit status of backquoted command */
5369 #define EV_EXIT 01 /* exit after evaluating tree */
5370 static void evaltree(union node *, int);
5373 evalbackcmd(union node *n, struct backcmd *result)
5385 saveherefd = herefd;
5393 ash_msg_and_raise_error("pipe call failed");
5394 jp = makejob(/*n,*/ 1);
5395 if (forkshell(jp, n, FORK_NOJOB) == 0) {
5404 evaltree(n, EV_EXIT); /* actually evaltreenr... */
5408 result->fd = pip[0];
5411 herefd = saveherefd;
5413 TRACE(("evalbackcmd done: fd=%d buf=0x%x nleft=%d jp=0x%x\n",
5414 result->fd, result->buf, result->nleft, result->jp));
5418 * Expand stuff in backwards quotes.
5421 expbackq(union node *cmd, int quoted, int quotes)
5429 int syntax = quoted ? DQSYNTAX : BASESYNTAX;
5430 struct stackmark smark;
5433 setstackmark(&smark);
5435 startloc = dest - (char *)stackblock();
5437 evalbackcmd(cmd, &in);
5438 popstackmark(&smark);
5445 memtodest(p, i, syntax, quotes);
5449 i = nonblock_safe_read(in.fd, buf, sizeof(buf));
5450 TRACE(("expbackq: read returns %d\n", i));
5459 back_exitstatus = waitforjob(in.jp);
5463 /* Eat all trailing newlines */
5465 for (; dest > (char *)stackblock() && dest[-1] == '\n';)
5470 recordregion(startloc, dest - (char *)stackblock(), 0);
5471 TRACE(("evalbackq: size=%d: \"%.*s\"\n",
5472 (dest - (char *)stackblock()) - startloc,
5473 (dest - (char *)stackblock()) - startloc,
5474 stackblock() + startloc));
5477 #if ENABLE_ASH_MATH_SUPPORT
5479 * Expand arithmetic expression. Backup to start of expression,
5480 * evaluate, place result in (backed up) result, adjust string position.
5493 * This routine is slightly over-complicated for
5494 * efficiency. Next we scan backwards looking for the
5495 * start of arithmetic.
5497 start = stackblock();
5504 while (*p != CTLARI) {
5508 ash_msg_and_raise_error("missing CTLARI (shouldn't happen)");
5513 esc = esclen(start, p);
5523 removerecordregions(begoff);
5532 len = cvtnum(dash_arith(p + 2));
5535 recordregion(begoff, begoff + len, 0);
5539 /* argstr needs it */
5540 static char *evalvar(char *p, int flag, struct strlist *var_str_list);
5543 * Perform variable and command substitution. If EXP_FULL is set, output CTLESC
5544 * characters to allow for further processing. Otherwise treat
5545 * $@ like $* since no splitting will be performed.
5547 * var_str_list (can be NULL) is a list of "VAR=val" strings which take precedence
5548 * over shell varables. Needed for "A=a B=$A; echo $B" case - we use it
5549 * for correct expansion of "B=$A" word.
5552 argstr(char *p, int flag, struct strlist *var_str_list)
5554 static const char spclchars[] ALIGN1 = {
5562 CTLBACKQ | CTLQUOTE,
5563 #if ENABLE_ASH_MATH_SUPPORT
5568 const char *reject = spclchars;
5570 int quotes = flag & (EXP_FULL | EXP_CASE); /* do CTLESC */
5571 int breakall = flag & EXP_WORD;
5576 if (!(flag & EXP_VARTILDE)) {
5578 } else if (flag & EXP_VARTILDE2) {
5583 if (flag & EXP_TILDE) {
5589 if (*q == CTLESC && (flag & EXP_QWORD))
5592 p = exptilde(p, q, flag);
5595 startloc = expdest - (char *)stackblock();
5597 length += strcspn(p + length, reject);
5599 if (c && (!(c & 0x80)
5600 #if ENABLE_ASH_MATH_SUPPORT
5604 /* c == '=' || c == ':' || c == CTLENDARI */
5609 expdest = stack_nputstr(p, length, expdest);
5610 newloc = expdest - (char *)stackblock();
5611 if (breakall && !inquotes && newloc > startloc) {
5612 recordregion(startloc, newloc, 0);
5623 if (flag & EXP_VARTILDE2) {
5627 flag |= EXP_VARTILDE2;
5632 * sort of a hack - expand tildes in variable
5633 * assignments (after the first '=' and after ':'s).
5642 case CTLENDVAR: /* ??? */
5645 /* "$@" syntax adherence hack */
5648 !memcmp(p, dolatstr, 4) &&
5649 (p[4] == CTLQUOTEMARK || (
5650 p[4] == CTLENDVAR &&
5651 p[5] == CTLQUOTEMARK
5654 p = evalvar(p + 1, flag, /* var_str_list: */ NULL) + 1;
5657 inquotes = !inquotes;
5670 p = evalvar(p, flag, var_str_list);
5674 case CTLBACKQ|CTLQUOTE:
5675 expbackq(argbackq->n, c, quotes);
5676 argbackq = argbackq->next;
5678 #if ENABLE_ASH_MATH_SUPPORT
5691 scanleft(char *startp, char *rmesc, char *rmescend ATTRIBUTE_UNUSED, char *str, int quotes,
5694 // This commented out code was added by James Simmons <jsimmons@infradead.org>
5695 // as part of a larger change when he added support for ${var/a/b}.
5696 // However, it broke # and % operators:
5700 //echo ${var#ab} abcdcd abcdcd
5701 //echo ${var##ab} abcdcd abcdcd
5702 //echo ${var#a*b} abcdcd ababcdcd (!)
5703 //echo ${var##a*b} cdcd cdcd
5704 //echo ${var#?} babcdcd ababcdcd (!)
5705 //echo ${var##?} babcdcd babcdcd
5706 //echo ${var#*} ababcdcd babcdcd (!)
5708 //echo ${var%cd} ababcd ababcd
5709 //echo ${var%%cd} ababcd abab (!)
5710 //echo ${var%c*d} ababcd ababcd
5711 //echo ${var%%c*d} abab ababcdcd (!)
5712 //echo ${var%?} ababcdc ababcdc
5713 //echo ${var%%?} ababcdc ababcdcd (!)
5714 //echo ${var%*} ababcdcd ababcdcd
5717 // Commenting it back out helped. Remove it completely if it really
5720 char *loc, *loc2; //, *full;
5726 int match; // = strlen(str);
5727 const char *s = loc2;
5734 match = pmatch(str, s); // this line was deleted
5736 // // chop off end if its '*'
5737 // full = strrchr(str, '*');
5738 // if (full && full != str)
5741 // // If str starts with '*' replace with s.
5742 // if ((*str == '*') && strlen(s) >= match) {
5743 // full = xstrdup(s);
5744 // strncpy(full+strlen(s)-match+1, str+1, match-1);
5746 // full = xstrndup(str, match);
5747 // match = strncmp(s, full, strlen(full));
5751 if (match) // if (!match)
5753 if (quotes && *loc == CTLESC)
5762 scanright(char *startp, char *rmesc, char *rmescend, char *str, int quotes,
5769 for (loc = str - 1, loc2 = rmescend; loc >= startp; loc2--) {
5772 const char *s = loc2;
5777 match = pmatch(str, s);
5784 esc = esclen(startp, loc);
5795 static void varunset(const char *, const char *, const char *, int) ATTRIBUTE_NORETURN;
5797 varunset(const char *end, const char *var, const char *umsg, int varflags)
5803 msg = "parameter not set";
5805 if (*end == CTLENDVAR) {
5806 if (varflags & VSNUL)
5811 ash_msg_and_raise_error("%.*s: %s%s", end - var - 1, var, msg, tail);
5814 #if ENABLE_ASH_BASH_COMPAT
5816 parse_sub_pattern(char *arg, int inquotes)
5818 char *idx, *repl = NULL;
5827 /* Only the first '/' seen is our separator */
5834 if (!inquotes && c == '\\' && arg[1] == '\\')
5835 arg++; /* skip both \\, not just first one */
5842 #endif /* ENABLE_ASH_BASH_COMPAT */
5845 subevalvar(char *p, char *str, int strloc, int subtype,
5846 int startloc, int varflags, int quotes, struct strlist *var_str_list)
5848 struct nodelist *saveargbackq = argbackq;
5851 char *rmesc, *rmescend;
5852 USE_ASH_BASH_COMPAT(char *repl = NULL;)
5853 USE_ASH_BASH_COMPAT(char null = '\0';)
5854 USE_ASH_BASH_COMPAT(int pos, len, orig_len;)
5855 int saveherefd = herefd;
5856 int amount, workloc, resetloc;
5858 char *(*scan)(char*, char*, char*, char*, int, int);
5861 argstr(p, (subtype != VSASSIGN && subtype != VSQUESTION) ? EXP_CASE : 0,
5863 STPUTC('\0', expdest);
5864 herefd = saveherefd;
5865 argbackq = saveargbackq;
5866 startp = (char *)stackblock() + startloc;
5870 setvar(str, startp, 0);
5871 amount = startp - expdest;
5872 STADJUST(amount, expdest);
5875 #if ENABLE_ASH_BASH_COMPAT
5877 loc = str = stackblock() + strloc;
5878 // TODO: number() instead? It does error checking...
5880 len = str - startp - 1;
5882 /* *loc != '\0', guaranteed by parser */
5886 /* We must adjust the length by the number of escapes we find. */
5887 for (ptr = startp; ptr < (str - 1); ptr++) {
5888 if(*ptr == CTLESC) {
5896 if (*loc++ == ':') {
5897 // TODO: number() instead? It does error checking...
5901 while (*loc && *loc != ':')
5904 // TODO: number() instead? It does error checking...
5907 if (pos >= orig_len) {
5911 if (len > (orig_len - pos))
5912 len = orig_len - pos;
5914 for (str = startp; pos; str++, pos--) {
5915 if (quotes && *str == CTLESC)
5918 for (loc = startp; len; len--) {
5919 if (quotes && *str == CTLESC)
5924 amount = loc - expdest;
5925 STADJUST(amount, expdest);
5930 varunset(p, str, startp, varflags);
5933 resetloc = expdest - (char *)stackblock();
5935 /* We'll comeback here if we grow the stack while handling
5936 * a VSREPLACE or VSREPLACEALL, since our pointers into the
5937 * stack will need rebasing, and we'll need to remove our work
5940 USE_ASH_BASH_COMPAT(restart:)
5942 amount = expdest - ((char *)stackblock() + resetloc);
5943 STADJUST(-amount, expdest);
5944 startp = (char *)stackblock() + startloc;
5947 rmescend = (char *)stackblock() + strloc;
5949 rmesc = _rmescapes(startp, RMESCAPE_ALLOC | RMESCAPE_GROW);
5950 if (rmesc != startp) {
5952 startp = (char *)stackblock() + startloc;
5956 str = (char *)stackblock() + strloc;
5957 preglob(str, varflags & VSQUOTE, 0);
5958 workloc = expdest - (char *)stackblock();
5960 #if ENABLE_ASH_BASH_COMPAT
5961 if (subtype == VSREPLACE || subtype == VSREPLACEALL) {
5962 char *idx, *end, *restart_detect;
5965 repl = parse_sub_pattern(str, varflags & VSQUOTE);
5970 /* If there's no pattern to match, return the expansion unmolested */
5978 loc = scanright(idx, rmesc, rmescend, str, quotes, 1);
5980 /* No match, advance */
5981 restart_detect = stackblock();
5982 STPUTC(*idx, expdest);
5983 if (quotes && *idx == CTLESC) {
5986 STPUTC(*idx, expdest);
5988 if (stackblock() != restart_detect)
5996 if (subtype == VSREPLACEALL) {
5998 if (quotes && *idx == CTLESC)
6006 for (loc = repl; *loc; loc++) {
6007 restart_detect = stackblock();
6008 STPUTC(*loc, expdest);
6009 if (stackblock() != restart_detect)
6014 if (subtype == VSREPLACE) {
6016 restart_detect = stackblock();
6017 STPUTC(*idx, expdest);
6018 if (stackblock() != restart_detect)
6027 /* We've put the replaced text into a buffer at workloc, now
6028 * move it to the right place and adjust the stack.
6030 startp = stackblock() + startloc;
6031 STPUTC('\0', expdest);
6032 memmove(startp, stackblock() + workloc, len);
6033 startp[len++] = '\0';
6034 amount = expdest - ((char *)stackblock() + startloc + len - 1);
6035 STADJUST(-amount, expdest);
6038 #endif /* ENABLE_ASH_BASH_COMPAT */
6040 subtype -= VSTRIMRIGHT;
6042 if (subtype < 0 || subtype > 7)
6045 /* zero = subtype == VSTRIMLEFT || subtype == VSTRIMLEFTMAX */
6046 zero = subtype >> 1;
6047 /* VSTRIMLEFT/VSTRIMRIGHTMAX -> scanleft */
6048 scan = (subtype & 1) ^ zero ? scanleft : scanright;
6050 loc = scan(startp, rmesc, rmescend, str, quotes, zero);
6053 memmove(startp, loc, str - loc);
6054 loc = startp + (str - loc) - 1;
6057 amount = loc - expdest;
6058 STADJUST(amount, expdest);
6064 * Add the value of a specialized variable to the stack string.
6067 varvalue(char *name, int varflags, int flags, struct strlist *var_str_list)
6077 int quoted = varflags & VSQUOTE;
6078 int subtype = varflags & VSTYPE;
6079 int quotes = flags & (EXP_FULL | EXP_CASE);
6081 if (quoted && (flags & EXP_FULL))
6082 sep = 1 << CHAR_BIT;
6084 syntax = quoted ? DQSYNTAX : BASESYNTAX;
6093 num = shellparam.nparam;
6103 p = makestrspace(NOPTS, expdest);
6104 for (i = NOPTS - 1; i >= 0; i--) {
6106 USTPUTC(optletters(i), p);
6117 sep = ifsset() ? signed_char2int(ifsval()[0]) : ' ';
6118 if (quotes && (SIT(sep, syntax) == CCTL || SIT(sep, syntax) == CBACK))
6124 while ((p = *ap++)) {
6127 partlen = strlen(p);
6130 if (!(subtype == VSPLUS || subtype == VSLENGTH))
6131 memtodest(p, partlen, syntax, quotes);
6137 if (subtype == VSPLUS || subtype == VSLENGTH) {
6158 // TODO: number() instead? It does error checking...
6160 if (num < 0 || num > shellparam.nparam)
6162 p = num ? shellparam.p[num - 1] : arg0;
6165 /* NB: name has form "VAR=..." */
6167 /* "A=a B=$A" case: var_str_list is a list of "A=a" strings
6168 * which should be considered before we check variables. */
6170 unsigned name_len = (strchrnul(name, '=') - name) + 1;
6174 str = var_str_list->text;
6175 eq = strchr(str, '=');
6176 if (!eq) /* stop at first non-assignment */
6179 if (name_len == (unsigned)(eq - str)
6180 && strncmp(str, name, name_len) == 0) {
6182 /* goto value; - WRONG! */
6183 /* think "A=1 A=2 B=$A" */
6185 var_str_list = var_str_list->next;
6186 } while (var_str_list);
6190 p = lookupvar(name);
6196 if (!(subtype == VSPLUS || subtype == VSLENGTH))
6197 memtodest(p, len, syntax, quotes);
6201 if (subtype == VSPLUS || subtype == VSLENGTH)
6202 STADJUST(-len, expdest);
6207 * Expand a variable, and return a pointer to the next character in the
6211 evalvar(char *p, int flag, struct strlist *var_str_list)
6223 subtype = varflags & VSTYPE;
6224 quoted = varflags & VSQUOTE;
6226 easy = (!quoted || (*var == '@' && shellparam.nparam));
6227 startloc = expdest - (char *)stackblock();
6228 p = strchr(p, '=') + 1;
6231 varlen = varvalue(var, varflags, flag, var_str_list);
6232 if (varflags & VSNUL)
6235 if (subtype == VSPLUS) {
6236 varlen = -1 - varlen;
6240 if (subtype == VSMINUS) {
6244 p, flag | EXP_TILDE |
6245 (quoted ? EXP_QWORD : EXP_WORD),
6255 if (subtype == VSASSIGN || subtype == VSQUESTION) {
6257 if (subevalvar(p, var, /* strloc: */ 0,
6258 subtype, startloc, varflags,
6264 * Remove any recorded regions beyond
6267 removerecordregions(startloc);
6277 if (varlen < 0 && uflag)
6278 varunset(p, var, 0, 0);
6280 if (subtype == VSLENGTH) {
6281 cvtnum(varlen > 0 ? varlen : 0);
6285 if (subtype == VSNORMAL) {
6296 case VSTRIMRIGHTMAX:
6297 #if ENABLE_ASH_BASH_COMPAT
6310 * Terminate the string and start recording the pattern
6313 STPUTC('\0', expdest);
6314 patloc = expdest - (char *)stackblock();
6315 if (0 == subevalvar(p, /* str: */ NULL, patloc, subtype,
6317 /* quotes: */ flag & (EXP_FULL | EXP_CASE),
6320 int amount = expdest - (
6321 (char *)stackblock() + patloc - 1
6323 STADJUST(-amount, expdest);
6325 /* Remove any recorded regions beyond start of variable */
6326 removerecordregions(startloc);
6328 recordregion(startloc, expdest - (char *)stackblock(), quoted);
6332 if (subtype != VSNORMAL) { /* skip to end of alternative */
6338 else if (c == CTLBACKQ || c == (CTLBACKQ|CTLQUOTE)) {
6340 argbackq = argbackq->next;
6341 } else if (c == CTLVAR) {
6342 if ((*p++ & VSTYPE) != VSNORMAL)
6344 } else if (c == CTLENDVAR) {
6354 * Break the argument string into pieces based upon IFS and add the
6355 * strings to the argument list. The regions of the string to be
6356 * searched for IFS characters have been stored by recordregion.
6359 ifsbreakup(char *string, struct arglist *arglist)
6361 struct ifsregion *ifsp;
6366 const char *ifs, *realifs;
6371 if (ifslastp != NULL) {
6374 realifs = ifsset() ? ifsval() : defifs;
6377 p = string + ifsp->begoff;
6378 nulonly = ifsp->nulonly;
6379 ifs = nulonly ? nullstr : realifs;
6381 while (p < string + ifsp->endoff) {
6385 if (!strchr(ifs, *p)) {
6390 ifsspc = (strchr(defifs, *p) != NULL);
6391 /* Ignore IFS whitespace at start */
6392 if (q == start && ifsspc) {
6398 sp = stzalloc(sizeof(*sp));
6400 *arglist->lastp = sp;
6401 arglist->lastp = &sp->next;
6405 if (p >= string + ifsp->endoff) {
6411 if (strchr(ifs, *p) == NULL ) {
6415 if (strchr(defifs, *p) == NULL) {
6430 } while (ifsp != NULL);
6439 sp = stzalloc(sizeof(*sp));
6441 *arglist->lastp = sp;
6442 arglist->lastp = &sp->next;
6448 struct ifsregion *p;
6453 struct ifsregion *ifsp;
6459 ifsfirst.next = NULL;
6464 * Add a file name to the list.
6467 addfname(const char *name)
6471 sp = stzalloc(sizeof(*sp));
6472 sp->text = ststrdup(name);
6474 exparg.lastp = &sp->next;
6477 static char *expdir;
6480 * Do metacharacter (i.e. *, ?, [...]) expansion.
6483 expmeta(char *enddir, char *name)
6498 for (p = name; *p; p++) {
6499 if (*p == '*' || *p == '?')
6501 else if (*p == '[') {
6508 if (*q == '/' || *q == '\0')
6515 } else if (*p == '\\')
6517 else if (*p == '/') {
6524 if (metaflag == 0) { /* we've reached the end of the file name */
6525 if (enddir != expdir)
6533 if (metaflag == 0 || lstat(expdir, &statb) >= 0)
6544 } while (p < start);
6546 if (enddir == expdir) {
6548 } else if (enddir == expdir + 1 && *expdir == '/') {
6557 if (enddir != expdir)
6559 if (*endname == 0) {
6571 while (!intpending && (dp = readdir(dirp)) != NULL) {
6572 if (dp->d_name[0] == '.' && ! matchdot)
6574 if (pmatch(start, dp->d_name)) {
6576 strcpy(enddir, dp->d_name);
6579 for (p = enddir, cp = dp->d_name; (*p++ = *cp++) != '\0';)
6582 expmeta(p, endname);
6591 static struct strlist *
6592 msort(struct strlist *list, int len)
6594 struct strlist *p, *q = NULL;
6595 struct strlist **lpp;
6603 for (n = half; --n >= 0; ) {
6607 q->next = NULL; /* terminate first half of list */
6608 q = msort(list, half); /* sort first half of list */
6609 p = msort(p, len - half); /* sort second half */
6612 #if ENABLE_LOCALE_SUPPORT
6613 if (strcoll(p->text, q->text) < 0)
6615 if (strcmp(p->text, q->text) < 0)
6639 * Sort the results of file name expansion. It calculates the number of
6640 * strings to sort and then calls msort (short for merge sort) to do the
6643 static struct strlist *
6644 expsort(struct strlist *str)
6650 for (sp = str; sp; sp = sp->next)
6652 return msort(str, len);
6656 expandmeta(struct strlist *str /*, int flag*/)
6658 static const char metachars[] ALIGN1 = {
6661 /* TODO - EXP_REDIR */
6664 struct strlist **savelastp;
6670 if (!strpbrk(str->text, metachars))
6672 savelastp = exparg.lastp;
6675 p = preglob(str->text, 0, RMESCAPE_ALLOC | RMESCAPE_HEAP);
6677 int i = strlen(str->text);
6678 expdir = ckmalloc(i < 2048 ? 2048 : i); /* XXX */
6686 if (exparg.lastp == savelastp) {
6691 *exparg.lastp = str;
6692 rmescapes(str->text);
6693 exparg.lastp = &str->next;
6695 *exparg.lastp = NULL;
6696 *savelastp = sp = expsort(*savelastp);
6697 while (sp->next != NULL)
6699 exparg.lastp = &sp->next;
6706 * Perform variable substitution and command substitution on an argument,
6707 * placing the resulting list of arguments in arglist. If EXP_FULL is true,
6708 * perform splitting and file name expansion. When arglist is NULL, perform
6709 * here document expansion.
6712 expandarg(union node *arg, struct arglist *arglist, int flag)
6717 argbackq = arg->narg.backquote;
6718 STARTSTACKSTR(expdest);
6719 ifsfirst.next = NULL;
6721 argstr(arg->narg.text, flag,
6722 /* var_str_list: */ arglist ? arglist->list : NULL);
6723 p = _STPUTC('\0', expdest);
6725 if (arglist == NULL) {
6726 return; /* here document expanded */
6728 p = grabstackstr(p);
6729 exparg.lastp = &exparg.list;
6733 if (flag & EXP_FULL) {
6734 ifsbreakup(p, &exparg);
6735 *exparg.lastp = NULL;
6736 exparg.lastp = &exparg.list;
6737 expandmeta(exparg.list /*, flag*/);
6739 if (flag & EXP_REDIR) /*XXX - for now, just remove escapes */
6741 sp = stzalloc(sizeof(*sp));
6744 exparg.lastp = &sp->next;
6748 *exparg.lastp = NULL;
6750 *arglist->lastp = exparg.list;
6751 arglist->lastp = exparg.lastp;
6756 * Expand shell variables and backquotes inside a here document.
6759 expandhere(union node *arg, int fd)
6762 expandarg(arg, (struct arglist *)NULL, 0);
6763 full_write(fd, stackblock(), expdest - (char *)stackblock());
6767 * Returns true if the pattern matches the string.
6770 patmatch(char *pattern, const char *string)
6772 return pmatch(preglob(pattern, 0, 0), string);
6776 * See if a pattern matches in a case statement.
6779 casematch(union node *pattern, char *val)
6781 struct stackmark smark;
6784 setstackmark(&smark);
6785 argbackq = pattern->narg.backquote;
6786 STARTSTACKSTR(expdest);
6788 argstr(pattern->narg.text, EXP_TILDE | EXP_CASE,
6789 /* var_str_list: */ NULL);
6790 STACKSTRNUL(expdest);
6791 result = patmatch(stackblock(), val);
6792 popstackmark(&smark);
6797 /* ============ find_command */
6801 int (*builtin)(int, char **);
6802 /* unsigned flags; */
6804 #define IS_BUILTIN_SPECIAL(b) ((b)->name[0] & 1)
6805 /* "regular" builtins always take precedence over commands,
6806 * regardless of PATH=....%builtin... position */
6807 #define IS_BUILTIN_REGULAR(b) ((b)->name[0] & 2)
6808 #define IS_BUILTIN_ASSIGN(b) ((b)->name[0] & 4)
6811 smallint cmdtype; /* CMDxxx */
6814 /* index >= 0 for commands without path (slashes) */
6815 /* (TODO: what exactly does the value mean? PATH position?) */
6816 /* index == -1 for commands with slashes */
6817 /* index == (-2 - applet_no) for NOFORK applets */
6818 const struct builtincmd *cmd;
6819 struct funcnode *func;
6822 /* values of cmdtype */
6823 #define CMDUNKNOWN -1 /* no entry in table for command */
6824 #define CMDNORMAL 0 /* command is an executable program */
6825 #define CMDFUNCTION 1 /* command is a shell function */
6826 #define CMDBUILTIN 2 /* command is a shell builtin */
6828 /* action to find_command() */
6829 #define DO_ERR 0x01 /* prints errors */
6830 #define DO_ABS 0x02 /* checks absolute paths */
6831 #define DO_NOFUNC 0x04 /* don't return shell functions, for command */
6832 #define DO_ALTPATH 0x08 /* using alternate path */
6833 #define DO_ALTBLTIN 0x20 /* %builtin in alt. path */
6835 static void find_command(char *, struct cmdentry *, int, const char *);
6838 /* ============ Hashing commands */
6841 * When commands are first encountered, they are entered in a hash table.
6842 * This ensures that a full path search will not have to be done for them
6843 * on each invocation.
6845 * We should investigate converting to a linear search, even though that
6846 * would make the command name "hash" a misnomer.
6849 #define ARB 1 /* actual size determined at run time */
6852 struct tblentry *next; /* next entry in hash chain */
6853 union param param; /* definition of builtin function */
6854 smallint cmdtype; /* CMDxxx */
6855 char rehash; /* if set, cd done since entry created */
6856 char cmdname[ARB]; /* name of command */
6859 static struct tblentry **cmdtable;
6860 #define INIT_G_cmdtable() do { \
6861 cmdtable = xzalloc(CMDTABLESIZE * sizeof(cmdtable[0])); \
6864 static int builtinloc = -1; /* index in path of %builtin, or -1 */
6868 tryexec(USE_FEATURE_SH_STANDALONE(int applet_no,) char *cmd, char **argv, char **envp)
6872 #if ENABLE_FEATURE_SH_STANDALONE
6873 if (applet_no >= 0) {
6874 if (APPLET_IS_NOEXEC(applet_no))
6875 run_applet_no_and_exit(applet_no, argv);
6876 /* re-exec ourselves with the new arguments */
6877 execve(bb_busybox_exec_path, argv, envp);
6878 /* If they called chroot or otherwise made the binary no longer
6879 * executable, fall through */
6886 execve(cmd, argv, envp);
6887 } while (errno == EINTR);
6889 execve(cmd, argv, envp);
6893 } else if (errno == ENOEXEC) {
6897 for (ap = argv; *ap; ap++)
6899 ap = new = ckmalloc((ap - argv + 2) * sizeof(char *));
6901 ap[0] = cmd = (char *)DEFAULT_SHELL;
6904 while ((*ap++ = *argv++))
6912 * Exec a program. Never returns. If you change this routine, you may
6913 * have to change the find_command routine as well.
6915 static void shellexec(char **, const char *, int) ATTRIBUTE_NORETURN;
6917 shellexec(char **argv, const char *path, int idx)
6923 #if ENABLE_FEATURE_SH_STANDALONE
6928 envp = listvars(VEXPORT, VUNSET, 0);
6929 if (strchr(argv[0], '/') != NULL
6930 #if ENABLE_FEATURE_SH_STANDALONE
6931 || (applet_no = find_applet_by_name(argv[0])) >= 0
6934 tryexec(USE_FEATURE_SH_STANDALONE(applet_no,) argv[0], argv, envp);
6938 while ((cmdname = padvance(&path, argv[0])) != NULL) {
6939 if (--idx < 0 && pathopt == NULL) {
6940 tryexec(USE_FEATURE_SH_STANDALONE(-1,) cmdname, argv, envp);
6941 if (errno != ENOENT && errno != ENOTDIR)
6948 /* Map to POSIX errors */
6960 exitstatus = exerrno;
6961 TRACE(("shellexec failed for %s, errno %d, suppressint %d\n",
6962 argv[0], e, suppressint ));
6963 ash_msg_and_raise(EXEXEC, "%s: %s", argv[0], errmsg(e, "not found"));
6968 printentry(struct tblentry *cmdp)
6974 idx = cmdp->param.index;
6977 name = padvance(&path, cmdp->cmdname);
6979 } while (--idx >= 0);
6980 out1fmt("%s%s\n", name, (cmdp->rehash ? "*" : nullstr));
6984 * Clear out command entries. The argument specifies the first entry in
6985 * PATH which has changed.
6988 clearcmdentry(int firstchange)
6990 struct tblentry **tblp;
6991 struct tblentry **pp;
6992 struct tblentry *cmdp;
6995 for (tblp = cmdtable; tblp < &cmdtable[CMDTABLESIZE]; tblp++) {
6997 while ((cmdp = *pp) != NULL) {
6998 if ((cmdp->cmdtype == CMDNORMAL &&
6999 cmdp->param.index >= firstchange)
7000 || (cmdp->cmdtype == CMDBUILTIN &&
7001 builtinloc >= firstchange)
7014 * Locate a command in the command hash table. If "add" is nonzero,
7015 * add the command to the table if it is not already present. The
7016 * variable "lastcmdentry" is set to point to the address of the link
7017 * pointing to the entry, so that delete_cmd_entry can delete the
7020 * Interrupts must be off if called with add != 0.
7022 static struct tblentry **lastcmdentry;
7024 static struct tblentry *
7025 cmdlookup(const char *name, int add)
7027 unsigned int hashval;
7029 struct tblentry *cmdp;
7030 struct tblentry **pp;
7033 hashval = (unsigned char)*p << 4;
7035 hashval += (unsigned char)*p++;
7037 pp = &cmdtable[hashval % CMDTABLESIZE];
7038 for (cmdp = *pp; cmdp; cmdp = cmdp->next) {
7039 if (strcmp(cmdp->cmdname, name) == 0)
7043 if (add && cmdp == NULL) {
7044 cmdp = *pp = ckzalloc(sizeof(struct tblentry) - ARB
7045 + strlen(name) + 1);
7046 /*cmdp->next = NULL; - ckzalloc did it */
7047 cmdp->cmdtype = CMDUNKNOWN;
7048 strcpy(cmdp->cmdname, name);
7055 * Delete the command entry returned on the last lookup.
7058 delete_cmd_entry(void)
7060 struct tblentry *cmdp;
7063 cmdp = *lastcmdentry;
7064 *lastcmdentry = cmdp->next;
7065 if (cmdp->cmdtype == CMDFUNCTION)
7066 freefunc(cmdp->param.func);
7072 * Add a new command entry, replacing any existing command entry for
7073 * the same name - except special builtins.
7076 addcmdentry(char *name, struct cmdentry *entry)
7078 struct tblentry *cmdp;
7080 cmdp = cmdlookup(name, 1);
7081 if (cmdp->cmdtype == CMDFUNCTION) {
7082 freefunc(cmdp->param.func);
7084 cmdp->cmdtype = entry->cmdtype;
7085 cmdp->param = entry->u;
7090 hashcmd(int argc ATTRIBUTE_UNUSED, char **argv ATTRIBUTE_UNUSED)
7092 struct tblentry **pp;
7093 struct tblentry *cmdp;
7095 struct cmdentry entry;
7098 if (nextopt("r") != '\0') {
7103 if (*argptr == NULL) {
7104 for (pp = cmdtable; pp < &cmdtable[CMDTABLESIZE]; pp++) {
7105 for (cmdp = *pp; cmdp; cmdp = cmdp->next) {
7106 if (cmdp->cmdtype == CMDNORMAL)
7114 while ((name = *argptr) != NULL) {
7115 cmdp = cmdlookup(name, 0);
7117 && (cmdp->cmdtype == CMDNORMAL
7118 || (cmdp->cmdtype == CMDBUILTIN && builtinloc >= 0))
7122 find_command(name, &entry, DO_ERR, pathval());
7123 if (entry.cmdtype == CMDUNKNOWN)
7131 * Called when a cd is done. Marks all commands so the next time they
7132 * are executed they will be rehashed.
7137 struct tblentry **pp;
7138 struct tblentry *cmdp;
7140 for (pp = cmdtable; pp < &cmdtable[CMDTABLESIZE]; pp++) {
7141 for (cmdp = *pp; cmdp; cmdp = cmdp->next) {
7142 if (cmdp->cmdtype == CMDNORMAL
7143 || (cmdp->cmdtype == CMDBUILTIN
7144 && !IS_BUILTIN_REGULAR(cmdp->param.cmd)
7154 * Fix command hash table when PATH changed.
7155 * Called before PATH is changed. The argument is the new value of PATH;
7156 * pathval() still returns the old value at this point.
7157 * Called with interrupts off.
7160 changepath(const char *new)
7168 firstchange = 9999; /* assume no change */
7174 if ((*old == '\0' && *new == ':')
7175 || (*old == ':' && *new == '\0'))
7177 old = new; /* ignore subsequent differences */
7181 if (*new == '%' && idx_bltin < 0 && prefix(new + 1, "builtin"))
7187 if (builtinloc < 0 && idx_bltin >= 0)
7188 builtinloc = idx_bltin; /* zap builtins */
7189 if (builtinloc >= 0 && idx_bltin < 0)
7191 clearcmdentry(firstchange);
7192 builtinloc = idx_bltin;
7207 #define TENDBQUOTE 12
7225 /* first char is indicating which tokens mark the end of a list */
7226 static const char *const tokname_array[] = {
7240 #define KWDOFFSET 13
7241 /* the following are keywords */
7263 static char buf[16];
7266 //if (tok < TSEMI) return tokname_array[tok] + 1;
7267 //sprintf(buf, "\"%s\"", tokname_array[tok] + 1);
7272 sprintf(buf + (tok >= TSEMI), "%s%c",
7273 tokname_array[tok] + 1, (tok >= TSEMI ? '"' : 0));
7277 /* Wrapper around strcmp for qsort/bsearch/... */
7279 pstrcmp(const void *a, const void *b)
7281 return strcmp((char*) a, (*(char**) b) + 1);
7284 static const char *const *
7285 findkwd(const char *s)
7287 return bsearch(s, tokname_array + KWDOFFSET,
7288 ARRAY_SIZE(tokname_array) - KWDOFFSET,
7289 sizeof(tokname_array[0]), pstrcmp);
7293 * Locate and print what a word is...
7296 describe_command(char *command, int describe_command_verbose)
7298 struct cmdentry entry;
7299 struct tblentry *cmdp;
7300 #if ENABLE_ASH_ALIAS
7301 const struct alias *ap;
7303 const char *path = pathval();
7305 if (describe_command_verbose) {
7309 /* First look at the keywords */
7310 if (findkwd(command)) {
7311 out1str(describe_command_verbose ? " is a shell keyword" : command);
7315 #if ENABLE_ASH_ALIAS
7316 /* Then look at the aliases */
7317 ap = lookupalias(command, 0);
7319 if (!describe_command_verbose) {
7324 out1fmt(" is an alias for %s", ap->val);
7328 /* Then check if it is a tracked alias */
7329 cmdp = cmdlookup(command, 0);
7331 entry.cmdtype = cmdp->cmdtype;
7332 entry.u = cmdp->param;
7334 /* Finally use brute force */
7335 find_command(command, &entry, DO_ABS, path);
7338 switch (entry.cmdtype) {
7340 int j = entry.u.index;
7346 p = padvance(&path, command);
7350 if (describe_command_verbose) {
7352 (cmdp ? " a tracked alias for" : nullstr), p
7361 if (describe_command_verbose) {
7362 out1str(" is a shell function");
7369 if (describe_command_verbose) {
7370 out1fmt(" is a %sshell builtin",
7371 IS_BUILTIN_SPECIAL(entry.u.cmd) ?
7372 "special " : nullstr
7380 if (describe_command_verbose) {
7381 out1str(": not found\n");
7386 outstr("\n", stdout);
7391 typecmd(int argc ATTRIBUTE_UNUSED, char **argv)
7397 /* type -p ... ? (we don't bother checking for 'p') */
7398 if (argv[1] && argv[1][0] == '-') {
7403 err |= describe_command(argv[i++], verbose);
7408 #if ENABLE_ASH_CMDCMD
7410 commandcmd(int argc ATTRIBUTE_UNUSED, char **argv ATTRIBUTE_UNUSED)
7418 while ((c = nextopt("pvV")) != '\0')
7420 verify |= VERIFY_VERBOSE;
7422 verify |= VERIFY_BRIEF;
7428 return describe_command(*argptr, verify - VERIFY_BRIEF);
7435 /* ============ eval.c */
7437 static int funcblocksize; /* size of structures in function */
7438 static int funcstringsize; /* size of strings in node */
7439 static void *funcblock; /* block to allocate function from */
7440 static char *funcstring; /* block to allocate strings from */
7442 /* flags in argument to evaltree */
7443 #define EV_EXIT 01 /* exit after evaluating tree */
7444 #define EV_TESTED 02 /* exit status is checked; ignore -e flag */
7445 #define EV_BACKCMD 04 /* command executing within back quotes */
7447 static const short nodesize[26] = {
7448 SHELL_ALIGN(sizeof(struct ncmd)),
7449 SHELL_ALIGN(sizeof(struct npipe)),
7450 SHELL_ALIGN(sizeof(struct nredir)),
7451 SHELL_ALIGN(sizeof(struct nredir)),
7452 SHELL_ALIGN(sizeof(struct nredir)),
7453 SHELL_ALIGN(sizeof(struct nbinary)),
7454 SHELL_ALIGN(sizeof(struct nbinary)),
7455 SHELL_ALIGN(sizeof(struct nbinary)),
7456 SHELL_ALIGN(sizeof(struct nif)),
7457 SHELL_ALIGN(sizeof(struct nbinary)),
7458 SHELL_ALIGN(sizeof(struct nbinary)),
7459 SHELL_ALIGN(sizeof(struct nfor)),
7460 SHELL_ALIGN(sizeof(struct ncase)),
7461 SHELL_ALIGN(sizeof(struct nclist)),
7462 SHELL_ALIGN(sizeof(struct narg)),
7463 SHELL_ALIGN(sizeof(struct narg)),
7464 SHELL_ALIGN(sizeof(struct nfile)),
7465 SHELL_ALIGN(sizeof(struct nfile)),
7466 SHELL_ALIGN(sizeof(struct nfile)),
7467 SHELL_ALIGN(sizeof(struct nfile)),
7468 SHELL_ALIGN(sizeof(struct nfile)),
7469 SHELL_ALIGN(sizeof(struct ndup)),
7470 SHELL_ALIGN(sizeof(struct ndup)),
7471 SHELL_ALIGN(sizeof(struct nhere)),
7472 SHELL_ALIGN(sizeof(struct nhere)),
7473 SHELL_ALIGN(sizeof(struct nnot)),
7476 static void calcsize(union node *n);
7479 sizenodelist(struct nodelist *lp)
7482 funcblocksize += SHELL_ALIGN(sizeof(struct nodelist));
7489 calcsize(union node *n)
7493 funcblocksize += nodesize[n->type];
7496 calcsize(n->ncmd.redirect);
7497 calcsize(n->ncmd.args);
7498 calcsize(n->ncmd.assign);
7501 sizenodelist(n->npipe.cmdlist);
7506 calcsize(n->nredir.redirect);
7507 calcsize(n->nredir.n);
7514 calcsize(n->nbinary.ch2);
7515 calcsize(n->nbinary.ch1);
7518 calcsize(n->nif.elsepart);
7519 calcsize(n->nif.ifpart);
7520 calcsize(n->nif.test);
7523 funcstringsize += strlen(n->nfor.var) + 1;
7524 calcsize(n->nfor.body);
7525 calcsize(n->nfor.args);
7528 calcsize(n->ncase.cases);
7529 calcsize(n->ncase.expr);
7532 calcsize(n->nclist.body);
7533 calcsize(n->nclist.pattern);
7534 calcsize(n->nclist.next);
7538 sizenodelist(n->narg.backquote);
7539 funcstringsize += strlen(n->narg.text) + 1;
7540 calcsize(n->narg.next);
7547 calcsize(n->nfile.fname);
7548 calcsize(n->nfile.next);
7552 calcsize(n->ndup.vname);
7553 calcsize(n->ndup.next);
7557 calcsize(n->nhere.doc);
7558 calcsize(n->nhere.next);
7561 calcsize(n->nnot.com);
7567 nodeckstrdup(char *s)
7569 char *rtn = funcstring;
7571 strcpy(funcstring, s);
7572 funcstring += strlen(s) + 1;
7576 static union node *copynode(union node *);
7578 static struct nodelist *
7579 copynodelist(struct nodelist *lp)
7581 struct nodelist *start;
7582 struct nodelist **lpp;
7587 funcblock = (char *) funcblock + SHELL_ALIGN(sizeof(struct nodelist));
7588 (*lpp)->n = copynode(lp->n);
7590 lpp = &(*lpp)->next;
7597 copynode(union node *n)
7604 funcblock = (char *) funcblock + nodesize[n->type];
7608 new->ncmd.redirect = copynode(n->ncmd.redirect);
7609 new->ncmd.args = copynode(n->ncmd.args);
7610 new->ncmd.assign = copynode(n->ncmd.assign);
7613 new->npipe.cmdlist = copynodelist(n->npipe.cmdlist);
7614 new->npipe.backgnd = n->npipe.backgnd;
7619 new->nredir.redirect = copynode(n->nredir.redirect);
7620 new->nredir.n = copynode(n->nredir.n);
7627 new->nbinary.ch2 = copynode(n->nbinary.ch2);
7628 new->nbinary.ch1 = copynode(n->nbinary.ch1);
7631 new->nif.elsepart = copynode(n->nif.elsepart);
7632 new->nif.ifpart = copynode(n->nif.ifpart);
7633 new->nif.test = copynode(n->nif.test);
7636 new->nfor.var = nodeckstrdup(n->nfor.var);
7637 new->nfor.body = copynode(n->nfor.body);
7638 new->nfor.args = copynode(n->nfor.args);
7641 new->ncase.cases = copynode(n->ncase.cases);
7642 new->ncase.expr = copynode(n->ncase.expr);
7645 new->nclist.body = copynode(n->nclist.body);
7646 new->nclist.pattern = copynode(n->nclist.pattern);
7647 new->nclist.next = copynode(n->nclist.next);
7651 new->narg.backquote = copynodelist(n->narg.backquote);
7652 new->narg.text = nodeckstrdup(n->narg.text);
7653 new->narg.next = copynode(n->narg.next);
7660 new->nfile.fname = copynode(n->nfile.fname);
7661 new->nfile.fd = n->nfile.fd;
7662 new->nfile.next = copynode(n->nfile.next);
7666 new->ndup.vname = copynode(n->ndup.vname);
7667 new->ndup.dupfd = n->ndup.dupfd;
7668 new->ndup.fd = n->ndup.fd;
7669 new->ndup.next = copynode(n->ndup.next);
7673 new->nhere.doc = copynode(n->nhere.doc);
7674 new->nhere.fd = n->nhere.fd;
7675 new->nhere.next = copynode(n->nhere.next);
7678 new->nnot.com = copynode(n->nnot.com);
7681 new->type = n->type;
7686 * Make a copy of a parse tree.
7688 static struct funcnode *
7689 copyfunc(union node *n)
7694 funcblocksize = offsetof(struct funcnode, n);
7697 blocksize = funcblocksize;
7698 f = ckmalloc(blocksize + funcstringsize);
7699 funcblock = (char *) f + offsetof(struct funcnode, n);
7700 funcstring = (char *) f + blocksize;
7707 * Define a shell function.
7710 defun(char *name, union node *func)
7712 struct cmdentry entry;
7715 entry.cmdtype = CMDFUNCTION;
7716 entry.u.func = copyfunc(func);
7717 addcmdentry(name, &entry);
7721 static int evalskip; /* set if we are skipping commands */
7722 /* reasons for skipping commands (see comment on breakcmd routine) */
7723 #define SKIPBREAK (1 << 0)
7724 #define SKIPCONT (1 << 1)
7725 #define SKIPFUNC (1 << 2)
7726 #define SKIPFILE (1 << 3)
7727 #define SKIPEVAL (1 << 4)
7728 static int skipcount; /* number of levels to skip */
7729 static int funcnest; /* depth of function calls */
7731 /* forward decl way out to parsing code - dotrap needs it */
7732 static int evalstring(char *s, int mask);
7735 * Called to execute a trap. Perhaps we should avoid entering new trap
7736 * handlers while we are executing a trap handler.
7747 savestatus = exitstatus;
7751 for (i = 0, q = gotsig; i < NSIG - 1; i++, q++) {
7759 skip = evalstring(p, SKIPEVAL);
7760 exitstatus = savestatus;
7768 /* forward declarations - evaluation is fairly recursive business... */
7769 static void evalloop(union node *, int);
7770 static void evalfor(union node *, int);
7771 static void evalcase(union node *, int);
7772 static void evalsubshell(union node *, int);
7773 static void expredir(union node *);
7774 static void evalpipe(union node *, int);
7775 static void evalcommand(union node *, int);
7776 static int evalbltin(const struct builtincmd *, int, char **);
7777 static void prehash(union node *);
7780 * Evaluate a parse tree. The value is left in the global variable
7784 evaltree(union node *n, int flags)
7787 void (*evalfn)(union node *, int);
7791 TRACE(("evaltree(NULL) called\n"));
7794 TRACE(("pid %d, evaltree(%p: %d, %d) called\n",
7795 getpid(), n, n->type, flags));
7799 out1fmt("Node type = %d\n", n->type);
7804 evaltree(n->nnot.com, EV_TESTED);
7805 status = !exitstatus;
7808 expredir(n->nredir.redirect);
7809 status = redirectsafe(n->nredir.redirect, REDIR_PUSH);
7811 evaltree(n->nredir.n, flags & EV_TESTED);
7812 status = exitstatus;
7817 evalfn = evalcommand;
7819 if (eflag && !(flags & EV_TESTED))
7831 evalfn = evalsubshell;
7843 #error NAND + 1 != NOR
7845 #if NOR + 1 != NSEMI
7846 #error NOR + 1 != NSEMI
7848 isor = n->type - NAND;
7851 (flags | ((isor >> 1) - 1)) & EV_TESTED
7853 if (!exitstatus == isor)
7865 evaltree(n->nif.test, EV_TESTED);
7868 if (exitstatus == 0) {
7871 } else if (n->nif.elsepart) {
7872 n = n->nif.elsepart;
7877 defun(n->narg.text, n->narg.next);
7881 exitstatus = status;
7885 if ((checkexit & exitstatus))
7886 evalskip |= SKIPEVAL;
7887 else if (pendingsig && dotrap())
7890 if (flags & EV_EXIT) {
7892 raise_exception(EXEXIT);
7896 #if !defined(__alpha__) || (defined(__GNUC__) && __GNUC__ >= 3)
7899 void evaltreenr(union node *, int) __attribute__ ((alias("evaltree"),__noreturn__));
7901 static int loopnest; /* current loop nesting level */
7904 evalloop(union node *n, int flags)
7914 evaltree(n->nbinary.ch1, EV_TESTED);
7917 if (evalskip == SKIPCONT && --skipcount <= 0) {
7921 if (evalskip == SKIPBREAK && --skipcount <= 0)
7926 if (n->type != NWHILE)
7930 evaltree(n->nbinary.ch2, flags);
7931 status = exitstatus;
7936 exitstatus = status;
7940 evalfor(union node *n, int flags)
7942 struct arglist arglist;
7945 struct stackmark smark;
7947 setstackmark(&smark);
7948 arglist.list = NULL;
7949 arglist.lastp = &arglist.list;
7950 for (argp = n->nfor.args; argp; argp = argp->narg.next) {
7951 expandarg(argp, &arglist, EXP_FULL | EXP_TILDE | EXP_RECORD);
7956 *arglist.lastp = NULL;
7961 for (sp = arglist.list; sp; sp = sp->next) {
7962 setvar(n->nfor.var, sp->text, 0);
7963 evaltree(n->nfor.body, flags);
7965 if (evalskip == SKIPCONT && --skipcount <= 0) {
7969 if (evalskip == SKIPBREAK && --skipcount <= 0)
7976 popstackmark(&smark);
7980 evalcase(union node *n, int flags)
7984 struct arglist arglist;
7985 struct stackmark smark;
7987 setstackmark(&smark);
7988 arglist.list = NULL;
7989 arglist.lastp = &arglist.list;
7990 expandarg(n->ncase.expr, &arglist, EXP_TILDE);
7992 for (cp = n->ncase.cases; cp && evalskip == 0; cp = cp->nclist.next) {
7993 for (patp = cp->nclist.pattern; patp; patp = patp->narg.next) {
7994 if (casematch(patp, arglist.list->text)) {
7995 if (evalskip == 0) {
7996 evaltree(cp->nclist.body, flags);
8003 popstackmark(&smark);
8007 * Kick off a subshell to evaluate a tree.
8010 evalsubshell(union node *n, int flags)
8013 int backgnd = (n->type == NBACKGND);
8016 expredir(n->nredir.redirect);
8017 if (!backgnd && flags & EV_EXIT && !trap[0])
8020 jp = makejob(/*n,*/ 1);
8021 if (forkshell(jp, n, backgnd) == 0) {
8025 flags &=~ EV_TESTED;
8027 redirect(n->nredir.redirect, 0);
8028 evaltreenr(n->nredir.n, flags);
8033 status = waitforjob(jp);
8034 exitstatus = status;
8039 * Compute the names of the files in a redirection list.
8041 static void fixredir(union node *, const char *, int);
8043 expredir(union node *n)
8047 for (redir = n; redir; redir = redir->nfile.next) {
8051 fn.lastp = &fn.list;
8052 switch (redir->type) {
8058 expandarg(redir->nfile.fname, &fn, EXP_TILDE | EXP_REDIR);
8059 redir->nfile.expfname = fn.list->text;
8063 if (redir->ndup.vname) {
8064 expandarg(redir->ndup.vname, &fn, EXP_FULL | EXP_TILDE);
8065 if (fn.list == NULL)
8066 ash_msg_and_raise_error("redir error");
8067 fixredir(redir, fn.list->text, 1);
8075 * Evaluate a pipeline. All the processes in the pipeline are children
8076 * of the process creating the pipeline. (This differs from some versions
8077 * of the shell, which make the last process in a pipeline the parent
8081 evalpipe(union node *n, int flags)
8084 struct nodelist *lp;
8089 TRACE(("evalpipe(0x%lx) called\n", (long)n));
8091 for (lp = n->npipe.cmdlist; lp; lp = lp->next)
8095 jp = makejob(/*n,*/ pipelen);
8097 for (lp = n->npipe.cmdlist; lp; lp = lp->next) {
8101 if (pipe(pip) < 0) {
8103 ash_msg_and_raise_error("pipe call failed");
8106 if (forkshell(jp, lp->n, n->npipe.backgnd) == 0) {
8119 evaltreenr(lp->n, flags);
8127 if (n->npipe.backgnd == 0) {
8128 exitstatus = waitforjob(jp);
8129 TRACE(("evalpipe: job done exit status %d\n", exitstatus));
8135 * Controls whether the shell is interactive or not.
8138 setinteractive(int on)
8140 static int is_interactive;
8142 if (++on == is_interactive)
8144 is_interactive = on;
8148 #if !ENABLE_FEATURE_SH_EXTRA_QUIET
8149 if (is_interactive > 1) {
8150 /* Looks like they want an interactive shell */
8151 static smallint did_banner;
8156 "%s built-in shell (ash)\n"
8157 "Enter 'help' for a list of built-in commands."
8166 #if ENABLE_FEATURE_EDITING_VI
8167 #define setvimode(on) do { \
8168 if (on) line_input_state->flags |= VI_MODE; \
8169 else line_input_state->flags &= ~VI_MODE; \
8172 #define setvimode(on) viflag = 0 /* forcibly keep the option off */
8181 setinteractive(iflag);
8186 static struct localvar *localvars;
8189 * Called after a function returns.
8190 * Interrupts must be off.
8195 struct localvar *lvp;
8198 while ((lvp = localvars) != NULL) {
8199 localvars = lvp->next;
8201 TRACE(("poplocalvar %s", vp ? vp->text : "-"));
8202 if (vp == NULL) { /* $- saved */
8203 memcpy(optlist, lvp->text, sizeof(optlist));
8204 free((char*)lvp->text);
8206 } else if ((lvp->flags & (VUNSET|VSTRFIXED)) == VUNSET) {
8210 (*vp->func)(strchrnul(lvp->text, '=') + 1);
8211 if ((vp->flags & (VTEXTFIXED|VSTACK)) == 0)
8212 free((char*)vp->text);
8213 vp->flags = lvp->flags;
8214 vp->text = lvp->text;
8221 evalfun(struct funcnode *func, int argc, char **argv, int flags)
8223 volatile struct shparam saveparam;
8224 struct localvar *volatile savelocalvars;
8225 struct jmploc *volatile savehandler;
8226 struct jmploc jmploc;
8229 saveparam = shellparam;
8230 savelocalvars = localvars;
8231 e = setjmp(jmploc.loc);
8236 savehandler = exception_handler;
8237 exception_handler = &jmploc;
8239 shellparam.malloced = 0;
8243 shellparam.nparam = argc - 1;
8244 shellparam.p = argv + 1;
8245 #if ENABLE_ASH_GETOPTS
8246 shellparam.optind = 1;
8247 shellparam.optoff = -1;
8249 evaltree(&func->n, flags & EV_TESTED);
8255 localvars = savelocalvars;
8256 freeparam(&shellparam);
8257 shellparam = saveparam;
8258 exception_handler = savehandler;
8260 evalskip &= ~SKIPFUNC;
8264 #if ENABLE_ASH_CMDCMD
8266 parse_command_args(char **argv, const char **path)
8279 if (c == '-' && !*cp) {
8286 *path = bb_default_path;
8289 /* run 'typecmd' for other options */
8300 * Make a variable a local variable. When a variable is made local, it's
8301 * value and flags are saved in a localvar structure. The saved values
8302 * will be restored when the shell function returns. We handle the name
8303 * "-" as a special case.
8308 struct localvar *lvp;
8313 lvp = ckzalloc(sizeof(struct localvar));
8314 if (LONE_DASH(name)) {
8316 p = ckmalloc(sizeof(optlist));
8317 lvp->text = memcpy(p, optlist, sizeof(optlist));
8322 vpp = hashvar(name);
8323 vp = *findvar(vpp, name);
8324 eq = strchr(name, '=');
8327 setvareq(name, VSTRFIXED);
8329 setvar(name, NULL, VSTRFIXED);
8330 vp = *vpp; /* the new variable */
8331 lvp->flags = VUNSET;
8333 lvp->text = vp->text;
8334 lvp->flags = vp->flags;
8335 vp->flags |= VSTRFIXED|VTEXTFIXED;
8341 lvp->next = localvars;
8347 * The "local" command.
8350 localcmd(int argc ATTRIBUTE_UNUSED, char **argv)
8355 while ((name = *argv++) != NULL) {
8362 falsecmd(int argc ATTRIBUTE_UNUSED, char **argv ATTRIBUTE_UNUSED)
8368 truecmd(int argc ATTRIBUTE_UNUSED, char **argv ATTRIBUTE_UNUSED)
8374 execcmd(int argc ATTRIBUTE_UNUSED, char **argv)
8377 iflag = 0; /* exit on error */
8380 shellexec(argv + 1, pathval(), 0);
8386 * The return command.
8389 returncmd(int argc ATTRIBUTE_UNUSED, char **argv)
8392 * If called outside a function, do what ksh does;
8393 * skip the rest of the file.
8395 evalskip = funcnest ? SKIPFUNC : SKIPFILE;
8396 return argv[1] ? number(argv[1]) : exitstatus;
8399 /* Forward declarations for builtintab[] */
8400 static int breakcmd(int, char **);
8401 static int dotcmd(int, char **);
8402 static int evalcmd(int, char **);
8403 static int exitcmd(int, char **);
8404 static int exportcmd(int, char **);
8405 #if ENABLE_ASH_GETOPTS
8406 static int getoptscmd(int, char **);
8408 #if !ENABLE_FEATURE_SH_EXTRA_QUIET
8409 static int helpcmd(int, char **);
8411 #if ENABLE_ASH_MATH_SUPPORT
8412 static int letcmd(int, char **);
8414 static int readcmd(int, char **);
8415 static int setcmd(int, char **);
8416 static int shiftcmd(int, char **);
8417 static int timescmd(int, char **);
8418 static int trapcmd(int, char **);
8419 static int umaskcmd(int, char **);
8420 static int unsetcmd(int, char **);
8421 static int ulimitcmd(int, char **);
8423 #define BUILTIN_NOSPEC "0"
8424 #define BUILTIN_SPECIAL "1"
8425 #define BUILTIN_REGULAR "2"
8426 #define BUILTIN_SPEC_REG "3"
8427 #define BUILTIN_ASSIGN "4"
8428 #define BUILTIN_SPEC_ASSG "5"
8429 #define BUILTIN_REG_ASSG "6"
8430 #define BUILTIN_SPEC_REG_ASSG "7"
8432 /* We do not handle [[ expr ]] bashism bash-compatibly,
8433 * we make it a synonym of [ expr ].
8434 * Basically, word splitting and pathname expansion should NOT be performed
8436 * no word splitting: a="a b"; [[ $a = "a b" ]]; echo $? should print "0"
8437 * no pathname expansion: [[ /bin/m* = "/bin/m*" ]]; echo $? should print "0"
8438 * Additional operators:
8439 * || and && should work as -o and -a
8441 * Apart from the above, [[ expr ]] should work as [ expr ]
8444 #define echocmd echo_main
8445 #define printfcmd printf_main
8446 #define testcmd test_main
8448 /* Keep these in proper order since it is searched via bsearch() */
8449 static const struct builtincmd builtintab[] = {
8450 { BUILTIN_SPEC_REG ".", dotcmd },
8451 { BUILTIN_SPEC_REG ":", truecmd },
8452 #if ENABLE_ASH_BUILTIN_TEST
8453 { BUILTIN_REGULAR "[", testcmd },
8454 #if ENABLE_ASH_BASH_COMPAT
8455 { BUILTIN_REGULAR "[[", testcmd },
8458 #if ENABLE_ASH_ALIAS
8459 { BUILTIN_REG_ASSG "alias", aliascmd },
8462 { BUILTIN_REGULAR "bg", fg_bgcmd },
8464 { BUILTIN_SPEC_REG "break", breakcmd },
8465 { BUILTIN_REGULAR "cd", cdcmd },
8466 { BUILTIN_NOSPEC "chdir", cdcmd },
8467 #if ENABLE_ASH_CMDCMD
8468 { BUILTIN_REGULAR "command", commandcmd },
8470 { BUILTIN_SPEC_REG "continue", breakcmd },
8471 #if ENABLE_ASH_BUILTIN_ECHO
8472 { BUILTIN_REGULAR "echo", echocmd },
8474 { BUILTIN_SPEC_REG "eval", evalcmd },
8475 { BUILTIN_SPEC_REG "exec", execcmd },
8476 { BUILTIN_SPEC_REG "exit", exitcmd },
8477 { BUILTIN_SPEC_REG_ASSG "export", exportcmd },
8478 { BUILTIN_REGULAR "false", falsecmd },
8480 { BUILTIN_REGULAR "fg", fg_bgcmd },
8482 #if ENABLE_ASH_GETOPTS
8483 { BUILTIN_REGULAR "getopts", getoptscmd },
8485 { BUILTIN_NOSPEC "hash", hashcmd },
8486 #if !ENABLE_FEATURE_SH_EXTRA_QUIET
8487 { BUILTIN_NOSPEC "help", helpcmd },
8490 { BUILTIN_REGULAR "jobs", jobscmd },
8491 { BUILTIN_REGULAR "kill", killcmd },
8493 #if ENABLE_ASH_MATH_SUPPORT
8494 { BUILTIN_NOSPEC "let", letcmd },
8496 { BUILTIN_ASSIGN "local", localcmd },
8497 #if ENABLE_ASH_BUILTIN_PRINTF
8498 { BUILTIN_REGULAR "printf", printfcmd },
8500 { BUILTIN_NOSPEC "pwd", pwdcmd },
8501 { BUILTIN_REGULAR "read", readcmd },
8502 { BUILTIN_SPEC_REG_ASSG "readonly", exportcmd },
8503 { BUILTIN_SPEC_REG "return", returncmd },
8504 { BUILTIN_SPEC_REG "set", setcmd },
8505 { BUILTIN_SPEC_REG "shift", shiftcmd },
8506 { BUILTIN_SPEC_REG "source", dotcmd },
8507 #if ENABLE_ASH_BUILTIN_TEST
8508 { BUILTIN_REGULAR "test", testcmd },
8510 { BUILTIN_SPEC_REG "times", timescmd },
8511 { BUILTIN_SPEC_REG "trap", trapcmd },
8512 { BUILTIN_REGULAR "true", truecmd },
8513 { BUILTIN_NOSPEC "type", typecmd },
8514 { BUILTIN_NOSPEC "ulimit", ulimitcmd },
8515 { BUILTIN_REGULAR "umask", umaskcmd },
8516 #if ENABLE_ASH_ALIAS
8517 { BUILTIN_REGULAR "unalias", unaliascmd },
8519 { BUILTIN_SPEC_REG "unset", unsetcmd },
8520 { BUILTIN_REGULAR "wait", waitcmd },
8523 /* Should match the above table! */
8524 #define COMMANDCMD (builtintab + \
8526 1 * ENABLE_ASH_BUILTIN_TEST + \
8527 1 * ENABLE_ASH_BUILTIN_TEST * ENABLE_ASH_BASH_COMPAT + \
8528 1 * ENABLE_ASH_ALIAS + \
8529 1 * ENABLE_ASH_JOB_CONTROL + \
8531 #define EXECCMD (builtintab + \
8533 1 * ENABLE_ASH_BUILTIN_TEST + \
8534 1 * ENABLE_ASH_BUILTIN_TEST * ENABLE_ASH_BASH_COMPAT + \
8535 1 * ENABLE_ASH_ALIAS + \
8536 1 * ENABLE_ASH_JOB_CONTROL + \
8538 1 * ENABLE_ASH_CMDCMD + \
8540 ENABLE_ASH_BUILTIN_ECHO + \
8544 * Search the table of builtin commands.
8546 static struct builtincmd *
8547 find_builtin(const char *name)
8549 struct builtincmd *bp;
8552 name, builtintab, ARRAY_SIZE(builtintab), sizeof(builtintab[0]),
8559 * Execute a simple command.
8561 static int back_exitstatus; /* exit status of backquoted command */
8563 isassignment(const char *p)
8565 const char *q = endofname(p);
8571 bltincmd(int argc ATTRIBUTE_UNUSED, char **argv ATTRIBUTE_UNUSED)
8573 /* Preserve exitstatus of a previous possible redirection
8574 * as POSIX mandates */
8575 return back_exitstatus;
8578 evalcommand(union node *cmd, int flags)
8580 static const struct builtincmd null_bltin = {
8581 "\0\0", bltincmd /* why three NULs? */
8583 struct stackmark smark;
8585 struct arglist arglist;
8586 struct arglist varlist;
8589 const struct strlist *sp;
8590 struct cmdentry cmdentry;
8598 struct builtincmd *bcmd;
8599 int pseudovarflag = 0;
8601 /* First expand the arguments. */
8602 TRACE(("evalcommand(0x%lx, %d) called\n", (long)cmd, flags));
8603 setstackmark(&smark);
8604 back_exitstatus = 0;
8606 cmdentry.cmdtype = CMDBUILTIN;
8607 cmdentry.u.cmd = &null_bltin;
8608 varlist.lastp = &varlist.list;
8609 *varlist.lastp = NULL;
8610 arglist.lastp = &arglist.list;
8611 *arglist.lastp = NULL;
8614 if (cmd->ncmd.args) {
8615 bcmd = find_builtin(cmd->ncmd.args->narg.text);
8616 pseudovarflag = bcmd && IS_BUILTIN_ASSIGN(bcmd);
8619 for (argp = cmd->ncmd.args; argp; argp = argp->narg.next) {
8620 struct strlist **spp;
8622 spp = arglist.lastp;
8623 if (pseudovarflag && isassignment(argp->narg.text))
8624 expandarg(argp, &arglist, EXP_VARTILDE);
8626 expandarg(argp, &arglist, EXP_FULL | EXP_TILDE);
8628 for (sp = *spp; sp; sp = sp->next)
8632 argv = nargv = stalloc(sizeof(char *) * (argc + 1));
8633 for (sp = arglist.list; sp; sp = sp->next) {
8634 TRACE(("evalcommand arg: %s\n", sp->text));
8635 *nargv++ = sp->text;
8640 if (iflag && funcnest == 0 && argc > 0)
8641 lastarg = nargv[-1];
8644 expredir(cmd->ncmd.redirect);
8645 status = redirectsafe(cmd->ncmd.redirect, REDIR_PUSH | REDIR_SAVEFD2);
8648 for (argp = cmd->ncmd.assign; argp; argp = argp->narg.next) {
8649 struct strlist **spp;
8652 spp = varlist.lastp;
8653 expandarg(argp, &varlist, EXP_VARTILDE);
8656 * Modify the command lookup path, if a PATH= assignment
8660 if (varequal(p, path))
8664 /* Print the command if xflag is set. */
8667 const char *p = " %s";
8670 fdprintf(preverrout_fd, p, expandstr(ps4val()));
8673 for (n = 0; n < 2; n++) {
8675 fdprintf(preverrout_fd, p, sp->text);
8683 safe_write(preverrout_fd, "\n", 1);
8689 /* Now locate the command. */
8691 const char *oldpath;
8692 int cmd_flag = DO_ERR;
8697 find_command(argv[0], &cmdentry, cmd_flag, path);
8698 if (cmdentry.cmdtype == CMDUNKNOWN) {
8704 /* implement bltin and command here */
8705 if (cmdentry.cmdtype != CMDBUILTIN)
8708 spclbltin = IS_BUILTIN_SPECIAL(cmdentry.u.cmd);
8709 if (cmdentry.u.cmd == EXECCMD)
8711 #if ENABLE_ASH_CMDCMD
8712 if (cmdentry.u.cmd == COMMANDCMD) {
8714 nargv = parse_command_args(argv, &path);
8717 argc -= nargv - argv;
8719 cmd_flag |= DO_NOFUNC;
8727 /* We have a redirection error. */
8729 raise_exception(EXERROR);
8731 exitstatus = status;
8735 /* Execute the command. */
8736 switch (cmdentry.cmdtype) {
8738 #if ENABLE_FEATURE_SH_NOFORK
8740 /* find_command() encodes applet_no as (-2 - applet_no) */
8741 int applet_no = (- cmdentry.u.index - 2);
8742 if (applet_no >= 0 && APPLET_IS_NOFORK(applet_no)) {
8743 listsetvar(varlist.list, VEXPORT|VSTACK);
8744 /* run <applet>_main() */
8745 exitstatus = run_nofork_applet(applet_no, argv);
8751 /* Fork off a child process if necessary. */
8752 if (!(flags & EV_EXIT) || trap[0]) {
8754 jp = makejob(/*cmd,*/ 1);
8755 if (forkshell(jp, cmd, FORK_FG) != 0) {
8756 exitstatus = waitforjob(jp);
8762 listsetvar(varlist.list, VEXPORT|VSTACK);
8763 shellexec(argv, path, cmdentry.u.index);
8767 cmdenviron = varlist.list;
8769 struct strlist *list = cmdenviron;
8771 if (spclbltin > 0 || argc == 0) {
8773 if (cmd_is_exec && argc > 1)
8776 listsetvar(list, i);
8778 if (evalbltin(cmdentry.u.cmd, argc, argv)) {
8785 exit_status = 128 + SIGINT;
8787 exit_status = 128 + pendingsig;
8788 exitstatus = exit_status;
8789 if (i == EXINT || spclbltin > 0) {
8791 longjmp(exception_handler->loc, 1);
8798 listsetvar(varlist.list, 0);
8799 if (evalfun(cmdentry.u.func, argc, argv, flags))
8805 popredir(cmd_is_exec);
8807 /* dsl: I think this is intended to be used to support
8808 * '_' in 'vi' command mode during line editing...
8809 * However I implemented that within libedit itself.
8811 setvar("_", lastarg, 0);
8812 popstackmark(&smark);
8816 evalbltin(const struct builtincmd *cmd, int argc, char **argv)
8818 char *volatile savecmdname;
8819 struct jmploc *volatile savehandler;
8820 struct jmploc jmploc;
8823 savecmdname = commandname;
8824 i = setjmp(jmploc.loc);
8827 savehandler = exception_handler;
8828 exception_handler = &jmploc;
8829 commandname = argv[0];
8831 optptr = NULL; /* initialize nextopt */
8832 exitstatus = (*cmd->builtin)(argc, argv);
8833 flush_stdout_stderr();
8835 exitstatus |= ferror(stdout);
8837 commandname = savecmdname;
8839 exception_handler = savehandler;
8845 goodname(const char *p)
8847 return !*endofname(p);
8852 * Search for a command. This is called before we fork so that the
8853 * location of the command will be available in the parent as well as
8854 * the child. The check for "goodname" is an overly conservative
8855 * check that the name will not be subject to expansion.
8858 prehash(union node *n)
8860 struct cmdentry entry;
8862 if (n->type == NCMD && n->ncmd.args && goodname(n->ncmd.args->narg.text))
8863 find_command(n->ncmd.args->narg.text, &entry, 0, pathval());
8867 /* ============ Builtin commands
8869 * Builtin commands whose functions are closely tied to evaluation
8870 * are implemented here.
8874 * Handle break and continue commands. Break, continue, and return are
8875 * all handled by setting the evalskip flag. The evaluation routines
8876 * above all check this flag, and if it is set they start skipping
8877 * commands rather than executing them. The variable skipcount is
8878 * the number of loops to break/continue, or the number of function
8879 * levels to return. (The latter is always 1.) It should probably
8880 * be an error to break out of more loops than exist, but it isn't
8881 * in the standard shell so we don't make it one here.
8884 breakcmd(int argc ATTRIBUTE_UNUSED, char **argv)
8886 int n = argv[1] ? number(argv[1]) : 1;
8889 ash_msg_and_raise_error(illnum, argv[1]);
8893 evalskip = (**argv == 'c') ? SKIPCONT : SKIPBREAK;
8900 /* ============ input.c
8902 * This implements the input routines used by the parser.
8905 #define EOF_NLEFT -99 /* value of parsenleft when EOF pushed back */
8908 INPUT_PUSH_FILE = 1,
8909 INPUT_NOFILE_OK = 2,
8912 static int plinno = 1; /* input line number */
8913 /* number of characters left in input buffer */
8914 static int parsenleft; /* copy of parsefile->nleft */
8915 static int parselleft; /* copy of parsefile->lleft */
8916 /* next character in input buffer */
8917 static char *parsenextc; /* copy of parsefile->nextc */
8919 static int checkkwd;
8920 /* values of checkkwd variable */
8921 #define CHKALIAS 0x1
8928 struct strpush *sp = parsefile->strpush;
8931 #if ENABLE_ASH_ALIAS
8933 if (parsenextc[-1] == ' ' || parsenextc[-1] == '\t') {
8934 checkkwd |= CHKALIAS;
8936 if (sp->string != sp->ap->val) {
8939 sp->ap->flag &= ~ALIASINUSE;
8940 if (sp->ap->flag & ALIASDEAD) {
8941 unalias(sp->ap->name);
8945 parsenextc = sp->prevstring;
8946 parsenleft = sp->prevnleft;
8947 /*dprintf("*** calling popstring: restoring to '%s'\n", parsenextc);*/
8948 parsefile->strpush = sp->prev;
8949 if (sp != &(parsefile->basestrpush))
8958 char *buf = parsefile->buf;
8961 #if ENABLE_FEATURE_EDITING
8963 if (!iflag || parsefile->fd)
8964 nr = nonblock_safe_read(parsefile->fd, buf, BUFSIZ - 1);
8966 #if ENABLE_FEATURE_TAB_COMPLETION
8967 line_input_state->path_lookup = pathval();
8969 nr = read_line_input(cmdedit_prompt, buf, BUFSIZ, line_input_state);
8971 /* Ctrl+C pressed */
8980 if (nr < 0 && errno == 0) {
8981 /* Ctrl+D pressed */
8986 nr = nonblock_safe_read(parsefile->fd, buf, BUFSIZ - 1);
8990 /* nonblock_safe_read() handles this problem */
8992 if (parsefile->fd == 0 && errno == EWOULDBLOCK) {
8993 int flags = fcntl(0, F_GETFL);
8994 if (flags >= 0 && (flags & O_NONBLOCK)) {
8995 flags &= ~O_NONBLOCK;
8996 if (fcntl(0, F_SETFL, flags) >= 0) {
8997 out2str("sh: turning off NDELAY mode\n");
9008 * Refill the input buffer and return the next input character:
9010 * 1) If a string was pushed back on the input, pop it;
9011 * 2) If an EOF was pushed back (parsenleft == EOF_NLEFT) or we are reading
9012 * from a string so we can't refill the buffer, return EOF.
9013 * 3) If the is more stuff in this buffer, use it else call read to fill it.
9014 * 4) Process input up to the next newline, deleting nul characters.
9023 while (parsefile->strpush) {
9024 #if ENABLE_ASH_ALIAS
9025 if (parsenleft == -1 && parsefile->strpush->ap &&
9026 parsenextc[-1] != ' ' && parsenextc[-1] != '\t') {
9031 if (--parsenleft >= 0)
9032 return signed_char2int(*parsenextc++);
9034 if (parsenleft == EOF_NLEFT || parsefile->buf == NULL)
9036 flush_stdout_stderr();
9043 parselleft = parsenleft = EOF_NLEFT;
9050 /* delete nul characters */
9058 memmove(q, q + 1, more);
9062 parsenleft = q - parsenextc - 1;
9068 parsenleft = q - parsenextc - 1;
9080 out2str(parsenextc);
9085 return signed_char2int(*parsenextc++);
9088 #define pgetc_as_macro() (--parsenleft >= 0? signed_char2int(*parsenextc++) : preadbuffer())
9092 return pgetc_as_macro();
9095 #if ENABLE_ASH_OPTIMIZE_FOR_SIZE
9096 #define pgetc_macro() pgetc()
9098 #define pgetc_macro() pgetc_as_macro()
9102 * Same as pgetc(), but ignores PEOA.
9104 #if ENABLE_ASH_ALIAS
9112 } while (c == PEOA);
9119 return pgetc_macro();
9124 * Read a line from the script.
9127 pfgets(char *line, int len)
9133 while (--nleft > 0) {
9149 * Undo the last call to pgetc. Only one character may be pushed back.
9150 * PEOF may be pushed back.
9160 * Push a string back onto the input at this current parsefile level.
9161 * We handle aliases this way.
9163 #if !ENABLE_ASH_ALIAS
9164 #define pushstring(s, ap) pushstring(s)
9167 pushstring(char *s, struct alias *ap)
9174 /*dprintf("*** calling pushstring: %s, %d\n", s, len);*/
9175 if (parsefile->strpush) {
9176 sp = ckzalloc(sizeof(struct strpush));
9177 sp->prev = parsefile->strpush;
9178 parsefile->strpush = sp;
9180 sp = parsefile->strpush = &(parsefile->basestrpush);
9181 sp->prevstring = parsenextc;
9182 sp->prevnleft = parsenleft;
9183 #if ENABLE_ASH_ALIAS
9186 ap->flag |= ALIASINUSE;
9196 * To handle the "." command, a stack of input files is used. Pushfile
9197 * adds a new entry to the stack and popfile restores the previous level.
9202 struct parsefile *pf;
9204 parsefile->nleft = parsenleft;
9205 parsefile->lleft = parselleft;
9206 parsefile->nextc = parsenextc;
9207 parsefile->linno = plinno;
9208 pf = ckzalloc(sizeof(*pf));
9209 pf->prev = parsefile;
9211 /*pf->strpush = NULL; - ckzalloc did it */
9212 /*pf->basestrpush.prev = NULL;*/
9219 struct parsefile *pf = parsefile;
9227 parsefile = pf->prev;
9229 parsenleft = parsefile->nleft;
9230 parselleft = parsefile->lleft;
9231 parsenextc = parsefile->nextc;
9232 plinno = parsefile->linno;
9237 * Return to top level.
9242 while (parsefile != &basepf)
9247 * Close the file(s) that the shell is reading commands from. Called
9248 * after a fork is done.
9254 if (parsefile->fd > 0) {
9255 close(parsefile->fd);
9261 * Like setinputfile, but takes an open file descriptor. Call this with
9265 setinputfd(int fd, int push)
9267 close_on_exec_on(fd);
9273 if (parsefile->buf == NULL)
9274 parsefile->buf = ckmalloc(IBUFSIZ);
9275 parselleft = parsenleft = 0;
9280 * Set the input to take input from a file. If push is set, push the
9281 * old input onto the stack first.
9284 setinputfile(const char *fname, int flags)
9290 fd = open(fname, O_RDONLY);
9292 if (flags & INPUT_NOFILE_OK)
9294 ash_msg_and_raise_error("can't open %s", fname);
9297 fd2 = copyfd(fd, 10);
9300 ash_msg_and_raise_error("out of file descriptors");
9303 setinputfd(fd, flags & INPUT_PUSH_FILE);
9310 * Like setinputfile, but takes input from a string.
9313 setinputstring(char *string)
9317 parsenextc = string;
9318 parsenleft = strlen(string);
9319 parsefile->buf = NULL;
9325 /* ============ mail.c
9327 * Routines to check for mail.
9332 #define MAXMBOXES 10
9334 /* times of mailboxes */
9335 static time_t mailtime[MAXMBOXES];
9336 /* Set if MAIL or MAILPATH is changed. */
9337 static smallint mail_var_path_changed;
9340 * Print appropriate message(s) if mail has arrived.
9341 * If mail_var_path_changed is set,
9342 * then the value of MAIL has mail_var_path_changed,
9343 * so we just update the values.
9352 struct stackmark smark;
9355 setstackmark(&smark);
9356 mpath = mpathset() ? mpathval() : mailval();
9357 for (mtp = mailtime; mtp < mailtime + MAXMBOXES; mtp++) {
9358 p = padvance(&mpath, nullstr);
9363 for (q = p; *q; q++)
9369 q[-1] = '\0'; /* delete trailing '/' */
9370 if (stat(p, &statb) < 0) {
9374 if (!mail_var_path_changed && statb.st_mtime != *mtp) {
9377 pathopt ? pathopt : "you have mail"
9380 *mtp = statb.st_mtime;
9382 mail_var_path_changed = 0;
9383 popstackmark(&smark);
9387 changemail(const char *val ATTRIBUTE_UNUSED)
9389 mail_var_path_changed = 1;
9392 #endif /* ASH_MAIL */
9395 /* ============ ??? */
9398 * Set the shell parameters.
9401 setparam(char **argv)
9407 for (nparam = 0; argv[nparam]; nparam++)
9409 ap = newparam = ckmalloc((nparam + 1) * sizeof(*ap));
9411 *ap++ = ckstrdup(*argv++);
9414 freeparam(&shellparam);
9415 shellparam.malloced = 1;
9416 shellparam.nparam = nparam;
9417 shellparam.p = newparam;
9418 #if ENABLE_ASH_GETOPTS
9419 shellparam.optind = 1;
9420 shellparam.optoff = -1;
9425 * Process shell options. The global variable argptr contains a pointer
9426 * to the argument list; we advance it past the options.
9428 * SUSv3 section 2.8.1 "Consequences of Shell Errors" says:
9429 * For a non-interactive shell, an error condition encountered
9430 * by a special built-in ... shall cause the shell to write a diagnostic message
9431 * to standard error and exit as shown in the following table:
9432 * Error Special Built-In
9434 * Utility syntax error (option or operand error) Shall exit
9436 * However, in bug 1142 (http://busybox.net/bugs/view.php?id=1142)
9437 * we see that bash does not do that (set "finishes" with error code 1 instead,
9438 * and shell continues), and people rely on this behavior!
9440 * set -o barfoo 2>/dev/null
9443 * Oh well. Let's mimic that.
9446 plus_minus_o(char *name, int val)
9451 for (i = 0; i < NOPTS; i++) {
9452 if (strcmp(name, optnames(i)) == 0) {
9457 ash_msg("illegal option %co %s", val ? '-' : '+', name);
9460 for (i = 0; i < NOPTS; i++) {
9462 out1fmt("%-16s%s\n", optnames(i), optlist[i] ? "on" : "off");
9464 out1fmt("set %co %s\n", optlist[i] ? '-' : '+', optnames(i));
9470 setoption(int flag, int val)
9474 for (i = 0; i < NOPTS; i++) {
9475 if (optletters(i) == flag) {
9480 ash_msg_and_raise_error("illegal option %c%c", val ? '-' : '+', flag);
9484 options(int cmdline)
9492 while ((p = *argptr) != NULL) {
9494 if (c != '-' && c != '+')
9497 val = 0; /* val = 0 if c == '+' */
9500 if (p[0] == '\0' || LONE_DASH(p)) {
9502 /* "-" means turn off -x and -v */
9505 /* "--" means reset params */
9506 else if (*argptr == NULL)
9509 break; /* "-" or "--" terminates options */
9512 /* first char was + or - */
9513 while ((c = *p++) != '\0') {
9514 /* bash 3.2 indeed handles -c CMD and +c CMD the same */
9515 if (c == 'c' && cmdline) {
9516 minusc = p; /* command is after shell args */
9517 } else if (c == 'o') {
9518 if (plus_minus_o(*argptr, val)) {
9519 /* it already printed err message */
9520 return 1; /* error */
9524 } else if (cmdline && (c == 'l')) { /* -l or +l == --login */
9526 /* bash does not accept +-login, we also won't */
9527 } else if (cmdline && val && (c == '-')) { /* long options */
9528 if (strcmp(p, "login") == 0)
9540 * The shift builtin command.
9543 shiftcmd(int argc ATTRIBUTE_UNUSED, char **argv)
9550 n = number(argv[1]);
9551 if (n > shellparam.nparam)
9552 ash_msg_and_raise_error("can't shift that many");
9554 shellparam.nparam -= n;
9555 for (ap1 = shellparam.p; --n >= 0; ap1++) {
9556 if (shellparam.malloced)
9560 while ((*ap2++ = *ap1++) != NULL)
9562 #if ENABLE_ASH_GETOPTS
9563 shellparam.optind = 1;
9564 shellparam.optoff = -1;
9571 * POSIX requires that 'set' (but not export or readonly) output the
9572 * variables in lexicographic order - by the locale's collating order (sigh).
9573 * Maybe we could keep them in an ordered balanced binary tree
9574 * instead of hashed lists.
9575 * For now just roll 'em through qsort for printing...
9578 showvars(const char *sep_prefix, int on, int off)
9583 ep = listvars(on, off, &epend);
9584 qsort(ep, epend - ep, sizeof(char *), vpcmp);
9586 sep = *sep_prefix ? " " : sep_prefix;
9588 for (; ep < epend; ep++) {
9592 p = strchrnul(*ep, '=');
9595 q = single_quote(++p);
9596 out1fmt("%s%s%.*s%s\n", sep_prefix, sep, (int)(p - *ep), *ep, q);
9602 * The set command builtin.
9605 setcmd(int argc ATTRIBUTE_UNUSED, char **argv ATTRIBUTE_UNUSED)
9610 return showvars(nullstr, 0, VUNSET);
9613 if (!options(0)) { /* if no parse error... */
9616 if (*argptr != NULL) {
9624 #if ENABLE_ASH_RANDOM_SUPPORT
9625 /* Roughly copied from bash.. */
9627 change_random(const char *value)
9629 if (value == NULL) {
9630 /* "get", generate */
9633 rseed = rseed * 1103515245 + 12345;
9634 sprintf(buf, "%d", (unsigned int)((rseed & 32767)));
9635 /* set without recursion */
9636 setvar(vrandom.text, buf, VNOFUNC);
9637 vrandom.flags &= ~VNOFUNC;
9640 rseed = strtoul(value, (char **)NULL, 10);
9645 #if ENABLE_ASH_GETOPTS
9647 getopts(char *optstr, char *optvar, char **optfirst, int *param_optind, int *optoff)
9656 if (*param_optind < 1)
9658 optnext = optfirst + *param_optind - 1;
9660 if (*param_optind <= 1 || *optoff < 0 || (int)strlen(optnext[-1]) < *optoff)
9663 p = optnext[-1] + *optoff;
9664 if (p == NULL || *p == '\0') {
9665 /* Current word is done, advance */
9667 if (p == NULL || *p != '-' || *++p == '\0') {
9674 if (LONE_DASH(p)) /* check for "--" */
9679 for (q = optstr; *q != c; ) {
9681 if (optstr[0] == ':') {
9684 err |= setvarsafe("OPTARG", s, 0);
9686 fprintf(stderr, "Illegal option -%c\n", c);
9697 if (*p == '\0' && (p = *optnext) == NULL) {
9698 if (optstr[0] == ':') {
9701 err |= setvarsafe("OPTARG", s, 0);
9704 fprintf(stderr, "No arg for -%c option\n", c);
9713 err |= setvarsafe("OPTARG", p, 0);
9716 err |= setvarsafe("OPTARG", nullstr, 0);
9718 *optoff = p ? p - *(optnext - 1) : -1;
9719 *param_optind = optnext - optfirst + 1;
9720 fmtstr(s, sizeof(s), "%d", *param_optind);
9721 err |= setvarsafe("OPTIND", s, VNOFUNC);
9724 err |= setvarsafe(optvar, s, 0);
9728 flush_stdout_stderr();
9729 raise_exception(EXERROR);
9735 * The getopts builtin. Shellparam.optnext points to the next argument
9736 * to be processed. Shellparam.optptr points to the next character to
9737 * be processed in the current argument. If shellparam.optnext is NULL,
9738 * then it's the first time getopts has been called.
9741 getoptscmd(int argc, char **argv)
9746 ash_msg_and_raise_error("usage: getopts optstring var [arg]");
9748 optbase = shellparam.p;
9749 if (shellparam.optind > shellparam.nparam + 1) {
9750 shellparam.optind = 1;
9751 shellparam.optoff = -1;
9755 if (shellparam.optind > argc - 2) {
9756 shellparam.optind = 1;
9757 shellparam.optoff = -1;
9761 return getopts(argv[1], argv[2], optbase, &shellparam.optind,
9762 &shellparam.optoff);
9764 #endif /* ASH_GETOPTS */
9767 /* ============ Shell parser */
9770 * NEOF is returned by parsecmd when it encounters an end of file. It
9771 * must be distinct from NULL, so we use the address of a variable that
9772 * happens to be handy.
9774 static smallint tokpushback; /* last token pushed back */
9775 #define NEOF ((union node *)&tokpushback)
9776 static smallint parsebackquote; /* nonzero if we are inside backquotes */
9777 static int lasttoken; /* last token read */
9778 static char *wordtext; /* text of last word returned by readtoken */
9779 static struct nodelist *backquotelist;
9780 static union node *redirnode;
9781 static struct heredoc *heredoc;
9782 static smallint quoteflag; /* set if (part of) last token was quoted */
9784 static void raise_error_syntax(const char *) ATTRIBUTE_NORETURN;
9786 raise_error_syntax(const char *msg)
9788 ash_msg_and_raise_error("syntax error: %s", msg);
9793 * Called when an unexpected token is read during the parse. The argument
9794 * is the token that is expected, or -1 if more than one type of token can
9795 * occur at this point.
9797 static void raise_error_unexpected_syntax(int) ATTRIBUTE_NORETURN;
9799 raise_error_unexpected_syntax(int token)
9804 l = sprintf(msg, "%s unexpected", tokname(lasttoken));
9806 sprintf(msg + l, " (expecting %s)", tokname(token));
9807 raise_error_syntax(msg);
9811 #define EOFMARKLEN 79
9814 struct heredoc *next; /* next here document in list */
9815 union node *here; /* redirection node */
9816 char *eofmark; /* string indicating end of input */
9817 int striptabs; /* if set, strip leading tabs */
9820 static struct heredoc *heredoclist; /* list of here documents to read */
9822 /* parsing is heavily cross-recursive, need these forward decls */
9823 static union node *andor(void);
9824 static union node *pipeline(void);
9825 static union node *parse_command(void);
9826 static void parseheredoc(void);
9827 static char peektoken(void);
9828 static int readtoken(void);
9833 union node *n1, *n2, *n3;
9836 checkkwd = CHKNL | CHKKWD | CHKALIAS;
9837 if (nlflag == 2 && peektoken())
9843 if (tok == TBACKGND) {
9844 if (n2->type == NPIPE) {
9845 n2->npipe.backgnd = 1;
9847 if (n2->type != NREDIR) {
9848 n3 = stzalloc(sizeof(struct nredir));
9850 /*n3->nredir.redirect = NULL; - stzalloc did it */
9853 n2->type = NBACKGND;
9859 n3 = stzalloc(sizeof(struct nbinary));
9861 n3->nbinary.ch1 = n1;
9862 n3->nbinary.ch2 = n2;
9878 checkkwd = CHKNL | CHKKWD | CHKALIAS;
9886 pungetc(); /* push back EOF on input */
9890 raise_error_unexpected_syntax(-1);
9900 union node *n1, *n2, *n3;
9908 } else if (t == TOR) {
9914 checkkwd = CHKNL | CHKKWD | CHKALIAS;
9916 n3 = stzalloc(sizeof(struct nbinary));
9918 n3->nbinary.ch1 = n1;
9919 n3->nbinary.ch2 = n2;
9927 union node *n1, *n2, *pipenode;
9928 struct nodelist *lp, *prev;
9932 TRACE(("pipeline: entered\n"));
9933 if (readtoken() == TNOT) {
9935 checkkwd = CHKKWD | CHKALIAS;
9938 n1 = parse_command();
9939 if (readtoken() == TPIPE) {
9940 pipenode = stzalloc(sizeof(struct npipe));
9941 pipenode->type = NPIPE;
9942 /*pipenode->npipe.backgnd = 0; - stzalloc did it */
9943 lp = stzalloc(sizeof(struct nodelist));
9944 pipenode->npipe.cmdlist = lp;
9948 lp = stzalloc(sizeof(struct nodelist));
9949 checkkwd = CHKNL | CHKKWD | CHKALIAS;
9950 lp->n = parse_command();
9952 } while (readtoken() == TPIPE);
9958 n2 = stzalloc(sizeof(struct nnot));
9971 n = stzalloc(sizeof(struct narg));
9973 /*n->narg.next = NULL; - stzalloc did it */
9974 n->narg.text = wordtext;
9975 n->narg.backquote = backquotelist;
9980 fixredir(union node *n, const char *text, int err)
9982 TRACE(("Fix redir %s %d\n", text, err));
9984 n->ndup.vname = NULL;
9986 if (isdigit(text[0]) && text[1] == '\0')
9987 n->ndup.dupfd = text[0] - '0';
9988 else if (LONE_DASH(text))
9992 raise_error_syntax("Bad fd number");
9993 n->ndup.vname = makename();
9998 * Returns true if the text contains nothing to expand (no dollar signs
10002 noexpand(char *text)
10008 while ((c = *p++) != '\0') {
10009 if (c == CTLQUOTEMARK)
10013 else if (SIT(c, BASESYNTAX) == CCTL)
10022 union node *n = redirnode;
10024 if (readtoken() != TWORD)
10025 raise_error_unexpected_syntax(-1);
10026 if (n->type == NHERE) {
10027 struct heredoc *here = heredoc;
10031 if (quoteflag == 0)
10033 TRACE(("Here document %d\n", n->type));
10034 if (!noexpand(wordtext) || (i = strlen(wordtext)) == 0 || i > EOFMARKLEN)
10035 raise_error_syntax("Illegal eof marker for << redirection");
10036 rmescapes(wordtext);
10037 here->eofmark = wordtext;
10039 if (heredoclist == NULL)
10040 heredoclist = here;
10042 for (p = heredoclist; p->next; p = p->next)
10046 } else if (n->type == NTOFD || n->type == NFROMFD) {
10047 fixredir(n, wordtext, 0);
10049 n->nfile.fname = makename();
10053 static union node *
10056 union node *args, **app;
10057 union node *n = NULL;
10058 union node *vars, **vpp;
10059 union node **rpp, *redir;
10061 #if ENABLE_ASH_BASH_COMPAT
10062 smallint double_brackets_flag = 0;
10072 savecheckkwd = CHKALIAS;
10075 checkkwd = savecheckkwd;
10078 #if ENABLE_ASH_BASH_COMPAT
10079 case TAND: /* "&&" */
10080 case TOR: /* "||" */
10081 if (!double_brackets_flag) {
10085 wordtext = (char *) (t == TAND ? "-a" : "-o");
10088 n = stzalloc(sizeof(struct narg));
10090 /*n->narg.next = NULL; - stzalloc did it */
10091 n->narg.text = wordtext;
10092 #if ENABLE_ASH_BASH_COMPAT
10093 if (strcmp("[[", wordtext) == 0)
10094 double_brackets_flag = 1;
10095 else if (strcmp("]]", wordtext) == 0)
10096 double_brackets_flag = 0;
10098 n->narg.backquote = backquotelist;
10099 if (savecheckkwd && isassignment(wordtext)) {
10101 vpp = &n->narg.next;
10104 app = &n->narg.next;
10109 *rpp = n = redirnode;
10110 rpp = &n->nfile.next;
10111 parsefname(); /* read name of redirection file */
10114 if (args && app == &args->narg.next
10117 struct builtincmd *bcmd;
10120 /* We have a function */
10121 if (readtoken() != TRP)
10122 raise_error_unexpected_syntax(TRP);
10123 name = n->narg.text;
10124 if (!goodname(name)
10125 || ((bcmd = find_builtin(name)) && IS_BUILTIN_SPECIAL(bcmd))
10127 raise_error_syntax("Bad function name");
10130 checkkwd = CHKNL | CHKKWD | CHKALIAS;
10131 n->narg.next = parse_command();
10144 n = stzalloc(sizeof(struct ncmd));
10146 n->ncmd.args = args;
10147 n->ncmd.assign = vars;
10148 n->ncmd.redirect = redir;
10152 static union node *
10153 parse_command(void)
10155 union node *n1, *n2;
10156 union node *ap, **app;
10157 union node *cp, **cpp;
10158 union node *redir, **rpp;
10165 switch (readtoken()) {
10167 raise_error_unexpected_syntax(-1);
10170 n1 = stzalloc(sizeof(struct nif));
10172 n1->nif.test = list(0);
10173 if (readtoken() != TTHEN)
10174 raise_error_unexpected_syntax(TTHEN);
10175 n1->nif.ifpart = list(0);
10177 while (readtoken() == TELIF) {
10178 n2->nif.elsepart = stzalloc(sizeof(struct nif));
10179 n2 = n2->nif.elsepart;
10181 n2->nif.test = list(0);
10182 if (readtoken() != TTHEN)
10183 raise_error_unexpected_syntax(TTHEN);
10184 n2->nif.ifpart = list(0);
10186 if (lasttoken == TELSE)
10187 n2->nif.elsepart = list(0);
10189 n2->nif.elsepart = NULL;
10197 n1 = stzalloc(sizeof(struct nbinary));
10198 n1->type = (lasttoken == TWHILE) ? NWHILE : NUNTIL;
10199 n1->nbinary.ch1 = list(0);
10202 TRACE(("expecting DO got %s %s\n", tokname(got),
10203 got == TWORD ? wordtext : ""));
10204 raise_error_unexpected_syntax(TDO);
10206 n1->nbinary.ch2 = list(0);
10211 if (readtoken() != TWORD || quoteflag || ! goodname(wordtext))
10212 raise_error_syntax("Bad for loop variable");
10213 n1 = stzalloc(sizeof(struct nfor));
10215 n1->nfor.var = wordtext;
10216 checkkwd = CHKKWD | CHKALIAS;
10217 if (readtoken() == TIN) {
10219 while (readtoken() == TWORD) {
10220 n2 = stzalloc(sizeof(struct narg));
10222 /*n2->narg.next = NULL; - stzalloc did it */
10223 n2->narg.text = wordtext;
10224 n2->narg.backquote = backquotelist;
10226 app = &n2->narg.next;
10229 n1->nfor.args = ap;
10230 if (lasttoken != TNL && lasttoken != TSEMI)
10231 raise_error_unexpected_syntax(-1);
10233 n2 = stzalloc(sizeof(struct narg));
10235 /*n2->narg.next = NULL; - stzalloc did it */
10236 n2->narg.text = (char *)dolatstr;
10237 /*n2->narg.backquote = NULL;*/
10238 n1->nfor.args = n2;
10240 * Newline or semicolon here is optional (but note
10241 * that the original Bourne shell only allowed NL).
10243 if (lasttoken != TNL && lasttoken != TSEMI)
10246 checkkwd = CHKNL | CHKKWD | CHKALIAS;
10247 if (readtoken() != TDO)
10248 raise_error_unexpected_syntax(TDO);
10249 n1->nfor.body = list(0);
10253 n1 = stzalloc(sizeof(struct ncase));
10255 if (readtoken() != TWORD)
10256 raise_error_unexpected_syntax(TWORD);
10257 n1->ncase.expr = n2 = stzalloc(sizeof(struct narg));
10259 /*n2->narg.next = NULL; - stzalloc did it */
10260 n2->narg.text = wordtext;
10261 n2->narg.backquote = backquotelist;
10263 checkkwd = CHKKWD | CHKALIAS;
10264 } while (readtoken() == TNL);
10265 if (lasttoken != TIN)
10266 raise_error_unexpected_syntax(TIN);
10267 cpp = &n1->ncase.cases;
10269 checkkwd = CHKNL | CHKKWD;
10271 while (t != TESAC) {
10272 if (lasttoken == TLP)
10274 *cpp = cp = stzalloc(sizeof(struct nclist));
10276 app = &cp->nclist.pattern;
10278 *app = ap = stzalloc(sizeof(struct narg));
10280 /*ap->narg.next = NULL; - stzalloc did it */
10281 ap->narg.text = wordtext;
10282 ap->narg.backquote = backquotelist;
10283 if (readtoken() != TPIPE)
10285 app = &ap->narg.next;
10288 //ap->narg.next = NULL;
10289 if (lasttoken != TRP)
10290 raise_error_unexpected_syntax(TRP);
10291 cp->nclist.body = list(2);
10293 cpp = &cp->nclist.next;
10295 checkkwd = CHKNL | CHKKWD;
10299 raise_error_unexpected_syntax(TENDCASE);
10306 n1 = stzalloc(sizeof(struct nredir));
10307 n1->type = NSUBSHELL;
10308 n1->nredir.n = list(0);
10309 /*n1->nredir.redirect = NULL; - stzalloc did it */
10319 return simplecmd();
10322 if (readtoken() != t)
10323 raise_error_unexpected_syntax(t);
10326 /* Now check for redirection which may follow command */
10327 checkkwd = CHKKWD | CHKALIAS;
10329 while (readtoken() == TREDIR) {
10330 *rpp = n2 = redirnode;
10331 rpp = &n2->nfile.next;
10337 if (n1->type != NSUBSHELL) {
10338 n2 = stzalloc(sizeof(struct nredir));
10343 n1->nredir.redirect = redir;
10349 * If eofmark is NULL, read a word or a redirection symbol. If eofmark
10350 * is not NULL, read a here document. In the latter case, eofmark is the
10351 * word which marks the end of the document and striptabs is true if
10352 * leading tabs should be stripped from the document. The argument firstc
10353 * is the first character of the input token or document.
10355 * Because C does not have internal subroutines, I have simulated them
10356 * using goto's to implement the subroutine linkage. The following macros
10357 * will run code that appears at the end of readtoken1.
10360 #define CHECKEND() {goto checkend; checkend_return:;}
10361 #define PARSEREDIR() {goto parseredir; parseredir_return:;}
10362 #define PARSESUB() {goto parsesub; parsesub_return:;}
10363 #define PARSEBACKQOLD() {oldstyle = 1; goto parsebackq; parsebackq_oldreturn:;}
10364 #define PARSEBACKQNEW() {oldstyle = 0; goto parsebackq; parsebackq_newreturn:;}
10365 #define PARSEARITH() {goto parsearith; parsearith_return:;}
10368 readtoken1(int firstc, int syntax, char *eofmark, int striptabs)
10370 /* NB: syntax parameter fits into smallint */
10374 char line[EOFMARKLEN + 1];
10375 struct nodelist *bqlist;
10379 smallint prevsyntax; /* syntax before arithmetic */
10380 #if ENABLE_ASH_EXPAND_PRMT
10381 smallint pssyntax; /* we are expanding a prompt string */
10383 int varnest; /* levels of variables expansion */
10384 int arinest; /* levels of arithmetic expansion */
10385 int parenlevel; /* levels of parens in arithmetic */
10386 int dqvarnest; /* levels of variables expansion within double quotes */
10389 /* Avoid longjmp clobbering */
10395 (void) &parenlevel;
10398 (void) &prevsyntax;
10401 startlinno = plinno;
10406 #if ENABLE_ASH_EXPAND_PRMT
10407 pssyntax = (syntax == PSSYNTAX);
10411 dblquote = (syntax == DQSYNTAX);
10417 STARTSTACKSTR(out);
10418 loop: { /* for each line, until end of word */
10419 CHECKEND(); /* set c to PEOF if at end of here document */
10420 for (;;) { /* until end of line or end of word */
10421 CHECKSTRSPACE(4, out); /* permit 4 calls to USTPUTC */
10422 switch (SIT(c, syntax)) {
10423 case CNL: /* '\n' */
10424 if (syntax == BASESYNTAX)
10425 goto endword; /* exit outer loop */
10431 goto loop; /* continue outer loop */
10436 if (eofmark == NULL || dblquote)
10437 USTPUTC(CTLESC, out);
10440 case CBACK: /* backslash */
10443 USTPUTC(CTLESC, out);
10444 USTPUTC('\\', out);
10446 } else if (c == '\n') {
10450 #if ENABLE_ASH_EXPAND_PRMT
10451 if (c == '$' && pssyntax) {
10452 USTPUTC(CTLESC, out);
10453 USTPUTC('\\', out);
10457 c != '\\' && c != '`' &&
10462 USTPUTC(CTLESC, out);
10463 USTPUTC('\\', out);
10465 if (SIT(c, SQSYNTAX) == CCTL)
10466 USTPUTC(CTLESC, out);
10474 if (eofmark == NULL) {
10475 USTPUTC(CTLQUOTEMARK, out);
10483 if (eofmark != NULL && arinest == 0
10488 if (dqvarnest == 0) {
10489 syntax = BASESYNTAX;
10496 case CVAR: /* '$' */
10497 PARSESUB(); /* parse substitution */
10499 case CENDVAR: /* '}' */
10502 if (dqvarnest > 0) {
10505 USTPUTC(CTLENDVAR, out);
10510 #if ENABLE_ASH_MATH_SUPPORT
10511 case CLP: /* '(' in arithmetic */
10515 case CRP: /* ')' in arithmetic */
10516 if (parenlevel > 0) {
10520 if (pgetc() == ')') {
10521 if (--arinest == 0) {
10522 USTPUTC(CTLENDARI, out);
10523 syntax = prevsyntax;
10524 dblquote = (syntax == DQSYNTAX);
10529 * unbalanced parens
10530 * (don't 2nd guess - no error)
10538 case CBQUOTE: /* '`' */
10542 goto endword; /* exit outer loop */
10547 goto endword; /* exit outer loop */
10548 #if ENABLE_ASH_ALIAS
10558 #if ENABLE_ASH_MATH_SUPPORT
10559 if (syntax == ARISYNTAX)
10560 raise_error_syntax("Missing '))'");
10562 if (syntax != BASESYNTAX && !parsebackquote && eofmark == NULL)
10563 raise_error_syntax("Unterminated quoted string");
10564 if (varnest != 0) {
10565 startlinno = plinno;
10567 raise_error_syntax("Missing '}'");
10569 USTPUTC('\0', out);
10570 len = out - (char *)stackblock();
10571 out = stackblock();
10572 if (eofmark == NULL) {
10573 if ((c == '>' || c == '<')
10576 && (*out == '\0' || isdigit(*out))) {
10578 return lasttoken = TREDIR;
10583 quoteflag = quotef;
10584 backquotelist = bqlist;
10585 grabstackblock(len);
10589 /* end of readtoken routine */
10592 * Check to see whether we are at the end of the here document. When this
10593 * is called, c is set to the first character of the next input line. If
10594 * we are at the end of the here document, this routine sets the c to PEOF.
10598 #if ENABLE_ASH_ALIAS
10604 while (c == '\t') {
10608 if (c == *eofmark) {
10609 if (pfgets(line, sizeof(line)) != NULL) {
10613 for (q = eofmark + 1; *q && *p == *q; p++, q++)
10615 if (*p == '\n' && *q == '\0') {
10618 needprompt = doprompt;
10620 pushstring(line, NULL);
10625 goto checkend_return;
10629 * Parse a redirection operator. The variable "out" points to a string
10630 * specifying the fd to be redirected. The variable "c" contains the
10631 * first character of the redirection operator.
10637 np = stzalloc(sizeof(struct nfile));
10642 np->type = NAPPEND;
10644 np->type = NCLOBBER;
10651 } else { /* c == '<' */
10652 /*np->nfile.fd = 0; - stzalloc did it */
10656 if (sizeof(struct nfile) != sizeof(struct nhere)) {
10657 np = stzalloc(sizeof(struct nhere));
10658 /*np->nfile.fd = 0; - stzalloc did it */
10661 heredoc = stzalloc(sizeof(struct heredoc));
10662 heredoc->here = np;
10665 heredoc->striptabs = 1;
10667 /*heredoc->striptabs = 0; - stzalloc did it */
10673 np->type = NFROMFD;
10677 np->type = NFROMTO;
10687 np->nfile.fd = fd - '0';
10689 goto parseredir_return;
10693 * Parse a substitution. At this point, we have read the dollar sign
10694 * and nothing else.
10697 /* is_special(c) evaluates to 1 for c in "!#$*-0123456789?@"; 0 otherwise
10698 * (assuming ascii char codes, as the original implementation did) */
10699 #define is_special(c) \
10700 ((((unsigned int)c) - 33 < 32) \
10701 && ((0xc1ff920dUL >> (((unsigned int)c) - 33)) & 1))
10707 static const char types[] ALIGN1 = "}-+?=";
10711 c <= PEOA_OR_PEOF ||
10712 (c != '(' && c != '{' && !is_name(c) && !is_special(c))
10716 } else if (c == '(') { /* $(command) or $((arith)) */
10717 if (pgetc() == '(') {
10718 #if ENABLE_ASH_MATH_SUPPORT
10721 raise_error_syntax("you disabled math support for $((arith)) syntax");
10728 USTPUTC(CTLVAR, out);
10729 typeloc = out - (char *)stackblock();
10730 USTPUTC(VSNORMAL, out);
10731 subtype = VSNORMAL;
10739 subtype = VSLENGTH;
10743 if (c > PEOA_OR_PEOF && is_name(c)) {
10747 } while (c > PEOA_OR_PEOF && is_in_name(c));
10748 } else if (isdigit(c)) {
10752 } while (isdigit(c));
10753 } else if (is_special(c)) {
10757 badsub: raise_error_syntax("Bad substitution");
10761 if (subtype == 0) {
10765 #if ENABLE_ASH_BASH_COMPAT
10766 if (c == ':' || c == '$' || isdigit(c)) {
10768 subtype = VSSUBSTR;
10775 p = strchr(types, c);
10778 subtype = p - types + VSNORMAL;
10783 subtype = c == '#' ? VSTRIMLEFT : VSTRIMRIGHT;
10791 #if ENABLE_ASH_BASH_COMPAT
10793 subtype = VSREPLACE;
10796 subtype++; /* VSREPLACEALL */
10805 if (dblquote || arinest)
10807 *((char *)stackblock() + typeloc) = subtype | flags;
10808 if (subtype != VSNORMAL) {
10810 if (dblquote || arinest) {
10815 goto parsesub_return;
10819 * Called to parse command substitutions. Newstyle is set if the command
10820 * is enclosed inside $(...); nlpp is a pointer to the head of the linked
10821 * list of commands (passed by reference), and savelen is the number of
10822 * characters on the top of the stack which must be preserved.
10825 struct nodelist **nlpp;
10828 char *volatile str;
10829 struct jmploc jmploc;
10830 struct jmploc *volatile savehandler;
10832 smallint saveprompt = 0;
10835 (void) &saveprompt;
10837 savepbq = parsebackquote;
10838 if (setjmp(jmploc.loc)) {
10840 parsebackquote = 0;
10841 exception_handler = savehandler;
10842 longjmp(exception_handler->loc, 1);
10846 savelen = out - (char *)stackblock();
10848 str = ckmalloc(savelen);
10849 memcpy(str, stackblock(), savelen);
10851 savehandler = exception_handler;
10852 exception_handler = &jmploc;
10855 /* We must read until the closing backquote, giving special
10856 treatment to some slashes, and then push the string and
10857 reread it as input, interpreting it normally. */
10864 STARTSTACKSTR(pout);
10881 * If eating a newline, avoid putting
10882 * the newline into the new character
10883 * stream (via the STPUTC after the
10888 if (pc != '\\' && pc != '`' && pc != '$'
10889 && (!dblquote || pc != '"'))
10890 STPUTC('\\', pout);
10891 if (pc > PEOA_OR_PEOF) {
10897 #if ENABLE_ASH_ALIAS
10900 startlinno = plinno;
10901 raise_error_syntax("EOF in backquote substitution");
10905 needprompt = doprompt;
10914 STPUTC('\0', pout);
10915 psavelen = pout - (char *)stackblock();
10916 if (psavelen > 0) {
10917 pstr = grabstackstr(pout);
10918 setinputstring(pstr);
10923 nlpp = &(*nlpp)->next;
10924 *nlpp = stzalloc(sizeof(**nlpp));
10925 /* (*nlpp)->next = NULL; - stzalloc did it */
10926 parsebackquote = oldstyle;
10929 saveprompt = doprompt;
10936 doprompt = saveprompt;
10937 else if (readtoken() != TRP)
10938 raise_error_unexpected_syntax(TRP);
10943 * Start reading from old file again, ignoring any pushed back
10944 * tokens left from the backquote parsing
10949 while (stackblocksize() <= savelen)
10951 STARTSTACKSTR(out);
10953 memcpy(out, str, savelen);
10954 STADJUST(savelen, out);
10960 parsebackquote = savepbq;
10961 exception_handler = savehandler;
10962 if (arinest || dblquote)
10963 USTPUTC(CTLBACKQ | CTLQUOTE, out);
10965 USTPUTC(CTLBACKQ, out);
10967 goto parsebackq_oldreturn;
10968 goto parsebackq_newreturn;
10971 #if ENABLE_ASH_MATH_SUPPORT
10973 * Parse an arithmetic expansion (indicate start of one and set state)
10976 if (++arinest == 1) {
10977 prevsyntax = syntax;
10978 syntax = ARISYNTAX;
10979 USTPUTC(CTLARI, out);
10986 * we collapse embedded arithmetic expansion to
10987 * parenthesis, which should be equivalent
10991 goto parsearith_return;
10995 } /* end of readtoken */
10998 * Read the next input token.
10999 * If the token is a word, we set backquotelist to the list of cmds in
11000 * backquotes. We set quoteflag to true if any part of the word was
11002 * If the token is TREDIR, then we set redirnode to a structure containing
11004 * In all cases, the variable startlinno is set to the number of the line
11005 * on which the token starts.
11007 * [Change comment: here documents and internal procedures]
11008 * [Readtoken shouldn't have any arguments. Perhaps we should make the
11009 * word parsing code into a separate routine. In this case, readtoken
11010 * doesn't need to have any internal procedures, but parseword does.
11011 * We could also make parseoperator in essence the main routine, and
11012 * have parseword (readtoken1?) handle both words and redirection.]
11014 #define NEW_xxreadtoken
11015 #ifdef NEW_xxreadtoken
11016 /* singles must be first! */
11017 static const char xxreadtoken_chars[7] ALIGN1 = {
11018 '\n', '(', ')', '&', '|', ';', 0
11021 static const char xxreadtoken_tokens[] ALIGN1 = {
11022 TNL, TLP, TRP, /* only single occurrence allowed */
11023 TBACKGND, TPIPE, TSEMI, /* if single occurrence */
11024 TEOF, /* corresponds to trailing nul */
11025 TAND, TOR, TENDCASE /* if double occurrence */
11028 #define xxreadtoken_doubles \
11029 (sizeof(xxreadtoken_tokens) - sizeof(xxreadtoken_chars))
11030 #define xxreadtoken_singles \
11031 (sizeof(xxreadtoken_chars) - xxreadtoken_doubles - 1)
11045 startlinno = plinno;
11046 for (;;) { /* until token or start of word found */
11049 if ((c != ' ') && (c != '\t')
11050 #if ENABLE_ASH_ALIAS
11055 while ((c = pgetc()) != '\n' && c != PEOF)
11058 } else if (c == '\\') {
11059 if (pgetc() != '\n') {
11063 startlinno = ++plinno;
11068 = xxreadtoken_chars + sizeof(xxreadtoken_chars) - 1;
11073 needprompt = doprompt;
11076 p = strchr(xxreadtoken_chars, c);
11079 return readtoken1(c, BASESYNTAX, (char *) NULL, 0);
11082 if ((size_t)(p - xxreadtoken_chars) >= xxreadtoken_singles) {
11083 if (pgetc() == *p) { /* double occurrence? */
11084 p += xxreadtoken_doubles + 1;
11090 return lasttoken = xxreadtoken_tokens[p - xxreadtoken_chars];
11096 #define RETURN(token) return lasttoken = token
11109 startlinno = plinno;
11110 for (;;) { /* until token or start of word found */
11113 case ' ': case '\t':
11114 #if ENABLE_ASH_ALIAS
11119 while ((c = pgetc()) != '\n' && c != PEOF)
11124 if (pgetc() == '\n') {
11125 startlinno = ++plinno;
11134 needprompt = doprompt;
11139 if (pgetc() == '&')
11144 if (pgetc() == '|')
11149 if (pgetc() == ';')
11162 return readtoken1(c, BASESYNTAX, (char *)NULL, 0);
11165 #endif /* NEW_xxreadtoken */
11172 smallint alreadyseen = tokpushback;
11175 #if ENABLE_ASH_ALIAS
11184 if (checkkwd & CHKNL) {
11191 if (t != TWORD || quoteflag) {
11196 * check for keywords
11198 if (checkkwd & CHKKWD) {
11199 const char *const *pp;
11201 pp = findkwd(wordtext);
11203 lasttoken = t = pp - tokname_array;
11204 TRACE(("keyword %s recognized\n", tokname(t)));
11209 if (checkkwd & CHKALIAS) {
11210 #if ENABLE_ASH_ALIAS
11212 ap = lookupalias(wordtext, 1);
11215 pushstring(ap->val, ap);
11225 TRACE(("token %s %s\n", tokname(t), t == TWORD ? wordtext : ""));
11227 TRACE(("reread token %s %s\n", tokname(t), t == TWORD ? wordtext : ""));
11239 return tokname_array[t][0];
11243 * Read and parse a command. Returns NEOF on end of file. (NULL is a
11244 * valid parse tree indicating a blank line.)
11246 static union node *
11247 parsecmd(int interact)
11252 doprompt = interact;
11254 setprompt(doprompt);
11266 * Input any here documents.
11271 struct heredoc *here;
11274 here = heredoclist;
11275 heredoclist = NULL;
11281 readtoken1(pgetc(), here->here->type == NHERE? SQSYNTAX : DQSYNTAX,
11282 here->eofmark, here->striptabs);
11283 n = stzalloc(sizeof(struct narg));
11284 n->narg.type = NARG;
11285 /*n->narg.next = NULL; - stzalloc did it */
11286 n->narg.text = wordtext;
11287 n->narg.backquote = backquotelist;
11288 here->here->nhere.doc = n;
11295 * called by editline -- any expansions to the prompt should be added here.
11297 #if ENABLE_ASH_EXPAND_PRMT
11298 static const char *
11299 expandstr(const char *ps)
11303 /* XXX Fix (char *) cast. */
11304 setinputstring((char *)ps);
11305 readtoken1(pgetc(), PSSYNTAX, nullstr, 0);
11308 n.narg.type = NARG;
11309 n.narg.next = NULL;
11310 n.narg.text = wordtext;
11311 n.narg.backquote = backquotelist;
11313 expandarg(&n, NULL, 0);
11314 return stackblock();
11319 * Execute a command or commands contained in a string.
11322 evalstring(char *s, int mask)
11325 struct stackmark smark;
11329 setstackmark(&smark);
11332 while ((n = parsecmd(0)) != NEOF) {
11334 popstackmark(&smark);
11347 * The eval command.
11350 evalcmd(int argc ATTRIBUTE_UNUSED, char **argv)
11359 STARTSTACKSTR(concat);
11361 concat = stack_putstr(p, concat);
11365 STPUTC(' ', concat);
11367 STPUTC('\0', concat);
11368 p = grabstackstr(concat);
11370 evalstring(p, ~SKIPEVAL);
11377 * Read and execute commands. "Top" is nonzero for the top level command
11378 * loop; it turns on prompting if the shell is interactive.
11384 struct stackmark smark;
11388 TRACE(("cmdloop(%d) called\n", top));
11392 setstackmark(&smark);
11395 showjobs(stderr, SHOW_CHANGED);
11398 if (iflag && top) {
11400 #if ENABLE_ASH_MAIL
11404 n = parsecmd(inter);
11405 /* showtree(n); DEBUG */
11407 if (!top || numeof >= 50)
11409 if (!stoppedjobs()) {
11412 out2str("\nUse \"exit\" to leave shell.\n");
11415 } else if (nflag == 0) {
11416 /* job_warning can only be 2,1,0. Here 2->1, 1/0->0 */
11421 popstackmark(&smark);
11426 return skip & SKIPEVAL;
11433 * Take commands from a file. To be compatible we should do a path
11434 * search for the file, which is necessary to find sub-commands.
11437 find_dot_file(char *name)
11440 const char *path = pathval();
11443 /* don't try this for absolute or relative paths */
11444 if (strchr(name, '/'))
11447 while ((fullname = padvance(&path, name)) != NULL) {
11448 if ((stat(fullname, &statb) == 0) && S_ISREG(statb.st_mode)) {
11450 * Don't bother freeing here, since it will
11451 * be freed by the caller.
11455 stunalloc(fullname);
11458 /* not found in the PATH */
11459 ash_msg_and_raise_error("%s: not found", name);
11464 dotcmd(int argc, char **argv)
11466 struct strlist *sp;
11467 volatile struct shparam saveparam;
11470 for (sp = cmdenviron; sp; sp = sp->next)
11471 setvareq(ckstrdup(sp->text), VSTRFIXED | VTEXTFIXED);
11473 if (argv[1]) { /* That's what SVR2 does */
11474 char *fullname = find_dot_file(argv[1]);
11477 if (argc) { /* argc > 0, argv[0] != NULL */
11478 saveparam = shellparam;
11479 shellparam.malloced = 0;
11480 shellparam.nparam = argc;
11481 shellparam.p = argv;
11484 setinputfile(fullname, INPUT_PUSH_FILE);
11485 commandname = fullname;
11490 freeparam(&shellparam);
11491 shellparam = saveparam;
11493 status = exitstatus;
11499 exitcmd(int argc ATTRIBUTE_UNUSED, char **argv)
11504 exitstatus = number(argv[1]);
11505 raise_exception(EXEXIT);
11510 * Read a file containing shell functions.
11513 readcmdfile(char *name)
11515 setinputfile(name, INPUT_PUSH_FILE);
11521 /* ============ find_command inplementation */
11524 * Resolve a command name. If you change this routine, you may have to
11525 * change the shellexec routine as well.
11528 find_command(char *name, struct cmdentry *entry, int act, const char *path)
11530 struct tblentry *cmdp;
11537 struct builtincmd *bcmd;
11539 /* If name contains a slash, don't use PATH or hash table */
11540 if (strchr(name, '/') != NULL) {
11541 entry->u.index = -1;
11542 if (act & DO_ABS) {
11543 while (stat(name, &statb) < 0) {
11545 if (errno == EINTR)
11548 entry->cmdtype = CMDUNKNOWN;
11552 entry->cmdtype = CMDNORMAL;
11556 /* #if ENABLE_FEATURE_SH_STANDALONE... moved after builtin check */
11558 updatetbl = (path == pathval());
11561 if (strstr(path, "%builtin") != NULL)
11562 act |= DO_ALTBLTIN;
11565 /* If name is in the table, check answer will be ok */
11566 cmdp = cmdlookup(name, 0);
11567 if (cmdp != NULL) {
11570 switch (cmdp->cmdtype) {
11588 } else if (cmdp->rehash == 0)
11589 /* if not invalidated by cd, we're done */
11593 /* If %builtin not in path, check for builtin next */
11594 bcmd = find_builtin(name);
11596 if (IS_BUILTIN_REGULAR(bcmd))
11597 goto builtin_success;
11598 if (act & DO_ALTPATH) {
11599 if (!(act & DO_ALTBLTIN))
11600 goto builtin_success;
11601 } else if (builtinloc <= 0) {
11602 goto builtin_success;
11606 #if ENABLE_FEATURE_SH_STANDALONE
11608 int applet_no = find_applet_by_name(name);
11609 if (applet_no >= 0) {
11610 entry->cmdtype = CMDNORMAL;
11611 entry->u.index = -2 - applet_no;
11617 /* We have to search path. */
11618 prev = -1; /* where to start */
11619 if (cmdp && cmdp->rehash) { /* doing a rehash */
11620 if (cmdp->cmdtype == CMDBUILTIN)
11623 prev = cmdp->param.index;
11629 while ((fullname = padvance(&path, name)) != NULL) {
11630 stunalloc(fullname);
11631 /* NB: code below will still use fullname
11632 * despite it being "unallocated" */
11635 if (prefix(pathopt, "builtin")) {
11637 goto builtin_success;
11640 if ((act & DO_NOFUNC)
11641 || !prefix(pathopt, "func")
11642 ) { /* ignore unimplemented options */
11646 /* if rehash, don't redo absolute path names */
11647 if (fullname[0] == '/' && idx <= prev) {
11650 TRACE(("searchexec \"%s\": no change\n", name));
11653 while (stat(fullname, &statb) < 0) {
11655 if (errno == EINTR)
11658 if (errno != ENOENT && errno != ENOTDIR)
11662 e = EACCES; /* if we fail, this will be the error */
11663 if (!S_ISREG(statb.st_mode))
11665 if (pathopt) { /* this is a %func directory */
11666 stalloc(strlen(fullname) + 1);
11667 /* NB: stalloc will return space pointed by fullname
11668 * (because we don't have any intervening allocations
11669 * between stunalloc above and this stalloc) */
11670 readcmdfile(fullname);
11671 cmdp = cmdlookup(name, 0);
11672 if (cmdp == NULL || cmdp->cmdtype != CMDFUNCTION)
11673 ash_msg_and_raise_error("%s not defined in %s", name, fullname);
11674 stunalloc(fullname);
11677 TRACE(("searchexec \"%s\" returns \"%s\"\n", name, fullname));
11679 entry->cmdtype = CMDNORMAL;
11680 entry->u.index = idx;
11684 cmdp = cmdlookup(name, 1);
11685 cmdp->cmdtype = CMDNORMAL;
11686 cmdp->param.index = idx;
11691 /* We failed. If there was an entry for this command, delete it */
11692 if (cmdp && updatetbl)
11693 delete_cmd_entry();
11695 ash_msg("%s: %s", name, errmsg(e, "not found"));
11696 entry->cmdtype = CMDUNKNOWN;
11701 entry->cmdtype = CMDBUILTIN;
11702 entry->u.cmd = bcmd;
11706 cmdp = cmdlookup(name, 1);
11707 cmdp->cmdtype = CMDBUILTIN;
11708 cmdp->param.cmd = bcmd;
11712 entry->cmdtype = cmdp->cmdtype;
11713 entry->u = cmdp->param;
11717 /* ============ trap.c */
11720 * The trap builtin.
11723 trapcmd(int argc ATTRIBUTE_UNUSED, char **argv ATTRIBUTE_UNUSED)
11732 for (signo = 0; signo < NSIG; signo++) {
11733 if (trap[signo] != NULL) {
11736 sn = get_signame(signo);
11737 out1fmt("trap -- %s %s\n",
11738 single_quote(trap[signo]), sn);
11748 signo = get_signum(*ap);
11750 ash_msg_and_raise_error("%s: bad trap", *ap);
11753 if (LONE_DASH(action))
11756 action = ckstrdup(action);
11759 trap[signo] = action;
11769 /* ============ Builtins */
11771 #if !ENABLE_FEATURE_SH_EXTRA_QUIET
11773 * Lists available builtins
11776 helpcmd(int argc ATTRIBUTE_UNUSED, char **argv ATTRIBUTE_UNUSED)
11781 out1fmt("\nBuilt-in commands:\n-------------------\n");
11782 for (col = 0, i = 0; i < ARRAY_SIZE(builtintab); i++) {
11783 col += out1fmt("%c%s", ((col == 0) ? '\t' : ' '),
11784 builtintab[i].name + 1);
11790 #if ENABLE_FEATURE_SH_STANDALONE
11792 const char *a = applet_names;
11794 col += out1fmt("%c%s", ((col == 0) ? '\t' : ' '), a);
11799 a += strlen(a) + 1;
11804 return EXIT_SUCCESS;
11806 #endif /* FEATURE_SH_EXTRA_QUIET */
11809 * The export and readonly commands.
11812 exportcmd(int argc ATTRIBUTE_UNUSED, char **argv)
11818 int flag = argv[0][0] == 'r'? VREADONLY : VEXPORT;
11820 if (nextopt("p") != 'p') {
11825 p = strchr(name, '=');
11829 vp = *findvar(hashvar(name), name);
11835 setvar(name, p, flag);
11836 } while ((name = *++aptr) != NULL);
11840 showvars(argv[0], flag, 0);
11845 * Delete a function if it exists.
11848 unsetfunc(const char *name)
11850 struct tblentry *cmdp;
11852 cmdp = cmdlookup(name, 0);
11853 if (cmdp!= NULL && cmdp->cmdtype == CMDFUNCTION)
11854 delete_cmd_entry();
11858 * The unset builtin command. We unset the function before we unset the
11859 * variable to allow a function to be unset when there is a readonly variable
11860 * with the same name.
11863 unsetcmd(int argc ATTRIBUTE_UNUSED, char **argv ATTRIBUTE_UNUSED)
11870 while ((i = nextopt("vf")) != '\0') {
11874 for (ap = argptr; *ap; ap++) {
11890 #include <sys/times.h>
11892 static const unsigned char timescmd_str[] ALIGN1 = {
11893 ' ', offsetof(struct tms, tms_utime),
11894 '\n', offsetof(struct tms, tms_stime),
11895 ' ', offsetof(struct tms, tms_cutime),
11896 '\n', offsetof(struct tms, tms_cstime),
11901 timescmd(int argc ATTRIBUTE_UNUSED, char **argv ATTRIBUTE_UNUSED)
11903 long clk_tck, s, t;
11904 const unsigned char *p;
11907 clk_tck = sysconf(_SC_CLK_TCK);
11912 t = *(clock_t *)(((char *) &buf) + p[1]);
11914 out1fmt("%ldm%ld.%.3lds%c",
11916 ((t - s * clk_tck) * 1000) / clk_tck,
11918 } while (*(p += 2));
11923 #if ENABLE_ASH_MATH_SUPPORT
11925 dash_arith(const char *s)
11931 result = arith(s, &errcode);
11934 ash_msg_and_raise_error("exponent less than 0");
11936 ash_msg_and_raise_error("divide by zero");
11938 ash_msg_and_raise_error("expression recursion loop detected");
11939 raise_error_syntax(s);
11947 * The let builtin. partial stolen from GNU Bash, the Bourne Again SHell.
11948 * Copyright (C) 1987, 1989, 1991 Free Software Foundation, Inc.
11950 * Copyright (C) 2003 Vladimir Oleynik <dzo@simtreas.ru>
11953 letcmd(int argc ATTRIBUTE_UNUSED, char **argv)
11959 ash_msg_and_raise_error("expression expected");
11961 i = dash_arith(*argv);
11966 #endif /* ASH_MATH_SUPPORT */
11969 /* ============ miscbltin.c
11971 * Miscellaneous builtins.
11976 #if defined(__GLIBC__) && __GLIBC__ == 2 && __GLIBC_MINOR__ < 1
11977 typedef enum __rlimit_resource rlim_t;
11981 * The read builtin. Options:
11982 * -r Do not interpret '\' specially
11983 * -s Turn off echo (tty only)
11984 * -n NCHARS Read NCHARS max
11985 * -p PROMPT Display PROMPT on stderr (if input is from tty)
11986 * -t SECONDS Timeout after SECONDS (tty or pipe only)
11987 * -u FD Read from given FD instead of fd 0
11988 * This uses unbuffered input, which may be avoidable in some cases.
11989 * TODO: bash also has:
11990 * -a ARRAY Read into array[0],[1],etc
11991 * -d DELIM End on DELIM char, not newline
11992 * -e Use line editing (tty only)
11995 readcmd(int argc ATTRIBUTE_UNUSED, char **argv ATTRIBUTE_UNUSED)
12008 #if ENABLE_ASH_READ_NCHARS
12009 int nchars = 0; /* if != 0, -n is in effect */
12011 struct termios tty, old_tty;
12013 #if ENABLE_ASH_READ_TIMEOUT
12014 unsigned end_ms = 0;
12015 unsigned timeout = 0;
12020 while ((i = nextopt("p:u:r"
12021 USE_ASH_READ_TIMEOUT("t:")
12022 USE_ASH_READ_NCHARS("n:s")
12026 prompt = optionarg;
12028 #if ENABLE_ASH_READ_NCHARS
12030 nchars = bb_strtou(optionarg, NULL, 10);
12031 if (nchars < 0 || errno)
12032 ash_msg_and_raise_error("invalid count");
12033 /* nchars == 0: off (bash 3.2 does this too) */
12039 #if ENABLE_ASH_READ_TIMEOUT
12041 timeout = bb_strtou(optionarg, NULL, 10);
12042 if (errno || timeout > UINT_MAX / 2048)
12043 ash_msg_and_raise_error("invalid timeout");
12045 #if 0 /* even bash have no -t N.NNN support */
12046 ts.tv_sec = bb_strtou(optionarg, &p, 10);
12048 /* EINVAL means number is ok, but not terminated by NUL */
12049 if (*p == '.' && errno == EINVAL) {
12053 ts.tv_usec = bb_strtou(p, &p2, 10);
12055 ash_msg_and_raise_error("invalid timeout");
12057 /* normalize to usec */
12059 ash_msg_and_raise_error("invalid timeout");
12060 while (scale++ < 6)
12063 } else if (ts.tv_sec < 0 || errno) {
12064 ash_msg_and_raise_error("invalid timeout");
12066 if (!(ts.tv_sec | ts.tv_usec)) { /* both are 0? */
12067 ash_msg_and_raise_error("invalid timeout");
12076 fd = bb_strtou(optionarg, NULL, 10);
12077 if (fd < 0 || errno)
12078 ash_msg_and_raise_error("invalid file descriptor");
12084 if (prompt && isatty(fd)) {
12089 ash_msg_and_raise_error("arg count");
12090 ifs = bltinlookup("IFS");
12093 #if ENABLE_ASH_READ_NCHARS
12094 tcgetattr(fd, &tty);
12096 if (nchars || silent) {
12098 tty.c_lflag &= ~ICANON;
12099 tty.c_cc[VMIN] = nchars < 256 ? nchars : 255;
12102 tty.c_lflag &= ~(ECHO | ECHOK | ECHONL);
12104 /* if tcgetattr failed, tcsetattr will fail too.
12105 * Ignoring, it's harmless. */
12106 tcsetattr(fd, TCSANOW, &tty);
12113 #if ENABLE_ASH_READ_TIMEOUT
12114 if (timeout) /* NB: ensuring end_ms is nonzero */
12115 end_ms = ((unsigned)(monotonic_us() / 1000) + timeout) | 1;
12119 #if ENABLE_ASH_READ_TIMEOUT
12121 struct pollfd pfd[1];
12123 pfd[0].events = POLLIN;
12124 timeout = end_ms - (unsigned)(monotonic_us() / 1000);
12125 if ((int)timeout <= 0 /* already late? */
12126 || safe_poll(pfd, 1, timeout) != 1 /* no? wait... */
12127 ) { /* timed out! */
12128 #if ENABLE_ASH_READ_NCHARS
12129 tcsetattr(fd, TCSANOW, &old_tty);
12135 if (nonblock_safe_read(fd, &c, 1) != 1) {
12147 if (!rflag && c == '\\') {
12153 if (startword && *ifs == ' ' && strchr(ifs, c)) {
12157 if (ap[1] != NULL && strchr(ifs, c) != NULL) {
12159 setvar(*ap, stackblock(), 0);
12168 /* end of do {} while: */
12169 #if ENABLE_ASH_READ_NCHARS
12175 #if ENABLE_ASH_READ_NCHARS
12176 tcsetattr(fd, TCSANOW, &old_tty);
12180 /* Remove trailing blanks */
12181 while ((char *)stackblock() <= --p && strchr(ifs, *p) != NULL)
12183 setvar(*ap, stackblock(), 0);
12184 while (*++ap != NULL)
12185 setvar(*ap, nullstr, 0);
12190 umaskcmd(int argc ATTRIBUTE_UNUSED, char **argv)
12192 static const char permuser[3] ALIGN1 = "ugo";
12193 static const char permmode[3] ALIGN1 = "rwx";
12194 static const short permmask[] ALIGN2 = {
12195 S_IRUSR, S_IWUSR, S_IXUSR,
12196 S_IRGRP, S_IWGRP, S_IXGRP,
12197 S_IROTH, S_IWOTH, S_IXOTH
12203 int symbolic_mode = 0;
12205 while (nextopt("S") != '\0') {
12216 if (symbolic_mode) {
12220 for (i = 0; i < 3; i++) {
12223 *p++ = permuser[i];
12225 for (j = 0; j < 3; j++) {
12226 if ((mask & permmask[3 * i + j]) == 0) {
12227 *p++ = permmode[j];
12235 out1fmt("%.4o\n", mask);
12238 if (isdigit((unsigned char) *ap)) {
12241 if (*ap >= '8' || *ap < '0')
12242 ash_msg_and_raise_error(illnum, argv[1]);
12243 mask = (mask << 3) + (*ap - '0');
12244 } while (*++ap != '\0');
12247 mask = ~mask & 0777;
12248 if (!bb_parse_mode(ap, &mask)) {
12249 ash_msg_and_raise_error("illegal mode: %s", ap);
12251 umask(~mask & 0777);
12260 * This code, originally by Doug Gwyn, Doug Kingston, Eric Gisin, and
12261 * Michael Rendell was ripped from pdksh 5.0.8 and hacked for use with
12262 * ash by J.T. Conklin.
12268 uint8_t cmd; /* RLIMIT_xxx fit into it */
12269 uint8_t factor_shift; /* shift by to get rlim_{cur,max} values */
12273 static const struct limits limits_tbl[] = {
12275 { RLIMIT_CPU, 0, 't' },
12277 #ifdef RLIMIT_FSIZE
12278 { RLIMIT_FSIZE, 9, 'f' },
12281 { RLIMIT_DATA, 10, 'd' },
12283 #ifdef RLIMIT_STACK
12284 { RLIMIT_STACK, 10, 's' },
12287 { RLIMIT_CORE, 9, 'c' },
12290 { RLIMIT_RSS, 10, 'm' },
12292 #ifdef RLIMIT_MEMLOCK
12293 { RLIMIT_MEMLOCK, 10, 'l' },
12295 #ifdef RLIMIT_NPROC
12296 { RLIMIT_NPROC, 0, 'p' },
12298 #ifdef RLIMIT_NOFILE
12299 { RLIMIT_NOFILE, 0, 'n' },
12302 { RLIMIT_AS, 10, 'v' },
12304 #ifdef RLIMIT_LOCKS
12305 { RLIMIT_LOCKS, 0, 'w' },
12308 static const char limits_name[] =
12310 "time(seconds)" "\0"
12312 #ifdef RLIMIT_FSIZE
12313 "file(blocks)" "\0"
12318 #ifdef RLIMIT_STACK
12322 "coredump(blocks)" "\0"
12327 #ifdef RLIMIT_MEMLOCK
12328 "locked memory(kb)" "\0"
12330 #ifdef RLIMIT_NPROC
12333 #ifdef RLIMIT_NOFILE
12339 #ifdef RLIMIT_LOCKS
12344 enum limtype { SOFT = 0x1, HARD = 0x2 };
12347 printlim(enum limtype how, const struct rlimit *limit,
12348 const struct limits *l)
12352 val = limit->rlim_max;
12354 val = limit->rlim_cur;
12356 if (val == RLIM_INFINITY)
12357 out1fmt("unlimited\n");
12359 val >>= l->factor_shift;
12360 out1fmt("%lld\n", (long long) val);
12365 ulimitcmd(int argc ATTRIBUTE_UNUSED, char **argv ATTRIBUTE_UNUSED)
12369 enum limtype how = SOFT | HARD;
12370 const struct limits *l;
12373 struct rlimit limit;
12376 while ((optc = nextopt("HSa"
12380 #ifdef RLIMIT_FSIZE
12386 #ifdef RLIMIT_STACK
12395 #ifdef RLIMIT_MEMLOCK
12398 #ifdef RLIMIT_NPROC
12401 #ifdef RLIMIT_NOFILE
12407 #ifdef RLIMIT_LOCKS
12425 for (l = limits_tbl; l->option != what; l++)
12428 set = *argptr ? 1 : 0;
12432 if (all || argptr[1])
12433 ash_msg_and_raise_error("too many arguments");
12434 if (strncmp(p, "unlimited\n", 9) == 0)
12435 val = RLIM_INFINITY;
12439 while ((c = *p++) >= '0' && c <= '9') {
12440 val = (val * 10) + (long)(c - '0');
12441 // val is actually 'unsigned long int' and can't get < 0
12442 if (val < (rlim_t) 0)
12446 ash_msg_and_raise_error("bad number");
12447 val <<= l->factor_shift;
12451 const char *lname = limits_name;
12452 for (l = limits_tbl; l != &limits_tbl[ARRAY_SIZE(limits_tbl)]; l++) {
12453 getrlimit(l->cmd, &limit);
12454 out1fmt("%-20s ", lname);
12455 lname += strlen(lname) + 1;
12456 printlim(how, &limit, l);
12461 getrlimit(l->cmd, &limit);
12464 limit.rlim_max = val;
12466 limit.rlim_cur = val;
12467 if (setrlimit(l->cmd, &limit) < 0)
12468 ash_msg_and_raise_error("error setting limit (%m)");
12470 printlim(how, &limit, l);
12476 /* ============ Math support */
12478 #if ENABLE_ASH_MATH_SUPPORT
12480 /* Copyright (c) 2001 Aaron Lehmann <aaronl@vitelus.com>
12482 Permission is hereby granted, free of charge, to any person obtaining
12483 a copy of this software and associated documentation files (the
12484 "Software"), to deal in the Software without restriction, including
12485 without limitation the rights to use, copy, modify, merge, publish,
12486 distribute, sublicense, and/or sell copies of the Software, and to
12487 permit persons to whom the Software is furnished to do so, subject to
12488 the following conditions:
12490 The above copyright notice and this permission notice shall be
12491 included in all copies or substantial portions of the Software.
12493 THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
12494 EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
12495 MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
12496 IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
12497 CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
12498 TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
12499 SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
12502 /* This is my infix parser/evaluator. It is optimized for size, intended
12503 * as a replacement for yacc-based parsers. However, it may well be faster
12504 * than a comparable parser written in yacc. The supported operators are
12505 * listed in #defines below. Parens, order of operations, and error handling
12506 * are supported. This code is thread safe. The exact expression format should
12507 * be that which POSIX specifies for shells. */
12509 /* The code uses a simple two-stack algorithm. See
12510 * http://www.onthenet.com.au/~grahamis/int2008/week02/lect02.html
12511 * for a detailed explanation of the infix-to-postfix algorithm on which
12512 * this is based (this code differs in that it applies operators immediately
12513 * to the stack instead of adding them to a queue to end up with an
12516 /* To use the routine, call it with an expression string and error return
12520 * Aug 24, 2001 Manuel Novoa III
12522 * Reduced the generated code size by about 30% (i386) and fixed several bugs.
12524 * 1) In arith_apply():
12525 * a) Cached values of *numptr and &(numptr[-1]).
12526 * b) Removed redundant test for zero denominator.
12529 * a) Eliminated redundant code for processing operator tokens by moving
12530 * to a table-based implementation. Also folded handling of parens
12532 * b) Combined all 3 loops which called arith_apply to reduce generated
12533 * code size at the cost of speed.
12535 * 3) The following expressions were treated as valid by the original code:
12536 * 1() , 0! , 1 ( *3 ) .
12537 * These bugs have been fixed by internally enclosing the expression in
12538 * parens and then checking that all binary ops and right parens are
12539 * preceded by a valid expression (NUM_TOKEN).
12541 * Note: It may be desirable to replace Aaron's test for whitespace with
12542 * ctype's isspace() if it is used by another busybox applet or if additional
12543 * whitespace chars should be considered. Look below the "#include"s for a
12544 * precompiler test.
12548 * Aug 26, 2001 Manuel Novoa III
12550 * Return 0 for null expressions. Pointed out by Vladimir Oleynik.
12552 * Merge in Aaron's comments previously posted to the busybox list,
12553 * modified slightly to take account of my changes to the code.
12558 * (C) 2003 Vladimir Oleynik <dzo@simtreas.ru>
12560 * - allow access to variable,
12561 * used recursive find value indirection (c=2*2; a="c"; $((a+=2)) produce 6)
12562 * - realize assign syntax (VAR=expr, +=, *= etc)
12563 * - realize exponentiation (** operator)
12564 * - realize comma separated - expr, expr
12565 * - realise ++expr --expr expr++ expr--
12566 * - realise expr ? expr : expr (but, second expr calculate always)
12567 * - allow hexadecimal and octal numbers
12568 * - was restored loses XOR operator
12569 * - remove one goto label, added three ;-)
12570 * - protect $((num num)) as true zero expr (Manuel`s error)
12571 * - always use special isspace(), see comment from bash ;-)
12574 #define arith_isspace(arithval) \
12575 (arithval == ' ' || arithval == '\n' || arithval == '\t')
12577 typedef unsigned char operator;
12579 /* An operator's token id is a bit of a bitfield. The lower 5 bits are the
12580 * precedence, and 3 high bits are an ID unique across operators of that
12581 * precedence. The ID portion is so that multiple operators can have the
12582 * same precedence, ensuring that the leftmost one is evaluated first.
12583 * Consider * and /. */
12585 #define tok_decl(prec,id) (((id)<<5)|(prec))
12586 #define PREC(op) ((op) & 0x1F)
12588 #define TOK_LPAREN tok_decl(0,0)
12590 #define TOK_COMMA tok_decl(1,0)
12592 #define TOK_ASSIGN tok_decl(2,0)
12593 #define TOK_AND_ASSIGN tok_decl(2,1)
12594 #define TOK_OR_ASSIGN tok_decl(2,2)
12595 #define TOK_XOR_ASSIGN tok_decl(2,3)
12596 #define TOK_PLUS_ASSIGN tok_decl(2,4)
12597 #define TOK_MINUS_ASSIGN tok_decl(2,5)
12598 #define TOK_LSHIFT_ASSIGN tok_decl(2,6)
12599 #define TOK_RSHIFT_ASSIGN tok_decl(2,7)
12601 #define TOK_MUL_ASSIGN tok_decl(3,0)
12602 #define TOK_DIV_ASSIGN tok_decl(3,1)
12603 #define TOK_REM_ASSIGN tok_decl(3,2)
12605 /* all assign is right associativity and precedence eq, but (7+3)<<5 > 256 */
12606 #define convert_prec_is_assing(prec) do { if (prec == 3) prec = 2; } while (0)
12608 /* conditional is right associativity too */
12609 #define TOK_CONDITIONAL tok_decl(4,0)
12610 #define TOK_CONDITIONAL_SEP tok_decl(4,1)
12612 #define TOK_OR tok_decl(5,0)
12614 #define TOK_AND tok_decl(6,0)
12616 #define TOK_BOR tok_decl(7,0)
12618 #define TOK_BXOR tok_decl(8,0)
12620 #define TOK_BAND tok_decl(9,0)
12622 #define TOK_EQ tok_decl(10,0)
12623 #define TOK_NE tok_decl(10,1)
12625 #define TOK_LT tok_decl(11,0)
12626 #define TOK_GT tok_decl(11,1)
12627 #define TOK_GE tok_decl(11,2)
12628 #define TOK_LE tok_decl(11,3)
12630 #define TOK_LSHIFT tok_decl(12,0)
12631 #define TOK_RSHIFT tok_decl(12,1)
12633 #define TOK_ADD tok_decl(13,0)
12634 #define TOK_SUB tok_decl(13,1)
12636 #define TOK_MUL tok_decl(14,0)
12637 #define TOK_DIV tok_decl(14,1)
12638 #define TOK_REM tok_decl(14,2)
12640 /* exponent is right associativity */
12641 #define TOK_EXPONENT tok_decl(15,1)
12643 /* For now unary operators. */
12644 #define UNARYPREC 16
12645 #define TOK_BNOT tok_decl(UNARYPREC,0)
12646 #define TOK_NOT tok_decl(UNARYPREC,1)
12648 #define TOK_UMINUS tok_decl(UNARYPREC+1,0)
12649 #define TOK_UPLUS tok_decl(UNARYPREC+1,1)
12651 #define PREC_PRE (UNARYPREC+2)
12653 #define TOK_PRE_INC tok_decl(PREC_PRE, 0)
12654 #define TOK_PRE_DEC tok_decl(PREC_PRE, 1)
12656 #define PREC_POST (UNARYPREC+3)
12658 #define TOK_POST_INC tok_decl(PREC_POST, 0)
12659 #define TOK_POST_DEC tok_decl(PREC_POST, 1)
12661 #define SPEC_PREC (UNARYPREC+4)
12663 #define TOK_NUM tok_decl(SPEC_PREC, 0)
12664 #define TOK_RPAREN tok_decl(SPEC_PREC, 1)
12666 #define NUMPTR (*numstackptr)
12669 tok_have_assign(operator op)
12671 operator prec = PREC(op);
12673 convert_prec_is_assing(prec);
12674 return (prec == PREC(TOK_ASSIGN) ||
12675 prec == PREC_PRE || prec == PREC_POST);
12679 is_right_associativity(operator prec)
12681 return (prec == PREC(TOK_ASSIGN) || prec == PREC(TOK_EXPONENT)
12682 || prec == PREC(TOK_CONDITIONAL));
12687 arith_t contidional_second_val;
12688 char contidional_second_val_initialized;
12689 char *var; /* if NULL then is regular number,
12690 else is variable name */
12693 typedef struct chk_var_recursive_looped_t {
12695 struct chk_var_recursive_looped_t *next;
12696 } chk_var_recursive_looped_t;
12698 static chk_var_recursive_looped_t *prev_chk_var_recursive;
12701 arith_lookup_val(v_n_t *t)
12704 const char * p = lookupvar(t->var);
12709 /* recursive try as expression */
12710 chk_var_recursive_looped_t *cur;
12711 chk_var_recursive_looped_t cur_save;
12713 for (cur = prev_chk_var_recursive; cur; cur = cur->next) {
12714 if (strcmp(cur->var, t->var) == 0) {
12715 /* expression recursion loop detected */
12719 /* save current lookuped var name */
12720 cur = prev_chk_var_recursive;
12721 cur_save.var = t->var;
12722 cur_save.next = cur;
12723 prev_chk_var_recursive = &cur_save;
12725 t->val = arith (p, &errcode);
12726 /* restore previous ptr after recursiving */
12727 prev_chk_var_recursive = cur;
12730 /* allow undefined var as 0 */
12736 /* "applying" a token means performing it on the top elements on the integer
12737 * stack. For a unary operator it will only change the top element, but a
12738 * binary operator will pop two arguments and push a result */
12740 arith_apply(operator op, v_n_t *numstack, v_n_t **numstackptr)
12743 arith_t numptr_val, rez;
12744 int ret_arith_lookup_val;
12746 /* There is no operator that can work without arguments */
12747 if (NUMPTR == numstack) goto err;
12748 numptr_m1 = NUMPTR - 1;
12750 /* check operand is var with noninteger value */
12751 ret_arith_lookup_val = arith_lookup_val(numptr_m1);
12752 if (ret_arith_lookup_val)
12753 return ret_arith_lookup_val;
12755 rez = numptr_m1->val;
12756 if (op == TOK_UMINUS)
12758 else if (op == TOK_NOT)
12760 else if (op == TOK_BNOT)
12762 else if (op == TOK_POST_INC || op == TOK_PRE_INC)
12764 else if (op == TOK_POST_DEC || op == TOK_PRE_DEC)
12766 else if (op != TOK_UPLUS) {
12767 /* Binary operators */
12769 /* check and binary operators need two arguments */
12770 if (numptr_m1 == numstack) goto err;
12772 /* ... and they pop one */
12775 if (op == TOK_CONDITIONAL) {
12776 if (! numptr_m1->contidional_second_val_initialized) {
12777 /* protect $((expr1 ? expr2)) without ": expr" */
12780 rez = numptr_m1->contidional_second_val;
12781 } else if (numptr_m1->contidional_second_val_initialized) {
12782 /* protect $((expr1 : expr2)) without "expr ? " */
12785 numptr_m1 = NUMPTR - 1;
12786 if (op != TOK_ASSIGN) {
12787 /* check operand is var with noninteger value for not '=' */
12788 ret_arith_lookup_val = arith_lookup_val(numptr_m1);
12789 if (ret_arith_lookup_val)
12790 return ret_arith_lookup_val;
12792 if (op == TOK_CONDITIONAL) {
12793 numptr_m1->contidional_second_val = rez;
12795 rez = numptr_m1->val;
12796 if (op == TOK_BOR || op == TOK_OR_ASSIGN)
12798 else if (op == TOK_OR)
12799 rez = numptr_val || rez;
12800 else if (op == TOK_BAND || op == TOK_AND_ASSIGN)
12802 else if (op == TOK_BXOR || op == TOK_XOR_ASSIGN)
12804 else if (op == TOK_AND)
12805 rez = rez && numptr_val;
12806 else if (op == TOK_EQ)
12807 rez = (rez == numptr_val);
12808 else if (op == TOK_NE)
12809 rez = (rez != numptr_val);
12810 else if (op == TOK_GE)
12811 rez = (rez >= numptr_val);
12812 else if (op == TOK_RSHIFT || op == TOK_RSHIFT_ASSIGN)
12813 rez >>= numptr_val;
12814 else if (op == TOK_LSHIFT || op == TOK_LSHIFT_ASSIGN)
12815 rez <<= numptr_val;
12816 else if (op == TOK_GT)
12817 rez = (rez > numptr_val);
12818 else if (op == TOK_LT)
12819 rez = (rez < numptr_val);
12820 else if (op == TOK_LE)
12821 rez = (rez <= numptr_val);
12822 else if (op == TOK_MUL || op == TOK_MUL_ASSIGN)
12824 else if (op == TOK_ADD || op == TOK_PLUS_ASSIGN)
12826 else if (op == TOK_SUB || op == TOK_MINUS_ASSIGN)
12828 else if (op == TOK_ASSIGN || op == TOK_COMMA)
12830 else if (op == TOK_CONDITIONAL_SEP) {
12831 if (numptr_m1 == numstack) {
12832 /* protect $((expr : expr)) without "expr ? " */
12835 numptr_m1->contidional_second_val_initialized = op;
12836 numptr_m1->contidional_second_val = numptr_val;
12837 } else if (op == TOK_CONDITIONAL) {
12839 numptr_val : numptr_m1->contidional_second_val;
12840 } else if (op == TOK_EXPONENT) {
12841 if (numptr_val < 0)
12842 return -3; /* exponent less than 0 */
12847 while (numptr_val--)
12851 } else if (numptr_val==0) /* zero divisor check */
12853 else if (op == TOK_DIV || op == TOK_DIV_ASSIGN)
12855 else if (op == TOK_REM || op == TOK_REM_ASSIGN)
12858 if (tok_have_assign(op)) {
12859 char buf[sizeof(arith_t_type)*3 + 2];
12861 if (numptr_m1->var == NULL) {
12865 /* save to shell variable */
12866 #if ENABLE_ASH_MATH_SUPPORT_64
12867 snprintf(buf, sizeof(buf), "%lld", (arith_t_type) rez);
12869 snprintf(buf, sizeof(buf), "%ld", (arith_t_type) rez);
12871 setvar(numptr_m1->var, buf, 0);
12872 /* after saving, make previous value for v++ or v-- */
12873 if (op == TOK_POST_INC)
12875 else if (op == TOK_POST_DEC)
12878 numptr_m1->val = rez;
12879 /* protect geting var value, is number now */
12880 numptr_m1->var = NULL;
12886 /* longest must be first */
12887 static const char op_tokens[] ALIGN1 = {
12888 '<','<','=',0, TOK_LSHIFT_ASSIGN,
12889 '>','>','=',0, TOK_RSHIFT_ASSIGN,
12890 '<','<', 0, TOK_LSHIFT,
12891 '>','>', 0, TOK_RSHIFT,
12892 '|','|', 0, TOK_OR,
12893 '&','&', 0, TOK_AND,
12894 '!','=', 0, TOK_NE,
12895 '<','=', 0, TOK_LE,
12896 '>','=', 0, TOK_GE,
12897 '=','=', 0, TOK_EQ,
12898 '|','=', 0, TOK_OR_ASSIGN,
12899 '&','=', 0, TOK_AND_ASSIGN,
12900 '*','=', 0, TOK_MUL_ASSIGN,
12901 '/','=', 0, TOK_DIV_ASSIGN,
12902 '%','=', 0, TOK_REM_ASSIGN,
12903 '+','=', 0, TOK_PLUS_ASSIGN,
12904 '-','=', 0, TOK_MINUS_ASSIGN,
12905 '-','-', 0, TOK_POST_DEC,
12906 '^','=', 0, TOK_XOR_ASSIGN,
12907 '+','+', 0, TOK_POST_INC,
12908 '*','*', 0, TOK_EXPONENT,
12912 '=', 0, TOK_ASSIGN,
12924 '?', 0, TOK_CONDITIONAL,
12925 ':', 0, TOK_CONDITIONAL_SEP,
12926 ')', 0, TOK_RPAREN,
12927 '(', 0, TOK_LPAREN,
12931 #define endexpression (&op_tokens[sizeof(op_tokens)-7])
12934 arith(const char *expr, int *perrcode)
12936 char arithval; /* Current character under analysis */
12937 operator lasttok, op;
12940 const char *p = endexpression;
12943 size_t datasizes = strlen(expr) + 2;
12945 /* Stack of integers */
12946 /* The proof that there can be no more than strlen(startbuf)/2+1 integers
12947 * in any given correct or incorrect expression is left as an exercise to
12949 v_n_t *numstack = alloca(((datasizes)/2)*sizeof(v_n_t)),
12950 *numstackptr = numstack;
12951 /* Stack of operator tokens */
12952 operator *stack = alloca((datasizes) * sizeof(operator)),
12955 *stackptr++ = lasttok = TOK_LPAREN; /* start off with a left paren */
12956 *perrcode = errcode = 0;
12960 if (arithval == 0) {
12961 if (p == endexpression) {
12962 /* Null expression. */
12966 /* This is only reached after all tokens have been extracted from the
12967 * input stream. If there are still tokens on the operator stack, they
12968 * are to be applied in order. At the end, there should be a final
12969 * result on the integer stack */
12971 if (expr != endexpression + 1) {
12972 /* If we haven't done so already, */
12973 /* append a closing right paren */
12974 expr = endexpression;
12975 /* and let the loop process it. */
12978 /* At this point, we're done with the expression. */
12979 if (numstackptr != numstack+1) {
12980 /* ... but if there isn't, it's bad */
12982 return (*perrcode = -1);
12984 if (numstack->var) {
12985 /* expression is $((var)) only, lookup now */
12986 errcode = arith_lookup_val(numstack);
12989 *perrcode = errcode;
12990 return numstack->val;
12993 /* Continue processing the expression. */
12994 if (arith_isspace(arithval)) {
12995 /* Skip whitespace */
12998 p = endofname(expr);
13000 size_t var_name_size = (p-expr) + 1; /* trailing zero */
13002 numstackptr->var = alloca(var_name_size);
13003 safe_strncpy(numstackptr->var, expr, var_name_size);
13006 numstackptr->contidional_second_val_initialized = 0;
13011 if (isdigit(arithval)) {
13012 numstackptr->var = NULL;
13013 #if ENABLE_ASH_MATH_SUPPORT_64
13014 numstackptr->val = strtoll(expr, (char **) &expr, 0);
13016 numstackptr->val = strtol(expr, (char **) &expr, 0);
13020 for (p = op_tokens; ; p++) {
13024 /* strange operator not found */
13027 for (o = expr; *p && *o == *p; p++)
13034 /* skip tail uncompared token */
13037 /* skip zero delim */
13042 /* post grammar: a++ reduce to num */
13043 if (lasttok == TOK_POST_INC || lasttok == TOK_POST_DEC)
13046 /* Plus and minus are binary (not unary) _only_ if the last
13047 * token was as number, or a right paren (which pretends to be
13048 * a number, since it evaluates to one). Think about it.
13049 * It makes sense. */
13050 if (lasttok != TOK_NUM) {
13066 /* We don't want a unary operator to cause recursive descent on the
13067 * stack, because there can be many in a row and it could cause an
13068 * operator to be evaluated before its argument is pushed onto the
13069 * integer stack. */
13070 /* But for binary operators, "apply" everything on the operator
13071 * stack until we find an operator with a lesser priority than the
13072 * one we have just extracted. */
13073 /* Left paren is given the lowest priority so it will never be
13074 * "applied" in this way.
13075 * if associativity is right and priority eq, applied also skip
13078 if ((prec > 0 && prec < UNARYPREC) || prec == SPEC_PREC) {
13079 /* not left paren or unary */
13080 if (lasttok != TOK_NUM) {
13081 /* binary op must be preceded by a num */
13084 while (stackptr != stack) {
13085 if (op == TOK_RPAREN) {
13086 /* The algorithm employed here is simple: while we don't
13087 * hit an open paren nor the bottom of the stack, pop
13088 * tokens and apply them */
13089 if (stackptr[-1] == TOK_LPAREN) {
13091 /* Any operator directly after a */
13093 /* close paren should consider itself binary */
13097 operator prev_prec = PREC(stackptr[-1]);
13099 convert_prec_is_assing(prec);
13100 convert_prec_is_assing(prev_prec);
13101 if (prev_prec < prec)
13103 /* check right assoc */
13104 if (prev_prec == prec && is_right_associativity(prec))
13107 errcode = arith_apply(*--stackptr, numstack, &numstackptr);
13108 if (errcode) goto ret;
13110 if (op == TOK_RPAREN) {
13115 /* Push this operator to the stack and remember it. */
13116 *stackptr++ = lasttok = op;
13121 #endif /* ASH_MATH_SUPPORT */
13124 /* ============ main() and helpers */
13127 * Called to exit the shell.
13129 static void exitshell(void) ATTRIBUTE_NORETURN;
13137 status = exitstatus;
13138 TRACE(("pid %d, exitshell(%d)\n", getpid(), status));
13139 if (setjmp(loc.loc)) {
13140 if (exception == EXEXIT)
13141 /* dash bug: it just does _exit(exitstatus) here
13142 * but we have to do setjobctl(0) first!
13143 * (bug is still not fixed in dash-0.5.3 - if you run dash
13144 * under Midnight Commander, on exit from dash MC is backgrounded) */
13145 status = exitstatus;
13148 exception_handler = &loc;
13154 flush_stdout_stderr();
13164 /* from input.c: */
13165 basepf.nextc = basepf.buf = basebuf;
13168 signal(SIGCHLD, SIG_DFL);
13173 char ppid[sizeof(int)*3 + 1];
13175 struct stat st1, st2;
13178 for (envp = environ; envp && *envp; envp++) {
13179 if (strchr(*envp, '=')) {
13180 setvareq(*envp, VEXPORT|VTEXTFIXED);
13184 snprintf(ppid, sizeof(ppid), "%u", (unsigned) getppid());
13185 setvar("PPID", ppid, 0);
13187 p = lookupvar("PWD");
13189 if (*p != '/' || stat(p, &st1) || stat(".", &st2)
13190 || st1.st_dev != st2.st_dev || st1.st_ino != st2.st_ino)
13197 * Process the shell command line arguments.
13200 procargs(char **argv)
13203 const char *xminusc;
13208 /* if (xargv[0]) - mmm, this is always true! */
13210 for (i = 0; i < NOPTS; i++)
13214 /* it already printed err message */
13215 raise_exception(EXERROR);
13219 if (*xargv == NULL) {
13221 ash_msg_and_raise_error(bb_msg_requires_arg, "-c");
13224 if (iflag == 2 && sflag == 1 && isatty(0) && isatty(1))
13228 for (i = 0; i < NOPTS; i++)
13229 if (optlist[i] == 2)
13234 /* POSIX 1003.2: first arg after -c cmd is $0, remainder $1... */
13239 } else if (!sflag) {
13240 setinputfile(*xargv, 0);
13243 commandname = arg0;
13246 shellparam.p = xargv;
13247 #if ENABLE_ASH_GETOPTS
13248 shellparam.optind = 1;
13249 shellparam.optoff = -1;
13251 /* assert(shellparam.malloced == 0 && shellparam.nparam == 0); */
13253 shellparam.nparam++;
13260 * Read /etc/profile or .profile.
13263 read_profile(const char *name)
13267 if (setinputfile(name, INPUT_PUSH_FILE | INPUT_NOFILE_OK) < 0)
13276 * This routine is called when an error or an interrupt occurs in an
13277 * interactive shell and control is returned to the main command loop.
13285 /* from input.c: */
13286 parselleft = parsenleft = 0; /* clear input buffer */
13288 /* from parser.c: */
13291 /* from redir.c: */
13296 static short profile_buf[16384];
13297 extern int etext();
13301 * Main routine. We initialize things, parse the arguments, execute
13302 * profiles if we're a login shell, and then call cmdloop to execute
13303 * commands. The setjmp call sets up the location to jump to when an
13304 * exception occurs. When an exception occurs the variable "state"
13305 * is used to figure out how far we had gotten.
13307 int ash_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
13308 int ash_main(int argc ATTRIBUTE_UNUSED, char **argv)
13311 volatile int state;
13312 struct jmploc jmploc;
13313 struct stackmark smark;
13315 /* Initialize global data */
13319 #if ENABLE_ASH_ALIAS
13325 monitor(4, etext, profile_buf, sizeof(profile_buf), 50);
13328 #if ENABLE_FEATURE_EDITING
13329 line_input_state = new_line_input_t(FOR_SHELL | WITH_PATH_LOOKUP);
13332 if (setjmp(jmploc.loc)) {
13342 if (e == EXEXIT || s == 0 || iflag == 0 || shlvl)
13346 outcslow('\n', stderr);
13348 popstackmark(&smark);
13349 FORCE_INT_ON; /* enable interrupts */
13358 exception_handler = &jmploc;
13361 trace_puts("Shell args: ");
13362 trace_puts_args(argv);
13364 rootpid = getpid();
13366 #if ENABLE_ASH_RANDOM_SUPPORT
13367 rseed = rootpid + time(NULL);
13370 setstackmark(&smark);
13373 #if ENABLE_FEATURE_EDITING_SAVEHISTORY
13375 const char *hp = lookupvar("HISTFILE");
13378 hp = lookupvar("HOME");
13380 char *defhp = concat_path_file(hp, ".ash_history");
13381 setvar("HISTFILE", defhp, 0);
13387 if (argv[0] && argv[0][0] == '-')
13391 read_profile("/etc/profile");
13394 read_profile(".profile");
13400 getuid() == geteuid() && getgid() == getegid() &&
13404 shinit = lookupvar("ENV");
13405 if (shinit != NULL && *shinit != '\0') {
13406 read_profile(shinit);
13412 evalstring(minusc, 0);
13414 if (sflag || minusc == NULL) {
13415 #if ENABLE_FEATURE_EDITING_SAVEHISTORY
13417 const char *hp = lookupvar("HISTFILE");
13420 line_input_state->hist_file = hp;
13423 state4: /* XXX ??? - why isn't this before the "if" statement */
13431 extern void _mcleanup(void);
13440 const char *applet_name = "debug stuff usage";
13441 int main(int argc, char **argv)
13443 return ash_main(argc, argv);
13449 * Copyright (c) 1989, 1991, 1993, 1994
13450 * The Regents of the University of California. All rights reserved.
13452 * This code is derived from software contributed to Berkeley by
13453 * Kenneth Almquist.
13455 * Redistribution and use in source and binary forms, with or without
13456 * modification, are permitted provided that the following conditions
13458 * 1. Redistributions of source code must retain the above copyright
13459 * notice, this list of conditions and the following disclaimer.
13460 * 2. Redistributions in binary form must reproduce the above copyright
13461 * notice, this list of conditions and the following disclaimer in the
13462 * documentation and/or other materials provided with the distribution.
13463 * 3. Neither the name of the University nor the names of its contributors
13464 * may be used to endorse or promote products derived from this software
13465 * without specific prior written permission.
13467 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
13468 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
13469 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
13470 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
13471 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
13472 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
13473 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
13474 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
13475 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
13476 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF