Home
last modified time | relevance | path

Searched refs:htab (Results 1 – 7 of 7) sorted by relevance

/glibc-2.36/locale/programs/
Dsimple-hash.c60 static void insert_entry_2 (hash_table *htab, const void *key, size_t keylen,
62 static size_t lookup (const hash_table *htab, const void *key, size_t keylen,
68 init_hash (hash_table *htab, unsigned long int init_size) in init_hash() argument
74 htab->size = init_size; in init_hash()
75 htab->filled = 0; in init_hash()
76 htab->first = NULL; in init_hash()
77 htab->table = (void *) xcalloc (init_size + 1, sizeof (hash_entry)); in init_hash()
78 if (htab->table == NULL) in init_hash()
81 obstack_init (&htab->mem_pool); in init_hash()
88 delete_hash (hash_table *htab) in delete_hash() argument
[all …]
Dsimple-hash.h35 extern int init_hash (hash_table *htab, unsigned long int init_size) __THROW;
36 extern int delete_hash (hash_table *htab) __THROW;
37 extern int insert_entry (hash_table *htab, const void *key, size_t keylen,
39 extern int find_entry (const hash_table *htab, const void *key, size_t keylen,
41 extern int set_entry (hash_table *htab, const void *key, size_t keylen,
44 extern int iterate_table (const hash_table *htab, void **ptr,
/glibc-2.36/include/
Dinline-hashtab.h70 htab_delete (struct hashtab *htab) in htab_delete() argument
74 for (i = htab->size - 1; i >= 0; i--) in htab_delete()
75 free (htab->entries[i]); in htab_delete()
77 htab->free (htab->entries); in htab_delete()
78 free (htab); in htab_delete()
89 find_empty_slot_for_expand (struct hashtab *htab, int hash) in find_empty_slot_for_expand() argument
91 size_t size = htab->size; in find_empty_slot_for_expand()
93 void **slot = htab->entries + index; in find_empty_slot_for_expand()
106 slot = htab->entries + index; in find_empty_slot_for_expand()
121 htab_expand (struct hashtab *htab, int (*hash_fn) (void *)) in htab_expand() argument
[all …]
/glibc-2.36/misc/
Dhsearch_r.c62 __hcreate_r (size_t nel, struct hsearch_data *htab) in __hcreate_r() argument
65 if (htab == NULL) in __hcreate_r()
72 if (htab->table != NULL) in __hcreate_r()
93 htab->size = nel; in __hcreate_r()
94 htab->filled = 0; in __hcreate_r()
97 htab->table = (_ENTRY *) calloc (htab->size + 1, sizeof (_ENTRY)); in __hcreate_r()
98 if (htab->table == NULL) in __hcreate_r()
111 __hdestroy_r (struct hsearch_data *htab) in weak_alias()
114 if (htab == NULL) in weak_alias()
121 free (htab->table); in weak_alias()
[all …]
Dhsearch.c21 static struct hsearch_data htab; variable
30 (void) __hsearch_r (item, action, &result, &htab); in hsearch()
39 return __hcreate_r (nel, &htab); in hcreate()
46 __hdestroy_r (&htab); in __hdestroy()
/glibc-2.36/manual/
Dsearch.texi275 @c hcreate_r dup @mtsrace:htab @ascuheap @acucorrupt @acsmem
306 @c hdestroy_r dup @mtsrace:htab @ascuheap @acucorrupt @acsmem
355 @c hsearch_r dup @mtsrace:htab @acucorrupt/action==ENTER
383 @deftypefun int hcreate_r (size_t @var{nel}, struct hsearch_data *@var{htab})
385 @safety{@prelim{}@mtsafe{@mtsrace{:htab}}@asunsafe{@ascuheap{}}@acunsafe{@acucorrupt{} @acsmem{}}}
386 @c Unlike the lsearch array, the htab is (at least in part) opaque, so
390 @c Cancellation is unlikely to leave the htab in a corrupt state: the
400 @c hcreate_r @mtsrace:htab @ascuheap @acucorrupt @acsmem
404 @var{htab} to contain a hashing table with at least @var{nel} elements.
418 @deftypefun void hdestroy_r (struct hsearch_data *@var{htab})
[all …]
/glibc-2.36/
DNEWS805 [27403] dynamic-link: aarch64: tlsdesc htab is not freed on dlclose