| /fuchsia/zircon/kernel/lib/pow2_range_allocator/ |
| H A D | pow2_range_allocator.cpp | 23 uint bucket; member in struct:p2ra_block
58 DEBUG_ASSERT(block->bucket < state->bucket_count);
60 DEBUG_ASSERT(!(block->start & ((1u << block->bucket) - 1)));
62 /* Return the block to its proper free bucket, sorted by base ID. Start by
64 struct list_node* l = &state->free_block_buckets[block->bucket];
66 uint block_len = 1u << block->bucket;
70 __UNUSED uint after_len = 1u << after->bucket;
87 /* Don't merge blocks in the largest bucket. */
88 if (block->bucket + 1 == state->bucket_count)
106 uint first_len = 1u << first->bucket;
226 uint bucket = state->bucket_count - 1; local
298 uint bucket = orig_bucket; local
367 uint bucket = log2_uint_floor(size); local
[all...] |
| /fuchsia/zircon/system/ulib/cobalt-client/include/cobalt-client/cpp/ |
| H A D | histogram-internal.h | 42 // Increases the count of the |bucket| bucket by 1.
43 void IncrementCount(uint32_t bucket, Count val = 1) { argument
44 ZX_DEBUG_ASSERT_MSG(bucket < buckets_.size(),
45 "IncrementCount bucket(%u) out of range(%lu).", bucket,
47 buckets_[bucket].Increment(val);
50 // Returns the count of the |bucket| bucket.
51 Count GetCount(uint32_t bucket) cons
[all...] |
| /fuchsia/zircon/system/utest/cobalt-client/ |
| H A D | histogram_test.cpp | 84 // Verify the count of the appropiate bucket is updated on increment.
89 // Increase the count of each bucket bucket_index times.
98 // Verify that the operations are isolated, each bucket should have bucket_index counts.
105 // Verify the count of the appropiate bucket is updated on increment with a specified value. This
111 // Increase the count of each bucket bucket_index times.
118 // Verify that the operations are isolated, each bucket should have bucket_index counts.
136 // Increment each bucket by 2* operations * bucket_index.
141 for (uint32_t bucket = 0; bucket < kBuckets; ++bucket) {
382 uint32_t bucket; member in struct:cobalt_client::internal::__anon1305::ValueBucket
512 uint32_t bucket = rand_r(&seed) % (kBuckets + 2); local
576 uint32_t bucket = rand_r(&seed) % (kBuckets + 2); local
[all...] |
| H A D | collector_test.cpp | 99 for (auto& bucket : histogram.event_data()) {
100 (*persisted)->IncrementCount(bucket.index, bucket.count);
247 // -4 goes to underflow bucket(0)
252 // -1 goes to first non underflow bucket(1)
293 // -4 goes to underflow bucket(0)
298 // -1 goes to first non underflow bucket(1), and its expected to be 0 because the logger failed.
308 // All histograms have the same shape bucket for simplicity,
435 // Each bucket is increased |index| + |i| for each thread recording observations.
|
| /fuchsia/zircon/system/ulib/fbl/include/fbl/ |
| H A D | intrusive_hash_table.h | 105 // Hash tables only support constant order erase if their underlying bucket
112 static_assert(kNumBuckets > 0, "Hash tables must have at least one bucket");
137 BucketType& bucket = GetBucket(key); local
143 ZX_DEBUG_ASSERT(FindInBucket(bucket, key).IsValid() == false);
145 bucket.push_front(fbl::move(ptr));
169 auto& bucket = buckets_[ndx]; local
170 auto bucket_iter = FindInBucket(bucket, key);
177 bucket.push_front(fbl::move(ptr));
179 if (iter) *iter = iterator(this, ndx, bucket.begin());
198 auto& bucket local
217 auto& bucket = buckets_[ndx]; local
226 const auto& bucket = buckets_[ndx]; local
234 BucketType& bucket = GetBucket(key); local
295 auto& bucket = buckets_[i]; local
338 BucketBegin(BucketType& bucket) argument
339 BucketEnd(BucketType& bucket) argument
348 BucketBegin(const BucketType& bucket) argument
349 BucketEnd(const BucketType& bucket) argument
404 auto& bucket = GetBucket(bucket_ndx_); local
471 auto& bucket = GetBucket(bucket_ndx_); local
489 direct_erase(BucketType& bucket, ValueType& obj) argument
498 FindInBucket(BucketType& bucket, const KeyType& key) argument
506 FindInBucket(const BucketType& bucket, const KeyType& key) argument
[all...] |
| /fuchsia/zircon/third_party/ulib/jemalloc/src/ |
| H A D | ckh.c | 4 * hash bucket contains 2^n cells, for n >= 1, and 2 indicates that two hash
24 * | #cells/bucket |
32 * The number of cells per bucket is chosen such that a bucket fits in one cache
49 * Search bucket for key and return the cell number if found; SIZE_T_MAX
53 ckh_bucket_search(ckh_t *ckh, size_t bucket, const void *key) argument
59 cell = &ckh->tab[(bucket << LG_CKH_BUCKET_CELLS) + i];
61 return ((bucket << LG_CKH_BUCKET_CELLS) + i);
73 size_t hashes[2], bucket, cell; local
79 /* Search primary bucket
92 ckh_try_bucket_insert(ckh_t *ckh, size_t bucket, const void *key, const void *data) argument
130 size_t hashes[2], bucket, tbucket; local
198 size_t hashes[2], bucket; local
[all...] |
| /fuchsia/zircon/system/ulib/cobalt-client/ |
| H A D | histogram.cpp | 103 HistogramBucket bucket; local
104 bucket.count = 0;
105 bucket.index = i;
106 bucket_buffer_.push_back(bucket);
122 // Sets every bucket back to 0, not all buckets will be at the same instant, but
176 uint32_t bucket = options_->map_fn(dbl_value, *options_); local
177 remote_histogram_->IncrementCount(bucket, times);
182 uint32_t bucket = options_->map_fn(dbl_value, *options_); local
183 return remote_histogram_->GetCount(bucket);
|
| H A D | collector.cpp | 100 for (auto& bucket : buffer.event_data()) {
101 if (bucket.count > 0) {
102 histogram->IncrementCount(bucket.index, bucket.count);
|
| /fuchsia/zircon/third_party/ulib/musl/src/network/ |
| H A D | if_nameindex.c | 29 int index, type, namelen, bucket; local
51 bucket = index % IFADDRS_HASH_SIZE;
52 i = ctx->hash[bucket];
77 map->hash_next = ctx->hash[bucket];
78 ctx->hash[bucket] = ctx->num;
|
| H A D | getifaddrs.c | 160 unsigned int bucket = ifs->index % IFADDRS_HASH_SIZE; local
161 ifs->hash_next = ctx->hash[bucket];
162 ctx->hash[bucket] = ifs;
|
| /fuchsia/zircon/system/utest/evil/ |
| H A D | evil.c | 102 void* bucket[BUCKETS]; member in struct:info
124 if (info->bucket[n] == NULL) {
128 info->bucket[n] = malloc(info->size[n]);
130 if (info->bucket[n] == NULL) {
134 memset(info->bucket[n], info->n * n, info->size[n]);
137 uint8_t* x = info->bucket[n];
141 printf("blaster %d bad bucket %d\n", info->n, n);
147 free(info->bucket[n]);
|
| /fuchsia/zircon/kernel/lib/heap/cmpctmalloc/ |
| H A D | cmpctmalloc.c | 41 // and pointed to by a free bucket.
47 // appropriate free bucket and picked up later in the cmpct_alloc()
49 // and is returned directly via a |free_t** bucket| param.
57 // bucket, or can be allocated and managed by the user.
64 // - FREE_BIT: The area is free, and lives in a free bucket.
71 // the appropriately-sized free bucket.
75 // bucket.
84 // Allocations are always rounded up to the nearest bucket size. This would
90 // 576 byte bucket, where it is available for the next of the common 528 byte
95 // bucket, sinc
361 free_t** bucket = &theheap.free_lists[index]; local
426 unlink_free(free_t* free_area, int bucket) argument
629 unsigned bucket; local
916 int bucket = find_nonempty_bucket(start_bucket); local
[all...] |