minix/sys/ufs/chfs/chfs_vnode_cache.c

166 lines
4.2 KiB
C
Raw Normal View History

/* $NetBSD: chfs_vnode_cache.c,v 1.1 2011/11/24 15:51:32 ahoka Exp $ */
/*-
* Copyright (c) 2010 Department of Software Engineering,
* University of Szeged, Hungary
* Copyright (C) 2010 Tamas Toth <ttoth@inf.u-szeged.hu>
* Copyright (C) 2010 Adam Hoka <ahoka@NetBSD.org>
* All rights reserved.
*
* This code is derived from software contributed to The NetBSD Foundation
* by the Department of Software Engineering, University of Szeged, Hungary
*
* 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.
*
* 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.
*/
#include "chfs.h"
#include <sys/pool.h>
struct chfs_vnode_cache **
chfs_vnocache_hash_init(void)
{
return kmem_zalloc(VNODECACHE_SIZE *
sizeof(struct chfs_vnode_cache *), KM_SLEEP);
}
/**
* chfs_set_vnode_cache_state - set state of a vnode_cache
* @chmp: fs super block info
* @vc: vnode_cache
* @state: new state
*/
void
chfs_vnode_cache_set_state(struct chfs_mount *chmp,
struct chfs_vnode_cache* vc, int state)
{
/* XXX do we really need locking here? */
KASSERT(mutex_owned(&chmp->chm_lock_vnocache));
vc->state = state;
}
/**
* chfs_get_vnode_cache - get a vnode_cache from the vnocache_hash
* @chmp: fs super block info
* @ino: inode for search
* Returns the vnode_cache.
*/
struct chfs_vnode_cache *
chfs_vnode_cache_get(struct chfs_mount *chmp, ino_t vno)
{
struct chfs_vnode_cache* ret;
KASSERT(mutex_owned(&chmp->chm_lock_vnocache));
ret = chmp->chm_vnocache_hash[vno % VNODECACHE_SIZE];
if (ret == NULL) {
return NULL;
}
while (ret && ret->vno < vno) {
ret = ret->next;
}
if (ret && ret->vno != vno) {
ret = NULL;
}
return ret;
}
/**
* chfs_add_vnode_cache - add a vnode_cache to the vnocache_hash
* @chmp: fs super block info
* @new: new vnode_cache
*/
void
chfs_vnode_cache_add(struct chfs_mount *chmp,
struct chfs_vnode_cache* new)
{
struct chfs_vnode_cache** prev;
KASSERT(mutex_owned(&chmp->chm_lock_vnocache));
if (!new->vno) {
new->vno = ++chmp->chm_max_vno;
}
prev = &chmp->chm_vnocache_hash[new->vno % VNODECACHE_SIZE];
while ((*prev) && (*prev)->vno < new->vno) {
prev = &((*prev)->next);
}
new->next = *prev;
*prev = new;
}
/**
* chfs_del_vnode_cache - del a vnode_cache from the vnocache_hash
* @chmp: fs super block info
* @old: old vnode_cache
*/
void
chfs_vnode_cache_remove(struct chfs_mount *chmp,
struct chfs_vnode_cache* old)
{
struct chfs_vnode_cache** prev;
KASSERT(mutex_owned(&chmp->chm_lock_vnocache));
prev = &chmp->chm_vnocache_hash[old->vno % VNODECACHE_SIZE];
while ((*prev) && (*prev)->vno < old->vno) {
prev = &(*prev)->next;
}
if ((*prev) == old) {
*prev = old->next;
}
if (old->state != VNO_STATE_READING &&
old->state != VNO_STATE_CLEARING) {
chfs_vnode_cache_free(old);
}
}
/**
* chfs_free_vnode_caches - free the vnocache_hash
* @chmp: fs super block info
*/
void
chfs_vnocache_hash_destroy(struct chfs_vnode_cache **hash)
{
struct chfs_vnode_cache *this, *next;
int i;
for (i = 0; i < VNODECACHE_SIZE; i++) {
this = hash[i];
while (this) {
next = this->next;
chfs_vnode_cache_free(this);
this = next;
}
hash[i] = NULL;
}
}