add: dprintf("khash, find_entry looking at hep %p, he %p\n", hep, he);
context: find_entry(new_hash_table *nh, const void *key, ssize_t klen, const void *val){	hash_entry **hep;	hash_entry *he;	const unsigned char *p;	int hash = 0;	ssize_t i;	if (!nh)		return NULL;	for (p = key, i = klen; i; i--, p++) 		hash = hash * 33 + *p;	for (hep = &nh->array[hash & nh->max], he = *hep; he; hep = &he->next, he = *hep) {		if (he->hash == hash && he->klen == klen			&& memcmp(he->key, key, klen) == 0) {				break;		}	}	if (he || !val)		return hep;	/* add a new linked-list entry */	he = (hash_entry *)pool_get(nh->pool);	he->next = NULL;	he->hash = hash;	he->key  = key;	he->klen = klen;	he->val = val;	*hep = he;	nh->count++;	return hep;}