common/ctf/ctf_hash.c

35 ctf_hash_create(ctf_hash_t *hp, ulong_t nelems)
45 		bzero(hp, sizeof (ctf_hash_t));
46 		hp->h_buckets = (ushort_t *)_CTF_EMPTY;
47 		hp->h_nbuckets = 1;
51 	hp->h_nbuckets = 211;		/* use a prime number of hash buckets */
52 	hp->h_nelems = nelems + 1;	/* we use index zero as a sentinel */
53 	hp->h_free = 1;			/* first free element is index 1 */
55 	hp->h_buckets = ctf_alloc(sizeof (ushort_t) * hp->h_nbuckets);
56 	hp->h_chains = ctf_alloc(sizeof (ctf_helem_t) * hp->h_nelems);
58 	if (hp->h_buckets == NULL || hp->h_chains == NULL) {
59 		ctf_hash_destroy(hp);
63 	bzero(hp->h_buckets, sizeof (ushort_t) * hp->h_nbuckets);
64 	bzero(hp->h_chains, sizeof (ctf_helem_t) * hp->h_nelems);
70 ctf_hash_size(const ctf_hash_t *hp)
72 	return (hp->h_nelems ? hp->h_nelems - 1 : 0);
95 ctf_hash_insert(ctf_hash_t *hp, ctf_file_t *fp, ushort_t type, uint_t name)
99 	ctf_helem_t *hep = &hp->h_chains[hp->h_free];
105 	if (hp->h_free >= hp->h_nelems)
119 	h = ctf_hash_compute(str, strlen(str)) % hp->h_nbuckets;
120 	hep->h_next = hp->h_buckets[h];
121 	hp->h_buckets[h] = hp->h_free++;
132 ctf_hash_define(ctf_hash_t *hp, ctf_file_t *fp, ushort_t type, uint_t name)
135 	ctf_helem_t *hep = ctf_hash_lookup(hp, fp, str, strlen(str));
138 		return (ctf_hash_insert(hp, fp, type, name));
145 ctf_hash_lookup(ctf_hash_t *hp, ctf_file_t *fp, const char *key, size_t len)
152 	ulong_t h = ctf_hash_compute(key, len) % hp->h_nbuckets;
154 	for (i = hp->h_buckets[h]; i != 0; i = hep->h_next) {
155 		hep = &hp->h_chains[i];
167 ctf_hash_destroy(ctf_hash_t *hp)
169 	if (hp->h_buckets != NULL && hp->h_nbuckets != 1) {
170 		ctf_free(hp->h_buckets, sizeof (ushort_t) * hp->h_nbuckets);
171 		hp->h_buckets = NULL;
174 	if (hp->h_chains != NULL) {
175 		ctf_free(hp->h_chains, sizeof (ctf_helem_t) * hp->h_nelems);
176 		hp->h_chains = NULL;