exec.c revision 1.18 1 1.18 christos /* $NetBSD: exec.c,v 1.18 1996/06/25 16:40:38 christos Exp $ */
2 1.15 cgd
3 1.1 cgd /*-
4 1.8 jtc * Copyright (c) 1991, 1993
5 1.8 jtc * The Regents of the University of California. All rights reserved.
6 1.1 cgd *
7 1.1 cgd * This code is derived from software contributed to Berkeley by
8 1.1 cgd * Kenneth Almquist.
9 1.1 cgd *
10 1.1 cgd * Redistribution and use in source and binary forms, with or without
11 1.1 cgd * modification, are permitted provided that the following conditions
12 1.1 cgd * are met:
13 1.1 cgd * 1. Redistributions of source code must retain the above copyright
14 1.1 cgd * notice, this list of conditions and the following disclaimer.
15 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
16 1.1 cgd * notice, this list of conditions and the following disclaimer in the
17 1.1 cgd * documentation and/or other materials provided with the distribution.
18 1.1 cgd * 3. All advertising materials mentioning features or use of this software
19 1.1 cgd * must display the following acknowledgement:
20 1.1 cgd * This product includes software developed by the University of
21 1.1 cgd * California, Berkeley and its contributors.
22 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
23 1.1 cgd * may be used to endorse or promote products derived from this software
24 1.1 cgd * without specific prior written permission.
25 1.1 cgd *
26 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
27 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
30 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
31 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 1.1 cgd * SUCH DAMAGE.
37 1.1 cgd */
38 1.1 cgd
39 1.1 cgd #ifndef lint
40 1.15 cgd #if 0
41 1.17 christos static char sccsid[] = "@(#)exec.c 8.4 (Berkeley) 6/8/95";
42 1.15 cgd #else
43 1.18 christos static char rcsid[] = "$NetBSD: exec.c,v 1.18 1996/06/25 16:40:38 christos Exp $";
44 1.15 cgd #endif
45 1.1 cgd #endif /* not lint */
46 1.1 cgd
47 1.16 christos #include <sys/types.h>
48 1.16 christos #include <sys/stat.h>
49 1.16 christos #include <unistd.h>
50 1.16 christos #include <fcntl.h>
51 1.16 christos #include <errno.h>
52 1.16 christos #include <stdlib.h>
53 1.16 christos
54 1.1 cgd /*
55 1.1 cgd * When commands are first encountered, they are entered in a hash table.
56 1.1 cgd * This ensures that a full path search will not have to be done for them
57 1.1 cgd * on each invocation.
58 1.1 cgd *
59 1.1 cgd * We should investigate converting to a linear search, even though that
60 1.1 cgd * would make the command name "hash" a misnomer.
61 1.1 cgd */
62 1.1 cgd
63 1.1 cgd #include "shell.h"
64 1.1 cgd #include "main.h"
65 1.1 cgd #include "nodes.h"
66 1.1 cgd #include "parser.h"
67 1.1 cgd #include "redir.h"
68 1.1 cgd #include "eval.h"
69 1.1 cgd #include "exec.h"
70 1.1 cgd #include "builtins.h"
71 1.1 cgd #include "var.h"
72 1.1 cgd #include "options.h"
73 1.1 cgd #include "input.h"
74 1.1 cgd #include "output.h"
75 1.1 cgd #include "syntax.h"
76 1.1 cgd #include "memalloc.h"
77 1.1 cgd #include "error.h"
78 1.1 cgd #include "init.h"
79 1.1 cgd #include "mystring.h"
80 1.16 christos #include "show.h"
81 1.8 jtc #include "jobs.h"
82 1.1 cgd
83 1.1 cgd
84 1.1 cgd #define CMDTABLESIZE 31 /* should be prime */
85 1.1 cgd #define ARB 1 /* actual size determined at run time */
86 1.1 cgd
87 1.1 cgd
88 1.1 cgd
89 1.1 cgd struct tblentry {
90 1.1 cgd struct tblentry *next; /* next entry in hash chain */
91 1.1 cgd union param param; /* definition of builtin function */
92 1.1 cgd short cmdtype; /* index identifying command */
93 1.1 cgd char rehash; /* if set, cd done since entry created */
94 1.1 cgd char cmdname[ARB]; /* name of command */
95 1.1 cgd };
96 1.1 cgd
97 1.1 cgd
98 1.1 cgd STATIC struct tblentry *cmdtable[CMDTABLESIZE];
99 1.1 cgd STATIC int builtinloc = -1; /* index in path of %builtin, or -1 */
100 1.1 cgd
101 1.1 cgd
102 1.16 christos STATIC void tryexec __P((char *, char **, char **));
103 1.16 christos STATIC void execinterp __P((char **, char **));
104 1.16 christos STATIC void printentry __P((struct tblentry *, int));
105 1.16 christos STATIC void clearcmdentry __P((int));
106 1.16 christos STATIC struct tblentry *cmdlookup __P((char *, int));
107 1.16 christos STATIC void delete_cmd_entry __P((void));
108 1.1 cgd
109 1.1 cgd
110 1.1 cgd
111 1.1 cgd /*
112 1.1 cgd * Exec a program. Never returns. If you change this routine, you may
113 1.1 cgd * have to change the find_command routine as well.
114 1.1 cgd */
115 1.1 cgd
116 1.1 cgd void
117 1.1 cgd shellexec(argv, envp, path, index)
118 1.1 cgd char **argv, **envp;
119 1.1 cgd char *path;
120 1.12 cgd int index;
121 1.12 cgd {
122 1.1 cgd char *cmdname;
123 1.1 cgd int e;
124 1.1 cgd
125 1.1 cgd if (strchr(argv[0], '/') != NULL) {
126 1.1 cgd tryexec(argv[0], argv, envp);
127 1.1 cgd e = errno;
128 1.1 cgd } else {
129 1.1 cgd e = ENOENT;
130 1.1 cgd while ((cmdname = padvance(&path, argv[0])) != NULL) {
131 1.1 cgd if (--index < 0 && pathopt == NULL) {
132 1.1 cgd tryexec(cmdname, argv, envp);
133 1.1 cgd if (errno != ENOENT && errno != ENOTDIR)
134 1.1 cgd e = errno;
135 1.1 cgd }
136 1.1 cgd stunalloc(cmdname);
137 1.1 cgd }
138 1.1 cgd }
139 1.1 cgd error2(argv[0], errmsg(e, E_EXEC));
140 1.1 cgd }
141 1.1 cgd
142 1.1 cgd
143 1.1 cgd STATIC void
144 1.1 cgd tryexec(cmd, argv, envp)
145 1.1 cgd char *cmd;
146 1.1 cgd char **argv;
147 1.1 cgd char **envp;
148 1.1 cgd {
149 1.1 cgd int e;
150 1.16 christos #ifndef BSD
151 1.1 cgd char *p;
152 1.16 christos #endif
153 1.1 cgd
154 1.1 cgd #ifdef SYSV
155 1.1 cgd do {
156 1.1 cgd execve(cmd, argv, envp);
157 1.1 cgd } while (errno == EINTR);
158 1.1 cgd #else
159 1.1 cgd execve(cmd, argv, envp);
160 1.1 cgd #endif
161 1.1 cgd e = errno;
162 1.1 cgd if (e == ENOEXEC) {
163 1.1 cgd initshellproc();
164 1.1 cgd setinputfile(cmd, 0);
165 1.1 cgd commandname = arg0 = savestr(argv[0]);
166 1.1 cgd #ifndef BSD
167 1.1 cgd pgetc(); pungetc(); /* fill up input buffer */
168 1.1 cgd p = parsenextc;
169 1.1 cgd if (parsenleft > 2 && p[0] == '#' && p[1] == '!') {
170 1.1 cgd argv[0] = cmd;
171 1.1 cgd execinterp(argv, envp);
172 1.1 cgd }
173 1.1 cgd #endif
174 1.1 cgd setparam(argv + 1);
175 1.1 cgd exraise(EXSHELLPROC);
176 1.1 cgd /*NOTREACHED*/
177 1.1 cgd }
178 1.1 cgd errno = e;
179 1.1 cgd }
180 1.1 cgd
181 1.1 cgd
182 1.1 cgd #ifndef BSD
183 1.1 cgd /*
184 1.1 cgd * Execute an interpreter introduced by "#!", for systems where this
185 1.1 cgd * feature has not been built into the kernel. If the interpreter is
186 1.1 cgd * the shell, return (effectively ignoring the "#!"). If the execution
187 1.1 cgd * of the interpreter fails, exit.
188 1.1 cgd *
189 1.1 cgd * This code peeks inside the input buffer in order to avoid actually
190 1.1 cgd * reading any input. It would benefit from a rewrite.
191 1.1 cgd */
192 1.1 cgd
193 1.1 cgd #define NEWARGS 5
194 1.1 cgd
195 1.1 cgd STATIC void
196 1.1 cgd execinterp(argv, envp)
197 1.1 cgd char **argv, **envp;
198 1.1 cgd {
199 1.1 cgd int n;
200 1.1 cgd char *inp;
201 1.1 cgd char *outp;
202 1.1 cgd char c;
203 1.1 cgd char *p;
204 1.1 cgd char **ap;
205 1.1 cgd char *newargs[NEWARGS];
206 1.1 cgd int i;
207 1.1 cgd char **ap2;
208 1.1 cgd char **new;
209 1.1 cgd
210 1.1 cgd n = parsenleft - 2;
211 1.1 cgd inp = parsenextc + 2;
212 1.1 cgd ap = newargs;
213 1.1 cgd for (;;) {
214 1.1 cgd while (--n >= 0 && (*inp == ' ' || *inp == '\t'))
215 1.1 cgd inp++;
216 1.1 cgd if (n < 0)
217 1.1 cgd goto bad;
218 1.1 cgd if ((c = *inp++) == '\n')
219 1.1 cgd break;
220 1.1 cgd if (ap == &newargs[NEWARGS])
221 1.1 cgd bad: error("Bad #! line");
222 1.1 cgd STARTSTACKSTR(outp);
223 1.1 cgd do {
224 1.1 cgd STPUTC(c, outp);
225 1.1 cgd } while (--n >= 0 && (c = *inp++) != ' ' && c != '\t' && c != '\n');
226 1.1 cgd STPUTC('\0', outp);
227 1.1 cgd n++, inp--;
228 1.1 cgd *ap++ = grabstackstr(outp);
229 1.1 cgd }
230 1.1 cgd if (ap == newargs + 1) { /* if no args, maybe no exec is needed */
231 1.1 cgd p = newargs[0];
232 1.1 cgd for (;;) {
233 1.1 cgd if (equal(p, "sh") || equal(p, "ash")) {
234 1.1 cgd return;
235 1.1 cgd }
236 1.1 cgd while (*p != '/') {
237 1.1 cgd if (*p == '\0')
238 1.1 cgd goto break2;
239 1.1 cgd p++;
240 1.1 cgd }
241 1.1 cgd p++;
242 1.1 cgd }
243 1.1 cgd break2:;
244 1.1 cgd }
245 1.1 cgd i = (char *)ap - (char *)newargs; /* size in bytes */
246 1.1 cgd if (i == 0)
247 1.1 cgd error("Bad #! line");
248 1.1 cgd for (ap2 = argv ; *ap2++ != NULL ; );
249 1.1 cgd new = ckmalloc(i + ((char *)ap2 - (char *)argv));
250 1.1 cgd ap = newargs, ap2 = new;
251 1.1 cgd while ((i -= sizeof (char **)) >= 0)
252 1.1 cgd *ap2++ = *ap++;
253 1.1 cgd ap = argv;
254 1.1 cgd while (*ap2++ = *ap++);
255 1.1 cgd shellexec(new, envp, pathval(), 0);
256 1.1 cgd }
257 1.1 cgd #endif
258 1.1 cgd
259 1.1 cgd
260 1.1 cgd
261 1.1 cgd /*
262 1.1 cgd * Do a path search. The variable path (passed by reference) should be
263 1.1 cgd * set to the start of the path before the first call; padvance will update
264 1.1 cgd * this value as it proceeds. Successive calls to padvance will return
265 1.1 cgd * the possible path expansions in sequence. If an option (indicated by
266 1.1 cgd * a percent sign) appears in the path entry then the global variable
267 1.1 cgd * pathopt will be set to point to it; otherwise pathopt will be set to
268 1.1 cgd * NULL.
269 1.1 cgd */
270 1.1 cgd
271 1.1 cgd char *pathopt;
272 1.1 cgd
273 1.1 cgd char *
274 1.1 cgd padvance(path, name)
275 1.1 cgd char **path;
276 1.1 cgd char *name;
277 1.1 cgd {
278 1.1 cgd register char *p, *q;
279 1.1 cgd char *start;
280 1.1 cgd int len;
281 1.1 cgd
282 1.1 cgd if (*path == NULL)
283 1.1 cgd return NULL;
284 1.1 cgd start = *path;
285 1.1 cgd for (p = start ; *p && *p != ':' && *p != '%' ; p++);
286 1.1 cgd len = p - start + strlen(name) + 2; /* "2" is for '/' and '\0' */
287 1.1 cgd while (stackblocksize() < len)
288 1.1 cgd growstackblock();
289 1.1 cgd q = stackblock();
290 1.1 cgd if (p != start) {
291 1.11 mycroft memcpy(q, start, p - start);
292 1.1 cgd q += p - start;
293 1.1 cgd *q++ = '/';
294 1.1 cgd }
295 1.1 cgd strcpy(q, name);
296 1.1 cgd pathopt = NULL;
297 1.1 cgd if (*p == '%') {
298 1.1 cgd pathopt = ++p;
299 1.1 cgd while (*p && *p != ':') p++;
300 1.1 cgd }
301 1.1 cgd if (*p == ':')
302 1.1 cgd *path = p + 1;
303 1.1 cgd else
304 1.1 cgd *path = NULL;
305 1.1 cgd return stalloc(len);
306 1.1 cgd }
307 1.1 cgd
308 1.1 cgd
309 1.1 cgd
310 1.1 cgd /*** Command hashing code ***/
311 1.1 cgd
312 1.1 cgd
313 1.12 cgd int
314 1.12 cgd hashcmd(argc, argv)
315 1.12 cgd int argc;
316 1.12 cgd char **argv;
317 1.12 cgd {
318 1.1 cgd struct tblentry **pp;
319 1.1 cgd struct tblentry *cmdp;
320 1.1 cgd int c;
321 1.1 cgd int verbose;
322 1.1 cgd struct cmdentry entry;
323 1.1 cgd char *name;
324 1.1 cgd
325 1.1 cgd verbose = 0;
326 1.1 cgd while ((c = nextopt("rv")) != '\0') {
327 1.1 cgd if (c == 'r') {
328 1.1 cgd clearcmdentry(0);
329 1.1 cgd } else if (c == 'v') {
330 1.1 cgd verbose++;
331 1.1 cgd }
332 1.1 cgd }
333 1.8 jtc if (*argptr == NULL) {
334 1.8 jtc for (pp = cmdtable ; pp < &cmdtable[CMDTABLESIZE] ; pp++) {
335 1.8 jtc for (cmdp = *pp ; cmdp ; cmdp = cmdp->next) {
336 1.8 jtc printentry(cmdp, verbose);
337 1.8 jtc }
338 1.8 jtc }
339 1.8 jtc return 0;
340 1.8 jtc }
341 1.1 cgd while ((name = *argptr) != NULL) {
342 1.1 cgd if ((cmdp = cmdlookup(name, 0)) != NULL
343 1.1 cgd && (cmdp->cmdtype == CMDNORMAL
344 1.16 christos || (cmdp->cmdtype == CMDBUILTIN && builtinloc >= 0)))
345 1.1 cgd delete_cmd_entry();
346 1.17 christos find_command(name, &entry, 1, pathval());
347 1.1 cgd if (verbose) {
348 1.1 cgd if (entry.cmdtype != CMDUNKNOWN) { /* if no error msg */
349 1.1 cgd cmdp = cmdlookup(name, 0);
350 1.8 jtc printentry(cmdp, verbose);
351 1.1 cgd }
352 1.1 cgd flushall();
353 1.1 cgd }
354 1.1 cgd argptr++;
355 1.1 cgd }
356 1.1 cgd return 0;
357 1.1 cgd }
358 1.1 cgd
359 1.1 cgd
360 1.1 cgd STATIC void
361 1.8 jtc printentry(cmdp, verbose)
362 1.1 cgd struct tblentry *cmdp;
363 1.8 jtc int verbose;
364 1.1 cgd {
365 1.1 cgd int index;
366 1.1 cgd char *path;
367 1.1 cgd char *name;
368 1.1 cgd
369 1.1 cgd if (cmdp->cmdtype == CMDNORMAL) {
370 1.1 cgd index = cmdp->param.index;
371 1.1 cgd path = pathval();
372 1.1 cgd do {
373 1.1 cgd name = padvance(&path, cmdp->cmdname);
374 1.1 cgd stunalloc(name);
375 1.1 cgd } while (--index >= 0);
376 1.1 cgd out1str(name);
377 1.1 cgd } else if (cmdp->cmdtype == CMDBUILTIN) {
378 1.1 cgd out1fmt("builtin %s", cmdp->cmdname);
379 1.1 cgd } else if (cmdp->cmdtype == CMDFUNCTION) {
380 1.1 cgd out1fmt("function %s", cmdp->cmdname);
381 1.8 jtc if (verbose) {
382 1.8 jtc INTOFF;
383 1.8 jtc name = commandtext(cmdp->param.func);
384 1.8 jtc out1c(' ');
385 1.8 jtc out1str(name);
386 1.8 jtc ckfree(name);
387 1.8 jtc INTON;
388 1.8 jtc }
389 1.1 cgd #ifdef DEBUG
390 1.1 cgd } else {
391 1.1 cgd error("internal error: cmdtype %d", cmdp->cmdtype);
392 1.1 cgd #endif
393 1.1 cgd }
394 1.1 cgd if (cmdp->rehash)
395 1.1 cgd out1c('*');
396 1.1 cgd out1c('\n');
397 1.1 cgd }
398 1.1 cgd
399 1.1 cgd
400 1.1 cgd
401 1.1 cgd /*
402 1.1 cgd * Resolve a command name. If you change this routine, you may have to
403 1.1 cgd * change the shellexec routine as well.
404 1.1 cgd */
405 1.1 cgd
406 1.1 cgd void
407 1.17 christos find_command(name, entry, printerr, path)
408 1.1 cgd char *name;
409 1.1 cgd struct cmdentry *entry;
410 1.12 cgd int printerr;
411 1.17 christos char *path;
412 1.12 cgd {
413 1.1 cgd struct tblentry *cmdp;
414 1.1 cgd int index;
415 1.1 cgd int prev;
416 1.1 cgd char *fullname;
417 1.1 cgd struct stat statb;
418 1.1 cgd int e;
419 1.1 cgd int i;
420 1.1 cgd
421 1.1 cgd /* If name contains a slash, don't use the hash table */
422 1.1 cgd if (strchr(name, '/') != NULL) {
423 1.1 cgd entry->cmdtype = CMDNORMAL;
424 1.1 cgd entry->u.index = 0;
425 1.1 cgd return;
426 1.1 cgd }
427 1.1 cgd
428 1.1 cgd /* If name is in the table, and not invalidated by cd, we're done */
429 1.1 cgd if ((cmdp = cmdlookup(name, 0)) != NULL && cmdp->rehash == 0)
430 1.1 cgd goto success;
431 1.1 cgd
432 1.1 cgd /* If %builtin not in path, check for builtin next */
433 1.1 cgd if (builtinloc < 0 && (i = find_builtin(name)) >= 0) {
434 1.1 cgd INTOFF;
435 1.1 cgd cmdp = cmdlookup(name, 1);
436 1.1 cgd cmdp->cmdtype = CMDBUILTIN;
437 1.1 cgd cmdp->param.index = i;
438 1.1 cgd INTON;
439 1.1 cgd goto success;
440 1.1 cgd }
441 1.1 cgd
442 1.1 cgd /* We have to search path. */
443 1.1 cgd prev = -1; /* where to start */
444 1.1 cgd if (cmdp) { /* doing a rehash */
445 1.1 cgd if (cmdp->cmdtype == CMDBUILTIN)
446 1.1 cgd prev = builtinloc;
447 1.1 cgd else
448 1.1 cgd prev = cmdp->param.index;
449 1.1 cgd }
450 1.1 cgd
451 1.1 cgd e = ENOENT;
452 1.1 cgd index = -1;
453 1.1 cgd loop:
454 1.1 cgd while ((fullname = padvance(&path, name)) != NULL) {
455 1.1 cgd stunalloc(fullname);
456 1.1 cgd index++;
457 1.1 cgd if (pathopt) {
458 1.1 cgd if (prefix("builtin", pathopt)) {
459 1.1 cgd if ((i = find_builtin(name)) < 0)
460 1.1 cgd goto loop;
461 1.1 cgd INTOFF;
462 1.1 cgd cmdp = cmdlookup(name, 1);
463 1.1 cgd cmdp->cmdtype = CMDBUILTIN;
464 1.1 cgd cmdp->param.index = i;
465 1.1 cgd INTON;
466 1.1 cgd goto success;
467 1.1 cgd } else if (prefix("func", pathopt)) {
468 1.1 cgd /* handled below */
469 1.1 cgd } else {
470 1.1 cgd goto loop; /* ignore unimplemented options */
471 1.1 cgd }
472 1.1 cgd }
473 1.1 cgd /* if rehash, don't redo absolute path names */
474 1.1 cgd if (fullname[0] == '/' && index <= prev) {
475 1.1 cgd if (index < prev)
476 1.1 cgd goto loop;
477 1.1 cgd TRACE(("searchexec \"%s\": no change\n", name));
478 1.1 cgd goto success;
479 1.1 cgd }
480 1.1 cgd while (stat(fullname, &statb) < 0) {
481 1.1 cgd #ifdef SYSV
482 1.1 cgd if (errno == EINTR)
483 1.1 cgd continue;
484 1.1 cgd #endif
485 1.1 cgd if (errno != ENOENT && errno != ENOTDIR)
486 1.1 cgd e = errno;
487 1.1 cgd goto loop;
488 1.1 cgd }
489 1.1 cgd e = EACCES; /* if we fail, this will be the error */
490 1.14 mycroft if (!S_ISREG(statb.st_mode))
491 1.1 cgd goto loop;
492 1.1 cgd if (pathopt) { /* this is a %func directory */
493 1.1 cgd stalloc(strlen(fullname) + 1);
494 1.1 cgd readcmdfile(fullname);
495 1.1 cgd if ((cmdp = cmdlookup(name, 0)) == NULL || cmdp->cmdtype != CMDFUNCTION)
496 1.1 cgd error("%s not defined in %s", name, fullname);
497 1.1 cgd stunalloc(fullname);
498 1.1 cgd goto success;
499 1.1 cgd }
500 1.8 jtc #ifdef notdef
501 1.8 jtc if (statb.st_uid == geteuid()) {
502 1.1 cgd if ((statb.st_mode & 0100) == 0)
503 1.1 cgd goto loop;
504 1.1 cgd } else if (statb.st_gid == getegid()) {
505 1.1 cgd if ((statb.st_mode & 010) == 0)
506 1.1 cgd goto loop;
507 1.1 cgd } else {
508 1.8 jtc if ((statb.st_mode & 01) == 0)
509 1.1 cgd goto loop;
510 1.1 cgd }
511 1.4 cgd #endif
512 1.1 cgd TRACE(("searchexec \"%s\" returns \"%s\"\n", name, fullname));
513 1.1 cgd INTOFF;
514 1.1 cgd cmdp = cmdlookup(name, 1);
515 1.1 cgd cmdp->cmdtype = CMDNORMAL;
516 1.1 cgd cmdp->param.index = index;
517 1.1 cgd INTON;
518 1.1 cgd goto success;
519 1.1 cgd }
520 1.1 cgd
521 1.1 cgd /* We failed. If there was an entry for this command, delete it */
522 1.1 cgd if (cmdp)
523 1.1 cgd delete_cmd_entry();
524 1.1 cgd if (printerr)
525 1.1 cgd outfmt(out2, "%s: %s\n", name, errmsg(e, E_EXEC));
526 1.1 cgd entry->cmdtype = CMDUNKNOWN;
527 1.1 cgd return;
528 1.1 cgd
529 1.1 cgd success:
530 1.1 cgd cmdp->rehash = 0;
531 1.1 cgd entry->cmdtype = cmdp->cmdtype;
532 1.1 cgd entry->u = cmdp->param;
533 1.1 cgd }
534 1.1 cgd
535 1.1 cgd
536 1.1 cgd
537 1.1 cgd /*
538 1.1 cgd * Search the table of builtin commands.
539 1.1 cgd */
540 1.1 cgd
541 1.1 cgd int
542 1.1 cgd find_builtin(name)
543 1.1 cgd char *name;
544 1.12 cgd {
545 1.12 cgd register const struct builtincmd *bp;
546 1.1 cgd
547 1.1 cgd for (bp = builtincmd ; bp->name ; bp++) {
548 1.1 cgd if (*bp->name == *name && equal(bp->name, name))
549 1.1 cgd return bp->code;
550 1.1 cgd }
551 1.1 cgd return -1;
552 1.1 cgd }
553 1.1 cgd
554 1.1 cgd
555 1.1 cgd
556 1.1 cgd /*
557 1.1 cgd * Called when a cd is done. Marks all commands so the next time they
558 1.1 cgd * are executed they will be rehashed.
559 1.1 cgd */
560 1.1 cgd
561 1.1 cgd void
562 1.1 cgd hashcd() {
563 1.1 cgd struct tblentry **pp;
564 1.1 cgd struct tblentry *cmdp;
565 1.1 cgd
566 1.1 cgd for (pp = cmdtable ; pp < &cmdtable[CMDTABLESIZE] ; pp++) {
567 1.1 cgd for (cmdp = *pp ; cmdp ; cmdp = cmdp->next) {
568 1.1 cgd if (cmdp->cmdtype == CMDNORMAL
569 1.16 christos || (cmdp->cmdtype == CMDBUILTIN && builtinloc >= 0))
570 1.1 cgd cmdp->rehash = 1;
571 1.1 cgd }
572 1.1 cgd }
573 1.1 cgd }
574 1.1 cgd
575 1.1 cgd
576 1.1 cgd
577 1.1 cgd /*
578 1.1 cgd * Called before PATH is changed. The argument is the new value of PATH;
579 1.1 cgd * pathval() still returns the old value at this point. Called with
580 1.1 cgd * interrupts off.
581 1.1 cgd */
582 1.1 cgd
583 1.1 cgd void
584 1.1 cgd changepath(newval)
585 1.18 christos const char *newval;
586 1.13 mycroft {
587 1.18 christos const char *old, *new;
588 1.1 cgd int index;
589 1.1 cgd int firstchange;
590 1.1 cgd int bltin;
591 1.1 cgd
592 1.1 cgd old = pathval();
593 1.1 cgd new = newval;
594 1.1 cgd firstchange = 9999; /* assume no change */
595 1.13 mycroft index = 0;
596 1.1 cgd bltin = -1;
597 1.1 cgd for (;;) {
598 1.1 cgd if (*old != *new) {
599 1.1 cgd firstchange = index;
600 1.16 christos if ((*old == '\0' && *new == ':')
601 1.16 christos || (*old == ':' && *new == '\0'))
602 1.1 cgd firstchange++;
603 1.1 cgd old = new; /* ignore subsequent differences */
604 1.1 cgd }
605 1.1 cgd if (*new == '\0')
606 1.1 cgd break;
607 1.1 cgd if (*new == '%' && bltin < 0 && prefix("builtin", new + 1))
608 1.1 cgd bltin = index;
609 1.1 cgd if (*new == ':') {
610 1.1 cgd index++;
611 1.1 cgd }
612 1.1 cgd new++, old++;
613 1.1 cgd }
614 1.1 cgd if (builtinloc < 0 && bltin >= 0)
615 1.1 cgd builtinloc = bltin; /* zap builtins */
616 1.1 cgd if (builtinloc >= 0 && bltin < 0)
617 1.1 cgd firstchange = 0;
618 1.1 cgd clearcmdentry(firstchange);
619 1.1 cgd builtinloc = bltin;
620 1.1 cgd }
621 1.1 cgd
622 1.1 cgd
623 1.1 cgd /*
624 1.1 cgd * Clear out command entries. The argument specifies the first entry in
625 1.1 cgd * PATH which has changed.
626 1.1 cgd */
627 1.1 cgd
628 1.1 cgd STATIC void
629 1.12 cgd clearcmdentry(firstchange)
630 1.12 cgd int firstchange;
631 1.12 cgd {
632 1.1 cgd struct tblentry **tblp;
633 1.1 cgd struct tblentry **pp;
634 1.1 cgd struct tblentry *cmdp;
635 1.1 cgd
636 1.1 cgd INTOFF;
637 1.1 cgd for (tblp = cmdtable ; tblp < &cmdtable[CMDTABLESIZE] ; tblp++) {
638 1.1 cgd pp = tblp;
639 1.1 cgd while ((cmdp = *pp) != NULL) {
640 1.16 christos if ((cmdp->cmdtype == CMDNORMAL &&
641 1.16 christos cmdp->param.index >= firstchange)
642 1.16 christos || (cmdp->cmdtype == CMDBUILTIN &&
643 1.16 christos builtinloc >= firstchange)) {
644 1.1 cgd *pp = cmdp->next;
645 1.1 cgd ckfree(cmdp);
646 1.1 cgd } else {
647 1.1 cgd pp = &cmdp->next;
648 1.1 cgd }
649 1.1 cgd }
650 1.1 cgd }
651 1.1 cgd INTON;
652 1.1 cgd }
653 1.1 cgd
654 1.1 cgd
655 1.1 cgd /*
656 1.1 cgd * Delete all functions.
657 1.1 cgd */
658 1.1 cgd
659 1.1 cgd #ifdef mkinit
660 1.1 cgd MKINIT void deletefuncs();
661 1.1 cgd
662 1.1 cgd SHELLPROC {
663 1.1 cgd deletefuncs();
664 1.1 cgd }
665 1.1 cgd #endif
666 1.1 cgd
667 1.1 cgd void
668 1.1 cgd deletefuncs() {
669 1.1 cgd struct tblentry **tblp;
670 1.1 cgd struct tblentry **pp;
671 1.1 cgd struct tblentry *cmdp;
672 1.1 cgd
673 1.1 cgd INTOFF;
674 1.1 cgd for (tblp = cmdtable ; tblp < &cmdtable[CMDTABLESIZE] ; tblp++) {
675 1.1 cgd pp = tblp;
676 1.1 cgd while ((cmdp = *pp) != NULL) {
677 1.1 cgd if (cmdp->cmdtype == CMDFUNCTION) {
678 1.1 cgd *pp = cmdp->next;
679 1.1 cgd freefunc(cmdp->param.func);
680 1.1 cgd ckfree(cmdp);
681 1.1 cgd } else {
682 1.1 cgd pp = &cmdp->next;
683 1.1 cgd }
684 1.1 cgd }
685 1.1 cgd }
686 1.1 cgd INTON;
687 1.1 cgd }
688 1.1 cgd
689 1.1 cgd
690 1.1 cgd
691 1.1 cgd /*
692 1.1 cgd * Locate a command in the command hash table. If "add" is nonzero,
693 1.1 cgd * add the command to the table if it is not already present. The
694 1.1 cgd * variable "lastcmdentry" is set to point to the address of the link
695 1.1 cgd * pointing to the entry, so that delete_cmd_entry can delete the
696 1.1 cgd * entry.
697 1.1 cgd */
698 1.1 cgd
699 1.1 cgd struct tblentry **lastcmdentry;
700 1.1 cgd
701 1.1 cgd
702 1.1 cgd STATIC struct tblentry *
703 1.1 cgd cmdlookup(name, add)
704 1.1 cgd char *name;
705 1.12 cgd int add;
706 1.12 cgd {
707 1.1 cgd int hashval;
708 1.1 cgd register char *p;
709 1.1 cgd struct tblentry *cmdp;
710 1.1 cgd struct tblentry **pp;
711 1.1 cgd
712 1.1 cgd p = name;
713 1.1 cgd hashval = *p << 4;
714 1.1 cgd while (*p)
715 1.1 cgd hashval += *p++;
716 1.1 cgd hashval &= 0x7FFF;
717 1.1 cgd pp = &cmdtable[hashval % CMDTABLESIZE];
718 1.1 cgd for (cmdp = *pp ; cmdp ; cmdp = cmdp->next) {
719 1.1 cgd if (equal(cmdp->cmdname, name))
720 1.1 cgd break;
721 1.1 cgd pp = &cmdp->next;
722 1.1 cgd }
723 1.1 cgd if (add && cmdp == NULL) {
724 1.1 cgd INTOFF;
725 1.1 cgd cmdp = *pp = ckmalloc(sizeof (struct tblentry) - ARB
726 1.1 cgd + strlen(name) + 1);
727 1.1 cgd cmdp->next = NULL;
728 1.1 cgd cmdp->cmdtype = CMDUNKNOWN;
729 1.1 cgd cmdp->rehash = 0;
730 1.1 cgd strcpy(cmdp->cmdname, name);
731 1.1 cgd INTON;
732 1.1 cgd }
733 1.1 cgd lastcmdentry = pp;
734 1.1 cgd return cmdp;
735 1.1 cgd }
736 1.1 cgd
737 1.1 cgd /*
738 1.1 cgd * Delete the command entry returned on the last lookup.
739 1.1 cgd */
740 1.1 cgd
741 1.1 cgd STATIC void
742 1.1 cgd delete_cmd_entry() {
743 1.1 cgd struct tblentry *cmdp;
744 1.1 cgd
745 1.1 cgd INTOFF;
746 1.1 cgd cmdp = *lastcmdentry;
747 1.1 cgd *lastcmdentry = cmdp->next;
748 1.1 cgd ckfree(cmdp);
749 1.1 cgd INTON;
750 1.1 cgd }
751 1.1 cgd
752 1.1 cgd
753 1.1 cgd
754 1.1 cgd #ifdef notdef
755 1.1 cgd void
756 1.1 cgd getcmdentry(name, entry)
757 1.1 cgd char *name;
758 1.1 cgd struct cmdentry *entry;
759 1.1 cgd {
760 1.1 cgd struct tblentry *cmdp = cmdlookup(name, 0);
761 1.1 cgd
762 1.1 cgd if (cmdp) {
763 1.1 cgd entry->u = cmdp->param;
764 1.1 cgd entry->cmdtype = cmdp->cmdtype;
765 1.1 cgd } else {
766 1.1 cgd entry->cmdtype = CMDUNKNOWN;
767 1.1 cgd entry->u.index = 0;
768 1.1 cgd }
769 1.1 cgd }
770 1.1 cgd #endif
771 1.1 cgd
772 1.1 cgd
773 1.1 cgd /*
774 1.1 cgd * Add a new command entry, replacing any existing command entry for
775 1.1 cgd * the same name.
776 1.1 cgd */
777 1.1 cgd
778 1.1 cgd void
779 1.1 cgd addcmdentry(name, entry)
780 1.1 cgd char *name;
781 1.1 cgd struct cmdentry *entry;
782 1.1 cgd {
783 1.1 cgd struct tblentry *cmdp;
784 1.1 cgd
785 1.1 cgd INTOFF;
786 1.1 cgd cmdp = cmdlookup(name, 1);
787 1.1 cgd if (cmdp->cmdtype == CMDFUNCTION) {
788 1.1 cgd freefunc(cmdp->param.func);
789 1.1 cgd }
790 1.1 cgd cmdp->cmdtype = entry->cmdtype;
791 1.1 cgd cmdp->param = entry->u;
792 1.1 cgd INTON;
793 1.1 cgd }
794 1.1 cgd
795 1.1 cgd
796 1.1 cgd /*
797 1.1 cgd * Define a shell function.
798 1.1 cgd */
799 1.1 cgd
800 1.1 cgd void
801 1.1 cgd defun(name, func)
802 1.1 cgd char *name;
803 1.1 cgd union node *func;
804 1.1 cgd {
805 1.1 cgd struct cmdentry entry;
806 1.1 cgd
807 1.1 cgd INTOFF;
808 1.1 cgd entry.cmdtype = CMDFUNCTION;
809 1.1 cgd entry.u.func = copyfunc(func);
810 1.1 cgd addcmdentry(name, &entry);
811 1.1 cgd INTON;
812 1.1 cgd }
813 1.1 cgd
814 1.1 cgd
815 1.1 cgd /*
816 1.1 cgd * Delete a function if it exists.
817 1.1 cgd */
818 1.1 cgd
819 1.8 jtc int
820 1.1 cgd unsetfunc(name)
821 1.1 cgd char *name;
822 1.1 cgd {
823 1.1 cgd struct tblentry *cmdp;
824 1.1 cgd
825 1.1 cgd if ((cmdp = cmdlookup(name, 0)) != NULL && cmdp->cmdtype == CMDFUNCTION) {
826 1.1 cgd freefunc(cmdp->param.func);
827 1.1 cgd delete_cmd_entry();
828 1.8 jtc return (0);
829 1.1 cgd }
830 1.8 jtc return (1);
831 1.1 cgd }
832