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;
5821 for (idx = arg; *arg; arg++) {
5823 /* Only the first '/' seen is our seperator */
5829 } else if (*arg != '\\') {
5835 if (*(arg + 1) != '\\')
5836 goto single_backslash;
5841 case 'n': c = '\n'; break;
5842 case 'r': c = '\r'; break;
5843 case 't': c = '\t'; break;
5844 case 'v': c = '\v'; break;
5845 case 'f': c = '\f'; break;
5846 case 'b': c = '\b'; break;
5847 case 'a': c = '\a'; break;
5849 if (*(arg + 1) != '\\' && !inquotes)
5850 goto single_backslash;
5854 /* Trailing backslash, just stuff one in the buffer
5855 * and backup arg so the loop will exit.
5864 /* It's an octal number, parse it. */
5868 for (i = 0; *arg && i < 3; arg++, i++) {
5869 if (*arg >= '8' || *arg < '0')
5870 ash_msg_and_raise_error("Invalid octal char in pattern");
5871 // TODO: number() instead? It does error checking...
5872 c = (c << 3) + atoi(arg);
5874 /* back off one (so outer loop can do it) */
5886 ash_msg_and_raise_error("single backslash unexpected");
5889 #endif /* ENABLE_ASH_BASH_COMPAT */
5892 subevalvar(char *p, char *str, int strloc, int subtype,
5893 int startloc, int varflags, int quotes, struct strlist *var_str_list)
5895 struct nodelist *saveargbackq = argbackq;
5898 char *rmesc, *rmescend;
5899 USE_ASH_BASH_COMPAT(char *repl = NULL;)
5900 USE_ASH_BASH_COMPAT(char null = '\0';)
5901 USE_ASH_BASH_COMPAT(int pos, len, orig_len;)
5902 int saveherefd = herefd;
5903 int amount, workloc, resetloc;
5905 char *(*scan)(char*, char*, char*, char*, int, int);
5908 argstr(p, (subtype != VSASSIGN && subtype != VSQUESTION) ? EXP_CASE : 0,
5910 STPUTC('\0', expdest);
5911 herefd = saveherefd;
5912 argbackq = saveargbackq;
5913 startp = (char *)stackblock() + startloc;
5917 setvar(str, startp, 0);
5918 amount = startp - expdest;
5919 STADJUST(amount, expdest);
5922 #if ENABLE_ASH_BASH_COMPAT
5924 loc = str = stackblock() + strloc;
5925 // TODO: number() instead? It does error checking...
5927 len = str - startp - 1;
5929 /* *loc != '\0', guaranteed by parser */
5933 /* We must adjust the length by the number of escapes we find. */
5934 for (ptr = startp; ptr < (str - 1); ptr++) {
5935 if(*ptr == CTLESC) {
5943 if (*loc++ == ':') {
5944 // TODO: number() instead? It does error checking...
5948 while (*loc && *loc != ':')
5951 // TODO: number() instead? It does error checking...
5954 if (pos >= orig_len) {
5958 if (len > (orig_len - pos))
5959 len = orig_len - pos;
5961 for (str = startp; pos; str++, pos--) {
5962 if (quotes && *str == CTLESC)
5965 for (loc = startp; len; len--) {
5966 if (quotes && *str == CTLESC)
5971 amount = loc - expdest;
5972 STADJUST(amount, expdest);
5977 varunset(p, str, startp, varflags);
5980 resetloc = expdest - (char *)stackblock();
5982 /* We'll comeback here if we grow the stack while handling
5983 * a VSREPLACE or VSREPLACEALL, since our pointers into the
5984 * stack will need rebasing, and we'll need to remove our work
5987 USE_ASH_BASH_COMPAT(restart:)
5989 amount = expdest - ((char *)stackblock() + resetloc);
5990 STADJUST(-amount, expdest);
5991 startp = (char *)stackblock() + startloc;
5994 rmescend = (char *)stackblock() + strloc;
5996 rmesc = _rmescapes(startp, RMESCAPE_ALLOC | RMESCAPE_GROW);
5997 if (rmesc != startp) {
5999 startp = (char *)stackblock() + startloc;
6003 str = (char *)stackblock() + strloc;
6004 preglob(str, varflags & VSQUOTE, 0);
6005 workloc = expdest - (char *)stackblock();
6007 #if ENABLE_ASH_BASH_COMPAT
6008 if (subtype == VSREPLACE || subtype == VSREPLACEALL) {
6009 char *idx, *end, *restart_detect;
6012 repl = parse_sub_pattern(str, varflags & VSQUOTE);
6017 /* If there's no pattern to match, return the expansion unmolested */
6025 loc = scanright(idx, rmesc, rmescend, str, quotes, 1);
6027 /* No match, advance */
6028 restart_detect = stackblock();
6029 STPUTC(*idx, expdest);
6030 if (quotes && *idx == CTLESC) {
6033 STPUTC(*idx, expdest);
6035 if (stackblock() != restart_detect)
6043 if (subtype == VSREPLACEALL) {
6045 if (quotes && *idx == CTLESC)
6053 for (loc = repl; *loc; loc++) {
6054 restart_detect = stackblock();
6055 STPUTC(*loc, expdest);
6056 if (stackblock() != restart_detect)
6061 if (subtype == VSREPLACE) {
6063 restart_detect = stackblock();
6064 STPUTC(*idx, expdest);
6065 if (stackblock() != restart_detect)
6074 /* We've put the replaced text into a buffer at workloc, now
6075 * move it to the right place and adjust the stack.
6077 startp = stackblock() + startloc;
6078 STPUTC('\0', expdest);
6079 memmove(startp, stackblock() + workloc, len);
6080 startp[len++] = '\0';
6081 amount = expdest - ((char *)stackblock() + startloc + len - 1);
6082 STADJUST(-amount, expdest);
6085 #endif /* ENABLE_ASH_BASH_COMPAT */
6087 subtype -= VSTRIMRIGHT;
6089 if (subtype < 0 || subtype > 7)
6092 /* zero = subtype == VSTRIMLEFT || subtype == VSTRIMLEFTMAX */
6093 zero = subtype >> 1;
6094 /* VSTRIMLEFT/VSTRIMRIGHTMAX -> scanleft */
6095 scan = (subtype & 1) ^ zero ? scanleft : scanright;
6097 loc = scan(startp, rmesc, rmescend, str, quotes, zero);
6100 memmove(startp, loc, str - loc);
6101 loc = startp + (str - loc) - 1;
6104 amount = loc - expdest;
6105 STADJUST(amount, expdest);
6111 * Add the value of a specialized variable to the stack string.
6114 varvalue(char *name, int varflags, int flags, struct strlist *var_str_list)
6124 int quoted = varflags & VSQUOTE;
6125 int subtype = varflags & VSTYPE;
6126 int quotes = flags & (EXP_FULL | EXP_CASE);
6128 if (quoted && (flags & EXP_FULL))
6129 sep = 1 << CHAR_BIT;
6131 syntax = quoted ? DQSYNTAX : BASESYNTAX;
6140 num = shellparam.nparam;
6150 p = makestrspace(NOPTS, expdest);
6151 for (i = NOPTS - 1; i >= 0; i--) {
6153 USTPUTC(optletters(i), p);
6164 sep = ifsset() ? signed_char2int(ifsval()[0]) : ' ';
6165 if (quotes && (SIT(sep, syntax) == CCTL || SIT(sep, syntax) == CBACK))
6171 while ((p = *ap++)) {
6174 partlen = strlen(p);
6177 if (!(subtype == VSPLUS || subtype == VSLENGTH))
6178 memtodest(p, partlen, syntax, quotes);
6184 if (subtype == VSPLUS || subtype == VSLENGTH) {
6205 // TODO: number() instead? It does error checking...
6207 if (num < 0 || num > shellparam.nparam)
6209 p = num ? shellparam.p[num - 1] : arg0;
6212 /* NB: name has form "VAR=..." */
6214 /* "A=a B=$A" case: var_str_list is a list of "A=a" strings
6215 * which should be considered before we check variables. */
6217 unsigned name_len = (strchrnul(name, '=') - name) + 1;
6221 str = var_str_list->text;
6222 eq = strchr(str, '=');
6223 if (!eq) /* stop at first non-assignment */
6226 if (name_len == (unsigned)(eq - str)
6227 && strncmp(str, name, name_len) == 0) {
6229 /* goto value; - WRONG! */
6230 /* think "A=1 A=2 B=$A" */
6232 var_str_list = var_str_list->next;
6233 } while (var_str_list);
6237 p = lookupvar(name);
6243 if (!(subtype == VSPLUS || subtype == VSLENGTH))
6244 memtodest(p, len, syntax, quotes);
6248 if (subtype == VSPLUS || subtype == VSLENGTH)
6249 STADJUST(-len, expdest);
6254 * Expand a variable, and return a pointer to the next character in the
6258 evalvar(char *p, int flag, struct strlist *var_str_list)
6270 subtype = varflags & VSTYPE;
6271 quoted = varflags & VSQUOTE;
6273 easy = (!quoted || (*var == '@' && shellparam.nparam));
6274 startloc = expdest - (char *)stackblock();
6275 p = strchr(p, '=') + 1;
6278 varlen = varvalue(var, varflags, flag, var_str_list);
6279 if (varflags & VSNUL)
6282 if (subtype == VSPLUS) {
6283 varlen = -1 - varlen;
6287 if (subtype == VSMINUS) {
6291 p, flag | EXP_TILDE |
6292 (quoted ? EXP_QWORD : EXP_WORD),
6302 if (subtype == VSASSIGN || subtype == VSQUESTION) {
6304 if (subevalvar(p, var, /* strloc: */ 0,
6305 subtype, startloc, varflags,
6311 * Remove any recorded regions beyond
6314 removerecordregions(startloc);
6324 if (varlen < 0 && uflag)
6325 varunset(p, var, 0, 0);
6327 if (subtype == VSLENGTH) {
6328 cvtnum(varlen > 0 ? varlen : 0);
6332 if (subtype == VSNORMAL) {
6343 case VSTRIMRIGHTMAX:
6344 #if ENABLE_ASH_BASH_COMPAT
6357 * Terminate the string and start recording the pattern
6360 STPUTC('\0', expdest);
6361 patloc = expdest - (char *)stackblock();
6362 if (0 == subevalvar(p, /* str: */ NULL, patloc, subtype,
6364 /* quotes: */ flag & (EXP_FULL | EXP_CASE),
6367 int amount = expdest - (
6368 (char *)stackblock() + patloc - 1
6370 STADJUST(-amount, expdest);
6372 /* Remove any recorded regions beyond start of variable */
6373 removerecordregions(startloc);
6375 recordregion(startloc, expdest - (char *)stackblock(), quoted);
6379 if (subtype != VSNORMAL) { /* skip to end of alternative */
6385 else if (c == CTLBACKQ || c == (CTLBACKQ|CTLQUOTE)) {
6387 argbackq = argbackq->next;
6388 } else if (c == CTLVAR) {
6389 if ((*p++ & VSTYPE) != VSNORMAL)
6391 } else if (c == CTLENDVAR) {
6401 * Break the argument string into pieces based upon IFS and add the
6402 * strings to the argument list. The regions of the string to be
6403 * searched for IFS characters have been stored by recordregion.
6406 ifsbreakup(char *string, struct arglist *arglist)
6408 struct ifsregion *ifsp;
6413 const char *ifs, *realifs;
6418 if (ifslastp != NULL) {
6421 realifs = ifsset() ? ifsval() : defifs;
6424 p = string + ifsp->begoff;
6425 nulonly = ifsp->nulonly;
6426 ifs = nulonly ? nullstr : realifs;
6428 while (p < string + ifsp->endoff) {
6432 if (!strchr(ifs, *p)) {
6437 ifsspc = (strchr(defifs, *p) != NULL);
6438 /* Ignore IFS whitespace at start */
6439 if (q == start && ifsspc) {
6445 sp = stzalloc(sizeof(*sp));
6447 *arglist->lastp = sp;
6448 arglist->lastp = &sp->next;
6452 if (p >= string + ifsp->endoff) {
6458 if (strchr(ifs, *p) == NULL ) {
6462 if (strchr(defifs, *p) == NULL) {
6477 } while (ifsp != NULL);
6486 sp = stzalloc(sizeof(*sp));
6488 *arglist->lastp = sp;
6489 arglist->lastp = &sp->next;
6495 struct ifsregion *p;
6500 struct ifsregion *ifsp;
6506 ifsfirst.next = NULL;
6511 * Add a file name to the list.
6514 addfname(const char *name)
6518 sp = stzalloc(sizeof(*sp));
6519 sp->text = ststrdup(name);
6521 exparg.lastp = &sp->next;
6524 static char *expdir;
6527 * Do metacharacter (i.e. *, ?, [...]) expansion.
6530 expmeta(char *enddir, char *name)
6545 for (p = name; *p; p++) {
6546 if (*p == '*' || *p == '?')
6548 else if (*p == '[') {
6555 if (*q == '/' || *q == '\0')
6562 } else if (*p == '\\')
6564 else if (*p == '/') {
6571 if (metaflag == 0) { /* we've reached the end of the file name */
6572 if (enddir != expdir)
6580 if (metaflag == 0 || lstat(expdir, &statb) >= 0)
6591 } while (p < start);
6593 if (enddir == expdir) {
6595 } else if (enddir == expdir + 1 && *expdir == '/') {
6604 if (enddir != expdir)
6606 if (*endname == 0) {
6618 while (!intpending && (dp = readdir(dirp)) != NULL) {
6619 if (dp->d_name[0] == '.' && ! matchdot)
6621 if (pmatch(start, dp->d_name)) {
6623 strcpy(enddir, dp->d_name);
6626 for (p = enddir, cp = dp->d_name; (*p++ = *cp++) != '\0';)
6629 expmeta(p, endname);
6638 static struct strlist *
6639 msort(struct strlist *list, int len)
6641 struct strlist *p, *q = NULL;
6642 struct strlist **lpp;
6650 for (n = half; --n >= 0; ) {
6654 q->next = NULL; /* terminate first half of list */
6655 q = msort(list, half); /* sort first half of list */
6656 p = msort(p, len - half); /* sort second half */
6659 #if ENABLE_LOCALE_SUPPORT
6660 if (strcoll(p->text, q->text) < 0)
6662 if (strcmp(p->text, q->text) < 0)
6686 * Sort the results of file name expansion. It calculates the number of
6687 * strings to sort and then calls msort (short for merge sort) to do the
6690 static struct strlist *
6691 expsort(struct strlist *str)
6697 for (sp = str; sp; sp = sp->next)
6699 return msort(str, len);
6703 expandmeta(struct strlist *str /*, int flag*/)
6705 static const char metachars[] ALIGN1 = {
6708 /* TODO - EXP_REDIR */
6711 struct strlist **savelastp;
6717 if (!strpbrk(str->text, metachars))
6719 savelastp = exparg.lastp;
6722 p = preglob(str->text, 0, RMESCAPE_ALLOC | RMESCAPE_HEAP);
6724 int i = strlen(str->text);
6725 expdir = ckmalloc(i < 2048 ? 2048 : i); /* XXX */
6733 if (exparg.lastp == savelastp) {
6738 *exparg.lastp = str;
6739 rmescapes(str->text);
6740 exparg.lastp = &str->next;
6742 *exparg.lastp = NULL;
6743 *savelastp = sp = expsort(*savelastp);
6744 while (sp->next != NULL)
6746 exparg.lastp = &sp->next;
6753 * Perform variable substitution and command substitution on an argument,
6754 * placing the resulting list of arguments in arglist. If EXP_FULL is true,
6755 * perform splitting and file name expansion. When arglist is NULL, perform
6756 * here document expansion.
6759 expandarg(union node *arg, struct arglist *arglist, int flag)
6764 argbackq = arg->narg.backquote;
6765 STARTSTACKSTR(expdest);
6766 ifsfirst.next = NULL;
6768 argstr(arg->narg.text, flag,
6769 /* var_str_list: */ arglist ? arglist->list : NULL);
6770 p = _STPUTC('\0', expdest);
6772 if (arglist == NULL) {
6773 return; /* here document expanded */
6775 p = grabstackstr(p);
6776 exparg.lastp = &exparg.list;
6780 if (flag & EXP_FULL) {
6781 ifsbreakup(p, &exparg);
6782 *exparg.lastp = NULL;
6783 exparg.lastp = &exparg.list;
6784 expandmeta(exparg.list /*, flag*/);
6786 if (flag & EXP_REDIR) /*XXX - for now, just remove escapes */
6788 sp = stzalloc(sizeof(*sp));
6791 exparg.lastp = &sp->next;
6795 *exparg.lastp = NULL;
6797 *arglist->lastp = exparg.list;
6798 arglist->lastp = exparg.lastp;
6803 * Expand shell variables and backquotes inside a here document.
6806 expandhere(union node *arg, int fd)
6809 expandarg(arg, (struct arglist *)NULL, 0);
6810 full_write(fd, stackblock(), expdest - (char *)stackblock());
6814 * Returns true if the pattern matches the string.
6817 patmatch(char *pattern, const char *string)
6819 return pmatch(preglob(pattern, 0, 0), string);
6823 * See if a pattern matches in a case statement.
6826 casematch(union node *pattern, char *val)
6828 struct stackmark smark;
6831 setstackmark(&smark);
6832 argbackq = pattern->narg.backquote;
6833 STARTSTACKSTR(expdest);
6835 argstr(pattern->narg.text, EXP_TILDE | EXP_CASE,
6836 /* var_str_list: */ NULL);
6837 STACKSTRNUL(expdest);
6838 result = patmatch(stackblock(), val);
6839 popstackmark(&smark);
6844 /* ============ find_command */
6848 int (*builtin)(int, char **);
6849 /* unsigned flags; */
6851 #define IS_BUILTIN_SPECIAL(b) ((b)->name[0] & 1)
6852 /* "regular" builtins always take precedence over commands,
6853 * regardless of PATH=....%builtin... position */
6854 #define IS_BUILTIN_REGULAR(b) ((b)->name[0] & 2)
6855 #define IS_BUILTIN_ASSIGN(b) ((b)->name[0] & 4)
6858 smallint cmdtype; /* CMDxxx */
6861 /* index >= 0 for commands without path (slashes) */
6862 /* (TODO: what exactly does the value mean? PATH position?) */
6863 /* index == -1 for commands with slashes */
6864 /* index == (-2 - applet_no) for NOFORK applets */
6865 const struct builtincmd *cmd;
6866 struct funcnode *func;
6869 /* values of cmdtype */
6870 #define CMDUNKNOWN -1 /* no entry in table for command */
6871 #define CMDNORMAL 0 /* command is an executable program */
6872 #define CMDFUNCTION 1 /* command is a shell function */
6873 #define CMDBUILTIN 2 /* command is a shell builtin */
6875 /* action to find_command() */
6876 #define DO_ERR 0x01 /* prints errors */
6877 #define DO_ABS 0x02 /* checks absolute paths */
6878 #define DO_NOFUNC 0x04 /* don't return shell functions, for command */
6879 #define DO_ALTPATH 0x08 /* using alternate path */
6880 #define DO_ALTBLTIN 0x20 /* %builtin in alt. path */
6882 static void find_command(char *, struct cmdentry *, int, const char *);
6885 /* ============ Hashing commands */
6888 * When commands are first encountered, they are entered in a hash table.
6889 * This ensures that a full path search will not have to be done for them
6890 * on each invocation.
6892 * We should investigate converting to a linear search, even though that
6893 * would make the command name "hash" a misnomer.
6896 #define ARB 1 /* actual size determined at run time */
6899 struct tblentry *next; /* next entry in hash chain */
6900 union param param; /* definition of builtin function */
6901 smallint cmdtype; /* CMDxxx */
6902 char rehash; /* if set, cd done since entry created */
6903 char cmdname[ARB]; /* name of command */
6906 static struct tblentry **cmdtable;
6907 #define INIT_G_cmdtable() do { \
6908 cmdtable = xzalloc(CMDTABLESIZE * sizeof(cmdtable[0])); \
6911 static int builtinloc = -1; /* index in path of %builtin, or -1 */
6915 tryexec(USE_FEATURE_SH_STANDALONE(int applet_no,) char *cmd, char **argv, char **envp)
6919 #if ENABLE_FEATURE_SH_STANDALONE
6920 if (applet_no >= 0) {
6921 if (APPLET_IS_NOEXEC(applet_no))
6922 run_applet_no_and_exit(applet_no, argv);
6923 /* re-exec ourselves with the new arguments */
6924 execve(bb_busybox_exec_path, argv, envp);
6925 /* If they called chroot or otherwise made the binary no longer
6926 * executable, fall through */
6933 execve(cmd, argv, envp);
6934 } while (errno == EINTR);
6936 execve(cmd, argv, envp);
6940 } else if (errno == ENOEXEC) {
6944 for (ap = argv; *ap; ap++)
6946 ap = new = ckmalloc((ap - argv + 2) * sizeof(char *));
6948 ap[0] = cmd = (char *)DEFAULT_SHELL;
6951 while ((*ap++ = *argv++))
6959 * Exec a program. Never returns. If you change this routine, you may
6960 * have to change the find_command routine as well.
6962 static void shellexec(char **, const char *, int) ATTRIBUTE_NORETURN;
6964 shellexec(char **argv, const char *path, int idx)
6970 #if ENABLE_FEATURE_SH_STANDALONE
6975 envp = listvars(VEXPORT, VUNSET, 0);
6976 if (strchr(argv[0], '/') != NULL
6977 #if ENABLE_FEATURE_SH_STANDALONE
6978 || (applet_no = find_applet_by_name(argv[0])) >= 0
6981 tryexec(USE_FEATURE_SH_STANDALONE(applet_no,) argv[0], argv, envp);
6985 while ((cmdname = padvance(&path, argv[0])) != NULL) {
6986 if (--idx < 0 && pathopt == NULL) {
6987 tryexec(USE_FEATURE_SH_STANDALONE(-1,) cmdname, argv, envp);
6988 if (errno != ENOENT && errno != ENOTDIR)
6995 /* Map to POSIX errors */
7007 exitstatus = exerrno;
7008 TRACE(("shellexec failed for %s, errno %d, suppressint %d\n",
7009 argv[0], e, suppressint ));
7010 ash_msg_and_raise(EXEXEC, "%s: %s", argv[0], errmsg(e, "not found"));
7015 printentry(struct tblentry *cmdp)
7021 idx = cmdp->param.index;
7024 name = padvance(&path, cmdp->cmdname);
7026 } while (--idx >= 0);
7027 out1fmt("%s%s\n", name, (cmdp->rehash ? "*" : nullstr));
7031 * Clear out command entries. The argument specifies the first entry in
7032 * PATH which has changed.
7035 clearcmdentry(int firstchange)
7037 struct tblentry **tblp;
7038 struct tblentry **pp;
7039 struct tblentry *cmdp;
7042 for (tblp = cmdtable; tblp < &cmdtable[CMDTABLESIZE]; tblp++) {
7044 while ((cmdp = *pp) != NULL) {
7045 if ((cmdp->cmdtype == CMDNORMAL &&
7046 cmdp->param.index >= firstchange)
7047 || (cmdp->cmdtype == CMDBUILTIN &&
7048 builtinloc >= firstchange)
7061 * Locate a command in the command hash table. If "add" is nonzero,
7062 * add the command to the table if it is not already present. The
7063 * variable "lastcmdentry" is set to point to the address of the link
7064 * pointing to the entry, so that delete_cmd_entry can delete the
7067 * Interrupts must be off if called with add != 0.
7069 static struct tblentry **lastcmdentry;
7071 static struct tblentry *
7072 cmdlookup(const char *name, int add)
7074 unsigned int hashval;
7076 struct tblentry *cmdp;
7077 struct tblentry **pp;
7080 hashval = (unsigned char)*p << 4;
7082 hashval += (unsigned char)*p++;
7084 pp = &cmdtable[hashval % CMDTABLESIZE];
7085 for (cmdp = *pp; cmdp; cmdp = cmdp->next) {
7086 if (strcmp(cmdp->cmdname, name) == 0)
7090 if (add && cmdp == NULL) {
7091 cmdp = *pp = ckzalloc(sizeof(struct tblentry) - ARB
7092 + strlen(name) + 1);
7093 /*cmdp->next = NULL; - ckzalloc did it */
7094 cmdp->cmdtype = CMDUNKNOWN;
7095 strcpy(cmdp->cmdname, name);
7102 * Delete the command entry returned on the last lookup.
7105 delete_cmd_entry(void)
7107 struct tblentry *cmdp;
7110 cmdp = *lastcmdentry;
7111 *lastcmdentry = cmdp->next;
7112 if (cmdp->cmdtype == CMDFUNCTION)
7113 freefunc(cmdp->param.func);
7119 * Add a new command entry, replacing any existing command entry for
7120 * the same name - except special builtins.
7123 addcmdentry(char *name, struct cmdentry *entry)
7125 struct tblentry *cmdp;
7127 cmdp = cmdlookup(name, 1);
7128 if (cmdp->cmdtype == CMDFUNCTION) {
7129 freefunc(cmdp->param.func);
7131 cmdp->cmdtype = entry->cmdtype;
7132 cmdp->param = entry->u;
7137 hashcmd(int argc ATTRIBUTE_UNUSED, char **argv ATTRIBUTE_UNUSED)
7139 struct tblentry **pp;
7140 struct tblentry *cmdp;
7142 struct cmdentry entry;
7145 if (nextopt("r") != '\0') {
7150 if (*argptr == NULL) {
7151 for (pp = cmdtable; pp < &cmdtable[CMDTABLESIZE]; pp++) {
7152 for (cmdp = *pp; cmdp; cmdp = cmdp->next) {
7153 if (cmdp->cmdtype == CMDNORMAL)
7161 while ((name = *argptr) != NULL) {
7162 cmdp = cmdlookup(name, 0);
7164 && (cmdp->cmdtype == CMDNORMAL
7165 || (cmdp->cmdtype == CMDBUILTIN && builtinloc >= 0))
7169 find_command(name, &entry, DO_ERR, pathval());
7170 if (entry.cmdtype == CMDUNKNOWN)
7178 * Called when a cd is done. Marks all commands so the next time they
7179 * are executed they will be rehashed.
7184 struct tblentry **pp;
7185 struct tblentry *cmdp;
7187 for (pp = cmdtable; pp < &cmdtable[CMDTABLESIZE]; pp++) {
7188 for (cmdp = *pp; cmdp; cmdp = cmdp->next) {
7189 if (cmdp->cmdtype == CMDNORMAL
7190 || (cmdp->cmdtype == CMDBUILTIN
7191 && !IS_BUILTIN_REGULAR(cmdp->param.cmd)
7201 * Fix command hash table when PATH changed.
7202 * Called before PATH is changed. The argument is the new value of PATH;
7203 * pathval() still returns the old value at this point.
7204 * Called with interrupts off.
7207 changepath(const char *new)
7215 firstchange = 9999; /* assume no change */
7221 if ((*old == '\0' && *new == ':')
7222 || (*old == ':' && *new == '\0'))
7224 old = new; /* ignore subsequent differences */
7228 if (*new == '%' && idx_bltin < 0 && prefix(new + 1, "builtin"))
7234 if (builtinloc < 0 && idx_bltin >= 0)
7235 builtinloc = idx_bltin; /* zap builtins */
7236 if (builtinloc >= 0 && idx_bltin < 0)
7238 clearcmdentry(firstchange);
7239 builtinloc = idx_bltin;
7254 #define TENDBQUOTE 12
7272 /* first char is indicating which tokens mark the end of a list */
7273 static const char *const tokname_array[] = {
7287 #define KWDOFFSET 13
7288 /* the following are keywords */
7310 static char buf[16];
7313 //if (tok < TSEMI) return tokname_array[tok] + 1;
7314 //sprintf(buf, "\"%s\"", tokname_array[tok] + 1);
7319 sprintf(buf + (tok >= TSEMI), "%s%c",
7320 tokname_array[tok] + 1, (tok >= TSEMI ? '"' : 0));
7324 /* Wrapper around strcmp for qsort/bsearch/... */
7326 pstrcmp(const void *a, const void *b)
7328 return strcmp((char*) a, (*(char**) b) + 1);
7331 static const char *const *
7332 findkwd(const char *s)
7334 return bsearch(s, tokname_array + KWDOFFSET,
7335 ARRAY_SIZE(tokname_array) - KWDOFFSET,
7336 sizeof(tokname_array[0]), pstrcmp);
7340 * Locate and print what a word is...
7343 describe_command(char *command, int describe_command_verbose)
7345 struct cmdentry entry;
7346 struct tblentry *cmdp;
7347 #if ENABLE_ASH_ALIAS
7348 const struct alias *ap;
7350 const char *path = pathval();
7352 if (describe_command_verbose) {
7356 /* First look at the keywords */
7357 if (findkwd(command)) {
7358 out1str(describe_command_verbose ? " is a shell keyword" : command);
7362 #if ENABLE_ASH_ALIAS
7363 /* Then look at the aliases */
7364 ap = lookupalias(command, 0);
7366 if (!describe_command_verbose) {
7371 out1fmt(" is an alias for %s", ap->val);
7375 /* Then check if it is a tracked alias */
7376 cmdp = cmdlookup(command, 0);
7378 entry.cmdtype = cmdp->cmdtype;
7379 entry.u = cmdp->param;
7381 /* Finally use brute force */
7382 find_command(command, &entry, DO_ABS, path);
7385 switch (entry.cmdtype) {
7387 int j = entry.u.index;
7393 p = padvance(&path, command);
7397 if (describe_command_verbose) {
7399 (cmdp ? " a tracked alias for" : nullstr), p
7408 if (describe_command_verbose) {
7409 out1str(" is a shell function");
7416 if (describe_command_verbose) {
7417 out1fmt(" is a %sshell builtin",
7418 IS_BUILTIN_SPECIAL(entry.u.cmd) ?
7419 "special " : nullstr
7427 if (describe_command_verbose) {
7428 out1str(": not found\n");
7433 outstr("\n", stdout);
7438 typecmd(int argc ATTRIBUTE_UNUSED, char **argv)
7444 /* type -p ... ? (we don't bother checking for 'p') */
7445 if (argv[1] && argv[1][0] == '-') {
7450 err |= describe_command(argv[i++], verbose);
7455 #if ENABLE_ASH_CMDCMD
7457 commandcmd(int argc ATTRIBUTE_UNUSED, char **argv ATTRIBUTE_UNUSED)
7465 while ((c = nextopt("pvV")) != '\0')
7467 verify |= VERIFY_VERBOSE;
7469 verify |= VERIFY_BRIEF;
7475 return describe_command(*argptr, verify - VERIFY_BRIEF);
7482 /* ============ eval.c */
7484 static int funcblocksize; /* size of structures in function */
7485 static int funcstringsize; /* size of strings in node */
7486 static void *funcblock; /* block to allocate function from */
7487 static char *funcstring; /* block to allocate strings from */
7489 /* flags in argument to evaltree */
7490 #define EV_EXIT 01 /* exit after evaluating tree */
7491 #define EV_TESTED 02 /* exit status is checked; ignore -e flag */
7492 #define EV_BACKCMD 04 /* command executing within back quotes */
7494 static const short nodesize[26] = {
7495 SHELL_ALIGN(sizeof(struct ncmd)),
7496 SHELL_ALIGN(sizeof(struct npipe)),
7497 SHELL_ALIGN(sizeof(struct nredir)),
7498 SHELL_ALIGN(sizeof(struct nredir)),
7499 SHELL_ALIGN(sizeof(struct nredir)),
7500 SHELL_ALIGN(sizeof(struct nbinary)),
7501 SHELL_ALIGN(sizeof(struct nbinary)),
7502 SHELL_ALIGN(sizeof(struct nbinary)),
7503 SHELL_ALIGN(sizeof(struct nif)),
7504 SHELL_ALIGN(sizeof(struct nbinary)),
7505 SHELL_ALIGN(sizeof(struct nbinary)),
7506 SHELL_ALIGN(sizeof(struct nfor)),
7507 SHELL_ALIGN(sizeof(struct ncase)),
7508 SHELL_ALIGN(sizeof(struct nclist)),
7509 SHELL_ALIGN(sizeof(struct narg)),
7510 SHELL_ALIGN(sizeof(struct narg)),
7511 SHELL_ALIGN(sizeof(struct nfile)),
7512 SHELL_ALIGN(sizeof(struct nfile)),
7513 SHELL_ALIGN(sizeof(struct nfile)),
7514 SHELL_ALIGN(sizeof(struct nfile)),
7515 SHELL_ALIGN(sizeof(struct nfile)),
7516 SHELL_ALIGN(sizeof(struct ndup)),
7517 SHELL_ALIGN(sizeof(struct ndup)),
7518 SHELL_ALIGN(sizeof(struct nhere)),
7519 SHELL_ALIGN(sizeof(struct nhere)),
7520 SHELL_ALIGN(sizeof(struct nnot)),
7523 static void calcsize(union node *n);
7526 sizenodelist(struct nodelist *lp)
7529 funcblocksize += SHELL_ALIGN(sizeof(struct nodelist));
7536 calcsize(union node *n)
7540 funcblocksize += nodesize[n->type];
7543 calcsize(n->ncmd.redirect);
7544 calcsize(n->ncmd.args);
7545 calcsize(n->ncmd.assign);
7548 sizenodelist(n->npipe.cmdlist);
7553 calcsize(n->nredir.redirect);
7554 calcsize(n->nredir.n);
7561 calcsize(n->nbinary.ch2);
7562 calcsize(n->nbinary.ch1);
7565 calcsize(n->nif.elsepart);
7566 calcsize(n->nif.ifpart);
7567 calcsize(n->nif.test);
7570 funcstringsize += strlen(n->nfor.var) + 1;
7571 calcsize(n->nfor.body);
7572 calcsize(n->nfor.args);
7575 calcsize(n->ncase.cases);
7576 calcsize(n->ncase.expr);
7579 calcsize(n->nclist.body);
7580 calcsize(n->nclist.pattern);
7581 calcsize(n->nclist.next);
7585 sizenodelist(n->narg.backquote);
7586 funcstringsize += strlen(n->narg.text) + 1;
7587 calcsize(n->narg.next);
7594 calcsize(n->nfile.fname);
7595 calcsize(n->nfile.next);
7599 calcsize(n->ndup.vname);
7600 calcsize(n->ndup.next);
7604 calcsize(n->nhere.doc);
7605 calcsize(n->nhere.next);
7608 calcsize(n->nnot.com);
7614 nodeckstrdup(char *s)
7616 char *rtn = funcstring;
7618 strcpy(funcstring, s);
7619 funcstring += strlen(s) + 1;
7623 static union node *copynode(union node *);
7625 static struct nodelist *
7626 copynodelist(struct nodelist *lp)
7628 struct nodelist *start;
7629 struct nodelist **lpp;
7634 funcblock = (char *) funcblock + SHELL_ALIGN(sizeof(struct nodelist));
7635 (*lpp)->n = copynode(lp->n);
7637 lpp = &(*lpp)->next;
7644 copynode(union node *n)
7651 funcblock = (char *) funcblock + nodesize[n->type];
7655 new->ncmd.redirect = copynode(n->ncmd.redirect);
7656 new->ncmd.args = copynode(n->ncmd.args);
7657 new->ncmd.assign = copynode(n->ncmd.assign);
7660 new->npipe.cmdlist = copynodelist(n->npipe.cmdlist);
7661 new->npipe.backgnd = n->npipe.backgnd;
7666 new->nredir.redirect = copynode(n->nredir.redirect);
7667 new->nredir.n = copynode(n->nredir.n);
7674 new->nbinary.ch2 = copynode(n->nbinary.ch2);
7675 new->nbinary.ch1 = copynode(n->nbinary.ch1);
7678 new->nif.elsepart = copynode(n->nif.elsepart);
7679 new->nif.ifpart = copynode(n->nif.ifpart);
7680 new->nif.test = copynode(n->nif.test);
7683 new->nfor.var = nodeckstrdup(n->nfor.var);
7684 new->nfor.body = copynode(n->nfor.body);
7685 new->nfor.args = copynode(n->nfor.args);
7688 new->ncase.cases = copynode(n->ncase.cases);
7689 new->ncase.expr = copynode(n->ncase.expr);
7692 new->nclist.body = copynode(n->nclist.body);
7693 new->nclist.pattern = copynode(n->nclist.pattern);
7694 new->nclist.next = copynode(n->nclist.next);
7698 new->narg.backquote = copynodelist(n->narg.backquote);
7699 new->narg.text = nodeckstrdup(n->narg.text);
7700 new->narg.next = copynode(n->narg.next);
7707 new->nfile.fname = copynode(n->nfile.fname);
7708 new->nfile.fd = n->nfile.fd;
7709 new->nfile.next = copynode(n->nfile.next);
7713 new->ndup.vname = copynode(n->ndup.vname);
7714 new->ndup.dupfd = n->ndup.dupfd;
7715 new->ndup.fd = n->ndup.fd;
7716 new->ndup.next = copynode(n->ndup.next);
7720 new->nhere.doc = copynode(n->nhere.doc);
7721 new->nhere.fd = n->nhere.fd;
7722 new->nhere.next = copynode(n->nhere.next);
7725 new->nnot.com = copynode(n->nnot.com);
7728 new->type = n->type;
7733 * Make a copy of a parse tree.
7735 static struct funcnode *
7736 copyfunc(union node *n)
7741 funcblocksize = offsetof(struct funcnode, n);
7744 blocksize = funcblocksize;
7745 f = ckmalloc(blocksize + funcstringsize);
7746 funcblock = (char *) f + offsetof(struct funcnode, n);
7747 funcstring = (char *) f + blocksize;
7754 * Define a shell function.
7757 defun(char *name, union node *func)
7759 struct cmdentry entry;
7762 entry.cmdtype = CMDFUNCTION;
7763 entry.u.func = copyfunc(func);
7764 addcmdentry(name, &entry);
7768 static int evalskip; /* set if we are skipping commands */
7769 /* reasons for skipping commands (see comment on breakcmd routine) */
7770 #define SKIPBREAK (1 << 0)
7771 #define SKIPCONT (1 << 1)
7772 #define SKIPFUNC (1 << 2)
7773 #define SKIPFILE (1 << 3)
7774 #define SKIPEVAL (1 << 4)
7775 static int skipcount; /* number of levels to skip */
7776 static int funcnest; /* depth of function calls */
7778 /* forward decl way out to parsing code - dotrap needs it */
7779 static int evalstring(char *s, int mask);
7782 * Called to execute a trap. Perhaps we should avoid entering new trap
7783 * handlers while we are executing a trap handler.
7794 savestatus = exitstatus;
7798 for (i = 0, q = gotsig; i < NSIG - 1; i++, q++) {
7806 skip = evalstring(p, SKIPEVAL);
7807 exitstatus = savestatus;
7815 /* forward declarations - evaluation is fairly recursive business... */
7816 static void evalloop(union node *, int);
7817 static void evalfor(union node *, int);
7818 static void evalcase(union node *, int);
7819 static void evalsubshell(union node *, int);
7820 static void expredir(union node *);
7821 static void evalpipe(union node *, int);
7822 static void evalcommand(union node *, int);
7823 static int evalbltin(const struct builtincmd *, int, char **);
7824 static void prehash(union node *);
7827 * Evaluate a parse tree. The value is left in the global variable
7831 evaltree(union node *n, int flags)
7834 void (*evalfn)(union node *, int);
7838 TRACE(("evaltree(NULL) called\n"));
7841 TRACE(("pid %d, evaltree(%p: %d, %d) called\n",
7842 getpid(), n, n->type, flags));
7846 out1fmt("Node type = %d\n", n->type);
7851 evaltree(n->nnot.com, EV_TESTED);
7852 status = !exitstatus;
7855 expredir(n->nredir.redirect);
7856 status = redirectsafe(n->nredir.redirect, REDIR_PUSH);
7858 evaltree(n->nredir.n, flags & EV_TESTED);
7859 status = exitstatus;
7864 evalfn = evalcommand;
7866 if (eflag && !(flags & EV_TESTED))
7878 evalfn = evalsubshell;
7890 #error NAND + 1 != NOR
7892 #if NOR + 1 != NSEMI
7893 #error NOR + 1 != NSEMI
7895 isor = n->type - NAND;
7898 (flags | ((isor >> 1) - 1)) & EV_TESTED
7900 if (!exitstatus == isor)
7912 evaltree(n->nif.test, EV_TESTED);
7915 if (exitstatus == 0) {
7918 } else if (n->nif.elsepart) {
7919 n = n->nif.elsepart;
7924 defun(n->narg.text, n->narg.next);
7928 exitstatus = status;
7932 if ((checkexit & exitstatus))
7933 evalskip |= SKIPEVAL;
7934 else if (pendingsig && dotrap())
7937 if (flags & EV_EXIT) {
7939 raise_exception(EXEXIT);
7943 #if !defined(__alpha__) || (defined(__GNUC__) && __GNUC__ >= 3)
7946 void evaltreenr(union node *, int) __attribute__ ((alias("evaltree"),__noreturn__));
7948 static int loopnest; /* current loop nesting level */
7951 evalloop(union node *n, int flags)
7961 evaltree(n->nbinary.ch1, EV_TESTED);
7964 if (evalskip == SKIPCONT && --skipcount <= 0) {
7968 if (evalskip == SKIPBREAK && --skipcount <= 0)
7973 if (n->type != NWHILE)
7977 evaltree(n->nbinary.ch2, flags);
7978 status = exitstatus;
7983 exitstatus = status;
7987 evalfor(union node *n, int flags)
7989 struct arglist arglist;
7992 struct stackmark smark;
7994 setstackmark(&smark);
7995 arglist.list = NULL;
7996 arglist.lastp = &arglist.list;
7997 for (argp = n->nfor.args; argp; argp = argp->narg.next) {
7998 expandarg(argp, &arglist, EXP_FULL | EXP_TILDE | EXP_RECORD);
8003 *arglist.lastp = NULL;
8008 for (sp = arglist.list; sp; sp = sp->next) {
8009 setvar(n->nfor.var, sp->text, 0);
8010 evaltree(n->nfor.body, flags);
8012 if (evalskip == SKIPCONT && --skipcount <= 0) {
8016 if (evalskip == SKIPBREAK && --skipcount <= 0)
8023 popstackmark(&smark);
8027 evalcase(union node *n, int flags)
8031 struct arglist arglist;
8032 struct stackmark smark;
8034 setstackmark(&smark);
8035 arglist.list = NULL;
8036 arglist.lastp = &arglist.list;
8037 expandarg(n->ncase.expr, &arglist, EXP_TILDE);
8039 for (cp = n->ncase.cases; cp && evalskip == 0; cp = cp->nclist.next) {
8040 for (patp = cp->nclist.pattern; patp; patp = patp->narg.next) {
8041 if (casematch(patp, arglist.list->text)) {
8042 if (evalskip == 0) {
8043 evaltree(cp->nclist.body, flags);
8050 popstackmark(&smark);
8054 * Kick off a subshell to evaluate a tree.
8057 evalsubshell(union node *n, int flags)
8060 int backgnd = (n->type == NBACKGND);
8063 expredir(n->nredir.redirect);
8064 if (!backgnd && flags & EV_EXIT && !trap[0])
8067 jp = makejob(/*n,*/ 1);
8068 if (forkshell(jp, n, backgnd) == 0) {
8072 flags &=~ EV_TESTED;
8074 redirect(n->nredir.redirect, 0);
8075 evaltreenr(n->nredir.n, flags);
8080 status = waitforjob(jp);
8081 exitstatus = status;
8086 * Compute the names of the files in a redirection list.
8088 static void fixredir(union node *, const char *, int);
8090 expredir(union node *n)
8094 for (redir = n; redir; redir = redir->nfile.next) {
8098 fn.lastp = &fn.list;
8099 switch (redir->type) {
8105 expandarg(redir->nfile.fname, &fn, EXP_TILDE | EXP_REDIR);
8106 redir->nfile.expfname = fn.list->text;
8110 if (redir->ndup.vname) {
8111 expandarg(redir->ndup.vname, &fn, EXP_FULL | EXP_TILDE);
8112 if (fn.list == NULL)
8113 ash_msg_and_raise_error("redir error");
8114 fixredir(redir, fn.list->text, 1);
8122 * Evaluate a pipeline. All the processes in the pipeline are children
8123 * of the process creating the pipeline. (This differs from some versions
8124 * of the shell, which make the last process in a pipeline the parent
8128 evalpipe(union node *n, int flags)
8131 struct nodelist *lp;
8136 TRACE(("evalpipe(0x%lx) called\n", (long)n));
8138 for (lp = n->npipe.cmdlist; lp; lp = lp->next)
8142 jp = makejob(/*n,*/ pipelen);
8144 for (lp = n->npipe.cmdlist; lp; lp = lp->next) {
8148 if (pipe(pip) < 0) {
8150 ash_msg_and_raise_error("pipe call failed");
8153 if (forkshell(jp, lp->n, n->npipe.backgnd) == 0) {
8166 evaltreenr(lp->n, flags);
8174 if (n->npipe.backgnd == 0) {
8175 exitstatus = waitforjob(jp);
8176 TRACE(("evalpipe: job done exit status %d\n", exitstatus));
8182 * Controls whether the shell is interactive or not.
8185 setinteractive(int on)
8187 static int is_interactive;
8189 if (++on == is_interactive)
8191 is_interactive = on;
8195 #if !ENABLE_FEATURE_SH_EXTRA_QUIET
8196 if (is_interactive > 1) {
8197 /* Looks like they want an interactive shell */
8198 static smallint did_banner;
8203 "%s built-in shell (ash)\n"
8204 "Enter 'help' for a list of built-in commands."
8213 #if ENABLE_FEATURE_EDITING_VI
8214 #define setvimode(on) do { \
8215 if (on) line_input_state->flags |= VI_MODE; \
8216 else line_input_state->flags &= ~VI_MODE; \
8219 #define setvimode(on) viflag = 0 /* forcibly keep the option off */
8228 setinteractive(iflag);
8233 static struct localvar *localvars;
8236 * Called after a function returns.
8237 * Interrupts must be off.
8242 struct localvar *lvp;
8245 while ((lvp = localvars) != NULL) {
8246 localvars = lvp->next;
8248 TRACE(("poplocalvar %s", vp ? vp->text : "-"));
8249 if (vp == NULL) { /* $- saved */
8250 memcpy(optlist, lvp->text, sizeof(optlist));
8251 free((char*)lvp->text);
8253 } else if ((lvp->flags & (VUNSET|VSTRFIXED)) == VUNSET) {
8257 (*vp->func)(strchrnul(lvp->text, '=') + 1);
8258 if ((vp->flags & (VTEXTFIXED|VSTACK)) == 0)
8259 free((char*)vp->text);
8260 vp->flags = lvp->flags;
8261 vp->text = lvp->text;
8268 evalfun(struct funcnode *func, int argc, char **argv, int flags)
8270 volatile struct shparam saveparam;
8271 struct localvar *volatile savelocalvars;
8272 struct jmploc *volatile savehandler;
8273 struct jmploc jmploc;
8276 saveparam = shellparam;
8277 savelocalvars = localvars;
8278 e = setjmp(jmploc.loc);
8283 savehandler = exception_handler;
8284 exception_handler = &jmploc;
8286 shellparam.malloced = 0;
8290 shellparam.nparam = argc - 1;
8291 shellparam.p = argv + 1;
8292 #if ENABLE_ASH_GETOPTS
8293 shellparam.optind = 1;
8294 shellparam.optoff = -1;
8296 evaltree(&func->n, flags & EV_TESTED);
8302 localvars = savelocalvars;
8303 freeparam(&shellparam);
8304 shellparam = saveparam;
8305 exception_handler = savehandler;
8307 evalskip &= ~SKIPFUNC;
8311 #if ENABLE_ASH_CMDCMD
8313 parse_command_args(char **argv, const char **path)
8326 if (c == '-' && !*cp) {
8333 *path = bb_default_path;
8336 /* run 'typecmd' for other options */
8347 * Make a variable a local variable. When a variable is made local, it's
8348 * value and flags are saved in a localvar structure. The saved values
8349 * will be restored when the shell function returns. We handle the name
8350 * "-" as a special case.
8355 struct localvar *lvp;
8360 lvp = ckzalloc(sizeof(struct localvar));
8361 if (LONE_DASH(name)) {
8363 p = ckmalloc(sizeof(optlist));
8364 lvp->text = memcpy(p, optlist, sizeof(optlist));
8369 vpp = hashvar(name);
8370 vp = *findvar(vpp, name);
8371 eq = strchr(name, '=');
8374 setvareq(name, VSTRFIXED);
8376 setvar(name, NULL, VSTRFIXED);
8377 vp = *vpp; /* the new variable */
8378 lvp->flags = VUNSET;
8380 lvp->text = vp->text;
8381 lvp->flags = vp->flags;
8382 vp->flags |= VSTRFIXED|VTEXTFIXED;
8388 lvp->next = localvars;
8394 * The "local" command.
8397 localcmd(int argc ATTRIBUTE_UNUSED, char **argv)
8402 while ((name = *argv++) != NULL) {
8409 falsecmd(int argc ATTRIBUTE_UNUSED, char **argv ATTRIBUTE_UNUSED)
8415 truecmd(int argc ATTRIBUTE_UNUSED, char **argv ATTRIBUTE_UNUSED)
8421 execcmd(int argc ATTRIBUTE_UNUSED, char **argv)
8424 iflag = 0; /* exit on error */
8427 shellexec(argv + 1, pathval(), 0);
8433 * The return command.
8436 returncmd(int argc ATTRIBUTE_UNUSED, char **argv)
8439 * If called outside a function, do what ksh does;
8440 * skip the rest of the file.
8442 evalskip = funcnest ? SKIPFUNC : SKIPFILE;
8443 return argv[1] ? number(argv[1]) : exitstatus;
8446 /* Forward declarations for builtintab[] */
8447 static int breakcmd(int, char **);
8448 static int dotcmd(int, char **);
8449 static int evalcmd(int, char **);
8450 static int exitcmd(int, char **);
8451 static int exportcmd(int, char **);
8452 #if ENABLE_ASH_GETOPTS
8453 static int getoptscmd(int, char **);
8455 #if !ENABLE_FEATURE_SH_EXTRA_QUIET
8456 static int helpcmd(int, char **);
8458 #if ENABLE_ASH_MATH_SUPPORT
8459 static int letcmd(int, char **);
8461 static int readcmd(int, char **);
8462 static int setcmd(int, char **);
8463 static int shiftcmd(int, char **);
8464 static int timescmd(int, char **);
8465 static int trapcmd(int, char **);
8466 static int umaskcmd(int, char **);
8467 static int unsetcmd(int, char **);
8468 static int ulimitcmd(int, char **);
8470 #define BUILTIN_NOSPEC "0"
8471 #define BUILTIN_SPECIAL "1"
8472 #define BUILTIN_REGULAR "2"
8473 #define BUILTIN_SPEC_REG "3"
8474 #define BUILTIN_ASSIGN "4"
8475 #define BUILTIN_SPEC_ASSG "5"
8476 #define BUILTIN_REG_ASSG "6"
8477 #define BUILTIN_SPEC_REG_ASSG "7"
8479 /* We do not handle [[ expr ]] bashism bash-compatibly,
8480 * we make it a synonym of [ expr ].
8481 * Basically, word splitting and pathname expansion should NOT be performed
8483 * no word splitting: a="a b"; [[ $a = "a b" ]]; echo $? should print "0"
8484 * no pathname expansion: [[ /bin/m* = "/bin/m*" ]]; echo $? should print "0"
8485 * Additional operators:
8486 * || and && should work as -o and -a
8488 * Apart from the above, [[ expr ]] should work as [ expr ]
8491 #define echocmd echo_main
8492 #define printfcmd printf_main
8493 #define testcmd test_main
8495 /* Keep these in proper order since it is searched via bsearch() */
8496 static const struct builtincmd builtintab[] = {
8497 { BUILTIN_SPEC_REG ".", dotcmd },
8498 { BUILTIN_SPEC_REG ":", truecmd },
8499 #if ENABLE_ASH_BUILTIN_TEST
8500 { BUILTIN_REGULAR "[", testcmd },
8501 #if ENABLE_ASH_BASH_COMPAT
8502 { BUILTIN_REGULAR "[[", testcmd },
8505 #if ENABLE_ASH_ALIAS
8506 { BUILTIN_REG_ASSG "alias", aliascmd },
8509 { BUILTIN_REGULAR "bg", fg_bgcmd },
8511 { BUILTIN_SPEC_REG "break", breakcmd },
8512 { BUILTIN_REGULAR "cd", cdcmd },
8513 { BUILTIN_NOSPEC "chdir", cdcmd },
8514 #if ENABLE_ASH_CMDCMD
8515 { BUILTIN_REGULAR "command", commandcmd },
8517 { BUILTIN_SPEC_REG "continue", breakcmd },
8518 #if ENABLE_ASH_BUILTIN_ECHO
8519 { BUILTIN_REGULAR "echo", echocmd },
8521 { BUILTIN_SPEC_REG "eval", evalcmd },
8522 { BUILTIN_SPEC_REG "exec", execcmd },
8523 { BUILTIN_SPEC_REG "exit", exitcmd },
8524 { BUILTIN_SPEC_REG_ASSG "export", exportcmd },
8525 { BUILTIN_REGULAR "false", falsecmd },
8527 { BUILTIN_REGULAR "fg", fg_bgcmd },
8529 #if ENABLE_ASH_GETOPTS
8530 { BUILTIN_REGULAR "getopts", getoptscmd },
8532 { BUILTIN_NOSPEC "hash", hashcmd },
8533 #if !ENABLE_FEATURE_SH_EXTRA_QUIET
8534 { BUILTIN_NOSPEC "help", helpcmd },
8537 { BUILTIN_REGULAR "jobs", jobscmd },
8538 { BUILTIN_REGULAR "kill", killcmd },
8540 #if ENABLE_ASH_MATH_SUPPORT
8541 { BUILTIN_NOSPEC "let", letcmd },
8543 { BUILTIN_ASSIGN "local", localcmd },
8544 #if ENABLE_ASH_BUILTIN_PRINTF
8545 { BUILTIN_REGULAR "printf", printfcmd },
8547 { BUILTIN_NOSPEC "pwd", pwdcmd },
8548 { BUILTIN_REGULAR "read", readcmd },
8549 { BUILTIN_SPEC_REG_ASSG "readonly", exportcmd },
8550 { BUILTIN_SPEC_REG "return", returncmd },
8551 { BUILTIN_SPEC_REG "set", setcmd },
8552 { BUILTIN_SPEC_REG "shift", shiftcmd },
8553 { BUILTIN_SPEC_REG "source", dotcmd },
8554 #if ENABLE_ASH_BUILTIN_TEST
8555 { BUILTIN_REGULAR "test", testcmd },
8557 { BUILTIN_SPEC_REG "times", timescmd },
8558 { BUILTIN_SPEC_REG "trap", trapcmd },
8559 { BUILTIN_REGULAR "true", truecmd },
8560 { BUILTIN_NOSPEC "type", typecmd },
8561 { BUILTIN_NOSPEC "ulimit", ulimitcmd },
8562 { BUILTIN_REGULAR "umask", umaskcmd },
8563 #if ENABLE_ASH_ALIAS
8564 { BUILTIN_REGULAR "unalias", unaliascmd },
8566 { BUILTIN_SPEC_REG "unset", unsetcmd },
8567 { BUILTIN_REGULAR "wait", waitcmd },
8570 /* Should match the above table! */
8571 #define COMMANDCMD (builtintab + \
8573 1 * ENABLE_ASH_BUILTIN_TEST + \
8574 1 * ENABLE_ASH_BUILTIN_TEST * ENABLE_ASH_BASH_COMPAT + \
8575 1 * ENABLE_ASH_ALIAS + \
8576 1 * ENABLE_ASH_JOB_CONTROL + \
8578 #define EXECCMD (builtintab + \
8580 1 * ENABLE_ASH_BUILTIN_TEST + \
8581 1 * ENABLE_ASH_BUILTIN_TEST * ENABLE_ASH_BASH_COMPAT + \
8582 1 * ENABLE_ASH_ALIAS + \
8583 1 * ENABLE_ASH_JOB_CONTROL + \
8585 1 * ENABLE_ASH_CMDCMD + \
8587 ENABLE_ASH_BUILTIN_ECHO + \
8591 * Search the table of builtin commands.
8593 static struct builtincmd *
8594 find_builtin(const char *name)
8596 struct builtincmd *bp;
8599 name, builtintab, ARRAY_SIZE(builtintab), sizeof(builtintab[0]),
8606 * Execute a simple command.
8608 static int back_exitstatus; /* exit status of backquoted command */
8610 isassignment(const char *p)
8612 const char *q = endofname(p);
8618 bltincmd(int argc ATTRIBUTE_UNUSED, char **argv ATTRIBUTE_UNUSED)
8620 /* Preserve exitstatus of a previous possible redirection
8621 * as POSIX mandates */
8622 return back_exitstatus;
8625 evalcommand(union node *cmd, int flags)
8627 static const struct builtincmd null_bltin = {
8628 "\0\0", bltincmd /* why three NULs? */
8630 struct stackmark smark;
8632 struct arglist arglist;
8633 struct arglist varlist;
8636 const struct strlist *sp;
8637 struct cmdentry cmdentry;
8645 struct builtincmd *bcmd;
8646 int pseudovarflag = 0;
8648 /* First expand the arguments. */
8649 TRACE(("evalcommand(0x%lx, %d) called\n", (long)cmd, flags));
8650 setstackmark(&smark);
8651 back_exitstatus = 0;
8653 cmdentry.cmdtype = CMDBUILTIN;
8654 cmdentry.u.cmd = &null_bltin;
8655 varlist.lastp = &varlist.list;
8656 *varlist.lastp = NULL;
8657 arglist.lastp = &arglist.list;
8658 *arglist.lastp = NULL;
8661 if (cmd->ncmd.args) {
8662 bcmd = find_builtin(cmd->ncmd.args->narg.text);
8663 pseudovarflag = bcmd && IS_BUILTIN_ASSIGN(bcmd);
8666 for (argp = cmd->ncmd.args; argp; argp = argp->narg.next) {
8667 struct strlist **spp;
8669 spp = arglist.lastp;
8670 if (pseudovarflag && isassignment(argp->narg.text))
8671 expandarg(argp, &arglist, EXP_VARTILDE);
8673 expandarg(argp, &arglist, EXP_FULL | EXP_TILDE);
8675 for (sp = *spp; sp; sp = sp->next)
8679 argv = nargv = stalloc(sizeof(char *) * (argc + 1));
8680 for (sp = arglist.list; sp; sp = sp->next) {
8681 TRACE(("evalcommand arg: %s\n", sp->text));
8682 *nargv++ = sp->text;
8687 if (iflag && funcnest == 0 && argc > 0)
8688 lastarg = nargv[-1];
8691 expredir(cmd->ncmd.redirect);
8692 status = redirectsafe(cmd->ncmd.redirect, REDIR_PUSH | REDIR_SAVEFD2);
8695 for (argp = cmd->ncmd.assign; argp; argp = argp->narg.next) {
8696 struct strlist **spp;
8699 spp = varlist.lastp;
8700 expandarg(argp, &varlist, EXP_VARTILDE);
8703 * Modify the command lookup path, if a PATH= assignment
8707 if (varequal(p, path))
8711 /* Print the command if xflag is set. */
8714 const char *p = " %s";
8717 fdprintf(preverrout_fd, p, expandstr(ps4val()));
8720 for (n = 0; n < 2; n++) {
8722 fdprintf(preverrout_fd, p, sp->text);
8730 safe_write(preverrout_fd, "\n", 1);
8736 /* Now locate the command. */
8738 const char *oldpath;
8739 int cmd_flag = DO_ERR;
8744 find_command(argv[0], &cmdentry, cmd_flag, path);
8745 if (cmdentry.cmdtype == CMDUNKNOWN) {
8751 /* implement bltin and command here */
8752 if (cmdentry.cmdtype != CMDBUILTIN)
8755 spclbltin = IS_BUILTIN_SPECIAL(cmdentry.u.cmd);
8756 if (cmdentry.u.cmd == EXECCMD)
8758 #if ENABLE_ASH_CMDCMD
8759 if (cmdentry.u.cmd == COMMANDCMD) {
8761 nargv = parse_command_args(argv, &path);
8764 argc -= nargv - argv;
8766 cmd_flag |= DO_NOFUNC;
8774 /* We have a redirection error. */
8776 raise_exception(EXERROR);
8778 exitstatus = status;
8782 /* Execute the command. */
8783 switch (cmdentry.cmdtype) {
8785 #if ENABLE_FEATURE_SH_NOFORK
8787 /* find_command() encodes applet_no as (-2 - applet_no) */
8788 int applet_no = (- cmdentry.u.index - 2);
8789 if (applet_no >= 0 && APPLET_IS_NOFORK(applet_no)) {
8790 listsetvar(varlist.list, VEXPORT|VSTACK);
8791 /* run <applet>_main() */
8792 exitstatus = run_nofork_applet(applet_no, argv);
8798 /* Fork off a child process if necessary. */
8799 if (!(flags & EV_EXIT) || trap[0]) {
8801 jp = makejob(/*cmd,*/ 1);
8802 if (forkshell(jp, cmd, FORK_FG) != 0) {
8803 exitstatus = waitforjob(jp);
8809 listsetvar(varlist.list, VEXPORT|VSTACK);
8810 shellexec(argv, path, cmdentry.u.index);
8814 cmdenviron = varlist.list;
8816 struct strlist *list = cmdenviron;
8818 if (spclbltin > 0 || argc == 0) {
8820 if (cmd_is_exec && argc > 1)
8823 listsetvar(list, i);
8825 if (evalbltin(cmdentry.u.cmd, argc, argv)) {
8832 exit_status = 128 + SIGINT;
8834 exit_status = 128 + pendingsig;
8835 exitstatus = exit_status;
8836 if (i == EXINT || spclbltin > 0) {
8838 longjmp(exception_handler->loc, 1);
8845 listsetvar(varlist.list, 0);
8846 if (evalfun(cmdentry.u.func, argc, argv, flags))
8852 popredir(cmd_is_exec);
8854 /* dsl: I think this is intended to be used to support
8855 * '_' in 'vi' command mode during line editing...
8856 * However I implemented that within libedit itself.
8858 setvar("_", lastarg, 0);
8859 popstackmark(&smark);
8863 evalbltin(const struct builtincmd *cmd, int argc, char **argv)
8865 char *volatile savecmdname;
8866 struct jmploc *volatile savehandler;
8867 struct jmploc jmploc;
8870 savecmdname = commandname;
8871 i = setjmp(jmploc.loc);
8874 savehandler = exception_handler;
8875 exception_handler = &jmploc;
8876 commandname = argv[0];
8878 optptr = NULL; /* initialize nextopt */
8879 exitstatus = (*cmd->builtin)(argc, argv);
8880 flush_stdout_stderr();
8882 exitstatus |= ferror(stdout);
8884 commandname = savecmdname;
8886 exception_handler = savehandler;
8892 goodname(const char *p)
8894 return !*endofname(p);
8899 * Search for a command. This is called before we fork so that the
8900 * location of the command will be available in the parent as well as
8901 * the child. The check for "goodname" is an overly conservative
8902 * check that the name will not be subject to expansion.
8905 prehash(union node *n)
8907 struct cmdentry entry;
8909 if (n->type == NCMD && n->ncmd.args && goodname(n->ncmd.args->narg.text))
8910 find_command(n->ncmd.args->narg.text, &entry, 0, pathval());
8914 /* ============ Builtin commands
8916 * Builtin commands whose functions are closely tied to evaluation
8917 * are implemented here.
8921 * Handle break and continue commands. Break, continue, and return are
8922 * all handled by setting the evalskip flag. The evaluation routines
8923 * above all check this flag, and if it is set they start skipping
8924 * commands rather than executing them. The variable skipcount is
8925 * the number of loops to break/continue, or the number of function
8926 * levels to return. (The latter is always 1.) It should probably
8927 * be an error to break out of more loops than exist, but it isn't
8928 * in the standard shell so we don't make it one here.
8931 breakcmd(int argc ATTRIBUTE_UNUSED, char **argv)
8933 int n = argv[1] ? number(argv[1]) : 1;
8936 ash_msg_and_raise_error(illnum, argv[1]);
8940 evalskip = (**argv == 'c') ? SKIPCONT : SKIPBREAK;
8947 /* ============ input.c
8949 * This implements the input routines used by the parser.
8952 #define EOF_NLEFT -99 /* value of parsenleft when EOF pushed back */
8955 INPUT_PUSH_FILE = 1,
8956 INPUT_NOFILE_OK = 2,
8959 static int plinno = 1; /* input line number */
8960 /* number of characters left in input buffer */
8961 static int parsenleft; /* copy of parsefile->nleft */
8962 static int parselleft; /* copy of parsefile->lleft */
8963 /* next character in input buffer */
8964 static char *parsenextc; /* copy of parsefile->nextc */
8966 static int checkkwd;
8967 /* values of checkkwd variable */
8968 #define CHKALIAS 0x1
8975 struct strpush *sp = parsefile->strpush;
8978 #if ENABLE_ASH_ALIAS
8980 if (parsenextc[-1] == ' ' || parsenextc[-1] == '\t') {
8981 checkkwd |= CHKALIAS;
8983 if (sp->string != sp->ap->val) {
8986 sp->ap->flag &= ~ALIASINUSE;
8987 if (sp->ap->flag & ALIASDEAD) {
8988 unalias(sp->ap->name);
8992 parsenextc = sp->prevstring;
8993 parsenleft = sp->prevnleft;
8994 /*dprintf("*** calling popstring: restoring to '%s'\n", parsenextc);*/
8995 parsefile->strpush = sp->prev;
8996 if (sp != &(parsefile->basestrpush))
9005 char *buf = parsefile->buf;
9008 #if ENABLE_FEATURE_EDITING
9010 if (!iflag || parsefile->fd)
9011 nr = nonblock_safe_read(parsefile->fd, buf, BUFSIZ - 1);
9013 #if ENABLE_FEATURE_TAB_COMPLETION
9014 line_input_state->path_lookup = pathval();
9016 nr = read_line_input(cmdedit_prompt, buf, BUFSIZ, line_input_state);
9018 /* Ctrl+C pressed */
9027 if (nr < 0 && errno == 0) {
9028 /* Ctrl+D pressed */
9033 nr = nonblock_safe_read(parsefile->fd, buf, BUFSIZ - 1);
9037 /* nonblock_safe_read() handles this problem */
9039 if (parsefile->fd == 0 && errno == EWOULDBLOCK) {
9040 int flags = fcntl(0, F_GETFL);
9041 if (flags >= 0 && (flags & O_NONBLOCK)) {
9042 flags &= ~O_NONBLOCK;
9043 if (fcntl(0, F_SETFL, flags) >= 0) {
9044 out2str("sh: turning off NDELAY mode\n");
9055 * Refill the input buffer and return the next input character:
9057 * 1) If a string was pushed back on the input, pop it;
9058 * 2) If an EOF was pushed back (parsenleft == EOF_NLEFT) or we are reading
9059 * from a string so we can't refill the buffer, return EOF.
9060 * 3) If the is more stuff in this buffer, use it else call read to fill it.
9061 * 4) Process input up to the next newline, deleting nul characters.
9070 while (parsefile->strpush) {
9071 #if ENABLE_ASH_ALIAS
9072 if (parsenleft == -1 && parsefile->strpush->ap &&
9073 parsenextc[-1] != ' ' && parsenextc[-1] != '\t') {
9078 if (--parsenleft >= 0)
9079 return signed_char2int(*parsenextc++);
9081 if (parsenleft == EOF_NLEFT || parsefile->buf == NULL)
9083 flush_stdout_stderr();
9090 parselleft = parsenleft = EOF_NLEFT;
9097 /* delete nul characters */
9105 memmove(q, q + 1, more);
9109 parsenleft = q - parsenextc - 1;
9115 parsenleft = q - parsenextc - 1;
9127 out2str(parsenextc);
9132 return signed_char2int(*parsenextc++);
9135 #define pgetc_as_macro() (--parsenleft >= 0? signed_char2int(*parsenextc++) : preadbuffer())
9139 return pgetc_as_macro();
9142 #if ENABLE_ASH_OPTIMIZE_FOR_SIZE
9143 #define pgetc_macro() pgetc()
9145 #define pgetc_macro() pgetc_as_macro()
9149 * Same as pgetc(), but ignores PEOA.
9151 #if ENABLE_ASH_ALIAS
9159 } while (c == PEOA);
9166 return pgetc_macro();
9171 * Read a line from the script.
9174 pfgets(char *line, int len)
9180 while (--nleft > 0) {
9196 * Undo the last call to pgetc. Only one character may be pushed back.
9197 * PEOF may be pushed back.
9207 * Push a string back onto the input at this current parsefile level.
9208 * We handle aliases this way.
9210 #if !ENABLE_ASH_ALIAS
9211 #define pushstring(s, ap) pushstring(s)
9214 pushstring(char *s, struct alias *ap)
9221 /*dprintf("*** calling pushstring: %s, %d\n", s, len);*/
9222 if (parsefile->strpush) {
9223 sp = ckzalloc(sizeof(struct strpush));
9224 sp->prev = parsefile->strpush;
9225 parsefile->strpush = sp;
9227 sp = parsefile->strpush = &(parsefile->basestrpush);
9228 sp->prevstring = parsenextc;
9229 sp->prevnleft = parsenleft;
9230 #if ENABLE_ASH_ALIAS
9233 ap->flag |= ALIASINUSE;
9243 * To handle the "." command, a stack of input files is used. Pushfile
9244 * adds a new entry to the stack and popfile restores the previous level.
9249 struct parsefile *pf;
9251 parsefile->nleft = parsenleft;
9252 parsefile->lleft = parselleft;
9253 parsefile->nextc = parsenextc;
9254 parsefile->linno = plinno;
9255 pf = ckzalloc(sizeof(*pf));
9256 pf->prev = parsefile;
9258 /*pf->strpush = NULL; - ckzalloc did it */
9259 /*pf->basestrpush.prev = NULL;*/
9266 struct parsefile *pf = parsefile;
9274 parsefile = pf->prev;
9276 parsenleft = parsefile->nleft;
9277 parselleft = parsefile->lleft;
9278 parsenextc = parsefile->nextc;
9279 plinno = parsefile->linno;
9284 * Return to top level.
9289 while (parsefile != &basepf)
9294 * Close the file(s) that the shell is reading commands from. Called
9295 * after a fork is done.
9301 if (parsefile->fd > 0) {
9302 close(parsefile->fd);
9308 * Like setinputfile, but takes an open file descriptor. Call this with
9312 setinputfd(int fd, int push)
9314 close_on_exec_on(fd);
9320 if (parsefile->buf == NULL)
9321 parsefile->buf = ckmalloc(IBUFSIZ);
9322 parselleft = parsenleft = 0;
9327 * Set the input to take input from a file. If push is set, push the
9328 * old input onto the stack first.
9331 setinputfile(const char *fname, int flags)
9337 fd = open(fname, O_RDONLY);
9339 if (flags & INPUT_NOFILE_OK)
9341 ash_msg_and_raise_error("can't open %s", fname);
9344 fd2 = copyfd(fd, 10);
9347 ash_msg_and_raise_error("out of file descriptors");
9350 setinputfd(fd, flags & INPUT_PUSH_FILE);
9357 * Like setinputfile, but takes input from a string.
9360 setinputstring(char *string)
9364 parsenextc = string;
9365 parsenleft = strlen(string);
9366 parsefile->buf = NULL;
9372 /* ============ mail.c
9374 * Routines to check for mail.
9379 #define MAXMBOXES 10
9381 /* times of mailboxes */
9382 static time_t mailtime[MAXMBOXES];
9383 /* Set if MAIL or MAILPATH is changed. */
9384 static smallint mail_var_path_changed;
9387 * Print appropriate message(s) if mail has arrived.
9388 * If mail_var_path_changed is set,
9389 * then the value of MAIL has mail_var_path_changed,
9390 * so we just update the values.
9399 struct stackmark smark;
9402 setstackmark(&smark);
9403 mpath = mpathset() ? mpathval() : mailval();
9404 for (mtp = mailtime; mtp < mailtime + MAXMBOXES; mtp++) {
9405 p = padvance(&mpath, nullstr);
9410 for (q = p; *q; q++)
9416 q[-1] = '\0'; /* delete trailing '/' */
9417 if (stat(p, &statb) < 0) {
9421 if (!mail_var_path_changed && statb.st_mtime != *mtp) {
9424 pathopt ? pathopt : "you have mail"
9427 *mtp = statb.st_mtime;
9429 mail_var_path_changed = 0;
9430 popstackmark(&smark);
9434 changemail(const char *val ATTRIBUTE_UNUSED)
9436 mail_var_path_changed = 1;
9439 #endif /* ASH_MAIL */
9442 /* ============ ??? */
9445 * Set the shell parameters.
9448 setparam(char **argv)
9454 for (nparam = 0; argv[nparam]; nparam++)
9456 ap = newparam = ckmalloc((nparam + 1) * sizeof(*ap));
9458 *ap++ = ckstrdup(*argv++);
9461 freeparam(&shellparam);
9462 shellparam.malloced = 1;
9463 shellparam.nparam = nparam;
9464 shellparam.p = newparam;
9465 #if ENABLE_ASH_GETOPTS
9466 shellparam.optind = 1;
9467 shellparam.optoff = -1;
9472 * Process shell options. The global variable argptr contains a pointer
9473 * to the argument list; we advance it past the options.
9475 * SUSv3 section 2.8.1 "Consequences of Shell Errors" says:
9476 * For a non-interactive shell, an error condition encountered
9477 * by a special built-in ... shall cause the shell to write a diagnostic message
9478 * to standard error and exit as shown in the following table:
9479 * Error Special Built-In
9481 * Utility syntax error (option or operand error) Shall exit
9483 * However, in bug 1142 (http://busybox.net/bugs/view.php?id=1142)
9484 * we see that bash does not do that (set "finishes" with error code 1 instead,
9485 * and shell continues), and people rely on this behavior!
9487 * set -o barfoo 2>/dev/null
9490 * Oh well. Let's mimic that.
9493 plus_minus_o(char *name, int val)
9498 for (i = 0; i < NOPTS; i++) {
9499 if (strcmp(name, optnames(i)) == 0) {
9504 ash_msg("illegal option %co %s", val ? '-' : '+', name);
9507 for (i = 0; i < NOPTS; i++) {
9509 out1fmt("%-16s%s\n", optnames(i), optlist[i] ? "on" : "off");
9511 out1fmt("set %co %s\n", optlist[i] ? '-' : '+', optnames(i));
9517 setoption(int flag, int val)
9521 for (i = 0; i < NOPTS; i++) {
9522 if (optletters(i) == flag) {
9527 ash_msg_and_raise_error("illegal option %c%c", val ? '-' : '+', flag);
9531 options(int cmdline)
9539 while ((p = *argptr) != NULL) {
9541 if (c != '-' && c != '+')
9544 val = 0; /* val = 0 if c == '+' */
9547 if (p[0] == '\0' || LONE_DASH(p)) {
9549 /* "-" means turn off -x and -v */
9552 /* "--" means reset params */
9553 else if (*argptr == NULL)
9556 break; /* "-" or "--" terminates options */
9559 /* first char was + or - */
9560 while ((c = *p++) != '\0') {
9561 /* bash 3.2 indeed handles -c CMD and +c CMD the same */
9562 if (c == 'c' && cmdline) {
9563 minusc = p; /* command is after shell args */
9564 } else if (c == 'o') {
9565 if (plus_minus_o(*argptr, val)) {
9566 /* it already printed err message */
9567 return 1; /* error */
9571 } else if (cmdline && (c == 'l')) { /* -l or +l == --login */
9573 /* bash does not accept +-login, we also won't */
9574 } else if (cmdline && val && (c == '-')) { /* long options */
9575 if (strcmp(p, "login") == 0)
9587 * The shift builtin command.
9590 shiftcmd(int argc ATTRIBUTE_UNUSED, char **argv)
9597 n = number(argv[1]);
9598 if (n > shellparam.nparam)
9599 ash_msg_and_raise_error("can't shift that many");
9601 shellparam.nparam -= n;
9602 for (ap1 = shellparam.p; --n >= 0; ap1++) {
9603 if (shellparam.malloced)
9607 while ((*ap2++ = *ap1++) != NULL)
9609 #if ENABLE_ASH_GETOPTS
9610 shellparam.optind = 1;
9611 shellparam.optoff = -1;
9618 * POSIX requires that 'set' (but not export or readonly) output the
9619 * variables in lexicographic order - by the locale's collating order (sigh).
9620 * Maybe we could keep them in an ordered balanced binary tree
9621 * instead of hashed lists.
9622 * For now just roll 'em through qsort for printing...
9625 showvars(const char *sep_prefix, int on, int off)
9630 ep = listvars(on, off, &epend);
9631 qsort(ep, epend - ep, sizeof(char *), vpcmp);
9633 sep = *sep_prefix ? " " : sep_prefix;
9635 for (; ep < epend; ep++) {
9639 p = strchrnul(*ep, '=');
9642 q = single_quote(++p);
9643 out1fmt("%s%s%.*s%s\n", sep_prefix, sep, (int)(p - *ep), *ep, q);
9649 * The set command builtin.
9652 setcmd(int argc ATTRIBUTE_UNUSED, char **argv ATTRIBUTE_UNUSED)
9657 return showvars(nullstr, 0, VUNSET);
9660 if (!options(0)) { /* if no parse error... */
9663 if (*argptr != NULL) {
9671 #if ENABLE_ASH_RANDOM_SUPPORT
9672 /* Roughly copied from bash.. */
9674 change_random(const char *value)
9676 if (value == NULL) {
9677 /* "get", generate */
9680 rseed = rseed * 1103515245 + 12345;
9681 sprintf(buf, "%d", (unsigned int)((rseed & 32767)));
9682 /* set without recursion */
9683 setvar(vrandom.text, buf, VNOFUNC);
9684 vrandom.flags &= ~VNOFUNC;
9687 rseed = strtoul(value, (char **)NULL, 10);
9692 #if ENABLE_ASH_GETOPTS
9694 getopts(char *optstr, char *optvar, char **optfirst, int *param_optind, int *optoff)
9703 if (*param_optind < 1)
9705 optnext = optfirst + *param_optind - 1;
9707 if (*param_optind <= 1 || *optoff < 0 || (int)strlen(optnext[-1]) < *optoff)
9710 p = optnext[-1] + *optoff;
9711 if (p == NULL || *p == '\0') {
9712 /* Current word is done, advance */
9714 if (p == NULL || *p != '-' || *++p == '\0') {
9721 if (LONE_DASH(p)) /* check for "--" */
9726 for (q = optstr; *q != c; ) {
9728 if (optstr[0] == ':') {
9731 err |= setvarsafe("OPTARG", s, 0);
9733 fprintf(stderr, "Illegal option -%c\n", c);
9744 if (*p == '\0' && (p = *optnext) == NULL) {
9745 if (optstr[0] == ':') {
9748 err |= setvarsafe("OPTARG", s, 0);
9751 fprintf(stderr, "No arg for -%c option\n", c);
9760 err |= setvarsafe("OPTARG", p, 0);
9763 err |= setvarsafe("OPTARG", nullstr, 0);
9765 *optoff = p ? p - *(optnext - 1) : -1;
9766 *param_optind = optnext - optfirst + 1;
9767 fmtstr(s, sizeof(s), "%d", *param_optind);
9768 err |= setvarsafe("OPTIND", s, VNOFUNC);
9771 err |= setvarsafe(optvar, s, 0);
9775 flush_stdout_stderr();
9776 raise_exception(EXERROR);
9782 * The getopts builtin. Shellparam.optnext points to the next argument
9783 * to be processed. Shellparam.optptr points to the next character to
9784 * be processed in the current argument. If shellparam.optnext is NULL,
9785 * then it's the first time getopts has been called.
9788 getoptscmd(int argc, char **argv)
9793 ash_msg_and_raise_error("usage: getopts optstring var [arg]");
9795 optbase = shellparam.p;
9796 if (shellparam.optind > shellparam.nparam + 1) {
9797 shellparam.optind = 1;
9798 shellparam.optoff = -1;
9802 if (shellparam.optind > argc - 2) {
9803 shellparam.optind = 1;
9804 shellparam.optoff = -1;
9808 return getopts(argv[1], argv[2], optbase, &shellparam.optind,
9809 &shellparam.optoff);
9811 #endif /* ASH_GETOPTS */
9814 /* ============ Shell parser */
9817 * NEOF is returned by parsecmd when it encounters an end of file. It
9818 * must be distinct from NULL, so we use the address of a variable that
9819 * happens to be handy.
9821 static smallint tokpushback; /* last token pushed back */
9822 #define NEOF ((union node *)&tokpushback)
9823 static smallint parsebackquote; /* nonzero if we are inside backquotes */
9824 static int lasttoken; /* last token read */
9825 static char *wordtext; /* text of last word returned by readtoken */
9826 static struct nodelist *backquotelist;
9827 static union node *redirnode;
9828 static struct heredoc *heredoc;
9829 static smallint quoteflag; /* set if (part of) last token was quoted */
9831 static void raise_error_syntax(const char *) ATTRIBUTE_NORETURN;
9833 raise_error_syntax(const char *msg)
9835 ash_msg_and_raise_error("syntax error: %s", msg);
9840 * Called when an unexpected token is read during the parse. The argument
9841 * is the token that is expected, or -1 if more than one type of token can
9842 * occur at this point.
9844 static void raise_error_unexpected_syntax(int) ATTRIBUTE_NORETURN;
9846 raise_error_unexpected_syntax(int token)
9851 l = sprintf(msg, "%s unexpected", tokname(lasttoken));
9853 sprintf(msg + l, " (expecting %s)", tokname(token));
9854 raise_error_syntax(msg);
9858 #define EOFMARKLEN 79
9861 struct heredoc *next; /* next here document in list */
9862 union node *here; /* redirection node */
9863 char *eofmark; /* string indicating end of input */
9864 int striptabs; /* if set, strip leading tabs */
9867 static struct heredoc *heredoclist; /* list of here documents to read */
9869 /* parsing is heavily cross-recursive, need these forward decls */
9870 static union node *andor(void);
9871 static union node *pipeline(void);
9872 static union node *parse_command(void);
9873 static void parseheredoc(void);
9874 static char peektoken(void);
9875 static int readtoken(void);
9880 union node *n1, *n2, *n3;
9883 checkkwd = CHKNL | CHKKWD | CHKALIAS;
9884 if (nlflag == 2 && peektoken())
9890 if (tok == TBACKGND) {
9891 if (n2->type == NPIPE) {
9892 n2->npipe.backgnd = 1;
9894 if (n2->type != NREDIR) {
9895 n3 = stzalloc(sizeof(struct nredir));
9897 /*n3->nredir.redirect = NULL; - stzalloc did it */
9900 n2->type = NBACKGND;
9906 n3 = stzalloc(sizeof(struct nbinary));
9908 n3->nbinary.ch1 = n1;
9909 n3->nbinary.ch2 = n2;
9925 checkkwd = CHKNL | CHKKWD | CHKALIAS;
9933 pungetc(); /* push back EOF on input */
9937 raise_error_unexpected_syntax(-1);
9947 union node *n1, *n2, *n3;
9955 } else if (t == TOR) {
9961 checkkwd = CHKNL | CHKKWD | CHKALIAS;
9963 n3 = stzalloc(sizeof(struct nbinary));
9965 n3->nbinary.ch1 = n1;
9966 n3->nbinary.ch2 = n2;
9974 union node *n1, *n2, *pipenode;
9975 struct nodelist *lp, *prev;
9979 TRACE(("pipeline: entered\n"));
9980 if (readtoken() == TNOT) {
9982 checkkwd = CHKKWD | CHKALIAS;
9985 n1 = parse_command();
9986 if (readtoken() == TPIPE) {
9987 pipenode = stzalloc(sizeof(struct npipe));
9988 pipenode->type = NPIPE;
9989 /*pipenode->npipe.backgnd = 0; - stzalloc did it */
9990 lp = stzalloc(sizeof(struct nodelist));
9991 pipenode->npipe.cmdlist = lp;
9995 lp = stzalloc(sizeof(struct nodelist));
9996 checkkwd = CHKNL | CHKKWD | CHKALIAS;
9997 lp->n = parse_command();
9999 } while (readtoken() == TPIPE);
10005 n2 = stzalloc(sizeof(struct nnot));
10013 static union node *
10018 n = stzalloc(sizeof(struct narg));
10020 /*n->narg.next = NULL; - stzalloc did it */
10021 n->narg.text = wordtext;
10022 n->narg.backquote = backquotelist;
10027 fixredir(union node *n, const char *text, int err)
10029 TRACE(("Fix redir %s %d\n", text, err));
10031 n->ndup.vname = NULL;
10033 if (isdigit(text[0]) && text[1] == '\0')
10034 n->ndup.dupfd = text[0] - '0';
10035 else if (LONE_DASH(text))
10036 n->ndup.dupfd = -1;
10039 raise_error_syntax("Bad fd number");
10040 n->ndup.vname = makename();
10045 * Returns true if the text contains nothing to expand (no dollar signs
10049 noexpand(char *text)
10055 while ((c = *p++) != '\0') {
10056 if (c == CTLQUOTEMARK)
10060 else if (SIT(c, BASESYNTAX) == CCTL)
10069 union node *n = redirnode;
10071 if (readtoken() != TWORD)
10072 raise_error_unexpected_syntax(-1);
10073 if (n->type == NHERE) {
10074 struct heredoc *here = heredoc;
10078 if (quoteflag == 0)
10080 TRACE(("Here document %d\n", n->type));
10081 if (!noexpand(wordtext) || (i = strlen(wordtext)) == 0 || i > EOFMARKLEN)
10082 raise_error_syntax("Illegal eof marker for << redirection");
10083 rmescapes(wordtext);
10084 here->eofmark = wordtext;
10086 if (heredoclist == NULL)
10087 heredoclist = here;
10089 for (p = heredoclist; p->next; p = p->next)
10093 } else if (n->type == NTOFD || n->type == NFROMFD) {
10094 fixredir(n, wordtext, 0);
10096 n->nfile.fname = makename();
10100 static union node *
10103 union node *args, **app;
10104 union node *n = NULL;
10105 union node *vars, **vpp;
10106 union node **rpp, *redir;
10108 #if ENABLE_ASH_BASH_COMPAT
10109 smallint double_brackets_flag = 0;
10119 savecheckkwd = CHKALIAS;
10122 checkkwd = savecheckkwd;
10125 #if ENABLE_ASH_BASH_COMPAT
10126 case TAND: /* "&&" */
10127 case TOR: /* "||" */
10128 if (!double_brackets_flag) {
10132 wordtext = (char *) (t == TAND ? "-a" : "-o");
10135 n = stzalloc(sizeof(struct narg));
10137 /*n->narg.next = NULL; - stzalloc did it */
10138 n->narg.text = wordtext;
10139 #if ENABLE_ASH_BASH_COMPAT
10140 if (strcmp("[[", wordtext) == 0)
10141 double_brackets_flag = 1;
10142 else if (strcmp("]]", wordtext) == 0)
10143 double_brackets_flag = 0;
10145 n->narg.backquote = backquotelist;
10146 if (savecheckkwd && isassignment(wordtext)) {
10148 vpp = &n->narg.next;
10151 app = &n->narg.next;
10156 *rpp = n = redirnode;
10157 rpp = &n->nfile.next;
10158 parsefname(); /* read name of redirection file */
10161 if (args && app == &args->narg.next
10164 struct builtincmd *bcmd;
10167 /* We have a function */
10168 if (readtoken() != TRP)
10169 raise_error_unexpected_syntax(TRP);
10170 name = n->narg.text;
10171 if (!goodname(name)
10172 || ((bcmd = find_builtin(name)) && IS_BUILTIN_SPECIAL(bcmd))
10174 raise_error_syntax("Bad function name");
10177 checkkwd = CHKNL | CHKKWD | CHKALIAS;
10178 n->narg.next = parse_command();
10191 n = stzalloc(sizeof(struct ncmd));
10193 n->ncmd.args = args;
10194 n->ncmd.assign = vars;
10195 n->ncmd.redirect = redir;
10199 static union node *
10200 parse_command(void)
10202 union node *n1, *n2;
10203 union node *ap, **app;
10204 union node *cp, **cpp;
10205 union node *redir, **rpp;
10212 switch (readtoken()) {
10214 raise_error_unexpected_syntax(-1);
10217 n1 = stzalloc(sizeof(struct nif));
10219 n1->nif.test = list(0);
10220 if (readtoken() != TTHEN)
10221 raise_error_unexpected_syntax(TTHEN);
10222 n1->nif.ifpart = list(0);
10224 while (readtoken() == TELIF) {
10225 n2->nif.elsepart = stzalloc(sizeof(struct nif));
10226 n2 = n2->nif.elsepart;
10228 n2->nif.test = list(0);
10229 if (readtoken() != TTHEN)
10230 raise_error_unexpected_syntax(TTHEN);
10231 n2->nif.ifpart = list(0);
10233 if (lasttoken == TELSE)
10234 n2->nif.elsepart = list(0);
10236 n2->nif.elsepart = NULL;
10244 n1 = stzalloc(sizeof(struct nbinary));
10245 n1->type = (lasttoken == TWHILE) ? NWHILE : NUNTIL;
10246 n1->nbinary.ch1 = list(0);
10249 TRACE(("expecting DO got %s %s\n", tokname(got),
10250 got == TWORD ? wordtext : ""));
10251 raise_error_unexpected_syntax(TDO);
10253 n1->nbinary.ch2 = list(0);
10258 if (readtoken() != TWORD || quoteflag || ! goodname(wordtext))
10259 raise_error_syntax("Bad for loop variable");
10260 n1 = stzalloc(sizeof(struct nfor));
10262 n1->nfor.var = wordtext;
10263 checkkwd = CHKKWD | CHKALIAS;
10264 if (readtoken() == TIN) {
10266 while (readtoken() == TWORD) {
10267 n2 = stzalloc(sizeof(struct narg));
10269 /*n2->narg.next = NULL; - stzalloc did it */
10270 n2->narg.text = wordtext;
10271 n2->narg.backquote = backquotelist;
10273 app = &n2->narg.next;
10276 n1->nfor.args = ap;
10277 if (lasttoken != TNL && lasttoken != TSEMI)
10278 raise_error_unexpected_syntax(-1);
10280 n2 = stzalloc(sizeof(struct narg));
10282 /*n2->narg.next = NULL; - stzalloc did it */
10283 n2->narg.text = (char *)dolatstr;
10284 /*n2->narg.backquote = NULL;*/
10285 n1->nfor.args = n2;
10287 * Newline or semicolon here is optional (but note
10288 * that the original Bourne shell only allowed NL).
10290 if (lasttoken != TNL && lasttoken != TSEMI)
10293 checkkwd = CHKNL | CHKKWD | CHKALIAS;
10294 if (readtoken() != TDO)
10295 raise_error_unexpected_syntax(TDO);
10296 n1->nfor.body = list(0);
10300 n1 = stzalloc(sizeof(struct ncase));
10302 if (readtoken() != TWORD)
10303 raise_error_unexpected_syntax(TWORD);
10304 n1->ncase.expr = n2 = stzalloc(sizeof(struct narg));
10306 /*n2->narg.next = NULL; - stzalloc did it */
10307 n2->narg.text = wordtext;
10308 n2->narg.backquote = backquotelist;
10310 checkkwd = CHKKWD | CHKALIAS;
10311 } while (readtoken() == TNL);
10312 if (lasttoken != TIN)
10313 raise_error_unexpected_syntax(TIN);
10314 cpp = &n1->ncase.cases;
10316 checkkwd = CHKNL | CHKKWD;
10318 while (t != TESAC) {
10319 if (lasttoken == TLP)
10321 *cpp = cp = stzalloc(sizeof(struct nclist));
10323 app = &cp->nclist.pattern;
10325 *app = ap = stzalloc(sizeof(struct narg));
10327 /*ap->narg.next = NULL; - stzalloc did it */
10328 ap->narg.text = wordtext;
10329 ap->narg.backquote = backquotelist;
10330 if (readtoken() != TPIPE)
10332 app = &ap->narg.next;
10335 //ap->narg.next = NULL;
10336 if (lasttoken != TRP)
10337 raise_error_unexpected_syntax(TRP);
10338 cp->nclist.body = list(2);
10340 cpp = &cp->nclist.next;
10342 checkkwd = CHKNL | CHKKWD;
10346 raise_error_unexpected_syntax(TENDCASE);
10353 n1 = stzalloc(sizeof(struct nredir));
10354 n1->type = NSUBSHELL;
10355 n1->nredir.n = list(0);
10356 /*n1->nredir.redirect = NULL; - stzalloc did it */
10366 return simplecmd();
10369 if (readtoken() != t)
10370 raise_error_unexpected_syntax(t);
10373 /* Now check for redirection which may follow command */
10374 checkkwd = CHKKWD | CHKALIAS;
10376 while (readtoken() == TREDIR) {
10377 *rpp = n2 = redirnode;
10378 rpp = &n2->nfile.next;
10384 if (n1->type != NSUBSHELL) {
10385 n2 = stzalloc(sizeof(struct nredir));
10390 n1->nredir.redirect = redir;
10396 * If eofmark is NULL, read a word or a redirection symbol. If eofmark
10397 * is not NULL, read a here document. In the latter case, eofmark is the
10398 * word which marks the end of the document and striptabs is true if
10399 * leading tabs should be stripped from the document. The argument firstc
10400 * is the first character of the input token or document.
10402 * Because C does not have internal subroutines, I have simulated them
10403 * using goto's to implement the subroutine linkage. The following macros
10404 * will run code that appears at the end of readtoken1.
10407 #define CHECKEND() {goto checkend; checkend_return:;}
10408 #define PARSEREDIR() {goto parseredir; parseredir_return:;}
10409 #define PARSESUB() {goto parsesub; parsesub_return:;}
10410 #define PARSEBACKQOLD() {oldstyle = 1; goto parsebackq; parsebackq_oldreturn:;}
10411 #define PARSEBACKQNEW() {oldstyle = 0; goto parsebackq; parsebackq_newreturn:;}
10412 #define PARSEARITH() {goto parsearith; parsearith_return:;}
10415 readtoken1(int firstc, int syntax, char *eofmark, int striptabs)
10417 /* NB: syntax parameter fits into smallint */
10421 char line[EOFMARKLEN + 1];
10422 struct nodelist *bqlist;
10426 smallint prevsyntax; /* syntax before arithmetic */
10427 #if ENABLE_ASH_EXPAND_PRMT
10428 smallint pssyntax; /* we are expanding a prompt string */
10430 int varnest; /* levels of variables expansion */
10431 int arinest; /* levels of arithmetic expansion */
10432 int parenlevel; /* levels of parens in arithmetic */
10433 int dqvarnest; /* levels of variables expansion within double quotes */
10436 /* Avoid longjmp clobbering */
10442 (void) &parenlevel;
10445 (void) &prevsyntax;
10448 startlinno = plinno;
10453 #if ENABLE_ASH_EXPAND_PRMT
10454 pssyntax = (syntax == PSSYNTAX);
10458 dblquote = (syntax == DQSYNTAX);
10464 STARTSTACKSTR(out);
10465 loop: { /* for each line, until end of word */
10466 CHECKEND(); /* set c to PEOF if at end of here document */
10467 for (;;) { /* until end of line or end of word */
10468 CHECKSTRSPACE(4, out); /* permit 4 calls to USTPUTC */
10469 switch (SIT(c, syntax)) {
10470 case CNL: /* '\n' */
10471 if (syntax == BASESYNTAX)
10472 goto endword; /* exit outer loop */
10478 goto loop; /* continue outer loop */
10483 if (eofmark == NULL || dblquote)
10484 USTPUTC(CTLESC, out);
10487 case CBACK: /* backslash */
10490 USTPUTC(CTLESC, out);
10491 USTPUTC('\\', out);
10493 } else if (c == '\n') {
10497 #if ENABLE_ASH_EXPAND_PRMT
10498 if (c == '$' && pssyntax) {
10499 USTPUTC(CTLESC, out);
10500 USTPUTC('\\', out);
10504 c != '\\' && c != '`' &&
10509 USTPUTC(CTLESC, out);
10510 USTPUTC('\\', out);
10512 if (SIT(c, SQSYNTAX) == CCTL)
10513 USTPUTC(CTLESC, out);
10521 if (eofmark == NULL) {
10522 USTPUTC(CTLQUOTEMARK, out);
10530 if (eofmark != NULL && arinest == 0
10535 if (dqvarnest == 0) {
10536 syntax = BASESYNTAX;
10543 case CVAR: /* '$' */
10544 PARSESUB(); /* parse substitution */
10546 case CENDVAR: /* '}' */
10549 if (dqvarnest > 0) {
10552 USTPUTC(CTLENDVAR, out);
10557 #if ENABLE_ASH_MATH_SUPPORT
10558 case CLP: /* '(' in arithmetic */
10562 case CRP: /* ')' in arithmetic */
10563 if (parenlevel > 0) {
10567 if (pgetc() == ')') {
10568 if (--arinest == 0) {
10569 USTPUTC(CTLENDARI, out);
10570 syntax = prevsyntax;
10571 dblquote = (syntax == DQSYNTAX);
10576 * unbalanced parens
10577 * (don't 2nd guess - no error)
10585 case CBQUOTE: /* '`' */
10589 goto endword; /* exit outer loop */
10594 goto endword; /* exit outer loop */
10595 #if ENABLE_ASH_ALIAS
10605 #if ENABLE_ASH_MATH_SUPPORT
10606 if (syntax == ARISYNTAX)
10607 raise_error_syntax("Missing '))'");
10609 if (syntax != BASESYNTAX && !parsebackquote && eofmark == NULL)
10610 raise_error_syntax("Unterminated quoted string");
10611 if (varnest != 0) {
10612 startlinno = plinno;
10614 raise_error_syntax("Missing '}'");
10616 USTPUTC('\0', out);
10617 len = out - (char *)stackblock();
10618 out = stackblock();
10619 if (eofmark == NULL) {
10620 if ((c == '>' || c == '<')
10623 && (*out == '\0' || isdigit(*out))) {
10625 return lasttoken = TREDIR;
10630 quoteflag = quotef;
10631 backquotelist = bqlist;
10632 grabstackblock(len);
10636 /* end of readtoken routine */
10639 * Check to see whether we are at the end of the here document. When this
10640 * is called, c is set to the first character of the next input line. If
10641 * we are at the end of the here document, this routine sets the c to PEOF.
10645 #if ENABLE_ASH_ALIAS
10651 while (c == '\t') {
10655 if (c == *eofmark) {
10656 if (pfgets(line, sizeof(line)) != NULL) {
10660 for (q = eofmark + 1; *q && *p == *q; p++, q++)
10662 if (*p == '\n' && *q == '\0') {
10665 needprompt = doprompt;
10667 pushstring(line, NULL);
10672 goto checkend_return;
10676 * Parse a redirection operator. The variable "out" points to a string
10677 * specifying the fd to be redirected. The variable "c" contains the
10678 * first character of the redirection operator.
10684 np = stzalloc(sizeof(struct nfile));
10689 np->type = NAPPEND;
10691 np->type = NCLOBBER;
10698 } else { /* c == '<' */
10699 /*np->nfile.fd = 0; - stzalloc did it */
10703 if (sizeof(struct nfile) != sizeof(struct nhere)) {
10704 np = stzalloc(sizeof(struct nhere));
10705 /*np->nfile.fd = 0; - stzalloc did it */
10708 heredoc = stzalloc(sizeof(struct heredoc));
10709 heredoc->here = np;
10712 heredoc->striptabs = 1;
10714 /*heredoc->striptabs = 0; - stzalloc did it */
10720 np->type = NFROMFD;
10724 np->type = NFROMTO;
10734 np->nfile.fd = fd - '0';
10736 goto parseredir_return;
10740 * Parse a substitution. At this point, we have read the dollar sign
10741 * and nothing else.
10744 /* is_special(c) evaluates to 1 for c in "!#$*-0123456789?@"; 0 otherwise
10745 * (assuming ascii char codes, as the original implementation did) */
10746 #define is_special(c) \
10747 ((((unsigned int)c) - 33 < 32) \
10748 && ((0xc1ff920dUL >> (((unsigned int)c) - 33)) & 1))
10754 static const char types[] ALIGN1 = "}-+?=";
10758 c <= PEOA_OR_PEOF ||
10759 (c != '(' && c != '{' && !is_name(c) && !is_special(c))
10763 } else if (c == '(') { /* $(command) or $((arith)) */
10764 if (pgetc() == '(') {
10765 #if ENABLE_ASH_MATH_SUPPORT
10768 raise_error_syntax("We unsupport $((arith))");
10775 USTPUTC(CTLVAR, out);
10776 typeloc = out - (char *)stackblock();
10777 USTPUTC(VSNORMAL, out);
10778 subtype = VSNORMAL;
10786 subtype = VSLENGTH;
10790 if (c > PEOA_OR_PEOF && is_name(c)) {
10794 } while (c > PEOA_OR_PEOF && is_in_name(c));
10795 } else if (isdigit(c)) {
10799 } while (isdigit(c));
10800 } else if (is_special(c)) {
10804 badsub: raise_error_syntax("Bad substitution");
10808 if (subtype == 0) {
10812 #if ENABLE_ASH_BASH_COMPAT
10813 if (c == ':' || c == '$' || isdigit(c)) {
10815 subtype = VSSUBSTR;
10822 p = strchr(types, c);
10825 subtype = p - types + VSNORMAL;
10830 subtype = c == '#' ? VSTRIMLEFT : VSTRIMRIGHT;
10838 #if ENABLE_ASH_BASH_COMPAT
10840 subtype = VSREPLACE;
10843 subtype++; /* VSREPLACEALL */
10852 if (dblquote || arinest)
10854 *((char *)stackblock() + typeloc) = subtype | flags;
10855 if (subtype != VSNORMAL) {
10857 if (dblquote || arinest) {
10862 goto parsesub_return;
10866 * Called to parse command substitutions. Newstyle is set if the command
10867 * is enclosed inside $(...); nlpp is a pointer to the head of the linked
10868 * list of commands (passed by reference), and savelen is the number of
10869 * characters on the top of the stack which must be preserved.
10872 struct nodelist **nlpp;
10875 char *volatile str;
10876 struct jmploc jmploc;
10877 struct jmploc *volatile savehandler;
10879 smallint saveprompt = 0;
10882 (void) &saveprompt;
10884 savepbq = parsebackquote;
10885 if (setjmp(jmploc.loc)) {
10887 parsebackquote = 0;
10888 exception_handler = savehandler;
10889 longjmp(exception_handler->loc, 1);
10893 savelen = out - (char *)stackblock();
10895 str = ckmalloc(savelen);
10896 memcpy(str, stackblock(), savelen);
10898 savehandler = exception_handler;
10899 exception_handler = &jmploc;
10902 /* We must read until the closing backquote, giving special
10903 treatment to some slashes, and then push the string and
10904 reread it as input, interpreting it normally. */
10911 STARTSTACKSTR(pout);
10928 * If eating a newline, avoid putting
10929 * the newline into the new character
10930 * stream (via the STPUTC after the
10935 if (pc != '\\' && pc != '`' && pc != '$'
10936 && (!dblquote || pc != '"'))
10937 STPUTC('\\', pout);
10938 if (pc > PEOA_OR_PEOF) {
10944 #if ENABLE_ASH_ALIAS
10947 startlinno = plinno;
10948 raise_error_syntax("EOF in backquote substitution");
10952 needprompt = doprompt;
10961 STPUTC('\0', pout);
10962 psavelen = pout - (char *)stackblock();
10963 if (psavelen > 0) {
10964 pstr = grabstackstr(pout);
10965 setinputstring(pstr);
10970 nlpp = &(*nlpp)->next;
10971 *nlpp = stzalloc(sizeof(**nlpp));
10972 /* (*nlpp)->next = NULL; - stzalloc did it */
10973 parsebackquote = oldstyle;
10976 saveprompt = doprompt;
10983 doprompt = saveprompt;
10984 else if (readtoken() != TRP)
10985 raise_error_unexpected_syntax(TRP);
10990 * Start reading from old file again, ignoring any pushed back
10991 * tokens left from the backquote parsing
10996 while (stackblocksize() <= savelen)
10998 STARTSTACKSTR(out);
11000 memcpy(out, str, savelen);
11001 STADJUST(savelen, out);
11007 parsebackquote = savepbq;
11008 exception_handler = savehandler;
11009 if (arinest || dblquote)
11010 USTPUTC(CTLBACKQ | CTLQUOTE, out);
11012 USTPUTC(CTLBACKQ, out);
11014 goto parsebackq_oldreturn;
11015 goto parsebackq_newreturn;
11018 #if ENABLE_ASH_MATH_SUPPORT
11020 * Parse an arithmetic expansion (indicate start of one and set state)
11023 if (++arinest == 1) {
11024 prevsyntax = syntax;
11025 syntax = ARISYNTAX;
11026 USTPUTC(CTLARI, out);
11033 * we collapse embedded arithmetic expansion to
11034 * parenthesis, which should be equivalent
11038 goto parsearith_return;
11042 } /* end of readtoken */
11045 * Read the next input token.
11046 * If the token is a word, we set backquotelist to the list of cmds in
11047 * backquotes. We set quoteflag to true if any part of the word was
11049 * If the token is TREDIR, then we set redirnode to a structure containing
11051 * In all cases, the variable startlinno is set to the number of the line
11052 * on which the token starts.
11054 * [Change comment: here documents and internal procedures]
11055 * [Readtoken shouldn't have any arguments. Perhaps we should make the
11056 * word parsing code into a separate routine. In this case, readtoken
11057 * doesn't need to have any internal procedures, but parseword does.
11058 * We could also make parseoperator in essence the main routine, and
11059 * have parseword (readtoken1?) handle both words and redirection.]
11061 #define NEW_xxreadtoken
11062 #ifdef NEW_xxreadtoken
11063 /* singles must be first! */
11064 static const char xxreadtoken_chars[7] ALIGN1 = {
11065 '\n', '(', ')', '&', '|', ';', 0
11068 static const char xxreadtoken_tokens[] ALIGN1 = {
11069 TNL, TLP, TRP, /* only single occurrence allowed */
11070 TBACKGND, TPIPE, TSEMI, /* if single occurrence */
11071 TEOF, /* corresponds to trailing nul */
11072 TAND, TOR, TENDCASE /* if double occurrence */
11075 #define xxreadtoken_doubles \
11076 (sizeof(xxreadtoken_tokens) - sizeof(xxreadtoken_chars))
11077 #define xxreadtoken_singles \
11078 (sizeof(xxreadtoken_chars) - xxreadtoken_doubles - 1)
11092 startlinno = plinno;
11093 for (;;) { /* until token or start of word found */
11096 if ((c != ' ') && (c != '\t')
11097 #if ENABLE_ASH_ALIAS
11102 while ((c = pgetc()) != '\n' && c != PEOF)
11105 } else if (c == '\\') {
11106 if (pgetc() != '\n') {
11110 startlinno = ++plinno;
11115 = xxreadtoken_chars + sizeof(xxreadtoken_chars) - 1;
11120 needprompt = doprompt;
11123 p = strchr(xxreadtoken_chars, c);
11126 return readtoken1(c, BASESYNTAX, (char *) NULL, 0);
11129 if ((size_t)(p - xxreadtoken_chars) >= xxreadtoken_singles) {
11130 if (pgetc() == *p) { /* double occurrence? */
11131 p += xxreadtoken_doubles + 1;
11137 return lasttoken = xxreadtoken_tokens[p - xxreadtoken_chars];
11143 #define RETURN(token) return lasttoken = token
11156 startlinno = plinno;
11157 for (;;) { /* until token or start of word found */
11160 case ' ': case '\t':
11161 #if ENABLE_ASH_ALIAS
11166 while ((c = pgetc()) != '\n' && c != PEOF)
11171 if (pgetc() == '\n') {
11172 startlinno = ++plinno;
11181 needprompt = doprompt;
11186 if (pgetc() == '&')
11191 if (pgetc() == '|')
11196 if (pgetc() == ';')
11209 return readtoken1(c, BASESYNTAX, (char *)NULL, 0);
11212 #endif /* NEW_xxreadtoken */
11219 smallint alreadyseen = tokpushback;
11222 #if ENABLE_ASH_ALIAS
11231 if (checkkwd & CHKNL) {
11238 if (t != TWORD || quoteflag) {
11243 * check for keywords
11245 if (checkkwd & CHKKWD) {
11246 const char *const *pp;
11248 pp = findkwd(wordtext);
11250 lasttoken = t = pp - tokname_array;
11251 TRACE(("keyword %s recognized\n", tokname(t)));
11256 if (checkkwd & CHKALIAS) {
11257 #if ENABLE_ASH_ALIAS
11259 ap = lookupalias(wordtext, 1);
11262 pushstring(ap->val, ap);
11272 TRACE(("token %s %s\n", tokname(t), t == TWORD ? wordtext : ""));
11274 TRACE(("reread token %s %s\n", tokname(t), t == TWORD ? wordtext : ""));
11286 return tokname_array[t][0];
11290 * Read and parse a command. Returns NEOF on end of file. (NULL is a
11291 * valid parse tree indicating a blank line.)
11293 static union node *
11294 parsecmd(int interact)
11299 doprompt = interact;
11301 setprompt(doprompt);
11313 * Input any here documents.
11318 struct heredoc *here;
11321 here = heredoclist;
11322 heredoclist = NULL;
11328 readtoken1(pgetc(), here->here->type == NHERE? SQSYNTAX : DQSYNTAX,
11329 here->eofmark, here->striptabs);
11330 n = stzalloc(sizeof(struct narg));
11331 n->narg.type = NARG;
11332 /*n->narg.next = NULL; - stzalloc did it */
11333 n->narg.text = wordtext;
11334 n->narg.backquote = backquotelist;
11335 here->here->nhere.doc = n;
11342 * called by editline -- any expansions to the prompt should be added here.
11344 #if ENABLE_ASH_EXPAND_PRMT
11345 static const char *
11346 expandstr(const char *ps)
11350 /* XXX Fix (char *) cast. */
11351 setinputstring((char *)ps);
11352 readtoken1(pgetc(), PSSYNTAX, nullstr, 0);
11355 n.narg.type = NARG;
11356 n.narg.next = NULL;
11357 n.narg.text = wordtext;
11358 n.narg.backquote = backquotelist;
11360 expandarg(&n, NULL, 0);
11361 return stackblock();
11366 * Execute a command or commands contained in a string.
11369 evalstring(char *s, int mask)
11372 struct stackmark smark;
11376 setstackmark(&smark);
11379 while ((n = parsecmd(0)) != NEOF) {
11381 popstackmark(&smark);
11394 * The eval command.
11397 evalcmd(int argc ATTRIBUTE_UNUSED, char **argv)
11406 STARTSTACKSTR(concat);
11408 concat = stack_putstr(p, concat);
11412 STPUTC(' ', concat);
11414 STPUTC('\0', concat);
11415 p = grabstackstr(concat);
11417 evalstring(p, ~SKIPEVAL);
11424 * Read and execute commands. "Top" is nonzero for the top level command
11425 * loop; it turns on prompting if the shell is interactive.
11431 struct stackmark smark;
11435 TRACE(("cmdloop(%d) called\n", top));
11439 setstackmark(&smark);
11442 showjobs(stderr, SHOW_CHANGED);
11445 if (iflag && top) {
11447 #if ENABLE_ASH_MAIL
11451 n = parsecmd(inter);
11452 /* showtree(n); DEBUG */
11454 if (!top || numeof >= 50)
11456 if (!stoppedjobs()) {
11459 out2str("\nUse \"exit\" to leave shell.\n");
11462 } else if (nflag == 0) {
11463 /* job_warning can only be 2,1,0. Here 2->1, 1/0->0 */
11468 popstackmark(&smark);
11473 return skip & SKIPEVAL;
11480 * Take commands from a file. To be compatible we should do a path
11481 * search for the file, which is necessary to find sub-commands.
11484 find_dot_file(char *name)
11487 const char *path = pathval();
11490 /* don't try this for absolute or relative paths */
11491 if (strchr(name, '/'))
11494 while ((fullname = padvance(&path, name)) != NULL) {
11495 if ((stat(fullname, &statb) == 0) && S_ISREG(statb.st_mode)) {
11497 * Don't bother freeing here, since it will
11498 * be freed by the caller.
11502 stunalloc(fullname);
11505 /* not found in the PATH */
11506 ash_msg_and_raise_error("%s: not found", name);
11511 dotcmd(int argc, char **argv)
11513 struct strlist *sp;
11514 volatile struct shparam saveparam;
11517 for (sp = cmdenviron; sp; sp = sp->next)
11518 setvareq(ckstrdup(sp->text), VSTRFIXED | VTEXTFIXED);
11520 if (argv[1]) { /* That's what SVR2 does */
11521 char *fullname = find_dot_file(argv[1]);
11524 if (argc) { /* argc > 0, argv[0] != NULL */
11525 saveparam = shellparam;
11526 shellparam.malloced = 0;
11527 shellparam.nparam = argc;
11528 shellparam.p = argv;
11531 setinputfile(fullname, INPUT_PUSH_FILE);
11532 commandname = fullname;
11537 freeparam(&shellparam);
11538 shellparam = saveparam;
11540 status = exitstatus;
11546 exitcmd(int argc ATTRIBUTE_UNUSED, char **argv)
11551 exitstatus = number(argv[1]);
11552 raise_exception(EXEXIT);
11557 * Read a file containing shell functions.
11560 readcmdfile(char *name)
11562 setinputfile(name, INPUT_PUSH_FILE);
11568 /* ============ find_command inplementation */
11571 * Resolve a command name. If you change this routine, you may have to
11572 * change the shellexec routine as well.
11575 find_command(char *name, struct cmdentry *entry, int act, const char *path)
11577 struct tblentry *cmdp;
11584 struct builtincmd *bcmd;
11586 /* If name contains a slash, don't use PATH or hash table */
11587 if (strchr(name, '/') != NULL) {
11588 entry->u.index = -1;
11589 if (act & DO_ABS) {
11590 while (stat(name, &statb) < 0) {
11592 if (errno == EINTR)
11595 entry->cmdtype = CMDUNKNOWN;
11599 entry->cmdtype = CMDNORMAL;
11603 /* #if ENABLE_FEATURE_SH_STANDALONE... moved after builtin check */
11605 updatetbl = (path == pathval());
11608 if (strstr(path, "%builtin") != NULL)
11609 act |= DO_ALTBLTIN;
11612 /* If name is in the table, check answer will be ok */
11613 cmdp = cmdlookup(name, 0);
11614 if (cmdp != NULL) {
11617 switch (cmdp->cmdtype) {
11635 } else if (cmdp->rehash == 0)
11636 /* if not invalidated by cd, we're done */
11640 /* If %builtin not in path, check for builtin next */
11641 bcmd = find_builtin(name);
11643 if (IS_BUILTIN_REGULAR(bcmd))
11644 goto builtin_success;
11645 if (act & DO_ALTPATH) {
11646 if (!(act & DO_ALTBLTIN))
11647 goto builtin_success;
11648 } else if (builtinloc <= 0) {
11649 goto builtin_success;
11653 #if ENABLE_FEATURE_SH_STANDALONE
11655 int applet_no = find_applet_by_name(name);
11656 if (applet_no >= 0) {
11657 entry->cmdtype = CMDNORMAL;
11658 entry->u.index = -2 - applet_no;
11664 /* We have to search path. */
11665 prev = -1; /* where to start */
11666 if (cmdp && cmdp->rehash) { /* doing a rehash */
11667 if (cmdp->cmdtype == CMDBUILTIN)
11670 prev = cmdp->param.index;
11676 while ((fullname = padvance(&path, name)) != NULL) {
11677 stunalloc(fullname);
11678 /* NB: code below will still use fullname
11679 * despite it being "unallocated" */
11682 if (prefix(pathopt, "builtin")) {
11684 goto builtin_success;
11687 if ((act & DO_NOFUNC)
11688 || !prefix(pathopt, "func")
11689 ) { /* ignore unimplemented options */
11693 /* if rehash, don't redo absolute path names */
11694 if (fullname[0] == '/' && idx <= prev) {
11697 TRACE(("searchexec \"%s\": no change\n", name));
11700 while (stat(fullname, &statb) < 0) {
11702 if (errno == EINTR)
11705 if (errno != ENOENT && errno != ENOTDIR)
11709 e = EACCES; /* if we fail, this will be the error */
11710 if (!S_ISREG(statb.st_mode))
11712 if (pathopt) { /* this is a %func directory */
11713 stalloc(strlen(fullname) + 1);
11714 /* NB: stalloc will return space pointed by fullname
11715 * (because we don't have any intervening allocations
11716 * between stunalloc above and this stalloc) */
11717 readcmdfile(fullname);
11718 cmdp = cmdlookup(name, 0);
11719 if (cmdp == NULL || cmdp->cmdtype != CMDFUNCTION)
11720 ash_msg_and_raise_error("%s not defined in %s", name, fullname);
11721 stunalloc(fullname);
11724 TRACE(("searchexec \"%s\" returns \"%s\"\n", name, fullname));
11726 entry->cmdtype = CMDNORMAL;
11727 entry->u.index = idx;
11731 cmdp = cmdlookup(name, 1);
11732 cmdp->cmdtype = CMDNORMAL;
11733 cmdp->param.index = idx;
11738 /* We failed. If there was an entry for this command, delete it */
11739 if (cmdp && updatetbl)
11740 delete_cmd_entry();
11742 ash_msg("%s: %s", name, errmsg(e, "not found"));
11743 entry->cmdtype = CMDUNKNOWN;
11748 entry->cmdtype = CMDBUILTIN;
11749 entry->u.cmd = bcmd;
11753 cmdp = cmdlookup(name, 1);
11754 cmdp->cmdtype = CMDBUILTIN;
11755 cmdp->param.cmd = bcmd;
11759 entry->cmdtype = cmdp->cmdtype;
11760 entry->u = cmdp->param;
11764 /* ============ trap.c */
11767 * The trap builtin.
11770 trapcmd(int argc ATTRIBUTE_UNUSED, char **argv ATTRIBUTE_UNUSED)
11779 for (signo = 0; signo < NSIG; signo++) {
11780 if (trap[signo] != NULL) {
11783 sn = get_signame(signo);
11784 out1fmt("trap -- %s %s\n",
11785 single_quote(trap[signo]), sn);
11795 signo = get_signum(*ap);
11797 ash_msg_and_raise_error("%s: bad trap", *ap);
11800 if (LONE_DASH(action))
11803 action = ckstrdup(action);
11806 trap[signo] = action;
11816 /* ============ Builtins */
11818 #if !ENABLE_FEATURE_SH_EXTRA_QUIET
11820 * Lists available builtins
11823 helpcmd(int argc ATTRIBUTE_UNUSED, char **argv ATTRIBUTE_UNUSED)
11828 out1fmt("\nBuilt-in commands:\n-------------------\n");
11829 for (col = 0, i = 0; i < ARRAY_SIZE(builtintab); i++) {
11830 col += out1fmt("%c%s", ((col == 0) ? '\t' : ' '),
11831 builtintab[i].name + 1);
11837 #if ENABLE_FEATURE_SH_STANDALONE
11839 const char *a = applet_names;
11841 col += out1fmt("%c%s", ((col == 0) ? '\t' : ' '), a);
11846 a += strlen(a) + 1;
11851 return EXIT_SUCCESS;
11853 #endif /* FEATURE_SH_EXTRA_QUIET */
11856 * The export and readonly commands.
11859 exportcmd(int argc ATTRIBUTE_UNUSED, char **argv)
11865 int flag = argv[0][0] == 'r'? VREADONLY : VEXPORT;
11867 if (nextopt("p") != 'p') {
11872 p = strchr(name, '=');
11876 vp = *findvar(hashvar(name), name);
11882 setvar(name, p, flag);
11883 } while ((name = *++aptr) != NULL);
11887 showvars(argv[0], flag, 0);
11892 * Delete a function if it exists.
11895 unsetfunc(const char *name)
11897 struct tblentry *cmdp;
11899 cmdp = cmdlookup(name, 0);
11900 if (cmdp!= NULL && cmdp->cmdtype == CMDFUNCTION)
11901 delete_cmd_entry();
11905 * The unset builtin command. We unset the function before we unset the
11906 * variable to allow a function to be unset when there is a readonly variable
11907 * with the same name.
11910 unsetcmd(int argc ATTRIBUTE_UNUSED, char **argv ATTRIBUTE_UNUSED)
11917 while ((i = nextopt("vf")) != '\0') {
11921 for (ap = argptr; *ap; ap++) {
11937 #include <sys/times.h>
11939 static const unsigned char timescmd_str[] ALIGN1 = {
11940 ' ', offsetof(struct tms, tms_utime),
11941 '\n', offsetof(struct tms, tms_stime),
11942 ' ', offsetof(struct tms, tms_cutime),
11943 '\n', offsetof(struct tms, tms_cstime),
11948 timescmd(int argc ATTRIBUTE_UNUSED, char **argv ATTRIBUTE_UNUSED)
11950 long clk_tck, s, t;
11951 const unsigned char *p;
11954 clk_tck = sysconf(_SC_CLK_TCK);
11959 t = *(clock_t *)(((char *) &buf) + p[1]);
11961 out1fmt("%ldm%ld.%.3lds%c",
11963 ((t - s * clk_tck) * 1000) / clk_tck,
11965 } while (*(p += 2));
11970 #if ENABLE_ASH_MATH_SUPPORT
11972 dash_arith(const char *s)
11978 result = arith(s, &errcode);
11981 ash_msg_and_raise_error("exponent less than 0");
11983 ash_msg_and_raise_error("divide by zero");
11985 ash_msg_and_raise_error("expression recursion loop detected");
11986 raise_error_syntax(s);
11994 * The let builtin. partial stolen from GNU Bash, the Bourne Again SHell.
11995 * Copyright (C) 1987, 1989, 1991 Free Software Foundation, Inc.
11997 * Copyright (C) 2003 Vladimir Oleynik <dzo@simtreas.ru>
12000 letcmd(int argc ATTRIBUTE_UNUSED, char **argv)
12006 ash_msg_and_raise_error("expression expected");
12008 i = dash_arith(*argv);
12013 #endif /* ASH_MATH_SUPPORT */
12016 /* ============ miscbltin.c
12018 * Miscellaneous builtins.
12023 #if defined(__GLIBC__) && __GLIBC__ == 2 && __GLIBC_MINOR__ < 1
12024 typedef enum __rlimit_resource rlim_t;
12028 * The read builtin. Options:
12029 * -r Do not interpret '\' specially
12030 * -s Turn off echo (tty only)
12031 * -n NCHARS Read NCHARS max
12032 * -p PROMPT Display PROMPT on stderr (if input is from tty)
12033 * -t SECONDS Timeout after SECONDS (tty or pipe only)
12034 * -u FD Read from given FD instead of fd 0
12035 * This uses unbuffered input, which may be avoidable in some cases.
12036 * TODO: bash also has:
12037 * -a ARRAY Read into array[0],[1],etc
12038 * -d DELIM End on DELIM char, not newline
12039 * -e Use line editing (tty only)
12042 readcmd(int argc ATTRIBUTE_UNUSED, char **argv ATTRIBUTE_UNUSED)
12055 #if ENABLE_ASH_READ_NCHARS
12056 int nchars = 0; /* if != 0, -n is in effect */
12058 struct termios tty, old_tty;
12060 #if ENABLE_ASH_READ_TIMEOUT
12061 unsigned end_ms = 0;
12062 unsigned timeout = 0;
12067 while ((i = nextopt("p:u:r"
12068 USE_ASH_READ_TIMEOUT("t:")
12069 USE_ASH_READ_NCHARS("n:s")
12073 prompt = optionarg;
12075 #if ENABLE_ASH_READ_NCHARS
12077 nchars = bb_strtou(optionarg, NULL, 10);
12078 if (nchars < 0 || errno)
12079 ash_msg_and_raise_error("invalid count");
12080 /* nchars == 0: off (bash 3.2 does this too) */
12086 #if ENABLE_ASH_READ_TIMEOUT
12088 timeout = bb_strtou(optionarg, NULL, 10);
12089 if (errno || timeout > UINT_MAX / 2048)
12090 ash_msg_and_raise_error("invalid timeout");
12092 #if 0 /* even bash have no -t N.NNN support */
12093 ts.tv_sec = bb_strtou(optionarg, &p, 10);
12095 /* EINVAL means number is ok, but not terminated by NUL */
12096 if (*p == '.' && errno == EINVAL) {
12100 ts.tv_usec = bb_strtou(p, &p2, 10);
12102 ash_msg_and_raise_error("invalid timeout");
12104 /* normalize to usec */
12106 ash_msg_and_raise_error("invalid timeout");
12107 while (scale++ < 6)
12110 } else if (ts.tv_sec < 0 || errno) {
12111 ash_msg_and_raise_error("invalid timeout");
12113 if (!(ts.tv_sec | ts.tv_usec)) { /* both are 0? */
12114 ash_msg_and_raise_error("invalid timeout");
12123 fd = bb_strtou(optionarg, NULL, 10);
12124 if (fd < 0 || errno)
12125 ash_msg_and_raise_error("invalid file descriptor");
12131 if (prompt && isatty(fd)) {
12136 ash_msg_and_raise_error("arg count");
12137 ifs = bltinlookup("IFS");
12140 #if ENABLE_ASH_READ_NCHARS
12141 tcgetattr(fd, &tty);
12143 if (nchars || silent) {
12145 tty.c_lflag &= ~ICANON;
12146 tty.c_cc[VMIN] = nchars < 256 ? nchars : 255;
12149 tty.c_lflag &= ~(ECHO | ECHOK | ECHONL);
12151 /* if tcgetattr failed, tcsetattr will fail too.
12152 * Ignoring, it's harmless. */
12153 tcsetattr(fd, TCSANOW, &tty);
12160 #if ENABLE_ASH_READ_TIMEOUT
12161 if (timeout) /* NB: ensuring end_ms is nonzero */
12162 end_ms = ((unsigned)(monotonic_us() / 1000) + timeout) | 1;
12166 #if ENABLE_ASH_READ_TIMEOUT
12168 struct pollfd pfd[1];
12170 pfd[0].events = POLLIN;
12171 timeout = end_ms - (unsigned)(monotonic_us() / 1000);
12172 if ((int)timeout <= 0 /* already late? */
12173 || safe_poll(pfd, 1, timeout) != 1 /* no? wait... */
12174 ) { /* timed out! */
12175 #if ENABLE_ASH_READ_NCHARS
12176 tcsetattr(fd, TCSANOW, &old_tty);
12182 if (nonblock_safe_read(fd, &c, 1) != 1) {
12194 if (!rflag && c == '\\') {
12200 if (startword && *ifs == ' ' && strchr(ifs, c)) {
12204 if (ap[1] != NULL && strchr(ifs, c) != NULL) {
12206 setvar(*ap, stackblock(), 0);
12215 /* end of do {} while: */
12216 #if ENABLE_ASH_READ_NCHARS
12222 #if ENABLE_ASH_READ_NCHARS
12223 tcsetattr(fd, TCSANOW, &old_tty);
12227 /* Remove trailing blanks */
12228 while ((char *)stackblock() <= --p && strchr(ifs, *p) != NULL)
12230 setvar(*ap, stackblock(), 0);
12231 while (*++ap != NULL)
12232 setvar(*ap, nullstr, 0);
12237 umaskcmd(int argc ATTRIBUTE_UNUSED, char **argv)
12239 static const char permuser[3] ALIGN1 = "ugo";
12240 static const char permmode[3] ALIGN1 = "rwx";
12241 static const short permmask[] ALIGN2 = {
12242 S_IRUSR, S_IWUSR, S_IXUSR,
12243 S_IRGRP, S_IWGRP, S_IXGRP,
12244 S_IROTH, S_IWOTH, S_IXOTH
12250 int symbolic_mode = 0;
12252 while (nextopt("S") != '\0') {
12263 if (symbolic_mode) {
12267 for (i = 0; i < 3; i++) {
12270 *p++ = permuser[i];
12272 for (j = 0; j < 3; j++) {
12273 if ((mask & permmask[3 * i + j]) == 0) {
12274 *p++ = permmode[j];
12282 out1fmt("%.4o\n", mask);
12285 if (isdigit((unsigned char) *ap)) {
12288 if (*ap >= '8' || *ap < '0')
12289 ash_msg_and_raise_error(illnum, argv[1]);
12290 mask = (mask << 3) + (*ap - '0');
12291 } while (*++ap != '\0');
12294 mask = ~mask & 0777;
12295 if (!bb_parse_mode(ap, &mask)) {
12296 ash_msg_and_raise_error("illegal mode: %s", ap);
12298 umask(~mask & 0777);
12307 * This code, originally by Doug Gwyn, Doug Kingston, Eric Gisin, and
12308 * Michael Rendell was ripped from pdksh 5.0.8 and hacked for use with
12309 * ash by J.T. Conklin.
12315 uint8_t cmd; /* RLIMIT_xxx fit into it */
12316 uint8_t factor_shift; /* shift by to get rlim_{cur,max} values */
12320 static const struct limits limits_tbl[] = {
12322 { RLIMIT_CPU, 0, 't' },
12324 #ifdef RLIMIT_FSIZE
12325 { RLIMIT_FSIZE, 9, 'f' },
12328 { RLIMIT_DATA, 10, 'd' },
12330 #ifdef RLIMIT_STACK
12331 { RLIMIT_STACK, 10, 's' },
12334 { RLIMIT_CORE, 9, 'c' },
12337 { RLIMIT_RSS, 10, 'm' },
12339 #ifdef RLIMIT_MEMLOCK
12340 { RLIMIT_MEMLOCK, 10, 'l' },
12342 #ifdef RLIMIT_NPROC
12343 { RLIMIT_NPROC, 0, 'p' },
12345 #ifdef RLIMIT_NOFILE
12346 { RLIMIT_NOFILE, 0, 'n' },
12349 { RLIMIT_AS, 10, 'v' },
12351 #ifdef RLIMIT_LOCKS
12352 { RLIMIT_LOCKS, 0, 'w' },
12355 static const char limits_name[] =
12357 "time(seconds)" "\0"
12359 #ifdef RLIMIT_FSIZE
12360 "file(blocks)" "\0"
12365 #ifdef RLIMIT_STACK
12369 "coredump(blocks)" "\0"
12374 #ifdef RLIMIT_MEMLOCK
12375 "locked memory(kb)" "\0"
12377 #ifdef RLIMIT_NPROC
12380 #ifdef RLIMIT_NOFILE
12386 #ifdef RLIMIT_LOCKS
12391 enum limtype { SOFT = 0x1, HARD = 0x2 };
12394 printlim(enum limtype how, const struct rlimit *limit,
12395 const struct limits *l)
12399 val = limit->rlim_max;
12401 val = limit->rlim_cur;
12403 if (val == RLIM_INFINITY)
12404 out1fmt("unlimited\n");
12406 val >>= l->factor_shift;
12407 out1fmt("%lld\n", (long long) val);
12412 ulimitcmd(int argc ATTRIBUTE_UNUSED, char **argv ATTRIBUTE_UNUSED)
12416 enum limtype how = SOFT | HARD;
12417 const struct limits *l;
12420 struct rlimit limit;
12423 while ((optc = nextopt("HSa"
12427 #ifdef RLIMIT_FSIZE
12433 #ifdef RLIMIT_STACK
12442 #ifdef RLIMIT_MEMLOCK
12445 #ifdef RLIMIT_NPROC
12448 #ifdef RLIMIT_NOFILE
12454 #ifdef RLIMIT_LOCKS
12472 for (l = limits_tbl; l->option != what; l++)
12475 set = *argptr ? 1 : 0;
12479 if (all || argptr[1])
12480 ash_msg_and_raise_error("too many arguments");
12481 if (strncmp(p, "unlimited\n", 9) == 0)
12482 val = RLIM_INFINITY;
12486 while ((c = *p++) >= '0' && c <= '9') {
12487 val = (val * 10) + (long)(c - '0');
12488 // val is actually 'unsigned long int' and can't get < 0
12489 if (val < (rlim_t) 0)
12493 ash_msg_and_raise_error("bad number");
12494 val <<= l->factor_shift;
12498 const char *lname = limits_name;
12499 for (l = limits_tbl; l != &limits_tbl[ARRAY_SIZE(limits_tbl)]; l++) {
12500 getrlimit(l->cmd, &limit);
12501 out1fmt("%-20s ", lname);
12502 lname += strlen(lname) + 1;
12503 printlim(how, &limit, l);
12508 getrlimit(l->cmd, &limit);
12511 limit.rlim_max = val;
12513 limit.rlim_cur = val;
12514 if (setrlimit(l->cmd, &limit) < 0)
12515 ash_msg_and_raise_error("error setting limit (%m)");
12517 printlim(how, &limit, l);
12523 /* ============ Math support */
12525 #if ENABLE_ASH_MATH_SUPPORT
12527 /* Copyright (c) 2001 Aaron Lehmann <aaronl@vitelus.com>
12529 Permission is hereby granted, free of charge, to any person obtaining
12530 a copy of this software and associated documentation files (the
12531 "Software"), to deal in the Software without restriction, including
12532 without limitation the rights to use, copy, modify, merge, publish,
12533 distribute, sublicense, and/or sell copies of the Software, and to
12534 permit persons to whom the Software is furnished to do so, subject to
12535 the following conditions:
12537 The above copyright notice and this permission notice shall be
12538 included in all copies or substantial portions of the Software.
12540 THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
12541 EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
12542 MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
12543 IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
12544 CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
12545 TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
12546 SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
12549 /* This is my infix parser/evaluator. It is optimized for size, intended
12550 * as a replacement for yacc-based parsers. However, it may well be faster
12551 * than a comparable parser written in yacc. The supported operators are
12552 * listed in #defines below. Parens, order of operations, and error handling
12553 * are supported. This code is thread safe. The exact expression format should
12554 * be that which POSIX specifies for shells. */
12556 /* The code uses a simple two-stack algorithm. See
12557 * http://www.onthenet.com.au/~grahamis/int2008/week02/lect02.html
12558 * for a detailed explanation of the infix-to-postfix algorithm on which
12559 * this is based (this code differs in that it applies operators immediately
12560 * to the stack instead of adding them to a queue to end up with an
12563 /* To use the routine, call it with an expression string and error return
12567 * Aug 24, 2001 Manuel Novoa III
12569 * Reduced the generated code size by about 30% (i386) and fixed several bugs.
12571 * 1) In arith_apply():
12572 * a) Cached values of *numptr and &(numptr[-1]).
12573 * b) Removed redundant test for zero denominator.
12576 * a) Eliminated redundant code for processing operator tokens by moving
12577 * to a table-based implementation. Also folded handling of parens
12579 * b) Combined all 3 loops which called arith_apply to reduce generated
12580 * code size at the cost of speed.
12582 * 3) The following expressions were treated as valid by the original code:
12583 * 1() , 0! , 1 ( *3 ) .
12584 * These bugs have been fixed by internally enclosing the expression in
12585 * parens and then checking that all binary ops and right parens are
12586 * preceded by a valid expression (NUM_TOKEN).
12588 * Note: It may be desirable to replace Aaron's test for whitespace with
12589 * ctype's isspace() if it is used by another busybox applet or if additional
12590 * whitespace chars should be considered. Look below the "#include"s for a
12591 * precompiler test.
12595 * Aug 26, 2001 Manuel Novoa III
12597 * Return 0 for null expressions. Pointed out by Vladimir Oleynik.
12599 * Merge in Aaron's comments previously posted to the busybox list,
12600 * modified slightly to take account of my changes to the code.
12605 * (C) 2003 Vladimir Oleynik <dzo@simtreas.ru>
12607 * - allow access to variable,
12608 * used recursive find value indirection (c=2*2; a="c"; $((a+=2)) produce 6)
12609 * - realize assign syntax (VAR=expr, +=, *= etc)
12610 * - realize exponentiation (** operator)
12611 * - realize comma separated - expr, expr
12612 * - realise ++expr --expr expr++ expr--
12613 * - realise expr ? expr : expr (but, second expr calculate always)
12614 * - allow hexadecimal and octal numbers
12615 * - was restored loses XOR operator
12616 * - remove one goto label, added three ;-)
12617 * - protect $((num num)) as true zero expr (Manuel`s error)
12618 * - always use special isspace(), see comment from bash ;-)
12621 #define arith_isspace(arithval) \
12622 (arithval == ' ' || arithval == '\n' || arithval == '\t')
12624 typedef unsigned char operator;
12626 /* An operator's token id is a bit of a bitfield. The lower 5 bits are the
12627 * precedence, and 3 high bits are an ID unique across operators of that
12628 * precedence. The ID portion is so that multiple operators can have the
12629 * same precedence, ensuring that the leftmost one is evaluated first.
12630 * Consider * and /. */
12632 #define tok_decl(prec,id) (((id)<<5)|(prec))
12633 #define PREC(op) ((op) & 0x1F)
12635 #define TOK_LPAREN tok_decl(0,0)
12637 #define TOK_COMMA tok_decl(1,0)
12639 #define TOK_ASSIGN tok_decl(2,0)
12640 #define TOK_AND_ASSIGN tok_decl(2,1)
12641 #define TOK_OR_ASSIGN tok_decl(2,2)
12642 #define TOK_XOR_ASSIGN tok_decl(2,3)
12643 #define TOK_PLUS_ASSIGN tok_decl(2,4)
12644 #define TOK_MINUS_ASSIGN tok_decl(2,5)
12645 #define TOK_LSHIFT_ASSIGN tok_decl(2,6)
12646 #define TOK_RSHIFT_ASSIGN tok_decl(2,7)
12648 #define TOK_MUL_ASSIGN tok_decl(3,0)
12649 #define TOK_DIV_ASSIGN tok_decl(3,1)
12650 #define TOK_REM_ASSIGN tok_decl(3,2)
12652 /* all assign is right associativity and precedence eq, but (7+3)<<5 > 256 */
12653 #define convert_prec_is_assing(prec) do { if (prec == 3) prec = 2; } while (0)
12655 /* conditional is right associativity too */
12656 #define TOK_CONDITIONAL tok_decl(4,0)
12657 #define TOK_CONDITIONAL_SEP tok_decl(4,1)
12659 #define TOK_OR tok_decl(5,0)
12661 #define TOK_AND tok_decl(6,0)
12663 #define TOK_BOR tok_decl(7,0)
12665 #define TOK_BXOR tok_decl(8,0)
12667 #define TOK_BAND tok_decl(9,0)
12669 #define TOK_EQ tok_decl(10,0)
12670 #define TOK_NE tok_decl(10,1)
12672 #define TOK_LT tok_decl(11,0)
12673 #define TOK_GT tok_decl(11,1)
12674 #define TOK_GE tok_decl(11,2)
12675 #define TOK_LE tok_decl(11,3)
12677 #define TOK_LSHIFT tok_decl(12,0)
12678 #define TOK_RSHIFT tok_decl(12,1)
12680 #define TOK_ADD tok_decl(13,0)
12681 #define TOK_SUB tok_decl(13,1)
12683 #define TOK_MUL tok_decl(14,0)
12684 #define TOK_DIV tok_decl(14,1)
12685 #define TOK_REM tok_decl(14,2)
12687 /* exponent is right associativity */
12688 #define TOK_EXPONENT tok_decl(15,1)
12690 /* For now unary operators. */
12691 #define UNARYPREC 16
12692 #define TOK_BNOT tok_decl(UNARYPREC,0)
12693 #define TOK_NOT tok_decl(UNARYPREC,1)
12695 #define TOK_UMINUS tok_decl(UNARYPREC+1,0)
12696 #define TOK_UPLUS tok_decl(UNARYPREC+1,1)
12698 #define PREC_PRE (UNARYPREC+2)
12700 #define TOK_PRE_INC tok_decl(PREC_PRE, 0)
12701 #define TOK_PRE_DEC tok_decl(PREC_PRE, 1)
12703 #define PREC_POST (UNARYPREC+3)
12705 #define TOK_POST_INC tok_decl(PREC_POST, 0)
12706 #define TOK_POST_DEC tok_decl(PREC_POST, 1)
12708 #define SPEC_PREC (UNARYPREC+4)
12710 #define TOK_NUM tok_decl(SPEC_PREC, 0)
12711 #define TOK_RPAREN tok_decl(SPEC_PREC, 1)
12713 #define NUMPTR (*numstackptr)
12716 tok_have_assign(operator op)
12718 operator prec = PREC(op);
12720 convert_prec_is_assing(prec);
12721 return (prec == PREC(TOK_ASSIGN) ||
12722 prec == PREC_PRE || prec == PREC_POST);
12726 is_right_associativity(operator prec)
12728 return (prec == PREC(TOK_ASSIGN) || prec == PREC(TOK_EXPONENT)
12729 || prec == PREC(TOK_CONDITIONAL));
12734 arith_t contidional_second_val;
12735 char contidional_second_val_initialized;
12736 char *var; /* if NULL then is regular number,
12737 else is variable name */
12740 typedef struct chk_var_recursive_looped_t {
12742 struct chk_var_recursive_looped_t *next;
12743 } chk_var_recursive_looped_t;
12745 static chk_var_recursive_looped_t *prev_chk_var_recursive;
12748 arith_lookup_val(v_n_t *t)
12751 const char * p = lookupvar(t->var);
12756 /* recursive try as expression */
12757 chk_var_recursive_looped_t *cur;
12758 chk_var_recursive_looped_t cur_save;
12760 for (cur = prev_chk_var_recursive; cur; cur = cur->next) {
12761 if (strcmp(cur->var, t->var) == 0) {
12762 /* expression recursion loop detected */
12766 /* save current lookuped var name */
12767 cur = prev_chk_var_recursive;
12768 cur_save.var = t->var;
12769 cur_save.next = cur;
12770 prev_chk_var_recursive = &cur_save;
12772 t->val = arith (p, &errcode);
12773 /* restore previous ptr after recursiving */
12774 prev_chk_var_recursive = cur;
12777 /* allow undefined var as 0 */
12783 /* "applying" a token means performing it on the top elements on the integer
12784 * stack. For a unary operator it will only change the top element, but a
12785 * binary operator will pop two arguments and push a result */
12787 arith_apply(operator op, v_n_t *numstack, v_n_t **numstackptr)
12790 arith_t numptr_val, rez;
12791 int ret_arith_lookup_val;
12793 /* There is no operator that can work without arguments */
12794 if (NUMPTR == numstack) goto err;
12795 numptr_m1 = NUMPTR - 1;
12797 /* check operand is var with noninteger value */
12798 ret_arith_lookup_val = arith_lookup_val(numptr_m1);
12799 if (ret_arith_lookup_val)
12800 return ret_arith_lookup_val;
12802 rez = numptr_m1->val;
12803 if (op == TOK_UMINUS)
12805 else if (op == TOK_NOT)
12807 else if (op == TOK_BNOT)
12809 else if (op == TOK_POST_INC || op == TOK_PRE_INC)
12811 else if (op == TOK_POST_DEC || op == TOK_PRE_DEC)
12813 else if (op != TOK_UPLUS) {
12814 /* Binary operators */
12816 /* check and binary operators need two arguments */
12817 if (numptr_m1 == numstack) goto err;
12819 /* ... and they pop one */
12822 if (op == TOK_CONDITIONAL) {
12823 if (! numptr_m1->contidional_second_val_initialized) {
12824 /* protect $((expr1 ? expr2)) without ": expr" */
12827 rez = numptr_m1->contidional_second_val;
12828 } else if (numptr_m1->contidional_second_val_initialized) {
12829 /* protect $((expr1 : expr2)) without "expr ? " */
12832 numptr_m1 = NUMPTR - 1;
12833 if (op != TOK_ASSIGN) {
12834 /* check operand is var with noninteger value for not '=' */
12835 ret_arith_lookup_val = arith_lookup_val(numptr_m1);
12836 if (ret_arith_lookup_val)
12837 return ret_arith_lookup_val;
12839 if (op == TOK_CONDITIONAL) {
12840 numptr_m1->contidional_second_val = rez;
12842 rez = numptr_m1->val;
12843 if (op == TOK_BOR || op == TOK_OR_ASSIGN)
12845 else if (op == TOK_OR)
12846 rez = numptr_val || rez;
12847 else if (op == TOK_BAND || op == TOK_AND_ASSIGN)
12849 else if (op == TOK_BXOR || op == TOK_XOR_ASSIGN)
12851 else if (op == TOK_AND)
12852 rez = rez && numptr_val;
12853 else if (op == TOK_EQ)
12854 rez = (rez == numptr_val);
12855 else if (op == TOK_NE)
12856 rez = (rez != numptr_val);
12857 else if (op == TOK_GE)
12858 rez = (rez >= numptr_val);
12859 else if (op == TOK_RSHIFT || op == TOK_RSHIFT_ASSIGN)
12860 rez >>= numptr_val;
12861 else if (op == TOK_LSHIFT || op == TOK_LSHIFT_ASSIGN)
12862 rez <<= numptr_val;
12863 else if (op == TOK_GT)
12864 rez = (rez > numptr_val);
12865 else if (op == TOK_LT)
12866 rez = (rez < numptr_val);
12867 else if (op == TOK_LE)
12868 rez = (rez <= numptr_val);
12869 else if (op == TOK_MUL || op == TOK_MUL_ASSIGN)
12871 else if (op == TOK_ADD || op == TOK_PLUS_ASSIGN)
12873 else if (op == TOK_SUB || op == TOK_MINUS_ASSIGN)
12875 else if (op == TOK_ASSIGN || op == TOK_COMMA)
12877 else if (op == TOK_CONDITIONAL_SEP) {
12878 if (numptr_m1 == numstack) {
12879 /* protect $((expr : expr)) without "expr ? " */
12882 numptr_m1->contidional_second_val_initialized = op;
12883 numptr_m1->contidional_second_val = numptr_val;
12884 } else if (op == TOK_CONDITIONAL) {
12886 numptr_val : numptr_m1->contidional_second_val;
12887 } else if (op == TOK_EXPONENT) {
12888 if (numptr_val < 0)
12889 return -3; /* exponent less than 0 */
12894 while (numptr_val--)
12898 } else if (numptr_val==0) /* zero divisor check */
12900 else if (op == TOK_DIV || op == TOK_DIV_ASSIGN)
12902 else if (op == TOK_REM || op == TOK_REM_ASSIGN)
12905 if (tok_have_assign(op)) {
12906 char buf[sizeof(arith_t_type)*3 + 2];
12908 if (numptr_m1->var == NULL) {
12912 /* save to shell variable */
12913 #if ENABLE_ASH_MATH_SUPPORT_64
12914 snprintf(buf, sizeof(buf), "%lld", (arith_t_type) rez);
12916 snprintf(buf, sizeof(buf), "%ld", (arith_t_type) rez);
12918 setvar(numptr_m1->var, buf, 0);
12919 /* after saving, make previous value for v++ or v-- */
12920 if (op == TOK_POST_INC)
12922 else if (op == TOK_POST_DEC)
12925 numptr_m1->val = rez;
12926 /* protect geting var value, is number now */
12927 numptr_m1->var = NULL;
12933 /* longest must be first */
12934 static const char op_tokens[] ALIGN1 = {
12935 '<','<','=',0, TOK_LSHIFT_ASSIGN,
12936 '>','>','=',0, TOK_RSHIFT_ASSIGN,
12937 '<','<', 0, TOK_LSHIFT,
12938 '>','>', 0, TOK_RSHIFT,
12939 '|','|', 0, TOK_OR,
12940 '&','&', 0, TOK_AND,
12941 '!','=', 0, TOK_NE,
12942 '<','=', 0, TOK_LE,
12943 '>','=', 0, TOK_GE,
12944 '=','=', 0, TOK_EQ,
12945 '|','=', 0, TOK_OR_ASSIGN,
12946 '&','=', 0, TOK_AND_ASSIGN,
12947 '*','=', 0, TOK_MUL_ASSIGN,
12948 '/','=', 0, TOK_DIV_ASSIGN,
12949 '%','=', 0, TOK_REM_ASSIGN,
12950 '+','=', 0, TOK_PLUS_ASSIGN,
12951 '-','=', 0, TOK_MINUS_ASSIGN,
12952 '-','-', 0, TOK_POST_DEC,
12953 '^','=', 0, TOK_XOR_ASSIGN,
12954 '+','+', 0, TOK_POST_INC,
12955 '*','*', 0, TOK_EXPONENT,
12959 '=', 0, TOK_ASSIGN,
12971 '?', 0, TOK_CONDITIONAL,
12972 ':', 0, TOK_CONDITIONAL_SEP,
12973 ')', 0, TOK_RPAREN,
12974 '(', 0, TOK_LPAREN,
12978 #define endexpression (&op_tokens[sizeof(op_tokens)-7])
12981 arith(const char *expr, int *perrcode)
12983 char arithval; /* Current character under analysis */
12984 operator lasttok, op;
12987 const char *p = endexpression;
12990 size_t datasizes = strlen(expr) + 2;
12992 /* Stack of integers */
12993 /* The proof that there can be no more than strlen(startbuf)/2+1 integers
12994 * in any given correct or incorrect expression is left as an exercise to
12996 v_n_t *numstack = alloca(((datasizes)/2)*sizeof(v_n_t)),
12997 *numstackptr = numstack;
12998 /* Stack of operator tokens */
12999 operator *stack = alloca((datasizes) * sizeof(operator)),
13002 *stackptr++ = lasttok = TOK_LPAREN; /* start off with a left paren */
13003 *perrcode = errcode = 0;
13007 if (arithval == 0) {
13008 if (p == endexpression) {
13009 /* Null expression. */
13013 /* This is only reached after all tokens have been extracted from the
13014 * input stream. If there are still tokens on the operator stack, they
13015 * are to be applied in order. At the end, there should be a final
13016 * result on the integer stack */
13018 if (expr != endexpression + 1) {
13019 /* If we haven't done so already, */
13020 /* append a closing right paren */
13021 expr = endexpression;
13022 /* and let the loop process it. */
13025 /* At this point, we're done with the expression. */
13026 if (numstackptr != numstack+1) {
13027 /* ... but if there isn't, it's bad */
13029 return (*perrcode = -1);
13031 if (numstack->var) {
13032 /* expression is $((var)) only, lookup now */
13033 errcode = arith_lookup_val(numstack);
13036 *perrcode = errcode;
13037 return numstack->val;
13040 /* Continue processing the expression. */
13041 if (arith_isspace(arithval)) {
13042 /* Skip whitespace */
13045 p = endofname(expr);
13047 size_t var_name_size = (p-expr) + 1; /* trailing zero */
13049 numstackptr->var = alloca(var_name_size);
13050 safe_strncpy(numstackptr->var, expr, var_name_size);
13053 numstackptr->contidional_second_val_initialized = 0;
13058 if (isdigit(arithval)) {
13059 numstackptr->var = NULL;
13060 #if ENABLE_ASH_MATH_SUPPORT_64
13061 numstackptr->val = strtoll(expr, (char **) &expr, 0);
13063 numstackptr->val = strtol(expr, (char **) &expr, 0);
13067 for (p = op_tokens; ; p++) {
13071 /* strange operator not found */
13074 for (o = expr; *p && *o == *p; p++)
13081 /* skip tail uncompared token */
13084 /* skip zero delim */
13089 /* post grammar: a++ reduce to num */
13090 if (lasttok == TOK_POST_INC || lasttok == TOK_POST_DEC)
13093 /* Plus and minus are binary (not unary) _only_ if the last
13094 * token was as number, or a right paren (which pretends to be
13095 * a number, since it evaluates to one). Think about it.
13096 * It makes sense. */
13097 if (lasttok != TOK_NUM) {
13113 /* We don't want a unary operator to cause recursive descent on the
13114 * stack, because there can be many in a row and it could cause an
13115 * operator to be evaluated before its argument is pushed onto the
13116 * integer stack. */
13117 /* But for binary operators, "apply" everything on the operator
13118 * stack until we find an operator with a lesser priority than the
13119 * one we have just extracted. */
13120 /* Left paren is given the lowest priority so it will never be
13121 * "applied" in this way.
13122 * if associativity is right and priority eq, applied also skip
13125 if ((prec > 0 && prec < UNARYPREC) || prec == SPEC_PREC) {
13126 /* not left paren or unary */
13127 if (lasttok != TOK_NUM) {
13128 /* binary op must be preceded by a num */
13131 while (stackptr != stack) {
13132 if (op == TOK_RPAREN) {
13133 /* The algorithm employed here is simple: while we don't
13134 * hit an open paren nor the bottom of the stack, pop
13135 * tokens and apply them */
13136 if (stackptr[-1] == TOK_LPAREN) {
13138 /* Any operator directly after a */
13140 /* close paren should consider itself binary */
13144 operator prev_prec = PREC(stackptr[-1]);
13146 convert_prec_is_assing(prec);
13147 convert_prec_is_assing(prev_prec);
13148 if (prev_prec < prec)
13150 /* check right assoc */
13151 if (prev_prec == prec && is_right_associativity(prec))
13154 errcode = arith_apply(*--stackptr, numstack, &numstackptr);
13155 if (errcode) goto ret;
13157 if (op == TOK_RPAREN) {
13162 /* Push this operator to the stack and remember it. */
13163 *stackptr++ = lasttok = op;
13168 #endif /* ASH_MATH_SUPPORT */
13171 /* ============ main() and helpers */
13174 * Called to exit the shell.
13176 static void exitshell(void) ATTRIBUTE_NORETURN;
13184 status = exitstatus;
13185 TRACE(("pid %d, exitshell(%d)\n", getpid(), status));
13186 if (setjmp(loc.loc)) {
13187 if (exception == EXEXIT)
13188 /* dash bug: it just does _exit(exitstatus) here
13189 * but we have to do setjobctl(0) first!
13190 * (bug is still not fixed in dash-0.5.3 - if you run dash
13191 * under Midnight Commander, on exit from dash MC is backgrounded) */
13192 status = exitstatus;
13195 exception_handler = &loc;
13201 flush_stdout_stderr();
13211 /* from input.c: */
13212 basepf.nextc = basepf.buf = basebuf;
13215 signal(SIGCHLD, SIG_DFL);
13220 char ppid[sizeof(int)*3 + 1];
13222 struct stat st1, st2;
13225 for (envp = environ; envp && *envp; envp++) {
13226 if (strchr(*envp, '=')) {
13227 setvareq(*envp, VEXPORT|VTEXTFIXED);
13231 snprintf(ppid, sizeof(ppid), "%u", (unsigned) getppid());
13232 setvar("PPID", ppid, 0);
13234 p = lookupvar("PWD");
13236 if (*p != '/' || stat(p, &st1) || stat(".", &st2)
13237 || st1.st_dev != st2.st_dev || st1.st_ino != st2.st_ino)
13244 * Process the shell command line arguments.
13247 procargs(char **argv)
13250 const char *xminusc;
13255 /* if (xargv[0]) - mmm, this is always true! */
13257 for (i = 0; i < NOPTS; i++)
13261 /* it already printed err message */
13262 raise_exception(EXERROR);
13266 if (*xargv == NULL) {
13268 ash_msg_and_raise_error(bb_msg_requires_arg, "-c");
13271 if (iflag == 2 && sflag == 1 && isatty(0) && isatty(1))
13275 for (i = 0; i < NOPTS; i++)
13276 if (optlist[i] == 2)
13281 /* POSIX 1003.2: first arg after -c cmd is $0, remainder $1... */
13286 } else if (!sflag) {
13287 setinputfile(*xargv, 0);
13290 commandname = arg0;
13293 shellparam.p = xargv;
13294 #if ENABLE_ASH_GETOPTS
13295 shellparam.optind = 1;
13296 shellparam.optoff = -1;
13298 /* assert(shellparam.malloced == 0 && shellparam.nparam == 0); */
13300 shellparam.nparam++;
13307 * Read /etc/profile or .profile.
13310 read_profile(const char *name)
13314 if (setinputfile(name, INPUT_PUSH_FILE | INPUT_NOFILE_OK) < 0)
13323 * This routine is called when an error or an interrupt occurs in an
13324 * interactive shell and control is returned to the main command loop.
13332 /* from input.c: */
13333 parselleft = parsenleft = 0; /* clear input buffer */
13335 /* from parser.c: */
13338 /* from redir.c: */
13343 static short profile_buf[16384];
13344 extern int etext();
13348 * Main routine. We initialize things, parse the arguments, execute
13349 * profiles if we're a login shell, and then call cmdloop to execute
13350 * commands. The setjmp call sets up the location to jump to when an
13351 * exception occurs. When an exception occurs the variable "state"
13352 * is used to figure out how far we had gotten.
13354 int ash_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
13355 int ash_main(int argc ATTRIBUTE_UNUSED, char **argv)
13358 volatile int state;
13359 struct jmploc jmploc;
13360 struct stackmark smark;
13362 /* Initialize global data */
13366 #if ENABLE_ASH_ALIAS
13372 monitor(4, etext, profile_buf, sizeof(profile_buf), 50);
13375 #if ENABLE_FEATURE_EDITING
13376 line_input_state = new_line_input_t(FOR_SHELL | WITH_PATH_LOOKUP);
13379 if (setjmp(jmploc.loc)) {
13389 if (e == EXEXIT || s == 0 || iflag == 0 || shlvl)
13393 outcslow('\n', stderr);
13395 popstackmark(&smark);
13396 FORCE_INT_ON; /* enable interrupts */
13405 exception_handler = &jmploc;
13408 trace_puts("Shell args: ");
13409 trace_puts_args(argv);
13411 rootpid = getpid();
13413 #if ENABLE_ASH_RANDOM_SUPPORT
13414 rseed = rootpid + time(NULL);
13417 setstackmark(&smark);
13420 #if ENABLE_FEATURE_EDITING_SAVEHISTORY
13422 const char *hp = lookupvar("HISTFILE");
13425 hp = lookupvar("HOME");
13427 char *defhp = concat_path_file(hp, ".ash_history");
13428 setvar("HISTFILE", defhp, 0);
13434 if (argv[0] && argv[0][0] == '-')
13438 read_profile("/etc/profile");
13441 read_profile(".profile");
13447 getuid() == geteuid() && getgid() == getegid() &&
13451 shinit = lookupvar("ENV");
13452 if (shinit != NULL && *shinit != '\0') {
13453 read_profile(shinit);
13459 evalstring(minusc, 0);
13461 if (sflag || minusc == NULL) {
13462 #if ENABLE_FEATURE_EDITING_SAVEHISTORY
13464 const char *hp = lookupvar("HISTFILE");
13467 line_input_state->hist_file = hp;
13470 state4: /* XXX ??? - why isn't this before the "if" statement */
13478 extern void _mcleanup(void);
13487 const char *applet_name = "debug stuff usage";
13488 int main(int argc, char **argv)
13490 return ash_main(argc, argv);
13496 * Copyright (c) 1989, 1991, 1993, 1994
13497 * The Regents of the University of California. All rights reserved.
13499 * This code is derived from software contributed to Berkeley by
13500 * Kenneth Almquist.
13502 * Redistribution and use in source and binary forms, with or without
13503 * modification, are permitted provided that the following conditions
13505 * 1. Redistributions of source code must retain the above copyright
13506 * notice, this list of conditions and the following disclaimer.
13507 * 2. Redistributions in binary form must reproduce the above copyright
13508 * notice, this list of conditions and the following disclaimer in the
13509 * documentation and/or other materials provided with the distribution.
13510 * 3. Neither the name of the University nor the names of its contributors
13511 * may be used to endorse or promote products derived from this software
13512 * without specific prior written permission.
13514 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
13515 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
13516 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
13517 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
13518 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
13519 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
13520 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
13521 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
13522 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
13523 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF