Home
last modified time | relevance | path

Searched refs:str_hash (Results 1 – 5 of 5) sorted by relevance

/titanic_41/usr/src/lib/libdtrace/common/
H A Ddt_strtab.c73 sp->str_hash = malloc(nbuckets * sizeof (dt_strhash_t *)); in dt_strtab_create()
75 if (sp->str_hash == NULL) in dt_strtab_create()
78 bzero(sp->str_hash, nbuckets * sizeof (dt_strhash_t *)); in dt_strtab_create()
105 for (hp = sp->str_hash[i]; hp != NULL; hp = hq) { in dt_strtab_destroy()
114 if (sp->str_hash != NULL) in dt_strtab_destroy()
115 free(sp->str_hash); in dt_strtab_destroy()
218 for (hp = sp->str_hash[h]; hp != NULL; hp = hp->str_next) { in dt_strtab_index()
250 hp->str_next = sp->str_hash[h]; in dt_strtab_insert()
261 sp->str_hash[h] = hp; in dt_strtab_insert()
H A Ddt_strtab.h47 dt_strhash_t **str_hash; /* array of hash buckets */ member
/titanic_41/usr/src/tools/ctf/cvt/
H A Dstrtab.c53 sp->str_hash = xcalloc(STRTAB_HASHSZ * sizeof (strhash_t *)); in strtab_create()
73 for (hp = sp->str_hash[i]; hp != NULL; hp = hq) { in strtab_destroy()
82 free(sp->str_hash); in strtab_destroy()
170 for (hp = sp->str_hash[h]; hp != NULL; hp = hp->str_next) { in strtab_insert()
185 hp->str_next = sp->str_hash[h]; in strtab_insert()
187 sp->str_hash[h] = hp; in strtab_insert()
237 for (hp = sp->str_hash[i]; hp != NULL; hp = hp->str_next) { in strtab_print()
H A Dstrtab.h47 strhash_t **str_hash; /* array of hash buckets */ member
/titanic_41/usr/src/cmd/sgs/include/
H A D_string_table.h87 typedef struct str_hash Str_hash;
89 struct str_hash { struct