#include <sys/param.h>
#include <sys/systm.h>
#include <sys/time.h>
#include <sys/mount_internal.h>
#include <sys/vnode_internal.h>
#include <sys/namei.h>
#include <sys/errno.h>
#include <sys/malloc.h>
#include <sys/kauth.h>
#include <sys/user.h>
LIST_HEAD(nchashhead, namecache) *nchashtbl;
u_long nchashmask;
u_long nchash;
long numcache;
int desiredNodes;
int desiredNegNodes;
TAILQ_HEAD(, namecache) nchead;
TAILQ_HEAD(, namecache) neghead;
struct nchstats nchstats;
lck_grp_t * namecache_lck_grp;
lck_grp_attr_t * namecache_lck_grp_attr;
lck_attr_t * namecache_lck_attr;
lck_mtx_t * namecache_mtx_lock;
static vnode_t cache_lookup_locked(vnode_t dvp, struct componentname *cnp);
static int remove_name_locked(const char *);
static char *add_name_locked(const char *, size_t, u_int, u_int);
static void init_string_table(void);
static void cache_delete(struct namecache *, int);
static void dump_string_table(void);
static void init_crc32(void);
static unsigned int crc32tab[256];
#define NCHHASH(dvp, hash_val) \
(&nchashtbl[(dvp->v_id ^ (hash_val)) & nchashmask])
int
build_path(vnode_t first_vp, char *buff, int buflen, int *outlen)
{
vnode_t vp = first_vp;
char *end, *str;
int len, ret=0, counter=0;
end = &buff[buflen-1];
*end = '\0';
if (vp && (vp->v_flag & VROOT) && vp->v_mount) {
if (vp->v_mount->mnt_flag & MNT_ROOTFS) {
*--end = '/';
goto out;
} else {
vp = vp->v_mount->mnt_vnodecovered;
}
}
name_cache_lock();
while (vp && vp->v_parent != vp) {
if (counter++ > MAXPATHLEN/2) {
panic("build_path: vnode parent chain is too long! vp 0x%x\n", vp);
}
str = vp->v_name;
if (str == NULL) {
if (vp->v_parent != NULL) {
ret = EINVAL;
}
break;
}
len = strlen(str);
if ((end - buff) < (len + 1)) {
ret = ENOSPC;
break;
}
str += len;
for (; len > 0; len--) {
*--end = *--str;
}
*--end = '/';
if (vp == first_vp && (vp->v_flag & VROOT)) {
if (vp->v_mount && vp->v_mount->mnt_vnodecovered) {
vp = vp->v_mount->mnt_vnodecovered->v_parent;
} else {
vp = NULLVP;
}
} else {
vp = vp->v_parent;
}
if (vp && (vp->v_flag & VROOT) && vp->v_mount) {
vp = vp->v_mount->mnt_vnodecovered;
}
}
name_cache_unlock();
out:
memmove(buff, end, &buff[buflen] - end);
*outlen = &buff[buflen] - end;
return ret;
}
vnode_t
vnode_getparent(vnode_t vp)
{
vnode_t pvp = NULLVP;
int pvid;
name_cache_lock();
if ( (pvp = vp->v_parent) != NULLVP ) {
pvid = pvp->v_id;
name_cache_unlock();
if (vnode_getwithvid(pvp, pvid) != 0)
pvp = NULL;
} else
name_cache_unlock();
return (pvp);
}
char *
vnode_getname(vnode_t vp)
{
char *name = NULL;
name_cache_lock();
if (vp->v_name)
name = add_name_locked(vp->v_name, strlen(vp->v_name), 0, 0);
name_cache_unlock();
return (name);
}
void
vnode_putname(char *name)
{
name_cache_lock();
remove_name_locked(name);
name_cache_unlock();
}
void
vnode_update_identity(vnode_t vp, vnode_t dvp, char *name, int name_len, int name_hashval, int flags)
{
struct namecache *ncp;
vnode_t old_parentvp = NULLVP;
if (flags & VNODE_UPDATE_PARENT) {
if (dvp && vnode_ref(dvp) != 0)
dvp = NULLVP;
} else
dvp = NULLVP;
name_cache_lock();
if ( (flags & VNODE_UPDATE_NAME) && (name != vp->v_name) ) {
if (vp->v_name != NULL) {
remove_name_locked(vp->v_name);
vp->v_name = NULL;
}
if (name && *name) {
if (name_len == 0)
name_len = strlen(name);
vp->v_name = add_name_locked(name, name_len, name_hashval, 0);
}
}
if (flags & VNODE_UPDATE_PARENT) {
if (dvp != vp && dvp != vp->v_parent) {
old_parentvp = vp->v_parent;
vp->v_parent = dvp;
dvp = NULLVP;
if (old_parentvp)
flags |= VNODE_UPDATE_CACHE;
}
}
if (flags & VNODE_UPDATE_CACHE) {
while ( (ncp = LIST_FIRST(&vp->v_nclinks)) )
cache_delete(ncp, 1);
}
name_cache_unlock();
if (dvp != NULLVP)
vnode_rele(dvp);
if (old_parentvp) {
struct uthread *ut;
ut = get_bsdthread_info(current_thread());
ut->uu_defer_reclaims = 1;
ut->uu_vreclaims = NULLVP;
while ( (vp = old_parentvp) != NULLVP ) {
vnode_lock(vp);
vnode_rele_internal(vp, 0, 0, 1);
if ( (vp->v_iocount == 1) && (vp->v_usecount == 0) &&
((vp->v_lflag & (VL_MARKTERM | VL_TERMINATE | VL_DEAD)) == VL_MARKTERM)) {
name_cache_lock();
old_parentvp = vp->v_parent;
vp->v_parent = NULLVP;
name_cache_unlock();
} else {
old_parentvp = NULLVP;
}
vnode_unlock(vp);
}
ut->uu_defer_reclaims = 0;
while ( (vp = ut->uu_vreclaims) != NULLVP) {
ut->uu_vreclaims = vp->v_defer_reclaimlist;
vnode_put(vp);
}
}
}
void vnode_set_hard_link(vnode_t vp)
{
vnode_lock(vp);
vp->v_flag |= VISHARDLINK;
vnode_unlock(vp);
}
void vnode_uncache_credentials(vnode_t vp)
{
kauth_cred_t ucred = NULL;
if (vp->v_cred) {
vnode_lock(vp);
ucred = vp->v_cred;
vp->v_cred = NULL;
vnode_unlock(vp);
if (ucred)
kauth_cred_rele(ucred);
}
}
void vnode_cache_credentials(vnode_t vp, vfs_context_t context)
{
kauth_cred_t ucred;
kauth_cred_t tcred = NOCRED;
struct timeval tv;
ucred = vfs_context_ucred(context);
if (vp->v_cred != ucred || (vp->v_mount->mnt_kern_flag & MNTK_AUTH_OPAQUE)) {
vnode_lock(vp);
microuptime(&tv);
vp->v_cred_timestamp = tv.tv_sec;
if (vp->v_cred != ucred) {
kauth_cred_ref(ucred);
tcred = vp->v_cred;
vp->v_cred = ucred;
}
vnode_unlock(vp);
if (tcred)
kauth_cred_rele(tcred);
}
}
int
reverse_lookup(vnode_t start_vp, vnode_t *lookup_vpp, struct filedesc *fdp, vfs_context_t context, int *dp_authorized)
{
int vid, done = 0;
int auth_opaque = 0;
vnode_t dp = start_vp;
vnode_t vp = NULLVP;
kauth_cred_t ucred;
struct timeval tv;
ucred = vfs_context_ucred(context);
*lookup_vpp = start_vp;
name_cache_lock();
if ( dp->v_mount && (dp->v_mount->mnt_kern_flag & MNTK_AUTH_OPAQUE) ) {
auth_opaque = 1;
microuptime(&tv);
}
for (;;) {
*dp_authorized = 0;
if (auth_opaque && ((tv.tv_sec - dp->v_cred_timestamp) > VCRED_EXPIRED))
break;
if (dp->v_cred != ucred)
break;
*dp_authorized = 1;
if ((dp->v_flag & VROOT) != 0 ||
(dp == fdp->fd_cdir) ||
(dp == fdp->fd_rdir)) {
done = 1;
break;
}
if ( (vp = dp->v_parent) == NULLVP)
break;
dp = vp;
*lookup_vpp = dp;
}
vid = dp->v_id;
name_cache_unlock();
if (done == 0 && dp != start_vp) {
if (vnode_getwithvid(dp, vid) != 0) {
*lookup_vpp = start_vp;
}
}
return((done == 1) ? 0 : -1);
}
int
cache_lookup_path(struct nameidata *ndp, struct componentname *cnp, vnode_t dp, vfs_context_t context, int *trailing_slash, int *dp_authorized)
{
char *cp;
int vid, vvid;
int auth_opaque = 0;
vnode_t vp = NULLVP;
vnode_t tdp = NULLVP;
kauth_cred_t ucred;
struct timeval tv;
unsigned int hash;
ucred = vfs_context_ucred(context);
*trailing_slash = 0;
name_cache_lock();
if ( dp->v_mount && (dp->v_mount->mnt_kern_flag & MNTK_AUTH_OPAQUE) ) {
auth_opaque = 1;
microuptime(&tv);
}
for (;;) {
hash = 0;
cp = cnp->cn_nameptr;
while (*cp && (*cp != '/')) {
hash ^= crc32tab[((hash >> 24) ^ (unsigned char)*cp++)];
}
if (hash == 0)
hash = 1;
cnp->cn_hash = hash;
cnp->cn_namelen = cp - cnp->cn_nameptr;
ndp->ni_pathlen -= cnp->cn_namelen;
ndp->ni_next = cp;
while (*cp == '/' && (cp[1] == '/' || cp[1] == '\0')) {
cp++;
ndp->ni_pathlen--;
if (*cp == '\0') {
*trailing_slash = 1;
*ndp->ni_next = '\0';
}
}
ndp->ni_next = cp;
cnp->cn_flags &= ~(MAKEENTRY | ISLASTCN | ISDOTDOT);
if (*cp == '\0')
cnp->cn_flags |= ISLASTCN;
if (cnp->cn_namelen == 2 && cnp->cn_nameptr[1] == '.' && cnp->cn_nameptr[0] == '.')
cnp->cn_flags |= ISDOTDOT;
*dp_authorized = 0;
if (auth_opaque && ((tv.tv_sec - dp->v_cred_timestamp) > VCRED_EXPIRED))
break;
if (dp->v_cred != ucred)
break;
*dp_authorized = 1;
if ( (cnp->cn_flags & (ISLASTCN | ISDOTDOT)) ) {
if (cnp->cn_nameiop != LOOKUP)
break;
if (cnp->cn_flags & (LOCKPARENT | NOCACHE | ISDOTDOT))
break;
}
if ( (vp = cache_lookup_locked(dp, cnp)) == NULLVP)
break;
if ( (cnp->cn_flags & ISLASTCN) )
break;
if (vp->v_type != VDIR) {
if (vp->v_type != VLNK)
vp = NULL;
break;
}
if (vp->v_mountedhere && ((cnp->cn_flags & NOCROSSMOUNT) == 0))
break;
dp = vp;
vp = NULLVP;
cnp->cn_nameptr = ndp->ni_next + 1;
ndp->ni_pathlen--;
while (*cnp->cn_nameptr == '/') {
cnp->cn_nameptr++;
ndp->ni_pathlen--;
}
}
if (vp != NULLVP)
vvid = vp->v_id;
vid = dp->v_id;
name_cache_unlock();
if ((vp != NULLVP) && (vp->v_type != VLNK) &&
((cnp->cn_flags & (ISLASTCN | LOCKPARENT | WANTPARENT | SAVESTART)) == ISLASTCN)) {
tdp = dp;
dp = NULLVP;
} else {
need_dp:
if (dp == ndp->ni_usedvp) {
vnode_get(dp);
} else if ( (vnode_getwithvid(dp, vid)) ) {
return (ENOENT);
}
}
if (vp != NULLVP) {
if ( (vnode_getwithvid(vp, vvid)) ) {
vp = NULLVP;
if (dp == NULLVP) {
dp = tdp;
goto need_dp;
}
}
}
ndp->ni_dvp = dp;
ndp->ni_vp = vp;
return (0);
}
static vnode_t
cache_lookup_locked(vnode_t dvp, struct componentname *cnp)
{
register struct namecache *ncp;
register struct nchashhead *ncpp;
register long namelen = cnp->cn_namelen;
char *nameptr = cnp->cn_nameptr;
unsigned int hashval = (cnp->cn_hash & NCHASHMASK);
vnode_t vp;
ncpp = NCHHASH(dvp, cnp->cn_hash);
LIST_FOREACH(ncp, ncpp, nc_hash) {
if ((ncp->nc_dvp == dvp) && (ncp->nc_hashval == hashval)) {
if (memcmp(ncp->nc_name, nameptr, namelen) == 0 && ncp->nc_name[namelen] == 0)
break;
}
}
if (ncp == 0)
return (NULL);
vp = ncp->nc_vp;
if (vp && (vp->v_flag & VISHARDLINK)) {
vp = NULL;
}
return (vp);
}
static unsigned int
hash_string(const char *cp, int len)
{
unsigned hash = 0;
if (len) {
while (len--) {
hash ^= crc32tab[((hash >> 24) ^ (unsigned char)*cp++)];
}
} else {
while (*cp != '\0') {
hash ^= crc32tab[((hash >> 24) ^ (unsigned char)*cp++)];
}
}
if (hash == 0)
hash = 1;
return hash;
}
int
cache_lookup(dvp, vpp, cnp)
struct vnode *dvp;
struct vnode **vpp;
struct componentname *cnp;
{
register struct namecache *ncp;
register struct nchashhead *ncpp;
register long namelen = cnp->cn_namelen;
char *nameptr = cnp->cn_nameptr;
unsigned int hashval = (cnp->cn_hash & NCHASHMASK);
uint32_t vid;
vnode_t vp;
name_cache_lock();
ncpp = NCHHASH(dvp, cnp->cn_hash);
LIST_FOREACH(ncp, ncpp, nc_hash) {
if ((ncp->nc_dvp == dvp) && (ncp->nc_hashval == hashval)) {
if (memcmp(ncp->nc_name, nameptr, namelen) == 0 && ncp->nc_name[namelen] == 0)
break;
}
}
if (ncp == 0) {
nchstats.ncs_miss++;
name_cache_unlock();
return (0);
}
if ((cnp->cn_flags & MAKEENTRY) == 0) {
nchstats.ncs_badhits++;
cache_delete(ncp, 1);
name_cache_unlock();
return (0);
}
vp = ncp->nc_vp;
if (vp) {
nchstats.ncs_goodhits++;
vid = vp->v_id;
name_cache_unlock();
if (vnode_getwithvid(vp, vid)) {
name_cache_lock();
nchstats.ncs_badvid++;
name_cache_unlock();
return (0);
}
*vpp = vp;
return (-1);
}
if (cnp->cn_nameiop == CREATE || cnp->cn_nameiop == RENAME) {
nchstats.ncs_badhits++;
cache_delete(ncp, 1);
name_cache_unlock();
return (0);
}
nchstats.ncs_neghits++;
if (ncp->nc_whiteout)
cnp->cn_flags |= ISWHITEOUT;
name_cache_unlock();
return (ENOENT);
}
void
cache_enter(dvp, vp, cnp)
struct vnode *dvp;
struct vnode *vp;
struct componentname *cnp;
{
register struct namecache *ncp, *negp;
register struct nchashhead *ncpp;
if (cnp->cn_hash == 0)
cnp->cn_hash = hash_string(cnp->cn_nameptr, cnp->cn_namelen);
name_cache_lock();
if ((vp != NULLVP) && (LIST_FIRST(&vp->v_nclinks))) {
name_cache_unlock();
return;
}
if (numcache < desiredNodes &&
((ncp = nchead.tqh_first) == NULL ||
ncp->nc_hash.le_prev != 0)) {
ncp = (struct namecache *)_MALLOC_ZONE((u_long)sizeof *ncp, M_CACHE, M_WAITOK);
numcache++;
} else {
ncp = TAILQ_FIRST(&nchead);
TAILQ_REMOVE(&nchead, ncp, nc_entry);
if (ncp->nc_hash.le_prev != 0) {
nchstats.ncs_stolen++;
cache_delete(ncp, 0);
}
}
nchstats.ncs_enters++;
ncp->nc_vp = vp;
ncp->nc_dvp = dvp;
ncp->nc_hashval = cnp->cn_hash;
ncp->nc_whiteout = FALSE;
ncp->nc_name = add_name_locked(cnp->cn_nameptr, cnp->cn_namelen, cnp->cn_hash, 0);
TAILQ_INSERT_TAIL(&nchead, ncp, nc_entry);
ncpp = NCHHASH(dvp, cnp->cn_hash);
#if DIAGNOSTIC
{
register struct namecache *p;
for (p = ncpp->lh_first; p != 0; p = p->nc_hash.le_next)
if (p == ncp)
panic("cache_enter: duplicate");
}
#endif
LIST_INSERT_HEAD(ncpp, ncp, nc_hash);
if (vp) {
LIST_INSERT_HEAD(&vp->v_nclinks, ncp, nc_un.nc_link);
} else {
TAILQ_INSERT_TAIL(&neghead, ncp, nc_un.nc_negentry);
if (cnp->cn_flags & ISWHITEOUT)
ncp->nc_whiteout = TRUE;
nchstats.ncs_negtotal++;
if (nchstats.ncs_negtotal > desiredNegNodes) {
negp = TAILQ_FIRST(&neghead);
TAILQ_REMOVE(&neghead, negp, nc_un.nc_negentry);
cache_delete(negp, 1);
}
}
LIST_INSERT_HEAD(&dvp->v_ncchildren, ncp, nc_child);
name_cache_unlock();
}
static void init_crc32(void)
{
unsigned int crc32_polynomial = 0x04c11db7;
unsigned int i,j;
for (i = 0; i < 256; i++) {
unsigned int crc_rem = i << 24;
for (j = 0; j < 8; j++) {
if (crc_rem & 0x80000000)
crc_rem = (crc_rem << 1) ^ crc32_polynomial;
else
crc_rem = (crc_rem << 1);
}
crc32tab[i] = crc_rem;
}
}
void
nchinit(void)
{
desiredNegNodes = (desiredvnodes / 10);
desiredNodes = desiredvnodes + desiredNegNodes;
TAILQ_INIT(&nchead);
TAILQ_INIT(&neghead);
init_crc32();
nchashtbl = hashinit(MAX(4096, (2 *desiredNodes)), M_CACHE, &nchash);
nchashmask = nchash;
nchash++;
init_string_table();
namecache_lck_grp_attr= lck_grp_attr_alloc_init();
lck_grp_attr_setstat(namecache_lck_grp_attr);
namecache_lck_grp = lck_grp_alloc_init("Name Cache", namecache_lck_grp_attr);
namecache_lck_attr = lck_attr_alloc_init();
namecache_mtx_lock = lck_mtx_alloc_init(namecache_lck_grp, namecache_lck_attr);
}
void
name_cache_lock(void)
{
lck_mtx_lock(namecache_mtx_lock);
}
void
name_cache_unlock(void)
{
lck_mtx_unlock(namecache_mtx_lock);
}
int
resize_namecache(u_int newsize)
{
struct nchashhead *new_table;
struct nchashhead *old_table;
struct nchashhead *old_head, *head;
struct namecache *entry, *next;
uint32_t i, hashval;
int dNodes, dNegNodes;
u_long new_size, old_size;
dNegNodes = (newsize / 10);
dNodes = newsize + dNegNodes;
if (dNodes < desiredNodes) {
return 0;
}
new_table = hashinit(2 * dNodes, M_CACHE, &nchashmask);
new_size = nchashmask + 1;
if (new_table == NULL) {
return ENOMEM;
}
name_cache_lock();
old_table = nchashtbl;
nchashtbl = new_table;
old_size = nchash;
nchash = new_size;
for(i=0; i < old_size; i++) {
old_head = &old_table[i];
for (entry=old_head->lh_first; entry != NULL; entry=next) {
hashval = hash_string(entry->nc_name, 0);
entry->nc_hashval = hashval;
head = NCHHASH(entry->nc_dvp, hashval);
next = entry->nc_hash.le_next;
LIST_INSERT_HEAD(head, entry, nc_hash);
}
}
desiredNodes = dNodes;
desiredNegNodes = dNegNodes;
name_cache_unlock();
FREE(old_table, M_CACHE);
return 0;
}
static void
cache_delete(struct namecache *ncp, int age_entry)
{
nchstats.ncs_deletes++;
if (ncp->nc_vp) {
LIST_REMOVE(ncp, nc_un.nc_link);
} else {
TAILQ_REMOVE(&neghead, ncp, nc_un.nc_negentry);
nchstats.ncs_negtotal--;
}
LIST_REMOVE(ncp, nc_child);
LIST_REMOVE(ncp, nc_hash);
ncp->nc_hash.le_prev = NULL;
if (age_entry) {
TAILQ_REMOVE(&nchead, ncp, nc_entry);
TAILQ_INSERT_HEAD(&nchead, ncp, nc_entry);
}
remove_name_locked(ncp->nc_name);
ncp->nc_name = NULL;
}
void
cache_purge(vnode_t vp)
{
struct namecache *ncp;
if ((LIST_FIRST(&vp->v_nclinks) == NULL) && (LIST_FIRST(&vp->v_ncchildren) == NULL))
return;
name_cache_lock();
while ( (ncp = LIST_FIRST(&vp->v_nclinks)) )
cache_delete(ncp, 1);
while ( (ncp = LIST_FIRST(&vp->v_ncchildren)) )
cache_delete(ncp, 1);
name_cache_unlock();
}
void
cache_purge_negatives(vnode_t vp)
{
struct namecache *ncp;
name_cache_lock();
LIST_FOREACH(ncp, &vp->v_ncchildren, nc_child)
if (ncp->nc_vp == NULL)
cache_delete(ncp , 1);
name_cache_unlock();
}
void
cache_purgevfs(mp)
struct mount *mp;
{
struct nchashhead *ncpp;
struct namecache *ncp;
name_cache_lock();
for (ncpp = &nchashtbl[nchash - 1]; ncpp >= nchashtbl; ncpp--) {
restart:
for (ncp = ncpp->lh_first; ncp != 0; ncp = ncp->nc_hash.le_next) {
if (ncp->nc_dvp->v_mount == mp) {
cache_delete(ncp, 0);
goto restart;
}
}
}
name_cache_unlock();
}
static LIST_HEAD(stringhead, string_t) *string_ref_table;
static u_long string_table_mask;
static uint32_t max_chain_len=0;
static struct stringhead *long_chain_head=NULL;
static uint32_t filled_buckets=0;
static uint32_t num_dups=0;
static uint32_t nstrings=0;
typedef struct string_t {
LIST_ENTRY(string_t) hash_chain;
unsigned char *str;
uint32_t refcount;
} string_t;
static int
resize_string_ref_table(void)
{
struct stringhead *new_table;
struct stringhead *old_table;
struct stringhead *old_head, *head;
string_t *entry, *next;
uint32_t i, hashval;
u_long new_mask, old_mask;
new_table = hashinit((string_table_mask + 1) * 2, M_CACHE, &new_mask);
if (new_table == NULL) {
return ENOMEM;
}
old_table = string_ref_table;
string_ref_table = new_table;
old_mask = string_table_mask;
string_table_mask = new_mask;
printf("resize: max chain len %d, new table size %d\n",
max_chain_len, new_mask + 1);
max_chain_len = 0;
long_chain_head = NULL;
filled_buckets = 0;
for(i=0; i <= old_mask; i++) {
old_head = &old_table[i];
for (entry=old_head->lh_first; entry != NULL; entry=next) {
hashval = hash_string(entry->str, 0);
head = &string_ref_table[hashval & string_table_mask];
if (head->lh_first == NULL) {
filled_buckets++;
}
next = entry->hash_chain.le_next;
LIST_INSERT_HEAD(head, entry, hash_chain);
}
}
FREE(old_table, M_CACHE);
return 0;
}
static void
init_string_table(void)
{
string_ref_table = hashinit(4096, M_CACHE, &string_table_mask);
}
char *
vfs_addname(const char *name, size_t len, u_int hashval, u_int flags)
{
char * ptr;
name_cache_lock();
ptr = add_name_locked(name, len, hashval, flags);
name_cache_unlock();
return(ptr);
}
static char *
add_name_locked(const char *name, size_t len, u_int hashval, __unused u_int flags)
{
struct stringhead *head;
string_t *entry;
uint32_t chain_len = 0;
if (4*filled_buckets >= ((string_table_mask + 1) * 3)) {
if (resize_string_ref_table() != 0) {
printf("failed to resize the hash table.\n");
}
}
if (hashval == 0) {
hashval = hash_string(name, 0);
}
head = &string_ref_table[hashval & string_table_mask];
for (entry=head->lh_first; entry != NULL; chain_len++, entry=entry->hash_chain.le_next) {
if (memcmp(entry->str, name, len) == 0 && entry->str[len] == '\0') {
entry->refcount++;
num_dups++;
break;
}
}
if (entry == NULL) {
MALLOC(entry, string_t *, sizeof(string_t) + len + 1, M_TEMP, M_WAITOK);
head = &string_ref_table[hashval & string_table_mask];
if (head->lh_first == NULL) {
filled_buckets++;
}
entry->str = (char *)((char *)entry + sizeof(string_t));
strncpy(entry->str, name, len);
entry->str[len] = '\0';
entry->refcount = 1;
LIST_INSERT_HEAD(head, entry, hash_chain);
if (chain_len > max_chain_len) {
max_chain_len = chain_len;
long_chain_head = head;
}
nstrings++;
}
return entry->str;
}
int
vfs_removename(const char *nameref)
{
int i;
name_cache_lock();
i = remove_name_locked(nameref);
name_cache_unlock();
return(i);
}
static int
remove_name_locked(const char *nameref)
{
struct stringhead *head;
string_t *entry;
uint32_t hashval;
char * ptr;
hashval = hash_string(nameref, 0);
head = &string_ref_table[hashval & string_table_mask];
for (entry=head->lh_first; entry != NULL; entry=entry->hash_chain.le_next) {
if (entry->str == (unsigned char *)nameref) {
entry->refcount--;
if (entry->refcount == 0) {
LIST_REMOVE(entry, hash_chain);
if (head->lh_first == NULL) {
filled_buckets--;
}
ptr = entry->str;
entry->str = NULL;
nstrings--;
FREE(entry, M_TEMP);
} else {
num_dups--;
}
return 0;
}
}
return ENOENT;
}
void
dump_string_table(void)
{
struct stringhead *head;
string_t *entry;
u_long i;
name_cache_lock();
for (i = 0; i <= string_table_mask; i++) {
head = &string_ref_table[i];
for (entry=head->lh_first; entry != NULL; entry=entry->hash_chain.le_next) {
printf("%6d - %s\n", entry->refcount, entry->str);
}
}
name_cache_unlock();
}