/linux-master/include/net/netns/ |
H A D | unix.h | 12 struct hlist_head *buckets; member in struct:unix_table
|
/linux-master/fs/bcachefs/ |
H A D | journal_sb.h | 9 ? (__le64 *) vstruct_end(&j->field) - j->buckets
|
H A D | movinggc.c | 14 #include "buckets.h" 144 move_buckets *buckets) 179 ret2 = darray_push(buckets, b); 185 ret2 = buckets->nr >= nr_to_get; 190 pr_debug("have: %zu (%zu) saw %zu in flight %zu not movable %zu got %zu (%zu)/%zu buckets ret %i", 192 saw, in_flight, not_movable, buckets->nr, sectors, nr_to_get, ret); 207 move_buckets buckets = { 0 }; local 212 ret = bch2_copygc_get_buckets(ctxt, buckets_in_flight, &buckets); 216 darray_for_each(buckets, i) { 239 darray_exit(&buckets); 142 bch2_copygc_get_buckets(struct moving_context *ctxt, struct buckets_in_flight *buckets_in_flight, move_buckets *buckets) argument 312 struct buckets_in_flight *buckets; local [all...] |
H A D | journal_sb.c | 39 b[i] = le64_to_cpu(journal->buckets[i]); 62 prt_printf(err, "duplicate journal buckets %llu", b[i]); 80 prt_printf(out, " %llu", le64_to_cpu(journal->buckets[i])); 147 prt_printf(err, "duplicate journal buckets in ranges %llu-%llu, %llu-%llu", 179 u64 *buckets, unsigned nr) 194 if (buckets[i] + 1 != buckets[i + 1]) 204 j->d[dst].start = cpu_to_le64(buckets[0]); 208 if (buckets[i] == buckets[ 178 bch2_journal_buckets_to_sb(struct bch_fs *c, struct bch_dev *ca, u64 *buckets, unsigned nr) argument [all...] |
H A D | buckets.h | 95 struct bucket_array *buckets = gc_bucket_array(ca); local 97 BUG_ON(b < buckets->first_bucket || b >= buckets->nbuckets); 98 return buckets->b + b; 241 usage.d[BCH_DATA_free].buckets - 251 usage.d[BCH_DATA_free].buckets 252 + usage.d[BCH_DATA_cached].buckets 253 + usage.d[BCH_DATA_need_gc_gens].buckets 254 + usage.d[BCH_DATA_need_discard].buckets
|
/linux-master/drivers/s390/scsi/ |
H A D | zfcp_reqlist.h | 16 /* 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 in struct:zfcp_reqlist 52 INIT_LIST_HEAD(&rl->buckets[i]); 68 if (!list_empty(&rl->buckets[i])) 92 list_for_each_entry(req, &rl->buckets[i], list) 165 list_add_tail(&req->list, &rl->buckets[i]); 182 list_splice_init(&rl->buckets[i], list); 209 list_for_each_entry(req, &rl->buckets[i], list)
|
/linux-master/tools/testing/selftests/bpf/ |
H A D | bpf_arena_htab.h | 14 htab_bucket_t *buckets; member in struct:htab 21 htab_bucket_t *b = htab->buckets; 95 void __arena *buckets = bpf_arena_alloc_pages(&arena, NULL, 2, NUMA_NO_NODE, 0); local 97 cast_user(buckets); 98 htab->buckets = buckets;
|
/linux-master/tools/perf/util/ |
H A D | ftrace.h | 43 int buckets[]); 68 int buckets[] __maybe_unused)
|
H A D | hashmap.h | 77 struct hashmap_entry **buckets; member in struct:hashmap 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 D | hashmap.c | 21 /* start with 4 buckets */ 45 map->buckets = NULL; 71 free(map->buckets); 72 map->buckets = NULL; 124 free(map->buckets); 125 map->buckets = new_buckets; 137 if (!map->buckets) 140 for (prev_ptr = &map->buckets[hash], cur = *prev_ptr; 200 hashmap_add_entry(&map->buckets[h], entry);
|
H A D | bpf_ftrace.c | 122 int buckets[]) 138 buckets[idx] = 0; 143 buckets[idx] += hist[i]; 121 perf_ftrace__latency_read_bpf(struct perf_ftrace *ftrace __maybe_unused, int buckets[]) argument
|
/linux-master/drivers/md/dm-vdo/ |
H A D | priority-table.c | 21 * priority. The table is essentially an array of buckets. 33 * A priority table is an array of buckets, indexed by priority. New entries are added to the end 41 /* A bit vector flagging all buckets that are currently non-empty */ 43 /* The array of all buckets, indexed by priority */ 44 struct bucket buckets[]; member in struct:priority_table 69 struct bucket *bucket = &table->buckets[priority]; 94 * Unlink the buckets from any entries still in the table so the entries won't be left with 116 list_del_init(&table->buckets[priority].queue); 134 list_move_tail(entry, &table->buckets[priority].queue); 162 /* All buckets ar [all...] |
H A D | int-map.c | 15 * are stored in a fixed array of buckets, with no dynamic allocation for collisions. Unlike linear 23 * that process fails (typically when the buckets are around 90% full), the table must be resized 26 * Unlike linear probing, the number of buckets that must be searched in the worst case has a fixed 60 #define NEIGHBORHOOD 255 /* the number of buckets in each neighborhood */ 70 * it's crucial to keep the hop fields near the buckets that they use them so they'll tend to share 91 * bucket array, we allocate a few more buckets at the end of the array instead, which is why 99 /* @bucket_count: The number of buckets in the bucket array. */ 101 /** @buckets: The array of hash buckets. */ 102 struct bucket *buckets; member in struct:int_map [all...] |
/linux-master/tools/lib/bpf/ |
H A D | hashmap.h | 77 struct hashmap_entry **buckets; member in struct:hashmap 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 D | hashmap.c | 21 /* start with 4 buckets */ 45 map->buckets = NULL; 71 free(map->buckets); 72 map->buckets = NULL; 124 free(map->buckets); 125 map->buckets = new_buckets; 137 if (!map->buckets) 140 for (prev_ptr = &map->buckets[hash], cur = *prev_ptr; 200 hashmap_add_entry(&map->buckets[h], entry);
|
/linux-master/tools/testing/selftests/bpf/prog_tests/ |
H A D | arena_htab.c | 20 printf("htab %p buckets %p n_buckets %d\n", htab, htab->buckets, htab->n_buckets); 21 ASSERT_OK_PTR(htab->buckets, "htab->buckets shouldn't be NULL"); 22 for (i = 0; htab->buckets && i < 16; i += 4) { 24 * Walk htab buckets and link lists since all pointers are correct,
|
/linux-master/net/ceph/crush/ |
H A D | crush.c | 110 /* buckets */ 111 if (map->buckets) { 114 if (map->buckets[b] == NULL) 116 crush_destroy_bucket(map->buckets[b]); 118 kfree(map->buckets);
|
/linux-master/block/ |
H A D | blk-stat.h | 16 * buckets by @bucket_fn and added to a per-cpu buffer, @cpu_stat. When the 31 * @cpu_stat: Per-cpu statistics buckets. 43 * @buckets: Number of statistics buckets. 45 unsigned int buckets; member in struct:blk_stat_callback 48 * @stat: Array of statistics buckets. 79 * @buckets: Number of statistics buckets. 89 unsigned int buckets, void *data);
|
H A D | blk-stat.c | 86 for (bucket = 0; bucket < cb->buckets; bucket++) 93 for (bucket = 0; bucket < cb->buckets; bucket++) { 105 unsigned int buckets, void *data) 113 cb->stat = kmalloc_array(buckets, sizeof(struct blk_rq_stat), 119 cb->cpu_stat = __alloc_percpu(buckets * sizeof(struct blk_rq_stat), 130 cb->buckets = buckets; 147 for (bucket = 0; bucket < cb->buckets; bucket++) 103 blk_stat_alloc_callback(void (*timer_fn)(struct blk_stat_callback *), int (*bucket_fn)(const struct request *), unsigned int buckets, void *data) argument
|
/linux-master/net/netfilter/ipvs/ |
H A D | ip_vs_dh.c | 64 struct ip_vs_dh_bucket buckets[IP_VS_DH_TAB_SIZE]; member in struct:ip_vs_dh_state 90 return rcu_dereference(s->buckets[ip_vs_dh_hashkey(af, addr)].dest); 95 * Assign all the hash buckets of the specified table with the service. 106 b = &s->buckets[0]; 132 * Flush all the hash buckets of the specified table. 140 b = &s->buckets[0]; 166 /* assign the hash buckets with current dests */ 177 /* got to clean up hash buckets here */ 192 /* assign the hash buckets with the updated service */
|
H A D | ip_vs_sh.c | 70 struct ip_vs_sh_bucket buckets[IP_VS_SH_TAB_SIZE]; member in struct:ip_vs_sh_state 108 struct ip_vs_dest *dest = rcu_dereference(s->buckets[hash].dest); 130 dest = rcu_dereference(s->buckets[ihash].dest); 145 dest = rcu_dereference(s->buckets[hash].dest); 160 * Assign all the hash buckets of the specified table with the service. 172 b = &s->buckets[0]; 208 * Flush all the hash buckets of the specified table. 216 b = &s->buckets[0]; 242 /* assign the hash buckets with current dests */ 253 /* got to clean up hash buckets her [all...] |
/linux-master/lib/ |
H A D | hashtable_test.c | 189 int buckets[2]; local 219 /* Save the buckets for the different keys. */ 223 buckets[y->key] = bkt; 230 if (buckets[0] == buckets[1]) { 244 int buckets[2]; local 277 /* Save the buckets for the different keys. */ 281 buckets[y->key] = bkt; 288 if (buckets[0] == buckets[ [all...] |
/linux-master/tools/testing/selftests/drivers/net/netdevsim/ |
H A D | nexthop.sh | 213 $IP nexthop add id 10 group 1/2 type resilient buckets 4 214 nexthop_check "id 10" "id 10 group 1/2 type resilient buckets 4 idle_timer 120 unbalanced_timer 0 unbalanced_time 0 trap" 218 check_err $? "Wrong nexthop buckets count" 220 check_err $? "Wrong nexthop buckets count" 229 $IP nexthop add id 10 group 1,3/2,2 type resilient buckets 5 230 nexthop_check "id 10" "id 10 group 1,3/2,2 type resilient buckets 5 idle_timer 120 unbalanced_timer 0 unbalanced_time 0 trap" 234 check_err $? "Wrong nexthop buckets count" 236 check_err $? "Wrong nexthop buckets count" 259 $IP nexthop add id 10 group 1/2 type resilient buckets 4 &> /dev/null 325 $IP nexthop add id 10 group 1/2 type resilient buckets [all...] |
/linux-master/drivers/net/ethernet/mellanox/mlx5/core/ipoib/ |
H A D | ipoib_vlan.c | 45 struct hlist_head buckets[1 << MLX5I_MAX_LOG_PKEY_SUP]; member in struct:mlx5i_pkey_qpn_ht 71 static struct qpn_to_netdev *mlx5i_find_qpn_to_netdev_node(struct hlist_head *buckets, argument 74 struct hlist_head *h = &buckets[hash_32(qpn, MLX5I_MAX_LOG_PKEY_SUP)]; 99 hlist_add_head(&new_node->hlist, &ht->buckets[key]); 112 node = mlx5i_find_qpn_to_netdev_node(ht->buckets, qpn); 131 node = mlx5i_find_qpn_to_netdev_node(ipriv->qpn_htbl->buckets, qpn);
|
/linux-master/fs/nfs/ |
H A D | pnfs_nfs.c | 102 p = kmalloc(struct_size(p, buckets, n), gfp_flags); 109 for (b = &p->buckets[0]; n != 0; b++, n--) { 259 struct pnfs_commit_bucket *buckets, 267 cnt = pnfs_bucket_scan_ds_commit_list(&buckets[i], cinfo, max); 288 cnt = pnfs_bucket_scan_array(cinfo, array->buckets, 304 struct pnfs_commit_bucket *buckets, 314 for (i = 0, b = buckets; i < nbuckets; i++, b++) { 343 array->buckets, 355 pnfs_bucket_search_commit_reqs(struct pnfs_commit_bucket *buckets, argument 364 for (i = 0, b = buckets; 258 pnfs_bucket_scan_array(struct nfs_commit_info *cinfo, struct pnfs_commit_bucket *buckets, unsigned int nbuckets, int max) argument 303 pnfs_bucket_recover_commit_reqs(struct list_head *dst, struct pnfs_commit_bucket *buckets, unsigned int nbuckets, struct nfs_commit_info *cinfo) argument 430 pnfs_generic_retry_commit(struct pnfs_commit_bucket *buckets, unsigned int nbuckets, struct nfs_commit_info *cinfo, unsigned int idx) argument 451 pnfs_bucket_alloc_ds_commits(struct list_head *list, struct pnfs_commit_bucket *buckets, unsigned int nbuckets, struct nfs_commit_info *cinfo) argument [all...] |