Move the declaration of "struct namecache" to vnode.h, as it can be useful

elsewhere.  Note, of course, that in an ideal world nothing should need
to see our VFS implementation :-/

2 files changed, 18 insertions, 17 deletions

diff --git a/sys/kern/vfs_cache.c b/sys/kern/vfs_cache.c
index 33462b1..f9d3e13 100644
--- a/sys/kern/vfs_cache.c
+++ b/sys/kern/vfs_cache.c
@@ -50,22 +50,6 @@
 #include <sys/filedesc.h>
 
 /*
- * This structure describes the elements in the cache of recent
- * names looked up by namei.
- */
-
-struct	namecache {
-	LIST_ENTRY(namecache) nc_hash;	/* hash chain */
-	LIST_ENTRY(namecache) nc_src;	/* source vnode list */
-	TAILQ_ENTRY(namecache) nc_dst;	/* destination vnode list */
-	struct	vnode *nc_dvp;		/* vnode of parent of name */
-	struct	vnode *nc_vp;		/* vnode the name refers to */
-	u_char	nc_flag;		/* flag bits */
-	u_char	nc_nlen;		/* length of name */
-	char	nc_name[0];		/* segment name */
-};
-
-/*
  * Name caching works as follows:
  *
  * Names found by directory scans are retained in a cache
diff --git a/sys/sys/vnode.h b/sys/sys/vnode.h
index 4053270..38cddb9 100644
--- a/sys/sys/vnode.h
+++ b/sys/sys/vnode.h
@@ -74,7 +74,24 @@ enum vtagtype	{
 TAILQ_HEAD(buflists, buf);
 
 typedef	int 	vop_t __P((void *));
-struct namecache;
+
+/*
+ * This structure describes the elements in the cache of recent
+ * names looked up by namei.
+ */
+
+struct vnode;
+
+struct	namecache {
+	LIST_ENTRY(namecache) nc_hash;	/* hash chain */
+	LIST_ENTRY(namecache) nc_src;	/* source vnode list */
+	TAILQ_ENTRY(namecache) nc_dst;	/* destination vnode list */
+	struct	vnode *nc_dvp;		/* vnode of parent of name */
+	struct	vnode *nc_vp;		/* vnode the name refers to */
+	u_char	nc_flag;		/* flag bits */
+	u_char	nc_nlen;		/* length of name */
+	char	nc_name[0];		/* segment name */
+};
 
 /*
  * Reading or writing any of these items requires holding the appropriate lock.