NetBSD/sys/kern/vfs_vnops.c

671 lines
14 KiB
C
Raw Normal View History

/* $NetBSD: vfs_vnops.c,v 1.54 2002/03/17 19:41:08 atatat Exp $ */
1994-05-17 08:21:49 +04:00
/*
1994-06-08 15:28:29 +04:00
* Copyright (c) 1982, 1986, 1989, 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
* @(#)vfs_vnops.c 8.14 (Berkeley) 6/15/95
1994-05-17 08:21:49 +04:00
*/
2001-11-12 18:25:01 +03:00
#include <sys/cdefs.h>
__KERNEL_RCSID(0, "$NetBSD: vfs_vnops.c,v 1.54 2002/03/17 19:41:08 atatat Exp $");
2001-11-12 18:25:01 +03:00
1998-02-19 03:53:46 +03:00
#include "fs_union.h"
1994-05-17 08:21:49 +04:00
#include <sys/param.h>
#include <sys/systm.h>
#include <sys/kernel.h>
#include <sys/file.h>
#include <sys/stat.h>
#include <sys/buf.h>
#include <sys/proc.h>
#include <sys/mount.h>
#include <sys/namei.h>
#include <sys/vnode.h>
#include <sys/ioctl.h>
#include <sys/tty.h>
1996-09-07 16:40:22 +04:00
#include <sys/poll.h>
1994-05-17 08:21:49 +04:00
#include <uvm/uvm_extern.h>
1998-03-01 05:20:01 +03:00
#ifdef UNION
#include <miscfs/union/union.h>
#endif
static int vn_statfile __P((struct file *fp, struct stat *sb, struct proc *p));
struct fileops vnops = {
vn_read, vn_write, vn_ioctl, vn_fcntl, vn_poll,
vn_statfile, vn_closefile
};
1994-05-17 08:21:49 +04:00
/*
* Common code for vnode open operations.
* Check permissions, and call the VOP_OPEN or VOP_CREATE routine.
*/
1996-02-04 05:17:43 +03:00
int
1994-12-14 22:03:13 +03:00
vn_open(ndp, fmode, cmode)
2000-03-30 13:27:11 +04:00
struct nameidata *ndp;
1994-05-17 08:21:49 +04:00
int fmode, cmode;
{
2000-03-30 13:27:11 +04:00
struct vnode *vp;
struct proc *p = ndp->ni_cnd.cn_proc;
struct ucred *cred = p->p_ucred;
1995-05-23 10:11:29 +04:00
struct vattr va;
1994-05-17 08:21:49 +04:00
int error;
if (fmode & O_CREAT) {
1994-06-08 15:28:29 +04:00
ndp->ni_cnd.cn_nameiop = CREATE;
ndp->ni_cnd.cn_flags = LOCKPARENT | LOCKLEAF;
if ((fmode & O_EXCL) == 0 &&
((fmode & FNOSYMLINK) == 0))
1994-06-08 15:28:29 +04:00
ndp->ni_cnd.cn_flags |= FOLLOW;
1996-02-04 05:17:43 +03:00
if ((error = namei(ndp)) != 0)
1994-05-17 08:21:49 +04:00
return (error);
if (ndp->ni_vp == NULL) {
1995-05-23 10:11:29 +04:00
VATTR_NULL(&va);
va.va_type = VREG;
va.va_mode = cmode;
1998-03-01 05:20:01 +03:00
if (fmode & O_EXCL)
va.va_vaflags |= VA_EXCLUSIVE;
1994-12-14 00:52:35 +03:00
VOP_LEASE(ndp->ni_dvp, p, cred, LEASE_WRITE);
1996-02-04 05:17:43 +03:00
error = VOP_CREATE(ndp->ni_dvp, &ndp->ni_vp,
&ndp->ni_cnd, &va);
if (error)
1994-05-17 08:21:49 +04:00
return (error);
fmode &= ~O_TRUNC;
vp = ndp->ni_vp;
} else {
1994-06-08 15:28:29 +04:00
VOP_ABORTOP(ndp->ni_dvp, &ndp->ni_cnd);
1994-05-17 08:21:49 +04:00
if (ndp->ni_dvp == ndp->ni_vp)
vrele(ndp->ni_dvp);
else
vput(ndp->ni_dvp);
ndp->ni_dvp = NULL;
vp = ndp->ni_vp;
if (fmode & O_EXCL) {
error = EEXIST;
goto bad;
}
if (ndp->ni_vp->v_type == VLNK) {
error = EFTYPE;
goto bad;
}
1994-05-17 08:21:49 +04:00
fmode &= ~O_CREAT;
}
} else {
1994-06-08 15:28:29 +04:00
ndp->ni_cnd.cn_nameiop = LOOKUP;
ndp->ni_cnd.cn_flags = FOLLOW | LOCKLEAF;
1996-02-04 05:17:43 +03:00
if ((error = namei(ndp)) != 0)
1994-05-17 08:21:49 +04:00
return (error);
vp = ndp->ni_vp;
}
if (vp->v_type == VSOCK) {
error = EOPNOTSUPP;
goto bad;
}
if ((fmode & O_CREAT) == 0) {
if (fmode & FREAD) {
1996-02-04 05:17:43 +03:00
if ((error = VOP_ACCESS(vp, VREAD, cred, p)) != 0)
1994-05-17 08:21:49 +04:00
goto bad;
}
if (fmode & (FWRITE | O_TRUNC)) {
if (vp->v_type == VDIR) {
error = EISDIR;
goto bad;
}
1996-02-04 05:17:43 +03:00
if ((error = vn_writechk(vp)) != 0 ||
(error = VOP_ACCESS(vp, VWRITE, cred, p)) != 0)
1994-05-17 08:21:49 +04:00
goto bad;
}
}
if (fmode & O_TRUNC) {
1998-03-01 05:20:01 +03:00
VOP_UNLOCK(vp, 0); /* XXX */
1994-12-14 00:52:35 +03:00
VOP_LEASE(vp, p, cred, LEASE_WRITE);
1998-03-01 05:20:01 +03:00
vn_lock(vp, LK_EXCLUSIVE | LK_RETRY); /* XXX */
1995-05-23 10:11:29 +04:00
VATTR_NULL(&va);
va.va_size = 0;
1996-02-04 05:17:43 +03:00
if ((error = VOP_SETATTR(vp, &va, cred, p)) != 0)
1994-05-17 08:21:49 +04:00
goto bad;
}
1996-02-04 05:17:43 +03:00
if ((error = VOP_OPEN(vp, fmode, cred, p)) != 0)
1994-05-17 08:21:49 +04:00
goto bad;
if (vp->v_type == VREG &&
uvn_attach(vp, fmode & FWRITE ? VM_PROT_WRITE : 0) == NULL) {
error = EIO;
goto bad;
}
1994-05-17 08:21:49 +04:00
if (fmode & FWRITE)
vp->v_writecount++;
1994-05-17 08:21:49 +04:00
return (0);
bad:
vput(vp);
return (error);
}
/*
* Check for write permissions on the specified vnode.
1998-03-01 05:20:01 +03:00
* Prototype text segments cannot be written.
1994-05-17 08:21:49 +04:00
*/
1996-02-04 05:17:43 +03:00
int
1994-05-17 08:21:49 +04:00
vn_writechk(vp)
2000-03-30 13:27:11 +04:00
struct vnode *vp;
1994-05-17 08:21:49 +04:00
{
/*
* If the vnode is in use as a process's text,
* we can't allow writing.
1994-05-17 08:21:49 +04:00
*/
if (vp->v_flag & VTEXT)
return (ETXTBSY);
1994-05-17 08:21:49 +04:00
return (0);
}
/*
* Mark a vnode as having executable mappings.
*/
void
vn_markexec(vp)
struct vnode *vp;
{
if ((vp->v_flag & VEXECMAP) == 0) {
uvmexp.filepages -= vp->v_uobj.uo_npages;
uvmexp.execpages += vp->v_uobj.uo_npages;
}
vp->v_flag |= VEXECMAP;
}
1994-05-17 08:21:49 +04:00
/*
* Vnode close call
*
* Note: takes an unlocked vnode, while VOP_CLOSE takes a locked node.
1994-05-17 08:21:49 +04:00
*/
1996-02-04 05:17:43 +03:00
int
1994-05-17 08:21:49 +04:00
vn_close(vp, flags, cred, p)
2000-03-30 13:27:11 +04:00
struct vnode *vp;
1994-05-17 08:21:49 +04:00
int flags;
struct ucred *cred;
struct proc *p;
{
int error;
if (flags & FWRITE)
vp->v_writecount--;
vn_lock(vp, LK_EXCLUSIVE | LK_RETRY);
1994-05-17 08:21:49 +04:00
error = VOP_CLOSE(vp, flags, cred, p);
vput(vp);
1994-05-17 08:21:49 +04:00
return (error);
}
/*
* Package up an I/O request on a vnode into a uio and do it.
*/
1996-02-04 05:17:43 +03:00
int
1994-05-17 08:21:49 +04:00
vn_rdwr(rw, vp, base, len, offset, segflg, ioflg, cred, aresid, p)
enum uio_rw rw;
struct vnode *vp;
caddr_t base;
int len;
off_t offset;
enum uio_seg segflg;
int ioflg;
struct ucred *cred;
size_t *aresid;
1994-05-17 08:21:49 +04:00
struct proc *p;
{
struct uio auio;
struct iovec aiov;
int error;
if ((ioflg & IO_NODELOCKED) == 0) {
if (rw == UIO_READ) {
vn_lock(vp, LK_SHARED | LK_RETRY);
} else {
vn_lock(vp, LK_EXCLUSIVE | LK_RETRY);
}
}
1994-05-17 08:21:49 +04:00
auio.uio_iov = &aiov;
auio.uio_iovcnt = 1;
aiov.iov_base = base;
aiov.iov_len = len;
auio.uio_resid = len;
auio.uio_offset = offset;
auio.uio_segflg = segflg;
auio.uio_rw = rw;
auio.uio_procp = p;
1994-06-08 15:28:29 +04:00
if (rw == UIO_READ) {
1994-05-17 08:21:49 +04:00
error = VOP_READ(vp, &auio, ioflg, cred);
1994-06-08 15:28:29 +04:00
} else {
1994-05-17 08:21:49 +04:00
error = VOP_WRITE(vp, &auio, ioflg, cred);
1994-06-08 15:28:29 +04:00
}
1994-05-17 08:21:49 +04:00
if (aresid)
*aresid = auio.uio_resid;
else
if (auio.uio_resid && error == 0)
error = EIO;
if ((ioflg & IO_NODELOCKED) == 0)
1998-03-01 05:20:01 +03:00
VOP_UNLOCK(vp, 0);
1994-05-17 08:21:49 +04:00
return (error);
}
int
vn_readdir(fp, buf, segflg, count, done, p, cookies, ncookies)
struct file *fp;
char *buf;
1998-03-01 05:20:01 +03:00
int segflg, *done, *ncookies;
u_int count;
struct proc *p;
1998-03-01 05:20:01 +03:00
off_t **cookies;
{
struct vnode *vp = (struct vnode *)fp->f_data;
struct iovec aiov;
struct uio auio;
int error, eofflag;
unionread:
if (vp->v_type != VDIR)
return (EINVAL);
aiov.iov_base = buf;
aiov.iov_len = count;
auio.uio_iov = &aiov;
auio.uio_iovcnt = 1;
auio.uio_rw = UIO_READ;
auio.uio_segflg = segflg;
auio.uio_procp = p;
auio.uio_resid = count;
vn_lock(vp, LK_SHARED | LK_RETRY);
auio.uio_offset = fp->f_offset;
1998-03-01 05:20:01 +03:00
error = VOP_READDIR(vp, &auio, fp->f_cred, &eofflag, cookies,
ncookies);
fp->f_offset = auio.uio_offset;
1998-03-01 05:20:01 +03:00
VOP_UNLOCK(vp, 0);
if (error)
return (error);
#ifdef UNION
{
extern struct vnode *union_dircache __P((struct vnode *));
if (count == auio.uio_resid && (vp->v_op == union_vnodeop_p)) {
struct vnode *lvp;
lvp = union_dircache(vp);
if (lvp != NULLVP) {
struct vattr va;
/*
* If the directory is opaque,
* then don't show lower entries
*/
error = VOP_GETATTR(vp, &va, fp->f_cred, p);
if (va.va_flags & OPAQUE) {
vput(lvp);
lvp = NULL;
}
}
if (lvp != NULLVP) {
error = VOP_OPEN(lvp, FREAD, fp->f_cred, p);
if (error) {
1998-03-01 05:20:01 +03:00
vput(lvp);
return (error);
}
1998-03-01 05:20:01 +03:00
VOP_UNLOCK(lvp, 0);
fp->f_data = (caddr_t) lvp;
fp->f_offset = 0;
error = vn_close(vp, FREAD, fp->f_cred, p);
if (error)
return (error);
vp = lvp;
goto unionread;
}
}
}
#endif /* UNION */
if (count == auio.uio_resid && (vp->v_flag & VROOT) &&
(vp->v_mount->mnt_flag & MNT_UNION)) {
struct vnode *tvp = vp;
vp = vp->v_mount->mnt_vnodecovered;
VREF(vp);
fp->f_data = (caddr_t) vp;
fp->f_offset = 0;
vrele(tvp);
goto unionread;
}
*done = count - auio.uio_resid;
return error;
}
1994-05-17 08:21:49 +04:00
/*
* File table vnode read routine.
*/
1996-02-04 05:17:43 +03:00
int
vn_read(fp, offset, uio, cred, flags)
1994-05-17 08:21:49 +04:00
struct file *fp;
off_t *offset;
1994-05-17 08:21:49 +04:00
struct uio *uio;
struct ucred *cred;
int flags;
1994-05-17 08:21:49 +04:00
{
1998-03-01 05:20:01 +03:00
struct vnode *vp = (struct vnode *)fp->f_data;
int count, error, ioflag = 0;
1994-05-17 08:21:49 +04:00
1994-12-14 00:52:35 +03:00
VOP_LEASE(vp, uio->uio_procp, cred, LEASE_READ);
if (fp->f_flag & FNONBLOCK)
ioflag |= IO_NDELAY;
if ((fp->f_flag & (FFSYNC | FRSYNC)) == (FFSYNC | FRSYNC))
ioflag |= IO_SYNC;
if (fp->f_flag & FALTIO)
ioflag |= IO_ALTSEMANTICS;
vn_lock(vp, LK_SHARED | LK_RETRY);
uio->uio_offset = *offset;
1994-05-17 08:21:49 +04:00
count = uio->uio_resid;
error = VOP_READ(vp, uio, ioflag, cred);
if (flags & FOF_UPDATE_OFFSET)
*offset += count - uio->uio_resid;
1998-03-01 05:20:01 +03:00
VOP_UNLOCK(vp, 0);
1994-05-17 08:21:49 +04:00
return (error);
}
/*
* File table vnode write routine.
*/
1996-02-04 05:17:43 +03:00
int
vn_write(fp, offset, uio, cred, flags)
1994-05-17 08:21:49 +04:00
struct file *fp;
off_t *offset;
1994-05-17 08:21:49 +04:00
struct uio *uio;
struct ucred *cred;
int flags;
1994-05-17 08:21:49 +04:00
{
1998-03-01 05:20:01 +03:00
struct vnode *vp = (struct vnode *)fp->f_data;
1994-12-14 00:52:35 +03:00
int count, error, ioflag = IO_UNIT;
1994-05-17 08:21:49 +04:00
if (vp->v_type == VREG && (fp->f_flag & O_APPEND))
ioflag |= IO_APPEND;
if (fp->f_flag & FNONBLOCK)
ioflag |= IO_NDELAY;
if (fp->f_flag & FFSYNC ||
(vp->v_mount && (vp->v_mount->mnt_flag & MNT_SYNCHRONOUS)))
ioflag |= IO_SYNC;
else if (fp->f_flag & FDSYNC)
ioflag |= IO_DSYNC;
if (fp->f_flag & FALTIO)
ioflag |= IO_ALTSEMANTICS;
1994-12-14 00:52:35 +03:00
VOP_LEASE(vp, uio->uio_procp, cred, LEASE_WRITE);
1998-03-01 05:20:01 +03:00
vn_lock(vp, LK_EXCLUSIVE | LK_RETRY);
uio->uio_offset = *offset;
1994-05-17 08:21:49 +04:00
count = uio->uio_resid;
error = VOP_WRITE(vp, uio, ioflag, cred);
if (flags & FOF_UPDATE_OFFSET) {
if (ioflag & IO_APPEND)
*offset = uio->uio_offset;
else
*offset += count - uio->uio_resid;
}
1998-03-01 05:20:01 +03:00
VOP_UNLOCK(vp, 0);
1994-05-17 08:21:49 +04:00
return (error);
}
/*
* File table vnode stat routine.
*/
static int
vn_statfile(fp, sb, p)
struct file *fp;
struct stat *sb;
struct proc *p;
{
struct vnode *vp = (struct vnode *)fp->f_data;
return vn_stat(vp, sb, p);
}
1996-02-04 05:17:43 +03:00
int
vn_stat(fdata, sb, p)
void *fdata;
2000-03-30 13:27:11 +04:00
struct stat *sb;
1994-05-17 08:21:49 +04:00
struct proc *p;
{
struct vnode *vp = fdata;
1995-05-23 10:11:29 +04:00
struct vattr va;
1994-05-17 08:21:49 +04:00
int error;
mode_t mode;
1994-05-17 08:21:49 +04:00
1995-05-23 10:11:29 +04:00
error = VOP_GETATTR(vp, &va, p->p_ucred, p);
1994-05-17 08:21:49 +04:00
if (error)
return (error);
/*
* Copy from vattr table
*/
1995-05-23 10:11:29 +04:00
sb->st_dev = va.va_fsid;
sb->st_ino = va.va_fileid;
mode = va.va_mode;
1994-05-17 08:21:49 +04:00
switch (vp->v_type) {
case VREG:
mode |= S_IFREG;
break;
case VDIR:
mode |= S_IFDIR;
break;
case VBLK:
mode |= S_IFBLK;
break;
case VCHR:
mode |= S_IFCHR;
break;
case VLNK:
mode |= S_IFLNK;
break;
case VSOCK:
mode |= S_IFSOCK;
break;
case VFIFO:
mode |= S_IFIFO;
break;
default:
return (EBADF);
};
sb->st_mode = mode;
1995-05-23 10:11:29 +04:00
sb->st_nlink = va.va_nlink;
sb->st_uid = va.va_uid;
sb->st_gid = va.va_gid;
sb->st_rdev = va.va_rdev;
sb->st_size = va.va_size;
sb->st_atimespec = va.va_atime;
sb->st_mtimespec = va.va_mtime;
sb->st_ctimespec = va.va_ctime;
sb->st_blksize = va.va_blocksize;
sb->st_flags = va.va_flags;
sb->st_gen = 0;
1995-05-23 10:11:29 +04:00
sb->st_blocks = va.va_bytes / S_BLKSIZE;
1994-05-17 08:21:49 +04:00
return (0);
}
/*
* File table vnode fcntl routine.
*/
int
vn_fcntl(fp, com, data, p)
struct file *fp;
u_int com;
caddr_t data;
struct proc *p;
{
2000-03-30 13:27:11 +04:00
struct vnode *vp = ((struct vnode *)fp->f_data);
int error;
vn_lock(vp, LK_EXCLUSIVE | LK_RETRY);
error = VOP_FCNTL(vp, com, data, fp->f_flag, p->p_ucred, p);
VOP_UNLOCK(vp, 0);
return (error);
}
1994-05-17 08:21:49 +04:00
/*
* File table vnode ioctl routine.
*/
1996-02-04 05:17:43 +03:00
int
1994-05-17 08:21:49 +04:00
vn_ioctl(fp, com, data, p)
struct file *fp;
u_long com;
1994-05-17 08:21:49 +04:00
caddr_t data;
struct proc *p;
{
2000-03-30 13:27:11 +04:00
struct vnode *vp = ((struct vnode *)fp->f_data);
1994-05-17 08:21:49 +04:00
struct vattr vattr;
int error;
switch (vp->v_type) {
case VREG:
case VDIR:
if (com == FIONREAD) {
1996-02-04 05:17:43 +03:00
error = VOP_GETATTR(vp, &vattr, p->p_ucred, p);
if (error)
1994-05-17 08:21:49 +04:00
return (error);
*(int *)data = vattr.va_size - fp->f_offset;
return (0);
}
if (com == FIONBIO || com == FIOASYNC) /* XXX */
return (0); /* XXX */
/* fall into ... */
default:
return (EPASSTHROUGH);
1994-05-17 08:21:49 +04:00
case VFIFO:
case VCHR:
case VBLK:
error = VOP_IOCTL(vp, com, data, fp->f_flag, p->p_ucred, p);
if (error == 0 && com == TIOCSCTTY) {
if (p->p_session->s_ttyvp)
vrele(p->p_session->s_ttyvp);
1994-05-17 08:21:49 +04:00
p->p_session->s_ttyvp = vp;
VREF(vp);
}
return (error);
}
}
/*
1996-09-07 16:40:22 +04:00
* File table vnode poll routine.
1994-05-17 08:21:49 +04:00
*/
1996-02-04 05:17:43 +03:00
int
1996-09-07 16:40:22 +04:00
vn_poll(fp, events, p)
1994-05-17 08:21:49 +04:00
struct file *fp;
1996-09-07 16:40:22 +04:00
int events;
1994-05-17 08:21:49 +04:00
struct proc *p;
{
1996-09-07 16:40:22 +04:00
return (VOP_POLL(((struct vnode *)fp->f_data), events, p));
1994-05-17 08:21:49 +04:00
}
1998-03-01 05:20:01 +03:00
/*
* Check that the vnode is still valid, and if so
* acquire requested lock.
*/
int
vn_lock(vp, flags)
struct vnode *vp;
int flags;
{
int error;
1998-03-01 05:20:01 +03:00
do {
if ((flags & LK_INTERLOCK) == 0)
1998-03-01 05:20:01 +03:00
simple_lock(&vp->v_interlock);
if (vp->v_flag & VXLOCK) {
a whole bunch of changes to improve performance and robustness under load: - remove special treatment of pager_map mappings in pmaps. this is required now, since I've removed the globals that expose the address range. pager_map now uses pmap_kenter_pa() instead of pmap_enter(), so there's no longer any need to special-case it. - eliminate struct uvm_vnode by moving its fields into struct vnode. - rewrite the pageout path. the pager is now responsible for handling the high-level requests instead of only getting control after a bunch of work has already been done on its behalf. this will allow us to UBCify LFS, which needs tighter control over its pages than other filesystems do. writing a page to disk no longer requires making it read-only, which allows us to write wired pages without causing all kinds of havoc. - use a new PG_PAGEOUT flag to indicate that a page should be freed on behalf of the pagedaemon when it's unlocked. this flag is very similar to PG_RELEASED, but unlike PG_RELEASED, PG_PAGEOUT can be cleared if the pageout fails due to eg. an indirect-block buffer being locked. this allows us to remove the "version" field from struct vm_page, and together with shrinking "loan_count" from 32 bits to 16, struct vm_page is now 4 bytes smaller. - no longer use PG_RELEASED for swap-backed pages. if the page is busy because it's being paged out, we can't release the swap slot to be reallocated until that write is complete, but unlike with vnodes we don't keep a count of in-progress writes so there's no good way to know when the write is done. instead, when we need to free a busy swap-backed page, just sleep until we can get it busy ourselves. - implement a fast-path for extending writes which allows us to avoid zeroing new pages. this substantially reduces cpu usage. - encapsulate the data used by the genfs code in a struct genfs_node, which must be the first element of the filesystem-specific vnode data for filesystems which use genfs_{get,put}pages(). - eliminate many of the UVM pagerops, since they aren't needed anymore now that the pager "put" operation is a higher-level operation. - enhance the genfs code to allow NFS to use the genfs_{get,put}pages instead of a modified copy. - clean up struct vnode by removing all the fields that used to be used by the vfs_cluster.c code (which we don't use anymore with UBC). - remove kmem_object and mb_object since they were useless. instead of allocating pages to these objects, we now just allocate pages with no object. such pages are mapped in the kernel until they are freed, so we can use the mapping to find the page to free it. this allows us to remove splvm() protection in several places. The sum of all these changes improves write throughput on my decstation 5000/200 to within 1% of the rate of NetBSD 1.5 and reduces the elapsed time for "make release" of a NetBSD 1.5 source tree on my 128MB pc to 10% less than a 1.5 kernel took.
2001-09-16 00:36:31 +04:00
if (flags & LK_NOWAIT) {
simple_unlock(&vp->v_interlock);
return EBUSY;
}
1998-03-01 05:20:01 +03:00
vp->v_flag |= VXWANT;
a whole bunch of changes to improve performance and robustness under load: - remove special treatment of pager_map mappings in pmaps. this is required now, since I've removed the globals that expose the address range. pager_map now uses pmap_kenter_pa() instead of pmap_enter(), so there's no longer any need to special-case it. - eliminate struct uvm_vnode by moving its fields into struct vnode. - rewrite the pageout path. the pager is now responsible for handling the high-level requests instead of only getting control after a bunch of work has already been done on its behalf. this will allow us to UBCify LFS, which needs tighter control over its pages than other filesystems do. writing a page to disk no longer requires making it read-only, which allows us to write wired pages without causing all kinds of havoc. - use a new PG_PAGEOUT flag to indicate that a page should be freed on behalf of the pagedaemon when it's unlocked. this flag is very similar to PG_RELEASED, but unlike PG_RELEASED, PG_PAGEOUT can be cleared if the pageout fails due to eg. an indirect-block buffer being locked. this allows us to remove the "version" field from struct vm_page, and together with shrinking "loan_count" from 32 bits to 16, struct vm_page is now 4 bytes smaller. - no longer use PG_RELEASED for swap-backed pages. if the page is busy because it's being paged out, we can't release the swap slot to be reallocated until that write is complete, but unlike with vnodes we don't keep a count of in-progress writes so there's no good way to know when the write is done. instead, when we need to free a busy swap-backed page, just sleep until we can get it busy ourselves. - implement a fast-path for extending writes which allows us to avoid zeroing new pages. this substantially reduces cpu usage. - encapsulate the data used by the genfs code in a struct genfs_node, which must be the first element of the filesystem-specific vnode data for filesystems which use genfs_{get,put}pages(). - eliminate many of the UVM pagerops, since they aren't needed anymore now that the pager "put" operation is a higher-level operation. - enhance the genfs code to allow NFS to use the genfs_{get,put}pages instead of a modified copy. - clean up struct vnode by removing all the fields that used to be used by the vfs_cluster.c code (which we don't use anymore with UBC). - remove kmem_object and mb_object since they were useless. instead of allocating pages to these objects, we now just allocate pages with no object. such pages are mapped in the kernel until they are freed, so we can use the mapping to find the page to free it. this allows us to remove splvm() protection in several places. The sum of all these changes improves write throughput on my decstation 5000/200 to within 1% of the rate of NetBSD 1.5 and reduces the elapsed time for "make release" of a NetBSD 1.5 source tree on my 128MB pc to 10% less than a 1.5 kernel took.
2001-09-16 00:36:31 +04:00
ltsleep(vp, PINOD | PNORELOCK,
"vn_lock", 0, &vp->v_interlock);
1998-03-01 05:20:01 +03:00
error = ENOENT;
} else {
error = VOP_LOCK(vp, flags | LK_INTERLOCK);
a whole bunch of changes to improve performance and robustness under load: - remove special treatment of pager_map mappings in pmaps. this is required now, since I've removed the globals that expose the address range. pager_map now uses pmap_kenter_pa() instead of pmap_enter(), so there's no longer any need to special-case it. - eliminate struct uvm_vnode by moving its fields into struct vnode. - rewrite the pageout path. the pager is now responsible for handling the high-level requests instead of only getting control after a bunch of work has already been done on its behalf. this will allow us to UBCify LFS, which needs tighter control over its pages than other filesystems do. writing a page to disk no longer requires making it read-only, which allows us to write wired pages without causing all kinds of havoc. - use a new PG_PAGEOUT flag to indicate that a page should be freed on behalf of the pagedaemon when it's unlocked. this flag is very similar to PG_RELEASED, but unlike PG_RELEASED, PG_PAGEOUT can be cleared if the pageout fails due to eg. an indirect-block buffer being locked. this allows us to remove the "version" field from struct vm_page, and together with shrinking "loan_count" from 32 bits to 16, struct vm_page is now 4 bytes smaller. - no longer use PG_RELEASED for swap-backed pages. if the page is busy because it's being paged out, we can't release the swap slot to be reallocated until that write is complete, but unlike with vnodes we don't keep a count of in-progress writes so there's no good way to know when the write is done. instead, when we need to free a busy swap-backed page, just sleep until we can get it busy ourselves. - implement a fast-path for extending writes which allows us to avoid zeroing new pages. this substantially reduces cpu usage. - encapsulate the data used by the genfs code in a struct genfs_node, which must be the first element of the filesystem-specific vnode data for filesystems which use genfs_{get,put}pages(). - eliminate many of the UVM pagerops, since they aren't needed anymore now that the pager "put" operation is a higher-level operation. - enhance the genfs code to allow NFS to use the genfs_{get,put}pages instead of a modified copy. - clean up struct vnode by removing all the fields that used to be used by the vfs_cluster.c code (which we don't use anymore with UBC). - remove kmem_object and mb_object since they were useless. instead of allocating pages to these objects, we now just allocate pages with no object. such pages are mapped in the kernel until they are freed, so we can use the mapping to find the page to free it. this allows us to remove splvm() protection in several places. The sum of all these changes improves write throughput on my decstation 5000/200 to within 1% of the rate of NetBSD 1.5 and reduces the elapsed time for "make release" of a NetBSD 1.5 source tree on my 128MB pc to 10% less than a 1.5 kernel took.
2001-09-16 00:36:31 +04:00
if (error == 0 || error == EDEADLK || error == EBUSY)
1998-03-01 05:20:01 +03:00
return (error);
}
flags &= ~LK_INTERLOCK;
} while (flags & LK_RETRY);
return (error);
}
1994-05-17 08:21:49 +04:00
/*
* File table vnode close routine.
*/
1996-02-04 05:17:43 +03:00
int
1994-05-17 08:21:49 +04:00
vn_closefile(fp, p)
struct file *fp;
struct proc *p;
{
return (vn_close(((struct vnode *)fp->f_data), fp->f_flag,
fp->f_cred, p));
}
/*
* Enable LK_CANRECURSE on lock. Return prior status.
*/
u_int
vn_setrecurse(vp)
struct vnode *vp;
{
struct lock *lkp = &vp->v_lock;
u_int retval = lkp->lk_flags & LK_CANRECURSE;
lkp->lk_flags |= LK_CANRECURSE;
return retval;
}
/*
* Called when done with locksetrecurse.
*/
void
vn_restorerecurse(vp, flags)
struct vnode *vp;
u_int flags;
{
struct lock *lkp = &vp->v_lock;
lkp->lk_flags &= ~LK_CANRECURSE;
lkp->lk_flags |= flags;
}