/kernel/linux/linux-5.10/net/openvswitch/ |
H A D | flow_table.c | 147 kvfree(ti->buckets); in __table_instance_destroy() 159 ti->buckets = kvmalloc_array(new_size, sizeof(struct hlist_head), in table_instance_alloc() 161 if (!ti->buckets) { in table_instance_alloc() 167 INIT_HLIST_HEAD(&ti->buckets[i]); in table_instance_alloc() 485 struct hlist_head *head = &ti->buckets[i]; in table_instance_flow_flush() 538 head = &ti->buckets[*bucket]; in ovs_flow_tbl_dump_next() 557 return &ti->buckets[hash & (ti->n_buckets - 1)]; in find_bucket() 590 struct hlist_head *head = &old->buckets[i]; in flow_table_copy_flows()
|
/kernel/linux/linux-5.10/drivers/message/fusion/ |
H A D | mptlan.c | 92 atomic_t buckets_out; /* number of unused buckets on IOC */ 106 int max_buckets_out; /* Max buckets to send to IOC */ 462 any buckets it still has. */ 506 dlprintk((KERN_INFO MYNAM ":lan_close: Posted %d buckets " in mpt_lan_close() 834 dioprintk((MYNAM "/receive_skb: %d buckets remaining\n", in mpt_lan_receive_skb() 840 dioprintk((KERN_INFO MYNAM "/receive_post_reply: %d buckets " in mpt_lan_receive_skb() 918 "IOC returned %d buckets, freeing them...\n", count)); in mpt_lan_receive_post_free() 948 /* dlprintk((KERN_INFO MYNAM "/receive_post_reply: freed %d buckets\n", in mpt_lan_receive_post_free() 951 /**/ dlprintk((KERN_INFO MYNAM "@receive_post_reply: %d buckets " in mpt_lan_receive_post_free() 1008 // dioprintk((KERN_INFO MYNAM ": %s/%s: Multiple buckets returne in mpt_lan_receive_post_reply() 1149 u32 curr, buckets, count, max; mpt_lan_post_receive_buckets() local [all...] |
/kernel/linux/linux-6.6/drivers/message/fusion/ |
H A D | mptlan.c | 89 atomic_t buckets_out; /* number of unused buckets on IOC */ 103 int max_buckets_out; /* Max buckets to send to IOC */ 459 any buckets it still has. */ 503 dlprintk((KERN_INFO MYNAM ":lan_close: Posted %d buckets " in mpt_lan_close() 832 dioprintk((MYNAM "/receive_skb: %d buckets remaining\n", in mpt_lan_receive_skb() 838 dioprintk((KERN_INFO MYNAM "/receive_post_reply: %d buckets " in mpt_lan_receive_skb() 920 "IOC returned %d buckets, freeing them...\n", count)); in mpt_lan_receive_post_free() 950 /* dlprintk((KERN_INFO MYNAM "/receive_post_reply: freed %d buckets\n", in mpt_lan_receive_post_free() 953 /**/ dlprintk((KERN_INFO MYNAM "@receive_post_reply: %d buckets " in mpt_lan_receive_post_free() 1010 // dioprintk((KERN_INFO MYNAM ": %s/%s: Multiple buckets returne in mpt_lan_receive_post_reply() 1151 u32 curr, buckets, count, max; mpt_lan_post_receive_buckets() local [all...] |
/kernel/linux/linux-6.6/net/openvswitch/ |
H A D | flow_table.c | 148 kvfree(ti->buckets); in __table_instance_destroy() 160 ti->buckets = kvmalloc_array(new_size, sizeof(struct hlist_head), in table_instance_alloc() 162 if (!ti->buckets) { in table_instance_alloc() 168 INIT_HLIST_HEAD(&ti->buckets[i]); in table_instance_alloc() 486 struct hlist_head *head = &ti->buckets[i]; in table_instance_flow_flush() 539 head = &ti->buckets[*bucket]; in ovs_flow_tbl_dump_next() 558 return &ti->buckets[hash & (ti->n_buckets - 1)]; in find_bucket() 591 struct hlist_head *head = &old->buckets[i]; in flow_table_copy_flows()
|
/kernel/linux/linux-5.10/kernel/bpf/ |
H A D | hashtab.c | 91 struct bucket *buckets; member 99 u32 n_buckets; /* number of hash buckets */ 140 INIT_HLIST_NULLS_HEAD(&htab->buckets[i].head, i); in htab_init_buckets() 142 raw_spin_lock_init(&htab->buckets[i].raw_lock); in htab_init_buckets() 144 spin_lock_init(&htab->buckets[i].lock); in htab_init_buckets() 481 htab->buckets = bpf_map_area_alloc(htab->n_buckets * in htab_map_alloc() 484 if (!htab->buckets) in htab_map_alloc() 514 bpf_map_area_free(htab->buckets); in htab_map_alloc() 529 return &htab->buckets[hash & (htab->n_buckets - 1)]; in __select_bucket() 753 /* iterate over buckets */ in htab_map_get_next_key() [all...] |
/foundation/distributeddatamgr/relational_store/frameworks/native/rdb/src/ |
H A D | sqlite_sql_builder.cpp | 301 SqliteSqlBuilder::BatchRefSqls SqliteSqlBuilder::GenerateSqls(const std::string &table, const ValuesBuckets &buckets, in GenerateSqls() argument 304 auto [fields, values] = buckets.GetFieldsAndValues(); in GenerateSqls() 306 auto rowSize = buckets.RowSize(); in GenerateSqls() 313 auto [errorCode, value] = buckets.Get(row, std::ref(field)); in GenerateSqls()
|
/kernel/linux/linux-5.10/drivers/md/bcache/ |
H A D | bcache.h | 42 * To do this, we first divide the cache device up into buckets. A bucket is the 47 * it. The gens and priorities for all the buckets are stored contiguously and 48 * packed on disk (in a linked list of buckets - aside from the superblock, all 49 * of bcache's metadata is stored in buckets). 56 * The generation is used for invalidating buckets. Each pointer also has an 8 62 * Bcache is entirely COW - we never write twice to a bucket, even buckets that 113 * (If buckets are really big we'll only use part of the bucket for a btree node 143 * Thus, the primary purpose of garbage collection is to find buckets to reuse. 145 * allocation can reuse buckets sooner when they've been mostly overwritten. 424 * When allocating new buckets, prio_writ 448 struct bucket *buckets; global() member [all...] |
/kernel/linux/linux-6.6/drivers/md/bcache/ |
H A D | bcache.h | 42 * To do this, we first divide the cache device up into buckets. A bucket is the 47 * it. The gens and priorities for all the buckets are stored contiguously and 48 * packed on disk (in a linked list of buckets - aside from the superblock, all 49 * of bcache's metadata is stored in buckets). 56 * The generation is used for invalidating buckets. Each pointer also has an 8 62 * Bcache is entirely COW - we never write twice to a bucket, even buckets that 113 * (If buckets are really big we'll only use part of the bucket for a btree node 143 * Thus, the primary purpose of garbage collection is to find buckets to reuse. 145 * allocation can reuse buckets sooner when they've been mostly overwritten. 432 * When allocating new buckets, prio_writ 456 struct bucket *buckets; global() member [all...] |
/third_party/node/deps/v8/src/logging/ |
H A D | counters.h | 70 // sample values. buckets is the maximum number of buckets 72 void* CreateHistogram(const char* name, int min, int max, size_t buckets) { in CreateHistogram() argument 74 return create_histogram_function_(name, min, max, buckets); in CreateHistogram() 630 void* CreateHistogram(const char* name, int min, int max, size_t buckets) { in CreateHistogram() argument 631 return stats_table_.CreateHistogram(name, min, max, buckets); in CreateHistogram()
|
/foundation/distributeddatamgr/datamgr_service/services/distributeddataservice/rust/extension/ |
H A D | extension_util.h | 54 static std::pair<OhCloudExtVector *, size_t> Convert(DBVBuckets &&buckets);
|
/kernel/linux/linux-6.6/drivers/net/ethernet/mellanox/mlx5/core/lag/ |
H A D | lag.h | 61 u8 buckets; member
|
/third_party/python/Include/internal/ |
H A D | pycore_hashtable.h | 29 /* used by _Py_hashtable_t.buckets to link entries */ 63 _Py_slist_t *buckets; member
|
/third_party/elfio/elfio/ |
H A D | elfio_symbols.hpp | 363 auto* buckets = in gnu_hash_lookup() local 371 if ( convertor( buckets[bucket] ) >= symoffset ) { in gnu_hash_lookup() 372 uint32_t chain_index = convertor( buckets[bucket] ) - symoffset; in gnu_hash_lookup()
|
/third_party/node/deps/brotli/c/enc/ |
H A D | static_dict.c | 82 size_t offset = dictionary->buckets[Hash(data)]; in BrotliFindAllStaticDictionaryMatches() 327 size_t offset = dictionary->buckets[Hash(&data[1])]; in BrotliFindAllStaticDictionaryMatches() 422 size_t offset = dictionary->buckets[Hash(&data[2])]; in BrotliFindAllStaticDictionaryMatches() 451 size_t offset = dictionary->buckets[Hash(&data[5])]; in BrotliFindAllStaticDictionaryMatches()
|
H A D | hash_longest_match_inc.h | 32 /* Number of hash buckets. */ 167 uint32_t* BROTLI_RESTRICT buckets = self->buckets_; in FindLongestMatch() local 218 uint32_t* BROTLI_RESTRICT bucket = &buckets[key << self->block_bits_]; in FindLongestMatch()
|
/third_party/node/deps/v8/src/heap/ |
H A D | memory-chunk.cc | 279 SlotSet* new_slot_set = SlotSet::Allocate(buckets()); in AllocateSlotSet() 283 SlotSet::Delete(new_slot_set, buckets()); in AllocateSlotSet() 304 SlotSet::Delete(*slot_set, buckets()); in ReleaseSlotSet()
|
/third_party/mesa3d/src/panfrost/lib/ |
H A D | pan_bo.c | 178 return &dev->bo_cache.buckets[pan_bucket_index(size)]; in pan_bucket() 313 for (unsigned i = 0; i < ARRAY_SIZE(dev->bo_cache.buckets); ++i) { in panfrost_bo_cache_evict_all() 314 struct list_head *bucket = &dev->bo_cache.buckets[i]; in panfrost_bo_cache_evict_all()
|
/third_party/skia/third_party/externals/brotli/c/enc/ |
H A D | static_dict.c | 82 size_t offset = dictionary->buckets[Hash(data)]; in BrotliFindAllStaticDictionaryMatches() 327 size_t offset = dictionary->buckets[Hash(&data[1])]; in BrotliFindAllStaticDictionaryMatches() 422 size_t offset = dictionary->buckets[Hash(&data[2])]; in BrotliFindAllStaticDictionaryMatches() 451 size_t offset = dictionary->buckets[Hash(&data[5])]; in BrotliFindAllStaticDictionaryMatches()
|
H A D | hash_longest_match_inc.h | 32 /* Number of hash buckets. */ 167 uint32_t* BROTLI_RESTRICT buckets = self->buckets_; in FindLongestMatch() local 218 uint32_t* BROTLI_RESTRICT bucket = &buckets[key << self->block_bits_]; in FindLongestMatch()
|
/kernel/linux/linux-6.6/kernel/bpf/ |
H A D | hashtab.c | 90 struct bucket *buckets; member 103 u32 n_buckets; /* number of hash buckets */ 141 INIT_HLIST_NULLS_HEAD(&htab->buckets[i].head, i); in htab_init_buckets() 142 raw_spin_lock_init(&htab->buckets[i].raw_lock); in htab_init_buckets() 143 lockdep_set_class(&htab->buckets[i].raw_lock, in htab_init_buckets() 526 htab->buckets = bpf_map_area_alloc(htab->n_buckets * in htab_map_alloc() 529 if (!htab->buckets) in htab_map_alloc() 605 bpf_map_area_free(htab->buckets); in htab_map_alloc() 625 return &htab->buckets[hash & (htab->n_buckets - 1)]; in __select_bucket() 871 /* iterate over buckets */ in htab_map_get_next_key() [all...] |
/kernel/linux/linux-5.10/drivers/md/ |
H A D | dm-cache-policy-smq.c | 576 unsigned *buckets; member 591 ht->buckets = vmalloc(array_size(nr_buckets, sizeof(*ht->buckets))); in h_init() 592 if (!ht->buckets) in h_init() 596 ht->buckets[i] = INDEXER_NULL; in h_init() 603 vfree(ht->buckets); in h_exit() 608 return to_entry(ht->es, ht->buckets[bucket]); in h_head() 618 e->hash_next = ht->buckets[bucket]; in __h_insert() 619 ht->buckets[bucket] = to_index(ht->es, e); in __h_insert() 650 ht->buckets[ in __h_unlink() [all...] |
/kernel/linux/linux-6.6/drivers/md/ |
H A D | dm-cache-policy-smq.c | 578 unsigned int *buckets; member 593 ht->buckets = vmalloc(array_size(nr_buckets, sizeof(*ht->buckets))); in h_init() 594 if (!ht->buckets) in h_init() 598 ht->buckets[i] = INDEXER_NULL; in h_init() 605 vfree(ht->buckets); in h_exit() 610 return to_entry(ht->es, ht->buckets[bucket]); in h_head() 620 e->hash_next = ht->buckets[bucket]; in __h_insert() 621 ht->buckets[bucket] = to_index(ht->es, e); in __h_insert() 653 ht->buckets[ in __h_unlink() [all...] |
/third_party/mesa3d/src/gallium/drivers/iris/ |
H A D | iris_bufmgr.c | 312 * was queried instead of iterating the size through all the buckets. 347 struct bo_cache_bucket *buckets; in bucket_for_size() local 348 bucket_info_for_heap(bufmgr, heap, &buckets, &num_buckets); in bucket_for_size() 350 return (index < *num_buckets) ? &buckets[index] : NULL; in bucket_for_size() 2108 struct bo_cache_bucket *buckets; in add_bucket() local 2109 bucket_info_for_heap(bufmgr, heap, &buckets, &num_buckets); in add_bucket() 2113 list_inithead(&buckets[i].head); in add_bucket() 2114 buckets[i].size = size; in add_bucket() 2116 assert(bucket_for_size(bufmgr, size, heap) == &buckets[i]); in add_bucket() 2117 assert(bucket_for_size(bufmgr, size - 2048, heap) == &buckets[ in add_bucket() [all...] |
/third_party/node/deps/npm/node_modules/cacache/lib/ |
H A D | entry-index.js | 184 const buckets = await readdirOrEmpty(indexDir) 185 await Promise.all(buckets.map(async (bucket) => {
|
/kernel/linux/linux-6.6/kernel/trace/ |
H A D | ftrace.c | 1060 .buckets = (struct hlist_head *)empty_buckets, 1146 hhd = &hash->buckets[key]; in __ftrace_lookup_ip() 1181 hhd = &hash->buckets[key]; in __add_hash_entry() 1230 hhd = &hash->buckets[i]; in ftrace_hash_clear() 1264 kfree(hash->buckets); in free_ftrace_hash() 1305 hash->buckets = kcalloc(size, sizeof(*hash->buckets), GFP_KERNEL); in alloc_ftrace_hash() 1307 if (!hash->buckets) { in alloc_ftrace_hash() 1368 hlist_for_each_entry(entry, &hash->buckets[i], hlist) { in alloc_and_copy_ftrace_hash() 1418 hhd = &src->buckets[ in dup_hash() [all...] |