8abe2a2d86
just use _foo() <-- foo(). In the case of a libpthread that doesn't do call conversion (such as linuxthreads and our upcoming libpthread), this is adequate. In the case of libc_r, we still need three names, which are now _thread_sys_foo() <-- _foo() <-- foo(). Convert all internal libc usage of: aio_suspend(), close(), fsync(), msync(), nanosleep(), open(), fcntl(), read(), and write() to _foo() instead of foo(). Remove all internal libc usage of: creat(), pause(), sleep(), system(), tcdrain(), wait(), and waitpid(). Make thread cancellation fully POSIX-compliant. Suggested by: deischen
192 lines
5.0 KiB
C
192 lines
5.0 KiB
C
/*
|
|
* Copyright (c) 1988, 1993
|
|
* The Regents of the University of California. All rights reserved.
|
|
*
|
|
* This code is derived from software written by Ken Arnold and
|
|
* published in UNIX Review, Vol. 6, No. 8.
|
|
*
|
|
* 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. All advertising materials mentioning features or use of this software
|
|
* must display the following acknowledgement:
|
|
* This product includes software developed by the University of
|
|
* California, Berkeley and its contributors.
|
|
* 4. 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.
|
|
*
|
|
* $FreeBSD$
|
|
*/
|
|
|
|
#if defined(LIBC_SCCS) && !defined(lint)
|
|
static char sccsid[] = "@(#)popen.c 8.3 (Berkeley) 5/3/95";
|
|
#endif /* LIBC_SCCS and not lint */
|
|
|
|
#include <sys/param.h>
|
|
#include <sys/wait.h>
|
|
|
|
#include <signal.h>
|
|
#include <errno.h>
|
|
#include <unistd.h>
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#include <paths.h>
|
|
|
|
extern char **environ;
|
|
|
|
static struct pid {
|
|
struct pid *next;
|
|
FILE *fp;
|
|
pid_t pid;
|
|
} *pidlist;
|
|
|
|
FILE *
|
|
popen(command, type)
|
|
const char *command, *type;
|
|
{
|
|
struct pid *cur;
|
|
FILE *iop;
|
|
int pdes[2], pid, twoway;
|
|
char *argv[4];
|
|
struct pid *p;
|
|
|
|
/*
|
|
* Lite2 introduced two-way popen() pipes using socketpair().
|
|
* FreeBSD's pipe() is bidirectional, so we use that.
|
|
*/
|
|
if (strchr(type, '+')) {
|
|
twoway = 1;
|
|
type = "r+";
|
|
} else {
|
|
twoway = 0;
|
|
if ((*type != 'r' && *type != 'w') || type[1])
|
|
return (NULL);
|
|
}
|
|
if (pipe(pdes) < 0)
|
|
return (NULL);
|
|
|
|
if ((cur = malloc(sizeof(struct pid))) == NULL) {
|
|
(void)_close(pdes[0]);
|
|
(void)_close(pdes[1]);
|
|
return (NULL);
|
|
}
|
|
|
|
argv[0] = "sh";
|
|
argv[1] = "-c";
|
|
argv[2] = (char *)command;
|
|
argv[3] = NULL;
|
|
|
|
switch (pid = vfork()) {
|
|
case -1: /* Error. */
|
|
(void)_close(pdes[0]);
|
|
(void)_close(pdes[1]);
|
|
free(cur);
|
|
return (NULL);
|
|
/* NOTREACHED */
|
|
case 0: /* Child. */
|
|
if (*type == 'r') {
|
|
/*
|
|
* The dup2() to STDIN_FILENO is repeated to avoid
|
|
* writing to pdes[1], which might corrupt the
|
|
* parent's copy. This isn't good enough in
|
|
* general, since the _exit() is no return, so
|
|
* the compiler is free to corrupt all the local
|
|
* variables.
|
|
*/
|
|
(void)_close(pdes[0]);
|
|
if (pdes[1] != STDOUT_FILENO) {
|
|
(void)dup2(pdes[1], STDOUT_FILENO);
|
|
(void)_close(pdes[1]);
|
|
if (twoway)
|
|
(void)dup2(STDOUT_FILENO, STDIN_FILENO);
|
|
} else if (twoway && (pdes[1] != STDIN_FILENO))
|
|
(void)dup2(pdes[1], STDIN_FILENO);
|
|
} else {
|
|
if (pdes[0] != STDIN_FILENO) {
|
|
(void)dup2(pdes[0], STDIN_FILENO);
|
|
(void)_close(pdes[0]);
|
|
}
|
|
(void)_close(pdes[1]);
|
|
}
|
|
for (p = pidlist; p; p = p->next) {
|
|
(void)_close(fileno(p->fp));
|
|
}
|
|
execve(_PATH_BSHELL, argv, environ);
|
|
_exit(127);
|
|
/* NOTREACHED */
|
|
}
|
|
|
|
/* Parent; assume fdopen can't fail. */
|
|
if (*type == 'r') {
|
|
iop = fdopen(pdes[0], type);
|
|
(void)_close(pdes[1]);
|
|
} else {
|
|
iop = fdopen(pdes[1], type);
|
|
(void)_close(pdes[0]);
|
|
}
|
|
|
|
/* Link into list of file descriptors. */
|
|
cur->fp = iop;
|
|
cur->pid = pid;
|
|
cur->next = pidlist;
|
|
pidlist = cur;
|
|
|
|
return (iop);
|
|
}
|
|
|
|
/*
|
|
* pclose --
|
|
* Pclose returns -1 if stream is not associated with a `popened' command,
|
|
* if already `pclosed', or waitpid returns an error.
|
|
*/
|
|
int
|
|
pclose(iop)
|
|
FILE *iop;
|
|
{
|
|
register struct pid *cur, *last;
|
|
int omask;
|
|
int pstat;
|
|
pid_t pid;
|
|
|
|
/* Find the appropriate file pointer. */
|
|
for (last = NULL, cur = pidlist; cur; last = cur, cur = cur->next)
|
|
if (cur->fp == iop)
|
|
break;
|
|
if (cur == NULL)
|
|
return (-1);
|
|
|
|
(void)fclose(iop);
|
|
|
|
do {
|
|
pid = _wait4(cur->pid, &pstat, 0, (struct rusage *)0);
|
|
} while (pid == -1 && errno == EINTR);
|
|
|
|
/* Remove the entry from the linked list. */
|
|
if (last == NULL)
|
|
pidlist = cur->next;
|
|
else
|
|
last->next = cur->next;
|
|
free(cur);
|
|
|
|
return (pid == -1 ? -1 : pstat);
|
|
}
|