blob: c55d86f5da63dffa81ed9a1cda4ace5f19a91e4a [file] [log] [blame]
Eric Andersen25f27032001-04-26 23:22:31 +00001/* vi: set sw=4 ts=4: */
2/*
3 * sh.c -- a prototype Bourne shell grammar parser
4 * Intended to follow the original Thompson and Ritchie
5 * "small and simple is beautiful" philosophy, which
6 * incidentally is a good match to today's BusyBox.
7 *
8 * Copyright (C) 2000,2001 Larry Doolittle <larry@doolittle.boa.org>
9 *
10 * Credits:
11 * The parser routines proper are all original material, first
12 * written Dec 2000 and Jan 2001 by Larry Doolittle.
13 * The execution engine, the builtins, and much of the underlying
14 * support has been adapted from busybox-0.49pre's lash,
15 * which is Copyright (C) 2000 by Lineo, Inc., and
16 * written by Erik Andersen <andersen@lineo.com>, <andersee@debian.org>.
17 * That, in turn, is based in part on ladsh.c, by Michael K. Johnson and
18 * Erik W. Troan, which they placed in the public domain. I don't know
19 * how much of the Johnson/Troan code has survived the repeated rewrites.
20 * Other credits:
21 * simple_itoa() was lifted from boa-0.93.15
22 * b_addchr() derived from similar w_addchar function in glibc-2.2
23 * setup_redirect(), redirect_opt_num(), and big chunks of main()
24 * and many builtins derived from contributions by Erik Andersen
25 * miscellaneous bugfixes from Matt Kraai
26 *
27 * There are two big (and related) architecture differences between
28 * this parser and the lash parser. One is that this version is
29 * actually designed from the ground up to understand nearly all
30 * of the Bourne grammar. The second, consequential change is that
31 * the parser and input reader have been turned inside out. Now,
32 * the parser is in control, and asks for input as needed. The old
33 * way had the input reader in control, and it asked for parsing to
34 * take place as needed. The new way makes it much easier to properly
35 * handle the recursion implicit in the various substitutions, especially
36 * across continuation lines.
37 *
38 * Bash grammar not implemented: (how many of these were in original sh?)
39 * $@ (those sure look like weird quoting rules)
40 * $_
41 * ! negation operator for pipes
42 * &> and >& redirection of stdout+stderr
43 * Brace Expansion
44 * Tilde Expansion
45 * fancy forms of Parameter Expansion
46 * Arithmetic Expansion
47 * <(list) and >(list) Process Substitution
Eric Andersenaac75e52001-04-30 18:18:45 +000048 * reserved words: case, esac, function
Eric Andersen25f27032001-04-26 23:22:31 +000049 * Here Documents ( << word )
50 * Functions
51 * Major bugs:
52 * job handling woefully incomplete and buggy
53 * reserved word execution woefully incomplete and buggy
Eric Andersen25f27032001-04-26 23:22:31 +000054 * to-do:
55 * port selected bugfixes from post-0.49 busybox lash
56 * finish implementing reserved words
57 * handle children going into background
58 * clean up recognition of null pipes
59 * have builtin_exec set flag to avoid restore_redirects
60 * figure out if "echo foo}" is fixable
61 * check setting of global_argc and global_argv
62 * control-C handling, probably with longjmp
63 * VAR=value prefix for simple commands
64 * follow IFS rules more precisely, including update semantics
65 * write builtin_eval, builtin_ulimit, builtin_umask
66 * figure out what to do with backslash-newline
67 * explain why we use signal instead of sigaction
68 * propagate syntax errors, die on resource errors?
69 * continuation lines, both explicit and implicit - done?
70 * memory leak finding and plugging - done?
71 * more testing, especially quoting rules and redirection
72 * maybe change map[] to use 2-bit entries
73 * (eventually) remove all the printf's
Eric Andersen25f27032001-04-26 23:22:31 +000074 *
75 * This program is free software; you can redistribute it and/or modify
76 * it under the terms of the GNU General Public License as published by
77 * the Free Software Foundation; either version 2 of the License, or
78 * (at your option) any later version.
79 *
80 * This program is distributed in the hope that it will be useful,
81 * but WITHOUT ANY WARRANTY; without even the implied warranty of
82 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
83 * General Public License for more details.
84 *
85 * You should have received a copy of the GNU General Public License
86 * along with this program; if not, write to the Free Software
87 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
88 */
89#include <ctype.h> /* isalpha, isdigit */
90#include <unistd.h> /* getpid */
91#include <stdlib.h> /* getenv, atoi */
92#include <string.h> /* strchr */
93#include <stdio.h> /* popen etc. */
94#include <glob.h> /* glob, of course */
95#include <stdarg.h> /* va_list */
96#include <errno.h>
97#include <fcntl.h>
98#include <getopt.h> /* should be pretty obvious */
99
100#include <sys/types.h>
101#include <sys/wait.h>
102#include <signal.h>
103
104/* #include <dmalloc.h> */
Eric Andersen4ed5e372001-05-01 01:49:50 +0000105/* #define DEBUG_SHELL */
Eric Andersen25f27032001-04-26 23:22:31 +0000106
107#ifdef BB_VER
108#include "busybox.h"
109#include "cmdedit.h"
110#else
Eric Andersen25f27032001-04-26 23:22:31 +0000111#define applet_name "hush"
Eric Andersenaf44a0e2001-04-27 07:26:12 +0000112#include "standalone.h"
Eric Andersen25f27032001-04-26 23:22:31 +0000113#define shell_main main
Eric Andersenaf44a0e2001-04-27 07:26:12 +0000114#define BB_FEATURE_SH_SIMPLE_PROMPT
115#endif
Eric Andersen25f27032001-04-26 23:22:31 +0000116
117typedef enum {
118 REDIRECT_INPUT = 1,
119 REDIRECT_OVERWRITE = 2,
120 REDIRECT_APPEND = 3,
121 REDIRECT_HEREIS = 4,
122 REDIRECT_IO = 5
123} redir_type;
124
125/* The descrip member of this structure is only used to make debugging
126 * output pretty */
127struct {int mode; int default_fd; char *descrip;} redir_table[] = {
128 { 0, 0, "()" },
129 { O_RDONLY, 0, "<" },
130 { O_CREAT|O_TRUNC|O_WRONLY, 1, ">" },
131 { O_CREAT|O_APPEND|O_WRONLY, 1, ">>" },
132 { O_RDONLY, -1, "<<" },
133 { O_RDWR, 1, "<>" }
134};
135
136typedef enum {
137 PIPE_SEQ = 1,
138 PIPE_AND = 2,
139 PIPE_OR = 3,
140 PIPE_BG = 4,
141} pipe_style;
142
143/* might eventually control execution */
144typedef enum {
145 RES_NONE = 0,
146 RES_IF = 1,
147 RES_THEN = 2,
148 RES_ELIF = 3,
149 RES_ELSE = 4,
150 RES_FI = 5,
151 RES_FOR = 6,
152 RES_WHILE = 7,
153 RES_UNTIL = 8,
154 RES_DO = 9,
155 RES_DONE = 10,
Eric Andersenaf44a0e2001-04-27 07:26:12 +0000156 RES_XXXX = 11,
157 RES_SNTX = 12
Eric Andersen25f27032001-04-26 23:22:31 +0000158} reserved_style;
159#define FLAG_END (1<<RES_NONE)
160#define FLAG_IF (1<<RES_IF)
161#define FLAG_THEN (1<<RES_THEN)
162#define FLAG_ELIF (1<<RES_ELIF)
163#define FLAG_ELSE (1<<RES_ELSE)
164#define FLAG_FI (1<<RES_FI)
165#define FLAG_FOR (1<<RES_FOR)
166#define FLAG_WHILE (1<<RES_WHILE)
167#define FLAG_UNTIL (1<<RES_UNTIL)
168#define FLAG_DO (1<<RES_DO)
169#define FLAG_DONE (1<<RES_DONE)
170#define FLAG_START (1<<RES_XXXX)
171
172/* This holds pointers to the various results of parsing */
173struct p_context {
174 struct child_prog *child;
175 struct pipe *list_head;
176 struct pipe *pipe;
177 struct redir_struct *pending_redirect;
178 reserved_style w;
179 int old_flag; /* for figuring out valid reserved words */
180 struct p_context *stack;
181 /* How about quoting status? */
182};
183
184struct redir_struct {
185 redir_type type; /* type of redirection */
186 int fd; /* file descriptor being redirected */
187 int dup; /* -1, or file descriptor being duplicated */
188 struct redir_struct *next; /* pointer to the next redirect in the list */
189 glob_t word; /* *word.gl_pathv is the filename */
190};
191
192struct child_prog {
193 pid_t pid; /* 0 if exited */
194 char **argv; /* program name and arguments */
195 struct pipe *group; /* if non-NULL, first in group or subshell */
196 int subshell; /* flag, non-zero if group must be forked */
197 struct redir_struct *redirects; /* I/O redirections */
198 glob_t glob_result; /* result of parameter globbing */
199 int is_stopped; /* is the program currently running? */
200 struct pipe *family; /* pointer back to the child's parent pipe */
201};
202
203struct pipe {
204 int jobid; /* job number */
205 int num_progs; /* total number of programs in job */
206 int running_progs; /* number of programs running */
207 char *text; /* name of job */
208 char *cmdbuf; /* buffer various argv's point into */
209 pid_t pgrp; /* process group ID for the job */
210 struct child_prog *progs; /* array of commands in pipe */
211 struct pipe *next; /* to track background commands */
212 int stopped_progs; /* number of programs alive, but stopped */
213 int job_context; /* bitmask defining current context */
214 pipe_style followup; /* PIPE_BG, PIPE_SEQ, PIPE_OR, PIPE_AND */
215 reserved_style r_mode; /* supports if, for, while, until */
Eric Andersen25f27032001-04-26 23:22:31 +0000216};
217
218struct jobset {
219 struct pipe *head; /* head of list of running jobs */
220 struct pipe *fg; /* current foreground job */
221};
222
223struct close_me {
224 int fd;
225 struct close_me *next;
226};
227
228/* globals, connect us to the outside world
229 * the first three support $?, $#, and $1 */
230char **global_argv;
231unsigned int global_argc;
232unsigned int last_return_code;
233extern char **environ; /* This is in <unistd.h>, but protected with __USE_GNU */
234
235/* Variables we export */
236unsigned int shell_context; /* Used in cmdedit.c to reset the
237 * context when someone hits ^C */
238
239/* "globals" within this file */
240static char *ifs=NULL;
241static char map[256];
242static int fake_mode=0;
243static int interactive=0;
244static struct close_me *close_me_head = NULL;
245static char *cwd;
Eric Andersenbafd94f2001-05-02 16:11:59 +0000246static struct jobset *job_list;
Eric Andersen25f27032001-04-26 23:22:31 +0000247static unsigned int last_bg_pid=0;
248static char *PS1;
249static char *PS2 = "> ";
250
251#define B_CHUNK (100)
252#define B_NOSPAC 1
253#define MAX_LINE 256 /* for cwd */
254#define MAX_READ 256 /* for builtin_read */
255
256typedef struct {
257 char *data;
258 int length;
259 int maxlen;
260 int quote;
261 int nonnull;
262} o_string;
263#define NULL_O_STRING {NULL,0,0,0,0}
264/* used for initialization:
265 o_string foo = NULL_O_STRING; */
266
267/* I can almost use ordinary FILE *. Is open_memstream() universally
268 * available? Where is it documented? */
269struct in_str {
270 const char *p;
271 int __promptme;
272 int promptmode;
273 FILE *file;
274 int (*get) (struct in_str *);
275 int (*peek) (struct in_str *);
276};
277#define b_getch(input) ((input)->get(input))
278#define b_peek(input) ((input)->peek(input))
279
280#define JOB_STATUS_FORMAT "[%d] %-22s %.40s\n"
281
282struct built_in_command {
283 char *cmd; /* name */
284 char *descr; /* description */
285 int (*function) (struct child_prog *); /* function ptr */
286};
287
288/* belongs in busybox.h */
289static inline int max(int a, int b) {
290 return (a>b)?a:b;
291}
292
293/* This should be in utility.c */
294#ifdef DEBUG_SHELL
295static void debug_printf(const char *format, ...)
296{
297 va_list args;
298 va_start(args, format);
299 vfprintf(stderr, format, args);
300 va_end(args);
301}
302#else
303static void debug_printf(const char *format, ...) { }
304#endif
305#define final_printf debug_printf
306
307void __syntax(char *file, int line) {
308 fprintf(stderr,"syntax error %s:%d\n",file,line);
309}
310#define syntax() __syntax(__FILE__, __LINE__)
311
312/* Index of subroutines: */
313/* function prototypes for builtins */
314static int builtin_cd(struct child_prog *child);
315static int builtin_env(struct child_prog *child);
316static int builtin_exec(struct child_prog *child);
317static int builtin_exit(struct child_prog *child);
318static int builtin_export(struct child_prog *child);
319static int builtin_fg_bg(struct child_prog *child);
320static int builtin_help(struct child_prog *child);
321static int builtin_jobs(struct child_prog *child);
322static int builtin_pwd(struct child_prog *child);
323static int builtin_read(struct child_prog *child);
324static int builtin_shift(struct child_prog *child);
325static int builtin_source(struct child_prog *child);
326static int builtin_ulimit(struct child_prog *child);
327static int builtin_umask(struct child_prog *child);
328static int builtin_unset(struct child_prog *child);
329/* o_string manipulation: */
330static int b_check_space(o_string *o, int len);
331static int b_addchr(o_string *o, int ch);
332static void b_reset(o_string *o);
333static int b_addqchr(o_string *o, int ch, int quote);
334static int b_adduint(o_string *o, unsigned int i);
335/* in_str manipulations: */
336static int static_get(struct in_str *i);
337static int static_peek(struct in_str *i);
338static int file_get(struct in_str *i);
339static int file_peek(struct in_str *i);
340static void setup_file_in_str(struct in_str *i, FILE *f);
341static void setup_string_in_str(struct in_str *i, const char *s);
342/* close_me manipulations: */
343static void mark_open(int fd);
344static void mark_closed(int fd);
345static void close_all();
346/* "run" the final data structures: */
347static char *indenter(int i);
348static int run_list_test(struct pipe *head, int indent);
349static int run_pipe_test(struct pipe *pi, int indent);
350/* really run the final data structures: */
351static int setup_redirects(struct child_prog *prog, int squirrel[]);
352static int pipe_wait(struct pipe *pi);
353static int run_list_real(struct pipe *pi);
354static void pseudo_exec(struct child_prog *child) __attribute__ ((noreturn));
355static int run_pipe_real(struct pipe *pi);
356/* extended glob support: */
357static int globhack(const char *src, int flags, glob_t *pglob);
358static int glob_needed(const char *s);
359static int xglob(o_string *dest, int flags, glob_t *pglob);
360/* data structure manipulation: */
361static int setup_redirect(struct p_context *ctx, int fd, redir_type style, struct in_str *input);
362static void initialize_context(struct p_context *ctx);
363static int done_word(o_string *dest, struct p_context *ctx);
364static int done_command(struct p_context *ctx);
365static int done_pipe(struct p_context *ctx, pipe_style type);
366/* primary string parsing: */
367static int redirect_dup_num(struct in_str *input);
368static int redirect_opt_num(o_string *o);
369static int process_command_subs(o_string *dest, struct p_context *ctx, struct in_str *input, int subst_end);
370static int parse_group(o_string *dest, struct p_context *ctx, struct in_str *input, int ch);
371static void lookup_param(o_string *dest, struct p_context *ctx, o_string *src);
372static int handle_dollar(o_string *dest, struct p_context *ctx, struct in_str *input);
373static int parse_string(o_string *dest, struct p_context *ctx, const char *src);
374static int parse_stream(o_string *dest, struct p_context *ctx, struct in_str *input0, int end_trigger);
375/* setup: */
376static int parse_stream_outer(struct in_str *inp);
377static int parse_string_outer(const char *s);
378static int parse_file_outer(FILE *f);
Eric Andersenbafd94f2001-05-02 16:11:59 +0000379/* job management: */
380static void checkjobs();
381static void insert_bg_job(struct pipe *pi);
382static void remove_bg_job(struct pipe *pi);
383static void free_pipe(struct pipe *pi);
Eric Andersen25f27032001-04-26 23:22:31 +0000384
385/* Table of built-in functions. They can be forked or not, depending on
386 * context: within pipes, they fork. As simple commands, they do not.
387 * When used in non-forking context, they can change global variables
388 * in the parent shell process. If forked, of course they can not.
389 * For example, 'unset foo | whatever' will parse and run, but foo will
390 * still be set at the end. */
391static struct built_in_command bltins[] = {
392 {"bg", "Resume a job in the background", builtin_fg_bg},
393 {"cd", "Change working directory", builtin_cd},
394 {"env", "Print all environment variables", builtin_env},
395 {"exec", "Exec command, replacing this shell with the exec'd process", builtin_exec},
396 {"exit", "Exit from shell()", builtin_exit},
397 {"export", "Set environment variable", builtin_export},
398 {"fg", "Bring job into the foreground", builtin_fg_bg},
399 {"jobs", "Lists the active jobs", builtin_jobs},
400 {"pwd", "Print current directory", builtin_pwd},
401 {"read", "Input environment variable", builtin_read},
402 {"shift", "Shift positional parameters", builtin_shift},
403 {"ulimit","Controls resource limits", builtin_ulimit},
404 {"umask","Sets file creation mask", builtin_umask},
405 {"unset", "Unset environment variable", builtin_unset},
406 {".", "Source-in and run commands in a file", builtin_source},
407 {"help", "List shell built-in commands", builtin_help},
408 {NULL, NULL, NULL}
409};
410
411/* built-in 'cd <path>' handler */
412static int builtin_cd(struct child_prog *child)
413{
414 char *newdir;
415 if (child->argv[1] == NULL)
416 newdir = getenv("HOME");
417 else
418 newdir = child->argv[1];
419 if (chdir(newdir)) {
420 printf("cd: %s: %s\n", newdir, strerror(errno));
421 return EXIT_FAILURE;
422 }
423 getcwd(cwd, sizeof(char)*MAX_LINE);
424 return EXIT_SUCCESS;
425}
426
427/* built-in 'env' handler */
428static int builtin_env(struct child_prog *dummy)
429{
430 char **e = environ;
431 if (e == NULL) return EXIT_FAILURE;
432 for (; *e; e++) {
433 puts(*e);
434 }
435 return EXIT_SUCCESS;
436}
437
438/* built-in 'exec' handler */
439static int builtin_exec(struct child_prog *child)
440{
441 if (child->argv[1] == NULL)
442 return EXIT_SUCCESS; /* Really? */
443 child->argv++;
444 pseudo_exec(child);
445 /* never returns */
446}
447
448/* built-in 'exit' handler */
449static int builtin_exit(struct child_prog *child)
450{
451 if (child->argv[1] == NULL)
Eric Andersene67c3ce2001-05-02 02:09:36 +0000452 exit(last_return_code);
Eric Andersen25f27032001-04-26 23:22:31 +0000453 exit (atoi(child->argv[1]));
454}
455
456/* built-in 'export VAR=value' handler */
457static int builtin_export(struct child_prog *child)
458{
459 int res;
460
461 if (child->argv[1] == NULL) {
462 return (builtin_env(child));
463 }
464 res = putenv(child->argv[1]);
465 if (res)
466 fprintf(stderr, "export: %s\n", strerror(errno));
467 return (res);
468}
469
470/* built-in 'fg' and 'bg' handler */
471static int builtin_fg_bg(struct child_prog *child)
472{
473 int i, jobNum;
474 struct pipe *job=NULL;
475
476 if (!child->argv[1] || child->argv[2]) {
477 error_msg("%s: exactly one argument is expected\n",
478 child->argv[0]);
479 return EXIT_FAILURE;
480 }
481
482 if (sscanf(child->argv[1], "%%%d", &jobNum) != 1) {
483 error_msg("%s: bad argument '%s'\n",
484 child->argv[0], child->argv[1]);
485 return EXIT_FAILURE;
486 }
487
Eric Andersenbafd94f2001-05-02 16:11:59 +0000488 for (job = job_list->head; job; job = job->next) {
Eric Andersen25f27032001-04-26 23:22:31 +0000489 if (job->jobid == jobNum) {
490 break;
491 }
492 }
493
494 if (!job) {
495 error_msg("%s: unknown job %d\n",
496 child->argv[0], jobNum);
497 return EXIT_FAILURE;
498 }
499
500 if (*child->argv[0] == 'f') {
501 /* Make this job the foreground job */
502 /* suppress messages when run from /linuxrc mag@sysgo.de */
503 if (tcsetpgrp(0, job->pgrp) && errno != ENOTTY)
504 perror_msg("tcsetpgrp");
Eric Andersenbafd94f2001-05-02 16:11:59 +0000505 job_list->fg = job;
Eric Andersen25f27032001-04-26 23:22:31 +0000506 }
507
508 /* Restart the processes in the job */
509 for (i = 0; i < job->num_progs; i++)
510 job->progs[i].is_stopped = 0;
511
512 kill(-job->pgrp, SIGCONT);
513
514 job->stopped_progs = 0;
515 return EXIT_SUCCESS;
516}
517
518/* built-in 'help' handler */
519static int builtin_help(struct child_prog *dummy)
520{
521 struct built_in_command *x;
522
523 printf("\nBuilt-in commands:\n");
524 printf("-------------------\n");
525 for (x = bltins; x->cmd; x++) {
526 if (x->descr==NULL)
527 continue;
528 printf("%s\t%s\n", x->cmd, x->descr);
529 }
530 printf("\n\n");
531 return EXIT_SUCCESS;
532}
533
534/* built-in 'jobs' handler */
535static int builtin_jobs(struct child_prog *child)
536{
537 struct pipe *job;
538 char *status_string;
539
Eric Andersenbafd94f2001-05-02 16:11:59 +0000540 for (job = job_list->head; job; job = job->next) {
Eric Andersen25f27032001-04-26 23:22:31 +0000541 if (job->running_progs == job->stopped_progs)
542 status_string = "Stopped";
543 else
544 status_string = "Running";
545 printf(JOB_STATUS_FORMAT, job->jobid, status_string, job->text);
546 }
547 return EXIT_SUCCESS;
548}
549
550
551/* built-in 'pwd' handler */
552static int builtin_pwd(struct child_prog *dummy)
553{
554 getcwd(cwd, MAX_LINE);
555 puts(cwd);
556 return EXIT_SUCCESS;
557}
558
559/* built-in 'read VAR' handler */
560static int builtin_read(struct child_prog *child)
561{
562 int res = 0, len, newlen;
563 char *s;
564 char string[MAX_READ];
565
566 if (child->argv[1]) {
567 /* argument (VAR) given: put "VAR=" into buffer */
568 strcpy(string, child->argv[1]);
569 len = strlen(string);
570 string[len++] = '=';
571 string[len] = '\0';
572 /* XXX would it be better to go through in_str? */
573 fgets(&string[len], sizeof(string) - len, stdin); /* read string */
574 newlen = strlen(string);
575 if(newlen > len)
576 string[--newlen] = '\0'; /* chomp trailing newline */
577 /*
578 ** string should now contain "VAR=<value>"
579 ** copy it (putenv() won't do that, so we must make sure
580 ** the string resides in a static buffer!)
581 */
582 res = -1;
583 if((s = strdup(string)))
584 res = putenv(s);
585 if (res)
586 fprintf(stderr, "read: %s\n", strerror(errno));
587 }
588 else
589 fgets(string, sizeof(string), stdin);
590
591 return (res);
592}
593
594/* Built-in 'shift' handler */
595static int builtin_shift(struct child_prog *child)
596{
597 int n=1;
598 if (child->argv[1]) {
599 n=atoi(child->argv[1]);
600 }
601 if (n>=0 && n<global_argc) {
602 /* XXX This probably breaks $0 */
603 global_argc -= n;
604 global_argv += n;
605 return EXIT_SUCCESS;
606 } else {
607 return EXIT_FAILURE;
608 }
609}
610
611/* Built-in '.' handler (read-in and execute commands from file) */
612static int builtin_source(struct child_prog *child)
613{
614 FILE *input;
615 int status;
616
617 if (child->argv[1] == NULL)
618 return EXIT_FAILURE;
619
620 /* XXX search through $PATH is missing */
621 input = fopen(child->argv[1], "r");
622 if (!input) {
623 fprintf(stderr, "Couldn't open file '%s'\n", child->argv[1]);
624 return EXIT_FAILURE;
625 }
626
627 /* Now run the file */
628 /* XXX argv and argc are broken; need to save old global_argv
629 * (pointer only is OK!) on this stack frame,
630 * set global_argv=child->argv+1, recurse, and restore. */
631 mark_open(fileno(input));
632 status = parse_file_outer(input);
633 mark_closed(fileno(input));
634 fclose(input);
635 return (status);
636}
637
638static int builtin_ulimit(struct child_prog *child)
639{
640 printf("builtin_ulimit not written\n");
641 return EXIT_FAILURE;
642}
643
644static int builtin_umask(struct child_prog *child)
645{
646 printf("builtin_umask not written\n");
647 return EXIT_FAILURE;
648}
649
650/* built-in 'unset VAR' handler */
651static int builtin_unset(struct child_prog *child)
652{
653 if (child->argv[1] == NULL) {
654 fprintf(stderr, "unset: parameter required.\n");
655 return EXIT_FAILURE;
656 }
657 unsetenv(child->argv[1]);
658 return EXIT_SUCCESS;
659}
660
661static int b_check_space(o_string *o, int len)
662{
663 /* It would be easy to drop a more restrictive policy
664 * in here, such as setting a maximum string length */
665 if (o->length + len > o->maxlen) {
666 char *old_data = o->data;
667 /* assert (data == NULL || o->maxlen != 0); */
668 o->maxlen += max(2*len, B_CHUNK);
669 o->data = realloc(o->data, 1 + o->maxlen);
670 if (o->data == NULL) {
671 free(old_data);
672 }
673 }
674 return o->data == NULL;
675}
676
677static int b_addchr(o_string *o, int ch)
678{
679 debug_printf("b_addchr: %c %d %p\n", ch, o->length, o);
680 if (b_check_space(o, 1)) return B_NOSPAC;
681 o->data[o->length] = ch;
682 o->length++;
683 o->data[o->length] = '\0';
684 return 0;
685}
686
687static void b_reset(o_string *o)
688{
689 o->length = 0;
690 o->nonnull = 0;
691 if (o->data != NULL) *o->data = '\0';
692}
693
694static void b_free(o_string *o)
695{
696 b_reset(o);
697 if (o->data != NULL) free(o->data);
698 o->data = NULL;
699 o->maxlen = 0;
700}
701
702/* My analysis of quoting semantics tells me that state information
703 * is associated with a destination, not a source.
704 */
705static int b_addqchr(o_string *o, int ch, int quote)
706{
707 if (quote && strchr("*?[\\",ch)) {
708 int rc;
709 rc = b_addchr(o, '\\');
710 if (rc) return rc;
711 }
712 return b_addchr(o, ch);
713}
714
715/* belongs in utility.c */
716char *simple_itoa(unsigned int i)
717{
718 /* 21 digits plus null terminator, good for 64-bit or smaller ints */
719 static char local[22];
720 char *p = &local[21];
721 *p-- = '\0';
722 do {
723 *p-- = '0' + i % 10;
724 i /= 10;
725 } while (i > 0);
726 return p + 1;
727}
728
729static int b_adduint(o_string *o, unsigned int i)
730{
731 int r;
732 char *p = simple_itoa(i);
733 /* no escape checking necessary */
734 do r=b_addchr(o, *p++); while (r==0 && *p);
735 return r;
736}
737
738static int static_get(struct in_str *i)
739{
740 int ch=*i->p++;
741 if (ch=='\0') return EOF;
742 return ch;
743}
744
745static int static_peek(struct in_str *i)
746{
747 return *i->p;
748}
749
750static inline void cmdedit_set_initial_prompt(void)
751{
752#ifdef BB_FEATURE_SH_SIMPLE_PROMPT
753 PS1 = NULL;
754#else
755 PS1 = getenv("PS1");
756 if(PS1==0)
757 PS1 = "\\w \\$ ";
758#endif
759}
760
761static inline void setup_prompt_string(int promptmode, char **prompt_str)
762{
Eric Andersenaf44a0e2001-04-27 07:26:12 +0000763 debug_printf("setup_prompt_string %d ",promptmode);
Eric Andersen25f27032001-04-26 23:22:31 +0000764#ifdef BB_FEATURE_SH_SIMPLE_PROMPT
765 /* Set up the prompt */
766 if (promptmode == 1) {
767 if (PS1)
768 free(PS1);
769 PS1=xmalloc(strlen(cwd)+4);
770 sprintf(PS1, "%s %s", cwd, ( geteuid() != 0 ) ? "$ ":"# ");
771 *prompt_str = PS1;
772 } else {
773 *prompt_str = PS2;
774 }
775#else
776 *prompt_str = (promptmode==0)? PS1 : PS2;
Eric Andersenaf44a0e2001-04-27 07:26:12 +0000777#endif
778 debug_printf("result %s\n",*prompt_str);
Eric Andersen25f27032001-04-26 23:22:31 +0000779}
780
781static void get_user_input(struct in_str *i)
782{
783 char *prompt_str;
Eric Andersen088875f2001-04-27 07:49:41 +0000784 static char the_command[BUFSIZ];
Eric Andersen25f27032001-04-26 23:22:31 +0000785
786 setup_prompt_string(i->promptmode, &prompt_str);
787#ifdef BB_FEATURE_COMMAND_EDITING
788 /*
789 ** enable command line editing only while a command line
790 ** is actually being read; otherwise, we'll end up bequeathing
791 ** atexit() handlers and other unwanted stuff to our
792 ** child processes (rob@sysgo.de)
793 */
794 cmdedit_read_input(prompt_str, the_command);
795 cmdedit_terminate();
796#else
797 fputs(prompt_str, stdout);
798 fflush(stdout);
799 the_command[0]=fgetc(i->file);
800 the_command[1]='\0';
801#endif
802 i->p = the_command;
803}
804
805/* This is the magic location that prints prompts
806 * and gets data back from the user */
807static int file_get(struct in_str *i)
808{
809 int ch;
810
811 ch = 0;
812 /* If there is data waiting, eat it up */
813 if (i->p && *i->p) {
814 ch=*i->p++;
815 } else {
816 /* need to double check i->file because we might be doing something
817 * more complicated by now, like sourcing or substituting. */
818 if (i->__promptme && interactive && i->file == stdin) {
819 get_user_input(i);
820 i->promptmode=2;
Eric Andersene67c3ce2001-05-02 02:09:36 +0000821 i->__promptme = 0;
822 if (i->p && *i->p) {
823 ch=*i->p++;
824 }
Eric Andersen4ed5e372001-05-01 01:49:50 +0000825 } else {
Eric Andersene67c3ce2001-05-02 02:09:36 +0000826 ch = fgetc(i->file);
Eric Andersen25f27032001-04-26 23:22:31 +0000827 }
Eric Andersen4ed5e372001-05-01 01:49:50 +0000828
Eric Andersen25f27032001-04-26 23:22:31 +0000829 debug_printf("b_getch: got a %d\n", ch);
830 }
831 if (ch == '\n') i->__promptme=1;
832 return ch;
833}
834
835/* All the callers guarantee this routine will never be
836 * used right after a newline, so prompting is not needed.
837 */
838static int file_peek(struct in_str *i)
839{
840 if (i->p && *i->p) {
841 return *i->p;
842 } else {
Eric Andersene67c3ce2001-05-02 02:09:36 +0000843 static char buffer[2];
844 buffer[0] = fgetc(i->file);
845 buffer[1] = '\0';
846 i->p = buffer;
Eric Andersen25f27032001-04-26 23:22:31 +0000847 debug_printf("b_peek: got a %d\n", *i->p);
848 return *i->p;
849 }
850}
851
852static void setup_file_in_str(struct in_str *i, FILE *f)
853{
854 i->peek = file_peek;
855 i->get = file_get;
856 i->__promptme=1;
857 i->promptmode=1;
858 i->file = f;
859 i->p = NULL;
860}
861
862static void setup_string_in_str(struct in_str *i, const char *s)
863{
864 i->peek = static_peek;
865 i->get = static_get;
866 i->__promptme=1;
867 i->promptmode=1;
868 i->p = s;
869}
870
871static void mark_open(int fd)
872{
873 struct close_me *new = xmalloc(sizeof(struct close_me));
874 new->fd = fd;
875 new->next = close_me_head;
876 close_me_head = new;
877}
878
879static void mark_closed(int fd)
880{
881 struct close_me *tmp;
882 if (close_me_head == NULL || close_me_head->fd != fd)
883 error_msg_and_die("corrupt close_me");
884 tmp = close_me_head;
885 close_me_head = close_me_head->next;
886 free(tmp);
887}
888
889static void close_all()
890{
891 struct close_me *c;
892 for (c=close_me_head; c; c=c->next) {
893 close(c->fd);
894 }
895 close_me_head = NULL;
896}
897
898/* squirrel != NULL means we squirrel away copies of stdin, stdout,
899 * and stderr if they are redirected. */
900static int setup_redirects(struct child_prog *prog, int squirrel[])
901{
902 int openfd, mode;
903 struct redir_struct *redir;
904
905 for (redir=prog->redirects; redir; redir=redir->next) {
906 if (redir->dup == -1) {
907 mode=redir_table[redir->type].mode;
908 openfd = open(redir->word.gl_pathv[0], mode, 0666);
909 if (openfd < 0) {
910 /* this could get lost if stderr has been redirected, but
911 bash and ash both lose it as well (though zsh doesn't!) */
912 fprintf(stderr,"error opening %s: %s\n", redir->word.gl_pathv[0],
913 strerror(errno));
914 return 1;
915 }
916 } else {
917 openfd = redir->dup;
918 }
919
920 if (openfd != redir->fd) {
921 if (squirrel && redir->fd < 3) {
922 squirrel[redir->fd] = dup(redir->fd);
923 }
924 dup2(openfd, redir->fd);
925 close(openfd);
926 }
927 }
928 return 0;
929}
930
931static void restore_redirects(int squirrel[])
932{
933 int i, fd;
934 for (i=0; i<3; i++) {
935 fd = squirrel[i];
936 if (fd != -1) {
937 /* No error checking. I sure wouldn't know what
938 * to do with an error if I found one! */
939 dup2(fd, i);
940 close(fd);
941 }
942 }
943}
944
945/* XXX this definitely needs some more thought, work, and
946 * cribbing from other shells */
947static int pipe_wait(struct pipe *pi)
948{
949 int rcode=0, i, pid, running, status;
950 running = pi->num_progs;
951 while (running) {
952 pid=waitpid(-1, &status, 0);
953 if (pid < 0) perror_msg_and_die("waitpid");
954 for (i=0; i < pi->num_progs; i++) {
955 if (pi->progs[i].pid == pid) {
956 if (i==pi->num_progs-1) rcode=WEXITSTATUS(status);
957 pi->progs[i].pid = 0;
958 running--;
959 break;
960 }
961 }
962 }
963 return rcode;
964}
965
966/* very simple version for testing */
967static void pseudo_exec(struct child_prog *child)
968{
969 int rcode;
970 struct built_in_command *x;
971 if (child->argv) {
972 /*
973 * Check if the command matches any of the builtins.
974 * Depending on context, this might be redundant. But it's
975 * easier to waste a few CPU cycles than it is to figure out
976 * if this is one of those cases.
977 */
978 for (x = bltins; x->cmd; x++) {
979 if (strcmp(child->argv[0], x->cmd) == 0 ) {
980 debug_printf("builtin exec %s\n", child->argv[0]);
981 exit(x->function(child));
982 }
983 }
Eric Andersenaac75e52001-04-30 18:18:45 +0000984
985 /* Check if the command matches any busybox internal commands
986 * ("applets") here.
987 * FIXME: This feature is not 100% safe, since
988 * BusyBox is not fully reentrant, so we have no guarantee the things
989 * from the .bss are still zeroed, or that things from .data are still
990 * at their defaults. We could exec ourself from /proc/self/exe, but I
991 * really dislike relying on /proc for things. We could exec ourself
992 * from global_argv[0], but if we are in a chroot, we may not be able
993 * to find ourself... */
994#ifdef BB_FEATURE_SH_STANDALONE_SHELL
995 {
996 int argc_l;
997 char** argv_l=child->argv;
998 char *name = child->argv[0];
999
1000#ifdef BB_FEATURE_SH_APPLETS_ALWAYS_WIN
1001 /* Following discussions from November 2000 on the busybox mailing
1002 * list, the default configuration, (without
1003 * get_last_path_component()) lets the user force use of an
1004 * external command by specifying the full (with slashes) filename.
1005 * If you enable BB_FEATURE_SH_APPLETS_ALWAYS_WIN, then applets
1006 * _aways_ override external commands, so if you want to run
1007 * /bin/cat, it will use BusyBox cat even if /bin/cat exists on the
1008 * filesystem and is _not_ busybox. Some systems may want this,
1009 * most do not. */
1010 name = get_last_path_component(name);
1011#endif
1012 /* Count argc for use in a second... */
1013 for(argc_l=0;*argv_l!=NULL; argv_l++, argc_l++);
1014 optind = 1;
1015 debug_printf("running applet %s\n", name);
1016 run_applet_by_name(name, argc_l, child->argv);
1017 exit(1);
1018 }
1019#endif
Eric Andersen25f27032001-04-26 23:22:31 +00001020 debug_printf("exec of %s\n",child->argv[0]);
1021 execvp(child->argv[0],child->argv);
1022 perror("execvp");
1023 exit(1);
1024 } else if (child->group) {
1025 debug_printf("runtime nesting to group\n");
1026 interactive=0; /* crucial!!!! */
1027 rcode = run_list_real(child->group);
1028 /* OK to leak memory by not calling run_list_test,
1029 * since this process is about to exit */
1030 exit(rcode);
1031 } else {
1032 /* Can happen. See what bash does with ">foo" by itself. */
1033 debug_printf("trying to pseudo_exec null command\n");
1034 exit(EXIT_SUCCESS);
1035 }
1036}
1037
Eric Andersenbafd94f2001-05-02 16:11:59 +00001038static void insert_bg_job(struct pipe *pi)
1039{
1040 struct pipe *thejob;
1041
1042 /* Linear search for the ID of the job to use */
1043 pi->jobid = 1;
1044 for (thejob = job_list->head; thejob; thejob = thejob->next)
1045 if (thejob->jobid >= pi->jobid)
1046 pi->jobid = thejob->jobid + 1;
1047
1048 /* add thejob to the list of running jobs */
1049 if (!job_list->head) {
1050 thejob = job_list->head = xmalloc(sizeof(*thejob));
1051 } else {
1052 for (thejob = job_list->head; thejob->next; thejob = thejob->next) /* nothing */;
1053 thejob->next = xmalloc(sizeof(*thejob));
1054 thejob = thejob->next;
1055 }
1056
1057 /* physically copy the struct job */
1058 *thejob = *pi;
1059 thejob->next = NULL;
1060 thejob->running_progs = thejob->num_progs;
1061 thejob->stopped_progs = 0;
1062
1063 /* we don't wait for background thejobs to return -- append it
1064 to the list of backgrounded thejobs and leave it alone */
1065 printf("[%d] %d\n", pi->jobid, pi->pgrp);
1066 last_bg_pid = pi->pgrp;
1067}
1068
1069/* remove a backgrounded job from a jobset */
1070static void remove_bg_job(struct pipe *pi)
1071{
1072 struct pipe *prev_pipe;
1073
1074 free_pipe(pi);
1075 if (pi == job_list->head) {
1076 job_list->head = pi->next;
1077 } else {
1078 prev_pipe = job_list->head;
1079 while (prev_pipe->next != pi)
1080 prev_pipe = prev_pipe->next;
1081 prev_pipe->next = pi->next;
1082 }
1083
1084 free(pi);
1085}
1086
1087/* free up all memory from a pipe */
1088static void free_pipe(struct pipe *pi)
1089{
1090 int i;
1091
1092 for (i = 0; i < pi->num_progs; i++) {
1093 free(pi->progs[i].argv);
1094 if (pi->progs[i].redirects)
1095 free(pi->progs[i].redirects);
1096 }
1097 if (pi->progs)
1098 free(pi->progs);
1099 if (pi->text)
1100 free(pi->text);
1101 if (pi->cmdbuf)
1102 free(pi->cmdbuf);
1103 memset(pi, 0, sizeof(struct pipe));
1104}
1105
1106/* Checks to see if any background processes have exited -- if they
1107 have, figure out why and see if a job has completed */
1108static void checkjobs()
1109{
1110 int status;
1111 int prognum = 0;
1112 struct pipe *pi;
1113 pid_t childpid;
1114
1115 while ((childpid = waitpid(-1, &status, WNOHANG | WUNTRACED)) > 0) {
1116 for (pi = job_list->head; pi; pi = pi->next) {
1117 prognum = 0;
1118 while (prognum < pi->num_progs &&
1119 pi->progs[prognum].pid != childpid) prognum++;
1120 if (prognum < pi->num_progs)
1121 break;
1122 }
1123
1124 if (WIFEXITED(status) || WIFSIGNALED(status)) {
1125 /* child exited */
1126 pi->running_progs--;
1127 pi->progs[prognum].pid = 0;
1128
1129 if (!pi->running_progs) {
1130 printf(JOB_STATUS_FORMAT, pi->jobid, "Done", pi->text);
1131 remove_bg_job(pi);
1132 }
1133 } else {
1134 /* child stopped */
1135 pi->stopped_progs++;
1136 pi->progs[prognum].is_stopped = 1;
1137
1138 if (pi->stopped_progs == pi->num_progs) {
1139 printf(JOB_STATUS_FORMAT, pi->jobid, "Stopped",
1140 pi->text);
1141 }
1142 }
1143 }
1144
1145 /* move the shell to the foreground */
1146 if (tcsetpgrp(0, getpgrp()) && errno != ENOTTY)
1147 perror_msg("tcsetpgrp");
1148
1149 if (childpid == -1 && errno != ECHILD)
1150 perror_msg("waitpid");
1151}
1152
Eric Andersen25f27032001-04-26 23:22:31 +00001153/* run_pipe_real() starts all the jobs, but doesn't wait for anything
1154 * to finish. See pipe_wait().
1155 *
1156 * return code is normally -1, when the caller has to wait for children
1157 * to finish to determine the exit status of the pipe. If the pipe
1158 * is a simple builtin command, however, the action is done by the
1159 * time run_pipe_real returns, and the exit code is provided as the
1160 * return value.
1161 *
1162 * The input of the pipe is always stdin, the output is always
1163 * stdout. The outpipe[] mechanism in BusyBox-0.48 lash is bogus,
1164 * because it tries to avoid running the command substitution in
1165 * subshell, when that is in fact necessary. The subshell process
1166 * now has its stdout directed to the input of the appropriate pipe,
1167 * so this routine is noticeably simpler.
1168 */
1169static int run_pipe_real(struct pipe *pi)
1170{
1171 int i;
1172 int nextin, nextout;
1173 int pipefds[2]; /* pipefds[0] is for reading */
1174 struct child_prog *child;
1175 struct built_in_command *x;
1176
1177 nextin = 0;
1178 pi->pgrp = 0;
1179
1180 /* Check if this is a simple builtin (not part of a pipe).
1181 * Builtins within pipes have to fork anyway, and are handled in
1182 * pseudo_exec. "echo foo | read bar" doesn't work on bash, either.
1183 */
1184 if (pi->num_progs == 1 && pi->progs[0].argv != NULL) {
1185 child = & (pi->progs[0]);
1186 if (child->group && ! child->subshell) {
1187 int squirrel[] = {-1, -1, -1};
1188 int rcode;
1189 debug_printf("non-subshell grouping\n");
1190 setup_redirects(child, squirrel);
1191 /* XXX could we merge code with following builtin case,
1192 * by creating a pseudo builtin that calls run_list_real? */
1193 rcode = run_list_real(child->group);
1194 restore_redirects(squirrel);
1195 return rcode;
1196 }
1197 for (x = bltins; x->cmd; x++) {
1198 if (strcmp(child->argv[0], x->cmd) == 0 ) {
1199 int squirrel[] = {-1, -1, -1};
1200 int rcode;
1201 debug_printf("builtin inline %s\n", child->argv[0]);
1202 /* XXX setup_redirects acts on file descriptors, not FILEs.
1203 * This is perfect for work that comes after exec().
1204 * Is it really safe for inline use? Experimentally,
1205 * things seem to work with glibc. */
1206 setup_redirects(child, squirrel);
1207 rcode = x->function(child);
1208 restore_redirects(squirrel);
1209 return rcode;
1210 }
1211 }
1212 }
1213
1214 for (i = 0; i < pi->num_progs; i++) {
1215 child = & (pi->progs[i]);
1216
1217 /* pipes are inserted between pairs of commands */
1218 if ((i + 1) < pi->num_progs) {
1219 if (pipe(pipefds)<0) perror_msg_and_die("pipe");
1220 nextout = pipefds[1];
1221 } else {
1222 nextout=1;
1223 pipefds[0] = -1;
1224 }
1225
1226 /* XXX test for failed fork()? */
1227 if (!(child->pid = fork())) {
Eric Andersenbafd94f2001-05-02 16:11:59 +00001228 signal(SIGTTOU, SIG_DFL);
1229
Eric Andersen25f27032001-04-26 23:22:31 +00001230 close_all();
1231
1232 if (nextin != 0) {
1233 dup2(nextin, 0);
1234 close(nextin);
1235 }
1236 if (nextout != 1) {
1237 dup2(nextout, 1);
1238 close(nextout);
1239 }
1240 if (pipefds[0]!=-1) {
1241 close(pipefds[0]); /* opposite end of our output pipe */
1242 }
1243
1244 /* Like bash, explicit redirects override pipes,
1245 * and the pipe fd is available for dup'ing. */
1246 setup_redirects(child,NULL);
1247
1248 pseudo_exec(child);
1249 }
1250 if (interactive) {
1251 /* Put our child in the process group whose leader is the
1252 * first process in this pipe. */
1253 if (pi->pgrp==0) {
1254 pi->pgrp = child->pid;
1255 }
1256 /* Don't check for errors. The child may be dead already,
1257 * in which case setpgid returns error code EACCES. */
1258 setpgid(child->pid, pi->pgrp);
1259 }
1260 /* In the non-interactive case, do nothing. Leave the children
1261 * with the process group that they inherited from us. */
1262
1263 if (nextin != 0)
1264 close(nextin);
1265 if (nextout != 1)
1266 close(nextout);
1267
1268 /* If there isn't another process, nextin is garbage
1269 but it doesn't matter */
1270 nextin = pipefds[0];
1271 }
1272 return -1;
1273}
1274
1275static int run_list_real(struct pipe *pi)
1276{
1277 int rcode=0;
1278 int if_code=0, next_if_code=0; /* need double-buffer to handle elif */
Eric Andersen4ed5e372001-05-01 01:49:50 +00001279 reserved_style rmode, skip_more_in_this_rmode=RES_XXXX;
Eric Andersen25f27032001-04-26 23:22:31 +00001280 for (;pi;pi=pi->next) {
1281 rmode = pi->r_mode;
Eric Andersen4ed5e372001-05-01 01:49:50 +00001282 debug_printf("rmode=%d if_code=%d next_if_code=%d skip_more=%d\n", rmode, if_code, next_if_code, skip_more_in_this_rmode);
1283 if (rmode == skip_more_in_this_rmode) continue;
1284 skip_more_in_this_rmode = RES_XXXX;
Eric Andersen25f27032001-04-26 23:22:31 +00001285 if (rmode == RES_THEN || rmode == RES_ELSE) if_code = next_if_code;
1286 if (rmode == RES_THEN && if_code) continue;
1287 if (rmode == RES_ELSE && !if_code) continue;
1288 if (rmode == RES_ELIF && !if_code) continue;
Eric Andersen4ed5e372001-05-01 01:49:50 +00001289 if (pi->num_progs == 0) continue;
Eric Andersen25f27032001-04-26 23:22:31 +00001290 rcode = run_pipe_real(pi);
1291 if (rcode!=-1) {
1292 /* We only ran a builtin: rcode was set by the return value
1293 * of run_pipe_real(), and we don't need to wait for anything. */
1294 } else if (pi->followup==PIPE_BG) {
1295 /* XXX check bash's behavior with nontrivial pipes */
1296 /* XXX compute jobid */
1297 /* XXX what does bash do with attempts to background builtins? */
Eric Andersenbafd94f2001-05-02 16:11:59 +00001298#if 0
Eric Andersen25f27032001-04-26 23:22:31 +00001299 printf("[%d] %d\n", pi->jobid, pi->pgrp);
1300 last_bg_pid = pi->pgrp;
Eric Andersenbafd94f2001-05-02 16:11:59 +00001301#endif
1302 insert_bg_job(pi);
Eric Andersen25f27032001-04-26 23:22:31 +00001303 rcode = EXIT_SUCCESS;
1304 } else {
1305 if (interactive) {
1306 /* move the new process group into the foreground */
1307 /* suppress messages when run from /linuxrc mag@sysgo.de */
Eric Andersenbafd94f2001-05-02 16:11:59 +00001308 //signal(SIGTTIN, SIG_IGN);
1309 //signal(SIGTTOU, SIG_IGN);
Eric Andersen25f27032001-04-26 23:22:31 +00001310 if (tcsetpgrp(0, pi->pgrp) && errno != ENOTTY)
1311 perror_msg("tcsetpgrp");
1312 rcode = pipe_wait(pi);
Matt Kraai1c8a59a2001-05-02 15:37:09 +00001313 if (tcsetpgrp(0, getpgrp()) && errno != ENOTTY)
Eric Andersen25f27032001-04-26 23:22:31 +00001314 perror_msg("tcsetpgrp");
Eric Andersenbafd94f2001-05-02 16:11:59 +00001315 //signal(SIGTTIN, SIG_DFL);
1316 //signal(SIGTTOU, SIG_DFL);
Eric Andersen25f27032001-04-26 23:22:31 +00001317 } else {
1318 rcode = pipe_wait(pi);
1319 }
1320 }
1321 last_return_code=rcode;
1322 if ( rmode == RES_IF || rmode == RES_ELIF )
1323 next_if_code=rcode; /* can be overwritten a number of times */
1324 if ( (rcode==EXIT_SUCCESS && pi->followup==PIPE_OR) ||
1325 (rcode!=EXIT_SUCCESS && pi->followup==PIPE_AND) )
Eric Andersen4ed5e372001-05-01 01:49:50 +00001326 skip_more_in_this_rmode=rmode;
1327 /* return rcode; */ /* XXX broken if list is part of if/then/else */
Eric Andersen25f27032001-04-26 23:22:31 +00001328 }
Eric Andersenbafd94f2001-05-02 16:11:59 +00001329 checkjobs();
Eric Andersen25f27032001-04-26 23:22:31 +00001330 return rcode;
1331}
1332
1333/* broken, of course, but OK for testing */
1334static char *indenter(int i)
1335{
1336 static char blanks[]=" ";
1337 return &blanks[sizeof(blanks)-i-1];
1338}
1339
1340/* return code is the exit status of the pipe */
1341static int run_pipe_test(struct pipe *pi, int indent)
1342{
1343 char **p;
1344 struct child_prog *child;
1345 struct redir_struct *r, *rnext;
1346 int a, i, ret_code=0;
1347 char *ind = indenter(indent);
1348 final_printf("%s run pipe: (pid %d)\n",ind,getpid());
1349 for (i=0; i<pi->num_progs; i++) {
1350 child = &pi->progs[i];
1351 final_printf("%s command %d:\n",ind,i);
1352 if (child->argv) {
1353 for (a=0,p=child->argv; *p; a++,p++) {
1354 final_printf("%s argv[%d] = %s\n",ind,a,*p);
1355 }
1356 globfree(&child->glob_result);
1357 child->argv=NULL;
1358 } else if (child->group) {
1359 final_printf("%s begin group (subshell:%d)\n",ind, child->subshell);
1360 ret_code = run_list_test(child->group,indent+3);
1361 final_printf("%s end group\n",ind);
1362 } else {
1363 final_printf("%s (nil)\n",ind);
1364 }
1365 for (r=child->redirects; r; r=rnext) {
1366 final_printf("%s redirect %d%s", ind, r->fd, redir_table[r->type].descrip);
1367 if (r->dup == -1) {
1368 final_printf(" %s\n", *r->word.gl_pathv);
1369 globfree(&r->word);
1370 } else {
1371 final_printf("&%d\n", r->dup);
1372 }
1373 rnext=r->next;
1374 free(r);
1375 }
1376 child->redirects=NULL;
1377 }
1378 free(pi->progs); /* children are an array, they get freed all at once */
1379 pi->progs=NULL;
1380 return ret_code;
1381}
1382
1383static int run_list_test(struct pipe *head, int indent)
1384{
1385 int rcode=0; /* if list has no members */
1386 struct pipe *pi, *next;
1387 char *ind = indenter(indent);
1388 for (pi=head; pi; pi=next) {
1389 if (pi->num_progs == 0) break;
1390 final_printf("%s pipe reserved mode %d\n", ind, pi->r_mode);
1391 rcode = run_pipe_test(pi, indent);
1392 final_printf("%s pipe followup code %d\n", ind, pi->followup);
1393 next=pi->next;
1394 pi->next=NULL;
1395 free(pi);
1396 }
1397 return rcode;
1398}
1399
1400/* Select which version we will use */
1401static int run_list(struct pipe *pi)
1402{
1403 int rcode=0;
1404 if (fake_mode==0) {
1405 rcode = run_list_real(pi);
1406 }
1407 /* run_list_test has the side effect of clearing memory
1408 * In the long run that function can be merged with run_list_real,
1409 * but doing that now would hobble the debugging effort. */
1410 run_list_test(pi,0);
1411 return rcode;
1412}
1413
1414/* The API for glob is arguably broken. This routine pushes a non-matching
1415 * string into the output structure, removing non-backslashed backslashes.
1416 * If someone can prove me wrong, by performing this function within the
1417 * original glob(3) api, feel free to rewrite this routine into oblivion.
1418 * Return code (0 vs. GLOB_NOSPACE) matches glob(3).
1419 * XXX broken if the last character is '\\', check that before calling.
1420 */
1421static int globhack(const char *src, int flags, glob_t *pglob)
1422{
1423 int cnt, pathc;
1424 const char *s;
1425 char *dest;
Eric Andersenbafd94f2001-05-02 16:11:59 +00001426 for (cnt=1, s=src; *s; s++) {
Eric Andersen25f27032001-04-26 23:22:31 +00001427 if (*s == '\\') s++;
1428 cnt++;
1429 }
1430 dest = malloc(cnt);
1431 if (!dest) return GLOB_NOSPACE;
1432 if (!(flags & GLOB_APPEND)) {
1433 pglob->gl_pathv=NULL;
1434 pglob->gl_pathc=0;
1435 pglob->gl_offs=0;
1436 pglob->gl_offs=0;
1437 }
1438 pathc = ++pglob->gl_pathc;
1439 pglob->gl_pathv = realloc(pglob->gl_pathv, (pathc+1)*sizeof(*pglob->gl_pathv));
1440 if (pglob->gl_pathv == NULL) return GLOB_NOSPACE;
1441 pglob->gl_pathv[pathc-1]=dest;
1442 pglob->gl_pathv[pathc]=NULL;
Eric Andersenbafd94f2001-05-02 16:11:59 +00001443 for (s=src; *s; s++, dest++) {
Eric Andersen25f27032001-04-26 23:22:31 +00001444 if (*s == '\\') s++;
1445 *dest = *s;
1446 }
1447 *dest='\0';
1448 return 0;
1449}
1450
1451/* XXX broken if the last character is '\\', check that before calling */
1452static int glob_needed(const char *s)
1453{
1454 for (; *s; s++) {
1455 if (*s == '\\') s++;
1456 if (strchr("*[?",*s)) return 1;
1457 }
1458 return 0;
1459}
1460
1461#if 0
1462static void globprint(glob_t *pglob)
1463{
1464 int i;
1465 debug_printf("glob_t at %p:\n", pglob);
1466 debug_printf(" gl_pathc=%d gl_pathv=%p gl_offs=%d gl_flags=%d\n",
1467 pglob->gl_pathc, pglob->gl_pathv, pglob->gl_offs, pglob->gl_flags);
1468 for (i=0; i<pglob->gl_pathc; i++)
1469 debug_printf("pglob->gl_pathv[%d] = %p = %s\n", i,
1470 pglob->gl_pathv[i], pglob->gl_pathv[i]);
1471}
1472#endif
1473
1474static int xglob(o_string *dest, int flags, glob_t *pglob)
1475{
1476 int gr;
1477
1478 /* short-circuit for null word */
1479 /* we can code this better when the debug_printf's are gone */
1480 if (dest->length == 0) {
1481 if (dest->nonnull) {
1482 /* bash man page calls this an "explicit" null */
1483 gr = globhack(dest->data, flags, pglob);
1484 debug_printf("globhack returned %d\n",gr);
1485 } else {
1486 return 0;
1487 }
1488 } else if (glob_needed(dest->data)) {
1489 gr = glob(dest->data, flags, NULL, pglob);
1490 debug_printf("glob returned %d\n",gr);
1491 if (gr == GLOB_NOMATCH) {
1492 /* quote removal, or more accurately, backslash removal */
1493 gr = globhack(dest->data, flags, pglob);
1494 debug_printf("globhack returned %d\n",gr);
1495 }
1496 } else {
1497 gr = globhack(dest->data, flags, pglob);
1498 debug_printf("globhack returned %d\n",gr);
1499 }
1500 if (gr == GLOB_NOSPACE) {
1501 fprintf(stderr,"out of memory during glob\n");
1502 exit(1);
1503 }
1504 if (gr != 0) { /* GLOB_ABORTED ? */
1505 fprintf(stderr,"glob(3) error %d\n",gr);
1506 }
1507 /* globprint(glob_target); */
1508 return gr;
1509}
1510
1511/* the src parameter allows us to peek forward to a possible &n syntax
1512 * for file descriptor duplication, e.g., "2>&1".
1513 * Return code is 0 normally, 1 if a syntax error is detected in src.
1514 * Resource errors (in xmalloc) cause the process to exit */
1515static int setup_redirect(struct p_context *ctx, int fd, redir_type style,
1516 struct in_str *input)
1517{
1518 struct child_prog *child=ctx->child;
1519 struct redir_struct *redir = child->redirects;
1520 struct redir_struct *last_redir=NULL;
1521
1522 /* Create a new redir_struct and drop it onto the end of the linked list */
1523 while(redir) {
1524 last_redir=redir;
1525 redir=redir->next;
1526 }
1527 redir = xmalloc(sizeof(struct redir_struct));
1528 redir->next=NULL;
1529 if (last_redir) {
1530 last_redir->next=redir;
1531 } else {
1532 child->redirects=redir;
1533 }
1534
1535 redir->type=style;
1536 redir->fd= (fd==-1) ? redir_table[style].default_fd : fd ;
1537
1538 debug_printf("Redirect type %d%s\n", redir->fd, redir_table[style].descrip);
1539
1540 /* Check for a '2>&1' type redirect */
1541 redir->dup = redirect_dup_num(input);
1542 if (redir->dup == -2) return 1; /* syntax error */
1543 if (redir->dup != -1) {
1544 /* Erik had a check here that the file descriptor in question
1545 * is legit; I postpone that to "run time" */
1546 debug_printf("Duplicating redirect '%d>&%d'\n", redir->fd, redir->dup);
1547 } else {
1548 /* We do _not_ try to open the file that src points to,
1549 * since we need to return and let src be expanded first.
1550 * Set ctx->pending_redirect, so we know what to do at the
1551 * end of the next parsed word.
1552 */
1553 ctx->pending_redirect = redir;
1554 }
1555 return 0;
1556}
1557
1558struct pipe *new_pipe(void) {
1559 struct pipe *pi;
1560 pi = xmalloc(sizeof(struct pipe));
1561 pi->num_progs = 0;
1562 pi->progs = NULL;
1563 pi->next = NULL;
1564 pi->followup = 0; /* invalid */
1565 return pi;
1566}
1567
1568static void initialize_context(struct p_context *ctx)
1569{
1570 ctx->pipe=NULL;
1571 ctx->pending_redirect=NULL;
1572 ctx->child=NULL;
1573 ctx->list_head=new_pipe();
1574 ctx->pipe=ctx->list_head;
1575 ctx->w=RES_NONE;
1576 ctx->stack=NULL;
1577 done_command(ctx); /* creates the memory for working child */
1578}
1579
1580/* normal return is 0
1581 * if a reserved word is found, and processed, return 1
1582 * should handle if, then, elif, else, fi, for, while, until, do, done.
1583 * case, function, and select are obnoxious, save those for later.
1584 */
1585int reserved_word(o_string *dest, struct p_context *ctx)
1586{
1587 struct reserved_combo {
1588 char *literal;
1589 int code;
1590 long flag;
1591 };
1592 /* Mostly a list of accepted follow-up reserved words.
1593 * FLAG_END means we are done with the sequence, and are ready
1594 * to turn the compound list into a command.
1595 * FLAG_START means the word must start a new compound list.
1596 */
1597 static struct reserved_combo reserved_list[] = {
1598 { "if", RES_IF, FLAG_THEN | FLAG_START },
1599 { "then", RES_THEN, FLAG_ELIF | FLAG_ELSE | FLAG_FI },
1600 { "elif", RES_ELIF, FLAG_THEN },
1601 { "else", RES_ELSE, FLAG_FI },
1602 { "fi", RES_FI, FLAG_END },
1603 { "for", RES_FOR, FLAG_DO | FLAG_START },
1604 { "while", RES_WHILE, FLAG_DO | FLAG_START },
1605 { "until", RES_UNTIL, FLAG_DO | FLAG_START },
1606 { "do", RES_DO, FLAG_DONE },
1607 { "done", RES_DONE, FLAG_END }
1608 };
1609 struct reserved_combo *r;
1610 for (r=reserved_list;
1611#define NRES sizeof(reserved_list)/sizeof(struct reserved_combo)
1612 r<reserved_list+NRES; r++) {
1613 if (strcmp(dest->data, r->literal) == 0) {
1614 debug_printf("found reserved word %s, code %d\n",r->literal,r->code);
1615 if (r->flag & FLAG_START) {
1616 struct p_context *new = xmalloc(sizeof(struct p_context));
1617 debug_printf("push stack\n");
1618 *new = *ctx; /* physical copy */
1619 initialize_context(ctx);
1620 ctx->stack=new;
1621 } else if ( ctx->w == RES_NONE || ! (ctx->old_flag & (1<<r->code))) {
Eric Andersenaf44a0e2001-04-27 07:26:12 +00001622 syntax();
1623 ctx->w = RES_SNTX;
1624 b_reset (dest);
1625 return 1;
Eric Andersen25f27032001-04-26 23:22:31 +00001626 }
1627 ctx->w=r->code;
1628 ctx->old_flag = r->flag;
1629 if (ctx->old_flag & FLAG_END) {
1630 struct p_context *old;
1631 debug_printf("pop stack\n");
1632 old = ctx->stack;
1633 old->child->group = ctx->list_head;
1634 *ctx = *old; /* physical copy */
1635 free(old);
1636 ctx->w=RES_NONE;
1637 }
1638 b_reset (dest);
1639 return 1;
1640 }
1641 }
1642 return 0;
1643}
1644
1645/* normal return is 0.
1646 * Syntax or xglob errors return 1. */
1647static int done_word(o_string *dest, struct p_context *ctx)
1648{
1649 struct child_prog *child=ctx->child;
1650 glob_t *glob_target;
1651 int gr, flags = 0;
1652
1653 debug_printf("done_word: %s %p\n", dest->data, child);
1654 if (dest->length == 0 && !dest->nonnull) {
1655 debug_printf(" true null, ignored\n");
1656 return 0;
1657 }
1658 if (ctx->pending_redirect) {
1659 glob_target = &ctx->pending_redirect->word;
1660 } else {
1661 if (child->group) {
1662 syntax();
1663 return 1; /* syntax error, groups and arglists don't mix */
1664 }
1665 if (!child->argv) {
1666 debug_printf("checking %s for reserved-ness\n",dest->data);
Eric Andersenaf44a0e2001-04-27 07:26:12 +00001667 if (reserved_word(dest,ctx)) return ctx->w==RES_SNTX;
Eric Andersen25f27032001-04-26 23:22:31 +00001668 }
1669 glob_target = &child->glob_result;
1670 if (child->argv) flags |= GLOB_APPEND;
1671 }
1672 gr = xglob(dest, flags, glob_target);
1673 if (gr != 0) return 1;
1674
1675 b_reset(dest);
1676 if (ctx->pending_redirect) {
1677 ctx->pending_redirect=NULL;
1678 if (glob_target->gl_pathc != 1) {
1679 fprintf(stderr, "ambiguous redirect\n");
1680 return 1;
1681 }
1682 } else {
1683 child->argv = glob_target->gl_pathv;
1684 }
1685 return 0;
1686}
1687
1688/* The only possible error here is out of memory, in which case
1689 * xmalloc exits. */
1690static int done_command(struct p_context *ctx)
1691{
1692 /* The child is really already in the pipe structure, so
1693 * advance the pipe counter and make a new, null child.
1694 * Only real trickiness here is that the uncommitted
1695 * child structure, to which ctx->child points, is not
1696 * counted in pi->num_progs. */
1697 struct pipe *pi=ctx->pipe;
1698 struct child_prog *prog=ctx->child;
1699
1700 if (prog && prog->group == NULL
1701 && prog->argv == NULL
1702 && prog->redirects == NULL) {
1703 debug_printf("done_command: skipping null command\n");
1704 return 0;
1705 } else if (prog) {
1706 pi->num_progs++;
1707 debug_printf("done_command: num_progs incremented to %d\n",pi->num_progs);
1708 } else {
1709 debug_printf("done_command: initializing\n");
1710 }
1711 pi->progs = xrealloc(pi->progs, sizeof(*pi->progs) * (pi->num_progs+1));
1712
1713 prog = pi->progs + pi->num_progs;
1714 prog->redirects = NULL;
1715 prog->argv = NULL;
1716 prog->is_stopped = 0;
1717 prog->group = NULL;
1718 prog->glob_result.gl_pathv = NULL;
1719 prog->family = pi;
1720
1721 ctx->child=prog;
1722 /* but ctx->pipe and ctx->list_head remain unchanged */
1723 return 0;
1724}
1725
1726static int done_pipe(struct p_context *ctx, pipe_style type)
1727{
1728 struct pipe *new_p;
1729 done_command(ctx); /* implicit closure of previous command */
1730 debug_printf("done_pipe, type %d\n", type);
1731 ctx->pipe->followup = type;
1732 ctx->pipe->r_mode = ctx->w;
1733 new_p=new_pipe();
1734 ctx->pipe->next = new_p;
1735 ctx->pipe = new_p;
1736 ctx->child = NULL;
1737 done_command(ctx); /* set up new pipe to accept commands */
1738 return 0;
1739}
1740
1741/* peek ahead in the in_str to find out if we have a "&n" construct,
1742 * as in "2>&1", that represents duplicating a file descriptor.
1743 * returns either -2 (syntax error), -1 (no &), or the number found.
1744 */
1745static int redirect_dup_num(struct in_str *input)
1746{
1747 int ch, d=0, ok=0;
1748 ch = b_peek(input);
1749 if (ch != '&') return -1;
1750
1751 b_getch(input); /* get the & */
1752 while (ch=b_peek(input),isdigit(ch)) {
1753 d = d*10+(ch-'0');
1754 ok=1;
1755 b_getch(input);
1756 }
1757 if (ok) return d;
1758
1759 fprintf(stderr, "ambiguous redirect\n");
1760 return -2;
1761}
1762
1763/* If a redirect is immediately preceded by a number, that number is
1764 * supposed to tell which file descriptor to redirect. This routine
1765 * looks for such preceding numbers. In an ideal world this routine
1766 * needs to handle all the following classes of redirects...
1767 * echo 2>foo # redirects fd 2 to file "foo", nothing passed to echo
1768 * echo 49>foo # redirects fd 49 to file "foo", nothing passed to echo
1769 * echo -2>foo # redirects fd 1 to file "foo", "-2" passed to echo
1770 * echo 49x>foo # redirects fd 1 to file "foo", "49x" passed to echo
1771 * A -1 output from this program means no valid number was found, so the
1772 * caller should use the appropriate default for this redirection.
1773 */
1774static int redirect_opt_num(o_string *o)
1775{
1776 int num;
1777
1778 if (o->length==0) return -1;
1779 for(num=0; num<o->length; num++) {
1780 if (!isdigit(*(o->data+num))) {
1781 return -1;
1782 }
1783 }
1784 /* reuse num (and save an int) */
1785 num=atoi(o->data);
1786 b_reset(o);
1787 return num;
1788}
1789
1790FILE *generate_stream_from_list(struct pipe *head)
1791{
1792 FILE *pf;
1793#if 1
1794 int pid, channel[2];
1795 if (pipe(channel)<0) perror_msg_and_die("pipe");
1796 pid=fork();
1797 if (pid<0) {
1798 perror_msg_and_die("fork");
1799 } else if (pid==0) {
1800 close(channel[0]);
1801 if (channel[1] != 1) {
1802 dup2(channel[1],1);
1803 close(channel[1]);
1804 }
1805#if 0
1806#define SURROGATE "surrogate response"
1807 write(1,SURROGATE,sizeof(SURROGATE));
1808 exit(run_list(head));
1809#else
1810 exit(run_list_real(head)); /* leaks memory */
1811#endif
1812 }
1813 debug_printf("forked child %d\n",pid);
1814 close(channel[1]);
1815 pf = fdopen(channel[0],"r");
1816 debug_printf("pipe on FILE *%p\n",pf);
1817#else
1818 run_list_test(head,0);
1819 pf=popen("echo surrogate response","r");
1820 debug_printf("started fake pipe on FILE *%p\n",pf);
1821#endif
1822 return pf;
1823}
1824
1825/* this version hacked for testing purposes */
1826/* return code is exit status of the process that is run. */
1827static int process_command_subs(o_string *dest, struct p_context *ctx, struct in_str *input, int subst_end)
1828{
1829 int retcode;
1830 o_string result=NULL_O_STRING;
1831 struct p_context inner;
1832 FILE *p;
1833 struct in_str pipe_str;
1834 initialize_context(&inner);
1835
1836 /* recursion to generate command */
1837 retcode = parse_stream(&result, &inner, input, subst_end);
1838 if (retcode != 0) return retcode; /* syntax error or EOF */
1839 done_word(&result, &inner);
1840 done_pipe(&inner, PIPE_SEQ);
1841 b_free(&result);
1842
1843 p=generate_stream_from_list(inner.list_head);
1844 if (p==NULL) return 1;
1845 mark_open(fileno(p));
1846 setup_file_in_str(&pipe_str, p);
1847
1848 /* now send results of command back into original context */
1849 retcode = parse_stream(dest, ctx, &pipe_str, '\0');
1850 /* XXX In case of a syntax error, should we try to kill the child?
1851 * That would be tough to do right, so just read until EOF. */
1852 if (retcode == 1) {
1853 while (b_getch(&pipe_str)!=EOF) { /* discard */ };
1854 }
1855
1856 debug_printf("done reading from pipe, pclose()ing\n");
1857 /* This is the step that wait()s for the child. Should be pretty
1858 * safe, since we just read an EOF from its stdout. We could try
1859 * to better, by using wait(), and keeping track of background jobs
1860 * at the same time. That would be a lot of work, and contrary
1861 * to the KISS philosophy of this program. */
1862 mark_closed(fileno(p));
1863 retcode=pclose(p);
1864 debug_printf("pclosed, retcode=%d\n",retcode);
1865 /* XXX this process fails to trim a single trailing newline */
1866 return retcode;
1867}
1868
1869static int parse_group(o_string *dest, struct p_context *ctx,
1870 struct in_str *input, int ch)
1871{
1872 int rcode, endch=0;
1873 struct p_context sub;
1874 struct child_prog *child = ctx->child;
1875 if (child->argv) {
1876 syntax();
1877 return 1; /* syntax error, groups and arglists don't mix */
1878 }
1879 initialize_context(&sub);
1880 switch(ch) {
1881 case '(': endch=')'; child->subshell=1; break;
1882 case '{': endch='}'; break;
1883 default: syntax(); /* really logic error */
1884 }
1885 rcode=parse_stream(dest,&sub,input,endch);
1886 done_word(dest,&sub); /* finish off the final word in the subcontext */
1887 done_pipe(&sub, PIPE_SEQ); /* and the final command there, too */
1888 child->group = sub.list_head;
1889 return rcode;
1890 /* child remains "open", available for possible redirects */
1891}
1892
1893/* basically useful version until someone wants to get fancier,
1894 * see the bash man page under "Parameter Expansion" */
1895static void lookup_param(o_string *dest, struct p_context *ctx, o_string *src)
1896{
1897 const char *p=NULL;
1898 if (src->data) p = getenv(src->data);
1899 if (p) parse_string(dest, ctx, p); /* recursion */
1900 b_free(src);
1901}
1902
1903/* return code: 0 for OK, 1 for syntax error */
1904static int handle_dollar(o_string *dest, struct p_context *ctx, struct in_str *input)
1905{
1906 int i, advance=0;
1907 o_string alt=NULL_O_STRING;
1908 char sep[]=" ";
1909 int ch = input->peek(input); /* first character after the $ */
1910 debug_printf("handle_dollar: ch=%c\n",ch);
1911 if (isalpha(ch)) {
1912 while(ch=b_peek(input),isalnum(ch) || ch=='_') {
1913 b_getch(input);
1914 b_addchr(&alt,ch);
1915 }
1916 lookup_param(dest, ctx, &alt);
1917 } else if (isdigit(ch)) {
1918 i = ch-'0'; /* XXX is $0 special? */
1919 if (i<global_argc) {
1920 parse_string(dest, ctx, global_argv[i]); /* recursion */
1921 }
1922 advance = 1;
1923 } else switch (ch) {
1924 case '$':
1925 b_adduint(dest,getpid());
1926 advance = 1;
1927 break;
1928 case '!':
1929 if (last_bg_pid > 0) b_adduint(dest, last_bg_pid);
1930 advance = 1;
1931 break;
1932 case '?':
1933 b_adduint(dest,last_return_code);
1934 advance = 1;
1935 break;
1936 case '#':
1937 b_adduint(dest,global_argc ? global_argc-1 : 0);
1938 advance = 1;
1939 break;
1940 case '{':
1941 b_getch(input);
1942 /* XXX maybe someone will try to escape the '}' */
1943 while(ch=b_getch(input),ch!=EOF && ch!='}') {
1944 b_addchr(&alt,ch);
1945 }
1946 if (ch != '}') {
1947 syntax();
1948 return 1;
1949 }
1950 lookup_param(dest, ctx, &alt);
1951 break;
1952 case '(':
Matt Kraai9f8caf12001-05-02 16:26:12 +00001953 b_getch(input);
Eric Andersen25f27032001-04-26 23:22:31 +00001954 process_command_subs(dest, ctx, input, ')');
1955 break;
1956 case '*':
1957 sep[0]=ifs[0];
1958 for (i=1; i<global_argc; i++) {
1959 parse_string(dest, ctx, global_argv[i]);
1960 if (i+1 < global_argc) parse_string(dest, ctx, sep);
1961 }
1962 break;
1963 case '@':
1964 case '-':
1965 case '_':
1966 /* still unhandled, but should be eventually */
1967 fprintf(stderr,"unhandled syntax: $%c\n",ch);
1968 return 1;
1969 break;
1970 default:
1971 b_addqchr(dest,'$',dest->quote);
1972 }
1973 /* Eat the character if the flag was set. If the compiler
1974 * is smart enough, we could substitute "b_getch(input);"
1975 * for all the "advance = 1;" above, and also end up with
1976 * a nice size-optimized program. Hah! That'll be the day.
1977 */
1978 if (advance) b_getch(input);
1979 return 0;
1980}
1981
1982int parse_string(o_string *dest, struct p_context *ctx, const char *src)
1983{
1984 struct in_str foo;
1985 setup_string_in_str(&foo, src);
1986 return parse_stream(dest, ctx, &foo, '\0');
1987}
1988
1989/* return code is 0 for normal exit, 1 for syntax error */
1990int parse_stream(o_string *dest, struct p_context *ctx,
1991 struct in_str *input, int end_trigger)
1992{
1993 unsigned int ch, m;
1994 int redir_fd;
1995 redir_type redir_style;
1996 int next;
1997
1998 /* Only double-quote state is handled in the state variable dest->quote.
1999 * A single-quote triggers a bypass of the main loop until its mate is
2000 * found. When recursing, quote state is passed in via dest->quote. */
2001
2002 debug_printf("parse_stream, end_trigger=%d\n",end_trigger);
2003 while ((ch=b_getch(input))!=EOF) {
2004 m = map[ch];
2005 next = (ch == '\n') ? 0 : b_peek(input);
2006 debug_printf("parse_stream: ch=%c (%d) m=%d quote=%d\n",
2007 ch,ch,m,dest->quote);
2008 if (m==0 || ((m==1 || m==2) && dest->quote)) {
2009 b_addqchr(dest, ch, dest->quote);
Eric Andersenaac75e52001-04-30 18:18:45 +00002010 } else {
2011 if (m==2) { /* unquoted IFS */
2012 done_word(dest, ctx);
2013 if (ch=='\n') done_pipe(ctx,PIPE_SEQ);
2014 }
Eric Andersenaf44a0e2001-04-27 07:26:12 +00002015 if (ch == end_trigger && !dest->quote && ctx->w==RES_NONE) {
Eric Andersenaac75e52001-04-30 18:18:45 +00002016 debug_printf("leaving parse_stream\n");
Eric Andersenaf44a0e2001-04-27 07:26:12 +00002017 return 0;
2018 }
Eric Andersen25f27032001-04-26 23:22:31 +00002019#if 0
2020 if (ch=='\n') {
2021 /* Yahoo! Time to run with it! */
2022 done_pipe(ctx,PIPE_SEQ);
2023 run_list(ctx->list_head);
2024 initialize_context(ctx);
2025 }
2026#endif
Eric Andersenaac75e52001-04-30 18:18:45 +00002027 if (m!=2) switch (ch) {
Eric Andersen25f27032001-04-26 23:22:31 +00002028 case '#':
2029 if (dest->length == 0 && !dest->quote) {
2030 while(ch=b_peek(input),ch!=EOF && ch!='\n') { b_getch(input); }
2031 } else {
2032 b_addqchr(dest, ch, dest->quote);
2033 }
2034 break;
2035 case '\\':
2036 if (next == EOF) {
2037 syntax();
2038 return 1;
2039 }
2040 b_addqchr(dest, '\\', dest->quote);
2041 b_addqchr(dest, b_getch(input), dest->quote);
2042 break;
2043 case '$':
2044 if (handle_dollar(dest, ctx, input)!=0) return 1;
2045 break;
2046 case '\'':
2047 dest->nonnull = 1;
2048 while(ch=b_getch(input),ch!=EOF && ch!='\'') {
2049 b_addchr(dest,ch);
2050 }
2051 if (ch==EOF) {
2052 syntax();
2053 return 1;
2054 }
2055 break;
2056 case '"':
2057 dest->nonnull = 1;
2058 dest->quote = !dest->quote;
2059 break;
2060 case '`':
2061 process_command_subs(dest, ctx, input, '`');
2062 break;
2063 case '>':
2064 redir_fd = redirect_opt_num(dest);
2065 done_word(dest, ctx);
2066 redir_style=REDIRECT_OVERWRITE;
2067 if (next == '>') {
2068 redir_style=REDIRECT_APPEND;
2069 b_getch(input);
2070 } else if (next == '(') {
2071 syntax(); /* until we support >(list) Process Substitution */
2072 return 1;
2073 }
2074 setup_redirect(ctx, redir_fd, redir_style, input);
2075 break;
2076 case '<':
2077 redir_fd = redirect_opt_num(dest);
2078 done_word(dest, ctx);
2079 redir_style=REDIRECT_INPUT;
2080 if (next == '<') {
2081 redir_style=REDIRECT_HEREIS;
2082 b_getch(input);
2083 } else if (next == '>') {
2084 redir_style=REDIRECT_IO;
2085 b_getch(input);
2086 } else if (next == '(') {
2087 syntax(); /* until we support <(list) Process Substitution */
2088 return 1;
2089 }
2090 setup_redirect(ctx, redir_fd, redir_style, input);
2091 break;
2092 case ';':
2093 done_word(dest, ctx);
2094 done_pipe(ctx,PIPE_SEQ);
2095 break;
2096 case '&':
2097 done_word(dest, ctx);
2098 if (next=='&') {
2099 b_getch(input);
2100 done_pipe(ctx,PIPE_AND);
2101 } else {
2102 done_pipe(ctx,PIPE_BG);
2103 }
2104 break;
2105 case '|':
2106 done_word(dest, ctx);
2107 if (next=='|') {
2108 b_getch(input);
2109 done_pipe(ctx,PIPE_OR);
2110 } else {
2111 /* we could pick up a file descriptor choice here
2112 * with redirect_opt_num(), but bash doesn't do it.
2113 * "echo foo 2| cat" yields "foo 2". */
2114 done_command(ctx);
2115 }
2116 break;
2117 case '(':
2118 case '{':
2119 if (parse_group(dest, ctx, input, ch)!=0) return 1;
2120 break;
2121 case ')':
2122 case '}':
2123 syntax(); /* Proper use of this character caught by end_trigger */
2124 return 1;
2125 break;
2126 default:
2127 syntax(); /* this is really an internal logic error */
2128 return 1;
Eric Andersenaac75e52001-04-30 18:18:45 +00002129 }
Eric Andersen25f27032001-04-26 23:22:31 +00002130 }
2131 }
2132 /* complain if quote? No, maybe we just finished a command substitution
2133 * that was quoted. Example:
2134 * $ echo "`cat foo` plus more"
2135 * and we just got the EOF generated by the subshell that ran "cat foo"
2136 * The only real complaint is if we got an EOF when end_trigger != '\0',
2137 * that is, we were really supposed to get end_trigger, and never got
2138 * one before the EOF. Can't use the standard "syntax error" return code,
2139 * so that parse_stream_outer can distinguish the EOF and exit smoothly. */
2140 if (end_trigger != '\0') return -1;
2141 return 0;
2142}
2143
2144void mapset(const unsigned char *set, int code)
2145{
2146 const unsigned char *s;
2147 for (s=set; *s; s++) map[*s] = code;
2148}
2149
2150void update_ifs_map(void)
2151{
2152 /* char *ifs and char map[256] are both globals. */
2153 ifs = getenv("IFS");
2154 if (ifs == NULL) ifs=" \t\n";
2155 /* Precompute a list of 'flow through' behavior so it can be treated
2156 * quickly up front. Computation is necessary because of IFS.
2157 * Special case handling of IFS == " \t\n" is not implemented.
2158 * The map[] array only really needs two bits each, and on most machines
2159 * that would be faster because of the reduced L1 cache footprint.
2160 */
2161 memset(map,0,256); /* most characters flow through always */
2162 mapset("\\$'\"`", 3); /* never flow through */
2163 mapset("<>;&|(){}#", 1); /* flow through if quoted */
2164 mapset(ifs, 2); /* also flow through if quoted */
2165}
2166
2167/* most recursion does not come through here, the exeception is
2168 * from builtin_source() */
2169int parse_stream_outer(struct in_str *inp)
2170{
2171
2172 struct p_context ctx;
2173 o_string temp=NULL_O_STRING;
2174 int rcode;
2175 do {
2176 initialize_context(&ctx);
2177 update_ifs_map();
2178 inp->promptmode=1;
2179 rcode = parse_stream(&temp, &ctx, inp, '\n');
2180 done_word(&temp, &ctx);
2181 done_pipe(&ctx,PIPE_SEQ);
2182 run_list(ctx.list_head);
2183 } while (rcode != -1); /* loop on syntax errors, return on EOF */
2184 return 0;
2185}
2186
2187static int parse_string_outer(const char *s)
2188{
2189 struct in_str input;
2190 setup_string_in_str(&input, s);
2191 return parse_stream_outer(&input);
2192}
2193
2194static int parse_file_outer(FILE *f)
2195{
2196 int rcode;
2197 struct in_str input;
2198 setup_file_in_str(&input, f);
2199 rcode = parse_stream_outer(&input);
2200 return rcode;
2201}
2202
2203int shell_main(int argc, char **argv)
2204{
2205 int opt;
2206 FILE *input;
Eric Andersenbafd94f2001-05-02 16:11:59 +00002207 struct jobset joblist_end = { NULL, NULL };
2208 job_list = &joblist_end;
Eric Andersen25f27032001-04-26 23:22:31 +00002209
Eric Andersene67c3ce2001-05-02 02:09:36 +00002210 last_return_code=EXIT_SUCCESS;
2211
Eric Andersen25f27032001-04-26 23:22:31 +00002212 /* XXX what should these be while sourcing /etc/profile? */
2213 global_argc = argc;
2214 global_argv = argv;
2215
Eric Andersenbafd94f2001-05-02 16:11:59 +00002216 /* don't pay any attention to this signal; it just confuses
2217 things and isn't really meant for shells anyway */
2218 signal(SIGTTOU, SIG_IGN);
2219
Eric Andersen25f27032001-04-26 23:22:31 +00002220 if (argv[0] && argv[0][0] == '-') {
2221 debug_printf("\nsourcing /etc/profile\n");
2222 input = xfopen("/etc/profile", "r");
2223 mark_open(fileno(input));
2224 parse_file_outer(input);
2225 mark_closed(fileno(input));
2226 fclose(input);
2227 }
2228 input=stdin;
2229
2230 /* initialize the cwd -- this is never freed...*/
2231 cwd = xgetcwd(0);
2232#ifdef BB_FEATURE_COMMAND_EDITING
2233 cmdedit_set_initial_prompt();
2234#else
2235 PS1 = NULL;
2236#endif
2237
2238 while ((opt = getopt(argc, argv, "c:xif")) > 0) {
2239 switch (opt) {
2240 case 'c':
2241 {
2242 global_argv = argv+optind;
2243 global_argc = argc-optind;
2244 opt = parse_string_outer(optarg);
Eric Andersene67c3ce2001-05-02 02:09:36 +00002245 goto final_return;
Eric Andersen25f27032001-04-26 23:22:31 +00002246 }
2247 break;
2248 case 'i':
2249 interactive++;
2250 break;
2251 case 'f':
2252 fake_mode++;
2253 break;
2254 default:
2255 fprintf(stderr, "Usage: sh [FILE]...\n"
2256 " or: sh -c command [args]...\n\n");
2257 exit(EXIT_FAILURE);
2258 }
2259 }
2260 /* A shell is interactive if the `-i' flag was given, or if all of
2261 * the following conditions are met:
2262 * no -c command
2263 * no arguments remaining or the -s flag given
2264 * standard input is a terminal
2265 * standard output is a terminal
2266 * Refer to Posix.2, the description of the `sh' utility. */
2267 if (argv[optind]==NULL && input==stdin &&
2268 isatty(fileno(stdin)) && isatty(fileno(stdout))) {
2269 interactive++;
2270 }
Eric Andersene67c3ce2001-05-02 02:09:36 +00002271
2272 debug_printf("\ninteractive=%d\n", interactive);
Eric Andersen25f27032001-04-26 23:22:31 +00002273 if (interactive) {
2274 /* Looks like they want an interactive shell */
2275 fprintf(stdout, "\nhush -- the humble shell v0.01 (testing)\n\n");
Eric Andersene67c3ce2001-05-02 02:09:36 +00002276 opt=parse_file_outer(stdin);
2277 goto final_return;
Eric Andersen25f27032001-04-26 23:22:31 +00002278 }
Eric Andersen25f27032001-04-26 23:22:31 +00002279
2280 debug_printf("\nrunning script '%s'\n", argv[optind]);
2281 global_argv = argv+optind;
2282 global_argc = argc-optind;
2283 input = xfopen(argv[optind], "r");
2284 opt = parse_file_outer(input);
2285
2286#ifdef BB_FEATURE_CLEAN_UP
2287 fclose(input.file);
2288#endif
2289
Eric Andersene67c3ce2001-05-02 02:09:36 +00002290final_return:
2291 return(opt?opt:last_return_code);
Eric Andersen25f27032001-04-26 23:22:31 +00002292}