First version of HPFS stuff.

1 files changed, 173 insertions, 0 deletions

diff --git a/sys/fs/hpfs/hpfs_hash.c b/sys/fs/hpfs/hpfs_hash.c
new file mode 100644
index 0000000..a948ade
--- /dev/null
+++ b/sys/fs/hpfs/hpfs_hash.c
@@ -0,0 +1,173 @@
+/*
+ * Copyright (c) 1982, 1986, 1989, 1991, 1993, 1995
+ *	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.
+ *
+ *	@(#)ufs_ihash.c	8.7 (Berkeley) 5/17/95
+ * $FreeBSD$
+ */
+
+#include <sys/param.h>
+#include <sys/systm.h>
+#include <sys/kernel.h>
+#include <sys/lock.h>
+#include <sys/vnode.h>
+#include <sys/mount.h>
+#include <sys/malloc.h>
+#include <sys/proc.h>
+
+#include <fs/hpfs/hpfs.h>
+
+MALLOC_DEFINE(M_HPFSHASH, "HPFS hash", "HPFS node hash tables");
+
+/*
+ * Structures associated with hpfsnode cacheing.
+ */
+static LIST_HEAD(hphashhead, hpfsnode) *hpfs_hphashtbl;
+static u_long	hpfs_hphash;		/* size of hash table - 1 */
+#define	HPNOHASH(dev, lsn)	(&hpfs_hphashtbl[(minor(dev) + (lsn)) & hpfs_hphash])
+#ifndef NULL_SIMPLELOCKS
+static struct simplelock hpfs_hphash_slock;
+#endif
+struct lock hpfs_hphash_lock;
+
+/*
+ * Initialize inode hash table.
+ */
+void
+hpfs_hphashinit()
+{
+
+	lockinit (&hpfs_hphash_lock, PINOD, "hpfs_hphashlock", 0, 0);
+	hpfs_hphashtbl = HASHINIT(desiredvnodes, M_HPFSHASH, M_WAITOK,
+	    &hpfs_hphash);
+	simple_lock_init(&hpfs_hphash_slock);
+}
+
+/*
+ * Use the device/inum pair to find the incore inode, and return a pointer
+ * to it. If it is in core, return it, even if it is locked.
+ */
+struct hpfsnode *
+hpfs_hphashlookup(dev, ino)
+	dev_t dev;
+	lsn_t ino;
+{
+	struct hpfsnode *hp;
+
+	simple_lock(&hpfs_hphash_slock);
+	for (hp = HPNOHASH(dev, ino)->lh_first; hp; hp = hp->h_hash.le_next)
+		if (ino == hp->h_no && dev == hp->h_dev)
+			break;
+	simple_unlock(&hpfs_hphash_slock);
+
+	return (hp);
+}
+
+#if 0
+struct hpfsnode *
+hpfs_hphashget(dev, ino)
+	dev_t dev;
+	lsn_t ino;
+{
+	struct hpfsnode *hp;
+
+loop:
+	simple_lock(&hpfs_hphash_slock);
+	for (hp = HPNOHASH(dev, ino)->lh_first; hp; hp = hp->h_hash.le_next) {
+		if (ino == hp->h_no && dev == hp->h_dev) {
+			LOCKMGR(&hp->h_intlock, LK_EXCLUSIVE | LK_INTERLOCK, &hpfs_hphash_slock, NULL);
+			return (hp);
+		}
+	}
+	simple_unlock(&hpfs_hphash_slock);
+	return (hp);
+}
+#endif
+
+struct vnode *
+hpfs_hphashvget(dev, ino, p)
+	dev_t dev;
+	lsn_t ino;
+	struct proc *p;
+{
+	struct hpfsnode *hp;
+	struct vnode *vp;
+
+loop:
+	simple_lock(&hpfs_hphash_slock);
+	for (hp = HPNOHASH(dev, ino)->lh_first; hp; hp = hp->h_hash.le_next) {
+		if (ino == hp->h_no && dev == hp->h_dev) {
+			vp = HPTOV(hp);
+			simple_lock (&vp->v_interlock);
+			simple_unlock (&hpfs_hphash_slock);
+			if (vget(vp, LK_EXCLUSIVE | LK_INTERLOCK, p))
+				goto loop;
+			return (vp);
+		}
+	}
+	simple_unlock(&hpfs_hphash_slock);
+	return (NULLVP);
+}
+
+/*
+ * Insert the hpfsnode into the hash table.
+ */
+void
+hpfs_hphashins(hp)
+	struct hpfsnode *hp;
+{
+	struct hphashhead *hpp;
+
+	simple_lock(&hpfs_hphash_slock);
+	hpp = HPNOHASH(hp->h_dev, hp->h_no);
+	hp->h_flag |= H_HASHED;
+	LIST_INSERT_HEAD(hpp, hp, h_hash);
+	simple_unlock(&hpfs_hphash_slock);
+}
+
+/*
+ * Remove the inode from the hash table.
+ */
+void
+hpfs_hphashrem(hp)
+	struct hpfsnode *hp;
+{
+	simple_lock(&hpfs_hphash_slock);
+	if (hp->h_flag & H_HASHED) {
+		hp->h_flag &= ~H_HASHED;
+		LIST_REMOVE(hp, h_hash);
+#ifdef DIAGNOSTIC
+		hp->h_hash.le_next = NULL;
+		hp->h_hash.le_prev = NULL;
+#endif
+	}
+	simple_unlock(&hpfs_hphash_slock);
+}