bucket
uint32_t bucket;
for (bucket = hashp->cbucket;
bucket <= hashp->MAX_BUCKET;
bucket++, hashp->cndx = 1) {
bufp = __get_buf(hashp, bucket, NULL, 0);
hashp->cbucket = bucket;
unsigned 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);
unsigned bucket;
bucket = hashtable->bucketnum + 1;
while ((bucket < hashtable->size) &&
!(memberptr = (hashtable->table)[bucket])) {
bucket++;
if (bucket >= hashtable->size) {
hashtable->bucketnum = 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 = 1LU << (bucket + 3);
nextf[bucket] = op;
Elf32_Word bucket;
bucket = obj->buckets_gnu[req->hash_gnu % obj->nbuckets_gnu];
if (bucket == 0)
hashval = &obj->chain_zero_gnu[bucket];
struct list_head bucket[AMDGPU_BO_LIST_NUM_BUCKETS];
INIT_LIST_HEAD(&bucket[i]);
list_add_tail(&e->tv.head, &bucket[priority]);
list_splice(&bucket[i], validated);
struct list_head bucket[RADEON_CS_NUM_BUCKETS];
INIT_LIST_HEAD(&b->bucket[i]);
list_add_tail(item, &b->bucket[min(priority, RADEON_CS_MAX_PRIORITY)]);
list_splice(&b->bucket[i], out_list);
uint64_t bucket, tokens;
bucket = siphash13(rl->rl_secret, &key, len) & RATELIMIT_MASK;
LIST_FOREACH(r, &rl->rl_table[bucket], r_entry) {
LIST_INSERT_HEAD(&rl->rl_table[bucket], r, r_entry);
int i = 0, bucket;
for (bucket = 0; bucket < priv->numBuckets; bucket++) {
SLIST_FOREACH(hent, &priv->tab[bucket], next)
const int bucket = HASH(addr, priv->hashMask);
SLIST_FOREACH(hent, &priv->tab[bucket], next) {
const int bucket = HASH(addr, priv->hashMask);
SLIST_FOREACH(hent, &priv->tab[bucket], next) {
SLIST_INSERT_HEAD(&priv->tab[bucket], hent, next);
int bucket;
for (bucket = 0; bucket < priv->numBuckets; bucket++) {
struct ng_bridge_hent **hptr = &SLIST_FIRST(&priv->tab[bucket]);
int bucket;
for (bucket = 0; bucket < priv->numBuckets; bucket++) {
struct ng_bridge_hent **hptr = &SLIST_FIRST(&priv->tab[bucket]);
int i = 0, bucket;
for (bucket = 0; bucket < priv->numBuckets; bucket++) {
SLIST_FOREACH(hent, &priv->tab[bucket], next)
const int bucket = HASH(addr, priv->hashMask);
SLIST_FOREACH(hent, &priv->tab[bucket], next) {
const int bucket = HASH(addr, priv->hashMask);
SLIST_FOREACH(hent, &priv->tab[bucket], next) {
SLIST_INSERT_HEAD(&priv->tab[bucket], hent, next);
int bucket;
for (bucket = 0; bucket < priv->numBuckets; bucket++) {
struct ng_bridge_hent **hptr = &SLIST_FIRST(&priv->tab[bucket]);
int bucket;
for (bucket = 0; bucket < priv->numBuckets; bucket++) {
struct ng_bridge_hent **hptr = &SLIST_FIRST(&priv->tab[bucket]);
struct inpcbhead *bucket;
bucket = &pcbinfo->hashbase[INP_PCBCONNHASH(hashkey_faddr,
LIST_INSERT_HEAD(bucket, inp, inp_hash);
struct inpcontainerhead *bucket;
bucket = &pcbinfo->wildcardhashbase[
LIST_INSERT_HEAD(bucket, ic, ic_list);
#define IPFLOW_INSERT(pcpu, bucket, ipf) \
LIST_INSERT_HEAD((bucket), (ipf), ipf_hash); \
struct syncache_head *bucket;
bucket = &syncache_percpu->hashbase[i];
TAILQ_INIT(&bucket->sch_bucket);
bucket->sch_length = 0;
struct syncache_head *bucket;
bucket = &syncache_percpu->hashbase[i];
TAILQ_FOREACH(sc, &bucket->sch_bucket, sc_hash) {
thrs = &ra->ra_rate_thresh[bucket(pktlen)];
thrs = &ra->ra_rate_thresh[bucket(pktlen)];
thrs = &ra->ra_rate_thresh[bucket(pktlen)];
int bucket;
bucket = (id ^ namerand) % (sizeof(buckets) / sizeof(buckets[0]));
padmod = buckets[bucket] + 1 - i;
} *bucket[NBUCKETS];
for (hp = bucket[i]; hp != NULL; hp = hp->hnext)
hp->hnext = bucket[i];
bucket[i] = hp;
bucket_t *bucket;
bucket = &(ht->buckets[string_hash(ht, key)]);
ll = &(bucket->list);
ll_add(&(bucket->list), newli);
bucket_t *bucket;
bucket = &(ht->buckets[string_hash(ht, key)]);
ll = &(bucket->list);
ll_add(&(bucket->list), li);
bucket_t *bucket;
if ((bucket = &(ht->buckets[string_hash(ht, key)])) != NULL)
ll = &(bucket->list);
bucket_t *bucket;
if ((bucket = &(ht->buckets[string_hash(ht, key)])) != NULL)
ll = &(bucket->list);
bucket_t *bucket;
bucket = &(ht->buckets[((key.k_thr * 10000 + key.k_pid) % ht->num_buckets)]);
ll = &(bucket->list);
ll_add(&(bucket->list), newli);
bucket_t *bucket;
bucket = &(ht->buckets[((key.k_thr * 10000 + key.k_pid) % ht->num_buckets)]);
ll = &(bucket->list);
ll_add(&(bucket->list), li);
bucket_t *bucket;
if ((bucket = &(ht->buckets[((key.k_thr * 10000 + key.k_pid) % ht->num_buckets)])) != NULL)
ll = &(bucket->list);
bucket_t *bucket;
if ((bucket = &(ht->buckets[((key.k_thr * 10000 + key.k_pid) % ht->num_buckets)])) != NULL)
ll = &(bucket->list);
bucket_t *bucket;
bucket = &(ht->buckets[(key % ht->num_buckets)]);
ll = &(bucket->list);
ll_add(&(bucket->list), newli);
bucket_t *bucket;
bucket = &(ht->buckets[(key % ht->num_buckets)]);
ll = &(bucket->list);
ll_add(&(bucket->list), li);
bucket_t *bucket;
if ((bucket = &(ht->buckets[(key % ht->num_buckets)])) != NULL)
ll = &(bucket->list);
bucket_t *bucket;
if ((bucket = &(ht->buckets[(key % ht->num_buckets)])) != NULL)
ll = &(bucket->list);
register bucket_t *bucket;
bucket = ht->buckets;
cnt += bucket->list.count;
bucket++;
register bucket_t *bucket;
bucket = ht->buckets;
idx = bucket->list.count;
bucket++;
bucket_t *bucket;
bucket = &(ht->buckets[(key % ht->num_buckets)]);
ll = &(bucket->list);
ll_add(&(bucket->list), newli);
bucket_t *bucket;
bucket = &(ht->buckets[(key % ht->num_buckets)]);
ll = &(bucket->list);
ll_add(&(bucket->list), li);
bucket_t *bucket;
if ((bucket = &(ht->buckets[(key % ht->num_buckets)])) != NULL)
ll = &(bucket->list);
bucket_t *bucket;
if ((bucket = &(ht->buckets[(key % ht->num_buckets)])) != NULL)
ll = &(bucket->list);
bucket_t *bucket;
bucket = &(ht->buckets[(key % ht->num_buckets)]);
ll = &(bucket->list);
ll_add(&(bucket->list), newli);
bucket_t *bucket;
bucket = &(ht->buckets[(key % ht->num_buckets)]);
ll = &(bucket->list);
ll_add(&(bucket->list), li);
bucket_t *bucket;
if ((bucket = &(ht->buckets[(key % ht->num_buckets)])) != NULL)
ll = &(bucket->list);
bucket_t *bucket;
if ((bucket = &(ht->buckets[(key % ht->num_buckets)])) != NULL)
ll = &(bucket->list);
} bucket[BUCKETS];
hp = hp0 = &bucket[lastchr(str) & 0177];
for (hp = bucket[i].hnext; hp != NULL; hp = hp->hnext)
for (hp = bucket[i].hnext; hp != NULL; hp = hp->hnext) {
d->b = malloc(sizeof(struct bucket *) * num_buckets);
} *bucket[(M_MAXLEN + sizeof(struct mbuf)) / BUCKET_HASH];
#define M_BUCKET(sz) (bucket + M_BINDEX(sz))