Home
last modified time | relevance | path

Searched refs:buckets (Results 1 - 25 of 231) sorted by relevance

12345678910

/third_party/node/deps/cares/src/lib/
H A Dares__htable.c45 /* NOTE: if we converted buckets into ares__slist_t we could guarantee on
51 ares__llist_t **buckets; member
68 static void ares__htable_buckets_destroy(ares__llist_t **buckets, in ares__htable_buckets_destroy() argument
74 if (buckets == NULL) { in ares__htable_buckets_destroy()
79 if (buckets[i] == NULL) { in ares__htable_buckets_destroy()
84 ares__llist_replace_destructor(buckets[i], NULL); in ares__htable_buckets_destroy()
87 ares__llist_destroy(buckets[i]); in ares__htable_buckets_destroy()
90 ares_free(buckets); in ares__htable_buckets_destroy()
98 ares__htable_buckets_destroy(htable->buckets, htable->size, ARES_TRUE); in ares__htable_destroy()
125 htable->buckets in ares__htable_create()
191 ares__llist_t **buckets = NULL; ares__htable_expand() local
[all...]
/third_party/rust/crates/aho-corasick/src/packed/teddy/
H A Dcompile.rs19 /// slim Teddy is used (8 buckets) and `true` means fat Teddy is used
20 /// (16 buckets). Fat Teddy requires AVX2, so if that CPU feature isn't
54 /// 16 buckets where as Slim Teddy uses 8 buckets. More buckets are useful
115 let Compiler { buckets, masks, .. } = compiler; in build_imp()
122 buckets, in build_imp()
131 buckets, in build_imp()
140 buckets, in build_imp()
149 buckets, in build_imp()
300 let mut buckets = vec![vec![]; self.buckets.len()]; fmt() variables
[all...]
/kernel/linux/linux-5.10/drivers/net/ethernet/mellanox/mlx5/core/steering/
H A Ddr_icm_pool.c43 struct mlx5dr_icm_bucket *buckets; member
335 hot_size += pool->buckets[chunk_order].hot_list_count * in dr_icm_hot_mem_size()
376 bool buckets[DR_CHUNK_SIZE_MAX]) in dr_icm_chill_buckets_start()
382 bucket = &pool->buckets[i]; in dr_icm_chill_buckets_start()
393 buckets[i] = true; in dr_icm_chill_buckets_start()
400 bool buckets[DR_CHUNK_SIZE_MAX]) in dr_icm_chill_buckets_end()
406 bucket = &pool->buckets[i]; in dr_icm_chill_buckets_end()
412 if (!buckets[i]) in dr_icm_chill_buckets_end()
422 bool buckets[DR_CHUNK_SIZE_MAX]) in dr_icm_chill_buckets_abort()
428 bucket = &pool->buckets[ in dr_icm_chill_buckets_abort()
374 dr_icm_chill_buckets_start(struct mlx5dr_icm_pool *pool, struct mlx5dr_icm_bucket *cb, bool buckets[DR_CHUNK_SIZE_MAX]) dr_icm_chill_buckets_start() argument
398 dr_icm_chill_buckets_end(struct mlx5dr_icm_pool *pool, struct mlx5dr_icm_bucket *cb, bool buckets[DR_CHUNK_SIZE_MAX]) dr_icm_chill_buckets_end() argument
420 dr_icm_chill_buckets_abort(struct mlx5dr_icm_pool *pool, struct mlx5dr_icm_bucket *cb, bool buckets[DR_CHUNK_SIZE_MAX]) dr_icm_chill_buckets_abort() argument
450 bool buckets[DR_CHUNK_SIZE_MAX] = {}; mlx5dr_icm_alloc_chunk() local
[all...]
/third_party/libdrm/
H A Dxf86drmHash.c126 for (bucket = table->buckets[i]; bucket;) { in drmHashDestroy()
148 for (bucket = table->buckets[hash]; bucket; bucket = bucket->next) { in HashFind()
153 bucket->next = table->buckets[hash]; in HashFind()
154 table->buckets[hash] = bucket; in HashFind()
194 bucket->next = table->buckets[hash]; in drmHashInsert()
195 table->buckets[hash] = bucket; in drmHashInsert()
211 table->buckets[hash] = bucket->next; in drmHashDelete()
227 table->p1 = table->buckets[table->p0]; in drmHashNext()
240 table->p1 = table->buckets[0]; in drmHashFirst()
/third_party/python/Python/
H A Dhashtable.c58 ((_Py_hashtable_entry_t *)_Py_SLIST_HEAD(&(HT)->buckets[BUCKET]))
105 /* makes sure the real size of the buckets array is a power of 2 */
123 /* buckets */ in _Py_hashtable_size()
193 _Py_slist_remove(&ht->buckets[index], (_Py_slist_item_t *)previous, in _Py_hashtable_steal()
242 _Py_slist_prepend(&ht->buckets[index], (_Py_slist_item_t*)entry); in _Py_hashtable_set()
287 size_t buckets_size = new_size * sizeof(ht->buckets[0]); in hashtable_rehash()
296 _Py_hashtable_entry_t *entry = BUCKETS_HEAD(ht->buckets[bucket]); in hashtable_rehash()
308 ht->alloc.free(ht->buckets); in hashtable_rehash()
310 ht->buckets = new_buckets; in hashtable_rehash()
339 size_t buckets_size = ht->nbuckets * sizeof(ht->buckets[ in _Py_hashtable_new_full()
[all...]
/third_party/node/deps/v8/src/heap/
H A Dslot-set.h26 // Possibly empty buckets (buckets that do not contain any slots) are discovered
28 // or in another thread, so all those buckets need to be revisited.
29 // Track possibly empty buckets within a SlotSet in this data structure. The
58 void Insert(size_t bucket_index, size_t buckets) { in Insert() argument
64 Allocate(buckets); in Insert()
92 void Allocate(size_t buckets) { in Allocate() argument
94 size_t words = WordsForBuckets(buckets); in Allocate()
113 static size_t WordsForBuckets(size_t buckets) { in WordsForBuckets() argument
114 return (buckets in WordsForBuckets()
142 Allocate(size_t buckets) Allocate() argument
171 Delete(SlotSet* slot_set, size_t buckets) Delete() argument
254 RemoveRange(size_t start_offset, size_t end_offset, size_t buckets, EmptyBucketMode mode) RemoveRange() argument
369 FreeEmptyBuckets(size_t buckets) FreeEmptyBuckets() argument
382 CheckPossiblyEmptyBuckets(size_t buckets, PossiblyEmptyBuckets* possibly_empty_buckets) CheckPossiblyEmptyBuckets() argument
591 Bucket** buckets() { return reinterpret_cast<Bucket**>(this); } buckets() function
[all...]
/kernel/linux/linux-5.10/drivers/s390/scsi/
H A Dzfcp_reqlist.h14 /* number of hash buckets */
20 * @buckets: Array of hashbuckets, each is a list of requests in this bucket
24 struct list_head buckets[ZFCP_REQ_LIST_BUCKETS]; member
50 INIT_LIST_HEAD(&rl->buckets[i]); in zfcp_reqlist_alloc()
66 if (!list_empty(&rl->buckets[i])) in zfcp_reqlist_isempty()
90 list_for_each_entry(req, &rl->buckets[i], list) in _zfcp_reqlist_find()
163 list_add_tail(&req->list, &rl->buckets[i]); in zfcp_reqlist_add()
180 list_splice_init(&rl->buckets[i], list); in zfcp_reqlist_move()
207 list_for_each_entry(req, &rl->buckets[i], list) in zfcp_reqlist_apply_for_all()
/kernel/linux/linux-6.6/drivers/s390/scsi/
H A Dzfcp_reqlist.h16 /* number of hash buckets */
22 * @buckets: Array of hashbuckets, each is a list of requests in this bucket
26 struct list_head buckets[ZFCP_REQ_LIST_BUCKETS]; member
52 INIT_LIST_HEAD(&rl->buckets[i]); in zfcp_reqlist_alloc()
68 if (!list_empty(&rl->buckets[i])) in zfcp_reqlist_isempty()
92 list_for_each_entry(req, &rl->buckets[i], list) in _zfcp_reqlist_find()
165 list_add_tail(&req->list, &rl->buckets[i]); in zfcp_reqlist_add()
182 list_splice_init(&rl->buckets[i], list); in zfcp_reqlist_move()
209 list_for_each_entry(req, &rl->buckets[i], list) in zfcp_reqlist_apply_for_all()
/kernel/linux/linux-5.10/tools/lib/bpf/
H A Dhashmap.h57 struct hashmap_entry **buckets; member
67 .buckets = NULL, \
157 for (cur = map->buckets[bkt]; cur; cur = cur->next)
169 for (cur = map->buckets[bkt]; \
180 for (cur = map->buckets \
181 ? map->buckets[hash_bits(map->hash_fn((_key), map->ctx), map->cap_bits)] \
188 for (cur = map->buckets \
189 ? map->buckets[hash_bits(map->hash_fn((_key), map->ctx), map->cap_bits)] \
H A Dhashmap.c21 /* start with 4 buckets */
45 map->buckets = NULL; in hashmap__init()
71 free(map->buckets); in hashmap__clear()
72 map->buckets = NULL; in hashmap__clear()
124 free(map->buckets); in hashmap_grow()
125 map->buckets = new_buckets; in hashmap_grow()
137 if (!map->buckets) in hashmap_find_entry()
140 for (prev_ptr = &map->buckets[hash], cur = *prev_ptr; in hashmap_find_entry()
200 hashmap_add_entry(&map->buckets[h], entry); in hashmap__insert()
/kernel/linux/linux-5.10/tools/perf/util/
H A Dhashmap.h57 struct hashmap_entry **buckets; member
67 .buckets = NULL, \
157 for (cur = map->buckets[bkt]; cur; cur = cur->next)
169 for (cur = map->buckets[bkt]; \
180 for (cur = map->buckets \
181 ? map->buckets[hash_bits(map->hash_fn((_key), map->ctx), map->cap_bits)] \
188 for (cur = map->buckets \
189 ? map->buckets[hash_bits(map->hash_fn((_key), map->ctx), map->cap_bits)] \
H A Dhashmap.c21 /* start with 4 buckets */
45 map->buckets = NULL; in hashmap__init()
71 free(map->buckets); in hashmap__clear()
72 map->buckets = NULL; in hashmap__clear()
124 free(map->buckets); in hashmap_grow()
125 map->buckets = new_buckets; in hashmap_grow()
137 if (!map->buckets) in hashmap_find_entry()
140 for (prev_ptr = &map->buckets[hash], cur = *prev_ptr; in hashmap_find_entry()
200 hashmap_add_entry(&map->buckets[h], entry); in hashmap__insert()
/third_party/mesa3d/src/virtio/vulkan/
H A Dvn_renderer_internal.c17 static_assert(ARRAY_SIZE(cache->buckets) <= 32, ""); in vn_renderer_shmem_cache_init()
24 for (uint32_t i = 0; i < ARRAY_SIZE(cache->buckets); i++) { in vn_renderer_shmem_cache_init()
25 struct vn_renderer_shmem_bucket *bucket = &cache->buckets[i]; in vn_renderer_shmem_cache_init()
40 struct vn_renderer_shmem_bucket *bucket = &cache->buckets[idx]; in vn_renderer_shmem_cache_fini()
60 if (unlikely(idx >= ARRAY_SIZE(cache->buckets))) in choose_bucket()
64 return &cache->buckets[idx]; in choose_bucket()
74 struct vn_renderer_shmem_bucket *bucket = &cache->buckets[idx]; in vn_renderer_shmem_cache_remove_expired_locked()
170 const struct vn_renderer_shmem_bucket *bucket = &cache->buckets[idx]; in vn_renderer_shmem_cache_debug_dump()
176 vn_log(NULL, " buckets[%d]: %d shmems", idx, count); in vn_renderer_shmem_cache_debug_dump()
/third_party/icu/icu4j/main/classes/collate/src/com/ibm/icu/text/
H A DAlphabeticIndex.java48 * The class also supports having buckets for strings before the first (underflow),
70 * // Show index at top. We could skip or gray out empty buckets
78 * // Show the buckets with their contents, skipping empty buckets
90 * if its bucket is empty. Small buckets could also be combined based on size, such as:
102 * they "lazily" build the index buckets.
105 * buckets and their labels and label types.
128 * Prefix string for Chinese index buckets.
156 private BucketList<V> buckets; field in AlphabeticIndex
165 * and random access to buckets an
173 private final BucketList<V> buckets; global() field in AlphabeticIndex.ImmutableIndex
[all...]
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/text/
H A DAlphabeticIndex.java49 * The class also supports having buckets for strings before the first (underflow),
71 * // Show index at top. We could skip or gray out empty buckets
79 * // Show the buckets with their contents, skipping empty buckets
91 * if its bucket is empty. Small buckets could also be combined based on size, such as:
103 * they "lazily" build the index buckets.
106 * buckets and their labels and label types.
128 * Prefix string for Chinese index buckets.
156 private BucketList<V> buckets; field in AlphabeticIndex
165 * and random access to buckets an
172 private final BucketList<V> buckets; global() field in AlphabeticIndex.ImmutableIndex
[all...]
/third_party/mesa3d/src/glx/
H A Dglxhash.c121 __glxHashBucketPtr buckets[HASH_SIZE]; member
171 table->buckets[i] = NULL; in __glxHashCreate()
187 for (bucket = table->buckets[i]; bucket;) { in __glxHashDestroy()
210 for (bucket = table->buckets[hash]; bucket; bucket = bucket->next) { in HashFind()
215 bucket->next = table->buckets[hash]; in HashFind()
216 table->buckets[hash] = bucket; in HashFind()
264 bucket->next = table->buckets[hash]; in __glxHashInsert()
265 table->buckets[hash] = bucket; in __glxHashInsert()
287 table->buckets[hash] = bucket->next; in __glxHashDelete()
304 table->p1 = table->buckets[tabl in __glxHashNext()
[all...]
/third_party/mesa3d/src/gallium/auxiliary/pipebuffer/
H A Dpb_bufmgr_slab.c157 struct pb_manager **buckets; member
492 return mgr->buckets[i]->create_buffer(mgr->buckets[i], size, desc); in pb_slab_range_manager_create_buffer()
521 mgr->buckets[i]->destroy(mgr->buckets[i]); in pb_slab_range_manager_destroy()
522 FREE(mgr->buckets); in pb_slab_range_manager_destroy()
561 mgr->buckets = CALLOC(mgr->numBuckets, sizeof(*mgr->buckets)); in pb_slab_range_manager_create()
562 if (!mgr->buckets) in pb_slab_range_manager_create()
567 mgr->buckets[ in pb_slab_range_manager_create()
[all...]
/kernel/linux/linux-6.6/tools/lib/bpf/
H A Dhashmap.h77 struct hashmap_entry **buckets; member
170 for (cur = map->buckets[bkt]; cur; cur = cur->next)
182 for (cur = map->buckets[bkt]; \
193 for (cur = map->buckets \
194 ? map->buckets[hash_bits(map->hash_fn((_key), map->ctx), map->cap_bits)] \
201 for (cur = map->buckets \
202 ? map->buckets[hash_bits(map->hash_fn((_key), map->ctx), map->cap_bits)] \
H A Dhashmap.c21 /* start with 4 buckets */
45 map->buckets = NULL; in hashmap__init()
71 free(map->buckets); in hashmap__clear()
72 map->buckets = NULL; in hashmap__clear()
124 free(map->buckets); in hashmap_grow()
125 map->buckets = new_buckets; in hashmap_grow()
137 if (!map->buckets) in hashmap_find_entry()
140 for (prev_ptr = &map->buckets[hash], cur = *prev_ptr; in hashmap_find_entry()
200 hashmap_add_entry(&map->buckets[h], entry); in hashmap_insert()
/kernel/linux/linux-6.6/tools/perf/util/
H A Dhashmap.h77 struct hashmap_entry **buckets; member
170 for (cur = map->buckets[bkt]; cur; cur = cur->next)
182 for (cur = map->buckets[bkt]; \
193 for (cur = map->buckets \
194 ? map->buckets[hash_bits(map->hash_fn((_key), map->ctx), map->cap_bits)] \
201 for (cur = map->buckets \
202 ? map->buckets[hash_bits(map->hash_fn((_key), map->ctx), map->cap_bits)] \
H A Dhashmap.c21 /* start with 4 buckets */
45 map->buckets = NULL; in hashmap__init()
71 free(map->buckets); in hashmap__clear()
72 map->buckets = NULL; in hashmap__clear()
124 free(map->buckets); in hashmap_grow()
125 map->buckets = new_buckets; in hashmap_grow()
137 if (!map->buckets) in hashmap_find_entry()
140 for (prev_ptr = &map->buckets[hash], cur = *prev_ptr; in hashmap_find_entry()
200 hashmap_add_entry(&map->buckets[h], entry); in hashmap_insert()
/third_party/libbpf/src/
H A Dhashmap.h77 struct hashmap_entry **buckets; member
170 for (cur = map->buckets[bkt]; cur; cur = cur->next)
182 for (cur = map->buckets[bkt]; \
193 for (cur = map->buckets \
194 ? map->buckets[hash_bits(map->hash_fn((_key), map->ctx), map->cap_bits)] \
201 for (cur = map->buckets \
202 ? map->buckets[hash_bits(map->hash_fn((_key), map->ctx), map->cap_bits)] \
/third_party/rust/crates/aho-corasick/src/packed/
H A Drabinkarp.rs9 /// The number of buckets to store our patterns in. We don't want this to be
13 /// The number of buckets MUST be a power of two. Otherwise, determining the
29 /// several buckets to hopefully make the confirmation step faster.
45 buckets: Vec<Vec<(Hash, PatternID)>>,
80 buckets: vec![vec![]; NUM_BUCKETS], in new()
88 rk.buckets[bucket].push((hash, id)); in new()
101 assert_eq!(NUM_BUCKETS, self.buckets.len()); in find_at()
113 let bucket = &self.buckets[hash % NUM_BUCKETS]; in find_at()
137 self.buckets.len() * mem::size_of::<Vec<(Hash, PatternID)>>() in heap_bytes()
/kernel/linux/linux-5.10/block/
H A Dblk-stat.c86 for (bucket = 0; bucket < cb->buckets; bucket++) in blk_stat_timer_fn()
93 for (bucket = 0; bucket < cb->buckets; bucket++) { in blk_stat_timer_fn()
105 unsigned int buckets, void *data) in blk_stat_alloc_callback()
113 cb->stat = kmalloc_array(buckets, sizeof(struct blk_rq_stat), in blk_stat_alloc_callback()
119 cb->cpu_stat = __alloc_percpu(buckets * sizeof(struct blk_rq_stat), in blk_stat_alloc_callback()
130 cb->buckets = buckets; in blk_stat_alloc_callback()
147 for (bucket = 0; bucket < cb->buckets; bucket++) in blk_stat_add_callback()
103 blk_stat_alloc_callback(void (*timer_fn)(struct blk_stat_callback *), int (*bucket_fn)(const struct request *), unsigned int buckets, void *data) blk_stat_alloc_callback() argument
/kernel/linux/linux-6.6/block/
H A Dblk-stat.c86 for (bucket = 0; bucket < cb->buckets; bucket++) in blk_stat_timer_fn()
93 for (bucket = 0; bucket < cb->buckets; bucket++) { in blk_stat_timer_fn()
105 unsigned int buckets, void *data) in blk_stat_alloc_callback()
113 cb->stat = kmalloc_array(buckets, sizeof(struct blk_rq_stat), in blk_stat_alloc_callback()
119 cb->cpu_stat = __alloc_percpu(buckets * sizeof(struct blk_rq_stat), in blk_stat_alloc_callback()
130 cb->buckets = buckets; in blk_stat_alloc_callback()
147 for (bucket = 0; bucket < cb->buckets; bucket++) in blk_stat_add_callback()
103 blk_stat_alloc_callback(void (*timer_fn)(struct blk_stat_callback *), int (*bucket_fn)(const struct request *), unsigned int buckets, void *data) blk_stat_alloc_callback() argument

Completed in 14 milliseconds

12345678910