Home
last modified time | relevance | path

Searched refs:bucket (Results 1 – 25 of 102) sorted by path

12345

/freebsd/cddl/contrib/opensolaris/cmd/dtrace/test/cmd/jdtrace/
H A DJDTrace.java303 Distribution.Bucket bucket; in printDistribution() local
336 bucket = d.get(i); in printDistribution()
337 v = bucket.getFrequency(); in printDistribution()
338 b = bucket.getMin(); in printDistribution()
344 } else if (bucket.getMax() == Long.MAX_VALUE) { in printDistribution()
/freebsd/cddl/contrib/opensolaris/cmd/dtrace/test/tst/common/java_api/src/
H A DTestBean.java208 Distribution.Bucket bucket; in getLogDistribution() local
221 buckets.add(bucket); in getLogDistribution()
222 bucket = new Distribution.Bucket(0, 0, n++); in getLogDistribution()
223 buckets.add(bucket); in getLogDistribution()
224 bucket = new Distribution.Bucket(1, 1, n++); in getLogDistribution()
225 buckets.add(bucket); in getLogDistribution()
239 buckets.add(bucket); in getLogDistribution()
250 Distribution.Bucket bucket; in getLinearDistribution() local
255 buckets.add(bucket); in getLinearDistribution()
259 buckets.add(bucket); in getLinearDistribution()
[all …]
/freebsd/cddl/contrib/opensolaris/tools/ctf/cvt/
H A Dhash.c109 int bucket = hash->h_hashfn(hash->h_nbuckets, key); in hash_add() local
111 list_add(&hash->h_buckets[bucket], key); in hash_add()
137 int bucket = hash->h_hashfn(hash->h_nbuckets, key); in hash_remove() local
139 (void) list_remove(&hash->h_buckets[bucket], key, in hash_remove()
147 int bucket = hash->h_hashfn(hash->h_nbuckets, key); in hash_match() local
149 return (list_iter(hash->h_buckets[bucket], fun, private) < 0); in hash_match()
172 int bucket = hash->h_hashfn(hash->h_nbuckets, key); in hash_find_iter() local
180 return (list_iter(hash->h_buckets[bucket], hash_find_list_cb, in hash_find_iter()
H A Dmerge.c402 equiv_cb(void *bucket, void *arg) in equiv_cb() argument
405 tdesc_t *mtdp = bucket; in equiv_cb()
/freebsd/contrib/byacc/
H A Ddefs.h212 typedef struct bucket bucket; typedef
213 struct bucket struct
215 struct bucket *link; argument
216 struct bucket *next; argument
387 extern bucket *first_symbol;
388 extern bucket *last_symbol;
588 extern bucket *make_bucket(const char *);
589 extern bucket *lookup(const char *);
H A Dreader.c50 static bucket *goal;
89 static bucket *
1274 static bucket *
1281 bucket *bp; in get_literal()
1474 static bucket *
1595 bucket *bp; in declare_tokens()
1796 bucket *bp; in declare_start()
2395 bucket *bp; in advance_to_start()
2579 bucket *bp; in add_symbol()
3176 bucket *bp; in copy_destructor()
[all …]
H A Dsymtab.c10 static bucket **symbol_table = 0;
11 bucket *first_symbol;
12 bucket *last_symbol;
29 bucket *
32 bucket *bp; in make_bucket()
36 bp = TMALLOC(bucket, 1); in make_bucket()
62 bucket *
65 bucket *bp, **bpp; in lookup()
89 bucket *bp; in create_symbol_table()
91 symbol_table = TMALLOC(bucket *, TABLE_SIZE); in create_symbol_table()
[all …]
/freebsd/contrib/byacc/test/btyacc/
H A Dgrammar.tab.c265 Symbol *bucket[SYM_MAX_HASH]; /* hash buckets */ member
/freebsd/contrib/byacc/test/
H A Dgrammar.y215 Symbol *bucket[SYM_MAX_HASH]; /* hash buckets */ member
/freebsd/contrib/byacc/test/yacc/
H A Dgrammar.tab.c245 Symbol *bucket[SYM_MAX_HASH]; /* hash buckets */ member
/freebsd/contrib/diff/
H A DChangeLog2215 incomplete lines. Put incomplete lines into their own bucket.
2220 (read_files): Allocate another bucket for incomplete lines.
/freebsd/contrib/diff/src/
H A Dio.c222 lin i, *bucket; in find_and_hash_each_line() local
390 bucket = &buckets[h % nbuckets]; in find_and_hash_each_line()
400 bucket = &buckets[-1]; in find_and_hash_each_line()
407 for (i = *bucket; ; i = eqs[i].next) in find_and_hash_each_line()
419 eqs[i].next = *bucket; in find_and_hash_each_line()
423 *bucket = i; in find_and_hash_each_line()
/freebsd/contrib/elftoolchain/elfdump/
H A Delfdump.c2140 uint32_t *bucket, *chain; in elf_print_svr4_hash() local
2175 bucket = &buf[2]; in elf_print_svr4_hash()
2183 for (j = bucket[i]; j > 0 && j < nchain; j = chain[j]) in elf_print_svr4_hash()
2193 for (j = bucket[i]; j > 0 && j < nchain; j = chain[j]) { in elf_print_svr4_hash()
2216 PRT("bucket[%d]:\n\t%u\n\n", i, bucket[i]); in elf_print_svr4_hash()
2230 uint64_t *bucket, *chain; in elf_print_svr4_hash64() local
2277 bucket = &buf[2]; in elf_print_svr4_hash64()
2285 for (j = bucket[i]; j > 0 && j < nchain; j = chain[j]) in elf_print_svr4_hash64()
2335 uint32_t *bucket, *chain; in elf_print_gnu_hash() local
2383 chain = bucket + nbucket; in elf_print_gnu_hash()
[all …]
/freebsd/contrib/elftoolchain/readelf/
H A Dreadelf.c3371 uint32_t *bucket, *chain; in dump_svr4_hash() local
3398 bucket = &buf[2]; in dump_svr4_hash()
3405 for (j = bucket[i]; j > 0 && (uint32_t)j < nchain; j = chain[j]) in dump_svr4_hash()
3431 uint64_t *bucket, *chain; in dump_svr4_hash64() local
3470 bucket = &buf[2]; in dump_svr4_hash64()
3477 for (j = bucket[i]; j > 0 && (uint32_t)j < nchain; j = chain[j]) in dump_svr4_hash64()
3503 uint32_t *bucket, *chain; in dump_gnu_hash() local
3541 bucket = buf + (re->ec == ELFCLASS32 ? maskwords : maskwords * 2); in dump_gnu_hash()
3542 chain = bucket + nbucket; in dump_gnu_hash()
3548 for (j = bucket[i]; j > 0 && (uint32_t)j - symndx < nchain; in dump_gnu_hash()
/freebsd/contrib/jemalloc/src/
H A Dckh.c68 cell = &ckh->tab[(bucket << LG_CKH_BUCKET_CELLS) + i]; in ckh_bucket_search()
70 return (bucket << LG_CKH_BUCKET_CELLS) + i; in ckh_bucket_search()
82 size_t hashes[2], bucket, cell; in ckh_isearch() local
90 cell = ckh_bucket_search(ckh, bucket, key); in ckh_isearch()
97 cell = ckh_bucket_search(ckh, bucket, key); in ckh_isearch()
114 cell = &ckh->tab[(bucket << LG_CKH_BUCKET_CELLS) + in ckh_try_bucket_insert()
138 size_t hashes[2], bucket, tbucket; in ckh_evict_reloc_insert() local
141 bucket = argbucket; in ckh_evict_reloc_insert()
170 if (tbucket == bucket) { in ckh_evict_reloc_insert()
197 bucket = tbucket; in ckh_evict_reloc_insert()
[all …]
/freebsd/contrib/libarchive/libarchive/
H A Darchive_entry_link_resolver.c264 size_t hash, bucket; in find_entry() local
300 if (res->buckets[bucket] == le) in find_entry()
315 size_t bucket; in next_entry() local
326 for (bucket = 0; bucket < res->number_buckets; bucket++) { in next_entry()
355 size_t hash, bucket; in insert_entry() local
371 if (res->buckets[bucket] != NULL) in insert_entry()
374 le->next = res->buckets[bucket]; in insert_entry()
376 res->buckets[bucket] = le; in insert_entry()
387 size_t i, bucket; in grow_hash() local
409 le->next = new_buckets[bucket]; in grow_hash()
[all …]
H A Darchive_write_disk_set_standard_lookup.c52 struct bucket { struct
86 struct bucket *ucache = calloc(cache_size, sizeof(struct bucket)); in archive_write_disk_set_standard_lookup()
87 struct bucket *gcache = calloc(cache_size, sizeof(struct bucket)); in archive_write_disk_set_standard_lookup()
102 struct bucket *b; in lookup_gid()
103 struct bucket *gcache = (struct bucket *)private_data; in lookup_gid()
171 struct bucket *b; in lookup_uid()
172 struct bucket *ucache = (struct bucket *)private_data; in lookup_uid()
240 struct bucket *cache = (struct bucket *)private; in cleanup()
/freebsd/contrib/libevent/
H A Dbufferevent_ratelim.c50 ev_token_bucket_init_(struct ev_token_bucket *bucket, in ev_token_bucket_init_() argument
62 bucket->read_limit = cfg->read_maximum; in ev_token_bucket_init_()
64 bucket->write_limit = cfg->write_maximum; in ev_token_bucket_init_()
66 bucket->read_limit = cfg->read_rate; in ev_token_bucket_init_()
67 bucket->write_limit = cfg->write_rate; in ev_token_bucket_init_()
68 bucket->last_updated = current_tick; in ev_token_bucket_init_()
97 bucket->read_limit = cfg->read_maximum; in ev_token_bucket_update_()
99 bucket->read_limit += n_ticks * cfg->read_rate; in ev_token_bucket_update_()
103 bucket->write_limit = cfg->write_maximum; in ev_token_bucket_update_()
105 bucket->write_limit += n_ticks * cfg->write_rate; in ev_token_bucket_update_()
[all …]
H A Dratelim-internal.h68 int ev_token_bucket_update_(struct ev_token_bucket *bucket,
82 int ev_token_bucket_init_(struct ev_token_bucket *bucket,
/freebsd/contrib/libpcap/
H A Dconfigure.ac1821 # the bit bucket.
/freebsd/contrib/libxo/
H A Dconfigure.ac318 AC_MSG_CHECKING([retain hash bucket size])
320 [ --with-retain-size=[DIR] Specify retain hash bucket size (in bits)],
327 AC_DEFINE_UNQUOTED([XO_RETAIN_SIZE], ${XO_RETAIN_SIZE}, [Retain hash bucket size])
/freebsd/contrib/llvm-project/compiler-rt/lib/interception/
H A Dinterception_win.cpp379 for (size_t bucket = 0; bucket < kMaxTrampolineRegion; ++bucket) { in TestOnlyReleaseTrampolineRegions() local
380 TrampolineMemoryRegion *current = &TrampolineRegions[bucket]; in TestOnlyReleaseTrampolineRegions()
391 for (size_t bucket = 0; bucket < kMaxTrampolineRegion; ++bucket) { in AllocateMemoryForTrampoline() local
392 TrampolineMemoryRegion* current = &TrampolineRegions[bucket]; in AllocateMemoryForTrampoline()
/freebsd/contrib/llvm-project/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_addrhashmap.h115 Bucket *bucket = &table_[n]; in ForEach() local
117 ReadLock lock(&bucket->mtx); in ForEach()
120 Cell *c = &bucket->cells[i]; in ForEach()
128 (AddBucket *)atomic_load(&bucket->add, memory_order_acquire)) { in ForEach()
/freebsd/contrib/llvm-project/libcxx/include/
H A D__hash_table863 _LIBCPP_HIDE_FROM_ABI size_type bucket(const _Key& __k) const {
865 bucket_count() > 0, "unordered container::bucket(key) called when bucket_count() == 0");
1328 // Insert the node __nd into the container by pushing it into the right bucket,
1337 // insert_after __bucket_list_[__chash], or __first_node if bucket is null
1410 // the bucket that compares equal to __cp). Rehashing, and checking for
1412 // all we need to do is update the bucket and size(). Assumes that __cp->__hash
1502 // insert_after __bucket_list_[__chash], or __first_node if bucket is null
1858 // if __pn is not in same bucket (before begin is not in same bucket) &&
1859 // if __cn->__next_ is not in same bucket (nullptr is not in same bucket)
1864 // if __cn->__next_ is not in same bucket (nullptr is in same bucket)
H A Dunordered_map216 size_type bucket(const key_type& k) const;
479 size_type bucket(const key_type& k) const;
1449 _LIBCPP_HIDE_FROM_ABI size_type bucket(const key_type& __k) const { return __table_.bucket(__k); }
2192 _LIBCPP_HIDE_FROM_ABI size_type bucket(const key_type& __k) const { return __table_.bucket(__k); }

12345