2005-08-19 08:47:55 +04:00
|
|
|
/* $NetBSD: filecore_node.h,v 1.3 2005/08/19 04:47:55 christos Exp $ */
|
1998-08-14 07:26:12 +04:00
|
|
|
|
|
|
|
|
/*-
|
|
|
|
|
* Copyright (c) 1994 The Regents of the University of California.
|
|
|
|
|
* 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
|
2003-08-07 20:26:28 +04:00
|
|
|
* documentation and/or other materials provided with the distribution.
|
|
|
|
|
* 3. 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.
|
|
|
|
|
*
|
|
|
|
|
* filecore_node.h 1.1 1998/6/26
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
/*-
|
|
|
|
|
* Copyright (c) 1998 Andrew McMurry
|
|
|
|
|
*
|
|
|
|
|
* 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
|
1998-08-14 07:26:12 +04:00
|
|
|
* 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.
|
|
|
|
|
*
|
|
|
|
|
* filecore_node.h 1.1 1998/6/26
|
|
|
|
|
*/
|
|
|
|
|
|
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
|
|
|
#include <miscfs/genfs/genfs_node.h>
|
|
|
|
|
|
1998-08-14 07:26:12 +04:00
|
|
|
/*
|
|
|
|
|
* In a future format, directories may be more than 2Gb in length,
|
|
|
|
|
* however, in practice this seems unlikely. So, we define
|
|
|
|
|
* the type doff_t as a long to keep down the cost of doing
|
|
|
|
|
* lookup on a 32-bit machine. If you are porting to a 64-bit
|
|
|
|
|
* architecture, you should make doff_t the same as off_t.
|
|
|
|
|
*/
|
|
|
|
|
#define doff_t long
|
|
|
|
|
|
|
|
|
|
struct filecore_node {
|
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
|
|
|
struct genfs_node i_gnode;
|
2001-09-15 20:12:54 +04:00
|
|
|
LIST_ENTRY(filecore_node) i_hash;
|
1998-08-14 07:26:12 +04:00
|
|
|
struct vnode *i_vnode; /* vnode associated with this inode */
|
|
|
|
|
struct vnode *i_devvp; /* vnode for block I/O */
|
|
|
|
|
u_long i_flag; /* see below */
|
|
|
|
|
dev_t i_dev; /* device where inode resides */
|
|
|
|
|
ino_t i_number; /* the identity of the inode */
|
|
|
|
|
daddr_t i_block; /* the disc address of the file */
|
|
|
|
|
ino_t i_parent; /* the ino of the file's parent */
|
|
|
|
|
|
|
|
|
|
struct filecore_mnt *i_mnt; /* filesystem associated with this inode */
|
|
|
|
|
struct lockf *i_lockf; /* head of byte-level lock list */
|
1998-08-14 22:04:04 +04:00
|
|
|
int i_diroff; /* offset in dir, where we found last entry */
|
1998-08-14 07:26:12 +04:00
|
|
|
|
1998-08-14 22:04:04 +04:00
|
|
|
struct filecore_direntry i_dirent; /* directory entry */
|
1998-08-14 07:26:12 +04:00
|
|
|
};
|
|
|
|
|
|
|
|
|
|
#define i_forw i_chain[0]
|
|
|
|
|
#define i_back i_chain[1]
|
|
|
|
|
#define i_size i_dirent.len
|
|
|
|
|
|
|
|
|
|
/* flags */
|
|
|
|
|
#define IN_ACCESS 0x0020 /* inode access time to be updated */
|
|
|
|
|
|
|
|
|
|
#define VTOI(vp) ((struct filecore_node *)(vp)->v_data)
|
|
|
|
|
#define ITOV(ip) ((ip)->i_vnode)
|
|
|
|
|
|
|
|
|
|
#define filecore_staleinode(ip) ((ip)->i_dirent.name[0]==0)
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Prototypes for Filecore vnode operations
|
|
|
|
|
*/
|
2001-05-28 06:50:51 +04:00
|
|
|
int filecore_lookup __P((void *));
|
|
|
|
|
#define filecore_open genfs_nullop
|
|
|
|
|
#define filecore_close genfs_nullop
|
|
|
|
|
int filecore_access __P((void *));
|
1998-08-14 07:26:12 +04:00
|
|
|
int filecore_getattr __P((void *));
|
2001-05-28 06:50:51 +04:00
|
|
|
int filecore_read __P((void *));
|
|
|
|
|
#define filecore_poll genfs_poll
|
|
|
|
|
#define filecore_mmap genfs_mmap
|
|
|
|
|
#define filecore_seek genfs_seek
|
1998-08-14 07:26:12 +04:00
|
|
|
int filecore_readdir __P((void *));
|
|
|
|
|
int filecore_readlink __P((void *));
|
|
|
|
|
#define filecore_abortop genfs_abortop
|
|
|
|
|
int filecore_inactive __P((void *));
|
|
|
|
|
int filecore_reclaim __P((void *));
|
2001-05-28 06:50:51 +04:00
|
|
|
int filecore_link __P((void *));
|
1998-08-14 07:26:12 +04:00
|
|
|
int filecore_symlink __P((void *));
|
2001-05-28 06:50:51 +04:00
|
|
|
int filecore_bmap __P((void *));
|
1998-08-14 07:26:12 +04:00
|
|
|
int filecore_strategy __P((void *));
|
2001-05-28 06:50:51 +04:00
|
|
|
int filecore_print __P((void *));
|
1998-08-14 07:26:12 +04:00
|
|
|
int filecore_pathconf __P((void *));
|
|
|
|
|
int filecore_blkatoff __P((void *));
|
|
|
|
|
|
|
|
|
|
struct vnode *filecore_ihashget __P((dev_t, ino_t));
|
|
|
|
|
void filecore_ihashins __P((struct filecore_node *));
|
|
|
|
|
void filecore_ihashrem __P((struct filecore_node *));
|
|
|
|
|
|
|
|
|
|
mode_t filecore_mode __P((struct filecore_node *));
|
|
|
|
|
struct timespec filecore_time __P((struct filecore_node *));
|
|
|
|
|
ino_t filecore_getparent __P((struct filecore_node *));
|
2005-08-19 08:47:55 +04:00
|
|
|
int filecore_fn2unix __P((char *, char *, u_int16_t *));
|
1998-08-14 07:26:12 +04:00
|
|
|
int filecore_fncmp __P((const char *, const char *, u_short));
|
|
|
|
|
int filecore_dbread __P((struct filecore_node *, struct buf **));
|