Home
last modified time | relevance | path

Searched refs:hash_count (Results 1 – 10 of 10) sorted by relevance

/titanic_44/usr/src/lib/libsip/common/
H A Dsip_hash.c67 if (hash_entry->hash_count == 0) { in sip_hash_add()
76 hash_entry->hash_count++; in sip_hash_add()
97 for (count = 0; count < hash_entry->hash_count; count++) { in sip_hash_find()
125 for (hcount = 0; hcount < hash_entry->hash_count; hcount++) { in sip_walk_hash()
151 for (count = 0; count < hash_entry->hash_count; count++) { in sip_hash_delete()
179 hash_entry->hash_count--; in sip_hash_delete()
H A Dsip_hash.h57 int hash_count; member
H A Dsip_xaction.c648 sip_xaction_hash[cnt].hash_count = 0; in sip_xaction_init()
H A Dsip_dialog.c1838 sip_dialog_hash[cnt].hash_count = 0; in sip_dialog_init()
1843 sip_dialog_phash[cnt].hash_count = 0; in sip_dialog_init()
/titanic_44/usr/src/tools/ctf/cvt/
H A Dhash.h50 int hash_count(hash_t *);
H A Dcompare.c85 if ((new = hash_count(difftd->td_iihash)) != 0) { in main()
H A Dhash.c230 hash_count(hash_t *hash) in hash_count() function
H A Dmerge.c1059 hash_count(mcd->md_tdtba) == 0); in merge_types()
/titanic_44/usr/src/lib/libtecla/common/
H A Dhash.h106 HashMemory *_new_HashMemory(int hash_count, int node_count);
H A Dhash.c113 HashMemory *_new_HashMemory(int hash_count, int node_count) in _new_HashMemory() argument
134 mem->hash_memory = _new_FreeList(sizeof(HashTable), hash_count); in _new_HashMemory()