lib/libc/db/hash/hash.c

690

u_int32_t bucket;

lib/libc/db/hash/hash.c

711

for (bucket = hashp->cbucket;

lib/libc/db/hash/hash.c

712

bucket <= hashp->MAX_BUCKET;

lib/libc/db/hash/hash.c

713

bucket++, hashp->cndx = 1) {

lib/libc/db/hash/hash.c

714

bufp = __get_buf(hashp, bucket, NULL, 0);

lib/libc/db/hash/hash.c

722

hashp->cbucket = bucket;

lib/libc/db/hash/hash.c

850

int n, bucket;

lib/libc/db/hash/hash.c

853

bucket = n & hashp->HIGH_MASK;

lib/libc/db/hash/hash.c

854

if (bucket > hashp->MAX_BUCKET)

lib/libc/db/hash/hash.c

855

bucket = bucket & hashp->LOW_MASK;

lib/libc/db/hash/hash.c

856

return (bucket);

lib/libc/db/hash/hash_page.c

510

__get_page(HTAB *hashp, char *p, u_int32_t bucket, int is_bucket, int is_disk,

lib/libc/db/hash/hash_page.c

524

page = BUCKET_TO_PAGE(bucket);

lib/libc/db/hash/hash_page.c

526

page = OADDR_TO_PAGE(bucket);

lib/libc/db/hash/hash_page.c

565

__put_page(HTAB *hashp, char *p, u_int32_t bucket, int is_bucket, int is_bitmap)

lib/libc/db/hash/hash_page.c

588

page = BUCKET_TO_PAGE(bucket);

lib/libc/db/hash/hash_page.c

590

page = OADDR_TO_PAGE(bucket);

lib/libc/stdlib/malloc.c

1004

count = MALLOC_PAGESIZE / B2ALLOC(bucket);

lib/libc/stdlib/malloc.c

1013

if (mopts.chunk_canaries && bucket > 0)

lib/libc/stdlib/malloc.c

1035

LIST_INSERT_HEAD(&d->chunk_info_list[bucket], p,

lib/libc/stdlib/malloc.c

1039

p = LIST_FIRST(&d->chunk_info_list[bucket]);

lib/libc/stdlib/malloc.c

1042

init_chunk_info(d, p, bucket);

lib/libc/stdlib/malloc.c

1050

omalloc_make_chunks(struct dir_info *d, u_int bucket, u_int listnum)

lib/libc/stdlib/malloc.c

1065

B2ALLOC(bucket));

lib/libc/stdlib/malloc.c

1069

if (bucket == 0 && mprotect(pp, MALLOC_PAGESIZE, PROT_NONE) == -1)

lib/libc/stdlib/malloc.c

1072

bp = alloc_chunk_info(d, bucket);

lib/libc/stdlib/malloc.c

1077

if (insert(d, (void *)((uintptr_t)pp | (bucket + 1)), (uintptr_t)bp,

lib/libc/stdlib/malloc.c

1080

LIST_INSERT_HEAD(&d->chunk_dir[bucket][listnum], bp, entries);

lib/libc/stdlib/malloc.c

1082

if (bucket > 0 && d->malloc_junk != 0)

lib/libc/stdlib/malloc.c

1151

u_int i, j, k, r, bucket, listnum;

lib/libc/stdlib/malloc.c

1160

bucket = find_bucket(size);

lib/libc/stdlib/malloc.c

1166

if ((bp = LIST_FIRST(&d->chunk_dir[bucket][listnum])) == NULL) {

lib/libc/stdlib/malloc.c

1167

bp = omalloc_make_chunks(d, bucket, listnum);

lib/libc/stdlib/malloc.c

1172

if (bp->canary != (u_short)d->canary1 || bucket != bp->bucket)

lib/libc/stdlib/malloc.c

1217

p = (char *)bp->page + k * B2ALLOC(bucket);

lib/libc/stdlib/malloc.c

1218

if (bucket > 0) {

lib/libc/stdlib/malloc.c

1219

validate_junk(d, p, B2SIZE(bucket));

lib/libc/stdlib/malloc.c

1221

fill_canary(p, size, B2SIZE(bucket));

lib/libc/stdlib/malloc.c

1256

chunknum = ((uintptr_t)ptr & MALLOC_PAGEMASK) / B2ALLOC(info->bucket);

lib/libc/stdlib/malloc.c

1262

if (check && info->bucket > 0) {

lib/libc/stdlib/malloc.c

1264

B2SIZE(info->bucket));

lib/libc/stdlib/malloc.c

1289

mp = &d->chunk_dir[info->bucket][listnum];

lib/libc/stdlib/malloc.c

1299

if (info->bucket == 0 && !mopts.malloc_freeunmap)

lib/libc/stdlib/malloc.c

1310

mp = &d->chunk_info_list[info->bucket];

lib/libc/stdlib/malloc.c

1657

if (B2SIZE(info->bucket) != sz)

lib/libc/stdlib/malloc.c

1912

fill_canary(p, newsz, B2SIZE(info->bucket));

lib/libc/stdlib/malloc.c

222

u_short bucket;

lib/libc/stdlib/malloc.c

2587

B2SIZE(p->bucket), p->free, p->total);

lib/libc/stdlib/malloc.c

2589

size_t i, sz = B2SIZE(p->bucket);

lib/libc/stdlib/malloc.c

979

init_chunk_info(struct dir_info *d, struct chunk_info *p, u_int bucket)

lib/libc/stdlib/malloc.c

983

p->bucket = bucket;

lib/libc/stdlib/malloc.c

984

p->total = p->free = MALLOC_PAGESIZE / B2ALLOC(bucket);

lib/libc/stdlib/malloc.c

995

alloc_chunk_info(struct dir_info *d, u_int bucket)

lib/libc/stdlib/malloc.c

999

if (LIST_EMPTY(&d->chunk_info_list[bucket])) {

lib/libkvm/kvm_proc.c

120

int bucket;

lib/libkvm/kvm_proc.c

136

bucket = UVM_AMAP_BUCKET(&amap, slot);

lib/libkvm/kvm_proc.c

137

addr = (u_long)(amap.am_buckets + bucket);

lib/libkvm/kvm_proc.c

147

bucket)

libexec/ld.so/resolve.c

593

Elf_Word bucket;

libexec/ld.so/resolve.c

609

bucket = obj->buckets_gnu[hash % obj->nbuckets];

libexec/ld.so/resolve.c

610

if (bucket == 0)

libexec/ld.so/resolve.c

612

hashval = &obj->chains_gnu[bucket];

libexec/tradcpp/macro.c

326

struct macroarray *bucket;

libexec/tradcpp/macro.c

331

bucket = macroarrayarray_get(&macros, i);

libexec/tradcpp/macro.c

332

if (bucket != NULL) {

libexec/tradcpp/macro.c

333

macroarray_destroyall(bucket);

libexec/tradcpp/macro.c

334

macroarray_destroy(bucket);

libexec/tradcpp/macro.c

346

struct macroarray *bucket;

libexec/tradcpp/macro.c

352

bucket = macroarrayarray_get(&macros, hash & hashmask);

libexec/tradcpp/macro.c

353

if (bucket == NULL) {

libexec/tradcpp/macro.c

356

num = macroarray_num(bucket);

libexec/tradcpp/macro.c

358

m = macroarray_get(bucket, i);

libexec/tradcpp/macro.c

366

m2 = macroarray_get(bucket, num-1);

libexec/tradcpp/macro.c

367

macroarray_set(bucket, i, m2);

libexec/tradcpp/macro.c

369

macroarray_setsize(bucket, num-1);

libexec/tradcpp/macro.c

440

struct macroarray *bucket;

libexec/tradcpp/macro.c

449

bucket = macroarrayarray_get(&macros, hash & hashmask);

libexec/tradcpp/macro.c

450

if (bucket == NULL) {

libexec/tradcpp/macro.c

451

bucket = macroarray_create();

libexec/tradcpp/macro.c

452

macroarrayarray_set(&macros, hash & hashmask, bucket);

libexec/tradcpp/macro.c

454

macroarray_add(bucket, m, NULL);

regress/sys/net/rtable/kern_compat.h

50

#define malloc(size, bucket, flag) calloc(1, size)

regress/sys/net/rtable/kern_compat.h

51

#define mallocarray(nelems, size, bucket, flag) calloc(nelems, size)

regress/sys/net/rtable/kern_compat.h

52

#define free(x, bucket, size) free(x)

sbin/isakmpd/exchange.c

514

u_int16_t bucket = 0;

sbin/isakmpd/exchange.c

523

bucket ^= cp[0] | cp[1] << 8;

sbin/isakmpd/exchange.c

528

bucket ^= cp[0] | cp[1] << 8;

sbin/isakmpd/exchange.c

530

bucket &= bucket_mask;

sbin/isakmpd/exchange.c

531

LIST_INSERT_HEAD(&exchange_tab[bucket], exchange, link);

sbin/isakmpd/exchange.c

543

u_int16_t bucket = 0;

sbin/isakmpd/exchange.c

557

bucket ^= cp[0] | cp[1] << 8;

sbin/isakmpd/exchange.c

563

bucket ^= cp[0] | cp[1] << 8;

sbin/isakmpd/exchange.c

565

bucket &= bucket_mask;

sbin/isakmpd/exchange.c

566

for (exchange = LIST_FIRST(&exchange_tab[bucket]);

sbin/isakmpd/sa.c

329

u_int16_t bucket = 0;

sbin/isakmpd/sa.c

338

bucket ^= cp[0] | cp[1] << 8;

sbin/isakmpd/sa.c

343

bucket ^= cp[0] | cp[1] << 8;

sbin/isakmpd/sa.c

345

bucket &= bucket_mask;

sbin/isakmpd/sa.c

346

LIST_INSERT_HEAD(&sa_tab[bucket], sa, link);

sbin/isakmpd/sa.c

370

u_int16_t bucket = 0;

sbin/isakmpd/sa.c

385

bucket ^= cp[0] | cp[1] << 8;

sbin/isakmpd/sa.c

391

bucket ^= cp[0] | cp[1] << 8;

sbin/isakmpd/sa.c

393

bucket &= bucket_mask;

sbin/isakmpd/sa.c

394

for (sa = LIST_FIRST(&sa_tab[bucket]);

sbin/isakmpd/x509.c

486

u_int16_t bucket = 0;

sbin/isakmpd/x509.c

492

bucket ^= (id[i] + 1) * (id[i + 1] + 257);

sbin/isakmpd/x509.c

496

bucket ^= (id[i] + 1) * (id[i] + 257);

sbin/isakmpd/x509.c

498

bucket &= bucket_mask;

sbin/isakmpd/x509.c

499

return bucket;

sbin/isakmpd/x509.c

576

u_int16_t bucket = 0;

sbin/isakmpd/x509.c

596

bucket = x509_hash(id[i], len[i]);

sbin/isakmpd/x509.c

598

LIST_INSERT_HEAD(&x509_tab[bucket], certh, link);

sbin/isakmpd/x509.c

601

cert, bucket));

sys/dev/pci/drm/radeon/radeon_cs.c

48

struct list_head bucket[RADEON_CS_NUM_BUCKETS];

sys/dev/pci/drm/radeon/radeon_cs.c

56

INIT_LIST_HEAD(&b->bucket[i]);

sys/dev/pci/drm/radeon/radeon_cs.c

67

list_add_tail(item, &b->bucket[min(priority, RADEON_CS_MAX_PRIORITY)]);

sys/dev/pci/drm/radeon/radeon_cs.c

77

list_splice(&b->bucket[i], out_list);

sys/kern/kern_malloc.c

197

kbp = &bucket[indx];

sys/kern/kern_malloc.c

395

kbp = &bucket[kup->ku_indx];

sys/kern/kern_malloc.c

579

XSIMPLEQ_INIT(&bucket[indx].kb_freelist);

sys/kern/kern_malloc.c

584

bucket[indx].kb_elmpercl = 1;

sys/kern/kern_malloc.c

586

bucket[indx].kb_elmpercl = PAGE_SIZE / (1 << indx);

sys/kern/kern_malloc.c

587

bucket[indx].kb_highwat = 5 * bucket[indx].kb_elmpercl;

sys/kern/kern_malloc.c

650

memcpy(&kb, &bucket[BUCKETINDX(name[1])], sizeof(kb));

sys/kern/kern_malloc.c

97

struct kmembuckets bucket[MINBUCKET + 16];

sys/kern/kern_timeout.c

1002

(bucket - wheel) % WHEELSIZE,

sys/kern/kern_timeout.c

1003

(bucket - wheel) / WHEELSIZE);

sys/kern/kern_timeout.c

963

db_show_callout_bucket(struct circq *bucket)

sys/kern/kern_timeout.c

967

CIRCQ_FOREACH(p, bucket)

sys/kern/kern_timeout.c

968

db_show_timeout(timeout_from_circq(p), bucket);

sys/kern/kern_timeout.c

972

db_show_timeout(struct timeout *to, struct circq *bucket)

sys/kern/kern_timeout.c

984

if (bucket == &timeout_new)

sys/kern/kern_timeout.c

986

else if (bucket == &timeout_todo)

sys/kern/kern_timeout.c

988

else if (bucket == &timeout_proc)

sys/kern/kern_timeout.c

991

else if (bucket == &timeout_proc_mp)

sys/net/pf_ioctl.c

1020

uint64_t bucket = SEC_TO_NSEC(pfstlim->pfstlim_rate.seconds);

sys/net/pf_ioctl.c

1022

pfstlim->pfstlim_rate_ts = getnsecuptime() - bucket;

sys/net/pf_ioctl.c

1024

bucket / pfstlim->pfstlim_rate.limit;

sys/net/pf_ioctl.c

1025

pfstlim->pfstlim_rate_bucket = bucket;

sys/net/pf_ioctl.c

1526

uint64_t bucket = pfsrlim->pfsrlim_rate.seconds * 1000000000ULL;

sys/net/pf_ioctl.c

1528

pfsrlim->pfsrlim_rate_token = bucket / pfsrlim->pfsrlim_rate.limit;

sys/net/pf_ioctl.c

1529

pfsrlim->pfsrlim_rate_bucket = bucket;

sys/sys/malloc.h

384

extern struct kmembuckets bucket[];

sys/uvm/uvm_amap.c

1021

for (bucket = startbucket; bucket <= endbucket; bucket++) {

sys/uvm/uvm_amap.c

1022

for (chunk = amap->am_buckets[bucket]; chunk != NULL;

sys/uvm/uvm_amap.c

1027

bucket)

sys/uvm/uvm_amap.c

108

int bucket = UVM_AMAP_BUCKET(amap, slot);

sys/uvm/uvm_amap.c

116

for (chunk = amap->am_buckets[bucket]; chunk != NULL;

sys/uvm/uvm_amap.c

118

if (UVM_AMAP_BUCKET(amap, chunk->ac_baseslot) != bucket)

sys/uvm/uvm_amap.c

138

KASSERT(amap->am_buckets[bucket] == NULL);

sys/uvm/uvm_amap.c

139

amap->am_buckets[bucket] = newchunk;

sys/uvm/uvm_amap.c

153

int bucket = UVM_AMAP_BUCKET(amap, chunk->ac_baseslot);

sys/uvm/uvm_amap.c

161

if (amap->am_buckets[bucket] == chunk) {

sys/uvm/uvm_amap.c

163

UVM_AMAP_BUCKET(amap, nchunk->ac_baseslot) == bucket)

sys/uvm/uvm_amap.c

164

amap->am_buckets[bucket] = nchunk;

sys/uvm/uvm_amap.c

166

amap->am_buckets[bucket] = NULL;

sys/uvm/uvm_amap.c

995

int bucket, startbucket, endbucket;

sys/uvm/uvm_aobj.c

1286

int bucket;

sys/uvm/uvm_aobj.c

1289

for (bucket = aobj->u_swhashmask; bucket >= 0; bucket--) {

sys/uvm/uvm_aobj.c

1290

for (elt = LIST_FIRST(&aobj->u_swhash[bucket]);

usr.bin/dig/lib/isc/symtab.c

152

unsigned int bucket;

usr.bin/dig/lib/isc/symtab.c

157

FIND(symtab, key, type, bucket, elt);

usr.bin/dig/lib/isc/symtab.c

211

unsigned int bucket;

usr.bin/dig/lib/isc/symtab.c

217

FIND(symtab, key, type, bucket, elt);

usr.bin/dig/lib/isc/symtab.c

223

UNLINK(symtab->table[bucket], elt, link);

usr.bin/dig/lib/isc/symtab.c

250

PREPEND(symtab->table[bucket], elt, link);

usr.bin/yacc/defs.h

145

typedef struct bucket bucket;

usr.bin/yacc/defs.h

147

struct bucket *link;

usr.bin/yacc/defs.h

148

struct bucket *next;

usr.bin/yacc/defs.h

268

extern bucket *first_symbol;

usr.bin/yacc/defs.h

269

extern bucket *last_symbol;

usr.bin/yacc/defs.h

300

extern bucket *lookup(char *);

usr.bin/yacc/defs.h

301

extern bucket *make_bucket(char *);

usr.bin/yacc/reader.c

1017

bucket *bp;

usr.bin/yacc/reader.c

1093

pitem = calloc(maxitems, sizeof(bucket *));

usr.bin/yacc/reader.c

1099

plhs = reallocarray(NULL, maxrules, sizeof(bucket *));

usr.bin/yacc/reader.c

1126

pitem = reallocarray(pitem, maxitems, sizeof(bucket *));

usr.bin/yacc/reader.c

1129

memset(pitem + olditems, 0, (maxitems - olditems) * sizeof(bucket *));

usr.bin/yacc/reader.c

1137

plhs = reallocarray(plhs, maxrules, sizeof(bucket *));

usr.bin/yacc/reader.c

1153

bucket *bp;

usr.bin/yacc/reader.c

1200

start_rule(bucket * bp, int s_lineno)

usr.bin/yacc/reader.c

1237

bucket *bp, **bpp;

usr.bin/yacc/reader.c

1269

bucket *bp;

usr.bin/yacc/reader.c

1497

bucket *bp = NULL;

usr.bin/yacc/reader.c

1584

bucket *bp;

usr.bin/yacc/reader.c

1611

bucket *bp;

usr.bin/yacc/reader.c

1628

bucket *bp;

usr.bin/yacc/reader.c

1629

bucket **v;

usr.bin/yacc/reader.c

1655

v = reallocarray(NULL, nsyms, sizeof(bucket *));

usr.bin/yacc/reader.c

56

bucket *goal;

usr.bin/yacc/reader.c

62

bucket **pitem;

usr.bin/yacc/reader.c

630

bucket *

usr.bin/yacc/reader.c

635

bucket *bp;

usr.bin/yacc/reader.c

65

bucket **plhs;

usr.bin/yacc/reader.c

79

bucket *get_literal(void);

usr.bin/yacc/reader.c

801

bucket *

usr.bin/yacc/reader.c

81

bucket *get_name(void);

usr.bin/yacc/reader.c

888

bucket *bp;

usr.bin/yacc/reader.c

92

void start_rule(bucket *, int);

usr.bin/yacc/reader.c

987

bucket *bp;

usr.bin/yacc/symtab.c

118

bucket *bp;

usr.bin/yacc/symtab.c

120

symbol_table = calloc(TABLE_SIZE, sizeof(bucket *));

usr.bin/yacc/symtab.c

145

bucket *p, *q;

usr.bin/yacc/symtab.c

44

bucket **symbol_table;

usr.bin/yacc/symtab.c

45

bucket *first_symbol;

usr.bin/yacc/symtab.c

46

bucket *last_symbol;

usr.bin/yacc/symtab.c

67

bucket *

usr.bin/yacc/symtab.c

70

bucket *bp;

usr.bin/yacc/symtab.c

73

bp = malloc(sizeof(bucket));

usr.bin/yacc/symtab.c

92

bucket *

usr.bin/yacc/symtab.c

95

bucket *bp, **bpp;

usr.sbin/bgpd/chash.c

205

uint32_t bucket = CH_H2(h);

usr.sbin/bgpd/chash.c

208

struct ch_group *g = &table[bucket], *ins_g = NULL;

usr.sbin/bgpd/chash.c

235

g = &table[++bucket & CH_H2_MASK];

usr.sbin/bgpd/chash.c

261

uint32_t bucket = CH_H2(h);

usr.sbin/bgpd/chash.c

264

struct ch_group *g = &table[bucket];

usr.sbin/bgpd/chash.c

286

g = &table[++bucket & CH_H2_MASK];

usr.sbin/bgpd/chash.c

299

uint32_t bucket = CH_H2(h);

usr.sbin/bgpd/chash.c

302

struct ch_group *g = &table[bucket];

usr.sbin/bgpd/chash.c

316

g = &table[++bucket & CH_H2_MASK];

usr.sbin/bgpd/chash.c

329

uint32_t bucket = CH_H2(h);

usr.sbin/bgpd/chash.c

332

struct ch_group *g = &table[bucket];

usr.sbin/bgpd/chash.c

346

g = &table[++bucket & CH_H2_MASK];

usr.sbin/btrace/btrace.c

1424

long val, bucket;

usr.sbin/btrace/btrace.c

1429

bucket = next_pow2(val);

usr.sbin/btrace/btrace.c

1447

bucket = ((val / step) + 1) * step;

usr.sbin/btrace/btrace.c

1452

l = snprintf(buf, sizeof(buf), "%lu", bucket);

usr.sbin/btrace/btrace.c

951

const char *bucket;

usr.sbin/btrace/btrace.c

958

bucket = ba2bucket(bval, brange, dtev, &step);

usr.sbin/btrace/btrace.c

959

if (bucket == NULL) {

usr.sbin/btrace/btrace.c

965

bv_name(bv), bucket);

usr.sbin/btrace/btrace.c

972

hist_increment(hist, bucket);

usr.sbin/btrace/btrace.c

975

bv_name(bv), brange, bucket, bval);

usr.sbin/btrace/map.c

213

hist_increment(struct hist *hist, const char *bucket)

usr.sbin/btrace/map.c

218

ba = map_get(&hist->hmap, bucket);

usr.sbin/npppd/common/hash.c

112

for (w = htbl->bucket[c]; w != NULL; w = w->next)

usr.sbin/npppd/common/hash.c

138

n->next = htbl->bucket[c];

usr.sbin/npppd/common/hash.c

139

htbl->bucket[c] = n;

usr.sbin/npppd/common/hash.c

159

for (w = htbl->bucket[i], b = NULL; w != NULL; w = w->next) {

usr.sbin/npppd/common/hash.c

164

htbl->bucket[i] = w->next;

usr.sbin/npppd/common/hash.c

191

hl = htbl->bucket[i];

usr.sbin/npppd/common/hash.c

192

htbl->bucket[i] = NULL;

usr.sbin/npppd/common/hash.c

209

free(htbl->bucket);

usr.sbin/npppd/common/hash.c

53

htbl->bucket = calloc(htbl->size, sizeof(hash_link *));

usr.sbin/npppd/common/hash.c

89

if (htbl->bucket[htbl->cur] != NULL) {

usr.sbin/npppd/common/hash.c

90

hlink = htbl->bucket[htbl->cur++];

usr.sbin/npppd/common/hash.h

44

hash_link **bucket;