/* $OpenBSD: exec.c,v 1.25 2023/09/06 03:51:20 jsg Exp $ */ /*- * Copyright (c) 1991, 1993 * The Regents of the University of California. All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ #include #include #include #include #include #include #include #include #include #include #include int execl(const char *name, const char *arg, ...) { va_list ap; char **argv; size_t maplen; int save_errno, n, error; va_start(ap, arg); n = 1; while (va_arg(ap, char *) != NULL) n++; va_end(ap); maplen = (n + 1) * sizeof(*argv); argv = mmap(NULL, maplen, PROT_WRITE|PROT_READ, MAP_ANON|MAP_PRIVATE, -1, 0); if (argv == MAP_FAILED) return (-1); va_start(ap, arg); n = 1; argv[0] = (char *)arg; while ((argv[n] = va_arg(ap, char *)) != NULL) n++; va_end(ap); error = execve(name, argv, environ); save_errno = errno; munmap(argv, maplen); errno = save_errno; return (error); } DEF_WEAK(execl); int execle(const char *name, const char *arg, ...) { va_list ap; char **argv, **envp; size_t maplen; int save_errno, n, error; va_start(ap, arg); n = 1; while (va_arg(ap, char *) != NULL) n++; va_end(ap); maplen = (n + 1) * sizeof(*argv); argv = mmap(NULL, maplen, PROT_WRITE|PROT_READ, MAP_ANON|MAP_PRIVATE, -1, 0); if (argv == MAP_FAILED) return (-1); va_start(ap, arg); n = 1; argv[0] = (char *)arg; while ((argv[n] = va_arg(ap, char *)) != NULL) n++; envp = va_arg(ap, char **); va_end(ap); error = execve(name, argv, envp); save_errno = errno; munmap(argv, maplen); errno = save_errno; return error; } int execlp(const char *name, const char *arg, ...) { va_list ap; char **argv; size_t maplen; int save_errno, n, error; va_start(ap, arg); n = 1; while (va_arg(ap, char *) != NULL) n++; va_end(ap); maplen = (n + 1) * sizeof(*argv); argv = mmap(NULL, maplen, PROT_WRITE|PROT_READ, MAP_ANON|MAP_PRIVATE, -1, 0); if (argv == MAP_FAILED) return (-1); va_start(ap, arg); n = 1; argv[0] = (char *)arg; while ((argv[n] = va_arg(ap, char *)) != NULL) n++; va_end(ap); error = execvp(name, argv); save_errno = errno; munmap(argv, maplen); errno = save_errno; return error; } int execv(const char *name, char *const *argv) { (void)execve(name, argv, environ); return (-1); } int execvpe(const char *name, char *const *argv, char *const *envp) { char **memp; int cnt; size_t lp, ln, curlen; char *p; int eacces = 0; char *bp, *cur, *path, buf[PATH_MAX]; size_t maplen; int save_errno; /* * Do not allow null name */ if (name == NULL || *name == '\0') { errno = ENOENT; return (-1); } /* If it's an absolute or relative path name, it's easy. */ if (strchr(name, '/')) { bp = (char *)name; cur = path = NULL; goto retry; } bp = buf; /* Get the path we're searching. */ if (!(path = getenv("PATH"))) path = _PATH_DEFPATH; curlen = strlen(path) + 1; cur = mmap(NULL, curlen, PROT_WRITE|PROT_READ, MAP_ANON|MAP_PRIVATE, -1, 0); if (cur == MAP_FAILED) return (-1); strlcpy(cur, path, curlen); path = cur; while ((p = strsep(&cur, ":"))) { /* * It's a SHELL path -- double, leading and trailing colons * mean the current directory. */ if (!*p) { p = "."; lp = 1; } else lp = strlen(p); ln = strlen(name); /* * If the path is too long complain. This is a possible * security issue; given a way to make the path too long * the user may execute the wrong program. */ if (lp + ln + 2 > sizeof(buf)) { struct iovec iov[3]; iov[0].iov_base = "execvp: "; iov[0].iov_len = 8; iov[1].iov_base = p; iov[1].iov_len = lp; iov[2].iov_base = ": path too long\n"; iov[2].iov_len = 16; (void)writev(STDERR_FILENO, iov, 3); continue; } bcopy(p, buf, lp); buf[lp] = '/'; bcopy(name, buf + lp + 1, ln); buf[lp + ln + 1] = '\0'; retry: (void)execve(bp, argv, envp); switch(errno) { case E2BIG: goto done; case EISDIR: case ELOOP: case ENAMETOOLONG: case ENOENT: break; case ENOEXEC: for (cnt = 0; argv[cnt]; ++cnt) ; maplen = (cnt + 2) * sizeof(char *); memp = mmap(NULL, maplen, PROT_WRITE|PROT_READ, MAP_ANON|MAP_PRIVATE, -1, 0); if (memp == MAP_FAILED) goto done; memp[0] = "sh"; memp[1] = bp; bcopy(argv + 1, memp + 2, cnt * sizeof(char *)); (void)execve(_PATH_BSHELL, memp, envp); save_errno = errno; munmap(memp, maplen); errno = save_errno; goto done; case ENOMEM: goto done; case ENOTDIR: break; case ETXTBSY: /* * We used to retry here, but sh(1) doesn't. */ goto done; case EACCES: eacces = 1; break; default: goto done; } } if (eacces) errno = EACCES; else if (!errno) errno = ENOENT; done: if (cur) { save_errno = errno; munmap(cur, curlen); errno = save_errno; } return (-1); } DEF_WEAK(execvpe); int execvp(const char *name, char *const *argv) { return execvpe(name, argv, environ); } DEF_WEAK(execvp);