2002-04-28 01:31:41 +04:00
|
|
|
/* $NetBSD: kern_descrip.c,v 1.89 2002/04/27 21:31:41 enami Exp $ */
|
1994-06-29 10:29:24 +04:00
|
|
|
|
1994-05-17 08:21:49 +04:00
|
|
|
/*
|
1994-05-19 12:13:09 +04:00
|
|
|
* Copyright (c) 1982, 1986, 1989, 1991, 1993
|
|
|
|
* The Regents of the University of California. All rights reserved.
|
1994-05-17 08:21:49 +04:00
|
|
|
* (c) UNIX System Laboratories, Inc.
|
|
|
|
* All or some portions of this file are derived from material licensed
|
|
|
|
* to the University of California by American Telephone and Telegraph
|
|
|
|
* Co. or Unix System Laboratories, Inc. and are reproduced herein with
|
|
|
|
* the permission of UNIX System Laboratories, Inc.
|
|
|
|
*
|
|
|
|
* 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.
|
|
|
|
*
|
1998-03-01 05:20:01 +03:00
|
|
|
* @(#)kern_descrip.c 8.8 (Berkeley) 2/14/95
|
1994-05-17 08:21:49 +04:00
|
|
|
*/
|
|
|
|
|
2001-11-12 18:25:01 +03:00
|
|
|
#include <sys/cdefs.h>
|
2002-04-28 01:31:41 +04:00
|
|
|
__KERNEL_RCSID(0, "$NetBSD: kern_descrip.c,v 1.89 2002/04/27 21:31:41 enami Exp $");
|
2001-11-12 18:25:01 +03:00
|
|
|
|
1994-05-17 08:21:49 +04:00
|
|
|
#include <sys/param.h>
|
|
|
|
#include <sys/systm.h>
|
|
|
|
#include <sys/filedesc.h>
|
|
|
|
#include <sys/kernel.h>
|
|
|
|
#include <sys/vnode.h>
|
|
|
|
#include <sys/proc.h>
|
|
|
|
#include <sys/file.h>
|
2002-04-23 19:11:25 +04:00
|
|
|
#include <sys/namei.h>
|
1994-05-17 08:21:49 +04:00
|
|
|
#include <sys/socket.h>
|
|
|
|
#include <sys/socketvar.h>
|
|
|
|
#include <sys/stat.h>
|
|
|
|
#include <sys/ioctl.h>
|
|
|
|
#include <sys/fcntl.h>
|
|
|
|
#include <sys/malloc.h>
|
1998-09-01 03:55:37 +04:00
|
|
|
#include <sys/pool.h>
|
1994-05-17 08:21:49 +04:00
|
|
|
#include <sys/syslog.h>
|
1994-05-19 12:13:09 +04:00
|
|
|
#include <sys/unistd.h>
|
1994-05-17 08:21:49 +04:00
|
|
|
#include <sys/resourcevar.h>
|
1996-03-31 01:24:38 +03:00
|
|
|
#include <sys/conf.h>
|
1994-05-17 08:21:49 +04:00
|
|
|
|
1994-10-20 07:22:35 +03:00
|
|
|
#include <sys/mount.h>
|
|
|
|
#include <sys/syscallargs.h>
|
|
|
|
|
1994-05-17 08:21:49 +04:00
|
|
|
/*
|
|
|
|
* Descriptor management.
|
|
|
|
*/
|
2001-02-26 23:24:30 +03:00
|
|
|
struct filelist filehead; /* head of list of open files */
|
|
|
|
int nfiles; /* actual number of open files */
|
|
|
|
struct pool file_pool; /* memory pool for file structures */
|
|
|
|
struct pool cwdi_pool; /* memory pool for cwdinfo structures */
|
|
|
|
struct pool filedesc0_pool; /* memory pool for filedesc0 structures */
|
1994-05-17 08:21:49 +04:00
|
|
|
|
2001-02-26 23:24:30 +03:00
|
|
|
static __inline void fd_used(struct filedesc *, int);
|
|
|
|
static __inline void fd_unused(struct filedesc *, int);
|
|
|
|
int finishdup(struct proc *, int, int, register_t *);
|
|
|
|
int fcntl_forfs(int, struct proc *, int, void *);
|
1996-02-04 05:15:01 +03:00
|
|
|
|
|
|
|
static __inline void
|
2001-02-26 23:24:30 +03:00
|
|
|
fd_used(struct filedesc *fdp, int fd)
|
1994-12-04 06:09:50 +03:00
|
|
|
{
|
|
|
|
|
|
|
|
if (fd > fdp->fd_lastfile)
|
|
|
|
fdp->fd_lastfile = fd;
|
|
|
|
}
|
|
|
|
|
1996-02-04 05:15:01 +03:00
|
|
|
static __inline void
|
2001-02-26 23:24:30 +03:00
|
|
|
fd_unused(struct filedesc *fdp, int fd)
|
1994-12-04 06:09:50 +03:00
|
|
|
{
|
|
|
|
|
|
|
|
if (fd < fdp->fd_freefile)
|
|
|
|
fdp->fd_freefile = fd;
|
|
|
|
#ifdef DIAGNOSTIC
|
|
|
|
if (fd > fdp->fd_lastfile)
|
|
|
|
panic("fd_unused: fd_lastfile inconsistent");
|
|
|
|
#endif
|
|
|
|
if (fd == fdp->fd_lastfile) {
|
|
|
|
do {
|
|
|
|
fd--;
|
|
|
|
} while (fd >= 0 && fdp->fd_ofiles[fd] == NULL);
|
|
|
|
fdp->fd_lastfile = fd;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2001-06-15 00:32:41 +04:00
|
|
|
struct file *
|
|
|
|
fd_getfile(struct filedesc *fdp, int fd)
|
|
|
|
{
|
|
|
|
struct file *fp;
|
|
|
|
|
|
|
|
if ((u_int) fd >= fdp->fd_nfiles || (fp = fdp->fd_ofiles[fd]) == NULL)
|
|
|
|
return (NULL);
|
|
|
|
|
|
|
|
if (FILE_IS_USABLE(fp) == 0)
|
|
|
|
return (NULL);
|
|
|
|
|
|
|
|
return (fp);
|
|
|
|
}
|
|
|
|
|
1994-05-17 08:21:49 +04:00
|
|
|
/*
|
|
|
|
* System calls on descriptors.
|
|
|
|
*/
|
1994-06-14 09:18:03 +04:00
|
|
|
|
1994-05-17 08:21:49 +04:00
|
|
|
/*
|
|
|
|
* Duplicate a file descriptor.
|
|
|
|
*/
|
|
|
|
/* ARGSUSED */
|
1996-02-04 05:15:01 +03:00
|
|
|
int
|
2001-02-26 23:24:30 +03:00
|
|
|
sys_dup(struct proc *p, void *v, register_t *retval)
|
1994-05-17 08:21:49 +04:00
|
|
|
{
|
1995-10-07 09:25:19 +03:00
|
|
|
struct sys_dup_args /* {
|
2001-02-26 23:24:30 +03:00
|
|
|
syscallarg(int) fd;
|
1995-09-20 01:40:36 +04:00
|
|
|
} */ *uap = v;
|
2001-02-26 23:24:30 +03:00
|
|
|
struct file *fp;
|
|
|
|
struct filedesc *fdp;
|
|
|
|
int old, new, error;
|
|
|
|
|
|
|
|
fdp = p->p_fd;
|
|
|
|
old = SCARG(uap, fd);
|
1994-05-17 08:21:49 +04:00
|
|
|
|
2001-06-06 21:00:00 +04:00
|
|
|
restart:
|
2001-06-15 00:32:41 +04:00
|
|
|
if ((fp = fd_getfile(fdp, old)) == NULL)
|
1994-05-17 08:21:49 +04:00
|
|
|
return (EBADF);
|
1999-05-06 00:01:01 +04:00
|
|
|
|
|
|
|
FILE_USE(fp);
|
|
|
|
|
|
|
|
if ((error = fdalloc(p, 0, &new)) != 0) {
|
Rework fdalloc() even further: split fdalloc() into fdalloc() and
fdexpand(). The former will return ENOSPC if there is not space
in the current filedesc table. The latter performs the expansion
of the filedesc table. This means that fdalloc() won't ever block,
and it gives callers an opportunity to clean up before the
potentially-blocking fdexpand() call.
Update all fdalloc() callers to deal with the need-to-fdexpand() case.
Rewrite unp_externalize() to use fdalloc() and fdexpand() in a
safe way, using an algorithm suggested by Bill Sommerfeld:
- Use a temporary array of integers to hold the new filedesc table
indexes. This allows us to repeat the loop if necessary.
- Loop through the array of file *'s, assigning them to filedesc table
slots. If fdalloc() indicates expansion is necessary, undo the
assignments we've done so far, expand, and retry the whole process.
- Once all file *'s have been assigned to slots, update the f_msgcount
and unp_rights counters.
- Right before we return, copy the temporary integer array to the message
buffer, and trim the length as before.
Note that once locking is added to the filedesc array, this entire
operation will be `atomic', in that the lock will be held while
file *'s are assigned to embryonic table slots, thus preventing anything
else from using them.
2001-06-07 05:29:16 +04:00
|
|
|
if (error == ENOSPC) {
|
|
|
|
fdexpand(p);
|
|
|
|
FILE_UNUSE(fp, p);
|
2001-06-06 21:00:00 +04:00
|
|
|
goto restart;
|
Rework fdalloc() even further: split fdalloc() into fdalloc() and
fdexpand(). The former will return ENOSPC if there is not space
in the current filedesc table. The latter performs the expansion
of the filedesc table. This means that fdalloc() won't ever block,
and it gives callers an opportunity to clean up before the
potentially-blocking fdexpand() call.
Update all fdalloc() callers to deal with the need-to-fdexpand() case.
Rewrite unp_externalize() to use fdalloc() and fdexpand() in a
safe way, using an algorithm suggested by Bill Sommerfeld:
- Use a temporary array of integers to hold the new filedesc table
indexes. This allows us to repeat the loop if necessary.
- Loop through the array of file *'s, assigning them to filedesc table
slots. If fdalloc() indicates expansion is necessary, undo the
assignments we've done so far, expand, and retry the whole process.
- Once all file *'s have been assigned to slots, update the f_msgcount
and unp_rights counters.
- Right before we return, copy the temporary integer array to the message
buffer, and trim the length as before.
Note that once locking is added to the filedesc array, this entire
operation will be `atomic', in that the lock will be held while
file *'s are assigned to embryonic table slots, thus preventing anything
else from using them.
2001-06-07 05:29:16 +04:00
|
|
|
}
|
|
|
|
FILE_UNUSE(fp, p);
|
1994-05-17 08:21:49 +04:00
|
|
|
return (error);
|
1999-05-06 00:01:01 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/* finishdup() will unuse the descriptors for us */
|
|
|
|
return (finishdup(p, old, new, retval));
|
1994-05-17 08:21:49 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Duplicate a file descriptor to a particular value.
|
|
|
|
*/
|
|
|
|
/* ARGSUSED */
|
1996-02-04 05:15:01 +03:00
|
|
|
int
|
2001-02-26 23:24:30 +03:00
|
|
|
sys_dup2(struct proc *p, void *v, register_t *retval)
|
1995-09-20 01:40:36 +04:00
|
|
|
{
|
1995-10-07 09:25:19 +03:00
|
|
|
struct sys_dup2_args /* {
|
2001-02-26 23:24:30 +03:00
|
|
|
syscallarg(int) from;
|
|
|
|
syscallarg(int) to;
|
1995-09-20 01:40:36 +04:00
|
|
|
} */ *uap = v;
|
2001-02-26 23:24:30 +03:00
|
|
|
struct file *fp;
|
|
|
|
struct filedesc *fdp;
|
|
|
|
int old, new, i, error;
|
|
|
|
|
|
|
|
fdp = p->p_fd;
|
|
|
|
old = SCARG(uap, from);
|
|
|
|
new = SCARG(uap, to);
|
1994-05-17 08:21:49 +04:00
|
|
|
|
2001-06-06 21:00:00 +04:00
|
|
|
restart:
|
2001-06-15 00:32:41 +04:00
|
|
|
if ((fp = fd_getfile(fdp, old)) == NULL)
|
|
|
|
return (EBADF);
|
|
|
|
|
|
|
|
if ((u_int)new >= p->p_rlimit[RLIMIT_NOFILE].rlim_cur ||
|
1994-12-04 06:09:50 +03:00
|
|
|
(u_int)new >= maxfiles)
|
1994-05-17 08:21:49 +04:00
|
|
|
return (EBADF);
|
2001-06-15 00:32:41 +04:00
|
|
|
|
1994-05-19 12:13:09 +04:00
|
|
|
if (old == new) {
|
|
|
|
*retval = new;
|
1994-05-17 08:21:49 +04:00
|
|
|
return (0);
|
1994-05-19 12:13:09 +04:00
|
|
|
}
|
1999-05-06 00:01:01 +04:00
|
|
|
|
|
|
|
FILE_USE(fp);
|
|
|
|
|
1994-05-17 08:21:49 +04:00
|
|
|
if (new >= fdp->fd_nfiles) {
|
1999-05-06 00:01:01 +04:00
|
|
|
if ((error = fdalloc(p, new, &i)) != 0) {
|
Rework fdalloc() even further: split fdalloc() into fdalloc() and
fdexpand(). The former will return ENOSPC if there is not space
in the current filedesc table. The latter performs the expansion
of the filedesc table. This means that fdalloc() won't ever block,
and it gives callers an opportunity to clean up before the
potentially-blocking fdexpand() call.
Update all fdalloc() callers to deal with the need-to-fdexpand() case.
Rewrite unp_externalize() to use fdalloc() and fdexpand() in a
safe way, using an algorithm suggested by Bill Sommerfeld:
- Use a temporary array of integers to hold the new filedesc table
indexes. This allows us to repeat the loop if necessary.
- Loop through the array of file *'s, assigning them to filedesc table
slots. If fdalloc() indicates expansion is necessary, undo the
assignments we've done so far, expand, and retry the whole process.
- Once all file *'s have been assigned to slots, update the f_msgcount
and unp_rights counters.
- Right before we return, copy the temporary integer array to the message
buffer, and trim the length as before.
Note that once locking is added to the filedesc array, this entire
operation will be `atomic', in that the lock will be held while
file *'s are assigned to embryonic table slots, thus preventing anything
else from using them.
2001-06-07 05:29:16 +04:00
|
|
|
if (error == ENOSPC) {
|
|
|
|
fdexpand(p);
|
|
|
|
FILE_UNUSE(fp, p);
|
2001-06-06 21:00:00 +04:00
|
|
|
goto restart;
|
Rework fdalloc() even further: split fdalloc() into fdalloc() and
fdexpand(). The former will return ENOSPC if there is not space
in the current filedesc table. The latter performs the expansion
of the filedesc table. This means that fdalloc() won't ever block,
and it gives callers an opportunity to clean up before the
potentially-blocking fdexpand() call.
Update all fdalloc() callers to deal with the need-to-fdexpand() case.
Rewrite unp_externalize() to use fdalloc() and fdexpand() in a
safe way, using an algorithm suggested by Bill Sommerfeld:
- Use a temporary array of integers to hold the new filedesc table
indexes. This allows us to repeat the loop if necessary.
- Loop through the array of file *'s, assigning them to filedesc table
slots. If fdalloc() indicates expansion is necessary, undo the
assignments we've done so far, expand, and retry the whole process.
- Once all file *'s have been assigned to slots, update the f_msgcount
and unp_rights counters.
- Right before we return, copy the temporary integer array to the message
buffer, and trim the length as before.
Note that once locking is added to the filedesc array, this entire
operation will be `atomic', in that the lock will be held while
file *'s are assigned to embryonic table slots, thus preventing anything
else from using them.
2001-06-07 05:29:16 +04:00
|
|
|
}
|
|
|
|
FILE_UNUSE(fp, p);
|
1994-05-17 08:21:49 +04:00
|
|
|
return (error);
|
1999-05-06 00:01:01 +04:00
|
|
|
}
|
1994-05-17 08:21:49 +04:00
|
|
|
if (new != i)
|
|
|
|
panic("dup2: fdalloc");
|
|
|
|
}
|
1999-05-06 00:01:01 +04:00
|
|
|
|
2001-06-06 21:00:00 +04:00
|
|
|
/*
|
|
|
|
* finishdup() will close the file that's in the `new'
|
|
|
|
* slot, if there's one there.
|
|
|
|
*/
|
|
|
|
|
1999-05-06 00:01:01 +04:00
|
|
|
/* finishdup() will unuse the descriptors for us */
|
|
|
|
return (finishdup(p, old, new, retval));
|
1994-05-17 08:21:49 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* The file control system call.
|
|
|
|
*/
|
|
|
|
/* ARGSUSED */
|
1996-02-04 05:15:01 +03:00
|
|
|
int
|
2001-02-26 23:24:30 +03:00
|
|
|
sys_fcntl(struct proc *p, void *v, register_t *retval)
|
1995-09-20 01:40:36 +04:00
|
|
|
{
|
2000-03-30 13:27:11 +04:00
|
|
|
struct sys_fcntl_args /* {
|
2001-02-26 23:24:30 +03:00
|
|
|
syscallarg(int) fd;
|
|
|
|
syscallarg(int) cmd;
|
|
|
|
syscallarg(void *) arg;
|
1995-09-20 01:40:36 +04:00
|
|
|
} */ *uap = v;
|
2001-02-26 23:24:30 +03:00
|
|
|
struct filedesc *fdp;
|
|
|
|
struct file *fp;
|
|
|
|
struct vnode *vp;
|
|
|
|
int fd, i, tmp, error, flg, cmd, newmin;
|
|
|
|
struct flock fl;
|
|
|
|
|
|
|
|
fd = SCARG(uap, fd);
|
|
|
|
fdp = p->p_fd;
|
|
|
|
error = 0;
|
|
|
|
flg = F_POSIX;
|
1994-05-17 08:21:49 +04:00
|
|
|
|
2001-06-06 21:00:00 +04:00
|
|
|
restart:
|
2001-06-15 00:32:41 +04:00
|
|
|
if ((fp = fd_getfile(fdp, fd)) == NULL)
|
1994-05-17 08:21:49 +04:00
|
|
|
return (EBADF);
|
1999-05-06 00:01:01 +04:00
|
|
|
|
|
|
|
FILE_USE(fp);
|
|
|
|
|
1999-08-04 00:19:16 +04:00
|
|
|
cmd = SCARG(uap, cmd);
|
|
|
|
if ((cmd & F_FSCTL)) {
|
|
|
|
error = fcntl_forfs(fd, p, cmd, SCARG(uap, arg));
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
|
|
|
switch (cmd) {
|
1994-05-19 12:13:09 +04:00
|
|
|
|
1994-05-17 08:21:49 +04:00
|
|
|
case F_DUPFD:
|
1995-01-12 08:40:10 +03:00
|
|
|
newmin = (long)SCARG(uap, arg);
|
1994-12-04 06:09:50 +03:00
|
|
|
if ((u_int)newmin >= p->p_rlimit[RLIMIT_NOFILE].rlim_cur ||
|
1999-05-06 00:01:01 +04:00
|
|
|
(u_int)newmin >= maxfiles) {
|
|
|
|
error = EINVAL;
|
|
|
|
goto out;
|
|
|
|
}
|
2001-06-06 21:00:00 +04:00
|
|
|
if ((error = fdalloc(p, newmin, &i)) != 0) {
|
Rework fdalloc() even further: split fdalloc() into fdalloc() and
fdexpand(). The former will return ENOSPC if there is not space
in the current filedesc table. The latter performs the expansion
of the filedesc table. This means that fdalloc() won't ever block,
and it gives callers an opportunity to clean up before the
potentially-blocking fdexpand() call.
Update all fdalloc() callers to deal with the need-to-fdexpand() case.
Rewrite unp_externalize() to use fdalloc() and fdexpand() in a
safe way, using an algorithm suggested by Bill Sommerfeld:
- Use a temporary array of integers to hold the new filedesc table
indexes. This allows us to repeat the loop if necessary.
- Loop through the array of file *'s, assigning them to filedesc table
slots. If fdalloc() indicates expansion is necessary, undo the
assignments we've done so far, expand, and retry the whole process.
- Once all file *'s have been assigned to slots, update the f_msgcount
and unp_rights counters.
- Right before we return, copy the temporary integer array to the message
buffer, and trim the length as before.
Note that once locking is added to the filedesc array, this entire
operation will be `atomic', in that the lock will be held while
file *'s are assigned to embryonic table slots, thus preventing anything
else from using them.
2001-06-07 05:29:16 +04:00
|
|
|
if (error == ENOSPC) {
|
|
|
|
fdexpand(p);
|
2001-06-06 21:00:00 +04:00
|
|
|
FILE_UNUSE(fp, p);
|
|
|
|
goto restart;
|
|
|
|
}
|
1999-05-06 00:01:01 +04:00
|
|
|
goto out;
|
2001-06-06 21:00:00 +04:00
|
|
|
}
|
1999-05-06 00:01:01 +04:00
|
|
|
|
|
|
|
/* finishdup() will unuse the descriptors for us */
|
|
|
|
return (finishdup(p, fd, i, retval));
|
1994-05-17 08:21:49 +04:00
|
|
|
|
|
|
|
case F_GETFD:
|
1994-12-04 06:09:50 +03:00
|
|
|
*retval = fdp->fd_ofileflags[fd] & UF_EXCLOSE ? 1 : 0;
|
1999-05-06 00:01:01 +04:00
|
|
|
break;
|
1994-05-17 08:21:49 +04:00
|
|
|
|
|
|
|
case F_SETFD:
|
1994-12-04 06:09:50 +03:00
|
|
|
if ((long)SCARG(uap, arg) & 1)
|
|
|
|
fdp->fd_ofileflags[fd] |= UF_EXCLOSE;
|
|
|
|
else
|
|
|
|
fdp->fd_ofileflags[fd] &= ~UF_EXCLOSE;
|
1999-05-06 00:01:01 +04:00
|
|
|
break;
|
1994-05-17 08:21:49 +04:00
|
|
|
|
|
|
|
case F_GETFL:
|
|
|
|
*retval = OFLAGS(fp->f_flag);
|
1999-05-06 00:01:01 +04:00
|
|
|
break;
|
1994-05-17 08:21:49 +04:00
|
|
|
|
|
|
|
case F_SETFL:
|
1999-08-04 00:19:16 +04:00
|
|
|
tmp = FFLAGS((long)SCARG(uap, arg)) & FCNTLFLAGS;
|
|
|
|
error = (*fp->f_ops->fo_fcntl)(fp, F_SETFL, (caddr_t)&tmp, p);
|
|
|
|
if (error)
|
1999-12-08 21:53:56 +03:00
|
|
|
goto out;
|
1994-05-17 08:21:49 +04:00
|
|
|
fp->f_flag &= ~FCNTLFLAGS;
|
1999-08-04 00:19:16 +04:00
|
|
|
fp->f_flag |= tmp;
|
1994-05-17 08:21:49 +04:00
|
|
|
tmp = fp->f_flag & FNONBLOCK;
|
|
|
|
error = (*fp->f_ops->fo_ioctl)(fp, FIONBIO, (caddr_t)&tmp, p);
|
|
|
|
if (error)
|
1999-05-06 00:01:01 +04:00
|
|
|
goto out;
|
1994-05-17 08:21:49 +04:00
|
|
|
tmp = fp->f_flag & FASYNC;
|
|
|
|
error = (*fp->f_ops->fo_ioctl)(fp, FIOASYNC, (caddr_t)&tmp, p);
|
1999-05-06 00:01:01 +04:00
|
|
|
if (error == 0)
|
|
|
|
goto out;
|
1994-05-17 08:21:49 +04:00
|
|
|
fp->f_flag &= ~FNONBLOCK;
|
|
|
|
tmp = 0;
|
|
|
|
(void) (*fp->f_ops->fo_ioctl)(fp, FIONBIO, (caddr_t)&tmp, p);
|
1999-05-06 00:01:01 +04:00
|
|
|
break;
|
1994-05-17 08:21:49 +04:00
|
|
|
|
|
|
|
case F_GETOWN:
|
|
|
|
if (fp->f_type == DTYPE_SOCKET) {
|
|
|
|
*retval = ((struct socket *)fp->f_data)->so_pgid;
|
1999-05-06 00:01:01 +04:00
|
|
|
goto out;
|
1994-05-17 08:21:49 +04:00
|
|
|
}
|
|
|
|
error = (*fp->f_ops->fo_ioctl)
|
2002-02-01 01:17:33 +03:00
|
|
|
(fp, TIOCGPGRP, (caddr_t)&tmp, p);
|
|
|
|
*retval = -tmp;
|
1999-05-06 00:01:01 +04:00
|
|
|
break;
|
1994-05-17 08:21:49 +04:00
|
|
|
|
|
|
|
case F_SETOWN:
|
|
|
|
if (fp->f_type == DTYPE_SOCKET) {
|
1994-10-20 07:22:35 +03:00
|
|
|
((struct socket *)fp->f_data)->so_pgid =
|
|
|
|
(long)SCARG(uap, arg);
|
1999-05-06 00:01:01 +04:00
|
|
|
goto out;
|
1994-05-17 08:21:49 +04:00
|
|
|
}
|
1994-10-20 07:22:35 +03:00
|
|
|
if ((long)SCARG(uap, arg) <= 0) {
|
2000-08-15 20:26:42 +04:00
|
|
|
tmp = (-(long)SCARG(uap, arg));
|
1994-05-17 08:21:49 +04:00
|
|
|
} else {
|
1994-10-20 07:22:35 +03:00
|
|
|
struct proc *p1 = pfind((long)SCARG(uap, arg));
|
1999-05-06 00:01:01 +04:00
|
|
|
if (p1 == 0) {
|
|
|
|
error = ESRCH;
|
|
|
|
goto out;
|
|
|
|
}
|
2000-08-15 21:54:59 +04:00
|
|
|
tmp = (long)p1->p_pgrp->pg_id;
|
1994-05-17 08:21:49 +04:00
|
|
|
}
|
1999-05-06 00:01:01 +04:00
|
|
|
error = (*fp->f_ops->fo_ioctl)
|
2000-08-15 20:26:42 +04:00
|
|
|
(fp, TIOCSPGRP, (caddr_t)&tmp, p);
|
1999-05-06 00:01:01 +04:00
|
|
|
break;
|
1994-05-17 08:21:49 +04:00
|
|
|
|
|
|
|
case F_SETLKW:
|
|
|
|
flg |= F_WAIT;
|
|
|
|
/* Fall into F_SETLK */
|
|
|
|
|
|
|
|
case F_SETLK:
|
1999-05-06 00:01:01 +04:00
|
|
|
if (fp->f_type != DTYPE_VNODE) {
|
|
|
|
error = EINVAL;
|
|
|
|
goto out;
|
|
|
|
}
|
1994-05-17 08:21:49 +04:00
|
|
|
vp = (struct vnode *)fp->f_data;
|
|
|
|
/* Copy in the lock structure */
|
1994-10-20 07:22:35 +03:00
|
|
|
error = copyin((caddr_t)SCARG(uap, arg), (caddr_t)&fl,
|
1998-08-01 02:50:48 +04:00
|
|
|
sizeof(fl));
|
1994-05-17 08:21:49 +04:00
|
|
|
if (error)
|
1999-05-06 00:01:01 +04:00
|
|
|
goto out;
|
1994-05-17 08:21:49 +04:00
|
|
|
if (fl.l_whence == SEEK_CUR)
|
|
|
|
fl.l_start += fp->f_offset;
|
|
|
|
switch (fl.l_type) {
|
|
|
|
case F_RDLCK:
|
1999-05-06 00:01:01 +04:00
|
|
|
if ((fp->f_flag & FREAD) == 0) {
|
|
|
|
error = EBADF;
|
|
|
|
goto out;
|
|
|
|
}
|
1994-05-17 08:21:49 +04:00
|
|
|
p->p_flag |= P_ADVLOCK;
|
1999-05-06 00:01:01 +04:00
|
|
|
error = VOP_ADVLOCK(vp, (caddr_t)p, F_SETLK, &fl, flg);
|
|
|
|
goto out;
|
1994-05-17 08:21:49 +04:00
|
|
|
|
|
|
|
case F_WRLCK:
|
1999-05-06 00:01:01 +04:00
|
|
|
if ((fp->f_flag & FWRITE) == 0) {
|
|
|
|
error = EBADF;
|
|
|
|
goto out;
|
|
|
|
}
|
1994-05-17 08:21:49 +04:00
|
|
|
p->p_flag |= P_ADVLOCK;
|
1999-05-06 00:01:01 +04:00
|
|
|
error = VOP_ADVLOCK(vp, (caddr_t)p, F_SETLK, &fl, flg);
|
|
|
|
goto out;
|
1994-05-17 08:21:49 +04:00
|
|
|
|
|
|
|
case F_UNLCK:
|
1999-05-06 00:01:01 +04:00
|
|
|
error = VOP_ADVLOCK(vp, (caddr_t)p, F_UNLCK, &fl,
|
|
|
|
F_POSIX);
|
|
|
|
goto out;
|
1994-05-17 08:21:49 +04:00
|
|
|
|
|
|
|
default:
|
1999-05-06 00:01:01 +04:00
|
|
|
error = EINVAL;
|
|
|
|
goto out;
|
1994-05-17 08:21:49 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
case F_GETLK:
|
1999-05-06 00:01:01 +04:00
|
|
|
if (fp->f_type != DTYPE_VNODE) {
|
|
|
|
error = EINVAL;
|
|
|
|
goto out;
|
|
|
|
}
|
1994-05-17 08:21:49 +04:00
|
|
|
vp = (struct vnode *)fp->f_data;
|
|
|
|
/* Copy in the lock structure */
|
1994-10-20 07:22:35 +03:00
|
|
|
error = copyin((caddr_t)SCARG(uap, arg), (caddr_t)&fl,
|
1998-08-01 02:50:48 +04:00
|
|
|
sizeof(fl));
|
1994-05-17 08:21:49 +04:00
|
|
|
if (error)
|
1999-05-06 00:01:01 +04:00
|
|
|
goto out;
|
1994-05-17 08:21:49 +04:00
|
|
|
if (fl.l_whence == SEEK_CUR)
|
|
|
|
fl.l_start += fp->f_offset;
|
1997-04-02 22:22:32 +04:00
|
|
|
if (fl.l_type != F_RDLCK &&
|
|
|
|
fl.l_type != F_WRLCK &&
|
1999-05-06 00:01:01 +04:00
|
|
|
fl.l_type != F_UNLCK) {
|
|
|
|
error = EINVAL;
|
|
|
|
goto out;
|
|
|
|
}
|
1996-02-04 05:15:01 +03:00
|
|
|
error = VOP_ADVLOCK(vp, (caddr_t)p, F_GETLK, &fl, F_POSIX);
|
|
|
|
if (error)
|
1999-05-06 00:01:01 +04:00
|
|
|
goto out;
|
|
|
|
error = copyout((caddr_t)&fl, (caddr_t)SCARG(uap, arg),
|
|
|
|
sizeof(fl));
|
|
|
|
break;
|
1994-05-17 08:21:49 +04:00
|
|
|
|
|
|
|
default:
|
1999-05-06 00:01:01 +04:00
|
|
|
error = EINVAL;
|
1994-05-17 08:21:49 +04:00
|
|
|
}
|
1999-05-06 00:01:01 +04:00
|
|
|
|
|
|
|
out:
|
|
|
|
FILE_UNUSE(fp, p);
|
|
|
|
return (error);
|
1994-05-17 08:21:49 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
1994-05-19 12:13:09 +04:00
|
|
|
* Common code for dup, dup2, and fcntl(F_DUPFD).
|
1994-05-17 08:21:49 +04:00
|
|
|
*/
|
1994-05-19 12:13:09 +04:00
|
|
|
int
|
2001-02-26 23:24:30 +03:00
|
|
|
finishdup(struct proc *p, int old, int new, register_t *retval)
|
1994-05-19 12:13:09 +04:00
|
|
|
{
|
2001-02-26 23:24:30 +03:00
|
|
|
struct filedesc *fdp;
|
2001-06-06 21:00:00 +04:00
|
|
|
struct file *fp, *delfp;
|
2001-02-26 23:24:30 +03:00
|
|
|
|
|
|
|
fdp = p->p_fd;
|
1999-05-06 00:01:01 +04:00
|
|
|
|
|
|
|
/*
|
2001-06-06 21:00:00 +04:00
|
|
|
* If there is a file in the new slot, remember it so we
|
|
|
|
* can close it after we've finished the dup. We need
|
|
|
|
* to do it after the dup is finished, since closing
|
|
|
|
* the file may block.
|
|
|
|
*
|
1999-05-06 00:01:01 +04:00
|
|
|
* Note: `old' is already used for us.
|
|
|
|
*/
|
2001-06-06 21:00:00 +04:00
|
|
|
delfp = fdp->fd_ofiles[new];
|
1994-05-19 12:13:09 +04:00
|
|
|
|
|
|
|
fp = fdp->fd_ofiles[old];
|
|
|
|
fdp->fd_ofiles[new] = fp;
|
|
|
|
fdp->fd_ofileflags[new] = fdp->fd_ofileflags[old] &~ UF_EXCLOSE;
|
|
|
|
fp->f_count++;
|
2001-06-06 21:00:00 +04:00
|
|
|
/*
|
|
|
|
* Note, don't have to mark it "used" in the table if there
|
|
|
|
* was already a file in the `new' slot.
|
|
|
|
*/
|
|
|
|
if (delfp == NULL)
|
|
|
|
fd_used(fdp, new);
|
1994-05-19 12:13:09 +04:00
|
|
|
*retval = new;
|
1999-05-06 00:01:01 +04:00
|
|
|
FILE_UNUSE(fp, p);
|
2001-06-06 21:00:00 +04:00
|
|
|
|
|
|
|
if (delfp != NULL) {
|
|
|
|
FILE_USE(delfp);
|
|
|
|
(void) closef(delfp, p);
|
|
|
|
}
|
1994-05-19 12:13:09 +04:00
|
|
|
return (0);
|
|
|
|
}
|
1994-05-17 08:21:49 +04:00
|
|
|
|
2000-03-23 08:16:12 +03:00
|
|
|
void
|
2001-02-26 23:24:30 +03:00
|
|
|
fdremove(struct filedesc *fdp, int fd)
|
2000-03-23 08:16:12 +03:00
|
|
|
{
|
|
|
|
|
|
|
|
fdp->fd_ofiles[fd] = NULL;
|
|
|
|
fd_unused(fdp, fd);
|
|
|
|
}
|
|
|
|
|
1994-12-04 06:09:50 +03:00
|
|
|
int
|
2001-02-26 23:24:30 +03:00
|
|
|
fdrelease(struct proc *p, int fd)
|
1994-12-04 06:09:50 +03:00
|
|
|
{
|
2001-02-26 23:24:30 +03:00
|
|
|
struct filedesc *fdp;
|
|
|
|
struct file **fpp, *fp;
|
1994-12-04 06:09:50 +03:00
|
|
|
|
2001-02-26 23:24:30 +03:00
|
|
|
fdp = p->p_fd;
|
1994-12-04 06:09:50 +03:00
|
|
|
fpp = &fdp->fd_ofiles[fd];
|
|
|
|
fp = *fpp;
|
|
|
|
if (fp == NULL)
|
|
|
|
return (EBADF);
|
1999-05-06 00:01:01 +04:00
|
|
|
|
|
|
|
FILE_USE(fp);
|
|
|
|
|
1994-12-04 06:09:50 +03:00
|
|
|
*fpp = NULL;
|
2001-06-06 21:00:00 +04:00
|
|
|
fdp->fd_ofileflags[fd] = 0;
|
1994-12-04 06:09:50 +03:00
|
|
|
fd_unused(fdp, fd);
|
|
|
|
return (closef(fp, p));
|
|
|
|
}
|
|
|
|
|
1994-05-19 12:13:09 +04:00
|
|
|
/*
|
|
|
|
* Close a file descriptor.
|
|
|
|
*/
|
1994-05-17 08:21:49 +04:00
|
|
|
/* ARGSUSED */
|
1996-02-04 05:15:01 +03:00
|
|
|
int
|
2001-02-26 23:24:30 +03:00
|
|
|
sys_close(struct proc *p, void *v, register_t *retval)
|
1994-05-17 08:21:49 +04:00
|
|
|
{
|
1995-10-07 09:25:19 +03:00
|
|
|
struct sys_close_args /* {
|
2001-02-26 23:24:30 +03:00
|
|
|
syscallarg(int) fd;
|
1995-09-20 01:40:36 +04:00
|
|
|
} */ *uap = v;
|
2001-02-26 23:24:30 +03:00
|
|
|
int fd;
|
|
|
|
struct filedesc *fdp;
|
2001-07-01 22:12:00 +04:00
|
|
|
struct file *fp;
|
1994-05-17 08:21:49 +04:00
|
|
|
|
2001-02-26 23:24:30 +03:00
|
|
|
fd = SCARG(uap, fd);
|
|
|
|
fdp = p->p_fd;
|
2001-07-01 22:12:00 +04:00
|
|
|
|
|
|
|
if ((fp = fd_getfile(fdp, fd)) == NULL)
|
1994-05-17 08:21:49 +04:00
|
|
|
return (EBADF);
|
2001-07-01 22:12:00 +04:00
|
|
|
|
1995-04-10 22:27:59 +04:00
|
|
|
return (fdrelease(p, fd));
|
1994-05-17 08:21:49 +04:00
|
|
|
}
|
|
|
|
|
1994-05-19 12:13:09 +04:00
|
|
|
/*
|
|
|
|
* Return status information about a file descriptor.
|
|
|
|
*/
|
1994-05-17 08:21:49 +04:00
|
|
|
/* ARGSUSED */
|
1996-02-04 05:15:01 +03:00
|
|
|
int
|
2001-02-26 23:24:30 +03:00
|
|
|
sys___fstat13(struct proc *p, void *v, register_t *retval)
|
1995-09-20 01:40:36 +04:00
|
|
|
{
|
2000-03-30 13:27:11 +04:00
|
|
|
struct sys___fstat13_args /* {
|
2001-02-26 23:24:30 +03:00
|
|
|
syscallarg(int) fd;
|
|
|
|
syscallarg(struct stat *) sb;
|
1995-09-20 01:40:36 +04:00
|
|
|
} */ *uap = v;
|
2001-02-26 23:24:30 +03:00
|
|
|
int fd;
|
|
|
|
struct filedesc *fdp;
|
|
|
|
struct file *fp;
|
|
|
|
struct stat ub;
|
|
|
|
int error;
|
1994-05-17 08:21:49 +04:00
|
|
|
|
2001-02-26 23:24:30 +03:00
|
|
|
fd = SCARG(uap, fd);
|
|
|
|
fdp = p->p_fd;
|
2001-06-15 00:32:41 +04:00
|
|
|
|
|
|
|
if ((fp = fd_getfile(fdp, fd)) == NULL)
|
1994-05-17 08:21:49 +04:00
|
|
|
return (EBADF);
|
1999-05-06 00:01:01 +04:00
|
|
|
|
|
|
|
FILE_USE(fp);
|
2001-04-09 14:22:00 +04:00
|
|
|
error = (*fp->f_ops->fo_stat)(fp, &ub, p);
|
2001-04-07 13:00:57 +04:00
|
|
|
FILE_UNUSE(fp, p);
|
1999-05-06 00:01:01 +04:00
|
|
|
|
1994-05-17 08:21:49 +04:00
|
|
|
if (error == 0)
|
1998-08-01 02:50:48 +04:00
|
|
|
error = copyout(&ub, SCARG(uap, sb), sizeof(ub));
|
2001-04-07 13:00:57 +04:00
|
|
|
|
1994-05-17 08:21:49 +04:00
|
|
|
return (error);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Return pathconf information about a file descriptor.
|
|
|
|
*/
|
|
|
|
/* ARGSUSED */
|
1996-02-04 05:15:01 +03:00
|
|
|
int
|
2001-02-26 23:24:30 +03:00
|
|
|
sys_fpathconf(struct proc *p, void *v, register_t *retval)
|
1995-09-20 01:40:36 +04:00
|
|
|
{
|
2000-03-30 13:27:11 +04:00
|
|
|
struct sys_fpathconf_args /* {
|
2001-02-26 23:24:30 +03:00
|
|
|
syscallarg(int) fd;
|
|
|
|
syscallarg(int) name;
|
1995-09-20 01:40:36 +04:00
|
|
|
} */ *uap = v;
|
2001-02-26 23:24:30 +03:00
|
|
|
int fd;
|
|
|
|
struct filedesc *fdp;
|
|
|
|
struct file *fp;
|
|
|
|
struct vnode *vp;
|
|
|
|
int error;
|
|
|
|
|
|
|
|
fd = SCARG(uap, fd);
|
|
|
|
fdp = p->p_fd;
|
|
|
|
error = 0;
|
1994-05-19 12:13:09 +04:00
|
|
|
|
2001-06-15 00:32:41 +04:00
|
|
|
if ((fp = fd_getfile(fdp, fd)) == NULL)
|
1994-05-19 12:13:09 +04:00
|
|
|
return (EBADF);
|
1999-05-06 00:01:01 +04:00
|
|
|
|
|
|
|
FILE_USE(fp);
|
|
|
|
|
1994-05-19 12:13:09 +04:00
|
|
|
switch (fp->f_type) {
|
1994-05-17 08:21:49 +04:00
|
|
|
|
1994-05-19 12:13:09 +04:00
|
|
|
case DTYPE_SOCKET:
|
2001-06-16 12:28:39 +04:00
|
|
|
case DTYPE_PIPE:
|
1994-10-20 07:22:35 +03:00
|
|
|
if (SCARG(uap, name) != _PC_PIPE_BUF)
|
1999-05-06 00:01:01 +04:00
|
|
|
error = EINVAL;
|
|
|
|
else
|
|
|
|
*retval = PIPE_BUF;
|
|
|
|
break;
|
1994-05-19 12:13:09 +04:00
|
|
|
|
|
|
|
case DTYPE_VNODE:
|
|
|
|
vp = (struct vnode *)fp->f_data;
|
1999-05-06 00:01:01 +04:00
|
|
|
error = VOP_PATHCONF(vp, SCARG(uap, name), retval);
|
|
|
|
break;
|
1994-05-19 12:13:09 +04:00
|
|
|
|
|
|
|
default:
|
|
|
|
panic("fpathconf");
|
|
|
|
}
|
1999-05-06 00:01:01 +04:00
|
|
|
|
|
|
|
FILE_UNUSE(fp, p);
|
|
|
|
return (error);
|
1994-05-17 08:21:49 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Allocate a file descriptor for the process.
|
|
|
|
*/
|
Rework fdalloc() even further: split fdalloc() into fdalloc() and
fdexpand(). The former will return ENOSPC if there is not space
in the current filedesc table. The latter performs the expansion
of the filedesc table. This means that fdalloc() won't ever block,
and it gives callers an opportunity to clean up before the
potentially-blocking fdexpand() call.
Update all fdalloc() callers to deal with the need-to-fdexpand() case.
Rewrite unp_externalize() to use fdalloc() and fdexpand() in a
safe way, using an algorithm suggested by Bill Sommerfeld:
- Use a temporary array of integers to hold the new filedesc table
indexes. This allows us to repeat the loop if necessary.
- Loop through the array of file *'s, assigning them to filedesc table
slots. If fdalloc() indicates expansion is necessary, undo the
assignments we've done so far, expand, and retry the whole process.
- Once all file *'s have been assigned to slots, update the f_msgcount
and unp_rights counters.
- Right before we return, copy the temporary integer array to the message
buffer, and trim the length as before.
Note that once locking is added to the filedesc array, this entire
operation will be `atomic', in that the lock will be held while
file *'s are assigned to embryonic table slots, thus preventing anything
else from using them.
2001-06-07 05:29:16 +04:00
|
|
|
int fdexpanded; /* XXX: what else uses this? */
|
1994-05-17 08:21:49 +04:00
|
|
|
|
1996-02-04 05:15:01 +03:00
|
|
|
int
|
2001-02-26 23:24:30 +03:00
|
|
|
fdalloc(struct proc *p, int want, int *result)
|
1994-05-17 08:21:49 +04:00
|
|
|
{
|
2001-02-26 23:24:30 +03:00
|
|
|
struct filedesc *fdp;
|
Rework fdalloc() even further: split fdalloc() into fdalloc() and
fdexpand(). The former will return ENOSPC if there is not space
in the current filedesc table. The latter performs the expansion
of the filedesc table. This means that fdalloc() won't ever block,
and it gives callers an opportunity to clean up before the
potentially-blocking fdexpand() call.
Update all fdalloc() callers to deal with the need-to-fdexpand() case.
Rewrite unp_externalize() to use fdalloc() and fdexpand() in a
safe way, using an algorithm suggested by Bill Sommerfeld:
- Use a temporary array of integers to hold the new filedesc table
indexes. This allows us to repeat the loop if necessary.
- Loop through the array of file *'s, assigning them to filedesc table
slots. If fdalloc() indicates expansion is necessary, undo the
assignments we've done so far, expand, and retry the whole process.
- Once all file *'s have been assigned to slots, update the f_msgcount
and unp_rights counters.
- Right before we return, copy the temporary integer array to the message
buffer, and trim the length as before.
Note that once locking is added to the filedesc array, this entire
operation will be `atomic', in that the lock will be held while
file *'s are assigned to embryonic table slots, thus preventing anything
else from using them.
2001-06-07 05:29:16 +04:00
|
|
|
int i, lim, last;
|
2001-02-26 23:24:30 +03:00
|
|
|
|
|
|
|
fdp = p->p_fd;
|
1994-05-17 08:21:49 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Search for a free descriptor starting at the higher
|
|
|
|
* of want or fd_freefile. If that fails, consider
|
|
|
|
* expanding the ofile array.
|
|
|
|
*/
|
1994-05-19 12:13:09 +04:00
|
|
|
lim = min((int)p->p_rlimit[RLIMIT_NOFILE].rlim_cur, maxfiles);
|
1994-05-17 08:21:49 +04:00
|
|
|
for (;;) {
|
|
|
|
last = min(fdp->fd_nfiles, lim);
|
|
|
|
if ((i = want) < fdp->fd_freefile)
|
|
|
|
i = fdp->fd_freefile;
|
|
|
|
for (; i < last; i++) {
|
|
|
|
if (fdp->fd_ofiles[i] == NULL) {
|
1994-12-04 06:09:50 +03:00
|
|
|
fd_used(fdp, i);
|
1994-05-17 08:21:49 +04:00
|
|
|
if (want <= fdp->fd_freefile)
|
|
|
|
fdp->fd_freefile = i;
|
|
|
|
*result = i;
|
Rework fdalloc() even further: split fdalloc() into fdalloc() and
fdexpand(). The former will return ENOSPC if there is not space
in the current filedesc table. The latter performs the expansion
of the filedesc table. This means that fdalloc() won't ever block,
and it gives callers an opportunity to clean up before the
potentially-blocking fdexpand() call.
Update all fdalloc() callers to deal with the need-to-fdexpand() case.
Rewrite unp_externalize() to use fdalloc() and fdexpand() in a
safe way, using an algorithm suggested by Bill Sommerfeld:
- Use a temporary array of integers to hold the new filedesc table
indexes. This allows us to repeat the loop if necessary.
- Loop through the array of file *'s, assigning them to filedesc table
slots. If fdalloc() indicates expansion is necessary, undo the
assignments we've done so far, expand, and retry the whole process.
- Once all file *'s have been assigned to slots, update the f_msgcount
and unp_rights counters.
- Right before we return, copy the temporary integer array to the message
buffer, and trim the length as before.
Note that once locking is added to the filedesc array, this entire
operation will be `atomic', in that the lock will be held while
file *'s are assigned to embryonic table slots, thus preventing anything
else from using them.
2001-06-07 05:29:16 +04:00
|
|
|
return (0);
|
1994-05-17 08:21:49 +04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
Rework fdalloc() even further: split fdalloc() into fdalloc() and
fdexpand(). The former will return ENOSPC if there is not space
in the current filedesc table. The latter performs the expansion
of the filedesc table. This means that fdalloc() won't ever block,
and it gives callers an opportunity to clean up before the
potentially-blocking fdexpand() call.
Update all fdalloc() callers to deal with the need-to-fdexpand() case.
Rewrite unp_externalize() to use fdalloc() and fdexpand() in a
safe way, using an algorithm suggested by Bill Sommerfeld:
- Use a temporary array of integers to hold the new filedesc table
indexes. This allows us to repeat the loop if necessary.
- Loop through the array of file *'s, assigning them to filedesc table
slots. If fdalloc() indicates expansion is necessary, undo the
assignments we've done so far, expand, and retry the whole process.
- Once all file *'s have been assigned to slots, update the f_msgcount
and unp_rights counters.
- Right before we return, copy the temporary integer array to the message
buffer, and trim the length as before.
Note that once locking is added to the filedesc array, this entire
operation will be `atomic', in that the lock will be held while
file *'s are assigned to embryonic table slots, thus preventing anything
else from using them.
2001-06-07 05:29:16 +04:00
|
|
|
/* No space in current array. Expand? */
|
1994-05-17 08:21:49 +04:00
|
|
|
if (fdp->fd_nfiles >= lim)
|
|
|
|
return (EMFILE);
|
Rework fdalloc() even further: split fdalloc() into fdalloc() and
fdexpand(). The former will return ENOSPC if there is not space
in the current filedesc table. The latter performs the expansion
of the filedesc table. This means that fdalloc() won't ever block,
and it gives callers an opportunity to clean up before the
potentially-blocking fdexpand() call.
Update all fdalloc() callers to deal with the need-to-fdexpand() case.
Rewrite unp_externalize() to use fdalloc() and fdexpand() in a
safe way, using an algorithm suggested by Bill Sommerfeld:
- Use a temporary array of integers to hold the new filedesc table
indexes. This allows us to repeat the loop if necessary.
- Loop through the array of file *'s, assigning them to filedesc table
slots. If fdalloc() indicates expansion is necessary, undo the
assignments we've done so far, expand, and retry the whole process.
- Once all file *'s have been assigned to slots, update the f_msgcount
and unp_rights counters.
- Right before we return, copy the temporary integer array to the message
buffer, and trim the length as before.
Note that once locking is added to the filedesc array, this entire
operation will be `atomic', in that the lock will be held while
file *'s are assigned to embryonic table slots, thus preventing anything
else from using them.
2001-06-07 05:29:16 +04:00
|
|
|
|
|
|
|
/* Let the caller do it. */
|
|
|
|
return (ENOSPC);
|
1994-05-17 08:21:49 +04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
Rework fdalloc() even further: split fdalloc() into fdalloc() and
fdexpand(). The former will return ENOSPC if there is not space
in the current filedesc table. The latter performs the expansion
of the filedesc table. This means that fdalloc() won't ever block,
and it gives callers an opportunity to clean up before the
potentially-blocking fdexpand() call.
Update all fdalloc() callers to deal with the need-to-fdexpand() case.
Rewrite unp_externalize() to use fdalloc() and fdexpand() in a
safe way, using an algorithm suggested by Bill Sommerfeld:
- Use a temporary array of integers to hold the new filedesc table
indexes. This allows us to repeat the loop if necessary.
- Loop through the array of file *'s, assigning them to filedesc table
slots. If fdalloc() indicates expansion is necessary, undo the
assignments we've done so far, expand, and retry the whole process.
- Once all file *'s have been assigned to slots, update the f_msgcount
and unp_rights counters.
- Right before we return, copy the temporary integer array to the message
buffer, and trim the length as before.
Note that once locking is added to the filedesc array, this entire
operation will be `atomic', in that the lock will be held while
file *'s are assigned to embryonic table slots, thus preventing anything
else from using them.
2001-06-07 05:29:16 +04:00
|
|
|
void
|
|
|
|
fdexpand(struct proc *p)
|
|
|
|
{
|
|
|
|
struct filedesc *fdp;
|
|
|
|
int i, nfiles;
|
|
|
|
struct file **newofile;
|
|
|
|
char *newofileflags;
|
|
|
|
|
|
|
|
fdp = p->p_fd;
|
|
|
|
|
|
|
|
if (fdp->fd_nfiles < NDEXTENT)
|
|
|
|
nfiles = NDEXTENT;
|
|
|
|
else
|
|
|
|
nfiles = 2 * fdp->fd_nfiles;
|
|
|
|
newofile = malloc(nfiles * OFILESIZE, M_FILEDESC, M_WAITOK);
|
|
|
|
newofileflags = (char *) &newofile[nfiles];
|
|
|
|
/*
|
|
|
|
* Copy the existing ofile and ofileflags arrays
|
|
|
|
* and zero the new portion of each array.
|
|
|
|
*/
|
|
|
|
memcpy(newofile, fdp->fd_ofiles,
|
2002-04-28 01:31:41 +04:00
|
|
|
(i = sizeof(struct file *) * fdp->fd_nfiles));
|
Rework fdalloc() even further: split fdalloc() into fdalloc() and
fdexpand(). The former will return ENOSPC if there is not space
in the current filedesc table. The latter performs the expansion
of the filedesc table. This means that fdalloc() won't ever block,
and it gives callers an opportunity to clean up before the
potentially-blocking fdexpand() call.
Update all fdalloc() callers to deal with the need-to-fdexpand() case.
Rewrite unp_externalize() to use fdalloc() and fdexpand() in a
safe way, using an algorithm suggested by Bill Sommerfeld:
- Use a temporary array of integers to hold the new filedesc table
indexes. This allows us to repeat the loop if necessary.
- Loop through the array of file *'s, assigning them to filedesc table
slots. If fdalloc() indicates expansion is necessary, undo the
assignments we've done so far, expand, and retry the whole process.
- Once all file *'s have been assigned to slots, update the f_msgcount
and unp_rights counters.
- Right before we return, copy the temporary integer array to the message
buffer, and trim the length as before.
Note that once locking is added to the filedesc array, this entire
operation will be `atomic', in that the lock will be held while
file *'s are assigned to embryonic table slots, thus preventing anything
else from using them.
2001-06-07 05:29:16 +04:00
|
|
|
memset((char *)newofile + i, 0,
|
|
|
|
nfiles * sizeof(struct file *) - i);
|
|
|
|
memcpy(newofileflags, fdp->fd_ofileflags,
|
|
|
|
(i = sizeof(char) * fdp->fd_nfiles));
|
|
|
|
memset(newofileflags + i, 0, nfiles * sizeof(char) - i);
|
|
|
|
if (fdp->fd_nfiles > NDFILE)
|
|
|
|
free(fdp->fd_ofiles, M_FILEDESC);
|
|
|
|
fdp->fd_ofiles = newofile;
|
|
|
|
fdp->fd_ofileflags = newofileflags;
|
|
|
|
fdp->fd_nfiles = nfiles;
|
|
|
|
fdexpanded++;
|
|
|
|
}
|
|
|
|
|
1994-05-17 08:21:49 +04:00
|
|
|
/*
|
|
|
|
* Check to see whether n user file descriptors
|
|
|
|
* are available to the process p.
|
|
|
|
*/
|
1996-02-04 05:15:01 +03:00
|
|
|
int
|
2001-02-26 23:24:30 +03:00
|
|
|
fdavail(struct proc *p, int n)
|
1994-05-17 08:21:49 +04:00
|
|
|
{
|
2001-02-26 23:24:30 +03:00
|
|
|
struct filedesc *fdp;
|
|
|
|
struct file **fpp;
|
|
|
|
int i, lim;
|
1994-05-17 08:21:49 +04:00
|
|
|
|
2001-02-26 23:24:30 +03:00
|
|
|
fdp = p->p_fd;
|
1994-05-19 12:13:09 +04:00
|
|
|
lim = min((int)p->p_rlimit[RLIMIT_NOFILE].rlim_cur, maxfiles);
|
|
|
|
if ((i = lim - fdp->fd_nfiles) > 0 && (n -= i) <= 0)
|
1994-05-17 08:21:49 +04:00
|
|
|
return (1);
|
|
|
|
fpp = &fdp->fd_ofiles[fdp->fd_freefile];
|
1999-03-22 20:39:44 +03:00
|
|
|
for (i = min(lim,fdp->fd_nfiles) - fdp->fd_freefile; --i >= 0; fpp++)
|
1994-05-17 08:21:49 +04:00
|
|
|
if (*fpp == NULL && --n <= 0)
|
|
|
|
return (1);
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
1998-09-01 03:55:37 +04:00
|
|
|
/*
|
|
|
|
* Initialize the data structures necessary for managing files.
|
|
|
|
*/
|
|
|
|
void
|
2001-02-26 23:24:30 +03:00
|
|
|
finit(void)
|
1998-09-01 03:55:37 +04:00
|
|
|
{
|
|
|
|
|
|
|
|
pool_init(&file_pool, sizeof(struct file), 0, 0, 0, "filepl",
|
2002-03-08 23:48:27 +03:00
|
|
|
&pool_allocator_nointr);
|
1999-04-30 22:42:58 +04:00
|
|
|
pool_init(&cwdi_pool, sizeof(struct cwdinfo), 0, 0, 0, "cwdipl",
|
2002-03-08 23:48:27 +03:00
|
|
|
&pool_allocator_nointr);
|
2000-03-22 20:42:57 +03:00
|
|
|
pool_init(&filedesc0_pool, sizeof(struct filedesc0), 0, 0, 0, "fdescpl",
|
2002-03-08 23:48:27 +03:00
|
|
|
&pool_allocator_nointr);
|
1998-09-01 03:55:37 +04:00
|
|
|
}
|
|
|
|
|
1994-05-17 08:21:49 +04:00
|
|
|
/*
|
|
|
|
* Create a new open file structure and allocate
|
|
|
|
* a file decriptor for the process that refers to it.
|
|
|
|
*/
|
1996-02-04 05:15:01 +03:00
|
|
|
int
|
2001-02-26 23:24:30 +03:00
|
|
|
falloc(struct proc *p, struct file **resultfp, int *resultfd)
|
1994-05-17 08:21:49 +04:00
|
|
|
{
|
2001-02-26 23:24:30 +03:00
|
|
|
struct file *fp, *fq;
|
|
|
|
int error, i;
|
1994-05-17 08:21:49 +04:00
|
|
|
|
2001-06-06 21:00:00 +04:00
|
|
|
restart:
|
|
|
|
if ((error = fdalloc(p, 0, &i)) != 0) {
|
Rework fdalloc() even further: split fdalloc() into fdalloc() and
fdexpand(). The former will return ENOSPC if there is not space
in the current filedesc table. The latter performs the expansion
of the filedesc table. This means that fdalloc() won't ever block,
and it gives callers an opportunity to clean up before the
potentially-blocking fdexpand() call.
Update all fdalloc() callers to deal with the need-to-fdexpand() case.
Rewrite unp_externalize() to use fdalloc() and fdexpand() in a
safe way, using an algorithm suggested by Bill Sommerfeld:
- Use a temporary array of integers to hold the new filedesc table
indexes. This allows us to repeat the loop if necessary.
- Loop through the array of file *'s, assigning them to filedesc table
slots. If fdalloc() indicates expansion is necessary, undo the
assignments we've done so far, expand, and retry the whole process.
- Once all file *'s have been assigned to slots, update the f_msgcount
and unp_rights counters.
- Right before we return, copy the temporary integer array to the message
buffer, and trim the length as before.
Note that once locking is added to the filedesc array, this entire
operation will be `atomic', in that the lock will be held while
file *'s are assigned to embryonic table slots, thus preventing anything
else from using them.
2001-06-07 05:29:16 +04:00
|
|
|
if (error == ENOSPC) {
|
|
|
|
fdexpand(p);
|
2001-06-06 21:00:00 +04:00
|
|
|
goto restart;
|
Rework fdalloc() even further: split fdalloc() into fdalloc() and
fdexpand(). The former will return ENOSPC if there is not space
in the current filedesc table. The latter performs the expansion
of the filedesc table. This means that fdalloc() won't ever block,
and it gives callers an opportunity to clean up before the
potentially-blocking fdexpand() call.
Update all fdalloc() callers to deal with the need-to-fdexpand() case.
Rewrite unp_externalize() to use fdalloc() and fdexpand() in a
safe way, using an algorithm suggested by Bill Sommerfeld:
- Use a temporary array of integers to hold the new filedesc table
indexes. This allows us to repeat the loop if necessary.
- Loop through the array of file *'s, assigning them to filedesc table
slots. If fdalloc() indicates expansion is necessary, undo the
assignments we've done so far, expand, and retry the whole process.
- Once all file *'s have been assigned to slots, update the f_msgcount
and unp_rights counters.
- Right before we return, copy the temporary integer array to the message
buffer, and trim the length as before.
Note that once locking is added to the filedesc array, this entire
operation will be `atomic', in that the lock will be held while
file *'s are assigned to embryonic table slots, thus preventing anything
else from using them.
2001-06-07 05:29:16 +04:00
|
|
|
}
|
1994-05-17 08:21:49 +04:00
|
|
|
return (error);
|
2001-06-06 21:00:00 +04:00
|
|
|
}
|
1994-05-17 08:21:49 +04:00
|
|
|
if (nfiles >= maxfiles) {
|
2000-07-04 19:33:28 +04:00
|
|
|
tablefull("file", "increase kern.maxfiles or MAXFILES");
|
1994-05-17 08:21:49 +04:00
|
|
|
return (ENFILE);
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* Allocate a new file descriptor.
|
|
|
|
* If the process has file descriptor zero open, add to the list
|
|
|
|
* of open files at that point, otherwise put it at the front of
|
|
|
|
* the list of open files.
|
|
|
|
*/
|
|
|
|
nfiles++;
|
1998-09-01 03:55:37 +04:00
|
|
|
fp = pool_get(&file_pool, PR_WAITOK);
|
Abolition of bcopy, ovbcopy, bcmp, and bzero, phase one.
bcopy(x, y, z) -> memcpy(y, x, z)
ovbcopy(x, y, z) -> memmove(y, x, z)
bcmp(x, y, z) -> memcmp(x, y, z)
bzero(x, y) -> memset(x, 0, y)
1998-08-04 08:03:10 +04:00
|
|
|
memset(fp, 0, sizeof(struct file));
|
2001-12-07 10:09:29 +03:00
|
|
|
fp->f_iflags = FIF_LARVAL;
|
1996-02-04 05:15:01 +03:00
|
|
|
if ((fq = p->p_fd->fd_ofiles[0]) != NULL) {
|
1994-08-30 07:04:28 +04:00
|
|
|
LIST_INSERT_AFTER(fq, fp, f_list);
|
|
|
|
} else {
|
|
|
|
LIST_INSERT_HEAD(&filehead, fp, f_list);
|
|
|
|
}
|
1994-05-17 08:21:49 +04:00
|
|
|
p->p_fd->fd_ofiles[i] = fp;
|
|
|
|
fp->f_count = 1;
|
|
|
|
fp->f_cred = p->p_ucred;
|
|
|
|
crhold(fp->f_cred);
|
1999-05-06 00:01:01 +04:00
|
|
|
if (resultfp) {
|
|
|
|
FILE_USE(fp);
|
1994-05-17 08:21:49 +04:00
|
|
|
*resultfp = fp;
|
1999-05-06 00:01:01 +04:00
|
|
|
}
|
1994-05-17 08:21:49 +04:00
|
|
|
if (resultfd)
|
|
|
|
*resultfd = i;
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Free a file descriptor.
|
|
|
|
*/
|
1996-02-04 05:15:01 +03:00
|
|
|
void
|
2001-02-26 23:24:30 +03:00
|
|
|
ffree(struct file *fp)
|
1994-05-17 08:21:49 +04:00
|
|
|
{
|
1999-05-06 00:01:01 +04:00
|
|
|
|
|
|
|
#ifdef DIAGNOSTIC
|
|
|
|
if (fp->f_usecount)
|
|
|
|
panic("ffree");
|
|
|
|
#endif
|
|
|
|
|
1994-08-30 07:04:28 +04:00
|
|
|
LIST_REMOVE(fp, f_list);
|
1994-05-17 08:21:49 +04:00
|
|
|
crfree(fp->f_cred);
|
|
|
|
#ifdef DIAGNOSTIC
|
|
|
|
fp->f_count = 0;
|
|
|
|
#endif
|
|
|
|
nfiles--;
|
1998-09-01 03:55:37 +04:00
|
|
|
pool_put(&file_pool, fp);
|
1994-05-17 08:21:49 +04:00
|
|
|
}
|
|
|
|
|
1999-04-30 22:42:58 +04:00
|
|
|
/*
|
|
|
|
* Create an initial cwdinfo structure, using the same current and root
|
|
|
|
* directories as p.
|
|
|
|
*/
|
|
|
|
struct cwdinfo *
|
2001-02-26 23:24:30 +03:00
|
|
|
cwdinit(struct proc *p)
|
1999-04-30 22:42:58 +04:00
|
|
|
{
|
|
|
|
struct cwdinfo *cwdi;
|
|
|
|
|
|
|
|
cwdi = pool_get(&cwdi_pool, PR_WAITOK);
|
|
|
|
|
|
|
|
cwdi->cwdi_cdir = p->p_cwdi->cwdi_cdir;
|
2000-01-24 20:57:34 +03:00
|
|
|
if (cwdi->cwdi_cdir)
|
|
|
|
VREF(cwdi->cwdi_cdir);
|
1999-04-30 22:42:58 +04:00
|
|
|
cwdi->cwdi_rdir = p->p_cwdi->cwdi_rdir;
|
|
|
|
if (cwdi->cwdi_rdir)
|
|
|
|
VREF(cwdi->cwdi_rdir);
|
1999-06-20 12:54:13 +04:00
|
|
|
cwdi->cwdi_cmask = p->p_cwdi->cwdi_cmask;
|
1999-04-30 22:42:58 +04:00
|
|
|
cwdi->cwdi_refcnt = 1;
|
|
|
|
|
|
|
|
return (cwdi);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Make p2 share p1's cwdinfo.
|
|
|
|
*/
|
|
|
|
void
|
2001-02-26 23:24:30 +03:00
|
|
|
cwdshare(struct proc *p1, struct proc *p2)
|
1999-04-30 22:42:58 +04:00
|
|
|
{
|
|
|
|
|
|
|
|
p2->p_cwdi = p1->p_cwdi;
|
|
|
|
p1->p_cwdi->cwdi_refcnt++;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Make this process not share its cwdinfo structure, maintaining
|
|
|
|
* all cwdinfo state.
|
|
|
|
*/
|
|
|
|
void
|
2001-02-26 23:24:30 +03:00
|
|
|
cwdunshare(struct proc *p)
|
1999-04-30 22:42:58 +04:00
|
|
|
{
|
|
|
|
struct cwdinfo *newcwdi;
|
|
|
|
|
|
|
|
if (p->p_cwdi->cwdi_refcnt == 1)
|
|
|
|
return;
|
|
|
|
|
|
|
|
newcwdi = cwdinit(p);
|
|
|
|
cwdfree(p);
|
|
|
|
p->p_cwdi = newcwdi;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Release a cwdinfo structure.
|
|
|
|
*/
|
|
|
|
void
|
2001-02-26 23:24:30 +03:00
|
|
|
cwdfree(struct proc *p)
|
1999-04-30 22:42:58 +04:00
|
|
|
{
|
2001-02-26 23:24:30 +03:00
|
|
|
struct cwdinfo *cwdi;
|
1999-04-30 22:42:58 +04:00
|
|
|
|
2001-02-26 23:24:30 +03:00
|
|
|
cwdi = p->p_cwdi;
|
1999-04-30 22:42:58 +04:00
|
|
|
if (--cwdi->cwdi_refcnt > 0)
|
|
|
|
return;
|
|
|
|
|
|
|
|
p->p_cwdi = NULL;
|
|
|
|
|
|
|
|
vrele(cwdi->cwdi_cdir);
|
|
|
|
if (cwdi->cwdi_rdir)
|
|
|
|
vrele(cwdi->cwdi_rdir);
|
|
|
|
pool_put(&cwdi_pool, cwdi);
|
|
|
|
}
|
|
|
|
|
1998-01-05 07:51:15 +03:00
|
|
|
/*
|
|
|
|
* Create an initial filedesc structure, using the same current and root
|
|
|
|
* directories as p.
|
|
|
|
*/
|
|
|
|
struct filedesc *
|
2001-02-26 23:24:30 +03:00
|
|
|
fdinit(struct proc *p)
|
1998-01-05 07:51:15 +03:00
|
|
|
{
|
|
|
|
struct filedesc0 *newfdp;
|
|
|
|
|
2000-03-22 20:42:57 +03:00
|
|
|
newfdp = pool_get(&filedesc0_pool, PR_WAITOK);
|
Abolition of bcopy, ovbcopy, bcmp, and bzero, phase one.
bcopy(x, y, z) -> memcpy(y, x, z)
ovbcopy(x, y, z) -> memmove(y, x, z)
bcmp(x, y, z) -> memcmp(x, y, z)
bzero(x, y) -> memset(x, 0, y)
1998-08-04 08:03:10 +04:00
|
|
|
memset(newfdp, 0, sizeof(struct filedesc0));
|
1998-01-05 07:51:15 +03:00
|
|
|
|
|
|
|
fdinit1(newfdp);
|
|
|
|
|
|
|
|
return (&newfdp->fd_fd);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Initialize a file descriptor table.
|
|
|
|
*/
|
|
|
|
void
|
2001-02-26 23:24:30 +03:00
|
|
|
fdinit1(struct filedesc0 *newfdp)
|
1998-01-05 07:51:15 +03:00
|
|
|
{
|
|
|
|
|
|
|
|
newfdp->fd_fd.fd_refcnt = 1;
|
|
|
|
newfdp->fd_fd.fd_ofiles = newfdp->fd_dfiles;
|
|
|
|
newfdp->fd_fd.fd_ofileflags = newfdp->fd_dfileflags;
|
|
|
|
newfdp->fd_fd.fd_nfiles = NDFILE;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Make p2 share p1's filedesc structure.
|
|
|
|
*/
|
|
|
|
void
|
2001-02-26 23:24:30 +03:00
|
|
|
fdshare(struct proc *p1, struct proc *p2)
|
1998-01-05 07:51:15 +03:00
|
|
|
{
|
|
|
|
|
|
|
|
p2->p_fd = p1->p_fd;
|
|
|
|
p1->p_fd->fd_refcnt++;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Make this process not share its filedesc structure, maintaining
|
|
|
|
* all file descriptor state.
|
|
|
|
*/
|
|
|
|
void
|
2001-02-26 23:24:30 +03:00
|
|
|
fdunshare(struct proc *p)
|
1998-01-05 07:51:15 +03:00
|
|
|
{
|
|
|
|
struct filedesc *newfd;
|
|
|
|
|
|
|
|
if (p->p_fd->fd_refcnt == 1)
|
|
|
|
return;
|
|
|
|
|
|
|
|
newfd = fdcopy(p);
|
|
|
|
fdfree(p);
|
|
|
|
p->p_fd = newfd;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Clear a process's fd table.
|
|
|
|
*/
|
|
|
|
void
|
2001-02-26 23:24:30 +03:00
|
|
|
fdclear(struct proc *p)
|
1998-01-05 07:51:15 +03:00
|
|
|
{
|
|
|
|
struct filedesc *newfd;
|
|
|
|
|
|
|
|
newfd = fdinit(p);
|
|
|
|
fdfree(p);
|
|
|
|
p->p_fd = newfd;
|
|
|
|
}
|
|
|
|
|
1994-05-17 08:21:49 +04:00
|
|
|
/*
|
|
|
|
* Copy a filedesc structure.
|
|
|
|
*/
|
|
|
|
struct filedesc *
|
2001-02-26 23:24:30 +03:00
|
|
|
fdcopy(struct proc *p)
|
1994-05-17 08:21:49 +04:00
|
|
|
{
|
2001-02-26 23:24:30 +03:00
|
|
|
struct filedesc *newfdp, *fdp;
|
|
|
|
struct file **fpp;
|
|
|
|
int i;
|
1994-05-17 08:21:49 +04:00
|
|
|
|
2001-02-26 23:24:30 +03:00
|
|
|
fdp = p->p_fd;
|
2000-03-22 20:42:57 +03:00
|
|
|
newfdp = pool_get(&filedesc0_pool, PR_WAITOK);
|
Abolition of bcopy, ovbcopy, bcmp, and bzero, phase one.
bcopy(x, y, z) -> memcpy(y, x, z)
ovbcopy(x, y, z) -> memmove(y, x, z)
bcmp(x, y, z) -> memcmp(x, y, z)
bzero(x, y) -> memset(x, 0, y)
1998-08-04 08:03:10 +04:00
|
|
|
memcpy(newfdp, fdp, sizeof(struct filedesc));
|
1994-05-17 08:21:49 +04:00
|
|
|
newfdp->fd_refcnt = 1;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If the number of open files fits in the internal arrays
|
|
|
|
* of the open file structure, use them, otherwise allocate
|
|
|
|
* additional memory for the number of descriptors currently
|
|
|
|
* in use.
|
|
|
|
*/
|
|
|
|
if (newfdp->fd_lastfile < NDFILE) {
|
|
|
|
newfdp->fd_ofiles = ((struct filedesc0 *) newfdp)->fd_dfiles;
|
|
|
|
newfdp->fd_ofileflags =
|
|
|
|
((struct filedesc0 *) newfdp)->fd_dfileflags;
|
|
|
|
i = NDFILE;
|
|
|
|
} else {
|
|
|
|
/*
|
|
|
|
* Compute the smallest multiple of NDEXTENT needed
|
|
|
|
* for the file descriptors currently in use,
|
|
|
|
* allowing the table to shrink.
|
|
|
|
*/
|
|
|
|
i = newfdp->fd_nfiles;
|
1994-12-04 06:09:50 +03:00
|
|
|
while (i >= 2 * NDEXTENT && i > newfdp->fd_lastfile * 2)
|
1994-05-17 08:21:49 +04:00
|
|
|
i /= 2;
|
2000-03-22 20:42:57 +03:00
|
|
|
newfdp->fd_ofiles = malloc(i * OFILESIZE, M_FILEDESC, M_WAITOK);
|
1994-05-17 08:21:49 +04:00
|
|
|
newfdp->fd_ofileflags = (char *) &newfdp->fd_ofiles[i];
|
|
|
|
}
|
|
|
|
newfdp->fd_nfiles = i;
|
Abolition of bcopy, ovbcopy, bcmp, and bzero, phase one.
bcopy(x, y, z) -> memcpy(y, x, z)
ovbcopy(x, y, z) -> memmove(y, x, z)
bcmp(x, y, z) -> memcmp(x, y, z)
bzero(x, y) -> memset(x, 0, y)
1998-08-04 08:03:10 +04:00
|
|
|
memcpy(newfdp->fd_ofiles, fdp->fd_ofiles, i * sizeof(struct file **));
|
|
|
|
memcpy(newfdp->fd_ofileflags, fdp->fd_ofileflags, i * sizeof(char));
|
1994-05-17 08:21:49 +04:00
|
|
|
fpp = newfdp->fd_ofiles;
|
1994-12-04 06:09:50 +03:00
|
|
|
for (i = newfdp->fd_lastfile; i >= 0; i--, fpp++)
|
1994-05-17 08:21:49 +04:00
|
|
|
if (*fpp != NULL)
|
|
|
|
(*fpp)->f_count++;
|
|
|
|
return (newfdp);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Release a filedesc structure.
|
|
|
|
*/
|
|
|
|
void
|
2001-02-26 23:24:30 +03:00
|
|
|
fdfree(struct proc *p)
|
1994-05-17 08:21:49 +04:00
|
|
|
{
|
2001-02-26 23:24:30 +03:00
|
|
|
struct filedesc *fdp;
|
|
|
|
struct file **fpp, *fp;
|
|
|
|
int i;
|
1994-05-17 08:21:49 +04:00
|
|
|
|
2001-02-26 23:24:30 +03:00
|
|
|
fdp = p->p_fd;
|
1994-05-17 08:21:49 +04:00
|
|
|
if (--fdp->fd_refcnt > 0)
|
|
|
|
return;
|
|
|
|
fpp = fdp->fd_ofiles;
|
1995-02-15 05:12:02 +03:00
|
|
|
for (i = fdp->fd_lastfile; i >= 0; i--, fpp++) {
|
|
|
|
fp = *fpp;
|
|
|
|
if (fp != NULL) {
|
|
|
|
*fpp = NULL;
|
1999-05-06 00:01:01 +04:00
|
|
|
FILE_USE(fp);
|
1995-02-15 05:12:02 +03:00
|
|
|
(void) closef(fp, p);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
p->p_fd = NULL;
|
1994-05-17 08:21:49 +04:00
|
|
|
if (fdp->fd_nfiles > NDFILE)
|
2000-03-22 20:42:57 +03:00
|
|
|
free(fdp->fd_ofiles, M_FILEDESC);
|
|
|
|
pool_put(&filedesc0_pool, fdp);
|
1994-05-17 08:21:49 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Internal form of close.
|
|
|
|
* Decrement reference count on file structure.
|
1994-05-19 12:13:09 +04:00
|
|
|
* Note: p may be NULL when closing a file
|
|
|
|
* that was being passed in a message.
|
1999-05-06 00:01:01 +04:00
|
|
|
*
|
|
|
|
* Note: we expect the caller is holding a usecount, and expects us
|
|
|
|
* to drop it (the caller thinks the file is going away forever).
|
1994-05-17 08:21:49 +04:00
|
|
|
*/
|
1996-02-04 05:15:01 +03:00
|
|
|
int
|
2001-02-26 23:24:30 +03:00
|
|
|
closef(struct file *fp, struct proc *p)
|
1994-05-17 08:21:49 +04:00
|
|
|
{
|
2001-02-26 23:24:30 +03:00
|
|
|
struct vnode *vp;
|
|
|
|
struct flock lf;
|
|
|
|
int error;
|
1994-05-17 08:21:49 +04:00
|
|
|
|
|
|
|
if (fp == NULL)
|
|
|
|
return (0);
|
1999-05-06 00:01:01 +04:00
|
|
|
|
1994-05-17 08:21:49 +04:00
|
|
|
/*
|
|
|
|
* POSIX record locking dictates that any close releases ALL
|
|
|
|
* locks owned by this process. This is handled by setting
|
|
|
|
* a flag in the unlock to free ONLY locks obeying POSIX
|
|
|
|
* semantics, and not to free BSD-style file locks.
|
1994-05-19 12:13:09 +04:00
|
|
|
* If the descriptor was in a message, POSIX-style locks
|
|
|
|
* aren't passed with the descriptor.
|
1994-05-17 08:21:49 +04:00
|
|
|
*/
|
|
|
|
if (p && (p->p_flag & P_ADVLOCK) && fp->f_type == DTYPE_VNODE) {
|
|
|
|
lf.l_whence = SEEK_SET;
|
|
|
|
lf.l_start = 0;
|
|
|
|
lf.l_len = 0;
|
|
|
|
lf.l_type = F_UNLCK;
|
|
|
|
vp = (struct vnode *)fp->f_data;
|
|
|
|
(void) VOP_ADVLOCK(vp, (caddr_t)p, F_UNLCK, &lf, F_POSIX);
|
|
|
|
}
|
1999-05-06 00:01:01 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* If WANTCLOSE is set, then the reference count on the file
|
|
|
|
* is 0, but there were multiple users of the file. This can
|
|
|
|
* happen if a filedesc structure is shared by multiple
|
|
|
|
* processes.
|
|
|
|
*/
|
2001-12-07 10:09:29 +03:00
|
|
|
if (fp->f_iflags & FIF_WANTCLOSE) {
|
1999-05-06 00:01:01 +04:00
|
|
|
/*
|
|
|
|
* Another user of the file is already closing, and is
|
|
|
|
* simply waiting for other users of the file to drain.
|
|
|
|
* Release our usecount, and wake up the closer if it
|
|
|
|
* is the only remaining use.
|
|
|
|
*/
|
|
|
|
#ifdef DIAGNOSTIC
|
|
|
|
if (fp->f_count != 0)
|
|
|
|
panic("closef: wantclose and count != 0");
|
|
|
|
if (fp->f_usecount < 2)
|
|
|
|
panic("closef: wantclose and usecount < 2");
|
|
|
|
#endif
|
|
|
|
if (--fp->f_usecount == 1)
|
|
|
|
wakeup(&fp->f_usecount);
|
1994-05-17 08:21:49 +04:00
|
|
|
return (0);
|
1999-05-06 00:01:01 +04:00
|
|
|
} else {
|
|
|
|
/*
|
|
|
|
* Decrement the reference count. If we were not the
|
|
|
|
* last reference, then release our use and just
|
|
|
|
* return.
|
|
|
|
*/
|
|
|
|
if (--fp->f_count > 0) {
|
|
|
|
#ifdef DIAGNOSTIC
|
|
|
|
if (fp->f_usecount < 1)
|
|
|
|
panic("closef: no wantclose and usecount < 1");
|
|
|
|
#endif
|
|
|
|
fp->f_usecount--;
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
if (fp->f_count < 0)
|
|
|
|
panic("closef: count < 0");
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* The reference count is now 0. However, there may be
|
|
|
|
* multiple potential users of this file. This can happen
|
|
|
|
* if multiple processes shared a single filedesc structure.
|
|
|
|
*
|
|
|
|
* Notify these potential users that the file is closing.
|
|
|
|
* This will prevent them from adding additional uses to
|
|
|
|
* the file.
|
|
|
|
*/
|
2001-12-07 10:09:29 +03:00
|
|
|
fp->f_iflags |= FIF_WANTCLOSE;
|
1999-05-06 00:01:01 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* We expect the caller to add a use to the file. So, if we
|
|
|
|
* are the last user, usecount will be 1. If it is not, we
|
|
|
|
* must wait for the usecount to drain. When it drains back
|
|
|
|
* to 1, we will be awakened so that we may proceed with the
|
|
|
|
* close.
|
|
|
|
*/
|
|
|
|
#ifdef DIAGNOSTIC
|
|
|
|
if (fp->f_usecount < 1)
|
|
|
|
panic("closef: usecount < 1");
|
|
|
|
#endif
|
|
|
|
while (fp->f_usecount > 1)
|
|
|
|
(void) tsleep(&fp->f_usecount, PRIBIO, "closef", 0);
|
|
|
|
#ifdef DIAGNOSTIC
|
|
|
|
if (fp->f_usecount != 1)
|
|
|
|
panic("closef: usecount != 1");
|
|
|
|
#endif
|
|
|
|
|
1994-05-17 08:21:49 +04:00
|
|
|
if ((fp->f_flag & FHASLOCK) && fp->f_type == DTYPE_VNODE) {
|
|
|
|
lf.l_whence = SEEK_SET;
|
|
|
|
lf.l_start = 0;
|
|
|
|
lf.l_len = 0;
|
|
|
|
lf.l_type = F_UNLCK;
|
|
|
|
vp = (struct vnode *)fp->f_data;
|
|
|
|
(void) VOP_ADVLOCK(vp, (caddr_t)fp, F_UNLCK, &lf, F_FLOCK);
|
|
|
|
}
|
1994-05-19 12:13:09 +04:00
|
|
|
if (fp->f_ops)
|
|
|
|
error = (*fp->f_ops->fo_close)(fp, p);
|
|
|
|
else
|
|
|
|
error = 0;
|
1999-05-06 00:01:01 +04:00
|
|
|
|
|
|
|
/* Nothing references the file now, drop the final use (us). */
|
|
|
|
fp->f_usecount--;
|
|
|
|
|
1994-05-17 08:21:49 +04:00
|
|
|
ffree(fp);
|
|
|
|
return (error);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Apply an advisory lock on a file descriptor.
|
|
|
|
*
|
|
|
|
* Just attempt to get a record lock of the requested type on
|
|
|
|
* the entire file (l_whence = SEEK_SET, l_start = 0, l_len = 0).
|
|
|
|
*/
|
|
|
|
/* ARGSUSED */
|
1996-02-04 05:15:01 +03:00
|
|
|
int
|
2001-02-26 23:24:30 +03:00
|
|
|
sys_flock(struct proc *p, void *v, register_t *retval)
|
1995-09-20 01:40:36 +04:00
|
|
|
{
|
2000-03-30 13:27:11 +04:00
|
|
|
struct sys_flock_args /* {
|
2001-02-26 23:24:30 +03:00
|
|
|
syscallarg(int) fd;
|
|
|
|
syscallarg(int) how;
|
1995-09-20 01:40:36 +04:00
|
|
|
} */ *uap = v;
|
2001-02-26 23:24:30 +03:00
|
|
|
int fd, how, error;
|
|
|
|
struct filedesc *fdp;
|
|
|
|
struct file *fp;
|
|
|
|
struct vnode *vp;
|
|
|
|
struct flock lf;
|
|
|
|
|
|
|
|
fd = SCARG(uap, fd);
|
|
|
|
how = SCARG(uap, how);
|
|
|
|
fdp = p->p_fd;
|
|
|
|
error = 0;
|
2001-06-15 00:32:41 +04:00
|
|
|
|
|
|
|
if ((fp = fd_getfile(fdp, fd)) == NULL)
|
1994-05-17 08:21:49 +04:00
|
|
|
return (EBADF);
|
1999-05-06 00:01:01 +04:00
|
|
|
|
|
|
|
FILE_USE(fp);
|
|
|
|
|
|
|
|
if (fp->f_type != DTYPE_VNODE) {
|
|
|
|
error = EOPNOTSUPP;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
1994-05-17 08:21:49 +04:00
|
|
|
vp = (struct vnode *)fp->f_data;
|
|
|
|
lf.l_whence = SEEK_SET;
|
|
|
|
lf.l_start = 0;
|
|
|
|
lf.l_len = 0;
|
1994-12-04 06:09:50 +03:00
|
|
|
if (how & LOCK_UN) {
|
1994-05-17 08:21:49 +04:00
|
|
|
lf.l_type = F_UNLCK;
|
|
|
|
fp->f_flag &= ~FHASLOCK;
|
1999-05-06 00:01:01 +04:00
|
|
|
error = VOP_ADVLOCK(vp, (caddr_t)fp, F_UNLCK, &lf, F_FLOCK);
|
|
|
|
goto out;
|
1994-05-17 08:21:49 +04:00
|
|
|
}
|
1994-12-04 06:09:50 +03:00
|
|
|
if (how & LOCK_EX)
|
1994-05-17 08:21:49 +04:00
|
|
|
lf.l_type = F_WRLCK;
|
1994-12-04 06:09:50 +03:00
|
|
|
else if (how & LOCK_SH)
|
1994-05-17 08:21:49 +04:00
|
|
|
lf.l_type = F_RDLCK;
|
1999-05-06 00:01:01 +04:00
|
|
|
else {
|
|
|
|
error = EINVAL;
|
|
|
|
goto out;
|
|
|
|
}
|
1994-05-17 08:21:49 +04:00
|
|
|
fp->f_flag |= FHASLOCK;
|
1994-12-04 06:09:50 +03:00
|
|
|
if (how & LOCK_NB)
|
1999-05-06 00:01:01 +04:00
|
|
|
error = VOP_ADVLOCK(vp, (caddr_t)fp, F_SETLK, &lf, F_FLOCK);
|
|
|
|
else
|
|
|
|
error = VOP_ADVLOCK(vp, (caddr_t)fp, F_SETLK, &lf,
|
|
|
|
F_FLOCK|F_WAIT);
|
|
|
|
out:
|
|
|
|
FILE_UNUSE(fp, p);
|
|
|
|
return (error);
|
1994-05-17 08:21:49 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* File Descriptor pseudo-device driver (/dev/fd/).
|
|
|
|
*
|
|
|
|
* Opening minor device N dup()s the file (if any) connected to file
|
|
|
|
* descriptor N belonging to the calling process. Note that this driver
|
|
|
|
* consists of only the ``open()'' routine, because all subsequent
|
|
|
|
* references to this file will be direct to the other driver.
|
|
|
|
*/
|
|
|
|
/* ARGSUSED */
|
1994-12-14 21:40:27 +03:00
|
|
|
int
|
2001-02-26 23:24:30 +03:00
|
|
|
filedescopen(dev_t dev, int mode, int type, struct proc *p)
|
1994-05-17 08:21:49 +04:00
|
|
|
{
|
|
|
|
|
1994-12-14 21:40:27 +03:00
|
|
|
/*
|
2000-05-27 03:10:36 +04:00
|
|
|
* XXX Kludge: set p->p_dupfd to contain the value of the
|
2002-04-28 01:31:41 +04:00
|
|
|
* the file descriptor being sought for duplication. The error
|
1994-12-14 21:40:27 +03:00
|
|
|
* return ensures that the vnode for this device will be released
|
|
|
|
* by vn_open. Open will detect this special error and take the
|
|
|
|
* actions in dupfdopen below. Other callers of vn_open or VOP_OPEN
|
|
|
|
* will simply report the error.
|
|
|
|
*/
|
|
|
|
p->p_dupfd = minor(dev);
|
|
|
|
return (ENODEV);
|
1994-12-04 06:09:50 +03:00
|
|
|
}
|
|
|
|
|
1994-12-14 21:40:27 +03:00
|
|
|
/*
|
|
|
|
* Duplicate the specified descriptor to a free descriptor.
|
|
|
|
*/
|
1994-12-04 06:09:50 +03:00
|
|
|
int
|
2001-02-26 23:24:30 +03:00
|
|
|
dupfdopen(struct proc *p, int indx, int dfd, int mode, int error)
|
1994-12-04 06:09:50 +03:00
|
|
|
{
|
2001-02-26 23:24:30 +03:00
|
|
|
struct filedesc *fdp;
|
|
|
|
struct file *wfp, *fp;
|
1994-12-04 06:09:50 +03:00
|
|
|
|
2001-02-26 23:24:30 +03:00
|
|
|
fdp = p->p_fd;
|
1994-12-04 06:09:50 +03:00
|
|
|
/*
|
|
|
|
* If the to-be-dup'd fd number is greater than the allowed number
|
|
|
|
* of file descriptors, or the fd to be dup'd has already been
|
|
|
|
* closed, reject. Note, check for new == old is necessary as
|
|
|
|
* falloc could allocate an already closed to-be-dup'd descriptor
|
|
|
|
* as the new descriptor.
|
|
|
|
*/
|
1994-12-14 21:40:27 +03:00
|
|
|
fp = fdp->fd_ofiles[indx];
|
2001-06-15 00:32:41 +04:00
|
|
|
|
|
|
|
if ((wfp = fd_getfile(fdp, dfd)) == NULL)
|
|
|
|
return (EBADF);
|
|
|
|
|
|
|
|
if (fp == wfp)
|
1994-12-04 06:09:50 +03:00
|
|
|
return (EBADF);
|
|
|
|
|
1999-05-06 00:01:01 +04:00
|
|
|
FILE_USE(wfp);
|
|
|
|
|
1994-12-04 06:09:50 +03:00
|
|
|
/*
|
1994-12-14 21:40:27 +03:00
|
|
|
* There are two cases of interest here.
|
|
|
|
*
|
|
|
|
* For ENODEV simply dup (dfd) to file descriptor
|
|
|
|
* (indx) and return.
|
|
|
|
*
|
|
|
|
* For ENXIO steal away the file structure from (dfd) and
|
|
|
|
* store it in (indx). (dfd) is effectively closed by
|
|
|
|
* this operation.
|
|
|
|
*
|
|
|
|
* Any other error code is just returned.
|
1994-12-04 06:09:50 +03:00
|
|
|
*/
|
1994-12-14 21:40:27 +03:00
|
|
|
switch (error) {
|
|
|
|
case ENODEV:
|
|
|
|
/*
|
|
|
|
* Check that the mode the file is being opened for is a
|
|
|
|
* subset of the mode of the existing descriptor.
|
|
|
|
*/
|
1999-05-06 00:01:01 +04:00
|
|
|
if (((mode & (FREAD|FWRITE)) | wfp->f_flag) != wfp->f_flag) {
|
|
|
|
FILE_UNUSE(wfp, p);
|
1994-12-14 21:40:27 +03:00
|
|
|
return (EACCES);
|
1999-05-06 00:01:01 +04:00
|
|
|
}
|
1994-12-14 21:40:27 +03:00
|
|
|
fdp->fd_ofiles[indx] = wfp;
|
|
|
|
fdp->fd_ofileflags[indx] = fdp->fd_ofileflags[dfd];
|
|
|
|
wfp->f_count++;
|
|
|
|
fd_used(fdp, indx);
|
1999-05-06 00:01:01 +04:00
|
|
|
FILE_UNUSE(wfp, p);
|
1994-12-14 21:40:27 +03:00
|
|
|
return (0);
|
1994-05-17 08:21:49 +04:00
|
|
|
|
1994-12-14 21:40:27 +03:00
|
|
|
case ENXIO:
|
|
|
|
/*
|
|
|
|
* Steal away the file pointer from dfd, and stuff it into indx.
|
|
|
|
*/
|
|
|
|
fdp->fd_ofiles[indx] = fdp->fd_ofiles[dfd];
|
|
|
|
fdp->fd_ofileflags[indx] = fdp->fd_ofileflags[dfd];
|
|
|
|
fdp->fd_ofiles[dfd] = NULL;
|
|
|
|
fdp->fd_ofileflags[dfd] = 0;
|
|
|
|
/*
|
|
|
|
* Complete the clean up of the filedesc structure by
|
|
|
|
* recomputing the various hints.
|
|
|
|
*/
|
|
|
|
fd_used(fdp, indx);
|
|
|
|
fd_unused(fdp, dfd);
|
1999-05-06 00:01:01 +04:00
|
|
|
FILE_UNUSE(wfp, p);
|
1994-12-14 21:40:27 +03:00
|
|
|
return (0);
|
1994-12-04 06:09:50 +03:00
|
|
|
|
1994-12-14 21:40:27 +03:00
|
|
|
default:
|
1999-05-06 00:01:01 +04:00
|
|
|
FILE_UNUSE(wfp, p);
|
1994-12-14 21:40:27 +03:00
|
|
|
return (error);
|
|
|
|
}
|
|
|
|
/* NOTREACHED */
|
1994-12-04 06:09:50 +03:00
|
|
|
}
|
1994-05-17 08:21:49 +04:00
|
|
|
|
1999-08-04 00:19:16 +04:00
|
|
|
/*
|
|
|
|
* fcntl call which is being passed to the file's fs.
|
|
|
|
*/
|
|
|
|
int
|
2001-02-26 23:24:30 +03:00
|
|
|
fcntl_forfs(int fd, struct proc *p, int cmd, void *arg)
|
1999-08-04 00:19:16 +04:00
|
|
|
{
|
2001-02-26 23:24:30 +03:00
|
|
|
struct file *fp;
|
|
|
|
struct filedesc *fdp;
|
|
|
|
int error;
|
|
|
|
u_int size;
|
|
|
|
caddr_t data, memp;
|
1999-08-04 00:19:16 +04:00
|
|
|
#define STK_PARAMS 128
|
2001-02-26 23:24:30 +03:00
|
|
|
char stkbuf[STK_PARAMS];
|
1999-08-04 00:19:16 +04:00
|
|
|
|
|
|
|
/* fd's value was validated in sys_fcntl before calling this routine */
|
|
|
|
fdp = p->p_fd;
|
|
|
|
fp = fdp->fd_ofiles[fd];
|
|
|
|
|
|
|
|
if ((fp->f_flag & (FREAD | FWRITE)) == 0)
|
|
|
|
return (EBADF);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Interpret high order word to find amount of data to be
|
|
|
|
* copied to/from the user's address space.
|
|
|
|
*/
|
|
|
|
size = (size_t)F_PARAM_LEN(cmd);
|
|
|
|
if (size > F_PARAM_MAX)
|
|
|
|
return (EINVAL);
|
|
|
|
memp = NULL;
|
|
|
|
if (size > sizeof(stkbuf)) {
|
|
|
|
memp = (caddr_t)malloc((u_long)size, M_IOCTLOPS, M_WAITOK);
|
|
|
|
data = memp;
|
|
|
|
} else
|
|
|
|
data = stkbuf;
|
|
|
|
if (cmd & F_FSIN) {
|
|
|
|
if (size) {
|
|
|
|
error = copyin(arg, data, size);
|
|
|
|
if (error) {
|
|
|
|
if (memp)
|
|
|
|
free(memp, M_IOCTLOPS);
|
|
|
|
return (error);
|
|
|
|
}
|
|
|
|
} else
|
|
|
|
*(caddr_t *)data = arg;
|
|
|
|
} else if ((cmd & F_FSOUT) && size)
|
|
|
|
/*
|
|
|
|
* Zero the buffer so the user always
|
|
|
|
* gets back something deterministic.
|
|
|
|
*/
|
|
|
|
memset(data, 0, size);
|
|
|
|
else if (cmd & F_FSVOID)
|
|
|
|
*(caddr_t *)data = arg;
|
|
|
|
|
|
|
|
|
|
|
|
error = (*fp->f_ops->fo_fcntl)(fp, cmd, data, p);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Copy any data to user, size was
|
|
|
|
* already set and checked above.
|
|
|
|
*/
|
|
|
|
if (error == 0 && (cmd & F_FSOUT) && size)
|
|
|
|
error = copyout(data, arg, size);
|
|
|
|
if (memp)
|
|
|
|
free(memp, M_IOCTLOPS);
|
|
|
|
return (error);
|
|
|
|
}
|
|
|
|
|
1994-12-04 06:09:50 +03:00
|
|
|
/*
|
|
|
|
* Close any files on exec?
|
|
|
|
*/
|
|
|
|
void
|
2001-02-26 23:24:30 +03:00
|
|
|
fdcloseexec(struct proc *p)
|
1994-12-04 06:09:50 +03:00
|
|
|
{
|
2001-02-26 23:24:30 +03:00
|
|
|
struct filedesc *fdp;
|
|
|
|
int fd;
|
1994-05-17 08:21:49 +04:00
|
|
|
|
2001-07-18 09:34:37 +04:00
|
|
|
fdunshare(p);
|
|
|
|
cwdunshare(p);
|
|
|
|
|
2001-02-26 23:24:30 +03:00
|
|
|
fdp = p->p_fd;
|
1994-12-04 06:09:50 +03:00
|
|
|
for (fd = 0; fd <= fdp->fd_lastfile; fd++)
|
|
|
|
if (fdp->fd_ofileflags[fd] & UF_EXCLOSE)
|
1995-04-10 22:27:59 +04:00
|
|
|
(void) fdrelease(p, fd);
|
1994-05-17 08:21:49 +04:00
|
|
|
}
|
2002-04-23 19:11:25 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* It is unsafe for set[ug]id processes to be started with file
|
|
|
|
* descriptors 0..2 closed, as these descriptors are given implicit
|
|
|
|
* significance in the Standard C library. fdcheckstd() will create a
|
|
|
|
* descriptor referencing /dev/null for each of stdin, stdout, and
|
|
|
|
* stderr that is not already open.
|
|
|
|
*/
|
|
|
|
int
|
|
|
|
fdcheckstd(p)
|
|
|
|
struct proc *p;
|
|
|
|
{
|
|
|
|
struct nameidata nd;
|
|
|
|
struct filedesc *fdp;
|
|
|
|
struct file *fp;
|
2002-04-24 20:09:24 +04:00
|
|
|
struct file *devnullfp;
|
2002-04-23 19:11:25 +04:00
|
|
|
register_t retval;
|
2002-04-23 21:20:58 +04:00
|
|
|
int fd, i, error, flags = FREAD|FWRITE, devnull = -1, logged = 0;
|
2002-04-23 19:11:25 +04:00
|
|
|
|
|
|
|
if ((fdp = p->p_fd) == NULL)
|
2002-04-28 01:31:41 +04:00
|
|
|
return (0);
|
2002-04-23 19:11:25 +04:00
|
|
|
for (i = 0; i < 3; i++) {
|
|
|
|
if (fdp->fd_ofiles[i] != NULL)
|
|
|
|
continue;
|
|
|
|
if (!logged) {
|
|
|
|
log(LOG_WARNING, "set{u,g}id pid %d (%s) was invoked "
|
|
|
|
"with fd 0, 1, or 2 closed\n", p->p_pid, p->p_comm);
|
|
|
|
logged++;
|
|
|
|
}
|
|
|
|
if (devnull < 0) {
|
|
|
|
if ((error = falloc(p, &fp, &fd)) != 0)
|
2002-04-28 01:31:41 +04:00
|
|
|
return (error);
|
2002-04-23 19:11:25 +04:00
|
|
|
NDINIT(&nd, LOOKUP, FOLLOW, UIO_SYSSPACE, "/dev/null",
|
|
|
|
p);
|
|
|
|
if ((error = vn_open(&nd, flags, 0)) != 0) {
|
|
|
|
FILE_UNUSE(fp, p);
|
|
|
|
ffree(fp);
|
|
|
|
fdremove(p->p_fd, fd);
|
2002-04-28 01:31:41 +04:00
|
|
|
return (error);
|
2002-04-23 19:11:25 +04:00
|
|
|
}
|
|
|
|
fp->f_data = (caddr_t)nd.ni_vp;
|
|
|
|
fp->f_flag = flags;
|
|
|
|
fp->f_ops = &vnops;
|
|
|
|
fp->f_type = DTYPE_VNODE;
|
|
|
|
VOP_UNLOCK(nd.ni_vp, 0);
|
|
|
|
devnull = fd;
|
2002-04-24 20:09:24 +04:00
|
|
|
devnullfp = fp;
|
2002-04-23 21:20:58 +04:00
|
|
|
FILE_SET_MATURE(fp);
|
|
|
|
FILE_UNUSE(fp, p);
|
2002-04-23 19:11:25 +04:00
|
|
|
} else {
|
|
|
|
restart:
|
|
|
|
if ((error = fdalloc(p, 0, &fd)) != 0) {
|
|
|
|
if (error == ENOSPC) {
|
|
|
|
fdexpand(p);
|
|
|
|
goto restart;
|
|
|
|
}
|
2002-04-28 01:31:41 +04:00
|
|
|
return (error);
|
2002-04-23 19:11:25 +04:00
|
|
|
}
|
2002-04-24 20:09:24 +04:00
|
|
|
|
|
|
|
FILE_USE(devnullfp);
|
|
|
|
/* finishdup() will unuse the descriptors for us */
|
2002-04-23 19:11:25 +04:00
|
|
|
if ((error = finishdup(p, devnull, fd, &retval)) != 0)
|
2002-04-28 01:31:41 +04:00
|
|
|
return (error);
|
2002-04-23 19:11:25 +04:00
|
|
|
}
|
|
|
|
}
|
2002-04-28 01:31:41 +04:00
|
|
|
return (0);
|
2002-04-23 19:11:25 +04:00
|
|
|
}
|