exec.c revision 218320
1281SN/A/*- 2281SN/A * Copyright (c) 1991, 1993 3281SN/A * The Regents of the University of California. All rights reserved. 4281SN/A * 5281SN/A * This code is derived from software contributed to Berkeley by 6281SN/A * Kenneth Almquist. 7281SN/A * 8281SN/A * Redistribution and use in source and binary forms, with or without 9281SN/A * modification, are permitted provided that the following conditions 10281SN/A * are met: 11281SN/A * 1. Redistributions of source code must retain the above copyright 12281SN/A * notice, this list of conditions and the following disclaimer. 13281SN/A * 2. Redistributions in binary form must reproduce the above copyright 14281SN/A * notice, this list of conditions and the following disclaimer in the 15281SN/A * documentation and/or other materials provided with the distribution. 16281SN/A * 4. Neither the name of the University nor the names of its contributors 17281SN/A * may be used to endorse or promote products derived from this software 18281SN/A * without specific prior written permission. 19281SN/A * 20281SN/A * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 21281SN/A * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 22281SN/A * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 23281SN/A * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 24281SN/A * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 25281SN/A * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 26281SN/A * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 27281SN/A * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 28281SN/A * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 29281SN/A * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 30281SN/A * SUCH DAMAGE. 31281SN/A */ 32281SN/A 33281SN/A#ifndef lint 34281SN/A#if 0 35281SN/Astatic char sccsid[] = "@(#)exec.c 8.4 (Berkeley) 6/8/95"; 36281SN/A#endif 37281SN/A#endif /* not lint */ 38281SN/A#include <sys/cdefs.h> 39281SN/A__FBSDID("$FreeBSD: head/bin/sh/exec.c 218320 2011-02-05 12:54:59Z jilles $"); 40281SN/A 41281SN/A#include <sys/types.h> 42281SN/A#include <sys/stat.h> 43281SN/A#include <unistd.h> 44281SN/A#include <fcntl.h> 45281SN/A#include <errno.h> 46281SN/A#include <paths.h> 47281SN/A#include <stdlib.h> 48281SN/A 49928Sjoehw/* 50928Sjoehw * When commands are first encountered, they are entered in a hash table. 51281SN/A * This ensures that a full path search will not have to be done for them 52281SN/A * on each invocation. 53281SN/A * 54281SN/A * We should investigate converting to a linear search, even though that 55281SN/A * would make the command name "hash" a misnomer. 56281SN/A */ 57281SN/A 58281SN/A#include "shell.h" 59281SN/A#include "main.h" 60281SN/A#include "nodes.h" 61281SN/A#include "parser.h" 62281SN/A#include "redir.h" 63281SN/A#include "eval.h" 64281SN/A#include "exec.h" 65281SN/A#include "builtins.h" 66281SN/A#include "var.h" 67281SN/A#include "options.h" 68281SN/A#include "input.h" 69281SN/A#include "output.h" 70281SN/A#include "syntax.h" 71281SN/A#include "memalloc.h" 72281SN/A#include "error.h" 73281SN/A#include "init.h" 74281SN/A#include "mystring.h" 75281SN/A#include "show.h" 76281SN/A#include "jobs.h" 77281SN/A#include "alias.h" 78281SN/A 79281SN/A 80281SN/A#define CMDTABLESIZE 31 /* should be prime */ 81281SN/A#define ARB 1 /* actual size determined at run time */ 82281SN/A 83281SN/A 84281SN/A 85281SN/Astruct tblentry { 86281SN/A struct tblentry *next; /* next entry in hash chain */ 87281SN/A union param param; /* definition of builtin function */ 88281SN/A int special; /* flag for special builtin commands */ 89281SN/A short cmdtype; /* index identifying command */ 90281SN/A char rehash; /* if set, cd done since entry created */ 91281SN/A char cmdname[ARB]; /* name of command */ 92281SN/A}; 93281SN/A 94281SN/A 95281SN/Astatic struct tblentry *cmdtable[CMDTABLESIZE]; 96281SN/Aint exerrno = 0; /* Last exec error */ 97281SN/A 98281SN/A 99281SN/Astatic void tryexec(char *, char **, char **); 100281SN/Astatic void printentry(struct tblentry *, int); 101281SN/Astatic struct tblentry *cmdlookup(const char *, int); 102281SN/Astatic void delete_cmd_entry(void); 103281SN/A 104281SN/A 105281SN/A 106281SN/A/* 107281SN/A * Exec a program. Never returns. If you change this routine, you may 108281SN/A * have to change the find_command routine as well. 109281SN/A * 110281SN/A * The argv array may be changed and element argv[-1] should be writable. 111281SN/A */ 112281SN/A 113281SN/Avoid 114281SN/Ashellexec(char **argv, char **envp, const char *path, int idx) 115281SN/A{ 116281SN/A char *cmdname; 117281SN/A int e; 118281SN/A 119281SN/A if (strchr(argv[0], '/') != NULL) { 120281SN/A tryexec(argv[0], argv, envp); 121281SN/A e = errno; 122281SN/A } else { 123281SN/A e = ENOENT; 124281SN/A while ((cmdname = padvance(&path, argv[0])) != NULL) { 125281SN/A if (--idx < 0 && pathopt == NULL) { 126281SN/A tryexec(cmdname, argv, envp); 127281SN/A if (errno != ENOENT && errno != ENOTDIR) 128281SN/A e = errno; 129281SN/A if (e == ENOEXEC) 130281SN/A break; 131281SN/A } 132281SN/A stunalloc(cmdname); 133281SN/A } 134 } 135 136 /* Map to POSIX errors */ 137 if (e == ENOENT || e == ENOTDIR) { 138 exerrno = 127; 139 exerror(EXEXEC, "%s: not found", argv[0]); 140 } else { 141 exerrno = 126; 142 exerror(EXEXEC, "%s: %s", argv[0], strerror(e)); 143 } 144} 145 146 147static void 148tryexec(char *cmd, char **argv, char **envp) 149{ 150 int e, in; 151 ssize_t n; 152 char buf[256]; 153 154 execve(cmd, argv, envp); 155 e = errno; 156 if (e == ENOEXEC) { 157 INTOFF; 158 in = open(cmd, O_RDONLY | O_NONBLOCK); 159 if (in != -1) { 160 n = pread(in, buf, sizeof buf, 0); 161 close(in); 162 if (n > 0 && memchr(buf, '\0', n) != NULL) { 163 errno = ENOEXEC; 164 return; 165 } 166 } 167 *argv = cmd; 168 *--argv = _PATH_BSHELL; 169 execve(_PATH_BSHELL, argv, envp); 170 } 171 errno = e; 172} 173 174/* 175 * Do a path search. The variable path (passed by reference) should be 176 * set to the start of the path before the first call; padvance will update 177 * this value as it proceeds. Successive calls to padvance will return 178 * the possible path expansions in sequence. If an option (indicated by 179 * a percent sign) appears in the path entry then the global variable 180 * pathopt will be set to point to it; otherwise pathopt will be set to 181 * NULL. 182 */ 183 184const char *pathopt; 185 186char * 187padvance(const char **path, const char *name) 188{ 189 const char *p, *start; 190 char *q; 191 int len; 192 193 if (*path == NULL) 194 return NULL; 195 start = *path; 196 for (p = start; *p && *p != ':' && *p != '%'; p++) 197 ; /* nothing */ 198 len = p - start + strlen(name) + 2; /* "2" is for '/' and '\0' */ 199 STARTSTACKSTR(q); 200 CHECKSTRSPACE(len, q); 201 if (p != start) { 202 memcpy(q, start, p - start); 203 q += p - start; 204 *q++ = '/'; 205 } 206 strcpy(q, name); 207 pathopt = NULL; 208 if (*p == '%') { 209 pathopt = ++p; 210 while (*p && *p != ':') p++; 211 } 212 if (*p == ':') 213 *path = p + 1; 214 else 215 *path = NULL; 216 return stalloc(len); 217} 218 219 220 221/*** Command hashing code ***/ 222 223 224int 225hashcmd(int argc __unused, char **argv __unused) 226{ 227 struct tblentry **pp; 228 struct tblentry *cmdp; 229 int c; 230 int verbose; 231 struct cmdentry entry; 232 char *name; 233 234 verbose = 0; 235 while ((c = nextopt("rv")) != '\0') { 236 if (c == 'r') { 237 clearcmdentry(0); 238 } else if (c == 'v') { 239 verbose++; 240 } 241 } 242 if (*argptr == NULL) { 243 for (pp = cmdtable ; pp < &cmdtable[CMDTABLESIZE] ; pp++) { 244 for (cmdp = *pp ; cmdp ; cmdp = cmdp->next) { 245 if (cmdp->cmdtype == CMDNORMAL) 246 printentry(cmdp, verbose); 247 } 248 } 249 return 0; 250 } 251 while ((name = *argptr) != NULL) { 252 if ((cmdp = cmdlookup(name, 0)) != NULL 253 && cmdp->cmdtype == CMDNORMAL) 254 delete_cmd_entry(); 255 find_command(name, &entry, DO_ERR, pathval()); 256 if (verbose) { 257 if (entry.cmdtype != CMDUNKNOWN) { /* if no error msg */ 258 cmdp = cmdlookup(name, 0); 259 if (cmdp != NULL) 260 printentry(cmdp, verbose); 261 else 262 outfmt(out2, "%s: not found\n", name); 263 } 264 flushall(); 265 } 266 argptr++; 267 } 268 return 0; 269} 270 271 272static void 273printentry(struct tblentry *cmdp, int verbose) 274{ 275 int idx; 276 const char *path; 277 char *name; 278 279 if (cmdp->cmdtype == CMDNORMAL) { 280 idx = cmdp->param.index; 281 path = pathval(); 282 do { 283 name = padvance(&path, cmdp->cmdname); 284 stunalloc(name); 285 } while (--idx >= 0); 286 out1str(name); 287 } else if (cmdp->cmdtype == CMDBUILTIN) { 288 out1fmt("builtin %s", cmdp->cmdname); 289 } else if (cmdp->cmdtype == CMDFUNCTION) { 290 out1fmt("function %s", cmdp->cmdname); 291 if (verbose) { 292 INTOFF; 293 name = commandtext(getfuncnode(cmdp->param.func)); 294 out1c(' '); 295 out1str(name); 296 ckfree(name); 297 INTON; 298 } 299#ifdef DEBUG 300 } else { 301 error("internal error: cmdtype %d", cmdp->cmdtype); 302#endif 303 } 304 if (cmdp->rehash) 305 out1c('*'); 306 out1c('\n'); 307} 308 309 310 311/* 312 * Resolve a command name. If you change this routine, you may have to 313 * change the shellexec routine as well. 314 */ 315 316void 317find_command(const char *name, struct cmdentry *entry, int act, 318 const char *path) 319{ 320 struct tblentry *cmdp, loc_cmd; 321 int idx; 322 int prev; 323 char *fullname; 324 struct stat statb; 325 int e; 326 int i; 327 int spec; 328 329 /* If name contains a slash, don't use the hash table */ 330 if (strchr(name, '/') != NULL) { 331 entry->cmdtype = CMDNORMAL; 332 entry->u.index = 0; 333 return; 334 } 335 336 /* If name is in the table, and not invalidated by cd, we're done */ 337 if ((cmdp = cmdlookup(name, 0)) != NULL && cmdp->rehash == 0) { 338 if (cmdp->cmdtype == CMDFUNCTION && act & DO_NOFUNC) 339 cmdp = NULL; 340 else 341 goto success; 342 } 343 344 /* Check for builtin next */ 345 if ((i = find_builtin(name, &spec)) >= 0) { 346 INTOFF; 347 cmdp = cmdlookup(name, 1); 348 if (cmdp->cmdtype == CMDFUNCTION) 349 cmdp = &loc_cmd; 350 cmdp->cmdtype = CMDBUILTIN; 351 cmdp->param.index = i; 352 cmdp->special = spec; 353 INTON; 354 goto success; 355 } 356 357 /* We have to search path. */ 358 prev = -1; /* where to start */ 359 if (cmdp) { /* doing a rehash */ 360 if (cmdp->cmdtype == CMDBUILTIN) 361 prev = -1; 362 else 363 prev = cmdp->param.index; 364 } 365 366 e = ENOENT; 367 idx = -1; 368loop: 369 while ((fullname = padvance(&path, name)) != NULL) { 370 stunalloc(fullname); 371 idx++; 372 if (pathopt) { 373 if (prefix("func", pathopt)) { 374 /* handled below */ 375 } else { 376 goto loop; /* ignore unimplemented options */ 377 } 378 } 379 /* if rehash, don't redo absolute path names */ 380 if (fullname[0] == '/' && idx <= prev) { 381 if (idx < prev) 382 goto loop; 383 TRACE(("searchexec \"%s\": no change\n", name)); 384 goto success; 385 } 386 if (stat(fullname, &statb) < 0) { 387 if (errno != ENOENT && errno != ENOTDIR) 388 e = errno; 389 goto loop; 390 } 391 e = EACCES; /* if we fail, this will be the error */ 392 if (!S_ISREG(statb.st_mode)) 393 goto loop; 394 if (pathopt) { /* this is a %func directory */ 395 stalloc(strlen(fullname) + 1); 396 readcmdfile(fullname); 397 if ((cmdp = cmdlookup(name, 0)) == NULL || cmdp->cmdtype != CMDFUNCTION) 398 error("%s not defined in %s", name, fullname); 399 stunalloc(fullname); 400 goto success; 401 } 402#ifdef notdef 403 if (statb.st_uid == geteuid()) { 404 if ((statb.st_mode & 0100) == 0) 405 goto loop; 406 } else if (statb.st_gid == getegid()) { 407 if ((statb.st_mode & 010) == 0) 408 goto loop; 409 } else { 410 if ((statb.st_mode & 01) == 0) 411 goto loop; 412 } 413#endif 414 TRACE(("searchexec \"%s\" returns \"%s\"\n", name, fullname)); 415 INTOFF; 416 cmdp = cmdlookup(name, 1); 417 if (cmdp->cmdtype == CMDFUNCTION) 418 cmdp = &loc_cmd; 419 cmdp->cmdtype = CMDNORMAL; 420 cmdp->param.index = idx; 421 INTON; 422 goto success; 423 } 424 425 /* We failed. If there was an entry for this command, delete it */ 426 if (cmdp && cmdp->cmdtype != CMDFUNCTION) 427 delete_cmd_entry(); 428 if (act & DO_ERR) { 429 if (e == ENOENT || e == ENOTDIR) 430 outfmt(out2, "%s: not found\n", name); 431 else 432 outfmt(out2, "%s: %s\n", name, strerror(e)); 433 } 434 entry->cmdtype = CMDUNKNOWN; 435 entry->u.index = 0; 436 return; 437 438success: 439 cmdp->rehash = 0; 440 entry->cmdtype = cmdp->cmdtype; 441 entry->u = cmdp->param; 442 entry->special = cmdp->special; 443} 444 445 446 447/* 448 * Search the table of builtin commands. 449 */ 450 451int 452find_builtin(const char *name, int *special) 453{ 454 const struct builtincmd *bp; 455 456 for (bp = builtincmd ; bp->name ; bp++) { 457 if (*bp->name == *name && equal(bp->name, name)) { 458 *special = bp->special; 459 return bp->code; 460 } 461 } 462 return -1; 463} 464 465 466 467/* 468 * Called when a cd is done. Marks all commands so the next time they 469 * are executed they will be rehashed. 470 */ 471 472void 473hashcd(void) 474{ 475 struct tblentry **pp; 476 struct tblentry *cmdp; 477 478 for (pp = cmdtable ; pp < &cmdtable[CMDTABLESIZE] ; pp++) { 479 for (cmdp = *pp ; cmdp ; cmdp = cmdp->next) { 480 if (cmdp->cmdtype == CMDNORMAL) 481 cmdp->rehash = 1; 482 } 483 } 484} 485 486 487 488/* 489 * Called before PATH is changed. The argument is the new value of PATH; 490 * pathval() still returns the old value at this point. Called with 491 * interrupts off. 492 */ 493 494void 495changepath(const char *newval) 496{ 497 const char *old, *new; 498 int idx; 499 int firstchange; 500 501 old = pathval(); 502 new = newval; 503 firstchange = 9999; /* assume no change */ 504 idx = 0; 505 for (;;) { 506 if (*old != *new) { 507 firstchange = idx; 508 if ((*old == '\0' && *new == ':') 509 || (*old == ':' && *new == '\0')) 510 firstchange++; 511 old = new; /* ignore subsequent differences */ 512 } 513 if (*new == '\0') 514 break; 515 if (*new == ':') { 516 idx++; 517 } 518 new++, old++; 519 } 520 clearcmdentry(firstchange); 521} 522 523 524/* 525 * Clear out command entries. The argument specifies the first entry in 526 * PATH which has changed. 527 */ 528 529void 530clearcmdentry(int firstchange) 531{ 532 struct tblentry **tblp; 533 struct tblentry **pp; 534 struct tblentry *cmdp; 535 536 INTOFF; 537 for (tblp = cmdtable ; tblp < &cmdtable[CMDTABLESIZE] ; tblp++) { 538 pp = tblp; 539 while ((cmdp = *pp) != NULL) { 540 if ((cmdp->cmdtype == CMDNORMAL && 541 cmdp->param.index >= firstchange)) { 542 *pp = cmdp->next; 543 ckfree(cmdp); 544 } else { 545 pp = &cmdp->next; 546 } 547 } 548 } 549 INTON; 550} 551 552 553/* 554 * Locate a command in the command hash table. If "add" is nonzero, 555 * add the command to the table if it is not already present. The 556 * variable "lastcmdentry" is set to point to the address of the link 557 * pointing to the entry, so that delete_cmd_entry can delete the 558 * entry. 559 */ 560 561static struct tblentry **lastcmdentry; 562 563 564static struct tblentry * 565cmdlookup(const char *name, int add) 566{ 567 int hashval; 568 const char *p; 569 struct tblentry *cmdp; 570 struct tblentry **pp; 571 572 p = name; 573 hashval = *p << 4; 574 while (*p) 575 hashval += *p++; 576 hashval &= 0x7FFF; 577 pp = &cmdtable[hashval % CMDTABLESIZE]; 578 for (cmdp = *pp ; cmdp ; cmdp = cmdp->next) { 579 if (equal(cmdp->cmdname, name)) 580 break; 581 pp = &cmdp->next; 582 } 583 if (add && cmdp == NULL) { 584 INTOFF; 585 cmdp = *pp = ckmalloc(sizeof (struct tblentry) - ARB 586 + strlen(name) + 1); 587 cmdp->next = NULL; 588 cmdp->cmdtype = CMDUNKNOWN; 589 cmdp->rehash = 0; 590 strcpy(cmdp->cmdname, name); 591 INTON; 592 } 593 lastcmdentry = pp; 594 return cmdp; 595} 596 597/* 598 * Delete the command entry returned on the last lookup. 599 */ 600 601static void 602delete_cmd_entry(void) 603{ 604 struct tblentry *cmdp; 605 606 INTOFF; 607 cmdp = *lastcmdentry; 608 *lastcmdentry = cmdp->next; 609 ckfree(cmdp); 610 INTON; 611} 612 613 614 615/* 616 * Add a new command entry, replacing any existing command entry for 617 * the same name. 618 */ 619 620void 621addcmdentry(const char *name, struct cmdentry *entry) 622{ 623 struct tblentry *cmdp; 624 625 INTOFF; 626 cmdp = cmdlookup(name, 1); 627 if (cmdp->cmdtype == CMDFUNCTION) { 628 unreffunc(cmdp->param.func); 629 } 630 cmdp->cmdtype = entry->cmdtype; 631 cmdp->param = entry->u; 632 INTON; 633} 634 635 636/* 637 * Define a shell function. 638 */ 639 640void 641defun(const char *name, union node *func) 642{ 643 struct cmdentry entry; 644 645 INTOFF; 646 entry.cmdtype = CMDFUNCTION; 647 entry.u.func = copyfunc(func); 648 addcmdentry(name, &entry); 649 INTON; 650} 651 652 653/* 654 * Delete a function if it exists. 655 */ 656 657int 658unsetfunc(const char *name) 659{ 660 struct tblentry *cmdp; 661 662 if ((cmdp = cmdlookup(name, 0)) != NULL && cmdp->cmdtype == CMDFUNCTION) { 663 unreffunc(cmdp->param.func); 664 delete_cmd_entry(); 665 return (0); 666 } 667 return (0); 668} 669 670/* 671 * Shared code for the following builtin commands: 672 * type, command -v, command -V 673 */ 674 675int 676typecmd_impl(int argc, char **argv, int cmd, const char *path) 677{ 678 struct cmdentry entry; 679 struct tblentry *cmdp; 680 const char *const *pp; 681 struct alias *ap; 682 int i; 683 int error1 = 0; 684 685 if (path != pathval()) 686 clearcmdentry(0); 687 688 for (i = 1; i < argc; i++) { 689 /* First look at the keywords */ 690 for (pp = parsekwd; *pp; pp++) 691 if (**pp == *argv[i] && equal(*pp, argv[i])) 692 break; 693 694 if (*pp) { 695 if (cmd == TYPECMD_SMALLV) 696 out1fmt("%s\n", argv[i]); 697 else 698 out1fmt("%s is a shell keyword\n", argv[i]); 699 continue; 700 } 701 702 /* Then look at the aliases */ 703 if ((ap = lookupalias(argv[i], 1)) != NULL) { 704 if (cmd == TYPECMD_SMALLV) 705 out1fmt("alias %s='%s'\n", argv[i], ap->val); 706 else 707 out1fmt("%s is an alias for %s\n", argv[i], 708 ap->val); 709 continue; 710 } 711 712 /* Then check if it is a tracked alias */ 713 if ((cmdp = cmdlookup(argv[i], 0)) != NULL) { 714 entry.cmdtype = cmdp->cmdtype; 715 entry.u = cmdp->param; 716 entry.special = cmdp->special; 717 } 718 else { 719 /* Finally use brute force */ 720 find_command(argv[i], &entry, 0, path); 721 } 722 723 switch (entry.cmdtype) { 724 case CMDNORMAL: { 725 if (strchr(argv[i], '/') == NULL) { 726 const char *path2 = path; 727 char *name; 728 int j = entry.u.index; 729 do { 730 name = padvance(&path2, argv[i]); 731 stunalloc(name); 732 } while (--j >= 0); 733 if (cmd == TYPECMD_SMALLV) 734 out1fmt("%s\n", name); 735 else 736 out1fmt("%s is%s %s\n", argv[i], 737 (cmdp && cmd == TYPECMD_TYPE) ? 738 " a tracked alias for" : "", 739 name); 740 } else { 741 if (eaccess(argv[i], X_OK) == 0) { 742 if (cmd == TYPECMD_SMALLV) 743 out1fmt("%s\n", argv[i]); 744 else 745 out1fmt("%s is %s\n", argv[i], 746 argv[i]); 747 } else { 748 if (cmd != TYPECMD_SMALLV) 749 outfmt(out2, "%s: %s\n", 750 argv[i], strerror(errno)); 751 error1 |= 127; 752 } 753 } 754 break; 755 } 756 case CMDFUNCTION: 757 if (cmd == TYPECMD_SMALLV) 758 out1fmt("%s\n", argv[i]); 759 else 760 out1fmt("%s is a shell function\n", argv[i]); 761 break; 762 763 case CMDBUILTIN: 764 if (cmd == TYPECMD_SMALLV) 765 out1fmt("%s\n", argv[i]); 766 else if (entry.special) 767 out1fmt("%s is a special shell builtin\n", 768 argv[i]); 769 else 770 out1fmt("%s is a shell builtin\n", argv[i]); 771 break; 772 773 default: 774 if (cmd != TYPECMD_SMALLV) 775 outfmt(out2, "%s: not found\n", argv[i]); 776 error1 |= 127; 777 break; 778 } 779 } 780 781 if (path != pathval()) 782 clearcmdentry(0); 783 784 return error1; 785} 786 787/* 788 * Locate and print what a word is... 789 */ 790 791int 792typecmd(int argc, char **argv) 793{ 794 return typecmd_impl(argc, argv, TYPECMD_TYPE, bltinlookup("PATH", 1)); 795} 796