#include <u.h>#include <libc.h>#include <auth.h>#include <fcall.h>#include <thread.h>#include "9p.h" enum {	NHASH = 128}; typedef struct Intlist	Intlist;struct Intlist{	ulong	id;	void*	aux;	Intlist*	link;}; struct Intmap{	RWLock;	Intlist*	hash[NHASH];	void (*inc)(void*);}; static ulonghashid(ulong id){	return id%NHASH;} static voidnop(void*){} Intmap*allocmap(void (*inc)(void*)){	Intmap *m; 	m = mallocz(sizeof(Intmap), 1);	if(inc == nil)		inc = nop;	m->inc = inc;	return m;} voidfreemap(Intmap *map){	free(map);} static Intlist**llookup(Intmap *map, ulong id){	Intlist **lf; 	for(lf=&map->hash[hashid(id)]; *lf; lf=&(*lf)->link)		if((*lf)->id == id)			break;	return lf;	} /* * The RWlock is used as expected except that we allow * inc() to be called while holding it.  This is because we're * locking changes to the tree structure, not to the references. * Inc() is expected to have its own locking. */void*lookupkey(Intmap *map, ulong id){	Intlist *f;	void *v; 	rlock(map);	if(f = *llookup(map, id)){		v = f->aux;		map->inc(v);	}else		v = nil;	runlock(map);	return v;} void*insertkey(Intmap *map, ulong id, void *v){	Intlist *f;	void *ov;	ulong h; 	wlock(map);	if(f = *llookup(map, id)){		/* no decrement for ov because we're returning it */		ov = f->aux;		map->inc(v);		f->aux = v;	}else if((f = mallocz(sizeof *f, 1)) == nil)		ov = nil;	else{		f->id = id;		map->inc(v);		f->aux = v;		h = hashid(id);		f->link = map->hash[h];		map->hash[h] = f;		ov = nil;	}	wunlock(map);	return ov;	} intcaninsertkey(Intmap *map, ulong id, void *v){	Intlist *f;	int rv;	ulong h; 	wlock(map);	if(*llookup(map, id))		rv = 0;	else if((f = mallocz(sizeof *f, 1)) == nil)		rv = 0;	else{		f->id = id;		map->inc(v);		f->aux = v;		h = hashid(id);		f->link = map->hash[h];		map->hash[h] = f;		rv = 1;	}	wunlock(map);	return rv;	} void*deletekey(Intmap *map, ulong id){	Intlist **lf, *f;	void *ov; 	wlock(map);	if(f = *(lf = llookup(map, id))){		/* no decrement because we're returning it */		ov = f->aux;		*lf = f->link;		free(f);	}	else		ov = nil;	wunlock(map);	return ov;}