kern_descrip.c revision 1.93 1 /* $NetBSD: kern_descrip.c,v 1.93 2002/06/18 02:04:08 thorpej Exp $ */
2
3 /*
4 * Copyright (c) 1982, 1986, 1989, 1991, 1993
5 * The Regents of the University of California. All rights reserved.
6 * (c) UNIX System Laboratories, Inc.
7 * All or some portions of this file are derived from material licensed
8 * to the University of California by American Telephone and Telegraph
9 * Co. or Unix System Laboratories, Inc. and are reproduced herein with
10 * the permission of UNIX System Laboratories, Inc.
11 *
12 * Redistribution and use in source and binary forms, with or without
13 * modification, are permitted provided that the following conditions
14 * are met:
15 * 1. Redistributions of source code must retain the above copyright
16 * notice, this list of conditions and the following disclaimer.
17 * 2. Redistributions in binary form must reproduce the above copyright
18 * notice, this list of conditions and the following disclaimer in the
19 * documentation and/or other materials provided with the distribution.
20 * 3. All advertising materials mentioning features or use of this software
21 * must display the following acknowledgement:
22 * This product includes software developed by the University of
23 * California, Berkeley and its contributors.
24 * 4. Neither the name of the University nor the names of its contributors
25 * may be used to endorse or promote products derived from this software
26 * without specific prior written permission.
27 *
28 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
29 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
30 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
31 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
32 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
33 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
34 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
35 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
36 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
37 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
38 * SUCH DAMAGE.
39 *
40 * @(#)kern_descrip.c 8.8 (Berkeley) 2/14/95
41 */
42
43 #include <sys/cdefs.h>
44 __KERNEL_RCSID(0, "$NetBSD: kern_descrip.c,v 1.93 2002/06/18 02:04:08 thorpej Exp $");
45
46 #include <sys/param.h>
47 #include <sys/systm.h>
48 #include <sys/filedesc.h>
49 #include <sys/kernel.h>
50 #include <sys/vnode.h>
51 #include <sys/proc.h>
52 #include <sys/file.h>
53 #include <sys/namei.h>
54 #include <sys/socket.h>
55 #include <sys/socketvar.h>
56 #include <sys/stat.h>
57 #include <sys/ioctl.h>
58 #include <sys/fcntl.h>
59 #include <sys/malloc.h>
60 #include <sys/pool.h>
61 #include <sys/syslog.h>
62 #include <sys/unistd.h>
63 #include <sys/resourcevar.h>
64 #include <sys/conf.h>
65
66 #include <sys/mount.h>
67 #include <sys/syscallargs.h>
68
69 /*
70 * Descriptor management.
71 */
72 struct filelist filehead; /* head of list of open files */
73 int nfiles; /* actual number of open files */
74 struct pool file_pool; /* memory pool for file structures */
75 struct pool cwdi_pool; /* memory pool for cwdinfo structures */
76 struct pool filedesc0_pool; /* memory pool for filedesc0 structures */
77
78 static __inline void fd_used(struct filedesc *, int);
79 static __inline void fd_unused(struct filedesc *, int);
80 int finishdup(struct proc *, int, int, register_t *);
81 int fcntl_forfs(int, struct proc *, int, void *);
82
83 static __inline void
84 fd_used(struct filedesc *fdp, int fd)
85 {
86
87 if (fd > fdp->fd_lastfile)
88 fdp->fd_lastfile = fd;
89 }
90
91 static __inline void
92 fd_unused(struct filedesc *fdp, int fd)
93 {
94
95 if (fd < fdp->fd_freefile)
96 fdp->fd_freefile = fd;
97 #ifdef DIAGNOSTIC
98 if (fd > fdp->fd_lastfile)
99 panic("fd_unused: fd_lastfile inconsistent");
100 #endif
101 if (fd == fdp->fd_lastfile) {
102 do {
103 fd--;
104 } while (fd >= 0 && fdp->fd_ofiles[fd] == NULL);
105 fdp->fd_lastfile = fd;
106 }
107 }
108
109 struct file *
110 fd_getfile(struct filedesc *fdp, int fd)
111 {
112 struct file *fp;
113
114 if ((u_int) fd >= fdp->fd_nfiles || (fp = fdp->fd_ofiles[fd]) == NULL)
115 return (NULL);
116
117 if (FILE_IS_USABLE(fp) == 0)
118 return (NULL);
119
120 return (fp);
121 }
122
123 /*
124 * System calls on descriptors.
125 */
126
127 /*
128 * Duplicate a file descriptor.
129 */
130 /* ARGSUSED */
131 int
132 sys_dup(struct proc *p, void *v, register_t *retval)
133 {
134 struct sys_dup_args /* {
135 syscallarg(int) fd;
136 } */ *uap = v;
137 struct file *fp;
138 struct filedesc *fdp;
139 int old, new, error;
140
141 fdp = p->p_fd;
142 old = SCARG(uap, fd);
143
144 restart:
145 if ((fp = fd_getfile(fdp, old)) == NULL)
146 return (EBADF);
147
148 FILE_USE(fp);
149
150 if ((error = fdalloc(p, 0, &new)) != 0) {
151 if (error == ENOSPC) {
152 fdexpand(p);
153 FILE_UNUSE(fp, p);
154 goto restart;
155 }
156 FILE_UNUSE(fp, p);
157 return (error);
158 }
159
160 /* finishdup() will unuse the descriptors for us */
161 return (finishdup(p, old, new, retval));
162 }
163
164 /*
165 * Duplicate a file descriptor to a particular value.
166 */
167 /* ARGSUSED */
168 int
169 sys_dup2(struct proc *p, void *v, register_t *retval)
170 {
171 struct sys_dup2_args /* {
172 syscallarg(int) from;
173 syscallarg(int) to;
174 } */ *uap = v;
175 struct file *fp;
176 struct filedesc *fdp;
177 int old, new, i, error;
178
179 fdp = p->p_fd;
180 old = SCARG(uap, from);
181 new = SCARG(uap, to);
182
183 restart:
184 if ((fp = fd_getfile(fdp, old)) == NULL)
185 return (EBADF);
186
187 if ((u_int)new >= p->p_rlimit[RLIMIT_NOFILE].rlim_cur ||
188 (u_int)new >= maxfiles)
189 return (EBADF);
190
191 if (old == new) {
192 *retval = new;
193 return (0);
194 }
195
196 FILE_USE(fp);
197
198 if (new >= fdp->fd_nfiles) {
199 if ((error = fdalloc(p, new, &i)) != 0) {
200 if (error == ENOSPC) {
201 fdexpand(p);
202 FILE_UNUSE(fp, p);
203 goto restart;
204 }
205 FILE_UNUSE(fp, p);
206 return (error);
207 }
208 if (new != i)
209 panic("dup2: fdalloc");
210 }
211
212 /*
213 * finishdup() will close the file that's in the `new'
214 * slot, if there's one there.
215 */
216
217 /* finishdup() will unuse the descriptors for us */
218 return (finishdup(p, old, new, retval));
219 }
220
221 /*
222 * The file control system call.
223 */
224 /* ARGSUSED */
225 int
226 sys_fcntl(struct proc *p, void *v, register_t *retval)
227 {
228 struct sys_fcntl_args /* {
229 syscallarg(int) fd;
230 syscallarg(int) cmd;
231 syscallarg(void *) arg;
232 } */ *uap = v;
233 struct filedesc *fdp;
234 struct file *fp;
235 struct vnode *vp;
236 int fd, i, tmp, error, flg, cmd, newmin;
237 struct flock fl;
238
239 fd = SCARG(uap, fd);
240 fdp = p->p_fd;
241 error = 0;
242 flg = F_POSIX;
243
244 restart:
245 if ((fp = fd_getfile(fdp, fd)) == NULL)
246 return (EBADF);
247
248 FILE_USE(fp);
249
250 cmd = SCARG(uap, cmd);
251 if ((cmd & F_FSCTL)) {
252 error = fcntl_forfs(fd, p, cmd, SCARG(uap, arg));
253 goto out;
254 }
255
256 switch (cmd) {
257
258 case F_DUPFD:
259 newmin = (long)SCARG(uap, arg);
260 if ((u_int)newmin >= p->p_rlimit[RLIMIT_NOFILE].rlim_cur ||
261 (u_int)newmin >= maxfiles) {
262 error = EINVAL;
263 goto out;
264 }
265 if ((error = fdalloc(p, newmin, &i)) != 0) {
266 if (error == ENOSPC) {
267 fdexpand(p);
268 FILE_UNUSE(fp, p);
269 goto restart;
270 }
271 goto out;
272 }
273
274 /* finishdup() will unuse the descriptors for us */
275 return (finishdup(p, fd, i, retval));
276
277 case F_GETFD:
278 *retval = fdp->fd_ofileflags[fd] & UF_EXCLOSE ? 1 : 0;
279 break;
280
281 case F_SETFD:
282 if ((long)SCARG(uap, arg) & 1)
283 fdp->fd_ofileflags[fd] |= UF_EXCLOSE;
284 else
285 fdp->fd_ofileflags[fd] &= ~UF_EXCLOSE;
286 break;
287
288 case F_GETFL:
289 *retval = OFLAGS(fp->f_flag);
290 break;
291
292 case F_SETFL:
293 tmp = FFLAGS((long)SCARG(uap, arg)) & FCNTLFLAGS;
294 error = (*fp->f_ops->fo_fcntl)(fp, F_SETFL, (caddr_t)&tmp, p);
295 if (error)
296 goto out;
297 fp->f_flag &= ~FCNTLFLAGS;
298 fp->f_flag |= tmp;
299 tmp = fp->f_flag & FNONBLOCK;
300 error = (*fp->f_ops->fo_ioctl)(fp, FIONBIO, (caddr_t)&tmp, p);
301 if (error)
302 goto out;
303 tmp = fp->f_flag & FASYNC;
304 error = (*fp->f_ops->fo_ioctl)(fp, FIOASYNC, (caddr_t)&tmp, p);
305 if (error == 0)
306 goto out;
307 fp->f_flag &= ~FNONBLOCK;
308 tmp = 0;
309 (void) (*fp->f_ops->fo_ioctl)(fp, FIONBIO, (caddr_t)&tmp, p);
310 break;
311
312 case F_GETOWN:
313 if (fp->f_type == DTYPE_SOCKET) {
314 *retval = ((struct socket *)fp->f_data)->so_pgid;
315 goto out;
316 }
317 error = (*fp->f_ops->fo_ioctl)
318 (fp, TIOCGPGRP, (caddr_t)&tmp, p);
319 *retval = -tmp;
320 break;
321
322 case F_SETOWN:
323 if (fp->f_type == DTYPE_SOCKET) {
324 ((struct socket *)fp->f_data)->so_pgid =
325 (long)SCARG(uap, arg);
326 goto out;
327 }
328 if ((long)SCARG(uap, arg) <= 0) {
329 tmp = (-(long)SCARG(uap, arg));
330 } else {
331 struct proc *p1 = pfind((long)SCARG(uap, arg));
332 if (p1 == 0) {
333 error = ESRCH;
334 goto out;
335 }
336 tmp = (long)p1->p_pgrp->pg_id;
337 }
338 error = (*fp->f_ops->fo_ioctl)
339 (fp, TIOCSPGRP, (caddr_t)&tmp, p);
340 break;
341
342 case F_SETLKW:
343 flg |= F_WAIT;
344 /* Fall into F_SETLK */
345
346 case F_SETLK:
347 if (fp->f_type != DTYPE_VNODE) {
348 error = EINVAL;
349 goto out;
350 }
351 vp = (struct vnode *)fp->f_data;
352 /* Copy in the lock structure */
353 error = copyin((caddr_t)SCARG(uap, arg), (caddr_t)&fl,
354 sizeof(fl));
355 if (error)
356 goto out;
357 if (fl.l_whence == SEEK_CUR)
358 fl.l_start += fp->f_offset;
359 switch (fl.l_type) {
360 case F_RDLCK:
361 if ((fp->f_flag & FREAD) == 0) {
362 error = EBADF;
363 goto out;
364 }
365 p->p_flag |= P_ADVLOCK;
366 error = VOP_ADVLOCK(vp, (caddr_t)p, F_SETLK, &fl, flg);
367 goto out;
368
369 case F_WRLCK:
370 if ((fp->f_flag & FWRITE) == 0) {
371 error = EBADF;
372 goto out;
373 }
374 p->p_flag |= P_ADVLOCK;
375 error = VOP_ADVLOCK(vp, (caddr_t)p, F_SETLK, &fl, flg);
376 goto out;
377
378 case F_UNLCK:
379 error = VOP_ADVLOCK(vp, (caddr_t)p, F_UNLCK, &fl,
380 F_POSIX);
381 goto out;
382
383 default:
384 error = EINVAL;
385 goto out;
386 }
387
388 case F_GETLK:
389 if (fp->f_type != DTYPE_VNODE) {
390 error = EINVAL;
391 goto out;
392 }
393 vp = (struct vnode *)fp->f_data;
394 /* Copy in the lock structure */
395 error = copyin((caddr_t)SCARG(uap, arg), (caddr_t)&fl,
396 sizeof(fl));
397 if (error)
398 goto out;
399 if (fl.l_whence == SEEK_CUR)
400 fl.l_start += fp->f_offset;
401 if (fl.l_type != F_RDLCK &&
402 fl.l_type != F_WRLCK &&
403 fl.l_type != F_UNLCK) {
404 error = EINVAL;
405 goto out;
406 }
407 error = VOP_ADVLOCK(vp, (caddr_t)p, F_GETLK, &fl, F_POSIX);
408 if (error)
409 goto out;
410 error = copyout((caddr_t)&fl, (caddr_t)SCARG(uap, arg),
411 sizeof(fl));
412 break;
413
414 default:
415 error = EINVAL;
416 }
417
418 out:
419 FILE_UNUSE(fp, p);
420 return (error);
421 }
422
423 /*
424 * Common code for dup, dup2, and fcntl(F_DUPFD).
425 */
426 int
427 finishdup(struct proc *p, int old, int new, register_t *retval)
428 {
429 struct filedesc *fdp;
430 struct file *fp, *delfp;
431
432 fdp = p->p_fd;
433
434 /*
435 * If there is a file in the new slot, remember it so we
436 * can close it after we've finished the dup. We need
437 * to do it after the dup is finished, since closing
438 * the file may block.
439 *
440 * Note: `old' is already used for us.
441 */
442 delfp = fdp->fd_ofiles[new];
443
444 fp = fdp->fd_ofiles[old];
445 fdp->fd_ofiles[new] = fp;
446 fdp->fd_ofileflags[new] = fdp->fd_ofileflags[old] &~ UF_EXCLOSE;
447 fp->f_count++;
448 /*
449 * Note, don't have to mark it "used" in the table if there
450 * was already a file in the `new' slot.
451 */
452 if (delfp == NULL)
453 fd_used(fdp, new);
454 *retval = new;
455 FILE_UNUSE(fp, p);
456
457 if (delfp != NULL) {
458 FILE_USE(delfp);
459 (void) closef(delfp, p);
460 }
461 return (0);
462 }
463
464 void
465 fdremove(struct filedesc *fdp, int fd)
466 {
467
468 fdp->fd_ofiles[fd] = NULL;
469 fd_unused(fdp, fd);
470 }
471
472 int
473 fdrelease(struct proc *p, int fd)
474 {
475 struct filedesc *fdp;
476 struct file **fpp, *fp;
477
478 fdp = p->p_fd;
479 fpp = &fdp->fd_ofiles[fd];
480 fp = *fpp;
481 if (fp == NULL)
482 return (EBADF);
483
484 FILE_USE(fp);
485
486 *fpp = NULL;
487 fdp->fd_ofileflags[fd] = 0;
488 fd_unused(fdp, fd);
489 return (closef(fp, p));
490 }
491
492 /*
493 * Close a file descriptor.
494 */
495 /* ARGSUSED */
496 int
497 sys_close(struct proc *p, void *v, register_t *retval)
498 {
499 struct sys_close_args /* {
500 syscallarg(int) fd;
501 } */ *uap = v;
502 int fd;
503 struct filedesc *fdp;
504 struct file *fp;
505
506 fd = SCARG(uap, fd);
507 fdp = p->p_fd;
508
509 if ((fp = fd_getfile(fdp, fd)) == NULL)
510 return (EBADF);
511
512 return (fdrelease(p, fd));
513 }
514
515 /*
516 * Return status information about a file descriptor.
517 */
518 /* ARGSUSED */
519 int
520 sys___fstat13(struct proc *p, void *v, register_t *retval)
521 {
522 struct sys___fstat13_args /* {
523 syscallarg(int) fd;
524 syscallarg(struct stat *) sb;
525 } */ *uap = v;
526 int fd;
527 struct filedesc *fdp;
528 struct file *fp;
529 struct stat ub;
530 int error;
531
532 fd = SCARG(uap, fd);
533 fdp = p->p_fd;
534
535 if ((fp = fd_getfile(fdp, fd)) == NULL)
536 return (EBADF);
537
538 FILE_USE(fp);
539 error = (*fp->f_ops->fo_stat)(fp, &ub, p);
540 FILE_UNUSE(fp, p);
541
542 if (error == 0)
543 error = copyout(&ub, SCARG(uap, sb), sizeof(ub));
544
545 return (error);
546 }
547
548 /*
549 * Return pathconf information about a file descriptor.
550 */
551 /* ARGSUSED */
552 int
553 sys_fpathconf(struct proc *p, void *v, register_t *retval)
554 {
555 struct sys_fpathconf_args /* {
556 syscallarg(int) fd;
557 syscallarg(int) name;
558 } */ *uap = v;
559 int fd;
560 struct filedesc *fdp;
561 struct file *fp;
562 struct vnode *vp;
563 int error;
564
565 fd = SCARG(uap, fd);
566 fdp = p->p_fd;
567 error = 0;
568
569 if ((fp = fd_getfile(fdp, fd)) == NULL)
570 return (EBADF);
571
572 FILE_USE(fp);
573
574 switch (fp->f_type) {
575
576 case DTYPE_SOCKET:
577 case DTYPE_PIPE:
578 if (SCARG(uap, name) != _PC_PIPE_BUF)
579 error = EINVAL;
580 else
581 *retval = PIPE_BUF;
582 break;
583
584 case DTYPE_VNODE:
585 vp = (struct vnode *)fp->f_data;
586 error = VOP_PATHCONF(vp, SCARG(uap, name), retval);
587 break;
588
589 default:
590 error = EOPNOTSUPP;
591 break;
592 }
593
594 FILE_UNUSE(fp, p);
595 return (error);
596 }
597
598 /*
599 * Allocate a file descriptor for the process.
600 */
601 int fdexpanded; /* XXX: what else uses this? */
602
603 int
604 fdalloc(struct proc *p, int want, int *result)
605 {
606 struct filedesc *fdp;
607 int i, lim, last;
608
609 fdp = p->p_fd;
610
611 /*
612 * Search for a free descriptor starting at the higher
613 * of want or fd_freefile. If that fails, consider
614 * expanding the ofile array.
615 */
616 lim = min((int)p->p_rlimit[RLIMIT_NOFILE].rlim_cur, maxfiles);
617 last = min(fdp->fd_nfiles, lim);
618 if ((i = want) < fdp->fd_freefile)
619 i = fdp->fd_freefile;
620 for (; i < last; i++) {
621 if (fdp->fd_ofiles[i] == NULL) {
622 fd_used(fdp, i);
623 if (want <= fdp->fd_freefile)
624 fdp->fd_freefile = i;
625 *result = i;
626 return (0);
627 }
628 }
629
630 /* No space in current array. Expand? */
631 if (fdp->fd_nfiles >= lim)
632 return (EMFILE);
633
634 /* Let the caller do it. */
635 return (ENOSPC);
636 }
637
638 void
639 fdexpand(struct proc *p)
640 {
641 struct filedesc *fdp;
642 int i, nfiles;
643 struct file **newofile;
644 char *newofileflags;
645
646 fdp = p->p_fd;
647
648 if (fdp->fd_nfiles < NDEXTENT)
649 nfiles = NDEXTENT;
650 else
651 nfiles = 2 * fdp->fd_nfiles;
652 newofile = malloc(nfiles * OFILESIZE, M_FILEDESC, M_WAITOK);
653 newofileflags = (char *) &newofile[nfiles];
654 /*
655 * Copy the existing ofile and ofileflags arrays
656 * and zero the new portion of each array.
657 */
658 memcpy(newofile, fdp->fd_ofiles,
659 (i = sizeof(struct file *) * fdp->fd_nfiles));
660 memset((char *)newofile + i, 0,
661 nfiles * sizeof(struct file *) - i);
662 memcpy(newofileflags, fdp->fd_ofileflags,
663 (i = sizeof(char) * fdp->fd_nfiles));
664 memset(newofileflags + i, 0, nfiles * sizeof(char) - i);
665 if (fdp->fd_nfiles > NDFILE)
666 free(fdp->fd_ofiles, M_FILEDESC);
667 fdp->fd_ofiles = newofile;
668 fdp->fd_ofileflags = newofileflags;
669 fdp->fd_nfiles = nfiles;
670 fdexpanded++;
671 }
672
673 /*
674 * Check to see whether n user file descriptors
675 * are available to the process p.
676 */
677 int
678 fdavail(struct proc *p, int n)
679 {
680 struct filedesc *fdp;
681 struct file **fpp;
682 int i, lim;
683
684 fdp = p->p_fd;
685 lim = min((int)p->p_rlimit[RLIMIT_NOFILE].rlim_cur, maxfiles);
686 if ((i = lim - fdp->fd_nfiles) > 0 && (n -= i) <= 0)
687 return (1);
688 fpp = &fdp->fd_ofiles[fdp->fd_freefile];
689 for (i = min(lim,fdp->fd_nfiles) - fdp->fd_freefile; --i >= 0; fpp++)
690 if (*fpp == NULL && --n <= 0)
691 return (1);
692 return (0);
693 }
694
695 /*
696 * Initialize the data structures necessary for managing files.
697 */
698 void
699 finit(void)
700 {
701
702 pool_init(&file_pool, sizeof(struct file), 0, 0, 0, "filepl",
703 &pool_allocator_nointr);
704 pool_init(&cwdi_pool, sizeof(struct cwdinfo), 0, 0, 0, "cwdipl",
705 &pool_allocator_nointr);
706 pool_init(&filedesc0_pool, sizeof(struct filedesc0), 0, 0, 0, "fdescpl",
707 &pool_allocator_nointr);
708 }
709
710 /*
711 * Create a new open file structure and allocate
712 * a file decriptor for the process that refers to it.
713 */
714 int
715 falloc(struct proc *p, struct file **resultfp, int *resultfd)
716 {
717 struct file *fp, *fq;
718 int error, i;
719
720 restart:
721 if ((error = fdalloc(p, 0, &i)) != 0) {
722 if (error == ENOSPC) {
723 fdexpand(p);
724 goto restart;
725 }
726 return (error);
727 }
728 if (nfiles >= maxfiles) {
729 tablefull("file", "increase kern.maxfiles or MAXFILES");
730 return (ENFILE);
731 }
732 /*
733 * Allocate a new file descriptor.
734 * If the process has file descriptor zero open, add to the list
735 * of open files at that point, otherwise put it at the front of
736 * the list of open files.
737 */
738 nfiles++;
739 fp = pool_get(&file_pool, PR_WAITOK);
740 memset(fp, 0, sizeof(struct file));
741 fp->f_iflags = FIF_LARVAL;
742 if ((fq = p->p_fd->fd_ofiles[0]) != NULL) {
743 LIST_INSERT_AFTER(fq, fp, f_list);
744 } else {
745 LIST_INSERT_HEAD(&filehead, fp, f_list);
746 }
747 p->p_fd->fd_ofiles[i] = fp;
748 fp->f_count = 1;
749 fp->f_cred = p->p_ucred;
750 crhold(fp->f_cred);
751 if (resultfp) {
752 FILE_USE(fp);
753 *resultfp = fp;
754 }
755 if (resultfd)
756 *resultfd = i;
757 return (0);
758 }
759
760 /*
761 * Free a file descriptor.
762 */
763 void
764 ffree(struct file *fp)
765 {
766
767 #ifdef DIAGNOSTIC
768 if (fp->f_usecount)
769 panic("ffree");
770 #endif
771
772 LIST_REMOVE(fp, f_list);
773 crfree(fp->f_cred);
774 #ifdef DIAGNOSTIC
775 fp->f_count = 0;
776 #endif
777 nfiles--;
778 pool_put(&file_pool, fp);
779 }
780
781 /*
782 * Create an initial cwdinfo structure, using the same current and root
783 * directories as p.
784 */
785 struct cwdinfo *
786 cwdinit(struct proc *p)
787 {
788 struct cwdinfo *cwdi;
789
790 cwdi = pool_get(&cwdi_pool, PR_WAITOK);
791
792 cwdi->cwdi_cdir = p->p_cwdi->cwdi_cdir;
793 if (cwdi->cwdi_cdir)
794 VREF(cwdi->cwdi_cdir);
795 cwdi->cwdi_rdir = p->p_cwdi->cwdi_rdir;
796 if (cwdi->cwdi_rdir)
797 VREF(cwdi->cwdi_rdir);
798 cwdi->cwdi_cmask = p->p_cwdi->cwdi_cmask;
799 cwdi->cwdi_refcnt = 1;
800
801 return (cwdi);
802 }
803
804 /*
805 * Make p2 share p1's cwdinfo.
806 */
807 void
808 cwdshare(struct proc *p1, struct proc *p2)
809 {
810
811 p2->p_cwdi = p1->p_cwdi;
812 p1->p_cwdi->cwdi_refcnt++;
813 }
814
815 /*
816 * Make this process not share its cwdinfo structure, maintaining
817 * all cwdinfo state.
818 */
819 void
820 cwdunshare(struct proc *p)
821 {
822 struct cwdinfo *newcwdi;
823
824 if (p->p_cwdi->cwdi_refcnt == 1)
825 return;
826
827 newcwdi = cwdinit(p);
828 cwdfree(p);
829 p->p_cwdi = newcwdi;
830 }
831
832 /*
833 * Release a cwdinfo structure.
834 */
835 void
836 cwdfree(struct proc *p)
837 {
838 struct cwdinfo *cwdi;
839
840 cwdi = p->p_cwdi;
841 if (--cwdi->cwdi_refcnt > 0)
842 return;
843
844 p->p_cwdi = NULL;
845
846 vrele(cwdi->cwdi_cdir);
847 if (cwdi->cwdi_rdir)
848 vrele(cwdi->cwdi_rdir);
849 pool_put(&cwdi_pool, cwdi);
850 }
851
852 /*
853 * Create an initial filedesc structure, using the same current and root
854 * directories as p.
855 */
856 struct filedesc *
857 fdinit(struct proc *p)
858 {
859 struct filedesc0 *newfdp;
860
861 newfdp = pool_get(&filedesc0_pool, PR_WAITOK);
862 memset(newfdp, 0, sizeof(struct filedesc0));
863
864 fdinit1(newfdp);
865
866 return (&newfdp->fd_fd);
867 }
868
869 /*
870 * Initialize a file descriptor table.
871 */
872 void
873 fdinit1(struct filedesc0 *newfdp)
874 {
875
876 newfdp->fd_fd.fd_refcnt = 1;
877 newfdp->fd_fd.fd_ofiles = newfdp->fd_dfiles;
878 newfdp->fd_fd.fd_ofileflags = newfdp->fd_dfileflags;
879 newfdp->fd_fd.fd_nfiles = NDFILE;
880 }
881
882 /*
883 * Make p2 share p1's filedesc structure.
884 */
885 void
886 fdshare(struct proc *p1, struct proc *p2)
887 {
888
889 p2->p_fd = p1->p_fd;
890 p1->p_fd->fd_refcnt++;
891 }
892
893 /*
894 * Make this process not share its filedesc structure, maintaining
895 * all file descriptor state.
896 */
897 void
898 fdunshare(struct proc *p)
899 {
900 struct filedesc *newfd;
901
902 if (p->p_fd->fd_refcnt == 1)
903 return;
904
905 newfd = fdcopy(p);
906 fdfree(p);
907 p->p_fd = newfd;
908 }
909
910 /*
911 * Clear a process's fd table.
912 */
913 void
914 fdclear(struct proc *p)
915 {
916 struct filedesc *newfd;
917
918 newfd = fdinit(p);
919 fdfree(p);
920 p->p_fd = newfd;
921 }
922
923 /*
924 * Copy a filedesc structure.
925 */
926 struct filedesc *
927 fdcopy(struct proc *p)
928 {
929 struct filedesc *newfdp, *fdp;
930 struct file **fpp;
931 int i;
932
933 fdp = p->p_fd;
934 newfdp = pool_get(&filedesc0_pool, PR_WAITOK);
935 memcpy(newfdp, fdp, sizeof(struct filedesc));
936 newfdp->fd_refcnt = 1;
937
938 /*
939 * If the number of open files fits in the internal arrays
940 * of the open file structure, use them, otherwise allocate
941 * additional memory for the number of descriptors currently
942 * in use.
943 */
944 if (newfdp->fd_lastfile < NDFILE) {
945 newfdp->fd_ofiles = ((struct filedesc0 *) newfdp)->fd_dfiles;
946 newfdp->fd_ofileflags =
947 ((struct filedesc0 *) newfdp)->fd_dfileflags;
948 i = NDFILE;
949 } else {
950 /*
951 * Compute the smallest multiple of NDEXTENT needed
952 * for the file descriptors currently in use,
953 * allowing the table to shrink.
954 */
955 i = newfdp->fd_nfiles;
956 while (i >= 2 * NDEXTENT && i > newfdp->fd_lastfile * 2)
957 i /= 2;
958 newfdp->fd_ofiles = malloc(i * OFILESIZE, M_FILEDESC, M_WAITOK);
959 newfdp->fd_ofileflags = (char *) &newfdp->fd_ofiles[i];
960 }
961 newfdp->fd_nfiles = i;
962 memcpy(newfdp->fd_ofiles, fdp->fd_ofiles, i * sizeof(struct file **));
963 memcpy(newfdp->fd_ofileflags, fdp->fd_ofileflags, i * sizeof(char));
964 fpp = newfdp->fd_ofiles;
965 for (i = newfdp->fd_lastfile; i >= 0; i--, fpp++)
966 if (*fpp != NULL)
967 (*fpp)->f_count++;
968 return (newfdp);
969 }
970
971 /*
972 * Release a filedesc structure.
973 */
974 void
975 fdfree(struct proc *p)
976 {
977 struct filedesc *fdp;
978 struct file **fpp, *fp;
979 int i;
980
981 fdp = p->p_fd;
982 if (--fdp->fd_refcnt > 0)
983 return;
984 fpp = fdp->fd_ofiles;
985 for (i = fdp->fd_lastfile; i >= 0; i--, fpp++) {
986 fp = *fpp;
987 if (fp != NULL) {
988 *fpp = NULL;
989 FILE_USE(fp);
990 (void) closef(fp, p);
991 }
992 }
993 p->p_fd = NULL;
994 if (fdp->fd_nfiles > NDFILE)
995 free(fdp->fd_ofiles, M_FILEDESC);
996 pool_put(&filedesc0_pool, fdp);
997 }
998
999 /*
1000 * Internal form of close.
1001 * Decrement reference count on file structure.
1002 * Note: p may be NULL when closing a file
1003 * that was being passed in a message.
1004 *
1005 * Note: we expect the caller is holding a usecount, and expects us
1006 * to drop it (the caller thinks the file is going away forever).
1007 */
1008 int
1009 closef(struct file *fp, struct proc *p)
1010 {
1011 struct vnode *vp;
1012 struct flock lf;
1013 int error;
1014
1015 if (fp == NULL)
1016 return (0);
1017
1018 /*
1019 * POSIX record locking dictates that any close releases ALL
1020 * locks owned by this process. This is handled by setting
1021 * a flag in the unlock to free ONLY locks obeying POSIX
1022 * semantics, and not to free BSD-style file locks.
1023 * If the descriptor was in a message, POSIX-style locks
1024 * aren't passed with the descriptor.
1025 */
1026 if (p && (p->p_flag & P_ADVLOCK) && fp->f_type == DTYPE_VNODE) {
1027 lf.l_whence = SEEK_SET;
1028 lf.l_start = 0;
1029 lf.l_len = 0;
1030 lf.l_type = F_UNLCK;
1031 vp = (struct vnode *)fp->f_data;
1032 (void) VOP_ADVLOCK(vp, (caddr_t)p, F_UNLCK, &lf, F_POSIX);
1033 }
1034
1035 /*
1036 * If WANTCLOSE is set, then the reference count on the file
1037 * is 0, but there were multiple users of the file. This can
1038 * happen if a filedesc structure is shared by multiple
1039 * processes.
1040 */
1041 if (fp->f_iflags & FIF_WANTCLOSE) {
1042 /*
1043 * Another user of the file is already closing, and is
1044 * simply waiting for other users of the file to drain.
1045 * Release our usecount, and wake up the closer if it
1046 * is the only remaining use.
1047 */
1048 #ifdef DIAGNOSTIC
1049 if (fp->f_count != 0)
1050 panic("closef: wantclose and count != 0");
1051 if (fp->f_usecount < 2)
1052 panic("closef: wantclose and usecount < 2");
1053 #endif
1054 if (--fp->f_usecount == 1)
1055 wakeup(&fp->f_usecount);
1056 return (0);
1057 } else {
1058 /*
1059 * Decrement the reference count. If we were not the
1060 * last reference, then release our use and just
1061 * return.
1062 */
1063 if (--fp->f_count > 0) {
1064 #ifdef DIAGNOSTIC
1065 if (fp->f_usecount < 1)
1066 panic("closef: no wantclose and usecount < 1");
1067 #endif
1068 fp->f_usecount--;
1069 return (0);
1070 }
1071 if (fp->f_count < 0)
1072 panic("closef: count < 0");
1073 }
1074
1075 /*
1076 * The reference count is now 0. However, there may be
1077 * multiple potential users of this file. This can happen
1078 * if multiple processes shared a single filedesc structure.
1079 *
1080 * Notify these potential users that the file is closing.
1081 * This will prevent them from adding additional uses to
1082 * the file.
1083 */
1084 fp->f_iflags |= FIF_WANTCLOSE;
1085
1086 /*
1087 * We expect the caller to add a use to the file. So, if we
1088 * are the last user, usecount will be 1. If it is not, we
1089 * must wait for the usecount to drain. When it drains back
1090 * to 1, we will be awakened so that we may proceed with the
1091 * close.
1092 */
1093 #ifdef DIAGNOSTIC
1094 if (fp->f_usecount < 1)
1095 panic("closef: usecount < 1");
1096 #endif
1097 while (fp->f_usecount > 1)
1098 (void) tsleep(&fp->f_usecount, PRIBIO, "closef", 0);
1099 #ifdef DIAGNOSTIC
1100 if (fp->f_usecount != 1)
1101 panic("closef: usecount != 1");
1102 #endif
1103
1104 if ((fp->f_flag & FHASLOCK) && fp->f_type == DTYPE_VNODE) {
1105 lf.l_whence = SEEK_SET;
1106 lf.l_start = 0;
1107 lf.l_len = 0;
1108 lf.l_type = F_UNLCK;
1109 vp = (struct vnode *)fp->f_data;
1110 (void) VOP_ADVLOCK(vp, (caddr_t)fp, F_UNLCK, &lf, F_FLOCK);
1111 }
1112 if (fp->f_ops)
1113 error = (*fp->f_ops->fo_close)(fp, p);
1114 else
1115 error = 0;
1116
1117 /* Nothing references the file now, drop the final use (us). */
1118 fp->f_usecount--;
1119
1120 ffree(fp);
1121 return (error);
1122 }
1123
1124 /*
1125 * Apply an advisory lock on a file descriptor.
1126 *
1127 * Just attempt to get a record lock of the requested type on
1128 * the entire file (l_whence = SEEK_SET, l_start = 0, l_len = 0).
1129 */
1130 /* ARGSUSED */
1131 int
1132 sys_flock(struct proc *p, void *v, register_t *retval)
1133 {
1134 struct sys_flock_args /* {
1135 syscallarg(int) fd;
1136 syscallarg(int) how;
1137 } */ *uap = v;
1138 int fd, how, error;
1139 struct filedesc *fdp;
1140 struct file *fp;
1141 struct vnode *vp;
1142 struct flock lf;
1143
1144 fd = SCARG(uap, fd);
1145 how = SCARG(uap, how);
1146 fdp = p->p_fd;
1147 error = 0;
1148
1149 if ((fp = fd_getfile(fdp, fd)) == NULL)
1150 return (EBADF);
1151
1152 FILE_USE(fp);
1153
1154 if (fp->f_type != DTYPE_VNODE) {
1155 error = EOPNOTSUPP;
1156 goto out;
1157 }
1158
1159 vp = (struct vnode *)fp->f_data;
1160 lf.l_whence = SEEK_SET;
1161 lf.l_start = 0;
1162 lf.l_len = 0;
1163 if (how & LOCK_UN) {
1164 lf.l_type = F_UNLCK;
1165 fp->f_flag &= ~FHASLOCK;
1166 error = VOP_ADVLOCK(vp, (caddr_t)fp, F_UNLCK, &lf, F_FLOCK);
1167 goto out;
1168 }
1169 if (how & LOCK_EX)
1170 lf.l_type = F_WRLCK;
1171 else if (how & LOCK_SH)
1172 lf.l_type = F_RDLCK;
1173 else {
1174 error = EINVAL;
1175 goto out;
1176 }
1177 fp->f_flag |= FHASLOCK;
1178 if (how & LOCK_NB)
1179 error = VOP_ADVLOCK(vp, (caddr_t)fp, F_SETLK, &lf, F_FLOCK);
1180 else
1181 error = VOP_ADVLOCK(vp, (caddr_t)fp, F_SETLK, &lf,
1182 F_FLOCK|F_WAIT);
1183 out:
1184 FILE_UNUSE(fp, p);
1185 return (error);
1186 }
1187
1188 /*
1189 * File Descriptor pseudo-device driver (/dev/fd/).
1190 *
1191 * Opening minor device N dup()s the file (if any) connected to file
1192 * descriptor N belonging to the calling process. Note that this driver
1193 * consists of only the ``open()'' routine, because all subsequent
1194 * references to this file will be direct to the other driver.
1195 */
1196 /* ARGSUSED */
1197 int
1198 filedescopen(dev_t dev, int mode, int type, struct proc *p)
1199 {
1200
1201 /*
1202 * XXX Kludge: set p->p_dupfd to contain the value of the
1203 * the file descriptor being sought for duplication. The error
1204 * return ensures that the vnode for this device will be released
1205 * by vn_open. Open will detect this special error and take the
1206 * actions in dupfdopen below. Other callers of vn_open or VOP_OPEN
1207 * will simply report the error.
1208 */
1209 p->p_dupfd = minor(dev);
1210 return (ENODEV);
1211 }
1212
1213 /*
1214 * Duplicate the specified descriptor to a free descriptor.
1215 */
1216 int
1217 dupfdopen(struct proc *p, int indx, int dfd, int mode, int error)
1218 {
1219 struct filedesc *fdp;
1220 struct file *wfp, *fp;
1221
1222 fdp = p->p_fd;
1223 /*
1224 * If the to-be-dup'd fd number is greater than the allowed number
1225 * of file descriptors, or the fd to be dup'd has already been
1226 * closed, reject. Note, check for new == old is necessary as
1227 * falloc could allocate an already closed to-be-dup'd descriptor
1228 * as the new descriptor.
1229 */
1230 fp = fdp->fd_ofiles[indx];
1231
1232 if ((wfp = fd_getfile(fdp, dfd)) == NULL)
1233 return (EBADF);
1234
1235 if (fp == wfp)
1236 return (EBADF);
1237
1238 FILE_USE(wfp);
1239
1240 /*
1241 * There are two cases of interest here.
1242 *
1243 * For ENODEV simply dup (dfd) to file descriptor
1244 * (indx) and return.
1245 *
1246 * For ENXIO steal away the file structure from (dfd) and
1247 * store it in (indx). (dfd) is effectively closed by
1248 * this operation.
1249 *
1250 * Any other error code is just returned.
1251 */
1252 switch (error) {
1253 case ENODEV:
1254 /*
1255 * Check that the mode the file is being opened for is a
1256 * subset of the mode of the existing descriptor.
1257 */
1258 if (((mode & (FREAD|FWRITE)) | wfp->f_flag) != wfp->f_flag) {
1259 FILE_UNUSE(wfp, p);
1260 return (EACCES);
1261 }
1262 fdp->fd_ofiles[indx] = wfp;
1263 fdp->fd_ofileflags[indx] = fdp->fd_ofileflags[dfd];
1264 wfp->f_count++;
1265 fd_used(fdp, indx);
1266 FILE_UNUSE(wfp, p);
1267 return (0);
1268
1269 case ENXIO:
1270 /*
1271 * Steal away the file pointer from dfd, and stuff it into indx.
1272 */
1273 fdp->fd_ofiles[indx] = fdp->fd_ofiles[dfd];
1274 fdp->fd_ofileflags[indx] = fdp->fd_ofileflags[dfd];
1275 fdp->fd_ofiles[dfd] = NULL;
1276 fdp->fd_ofileflags[dfd] = 0;
1277 /*
1278 * Complete the clean up of the filedesc structure by
1279 * recomputing the various hints.
1280 */
1281 fd_used(fdp, indx);
1282 fd_unused(fdp, dfd);
1283 FILE_UNUSE(wfp, p);
1284 return (0);
1285
1286 default:
1287 FILE_UNUSE(wfp, p);
1288 return (error);
1289 }
1290 /* NOTREACHED */
1291 }
1292
1293 /*
1294 * fcntl call which is being passed to the file's fs.
1295 */
1296 int
1297 fcntl_forfs(int fd, struct proc *p, int cmd, void *arg)
1298 {
1299 struct file *fp;
1300 struct filedesc *fdp;
1301 int error;
1302 u_int size;
1303 caddr_t data, memp;
1304 #define STK_PARAMS 128
1305 char stkbuf[STK_PARAMS];
1306
1307 /* fd's value was validated in sys_fcntl before calling this routine */
1308 fdp = p->p_fd;
1309 fp = fdp->fd_ofiles[fd];
1310
1311 if ((fp->f_flag & (FREAD | FWRITE)) == 0)
1312 return (EBADF);
1313
1314 /*
1315 * Interpret high order word to find amount of data to be
1316 * copied to/from the user's address space.
1317 */
1318 size = (size_t)F_PARAM_LEN(cmd);
1319 if (size > F_PARAM_MAX)
1320 return (EINVAL);
1321 memp = NULL;
1322 if (size > sizeof(stkbuf)) {
1323 memp = (caddr_t)malloc((u_long)size, M_IOCTLOPS, M_WAITOK);
1324 data = memp;
1325 } else
1326 data = stkbuf;
1327 if (cmd & F_FSIN) {
1328 if (size) {
1329 error = copyin(arg, data, size);
1330 if (error) {
1331 if (memp)
1332 free(memp, M_IOCTLOPS);
1333 return (error);
1334 }
1335 } else
1336 *(caddr_t *)data = arg;
1337 } else if ((cmd & F_FSOUT) && size)
1338 /*
1339 * Zero the buffer so the user always
1340 * gets back something deterministic.
1341 */
1342 memset(data, 0, size);
1343 else if (cmd & F_FSVOID)
1344 *(caddr_t *)data = arg;
1345
1346
1347 error = (*fp->f_ops->fo_fcntl)(fp, cmd, data, p);
1348
1349 /*
1350 * Copy any data to user, size was
1351 * already set and checked above.
1352 */
1353 if (error == 0 && (cmd & F_FSOUT) && size)
1354 error = copyout(data, arg, size);
1355 if (memp)
1356 free(memp, M_IOCTLOPS);
1357 return (error);
1358 }
1359
1360 /*
1361 * Close any files on exec?
1362 */
1363 void
1364 fdcloseexec(struct proc *p)
1365 {
1366 struct filedesc *fdp;
1367 int fd;
1368
1369 fdunshare(p);
1370 cwdunshare(p);
1371
1372 fdp = p->p_fd;
1373 for (fd = 0; fd <= fdp->fd_lastfile; fd++)
1374 if (fdp->fd_ofileflags[fd] & UF_EXCLOSE)
1375 (void) fdrelease(p, fd);
1376 }
1377
1378 /*
1379 * It is unsafe for set[ug]id processes to be started with file
1380 * descriptors 0..2 closed, as these descriptors are given implicit
1381 * significance in the Standard C library. fdcheckstd() will create a
1382 * descriptor referencing /dev/null for each of stdin, stdout, and
1383 * stderr that is not already open.
1384 */
1385 #define CHECK_UPTO 3
1386 int
1387 fdcheckstd(p)
1388 struct proc *p;
1389 {
1390 struct nameidata nd;
1391 struct filedesc *fdp;
1392 struct file *fp;
1393 struct file *devnullfp;
1394 struct proc *pp;
1395 register_t retval;
1396 int fd, i, error, flags = FREAD|FWRITE, devnull = -1;
1397 char closed[CHECK_UPTO * 3 + 1], which[3 + 1];
1398
1399 closed[0] = '\0';
1400 if ((fdp = p->p_fd) == NULL)
1401 return (0);
1402 for (i = 0; i < CHECK_UPTO; i++) {
1403 if (fdp->fd_ofiles[i] != NULL)
1404 continue;
1405 snprintf(which, sizeof(which), ",%d", i);
1406 strcat(closed, which);
1407 if (devnull < 0) {
1408 if ((error = falloc(p, &fp, &fd)) != 0)
1409 return (error);
1410 NDINIT(&nd, LOOKUP, FOLLOW, UIO_SYSSPACE, "/dev/null",
1411 p);
1412 if ((error = vn_open(&nd, flags, 0)) != 0) {
1413 FILE_UNUSE(fp, p);
1414 ffree(fp);
1415 fdremove(p->p_fd, fd);
1416 return (error);
1417 }
1418 fp->f_data = (caddr_t)nd.ni_vp;
1419 fp->f_flag = flags;
1420 fp->f_ops = &vnops;
1421 fp->f_type = DTYPE_VNODE;
1422 VOP_UNLOCK(nd.ni_vp, 0);
1423 devnull = fd;
1424 devnullfp = fp;
1425 FILE_SET_MATURE(fp);
1426 FILE_UNUSE(fp, p);
1427 } else {
1428 restart:
1429 if ((error = fdalloc(p, 0, &fd)) != 0) {
1430 if (error == ENOSPC) {
1431 fdexpand(p);
1432 goto restart;
1433 }
1434 return (error);
1435 }
1436
1437 FILE_USE(devnullfp);
1438 /* finishdup() will unuse the descriptors for us */
1439 if ((error = finishdup(p, devnull, fd, &retval)) != 0)
1440 return (error);
1441 }
1442 }
1443 if (closed[0] != '\0') {
1444 pp = p->p_pptr;
1445 log(LOG_WARNING, "set{u,g}id pid %d (%s) "
1446 "was invoked by uid %d ppid %d (%s) "
1447 "with fd %s closed\n",
1448 p->p_pid, p->p_comm, pp->p_ucred->cr_uid,
1449 pp->p_pid, pp->p_comm, &closed[1]);
1450 }
1451 return (0);
1452 }
1453 #undef CHECK_UPTO
1454