bucket
int bucket;
bucket = 0;
bucket++;
pagebucket = bucket;
bucket = 0;
bucket = 1;
bucket = pagebucket;
bucket++;
if ((op = nextf[bucket]) == NULL) {
morecore(bucket);
if ((op = nextf[bucket]) == NULL) {
nextf[bucket] = op->ov_next;
op->ov_index = bucket;
nmalloc[bucket]++;
morecore(int bucket)
sz = 1 << (bucket + 3);
nextf[bucket] = op;
uint32_t bucket;
for (bucket = hashp->cbucket;
bucket <= (uint32_t)hashp->MAX_BUCKET;
bucket++) {
bufp = __get_buf(hashp, bucket, NULL, 0);
hashp->cbucket = bucket;
int n, bucket;
bucket = n & hashp->HIGH_MASK;
if (bucket > hashp->MAX_BUCKET)
bucket = bucket & hashp->LOW_MASK;
return (bucket);
__get_page(HTAB *hashp, char *p, uint32_t bucket, int is_bucket, int is_disk,
page = BUCKET_TO_PAGE(bucket);
page = OADDR_TO_PAGE(bucket);
__put_page(HTAB *hashp, char *p, uint32_t bucket, int is_bucket, int is_bitmap)
page = BUCKET_TO_PAGE(bucket);
page = OADDR_TO_PAGE(bucket);
Elf32_Word bucket;
bucket = obj->buckets_gnu[fast_remainder32(hash, obj->nbuckets_gnu,
if (bucket == 0)
hashval = &obj->chains_gnu[bucket];
size_t bucket;
bucket = 0;
bucket++;
if (amt == 0 || bucket >= NBUCKETS)
if ((op = nextf[bucket]) == NULL) {
morecore(bucket);
if ((op = nextf[bucket]) == NULL)
nextf[bucket] = op->ov_next;
op->ov_index = bucket;
nmalloc[bucket]++;
morecore(size_t bucket)
sz = FIRST_BUCKET_SIZE << bucket;
nblks = amt >> (bucket + FIRST_BUCKET_SHIFT);
nextf[bucket] = op;
for (u_int bucket=0; bucket < buckets_max; bucket++) {
rmixl_fmn_intr_poll(u_int bucket, rmixl_fmn_rxmsg_t *rxmsg)
uint32_t bit = 1 << bucket;
KASSERT(bucket < 8);
if (rmixl_fmn_msg_recv(bucket, rxmsg) == 0)
for (u_int bucket=0; bucket < 8; bucket++) {
if ((rfbne & (1 << bucket)) == 0)
if (rmixl_fmn_msg_recv_subr(bucket, &rxmsg) != 0)
rmixl_fmn_msg_recv(u_int bucket, rmixl_fmn_rxmsg_t *rxmsg)
rv = rmixl_fmn_msg_recv_subr(bucket, rxmsg);
rmixl_fmn_msg_recv_subr(u_int bucket, rmixl_fmn_rxmsg_t *rxmsg)
__func__, cpu_number(), bucket, msg_status));
rmixl_msgld(bucket);
__func__, cpu_number(), bucket, msg_status));
rmixl_msgld(uint32_t bucket)
:: "r"(bucket));
#define RMIXL_FMN_CORE_DESTID(core, bucket) \
(((core) << 3) | (bucket))
size_t bucket = (size_t)HASHADDR(addr);
for (p = mh_table[bucket]; p && (p->address != addr); p = p->next)
p->next = mh_table[bucket];
mh_table[bucket] = p;
size_t bucket = HASHADDR(addr);
for (p = mh_table[bucket]; p && (p->address != addr); p = p->next)
struct callout_circq *bucket)
if (CIRCQ_LAST(bucket, kbucket))
for (c = CIRCQ_FIRST(bucket); /*nothing*/; c = CIRCQ_NEXT(&c->c_list)) {
b = (bucket - cc->cc_wheel);
u_long bucket = KSEM_PSHARED_HASH(id);
LIST_FOREACH(ksem, &ksem_pshared_hashtab[bucket], ks_entry) {
u_long bucket = KSEM_PSHARED_HASH(ksem->ks_pshared_id);
LIST_INSERT_HEAD(&ksem_pshared_hashtab[bucket], ksem, ks_entry);
KASSERT(!hmap->bucket);
lpm_ent_t *entry = hmap->bucket[i];
kmem_free(hmap->bucket, hmap->hashsize * sizeof(lpm_ent_t *));
hmap->bucket = NULL;
lpm_ent_t **bucket;
bucket = kmem_zalloc(hashsize * sizeof(lpm_ent_t *), flags);
if (bucket == NULL)
lpm_ent_t *list = hmap->bucket[n];
entry->next = bucket[i];
bucket[i] = entry;
if (hmap->bucket)
kmem_free(hmap->bucket, hmap->hashsize * sizeof(lpm_ent_t *));
hmap->bucket = bucket;
entry = hmap->bucket[i];
entry->next = hmap->bucket[i];
hmap->bucket[i] = entry;
entry = hmap->bucket[i];
entry = hmap->bucket[i];
hmap->bucket[i] = entry->next;
lpm_ent_t ** bucket;
int bucket, s;
bucket = uvm_page_get_bucket(pg);
if (bucket == ucpu->pgflbucket && uvm_pgflcache_free(ucpu, pg)) {
pgb = pgfl->pgfl_buckets[bucket];
lock = &uvm_freelist_locks[bucket].lock;
static struct bucket static_bucket;
static struct bucket *buckets = &static_bucket;
struct bucket *newbuckets;
struct bucket *oldbuckets;
struct bucket *b = &newbuckets[i];
static struct bucket *
nonresident_rotate(struct bucket *b)
struct bucket *b = nonresident_getbucket(obj, idx);
struct bucket *b = nonresident_getbucket(obj, idx);
unsigned bucket;
bucket = hashtable->bucketnum + 1;
while ((bucket < hashtable->size) &&
!(memberptr = (hashtable->table)[bucket])) {
bucket++;
if (bucket >= hashtable->size) {
hashtable->bucketnum = bucket;
static bucket_t bucket[256];
#define HASH(a) (&bucket[((a) >> 6) & (__arraycount(bucket) - 1)])
for (i = 0; i < __arraycount(bucket); i++) {
SLIST_INIT(&bucket[i]);
SLIST_FOREACH(l, bp, bucket) {
SLIST_INSERT_HEAD(bp, l, bucket);
SLIST_HEAD(bucket, lockstruct);
typedef struct bucket bucket_t;
SLIST_ENTRY(lockstruct) bucket;