2003-06-30 02:28:00 +04:00
|
|
|
/* $NetBSD: ext2fs_extern.h,v 1.18 2003/06/29 22:32:32 fvdl Exp $ */
|
1997-06-11 13:33:37 +04:00
|
|
|
|
|
|
|
|
/*-
|
|
|
|
|
* Copyright (c) 1997 Manuel Bouyer.
|
|
|
|
|
* Copyright (c) 1991, 1993, 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
|
|
|
|
|
* 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.
|
|
|
|
|
*
|
|
|
|
|
* @(#)ffs_extern.h 8.3 (Berkeley) 4/16/94
|
|
|
|
|
* Modified for ext2fs by Manuel Bouyer.
|
|
|
|
|
*/
|
|
|
|
|
|
2002-12-01 03:12:06 +03:00
|
|
|
#ifndef _UFS_EXT2FS_EXT2FS_EXTERN_H_
|
|
|
|
|
#define _UFS_EXT2FS_EXT2FS_EXTERN_H_
|
|
|
|
|
|
1997-06-11 13:33:37 +04:00
|
|
|
struct buf;
|
|
|
|
|
struct fid;
|
|
|
|
|
struct m_ext2fs;
|
|
|
|
|
struct inode;
|
|
|
|
|
struct mount;
|
|
|
|
|
struct nameidata;
|
2003-06-30 02:28:00 +04:00
|
|
|
struct proc;
|
1997-06-11 13:33:37 +04:00
|
|
|
struct statfs;
|
|
|
|
|
struct timeval;
|
|
|
|
|
struct ucred;
|
|
|
|
|
struct ufsmount;
|
|
|
|
|
struct uio;
|
|
|
|
|
struct vnode;
|
|
|
|
|
struct mbuf;
|
|
|
|
|
struct componentname;
|
|
|
|
|
|
1998-09-01 07:20:46 +04:00
|
|
|
extern struct pool ext2fs_inode_pool; /* memory pool for inodes */
|
2003-05-27 01:22:19 +04:00
|
|
|
extern struct pool ext2fs_dinode_pool; /* memory pool for dinodes */
|
1998-09-01 07:20:46 +04:00
|
|
|
|
1997-06-11 13:33:37 +04:00
|
|
|
__BEGIN_DECLS
|
|
|
|
|
|
|
|
|
|
/* ext2fs_alloc.c */
|
2003-01-25 00:55:02 +03:00
|
|
|
int ext2fs_alloc __P((struct inode *, daddr_t, daddr_t , struct ucred *,
|
|
|
|
|
daddr_t *));
|
|
|
|
|
int ext2fs_realloccg __P((struct inode *, daddr_t, daddr_t, int, int ,
|
1997-06-11 13:33:37 +04:00
|
|
|
struct ucred *, struct buf **));
|
|
|
|
|
int ext2fs_reallocblks __P((void *));
|
|
|
|
|
int ext2fs_valloc __P((void *));
|
2003-01-25 00:55:02 +03:00
|
|
|
/* XXX ondisk32 */
|
|
|
|
|
daddr_t ext2fs_blkpref __P((struct inode *, daddr_t, int, int32_t *));
|
|
|
|
|
void ext2fs_blkfree __P((struct inode *, daddr_t));
|
1997-06-11 13:33:37 +04:00
|
|
|
int ext2fs_vfree __P((void *));
|
|
|
|
|
|
|
|
|
|
/* ext2fs_balloc.c */
|
2003-01-25 00:55:02 +03:00
|
|
|
int ext2fs_balloc __P((struct inode *, daddr_t, int, struct ucred *,
|
1997-06-11 13:33:37 +04:00
|
|
|
struct buf **, int));
|
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
|
|
|
int ext2fs_gop_alloc __P((struct vnode *, off_t, off_t, int, struct ucred *));
|
1997-06-11 13:33:37 +04:00
|
|
|
|
|
|
|
|
/* ext2fs_bmap.c */
|
|
|
|
|
int ext2fs_bmap __P((void *));
|
|
|
|
|
|
|
|
|
|
/* ext2fs_inode.c */
|
|
|
|
|
int ext2fs_update __P((void *));
|
|
|
|
|
int ext2fs_truncate __P((void *));
|
|
|
|
|
int ext2fs_inactive __P((void *));
|
|
|
|
|
|
|
|
|
|
/* ext2fs_lookup.c */
|
|
|
|
|
int ext2fs_readdir __P((void *));
|
|
|
|
|
int ext2fs_lookup __P((void *));
|
|
|
|
|
int ext2fs_direnter __P((struct inode *, struct vnode *,
|
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 componentname *));
|
1997-06-11 13:33:37 +04:00
|
|
|
int ext2fs_dirremove __P((struct vnode *, struct componentname *));
|
|
|
|
|
int ext2fs_dirrewrite __P((struct inode *, struct inode *,
|
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 componentname *));
|
1997-06-11 13:33:37 +04:00
|
|
|
int ext2fs_dirempty __P((struct inode *, ino_t, struct ucred *));
|
2003-06-29 22:43:21 +04:00
|
|
|
int ext2fs_checkpath __P((struct inode *, struct inode *, struct ucred *));
|
1997-06-11 13:33:37 +04:00
|
|
|
|
|
|
|
|
/* ext2fs_subr.c */
|
|
|
|
|
int ext2fs_blkatoff __P((void *));
|
|
|
|
|
void ext2fs_fragacct __P((struct m_ext2fs *, int, int32_t[], int));
|
|
|
|
|
#ifdef DIAGNOSTIC
|
|
|
|
|
void ext2fs_checkoverlap __P((struct buf *, struct inode *));
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
/* ext2fs_vfsops.c */
|
2000-03-16 21:08:17 +03:00
|
|
|
void ext2fs_init __P((void));
|
2001-09-15 20:12:54 +04:00
|
|
|
void ext2fs_reinit __P((void));
|
2000-03-16 21:08:17 +03:00
|
|
|
void ext2fs_done __P((void));
|
1997-06-11 13:33:37 +04:00
|
|
|
int ext2fs_mountroot __P((void));
|
|
|
|
|
int ext2fs_mount __P((struct mount *, const char *, void *, struct nameidata *,
|
2003-06-30 02:28:00 +04:00
|
|
|
struct proc *));
|
|
|
|
|
int ext2fs_reload __P((struct mount *, struct ucred *, struct proc *));
|
|
|
|
|
int ext2fs_mountfs __P((struct vnode *, struct mount *, struct proc *));
|
|
|
|
|
int ext2fs_unmount __P((struct mount *, int, struct proc *));
|
|
|
|
|
int ext2fs_flushfiles __P((struct mount *, int, struct proc *));
|
|
|
|
|
int ext2fs_statfs __P((struct mount *, struct statfs *, struct proc *));
|
|
|
|
|
int ext2fs_sync __P((struct mount *, int, struct ucred *, struct proc *));
|
2003-06-29 22:43:21 +04:00
|
|
|
int ext2fs_vget __P((struct mount *, ino_t, struct vnode **));
|
|
|
|
|
int ext2fs_fhtovp __P((struct mount *, struct fid *, struct vnode **));
|
1997-06-11 13:33:37 +04:00
|
|
|
int ext2fs_vptofh __P((struct vnode *, struct fid *));
|
1998-03-01 05:20:01 +03:00
|
|
|
int ext2fs_sysctl __P((int *, u_int, void *, size_t *, void *, size_t,
|
2003-06-30 02:28:00 +04:00
|
|
|
struct proc *));
|
1997-06-11 13:33:37 +04:00
|
|
|
int ext2fs_sbupdate __P((struct ufsmount *, int));
|
|
|
|
|
int ext2fs_cgupdate __P((struct ufsmount *, int));
|
|
|
|
|
|
|
|
|
|
/* ext2fs_readwrite.c */
|
|
|
|
|
int ext2fs_read __P((void *));
|
|
|
|
|
int ext2fs_write __P((void *));
|
|
|
|
|
|
|
|
|
|
/* ext2fs_vnops.c */
|
|
|
|
|
int ext2fs_create __P((void *));
|
|
|
|
|
int ext2fs_mknod __P((void *));
|
|
|
|
|
int ext2fs_open __P((void *));
|
|
|
|
|
int ext2fs_access __P((void *));
|
|
|
|
|
int ext2fs_getattr __P((void *));
|
|
|
|
|
int ext2fs_setattr __P((void *));
|
|
|
|
|
int ext2fs_remove __P((void *));
|
|
|
|
|
int ext2fs_link __P((void *));
|
|
|
|
|
int ext2fs_rename __P((void *));
|
|
|
|
|
int ext2fs_mkdir __P((void *));
|
|
|
|
|
int ext2fs_rmdir __P((void *));
|
|
|
|
|
int ext2fs_symlink __P((void *));
|
|
|
|
|
int ext2fs_readlink __P((void *));
|
|
|
|
|
int ext2fs_advlock __P((void *));
|
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
|
|
|
int ext2fs_vinit __P((struct mount *, int (**specops)(void *),
|
|
|
|
|
int (**fifoops)(void *), struct vnode **));
|
1997-06-11 13:33:37 +04:00
|
|
|
int ext2fs_makeinode __P((int, struct vnode *, struct vnode **,
|
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 componentname *cnp));
|
1997-06-11 13:33:37 +04:00
|
|
|
int ext2fs_reclaim __P((void *));
|
|
|
|
|
|
|
|
|
|
#define ext2fs_fsync genfs_fsync
|
|
|
|
|
__END_DECLS
|
|
|
|
|
|
|
|
|
|
#define IS_EXT2_VNODE(vp) (vp->v_tag == VT_EXT2FS)
|
|
|
|
|
|
|
|
|
|
extern int (**ext2fs_vnodeop_p) __P((void *));
|
|
|
|
|
extern int (**ext2fs_specop_p) __P((void *));
|
|
|
|
|
extern int (**ext2fs_fifoop_p) __P((void *));
|
1998-06-25 00:58:44 +04:00
|
|
|
|
2002-12-01 03:12:06 +03:00
|
|
|
#endif /* !_UFS_EXT2FS_EXT2FS_EXTERN_H_ */
|