popen.c revision 1.19
1 /* $NetBSD: popen.c,v 1.19 2000/01/12 22:39:29 lukem Exp $ */ 2 3 /*- 4 * Copyright (c) 1999 The NetBSD Foundation, Inc. 5 * All rights reserved. 6 * 7 * This code is derived from software contributed to The NetBSD Foundation 8 * by Luke Mewburn. 9 * 10 * Redistribution and use in source and binary forms, with or without 11 * modification, are permitted provided that the following conditions 12 * are met: 13 * 1. Redistributions of source code must retain the above copyright 14 * notice, this list of conditions and the following disclaimer. 15 * 2. Redistributions in binary form must reproduce the above copyright 16 * notice, this list of conditions and the following disclaimer in the 17 * documentation and/or other materials provided with the distribution. 18 * 3. All advertising materials mentioning features or use of this software 19 * must display the following acknowledgement: 20 * This product includes software developed by the NetBSD 21 * Foundation, Inc. and its contributors. 22 * 4. Neither the name of The NetBSD Foundation nor the names of its 23 * contributors may be used to endorse or promote products derived 24 * from this software without specific prior written permission. 25 * 26 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS 27 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED 28 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 29 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS 30 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 31 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 32 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 33 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 34 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 35 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 36 * POSSIBILITY OF SUCH DAMAGE. 37 */ 38 39 /* 40 * Copyright (c) 1988, 1993, 1994 41 * The Regents of the University of California. All rights reserved. 42 * 43 * This code is derived from software written by Ken Arnold and 44 * published in UNIX Review, Vol. 6, No. 8. 45 * 46 * Redistribution and use in source and binary forms, with or without 47 * modification, are permitted provided that the following conditions 48 * are met: 49 * 1. Redistributions of source code must retain the above copyright 50 * notice, this list of conditions and the following disclaimer. 51 * 2. Redistributions in binary form must reproduce the above copyright 52 * notice, this list of conditions and the following disclaimer in the 53 * documentation and/or other materials provided with the distribution. 54 * 3. All advertising materials mentioning features or use of this software 55 * must display the following acknowledgement: 56 * This product includes software developed by the University of 57 * California, Berkeley and its contributors. 58 * 4. Neither the name of the University nor the names of its contributors 59 * may be used to endorse or promote products derived from this software 60 * without specific prior written permission. 61 * 62 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 63 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 64 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 65 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 66 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 67 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 68 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 69 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 70 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 71 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 72 * SUCH DAMAGE. 73 * 74 */ 75 76 #include <sys/cdefs.h> 77 #ifndef lint 78 #if 0 79 static char sccsid[] = "@(#)popen.c 8.3 (Berkeley) 4/6/94"; 80 #else 81 __RCSID("$NetBSD: popen.c,v 1.19 2000/01/12 22:39:29 lukem Exp $"); 82 #endif 83 #endif /* not lint */ 84 85 #include <sys/types.h> 86 #include <sys/wait.h> 87 88 #include <errno.h> 89 #include <glob.h> 90 #include <setjmp.h> 91 #include <signal.h> 92 #include <stdio.h> 93 #include <stdlib.h> 94 #include <string.h> 95 #include <stringlist.h> 96 #include <syslog.h> 97 #include <unistd.h> 98 99 #ifdef KERBEROS5 100 #include <krb5/krb5.h> 101 #endif 102 103 #include "extern.h" 104 105 #define INCR 100 106 /* 107 * Special version of popen which avoids call to shell. This ensures no-one 108 * may create a pipe to a hidden program as a side effect of a list or dir 109 * command. 110 * If stderrfd != -1, then send stderr of a read command there, 111 * otherwise close stderr. 112 */ 113 static int *pids; 114 static int fds; 115 116 extern int ls_main __P((int, char *[])); 117 118 FILE * 119 ftpd_popen(argv, type, stderrfd) 120 char *argv[]; 121 const char *type; 122 int stderrfd; 123 { 124 FILE *iop; 125 int argc, pdes[2], pid, isls; 126 char **pop; 127 StringList *sl; 128 129 iop = NULL; 130 isls = 0; 131 if ((*type != 'r' && *type != 'w') || type[1]) 132 return (NULL); 133 134 if (!pids) { 135 if ((fds = getdtablesize()) <= 0) 136 return (NULL); 137 if ((pids = (int *)malloc((u_int)(fds * sizeof(int)))) == NULL) 138 return (NULL); 139 memset(pids, 0, fds * sizeof(int)); 140 } 141 if (pipe(pdes) < 0) 142 return (NULL); 143 144 if ((sl = sl_init()) == NULL) 145 goto pfree; 146 147 /* glob each piece */ 148 if (sl_add(sl, xstrdup(argv[0])) == -1) 149 goto pfree; 150 for (argc = 1; argv[argc]; argc++) { 151 glob_t gl; 152 int flags = GLOB_BRACE|GLOB_NOCHECK|GLOB_TILDE; 153 154 memset(&gl, 0, sizeof(gl)); 155 if (glob(argv[argc], flags, NULL, &gl)) { 156 if (sl_add(sl, xstrdup(argv[argc])) == -1) 157 goto pfree; 158 } else 159 for (pop = gl.gl_pathv; *pop; pop++) { 160 if (sl_add(sl, xstrdup(*pop)) == -1) 161 goto pfree; 162 } 163 globfree(&gl); 164 } 165 if (sl_add(sl, NULL) == -1) 166 goto pfree; 167 168 isls = (strcmp(sl->sl_str[0], INTERNAL_LS) == 0); 169 170 pid = isls ? fork() : vfork(); 171 switch (pid) { 172 case -1: /* error */ 173 (void)close(pdes[0]); 174 (void)close(pdes[1]); 175 goto pfree; 176 /* NOTREACHED */ 177 case 0: /* child */ 178 if (*type == 'r') { 179 if (pdes[1] != STDOUT_FILENO) { 180 dup2(pdes[1], STDOUT_FILENO); 181 (void)close(pdes[1]); 182 } 183 if (stderrfd == -1) 184 (void)close(STDERR_FILENO); 185 else 186 dup2(stderrfd, STDERR_FILENO); 187 (void)close(pdes[0]); 188 } else { 189 if (pdes[0] != STDIN_FILENO) { 190 dup2(pdes[0], STDIN_FILENO); 191 (void)close(pdes[0]); 192 } 193 (void)close(pdes[1]); 194 } 195 if (isls) { /* use internal ls */ 196 optreset = optind = optopt = 1; 197 closelog(); 198 exit(ls_main(sl->sl_cur - 1, sl->sl_str)); 199 } 200 execv(sl->sl_str[0], sl->sl_str); 201 _exit(1); 202 } 203 /* parent; assume fdopen can't fail... */ 204 if (*type == 'r') { 205 iop = fdopen(pdes[0], type); 206 (void)close(pdes[1]); 207 } else { 208 iop = fdopen(pdes[1], type); 209 (void)close(pdes[0]); 210 } 211 pids[fileno(iop)] = pid; 212 213 pfree: if (sl) 214 sl_free(sl, 1); 215 return (iop); 216 } 217 218 int 219 ftpd_pclose(iop) 220 FILE *iop; 221 { 222 int fdes, status; 223 pid_t pid; 224 sigset_t sigset, osigset; 225 226 /* 227 * pclose returns -1 if stream is not associated with a 228 * `popened' command, or, if already `pclosed'. 229 */ 230 if (pids == 0 || pids[fdes = fileno(iop)] == 0) 231 return (-1); 232 (void)fclose(iop); 233 sigemptyset(&sigset); 234 sigaddset(&sigset, SIGINT); 235 sigaddset(&sigset, SIGQUIT); 236 sigaddset(&sigset, SIGHUP); 237 sigprocmask(SIG_BLOCK, &sigset, &osigset); 238 while ((pid = waitpid(pids[fdes], &status, 0)) < 0 && errno == EINTR) 239 continue; 240 sigprocmask(SIG_SETMASK, &osigset, NULL); 241 pids[fdes] = 0; 242 if (pid < 0) 243 return (pid); 244 if (WIFEXITED(status)) 245 return (WEXITSTATUS(status)); 246 return (1); 247 } 248
Indexes created Thu Oct 02 10:09:58 GMT 2025