HelenOS sources
bucket 103 common/adt/hash_table.c if (!alloc_table(h->bucket_cnt, &h->bucket))
bucket 122 common/adt/hash_table.c assert(h && h->bucket);
bucket 127 common/adt/hash_table.c free(h->bucket);
bucket 129 common/adt/hash_table.c h->bucket = NULL;
bucket 136 common/adt/hash_table.c assert(h && h->bucket);
bucket 143 common/adt/hash_table.c assert(h && h->bucket);
bucket 153 common/adt/hash_table.c assert(h && h->bucket);
bucket 173 common/adt/hash_table.c list_foreach_safe(h->bucket[idx], cur, next) {
bucket 193 common/adt/hash_table.c assert(h && h->bucket);
bucket 198 common/adt/hash_table.c list_append(&item->link, &h->bucket[idx]);
bucket 214 common/adt/hash_table.c assert(h && h->bucket && h->bucket_cnt);
bucket 221 common/adt/hash_table.c list_foreach(h->bucket[idx], link, ht_link_t, cur_link) {
bucket 230 common/adt/hash_table.c list_append(&item->link, &h->bucket[idx]);
bucket 247 common/adt/hash_table.c assert(h && h->bucket);
bucket 251 common/adt/hash_table.c list_foreach(h->bucket[idx], link, ht_link_t, cur_link) {
bucket 270 common/adt/hash_table.c assert(h && h->bucket);
bucket 279 common/adt/hash_table.c if (cur == &h->bucket[idx].head)
bucket 308 common/adt/hash_table.c assert(h && h->bucket);
bucket 315 common/adt/hash_table.c list_foreach_safe(h->bucket[idx], cur, next) {
bucket 337 common/adt/hash_table.c assert(h && h->bucket);
bucket 360 common/adt/hash_table.c assert(h && h->bucket);
bucket 368 common/adt/hash_table.c list_foreach_safe(h->bucket[idx], cur, next) {
bucket 440 common/adt/hash_table.c assert(h && h->bucket);
bucket 456 common/adt/hash_table.c list_foreach_safe(h->bucket[old_idx], cur, next) {
bucket 466 common/adt/hash_table.c free(h->bucket);
bucket 467 common/adt/hash_table.c h->bucket = new_buckets;
bucket 76 common/include/adt/hash_table.h list_t *bucket;
bucket 103 kernel/generic/common/adt/hash_table.c if (!alloc_table(h->bucket_cnt, &h->bucket))
bucket 122 kernel/generic/common/adt/hash_table.c assert(h && h->bucket);
bucket 127 kernel/generic/common/adt/hash_table.c free(h->bucket);
bucket 129 kernel/generic/common/adt/hash_table.c h->bucket = NULL;
bucket 136 kernel/generic/common/adt/hash_table.c assert(h && h->bucket);
bucket 143 kernel/generic/common/adt/hash_table.c assert(h && h->bucket);
bucket 153 kernel/generic/common/adt/hash_table.c assert(h && h->bucket);
bucket 173 kernel/generic/common/adt/hash_table.c list_foreach_safe(h->bucket[idx], cur, next) {
bucket 193 kernel/generic/common/adt/hash_table.c assert(h && h->bucket);
bucket 198 kernel/generic/common/adt/hash_table.c list_append(&item->link, &h->bucket[idx]);
bucket 214 kernel/generic/common/adt/hash_table.c assert(h && h->bucket && h->bucket_cnt);
bucket 221 kernel/generic/common/adt/hash_table.c list_foreach(h->bucket[idx], link, ht_link_t, cur_link) {
bucket 230 kernel/generic/common/adt/hash_table.c list_append(&item->link, &h->bucket[idx]);
bucket 247 kernel/generic/common/adt/hash_table.c assert(h && h->bucket);
bucket 251 kernel/generic/common/adt/hash_table.c list_foreach(h->bucket[idx], link, ht_link_t, cur_link) {
bucket 270 kernel/generic/common/adt/hash_table.c assert(h && h->bucket);
bucket 279 kernel/generic/common/adt/hash_table.c if (cur == &h->bucket[idx].head)
bucket 308 kernel/generic/common/adt/hash_table.c assert(h && h->bucket);
bucket 315 kernel/generic/common/adt/hash_table.c list_foreach_safe(h->bucket[idx], cur, next) {
bucket 337 kernel/generic/common/adt/hash_table.c assert(h && h->bucket);
bucket 360 kernel/generic/common/adt/hash_table.c assert(h && h->bucket);
bucket 368 kernel/generic/common/adt/hash_table.c list_foreach_safe(h->bucket[idx], cur, next) {
bucket 440 kernel/generic/common/adt/hash_table.c assert(h && h->bucket);
bucket 456 kernel/generic/common/adt/hash_table.c list_foreach_safe(h->bucket[old_idx], cur, next) {
bucket 466 kernel/generic/common/adt/hash_table.c free(h->bucket);
bucket 467 kernel/generic/common/adt/hash_table.c h->bucket = new_buckets;
bucket 76 kernel/generic/common/include/adt/hash_table.h list_t *bucket;
bucket 103 uspace/lib/c/common/adt/hash_table.c if (!alloc_table(h->bucket_cnt, &h->bucket))
bucket 122 uspace/lib/c/common/adt/hash_table.c assert(h && h->bucket);
bucket 127 uspace/lib/c/common/adt/hash_table.c free(h->bucket);
bucket 129 uspace/lib/c/common/adt/hash_table.c h->bucket = NULL;
bucket 136 uspace/lib/c/common/adt/hash_table.c assert(h && h->bucket);
bucket 143 uspace/lib/c/common/adt/hash_table.c assert(h && h->bucket);
bucket 153 uspace/lib/c/common/adt/hash_table.c assert(h && h->bucket);
bucket 173 uspace/lib/c/common/adt/hash_table.c list_foreach_safe(h->bucket[idx], cur, next) {
bucket 193 uspace/lib/c/common/adt/hash_table.c assert(h && h->bucket);
bucket 198 uspace/lib/c/common/adt/hash_table.c list_append(&item->link, &h->bucket[idx]);
bucket 214 uspace/lib/c/common/adt/hash_table.c assert(h && h->bucket && h->bucket_cnt);
bucket 221 uspace/lib/c/common/adt/hash_table.c list_foreach(h->bucket[idx], link, ht_link_t, cur_link) {
bucket 230 uspace/lib/c/common/adt/hash_table.c list_append(&item->link, &h->bucket[idx]);
bucket 247 uspace/lib/c/common/adt/hash_table.c assert(h && h->bucket);
bucket 251 uspace/lib/c/common/adt/hash_table.c list_foreach(h->bucket[idx], link, ht_link_t, cur_link) {
bucket 270 uspace/lib/c/common/adt/hash_table.c assert(h && h->bucket);
bucket 279 uspace/lib/c/common/adt/hash_table.c if (cur == &h->bucket[idx].head)
bucket 308 uspace/lib/c/common/adt/hash_table.c assert(h && h->bucket);
bucket 315 uspace/lib/c/common/adt/hash_table.c list_foreach_safe(h->bucket[idx], cur, next) {
bucket 337 uspace/lib/c/common/adt/hash_table.c assert(h && h->bucket);
bucket 360 uspace/lib/c/common/adt/hash_table.c assert(h && h->bucket);
bucket 368 uspace/lib/c/common/adt/hash_table.c list_foreach_safe(h->bucket[idx], cur, next) {
bucket 440 uspace/lib/c/common/adt/hash_table.c assert(h && h->bucket);
bucket 456 uspace/lib/c/common/adt/hash_table.c list_foreach_safe(h->bucket[old_idx], cur, next) {
bucket 466 uspace/lib/c/common/adt/hash_table.c free(h->bucket);
bucket 467 uspace/lib/c/common/adt/hash_table.c h->bucket = new_buckets;
bucket 76 uspace/lib/c/common/include/adt/hash_table.h list_t *bucket;
bucket 73 uspace/lib/c/generic/rtld/symbol.c elf_word bucket;
bucket 81 uspace/lib/c/generic/rtld/symbol.c bucket = elf_hash((unsigned char *)name) % nbucket;
bucket 82 uspace/lib/c/generic/rtld/symbol.c i = m->dyn.hash[2 + bucket];
bucket 153 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp auto [bucket, target, idx] = table.find_insertion_spot(key);
bucket 155 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp if (!bucket)
bucket 173 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp bucket->prepend(node);
bucket 194 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp auto [bucket, target, idx] = table.find_insertion_spot(key);
bucket 196 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp if (!bucket)
bucket 214 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp bucket->prepend(node);
bucket 236 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp auto [bucket, target, idx] = table.find_insertion_spot(key);
bucket 238 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp if (!bucket)
bucket 256 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp bucket->prepend(node);
bucket 445 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp auto [bucket, target, idx] = table.find_insertion_spot(key);
bucket 447 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp if (!bucket)
bucket 453 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp bucket->prepend(node);
bucket 319 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp auto [bucket, target, idx] = table_.find_insertion_spot(key);
bucket 321 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp if (!bucket)
bucket 339 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp bucket->append(node);
bucket 354 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp auto [bucket, target, idx] = table_.find_insertion_spot(key);
bucket 356 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp if (!bucket)
bucket 374 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp bucket->append(node);
bucket 401 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp auto [bucket, target, idx] = table_.find_insertion_spot(key);
bucket 403 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp if (!bucket)
bucket 422 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp bucket->append(node);
bucket 437 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp auto [bucket, target, idx] = table_.find_insertion_spot(key);
bucket 439 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp if (!bucket)
bucket 458 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp bucket->append(node);
bucket 553 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp auto bucket = get<0>(spot);
bucket 555 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp if (bucket->head)
bucket 557 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp auto head = bucket->head;
bucket 558 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp auto current = bucket->head;
bucket 571 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp bucket->append(node);
bucket 581 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp auto bucket = get<0>(spot);
bucket 583 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp if (bucket->head)
bucket 585 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp auto head = bucket->head;
bucket 586 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp auto current = bucket->head;
bucket 599 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp bucket->append(node);
bucket 639 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp return table_.bucket(key);
bucket 1071 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp return table_.bucket(key);
bucket 380 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp return table_.bucket(key);
bucket 796 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp return table_.bucket(key);
bucket 76 uspace/lib/posix/include/common/adt/hash_table.h list_t *bucket;
HelenOS homepage, sources at GitHub