/external/kmod/shared/ |
H A D | hash.h | 9 unsigned int bucket; member in struct:hash_iter
|
H A D | hash.c | 69 struct hash_bucket *bucket, *bucket_end; local 74 bucket = hash->buckets; 75 bucket_end = bucket + hash->n_buckets; 76 for (; bucket < bucket_end; bucket++) { 79 entry = bucket->entries; 80 entry_end = entry + bucket->used; 84 free(bucket->entries); 151 struct hash_bucket *bucket = hash->buckets + pos; local 154 if (bucket 194 struct hash_bucket *bucket = hash->buckets + pos; local 239 const struct hash_bucket *bucket = hash->buckets + pos; local 258 struct hash_bucket *bucket = hash->buckets + pos; local [all...] |
/external/libdrm/tests/ |
H A D | hash.c | 87 static int count_entries(HashBucketPtr bucket) argument 91 for (; bucket; bucket = bucket->next) 107 HashBucketPtr bucket; local 113 bucket = table->buckets[i]; 114 update_dist(count_entries(bucket));
|
/external/chromium-trace/catapult/telemetry/telemetry/story/ |
H A D | story_set.py | 26 cloud_storage_bucket: The cloud storage bucket used to download 89 def bucket(self): member in class:StorySet 97 os.path.join(self.base_dir, self.archive_data_file), self.bucket)
|
/external/fio/ |
H A D | filehash.c | 49 struct flist_head *bucket = &file_hash[hash(name)]; local 52 flist_for_each(n, bucket) {
|
/external/libchrome/base/trace_event/ |
H A D | trace_sampling_thread.cc | 17 TraceBucketData(base::subtle::AtomicWord* bucket, 22 TRACE_EVENT_API_ATOMIC_WORD* bucket; member in class:base::trace_event::TraceBucketData 50 TRACE_EVENT_API_ATOMIC_LOAD(*bucket_data->bucket); 73 TRACE_EVENT_API_ATOMIC_WORD* bucket, 80 sample_buckets_.push_back(TraceBucketData(bucket, name, callback)); 99 TraceBucketData::TraceBucketData(base::subtle::AtomicWord* bucket, argument 102 : bucket(bucket), bucket_name(name), callback(callback) {} 72 RegisterSampleBucket( TRACE_EVENT_API_ATOMIC_WORD* bucket, const char* const name, TraceSampleCallback callback) argument
|
H A D | heap_profiler_heap_dump_writer.cc | 30 // The pairs are grouped into |Bucket|s. A bucket is a group of (context, size) 33 // bucket that represents the entire heap. Then this bucket is recursively 34 // broken down into smaller buckets. Each bucket keeps track of whether further 63 // elements in this bucket, the stack frames 0 up to (but not including) the 67 // When true, the type name for all elements in this bucket must be equal. 76 // Groups the allocations in the bucket by |break_by|. The buckets in the 79 std::vector<Bucket> GetSubbuckets(const Bucket& bucket, argument 85 for (const auto& context_and_metrics : bucket.metrics_by_context) { 89 const StackFrame* cursor = begin + bucket 131 BreakDownBy(const Bucket& bucket, BreakDownMode break_by, size_t min_size_bytes) argument 192 AddEntryForBucket(const Bucket& bucket) argument 220 BreakDown(const Bucket& bucket) argument [all...] |
/external/libdrm/ |
H A D | xf86drmHash.c | 127 HashBucketPtr bucket; local 134 for (bucket = table->buckets[i]; bucket;) { 135 next = bucket->next; 136 drmFree(bucket); 137 bucket = next; 144 /* Find the bucket and organize the list so that this bucket is at the 152 HashBucketPtr bucket; local 156 for (bucket 178 HashBucketPtr bucket; local 191 HashBucketPtr bucket; local 214 HashBucketPtr bucket; local [all...] |
/external/mesa3d/src/gallium/drivers/svga/ |
H A D | svga_screen_cache.h | 79 /** Head for the bucket lists. */ 107 struct list_head bucket[SVGA_HOST_SURFACE_CACHE_BUCKETS]; member in struct:svga_host_surface_cache
|
H A D | svga_screen_cache.c | 77 * Compute the bucket for this key. 100 unsigned bucket; local 105 bucket = svga_screen_cache_bucket(key); 109 curr = cache->bucket[bucket].next; 111 while (curr != &cache->bucket[bucket]) { 151 debug_printf("%s: cache %s after %u tries (bucket %d)\n", __FUNCTION__, 152 handle ? "hit" : "miss", tries, bucket); 304 unsigned bucket; local [all...] |
/external/blktrace/ |
H A D | stats.h | 116 static inline void histlog2_account(__u32 *bucket, __u32 val, argument 120 bucket[index]++;
|
/external/libdrm/freedreno/ |
H A D | freedreno_bo.c | 56 /* don't break the bucket if this bo was found in one */ 95 struct fd_bo_bucket *bucket = &dev->cache_bucket[i]; local 98 while (!LIST_IS_EMPTY(&bucket->list)) { 99 bo = LIST_ENTRY(struct fd_bo, bucket->list.next, list); 118 * way to the correct bucket size rather than looping.. 121 struct fd_bo_bucket *bucket = &dev->cache_bucket[i]; local 122 if (bucket->size >= size) { 123 return bucket; 139 struct fd_bo_bucket *bucket, uint32_t flags) 151 while (!LIST_IS_EMPTY(&bucket 138 find_in_bucket(struct fd_device *dev, struct fd_bo_bucket *bucket, uint32_t flags) argument 177 struct fd_bo_bucket *bucket; local 304 struct fd_bo_bucket *bucket = get_bucket(dev, bo->size); local [all...] |
/external/llvm/lib/CodeGen/AsmPrinter/ |
H A D | DwarfAccelTable.cpp | 54 // Then compute the bucket size, minimum of 1 bucket. 87 // Figure out how many buckets we need, then compute the bucket 94 // Compute bucket contents and final ordering. 97 uint32_t bucket = Data[i]->HashValue % Header.bucket_count; local 98 Buckets[bucket].push_back(Data[i]); 162 // bucket. 180 // element in each bucket. This is done via a symbol subtraction from the 204 // the bucket. For the string case emit the dies and the various offsets. 205 // Terminate each HashData bucket wit [all...] |
/external/mesa3d/src/mesa/program/ |
H A D | hash_table.c | 115 const unsigned bucket = hash_value % ht->num_buckets; local 118 foreach(node, & ht->buckets[bucket]) { 141 const unsigned bucket = hash_value % ht->num_buckets; local 149 insert_at_head(& ht->buckets[bucket], & node->link); 156 const unsigned bucket = hash_value % ht->num_buckets; local 160 foreach(node, & ht->buckets[bucket]) { 174 insert_at_head(& ht->buckets[bucket], & hn->link); 196 int bucket; local 198 for (bucket = 0; bucket < h [all...] |
/external/freetype/src/cache/ |
H A D | ftccache.c | 87 /* get a top bucket for specified hash from cache, 130 * the bucket lists 144 /* split a single bucket */ 488 FTC_Node* bucket; local 501 bucket = pnode = FTC_NODE__TOP_FOR_HASH( cache, hash ); 520 /* Update bucket by modified linked list */ 521 bucket = pnode = FTC_NODE__TOP_FOR_HASH( cache, hash ); 537 if ( node != *bucket ) 540 node->link = *bucket; 541 *bucket 575 FTC_Node* bucket = cache->buckets + i; local [all...] |
/external/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...] |
/external/libnetfilter_conntrack/src/conntrack/ |
H A D | labels.c | 25 struct labelmap_bucket *bucket; local 31 bucket = malloc(sizeof(*bucket)); 32 if (!bucket) { 36 bucket->name = name; 37 bucket->bit = b; 38 return bucket;
|
/external/libnl/lib/route/qdisc/ |
H A D | tbf.c | 108 nl_dump(p, "rate-bucket-size %1.f%s " 125 "bucket-size %.1f%s cell-size %.1f%s" 190 int bucket) 195 limit += bucket; 262 static inline int calc_cell_log(int cell, int bucket) argument 272 * @arg bucket Size of bucket in bytes. 276 void rtnl_qdisc_tbf_set_rate(struct rtnl_qdisc *qdisc, int rate, int bucket, argument 291 tbf->qt_rate_bucket = bucket; 293 tbf->qt_rate_txtime = nl_us2ticks(rtnl_tc_calc_txtime(bucket, rat 189 calc_limit(struct rtnl_ratespec *spec, int latency, int bucket) argument 359 rtnl_qdisc_tbf_set_peakrate(struct rtnl_qdisc *qdisc, int rate, int bucket, int cell) argument [all...] |
/external/libvpx/libvpx/ |
H A D | rate_hist.c | 33 struct hist_bucket bucket[RATE_BINS]; member in struct:rate_hist 62 hist->bucket[i].low = INT_MAX; 63 hist->bucket[i].high = 0; 64 hist->bucket[i].count = 0; 118 if (hist->bucket[idx].low > avg_bitrate) 119 hist->bucket[idx].low = (int)avg_bitrate; 120 if (hist->bucket[idx].high < avg_bitrate) 121 hist->bucket[idx].high = (int)avg_bitrate; 122 hist->bucket[idx].count++; 126 static int merge_hist_buckets(struct hist_bucket *bucket, in argument 194 show_histogram(const struct hist_bucket *bucket, int buckets, int total, int scale) argument 254 struct hist_bucket bucket[64]; local [all...] |
/external/mesa3d/src/gallium/drivers/nouveau/ |
H A D | nouveau_mm.c | 29 struct mm_bucket bucket[MM_NUM_BUCKETS]; member in struct:nouveau_mman 90 return &cache->bucket[MAX2(order, MM_MIN_ORDER) - MM_MIN_ORDER]; 160 struct mm_bucket *bucket; local 165 bucket = mm_bucket_by_size(cache, size); 166 if (!bucket) { 177 if (!LIST_IS_EMPTY(&bucket->used)) { 178 slab = LIST_ENTRY(struct mm_slab, bucket->used.next, head); 180 if (LIST_IS_EMPTY(&bucket->free)) { 183 slab = LIST_ENTRY(struct mm_slab, bucket->free.next, head); 186 LIST_ADD(&slab->head, &bucket 213 struct mm_bucket *bucket = mm_bucket_by_order(slab->cache, slab->order); local [all...] |
/external/mesa3d/src/glx/ |
H A D | glxhash.c | 179 __glxHashBucketPtr bucket; local 187 for (bucket = table->buckets[i]; bucket;) { 188 next = bucket->next; 189 HASH_FREE(bucket); 190 bucket = next; 197 /* Find the bucket and organize the list so that this bucket is at the 205 __glxHashBucketPtr bucket; local 210 for (bucket 234 __glxHashBucketPtr bucket; local 250 __glxHashBucketPtr bucket; local 277 __glxHashBucketPtr bucket; local 337 count_entries(__glxHashBucketPtr bucket) argument 359 __glxHashBucketPtr bucket; local [all...] |
/external/parameter-framework/asio/include/asio/detail/ |
H A D | hash_map.hpp | 103 size_t bucket = calculate_hash_value(k) % num_buckets_; local 104 iterator it = buckets_[bucket].first; 107 iterator end_it = buckets_[bucket].last; 124 size_t bucket = calculate_hash_value(k) % num_buckets_; local 125 const_iterator it = buckets_[bucket].first; 128 const_iterator end_it = buckets_[bucket].last; 145 size_t bucket = calculate_hash_value(v.first) % num_buckets_; local 146 iterator it = buckets_[bucket].first; 149 buckets_[bucket].first = buckets_[bucket] 173 size_t bucket = calculate_hash_value(it->first) % num_buckets_; local 250 std::size_t bucket = calculate_hash_value(iter->first) % num_buckets_; local [all...] |
/external/parameter-framework/asio-1.10.6/include/asio/detail/ |
H A D | hash_map.hpp | 103 size_t bucket = calculate_hash_value(k) % num_buckets_; local 104 iterator it = buckets_[bucket].first; 107 iterator end_it = buckets_[bucket].last; 124 size_t bucket = calculate_hash_value(k) % num_buckets_; local 125 const_iterator it = buckets_[bucket].first; 128 const_iterator end_it = buckets_[bucket].last; 145 size_t bucket = calculate_hash_value(v.first) % num_buckets_; local 146 iterator it = buckets_[bucket].first; 149 buckets_[bucket].first = buckets_[bucket] 173 size_t bucket = calculate_hash_value(it->first) % num_buckets_; local 250 std::size_t bucket = calculate_hash_value(iter->first) % num_buckets_; local [all...] |
/external/icu/icu4c/source/test/intltest/ |
H A D | alphaindextst.cpp | 35 const AlphabeticIndex::Bucket *bucket; local 36 for (int32_t i = 0; (bucket = index.getBucket(i)) != NULL; ++i) { 40 dest.append(bucket->getLabel()); 370 assertEquals("initial bucket index", -1, index.getBucketIndex()); 374 assertEquals("bucket index", bucketIndex, index.getBucketIndex()); 379 const AlphabeticIndex::Bucket *bucket = immIndex->getBucket(bucketIndex); local 380 TEST_ASSERT(bucket != NULL); 381 assertEquals("bucket label vs. immutable: locale=" + UnicodeString(localeName) + 383 label, bucket->getLabel()); 384 TEST_ASSERT(&label != &bucket [all...] |
/external/libdrm/amdgpu/ |
H A D | util_hash.c | 196 struct util_node **bucket = hash->buckets; local 199 if (*bucket != e) 200 return *bucket; 201 ++bucket; 267 struct util_node **bucket = (struct util_node **)(hash->data.d->buckets); local 270 struct util_node *cur = *bucket++; 312 struct util_node **bucket; local 324 bucket = a.d->buckets + start; 327 if (*bucket != a.e) 328 return *bucket; [all...] |