1 /* vi: set sw=4 ts=4: */
3 * ash shell port for busybox
5 * Copyright (c) 1989, 1991, 1993, 1994
6 * The Regents of the University of California. All rights reserved.
8 * Copyright (c) 1997-2005 Herbert Xu <herbert@gondor.apana.org.au>
9 * was re-ported from NetBSD and debianized.
12 * This code is derived from software contributed to Berkeley by
15 * Licensed under the GPL v2 or later, see the file LICENSE in this tarball.
17 * Original BSD copyright notice is retained at the end of this file.
21 * rewrite arith.y to micro stack based cryptic algorithm by
22 * Copyright (c) 2001 Aaron Lehmann <aaronl@vitelus.com>
24 * Modified by Paul Mundt <lethal@linux-sh.org> (c) 2004 to support
27 * Modified by Vladimir Oleynik <dzo@simtreas.ru> (c) 2001-2005 to be
28 * used in busybox and size optimizations,
29 * rewrote arith (see notes to this), added locale support,
30 * rewrote dynamic variables.
35 * The follow should be set to reflect the type of system you have:
36 * JOBS -> 1 if you have Berkeley job control, 0 otherwise.
37 * define SYSV if you are running under System V.
38 * define DEBUG=1 to compile in debugging ('set -o debug' to turn on)
39 * define DEBUG=2 to compile in and turn on debugging.
41 * When debugging is on, debugging info will be written to ./trace and
42 * a quit signal will generate a core dump.
47 #if ENABLE_ASH_JOB_CONTROL
56 #include "busybox.h" /* for struct bb_applet */
60 #if JOBS || ENABLE_ASH_READ_NCHARS
63 extern char **environ
;
65 #if defined(__uClinux__)
66 #error "Do not even bother, ash will not run on uClinux"
70 /* ============ Misc helpers */
72 #define xbarrier() do { __asm__ __volatile__ ("": : :"memory"); } while (0)
74 /* C99 say: "char" declaration may be signed or unsigned default */
75 #define signed_char2int(sc) ((int)((signed char)sc))
78 /* ============ Shell options */
80 static const char *const optletters_optnames
[] = {
101 #define optletters(n) optletters_optnames[(n)][0]
102 #define optnames(n) (&optletters_optnames[(n)][1])
104 enum { NOPTS
= ARRAY_SIZE(optletters_optnames
) };
106 static char optlist
[NOPTS
] ALIGN1
;
108 #define eflag optlist[0]
109 #define fflag optlist[1]
110 #define Iflag optlist[2]
111 #define iflag optlist[3]
112 #define mflag optlist[4]
113 #define nflag optlist[5]
114 #define sflag optlist[6]
115 #define xflag optlist[7]
116 #define vflag optlist[8]
117 #define Cflag optlist[9]
118 #define aflag optlist[10]
119 #define bflag optlist[11]
120 #define uflag optlist[12]
121 #define viflag optlist[13]
123 #define nolog optlist[14]
124 #define debug optlist[15]
128 /* ============ Misc data */
130 static char nullstr
[1] ALIGN1
; /* zero length string */
131 static const char homestr
[] ALIGN1
= "HOME";
132 static const char snlfmt
[] ALIGN1
= "%s\n";
133 static const char illnum
[] ALIGN1
= "Illegal number: %s";
135 static char *minusc
; /* argument to -c option */
137 /* pid of main shell */
139 /* shell level: 0 for the main shell, 1 for its children, and so on */
141 #define rootshell (!shlvl)
142 /* trap handler commands */
143 static char *trap
[NSIG
];
144 static smallint isloginsh
;
145 /* current value of signal */
146 static char sigmode
[NSIG
- 1];
147 /* indicates specified signal received */
148 static char gotsig
[NSIG
- 1];
149 static char *arg0
; /* value of $0 */
152 /* ============ Interrupts / exceptions */
155 * We enclose jmp_buf in a structure so that we can declare pointers to
156 * jump locations. The global variable handler contains the location to
157 * jump to when an exception occurs, and the global variable exception
158 * contains a code identifying the exception. To implement nested
159 * exception handlers, the user should save the value of handler on entry
160 * to an inner scope, set handler to point to a jmploc structure for the
161 * inner scope, and restore handler on exit from the scope.
166 static struct jmploc
*exception_handler
;
167 static int exception
;
169 #define EXINT 0 /* SIGINT received */
170 #define EXERROR 1 /* a generic error */
171 #define EXSHELLPROC 2 /* execute a shell procedure */
172 #define EXEXEC 3 /* command execution failed */
173 #define EXEXIT 4 /* exit the shell */
174 #define EXSIG 5 /* trapped signal in wait(1) */
175 static volatile int suppressint
;
176 static volatile sig_atomic_t intpending
;
177 /* do we generate EXSIG events */
179 /* last pending signal */
180 static volatile sig_atomic_t pendingsig
;
183 * Sigmode records the current value of the signal handlers for the various
184 * modes. A value of zero means that the current handler is not known.
185 * S_HARD_IGN indicates that the signal was ignored on entry to the shell,
188 #define S_DFL 1 /* default signal handling (SIG_DFL) */
189 #define S_CATCH 2 /* signal is caught */
190 #define S_IGN 3 /* signal is ignored (SIG_IGN) */
191 #define S_HARD_IGN 4 /* signal is ignored permenantly */
192 #define S_RESET 5 /* temporary - to reset a hard ignored sig */
195 * These macros allow the user to suspend the handling of interrupt signals
196 * over a period of time. This is similar to SIGHOLD to or sigblock, but
197 * much more efficient and portable. (But hacking the kernel is so much
198 * more fun than worrying about efficiency and portability. :-))
207 * Called to raise an exception. Since C doesn't include exceptions, we
208 * just do a longjmp to the exception handler. The type of exception is
209 * stored in the global variable "exception".
211 static void raise_exception(int) ATTRIBUTE_NORETURN
;
213 raise_exception(int e
)
216 if (exception_handler
== NULL
)
221 longjmp(exception_handler
->loc
, 1);
225 * Called from trap.c when a SIGINT is received. (If the user specifies
226 * that SIGINT is to be trapped or ignored using the trap builtin, then
227 * this routine is not called.) Suppressint is nonzero when interrupts
228 * are held using the INT_OFF macro. (The test for iflag is just
229 * defensive programming.)
231 static void raise_interrupt(void) ATTRIBUTE_NORETURN
;
233 raise_interrupt(void)
239 /* Signal is not automatically re-enabled after it is raised,
242 sigprocmask(SIG_SETMASK
, &mask
, 0);
243 /* pendingsig = 0; - now done in onsig() */
246 if (gotsig
[SIGINT
- 1] && !trap
[SIGINT
]) {
247 if (!(rootshell
&& iflag
)) {
248 signal(SIGINT
, SIG_DFL
);
257 #if ENABLE_ASH_OPTIMIZE_FOR_SIZE
261 if (--suppressint
== 0 && intpending
) {
265 #define INT_ON int_on()
273 #define FORCE_INT_ON force_int_on()
278 if (--suppressint == 0 && intpending) \
281 #define FORCE_INT_ON \
288 #endif /* ASH_OPTIMIZE_FOR_SIZE */
290 #define SAVE_INT(v) ((v) = suppressint)
292 #define RESTORE_INT(v) \
296 if (suppressint == 0 && intpending) \
305 raise_exception(EXSIG); \
307 /* EXSIG is turned off by evalbltin(). */
310 * Ignore a signal. Only one usage site - in forkchild()
315 if (sigmode
[signo
- 1] != S_IGN
&& sigmode
[signo
- 1] != S_HARD_IGN
) {
316 signal(signo
, SIG_IGN
);
318 sigmode
[signo
- 1] = S_HARD_IGN
;
322 * Signal handler. Only one usage site - in setsignal()
327 gotsig
[signo
- 1] = 1;
330 if (exsig
|| (signo
== SIGINT
&& !trap
[SIGINT
])) {
340 /* ============ Stdout/stderr output */
343 outstr(const char *p
, FILE *file
)
351 flush_stdout_stderr(void)
368 outcslow(int c
, FILE *dest
)
376 static int out1fmt(const char *, ...) __attribute__((__format__(__printf__
,1,2)));
378 out1fmt(const char *fmt
, ...)
385 r
= vprintf(fmt
, ap
);
391 static int fmtstr(char *, size_t, const char *, ...) __attribute__((__format__(__printf__
,3,4)));
393 fmtstr(char *outbuf
, size_t length
, const char *fmt
, ...)
400 ret
= vsnprintf(outbuf
, length
, fmt
, ap
);
407 out1str(const char *p
)
413 out2str(const char *p
)
420 /* ============ Parser structures */
422 /* control characters in argument strings */
423 #define CTLESC '\201' /* escape next character */
424 #define CTLVAR '\202' /* variable defn */
425 #define CTLENDVAR '\203'
426 #define CTLBACKQ '\204'
427 #define CTLQUOTE 01 /* ored with CTLBACKQ code if in quotes */
428 /* CTLBACKQ | CTLQUOTE == '\205' */
429 #define CTLARI '\206' /* arithmetic expression */
430 #define CTLENDARI '\207'
431 #define CTLQUOTEMARK '\210'
433 /* variable substitution byte (follows CTLVAR) */
434 #define VSTYPE 0x0f /* type of variable substitution */
435 #define VSNUL 0x10 /* colon--treat the empty string as unset */
436 #define VSQUOTE 0x80 /* inside double quotes--suppress splitting */
438 /* values of VSTYPE field */
439 #define VSNORMAL 0x1 /* normal variable: $var or ${var} */
440 #define VSMINUS 0x2 /* ${var-text} */
441 #define VSPLUS 0x3 /* ${var+text} */
442 #define VSQUESTION 0x4 /* ${var?message} */
443 #define VSASSIGN 0x5 /* ${var=text} */
444 #define VSTRIMRIGHT 0x6 /* ${var%pattern} */
445 #define VSTRIMRIGHTMAX 0x7 /* ${var%%pattern} */
446 #define VSTRIMLEFT 0x8 /* ${var#pattern} */
447 #define VSTRIMLEFTMAX 0x9 /* ${var##pattern} */
448 #define VSLENGTH 0xa /* ${#var} */
450 static const char dolatstr
[] ALIGN1
= {
451 CTLVAR
, VSNORMAL
|VSQUOTE
, '@', '=', '\0'
487 union node
*redirect
;
493 struct nodelist
*cmdlist
;
499 union node
*redirect
;
512 union node
*elsepart
;
539 struct nodelist
*backquote
;
574 struct nredir nredir
;
575 struct nbinary nbinary
;
579 struct nclist nclist
;
588 struct nodelist
*next
;
601 freefunc(struct funcnode
*f
)
603 if (f
&& --f
->count
< 0)
608 /* ============ Debugging output */
612 static FILE *tracefile
;
615 trace_printf(const char *fmt
, ...)
622 vfprintf(tracefile
, fmt
, va
);
627 trace_vprintf(const char *fmt
, va_list va
)
631 vfprintf(tracefile
, fmt
, va
);
635 trace_puts(const char *s
)
643 trace_puts_quoted(char *s
)
650 putc('"', tracefile
);
651 for (p
= s
; *p
; p
++) {
653 case '\n': c
= 'n'; goto backslash
;
654 case '\t': c
= 't'; goto backslash
;
655 case '\r': c
= 'r'; goto backslash
;
656 case '"': c
= '"'; goto backslash
;
657 case '\\': c
= '\\'; goto backslash
;
658 case CTLESC
: c
= 'e'; goto backslash
;
659 case CTLVAR
: c
= 'v'; goto backslash
;
660 case CTLVAR
+CTLQUOTE
: c
= 'V'; goto backslash
;
661 case CTLBACKQ
: c
= 'q'; goto backslash
;
662 case CTLBACKQ
+CTLQUOTE
: c
= 'Q'; goto backslash
;
664 putc('\\', tracefile
);
668 if (*p
>= ' ' && *p
<= '~')
671 putc('\\', tracefile
);
672 putc(*p
>> 6 & 03, tracefile
);
673 putc(*p
>> 3 & 07, tracefile
);
674 putc(*p
& 07, tracefile
);
679 putc('"', tracefile
);
683 trace_puts_args(char **ap
)
690 trace_puts_quoted(*ap
);
692 putc('\n', tracefile
);
695 putc(' ', tracefile
);
710 /* leave open because libedit might be using it */
713 strcpy(s
, "./trace");
715 if (!freopen(s
, "a", tracefile
)) {
716 fprintf(stderr
, "Can't re-open %s\n", s
);
721 tracefile
= fopen(s
, "a");
722 if (tracefile
== NULL
) {
723 fprintf(stderr
, "Can't open %s\n", s
);
729 flags
= fcntl(fileno(tracefile
), F_GETFL
);
731 fcntl(fileno(tracefile
), F_SETFL
, flags
| O_APPEND
);
733 setlinebuf(tracefile
);
734 fputs("\nTracing started.\n", tracefile
);
738 indent(int amount
, char *pfx
, FILE *fp
)
742 for (i
= 0; i
< amount
; i
++) {
743 if (pfx
&& i
== amount
- 1)
749 /* little circular references here... */
750 static void shtree(union node
*n
, int ind
, char *pfx
, FILE *fp
);
753 sharg(union node
*arg
, FILE *fp
)
756 struct nodelist
*bqlist
;
759 if (arg
->type
!= NARG
) {
760 out1fmt("<node type %d>\n", arg
->type
);
763 bqlist
= arg
->narg
.backquote
;
764 for (p
= arg
->narg
.text
; *p
; p
++) {
773 if (subtype
== VSLENGTH
)
782 switch (subtype
& VSTYPE
) {
815 out1fmt("<subtype %d>", subtype
);
822 case CTLBACKQ
|CTLQUOTE
:
825 shtree(bqlist
->n
, -1, NULL
, fp
);
836 shcmd(union node
*cmd
, FILE *fp
)
844 for (np
= cmd
->ncmd
.args
; np
; np
= np
->narg
.next
) {
850 for (np
= cmd
->ncmd
.redirect
; np
; np
= np
->nfile
.next
) {
854 switch (np
->nfile
.type
) {
855 case NTO
: s
= ">>"+1; dftfd
= 1; break;
856 case NCLOBBER
: s
= ">|"; dftfd
= 1; break;
857 case NAPPEND
: s
= ">>"; dftfd
= 1; break;
858 case NTOFD
: s
= ">&"; dftfd
= 1; break;
859 case NFROM
: s
= "<"; break;
860 case NFROMFD
: s
= "<&"; break;
861 case NFROMTO
: s
= "<>"; break;
862 default: s
= "*error*"; break;
864 if (np
->nfile
.fd
!= dftfd
)
865 fprintf(fp
, "%d", np
->nfile
.fd
);
867 if (np
->nfile
.type
== NTOFD
|| np
->nfile
.type
== NFROMFD
) {
868 fprintf(fp
, "%d", np
->ndup
.dupfd
);
870 sharg(np
->nfile
.fname
, fp
);
877 shtree(union node
*n
, int ind
, char *pfx
, FILE *fp
)
885 indent(ind
, pfx
, fp
);
896 shtree(n
->nbinary
.ch1
, ind
, NULL
, fp
);
899 shtree(n
->nbinary
.ch2
, ind
, NULL
, fp
);
907 for (lp
= n
->npipe
.cmdlist
; lp
; lp
= lp
->next
) {
912 if (n
->npipe
.backgnd
)
918 fprintf(fp
, "<node type %d>", n
->type
);
926 showtree(union node
*n
)
928 trace_puts("showtree called\n");
929 shtree(n
, 1, NULL
, stdout
);
932 #define TRACE(param) trace_printf param
933 #define TRACEV(param) trace_vprintf param
938 #define TRACEV(param)
943 /* ============ Parser data */
946 * ash_vmsg() needs parsefile->fd, hence parsefile definition is moved up.
949 struct strlist
*next
;
958 struct strpush
*prev
; /* preceding string on stack */
962 struct alias
*ap
; /* if push was associated with an alias */
964 char *string
; /* remember the string since it may change */
968 struct parsefile
*prev
; /* preceding file on stack */
969 int linno
; /* current line */
970 int fd
; /* file descriptor (or -1 if string) */
971 int nleft
; /* number of chars left in this line */
972 int lleft
; /* number of chars left in this buffer */
973 char *nextc
; /* next char in buffer */
974 char *buf
; /* input buffer */
975 struct strpush
*strpush
; /* for pushing strings at this level */
976 struct strpush basestrpush
; /* so pushing one is fast */
979 static struct parsefile basepf
; /* top level input file */
980 static struct parsefile
*parsefile
= &basepf
; /* current input file */
981 static int startlinno
; /* line # where last token started */
982 static char *commandname
; /* currently executing command */
983 static struct strlist
*cmdenviron
; /* environment for builtin command */
984 static int exitstatus
; /* exit status of last command */
987 /* ============ Message printing */
990 ash_vmsg(const char *msg
, va_list ap
)
992 fprintf(stderr
, "%s: ", arg0
);
994 if (strcmp(arg0
, commandname
))
995 fprintf(stderr
, "%s: ", commandname
);
996 if (!iflag
|| parsefile
->fd
)
997 fprintf(stderr
, "line %d: ", startlinno
);
999 vfprintf(stderr
, msg
, ap
);
1000 outcslow('\n', stderr
);
1004 * Exverror is called to raise the error exception. If the second argument
1005 * is not NULL then error prints an error message using printf style
1006 * formatting. It then raises the error exception.
1008 static void ash_vmsg_and_raise(int, const char *, va_list) ATTRIBUTE_NORETURN
;
1010 ash_vmsg_and_raise(int cond
, const char *msg
, va_list ap
)
1014 TRACE(("ash_vmsg_and_raise(%d, \"", cond
));
1016 TRACE(("\") pid=%d\n", getpid()));
1018 TRACE(("ash_vmsg_and_raise(%d, NULL) pid=%d\n", cond
, getpid()));
1023 flush_stdout_stderr();
1024 raise_exception(cond
);
1028 static void ash_msg_and_raise_error(const char *, ...) ATTRIBUTE_NORETURN
;
1030 ash_msg_and_raise_error(const char *msg
, ...)
1035 ash_vmsg_and_raise(EXERROR
, msg
, ap
);
1040 static void ash_msg_and_raise(int, const char *, ...) ATTRIBUTE_NORETURN
;
1042 ash_msg_and_raise(int cond
, const char *msg
, ...)
1047 ash_vmsg_and_raise(cond
, msg
, ap
);
1053 * error/warning routines for external builtins
1056 ash_msg(const char *fmt
, ...)
1066 * Return a string describing an error. The returned string may be a
1067 * pointer to a static buffer that will be overwritten on the next call.
1068 * Action describes the operation that got the error.
1071 errmsg(int e
, const char *em
)
1073 if (e
== ENOENT
|| e
== ENOTDIR
) {
1080 /* ============ Memory allocation */
1083 * It appears that grabstackstr() will barf with such alignments
1084 * because stalloc() will return a string allocated in a new stackblock.
1086 #define SHELL_ALIGN(nbytes) (((nbytes) + SHELL_SIZE) & ~SHELL_SIZE)
1088 /* Most machines require the value returned from malloc to be aligned
1089 * in some way. The following macro will get this right
1090 * on many machines. */
1091 SHELL_SIZE
= sizeof(union {int i
; char *cp
; double d
; }) - 1,
1092 /* Minimum size of a block */
1093 MINSIZE
= SHELL_ALIGN(504),
1096 struct stack_block
{
1097 struct stack_block
*prev
;
1098 char space
[MINSIZE
];
1102 struct stack_block
*stackp
;
1105 struct stackmark
*marknext
;
1108 static struct stack_block stackbase
;
1109 static struct stack_block
*stackp
= &stackbase
;
1110 static struct stackmark
*markp
;
1111 static char *stacknxt
= stackbase
.space
;
1112 static size_t stacknleft
= MINSIZE
;
1113 static char *sstrend
= stackbase
.space
+ MINSIZE
;
1114 static int herefd
= -1;
1116 #define stackblock() ((void *)stacknxt)
1117 #define stackblocksize() stacknleft
1120 ckrealloc(void * p
, size_t nbytes
)
1122 p
= realloc(p
, nbytes
);
1124 ash_msg_and_raise_error(bb_msg_memory_exhausted
);
1129 ckmalloc(size_t nbytes
)
1131 return ckrealloc(NULL
, nbytes
);
1135 * Make a copy of a string in safe storage.
1138 ckstrdup(const char *s
)
1140 char *p
= strdup(s
);
1142 ash_msg_and_raise_error(bb_msg_memory_exhausted
);
1147 * Parse trees for commands are allocated in lifo order, so we use a stack
1148 * to make this more efficient, and also to avoid all sorts of exception
1149 * handling code to handle interrupts in the middle of a parse.
1151 * The size 504 was chosen because the Ultrix malloc handles that size
1155 stalloc(size_t nbytes
)
1160 aligned
= SHELL_ALIGN(nbytes
);
1161 if (aligned
> stacknleft
) {
1164 struct stack_block
*sp
;
1166 blocksize
= aligned
;
1167 if (blocksize
< MINSIZE
)
1168 blocksize
= MINSIZE
;
1169 len
= sizeof(struct stack_block
) - MINSIZE
+ blocksize
;
1170 if (len
< blocksize
)
1171 ash_msg_and_raise_error(bb_msg_memory_exhausted
);
1175 stacknxt
= sp
->space
;
1176 stacknleft
= blocksize
;
1177 sstrend
= stacknxt
+ blocksize
;
1182 stacknxt
+= aligned
;
1183 stacknleft
-= aligned
;
1191 if (!p
|| (stacknxt
< (char *)p
) || ((char *)p
< stackp
->space
)) {
1192 write(2, "stunalloc\n", 10);
1196 stacknleft
+= stacknxt
- (char *)p
;
1201 * Like strdup but works with the ash stack.
1204 ststrdup(const char *p
)
1206 size_t len
= strlen(p
) + 1;
1207 return memcpy(stalloc(len
), p
, len
);
1211 setstackmark(struct stackmark
*mark
)
1213 mark
->stackp
= stackp
;
1214 mark
->stacknxt
= stacknxt
;
1215 mark
->stacknleft
= stacknleft
;
1216 mark
->marknext
= markp
;
1221 popstackmark(struct stackmark
*mark
)
1223 struct stack_block
*sp
;
1229 markp
= mark
->marknext
;
1230 while (stackp
!= mark
->stackp
) {
1235 stacknxt
= mark
->stacknxt
;
1236 stacknleft
= mark
->stacknleft
;
1237 sstrend
= mark
->stacknxt
+ mark
->stacknleft
;
1242 * When the parser reads in a string, it wants to stick the string on the
1243 * stack and only adjust the stack pointer when it knows how big the
1244 * string is. Stackblock (defined in stack.h) returns a pointer to a block
1245 * of space on top of the stack and stackblocklen returns the length of
1246 * this block. Growstackblock will grow this space by at least one byte,
1247 * possibly moving it (like realloc). Grabstackblock actually allocates the
1248 * part of the block that has been used.
1251 growstackblock(void)
1255 newlen
= stacknleft
* 2;
1256 if (newlen
< stacknleft
)
1257 ash_msg_and_raise_error(bb_msg_memory_exhausted
);
1261 if (stacknxt
== stackp
->space
&& stackp
!= &stackbase
) {
1262 struct stack_block
*oldstackp
;
1263 struct stackmark
*xmark
;
1264 struct stack_block
*sp
;
1265 struct stack_block
*prevstackp
;
1271 prevstackp
= sp
->prev
;
1272 grosslen
= newlen
+ sizeof(struct stack_block
) - MINSIZE
;
1273 sp
= ckrealloc(sp
, grosslen
);
1274 sp
->prev
= prevstackp
;
1276 stacknxt
= sp
->space
;
1277 stacknleft
= newlen
;
1278 sstrend
= sp
->space
+ newlen
;
1281 * Stack marks pointing to the start of the old block
1282 * must be relocated to point to the new block
1285 while (xmark
!= NULL
&& xmark
->stackp
== oldstackp
) {
1286 xmark
->stackp
= stackp
;
1287 xmark
->stacknxt
= stacknxt
;
1288 xmark
->stacknleft
= stacknleft
;
1289 xmark
= xmark
->marknext
;
1293 char *oldspace
= stacknxt
;
1294 int oldlen
= stacknleft
;
1295 char *p
= stalloc(newlen
);
1297 /* free the space we just allocated */
1298 stacknxt
= memcpy(p
, oldspace
, oldlen
);
1299 stacknleft
+= newlen
;
1304 grabstackblock(size_t len
)
1306 len
= SHELL_ALIGN(len
);
1312 * The following routines are somewhat easier to use than the above.
1313 * The user declares a variable of type STACKSTR, which may be declared
1314 * to be a register. The macro STARTSTACKSTR initializes things. Then
1315 * the user uses the macro STPUTC to add characters to the string. In
1316 * effect, STPUTC(c, p) is the same as *p++ = c except that the stack is
1317 * grown as necessary. When the user is done, she can just leave the
1318 * string there and refer to it using stackblock(). Or she can allocate
1319 * the space for it using grabstackstr(). If it is necessary to allow
1320 * someone else to use the stack temporarily and then continue to grow
1321 * the string, the user should use grabstack to allocate the space, and
1322 * then call ungrabstr(p) to return to the previous mode of operation.
1324 * USTPUTC is like STPUTC except that it doesn't check for overflow.
1325 * CHECKSTACKSPACE can be called before USTPUTC to ensure that there
1326 * is space for at least one character.
1331 size_t len
= stackblocksize();
1332 if (herefd
>= 0 && len
>= 1024) {
1333 full_write(herefd
, stackblock(), len
);
1334 return stackblock();
1337 return stackblock() + len
;
1341 * Called from CHECKSTRSPACE.
1344 makestrspace(size_t newlen
, char *p
)
1346 size_t len
= p
- stacknxt
;
1347 size_t size
= stackblocksize();
1352 size
= stackblocksize();
1354 if (nleft
>= newlen
)
1358 return stackblock() + len
;
1362 stack_nputstr(const char *s
, size_t n
, char *p
)
1364 p
= makestrspace(n
, p
);
1365 p
= memcpy(p
, s
, n
) + n
;
1370 stack_putstr(const char *s
, char *p
)
1372 return stack_nputstr(s
, strlen(s
), p
);
1376 _STPUTC(int c
, char *p
)
1384 #define STARTSTACKSTR(p) ((p) = stackblock())
1385 #define STPUTC(c, p) ((p) = _STPUTC((c), (p)))
1386 #define CHECKSTRSPACE(n, p) \
1390 size_t m = sstrend - q; \
1392 (p) = makestrspace(l, q); \
1394 #define USTPUTC(c, p) (*p++ = (c))
1395 #define STACKSTRNUL(p) \
1397 if ((p) == sstrend) \
1398 p = growstackstr(); \
1401 #define STUNPUTC(p) (--p)
1402 #define STTOPC(p) (p[-1])
1403 #define STADJUST(amount, p) (p += (amount))
1405 #define grabstackstr(p) stalloc((char *)(p) - (char *)stackblock())
1406 #define ungrabstackstr(s, p) stunalloc((s))
1407 #define stackstrend() ((void *)sstrend)
1410 /* ============ String helpers */
1413 * prefix -- see if pfx is a prefix of string.
1416 prefix(const char *string
, const char *pfx
)
1419 if (*pfx
++ != *string
++)
1422 return (char *) string
;
1426 * Check for a valid number. This should be elsewhere.
1429 is_number(const char *p
)
1434 } while (*++p
!= '\0');
1439 * Convert a string of digits to an integer, printing an error message on
1443 number(const char *s
)
1446 ash_msg_and_raise_error(illnum
, s
);
1451 * Produce a possibly single quoted string suitable as input to the shell.
1452 * The return string is allocated on the stack.
1455 single_quote(const char *s
)
1465 len
= strchrnul(s
, '\'') - s
;
1467 q
= p
= makestrspace(len
+ 3, p
);
1470 q
= memcpy(q
, s
, len
) + len
;
1476 len
= strspn(s
, "'");
1480 q
= p
= makestrspace(len
+ 3, p
);
1483 q
= memcpy(q
, s
, len
) + len
;
1492 return stackblock();
1496 /* ============ nextopt */
1498 static char **argptr
; /* argument list for builtin commands */
1499 static char *optionarg
; /* set by nextopt (like getopt) */
1500 static char *optptr
; /* used by nextopt */
1503 * XXX - should get rid of. have all builtins use getopt(3). the
1504 * library getopt must have the BSD extension static variable "optreset"
1505 * otherwise it can't be used within the shell safely.
1507 * Standard option processing (a la getopt) for builtin routines. The
1508 * only argument that is passed to nextopt is the option string; the
1509 * other arguments are unnecessary. It return the character, or '\0' on
1513 nextopt(const char *optstring
)
1520 if (p
== NULL
|| *p
== '\0') {
1522 if (p
== NULL
|| *p
!= '-' || *++p
== '\0')
1525 if (LONE_DASH(p
)) /* check for "--" */
1529 for (q
= optstring
; *q
!= c
; ) {
1531 ash_msg_and_raise_error("illegal option -%c", c
);
1536 if (*p
== '\0' && (p
= *argptr
++) == NULL
)
1537 ash_msg_and_raise_error("no arg for -%c option", c
);
1546 /* ============ Math support definitions */
1548 #if ENABLE_ASH_MATH_SUPPORT_64
1549 typedef int64_t arith_t
;
1550 #define arith_t_type long long
1552 typedef long arith_t
;
1553 #define arith_t_type long
1556 #if ENABLE_ASH_MATH_SUPPORT
1557 static arith_t
dash_arith(const char *);
1558 static arith_t
arith(const char *expr
, int *perrcode
);
1561 #if ENABLE_ASH_RANDOM_SUPPORT
1562 static unsigned long rseed
;
1569 /* ============ Shell variables */
1572 #define VEXPORT 0x01 /* variable is exported */
1573 #define VREADONLY 0x02 /* variable cannot be modified */
1574 #define VSTRFIXED 0x04 /* variable struct is statically allocated */
1575 #define VTEXTFIXED 0x08 /* text is statically allocated */
1576 #define VSTACK 0x10 /* text is allocated on the stack */
1577 #define VUNSET 0x20 /* the variable is not set */
1578 #define VNOFUNC 0x40 /* don't call the callback function */
1579 #define VNOSET 0x80 /* do not set variable - just readonly test */
1580 #define VNOSAVE 0x100 /* when text is on the heap before setvareq */
1582 # define VDYNAMIC 0x200 /* dynamic variable */
1588 static const char defifsvar
[] ALIGN1
= "IFS= \t\n";
1589 #define defifs (defifsvar + 4)
1591 static const char defifs
[] ALIGN1
= " \t\n";
1595 int nparam
; /* # of positional parameters (without $0) */
1596 unsigned char malloc
; /* if parameter list dynamically allocated */
1597 char **p
; /* parameter list */
1598 #if ENABLE_ASH_GETOPTS
1599 int optind
; /* next parameter to be processed by getopts */
1600 int optoff
; /* used by getopts */
1604 static struct shparam shellparam
; /* $@ current positional parameters */
1607 * Free the list of positional parameters.
1610 freeparam(volatile struct shparam
*param
)
1614 if (param
->malloc
) {
1615 for (ap
= param
->p
; *ap
; ap
++)
1621 #if ENABLE_ASH_GETOPTS
1623 getoptsreset(const char *value
)
1625 shellparam
.optind
= number(value
);
1626 shellparam
.optoff
= -1;
1631 struct var
*next
; /* next entry in hash list */
1632 int flags
; /* flags are defined above */
1633 const char *text
; /* name=value */
1634 void (*func
)(const char *); /* function to be called when */
1635 /* the variable gets set/unset */
1639 struct localvar
*next
; /* next local variable in list */
1640 struct var
*vp
; /* the variable that was made local */
1641 int flags
; /* saved flags */
1642 const char *text
; /* saved text */
1645 /* Forward decls for varinit[] */
1646 #if ENABLE_LOCALE_SUPPORT
1648 change_lc_all(const char *value
)
1650 if (value
&& *value
!= '\0')
1651 setlocale(LC_ALL
, value
);
1654 change_lc_ctype(const char *value
)
1656 if (value
&& *value
!= '\0')
1657 setlocale(LC_CTYPE
, value
);
1661 static void chkmail(void);
1662 static void changemail(const char *);
1664 static void changepath(const char *);
1665 #if ENABLE_ASH_RANDOM_SUPPORT
1666 static void change_random(const char *);
1669 static struct var varinit
[] = {
1671 { NULL
, VSTRFIXED
|VTEXTFIXED
, defifsvar
, NULL
},
1673 { NULL
, VSTRFIXED
|VTEXTFIXED
|VUNSET
, "IFS\0", NULL
},
1676 { NULL
, VSTRFIXED
|VTEXTFIXED
|VUNSET
, "MAIL\0", changemail
},
1677 { NULL
, VSTRFIXED
|VTEXTFIXED
|VUNSET
, "MAILPATH\0", changemail
},
1679 { NULL
, VSTRFIXED
|VTEXTFIXED
, bb_PATH_root_path
, changepath
},
1680 { NULL
, VSTRFIXED
|VTEXTFIXED
, "PS1=$ ", NULL
},
1681 { NULL
, VSTRFIXED
|VTEXTFIXED
, "PS2=> ", NULL
},
1682 { NULL
, VSTRFIXED
|VTEXTFIXED
, "PS4=+ ", NULL
},
1683 #if ENABLE_ASH_GETOPTS
1684 { NULL
, VSTRFIXED
|VTEXTFIXED
, "OPTIND=1", getoptsreset
},
1686 #if ENABLE_ASH_RANDOM_SUPPORT
1687 { NULL
, VSTRFIXED
|VTEXTFIXED
|VUNSET
|VDYNAMIC
, "RANDOM\0", change_random
},
1689 #if ENABLE_LOCALE_SUPPORT
1690 { NULL
, VSTRFIXED
| VTEXTFIXED
| VUNSET
, "LC_ALL\0", change_lc_all
},
1691 { NULL
, VSTRFIXED
| VTEXTFIXED
| VUNSET
, "LC_CTYPE\0", change_lc_ctype
},
1693 #if ENABLE_FEATURE_EDITING_SAVEHISTORY
1694 { NULL
, VSTRFIXED
| VTEXTFIXED
| VUNSET
, "HISTFILE\0", NULL
},
1698 #define vifs varinit[0]
1700 #define vmail (&vifs)[1]
1701 #define vmpath (&vmail)[1]
1705 #define vpath (&vmpath)[1]
1706 #define vps1 (&vpath)[1]
1707 #define vps2 (&vps1)[1]
1708 #define vps4 (&vps2)[1]
1709 #define voptind (&vps4)[1]
1710 #if ENABLE_ASH_GETOPTS
1711 #define vrandom (&voptind)[1]
1713 #define vrandom (&vps4)[1]
1717 * The following macros access the values of the above variables.
1718 * They have to skip over the name. They return the null string
1719 * for unset variables.
1721 #define ifsval() (vifs.text + 4)
1722 #define ifsset() ((vifs.flags & VUNSET) == 0)
1723 #define mailval() (vmail.text + 5)
1724 #define mpathval() (vmpath.text + 9)
1725 #define pathval() (vpath.text + 5)
1726 #define ps1val() (vps1.text + 4)
1727 #define ps2val() (vps2.text + 4)
1728 #define ps4val() (vps4.text + 4)
1729 #define optindval() (voptind.text + 7)
1731 #define mpathset() ((vmpath.flags & VUNSET) == 0)
1734 * The parsefile structure pointed to by the global variable parsefile
1735 * contains information about the current file being read.
1738 struct redirtab
*next
;
1743 static struct redirtab
*redirlist
;
1744 static int nullredirs
;
1745 static int preverrout_fd
; /* save fd2 before print debug if xflag is set. */
1749 static struct var
*vartab
[VTABSIZE
];
1751 #define is_name(c) ((c) == '_' || isalpha((unsigned char)(c)))
1752 #define is_in_name(c) ((c) == '_' || isalnum((unsigned char)(c)))
1755 * Return of a legal variable name (a letter or underscore followed by zero or
1756 * more letters, underscores, and digits).
1759 endofname(const char *name
)
1767 if (!is_in_name(*p
))
1774 * Compares two strings up to the first = or '\0'. The first
1775 * string must be terminated by '='; the second may be terminated by
1776 * either '=' or '\0'.
1779 varcmp(const char *p
, const char *q
)
1783 while ((c
= *p
) == (d
= *q
)) {
1798 varequal(const char *a
, const char *b
)
1800 return !varcmp(a
, b
);
1804 * Find the appropriate entry in the hash table from the name.
1806 static struct var
**
1807 hashvar(const char *p
)
1811 hashval
= ((unsigned char) *p
) << 4;
1812 while (*p
&& *p
!= '=')
1813 hashval
+= (unsigned char) *p
++;
1814 return &vartab
[hashval
% VTABSIZE
];
1818 vpcmp(const void *a
, const void *b
)
1820 return varcmp(*(const char **)a
, *(const char **)b
);
1824 * This routine initializes the builtin variables.
1834 * PS1 depends on uid
1836 #if ENABLE_FEATURE_EDITING && ENABLE_FEATURE_EDITING_FANCY_PROMPT
1837 vps1
.text
= "PS1=\\w \\$ ";
1840 vps1
.text
= "PS1=# ";
1843 end
= vp
+ ARRAY_SIZE(varinit
);
1845 vpp
= hashvar(vp
->text
);
1848 } while (++vp
< end
);
1851 static struct var
**
1852 findvar(struct var
**vpp
, const char *name
)
1854 for (; *vpp
; vpp
= &(*vpp
)->next
) {
1855 if (varequal((*vpp
)->text
, name
)) {
1863 * Find the value of a variable. Returns NULL if not set.
1866 lookupvar(const char *name
)
1870 v
= *findvar(hashvar(name
), name
);
1874 * Dynamic variables are implemented roughly the same way they are
1875 * in bash. Namely, they're "special" so long as they aren't unset.
1876 * As soon as they're unset, they're no longer dynamic, and dynamic
1877 * lookup will no longer happen at that point. -- PFM.
1879 if ((v
->flags
& VDYNAMIC
))
1882 if (!(v
->flags
& VUNSET
))
1883 return strchrnul(v
->text
, '=') + 1;
1889 * Search the environment of a builtin command.
1892 bltinlookup(const char *name
)
1896 for (sp
= cmdenviron
; sp
; sp
= sp
->next
) {
1897 if (varequal(sp
->text
, name
))
1898 return strchrnul(sp
->text
, '=') + 1;
1900 return lookupvar(name
);
1904 * Same as setvar except that the variable and value are passed in
1905 * the first argument as name=value. Since the first argument will
1906 * be actually stored in the table, it should not be a string that
1908 * Called with interrupts off.
1911 setvareq(char *s
, int flags
)
1913 struct var
*vp
, **vpp
;
1916 flags
|= (VEXPORT
& (((unsigned) (1 - aflag
)) - 1));
1917 vp
= *findvar(vpp
, s
);
1919 if ((vp
->flags
& (VREADONLY
|VDYNAMIC
)) == VREADONLY
) {
1922 if (flags
& VNOSAVE
)
1925 ash_msg_and_raise_error("%.*s: is read only", strchrnul(n
, '=') - n
, n
);
1931 if (vp
->func
&& (flags
& VNOFUNC
) == 0)
1932 (*vp
->func
)(strchrnul(s
, '=') + 1);
1934 if ((vp
->flags
& (VTEXTFIXED
|VSTACK
)) == 0)
1935 free((char*)vp
->text
);
1937 flags
|= vp
->flags
& ~(VTEXTFIXED
|VSTACK
|VNOSAVE
|VUNSET
);
1942 vp
= ckmalloc(sizeof(*vp
));
1947 if (!(flags
& (VTEXTFIXED
|VSTACK
|VNOSAVE
)))
1954 * Set the value of a variable. The flags argument is ored with the
1955 * flags of the variable. If val is NULL, the variable is unset.
1958 setvar(const char *name
, const char *val
, int flags
)
1965 q
= endofname(name
);
1966 p
= strchrnul(q
, '=');
1968 if (!namelen
|| p
!= q
)
1969 ash_msg_and_raise_error("%.*s: bad variable name", namelen
, name
);
1974 vallen
= strlen(val
);
1977 nameeq
= ckmalloc(namelen
+ vallen
+ 2);
1978 p
= memcpy(nameeq
, name
, namelen
) + namelen
;
1981 p
= memcpy(p
, val
, vallen
) + vallen
;
1984 setvareq(nameeq
, flags
| VNOSAVE
);
1988 #if ENABLE_ASH_GETOPTS
1990 * Safe version of setvar, returns 1 on success 0 on failure.
1993 setvarsafe(const char *name
, const char *val
, int flags
)
1996 volatile int saveint
;
1997 struct jmploc
*volatile savehandler
= exception_handler
;
1998 struct jmploc jmploc
;
2001 if (setjmp(jmploc
.loc
))
2004 exception_handler
= &jmploc
;
2005 setvar(name
, val
, flags
);
2008 exception_handler
= savehandler
;
2009 RESTORE_INT(saveint
);
2015 * Unset the specified variable.
2018 unsetvar(const char *s
)
2024 vpp
= findvar(hashvar(s
), s
);
2028 int flags
= vp
->flags
;
2031 if (flags
& VREADONLY
)
2034 vp
->flags
&= ~VDYNAMIC
;
2038 if ((flags
& VSTRFIXED
) == 0) {
2040 if ((flags
& (VTEXTFIXED
|VSTACK
)) == 0)
2041 free((char*)vp
->text
);
2047 vp
->flags
&= ~VEXPORT
;
2057 * Process a linked list of variable assignments.
2060 listsetvar(struct strlist
*list_set_var
, int flags
)
2062 struct strlist
*lp
= list_set_var
;
2068 setvareq(lp
->text
, flags
);
2075 * Generate a list of variables satisfying the given conditions.
2078 listvars(int on
, int off
, char ***end
)
2089 for (vp
= *vpp
; vp
; vp
= vp
->next
) {
2090 if ((vp
->flags
& mask
) == on
) {
2091 if (ep
== stackstrend())
2092 ep
= growstackstr();
2093 *ep
++ = (char *) vp
->text
;
2096 } while (++vpp
< vartab
+ VTABSIZE
);
2097 if (ep
== stackstrend())
2098 ep
= growstackstr();
2102 return grabstackstr(ep
);
2106 /* ============ Path search helper
2108 * The variable path (passed by reference) should be set to the start
2109 * of the path before the first call; padvance will update
2110 * this value as it proceeds. Successive calls to padvance will return
2111 * the possible path expansions in sequence. If an option (indicated by
2112 * a percent sign) appears in the path entry then the global variable
2113 * pathopt will be set to point to it; otherwise pathopt will be set to
2116 static const char *pathopt
; /* set by padvance */
2119 padvance(const char **path
, const char *name
)
2129 for (p
= start
; *p
&& *p
!= ':' && *p
!= '%'; p
++);
2130 len
= p
- start
+ strlen(name
) + 2; /* "2" is for '/' and '\0' */
2131 while (stackblocksize() < len
)
2135 memcpy(q
, start
, p
- start
);
2143 while (*p
&& *p
!= ':') p
++;
2149 return stalloc(len
);
2153 /* ============ Prompt */
2155 static smallint doprompt
; /* if set, prompt the user */
2156 static smallint needprompt
; /* true if interactive and at start of line */
2158 #if ENABLE_FEATURE_EDITING
2159 static line_input_t
*line_input_state
;
2160 static const char *cmdedit_prompt
;
2162 putprompt(const char *s
)
2164 if (ENABLE_ASH_EXPAND_PRMT
) {
2165 free((char*)cmdedit_prompt
);
2166 cmdedit_prompt
= ckstrdup(s
);
2173 putprompt(const char *s
)
2179 #if ENABLE_ASH_EXPAND_PRMT
2180 /* expandstr() needs parsing machinery, so it is far away ahead... */
2181 static const char *expandstr(const char *ps
);
2183 #define expandstr(s) s
2187 setprompt(int whichprompt
)
2190 #if ENABLE_ASH_EXPAND_PRMT
2191 struct stackmark smark
;
2196 switch (whichprompt
) {
2206 #if ENABLE_ASH_EXPAND_PRMT
2207 setstackmark(&smark
);
2208 stalloc(stackblocksize());
2210 putprompt(expandstr(prompt
));
2211 #if ENABLE_ASH_EXPAND_PRMT
2212 popstackmark(&smark
);
2217 /* ============ The cd and pwd commands */
2219 #define CD_PHYSICAL 1
2222 static int docd(const char *, int);
2224 static char *curdir
= nullstr
; /* current working directory */
2225 static char *physdir
= nullstr
; /* physical working directory */
2234 while ((i
= nextopt("LP"))) {
2236 flags
^= CD_PHYSICAL
;
2245 * Update curdir (the name of the current directory) in response to a
2249 updatepwd(const char *dir
)
2256 cdcomppath
= ststrdup(dir
);
2259 if (curdir
== nullstr
)
2261 new = stack_putstr(curdir
, new);
2263 new = makestrspace(strlen(dir
) + 2, new);
2264 lim
= stackblock() + 1;
2268 if (new > lim
&& *lim
== '/')
2273 if (dir
[1] == '/' && dir
[2] != '/') {
2279 p
= strtok(cdcomppath
, "/");
2283 if (p
[1] == '.' && p
[2] == '\0') {
2295 new = stack_putstr(p
, new);
2303 return stackblock();
2307 * Find out what the current directory is. If we already know the current
2308 * directory, this routine returns immediately.
2313 char *dir
= getcwd(0, 0);
2314 return dir
? dir
: nullstr
;
2318 setpwd(const char *val
, int setold
)
2322 oldcur
= dir
= curdir
;
2325 setvar("OLDPWD", oldcur
, VEXPORT
);
2328 if (physdir
!= nullstr
) {
2329 if (physdir
!= oldcur
)
2333 if (oldcur
== val
|| !val
) {
2339 dir
= ckstrdup(val
);
2340 if (oldcur
!= dir
&& oldcur
!= nullstr
) {
2345 setvar("PWD", dir
, VEXPORT
);
2348 static void hashcd(void);
2351 * Actually do the chdir. We also call hashcd to let the routines in exec.c
2352 * know that the current directory has changed.
2355 docd(const char *dest
, int flags
)
2357 const char *dir
= 0;
2360 TRACE(("docd(\"%s\", %d) called\n", dest
, flags
));
2363 if (!(flags
& CD_PHYSICAL
)) {
2364 dir
= updatepwd(dest
);
2379 cdcmd(int argc
, char **argv
)
2391 dest
= bltinlookup(homestr
);
2392 else if (LONE_DASH(dest
)) {
2393 dest
= bltinlookup("OLDPWD");
2415 path
= bltinlookup("CDPATH");
2424 p
= padvance(&path
, dest
);
2425 if (stat(p
, &statb
) >= 0 && S_ISDIR(statb
.st_mode
)) {
2429 if (!docd(p
, flags
))
2434 ash_msg_and_raise_error("can't cd to %s", dest
);
2437 if (flags
& CD_PRINT
)
2438 out1fmt(snlfmt
, curdir
);
2443 pwdcmd(int argc
, char **argv
)
2446 const char *dir
= curdir
;
2450 if (physdir
== nullstr
)
2454 out1fmt(snlfmt
, dir
);
2459 /* ============ ... */
2461 #define IBUFSIZ COMMON_BUFSIZE
2462 #define basebuf bb_common_bufsiz1 /* buffer for top level input file */
2464 /* Syntax classes */
2465 #define CWORD 0 /* character is nothing special */
2466 #define CNL 1 /* newline character */
2467 #define CBACK 2 /* a backslash character */
2468 #define CSQUOTE 3 /* single quote */
2469 #define CDQUOTE 4 /* double quote */
2470 #define CENDQUOTE 5 /* a terminating quote */
2471 #define CBQUOTE 6 /* backwards single quote */
2472 #define CVAR 7 /* a dollar sign */
2473 #define CENDVAR 8 /* a '}' character */
2474 #define CLP 9 /* a left paren in arithmetic */
2475 #define CRP 10 /* a right paren in arithmetic */
2476 #define CENDFILE 11 /* end of file */
2477 #define CCTL 12 /* like CWORD, except it must be escaped */
2478 #define CSPCL 13 /* these terminate a word */
2479 #define CIGN 14 /* character should be ignored */
2481 #if ENABLE_ASH_ALIAS
2485 #define PEOA_OR_PEOF PEOA
2489 #define PEOA_OR_PEOF PEOF
2492 /* number syntax index */
2493 #define BASESYNTAX 0 /* not in quotes */
2494 #define DQSYNTAX 1 /* in double quotes */
2495 #define SQSYNTAX 2 /* in single quotes */
2496 #define ARISYNTAX 3 /* in arithmetic */
2497 #define PSSYNTAX 4 /* prompt */
2499 #if ENABLE_ASH_OPTIMIZE_FOR_SIZE
2500 #define USE_SIT_FUNCTION
2503 #if ENABLE_ASH_MATH_SUPPORT
2504 static const char S_I_T
[][4] = {
2505 #if ENABLE_ASH_ALIAS
2506 { CSPCL
, CIGN
, CIGN
, CIGN
}, /* 0, PEOA */
2508 { CSPCL
, CWORD
, CWORD
, CWORD
}, /* 1, ' ' */
2509 { CNL
, CNL
, CNL
, CNL
}, /* 2, \n */
2510 { CWORD
, CCTL
, CCTL
, CWORD
}, /* 3, !*-/:=?[]~ */
2511 { CDQUOTE
, CENDQUOTE
, CWORD
, CWORD
}, /* 4, '"' */
2512 { CVAR
, CVAR
, CWORD
, CVAR
}, /* 5, $ */
2513 { CSQUOTE
, CWORD
, CENDQUOTE
, CWORD
}, /* 6, "'" */
2514 { CSPCL
, CWORD
, CWORD
, CLP
}, /* 7, ( */
2515 { CSPCL
, CWORD
, CWORD
, CRP
}, /* 8, ) */
2516 { CBACK
, CBACK
, CCTL
, CBACK
}, /* 9, \ */
2517 { CBQUOTE
, CBQUOTE
, CWORD
, CBQUOTE
}, /* 10, ` */
2518 { CENDVAR
, CENDVAR
, CWORD
, CENDVAR
}, /* 11, } */
2519 #ifndef USE_SIT_FUNCTION
2520 { CENDFILE
, CENDFILE
, CENDFILE
, CENDFILE
}, /* 12, PEOF */
2521 { CWORD
, CWORD
, CWORD
, CWORD
}, /* 13, 0-9A-Za-z */
2522 { CCTL
, CCTL
, CCTL
, CCTL
} /* 14, CTLESC ... */
2526 static const char S_I_T
[][3] = {
2527 #if ENABLE_ASH_ALIAS
2528 { CSPCL
, CIGN
, CIGN
}, /* 0, PEOA */
2530 { CSPCL
, CWORD
, CWORD
}, /* 1, ' ' */
2531 { CNL
, CNL
, CNL
}, /* 2, \n */
2532 { CWORD
, CCTL
, CCTL
}, /* 3, !*-/:=?[]~ */
2533 { CDQUOTE
, CENDQUOTE
, CWORD
}, /* 4, '"' */
2534 { CVAR
, CVAR
, CWORD
}, /* 5, $ */
2535 { CSQUOTE
, CWORD
, CENDQUOTE
}, /* 6, "'" */
2536 { CSPCL
, CWORD
, CWORD
}, /* 7, ( */
2537 { CSPCL
, CWORD
, CWORD
}, /* 8, ) */
2538 { CBACK
, CBACK
, CCTL
}, /* 9, \ */
2539 { CBQUOTE
, CBQUOTE
, CWORD
}, /* 10, ` */
2540 { CENDVAR
, CENDVAR
, CWORD
}, /* 11, } */
2541 #ifndef USE_SIT_FUNCTION
2542 { CENDFILE
, CENDFILE
, CENDFILE
}, /* 12, PEOF */
2543 { CWORD
, CWORD
, CWORD
}, /* 13, 0-9A-Za-z */
2544 { CCTL
, CCTL
, CCTL
} /* 14, CTLESC ... */
2547 #endif /* ASH_MATH_SUPPORT */
2549 #ifdef USE_SIT_FUNCTION
2552 SIT(int c
, int syntax
)
2554 static const char spec_symbls
[] ALIGN1
= "\t\n !\"$&'()*-/:;<=>?[\\]`|}~";
2555 #if ENABLE_ASH_ALIAS
2556 static const char syntax_index_table
[] ALIGN1
= {
2557 1, 2, 1, 3, 4, 5, 1, 6, /* "\t\n !\"$&'" */
2558 7, 8, 3, 3, 3, 3, 1, 1, /* "()*-/:;<" */
2559 3, 1, 3, 3, 9, 3, 10, 1, /* "=>?[\\]`|" */
2563 static const char syntax_index_table
[] ALIGN1
= {
2564 0, 1, 0, 2, 3, 4, 0, 5, /* "\t\n !\"$&'" */
2565 6, 7, 2, 2, 2, 2, 0, 0, /* "()*-/:;<" */
2566 2, 0, 2, 2, 8, 2, 9, 0, /* "=>?[\\]`|" */
2573 if (c
== PEOF
) /* 2^8+2 */
2575 #if ENABLE_ASH_ALIAS
2576 if (c
== PEOA
) /* 2^8+1 */
2580 #define U_C(c) ((unsigned char)(c))
2582 if ((unsigned char)c
>= (unsigned char)(CTLESC
)
2583 && (unsigned char)c
<= (unsigned char)(CTLQUOTEMARK
)
2587 s
= strchr(spec_symbls
, c
);
2588 if (s
== NULL
|| *s
== '\0')
2590 indx
= syntax_index_table
[(s
- spec_symbls
)];
2592 return S_I_T
[indx
][syntax
];
2595 #else /* !USE_SIT_FUNCTION */
2597 #if ENABLE_ASH_ALIAS
2598 #define CSPCL_CIGN_CIGN_CIGN 0
2599 #define CSPCL_CWORD_CWORD_CWORD 1
2600 #define CNL_CNL_CNL_CNL 2
2601 #define CWORD_CCTL_CCTL_CWORD 3
2602 #define CDQUOTE_CENDQUOTE_CWORD_CWORD 4
2603 #define CVAR_CVAR_CWORD_CVAR 5
2604 #define CSQUOTE_CWORD_CENDQUOTE_CWORD 6
2605 #define CSPCL_CWORD_CWORD_CLP 7
2606 #define CSPCL_CWORD_CWORD_CRP 8
2607 #define CBACK_CBACK_CCTL_CBACK 9
2608 #define CBQUOTE_CBQUOTE_CWORD_CBQUOTE 10
2609 #define CENDVAR_CENDVAR_CWORD_CENDVAR 11
2610 #define CENDFILE_CENDFILE_CENDFILE_CENDFILE 12
2611 #define CWORD_CWORD_CWORD_CWORD 13
2612 #define CCTL_CCTL_CCTL_CCTL 14
2614 #define CSPCL_CWORD_CWORD_CWORD 0
2615 #define CNL_CNL_CNL_CNL 1
2616 #define CWORD_CCTL_CCTL_CWORD 2
2617 #define CDQUOTE_CENDQUOTE_CWORD_CWORD 3
2618 #define CVAR_CVAR_CWORD_CVAR 4
2619 #define CSQUOTE_CWORD_CENDQUOTE_CWORD 5
2620 #define CSPCL_CWORD_CWORD_CLP 6
2621 #define CSPCL_CWORD_CWORD_CRP 7
2622 #define CBACK_CBACK_CCTL_CBACK 8
2623 #define CBQUOTE_CBQUOTE_CWORD_CBQUOTE 9
2624 #define CENDVAR_CENDVAR_CWORD_CENDVAR 10
2625 #define CENDFILE_CENDFILE_CENDFILE_CENDFILE 11
2626 #define CWORD_CWORD_CWORD_CWORD 12
2627 #define CCTL_CCTL_CCTL_CCTL 13
2630 static const char syntax_index_table
[258] = {
2631 /* BASESYNTAX_DQSYNTAX_SQSYNTAX_ARISYNTAX */
2632 /* 0 PEOF */ CENDFILE_CENDFILE_CENDFILE_CENDFILE
,
2633 #if ENABLE_ASH_ALIAS
2634 /* 1 PEOA */ CSPCL_CIGN_CIGN_CIGN
,
2636 /* 2 -128 0x80 */ CWORD_CWORD_CWORD_CWORD
,
2637 /* 3 -127 CTLESC */ CCTL_CCTL_CCTL_CCTL
,
2638 /* 4 -126 CTLVAR */ CCTL_CCTL_CCTL_CCTL
,
2639 /* 5 -125 CTLENDVAR */ CCTL_CCTL_CCTL_CCTL
,
2640 /* 6 -124 CTLBACKQ */ CCTL_CCTL_CCTL_CCTL
,
2641 /* 7 -123 CTLQUOTE */ CCTL_CCTL_CCTL_CCTL
,
2642 /* 8 -122 CTLARI */ CCTL_CCTL_CCTL_CCTL
,
2643 /* 9 -121 CTLENDARI */ CCTL_CCTL_CCTL_CCTL
,
2644 /* 10 -120 CTLQUOTEMARK */ CCTL_CCTL_CCTL_CCTL
,
2645 /* 11 -119 */ CWORD_CWORD_CWORD_CWORD
,
2646 /* 12 -118 */ CWORD_CWORD_CWORD_CWORD
,
2647 /* 13 -117 */ CWORD_CWORD_CWORD_CWORD
,
2648 /* 14 -116 */ CWORD_CWORD_CWORD_CWORD
,
2649 /* 15 -115 */ CWORD_CWORD_CWORD_CWORD
,
2650 /* 16 -114 */ CWORD_CWORD_CWORD_CWORD
,
2651 /* 17 -113 */ CWORD_CWORD_CWORD_CWORD
,
2652 /* 18 -112 */ CWORD_CWORD_CWORD_CWORD
,
2653 /* 19 -111 */ CWORD_CWORD_CWORD_CWORD
,
2654 /* 20 -110 */ CWORD_CWORD_CWORD_CWORD
,
2655 /* 21 -109 */ CWORD_CWORD_CWORD_CWORD
,
2656 /* 22 -108 */ CWORD_CWORD_CWORD_CWORD
,
2657 /* 23 -107 */ CWORD_CWORD_CWORD_CWORD
,
2658 /* 24 -106 */ CWORD_CWORD_CWORD_CWORD
,
2659 /* 25 -105 */ CWORD_CWORD_CWORD_CWORD
,
2660 /* 26 -104 */ CWORD_CWORD_CWORD_CWORD
,
2661 /* 27 -103 */ CWORD_CWORD_CWORD_CWORD
,
2662 /* 28 -102 */ CWORD_CWORD_CWORD_CWORD
,
2663 /* 29 -101 */ CWORD_CWORD_CWORD_CWORD
,
2664 /* 30 -100 */ CWORD_CWORD_CWORD_CWORD
,
2665 /* 31 -99 */ CWORD_CWORD_CWORD_CWORD
,
2666 /* 32 -98 */ CWORD_CWORD_CWORD_CWORD
,
2667 /* 33 -97 */ CWORD_CWORD_CWORD_CWORD
,
2668 /* 34 -96 */ CWORD_CWORD_CWORD_CWORD
,
2669 /* 35 -95 */ CWORD_CWORD_CWORD_CWORD
,
2670 /* 36 -94 */ CWORD_CWORD_CWORD_CWORD
,
2671 /* 37 -93 */ CWORD_CWORD_CWORD_CWORD
,
2672 /* 38 -92 */ CWORD_CWORD_CWORD_CWORD
,
2673 /* 39 -91 */ CWORD_CWORD_CWORD_CWORD
,
2674 /* 40 -90 */ CWORD_CWORD_CWORD_CWORD
,
2675 /* 41 -89 */ CWORD_CWORD_CWORD_CWORD
,
2676 /* 42 -88 */ CWORD_CWORD_CWORD_CWORD
,
2677 /* 43 -87 */ CWORD_CWORD_CWORD_CWORD
,
2678 /* 44 -86 */ CWORD_CWORD_CWORD_CWORD
,
2679 /* 45 -85 */ CWORD_CWORD_CWORD_CWORD
,
2680 /* 46 -84 */ CWORD_CWORD_CWORD_CWORD
,
2681 /* 47 -83 */ CWORD_CWORD_CWORD_CWORD
,
2682 /* 48 -82 */ CWORD_CWORD_CWORD_CWORD
,
2683 /* 49 -81 */ CWORD_CWORD_CWORD_CWORD
,
2684 /* 50 -80 */ CWORD_CWORD_CWORD_CWORD
,
2685 /* 51 -79 */ CWORD_CWORD_CWORD_CWORD
,
2686 /* 52 -78 */ CWORD_CWORD_CWORD_CWORD
,
2687 /* 53 -77 */ CWORD_CWORD_CWORD_CWORD
,
2688 /* 54 -76 */ CWORD_CWORD_CWORD_CWORD
,
2689 /* 55 -75 */ CWORD_CWORD_CWORD_CWORD
,
2690 /* 56 -74 */ CWORD_CWORD_CWORD_CWORD
,
2691 /* 57 -73 */ CWORD_CWORD_CWORD_CWORD
,
2692 /* 58 -72 */ CWORD_CWORD_CWORD_CWORD
,
2693 /* 59 -71 */ CWORD_CWORD_CWORD_CWORD
,
2694 /* 60 -70 */ CWORD_CWORD_CWORD_CWORD
,
2695 /* 61 -69 */ CWORD_CWORD_CWORD_CWORD
,
2696 /* 62 -68 */ CWORD_CWORD_CWORD_CWORD
,
2697 /* 63 -67 */ CWORD_CWORD_CWORD_CWORD
,
2698 /* 64 -66 */ CWORD_CWORD_CWORD_CWORD
,
2699 /* 65 -65 */ CWORD_CWORD_CWORD_CWORD
,
2700 /* 66 -64 */ CWORD_CWORD_CWORD_CWORD
,
2701 /* 67 -63 */ CWORD_CWORD_CWORD_CWORD
,
2702 /* 68 -62 */ CWORD_CWORD_CWORD_CWORD
,
2703 /* 69 -61 */ CWORD_CWORD_CWORD_CWORD
,
2704 /* 70 -60 */ CWORD_CWORD_CWORD_CWORD
,
2705 /* 71 -59 */ CWORD_CWORD_CWORD_CWORD
,
2706 /* 72 -58 */ CWORD_CWORD_CWORD_CWORD
,
2707 /* 73 -57 */ CWORD_CWORD_CWORD_CWORD
,
2708 /* 74 -56 */ CWORD_CWORD_CWORD_CWORD
,
2709 /* 75 -55 */ CWORD_CWORD_CWORD_CWORD
,
2710 /* 76 -54 */ CWORD_CWORD_CWORD_CWORD
,
2711 /* 77 -53 */ CWORD_CWORD_CWORD_CWORD
,
2712 /* 78 -52 */ CWORD_CWORD_CWORD_CWORD
,
2713 /* 79 -51 */ CWORD_CWORD_CWORD_CWORD
,
2714 /* 80 -50 */ CWORD_CWORD_CWORD_CWORD
,
2715 /* 81 -49 */ CWORD_CWORD_CWORD_CWORD
,
2716 /* 82 -48 */ CWORD_CWORD_CWORD_CWORD
,
2717 /* 83 -47 */ CWORD_CWORD_CWORD_CWORD
,
2718 /* 84 -46 */ CWORD_CWORD_CWORD_CWORD
,
2719 /* 85 -45 */ CWORD_CWORD_CWORD_CWORD
,
2720 /* 86 -44 */ CWORD_CWORD_CWORD_CWORD
,
2721 /* 87 -43 */ CWORD_CWORD_CWORD_CWORD
,
2722 /* 88 -42 */ CWORD_CWORD_CWORD_CWORD
,
2723 /* 89 -41 */ CWORD_CWORD_CWORD_CWORD
,
2724 /* 90 -40 */ CWORD_CWORD_CWORD_CWORD
,
2725 /* 91 -39 */ CWORD_CWORD_CWORD_CWORD
,
2726 /* 92 -38 */ CWORD_CWORD_CWORD_CWORD
,
2727 /* 93 -37 */ CWORD_CWORD_CWORD_CWORD
,
2728 /* 94 -36 */ CWORD_CWORD_CWORD_CWORD
,
2729 /* 95 -35 */ CWORD_CWORD_CWORD_CWORD
,
2730 /* 96 -34 */ CWORD_CWORD_CWORD_CWORD
,
2731 /* 97 -33 */ CWORD_CWORD_CWORD_CWORD
,
2732 /* 98 -32 */ CWORD_CWORD_CWORD_CWORD
,
2733 /* 99 -31 */ CWORD_CWORD_CWORD_CWORD
,
2734 /* 100 -30 */ CWORD_CWORD_CWORD_CWORD
,
2735 /* 101 -29 */ CWORD_CWORD_CWORD_CWORD
,
2736 /* 102 -28 */ CWORD_CWORD_CWORD_CWORD
,
2737 /* 103 -27 */ CWORD_CWORD_CWORD_CWORD
,
2738 /* 104 -26 */ CWORD_CWORD_CWORD_CWORD
,
2739 /* 105 -25 */ CWORD_CWORD_CWORD_CWORD
,
2740 /* 106 -24 */ CWORD_CWORD_CWORD_CWORD
,
2741 /* 107 -23 */ CWORD_CWORD_CWORD_CWORD
,
2742 /* 108 -22 */ CWORD_CWORD_CWORD_CWORD
,
2743 /* 109 -21 */ CWORD_CWORD_CWORD_CWORD
,
2744 /* 110 -20 */ CWORD_CWORD_CWORD_CWORD
,
2745 /* 111 -19 */ CWORD_CWORD_CWORD_CWORD
,
2746 /* 112 -18 */ CWORD_CWORD_CWORD_CWORD
,
2747 /* 113 -17 */ CWORD_CWORD_CWORD_CWORD
,
2748 /* 114 -16 */ CWORD_CWORD_CWORD_CWORD
,
2749 /* 115 -15 */ CWORD_CWORD_CWORD_CWORD
,
2750 /* 116 -14 */ CWORD_CWORD_CWORD_CWORD
,
2751 /* 117 -13 */ CWORD_CWORD_CWORD_CWORD
,
2752 /* 118 -12 */ CWORD_CWORD_CWORD_CWORD
,
2753 /* 119 -11 */ CWORD_CWORD_CWORD_CWORD
,
2754 /* 120 -10 */ CWORD_CWORD_CWORD_CWORD
,
2755 /* 121 -9 */ CWORD_CWORD_CWORD_CWORD
,
2756 /* 122 -8 */ CWORD_CWORD_CWORD_CWORD
,
2757 /* 123 -7 */ CWORD_CWORD_CWORD_CWORD
,
2758 /* 124 -6 */ CWORD_CWORD_CWORD_CWORD
,
2759 /* 125 -5 */ CWORD_CWORD_CWORD_CWORD
,
2760 /* 126 -4 */ CWORD_CWORD_CWORD_CWORD
,
2761 /* 127 -3 */ CWORD_CWORD_CWORD_CWORD
,
2762 /* 128 -2 */ CWORD_CWORD_CWORD_CWORD
,
2763 /* 129 -1 */ CWORD_CWORD_CWORD_CWORD
,
2764 /* 130 0 */ CWORD_CWORD_CWORD_CWORD
,
2765 /* 131 1 */ CWORD_CWORD_CWORD_CWORD
,
2766 /* 132 2 */ CWORD_CWORD_CWORD_CWORD
,
2767 /* 133 3 */ CWORD_CWORD_CWORD_CWORD
,
2768 /* 134 4 */ CWORD_CWORD_CWORD_CWORD
,
2769 /* 135 5 */ CWORD_CWORD_CWORD_CWORD
,
2770 /* 136 6 */ CWORD_CWORD_CWORD_CWORD
,
2771 /* 137 7 */ CWORD_CWORD_CWORD_CWORD
,
2772 /* 138 8 */ CWORD_CWORD_CWORD_CWORD
,
2773 /* 139 9 "\t" */ CSPCL_CWORD_CWORD_CWORD
,
2774 /* 140 10 "\n" */ CNL_CNL_CNL_CNL
,
2775 /* 141 11 */ CWORD_CWORD_CWORD_CWORD
,
2776 /* 142 12 */ CWORD_CWORD_CWORD_CWORD
,
2777 /* 143 13 */ CWORD_CWORD_CWORD_CWORD
,
2778 /* 144 14 */ CWORD_CWORD_CWORD_CWORD
,
2779 /* 145 15 */ CWORD_CWORD_CWORD_CWORD
,
2780 /* 146 16 */ CWORD_CWORD_CWORD_CWORD
,
2781 /* 147 17 */ CWORD_CWORD_CWORD_CWORD
,
2782 /* 148 18 */ CWORD_CWORD_CWORD_CWORD
,
2783 /* 149 19 */ CWORD_CWORD_CWORD_CWORD
,
2784 /* 150 20 */ CWORD_CWORD_CWORD_CWORD
,
2785 /* 151 21 */ CWORD_CWORD_CWORD_CWORD
,
2786 /* 152 22 */ CWORD_CWORD_CWORD_CWORD
,
2787 /* 153 23 */ CWORD_CWORD_CWORD_CWORD
,
2788 /* 154 24 */ CWORD_CWORD_CWORD_CWORD
,
2789 /* 155 25 */ CWORD_CWORD_CWORD_CWORD
,
2790 /* 156 26 */ CWORD_CWORD_CWORD_CWORD
,
2791 /* 157 27 */ CWORD_CWORD_CWORD_CWORD
,
2792 /* 158 28 */ CWORD_CWORD_CWORD_CWORD
,
2793 /* 159 29 */ CWORD_CWORD_CWORD_CWORD
,
2794 /* 160 30 */ CWORD_CWORD_CWORD_CWORD
,
2795 /* 161 31 */ CWORD_CWORD_CWORD_CWORD
,
2796 /* 162 32 " " */ CSPCL_CWORD_CWORD_CWORD
,
2797 /* 163 33 "!" */ CWORD_CCTL_CCTL_CWORD
,
2798 /* 164 34 """ */ CDQUOTE_CENDQUOTE_CWORD_CWORD
,
2799 /* 165 35 "#" */ CWORD_CWORD_CWORD_CWORD
,
2800 /* 166 36 "$" */ CVAR_CVAR_CWORD_CVAR
,
2801 /* 167 37 "%" */ CWORD_CWORD_CWORD_CWORD
,
2802 /* 168 38 "&" */ CSPCL_CWORD_CWORD_CWORD
,
2803 /* 169 39 "'" */ CSQUOTE_CWORD_CENDQUOTE_CWORD
,
2804 /* 170 40 "(" */ CSPCL_CWORD_CWORD_CLP
,
2805 /* 171 41 ")" */ CSPCL_CWORD_CWORD_CRP
,
2806 /* 172 42 "*" */ CWORD_CCTL_CCTL_CWORD
,
2807 /* 173 43 "+" */ CWORD_CWORD_CWORD_CWORD
,
2808 /* 174 44 "," */ CWORD_CWORD_CWORD_CWORD
,
2809 /* 175 45 "-" */ CWORD_CCTL_CCTL_CWORD
,
2810 /* 176 46 "." */ CWORD_CWORD_CWORD_CWORD
,
2811 /* 177 47 "/" */ CWORD_CCTL_CCTL_CWORD
,
2812 /* 178 48 "0" */ CWORD_CWORD_CWORD_CWORD
,
2813 /* 179 49 "1" */ CWORD_CWORD_CWORD_CWORD
,
2814 /* 180 50 "2" */ CWORD_CWORD_CWORD_CWORD
,
2815 /* 181 51 "3" */ CWORD_CWORD_CWORD_CWORD
,
2816 /* 182 52 "4" */ CWORD_CWORD_CWORD_CWORD
,
2817 /* 183 53 "5" */ CWORD_CWORD_CWORD_CWORD
,
2818 /* 184 54 "6" */ CWORD_CWORD_CWORD_CWORD
,
2819 /* 185 55 "7" */ CWORD_CWORD_CWORD_CWORD
,
2820 /* 186 56 "8" */ CWORD_CWORD_CWORD_CWORD
,
2821 /* 187 57 "9" */ CWORD_CWORD_CWORD_CWORD
,
2822 /* 188 58 ":" */ CWORD_CCTL_CCTL_CWORD
,
2823 /* 189 59 ";" */ CSPCL_CWORD_CWORD_CWORD
,
2824 /* 190 60 "<" */ CSPCL_CWORD_CWORD_CWORD
,
2825 /* 191 61 "=" */ CWORD_CCTL_CCTL_CWORD
,
2826 /* 192 62 ">" */ CSPCL_CWORD_CWORD_CWORD
,
2827 /* 193 63 "?" */ CWORD_CCTL_CCTL_CWORD
,
2828 /* 194 64 "@" */ CWORD_CWORD_CWORD_CWORD
,
2829 /* 195 65 "A" */ CWORD_CWORD_CWORD_CWORD
,
2830 /* 196 66 "B" */ CWORD_CWORD_CWORD_CWORD
,
2831 /* 197 67 "C" */ CWORD_CWORD_CWORD_CWORD
,
2832 /* 198 68 "D" */ CWORD_CWORD_CWORD_CWORD
,
2833 /* 199 69 "E" */ CWORD_CWORD_CWORD_CWORD
,
2834 /* 200 70 "F" */ CWORD_CWORD_CWORD_CWORD
,
2835 /* 201 71 "G" */ CWORD_CWORD_CWORD_CWORD
,
2836 /* 202 72 "H" */ CWORD_CWORD_CWORD_CWORD
,
2837 /* 203 73 "I" */ CWORD_CWORD_CWORD_CWORD
,
2838 /* 204 74 "J" */ CWORD_CWORD_CWORD_CWORD
,
2839 /* 205 75 "K" */ CWORD_CWORD_CWORD_CWORD
,
2840 /* 206 76 "L" */ CWORD_CWORD_CWORD_CWORD
,
2841 /* 207 77 "M" */ CWORD_CWORD_CWORD_CWORD
,
2842 /* 208 78 "N" */ CWORD_CWORD_CWORD_CWORD
,
2843 /* 209 79 "O" */ CWORD_CWORD_CWORD_CWORD
,
2844 /* 210 80 "P" */ CWORD_CWORD_CWORD_CWORD
,
2845 /* 211 81 "Q" */ CWORD_CWORD_CWORD_CWORD
,
2846 /* 212 82 "R" */ CWORD_CWORD_CWORD_CWORD
,
2847 /* 213 83 "S" */ CWORD_CWORD_CWORD_CWORD
,
2848 /* 214 84 "T" */ CWORD_CWORD_CWORD_CWORD
,
2849 /* 215 85 "U" */ CWORD_CWORD_CWORD_CWORD
,
2850 /* 216 86 "V" */ CWORD_CWORD_CWORD_CWORD
,
2851 /* 217 87 "W" */ CWORD_CWORD_CWORD_CWORD
,
2852 /* 218 88 "X" */ CWORD_CWORD_CWORD_CWORD
,
2853 /* 219 89 "Y" */ CWORD_CWORD_CWORD_CWORD
,
2854 /* 220 90 "Z" */ CWORD_CWORD_CWORD_CWORD
,
2855 /* 221 91 "[" */ CWORD_CCTL_CCTL_CWORD
,
2856 /* 222 92 "\" */ CBACK_CBACK_CCTL_CBACK
,
2857 /* 223 93 "]" */ CWORD_CCTL_CCTL_CWORD
,
2858 /* 224 94 "^" */ CWORD_CWORD_CWORD_CWORD
,
2859 /* 225 95 "_" */ CWORD_CWORD_CWORD_CWORD
,
2860 /* 226 96 "`" */ CBQUOTE_CBQUOTE_CWORD_CBQUOTE
,
2861 /* 227 97 "a" */ CWORD_CWORD_CWORD_CWORD
,
2862 /* 228 98 "b" */ CWORD_CWORD_CWORD_CWORD
,
2863 /* 229 99 "c" */ CWORD_CWORD_CWORD_CWORD
,
2864 /* 230 100 "d" */ CWORD_CWORD_CWORD_CWORD
,
2865 /* 231 101 "e" */ CWORD_CWORD_CWORD_CWORD
,
2866 /* 232 102 "f" */ CWORD_CWORD_CWORD_CWORD
,
2867 /* 233 103 "g" */ CWORD_CWORD_CWORD_CWORD
,
2868 /* 234 104 "h" */ CWORD_CWORD_CWORD_CWORD
,
2869 /* 235 105 "i" */ CWORD_CWORD_CWORD_CWORD
,
2870 /* 236 106 "j" */ CWORD_CWORD_CWORD_CWORD
,
2871 /* 237 107 "k" */ CWORD_CWORD_CWORD_CWORD
,
2872 /* 238 108 "l" */ CWORD_CWORD_CWORD_CWORD
,
2873 /* 239 109 "m" */ CWORD_CWORD_CWORD_CWORD
,
2874 /* 240 110 "n" */ CWORD_CWORD_CWORD_CWORD
,
2875 /* 241 111 "o" */ CWORD_CWORD_CWORD_CWORD
,
2876 /* 242 112 "p" */ CWORD_CWORD_CWORD_CWORD
,
2877 /* 243 113 "q" */ CWORD_CWORD_CWORD_CWORD
,
2878 /* 244 114 "r" */ CWORD_CWORD_CWORD_CWORD
,
2879 /* 245 115 "s" */ CWORD_CWORD_CWORD_CWORD
,
2880 /* 246 116 "t" */ CWORD_CWORD_CWORD_CWORD
,
2881 /* 247 117 "u" */ CWORD_CWORD_CWORD_CWORD
,
2882 /* 248 118 "v" */ CWORD_CWORD_CWORD_CWORD
,
2883 /* 249 119 "w" */ CWORD_CWORD_CWORD_CWORD
,
2884 /* 250 120 "x" */ CWORD_CWORD_CWORD_CWORD
,
2885 /* 251 121 "y" */ CWORD_CWORD_CWORD_CWORD
,
2886 /* 252 122 "z" */ CWORD_CWORD_CWORD_CWORD
,
2887 /* 253 123 "{" */ CWORD_CWORD_CWORD_CWORD
,
2888 /* 254 124 "|" */ CSPCL_CWORD_CWORD_CWORD
,
2889 /* 255 125 "}" */ CENDVAR_CENDVAR_CWORD_CENDVAR
,
2890 /* 256 126 "~" */ CWORD_CCTL_CCTL_CWORD
,
2891 /* 257 127 */ CWORD_CWORD_CWORD_CWORD
,
2894 #define SIT(c, syntax) (S_I_T[(int)syntax_index_table[((int)c)+SYNBASE]][syntax])
2896 #endif /* USE_SIT_FUNCTION */
2899 /* ============ Alias handling */
2901 #if ENABLE_ASH_ALIAS
2903 #define ALIASINUSE 1
2915 static struct alias
*atab
[ATABSIZE
];
2917 static struct alias
**
2918 __lookupalias(const char *name
) {
2919 unsigned int hashval
;
2926 ch
= (unsigned char)*p
;
2930 ch
= (unsigned char)*++p
;
2932 app
= &atab
[hashval
% ATABSIZE
];
2934 for (; *app
; app
= &(*app
)->next
) {
2935 if (strcmp(name
, (*app
)->name
) == 0) {
2943 static struct alias
*
2944 lookupalias(const char *name
, int check
)
2946 struct alias
*ap
= *__lookupalias(name
);
2948 if (check
&& ap
&& (ap
->flag
& ALIASINUSE
))
2953 static struct alias
*
2954 freealias(struct alias
*ap
)
2958 if (ap
->flag
& ALIASINUSE
) {
2959 ap
->flag
|= ALIASDEAD
;
2971 setalias(const char *name
, const char *val
)
2973 struct alias
*ap
, **app
;
2975 app
= __lookupalias(name
);
2979 if (!(ap
->flag
& ALIASINUSE
)) {
2982 ap
->val
= ckstrdup(val
);
2983 ap
->flag
&= ~ALIASDEAD
;
2986 ap
= ckmalloc(sizeof(struct alias
));
2987 ap
->name
= ckstrdup(name
);
2988 ap
->val
= ckstrdup(val
);
2997 unalias(const char *name
)
3001 app
= __lookupalias(name
);
3005 *app
= freealias(*app
);
3016 struct alias
*ap
, **app
;
3020 for (i
= 0; i
< ATABSIZE
; i
++) {
3022 for (ap
= *app
; ap
; ap
= *app
) {
3023 *app
= freealias(*app
);
3033 printalias(const struct alias
*ap
)
3035 out1fmt("%s=%s\n", ap
->name
, single_quote(ap
->val
));
3039 * TODO - sort output
3042 aliascmd(int argc
, char **argv
)
3051 for (i
= 0; i
< ATABSIZE
; i
++)
3052 for (ap
= atab
[i
]; ap
; ap
= ap
->next
) {
3057 while ((n
= *++argv
) != NULL
) {
3058 v
= strchr(n
+1, '=');
3059 if (v
== NULL
) { /* n+1: funny ksh stuff */
3060 ap
= *__lookupalias(n
);
3062 fprintf(stderr
, "%s: %s not found\n", "alias", n
);
3076 unaliascmd(int argc
, char **argv
)
3080 while ((i
= nextopt("a")) != '\0') {
3086 for (i
= 0; *argptr
; argptr
++) {
3087 if (unalias(*argptr
)) {
3088 fprintf(stderr
, "%s: %s not found\n", "unalias", *argptr
);
3096 #endif /* ASH_ALIAS */
3099 /* ============ jobs.c */
3101 /* Mode argument to forkshell. Don't change FORK_FG or FORK_BG. */
3104 #define FORK_NOJOB 2
3106 /* mode flags for showjob(s) */
3107 #define SHOW_PGID 0x01 /* only show pgid - for jobs -p */
3108 #define SHOW_PID 0x04 /* include process pid */
3109 #define SHOW_CHANGED 0x08 /* only jobs whose state has changed */
3112 * A job structure contains information about a job. A job is either a
3113 * single process or a set of processes contained in a pipeline. In the
3114 * latter case, pidlist will be non-NULL, and will point to a -1 terminated
3119 pid_t pid
; /* process id */
3120 int status
; /* last process status from wait() */
3121 char *cmd
; /* text of command being run */
3125 struct procstat ps0
; /* status of process */
3126 struct procstat
*ps
; /* status or processes when more than one */
3128 int stopstatus
; /* status of a stopped job */
3131 nprocs
: 16, /* number of processes */
3133 #define JOBRUNNING 0 /* at least one proc running */
3134 #define JOBSTOPPED 1 /* all procs are stopped */
3135 #define JOBDONE 2 /* all procs are completed */
3137 sigint
: 1, /* job was killed by SIGINT */
3138 jobctl
: 1, /* job running under job control */
3140 waited
: 1, /* true if this entry has been waited for */
3141 used
: 1, /* true if this entry is in used */
3142 changed
: 1; /* true if status has changed */
3143 struct job
*prev_job
; /* previous job */
3146 static pid_t backgndpid
; /* pid of last background process */
3147 static smallint job_warning
; /* user was warned about stopped jobs (can be 2, 1 or 0). */
3149 static struct job
*makejob(union node
*, int);
3150 static int forkshell(struct job
*, union node
*, int);
3151 static int waitforjob(struct job
*);
3154 enum { jobctl
= 0 };
3155 #define setjobctl(on) do {} while (0)
3157 static smallint jobctl
; /* true if doing job control */
3158 static void setjobctl(int);
3162 * Set the signal handler for the specified signal. The routine figures
3163 * out what it should be set to.
3166 setsignal(int signo
)
3170 struct sigaction act
;
3175 else if (*t
!= '\0')
3179 if (rootshell
&& action
== S_DFL
) {
3182 if (iflag
|| minusc
|| sflag
== 0)
3205 t
= &sigmode
[signo
- 1];
3209 * current setting unknown
3211 if (sigaction(signo
, 0, &act
) == -1) {
3213 * Pretend it worked; maybe we should give a warning
3214 * here, but other shells don't. We don't alter
3215 * sigmode, so that we retry every time.
3219 if (act
.sa_handler
== SIG_IGN
) {
3221 && (signo
== SIGTSTP
|| signo
== SIGTTIN
|| signo
== SIGTTOU
)
3223 tsig
= S_IGN
; /* don't hard ignore these */
3227 tsig
= S_RESET
; /* force to be set */
3230 if (tsig
== S_HARD_IGN
|| tsig
== action
)
3234 act
.sa_handler
= onsig
;
3237 act
.sa_handler
= SIG_IGN
;
3240 act
.sa_handler
= SIG_DFL
;
3244 sigfillset(&act
.sa_mask
);
3245 sigaction(signo
, &act
, 0);
3248 /* mode flags for set_curjob */
3249 #define CUR_DELETE 2
3250 #define CUR_RUNNING 1
3251 #define CUR_STOPPED 0
3253 /* mode flags for dowait */
3254 #define DOWAIT_NORMAL 0
3255 #define DOWAIT_BLOCK 1
3258 /* pgrp of shell on invocation */
3259 static int initialpgrp
;
3260 static int ttyfd
= -1;
3263 static struct job
*jobtab
;
3265 static unsigned njobs
;
3267 static struct job
*curjob
;
3268 /* number of presumed living untracked jobs */
3272 set_curjob(struct job
*jp
, unsigned mode
)
3275 struct job
**jpp
, **curp
;
3277 /* first remove from list */
3278 jpp
= curp
= &curjob
;
3283 jpp
= &jp1
->prev_job
;
3285 *jpp
= jp1
->prev_job
;
3287 /* Then re-insert in correct position */
3295 /* job being deleted */
3298 /* newly created job or backgrounded job,
3299 put after all stopped jobs. */
3303 if (!jp1
|| jp1
->state
!= JOBSTOPPED
)
3306 jpp
= &jp1
->prev_job
;
3312 /* newly stopped job - becomes curjob */
3313 jp
->prev_job
= *jpp
;
3321 jobno(const struct job
*jp
)
3323 return jp
- jobtab
+ 1;
3328 * Convert a job name to a job structure.
3331 getjob(const char *name
, int getctl
)
3335 const char *err_msg
= "No such job: %s";
3339 char *(*match
)(const char *, const char *);
3354 if (c
== '+' || c
== '%') {
3356 err_msg
= "No current job";
3362 err_msg
= "No previous job";
3373 jp
= jobtab
+ num
- 1;
3390 if (match(jp
->ps
[0].cmd
, p
)) {
3394 err_msg
= "%s: ambiguous";
3401 err_msg
= "job %s not created under job control";
3402 if (getctl
&& jp
->jobctl
== 0)
3407 ash_msg_and_raise_error(err_msg
, name
);
3411 * Mark a job structure as unused.
3414 freejob(struct job
*jp
)
3416 struct procstat
*ps
;
3420 for (i
= jp
->nprocs
, ps
= jp
->ps
; --i
>= 0; ps
++) {
3421 if (ps
->cmd
!= nullstr
)
3424 if (jp
->ps
!= &jp
->ps0
)
3427 set_curjob(jp
, CUR_DELETE
);
3433 xtcsetpgrp(int fd
, pid_t pgrp
)
3435 if (tcsetpgrp(fd
, pgrp
))
3436 ash_msg_and_raise_error("cannot set tty process group (%m)");
3440 * Turn job control on and off.
3442 * Note: This code assumes that the third arg to ioctl is a character
3443 * pointer, which is true on Berkeley systems but not System V. Since
3444 * System V doesn't have job control yet, this isn't a problem now.
3446 * Called with interrupts off.
3454 if (on
== jobctl
|| rootshell
== 0)
3458 ofd
= fd
= open(_PATH_TTY
, O_RDWR
);
3460 /* BTW, bash will try to open(ttyname(0)) if open("/dev/tty") fails.
3461 * That sometimes helps to acquire controlling tty.
3462 * Obviously, a workaround for bugs when someone
3463 * failed to provide a controlling tty to bash! :) */
3465 while (!isatty(fd
) && --fd
>= 0)
3468 fd
= fcntl(fd
, F_DUPFD
, 10);
3472 close_on_exec_on(fd
);
3473 do { /* while we are in the background */
3474 pgrp
= tcgetpgrp(fd
);
3477 ash_msg("can't access tty; job control turned off");
3481 if (pgrp
== getpgrp())
3492 xtcsetpgrp(fd
, pgrp
);
3494 /* turning job control off */
3497 /* was xtcsetpgrp, but this can make exiting ash
3498 * with pty already deleted loop forever */
3499 tcsetpgrp(fd
, pgrp
);
3513 killcmd(int argc
, char **argv
)
3515 if (argv
[1] && strcmp(argv
[1], "-l") != 0) {
3518 if (argv
[i
][0] == '%') {
3519 struct job
*jp
= getjob(argv
[i
], 0);
3520 unsigned pid
= jp
->ps
[0].pid
;
3521 /* Enough space for ' -NNN<nul>' */
3522 argv
[i
] = alloca(sizeof(int)*3 + 3);
3523 /* kill_main has matching code to expect
3524 * leading space. Needed to not confuse
3525 * negative pids with "kill -SIGNAL_NO" syntax */
3526 sprintf(argv
[i
], " -%u", pid
);
3528 } while (argv
[++i
]);
3530 return kill_main(argc
, argv
);
3534 showpipe(struct job
*jp
, FILE *out
)
3536 struct procstat
*sp
;
3537 struct procstat
*spend
;
3539 spend
= jp
->ps
+ jp
->nprocs
;
3540 for (sp
= jp
->ps
+ 1; sp
< spend
; sp
++)
3541 fprintf(out
, " | %s", sp
->cmd
);
3542 outcslow('\n', out
);
3543 flush_stdout_stderr();
3548 restartjob(struct job
*jp
, int mode
)
3550 struct procstat
*ps
;
3556 if (jp
->state
== JOBDONE
)
3558 jp
->state
= JOBRUNNING
;
3560 if (mode
== FORK_FG
)
3561 xtcsetpgrp(ttyfd
, pgid
);
3562 killpg(pgid
, SIGCONT
);
3566 if (WIFSTOPPED(ps
->status
)) {
3572 status
= (mode
== FORK_FG
) ? waitforjob(jp
) : 0;
3578 fg_bgcmd(int argc
, char **argv
)
3585 mode
= (**argv
== 'f') ? FORK_FG
: FORK_BG
;
3590 jp
= getjob(*argv
, 1);
3591 if (mode
== FORK_BG
) {
3592 set_curjob(jp
, CUR_RUNNING
);
3593 fprintf(out
, "[%d] ", jobno(jp
));
3595 outstr(jp
->ps
->cmd
, out
);
3597 retval
= restartjob(jp
, mode
);
3598 } while (*argv
&& *++argv
);
3604 sprint_status(char *s
, int status
, int sigonly
)
3610 if (!WIFEXITED(status
)) {
3612 if (WIFSTOPPED(status
))
3613 st
= WSTOPSIG(status
);
3616 st
= WTERMSIG(status
);
3618 if (st
== SIGINT
|| st
== SIGPIPE
)
3621 if (WIFSTOPPED(status
))
3626 col
= fmtstr(s
, 32, strsignal(st
));
3627 if (WCOREDUMP(status
)) {
3628 col
+= fmtstr(s
+ col
, 16, " (core dumped)");
3630 } else if (!sigonly
) {
3631 st
= WEXITSTATUS(status
);
3633 col
= fmtstr(s
, 16, "Done(%d)", st
);
3635 col
= fmtstr(s
, 16, "Done");
3642 * Do a wait system call. If job control is compiled in, we accept
3643 * stopped processes. If block is zero, we return a value of zero
3644 * rather than blocking.
3646 * System V doesn't have a non-blocking wait system call. It does
3647 * have a SIGCLD signal that is sent to a process when one of it's
3648 * children dies. The obvious way to use SIGCLD would be to install
3649 * a handler for SIGCLD which simply bumped a counter when a SIGCLD
3650 * was received, and have waitproc bump another counter when it got
3651 * the status of a process. Waitproc would then know that a wait
3652 * system call would not block if the two counters were different.
3653 * This approach doesn't work because if a process has children that
3654 * have not been waited for, System V will send it a SIGCLD when it
3655 * installs a signal handler for SIGCLD. What this means is that when
3656 * a child exits, the shell will be sent SIGCLD signals continuously
3657 * until is runs out of stack space, unless it does a wait call before
3658 * restoring the signal handler. The code below takes advantage of
3659 * this (mis)feature by installing a signal handler for SIGCLD and
3660 * then checking to see whether it was called. If there are any
3661 * children to be waited for, it will be.
3663 * If neither SYSV nor BSD is defined, we don't implement nonblocking
3664 * waits at all. In this case, the user will not be informed when
3665 * a background process until the next time she runs a real program
3666 * (as opposed to running a builtin command or just typing return),
3667 * and the jobs command may give out of date information.
3670 waitproc(int block
, int *status
)
3680 return wait3(status
, flags
, (struct rusage
*)NULL
);
3684 * Wait for a process to terminate.
3687 dowait(int block
, struct job
*job
)
3692 struct job
*thisjob
;
3695 TRACE(("dowait(%d) called\n", block
));
3696 pid
= waitproc(block
, &status
);
3697 TRACE(("wait returns pid %d, status=%d\n", pid
, status
));
3702 for (jp
= curjob
; jp
; jp
= jp
->prev_job
) {
3703 struct procstat
*sp
;
3704 struct procstat
*spend
;
3705 if (jp
->state
== JOBDONE
)
3708 spend
= jp
->ps
+ jp
->nprocs
;
3711 if (sp
->pid
== pid
) {
3712 TRACE(("Job %d: changing status of proc %d "
3713 "from 0x%x to 0x%x\n",
3714 jobno(jp
), pid
, sp
->status
, status
));
3715 sp
->status
= status
;
3718 if (sp
->status
== -1)
3721 if (state
== JOBRUNNING
)
3723 if (WIFSTOPPED(sp
->status
)) {
3724 jp
->stopstatus
= sp
->status
;
3728 } while (++sp
< spend
);
3733 if (!WIFSTOPPED(status
))
3740 if (state
!= JOBRUNNING
) {
3741 thisjob
->changed
= 1;
3743 if (thisjob
->state
!= state
) {
3744 TRACE(("Job %d: changing state from %d to %d\n",
3745 jobno(thisjob
), thisjob
->state
, state
));
3746 thisjob
->state
= state
;
3748 if (state
== JOBSTOPPED
) {
3749 set_curjob(thisjob
, CUR_STOPPED
);
3758 if (thisjob
&& thisjob
== job
) {
3762 len
= sprint_status(s
, status
, 1);
3774 showjob(FILE *out
, struct job
*jp
, int mode
)
3776 struct procstat
*ps
;
3777 struct procstat
*psend
;
3784 if (mode
& SHOW_PGID
) {
3785 /* just output process (group) id of pipeline */
3786 fprintf(out
, "%d\n", ps
->pid
);
3790 col
= fmtstr(s
, 16, "[%d] ", jobno(jp
));
3795 else if (curjob
&& jp
== curjob
->prev_job
)
3798 if (mode
& SHOW_PID
)
3799 col
+= fmtstr(s
+ col
, 16, "%d ", ps
->pid
);
3801 psend
= ps
+ jp
->nprocs
;
3803 if (jp
->state
== JOBRUNNING
) {
3804 strcpy(s
+ col
, "Running");
3805 col
+= sizeof("Running") - 1;
3807 int status
= psend
[-1].status
;
3808 if (jp
->state
== JOBSTOPPED
)
3809 status
= jp
->stopstatus
;
3810 col
+= sprint_status(s
+ col
, status
, 0);
3816 /* for each process */
3817 col
= fmtstr(s
, 48, " |\n%*c%d ", indent_col
, ' ', ps
->pid
) - 3;
3819 fprintf(out
, "%s%*c%s",
3820 s
, 33 - col
>= 0 ? 33 - col
: 0, ' ', ps
->cmd
3822 if (!(mode
& SHOW_PID
)) {
3826 if (++ps
== psend
) {
3827 outcslow('\n', out
);
3834 if (jp
->state
== JOBDONE
) {
3835 TRACE(("showjob: freeing job %d\n", jobno(jp
)));
3841 * Print a list of jobs. If "change" is nonzero, only print jobs whose
3842 * statuses have changed since the last call to showjobs.
3845 showjobs(FILE *out
, int mode
)
3849 TRACE(("showjobs(%x) called\n", mode
));
3851 /* If not even one one job changed, there is nothing to do */
3852 while (dowait(DOWAIT_NORMAL
, NULL
) > 0)
3855 for (jp
= curjob
; jp
; jp
= jp
->prev_job
) {
3856 if (!(mode
& SHOW_CHANGED
) || jp
->changed
) {
3857 showjob(out
, jp
, mode
);
3863 jobscmd(int argc
, char **argv
)
3868 while ((m
= nextopt("lp"))) {
3878 showjob(stdout
, getjob(*argv
,0), mode
);
3881 showjobs(stdout
, mode
);
3888 getstatus(struct job
*job
)
3893 status
= job
->ps
[job
->nprocs
- 1].status
;
3894 retval
= WEXITSTATUS(status
);
3895 if (!WIFEXITED(status
)) {
3897 retval
= WSTOPSIG(status
);
3898 if (!WIFSTOPPED(status
))
3901 /* XXX: limits number of signals */
3902 retval
= WTERMSIG(status
);
3904 if (retval
== SIGINT
)
3910 TRACE(("getstatus: job %d, nproc %d, status %x, retval %x\n",
3911 jobno(job
), job
->nprocs
, status
, retval
));
3916 waitcmd(int argc
, char **argv
)
3929 /* wait for all jobs */
3934 /* no running procs */
3937 if (jp
->state
== JOBRUNNING
)
3942 dowait(DOWAIT_BLOCK
, 0);
3948 if (**argv
!= '%') {
3949 pid_t pid
= number(*argv
);
3953 if (job
->ps
[job
->nprocs
- 1].pid
== pid
)
3955 job
= job
->prev_job
;
3961 job
= getjob(*argv
, 0);
3962 /* loop until process terminated or stopped */
3963 while (job
->state
== JOBRUNNING
)
3964 dowait(DOWAIT_BLOCK
, 0);
3966 retval
= getstatus(job
);
3980 struct job
*jp
, *jq
;
3982 len
= njobs
* sizeof(*jp
);
3984 jp
= ckrealloc(jq
, len
+ 4 * sizeof(*jp
));
3986 offset
= (char *)jp
- (char *)jq
;
3988 /* Relocate pointers */
3991 jq
= (struct job
*)((char *)jq
+ l
);
3995 #define joff(p) ((struct job *)((char *)(p) + l))
3996 #define jmove(p) (p) = (void *)((char *)(p) + offset)
3997 if (joff(jp
)->ps
== &jq
->ps0
)
3998 jmove(joff(jp
)->ps
);
3999 if (joff(jp
)->prev_job
)
4000 jmove(joff(jp
)->prev_job
);
4010 jp
= (struct job
*)((char *)jp
+ len
);
4014 } while (--jq
>= jp
);
4019 * Return a new job structure.
4020 * Called with interrupts off.
4023 makejob(union node
*node
, int nprocs
)
4028 for (i
= njobs
, jp
= jobtab
; ; jp
++) {
4035 if (jp
->state
!= JOBDONE
|| !jp
->waited
)
4044 memset(jp
, 0, sizeof(*jp
));
4046 /* jp->jobctl is a bitfield.
4047 * "jp->jobctl |= jobctl" likely to give awful code */
4051 jp
->prev_job
= curjob
;
4056 jp
->ps
= ckmalloc(nprocs
* sizeof(struct procstat
));
4058 TRACE(("makejob(0x%lx, %d) returns %%%d\n", (long)node
, nprocs
,
4065 * Return a string identifying a command (to be printed by the
4068 static char *cmdnextc
;
4071 cmdputs(const char *s
)
4073 const char *p
, *str
;
4074 char c
, cc
[2] = " ";
4078 static const char vstype
[VSTYPE
+ 1][4] = {
4079 "", "}", "-", "+", "?", "=",
4080 "%", "%%", "#", "##"
4083 nextc
= makestrspace((strlen(s
) + 1) * 8, cmdnextc
);
4085 while ((c
= *p
++) != 0) {
4093 if ((subtype
& VSTYPE
) == VSLENGTH
)
4097 if (!(subtype
& VSQUOTE
) == !(quoted
& 1))
4103 str
= "\"}" + !(quoted
& 1);
4110 case CTLBACKQ
+CTLQUOTE
:
4113 #if ENABLE_ASH_MATH_SUPPORT
4128 if ((subtype
& VSTYPE
) != VSNORMAL
)
4130 str
= vstype
[subtype
& VSTYPE
];
4131 if (subtype
& VSNUL
)
4140 /* These can only happen inside quotes */
4153 while ((c
= *str
++)) {
4158 USTPUTC('"', nextc
);
4164 /* cmdtxt() and cmdlist() call each other */
4165 static void cmdtxt(union node
*n
);
4168 cmdlist(union node
*np
, int sep
)
4170 for (; np
; np
= np
->narg
.next
) {
4174 if (sep
&& np
->narg
.next
)
4180 cmdtxt(union node
*n
)
4183 struct nodelist
*lp
;
4195 lp
= n
->npipe
.cmdlist
;
4213 cmdtxt(n
->nbinary
.ch1
);
4229 cmdtxt(n
->nif
.test
);
4232 if (n
->nif
.elsepart
) {
4235 n
= n
->nif
.elsepart
;
4251 cmdtxt(n
->nbinary
.ch1
);
4261 cmdputs(n
->nfor
.var
);
4263 cmdlist(n
->nfor
.args
, 1);
4268 cmdputs(n
->narg
.text
);
4272 cmdlist(n
->ncmd
.args
, 1);
4273 cmdlist(n
->ncmd
.redirect
, 0);
4286 cmdputs(n
->ncase
.expr
->narg
.text
);
4288 for (np
= n
->ncase
.cases
; np
; np
= np
->nclist
.next
) {
4289 cmdtxt(np
->nclist
.pattern
);
4291 cmdtxt(np
->nclist
.body
);
4317 s
[0] = n
->nfile
.fd
+ '0';
4321 if (n
->type
== NTOFD
|| n
->type
== NFROMFD
) {
4322 s
[0] = n
->ndup
.dupfd
+ '0';
4332 commandtext(union node
*n
)
4336 STARTSTACKSTR(cmdnextc
);
4338 name
= stackblock();
4339 TRACE(("commandtext: name %p, end %p\n\t\"%s\"\n",
4340 name
, cmdnextc
, cmdnextc
));
4341 return ckstrdup(name
);
4346 * Fork off a subshell. If we are doing job control, give the subshell its
4347 * own process group. Jp is a job structure that the job is to be added to.
4348 * N is the command that will be evaluated by the child. Both jp and n may
4349 * be NULL. The mode parameter can be one of the following:
4350 * FORK_FG - Fork off a foreground process.
4351 * FORK_BG - Fork off a background process.
4352 * FORK_NOJOB - Like FORK_FG, but don't give the process its own
4353 * process group even if job control is on.
4355 * When job control is turned off, background processes have their standard
4356 * input redirected to /dev/null (except for the second and later processes
4359 * Called with interrupts off.
4362 * Clear traps on a fork.
4369 for (tp
= trap
; tp
< &trap
[NSIG
]; tp
++) {
4370 if (*tp
&& **tp
) { /* trap not NULL or SIG_IGN */
4375 setsignal(tp
- trap
);
4381 /* Lives far away from here, needed for forkchild */
4382 static void closescript(void);
4384 /* Called after fork(), in child */
4386 forkchild(struct job
*jp
, union node
*n
, int mode
)
4390 TRACE(("Child shell %d\n", getpid()));
4397 /* do job control only in root shell */
4399 if (mode
!= FORK_NOJOB
&& jp
->jobctl
&& !oldlvl
) {
4402 if (jp
->nprocs
== 0)
4405 pgrp
= jp
->ps
[0].pid
;
4406 /* This can fail because we are doing it in the parent also */
4407 (void)setpgid(0, pgrp
);
4408 if (mode
== FORK_FG
)
4409 xtcsetpgrp(ttyfd
, pgrp
);
4414 if (mode
== FORK_BG
) {
4417 if (jp
->nprocs
== 0) {
4419 if (open(bb_dev_null
, O_RDONLY
) != 0)
4420 ash_msg_and_raise_error("can't open %s", bb_dev_null
);
4423 if (!oldlvl
&& iflag
) {
4428 for (jp
= curjob
; jp
; jp
= jp
->prev_job
)
4433 /* Called after fork(), in parent */
4435 forkparent(struct job
*jp
, union node
*n
, int mode
, pid_t pid
)
4437 TRACE(("In parent shell: child = %d\n", pid
));
4439 while (jobless
&& dowait(DOWAIT_NORMAL
, 0) > 0);
4444 if (mode
!= FORK_NOJOB
&& jp
->jobctl
) {
4447 if (jp
->nprocs
== 0)
4450 pgrp
= jp
->ps
[0].pid
;
4451 /* This can fail because we are doing it in the child also */
4455 if (mode
== FORK_BG
) {
4456 backgndpid
= pid
; /* set $! */
4457 set_curjob(jp
, CUR_RUNNING
);
4460 struct procstat
*ps
= &jp
->ps
[jp
->nprocs
++];
4466 ps
->cmd
= commandtext(n
);
4472 forkshell(struct job
*jp
, union node
*n
, int mode
)
4476 TRACE(("forkshell(%%%d, %p, %d) called\n", jobno(jp
), n
, mode
));
4479 TRACE(("Fork failed, errno=%d", errno
));
4482 ash_msg_and_raise_error("cannot fork");
4485 forkchild(jp
, n
, mode
);
4487 forkparent(jp
, n
, mode
, pid
);
4492 * Wait for job to finish.
4494 * Under job control we have the problem that while a child process is
4495 * running interrupts generated by the user are sent to the child but not
4496 * to the shell. This means that an infinite loop started by an inter-
4497 * active user may be hard to kill. With job control turned off, an
4498 * interactive user may place an interactive program inside a loop. If
4499 * the interactive program catches interrupts, the user doesn't want
4500 * these interrupts to also abort the loop. The approach we take here
4501 * is to have the shell ignore interrupt signals while waiting for a
4502 * foreground process to terminate, and then send itself an interrupt
4503 * signal if the child process was terminated by an interrupt signal.
4504 * Unfortunately, some programs want to do a bit of cleanup and then
4505 * exit on interrupt; unless these processes terminate themselves by
4506 * sending a signal to themselves (instead of calling exit) they will
4507 * confuse this approach.
4509 * Called with interrupts off.
4512 waitforjob(struct job
*jp
)
4516 TRACE(("waitforjob(%%%d) called\n", jobno(jp
)));
4517 while (jp
->state
== JOBRUNNING
) {
4518 dowait(DOWAIT_BLOCK
, jp
);
4523 xtcsetpgrp(ttyfd
, rootpid
);
4525 * This is truly gross.
4526 * If we're doing job control, then we did a TIOCSPGRP which
4527 * caused us (the shell) to no longer be in the controlling
4528 * session -- so we wouldn't have seen any ^C/SIGINT. So, we
4529 * intuit from the subprocess exit status whether a SIGINT
4530 * occurred, and if so interrupt ourselves. Yuck. - mycroft
4535 if (jp
->state
== JOBDONE
)
4542 * return 1 if there are stopped jobs, otherwise 0
4554 if (jp
&& jp
->state
== JOBSTOPPED
) {
4555 out2str("You have stopped jobs.\n");
4564 /* ============ redir.c
4566 * Code for dealing with input/output redirection.
4569 #define EMPTY -2 /* marks an unused slot in redirtab */
4571 # define PIPESIZE 4096 /* amount of buffering in a pipe */
4573 # define PIPESIZE PIPE_BUF
4577 * Open a file in noclobber mode.
4578 * The code was copied from bash.
4581 noclobberopen(const char *fname
)
4584 struct stat finfo
, finfo2
;
4587 * If the file exists and is a regular file, return an error
4590 r
= stat(fname
, &finfo
);
4591 if (r
== 0 && S_ISREG(finfo
.st_mode
)) {
4597 * If the file was not present (r != 0), make sure we open it
4598 * exclusively so that if it is created before we open it, our open
4599 * will fail. Make sure that we do not truncate an existing file.
4600 * Note that we don't turn on O_EXCL unless the stat failed -- if the
4601 * file was not a regular file, we leave O_EXCL off.
4604 return open(fname
, O_WRONLY
|O_CREAT
|O_EXCL
, 0666);
4605 fd
= open(fname
, O_WRONLY
|O_CREAT
, 0666);
4607 /* If the open failed, return the file descriptor right away. */
4612 * OK, the open succeeded, but the file may have been changed from a
4613 * non-regular file to a regular file between the stat and the open.
4614 * We are assuming that the O_EXCL open handles the case where FILENAME
4615 * did not exist and is symlinked to an existing file between the stat
4620 * If we can open it and fstat the file descriptor, and neither check
4621 * revealed that it was a regular file, and the file has not been
4622 * replaced, return the file descriptor.
4624 if (fstat(fd
, &finfo2
) == 0 && !S_ISREG(finfo2
.st_mode
)
4625 && finfo
.st_dev
== finfo2
.st_dev
&& finfo
.st_ino
== finfo2
.st_ino
)
4628 /* The file has been replaced. badness. */
4635 * Handle here documents. Normally we fork off a process to write the
4636 * data to a pipe. If the document is short, we can stuff the data in
4637 * the pipe without forking.
4639 /* openhere needs this forward reference */
4640 static void expandhere(union node
*arg
, int fd
);
4642 openhere(union node
*redir
)
4648 ash_msg_and_raise_error("pipe call failed");
4649 if (redir
->type
== NHERE
) {
4650 len
= strlen(redir
->nhere
.doc
->narg
.text
);
4651 if (len
<= PIPESIZE
) {
4652 full_write(pip
[1], redir
->nhere
.doc
->narg
.text
, len
);
4656 if (forkshell((struct job
*)NULL
, (union node
*)NULL
, FORK_NOJOB
) == 0) {
4658 signal(SIGINT
, SIG_IGN
);
4659 signal(SIGQUIT
, SIG_IGN
);
4660 signal(SIGHUP
, SIG_IGN
);
4662 signal(SIGTSTP
, SIG_IGN
);
4664 signal(SIGPIPE
, SIG_DFL
);
4665 if (redir
->type
== NHERE
)
4666 full_write(pip
[1], redir
->nhere
.doc
->narg
.text
, len
);
4668 expandhere(redir
->nhere
.doc
, pip
[1]);
4677 openredirect(union node
*redir
)
4682 switch (redir
->nfile
.type
) {
4684 fname
= redir
->nfile
.expfname
;
4685 f
= open(fname
, O_RDONLY
);
4690 fname
= redir
->nfile
.expfname
;
4691 f
= open(fname
, O_RDWR
|O_CREAT
|O_TRUNC
, 0666);
4696 /* Take care of noclobber mode. */
4698 fname
= redir
->nfile
.expfname
;
4699 f
= noclobberopen(fname
);
4706 fname
= redir
->nfile
.expfname
;
4707 f
= open(fname
, O_WRONLY
|O_CREAT
|O_TRUNC
, 0666);
4712 fname
= redir
->nfile
.expfname
;
4713 f
= open(fname
, O_WRONLY
|O_CREAT
|O_APPEND
, 0666);
4721 /* Fall through to eliminate warning. */
4728 f
= openhere(redir
);
4734 ash_msg_and_raise_error("cannot create %s: %s", fname
, errmsg(errno
, "nonexistent directory"));
4736 ash_msg_and_raise_error("cannot open %s: %s", fname
, errmsg(errno
, "no such file"));
4740 * Copy a file descriptor to be >= to. Returns -1
4741 * if the source file descriptor is closed, EMPTY if there are no unused
4742 * file descriptors left.
4745 copyfd(int from
, int to
)
4749 newfd
= fcntl(from
, F_DUPFD
, to
);
4751 if (errno
== EMFILE
)
4753 ash_msg_and_raise_error("%d: %m", from
);
4759 dupredirect(union node
*redir
, int f
)
4761 int fd
= redir
->nfile
.fd
;
4763 if (redir
->nfile
.type
== NTOFD
|| redir
->nfile
.type
== NFROMFD
) {
4764 if (redir
->ndup
.dupfd
>= 0) { /* if not ">&-" */
4765 copyfd(redir
->ndup
.dupfd
, fd
);
4777 * Process a list of redirection commands. If the REDIR_PUSH flag is set,
4778 * old file descriptors are stashed away so that the redirection can be
4779 * undone by calling popredir. If the REDIR_BACKQ flag is set, then the
4780 * standard output, and the standard error if it becomes a duplicate of
4781 * stdout, is saved in memory.
4783 /* flags passed to redirect */
4784 #define REDIR_PUSH 01 /* save previous values of file descriptors */
4785 #define REDIR_SAVEFD2 03 /* set preverrout */
4787 redirect(union node
*redir
, int flags
)
4790 struct redirtab
*sv
;
4801 if (flags
& REDIR_PUSH
) {
4803 q
= ckmalloc(sizeof(struct redirtab
));
4804 q
->next
= redirlist
;
4806 q
->nullredirs
= nullredirs
- 1;
4807 for (i
= 0; i
< 10; i
++)
4808 q
->renamed
[i
] = EMPTY
;
4815 if ((n
->nfile
.type
== NTOFD
|| n
->nfile
.type
== NFROMFD
)
4816 && n
->ndup
.dupfd
== fd
)
4817 continue; /* redirect from/to same file descriptor */
4819 newfd
= openredirect(n
);
4822 if (sv
&& *(p
= &sv
->renamed
[fd
]) == EMPTY
) {
4823 i
= fcntl(fd
, F_DUPFD
, 10);
4830 ash_msg_and_raise_error("%d: %m", fd
);
4840 dupredirect(n
, newfd
);
4841 } while ((n
= n
->nfile
.next
));
4843 if (flags
& REDIR_SAVEFD2
&& sv
&& sv
->renamed
[2] >= 0)
4844 preverrout_fd
= sv
->renamed
[2];
4848 * Undo the effects of the last redirection.
4853 struct redirtab
*rp
;
4856 if (--nullredirs
>= 0)
4860 for (i
= 0; i
< 10; i
++) {
4861 if (rp
->renamed
[i
] != EMPTY
) {
4864 copyfd(rp
->renamed
[i
], i
);
4866 close(rp
->renamed
[i
]);
4869 redirlist
= rp
->next
;
4870 nullredirs
= rp
->nullredirs
;
4876 * Undo all redirections. Called on error or interrupt.
4880 * Discard all saved file descriptors.
4883 clearredir(int drop
)
4894 redirectsafe(union node
*redir
, int flags
)
4897 volatile int saveint
;
4898 struct jmploc
*volatile savehandler
= exception_handler
;
4899 struct jmploc jmploc
;
4902 err
= setjmp(jmploc
.loc
) * 2;
4904 exception_handler
= &jmploc
;
4905 redirect(redir
, flags
);
4907 exception_handler
= savehandler
;
4908 if (err
&& exception
!= EXERROR
)
4909 longjmp(exception_handler
->loc
, 1);
4910 RESTORE_INT(saveint
);
4915 /* ============ Routines to expand arguments to commands
4917 * We have to deal with backquotes, shell variables, and file metacharacters.
4923 #define EXP_FULL 0x1 /* perform word splitting & file globbing */
4924 #define EXP_TILDE 0x2 /* do normal tilde expansion */
4925 #define EXP_VARTILDE 0x4 /* expand tildes in an assignment */
4926 #define EXP_REDIR 0x8 /* file glob for a redirection (1 match only) */
4927 #define EXP_CASE 0x10 /* keeps quotes around for CASE pattern */
4928 #define EXP_RECORD 0x20 /* need to record arguments for ifs breakup */
4929 #define EXP_VARTILDE2 0x40 /* expand tildes after colons only */
4930 #define EXP_WORD 0x80 /* expand word in parameter expansion */
4931 #define EXP_QWORD 0x100 /* expand word in quoted parameter expansion */
4935 #define RMESCAPE_ALLOC 0x1 /* Allocate a new string */
4936 #define RMESCAPE_GLOB 0x2 /* Add backslashes for glob */
4937 #define RMESCAPE_QUOTED 0x4 /* Remove CTLESC unless in quotes */
4938 #define RMESCAPE_GROW 0x8 /* Grow strings instead of stalloc */
4939 #define RMESCAPE_HEAP 0x10 /* Malloc strings instead of stalloc */
4942 * Structure specifying which parts of the string should be searched
4943 * for IFS characters.
4946 struct ifsregion
*next
; /* next region in list */
4947 int begoff
; /* offset of start of region */
4948 int endoff
; /* offset of end of region */
4949 int nulonly
; /* search for nul bytes only */
4953 struct strlist
*list
;
4954 struct strlist
**lastp
;
4957 /* output of current string */
4958 static char *expdest
;
4959 /* list of back quote expressions */
4960 static struct nodelist
*argbackq
;
4961 /* first struct in list of ifs regions */
4962 static struct ifsregion ifsfirst
;
4963 /* last struct in list */
4964 static struct ifsregion
*ifslastp
;
4965 /* holds expanded arg list */
4966 static struct arglist exparg
;
4976 expdest
= makestrspace(32, expdest
);
4977 #if ENABLE_ASH_MATH_SUPPORT_64
4978 len
= fmtstr(expdest
, 32, "%lld", (long long) num
);
4980 len
= fmtstr(expdest
, 32, "%ld", num
);
4982 STADJUST(len
, expdest
);
4987 esclen(const char *start
, const char *p
)
4991 while (p
> start
&& *--p
== CTLESC
) {
4998 * Remove any CTLESC characters from a string.
5001 _rmescapes(char *str
, int flag
)
5003 static const char qchars
[] ALIGN1
= { CTLESC
, CTLQUOTEMARK
, '\0' };
5010 p
= strpbrk(str
, qchars
);
5016 if (flag
& RMESCAPE_ALLOC
) {
5017 size_t len
= p
- str
;
5018 size_t fulllen
= len
+ strlen(p
) + 1;
5020 if (flag
& RMESCAPE_GROW
) {
5021 r
= makestrspace(fulllen
, expdest
);
5022 } else if (flag
& RMESCAPE_HEAP
) {
5023 r
= ckmalloc(fulllen
);
5025 r
= stalloc(fulllen
);
5029 q
= memcpy(q
, str
, len
) + len
;
5032 inquotes
= (flag
& RMESCAPE_QUOTED
) ^ RMESCAPE_QUOTED
;
5033 globbing
= flag
& RMESCAPE_GLOB
;
5034 notescaped
= globbing
;
5036 if (*p
== CTLQUOTEMARK
) {
5037 inquotes
= ~inquotes
;
5039 notescaped
= globbing
;
5043 /* naked back slash */
5049 if (notescaped
&& inquotes
&& *p
!= '/') {
5053 notescaped
= globbing
;
5058 if (flag
& RMESCAPE_GROW
) {
5060 STADJUST(q
- r
+ 1, expdest
);
5064 #define rmescapes(p) _rmescapes((p), 0)
5066 #define pmatch(a, b) !fnmatch((a), (b), 0)
5069 * Prepare a pattern for a expmeta (internal glob(3)) call.
5071 * Returns an stalloced string.
5074 preglob(const char *pattern
, int quoted
, int flag
)
5076 flag
|= RMESCAPE_GLOB
;
5078 flag
|= RMESCAPE_QUOTED
;
5080 return _rmescapes((char *)pattern
, flag
);
5084 * Put a string on the stack.
5087 memtodest(const char *p
, size_t len
, int syntax
, int quotes
)
5091 q
= makestrspace(len
* 2, q
);
5094 int c
= signed_char2int(*p
++);
5097 if (quotes
&& (SIT(c
, syntax
) == CCTL
|| SIT(c
, syntax
) == CBACK
))
5106 strtodest(const char *p
, int syntax
, int quotes
)
5108 memtodest(p
, strlen(p
), syntax
, quotes
);
5112 * Record the fact that we have to scan this region of the
5113 * string for IFS characters.
5116 recordregion(int start
, int end
, int nulonly
)
5118 struct ifsregion
*ifsp
;
5120 if (ifslastp
== NULL
) {
5124 ifsp
= ckmalloc(sizeof(*ifsp
));
5126 ifslastp
->next
= ifsp
;
5130 ifslastp
->begoff
= start
;
5131 ifslastp
->endoff
= end
;
5132 ifslastp
->nulonly
= nulonly
;
5136 removerecordregions(int endoff
)
5138 if (ifslastp
== NULL
)
5141 if (ifsfirst
.endoff
> endoff
) {
5142 while (ifsfirst
.next
!= NULL
) {
5143 struct ifsregion
*ifsp
;
5145 ifsp
= ifsfirst
.next
->next
;
5146 free(ifsfirst
.next
);
5147 ifsfirst
.next
= ifsp
;
5150 if (ifsfirst
.begoff
> endoff
)
5153 ifslastp
= &ifsfirst
;
5154 ifsfirst
.endoff
= endoff
;
5159 ifslastp
= &ifsfirst
;
5160 while (ifslastp
->next
&& ifslastp
->next
->begoff
< endoff
)
5161 ifslastp
=ifslastp
->next
;
5162 while (ifslastp
->next
!= NULL
) {
5163 struct ifsregion
*ifsp
;
5165 ifsp
= ifslastp
->next
->next
;
5166 free(ifslastp
->next
);
5167 ifslastp
->next
= ifsp
;
5170 if (ifslastp
->endoff
> endoff
)
5171 ifslastp
->endoff
= endoff
;
5175 exptilde(char *startp
, char *p
, int flag
)
5181 int quotes
= flag
& (EXP_FULL
| EXP_CASE
);
5186 while ((c
= *++p
) != '\0') {
5193 if (flag
& EXP_VARTILDE
)
5203 if (*name
== '\0') {
5204 home
= lookupvar(homestr
);
5206 pw
= getpwnam(name
);
5211 if (!home
|| !*home
)
5214 startloc
= expdest
- (char *)stackblock();
5215 strtodest(home
, SQSYNTAX
, quotes
);
5216 recordregion(startloc
, expdest
- (char *)stackblock(), 0);
5224 * Execute a command inside back quotes. If it's a builtin command, we
5225 * want to save its output in a block obtained from malloc. Otherwise
5226 * we fork off a subprocess and get the output of the command via a pipe.
5227 * Should be called with interrupts off.
5229 struct backcmd
{ /* result of evalbackcmd */
5230 int fd
; /* file descriptor to read from */
5231 char *buf
; /* buffer */
5232 int nleft
; /* number of chars in buffer */
5233 struct job
*jp
; /* job structure for command */
5236 /* These forward decls are needed to use "eval" code for backticks handling: */
5237 static int back_exitstatus
; /* exit status of backquoted command */
5238 #define EV_EXIT 01 /* exit after evaluating tree */
5239 static void evaltree(union node
*, int);
5242 evalbackcmd(union node
*n
, struct backcmd
*result
)
5254 saveherefd
= herefd
;
5262 ash_msg_and_raise_error("pipe call failed");
5264 if (forkshell(jp
, n
, FORK_NOJOB
) == 0) {
5273 evaltree(n
, EV_EXIT
); /* actually evaltreenr... */
5277 result
->fd
= pip
[0];
5280 herefd
= saveherefd
;
5282 TRACE(("evalbackcmd done: fd=%d buf=0x%x nleft=%d jp=0x%x\n",
5283 result
->fd
, result
->buf
, result
->nleft
, result
->jp
));
5287 * Expand stuff in backwards quotes.
5290 expbackq(union node
*cmd
, int quoted
, int quotes
)
5298 int syntax
= quoted
? DQSYNTAX
: BASESYNTAX
;
5299 struct stackmark smark
;
5302 setstackmark(&smark
);
5304 startloc
= dest
- (char *)stackblock();
5306 evalbackcmd(cmd
, &in
);
5307 popstackmark(&smark
);
5314 memtodest(p
, i
, syntax
, quotes
);
5318 i
= safe_read(in
.fd
, buf
, sizeof(buf
));
5319 TRACE(("expbackq: read returns %d\n", i
));
5328 back_exitstatus
= waitforjob(in
.jp
);
5332 /* Eat all trailing newlines */
5334 for (; dest
> (char *)stackblock() && dest
[-1] == '\n';)
5339 recordregion(startloc
, dest
- (char *)stackblock(), 0);
5340 TRACE(("evalbackq: size=%d: \"%.*s\"\n",
5341 (dest
- (char *)stackblock()) - startloc
,
5342 (dest
- (char *)stackblock()) - startloc
,
5343 stackblock() + startloc
));
5346 #if ENABLE_ASH_MATH_SUPPORT
5348 * Expand arithmetic expression. Backup to start of expression,
5349 * evaluate, place result in (backed up) result, adjust string position.
5362 * This routine is slightly over-complicated for
5363 * efficiency. Next we scan backwards looking for the
5364 * start of arithmetic.
5366 start
= stackblock();
5373 while (*p
!= CTLARI
) {
5377 ash_msg_and_raise_error("missing CTLARI (shouldn't happen)");
5382 esc
= esclen(start
, p
);
5392 removerecordregions(begoff
);
5401 len
= cvtnum(dash_arith(p
+ 2));
5404 recordregion(begoff
, begoff
+ len
, 0);
5408 /* argstr needs it */
5409 static char *evalvar(char *p
, int flag
);
5412 * Perform variable and command substitution. If EXP_FULL is set, output CTLESC
5413 * characters to allow for further processing. Otherwise treat
5414 * $@ like $* since no splitting will be performed.
5417 argstr(char *p
, int flag
)
5419 static const char spclchars
[] ALIGN1
= {
5427 CTLBACKQ
| CTLQUOTE
,
5428 #if ENABLE_ASH_MATH_SUPPORT
5433 const char *reject
= spclchars
;
5435 int quotes
= flag
& (EXP_FULL
| EXP_CASE
); /* do CTLESC */
5436 int breakall
= flag
& EXP_WORD
;
5441 if (!(flag
& EXP_VARTILDE
)) {
5443 } else if (flag
& EXP_VARTILDE2
) {
5448 if (flag
& EXP_TILDE
) {
5454 if (*q
== CTLESC
&& (flag
& EXP_QWORD
))
5457 p
= exptilde(p
, q
, flag
);
5460 startloc
= expdest
- (char *)stackblock();
5462 length
+= strcspn(p
+ length
, reject
);
5464 if (c
&& (!(c
& 0x80)
5465 #if ENABLE_ASH_MATH_SUPPORT
5469 /* c == '=' || c == ':' || c == CTLENDARI */
5474 expdest
= stack_nputstr(p
, length
, expdest
);
5475 newloc
= expdest
- (char *)stackblock();
5476 if (breakall
&& !inquotes
&& newloc
> startloc
) {
5477 recordregion(startloc
, newloc
, 0);
5488 if (flag
& EXP_VARTILDE2
) {
5492 flag
|= EXP_VARTILDE2
;
5497 * sort of a hack - expand tildes in variable
5498 * assignments (after the first '=' and after ':'s).
5507 case CTLENDVAR
: /* ??? */
5510 /* "$@" syntax adherence hack */
5513 !memcmp(p
, dolatstr
, 4) &&
5514 (p
[4] == CTLQUOTEMARK
|| (
5515 p
[4] == CTLENDVAR
&&
5516 p
[5] == CTLQUOTEMARK
5519 p
= evalvar(p
+ 1, flag
) + 1;
5522 inquotes
= !inquotes
;
5535 p
= evalvar(p
, flag
);
5539 case CTLBACKQ
|CTLQUOTE
:
5540 expbackq(argbackq
->n
, c
, quotes
);
5541 argbackq
= argbackq
->next
;
5543 #if ENABLE_ASH_MATH_SUPPORT
5556 scanleft(char *startp
, char *rmesc
, char *rmescend
, char *str
, int quotes
,
5567 const char *s
= loc2
;
5573 match
= pmatch(str
, s
);
5577 if (quotes
&& *loc
== CTLESC
)
5586 scanright(char *startp
, char *rmesc
, char *rmescend
, char *str
, int quotes
,
5593 for (loc
= str
- 1, loc2
= rmescend
; loc
>= startp
; loc2
--) {
5596 const char *s
= loc2
;
5601 match
= pmatch(str
, s
);
5608 esc
= esclen(startp
, loc
);
5619 static void varunset(const char *, const char *, const char *, int) ATTRIBUTE_NORETURN
;
5621 varunset(const char *end
, const char *var
, const char *umsg
, int varflags
)
5627 msg
= "parameter not set";
5629 if (*end
== CTLENDVAR
) {
5630 if (varflags
& VSNUL
)
5635 ash_msg_and_raise_error("%.*s: %s%s", end
- var
- 1, var
, msg
, tail
);
5639 subevalvar(char *p
, char *str
, int strloc
, int subtype
, int startloc
, int varflags
, int quotes
)
5643 int saveherefd
= herefd
;
5644 struct nodelist
*saveargbackq
= argbackq
;
5646 char *rmesc
, *rmescend
;
5648 char *(*scan
)(char *, char *, char *, char *, int , int);
5651 argstr(p
, subtype
!= VSASSIGN
&& subtype
!= VSQUESTION
? EXP_CASE
: 0);
5652 STPUTC('\0', expdest
);
5653 herefd
= saveherefd
;
5654 argbackq
= saveargbackq
;
5655 startp
= stackblock() + startloc
;
5659 setvar(str
, startp
, 0);
5660 amount
= startp
- expdest
;
5661 STADJUST(amount
, expdest
);
5665 varunset(p
, str
, startp
, varflags
);
5669 subtype
-= VSTRIMRIGHT
;
5671 if (subtype
< 0 || subtype
> 3)
5676 rmescend
= stackblock() + strloc
;
5678 rmesc
= _rmescapes(startp
, RMESCAPE_ALLOC
| RMESCAPE_GROW
);
5679 if (rmesc
!= startp
) {
5681 startp
= stackblock() + startloc
;
5685 str
= stackblock() + strloc
;
5686 preglob(str
, varflags
& VSQUOTE
, 0);
5688 /* zero = subtype == VSTRIMLEFT || subtype == VSTRIMLEFTMAX */
5689 zero
= subtype
>> 1;
5690 /* VSTRIMLEFT/VSTRIMRIGHTMAX -> scanleft */
5691 scan
= (subtype
& 1) ^ zero
? scanleft
: scanright
;
5693 loc
= scan(startp
, rmesc
, rmescend
, str
, quotes
, zero
);
5696 memmove(startp
, loc
, str
- loc
);
5697 loc
= startp
+ (str
- loc
) - 1;
5700 amount
= loc
- expdest
;
5701 STADJUST(amount
, expdest
);
5707 * Add the value of a specialized variable to the stack string.
5710 varvalue(char *name
, int varflags
, int flags
)
5720 int quoted
= varflags
& VSQUOTE
;
5721 int subtype
= varflags
& VSTYPE
;
5722 int quotes
= flags
& (EXP_FULL
| EXP_CASE
);
5724 if (quoted
&& (flags
& EXP_FULL
))
5725 sep
= 1 << CHAR_BIT
;
5727 syntax
= quoted
? DQSYNTAX
: BASESYNTAX
;
5736 num
= shellparam
.nparam
;
5746 p
= makestrspace(NOPTS
, expdest
);
5747 for (i
= NOPTS
- 1; i
>= 0; i
--) {
5749 USTPUTC(optletters(i
), p
);
5760 sep
= ifsset() ? signed_char2int(ifsval()[0]) : ' ';
5761 if (quotes
&& (SIT(sep
, syntax
) == CCTL
|| SIT(sep
, syntax
) == CBACK
))
5767 while ((p
= *ap
++)) {
5770 partlen
= strlen(p
);
5773 if (!(subtype
== VSPLUS
|| subtype
== VSLENGTH
))
5774 memtodest(p
, partlen
, syntax
, quotes
);
5780 if (subtype
== VSPLUS
|| subtype
== VSLENGTH
) {
5802 if (num
< 0 || num
> shellparam
.nparam
)
5804 p
= num
? shellparam
.p
[num
- 1] : arg0
;
5807 p
= lookupvar(name
);
5813 if (!(subtype
== VSPLUS
|| subtype
== VSLENGTH
))
5814 memtodest(p
, len
, syntax
, quotes
);
5818 if (subtype
== VSPLUS
|| subtype
== VSLENGTH
)
5819 STADJUST(-len
, expdest
);
5824 * Expand a variable, and return a pointer to the next character in the
5828 evalvar(char *p
, int flag
)
5841 quotes
= flag
& (EXP_FULL
| EXP_CASE
);
5843 subtype
= varflags
& VSTYPE
;
5844 quoted
= varflags
& VSQUOTE
;
5846 easy
= (!quoted
|| (*var
== '@' && shellparam
.nparam
));
5847 startloc
= expdest
- (char *)stackblock();
5848 p
= strchr(p
, '=') + 1;
5851 varlen
= varvalue(var
, varflags
, flag
);
5852 if (varflags
& VSNUL
)
5855 if (subtype
== VSPLUS
) {
5856 varlen
= -1 - varlen
;
5860 if (subtype
== VSMINUS
) {
5864 p
, flag
| EXP_TILDE
|
5865 (quoted
? EXP_QWORD
: EXP_WORD
)
5874 if (subtype
== VSASSIGN
|| subtype
== VSQUESTION
) {
5876 if (subevalvar(p
, var
, 0, subtype
, startloc
, varflags
, 0)) {
5879 * Remove any recorded regions beyond
5882 removerecordregions(startloc
);
5892 if (varlen
< 0 && uflag
)
5893 varunset(p
, var
, 0, 0);
5895 if (subtype
== VSLENGTH
) {
5896 cvtnum(varlen
> 0 ? varlen
: 0);
5900 if (subtype
== VSNORMAL
) {
5904 recordregion(startloc
, expdest
- (char *)stackblock(), quoted
);
5913 case VSTRIMRIGHTMAX
:
5922 * Terminate the string and start recording the pattern
5925 STPUTC('\0', expdest
);
5926 patloc
= expdest
- (char *)stackblock();
5927 if (subevalvar(p
, NULL
, patloc
, subtype
,
5928 startloc
, varflags
, quotes
) == 0) {
5929 int amount
= expdest
- (
5930 (char *)stackblock() + patloc
- 1
5932 STADJUST(-amount
, expdest
);
5934 /* Remove any recorded regions beyond start of variable */
5935 removerecordregions(startloc
);
5940 if (subtype
!= VSNORMAL
) { /* skip to end of alternative */
5946 else if (c
== CTLBACKQ
|| c
== (CTLBACKQ
|CTLQUOTE
)) {
5948 argbackq
= argbackq
->next
;
5949 } else if (c
== CTLVAR
) {
5950 if ((*p
++ & VSTYPE
) != VSNORMAL
)
5952 } else if (c
== CTLENDVAR
) {
5962 * Break the argument string into pieces based upon IFS and add the
5963 * strings to the argument list. The regions of the string to be
5964 * searched for IFS characters have been stored by recordregion.
5967 ifsbreakup(char *string
, struct arglist
*arglist
)
5969 struct ifsregion
*ifsp
;
5974 const char *ifs
, *realifs
;
5979 if (ifslastp
!= NULL
) {
5982 realifs
= ifsset() ? ifsval() : defifs
;
5985 p
= string
+ ifsp
->begoff
;
5986 nulonly
= ifsp
->nulonly
;
5987 ifs
= nulonly
? nullstr
: realifs
;
5989 while (p
< string
+ ifsp
->endoff
) {
5993 if (!strchr(ifs
, *p
)) {
5998 ifsspc
= (strchr(defifs
, *p
) != NULL
);
5999 /* Ignore IFS whitespace at start */
6000 if (q
== start
&& ifsspc
) {
6006 sp
= stalloc(sizeof(*sp
));
6008 *arglist
->lastp
= sp
;
6009 arglist
->lastp
= &sp
->next
;
6013 if (p
>= string
+ ifsp
->endoff
) {
6019 if (strchr(ifs
, *p
) == NULL
) {
6022 } else if (strchr(defifs
, *p
) == NULL
) {
6037 } while (ifsp
!= NULL
);
6046 sp
= stalloc(sizeof(*sp
));
6048 *arglist
->lastp
= sp
;
6049 arglist
->lastp
= &sp
->next
;
6055 struct ifsregion
*p
;
6060 struct ifsregion
*ifsp
;
6066 ifsfirst
.next
= NULL
;
6071 * Add a file name to the list.
6074 addfname(const char *name
)
6078 sp
= stalloc(sizeof(*sp
));
6079 sp
->text
= ststrdup(name
);
6081 exparg
.lastp
= &sp
->next
;
6084 static char *expdir
;
6087 * Do metacharacter (i.e. *, ?, [...]) expansion.
6090 expmeta(char *enddir
, char *name
)
6105 for (p
= name
; *p
; p
++) {
6106 if (*p
== '*' || *p
== '?')
6108 else if (*p
== '[') {
6115 if (*q
== '/' || *q
== '\0')
6122 } else if (*p
== '\\')
6124 else if (*p
== '/') {
6131 if (metaflag
== 0) { /* we've reached the end of the file name */
6132 if (enddir
!= expdir
)
6140 if (metaflag
== 0 || lstat(expdir
, &statb
) >= 0)
6151 } while (p
< start
);
6153 if (enddir
== expdir
) {
6155 } else if (enddir
== expdir
+ 1 && *expdir
== '/') {
6164 if (enddir
!= expdir
)
6166 if (*endname
== 0) {
6178 while (! intpending
&& (dp
= readdir(dirp
)) != NULL
) {
6179 if (dp
->d_name
[0] == '.' && ! matchdot
)
6181 if (pmatch(start
, dp
->d_name
)) {
6183 strcpy(enddir
, dp
->d_name
);
6186 for (p
= enddir
, cp
= dp
->d_name
; (*p
++ = *cp
++) != '\0';)
6189 expmeta(p
, endname
);
6198 static struct strlist
*
6199 msort(struct strlist
*list
, int len
)
6201 struct strlist
*p
, *q
= NULL
;
6202 struct strlist
**lpp
;
6210 for (n
= half
; --n
>= 0; ) {
6214 q
->next
= NULL
; /* terminate first half of list */
6215 q
= msort(list
, half
); /* sort first half of list */
6216 p
= msort(p
, len
- half
); /* sort second half */
6219 #if ENABLE_LOCALE_SUPPORT
6220 if (strcoll(p
->text
, q
->text
) < 0)
6222 if (strcmp(p
->text
, q
->text
) < 0)
6246 * Sort the results of file name expansion. It calculates the number of
6247 * strings to sort and then calls msort (short for merge sort) to do the
6250 static struct strlist
*
6251 expsort(struct strlist
*str
)
6257 for (sp
= str
; sp
; sp
= sp
->next
)
6259 return msort(str
, len
);
6263 expandmeta(struct strlist
*str
, int flag
)
6265 static const char metachars
[] ALIGN1
= {
6268 /* TODO - EXP_REDIR */
6271 struct strlist
**savelastp
;
6277 if (!strpbrk(str
->text
, metachars
))
6279 savelastp
= exparg
.lastp
;
6282 p
= preglob(str
->text
, 0, RMESCAPE_ALLOC
| RMESCAPE_HEAP
);
6284 int i
= strlen(str
->text
);
6285 expdir
= ckmalloc(i
< 2048 ? 2048 : i
); /* XXX */
6293 if (exparg
.lastp
== savelastp
) {
6298 *exparg
.lastp
= str
;
6299 rmescapes(str
->text
);
6300 exparg
.lastp
= &str
->next
;
6302 *exparg
.lastp
= NULL
;
6303 *savelastp
= sp
= expsort(*savelastp
);
6304 while (sp
->next
!= NULL
)
6306 exparg
.lastp
= &sp
->next
;
6313 * Perform variable substitution and command substitution on an argument,
6314 * placing the resulting list of arguments in arglist. If EXP_FULL is true,
6315 * perform splitting and file name expansion. When arglist is NULL, perform
6316 * here document expansion.
6319 expandarg(union node
*arg
, struct arglist
*arglist
, int flag
)
6324 argbackq
= arg
->narg
.backquote
;
6325 STARTSTACKSTR(expdest
);
6326 ifsfirst
.next
= NULL
;
6328 argstr(arg
->narg
.text
, flag
);
6329 p
= _STPUTC('\0', expdest
);
6331 if (arglist
== NULL
) {
6332 return; /* here document expanded */
6334 p
= grabstackstr(p
);
6335 exparg
.lastp
= &exparg
.list
;
6339 if (flag
& EXP_FULL
) {
6340 ifsbreakup(p
, &exparg
);
6341 *exparg
.lastp
= NULL
;
6342 exparg
.lastp
= &exparg
.list
;
6343 expandmeta(exparg
.list
, flag
);
6345 if (flag
& EXP_REDIR
) /*XXX - for now, just remove escapes */
6347 sp
= stalloc(sizeof(*sp
));
6350 exparg
.lastp
= &sp
->next
;
6354 *exparg
.lastp
= NULL
;
6356 *arglist
->lastp
= exparg
.list
;
6357 arglist
->lastp
= exparg
.lastp
;
6362 * Expand shell variables and backquotes inside a here document.
6365 expandhere(union node
*arg
, int fd
)
6368 expandarg(arg
, (struct arglist
*)NULL
, 0);
6369 full_write(fd
, stackblock(), expdest
- (char *)stackblock());
6373 * Returns true if the pattern matches the string.
6376 patmatch(char *pattern
, const char *string
)
6378 return pmatch(preglob(pattern
, 0, 0), string
);
6382 * See if a pattern matches in a case statement.
6385 casematch(union node
*pattern
, char *val
)
6387 struct stackmark smark
;
6390 setstackmark(&smark
);
6391 argbackq
= pattern
->narg
.backquote
;
6392 STARTSTACKSTR(expdest
);
6394 argstr(pattern
->narg
.text
, EXP_TILDE
| EXP_CASE
);
6395 STACKSTRNUL(expdest
);
6396 result
= patmatch(stackblock(), val
);
6397 popstackmark(&smark
);
6402 /* ============ find_command */
6406 int (*builtin
)(int, char **);
6407 /* unsigned flags; */
6409 #define IS_BUILTIN_SPECIAL(b) ((b)->name[0] & 1)
6410 #define IS_BUILTIN_REGULAR(b) ((b)->name[0] & 2)
6411 #define IS_BUILTIN_ASSIGN(b) ((b)->name[0] & 4)
6417 const struct builtincmd
*cmd
;
6418 struct funcnode
*func
;
6421 /* values of cmdtype */
6422 #define CMDUNKNOWN -1 /* no entry in table for command */
6423 #define CMDNORMAL 0 /* command is an executable program */
6424 #define CMDFUNCTION 1 /* command is a shell function */
6425 #define CMDBUILTIN 2 /* command is a shell builtin */
6427 /* action to find_command() */
6428 #define DO_ERR 0x01 /* prints errors */
6429 #define DO_ABS 0x02 /* checks absolute paths */
6430 #define DO_NOFUNC 0x04 /* don't return shell functions, for command */
6431 #define DO_ALTPATH 0x08 /* using alternate path */
6432 #define DO_ALTBLTIN 0x20 /* %builtin in alt. path */
6434 static void find_command(char *, struct cmdentry
*, int, const char *);
6437 /* ============ Hashing commands */
6440 * When commands are first encountered, they are entered in a hash table.
6441 * This ensures that a full path search will not have to be done for them
6442 * on each invocation.
6444 * We should investigate converting to a linear search, even though that
6445 * would make the command name "hash" a misnomer.
6448 #define CMDTABLESIZE 31 /* should be prime */
6449 #define ARB 1 /* actual size determined at run time */
6452 struct tblentry
*next
; /* next entry in hash chain */
6453 union param param
; /* definition of builtin function */
6454 short cmdtype
; /* index identifying command */
6455 char rehash
; /* if set, cd done since entry created */
6456 char cmdname
[ARB
]; /* name of command */
6459 static struct tblentry
*cmdtable
[CMDTABLESIZE
];
6460 static int builtinloc
= -1; /* index in path of %builtin, or -1 */
6463 tryexec(char *cmd
, char **argv
, char **envp
)
6467 #if ENABLE_FEATURE_SH_STANDALONE
6468 if (strchr(cmd
, '/') == NULL
) {
6469 const struct bb_applet
*a
;
6471 a
= find_applet_by_name(cmd
);
6474 run_appletstruct_and_exit(a
, argv
);
6475 /* re-exec ourselves with the new arguments */
6476 execve(bb_busybox_exec_path
, argv
, envp
);
6477 /* If they called chroot or otherwise made the binary no longer
6478 * executable, fall through */
6486 execve(cmd
, argv
, envp
);
6487 } while (errno
== EINTR
);
6489 execve(cmd
, argv
, envp
);
6493 } else if (errno
== ENOEXEC
) {
6497 for (ap
= argv
; *ap
; ap
++)
6499 ap
= new = ckmalloc((ap
- argv
+ 2) * sizeof(char *));
6501 ap
[0] = cmd
= (char *)DEFAULT_SHELL
;
6504 while ((*ap
++ = *argv
++))
6512 * Exec a program. Never returns. If you change this routine, you may
6513 * have to change the find_command routine as well.
6515 #define environment() listvars(VEXPORT, VUNSET, 0)
6516 static void shellexec(char **, const char *, int) ATTRIBUTE_NORETURN
;
6518 shellexec(char **argv
, const char *path
, int idx
)
6526 envp
= environment();
6527 if (strchr(argv
[0], '/')
6528 #if ENABLE_FEATURE_SH_STANDALONE
6529 || find_applet_by_name(argv
[0])
6532 tryexec(argv
[0], argv
, envp
);
6536 while ((cmdname
= padvance(&path
, argv
[0])) != NULL
) {
6537 if (--idx
< 0 && pathopt
== NULL
) {
6538 tryexec(cmdname
, argv
, envp
);
6539 if (errno
!= ENOENT
&& errno
!= ENOTDIR
)
6546 /* Map to POSIX errors */
6558 exitstatus
= exerrno
;
6559 TRACE(("shellexec failed for %s, errno %d, suppressint %d\n",
6560 argv
[0], e
, suppressint
));
6561 ash_msg_and_raise(EXEXEC
, "%s: %s", argv
[0], errmsg(e
, "not found"));
6566 printentry(struct tblentry
*cmdp
)
6572 idx
= cmdp
->param
.index
;
6575 name
= padvance(&path
, cmdp
->cmdname
);
6577 } while (--idx
>= 0);
6578 out1fmt("%s%s\n", name
, (cmdp
->rehash
? "*" : nullstr
));
6582 * Clear out command entries. The argument specifies the first entry in
6583 * PATH which has changed.
6586 clearcmdentry(int firstchange
)
6588 struct tblentry
**tblp
;
6589 struct tblentry
**pp
;
6590 struct tblentry
*cmdp
;
6593 for (tblp
= cmdtable
; tblp
< &cmdtable
[CMDTABLESIZE
]; tblp
++) {
6595 while ((cmdp
= *pp
) != NULL
) {
6596 if ((cmdp
->cmdtype
== CMDNORMAL
&&
6597 cmdp
->param
.index
>= firstchange
)
6598 || (cmdp
->cmdtype
== CMDBUILTIN
&&
6599 builtinloc
>= firstchange
)
6612 * Locate a command in the command hash table. If "add" is nonzero,
6613 * add the command to the table if it is not already present. The
6614 * variable "lastcmdentry" is set to point to the address of the link
6615 * pointing to the entry, so that delete_cmd_entry can delete the
6618 * Interrupts must be off if called with add != 0.
6620 static struct tblentry
**lastcmdentry
;
6622 static struct tblentry
*
6623 cmdlookup(const char *name
, int add
)
6625 unsigned int hashval
;
6627 struct tblentry
*cmdp
;
6628 struct tblentry
**pp
;
6631 hashval
= (unsigned char)*p
<< 4;
6633 hashval
+= (unsigned char)*p
++;
6635 pp
= &cmdtable
[hashval
% CMDTABLESIZE
];
6636 for (cmdp
= *pp
; cmdp
; cmdp
= cmdp
->next
) {
6637 if (strcmp(cmdp
->cmdname
, name
) == 0)
6641 if (add
&& cmdp
== NULL
) {
6642 cmdp
= *pp
= ckmalloc(sizeof(struct tblentry
) - ARB
6643 + strlen(name
) + 1);
6645 cmdp
->cmdtype
= CMDUNKNOWN
;
6646 strcpy(cmdp
->cmdname
, name
);
6653 * Delete the command entry returned on the last lookup.
6656 delete_cmd_entry(void)
6658 struct tblentry
*cmdp
;
6661 cmdp
= *lastcmdentry
;
6662 *lastcmdentry
= cmdp
->next
;
6663 if (cmdp
->cmdtype
== CMDFUNCTION
)
6664 freefunc(cmdp
->param
.func
);
6670 * Add a new command entry, replacing any existing command entry for
6671 * the same name - except special builtins.
6674 addcmdentry(char *name
, struct cmdentry
*entry
)
6676 struct tblentry
*cmdp
;
6678 cmdp
= cmdlookup(name
, 1);
6679 if (cmdp
->cmdtype
== CMDFUNCTION
) {
6680 freefunc(cmdp
->param
.func
);
6682 cmdp
->cmdtype
= entry
->cmdtype
;
6683 cmdp
->param
= entry
->u
;
6688 hashcmd(int argc
, char **argv
)
6690 struct tblentry
**pp
;
6691 struct tblentry
*cmdp
;
6693 struct cmdentry entry
;
6696 while ((c
= nextopt("r")) != '\0') {
6700 if (*argptr
== NULL
) {
6701 for (pp
= cmdtable
; pp
< &cmdtable
[CMDTABLESIZE
]; pp
++) {
6702 for (cmdp
= *pp
; cmdp
; cmdp
= cmdp
->next
) {
6703 if (cmdp
->cmdtype
== CMDNORMAL
)
6710 while ((name
= *argptr
) != NULL
) {
6711 cmdp
= cmdlookup(name
, 0);
6713 && (cmdp
->cmdtype
== CMDNORMAL
6714 || (cmdp
->cmdtype
== CMDBUILTIN
&& builtinloc
>= 0)))
6716 find_command(name
, &entry
, DO_ERR
, pathval());
6717 if (entry
.cmdtype
== CMDUNKNOWN
)
6725 * Called when a cd is done. Marks all commands so the next time they
6726 * are executed they will be rehashed.
6731 struct tblentry
**pp
;
6732 struct tblentry
*cmdp
;
6734 for (pp
= cmdtable
; pp
< &cmdtable
[CMDTABLESIZE
]; pp
++) {
6735 for (cmdp
= *pp
; cmdp
; cmdp
= cmdp
->next
) {
6736 if (cmdp
->cmdtype
== CMDNORMAL
|| (
6737 cmdp
->cmdtype
== CMDBUILTIN
&&
6738 !(IS_BUILTIN_REGULAR(cmdp
->param
.cmd
)) &&
6747 * Fix command hash table when PATH changed.
6748 * Called before PATH is changed. The argument is the new value of PATH;
6749 * pathval() still returns the old value at this point.
6750 * Called with interrupts off.
6753 changepath(const char *newval
)
6755 const char *old
, *new;
6762 firstchange
= 9999; /* assume no change */
6768 if ((*old
== '\0' && *new == ':')
6769 || (*old
== ':' && *new == '\0'))
6771 old
= new; /* ignore subsequent differences */
6775 if (*new == '%' && idx_bltin
< 0 && prefix(new + 1, "builtin"))
6782 if (builtinloc
< 0 && idx_bltin
>= 0)
6783 builtinloc
= idx_bltin
; /* zap builtins */
6784 if (builtinloc
>= 0 && idx_bltin
< 0)
6786 clearcmdentry(firstchange
);
6787 builtinloc
= idx_bltin
;
6802 #define TENDBQUOTE 12
6820 /* first char is indicating which tokens mark the end of a list */
6821 static const char *const tokname_array
[] = {
6835 #define KWDOFFSET 13
6836 /* the following are keywords */
6858 static char buf
[16];
6861 //if (tok < TSEMI) return tokname_array[tok] + 1;
6862 //sprintf(buf, "\"%s\"", tokname_array[tok] + 1);
6867 sprintf(buf
+ (tok
>= TSEMI
), "%s%c",
6868 tokname_array
[tok
] + 1, (tok
>= TSEMI
? '"' : 0));
6872 /* Wrapper around strcmp for qsort/bsearch/... */
6874 pstrcmp(const void *a
, const void *b
)
6876 return strcmp((char*) a
, (*(char**) b
) + 1);
6879 static const char *const *
6880 findkwd(const char *s
)
6882 return bsearch(s
, tokname_array
+ KWDOFFSET
,
6883 ARRAY_SIZE(tokname_array
) - KWDOFFSET
,
6884 sizeof(tokname_array
[0]), pstrcmp
);
6888 * Locate and print what a word is...
6891 describe_command(char *command
, int describe_command_verbose
)
6893 struct cmdentry entry
;
6894 struct tblentry
*cmdp
;
6895 #if ENABLE_ASH_ALIAS
6896 const struct alias
*ap
;
6898 const char *path
= pathval();
6900 if (describe_command_verbose
) {
6904 /* First look at the keywords */
6905 if (findkwd(command
)) {
6906 out1str(describe_command_verbose
? " is a shell keyword" : command
);
6910 #if ENABLE_ASH_ALIAS
6911 /* Then look at the aliases */
6912 ap
= lookupalias(command
, 0);
6914 if (!describe_command_verbose
) {
6919 out1fmt(" is an alias for %s", ap
->val
);
6923 /* Then check if it is a tracked alias */
6924 cmdp
= cmdlookup(command
, 0);
6926 entry
.cmdtype
= cmdp
->cmdtype
;
6927 entry
.u
= cmdp
->param
;
6929 /* Finally use brute force */
6930 find_command(command
, &entry
, DO_ABS
, path
);
6933 switch (entry
.cmdtype
) {
6935 int j
= entry
.u
.index
;
6941 p
= padvance(&path
, command
);
6945 if (describe_command_verbose
) {
6947 (cmdp
? " a tracked alias for" : nullstr
), p
6956 if (describe_command_verbose
) {
6957 out1str(" is a shell function");
6964 if (describe_command_verbose
) {
6965 out1fmt(" is a %sshell builtin",
6966 IS_BUILTIN_SPECIAL(entry
.u
.cmd
) ?
6967 "special " : nullstr
6975 if (describe_command_verbose
) {
6976 out1str(": not found\n");
6981 outstr("\n", stdout
);
6986 typecmd(int argc
, char **argv
)
6992 /* type -p ... ? (we don't bother checking for 'p') */
6993 if (argv
[1] && argv
[1][0] == '-') {
6998 err
|= describe_command(argv
[i
++], verbose
);
7003 #if ENABLE_ASH_CMDCMD
7005 commandcmd(int argc
, char **argv
)
7013 while ((c
= nextopt("pvV")) != '\0')
7015 verify
|= VERIFY_VERBOSE
;
7017 verify
|= VERIFY_BRIEF
;
7023 return describe_command(*argptr
, verify
- VERIFY_BRIEF
);
7030 /* ============ eval.c */
7032 static int funcblocksize
; /* size of structures in function */
7033 static int funcstringsize
; /* size of strings in node */
7034 static void *funcblock
; /* block to allocate function from */
7035 static char *funcstring
; /* block to allocate strings from */
7037 /* flags in argument to evaltree */
7038 #define EV_EXIT 01 /* exit after evaluating tree */
7039 #define EV_TESTED 02 /* exit status is checked; ignore -e flag */
7040 #define EV_BACKCMD 04 /* command executing within back quotes */
7042 static const short nodesize
[26] = {
7043 SHELL_ALIGN(sizeof(struct ncmd
)),
7044 SHELL_ALIGN(sizeof(struct npipe
)),
7045 SHELL_ALIGN(sizeof(struct nredir
)),
7046 SHELL_ALIGN(sizeof(struct nredir
)),
7047 SHELL_ALIGN(sizeof(struct nredir
)),
7048 SHELL_ALIGN(sizeof(struct nbinary
)),
7049 SHELL_ALIGN(sizeof(struct nbinary
)),
7050 SHELL_ALIGN(sizeof(struct nbinary
)),
7051 SHELL_ALIGN(sizeof(struct nif
)),
7052 SHELL_ALIGN(sizeof(struct nbinary
)),
7053 SHELL_ALIGN(sizeof(struct nbinary
)),
7054 SHELL_ALIGN(sizeof(struct nfor
)),
7055 SHELL_ALIGN(sizeof(struct ncase
)),
7056 SHELL_ALIGN(sizeof(struct nclist
)),
7057 SHELL_ALIGN(sizeof(struct narg
)),
7058 SHELL_ALIGN(sizeof(struct narg
)),
7059 SHELL_ALIGN(sizeof(struct nfile
)),
7060 SHELL_ALIGN(sizeof(struct nfile
)),
7061 SHELL_ALIGN(sizeof(struct nfile
)),
7062 SHELL_ALIGN(sizeof(struct nfile
)),
7063 SHELL_ALIGN(sizeof(struct nfile
)),
7064 SHELL_ALIGN(sizeof(struct ndup
)),
7065 SHELL_ALIGN(sizeof(struct ndup
)),
7066 SHELL_ALIGN(sizeof(struct nhere
)),
7067 SHELL_ALIGN(sizeof(struct nhere
)),
7068 SHELL_ALIGN(sizeof(struct nnot
)),
7071 static void calcsize(union node
*n
);
7074 sizenodelist(struct nodelist
*lp
)
7077 funcblocksize
+= SHELL_ALIGN(sizeof(struct nodelist
));
7084 calcsize(union node
*n
)
7088 funcblocksize
+= nodesize
[n
->type
];
7091 calcsize(n
->ncmd
.redirect
);
7092 calcsize(n
->ncmd
.args
);
7093 calcsize(n
->ncmd
.assign
);
7096 sizenodelist(n
->npipe
.cmdlist
);
7101 calcsize(n
->nredir
.redirect
);
7102 calcsize(n
->nredir
.n
);
7109 calcsize(n
->nbinary
.ch2
);
7110 calcsize(n
->nbinary
.ch1
);
7113 calcsize(n
->nif
.elsepart
);
7114 calcsize(n
->nif
.ifpart
);
7115 calcsize(n
->nif
.test
);
7118 funcstringsize
+= strlen(n
->nfor
.var
) + 1;
7119 calcsize(n
->nfor
.body
);
7120 calcsize(n
->nfor
.args
);
7123 calcsize(n
->ncase
.cases
);
7124 calcsize(n
->ncase
.expr
);
7127 calcsize(n
->nclist
.body
);
7128 calcsize(n
->nclist
.pattern
);
7129 calcsize(n
->nclist
.next
);
7133 sizenodelist(n
->narg
.backquote
);
7134 funcstringsize
+= strlen(n
->narg
.text
) + 1;
7135 calcsize(n
->narg
.next
);
7142 calcsize(n
->nfile
.fname
);
7143 calcsize(n
->nfile
.next
);
7147 calcsize(n
->ndup
.vname
);
7148 calcsize(n
->ndup
.next
);
7152 calcsize(n
->nhere
.doc
);
7153 calcsize(n
->nhere
.next
);
7156 calcsize(n
->nnot
.com
);
7162 nodeckstrdup(char *s
)
7164 char *rtn
= funcstring
;
7166 strcpy(funcstring
, s
);
7167 funcstring
+= strlen(s
) + 1;
7171 static union node
*copynode(union node
*);
7173 static struct nodelist
*
7174 copynodelist(struct nodelist
*lp
)
7176 struct nodelist
*start
;
7177 struct nodelist
**lpp
;
7182 funcblock
= (char *) funcblock
+ SHELL_ALIGN(sizeof(struct nodelist
));
7183 (*lpp
)->n
= copynode(lp
->n
);
7185 lpp
= &(*lpp
)->next
;
7192 copynode(union node
*n
)
7199 funcblock
= (char *) funcblock
+ nodesize
[n
->type
];
7203 new->ncmd
.redirect
= copynode(n
->ncmd
.redirect
);
7204 new->ncmd
.args
= copynode(n
->ncmd
.args
);
7205 new->ncmd
.assign
= copynode(n
->ncmd
.assign
);
7208 new->npipe
.cmdlist
= copynodelist(n
->npipe
.cmdlist
);
7209 new->npipe
.backgnd
= n
->npipe
.backgnd
;
7214 new->nredir
.redirect
= copynode(n
->nredir
.redirect
);
7215 new->nredir
.n
= copynode(n
->nredir
.n
);
7222 new->nbinary
.ch2
= copynode(n
->nbinary
.ch2
);
7223 new->nbinary
.ch1
= copynode(n
->nbinary
.ch1
);
7226 new->nif
.elsepart
= copynode(n
->nif
.elsepart
);
7227 new->nif
.ifpart
= copynode(n
->nif
.ifpart
);
7228 new->nif
.test
= copynode(n
->nif
.test
);
7231 new->nfor
.var
= nodeckstrdup(n
->nfor
.var
);
7232 new->nfor
.body
= copynode(n
->nfor
.body
);
7233 new->nfor
.args
= copynode(n
->nfor
.args
);
7236 new->ncase
.cases
= copynode(n
->ncase
.cases
);
7237 new->ncase
.expr
= copynode(n
->ncase
.expr
);
7240 new->nclist
.body
= copynode(n
->nclist
.body
);
7241 new->nclist
.pattern
= copynode(n
->nclist
.pattern
);
7242 new->nclist
.next
= copynode(n
->nclist
.next
);
7246 new->narg
.backquote
= copynodelist(n
->narg
.backquote
);
7247 new->narg
.text
= nodeckstrdup(n
->narg
.text
);
7248 new->narg
.next
= copynode(n
->narg
.next
);
7255 new->nfile
.fname
= copynode(n
->nfile
.fname
);
7256 new->nfile
.fd
= n
->nfile
.fd
;
7257 new->nfile
.next
= copynode(n
->nfile
.next
);
7261 new->ndup
.vname
= copynode(n
->ndup
.vname
);
7262 new->ndup
.dupfd
= n
->ndup
.dupfd
;
7263 new->ndup
.fd
= n
->ndup
.fd
;
7264 new->ndup
.next
= copynode(n
->ndup
.next
);
7268 new->nhere
.doc
= copynode(n
->nhere
.doc
);
7269 new->nhere
.fd
= n
->nhere
.fd
;
7270 new->nhere
.next
= copynode(n
->nhere
.next
);
7273 new->nnot
.com
= copynode(n
->nnot
.com
);
7276 new->type
= n
->type
;
7281 * Make a copy of a parse tree.
7283 static struct funcnode
*
7284 copyfunc(union node
*n
)
7289 funcblocksize
= offsetof(struct funcnode
, n
);
7292 blocksize
= funcblocksize
;
7293 f
= ckmalloc(blocksize
+ funcstringsize
);
7294 funcblock
= (char *) f
+ offsetof(struct funcnode
, n
);
7295 funcstring
= (char *) f
+ blocksize
;
7302 * Define a shell function.
7305 defun(char *name
, union node
*func
)
7307 struct cmdentry entry
;
7310 entry
.cmdtype
= CMDFUNCTION
;
7311 entry
.u
.func
= copyfunc(func
);
7312 addcmdentry(name
, &entry
);
7316 static int evalskip
; /* set if we are skipping commands */
7317 /* reasons for skipping commands (see comment on breakcmd routine) */
7318 #define SKIPBREAK (1 << 0)
7319 #define SKIPCONT (1 << 1)
7320 #define SKIPFUNC (1 << 2)
7321 #define SKIPFILE (1 << 3)
7322 #define SKIPEVAL (1 << 4)
7323 static int skipcount
; /* number of levels to skip */
7324 static int funcnest
; /* depth of function calls */
7326 /* forward decl way out to parsing code - dotrap needs it */
7327 static int evalstring(char *s
, int mask
);
7330 * Called to execute a trap. Perhaps we should avoid entering new trap
7331 * handlers while we are executing a trap handler.
7342 savestatus
= exitstatus
;
7346 for (i
= 0, q
= gotsig
; i
< NSIG
- 1; i
++, q
++) {
7354 skip
= evalstring(p
, SKIPEVAL
);
7355 exitstatus
= savestatus
;
7363 /* forward declarations - evaluation is fairly recursive business... */
7364 static void evalloop(union node
*, int);
7365 static void evalfor(union node
*, int);
7366 static void evalcase(union node
*, int);
7367 static void evalsubshell(union node
*, int);
7368 static void expredir(union node
*);
7369 static void evalpipe(union node
*, int);
7370 static void evalcommand(union node
*, int);
7371 static int evalbltin(const struct builtincmd
*, int, char **);
7372 static void prehash(union node
*);
7375 * Evaluate a parse tree. The value is left in the global variable
7379 evaltree(union node
*n
, int flags
)
7382 void (*evalfn
)(union node
*, int);
7386 TRACE(("evaltree(NULL) called\n"));
7389 TRACE(("pid %d, evaltree(%p: %d, %d) called\n",
7390 getpid(), n
, n
->type
, flags
));
7394 out1fmt("Node type = %d\n", n
->type
);
7399 evaltree(n
->nnot
.com
, EV_TESTED
);
7400 status
= !exitstatus
;
7403 expredir(n
->nredir
.redirect
);
7404 status
= redirectsafe(n
->nredir
.redirect
, REDIR_PUSH
);
7406 evaltree(n
->nredir
.n
, flags
& EV_TESTED
);
7407 status
= exitstatus
;
7412 evalfn
= evalcommand
;
7414 if (eflag
&& !(flags
& EV_TESTED
))
7426 evalfn
= evalsubshell
;
7438 #error NAND + 1 != NOR
7440 #if NOR + 1 != NSEMI
7441 #error NOR + 1 != NSEMI
7443 isor
= n
->type
- NAND
;
7446 (flags
| ((isor
>> 1) - 1)) & EV_TESTED
7448 if (!exitstatus
== isor
)
7460 evaltree(n
->nif
.test
, EV_TESTED
);
7463 if (exitstatus
== 0) {
7466 } else if (n
->nif
.elsepart
) {
7467 n
= n
->nif
.elsepart
;
7472 defun(n
->narg
.text
, n
->narg
.next
);
7476 exitstatus
= status
;
7480 if ((checkexit
& exitstatus
))
7481 evalskip
|= SKIPEVAL
;
7482 else if (pendingsig
&& dotrap())
7485 if (flags
& EV_EXIT
) {
7487 raise_exception(EXEXIT
);
7491 #if !defined(__alpha__) || (defined(__GNUC__) && __GNUC__ >= 3)
7494 void evaltreenr(union node
*, int) __attribute__ ((alias("evaltree"),__noreturn__
));
7496 static int loopnest
; /* current loop nesting level */
7499 evalloop(union node
*n
, int flags
)
7509 evaltree(n
->nbinary
.ch1
, EV_TESTED
);
7512 if (evalskip
== SKIPCONT
&& --skipcount
<= 0) {
7516 if (evalskip
== SKIPBREAK
&& --skipcount
<= 0)
7521 if (n
->type
!= NWHILE
)
7525 evaltree(n
->nbinary
.ch2
, flags
);
7526 status
= exitstatus
;
7531 exitstatus
= status
;
7535 evalfor(union node
*n
, int flags
)
7537 struct arglist arglist
;
7540 struct stackmark smark
;
7542 setstackmark(&smark
);
7543 arglist
.lastp
= &arglist
.list
;
7544 for (argp
= n
->nfor
.args
; argp
; argp
= argp
->narg
.next
) {
7545 expandarg(argp
, &arglist
, EXP_FULL
| EXP_TILDE
| EXP_RECORD
);
7550 *arglist
.lastp
= NULL
;
7555 for (sp
= arglist
.list
; sp
; sp
= sp
->next
) {
7556 setvar(n
->nfor
.var
, sp
->text
, 0);
7557 evaltree(n
->nfor
.body
, flags
);
7559 if (evalskip
== SKIPCONT
&& --skipcount
<= 0) {
7563 if (evalskip
== SKIPBREAK
&& --skipcount
<= 0)
7570 popstackmark(&smark
);
7574 evalcase(union node
*n
, int flags
)
7578 struct arglist arglist
;
7579 struct stackmark smark
;
7581 setstackmark(&smark
);
7582 arglist
.lastp
= &arglist
.list
;
7583 expandarg(n
->ncase
.expr
, &arglist
, EXP_TILDE
);
7585 for (cp
= n
->ncase
.cases
; cp
&& evalskip
== 0; cp
= cp
->nclist
.next
) {
7586 for (patp
= cp
->nclist
.pattern
; patp
; patp
= patp
->narg
.next
) {
7587 if (casematch(patp
, arglist
.list
->text
)) {
7588 if (evalskip
== 0) {
7589 evaltree(cp
->nclist
.body
, flags
);
7596 popstackmark(&smark
);
7600 * Kick off a subshell to evaluate a tree.
7603 evalsubshell(union node
*n
, int flags
)
7606 int backgnd
= (n
->type
== NBACKGND
);
7609 expredir(n
->nredir
.redirect
);
7610 if (!backgnd
&& flags
& EV_EXIT
&& !trap
[0])
7614 if (forkshell(jp
, n
, backgnd
) == 0) {
7618 flags
&=~ EV_TESTED
;
7620 redirect(n
->nredir
.redirect
, 0);
7621 evaltreenr(n
->nredir
.n
, flags
);
7626 status
= waitforjob(jp
);
7627 exitstatus
= status
;
7632 * Compute the names of the files in a redirection list.
7634 static void fixredir(union node
*, const char *, int);
7636 expredir(union node
*n
)
7640 for (redir
= n
; redir
; redir
= redir
->nfile
.next
) {
7643 memset(&fn
, 0, sizeof(fn
));
7644 fn
.lastp
= &fn
.list
;
7645 switch (redir
->type
) {
7651 expandarg(redir
->nfile
.fname
, &fn
, EXP_TILDE
| EXP_REDIR
);
7652 redir
->nfile
.expfname
= fn
.list
->text
;
7656 if (redir
->ndup
.vname
) {
7657 expandarg(redir
->ndup
.vname
, &fn
, EXP_FULL
| EXP_TILDE
);
7658 if (fn
.list
== NULL
)
7659 ash_msg_and_raise_error("redir error");
7660 fixredir(redir
, fn
.list
->text
, 1);
7668 * Evaluate a pipeline. All the processes in the pipeline are children
7669 * of the process creating the pipeline. (This differs from some versions
7670 * of the shell, which make the last process in a pipeline the parent
7674 evalpipe(union node
*n
, int flags
)
7677 struct nodelist
*lp
;
7682 TRACE(("evalpipe(0x%lx) called\n", (long)n
));
7684 for (lp
= n
->npipe
.cmdlist
; lp
; lp
= lp
->next
)
7688 jp
= makejob(n
, pipelen
);
7690 for (lp
= n
->npipe
.cmdlist
; lp
; lp
= lp
->next
) {
7694 if (pipe(pip
) < 0) {
7696 ash_msg_and_raise_error("pipe call failed");
7699 if (forkshell(jp
, lp
->n
, n
->npipe
.backgnd
) == 0) {
7712 evaltreenr(lp
->n
, flags
);
7720 if (n
->npipe
.backgnd
== 0) {
7721 exitstatus
= waitforjob(jp
);
7722 TRACE(("evalpipe: job done exit status %d\n", exitstatus
));
7728 * Controls whether the shell is interactive or not.
7731 setinteractive(int on
)
7733 static int is_interactive
;
7735 if (++on
== is_interactive
)
7737 is_interactive
= on
;
7741 #if !ENABLE_FEATURE_SH_EXTRA_QUIET
7742 if (is_interactive
> 1) {
7743 /* Looks like they want an interactive shell */
7744 static smallint did_banner
;
7749 "%s built-in shell (ash)\n"
7750 "Enter 'help' for a list of built-in commands."
7759 #if ENABLE_FEATURE_EDITING_VI
7760 #define setvimode(on) do { \
7761 if (on) line_input_state->flags |= VI_MODE; \
7762 else line_input_state->flags &= ~VI_MODE; \
7765 #define setvimode(on) viflag = 0 /* forcibly keep the option off */
7774 setinteractive(iflag
);
7779 static struct localvar
*localvars
;
7782 * Called after a function returns.
7783 * Interrupts must be off.
7788 struct localvar
*lvp
;
7791 while ((lvp
= localvars
) != NULL
) {
7792 localvars
= lvp
->next
;
7794 TRACE(("poplocalvar %s", vp
? vp
->text
: "-"));
7795 if (vp
== NULL
) { /* $- saved */
7796 memcpy(optlist
, lvp
->text
, sizeof(optlist
));
7797 free((char*)lvp
->text
);
7799 } else if ((lvp
->flags
& (VUNSET
|VSTRFIXED
)) == VUNSET
) {
7803 (*vp
->func
)(strchrnul(lvp
->text
, '=') + 1);
7804 if ((vp
->flags
& (VTEXTFIXED
|VSTACK
)) == 0)
7805 free((char*)vp
->text
);
7806 vp
->flags
= lvp
->flags
;
7807 vp
->text
= lvp
->text
;
7814 evalfun(struct funcnode
*func
, int argc
, char **argv
, int flags
)
7816 volatile struct shparam saveparam
;
7817 struct localvar
*volatile savelocalvars
;
7818 struct jmploc
*volatile savehandler
;
7819 struct jmploc jmploc
;
7822 saveparam
= shellparam
;
7823 savelocalvars
= localvars
;
7824 e
= setjmp(jmploc
.loc
);
7829 savehandler
= exception_handler
;
7830 exception_handler
= &jmploc
;
7832 shellparam
.malloc
= 0;
7836 shellparam
.nparam
= argc
- 1;
7837 shellparam
.p
= argv
+ 1;
7838 #if ENABLE_ASH_GETOPTS
7839 shellparam
.optind
= 1;
7840 shellparam
.optoff
= -1;
7842 evaltree(&func
->n
, flags
& EV_TESTED
);
7848 localvars
= savelocalvars
;
7849 freeparam(&shellparam
);
7850 shellparam
= saveparam
;
7851 exception_handler
= savehandler
;
7853 evalskip
&= ~SKIPFUNC
;
7857 #if ENABLE_ASH_CMDCMD
7859 parse_command_args(char **argv
, const char **path
)
7872 if (c
== '-' && !*cp
) {
7879 *path
= bb_default_path
;
7882 /* run 'typecmd' for other options */
7893 * Make a variable a local variable. When a variable is made local, it's
7894 * value and flags are saved in a localvar structure. The saved values
7895 * will be restored when the shell function returns. We handle the name
7896 * "-" as a special case.
7901 struct localvar
*lvp
;
7906 lvp
= ckmalloc(sizeof(struct localvar
));
7907 if (LONE_DASH(name
)) {
7909 p
= ckmalloc(sizeof(optlist
));
7910 lvp
->text
= memcpy(p
, optlist
, sizeof(optlist
));
7915 vpp
= hashvar(name
);
7916 vp
= *findvar(vpp
, name
);
7917 eq
= strchr(name
, '=');
7920 setvareq(name
, VSTRFIXED
);
7922 setvar(name
, NULL
, VSTRFIXED
);
7923 vp
= *vpp
; /* the new variable */
7924 lvp
->flags
= VUNSET
;
7926 lvp
->text
= vp
->text
;
7927 lvp
->flags
= vp
->flags
;
7928 vp
->flags
|= VSTRFIXED
|VTEXTFIXED
;
7934 lvp
->next
= localvars
;
7940 * The "local" command.
7943 localcmd(int argc
, char **argv
)
7948 while ((name
= *argv
++) != NULL
) {
7955 falsecmd(int argc
, char **argv
)
7961 truecmd(int argc
, char **argv
)
7967 execcmd(int argc
, char **argv
)
7970 iflag
= 0; /* exit on error */
7973 shellexec(argv
+ 1, pathval(), 0);
7979 * The return command.
7982 returncmd(int argc
, char **argv
)
7985 * If called outside a function, do what ksh does;
7986 * skip the rest of the file.
7988 evalskip
= funcnest
? SKIPFUNC
: SKIPFILE
;
7989 return argv
[1] ? number(argv
[1]) : exitstatus
;
7992 /* Forward declarations for builtintab[] */
7993 static int breakcmd(int, char **);
7994 static int dotcmd(int, char **);
7995 static int evalcmd(int, char **);
7996 #if ENABLE_ASH_BUILTIN_ECHO
7997 static int echocmd(int, char **);
7999 #if ENABLE_ASH_BUILTIN_TEST
8000 static int testcmd(int, char **);
8002 static int exitcmd(int, char **);
8003 static int exportcmd(int, char **);
8004 #if ENABLE_ASH_GETOPTS
8005 static int getoptscmd(int, char **);
8007 #if !ENABLE_FEATURE_SH_EXTRA_QUIET
8008 static int helpcmd(int argc
, char **argv
);
8010 #if ENABLE_ASH_MATH_SUPPORT
8011 static int letcmd(int, char **);
8013 static int readcmd(int, char **);
8014 static int setcmd(int, char **);
8015 static int shiftcmd(int, char **);
8016 static int timescmd(int, char **);
8017 static int trapcmd(int, char **);
8018 static int umaskcmd(int, char **);
8019 static int unsetcmd(int, char **);
8020 static int ulimitcmd(int, char **);
8022 #define BUILTIN_NOSPEC "0"
8023 #define BUILTIN_SPECIAL "1"
8024 #define BUILTIN_REGULAR "2"
8025 #define BUILTIN_SPEC_REG "3"
8026 #define BUILTIN_ASSIGN "4"
8027 #define BUILTIN_SPEC_ASSG "5"
8028 #define BUILTIN_REG_ASSG "6"
8029 #define BUILTIN_SPEC_REG_ASSG "7"
8031 /* make sure to keep these in proper order since it is searched via bsearch() */
8032 static const struct builtincmd builtintab
[] = {
8033 { BUILTIN_SPEC_REG
".", dotcmd
},
8034 { BUILTIN_SPEC_REG
":", truecmd
},
8035 #if ENABLE_ASH_BUILTIN_TEST
8036 { BUILTIN_REGULAR
"[", testcmd
},
8037 { BUILTIN_REGULAR
"[[", testcmd
},
8039 #if ENABLE_ASH_ALIAS
8040 { BUILTIN_REG_ASSG
"alias", aliascmd
},
8043 { BUILTIN_REGULAR
"bg", fg_bgcmd
},
8045 { BUILTIN_SPEC_REG
"break", breakcmd
},
8046 { BUILTIN_REGULAR
"cd", cdcmd
},
8047 { BUILTIN_NOSPEC
"chdir", cdcmd
},
8048 #if ENABLE_ASH_CMDCMD
8049 { BUILTIN_REGULAR
"command", commandcmd
},
8051 { BUILTIN_SPEC_REG
"continue", breakcmd
},
8052 #if ENABLE_ASH_BUILTIN_ECHO
8053 { BUILTIN_REGULAR
"echo", echocmd
},
8055 { BUILTIN_SPEC_REG
"eval", evalcmd
},
8056 { BUILTIN_SPEC_REG
"exec", execcmd
},
8057 { BUILTIN_SPEC_REG
"exit", exitcmd
},
8058 { BUILTIN_SPEC_REG_ASSG
"export", exportcmd
},
8059 { BUILTIN_REGULAR
"false", falsecmd
},
8061 { BUILTIN_REGULAR
"fg", fg_bgcmd
},
8063 #if ENABLE_ASH_GETOPTS
8064 { BUILTIN_REGULAR
"getopts", getoptscmd
},
8066 { BUILTIN_NOSPEC
"hash", hashcmd
},
8067 #if !ENABLE_FEATURE_SH_EXTRA_QUIET
8068 { BUILTIN_NOSPEC
"help", helpcmd
},
8071 { BUILTIN_REGULAR
"jobs", jobscmd
},
8072 { BUILTIN_REGULAR
"kill", killcmd
},
8074 #if ENABLE_ASH_MATH_SUPPORT
8075 { BUILTIN_NOSPEC
"let", letcmd
},
8077 { BUILTIN_ASSIGN
"local", localcmd
},
8078 { BUILTIN_NOSPEC
"pwd", pwdcmd
},
8079 { BUILTIN_REGULAR
"read", readcmd
},
8080 { BUILTIN_SPEC_REG_ASSG
"readonly", exportcmd
},
8081 { BUILTIN_SPEC_REG
"return", returncmd
},
8082 { BUILTIN_SPEC_REG
"set", setcmd
},
8083 { BUILTIN_SPEC_REG
"shift", shiftcmd
},
8084 { BUILTIN_SPEC_REG
"source", dotcmd
},
8085 #if ENABLE_ASH_BUILTIN_TEST
8086 { BUILTIN_REGULAR
"test", testcmd
},
8088 { BUILTIN_SPEC_REG
"times", timescmd
},
8089 { BUILTIN_SPEC_REG
"trap", trapcmd
},
8090 { BUILTIN_REGULAR
"true", truecmd
},
8091 { BUILTIN_NOSPEC
"type", typecmd
},
8092 { BUILTIN_NOSPEC
"ulimit", ulimitcmd
},
8093 { BUILTIN_REGULAR
"umask", umaskcmd
},
8094 #if ENABLE_ASH_ALIAS
8095 { BUILTIN_REGULAR
"unalias", unaliascmd
},
8097 { BUILTIN_SPEC_REG
"unset", unsetcmd
},
8098 { BUILTIN_REGULAR
"wait", waitcmd
},
8102 #define COMMANDCMD (builtintab + 5 + \
8103 2 * ENABLE_ASH_BUILTIN_TEST + \
8104 ENABLE_ASH_ALIAS + \
8105 ENABLE_ASH_JOB_CONTROL)
8106 #define EXECCMD (builtintab + 7 + \
8107 2 * ENABLE_ASH_BUILTIN_TEST + \
8108 ENABLE_ASH_ALIAS + \
8109 ENABLE_ASH_JOB_CONTROL + \
8110 ENABLE_ASH_CMDCMD + \
8111 ENABLE_ASH_BUILTIN_ECHO)
8114 * Search the table of builtin commands.
8116 static struct builtincmd
*
8117 find_builtin(const char *name
)
8119 struct builtincmd
*bp
;
8122 name
, builtintab
, ARRAY_SIZE(builtintab
), sizeof(builtintab
[0]),
8129 * Execute a simple command.
8131 static int back_exitstatus
; /* exit status of backquoted command */
8133 isassignment(const char *p
)
8135 const char *q
= endofname(p
);
8141 bltincmd(int argc
, char **argv
)
8143 /* Preserve exitstatus of a previous possible redirection
8144 * as POSIX mandates */
8145 return back_exitstatus
;
8148 evalcommand(union node
*cmd
, int flags
)
8150 static const struct builtincmd bltin
= {
8153 struct stackmark smark
;
8155 struct arglist arglist
;
8156 struct arglist varlist
;
8159 const struct strlist
*sp
;
8160 struct cmdentry cmdentry
;
8168 struct builtincmd
*bcmd
;
8169 int pseudovarflag
= 0;
8171 /* First expand the arguments. */
8172 TRACE(("evalcommand(0x%lx, %d) called\n", (long)cmd
, flags
));
8173 setstackmark(&smark
);
8174 back_exitstatus
= 0;
8176 cmdentry
.cmdtype
= CMDBUILTIN
;
8177 cmdentry
.u
.cmd
= &bltin
;
8178 varlist
.lastp
= &varlist
.list
;
8179 *varlist
.lastp
= NULL
;
8180 arglist
.lastp
= &arglist
.list
;
8181 *arglist
.lastp
= NULL
;
8184 if (cmd
->ncmd
.args
) {
8185 bcmd
= find_builtin(cmd
->ncmd
.args
->narg
.text
);
8186 pseudovarflag
= bcmd
&& IS_BUILTIN_ASSIGN(bcmd
);
8189 for (argp
= cmd
->ncmd
.args
; argp
; argp
= argp
->narg
.next
) {
8190 struct strlist
**spp
;
8192 spp
= arglist
.lastp
;
8193 if (pseudovarflag
&& isassignment(argp
->narg
.text
))
8194 expandarg(argp
, &arglist
, EXP_VARTILDE
);
8196 expandarg(argp
, &arglist
, EXP_FULL
| EXP_TILDE
);
8198 for (sp
= *spp
; sp
; sp
= sp
->next
)
8202 argv
= nargv
= stalloc(sizeof(char *) * (argc
+ 1));
8203 for (sp
= arglist
.list
; sp
; sp
= sp
->next
) {
8204 TRACE(("evalcommand arg: %s\n", sp
->text
));
8205 *nargv
++ = sp
->text
;
8210 if (iflag
&& funcnest
== 0 && argc
> 0)
8211 lastarg
= nargv
[-1];
8214 expredir(cmd
->ncmd
.redirect
);
8215 status
= redirectsafe(cmd
->ncmd
.redirect
, REDIR_PUSH
| REDIR_SAVEFD2
);
8218 for (argp
= cmd
->ncmd
.assign
; argp
; argp
= argp
->narg
.next
) {
8219 struct strlist
**spp
;
8222 spp
= varlist
.lastp
;
8223 expandarg(argp
, &varlist
, EXP_VARTILDE
);
8226 * Modify the command lookup path, if a PATH= assignment
8230 if (varequal(p
, path
))
8234 /* Print the command if xflag is set. */
8237 const char *p
= " %s";
8240 fdprintf(preverrout_fd
, p
, expandstr(ps4val()));
8243 for (n
= 0; n
< 2; n
++) {
8245 fdprintf(preverrout_fd
, p
, sp
->text
);
8253 full_write(preverrout_fd
, "\n", 1);
8259 /* Now locate the command. */
8261 const char *oldpath
;
8262 int cmd_flag
= DO_ERR
;
8267 find_command(argv
[0], &cmdentry
, cmd_flag
, path
);
8268 if (cmdentry
.cmdtype
== CMDUNKNOWN
) {
8274 /* implement bltin and command here */
8275 if (cmdentry
.cmdtype
!= CMDBUILTIN
)
8278 spclbltin
= IS_BUILTIN_SPECIAL(cmdentry
.u
.cmd
);
8279 if (cmdentry
.u
.cmd
== EXECCMD
)
8281 #if ENABLE_ASH_CMDCMD
8282 if (cmdentry
.u
.cmd
== COMMANDCMD
) {
8284 nargv
= parse_command_args(argv
, &path
);
8287 argc
-= nargv
- argv
;
8289 cmd_flag
|= DO_NOFUNC
;
8297 /* We have a redirection error. */
8299 raise_exception(EXERROR
);
8301 exitstatus
= status
;
8305 /* Execute the command. */
8306 switch (cmdentry
.cmdtype
) {
8308 /* Fork off a child process if necessary. */
8309 if (!(flags
& EV_EXIT
) || trap
[0]) {
8311 jp
= makejob(cmd
, 1);
8312 if (forkshell(jp
, cmd
, FORK_FG
) != 0) {
8313 exitstatus
= waitforjob(jp
);
8319 listsetvar(varlist
.list
, VEXPORT
|VSTACK
);
8320 shellexec(argv
, path
, cmdentry
.u
.index
);
8324 cmdenviron
= varlist
.list
;
8326 struct strlist
*list
= cmdenviron
;
8328 if (spclbltin
> 0 || argc
== 0) {
8330 if (cmd_is_exec
&& argc
> 1)
8333 listsetvar(list
, i
);
8335 if (evalbltin(cmdentry
.u
.cmd
, argc
, argv
)) {
8350 exit_status
= j
+ 128;
8351 exitstatus
= exit_status
;
8353 if (i
== EXINT
|| spclbltin
> 0) {
8355 longjmp(exception_handler
->loc
, 1);
8362 listsetvar(varlist
.list
, 0);
8363 if (evalfun(cmdentry
.u
.func
, argc
, argv
, flags
))
8369 popredir(cmd_is_exec
);
8371 /* dsl: I think this is intended to be used to support
8372 * '_' in 'vi' command mode during line editing...
8373 * However I implemented that within libedit itself.
8375 setvar("_", lastarg
, 0);
8376 popstackmark(&smark
);
8380 evalbltin(const struct builtincmd
*cmd
, int argc
, char **argv
)
8382 char *volatile savecmdname
;
8383 struct jmploc
*volatile savehandler
;
8384 struct jmploc jmploc
;
8387 savecmdname
= commandname
;
8388 i
= setjmp(jmploc
.loc
);
8391 savehandler
= exception_handler
;
8392 exception_handler
= &jmploc
;
8393 commandname
= argv
[0];
8395 optptr
= NULL
; /* initialize nextopt */
8396 exitstatus
= (*cmd
->builtin
)(argc
, argv
);
8397 flush_stdout_stderr();
8399 exitstatus
|= ferror(stdout
);
8401 commandname
= savecmdname
;
8403 exception_handler
= savehandler
;
8409 goodname(const char *p
)
8411 return !*endofname(p
);
8416 * Search for a command. This is called before we fork so that the
8417 * location of the command will be available in the parent as well as
8418 * the child. The check for "goodname" is an overly conservative
8419 * check that the name will not be subject to expansion.
8422 prehash(union node
*n
)
8424 struct cmdentry entry
;
8426 if (n
->type
== NCMD
&& n
->ncmd
.args
&& goodname(n
->ncmd
.args
->narg
.text
))
8427 find_command(n
->ncmd
.args
->narg
.text
, &entry
, 0, pathval());
8431 /* ============ Builtin commands
8433 * Builtin commands whose functions are closely tied to evaluation
8434 * are implemented here.
8438 * Handle break and continue commands. Break, continue, and return are
8439 * all handled by setting the evalskip flag. The evaluation routines
8440 * above all check this flag, and if it is set they start skipping
8441 * commands rather than executing them. The variable skipcount is
8442 * the number of loops to break/continue, or the number of function
8443 * levels to return. (The latter is always 1.) It should probably
8444 * be an error to break out of more loops than exist, but it isn't
8445 * in the standard shell so we don't make it one here.
8448 breakcmd(int argc
, char **argv
)
8450 int n
= argc
> 1 ? number(argv
[1]) : 1;
8453 ash_msg_and_raise_error(illnum
, argv
[1]);
8457 evalskip
= (**argv
== 'c') ? SKIPCONT
: SKIPBREAK
;
8464 /* ============ input.c
8466 * This implements the input routines used by the parser.
8469 #define EOF_NLEFT -99 /* value of parsenleft when EOF pushed back */
8472 INPUT_PUSH_FILE
= 1,
8473 INPUT_NOFILE_OK
= 2,
8476 static int plinno
= 1; /* input line number */
8477 /* number of characters left in input buffer */
8478 static int parsenleft
; /* copy of parsefile->nleft */
8479 static int parselleft
; /* copy of parsefile->lleft */
8480 /* next character in input buffer */
8481 static char *parsenextc
; /* copy of parsefile->nextc */
8483 static int checkkwd
;
8484 /* values of checkkwd variable */
8485 #define CHKALIAS 0x1
8492 struct strpush
*sp
= parsefile
->strpush
;
8495 #if ENABLE_ASH_ALIAS
8497 if (parsenextc
[-1] == ' ' || parsenextc
[-1] == '\t') {
8498 checkkwd
|= CHKALIAS
;
8500 if (sp
->string
!= sp
->ap
->val
) {
8503 sp
->ap
->flag
&= ~ALIASINUSE
;
8504 if (sp
->ap
->flag
& ALIASDEAD
) {
8505 unalias(sp
->ap
->name
);
8509 parsenextc
= sp
->prevstring
;
8510 parsenleft
= sp
->prevnleft
;
8511 /*dprintf("*** calling popstring: restoring to '%s'\n", parsenextc);*/
8512 parsefile
->strpush
= sp
->prev
;
8513 if (sp
!= &(parsefile
->basestrpush
))
8522 char *buf
= parsefile
->buf
;
8526 #if ENABLE_FEATURE_EDITING
8527 if (!iflag
|| parsefile
->fd
)
8528 nr
= safe_read(parsefile
->fd
, buf
, BUFSIZ
- 1);
8530 #if ENABLE_FEATURE_TAB_COMPLETION
8531 line_input_state
->path_lookup
= pathval();
8533 nr
= read_line_input(cmdedit_prompt
, buf
, BUFSIZ
, line_input_state
);
8535 /* Ctrl+C pressed */
8544 if (nr
< 0 && errno
== 0) {
8545 /* Ctrl+D presend */
8550 nr
= safe_read(parsefile
->fd
, buf
, BUFSIZ
- 1);
8554 if (parsefile
->fd
== 0 && errno
== EWOULDBLOCK
) {
8555 int flags
= fcntl(0, F_GETFL
);
8556 if (flags
>= 0 && flags
& O_NONBLOCK
) {
8557 flags
&=~ O_NONBLOCK
;
8558 if (fcntl(0, F_SETFL
, flags
) >= 0) {
8559 out2str("sh: turning off NDELAY mode\n");
8569 * Refill the input buffer and return the next input character:
8571 * 1) If a string was pushed back on the input, pop it;
8572 * 2) If an EOF was pushed back (parsenleft == EOF_NLEFT) or we are reading
8573 * from a string so we can't refill the buffer, return EOF.
8574 * 3) If the is more stuff in this buffer, use it else call read to fill it.
8575 * 4) Process input up to the next newline, deleting nul characters.
8584 while (parsefile
->strpush
) {
8585 #if ENABLE_ASH_ALIAS
8586 if (parsenleft
== -1 && parsefile
->strpush
->ap
&&
8587 parsenextc
[-1] != ' ' && parsenextc
[-1] != '\t') {
8592 if (--parsenleft
>= 0)
8593 return signed_char2int(*parsenextc
++);
8595 if (parsenleft
== EOF_NLEFT
|| parsefile
->buf
== NULL
)
8597 flush_stdout_stderr();
8604 parselleft
= parsenleft
= EOF_NLEFT
;
8611 /* delete nul characters */
8619 memmove(q
, q
+ 1, more
);
8623 parsenleft
= q
- parsenextc
- 1;
8629 parsenleft
= q
- parsenextc
- 1;
8641 out2str(parsenextc
);
8646 return signed_char2int(*parsenextc
++);
8649 #define pgetc_as_macro() (--parsenleft >= 0? signed_char2int(*parsenextc++) : preadbuffer())
8653 return pgetc_as_macro();
8656 #if ENABLE_ASH_OPTIMIZE_FOR_SIZE
8657 #define pgetc_macro() pgetc()
8659 #define pgetc_macro() pgetc_as_macro()
8663 * Same as pgetc(), but ignores PEOA.
8665 #if ENABLE_ASH_ALIAS
8673 } while (c
== PEOA
);
8680 return pgetc_macro();
8685 * Read a line from the script.
8688 pfgets(char *line
, int len
)
8694 while (--nleft
> 0) {
8710 * Undo the last call to pgetc. Only one character may be pushed back.
8711 * PEOF may be pushed back.
8721 * Push a string back onto the input at this current parsefile level.
8722 * We handle aliases this way.
8725 pushstring(char *s
, void *ap
)
8732 /*dprintf("*** calling pushstring: %s, %d\n", s, len);*/
8733 if (parsefile
->strpush
) {
8734 sp
= ckmalloc(sizeof(struct strpush
));
8735 sp
->prev
= parsefile
->strpush
;
8736 parsefile
->strpush
= sp
;
8738 sp
= parsefile
->strpush
= &(parsefile
->basestrpush
);
8739 sp
->prevstring
= parsenextc
;
8740 sp
->prevnleft
= parsenleft
;
8741 #if ENABLE_ASH_ALIAS
8742 sp
->ap
= (struct alias
*)ap
;
8744 ((struct alias
*)ap
)->flag
|= ALIASINUSE
;
8754 * To handle the "." command, a stack of input files is used. Pushfile
8755 * adds a new entry to the stack and popfile restores the previous level.
8760 struct parsefile
*pf
;
8762 parsefile
->nleft
= parsenleft
;
8763 parsefile
->lleft
= parselleft
;
8764 parsefile
->nextc
= parsenextc
;
8765 parsefile
->linno
= plinno
;
8766 pf
= ckmalloc(sizeof(*pf
));
8767 pf
->prev
= parsefile
;
8770 pf
->basestrpush
.prev
= NULL
;
8777 struct parsefile
*pf
= parsefile
;
8785 parsefile
= pf
->prev
;
8787 parsenleft
= parsefile
->nleft
;
8788 parselleft
= parsefile
->lleft
;
8789 parsenextc
= parsefile
->nextc
;
8790 plinno
= parsefile
->linno
;
8795 * Return to top level.
8800 while (parsefile
!= &basepf
)
8805 * Close the file(s) that the shell is reading commands from. Called
8806 * after a fork is done.
8812 if (parsefile
->fd
> 0) {
8813 close(parsefile
->fd
);
8819 * Like setinputfile, but takes an open file descriptor. Call this with
8823 setinputfd(int fd
, int push
)
8825 close_on_exec_on(fd
);
8831 if (parsefile
->buf
== NULL
)
8832 parsefile
->buf
= ckmalloc(IBUFSIZ
);
8833 parselleft
= parsenleft
= 0;
8838 * Set the input to take input from a file. If push is set, push the
8839 * old input onto the stack first.
8842 setinputfile(const char *fname
, int flags
)
8848 fd
= open(fname
, O_RDONLY
);
8850 if (flags
& INPUT_NOFILE_OK
)
8852 ash_msg_and_raise_error("can't open %s", fname
);
8855 fd2
= copyfd(fd
, 10);
8858 ash_msg_and_raise_error("out of file descriptors");
8861 setinputfd(fd
, flags
& INPUT_PUSH_FILE
);
8868 * Like setinputfile, but takes input from a string.
8871 setinputstring(char *string
)
8875 parsenextc
= string
;
8876 parsenleft
= strlen(string
);
8877 parsefile
->buf
= NULL
;
8883 /* ============ mail.c
8885 * Routines to check for mail.
8890 #define MAXMBOXES 10
8892 /* times of mailboxes */
8893 static time_t mailtime
[MAXMBOXES
];
8894 /* Set if MAIL or MAILPATH is changed. */
8895 static smallint mail_var_path_changed
;
8898 * Print appropriate message(s) if mail has arrived.
8899 * If mail_var_path_changed is set,
8900 * then the value of MAIL has mail_var_path_changed,
8901 * so we just update the values.
8910 struct stackmark smark
;
8913 setstackmark(&smark
);
8914 mpath
= mpathset() ? mpathval() : mailval();
8915 for (mtp
= mailtime
; mtp
< mailtime
+ MAXMBOXES
; mtp
++) {
8916 p
= padvance(&mpath
, nullstr
);
8921 for (q
= p
; *q
; q
++);
8926 q
[-1] = '\0'; /* delete trailing '/' */
8927 if (stat(p
, &statb
) < 0) {
8931 if (!mail_var_path_changed
&& statb
.st_mtime
!= *mtp
) {
8934 pathopt
? pathopt
: "you have mail"
8937 *mtp
= statb
.st_mtime
;
8939 mail_var_path_changed
= 0;
8940 popstackmark(&smark
);
8944 changemail(const char *val
)
8946 mail_var_path_changed
= 1;
8949 #endif /* ASH_MAIL */
8952 /* ============ ??? */
8955 * Set the shell parameters.
8958 setparam(char **argv
)
8964 for (nparam
= 0; argv
[nparam
]; nparam
++);
8965 ap
= newparam
= ckmalloc((nparam
+ 1) * sizeof(*ap
));
8967 *ap
++ = ckstrdup(*argv
++);
8970 freeparam(&shellparam
);
8971 shellparam
.malloc
= 1;
8972 shellparam
.nparam
= nparam
;
8973 shellparam
.p
= newparam
;
8974 #if ENABLE_ASH_GETOPTS
8975 shellparam
.optind
= 1;
8976 shellparam
.optoff
= -1;
8981 * Process shell options. The global variable argptr contains a pointer
8982 * to the argument list; we advance it past the options.
8985 minus_o(char *name
, int val
)
8990 for (i
= 0; i
< NOPTS
; i
++) {
8991 if (strcmp(name
, optnames(i
)) == 0) {
8996 ash_msg_and_raise_error("illegal option -o %s", name
);
8998 out1str("Current option settings\n");
8999 for (i
= 0; i
< NOPTS
; i
++)
9000 out1fmt("%-16s%s\n", optnames(i
),
9001 optlist
[i
] ? "on" : "off");
9004 setoption(int flag
, int val
)
9008 for (i
= 0; i
< NOPTS
; i
++) {
9009 if (optletters(i
) == flag
) {
9014 ash_msg_and_raise_error("illegal option -%c", flag
);
9018 options(int cmdline
)
9026 while ((p
= *argptr
) != NULL
) {
9028 if (c
!= '-' && c
!= '+')
9031 val
= 0; /* val = 0 if c == '+' */
9034 if (p
[0] == '\0' || LONE_DASH(p
)) {
9036 /* "-" means turn off -x and -v */
9039 /* "--" means reset params */
9040 else if (*argptr
== NULL
)
9043 break; /* "-" or "--" terminates options */
9046 /* first char was + or - */
9047 while ((c
= *p
++) != '\0') {
9048 /* bash 3.2 indeed handles -c CMD and +c CMD the same */
9049 if (c
== 'c' && cmdline
) {
9050 minusc
= p
; /* command is after shell args */
9051 } else if (c
== 'o') {
9052 minus_o(*argptr
, val
);
9055 } else if (cmdline
&& (c
== 'l')) { /* -l or +l == --login */
9057 /* bash does not accept +-login, we also won't */
9058 } else if (cmdline
&& val
&& (c
== '-')) { /* long options */
9059 if (strcmp(p
, "login") == 0)
9070 * The shift builtin command.
9073 shiftcmd(int argc
, char **argv
)
9080 n
= number(argv
[1]);
9081 if (n
> shellparam
.nparam
)
9082 ash_msg_and_raise_error("can't shift that many");
9084 shellparam
.nparam
-= n
;
9085 for (ap1
= shellparam
.p
; --n
>= 0; ap1
++) {
9086 if (shellparam
.malloc
)
9090 while ((*ap2
++ = *ap1
++) != NULL
);
9091 #if ENABLE_ASH_GETOPTS
9092 shellparam
.optind
= 1;
9093 shellparam
.optoff
= -1;
9100 * POSIX requires that 'set' (but not export or readonly) output the
9101 * variables in lexicographic order - by the locale's collating order (sigh).
9102 * Maybe we could keep them in an ordered balanced binary tree
9103 * instead of hashed lists.
9104 * For now just roll 'em through qsort for printing...
9107 showvars(const char *sep_prefix
, int on
, int off
)
9112 ep
= listvars(on
, off
, &epend
);
9113 qsort(ep
, epend
- ep
, sizeof(char *), vpcmp
);
9115 sep
= *sep_prefix
? " " : sep_prefix
;
9117 for (; ep
< epend
; ep
++) {
9121 p
= strchrnul(*ep
, '=');
9124 q
= single_quote(++p
);
9125 out1fmt("%s%s%.*s%s\n", sep_prefix
, sep
, (int)(p
- *ep
), *ep
, q
);
9131 * The set command builtin.
9134 setcmd(int argc
, char **argv
)
9137 return showvars(nullstr
, 0, VUNSET
);
9141 if (*argptr
!= NULL
) {
9148 #if ENABLE_ASH_RANDOM_SUPPORT
9149 /* Roughly copied from bash.. */
9151 change_random(const char *value
)
9153 if (value
== NULL
) {
9154 /* "get", generate */
9157 rseed
= rseed
* 1103515245 + 12345;
9158 sprintf(buf
, "%d", (unsigned int)((rseed
& 32767)));
9159 /* set without recursion */
9160 setvar(vrandom
.text
, buf
, VNOFUNC
);
9161 vrandom
.flags
&= ~VNOFUNC
;
9164 rseed
= strtoul(value
, (char **)NULL
, 10);
9169 #if ENABLE_ASH_GETOPTS
9171 getopts(char *optstr
, char *optvar
, char **optfirst
, int *param_optind
, int *optoff
)
9180 if (*param_optind
< 1)
9182 optnext
= optfirst
+ *param_optind
- 1;
9184 if (*param_optind
<= 1 || *optoff
< 0 || strlen(optnext
[-1]) < *optoff
)
9187 p
= optnext
[-1] + *optoff
;
9188 if (p
== NULL
|| *p
== '\0') {
9189 /* Current word is done, advance */
9191 if (p
== NULL
|| *p
!= '-' || *++p
== '\0') {
9198 if (LONE_DASH(p
)) /* check for "--" */
9203 for (q
= optstr
; *q
!= c
; ) {
9205 if (optstr
[0] == ':') {
9208 err
|= setvarsafe("OPTARG", s
, 0);
9210 fprintf(stderr
, "Illegal option -%c\n", c
);
9221 if (*p
== '\0' && (p
= *optnext
) == NULL
) {
9222 if (optstr
[0] == ':') {
9225 err
|= setvarsafe("OPTARG", s
, 0);
9228 fprintf(stderr
, "No arg for -%c option\n", c
);
9237 err
|= setvarsafe("OPTARG", p
, 0);
9240 err
|= setvarsafe("OPTARG", nullstr
, 0);
9242 *optoff
= p
? p
- *(optnext
- 1) : -1;
9243 *param_optind
= optnext
- optfirst
+ 1;
9244 fmtstr(s
, sizeof(s
), "%d", *param_optind
);
9245 err
|= setvarsafe("OPTIND", s
, VNOFUNC
);
9248 err
|= setvarsafe(optvar
, s
, 0);
9252 flush_stdout_stderr();
9253 raise_exception(EXERROR
);
9259 * The getopts builtin. Shellparam.optnext points to the next argument
9260 * to be processed. Shellparam.optptr points to the next character to
9261 * be processed in the current argument. If shellparam.optnext is NULL,
9262 * then it's the first time getopts has been called.
9265 getoptscmd(int argc
, char **argv
)
9270 ash_msg_and_raise_error("usage: getopts optstring var [arg]");
9272 optbase
= shellparam
.p
;
9273 if (shellparam
.optind
> shellparam
.nparam
+ 1) {
9274 shellparam
.optind
= 1;
9275 shellparam
.optoff
= -1;
9279 if (shellparam
.optind
> argc
- 2) {
9280 shellparam
.optind
= 1;
9281 shellparam
.optoff
= -1;
9285 return getopts(argv
[1], argv
[2], optbase
, &shellparam
.optind
,
9286 &shellparam
.optoff
);
9288 #endif /* ASH_GETOPTS */
9291 /* ============ Shell parser */
9294 * NEOF is returned by parsecmd when it encounters an end of file. It
9295 * must be distinct from NULL, so we use the address of a variable that
9296 * happens to be handy.
9298 static smallint tokpushback
; /* last token pushed back */
9299 #define NEOF ((union node *)&tokpushback)
9300 static smallint parsebackquote
; /* nonzero if we are inside backquotes */
9301 static int lasttoken
; /* last token read */
9302 static char *wordtext
; /* text of last word returned by readtoken */
9303 static struct nodelist
*backquotelist
;
9304 static union node
*redirnode
;
9305 static struct heredoc
*heredoc
;
9306 static smallint quoteflag
; /* set if (part of) last token was quoted */
9308 static void raise_error_syntax(const char *) ATTRIBUTE_NORETURN
;
9310 raise_error_syntax(const char *msg
)
9312 ash_msg_and_raise_error("syntax error: %s", msg
);
9317 * Called when an unexpected token is read during the parse. The argument
9318 * is the token that is expected, or -1 if more than one type of token can
9319 * occur at this point.
9321 static void raise_error_unexpected_syntax(int) ATTRIBUTE_NORETURN
;
9323 raise_error_unexpected_syntax(int token
)
9328 l
= sprintf(msg
, "%s unexpected", tokname(lasttoken
));
9330 sprintf(msg
+ l
, " (expecting %s)", tokname(token
));
9331 raise_error_syntax(msg
);
9335 #define EOFMARKLEN 79
9338 struct heredoc
*next
; /* next here document in list */
9339 union node
*here
; /* redirection node */
9340 char *eofmark
; /* string indicating end of input */
9341 int striptabs
; /* if set, strip leading tabs */
9344 static struct heredoc
*heredoclist
; /* list of here documents to read */
9346 /* parsing is heavily cross-recursive, need these forward decls */
9347 static union node
*andor(void);
9348 static union node
*pipeline(void);
9349 static union node
*parse_command(void);
9350 static void parseheredoc(void);
9351 static char peektoken(void);
9352 static int readtoken(void);
9357 union node
*n1
, *n2
, *n3
;
9360 checkkwd
= CHKNL
| CHKKWD
| CHKALIAS
;
9361 if (nlflag
== 2 && peektoken())
9367 if (tok
== TBACKGND
) {
9368 if (n2
->type
== NPIPE
) {
9369 n2
->npipe
.backgnd
= 1;
9371 if (n2
->type
!= NREDIR
) {
9372 n3
= stalloc(sizeof(struct nredir
));
9374 n3
->nredir
.redirect
= NULL
;
9377 n2
->type
= NBACKGND
;
9383 n3
= stalloc(sizeof(struct nbinary
));
9385 n3
->nbinary
.ch1
= n1
;
9386 n3
->nbinary
.ch2
= n2
;
9402 checkkwd
= CHKNL
| CHKKWD
| CHKALIAS
;
9410 pungetc(); /* push back EOF on input */
9414 raise_error_unexpected_syntax(-1);
9424 union node
*n1
, *n2
, *n3
;
9432 } else if (t
== TOR
) {
9438 checkkwd
= CHKNL
| CHKKWD
| CHKALIAS
;
9440 n3
= stalloc(sizeof(struct nbinary
));
9442 n3
->nbinary
.ch1
= n1
;
9443 n3
->nbinary
.ch2
= n2
;
9451 union node
*n1
, *n2
, *pipenode
;
9452 struct nodelist
*lp
, *prev
;
9456 TRACE(("pipeline: entered\n"));
9457 if (readtoken() == TNOT
) {
9459 checkkwd
= CHKKWD
| CHKALIAS
;
9462 n1
= parse_command();
9463 if (readtoken() == TPIPE
) {
9464 pipenode
= stalloc(sizeof(struct npipe
));
9465 pipenode
->type
= NPIPE
;
9466 pipenode
->npipe
.backgnd
= 0;
9467 lp
= stalloc(sizeof(struct nodelist
));
9468 pipenode
->npipe
.cmdlist
= lp
;
9472 lp
= stalloc(sizeof(struct nodelist
));
9473 checkkwd
= CHKNL
| CHKKWD
| CHKALIAS
;
9474 lp
->n
= parse_command();
9476 } while (readtoken() == TPIPE
);
9482 n2
= stalloc(sizeof(struct nnot
));
9495 n
= stalloc(sizeof(struct narg
));
9497 n
->narg
.next
= NULL
;
9498 n
->narg
.text
= wordtext
;
9499 n
->narg
.backquote
= backquotelist
;
9504 fixredir(union node
*n
, const char *text
, int err
)
9506 TRACE(("Fix redir %s %d\n", text
, err
));
9508 n
->ndup
.vname
= NULL
;
9510 if (isdigit(text
[0]) && text
[1] == '\0')
9511 n
->ndup
.dupfd
= text
[0] - '0';
9512 else if (LONE_DASH(text
))
9516 raise_error_syntax("Bad fd number");
9517 n
->ndup
.vname
= makename();
9522 * Returns true if the text contains nothing to expand (no dollar signs
9526 noexpand(char *text
)
9532 while ((c
= *p
++) != '\0') {
9533 if (c
== CTLQUOTEMARK
)
9537 else if (SIT(c
, BASESYNTAX
) == CCTL
)
9546 union node
*n
= redirnode
;
9548 if (readtoken() != TWORD
)
9549 raise_error_unexpected_syntax(-1);
9550 if (n
->type
== NHERE
) {
9551 struct heredoc
*here
= heredoc
;
9557 TRACE(("Here document %d\n", n
->type
));
9558 if (!noexpand(wordtext
) || (i
= strlen(wordtext
)) == 0 || i
> EOFMARKLEN
)
9559 raise_error_syntax("Illegal eof marker for << redirection");
9560 rmescapes(wordtext
);
9561 here
->eofmark
= wordtext
;
9563 if (heredoclist
== NULL
)
9566 for (p
= heredoclist
; p
->next
; p
= p
->next
);
9569 } else if (n
->type
== NTOFD
|| n
->type
== NFROMFD
) {
9570 fixredir(n
, wordtext
, 0);
9572 n
->nfile
.fname
= makename();
9579 union node
*args
, **app
;
9580 union node
*n
= NULL
;
9581 union node
*vars
, **vpp
;
9582 union node
**rpp
, *redir
;
9592 savecheckkwd
= CHKALIAS
;
9594 checkkwd
= savecheckkwd
;
9595 switch (readtoken()) {
9597 n
= stalloc(sizeof(struct narg
));
9599 n
->narg
.text
= wordtext
;
9600 n
->narg
.backquote
= backquotelist
;
9601 if (savecheckkwd
&& isassignment(wordtext
)) {
9603 vpp
= &n
->narg
.next
;
9606 app
= &n
->narg
.next
;
9611 *rpp
= n
= redirnode
;
9612 rpp
= &n
->nfile
.next
;
9613 parsefname(); /* read name of redirection file */
9616 if (args
&& app
== &args
->narg
.next
9619 struct builtincmd
*bcmd
;
9622 /* We have a function */
9623 if (readtoken() != TRP
)
9624 raise_error_unexpected_syntax(TRP
);
9625 name
= n
->narg
.text
;
9627 || ((bcmd
= find_builtin(name
)) && IS_BUILTIN_SPECIAL(bcmd
))
9629 raise_error_syntax("Bad function name");
9632 checkkwd
= CHKNL
| CHKKWD
| CHKALIAS
;
9633 n
->narg
.next
= parse_command();
9646 n
= stalloc(sizeof(struct ncmd
));
9648 n
->ncmd
.args
= args
;
9649 n
->ncmd
.assign
= vars
;
9650 n
->ncmd
.redirect
= redir
;
9657 union node
*n1
, *n2
;
9658 union node
*ap
, **app
;
9659 union node
*cp
, **cpp
;
9660 union node
*redir
, **rpp
;
9667 switch (readtoken()) {
9669 raise_error_unexpected_syntax(-1);
9672 n1
= stalloc(sizeof(struct nif
));
9674 n1
->nif
.test
= list(0);
9675 if (readtoken() != TTHEN
)
9676 raise_error_unexpected_syntax(TTHEN
);
9677 n1
->nif
.ifpart
= list(0);
9679 while (readtoken() == TELIF
) {
9680 n2
->nif
.elsepart
= stalloc(sizeof(struct nif
));
9681 n2
= n2
->nif
.elsepart
;
9683 n2
->nif
.test
= list(0);
9684 if (readtoken() != TTHEN
)
9685 raise_error_unexpected_syntax(TTHEN
);
9686 n2
->nif
.ifpart
= list(0);
9688 if (lasttoken
== TELSE
)
9689 n2
->nif
.elsepart
= list(0);
9691 n2
->nif
.elsepart
= NULL
;
9699 n1
= stalloc(sizeof(struct nbinary
));
9700 n1
->type
= (lasttoken
== TWHILE
) ? NWHILE
: NUNTIL
;
9701 n1
->nbinary
.ch1
= list(0);
9704 TRACE(("expecting DO got %s %s\n", tokname(got
),
9705 got
== TWORD
? wordtext
: ""));
9706 raise_error_unexpected_syntax(TDO
);
9708 n1
->nbinary
.ch2
= list(0);
9713 if (readtoken() != TWORD
|| quoteflag
|| ! goodname(wordtext
))
9714 raise_error_syntax("Bad for loop variable");
9715 n1
= stalloc(sizeof(struct nfor
));
9717 n1
->nfor
.var
= wordtext
;
9718 checkkwd
= CHKKWD
| CHKALIAS
;
9719 if (readtoken() == TIN
) {
9721 while (readtoken() == TWORD
) {
9722 n2
= stalloc(sizeof(struct narg
));
9724 n2
->narg
.text
= wordtext
;
9725 n2
->narg
.backquote
= backquotelist
;
9727 app
= &n2
->narg
.next
;
9731 if (lasttoken
!= TNL
&& lasttoken
!= TSEMI
)
9732 raise_error_unexpected_syntax(-1);
9734 n2
= stalloc(sizeof(struct narg
));
9736 n2
->narg
.text
= (char *)dolatstr
;
9737 n2
->narg
.backquote
= NULL
;
9738 n2
->narg
.next
= NULL
;
9741 * Newline or semicolon here is optional (but note
9742 * that the original Bourne shell only allowed NL).
9744 if (lasttoken
!= TNL
&& lasttoken
!= TSEMI
)
9747 checkkwd
= CHKNL
| CHKKWD
| CHKALIAS
;
9748 if (readtoken() != TDO
)
9749 raise_error_unexpected_syntax(TDO
);
9750 n1
->nfor
.body
= list(0);
9754 n1
= stalloc(sizeof(struct ncase
));
9756 if (readtoken() != TWORD
)
9757 raise_error_unexpected_syntax(TWORD
);
9758 n1
->ncase
.expr
= n2
= stalloc(sizeof(struct narg
));
9760 n2
->narg
.text
= wordtext
;
9761 n2
->narg
.backquote
= backquotelist
;
9762 n2
->narg
.next
= NULL
;
9764 checkkwd
= CHKKWD
| CHKALIAS
;
9765 } while (readtoken() == TNL
);
9766 if (lasttoken
!= TIN
)
9767 raise_error_unexpected_syntax(TIN
);
9768 cpp
= &n1
->ncase
.cases
;
9770 checkkwd
= CHKNL
| CHKKWD
;
9772 while (t
!= TESAC
) {
9773 if (lasttoken
== TLP
)
9775 *cpp
= cp
= stalloc(sizeof(struct nclist
));
9777 app
= &cp
->nclist
.pattern
;
9779 *app
= ap
= stalloc(sizeof(struct narg
));
9781 ap
->narg
.text
= wordtext
;
9782 ap
->narg
.backquote
= backquotelist
;
9783 if (readtoken() != TPIPE
)
9785 app
= &ap
->narg
.next
;
9788 ap
->narg
.next
= NULL
;
9789 if (lasttoken
!= TRP
)
9790 raise_error_unexpected_syntax(TRP
);
9791 cp
->nclist
.body
= list(2);
9793 cpp
= &cp
->nclist
.next
;
9795 checkkwd
= CHKNL
| CHKKWD
;
9799 raise_error_unexpected_syntax(TENDCASE
);
9806 n1
= stalloc(sizeof(struct nredir
));
9807 n1
->type
= NSUBSHELL
;
9808 n1
->nredir
.n
= list(0);
9809 n1
->nredir
.redirect
= NULL
;
9822 if (readtoken() != t
)
9823 raise_error_unexpected_syntax(t
);
9826 /* Now check for redirection which may follow command */
9827 checkkwd
= CHKKWD
| CHKALIAS
;
9829 while (readtoken() == TREDIR
) {
9830 *rpp
= n2
= redirnode
;
9831 rpp
= &n2
->nfile
.next
;
9837 if (n1
->type
!= NSUBSHELL
) {
9838 n2
= stalloc(sizeof(struct nredir
));
9843 n1
->nredir
.redirect
= redir
;
9849 * If eofmark is NULL, read a word or a redirection symbol. If eofmark
9850 * is not NULL, read a here document. In the latter case, eofmark is the
9851 * word which marks the end of the document and striptabs is true if
9852 * leading tabs should be stripped from the document. The argument firstc
9853 * is the first character of the input token or document.
9855 * Because C does not have internal subroutines, I have simulated them
9856 * using goto's to implement the subroutine linkage. The following macros
9857 * will run code that appears at the end of readtoken1.
9860 #define CHECKEND() {goto checkend; checkend_return:;}
9861 #define PARSEREDIR() {goto parseredir; parseredir_return:;}
9862 #define PARSESUB() {goto parsesub; parsesub_return:;}
9863 #define PARSEBACKQOLD() {oldstyle = 1; goto parsebackq; parsebackq_oldreturn:;}
9864 #define PARSEBACKQNEW() {oldstyle = 0; goto parsebackq; parsebackq_newreturn:;}
9865 #define PARSEARITH() {goto parsearith; parsearith_return:;}
9868 readtoken1(int firstc
, int syntax
, char *eofmark
, int striptabs
)
9870 /* NB: syntax parameter fits into smallint */
9874 char line
[EOFMARKLEN
+ 1];
9875 struct nodelist
*bqlist
;
9879 smallint prevsyntax
; /* syntax before arithmetic */
9880 #if ENABLE_ASH_EXPAND_PRMT
9881 smallint pssyntax
; /* we are expanding a prompt string */
9883 int varnest
; /* levels of variables expansion */
9884 int arinest
; /* levels of arithmetic expansion */
9885 int parenlevel
; /* levels of parens in arithmetic */
9886 int dqvarnest
; /* levels of variables expansion within double quotes */
9889 /* Avoid longjmp clobbering */
9901 startlinno
= plinno
;
9906 #if ENABLE_ASH_EXPAND_PRMT
9907 pssyntax
= (syntax
== PSSYNTAX
);
9911 dblquote
= (syntax
== DQSYNTAX
);
9918 loop
: { /* for each line, until end of word */
9919 CHECKEND(); /* set c to PEOF if at end of here document */
9920 for (;;) { /* until end of line or end of word */
9921 CHECKSTRSPACE(4, out
); /* permit 4 calls to USTPUTC */
9922 switch (SIT(c
, syntax
)) {
9923 case CNL
: /* '\n' */
9924 if (syntax
== BASESYNTAX
)
9925 goto endword
; /* exit outer loop */
9931 goto loop
; /* continue outer loop */
9936 if (eofmark
== NULL
|| dblquote
)
9937 USTPUTC(CTLESC
, out
);
9940 case CBACK
: /* backslash */
9943 USTPUTC(CTLESC
, out
);
9946 } else if (c
== '\n') {
9950 #if ENABLE_ASH_EXPAND_PRMT
9951 if (c
== '$' && pssyntax
) {
9952 USTPUTC(CTLESC
, out
);
9957 c
!= '\\' && c
!= '`' &&
9962 USTPUTC(CTLESC
, out
);
9965 if (SIT(c
, SQSYNTAX
) == CCTL
)
9966 USTPUTC(CTLESC
, out
);
9974 if (eofmark
== NULL
) {
9975 USTPUTC(CTLQUOTEMARK
, out
);
9983 if (eofmark
!= NULL
&& arinest
== 0
9988 if (dqvarnest
== 0) {
9989 syntax
= BASESYNTAX
;
9996 case CVAR
: /* '$' */
9997 PARSESUB(); /* parse substitution */
9999 case CENDVAR
: /* '}' */
10002 if (dqvarnest
> 0) {
10005 USTPUTC(CTLENDVAR
, out
);
10010 #if ENABLE_ASH_MATH_SUPPORT
10011 case CLP
: /* '(' in arithmetic */
10015 case CRP
: /* ')' in arithmetic */
10016 if (parenlevel
> 0) {
10020 if (pgetc() == ')') {
10021 if (--arinest
== 0) {
10022 USTPUTC(CTLENDARI
, out
);
10023 syntax
= prevsyntax
;
10024 dblquote
= (syntax
== DQSYNTAX
);
10029 * unbalanced parens
10030 * (don't 2nd guess - no error)
10038 case CBQUOTE
: /* '`' */
10042 goto endword
; /* exit outer loop */
10047 goto endword
; /* exit outer loop */
10048 #if ENABLE_ASH_ALIAS
10058 #if ENABLE_ASH_MATH_SUPPORT
10059 if (syntax
== ARISYNTAX
)
10060 raise_error_syntax("Missing '))'");
10062 if (syntax
!= BASESYNTAX
&& !parsebackquote
&& eofmark
== NULL
)
10063 raise_error_syntax("Unterminated quoted string");
10064 if (varnest
!= 0) {
10065 startlinno
= plinno
;
10067 raise_error_syntax("Missing '}'");
10069 USTPUTC('\0', out
);
10070 len
= out
- (char *)stackblock();
10071 out
= stackblock();
10072 if (eofmark
== NULL
) {
10073 if ((c
== '>' || c
== '<')
10076 && (*out
== '\0' || isdigit(*out
))) {
10078 return lasttoken
= TREDIR
;
10083 quoteflag
= quotef
;
10084 backquotelist
= bqlist
;
10085 grabstackblock(len
);
10089 /* end of readtoken routine */
10092 * Check to see whether we are at the end of the here document. When this
10093 * is called, c is set to the first character of the next input line. If
10094 * we are at the end of the here document, this routine sets the c to PEOF.
10098 #if ENABLE_ASH_ALIAS
10104 while (c
== '\t') {
10108 if (c
== *eofmark
) {
10109 if (pfgets(line
, sizeof(line
)) != NULL
) {
10113 for (q
= eofmark
+ 1; *q
&& *p
== *q
; p
++, q
++);
10114 if (*p
== '\n' && *q
== '\0') {
10117 needprompt
= doprompt
;
10119 pushstring(line
, NULL
);
10124 goto checkend_return
;
10128 * Parse a redirection operator. The variable "out" points to a string
10129 * specifying the fd to be redirected. The variable "c" contains the
10130 * first character of the redirection operator.
10136 np
= stalloc(sizeof(struct nfile
));
10141 np
->type
= NAPPEND
;
10143 np
->type
= NCLOBBER
;
10150 } else { /* c == '<' */
10155 if (sizeof(struct nfile
) != sizeof(struct nhere
)) {
10156 np
= stalloc(sizeof(struct nhere
));
10160 heredoc
= stalloc(sizeof(struct heredoc
));
10161 heredoc
->here
= np
;
10164 heredoc
->striptabs
= 1;
10166 heredoc
->striptabs
= 0;
10172 np
->type
= NFROMFD
;
10176 np
->type
= NFROMTO
;
10186 np
->nfile
.fd
= fd
- '0';
10188 goto parseredir_return
;
10192 * Parse a substitution. At this point, we have read the dollar sign
10193 * and nothing else.
10196 /* is_special(c) evaluates to 1 for c in "!#$*-0123456789?@"; 0 otherwise
10197 * (assuming ascii char codes, as the original implementation did) */
10198 #define is_special(c) \
10199 ((((unsigned int)c) - 33 < 32) \
10200 && ((0xc1ff920dUL >> (((unsigned int)c) - 33)) & 1))
10206 static const char types
[] ALIGN1
= "}-+?=";
10210 c
<= PEOA_OR_PEOF
||
10211 (c
!= '(' && c
!= '{' && !is_name(c
) && !is_special(c
))
10215 } else if (c
== '(') { /* $(command) or $((arith)) */
10216 if (pgetc() == '(') {
10217 #if ENABLE_ASH_MATH_SUPPORT
10220 raise_error_syntax("We unsupport $((arith))");
10227 USTPUTC(CTLVAR
, out
);
10228 typeloc
= out
- (char *)stackblock();
10229 USTPUTC(VSNORMAL
, out
);
10230 subtype
= VSNORMAL
;
10238 subtype
= VSLENGTH
;
10242 if (c
> PEOA_OR_PEOF
&& is_name(c
)) {
10246 } while (c
> PEOA_OR_PEOF
&& is_in_name(c
));
10247 } else if (isdigit(c
)) {
10251 } while (isdigit(c
));
10252 } else if (is_special(c
)) {
10256 badsub
: raise_error_syntax("Bad substitution");
10260 if (subtype
== 0) {
10267 p
= strchr(types
, c
);
10270 subtype
= p
- types
+ VSNORMAL
;
10276 subtype
= c
== '#' ? VSTRIMLEFT
:
10289 if (dblquote
|| arinest
)
10291 *((char *)stackblock() + typeloc
) = subtype
| flags
;
10292 if (subtype
!= VSNORMAL
) {
10294 if (dblquote
|| arinest
) {
10299 goto parsesub_return
;
10303 * Called to parse command substitutions. Newstyle is set if the command
10304 * is enclosed inside $(...); nlpp is a pointer to the head of the linked
10305 * list of commands (passed by reference), and savelen is the number of
10306 * characters on the top of the stack which must be preserved.
10309 struct nodelist
**nlpp
;
10312 char *volatile str
;
10313 struct jmploc jmploc
;
10314 struct jmploc
*volatile savehandler
;
10316 smallint saveprompt
= 0;
10319 (void) &saveprompt
;
10321 savepbq
= parsebackquote
;
10322 if (setjmp(jmploc
.loc
)) {
10324 parsebackquote
= 0;
10325 exception_handler
= savehandler
;
10326 longjmp(exception_handler
->loc
, 1);
10330 savelen
= out
- (char *)stackblock();
10332 str
= ckmalloc(savelen
);
10333 memcpy(str
, stackblock(), savelen
);
10335 savehandler
= exception_handler
;
10336 exception_handler
= &jmploc
;
10339 /* We must read until the closing backquote, giving special
10340 treatment to some slashes, and then push the string and
10341 reread it as input, interpreting it normally. */
10348 STARTSTACKSTR(pout
);
10365 * If eating a newline, avoid putting
10366 * the newline into the new character
10367 * stream (via the STPUTC after the
10372 if (pc
!= '\\' && pc
!= '`' && pc
!= '$'
10373 && (!dblquote
|| pc
!= '"'))
10374 STPUTC('\\', pout
);
10375 if (pc
> PEOA_OR_PEOF
) {
10381 #if ENABLE_ASH_ALIAS
10384 startlinno
= plinno
;
10385 raise_error_syntax("EOF in backquote substitution");
10389 needprompt
= doprompt
;
10398 STPUTC('\0', pout
);
10399 psavelen
= pout
- (char *)stackblock();
10400 if (psavelen
> 0) {
10401 pstr
= grabstackstr(pout
);
10402 setinputstring(pstr
);
10407 nlpp
= &(*nlpp
)->next
;
10408 *nlpp
= stalloc(sizeof(**nlpp
));
10409 (*nlpp
)->next
= NULL
;
10410 parsebackquote
= oldstyle
;
10413 saveprompt
= doprompt
;
10420 doprompt
= saveprompt
;
10421 else if (readtoken() != TRP
)
10422 raise_error_unexpected_syntax(TRP
);
10427 * Start reading from old file again, ignoring any pushed back
10428 * tokens left from the backquote parsing
10433 while (stackblocksize() <= savelen
)
10435 STARTSTACKSTR(out
);
10437 memcpy(out
, str
, savelen
);
10438 STADJUST(savelen
, out
);
10444 parsebackquote
= savepbq
;
10445 exception_handler
= savehandler
;
10446 if (arinest
|| dblquote
)
10447 USTPUTC(CTLBACKQ
| CTLQUOTE
, out
);
10449 USTPUTC(CTLBACKQ
, out
);
10451 goto parsebackq_oldreturn
;
10452 goto parsebackq_newreturn
;
10455 #if ENABLE_ASH_MATH_SUPPORT
10457 * Parse an arithmetic expansion (indicate start of one and set state)
10460 if (++arinest
== 1) {
10461 prevsyntax
= syntax
;
10462 syntax
= ARISYNTAX
;
10463 USTPUTC(CTLARI
, out
);
10470 * we collapse embedded arithmetic expansion to
10471 * parenthesis, which should be equivalent
10475 goto parsearith_return
;
10479 } /* end of readtoken */
10482 * Read the next input token.
10483 * If the token is a word, we set backquotelist to the list of cmds in
10484 * backquotes. We set quoteflag to true if any part of the word was
10486 * If the token is TREDIR, then we set redirnode to a structure containing
10488 * In all cases, the variable startlinno is set to the number of the line
10489 * on which the token starts.
10491 * [Change comment: here documents and internal procedures]
10492 * [Readtoken shouldn't have any arguments. Perhaps we should make the
10493 * word parsing code into a separate routine. In this case, readtoken
10494 * doesn't need to have any internal procedures, but parseword does.
10495 * We could also make parseoperator in essence the main routine, and
10496 * have parseword (readtoken1?) handle both words and redirection.]
10498 #define NEW_xxreadtoken
10499 #ifdef NEW_xxreadtoken
10500 /* singles must be first! */
10501 static const char xxreadtoken_chars
[7] ALIGN1
= {
10502 '\n', '(', ')', '&', '|', ';', 0
10505 static const char xxreadtoken_tokens
[] ALIGN1
= {
10506 TNL
, TLP
, TRP
, /* only single occurrence allowed */
10507 TBACKGND
, TPIPE
, TSEMI
, /* if single occurrence */
10508 TEOF
, /* corresponds to trailing nul */
10509 TAND
, TOR
, TENDCASE
/* if double occurrence */
10512 #define xxreadtoken_doubles \
10513 (sizeof(xxreadtoken_tokens) - sizeof(xxreadtoken_chars))
10514 #define xxreadtoken_singles \
10515 (sizeof(xxreadtoken_chars) - xxreadtoken_doubles - 1)
10529 startlinno
= plinno
;
10530 for (;;) { /* until token or start of word found */
10533 if ((c
!= ' ') && (c
!= '\t')
10534 #if ENABLE_ASH_ALIAS
10539 while ((c
= pgetc()) != '\n' && c
!= PEOF
);
10541 } else if (c
== '\\') {
10542 if (pgetc() != '\n') {
10546 startlinno
= ++plinno
;
10551 = xxreadtoken_chars
+ sizeof(xxreadtoken_chars
) - 1;
10556 needprompt
= doprompt
;
10559 p
= strchr(xxreadtoken_chars
, c
);
10562 return readtoken1(c
, BASESYNTAX
, (char *) NULL
, 0);
10565 if (p
- xxreadtoken_chars
>= xxreadtoken_singles
) {
10566 if (pgetc() == *p
) { /* double occurrence? */
10567 p
+= xxreadtoken_doubles
+ 1;
10573 return lasttoken
= xxreadtoken_tokens
[p
- xxreadtoken_chars
];
10579 #define RETURN(token) return lasttoken = token
10592 startlinno
= plinno
;
10593 for (;;) { /* until token or start of word found */
10596 case ' ': case '\t':
10597 #if ENABLE_ASH_ALIAS
10602 while ((c
= pgetc()) != '\n' && c
!= PEOF
);
10606 if (pgetc() == '\n') {
10607 startlinno
= ++plinno
;
10616 needprompt
= doprompt
;
10621 if (pgetc() == '&')
10626 if (pgetc() == '|')
10631 if (pgetc() == ';')
10644 return readtoken1(c
, BASESYNTAX
, (char *)NULL
, 0);
10647 #endif /* NEW_xxreadtoken */
10654 smallint alreadyseen
= tokpushback
;
10657 #if ENABLE_ASH_ALIAS
10666 if (checkkwd
& CHKNL
) {
10673 if (t
!= TWORD
|| quoteflag
) {
10678 * check for keywords
10680 if (checkkwd
& CHKKWD
) {
10681 const char *const *pp
;
10683 pp
= findkwd(wordtext
);
10685 lasttoken
= t
= pp
- tokname_array
;
10686 TRACE(("keyword %s recognized\n", tokname(t
)));
10691 if (checkkwd
& CHKALIAS
) {
10692 #if ENABLE_ASH_ALIAS
10694 ap
= lookupalias(wordtext
, 1);
10697 pushstring(ap
->val
, ap
);
10707 TRACE(("token %s %s\n", tokname(t
), t
== TWORD
? wordtext
: ""));
10709 TRACE(("reread token %s %s\n", tokname(t
), t
== TWORD
? wordtext
: ""));
10721 return tokname_array
[t
][0];
10725 * Read and parse a command. Returns NEOF on end of file. (NULL is a
10726 * valid parse tree indicating a blank line.)
10728 static union node
*
10729 parsecmd(int interact
)
10734 doprompt
= interact
;
10736 setprompt(doprompt
);
10748 * Input any here documents.
10753 struct heredoc
*here
;
10756 here
= heredoclist
;
10763 readtoken1(pgetc(), here
->here
->type
== NHERE
? SQSYNTAX
: DQSYNTAX
,
10764 here
->eofmark
, here
->striptabs
);
10765 n
= stalloc(sizeof(struct narg
));
10766 n
->narg
.type
= NARG
;
10767 n
->narg
.next
= NULL
;
10768 n
->narg
.text
= wordtext
;
10769 n
->narg
.backquote
= backquotelist
;
10770 here
->here
->nhere
.doc
= n
;
10777 * called by editline -- any expansions to the prompt should be added here.
10779 #if ENABLE_ASH_EXPAND_PRMT
10780 static const char *
10781 expandstr(const char *ps
)
10785 /* XXX Fix (char *) cast. */
10786 setinputstring((char *)ps
);
10787 readtoken1(pgetc(), PSSYNTAX
, nullstr
, 0);
10790 n
.narg
.type
= NARG
;
10791 n
.narg
.next
= NULL
;
10792 n
.narg
.text
= wordtext
;
10793 n
.narg
.backquote
= backquotelist
;
10795 expandarg(&n
, NULL
, 0);
10796 return stackblock();
10801 * Execute a command or commands contained in a string.
10804 evalstring(char *s
, int mask
)
10807 struct stackmark smark
;
10811 setstackmark(&smark
);
10814 while ((n
= parsecmd(0)) != NEOF
) {
10816 popstackmark(&smark
);
10829 * The eval command.
10832 evalcmd(int argc
, char **argv
)
10841 STARTSTACKSTR(concat
);
10844 concat
= stack_putstr(p
, concat
);
10848 STPUTC(' ', concat
);
10850 STPUTC('\0', concat
);
10851 p
= grabstackstr(concat
);
10853 evalstring(p
, ~SKIPEVAL
);
10860 * Read and execute commands. "Top" is nonzero for the top level command
10861 * loop; it turns on prompting if the shell is interactive.
10867 struct stackmark smark
;
10871 TRACE(("cmdloop(%d) called\n", top
));
10875 setstackmark(&smark
);
10878 showjobs(stderr
, SHOW_CHANGED
);
10881 if (iflag
&& top
) {
10883 #if ENABLE_ASH_MAIL
10887 n
= parsecmd(inter
);
10888 /* showtree(n); DEBUG */
10890 if (!top
|| numeof
>= 50)
10892 if (!stoppedjobs()) {
10895 out2str("\nUse \"exit\" to leave shell.\n");
10898 } else if (nflag
== 0) {
10899 /* job_warning can only be 2,1,0. Here 2->1, 1/0->0 */
10904 popstackmark(&smark
);
10909 return skip
& SKIPEVAL
;
10916 * Take commands from a file. To be compatible we should do a path
10917 * search for the file, which is necessary to find sub-commands.
10920 find_dot_file(char *name
)
10923 const char *path
= pathval();
10926 /* don't try this for absolute or relative paths */
10927 if (strchr(name
, '/'))
10930 while ((fullname
= padvance(&path
, name
)) != NULL
) {
10931 if ((stat(fullname
, &statb
) == 0) && S_ISREG(statb
.st_mode
)) {
10933 * Don't bother freeing here, since it will
10934 * be freed by the caller.
10938 stunalloc(fullname
);
10941 /* not found in the PATH */
10942 ash_msg_and_raise_error("%s: not found", name
);
10947 dotcmd(int argc
, char **argv
)
10949 struct strlist
*sp
;
10950 volatile struct shparam saveparam
;
10953 for (sp
= cmdenviron
; sp
; sp
= sp
->next
)
10954 setvareq(ckstrdup(sp
->text
), VSTRFIXED
| VTEXTFIXED
);
10956 if (argc
>= 2) { /* That's what SVR2 does */
10959 fullname
= find_dot_file(argv
[1]);
10962 saveparam
= shellparam
;
10963 shellparam
.malloc
= 0;
10964 shellparam
.nparam
= argc
- 2;
10965 shellparam
.p
= argv
+ 2;
10968 setinputfile(fullname
, INPUT_PUSH_FILE
);
10969 commandname
= fullname
;
10974 freeparam(&shellparam
);
10975 shellparam
= saveparam
;
10977 status
= exitstatus
;
10983 exitcmd(int argc
, char **argv
)
10988 exitstatus
= number(argv
[1]);
10989 raise_exception(EXEXIT
);
10993 #if ENABLE_ASH_BUILTIN_ECHO
10995 echocmd(int argc
, char **argv
)
10997 return bb_echo(argv
);
11001 #if ENABLE_ASH_BUILTIN_TEST
11003 testcmd(int argc
, char **argv
)
11005 return test_main(argc
, argv
);
11010 * Read a file containing shell functions.
11013 readcmdfile(char *name
)
11015 setinputfile(name
, INPUT_PUSH_FILE
);
11021 /* ============ find_command inplementation */
11024 * Resolve a command name. If you change this routine, you may have to
11025 * change the shellexec routine as well.
11028 find_command(char *name
, struct cmdentry
*entry
, int act
, const char *path
)
11030 struct tblentry
*cmdp
;
11037 struct builtincmd
*bcmd
;
11039 /* If name contains a slash, don't use PATH or hash table */
11040 if (strchr(name
, '/') != NULL
) {
11041 entry
->u
.index
= -1;
11042 if (act
& DO_ABS
) {
11043 while (stat(name
, &statb
) < 0) {
11045 if (errno
== EINTR
)
11048 entry
->cmdtype
= CMDUNKNOWN
;
11052 entry
->cmdtype
= CMDNORMAL
;
11056 /* #if ENABLE_FEATURE_SH_STANDALONE... moved after builtin check */
11058 updatetbl
= (path
== pathval());
11061 if (strstr(path
, "%builtin") != NULL
)
11062 act
|= DO_ALTBLTIN
;
11065 /* If name is in the table, check answer will be ok */
11066 cmdp
= cmdlookup(name
, 0);
11067 if (cmdp
!= NULL
) {
11070 switch (cmdp
->cmdtype
) {
11088 } else if (cmdp
->rehash
== 0)
11089 /* if not invalidated by cd, we're done */
11093 /* If %builtin not in path, check for builtin next */
11094 bcmd
= find_builtin(name
);
11096 if (IS_BUILTIN_REGULAR(bcmd
))
11097 goto builtin_success
;
11098 if (act
& DO_ALTPATH
) {
11099 if (!(act
& DO_ALTBLTIN
))
11100 goto builtin_success
;
11101 } else if (builtinloc
<= 0) {
11102 goto builtin_success
;
11106 #if ENABLE_FEATURE_SH_STANDALONE
11107 if (find_applet_by_name(name
)) {
11108 entry
->cmdtype
= CMDNORMAL
;
11109 entry
->u
.index
= -1;
11114 /* We have to search path. */
11115 prev
= -1; /* where to start */
11116 if (cmdp
&& cmdp
->rehash
) { /* doing a rehash */
11117 if (cmdp
->cmdtype
== CMDBUILTIN
)
11120 prev
= cmdp
->param
.index
;
11126 while ((fullname
= padvance(&path
, name
)) != NULL
) {
11127 stunalloc(fullname
);
11128 /* NB: code below will still use fullname
11129 * despite it being "unallocated" */
11132 if (prefix(pathopt
, "builtin")) {
11134 goto builtin_success
;
11136 } else if (!(act
& DO_NOFUNC
)
11137 && prefix(pathopt
, "func")) {
11138 /* handled below */
11140 /* ignore unimplemented options */
11144 /* if rehash, don't redo absolute path names */
11145 if (fullname
[0] == '/' && idx
<= prev
) {
11148 TRACE(("searchexec \"%s\": no change\n", name
));
11151 while (stat(fullname
, &statb
) < 0) {
11153 if (errno
== EINTR
)
11156 if (errno
!= ENOENT
&& errno
!= ENOTDIR
)
11160 e
= EACCES
; /* if we fail, this will be the error */
11161 if (!S_ISREG(statb
.st_mode
))
11163 if (pathopt
) { /* this is a %func directory */
11164 stalloc(strlen(fullname
) + 1);
11165 /* NB: stalloc will return space pointed by fullname
11166 * (because we don't have any intervening allocations
11167 * between stunalloc above and this stalloc) */
11168 readcmdfile(fullname
);
11169 cmdp
= cmdlookup(name
, 0);
11170 if (cmdp
== NULL
|| cmdp
->cmdtype
!= CMDFUNCTION
)
11171 ash_msg_and_raise_error("%s not defined in %s", name
, fullname
);
11172 stunalloc(fullname
);
11175 TRACE(("searchexec \"%s\" returns \"%s\"\n", name
, fullname
));
11177 entry
->cmdtype
= CMDNORMAL
;
11178 entry
->u
.index
= idx
;
11182 cmdp
= cmdlookup(name
, 1);
11183 cmdp
->cmdtype
= CMDNORMAL
;
11184 cmdp
->param
.index
= idx
;
11189 /* We failed. If there was an entry for this command, delete it */
11190 if (cmdp
&& updatetbl
)
11191 delete_cmd_entry();
11193 ash_msg("%s: %s", name
, errmsg(e
, "not found"));
11194 entry
->cmdtype
= CMDUNKNOWN
;
11199 entry
->cmdtype
= CMDBUILTIN
;
11200 entry
->u
.cmd
= bcmd
;
11204 cmdp
= cmdlookup(name
, 1);
11205 cmdp
->cmdtype
= CMDBUILTIN
;
11206 cmdp
->param
.cmd
= bcmd
;
11210 entry
->cmdtype
= cmdp
->cmdtype
;
11211 entry
->u
= cmdp
->param
;
11215 /* ============ trap.c */
11218 * The trap builtin.
11221 trapcmd(int argc
, char **argv
)
11230 for (signo
= 0; signo
< NSIG
; signo
++) {
11231 if (trap
[signo
] != NULL
) {
11234 sn
= get_signame(signo
);
11235 out1fmt("trap -- %s %s\n",
11236 single_quote(trap
[signo
]), sn
);
11246 signo
= get_signum(*ap
);
11248 ash_msg_and_raise_error("%s: bad trap", *ap
);
11251 if (LONE_DASH(action
))
11254 action
= ckstrdup(action
);
11257 trap
[signo
] = action
;
11267 /* ============ Builtins */
11269 #if !ENABLE_FEATURE_SH_EXTRA_QUIET
11271 * Lists available builtins
11274 helpcmd(int argc
, char **argv
)
11278 out1fmt("\nBuilt-in commands:\n-------------------\n");
11279 for (col
= 0, i
= 0; i
< ARRAY_SIZE(builtintab
); i
++) {
11280 col
+= out1fmt("%c%s", ((col
== 0) ? '\t' : ' '),
11281 builtintab
[i
].name
+ 1);
11287 #if ENABLE_FEATURE_SH_STANDALONE
11288 for (i
= 0; i
< NUM_APPLETS
; i
++) {
11289 col
+= out1fmt("%c%s", ((col
== 0) ? '\t' : ' '), applets
[i
].name
);
11297 return EXIT_SUCCESS
;
11299 #endif /* FEATURE_SH_EXTRA_QUIET */
11302 * The export and readonly commands.
11305 exportcmd(int argc
, char **argv
)
11311 int flag
= argv
[0][0] == 'r'? VREADONLY
: VEXPORT
;
11313 if (nextopt("p") != 'p') {
11318 p
= strchr(name
, '=');
11322 vp
= *findvar(hashvar(name
), name
);
11328 setvar(name
, p
, flag
);
11329 } while ((name
= *++aptr
) != NULL
);
11333 showvars(argv
[0], flag
, 0);
11338 * Delete a function if it exists.
11341 unsetfunc(const char *name
)
11343 struct tblentry
*cmdp
;
11345 cmdp
= cmdlookup(name
, 0);
11346 if (cmdp
!= NULL
&& cmdp
->cmdtype
== CMDFUNCTION
)
11347 delete_cmd_entry();
11351 * The unset builtin command. We unset the function before we unset the
11352 * variable to allow a function to be unset when there is a readonly variable
11353 * with the same name.
11356 unsetcmd(int argc
, char **argv
)
11363 while ((i
= nextopt("vf")) != '\0') {
11367 for (ap
= argptr
; *ap
; ap
++) {
11383 #include <sys/times.h>
11385 static const unsigned char timescmd_str
[] ALIGN1
= {
11386 ' ', offsetof(struct tms
, tms_utime
),
11387 '\n', offsetof(struct tms
, tms_stime
),
11388 ' ', offsetof(struct tms
, tms_cutime
),
11389 '\n', offsetof(struct tms
, tms_cstime
),
11394 timescmd(int ac
, char **av
)
11396 long clk_tck
, s
, t
;
11397 const unsigned char *p
;
11400 clk_tck
= sysconf(_SC_CLK_TCK
);
11405 t
= *(clock_t *)(((char *) &buf
) + p
[1]);
11407 out1fmt("%ldm%ld.%.3lds%c",
11409 ((t
- s
* clk_tck
) * 1000) / clk_tck
,
11411 } while (*(p
+= 2));
11416 #if ENABLE_ASH_MATH_SUPPORT
11418 dash_arith(const char *s
)
11424 result
= arith(s
, &errcode
);
11427 ash_msg_and_raise_error("exponent less than 0");
11429 ash_msg_and_raise_error("divide by zero");
11431 ash_msg_and_raise_error("expression recursion loop detected");
11432 raise_error_syntax(s
);
11440 * The let builtin. partial stolen from GNU Bash, the Bourne Again SHell.
11441 * Copyright (C) 1987, 1989, 1991 Free Software Foundation, Inc.
11443 * Copyright (C) 2003 Vladimir Oleynik <dzo@simtreas.ru>
11446 letcmd(int argc
, char **argv
)
11453 ash_msg_and_raise_error("expression expected");
11454 for (ap
= argv
+ 1; *ap
; ap
++) {
11455 i
= dash_arith(*ap
);
11460 #endif /* ASH_MATH_SUPPORT */
11463 /* ============ miscbltin.c
11465 * Miscellaneous builtins.
11470 #if defined(__GLIBC__) && __GLIBC__ == 2 && __GLIBC_MINOR__ < 1
11471 typedef enum __rlimit_resource rlim_t
;
11475 * The read builtin. The -e option causes backslashes to escape the
11476 * following character.
11478 * This uses unbuffered input, which may be avoidable in some cases.
11481 readcmd(int argc
, char **argv
)
11493 #if ENABLE_ASH_READ_NCHARS
11497 struct termios tty
, old_tty
;
11499 #if ENABLE_ASH_READ_TIMEOUT
11503 ts
.tv_sec
= ts
.tv_usec
= 0;
11508 #if ENABLE_ASH_READ_NCHARS && ENABLE_ASH_READ_TIMEOUT
11509 while ((i
= nextopt("p:rt:n:s")) != '\0')
11510 #elif ENABLE_ASH_READ_NCHARS
11511 while ((i
= nextopt("p:rn:s")) != '\0')
11512 #elif ENABLE_ASH_READ_TIMEOUT
11513 while ((i
= nextopt("p:rt:")) != '\0')
11515 while ((i
= nextopt("p:r")) != '\0')
11520 prompt
= optionarg
;
11522 #if ENABLE_ASH_READ_NCHARS
11524 nchars
= bb_strtou(optionarg
, NULL
, 10);
11525 if (nchars
< 0 || errno
)
11526 ash_msg_and_raise_error("invalid count");
11527 n_flag
= nchars
; /* just a flag "nchars is nonzero" */
11533 #if ENABLE_ASH_READ_TIMEOUT
11535 ts
.tv_sec
= bb_strtou(optionarg
, &p
, 10);
11537 /* EINVAL means number is ok, but not terminated by NUL */
11538 if (*p
== '.' && errno
== EINVAL
) {
11542 ts
.tv_usec
= bb_strtou(p
, &p2
, 10);
11544 ash_msg_and_raise_error("invalid timeout");
11546 /* normalize to usec */
11548 ash_msg_and_raise_error("invalid timeout");
11549 while (scale
++ < 6)
11552 } else if (ts
.tv_sec
< 0 || errno
) {
11553 ash_msg_and_raise_error("invalid timeout");
11555 if (!(ts
.tv_sec
| ts
.tv_usec
)) { /* both are 0? */
11556 ash_msg_and_raise_error("invalid timeout");
11567 if (prompt
&& isatty(0)) {
11572 ash_msg_and_raise_error("arg count");
11573 ifs
= bltinlookup("IFS");
11576 #if ENABLE_ASH_READ_NCHARS
11577 if (n_flag
|| silent
) {
11578 tcgetattr(0, &tty
);
11581 tty
.c_lflag
&= ~ICANON
;
11582 tty
.c_cc
[VMIN
] = nchars
;
11585 tty
.c_lflag
&= ~(ECHO
|ECHOK
|ECHONL
);
11587 tcsetattr(0, TCSANOW
, &tty
);
11590 #if ENABLE_ASH_READ_TIMEOUT
11591 if (ts
.tv_sec
|| ts
.tv_usec
) {
11592 // TODO: replace with poll, it is smaller
11596 i
= select(FD_SETSIZE
, &set
, NULL
, NULL
, &ts
);
11598 #if ENABLE_ASH_READ_NCHARS
11600 tcsetattr(0, TCSANOW
, &old_tty
);
11611 if (read(0, &c
, 1) != 1) {
11623 if (!rflag
&& c
== '\\') {
11629 if (startword
&& *ifs
== ' ' && strchr(ifs
, c
)) {
11633 if (ap
[1] != NULL
&& strchr(ifs
, c
) != NULL
) {
11635 setvar(*ap
, stackblock(), 0);
11644 /* end of do {} while: */
11645 #if ENABLE_ASH_READ_NCHARS
11646 while (!n_flag
|| --nchars
);
11651 #if ENABLE_ASH_READ_NCHARS
11652 if (n_flag
|| silent
)
11653 tcsetattr(0, TCSANOW
, &old_tty
);
11657 /* Remove trailing blanks */
11658 while ((char *)stackblock() <= --p
&& strchr(ifs
, *p
) != NULL
)
11660 setvar(*ap
, stackblock(), 0);
11661 while (*++ap
!= NULL
)
11662 setvar(*ap
, nullstr
, 0);
11667 umaskcmd(int argc
, char **argv
)
11669 static const char permuser
[3] ALIGN1
= "ugo";
11670 static const char permmode
[3] ALIGN1
= "rwx";
11671 static const short permmask
[] ALIGN2
= {
11672 S_IRUSR
, S_IWUSR
, S_IXUSR
,
11673 S_IRGRP
, S_IWGRP
, S_IXGRP
,
11674 S_IROTH
, S_IWOTH
, S_IXOTH
11680 int symbolic_mode
= 0;
11682 while (nextopt("S") != '\0') {
11693 if (symbolic_mode
) {
11697 for (i
= 0; i
< 3; i
++) {
11700 *p
++ = permuser
[i
];
11702 for (j
= 0; j
< 3; j
++) {
11703 if ((mask
& permmask
[3 * i
+ j
]) == 0) {
11704 *p
++ = permmode
[j
];
11712 out1fmt("%.4o\n", mask
);
11715 if (isdigit((unsigned char) *ap
)) {
11718 if (*ap
>= '8' || *ap
< '0')
11719 ash_msg_and_raise_error(illnum
, argv
[1]);
11720 mask
= (mask
<< 3) + (*ap
- '0');
11721 } while (*++ap
!= '\0');
11724 mask
= ~mask
& 0777;
11725 if (!bb_parse_mode(ap
, &mask
)) {
11726 ash_msg_and_raise_error("illegal mode: %s", ap
);
11728 umask(~mask
& 0777);
11737 * This code, originally by Doug Gwyn, Doug Kingston, Eric Gisin, and
11738 * Michael Rendell was ripped from pdksh 5.0.8 and hacked for use with
11739 * ash by J.T. Conklin.
11747 int factor
; /* multiply by to get rlim_{cur,max} values */
11751 static const struct limits limits
[] = {
11753 { "time(seconds)", RLIMIT_CPU
, 1, 't' },
11755 #ifdef RLIMIT_FSIZE
11756 { "file(blocks)", RLIMIT_FSIZE
, 512, 'f' },
11759 { "data(kbytes)", RLIMIT_DATA
, 1024, 'd' },
11761 #ifdef RLIMIT_STACK
11762 { "stack(kbytes)", RLIMIT_STACK
, 1024, 's' },
11765 { "coredump(blocks)", RLIMIT_CORE
, 512, 'c' },
11768 { "memory(kbytes)", RLIMIT_RSS
, 1024, 'm' },
11770 #ifdef RLIMIT_MEMLOCK
11771 { "locked memory(kbytes)", RLIMIT_MEMLOCK
, 1024, 'l' },
11773 #ifdef RLIMIT_NPROC
11774 { "process", RLIMIT_NPROC
, 1, 'p' },
11776 #ifdef RLIMIT_NOFILE
11777 { "nofiles", RLIMIT_NOFILE
, 1, 'n' },
11780 { "vmemory(kbytes)", RLIMIT_AS
, 1024, 'v' },
11782 #ifdef RLIMIT_LOCKS
11783 { "locks", RLIMIT_LOCKS
, 1, 'w' },
11785 { NULL
, 0, 0, '\0' }
11788 enum limtype
{ SOFT
= 0x1, HARD
= 0x2 };
11791 printlim(enum limtype how
, const struct rlimit
*limit
,
11792 const struct limits
*l
)
11796 val
= limit
->rlim_max
;
11798 val
= limit
->rlim_cur
;
11800 if (val
== RLIM_INFINITY
)
11801 out1fmt("unlimited\n");
11804 out1fmt("%lld\n", (long long) val
);
11809 ulimitcmd(int argc
, char **argv
)
11813 enum limtype how
= SOFT
| HARD
;
11814 const struct limits
*l
;
11817 struct rlimit limit
;
11820 while ((optc
= nextopt("HSa"
11824 #ifdef RLIMIT_FSIZE
11830 #ifdef RLIMIT_STACK
11839 #ifdef RLIMIT_MEMLOCK
11842 #ifdef RLIMIT_NPROC
11845 #ifdef RLIMIT_NOFILE
11851 #ifdef RLIMIT_LOCKS
11869 for (l
= limits
; l
->option
!= what
; l
++)
11872 set
= *argptr
? 1 : 0;
11876 if (all
|| argptr
[1])
11877 ash_msg_and_raise_error("too many arguments");
11878 if (strncmp(p
, "unlimited\n", 9) == 0)
11879 val
= RLIM_INFINITY
;
11883 while ((c
= *p
++) >= '0' && c
<= '9') {
11884 val
= (val
* 10) + (long)(c
- '0');
11885 if (val
< (rlim_t
) 0)
11889 ash_msg_and_raise_error("bad number");
11894 for (l
= limits
; l
->name
; l
++) {
11895 getrlimit(l
->cmd
, &limit
);
11896 out1fmt("%-20s ", l
->name
);
11897 printlim(how
, &limit
, l
);
11902 getrlimit(l
->cmd
, &limit
);
11905 limit
.rlim_max
= val
;
11907 limit
.rlim_cur
= val
;
11908 if (setrlimit(l
->cmd
, &limit
) < 0)
11909 ash_msg_and_raise_error("error setting limit (%m)");
11911 printlim(how
, &limit
, l
);
11917 /* ============ Math support */
11919 #if ENABLE_ASH_MATH_SUPPORT
11921 /* Copyright (c) 2001 Aaron Lehmann <aaronl@vitelus.com>
11923 Permission is hereby granted, free of charge, to any person obtaining
11924 a copy of this software and associated documentation files (the
11925 "Software"), to deal in the Software without restriction, including
11926 without limitation the rights to use, copy, modify, merge, publish,
11927 distribute, sublicense, and/or sell copies of the Software, and to
11928 permit persons to whom the Software is furnished to do so, subject to
11929 the following conditions:
11931 The above copyright notice and this permission notice shall be
11932 included in all copies or substantial portions of the Software.
11934 THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
11935 EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
11936 MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
11937 IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
11938 CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
11939 TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
11940 SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
11943 /* This is my infix parser/evaluator. It is optimized for size, intended
11944 * as a replacement for yacc-based parsers. However, it may well be faster
11945 * than a comparable parser written in yacc. The supported operators are
11946 * listed in #defines below. Parens, order of operations, and error handling
11947 * are supported. This code is thread safe. The exact expression format should
11948 * be that which POSIX specifies for shells. */
11950 /* The code uses a simple two-stack algorithm. See
11951 * http://www.onthenet.com.au/~grahamis/int2008/week02/lect02.html
11952 * for a detailed explanation of the infix-to-postfix algorithm on which
11953 * this is based (this code differs in that it applies operators immediately
11954 * to the stack instead of adding them to a queue to end up with an
11957 /* To use the routine, call it with an expression string and error return
11961 * Aug 24, 2001 Manuel Novoa III
11963 * Reduced the generated code size by about 30% (i386) and fixed several bugs.
11965 * 1) In arith_apply():
11966 * a) Cached values of *numptr and &(numptr[-1]).
11967 * b) Removed redundant test for zero denominator.
11970 * a) Eliminated redundant code for processing operator tokens by moving
11971 * to a table-based implementation. Also folded handling of parens
11973 * b) Combined all 3 loops which called arith_apply to reduce generated
11974 * code size at the cost of speed.
11976 * 3) The following expressions were treated as valid by the original code:
11977 * 1() , 0! , 1 ( *3 ) .
11978 * These bugs have been fixed by internally enclosing the expression in
11979 * parens and then checking that all binary ops and right parens are
11980 * preceded by a valid expression (NUM_TOKEN).
11982 * Note: It may be desirable to replace Aaron's test for whitespace with
11983 * ctype's isspace() if it is used by another busybox applet or if additional
11984 * whitespace chars should be considered. Look below the "#include"s for a
11985 * precompiler test.
11989 * Aug 26, 2001 Manuel Novoa III
11991 * Return 0 for null expressions. Pointed out by Vladimir Oleynik.
11993 * Merge in Aaron's comments previously posted to the busybox list,
11994 * modified slightly to take account of my changes to the code.
11999 * (C) 2003 Vladimir Oleynik <dzo@simtreas.ru>
12001 * - allow access to variable,
12002 * used recursive find value indirection (c=2*2; a="c"; $((a+=2)) produce 6)
12003 * - realize assign syntax (VAR=expr, +=, *= etc)
12004 * - realize exponentiation (** operator)
12005 * - realize comma separated - expr, expr
12006 * - realise ++expr --expr expr++ expr--
12007 * - realise expr ? expr : expr (but, second expr calculate always)
12008 * - allow hexadecimal and octal numbers
12009 * - was restored loses XOR operator
12010 * - remove one goto label, added three ;-)
12011 * - protect $((num num)) as true zero expr (Manuel`s error)
12012 * - always use special isspace(), see comment from bash ;-)
12015 #define arith_isspace(arithval) \
12016 (arithval == ' ' || arithval == '\n' || arithval == '\t')
12018 typedef unsigned char operator;
12020 /* An operator's token id is a bit of a bitfield. The lower 5 bits are the
12021 * precedence, and 3 high bits are an ID unique across operators of that
12022 * precedence. The ID portion is so that multiple operators can have the
12023 * same precedence, ensuring that the leftmost one is evaluated first.
12024 * Consider * and /. */
12026 #define tok_decl(prec,id) (((id)<<5)|(prec))
12027 #define PREC(op) ((op) & 0x1F)
12029 #define TOK_LPAREN tok_decl(0,0)
12031 #define TOK_COMMA tok_decl(1,0)
12033 #define TOK_ASSIGN tok_decl(2,0)
12034 #define TOK_AND_ASSIGN tok_decl(2,1)
12035 #define TOK_OR_ASSIGN tok_decl(2,2)
12036 #define TOK_XOR_ASSIGN tok_decl(2,3)
12037 #define TOK_PLUS_ASSIGN tok_decl(2,4)
12038 #define TOK_MINUS_ASSIGN tok_decl(2,5)
12039 #define TOK_LSHIFT_ASSIGN tok_decl(2,6)
12040 #define TOK_RSHIFT_ASSIGN tok_decl(2,7)
12042 #define TOK_MUL_ASSIGN tok_decl(3,0)
12043 #define TOK_DIV_ASSIGN tok_decl(3,1)
12044 #define TOK_REM_ASSIGN tok_decl(3,2)
12046 /* all assign is right associativity and precedence eq, but (7+3)<<5 > 256 */
12047 #define convert_prec_is_assing(prec) do { if (prec == 3) prec = 2; } while (0)
12049 /* conditional is right associativity too */
12050 #define TOK_CONDITIONAL tok_decl(4,0)
12051 #define TOK_CONDITIONAL_SEP tok_decl(4,1)
12053 #define TOK_OR tok_decl(5,0)
12055 #define TOK_AND tok_decl(6,0)
12057 #define TOK_BOR tok_decl(7,0)
12059 #define TOK_BXOR tok_decl(8,0)
12061 #define TOK_BAND tok_decl(9,0)
12063 #define TOK_EQ tok_decl(10,0)
12064 #define TOK_NE tok_decl(10,1)
12066 #define TOK_LT tok_decl(11,0)
12067 #define TOK_GT tok_decl(11,1)
12068 #define TOK_GE tok_decl(11,2)
12069 #define TOK_LE tok_decl(11,3)
12071 #define TOK_LSHIFT tok_decl(12,0)
12072 #define TOK_RSHIFT tok_decl(12,1)
12074 #define TOK_ADD tok_decl(13,0)
12075 #define TOK_SUB tok_decl(13,1)
12077 #define TOK_MUL tok_decl(14,0)
12078 #define TOK_DIV tok_decl(14,1)
12079 #define TOK_REM tok_decl(14,2)
12081 /* exponent is right associativity */
12082 #define TOK_EXPONENT tok_decl(15,1)
12084 /* For now unary operators. */
12085 #define UNARYPREC 16
12086 #define TOK_BNOT tok_decl(UNARYPREC,0)
12087 #define TOK_NOT tok_decl(UNARYPREC,1)
12089 #define TOK_UMINUS tok_decl(UNARYPREC+1,0)
12090 #define TOK_UPLUS tok_decl(UNARYPREC+1,1)
12092 #define PREC_PRE (UNARYPREC+2)
12094 #define TOK_PRE_INC tok_decl(PREC_PRE, 0)
12095 #define TOK_PRE_DEC tok_decl(PREC_PRE, 1)
12097 #define PREC_POST (UNARYPREC+3)
12099 #define TOK_POST_INC tok_decl(PREC_POST, 0)
12100 #define TOK_POST_DEC tok_decl(PREC_POST, 1)
12102 #define SPEC_PREC (UNARYPREC+4)
12104 #define TOK_NUM tok_decl(SPEC_PREC, 0)
12105 #define TOK_RPAREN tok_decl(SPEC_PREC, 1)
12107 #define NUMPTR (*numstackptr)
12110 tok_have_assign(operator op
)
12112 operator prec
= PREC(op
);
12114 convert_prec_is_assing(prec
);
12115 return (prec
== PREC(TOK_ASSIGN
) ||
12116 prec
== PREC_PRE
|| prec
== PREC_POST
);
12120 is_right_associativity(operator prec
)
12122 return (prec
== PREC(TOK_ASSIGN
) || prec
== PREC(TOK_EXPONENT
)
12123 || prec
== PREC(TOK_CONDITIONAL
));
12126 typedef struct ARITCH_VAR_NUM
{
12128 arith_t contidional_second_val
;
12129 char contidional_second_val_initialized
;
12130 char *var
; /* if NULL then is regular number,
12131 else is variable name */
12134 typedef struct CHK_VAR_RECURSIVE_LOOPED
{
12136 struct CHK_VAR_RECURSIVE_LOOPED
*next
;
12137 } chk_var_recursive_looped_t
;
12139 static chk_var_recursive_looped_t
*prev_chk_var_recursive
;
12142 arith_lookup_val(v_n_t
*t
)
12145 const char * p
= lookupvar(t
->var
);
12150 /* recursive try as expression */
12151 chk_var_recursive_looped_t
*cur
;
12152 chk_var_recursive_looped_t cur_save
;
12154 for (cur
= prev_chk_var_recursive
; cur
; cur
= cur
->next
) {
12155 if (strcmp(cur
->var
, t
->var
) == 0) {
12156 /* expression recursion loop detected */
12160 /* save current lookuped var name */
12161 cur
= prev_chk_var_recursive
;
12162 cur_save
.var
= t
->var
;
12163 cur_save
.next
= cur
;
12164 prev_chk_var_recursive
= &cur_save
;
12166 t
->val
= arith (p
, &errcode
);
12167 /* restore previous ptr after recursiving */
12168 prev_chk_var_recursive
= cur
;
12171 /* allow undefined var as 0 */
12177 /* "applying" a token means performing it on the top elements on the integer
12178 * stack. For a unary operator it will only change the top element, but a
12179 * binary operator will pop two arguments and push a result */
12181 arith_apply(operator op
, v_n_t
*numstack
, v_n_t
**numstackptr
)
12184 arith_t numptr_val
, rez
;
12185 int ret_arith_lookup_val
;
12187 /* There is no operator that can work without arguments */
12188 if (NUMPTR
== numstack
) goto err
;
12189 numptr_m1
= NUMPTR
- 1;
12191 /* check operand is var with noninteger value */
12192 ret_arith_lookup_val
= arith_lookup_val(numptr_m1
);
12193 if (ret_arith_lookup_val
)
12194 return ret_arith_lookup_val
;
12196 rez
= numptr_m1
->val
;
12197 if (op
== TOK_UMINUS
)
12199 else if (op
== TOK_NOT
)
12201 else if (op
== TOK_BNOT
)
12203 else if (op
== TOK_POST_INC
|| op
== TOK_PRE_INC
)
12205 else if (op
== TOK_POST_DEC
|| op
== TOK_PRE_DEC
)
12207 else if (op
!= TOK_UPLUS
) {
12208 /* Binary operators */
12210 /* check and binary operators need two arguments */
12211 if (numptr_m1
== numstack
) goto err
;
12213 /* ... and they pop one */
12216 if (op
== TOK_CONDITIONAL
) {
12217 if (! numptr_m1
->contidional_second_val_initialized
) {
12218 /* protect $((expr1 ? expr2)) without ": expr" */
12221 rez
= numptr_m1
->contidional_second_val
;
12222 } else if (numptr_m1
->contidional_second_val_initialized
) {
12223 /* protect $((expr1 : expr2)) without "expr ? " */
12226 numptr_m1
= NUMPTR
- 1;
12227 if (op
!= TOK_ASSIGN
) {
12228 /* check operand is var with noninteger value for not '=' */
12229 ret_arith_lookup_val
= arith_lookup_val(numptr_m1
);
12230 if (ret_arith_lookup_val
)
12231 return ret_arith_lookup_val
;
12233 if (op
== TOK_CONDITIONAL
) {
12234 numptr_m1
->contidional_second_val
= rez
;
12236 rez
= numptr_m1
->val
;
12237 if (op
== TOK_BOR
|| op
== TOK_OR_ASSIGN
)
12239 else if (op
== TOK_OR
)
12240 rez
= numptr_val
|| rez
;
12241 else if (op
== TOK_BAND
|| op
== TOK_AND_ASSIGN
)
12243 else if (op
== TOK_BXOR
|| op
== TOK_XOR_ASSIGN
)
12245 else if (op
== TOK_AND
)
12246 rez
= rez
&& numptr_val
;
12247 else if (op
== TOK_EQ
)
12248 rez
= (rez
== numptr_val
);
12249 else if (op
== TOK_NE
)
12250 rez
= (rez
!= numptr_val
);
12251 else if (op
== TOK_GE
)
12252 rez
= (rez
>= numptr_val
);
12253 else if (op
== TOK_RSHIFT
|| op
== TOK_RSHIFT_ASSIGN
)
12254 rez
>>= numptr_val
;
12255 else if (op
== TOK_LSHIFT
|| op
== TOK_LSHIFT_ASSIGN
)
12256 rez
<<= numptr_val
;
12257 else if (op
== TOK_GT
)
12258 rez
= (rez
> numptr_val
);
12259 else if (op
== TOK_LT
)
12260 rez
= (rez
< numptr_val
);
12261 else if (op
== TOK_LE
)
12262 rez
= (rez
<= numptr_val
);
12263 else if (op
== TOK_MUL
|| op
== TOK_MUL_ASSIGN
)
12265 else if (op
== TOK_ADD
|| op
== TOK_PLUS_ASSIGN
)
12267 else if (op
== TOK_SUB
|| op
== TOK_MINUS_ASSIGN
)
12269 else if (op
== TOK_ASSIGN
|| op
== TOK_COMMA
)
12271 else if (op
== TOK_CONDITIONAL_SEP
) {
12272 if (numptr_m1
== numstack
) {
12273 /* protect $((expr : expr)) without "expr ? " */
12276 numptr_m1
->contidional_second_val_initialized
= op
;
12277 numptr_m1
->contidional_second_val
= numptr_val
;
12278 } else if (op
== TOK_CONDITIONAL
) {
12280 numptr_val
: numptr_m1
->contidional_second_val
;
12281 } else if (op
== TOK_EXPONENT
) {
12282 if (numptr_val
< 0)
12283 return -3; /* exponent less than 0 */
12288 while (numptr_val
--)
12292 } else if (numptr_val
==0) /* zero divisor check */
12294 else if (op
== TOK_DIV
|| op
== TOK_DIV_ASSIGN
)
12296 else if (op
== TOK_REM
|| op
== TOK_REM_ASSIGN
)
12299 if (tok_have_assign(op
)) {
12300 char buf
[sizeof(arith_t_type
)*3 + 2];
12302 if (numptr_m1
->var
== NULL
) {
12306 /* save to shell variable */
12307 #if ENABLE_ASH_MATH_SUPPORT_64
12308 snprintf(buf
, sizeof(buf
), "%lld", (arith_t_type
) rez
);
12310 snprintf(buf
, sizeof(buf
), "%ld", (arith_t_type
) rez
);
12312 setvar(numptr_m1
->var
, buf
, 0);
12313 /* after saving, make previous value for v++ or v-- */
12314 if (op
== TOK_POST_INC
)
12316 else if (op
== TOK_POST_DEC
)
12319 numptr_m1
->val
= rez
;
12320 /* protect geting var value, is number now */
12321 numptr_m1
->var
= NULL
;
12327 /* longest must be first */
12328 static const char op_tokens
[] ALIGN1
= {
12329 '<','<','=',0, TOK_LSHIFT_ASSIGN
,
12330 '>','>','=',0, TOK_RSHIFT_ASSIGN
,
12331 '<','<', 0, TOK_LSHIFT
,
12332 '>','>', 0, TOK_RSHIFT
,
12333 '|','|', 0, TOK_OR
,
12334 '&','&', 0, TOK_AND
,
12335 '!','=', 0, TOK_NE
,
12336 '<','=', 0, TOK_LE
,
12337 '>','=', 0, TOK_GE
,
12338 '=','=', 0, TOK_EQ
,
12339 '|','=', 0, TOK_OR_ASSIGN
,
12340 '&','=', 0, TOK_AND_ASSIGN
,
12341 '*','=', 0, TOK_MUL_ASSIGN
,
12342 '/','=', 0, TOK_DIV_ASSIGN
,
12343 '%','=', 0, TOK_REM_ASSIGN
,
12344 '+','=', 0, TOK_PLUS_ASSIGN
,
12345 '-','=', 0, TOK_MINUS_ASSIGN
,
12346 '-','-', 0, TOK_POST_DEC
,
12347 '^','=', 0, TOK_XOR_ASSIGN
,
12348 '+','+', 0, TOK_POST_INC
,
12349 '*','*', 0, TOK_EXPONENT
,
12353 '=', 0, TOK_ASSIGN
,
12365 '?', 0, TOK_CONDITIONAL
,
12366 ':', 0, TOK_CONDITIONAL_SEP
,
12367 ')', 0, TOK_RPAREN
,
12368 '(', 0, TOK_LPAREN
,
12372 #define endexpression &op_tokens[sizeof(op_tokens)-7]
12375 arith(const char *expr
, int *perrcode
)
12377 char arithval
; /* Current character under analysis */
12378 operator lasttok
, op
;
12381 const char *p
= endexpression
;
12384 size_t datasizes
= strlen(expr
) + 2;
12386 /* Stack of integers */
12387 /* The proof that there can be no more than strlen(startbuf)/2+1 integers
12388 * in any given correct or incorrect expression is left as an exercise to
12390 v_n_t
*numstack
= alloca(((datasizes
)/2)*sizeof(v_n_t
)),
12391 *numstackptr
= numstack
;
12392 /* Stack of operator tokens */
12393 operator *stack
= alloca((datasizes
) * sizeof(operator)),
12396 *stackptr
++ = lasttok
= TOK_LPAREN
; /* start off with a left paren */
12397 *perrcode
= errcode
= 0;
12401 if (arithval
== 0) {
12402 if (p
== endexpression
) {
12403 /* Null expression. */
12407 /* This is only reached after all tokens have been extracted from the
12408 * input stream. If there are still tokens on the operator stack, they
12409 * are to be applied in order. At the end, there should be a final
12410 * result on the integer stack */
12412 if (expr
!= endexpression
+ 1) {
12413 /* If we haven't done so already, */
12414 /* append a closing right paren */
12415 expr
= endexpression
;
12416 /* and let the loop process it. */
12419 /* At this point, we're done with the expression. */
12420 if (numstackptr
!= numstack
+1) {
12421 /* ... but if there isn't, it's bad */
12423 return (*perrcode
= -1);
12425 if (numstack
->var
) {
12426 /* expression is $((var)) only, lookup now */
12427 errcode
= arith_lookup_val(numstack
);
12430 *perrcode
= errcode
;
12431 return numstack
->val
;
12434 /* Continue processing the expression. */
12435 if (arith_isspace(arithval
)) {
12436 /* Skip whitespace */
12439 p
= endofname(expr
);
12441 size_t var_name_size
= (p
-expr
) + 1; /* trailing zero */
12443 numstackptr
->var
= alloca(var_name_size
);
12444 safe_strncpy(numstackptr
->var
, expr
, var_name_size
);
12447 numstackptr
->contidional_second_val_initialized
= 0;
12452 if (isdigit(arithval
)) {
12453 numstackptr
->var
= NULL
;
12454 #if ENABLE_ASH_MATH_SUPPORT_64
12455 numstackptr
->val
= strtoll(expr
, (char **) &expr
, 0);
12457 numstackptr
->val
= strtol(expr
, (char **) &expr
, 0);
12461 for (p
= op_tokens
; ; p
++) {
12465 /* strange operator not found */
12468 for (o
= expr
; *p
&& *o
== *p
; p
++)
12475 /* skip tail uncompared token */
12478 /* skip zero delim */
12483 /* post grammar: a++ reduce to num */
12484 if (lasttok
== TOK_POST_INC
|| lasttok
== TOK_POST_DEC
)
12487 /* Plus and minus are binary (not unary) _only_ if the last
12488 * token was as number, or a right paren (which pretends to be
12489 * a number, since it evaluates to one). Think about it.
12490 * It makes sense. */
12491 if (lasttok
!= TOK_NUM
) {
12507 /* We don't want a unary operator to cause recursive descent on the
12508 * stack, because there can be many in a row and it could cause an
12509 * operator to be evaluated before its argument is pushed onto the
12510 * integer stack. */
12511 /* But for binary operators, "apply" everything on the operator
12512 * stack until we find an operator with a lesser priority than the
12513 * one we have just extracted. */
12514 /* Left paren is given the lowest priority so it will never be
12515 * "applied" in this way.
12516 * if associativity is right and priority eq, applied also skip
12519 if ((prec
> 0 && prec
< UNARYPREC
) || prec
== SPEC_PREC
) {
12520 /* not left paren or unary */
12521 if (lasttok
!= TOK_NUM
) {
12522 /* binary op must be preceded by a num */
12525 while (stackptr
!= stack
) {
12526 if (op
== TOK_RPAREN
) {
12527 /* The algorithm employed here is simple: while we don't
12528 * hit an open paren nor the bottom of the stack, pop
12529 * tokens and apply them */
12530 if (stackptr
[-1] == TOK_LPAREN
) {
12532 /* Any operator directly after a */
12534 /* close paren should consider itself binary */
12538 operator prev_prec
= PREC(stackptr
[-1]);
12540 convert_prec_is_assing(prec
);
12541 convert_prec_is_assing(prev_prec
);
12542 if (prev_prec
< prec
)
12544 /* check right assoc */
12545 if (prev_prec
== prec
&& is_right_associativity(prec
))
12548 errcode
= arith_apply(*--stackptr
, numstack
, &numstackptr
);
12549 if (errcode
) goto ret
;
12551 if (op
== TOK_RPAREN
) {
12556 /* Push this operator to the stack and remember it. */
12557 *stackptr
++ = lasttok
= op
;
12562 #endif /* ASH_MATH_SUPPORT */
12565 /* ============ main() and helpers */
12568 * Called to exit the shell.
12570 static void exitshell(void) ATTRIBUTE_NORETURN
;
12578 status
= exitstatus
;
12579 TRACE(("pid %d, exitshell(%d)\n", getpid(), status
));
12580 if (setjmp(loc
.loc
)) {
12581 if (exception
== EXEXIT
)
12582 /* dash bug: it just does _exit(exitstatus) here
12583 * but we have to do setjobctl(0) first!
12584 * (bug is still not fixed in dash-0.5.3 - if you run dash
12585 * under Midnight Commander, on exit from dash MC is backgrounded) */
12586 status
= exitstatus
;
12589 exception_handler
= &loc
;
12595 flush_stdout_stderr();
12605 /* from input.c: */
12606 basepf
.nextc
= basepf
.buf
= basebuf
;
12609 signal(SIGCHLD
, SIG_DFL
);
12614 char ppid
[sizeof(int)*3 + 1];
12616 struct stat st1
, st2
;
12619 for (envp
= environ
; envp
&& *envp
; envp
++) {
12620 if (strchr(*envp
, '=')) {
12621 setvareq(*envp
, VEXPORT
|VTEXTFIXED
);
12625 snprintf(ppid
, sizeof(ppid
), "%u", (unsigned) getppid());
12626 setvar("PPID", ppid
, 0);
12628 p
= lookupvar("PWD");
12630 if (*p
!= '/' || stat(p
, &st1
) || stat(".", &st2
)
12631 || st1
.st_dev
!= st2
.st_dev
|| st1
.st_ino
!= st2
.st_ino
)
12638 * Process the shell command line arguments.
12641 procargs(int argc
, char **argv
)
12644 const char *xminusc
;
12651 for (i
= 0; i
< NOPTS
; i
++)
12657 if (*xargv
== NULL
) {
12659 ash_msg_and_raise_error(bb_msg_requires_arg
, "-c");
12662 if (iflag
== 2 && sflag
== 1 && isatty(0) && isatty(1))
12666 for (i
= 0; i
< NOPTS
; i
++)
12667 if (optlist
[i
] == 2)
12672 /* POSIX 1003.2: first arg after -c cmd is $0, remainder $1... */
12677 } else if (!sflag
) {
12678 setinputfile(*xargv
, 0);
12681 commandname
= arg0
;
12684 shellparam
.p
= xargv
;
12685 #if ENABLE_ASH_GETOPTS
12686 shellparam
.optind
= 1;
12687 shellparam
.optoff
= -1;
12689 /* assert(shellparam.malloc == 0 && shellparam.nparam == 0); */
12691 shellparam
.nparam
++;
12698 * Read /etc/profile or .profile.
12701 read_profile(const char *name
)
12705 if (setinputfile(name
, INPUT_PUSH_FILE
| INPUT_NOFILE_OK
) < 0)
12714 * This routine is called when an error or an interrupt occurs in an
12715 * interactive shell and control is returned to the main command loop.
12723 /* from input.c: */
12724 parselleft
= parsenleft
= 0; /* clear input buffer */
12726 /* from parser.c: */
12729 /* from redir.c: */
12734 static short profile_buf
[16384];
12735 extern int etext();
12739 * Main routine. We initialize things, parse the arguments, execute
12740 * profiles if we're a login shell, and then call cmdloop to execute
12741 * commands. The setjmp call sets up the location to jump to when an
12742 * exception occurs. When an exception occurs the variable "state"
12743 * is used to figure out how far we had gotten.
12745 int ash_main(int argc
, char **argv
) MAIN_EXTERNALLY_VISIBLE
;
12746 int ash_main(int argc
, char **argv
)
12749 volatile int state
;
12750 struct jmploc jmploc
;
12751 struct stackmark smark
;
12754 monitor(4, etext
, profile_buf
, sizeof(profile_buf
), 50);
12757 #if ENABLE_FEATURE_EDITING
12758 line_input_state
= new_line_input_t(FOR_SHELL
| WITH_PATH_LOOKUP
);
12761 if (setjmp(jmploc
.loc
)) {
12771 if (e
== EXEXIT
|| s
== 0 || iflag
== 0 || shlvl
)
12775 outcslow('\n', stderr
);
12777 popstackmark(&smark
);
12778 FORCE_INT_ON
; /* enable interrupts */
12787 exception_handler
= &jmploc
;
12790 trace_puts("Shell args: ");
12791 trace_puts_args(argv
);
12793 rootpid
= getpid();
12795 #if ENABLE_ASH_RANDOM_SUPPORT
12796 rseed
= rootpid
+ time(NULL
);
12799 setstackmark(&smark
);
12800 procargs(argc
, argv
);
12801 #if ENABLE_FEATURE_EDITING_SAVEHISTORY
12803 const char *hp
= lookupvar("HISTFILE");
12806 hp
= lookupvar("HOME");
12808 char *defhp
= concat_path_file(hp
, ".ash_history");
12809 setvar("HISTFILE", defhp
, 0);
12815 if (argv
[0] && argv
[0][0] == '-')
12819 read_profile("/etc/profile");
12822 read_profile(".profile");
12828 getuid() == geteuid() && getgid() == getegid() &&
12832 shinit
= lookupvar("ENV");
12833 if (shinit
!= NULL
&& *shinit
!= '\0') {
12834 read_profile(shinit
);
12840 evalstring(minusc
, 0);
12842 if (sflag
|| minusc
== NULL
) {
12843 #if ENABLE_FEATURE_EDITING_SAVEHISTORY
12845 const char *hp
= lookupvar("HISTFILE");
12848 line_input_state
->hist_file
= hp
;
12851 state4
: /* XXX ??? - why isn't this before the "if" statement */
12859 extern void _mcleanup(void);
12868 const char *applet_name
= "debug stuff usage";
12869 int main(int argc
, char **argv
)
12871 return ash_main(argc
, argv
);
12877 * Copyright (c) 1989, 1991, 1993, 1994
12878 * The Regents of the University of California. All rights reserved.
12880 * This code is derived from software contributed to Berkeley by
12881 * Kenneth Almquist.
12883 * Redistribution and use in source and binary forms, with or without
12884 * modification, are permitted provided that the following conditions
12886 * 1. Redistributions of source code must retain the above copyright
12887 * notice, this list of conditions and the following disclaimer.
12888 * 2. Redistributions in binary form must reproduce the above copyright
12889 * notice, this list of conditions and the following disclaimer in the
12890 * documentation and/or other materials provided with the distribution.
12891 * 3. Neither the name of the University nor the names of its contributors
12892 * may be used to endorse or promote products derived from this software
12893 * without specific prior written permission.
12895 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
12896 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
12897 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
12898 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
12899 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
12900 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
12901 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
12902 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
12903 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
12904 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF