| /src/external/gpl2/gmake/dist/ |
| hash.c | 27 static void hash_rehash __P((struct hash_table* ht));
43 hash_init (struct hash_table *ht, unsigned long size,
46 ht->ht_size = round_up_2 (size);
47 ht->ht_empty_slots = ht->ht_size;
48 ht->ht_vec = (void**) CALLOC (struct token *, ht->ht_size);
49 if (ht->ht_vec == 0)
52 ht->ht_size * sizeof(struct token *));
56 ht->ht_capacity = ht->ht_size - (ht->ht_size / 16); /* 93.75% loading factor *
[all...] |
| /src/external/ibm-public/postfix/dist/src/util/ |
| nvtable.c | 115 NVTABLE_INFO *ht; local
117 if ((ht = htable_locate(table, key)) != 0) {
118 myfree(ht->value);
120 ht = htable_enter(table, key, (void *) 0);
122 ht->value = mystrdup(value);
123 return (ht);
|
| binhash.c | 217 BINHASH_INFO *ht; local
226 for (ht = *h++; ht; ht = next) {
227 next = ht->next;
228 binhash_link(table, ht);
238 BINHASH_INFO *ht; local
242 ht = (BINHASH_INFO *) mymalloc(sizeof(BINHASH_INFO));
243 ht->key = mymemdup(key, key_len);
244 ht->key_len = key_len
254 BINHASH_INFO *ht; local
269 BINHASH_INFO *ht; local
283 BINHASH_INFO *ht; local
312 BINHASH_INFO *ht; local
341 BINHASH_INFO *ht; local
407 BINHASH_INFO **ht; local
[all...] |
| htable.c | 210 HTABLE_INFO *ht; local
219 for (ht = *h++; ht; ht = next) {
220 next = ht->next;
221 htable_link(table, ht);
231 HTABLE_INFO *ht; local
235 ht = (HTABLE_INFO *) mymalloc(sizeof(HTABLE_INFO));
236 ht->key = mystrdup(key);
237 ht->value = value
246 HTABLE_INFO *ht; local
261 HTABLE_INFO *ht; local
277 HTABLE_INFO *ht; local
308 HTABLE_INFO *ht; local
337 HTABLE_INFO *ht; local
403 HTABLE_INFO **ht; local
[all...] |
| /src/external/lgpl2/userspace-rcu/dist/src/ |
| rculfhash-mm-order.c | 14 void cds_lfht_alloc_bucket_table(struct cds_lfht *ht, unsigned long order)
17 ht->tbl_order[0] = ht->alloc->calloc(ht->alloc->state,
18 ht->min_nr_alloc_buckets, sizeof(struct cds_lfht_node));
19 urcu_posix_assert(ht->tbl_order[0]);
20 } else if (order > ht->min_alloc_buckets_order) {
21 ht->tbl_order[order] = ht->alloc->calloc(ht->alloc->state
[all...] |
| rculfhash-mm-chunk.c | 14 void cds_lfht_alloc_bucket_table(struct cds_lfht *ht, unsigned long order)
17 ht->tbl_chunk[0] = ht->alloc->calloc(ht->alloc->state,
18 ht->min_nr_alloc_buckets, sizeof(struct cds_lfht_node));
19 urcu_posix_assert(ht->tbl_chunk[0]);
20 } else if (order > ht->min_alloc_buckets_order) {
21 unsigned long i, len = 1UL << (order - 1 - ht->min_alloc_buckets_order);
24 ht->tbl_chunk[i] = ht->alloc->calloc(ht->alloc->state
[all...] |
| rculfhash-mm-mmap.c | 116 void cds_lfht_alloc_bucket_table(struct cds_lfht *ht, unsigned long order)
119 if (ht->min_nr_alloc_buckets == ht->max_nr_buckets) {
121 ht->tbl_mmap = ht->alloc->calloc(ht->alloc->state,
122 ht->max_nr_buckets, sizeof(*ht->tbl_mmap));
123 urcu_posix_assert(ht->tbl_mmap);
127 ht->tbl_mmap = memory_map(ht->max_nr_bucket
[all...] |
| rculfhash.c | 335 struct cds_lfht *ht; member in struct:resize_work
345 struct cds_lfht *ht; member in struct:partition_resize_work
347 void (*fct)(struct cds_lfht *ht, unsigned long i,
379 void cds_lfht_iter_debug_set_ht(struct cds_lfht *ht, struct cds_lfht_iter *iter)
381 iter->lfht = ht;
389 void cds_lfht_iter_debug_set_ht(struct cds_lfht *ht __attribute__((unused)),
642 void cds_lfht_resize_lazy_grow(struct cds_lfht *ht, unsigned long size, int growth);
645 void cds_lfht_resize_lazy_count(struct cds_lfht *ht, unsigned long size,
699 void alloc_split_items_count(struct cds_lfht *ht)
713 if (ht->flags & CDS_LFHT_ACCOUNTING)
1653 struct cds_lfht *ht; local
1996 struct cds_lfht *ht = caa_container_of(work, struct cds_lfht, destroy_work); local
2200 struct cds_lfht *ht = resize_work->ht; local
[all...] |
| rculfhash-internal.h | 98 struct cds_lfht_node *(*bucket_at)(struct cds_lfht *ht,
162 struct cds_lfht *ht; local
164 ht = alloc->calloc(alloc->state, 1, cds_lfht_size);
165 urcu_posix_assert(ht);
167 ht->mm = mm;
168 ht->alloc = alloc;
169 ht->bucket_at = mm->bucket_at;
170 ht->min_nr_alloc_buckets = min_nr_alloc_buckets;
171 ht->min_alloc_buckets_order =
173 ht->max_nr_buckets = max_nr_buckets
[all...] |
| /src/external/mpl/bind/dist/lib/isc/ |
| ht.c | 1 /* $NetBSD: ht.c,v 1.11 2025/01/26 16:25:37 christos Exp $ */
21 #include <isc/ht.h>
31 #define ISC_HT_VALID(ht) ISC_MAGIC_VALID(ht, ISC_HT_MAGIC)
39 #define TRY_NEXTTABLE(idx, ht) (idx == ht->hindex && rehashing_in_progress(ht))
66 isc_ht_t *ht; member in struct:isc_ht_iter
73 isc__ht_find(const isc_ht_t *ht, const unsigned char *key,
76 isc__ht_add(isc_ht_t *ht, const unsigned char *key, const uint32_t keysize
242 isc_ht_t *ht = NULL; local
265 isc_ht_t *ht; local
463 isc_ht_t *ht; local
475 isc_ht_t *ht; local
489 isc_ht_t *ht = it->ht; local
533 isc_ht_t *ht; local
[all...] |
| /src/sys/external/bsd/drm/dist/bsd-core/ |
| drm_hashtab.c | 44 int drm_ht_create(struct drm_open_hash *ht, unsigned int order)
46 ht->size = 1 << order;
47 ht->order = order;
48 ht->table = NULL;
49 ht->table = hashinit(ht->size, HASH_LIST, false, &ht->mask);
50 if (!ht->table) {
57 void drm_ht_verbose_list(struct drm_open_hash *ht, unsigned long key)
64 hashed_key = hash32_buf(&key, sizeof(key), ht->order)
[all...] |
| drm_hashtab.h | 53 extern int drm_ht_create(struct drm_open_hash *ht, unsigned int order);
54 extern int drm_ht_insert_item(struct drm_open_hash *ht, struct drm_hash_item *item);
55 extern int drm_ht_just_insert_please(struct drm_open_hash *ht, struct drm_hash_item *item,
58 extern int drm_ht_find_item(struct drm_open_hash *ht, unsigned long key, struct drm_hash_item **item);
60 extern void drm_ht_verbose_list(struct drm_open_hash *ht, unsigned long key);
61 extern int drm_ht_remove_key(struct drm_open_hash *ht, unsigned long key);
62 extern int drm_ht_remove_item(struct drm_open_hash *ht, struct drm_hash_item *item);
63 extern void drm_ht_remove(struct drm_open_hash *ht);
|
| /src/sys/external/bsd/drm2/dist/drm/ |
| drm_hashtab.c | 50 int drm_ht_create(struct drm_open_hash *ht, unsigned int order)
54 ht->order = order;
55 ht->table = NULL;
56 if (size <= PAGE_SIZE / sizeof(*ht->table))
57 ht->table = kcalloc(size, sizeof(*ht->table), GFP_KERNEL);
59 ht->table = vzalloc(array_size(size, sizeof(*ht->table)));
60 if (!ht->table) {
68 void drm_ht_verbose_list(struct drm_open_hash *ht, unsigned long key
[all...] |
| /src/sys/external/bsd/drm2/dist/include/drm/ |
| drm_hashtab.h | 56 int drm_ht_create(struct drm_open_hash *ht, unsigned int order);
57 int drm_ht_insert_item(struct drm_open_hash *ht, struct drm_hash_item *item);
58 int drm_ht_just_insert_please(struct drm_open_hash *ht, struct drm_hash_item *item,
61 int drm_ht_find_item(struct drm_open_hash *ht, unsigned long key, struct drm_hash_item **item);
63 void drm_ht_verbose_list(struct drm_open_hash *ht, unsigned long key);
64 int drm_ht_remove_key(struct drm_open_hash *ht, unsigned long key);
65 int drm_ht_remove_item(struct drm_open_hash *ht, struct drm_hash_item *item);
66 void drm_ht_remove(struct drm_open_hash *ht);
|
| /src/external/mpl/dhcp/bind/dist/lib/isc/ |
| ht.c | 1 /* $NetBSD: ht.c,v 1.1 2024/02/18 20:57:49 christos Exp $ */
20 #include <isc/ht.h>
30 #define ISC_HT_VALID(ht) ISC_MAGIC_VALID(ht, ISC_HT_MAGIC)
38 #define TRY_NEXTTABLE(idx, ht) (idx == ht->hindex && rehashing_in_progress(ht))
65 isc_ht_t *ht; member in struct:isc_ht_iter
72 isc__ht_find(const isc_ht_t *ht, const unsigned char *key,
75 isc__ht_add(isc_ht_t *ht, const unsigned char *key, const uint32_t keysize
285 isc_ht_t *ht = NULL; local
308 isc_ht_t *ht; local
508 isc_ht_t *ht; local
520 isc_ht_t *ht; local
534 isc_ht_t *ht = it->ht; local
578 isc_ht_t *ht; local
[all...] |
| /src/external/bsd/top/dist/ |
| hash.h | 77 void hash_sizeinfo(unsigned int *sizes, int max, hash_table *ht);
87 void *hash_add_uint(hash_table *ht, unsigned int key, void *value);
88 void *hash_replace_uint(hash_table *ht, unsigned int key, void *value);
89 void *hash_lookup_uint(hash_table *ht, unsigned int key);
90 void *hash_remove_uint(hash_table *ht, unsigned int key);
91 hash_item_uint *hash_first_uint(hash_table *ht, hash_pos *pos);
101 void *hash_add_pid(hash_table *ht, pid_t key, void *value);
102 void *hash_replace_pid(hash_table *ht, pid_t key, void *value);
103 void *hash_lookup_pid(hash_table *ht, pid_t key);
104 void *hash_remove_pid(hash_table *ht, pid_t key)
[all...] |
| /src/crypto/external/cpl/trousers/dist/src/tspi/rpc/ |
| hosttable.c | 22 static struct host_table *ht = NULL; variable in typeref:struct:host_table
27 ht = calloc(1, sizeof(struct host_table));
28 if (ht == NULL) {
33 MUTEX_INIT(ht->lock);
54 MUTEX_LOCK(ht->lock);
56 for (hte = ht->entries; hte; hte = next) {
66 MUTEX_UNLOCK(ht->lock);
68 free(ht);
69 ht = NULL;
115 MUTEX_LOCK(ht->lock)
[all...] |
| /src/usr.bin/config/ |
| hash.c | 98 ht_init(struct hashtab *ht, size_t sz)
102 ht->ht_tab = emalloc(sz * sizeof (ht->ht_tab[0]));
103 ht->ht_size = sz;
104 ht->ht_mask = sz - 1;
106 TAILQ_INIT(&ht->ht_tab[n]);
107 ht->ht_used = 0;
108 ht->ht_lim = HASHFRACTION(sz);
115 ht_expand(struct hashtab *ht)
121 n = ht->ht_size * 2
209 struct hashtab *ht; local
233 struct hashtab *ht; local
[all...] |
| /src/external/mpl/bind/dist/lib/dns/ |
| badcache.c | 53 struct cds_lfht *ht; member in struct:dns_badcache
84 bcentry_alive(struct cds_lfht *ht, dns_bcentry_t *bad, isc_stdtime_t now);
97 bc->ht = cds_lfht_new(BADCACHE_INIT_SIZE, BADCACHE_MIN_SIZE, 0,
99 INSIST(bc->ht != NULL);
122 cds_lfht_for_each_entry(bc->ht, &iter, bad, ht_node) {
123 INSIST(!cds_lfht_del(bc->ht, &bad->ht_node));
126 RUNTIME_CHECK(!cds_lfht_destroy(bc->ht, NULL));
152 bcentry_lookup(struct cds_lfht *ht, uint32_t hashval, dns__bckey_t *key) {
155 cds_lfht_lookup(ht, hashval, bcentry_match, key, &iter);
205 bcentry_evict(struct cds_lfht *ht, dns_bcentry_t *bad)
268 struct cds_lfht *ht = rcu_dereference(bc->ht); local
307 struct cds_lfht *ht = rcu_dereference(bc->ht); local
339 struct cds_lfht *ht = rcu_dereference(bc->ht); local
360 struct cds_lfht *ht = rcu_dereference(bc->ht); local
386 struct cds_lfht *ht = rcu_dereference(bc->ht); local
426 struct cds_lfht *ht = rcu_dereference(bc->ht); local
[all...] |
| /src/external/lgpl2/userspace-rcu/dist/include/urcu/ |
| rculfhash.h | 131 void (*alloc_bucket_table)(struct cds_lfht *ht, unsigned long order);
132 void (*free_bucket_table)(struct cds_lfht *ht, unsigned long order);
133 struct cds_lfht_node *(*bucket_at)(struct cds_lfht *ht,
299 * @ht: the hash table to destroy.
319 int cds_lfht_destroy(struct cds_lfht *ht, pthread_attr_t **attr);
323 * @ht: the hash table.
332 void cds_lfht_count_nodes(struct cds_lfht *ht,
339 * @ht: the hash table.
350 void cds_lfht_lookup(struct cds_lfht *ht, unsigned long hash,
356 * @ht: the hash table
[all...] |
| /src/external/mpl/bind/dist/tests/isc/ |
| ht_test.c | 29 #include <isc/ht.h>
39 #include "ht.c"
44 isc_ht_t *ht = NULL; local
48 isc_ht_init(&ht, mctx, init_bits, ISC_HT_CASE_SENSITIVE);
49 assert_non_null(ht);
59 result = isc_ht_add(ht, key, 16, (void *)i);
68 result = isc_ht_find(ht, key, 16, &f);
77 result = isc_ht_add(ht, key, 16, (void *)i);
89 result = isc_ht_add(ht, (const unsigned char *)key, strlen(key),
102 result = isc_ht_find(ht, key, 16, &f)
184 isc_ht_t *ht = NULL; local
336 isc_ht_t *ht = NULL; local
[all...] |
| /src/external/cddl/dtracetoolkit/dist/Bin/ |
| zvmstat | 10 # USAGE: zvmstat [-ht] [interval [count]]
79 while getopts ht name
84 USAGE: zvmstat [-ht] [interval [count]]
|
| /src/external/cddl/dtracetoolkit/dist/Zones/ |
| zvmstat | 10 # USAGE: zvmstat [-ht] [interval [count]]
79 while getopts ht name
84 USAGE: zvmstat [-ht] [interval [count]]
|
| /src/external/lgpl2/userspace-rcu/dist/doc/examples/rculfhash/ |
| cds_lfht_destroy.c | 40 struct cds_lfht *ht; /* Hash table */ local
60 ht = cds_lfht_new_flavor(1, 1, 0,
63 if (!ht) {
92 cds_lfht_add(ht, hash, &node->node);
103 cds_lfht_for_each_entry(ht, &iter, node, node) {
115 cds_lfht_for_each_entry(ht, &iter, node, node) {
117 ret = cds_lfht_del(ht, ht_node);
135 ret = cds_lfht_destroy(ht, NULL);
|
| /src/external/gpl3/gcc/dist/libcpp/include/ |
| symtab.h | 41 typedef struct ht cpp_hash_table;
47 struct ht struct
84 inline hashnode ht_lookup (cpp_hash_table *ht, const ht_identifier &id,
87 return ht_lookup_with_hash (ht, id.str, id.len, id.hash_value, opt);
104 extern void ht_load (cpp_hash_table *ht, hashnode *entries,
|
