kern_descrip.c revision 1.87 1 /* $NetBSD: kern_descrip.c,v 1.87 2002/04/23 17:20:58 christos 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.87 2002/04/23 17:20:58 christos 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 panic("fpathconf");
591 }
592
593 FILE_UNUSE(fp, p);
594 return (error);
595 }
596
597 /*
598 * Allocate a file descriptor for the process.
599 */
600 int fdexpanded; /* XXX: what else uses this? */
601
602 int
603 fdalloc(struct proc *p, int want, int *result)
604 {
605 struct filedesc *fdp;
606 int i, lim, last;
607
608 fdp = p->p_fd;
609
610 /*
611 * Search for a free descriptor starting at the higher
612 * of want or fd_freefile. If that fails, consider
613 * expanding the ofile array.
614 */
615 lim = min((int)p->p_rlimit[RLIMIT_NOFILE].rlim_cur, maxfiles);
616 for (;;) {
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
639 void
640 fdexpand(struct proc *p)
641 {
642 struct filedesc *fdp;
643 int i, nfiles;
644 struct file **newofile;
645 char *newofileflags;
646
647 fdp = p->p_fd;
648
649 if (fdp->fd_nfiles < NDEXTENT)
650 nfiles = NDEXTENT;
651 else
652 nfiles = 2 * fdp->fd_nfiles;
653 newofile = malloc(nfiles * OFILESIZE, M_FILEDESC, M_WAITOK);
654 newofileflags = (char *) &newofile[nfiles];
655 /*
656 * Copy the existing ofile and ofileflags arrays
657 * and zero the new portion of each array.
658 */
659 memcpy(newofile, fdp->fd_ofiles,
660 (i = sizeof(struct file *) * fdp->fd_nfiles));
661 memset((char *)newofile + i, 0,
662 nfiles * sizeof(struct file *) - i);
663 memcpy(newofileflags, fdp->fd_ofileflags,
664 (i = sizeof(char) * fdp->fd_nfiles));
665 memset(newofileflags + i, 0, nfiles * sizeof(char) - i);
666 if (fdp->fd_nfiles > NDFILE)
667 free(fdp->fd_ofiles, M_FILEDESC);
668 fdp->fd_ofiles = newofile;
669 fdp->fd_ofileflags = newofileflags;
670 fdp->fd_nfiles = nfiles;
671 fdexpanded++;
672 }
673
674 /*
675 * Check to see whether n user file descriptors
676 * are available to the process p.
677 */
678 int
679 fdavail(struct proc *p, int n)
680 {
681 struct filedesc *fdp;
682 struct file **fpp;
683 int i, lim;
684
685 fdp = p->p_fd;
686 lim = min((int)p->p_rlimit[RLIMIT_NOFILE].rlim_cur, maxfiles);
687 if ((i = lim - fdp->fd_nfiles) > 0 && (n -= i) <= 0)
688 return (1);
689 fpp = &fdp->fd_ofiles[fdp->fd_freefile];
690 for (i = min(lim,fdp->fd_nfiles) - fdp->fd_freefile; --i >= 0; fpp++)
691 if (*fpp == NULL && --n <= 0)
692 return (1);
693 return (0);
694 }
695
696 /*
697 * Initialize the data structures necessary for managing files.
698 */
699 void
700 finit(void)
701 {
702
703 pool_init(&file_pool, sizeof(struct file), 0, 0, 0, "filepl",
704 &pool_allocator_nointr);
705 pool_init(&cwdi_pool, sizeof(struct cwdinfo), 0, 0, 0, "cwdipl",
706 &pool_allocator_nointr);
707 pool_init(&filedesc0_pool, sizeof(struct filedesc0), 0, 0, 0, "fdescpl",
708 &pool_allocator_nointr);
709 }
710
711 /*
712 * Create a new open file structure and allocate
713 * a file decriptor for the process that refers to it.
714 */
715 int
716 falloc(struct proc *p, struct file **resultfp, int *resultfd)
717 {
718 struct file *fp, *fq;
719 int error, i;
720
721 restart:
722 if ((error = fdalloc(p, 0, &i)) != 0) {
723 if (error == ENOSPC) {
724 fdexpand(p);
725 goto restart;
726 }
727 return (error);
728 }
729 if (nfiles >= maxfiles) {
730 tablefull("file", "increase kern.maxfiles or MAXFILES");
731 return (ENFILE);
732 }
733 /*
734 * Allocate a new file descriptor.
735 * If the process has file descriptor zero open, add to the list
736 * of open files at that point, otherwise put it at the front of
737 * the list of open files.
738 */
739 nfiles++;
740 fp = pool_get(&file_pool, PR_WAITOK);
741 memset(fp, 0, sizeof(struct file));
742 fp->f_iflags = FIF_LARVAL;
743 if ((fq = p->p_fd->fd_ofiles[0]) != NULL) {
744 LIST_INSERT_AFTER(fq, fp, f_list);
745 } else {
746 LIST_INSERT_HEAD(&filehead, fp, f_list);
747 }
748 p->p_fd->fd_ofiles[i] = fp;
749 fp->f_count = 1;
750 fp->f_cred = p->p_ucred;
751 crhold(fp->f_cred);
752 if (resultfp) {
753 FILE_USE(fp);
754 *resultfp = fp;
755 }
756 if (resultfd)
757 *resultfd = i;
758 return (0);
759 }
760
761 /*
762 * Free a file descriptor.
763 */
764 void
765 ffree(struct file *fp)
766 {
767
768 #ifdef DIAGNOSTIC
769 if (fp->f_usecount)
770 panic("ffree");
771 #endif
772
773 LIST_REMOVE(fp, f_list);
774 crfree(fp->f_cred);
775 #ifdef DIAGNOSTIC
776 fp->f_count = 0;
777 #endif
778 nfiles--;
779 pool_put(&file_pool, fp);
780 }
781
782 /*
783 * Create an initial cwdinfo structure, using the same current and root
784 * directories as p.
785 */
786 struct cwdinfo *
787 cwdinit(struct proc *p)
788 {
789 struct cwdinfo *cwdi;
790
791 cwdi = pool_get(&cwdi_pool, PR_WAITOK);
792
793 cwdi->cwdi_cdir = p->p_cwdi->cwdi_cdir;
794 if (cwdi->cwdi_cdir)
795 VREF(cwdi->cwdi_cdir);
796 cwdi->cwdi_rdir = p->p_cwdi->cwdi_rdir;
797 if (cwdi->cwdi_rdir)
798 VREF(cwdi->cwdi_rdir);
799 cwdi->cwdi_cmask = p->p_cwdi->cwdi_cmask;
800 cwdi->cwdi_refcnt = 1;
801
802 return (cwdi);
803 }
804
805 /*
806 * Make p2 share p1's cwdinfo.
807 */
808 void
809 cwdshare(struct proc *p1, struct proc *p2)
810 {
811
812 p2->p_cwdi = p1->p_cwdi;
813 p1->p_cwdi->cwdi_refcnt++;
814 }
815
816 /*
817 * Make this process not share its cwdinfo structure, maintaining
818 * all cwdinfo state.
819 */
820 void
821 cwdunshare(struct proc *p)
822 {
823 struct cwdinfo *newcwdi;
824
825 if (p->p_cwdi->cwdi_refcnt == 1)
826 return;
827
828 newcwdi = cwdinit(p);
829 cwdfree(p);
830 p->p_cwdi = newcwdi;
831 }
832
833 /*
834 * Release a cwdinfo structure.
835 */
836 void
837 cwdfree(struct proc *p)
838 {
839 struct cwdinfo *cwdi;
840
841 cwdi = p->p_cwdi;
842 if (--cwdi->cwdi_refcnt > 0)
843 return;
844
845 p->p_cwdi = NULL;
846
847 vrele(cwdi->cwdi_cdir);
848 if (cwdi->cwdi_rdir)
849 vrele(cwdi->cwdi_rdir);
850 pool_put(&cwdi_pool, cwdi);
851 }
852
853 /*
854 * Create an initial filedesc structure, using the same current and root
855 * directories as p.
856 */
857 struct filedesc *
858 fdinit(struct proc *p)
859 {
860 struct filedesc0 *newfdp;
861
862 newfdp = pool_get(&filedesc0_pool, PR_WAITOK);
863 memset(newfdp, 0, sizeof(struct filedesc0));
864
865 fdinit1(newfdp);
866
867 return (&newfdp->fd_fd);
868 }
869
870 /*
871 * Initialize a file descriptor table.
872 */
873 void
874 fdinit1(struct filedesc0 *newfdp)
875 {
876
877 newfdp->fd_fd.fd_refcnt = 1;
878 newfdp->fd_fd.fd_ofiles = newfdp->fd_dfiles;
879 newfdp->fd_fd.fd_ofileflags = newfdp->fd_dfileflags;
880 newfdp->fd_fd.fd_nfiles = NDFILE;
881 }
882
883 /*
884 * Make p2 share p1's filedesc structure.
885 */
886 void
887 fdshare(struct proc *p1, struct proc *p2)
888 {
889
890 p2->p_fd = p1->p_fd;
891 p1->p_fd->fd_refcnt++;
892 }
893
894 /*
895 * Make this process not share its filedesc structure, maintaining
896 * all file descriptor state.
897 */
898 void
899 fdunshare(struct proc *p)
900 {
901 struct filedesc *newfd;
902
903 if (p->p_fd->fd_refcnt == 1)
904 return;
905
906 newfd = fdcopy(p);
907 fdfree(p);
908 p->p_fd = newfd;
909 }
910
911 /*
912 * Clear a process's fd table.
913 */
914 void
915 fdclear(struct proc *p)
916 {
917 struct filedesc *newfd;
918
919 newfd = fdinit(p);
920 fdfree(p);
921 p->p_fd = newfd;
922 }
923
924 /*
925 * Copy a filedesc structure.
926 */
927 struct filedesc *
928 fdcopy(struct proc *p)
929 {
930 struct filedesc *newfdp, *fdp;
931 struct file **fpp;
932 int i;
933
934 fdp = p->p_fd;
935 newfdp = pool_get(&filedesc0_pool, PR_WAITOK);
936 memcpy(newfdp, fdp, sizeof(struct filedesc));
937 newfdp->fd_refcnt = 1;
938
939 /*
940 * If the number of open files fits in the internal arrays
941 * of the open file structure, use them, otherwise allocate
942 * additional memory for the number of descriptors currently
943 * in use.
944 */
945 if (newfdp->fd_lastfile < NDFILE) {
946 newfdp->fd_ofiles = ((struct filedesc0 *) newfdp)->fd_dfiles;
947 newfdp->fd_ofileflags =
948 ((struct filedesc0 *) newfdp)->fd_dfileflags;
949 i = NDFILE;
950 } else {
951 /*
952 * Compute the smallest multiple of NDEXTENT needed
953 * for the file descriptors currently in use,
954 * allowing the table to shrink.
955 */
956 i = newfdp->fd_nfiles;
957 while (i >= 2 * NDEXTENT && i > newfdp->fd_lastfile * 2)
958 i /= 2;
959 newfdp->fd_ofiles = malloc(i * OFILESIZE, M_FILEDESC, M_WAITOK);
960 newfdp->fd_ofileflags = (char *) &newfdp->fd_ofiles[i];
961 }
962 newfdp->fd_nfiles = i;
963 memcpy(newfdp->fd_ofiles, fdp->fd_ofiles, i * sizeof(struct file **));
964 memcpy(newfdp->fd_ofileflags, fdp->fd_ofileflags, i * sizeof(char));
965 fpp = newfdp->fd_ofiles;
966 for (i = newfdp->fd_lastfile; i >= 0; i--, fpp++)
967 if (*fpp != NULL)
968 (*fpp)->f_count++;
969 return (newfdp);
970 }
971
972 /*
973 * Release a filedesc structure.
974 */
975 void
976 fdfree(struct proc *p)
977 {
978 struct filedesc *fdp;
979 struct file **fpp, *fp;
980 int i;
981
982 fdp = p->p_fd;
983 if (--fdp->fd_refcnt > 0)
984 return;
985 fpp = fdp->fd_ofiles;
986 for (i = fdp->fd_lastfile; i >= 0; i--, fpp++) {
987 fp = *fpp;
988 if (fp != NULL) {
989 *fpp = NULL;
990 FILE_USE(fp);
991 (void) closef(fp, p);
992 }
993 }
994 p->p_fd = NULL;
995 if (fdp->fd_nfiles > NDFILE)
996 free(fdp->fd_ofiles, M_FILEDESC);
997 pool_put(&filedesc0_pool, fdp);
998 }
999
1000 /*
1001 * Internal form of close.
1002 * Decrement reference count on file structure.
1003 * Note: p may be NULL when closing a file
1004 * that was being passed in a message.
1005 *
1006 * Note: we expect the caller is holding a usecount, and expects us
1007 * to drop it (the caller thinks the file is going away forever).
1008 */
1009 int
1010 closef(struct file *fp, struct proc *p)
1011 {
1012 struct vnode *vp;
1013 struct flock lf;
1014 int error;
1015
1016 if (fp == NULL)
1017 return (0);
1018
1019 /*
1020 * POSIX record locking dictates that any close releases ALL
1021 * locks owned by this process. This is handled by setting
1022 * a flag in the unlock to free ONLY locks obeying POSIX
1023 * semantics, and not to free BSD-style file locks.
1024 * If the descriptor was in a message, POSIX-style locks
1025 * aren't passed with the descriptor.
1026 */
1027 if (p && (p->p_flag & P_ADVLOCK) && fp->f_type == DTYPE_VNODE) {
1028 lf.l_whence = SEEK_SET;
1029 lf.l_start = 0;
1030 lf.l_len = 0;
1031 lf.l_type = F_UNLCK;
1032 vp = (struct vnode *)fp->f_data;
1033 (void) VOP_ADVLOCK(vp, (caddr_t)p, F_UNLCK, &lf, F_POSIX);
1034 }
1035
1036 /*
1037 * If WANTCLOSE is set, then the reference count on the file
1038 * is 0, but there were multiple users of the file. This can
1039 * happen if a filedesc structure is shared by multiple
1040 * processes.
1041 */
1042 if (fp->f_iflags & FIF_WANTCLOSE) {
1043 /*
1044 * Another user of the file is already closing, and is
1045 * simply waiting for other users of the file to drain.
1046 * Release our usecount, and wake up the closer if it
1047 * is the only remaining use.
1048 */
1049 #ifdef DIAGNOSTIC
1050 if (fp->f_count != 0)
1051 panic("closef: wantclose and count != 0");
1052 if (fp->f_usecount < 2)
1053 panic("closef: wantclose and usecount < 2");
1054 #endif
1055 if (--fp->f_usecount == 1)
1056 wakeup(&fp->f_usecount);
1057 return (0);
1058 } else {
1059 /*
1060 * Decrement the reference count. If we were not the
1061 * last reference, then release our use and just
1062 * return.
1063 */
1064 if (--fp->f_count > 0) {
1065 #ifdef DIAGNOSTIC
1066 if (fp->f_usecount < 1)
1067 panic("closef: no wantclose and usecount < 1");
1068 #endif
1069 fp->f_usecount--;
1070 return (0);
1071 }
1072 if (fp->f_count < 0)
1073 panic("closef: count < 0");
1074 }
1075
1076 /*
1077 * The reference count is now 0. However, there may be
1078 * multiple potential users of this file. This can happen
1079 * if multiple processes shared a single filedesc structure.
1080 *
1081 * Notify these potential users that the file is closing.
1082 * This will prevent them from adding additional uses to
1083 * the file.
1084 */
1085 fp->f_iflags |= FIF_WANTCLOSE;
1086
1087 /*
1088 * We expect the caller to add a use to the file. So, if we
1089 * are the last user, usecount will be 1. If it is not, we
1090 * must wait for the usecount to drain. When it drains back
1091 * to 1, we will be awakened so that we may proceed with the
1092 * close.
1093 */
1094 #ifdef DIAGNOSTIC
1095 if (fp->f_usecount < 1)
1096 panic("closef: usecount < 1");
1097 #endif
1098 while (fp->f_usecount > 1)
1099 (void) tsleep(&fp->f_usecount, PRIBIO, "closef", 0);
1100 #ifdef DIAGNOSTIC
1101 if (fp->f_usecount != 1)
1102 panic("closef: usecount != 1");
1103 #endif
1104
1105 if ((fp->f_flag & FHASLOCK) && fp->f_type == DTYPE_VNODE) {
1106 lf.l_whence = SEEK_SET;
1107 lf.l_start = 0;
1108 lf.l_len = 0;
1109 lf.l_type = F_UNLCK;
1110 vp = (struct vnode *)fp->f_data;
1111 (void) VOP_ADVLOCK(vp, (caddr_t)fp, F_UNLCK, &lf, F_FLOCK);
1112 }
1113 if (fp->f_ops)
1114 error = (*fp->f_ops->fo_close)(fp, p);
1115 else
1116 error = 0;
1117
1118 /* Nothing references the file now, drop the final use (us). */
1119 fp->f_usecount--;
1120
1121 ffree(fp);
1122 return (error);
1123 }
1124
1125 /*
1126 * Apply an advisory lock on a file descriptor.
1127 *
1128 * Just attempt to get a record lock of the requested type on
1129 * the entire file (l_whence = SEEK_SET, l_start = 0, l_len = 0).
1130 */
1131 /* ARGSUSED */
1132 int
1133 sys_flock(struct proc *p, void *v, register_t *retval)
1134 {
1135 struct sys_flock_args /* {
1136 syscallarg(int) fd;
1137 syscallarg(int) how;
1138 } */ *uap = v;
1139 int fd, how, error;
1140 struct filedesc *fdp;
1141 struct file *fp;
1142 struct vnode *vp;
1143 struct flock lf;
1144
1145 fd = SCARG(uap, fd);
1146 how = SCARG(uap, how);
1147 fdp = p->p_fd;
1148 error = 0;
1149
1150 if ((fp = fd_getfile(fdp, fd)) == NULL)
1151 return (EBADF);
1152
1153 FILE_USE(fp);
1154
1155 if (fp->f_type != DTYPE_VNODE) {
1156 error = EOPNOTSUPP;
1157 goto out;
1158 }
1159
1160 vp = (struct vnode *)fp->f_data;
1161 lf.l_whence = SEEK_SET;
1162 lf.l_start = 0;
1163 lf.l_len = 0;
1164 if (how & LOCK_UN) {
1165 lf.l_type = F_UNLCK;
1166 fp->f_flag &= ~FHASLOCK;
1167 error = VOP_ADVLOCK(vp, (caddr_t)fp, F_UNLCK, &lf, F_FLOCK);
1168 goto out;
1169 }
1170 if (how & LOCK_EX)
1171 lf.l_type = F_WRLCK;
1172 else if (how & LOCK_SH)
1173 lf.l_type = F_RDLCK;
1174 else {
1175 error = EINVAL;
1176 goto out;
1177 }
1178 fp->f_flag |= FHASLOCK;
1179 if (how & LOCK_NB)
1180 error = VOP_ADVLOCK(vp, (caddr_t)fp, F_SETLK, &lf, F_FLOCK);
1181 else
1182 error = VOP_ADVLOCK(vp, (caddr_t)fp, F_SETLK, &lf,
1183 F_FLOCK|F_WAIT);
1184 out:
1185 FILE_UNUSE(fp, p);
1186 return (error);
1187 }
1188
1189 /*
1190 * File Descriptor pseudo-device driver (/dev/fd/).
1191 *
1192 * Opening minor device N dup()s the file (if any) connected to file
1193 * descriptor N belonging to the calling process. Note that this driver
1194 * consists of only the ``open()'' routine, because all subsequent
1195 * references to this file will be direct to the other driver.
1196 */
1197 /* ARGSUSED */
1198 int
1199 filedescopen(dev_t dev, int mode, int type, struct proc *p)
1200 {
1201
1202 /*
1203 * XXX Kludge: set p->p_dupfd to contain the value of the
1204 * the file descriptor being sought for duplication. The error
1205 * return ensures that the vnode for this device will be released
1206 * by vn_open. Open will detect this special error and take the
1207 * actions in dupfdopen below. Other callers of vn_open or VOP_OPEN
1208 * will simply report the error.
1209 */
1210 p->p_dupfd = minor(dev);
1211 return (ENODEV);
1212 }
1213
1214 /*
1215 * Duplicate the specified descriptor to a free descriptor.
1216 */
1217 int
1218 dupfdopen(struct proc *p, int indx, int dfd, int mode, int error)
1219 {
1220 struct filedesc *fdp;
1221 struct file *wfp, *fp;
1222
1223 fdp = p->p_fd;
1224 /*
1225 * If the to-be-dup'd fd number is greater than the allowed number
1226 * of file descriptors, or the fd to be dup'd has already been
1227 * closed, reject. Note, check for new == old is necessary as
1228 * falloc could allocate an already closed to-be-dup'd descriptor
1229 * as the new descriptor.
1230 */
1231 fp = fdp->fd_ofiles[indx];
1232
1233 if ((wfp = fd_getfile(fdp, dfd)) == NULL)
1234 return (EBADF);
1235
1236 if (fp == wfp)
1237 return (EBADF);
1238
1239 FILE_USE(wfp);
1240
1241 /*
1242 * There are two cases of interest here.
1243 *
1244 * For ENODEV simply dup (dfd) to file descriptor
1245 * (indx) and return.
1246 *
1247 * For ENXIO steal away the file structure from (dfd) and
1248 * store it in (indx). (dfd) is effectively closed by
1249 * this operation.
1250 *
1251 * Any other error code is just returned.
1252 */
1253 switch (error) {
1254 case ENODEV:
1255 /*
1256 * Check that the mode the file is being opened for is a
1257 * subset of the mode of the existing descriptor.
1258 */
1259 if (((mode & (FREAD|FWRITE)) | wfp->f_flag) != wfp->f_flag) {
1260 FILE_UNUSE(wfp, p);
1261 return (EACCES);
1262 }
1263 fdp->fd_ofiles[indx] = wfp;
1264 fdp->fd_ofileflags[indx] = fdp->fd_ofileflags[dfd];
1265 wfp->f_count++;
1266 fd_used(fdp, indx);
1267 FILE_UNUSE(wfp, p);
1268 return (0);
1269
1270 case ENXIO:
1271 /*
1272 * Steal away the file pointer from dfd, and stuff it into indx.
1273 */
1274 fdp->fd_ofiles[indx] = fdp->fd_ofiles[dfd];
1275 fdp->fd_ofileflags[indx] = fdp->fd_ofileflags[dfd];
1276 fdp->fd_ofiles[dfd] = NULL;
1277 fdp->fd_ofileflags[dfd] = 0;
1278 /*
1279 * Complete the clean up of the filedesc structure by
1280 * recomputing the various hints.
1281 */
1282 fd_used(fdp, indx);
1283 fd_unused(fdp, dfd);
1284 FILE_UNUSE(wfp, p);
1285 return (0);
1286
1287 default:
1288 FILE_UNUSE(wfp, p);
1289 return (error);
1290 }
1291 /* NOTREACHED */
1292 }
1293
1294 /*
1295 * fcntl call which is being passed to the file's fs.
1296 */
1297 int
1298 fcntl_forfs(int fd, struct proc *p, int cmd, void *arg)
1299 {
1300 struct file *fp;
1301 struct filedesc *fdp;
1302 int error;
1303 u_int size;
1304 caddr_t data, memp;
1305 #define STK_PARAMS 128
1306 char stkbuf[STK_PARAMS];
1307
1308 /* fd's value was validated in sys_fcntl before calling this routine */
1309 fdp = p->p_fd;
1310 fp = fdp->fd_ofiles[fd];
1311
1312 if ((fp->f_flag & (FREAD | FWRITE)) == 0)
1313 return (EBADF);
1314
1315 /*
1316 * Interpret high order word to find amount of data to be
1317 * copied to/from the user's address space.
1318 */
1319 size = (size_t)F_PARAM_LEN(cmd);
1320 if (size > F_PARAM_MAX)
1321 return (EINVAL);
1322 memp = NULL;
1323 if (size > sizeof(stkbuf)) {
1324 memp = (caddr_t)malloc((u_long)size, M_IOCTLOPS, M_WAITOK);
1325 data = memp;
1326 } else
1327 data = stkbuf;
1328 if (cmd & F_FSIN) {
1329 if (size) {
1330 error = copyin(arg, data, size);
1331 if (error) {
1332 if (memp)
1333 free(memp, M_IOCTLOPS);
1334 return (error);
1335 }
1336 } else
1337 *(caddr_t *)data = arg;
1338 } else if ((cmd & F_FSOUT) && size)
1339 /*
1340 * Zero the buffer so the user always
1341 * gets back something deterministic.
1342 */
1343 memset(data, 0, size);
1344 else if (cmd & F_FSVOID)
1345 *(caddr_t *)data = arg;
1346
1347
1348 error = (*fp->f_ops->fo_fcntl)(fp, cmd, data, p);
1349
1350 /*
1351 * Copy any data to user, size was
1352 * already set and checked above.
1353 */
1354 if (error == 0 && (cmd & F_FSOUT) && size)
1355 error = copyout(data, arg, size);
1356 if (memp)
1357 free(memp, M_IOCTLOPS);
1358 return (error);
1359 }
1360
1361 /*
1362 * Close any files on exec?
1363 */
1364 void
1365 fdcloseexec(struct proc *p)
1366 {
1367 struct filedesc *fdp;
1368 int fd;
1369
1370 fdunshare(p);
1371 cwdunshare(p);
1372
1373 fdp = p->p_fd;
1374 for (fd = 0; fd <= fdp->fd_lastfile; fd++)
1375 if (fdp->fd_ofileflags[fd] & UF_EXCLOSE)
1376 (void) fdrelease(p, fd);
1377 }
1378
1379 /*
1380 * It is unsafe for set[ug]id processes to be started with file
1381 * descriptors 0..2 closed, as these descriptors are given implicit
1382 * significance in the Standard C library. fdcheckstd() will create a
1383 * descriptor referencing /dev/null for each of stdin, stdout, and
1384 * stderr that is not already open.
1385 */
1386 int
1387 fdcheckstd(p)
1388 struct proc *p;
1389 {
1390 struct nameidata nd;
1391 struct filedesc *fdp;
1392 struct file *fp;
1393 register_t retval;
1394 int fd, i, error, flags = FREAD|FWRITE, devnull = -1, logged = 0;
1395
1396 if ((fdp = p->p_fd) == NULL)
1397 return 0;
1398 for (i = 0; i < 3; i++) {
1399 if (fdp->fd_ofiles[i] != NULL)
1400 continue;
1401 if (!logged) {
1402 log(LOG_WARNING, "set{u,g}id pid %d (%s) was invoked "
1403 "with fd 0, 1, or 2 closed\n", p->p_pid, p->p_comm);
1404 logged++;
1405 }
1406 if (devnull < 0) {
1407 if ((error = falloc(p, &fp, &fd)) != 0)
1408 return error;
1409 NDINIT(&nd, LOOKUP, FOLLOW, UIO_SYSSPACE, "/dev/null",
1410 p);
1411 if ((error = vn_open(&nd, flags, 0)) != 0) {
1412 FILE_UNUSE(fp, p);
1413 ffree(fp);
1414 fdremove(p->p_fd, fd);
1415 return error;
1416 }
1417 fp->f_data = (caddr_t)nd.ni_vp;
1418 fp->f_flag = flags;
1419 fp->f_ops = &vnops;
1420 fp->f_type = DTYPE_VNODE;
1421 VOP_UNLOCK(nd.ni_vp, 0);
1422 devnull = fd;
1423 FILE_SET_MATURE(fp);
1424 FILE_UNUSE(fp, p);
1425 } else {
1426 restart:
1427 if ((error = fdalloc(p, 0, &fd)) != 0) {
1428 if (error == ENOSPC) {
1429 fdexpand(p);
1430 goto restart;
1431 }
1432 return error;
1433 }
1434 if ((error = finishdup(p, devnull, fd, &retval)) != 0)
1435 return error;
1436 }
1437 }
1438 return 0;
1439 }
1440