bucket
ValueType *bucket = HashTable::fTable[i];
while (bucket) {
ValueType *next = HashTable::_Link(bucket);
_Insert(newTable, newSize, bucket);
bucket = next;
ValueType* bucket = fTable[i];
while (bucket) {
ValueType* next = _Link(bucket);
_Insert(newTable, newSize, bucket);
bucket = next;
ValueType*& _Link(ValueType* bucket) const
return fDefinition.GetLink(bucket);
ValueType* bucket = fTable[i];
while (bucket) {
if (bucket == value)
bucket = _Link(bucket);
thrs = &ra->ra_rate_thresh[bucket(pktlen)];
thrs = &ra->ra_rate_thresh[bucket(pktlen)];
thrs = &ra->ra_rate_thresh[bucket(pktlen)];
uint32 bucket;
if (!_Read(&hashBuckets[i], bucket))
for (uint32 j = bucket; j != STN_UNDEF;
Bucket& bucket = _Bucket();
MutexLocker bucketLocker(bucket.lock);
bucket.waiters.Add(&waiter);
Bucket& bucket = _Bucket();
MutexLocker bucketLocker(bucket.lock);
for (LockWaiterList::Iterator it = bucket.waiters.GetIterator();
init_chunk_info(struct dir_info *d, struct chunk_info *p, u_int bucket)
p->bucket = bucket;
p->total = p->free = MALLOC_PAGESIZE / B2ALLOC(bucket);
alloc_chunk_info(struct dir_info *d, u_int bucket)
if (LIST_EMPTY(&d->chunk_info_list[bucket])) {
count = MALLOC_PAGESIZE / B2ALLOC(bucket);
if (mopts.chunk_canaries && bucket > 0)
LIST_INSERT_HEAD(&d->chunk_info_list[bucket], p,
p = LIST_FIRST(&d->chunk_info_list[bucket]);
init_chunk_info(d, p, bucket);
omalloc_make_chunks(struct dir_info *d, u_int bucket, u_int listnum)
B2ALLOC(bucket));
if (bucket == 0 && mprotect(pp, MALLOC_PAGESIZE, PROT_NONE) == -1)
bp = alloc_chunk_info(d, bucket);
if (insert(d, (void *)((uintptr_t)pp | (bucket + 1)), (uintptr_t)bp,
LIST_INSERT_HEAD(&d->chunk_dir[bucket][listnum], bp, entries);
if (bucket > 0 && d->malloc_junk != 0)
u_int i, j, k, r, bucket, listnum;
bucket = find_bucket(size);
if ((bp = LIST_FIRST(&d->chunk_dir[bucket][listnum])) == NULL) {
bp = omalloc_make_chunks(d, bucket, listnum);
if (bp->canary != (u_short)d->canary1 || bucket != bp->bucket)
p = (char *)bp->page + k * B2ALLOC(bucket);
if (bucket > 0) {
validate_junk(d, p, B2SIZE(bucket));
fill_canary(p, size, B2SIZE(bucket));
chunknum = ((uintptr_t)ptr & MALLOC_PAGEMASK) / B2ALLOC(info->bucket);
if (check && info->bucket > 0) {
B2SIZE(info->bucket));
mp = &d->chunk_dir[info->bucket][listnum];
if (info->bucket == 0 && !mopts.malloc_freeunmap)
mp = &d->chunk_info_list[info->bucket];
if (B2SIZE(info->bucket) != sz)
fill_canary(p, newsz, B2SIZE(info->bucket));
u_short bucket;
B2SIZE(p->bucket), p->free, p->total);
size_t i, sz = B2SIZE(p->bucket);
const uint32 bucket = image->gnuhash.buckets[lookupInfo.gnuhash % image->gnuhash.bucket_count];
if (bucket == 0)
const uint32* hashValue = &chain0[bucket];
uint32 bucket = lookupInfo.hash % HASHTABSIZE(image);
for (uint32 symIndex = HASHBUCKETS(image)[bucket]; symIndex != STN_UNDEF;
uint32 bucket = elf_hash(name) % symbolHashSize;
for (uint32 i = symbolHash[bucket + 2]; i < symbolCount && i != STN_UNDEF;
uint32 bucket = 1;
printf("\n%2lu)", bucket++);
printf("%2lu)", bucket++);
ValueType* bucket = fTable[i];
while (bucket) {
ValueType* next = _Link(bucket);
_Insert(newTable, newSize, bucket);
bucket = next;
ValueType*& _Link(ValueType* bucket) const
return fDefinition.GetLink(bucket);
ValueType* bucket = fTable[i];
while (bucket) {
if (bucket == value)
bucket = _Link(bucket);
uint32_t index = iterator->bucket;
iterator->bucket = -1;
for (index = (uint32_t)(iterator->bucket + 1); index < table->table_size; index++) {
iterator->bucket = index;
int bucket;