Searched refs:bucket (Results 1 – 4 of 4) sorted by relevance
55 sys_dlist_t *bucket; in sys_hashmap_sc_to_list() local62 bucket = &buckets[i]; in sys_hashmap_sc_to_list()63 while (!sys_dlist_is_empty(bucket)) { in sys_hashmap_sc_to_list()64 entry = CONTAINER_OF(sys_dlist_get(bucket), struct sys_hashmap_sc_entry, in sys_hashmap_sc_to_list()74 sys_dlist_t *bucket; in sys_hashmap_sc_rehash() local99 bucket = &((sys_dlist_t *)(map->data->buckets))[i]; in sys_hashmap_sc_rehash()100 sys_dlist_init(bucket); in sys_hashmap_sc_rehash()112 sys_dlist_t *bucket; in sys_hashmap_sc_find() local124 bucket = &buckets[hash % map->data->n_buckets]; in sys_hashmap_sc_find()126 SYS_DLIST_FOR_EACH_CONTAINER(bucket, entry, node) { in sys_hashmap_sc_find()[all …]
20 Separate-Chaining Hashmaps implement each bucket as a linked-list.
34 size_t bucket; in create_histogram() local42 bucket = hash % CONFIG_TEST_HASH_FUNC_NUM_BUCKETS; in create_histogram()44 buckets[bucket]++; in create_histogram()
72 block lists are stored in "buckets" by their size, each bucket storing73 blocks within one power of two (i.e. a bucket for blocks of 3-480 heap memory, including the variable-length list of bucket list heads92 the minimum bucket size for an allocation (the set of free blocks that
