NetBSD/sys/fs/adosfs/advnops.c

956 lines
21 KiB
C
Raw Normal View History

/* $NetBSD: advnops.c,v 1.3 2003/01/24 21:55:17 fvdl Exp $ */
/*
* Copyright (c) 1994 Christian E. Hopps
* Copyright (c) 1996 Matthias Scheler
* All rights reserved.
*
* 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 Christian E. Hopps.
* 4. The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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-06-08 08:27:50 +04:00
2001-11-13 01:54:03 +03:00
#include <sys/cdefs.h>
__KERNEL_RCSID(0, "$NetBSD: advnops.c,v 1.3 2003/01/24 21:55:17 fvdl Exp $");
2001-11-13 01:54:03 +03:00
2001-05-30 15:40:35 +04:00
#if defined(_KERNEL_OPT)
1998-06-08 08:27:50 +04:00
#include "opt_quota.h"
#endif
1998-06-08 08:27:50 +04:00
#include <sys/param.h>
#include <sys/systm.h>
#include <sys/vnode.h>
#include <sys/mount.h>
#include <sys/time.h>
#include <sys/queue.h>
#include <sys/namei.h>
#include <sys/buf.h>
#include <sys/dirent.h>
1994-06-18 00:06:05 +04:00
#include <sys/malloc.h>
#include <sys/pool.h>
#include <sys/stat.h>
1994-06-18 00:06:05 +04:00
#include <sys/unistd.h>
1996-02-09 22:06:38 +03:00
#include <sys/proc.h>
#include <miscfs/genfs/genfs.h>
#include <miscfs/specfs/specdev.h>
#include <fs/adosfs/adosfs.h>
extern struct vnodeops adosfs_vnodeops;
#define adosfs_open genfs_nullop
1996-02-09 22:06:38 +03:00
int adosfs_getattr __P((void *));
int adosfs_read __P((void *));
int adosfs_write __P((void *));
#define adosfs_fcntl genfs_fcntl
#define adosfs_ioctl genfs_enoioctl
1996-09-07 16:40:22 +04:00
#define adosfs_poll genfs_poll
1996-02-09 22:06:38 +03:00
int adosfs_strategy __P((void *));
1996-02-10 03:44:18 +03:00
int adosfs_link __P((void *));
int adosfs_symlink __P((void *));
#define adosfs_abortop genfs_abortop
1996-02-09 22:06:38 +03:00
int adosfs_bmap __P((void *));
int adosfs_print __P((void *));
int adosfs_readdir __P((void *));
int adosfs_access __P((void *));
int adosfs_readlink __P((void *));
int adosfs_inactive __P((void *));
int adosfs_reclaim __P((void *));
int adosfs_pathconf __P((void *));
#define adosfs_close genfs_nullop
#define adosfs_fsync genfs_nullop
1998-06-26 02:20:39 +04:00
#define adosfs_lease_check genfs_lease_check
#define adosfs_seek genfs_seek
#define adosfs_vfree genfs_nullop
#define adosfs_advlock genfs_einval
#define adosfs_blkatoff genfs_eopnotsupp
#define adosfs_bwrite genfs_eopnotsupp
#define adosfs_create genfs_eopnotsupp
#define adosfs_mkdir genfs_eopnotsupp
#define adosfs_mknod genfs_eopnotsupp
1998-03-01 05:20:01 +03:00
#define adosfs_revoke genfs_revoke
#define adosfs_mmap genfs_mmap
#define adosfs_remove genfs_eopnotsupp
#define adosfs_rename genfs_eopnotsupp
#define adosfs_rmdir genfs_eopnotsupp
#define adosfs_setattr genfs_eopnotsupp
#define adosfs_truncate genfs_eopnotsupp
#define adosfs_update genfs_nullop
#define adosfs_valloc genfs_eopnotsupp
1996-02-09 22:06:38 +03:00
const struct vnodeopv_entry_desc adosfs_vnodeop_entries[] = {
{ &vop_default_desc, vn_default_error },
{ &vop_lookup_desc, adosfs_lookup }, /* lookup */
{ &vop_create_desc, adosfs_create }, /* create */
{ &vop_mknod_desc, adosfs_mknod }, /* mknod */
{ &vop_open_desc, adosfs_open }, /* open */
{ &vop_close_desc, adosfs_close }, /* close */
{ &vop_access_desc, adosfs_access }, /* access */
{ &vop_getattr_desc, adosfs_getattr }, /* getattr */
{ &vop_setattr_desc, adosfs_setattr }, /* setattr */
{ &vop_read_desc, adosfs_read }, /* read */
{ &vop_write_desc, adosfs_write }, /* write */
{ &vop_lease_desc, adosfs_lease_check }, /* lease */
{ &vop_fcntl_desc, adosfs_fcntl }, /* fcntl */
{ &vop_ioctl_desc, adosfs_ioctl }, /* ioctl */
1996-09-07 16:40:22 +04:00
{ &vop_poll_desc, adosfs_poll }, /* poll */
{ &vop_kqfilter_desc, genfs_kqfilter }, /* kqfilter */
1999-08-19 07:42:23 +04:00
{ &vop_revoke_desc, adosfs_revoke }, /* revoke */
{ &vop_mmap_desc, adosfs_mmap }, /* mmap */
{ &vop_fsync_desc, adosfs_fsync }, /* fsync */
{ &vop_seek_desc, adosfs_seek }, /* seek */
{ &vop_remove_desc, adosfs_remove }, /* remove */
{ &vop_link_desc, adosfs_link }, /* link */
{ &vop_rename_desc, adosfs_rename }, /* rename */
{ &vop_mkdir_desc, adosfs_mkdir }, /* mkdir */
{ &vop_rmdir_desc, adosfs_rmdir }, /* rmdir */
{ &vop_symlink_desc, adosfs_symlink }, /* symlink */
{ &vop_readdir_desc, adosfs_readdir }, /* readdir */
{ &vop_readlink_desc, adosfs_readlink }, /* readlink */
{ &vop_abortop_desc, adosfs_abortop }, /* abortop */
{ &vop_inactive_desc, adosfs_inactive }, /* inactive */
{ &vop_reclaim_desc, adosfs_reclaim }, /* reclaim */
{ &vop_lock_desc, genfs_lock }, /* lock */
{ &vop_unlock_desc, genfs_unlock }, /* unlock */
{ &vop_bmap_desc, adosfs_bmap }, /* bmap */
{ &vop_strategy_desc, adosfs_strategy }, /* strategy */
{ &vop_print_desc, adosfs_print }, /* print */
{ &vop_islocked_desc, genfs_islocked }, /* islocked */
{ &vop_pathconf_desc, adosfs_pathconf }, /* pathconf */
{ &vop_advlock_desc, adosfs_advlock }, /* advlock */
{ &vop_blkatoff_desc, adosfs_blkatoff }, /* blkatoff */
{ &vop_valloc_desc, adosfs_valloc }, /* valloc */
{ &vop_vfree_desc, adosfs_vfree }, /* vfree */
{ &vop_truncate_desc, adosfs_truncate }, /* truncate */
{ &vop_update_desc, adosfs_update }, /* update */
{ &vop_bwrite_desc, adosfs_bwrite }, /* bwrite */
{ &vop_getpages_desc, genfs_getpages }, /* getpages */
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
{ &vop_putpages_desc, genfs_putpages }, /* putpages */
{ NULL, NULL }
1996-02-09 22:06:38 +03:00
};
const struct vnodeopv_desc adosfs_vnodeop_opv_desc =
1996-02-09 22:06:38 +03:00
{ &adosfs_vnodeop_p, adosfs_vnodeop_entries };
int
1996-02-09 22:06:38 +03:00
adosfs_getattr(v)
void *v;
{
1994-06-18 00:06:05 +04:00
struct vop_getattr_args /* {
struct vnode *a_vp;
struct vattr *a_vap;
struct ucred *a_cred;
struct proc *a_p;
1996-02-09 22:06:38 +03:00
} */ *sp = v;
struct vattr *vap;
1995-01-18 12:17:32 +03:00
struct adosfsmount *amp;
struct anode *ap;
u_long fblks;
#ifdef ADOSFS_DIAGNOSTIC
1994-06-18 00:06:05 +04:00
advopprint(sp);
#endif
1994-06-18 00:06:05 +04:00
vap = sp->a_vap;
ap = VTOA(sp->a_vp);
amp = ap->amp;
vattr_null(vap);
vap->va_uid = ap->uid;
vap->va_gid = ap->gid;
1994-06-18 00:06:05 +04:00
vap->va_fsid = sp->a_vp->v_mount->mnt_stat.f_fsid.val[0];
vap->va_atime.tv_sec = vap->va_mtime.tv_sec = vap->va_ctime.tv_sec =
ap->mtime.days * 24 * 60 * 60 + ap->mtime.mins * 60 +
ap->mtime.ticks / 50 + (8 * 365 + 2) * 24 * 60 * 60;
vap->va_atime.tv_nsec = vap->va_mtime.tv_nsec = vap->va_ctime.tv_nsec = 0;
vap->va_gen = 0;
vap->va_flags = 0;
vap->va_rdev = NODEV;
vap->va_fileid = ap->block;
1994-06-18 00:06:05 +04:00
vap->va_type = sp->a_vp->v_type;
vap->va_mode = adunixprot(ap->adprot) & amp->mask;
1994-06-18 00:06:05 +04:00
if (sp->a_vp->v_type == VDIR) {
vap->va_nlink = 1; /* XXX bogus, oh well */
vap->va_bytes = amp->bsize;
vap->va_size = amp->bsize;
} else {
/*
* XXX actually we can track this if we were to walk the list
* of links if it exists.
* XXX for now, just set nlink to 2 if this is a hard link
* to a file, or a file with a hard link.
*/
vap->va_nlink = 1 + (ap->linkto != 0);
/*
* round up to nearest blocks add number of file list
* blocks needed and mutiply by number of bytes per block.
*/
fblks = howmany(ap->fsize, amp->dbsize);
fblks += howmany(fblks, ANODENDATBLKENT(ap));
vap->va_bytes = fblks * amp->dbsize;
vap->va_size = ap->fsize;
vap->va_blocksize = amp->dbsize;
}
#ifdef ADOSFS_DIAGNOSTIC
1996-10-13 06:52:06 +04:00
printf(" 0)");
#endif
return(0);
}
/*
* are things locked??? they need to be to avoid this being
* deleted or changed (data block pointer blocks moving about.)
*/
int
1996-02-09 22:06:38 +03:00
adosfs_read(v)
void *v;
{
1994-06-18 00:06:05 +04:00
struct vop_read_args /* {
struct vnode *a_vp;
struct uio *a_uio;
int a_ioflag;
struct ucred *a_cred;
1996-02-09 22:06:38 +03:00
} */ *sp = v;
struct vnode *vp = sp->a_vp;
1995-01-18 12:17:32 +03:00
struct adosfsmount *amp;
1994-06-18 00:06:05 +04:00
struct anode *ap;
struct uio *uio;
struct buf *bp;
1996-02-09 22:06:38 +03:00
daddr_t lbn;
int size, diff, error;
long n, on;
#ifdef ADOSFS_DIAGNOSTIC
1994-06-18 00:06:05 +04:00
advopprint(sp);
#endif
error = 0;
1994-06-18 00:06:05 +04:00
uio = sp->a_uio;
ap = VTOA(sp->a_vp);
amp = ap->amp;
/*
* Return EOF for character devices, EIO for others
*/
1994-06-18 00:06:05 +04:00
if (sp->a_vp->v_type != VREG) {
error = EIO;
goto reterr;
}
if (uio->uio_resid == 0)
goto reterr;
if (uio->uio_offset < 0) {
error = EINVAL;
goto reterr;
}
/*
* to expensive to let general algorithm figure out that
* we are beyond the file. Do it now.
*/
if (uio->uio_offset >= ap->fsize)
goto reterr;
/*
* taken from ufs_read()
*/
if (vp->v_type == VREG && IS_FFS(amp)) {
error = 0;
while (uio->uio_resid > 0) {
void *win;
vsize_t bytelen = MIN(ap->fsize - uio->uio_offset,
uio->uio_resid);
if (bytelen == 0) {
break;
}
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
win = ubc_alloc(&vp->v_uobj, uio->uio_offset,
&bytelen, UBC_READ);
error = uiomove(win, bytelen, uio);
ubc_release(win, 0);
if (error) {
break;
}
}
goto out;
}
do {
size = amp->dbsize;
lbn = uio->uio_offset / size;
on = uio->uio_offset % size;
n = MIN(size - on, uio->uio_resid);
diff = ap->fsize - uio->uio_offset;
/*
* check for EOF
*/
if (diff <= 0)
return(0);
if (diff < n)
n = diff;
/*
* read ahead could possibly be worth something
* but not much as ados makes little attempt to
* make things contigous
*/
error = bread(sp->a_vp, lbn, amp->bsize, NOCRED, &bp);
if (error) {
brelse(bp);
goto reterr;
}
if (!IS_FFS(amp)) {
if (bp->b_resid > 0)
error = EIO; /* OFS needs the complete block */
else if (adoswordn(bp, 0) != BPT_DATA) {
#ifdef DIAGNOSTIC
1996-10-13 06:52:06 +04:00
printf("adosfs: bad primary type blk %ld\n",
bp->b_blkno / (amp->bsize / DEV_BSIZE));
#endif
error = EINVAL;
} else if (adoscksum(bp, ap->nwords)) {
#ifdef DIAGNOSTIC
1996-10-13 06:52:06 +04:00
printf("adosfs: blk %ld failed cksum.\n",
bp->b_blkno / (amp->bsize / DEV_BSIZE));
#endif
error = EINVAL;
}
}
if (error) {
brelse(bp);
goto reterr;
}
#ifdef ADOSFS_DIAGNOSTIC
1996-10-13 06:52:06 +04:00
printf(" %d+%d-%d+%d", lbn, on, lbn, n);
#endif
n = MIN(n, size - bp->b_resid);
error = uiomove(bp->b_data + on +
amp->bsize - amp->dbsize, (int)n, uio);
brelse(bp);
} while (error == 0 && uio->uio_resid > 0 && n != 0);
out:
reterr:
#ifdef ADOSFS_DIAGNOSTIC
1996-10-13 06:52:06 +04:00
printf(" %d)", error);
#endif
return(error);
}
int
1996-02-09 22:06:38 +03:00
adosfs_write(v)
void *v;
{
#ifdef ADOSFS_DIAGNOSTIC
1994-06-18 00:06:05 +04:00
struct vop_write_args /* {
struct vnode *a_vp;
struct uio *a_uio;
int a_ioflag;
struct ucred *a_cred;
1996-02-09 22:06:38 +03:00
} */ *sp = v;
1994-06-18 00:06:05 +04:00
advopprint(sp);
1996-10-13 06:52:06 +04:00
printf(" EOPNOTSUPP)");
#endif
return(EOPNOTSUPP);
}
/*
* Just call the device strategy routine
*/
int
1996-02-09 22:06:38 +03:00
adosfs_strategy(v)
void *v;
{
1994-06-18 00:06:05 +04:00
struct vop_strategy_args /* {
struct buf *a_bp;
1996-02-09 22:06:38 +03:00
} */ *sp = v;
1994-06-18 00:06:05 +04:00
struct buf *bp;
struct anode *ap;
struct vnode *vp;
int error;
#ifdef ADOSFS_DIAGNOSTIC
1994-06-18 00:06:05 +04:00
advopprint(sp);
#endif
error = 0;
1994-06-18 00:06:05 +04:00
bp = sp->a_bp;
if (bp->b_vp == NULL) {
bp->b_flags |= B_ERROR;
biodone(bp);
error = EIO;
goto reterr;
}
vp = bp->b_vp;
ap = VTOA(vp);
1994-06-18 00:06:05 +04:00
if (bp->b_blkno == bp->b_lblkno) {
1996-02-09 22:06:38 +03:00
error = VOP_BMAP(vp, bp->b_lblkno, NULL, &bp->b_blkno, NULL);
if (error) {
bp->b_flags |= B_ERROR;
biodone(bp);
goto reterr;
}
1994-06-18 00:06:05 +04:00
}
if ((long)bp->b_blkno == -1) {
biodone(bp);
error = 0;
goto reterr;
}
vp = ap->amp->devvp;
bp->b_dev = vp->v_rdev;
1994-06-18 00:06:05 +04:00
VOCALL(vp->v_op, VOFFSET(vop_strategy), sp);
reterr:
#ifdef ADOSFS_DIAGNOSTIC
1996-10-13 06:52:06 +04:00
printf(" %d)", error);
#endif
return(error);
}
int
1996-02-09 22:06:38 +03:00
adosfs_link(v)
void *v;
{
struct vop_link_args /* {
struct vnode *a_dvp;
struct vnode *a_vp;
struct componentname *a_cnp;
1996-02-09 22:06:38 +03:00
} */ *ap = v;
VOP_ABORTOP(ap->a_dvp, ap->a_cnp);
vput(ap->a_dvp);
return (EROFS);
}
int
1996-02-09 22:06:38 +03:00
adosfs_symlink(v)
void *v;
{
struct vop_symlink_args /* {
struct vnode *a_dvp;
struct vnode **a_vpp;
struct componentname *a_cnp;
struct vattr *a_vap;
char *a_target;
1996-02-09 22:06:38 +03:00
} */ *ap = v;
VOP_ABORTOP(ap->a_dvp, ap->a_cnp);
vput(ap->a_dvp);
return (EROFS);
}
/*
* Wait until the vnode has finished changing state.
*/
int
1996-02-09 22:06:38 +03:00
adosfs_bmap(v)
void *v;
{
1994-06-18 00:06:05 +04:00
struct vop_bmap_args /* {
struct vnode *a_vp;
daddr_t a_bn;
struct vnode **a_vpp;
daddr_t *a_bnp;
int *a_runp;
1996-02-09 22:06:38 +03:00
} */ *sp = v;
struct anode *ap;
struct buf *flbp;
long nb, flblk, flblkoff, fcnt;
1994-06-18 00:06:05 +04:00
daddr_t *bnp;
daddr_t bn;
int error;
#ifdef ADOSFS_DIAGNOSTIC
1994-06-18 00:06:05 +04:00
advopprint(sp);
#endif
ap = VTOA(sp->a_vp);
bn = sp->a_bn;
1994-06-18 00:06:05 +04:00
bnp = sp->a_bnp;
if (sp->a_runp) {
*sp->a_runp = 0;
}
error = 0;
1994-06-18 00:06:05 +04:00
if (sp->a_vpp != NULL)
*sp->a_vpp = ap->amp->devvp;
if (bnp == NULL)
goto reterr;
if (bn < 0) {
error = EFBIG;
goto reterr;
}
1994-06-18 00:06:05 +04:00
if (sp->a_vp->v_type != VREG) {
error = EINVAL;
goto reterr;
}
/*
* walk the chain of file list blocks until we find
* the one that will yield the block pointer we need.
*/
if (ap->type == AFILE)
nb = ap->block; /* pointer to ourself */
else if (ap->type == ALFILE)
nb = ap->linkto; /* pointer to real file */
else {
error = EINVAL;
goto reterr;
}
flblk = bn / ANODENDATBLKENT(ap);
flbp = NULL;
/*
* check last indirect block cache
*/
if (flblk < ap->lastlindblk)
fcnt = 0;
else {
flblk -= ap->lastlindblk;
fcnt = ap->lastlindblk;
nb = ap->lastindblk;
}
while (flblk >= 0) {
if (flbp)
brelse(flbp);
if (nb == 0) {
#ifdef DIAGNOSTIC
1996-10-13 06:52:06 +04:00
printf("adosfs: bad file list chain.\n");
#endif
error = EINVAL;
goto reterr;
}
error = bread(ap->amp->devvp, nb * ap->amp->bsize / DEV_BSIZE,
ap->amp->bsize, NOCRED, &flbp);
if (error) {
brelse(flbp);
goto reterr;
}
if (adoscksum(flbp, ap->nwords)) {
#ifdef DIAGNOSTIC
1996-10-13 06:52:06 +04:00
printf("adosfs: blk %ld failed cksum.\n", nb);
#endif
brelse(flbp);
error = EINVAL;
goto reterr;
}
/*
* update last indirect block cache
*/
ap->lastlindblk = fcnt++;
ap->lastindblk = nb;
nb = adoswordn(flbp, ap->nwords - 2);
flblk--;
}
/*
* calculate offset of block number in table. The table starts
* at nwords - 51 and goes to offset 6 or less if indicated by the
* valid table entries stored at offset ADBI_NBLKTABENT.
*/
flblkoff = bn % ANODENDATBLKENT(ap);
if (flblkoff < adoswordn(flbp, 2 /* ADBI_NBLKTABENT */)) {
flblkoff = (ap->nwords - 51) - flblkoff;
*bnp = adoswordn(flbp, flblkoff) * ap->amp->bsize / DEV_BSIZE;
} else {
#ifdef DIAGNOSTIC
1996-10-13 06:52:06 +04:00
printf("flblk offset %ld too large in lblk %ld blk %d\n",
flblkoff, (long)bn, flbp->b_blkno);
#endif
error = EINVAL;
}
brelse(flbp);
reterr:
#ifdef ADOSFS_DIAGNOSTIC
if (error == 0 && bnp)
printf(" %lld => %lld", (long long)bn, (long long)*bnp);
printf(" %d)\n", error);
#endif
return(error);
}
/*
* Print out the contents of a adosfs vnode.
*/
/* ARGSUSED */
int
1996-02-09 22:06:38 +03:00
adosfs_print(v)
void *v;
{
#if 0
1994-06-18 00:06:05 +04:00
struct vop_print_args /* {
struct vnode *a_vp;
1996-02-09 22:06:38 +03:00
} */ *sp = v;
#endif
return(0);
}
struct adirent {
u_long fileno;
u_short reclen;
1994-06-18 00:06:05 +04:00
char type;
char namlen;
char name[32]; /* maxlen of 30 plus 2 NUL's */
};
int
1996-02-09 22:06:38 +03:00
adosfs_readdir(v)
void *v;
{
1994-06-18 00:06:05 +04:00
struct vop_readdir_args /* {
struct vnode *a_vp;
struct uio *a_uio;
struct ucred *a_cred;
int *a_eofflag;
1998-03-01 05:20:01 +03:00
off_t **a_cookies;
int *a_ncookies;
1996-02-09 22:06:38 +03:00
} */ *sp = v;
int error, useri, chainc, hashi, scanned, uavail;
struct adirent ad, *adp;
struct anode *pap, *ap;
1995-01-18 12:17:32 +03:00
struct adosfsmount *amp;
1994-06-18 00:06:05 +04:00
struct vnode *vp;
struct uio *uio;
1996-02-09 22:06:38 +03:00
u_long nextbn;
1998-03-01 05:20:01 +03:00
off_t uoff, *cookies = NULL;
int ncookies = 0;
#ifdef ADOSFS_DIAGNOSTIC
1994-06-18 00:06:05 +04:00
advopprint(sp);
#endif
1994-06-18 00:06:05 +04:00
if (sp->a_vp->v_type != VDIR) {
error = ENOTDIR;
goto reterr;
}
1998-03-01 05:20:01 +03:00
1994-06-18 00:06:05 +04:00
uio = sp->a_uio;
uoff = uio->uio_offset;
if (uoff < 0) {
error = EINVAL;
goto reterr;
}
1994-06-18 00:06:05 +04:00
pap = VTOA(sp->a_vp);
amp = pap->amp;
adp = &ad;
error = nextbn = hashi = chainc = scanned = 0;
uavail = uio->uio_resid / sizeof(ad);
useri = uoff / sizeof(ad);
/*
* if no slots available or offset requested is not on a slot boundry
*/
if (uavail < 1 || uoff % sizeof(ad)) {
error = EINVAL;
goto reterr;
}
1998-03-01 05:20:01 +03:00
if (sp->a_ncookies) {
ncookies = 0;
cookies = malloc(sizeof (off_t) * uavail, M_TEMP, M_WAITOK);
1998-03-01 05:20:01 +03:00
*sp->a_cookies = cookies;
}
while (uavail) {
if (hashi == pap->ntabent) {
1994-06-18 00:06:05 +04:00
*sp->a_eofflag = 1;
break;
}
if (pap->tab[hashi] == 0) {
hashi++;
continue;
}
if (nextbn == 0)
nextbn = pap->tab[hashi];
/*
* first determine if we can skip this chain
*/
if (chainc == 0) {
int skip;
skip = useri - scanned;
if (pap->tabi[hashi] > 0 && pap->tabi[hashi] <= skip) {
scanned += pap->tabi[hashi];
hashi++;
nextbn = 0;
continue;
}
}
/*
* now [continue to] walk the chain
*/
ap = NULL;
do {
1996-02-09 22:06:38 +03:00
error = VFS_VGET(amp->mp, (ino_t)nextbn, &vp);
if (error)
goto reterr;
1994-06-18 00:06:05 +04:00
ap = VTOA(vp);
scanned++;
chainc++;
nextbn = ap->hashf;
/*
* check for end of chain.
*/
if (nextbn == 0) {
pap->tabi[hashi] = chainc;
hashi++;
chainc = 0;
} else if (pap->tabi[hashi] <= 0 &&
-chainc < pap->tabi[hashi])
pap->tabi[hashi] = -chainc;
if (useri >= scanned) {
1994-06-18 00:06:05 +04:00
vput(vp);
ap = NULL;
}
} while (ap == NULL && nextbn != 0);
/*
* we left the loop but without a result so do main over.
*/
if (ap == NULL)
continue;
/*
* Fill in dirent record
*/
memset(adp, 0, sizeof(struct adirent));
adp->fileno = ap->block;
1994-06-18 00:06:05 +04:00
/*
* this deserves an function in kern/vfs_subr.c
*/
switch (ATOV(ap)->v_type) {
case VREG:
adp->type = DT_REG;
break;
case VDIR:
adp->type = DT_DIR;
break;
case VLNK:
adp->type = DT_LNK;
break;
default:
adp->type = DT_UNKNOWN;
break;
}
adp->reclen = sizeof(struct adirent);
adp->namlen = strlen(ap->name);
memcpy(adp->name, ap->name, adp->namlen);
1994-06-18 00:06:05 +04:00
vput(vp);
1996-02-09 22:06:38 +03:00
error = uiomove((caddr_t) adp, sizeof(struct adirent), uio);
if (error)
break;
1998-03-01 05:20:01 +03:00
if (sp->a_ncookies) {
*cookies++ = uoff;
ncookies++;
}
uoff += sizeof(struct adirent);
useri++;
uavail--;
}
#if doesnt_uiomove_handle_this
uio->uio_offset = uoff;
#endif
reterr:
#ifdef ADOSFS_DIAGNOSTIC
1996-10-13 06:52:06 +04:00
printf(" %d)", error);
#endif
1998-03-01 05:20:01 +03:00
if (sp->a_ncookies) {
if (error) {
free(*sp->a_cookies, M_TEMP);
1998-03-01 05:20:01 +03:00
*sp->a_ncookies = 0;
*sp->a_cookies = NULL;
} else
*sp->a_ncookies = ncookies;
}
return(error);
}
int
1996-02-09 22:06:38 +03:00
adosfs_access(v)
void *v;
{
1994-06-18 00:06:05 +04:00
struct vop_access_args /* {
struct vnode *a_vp;
int a_mode;
struct ucred *a_cred;
struct proc *a_p;
1996-02-09 22:06:38 +03:00
} */ *sp = v;
struct anode *ap;
1998-03-01 05:20:01 +03:00
struct vnode *vp = sp->a_vp;
1994-12-30 01:06:15 +03:00
int error;
#ifdef ADOSFS_DIAGNOSTIC
1994-06-18 00:06:05 +04:00
advopprint(sp);
#endif
1998-03-01 05:20:01 +03:00
ap = VTOA(vp);
#ifdef DIAGNOSTIC
1998-03-01 05:20:01 +03:00
if (!VOP_ISLOCKED(vp)) {
1994-06-18 00:06:05 +04:00
vprint("adosfs_access: not locked", sp->a_vp);
panic("adosfs_access: not locked");
}
#endif
1998-03-01 05:20:01 +03:00
/*
* Disallow write attempts unless the file is a socket,
* fifo, or a block or character device resident on the
* file system.
*/
if (sp->a_mode & VWRITE) {
switch (vp->v_type) {
case VDIR:
case VLNK:
case VREG:
return (EROFS);
default:
break;
}
}
#ifdef QUOTA
#endif
1997-05-14 23:00:17 +04:00
error = vaccess(sp->a_vp->v_type, adunixprot(ap->adprot) & ap->amp->mask,
ap->uid, ap->gid, sp->a_mode, sp->a_cred);
#ifdef ADOSFS_DIAGNOSTIC
1996-10-13 06:52:06 +04:00
printf(" %d)", error);
#endif
return(error);
}
int
1996-02-09 22:06:38 +03:00
adosfs_readlink(v)
void *v;
{
1994-06-18 00:06:05 +04:00
struct vop_readlink_args /* {
struct vnode *a_vp;
struct uio *a_uio;
struct ucred *a_cred;
1996-02-09 22:06:38 +03:00
} */ *sp = v;
1994-06-18 00:06:05 +04:00
struct anode *ap;
int error;
#ifdef ADOSFS_DIAGNOSTIC
1994-06-18 00:06:05 +04:00
advopprint(sp);
#endif
1994-06-18 00:06:05 +04:00
ap = VTOA(sp->a_vp);
error = uiomove(ap->slinkto, strlen(ap->slinkto), sp->a_uio);
#ifdef ADOSFS_DIAGNOSTIC
1996-10-13 06:52:06 +04:00
printf(" %d)", error);
#endif
return (error);
}
/*ARGSUSED*/
int
1996-02-09 22:06:38 +03:00
adosfs_inactive(v)
void *v;
{
1994-06-18 00:06:05 +04:00
struct vop_inactive_args /* {
struct vnode *a_vp;
1998-03-01 05:20:01 +03:00
struct proc *a_p;
1996-02-09 22:06:38 +03:00
} */ *sp = v;
1998-03-01 05:20:01 +03:00
struct vnode *vp = sp->a_vp;
struct proc *p = sp->a_p;
#ifdef ADOSFS_DIAGNOSTIC
1994-06-18 00:06:05 +04:00
advopprint(sp);
#endif
1998-03-01 05:20:01 +03:00
VOP_UNLOCK(vp, 0);
/* XXX this needs to check if file was deleted */
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
vrecycle(vp, NULL, p);
#ifdef ADOSFS_DIAGNOSTIC
1996-10-13 06:52:06 +04:00
printf(" 0)");
#endif
return(0);
}
1996-02-09 22:06:38 +03:00
1994-06-18 00:06:05 +04:00
/*
* the kernel wants its vnode back.
* no lock needed we are being called from vclean()
*/
int
1996-02-09 22:06:38 +03:00
adosfs_reclaim(v)
void *v;
{
1994-06-18 00:06:05 +04:00
struct vop_reclaim_args /* {
struct vnode *a_vp;
1996-02-09 22:06:38 +03:00
} */ *sp = v;
struct vnode *vp;
struct anode *ap;
#ifdef ADOSFS_DIAGNOSTIC
1996-10-13 06:52:06 +04:00
printf("(reclaim 0)");
#endif
1994-06-18 00:06:05 +04:00
vp = sp->a_vp;
ap = VTOA(vp);
1994-06-18 00:06:05 +04:00
LIST_REMOVE(ap, link);
cache_purge(vp);
if (vp->v_type == VDIR && ap->tab)
free(ap->tab, M_ANODE);
else if (vp->v_type == VLNK && ap->slinkto)
free(ap->slinkto, M_ANODE);
pool_put(&adosfs_node_pool, ap);
1994-06-18 00:06:05 +04:00
vp->v_data = NULL;
return(0);
}
1994-06-18 00:06:05 +04:00
/*
* POSIX pathconf info, grabbed from kern/u fs, probably need to
* investigate exactly what each return type means as they are probably
* not valid currently
*/
1996-02-09 22:06:38 +03:00
int
adosfs_pathconf(v)
void *v;
{
1994-06-18 00:06:05 +04:00
struct vop_pathconf_args /* {
struct vnode *a_vp;
int a_name;
register_t *a_retval;
1996-02-09 22:06:38 +03:00
} */ *sp = v;
1994-06-18 00:06:05 +04:00
switch (sp->a_name) {
case _PC_LINK_MAX:
*sp->a_retval = LINK_MAX;
return (0);
case _PC_PIPE_BUF:
*sp->a_retval = PIPE_BUF;
return (0);
case _PC_CHOWN_RESTRICTED:
*sp->a_retval = 1;
return (0);
case _PC_VDISABLE:
*sp->a_retval = _POSIX_VDISABLE;
return (0);
1998-08-03 18:19:57 +04:00
case _PC_SYNC_IO:
*sp->a_retval = 1;
return (0);
1999-03-22 22:21:07 +03:00
case _PC_FILESIZEBITS:
*sp->a_retval = 32;
return (0);
1994-06-18 00:06:05 +04:00
default:
return (EINVAL);
}
/* NOTREACHED */
}