/external/libvpx/libvpx/ |
D | rate_hist.c | 33 struct hist_bucket bucket[RATE_BINS]; member 62 hist->bucket[i].low = INT_MAX; in init_rate_histogram() 63 hist->bucket[i].high = 0; in init_rate_histogram() 64 hist->bucket[i].count = 0; in init_rate_histogram() 118 if (hist->bucket[idx].low > avg_bitrate) in update_rate_histogram() 119 hist->bucket[idx].low = (int)avg_bitrate; in update_rate_histogram() 120 if (hist->bucket[idx].high < avg_bitrate) in update_rate_histogram() 121 hist->bucket[idx].high = (int)avg_bitrate; in update_rate_histogram() 122 hist->bucket[idx].count++; in update_rate_histogram() 126 static int merge_hist_buckets(struct hist_bucket *bucket, int max_buckets, in merge_hist_buckets() argument [all …]
|
/external/kmod/shared/ |
D | hash.c | 69 struct hash_bucket *bucket, *bucket_end; in hash_free() local 74 bucket = hash->buckets; in hash_free() 75 bucket_end = bucket + hash->n_buckets; in hash_free() 76 for (; bucket < bucket_end; bucket++) { in hash_free() 79 entry = bucket->entries; in hash_free() 80 entry_end = entry + bucket->used; in hash_free() 84 free(bucket->entries); in hash_free() 151 struct hash_bucket *bucket = hash->buckets + pos; in hash_add() local 154 if (bucket->used + 1 >= bucket->total) { in hash_add() 155 unsigned new_total = bucket->total + hash->step; in hash_add() [all …]
|
/external/libdrm/ |
D | xf86drmHash.c | 127 HashBucketPtr bucket; in drmHashDestroy() local 134 for (bucket = table->buckets[i]; bucket;) { in drmHashDestroy() 135 next = bucket->next; in drmHashDestroy() 136 drmFree(bucket); in drmHashDestroy() 137 bucket = next; in drmHashDestroy() 152 HashBucketPtr bucket; in HashFind() local 156 for (bucket = table->buckets[hash]; bucket; bucket = bucket->next) { in HashFind() 157 if (bucket->key == key) { in HashFind() 160 prev->next = bucket->next; in HashFind() 161 bucket->next = table->buckets[hash]; in HashFind() [all …]
|
/external/pdfium/third_party/base/allocator/partition_allocator/ |
D | partition_alloc.cc | 138 static void PartitionBucketInitBase(PartitionBucket* bucket, in PartitionBucketInitBase() argument 140 bucket->active_pages_head = &PartitionRootGeneric::gSeedPage; in PartitionBucketInitBase() 141 bucket->empty_pages_head = 0; in PartitionBucketInitBase() 142 bucket->decommitted_pages_head = 0; in PartitionBucketInitBase() 143 bucket->num_full_pages = 0; in PartitionBucketInitBase() 144 bucket->num_system_pages_per_slot_span = in PartitionBucketInitBase() 145 PartitionBucketNumSystemPages(bucket->slot_size); in PartitionBucketInitBase() 162 PartitionBucket* bucket = &root->buckets()[i]; in PartitionAllocInit() local 164 bucket->slot_size = kAllocationGranularity; in PartitionAllocInit() 166 bucket->slot_size = i << kBucketShift; in PartitionAllocInit() [all …]
|
D | partition_alloc.h | 266 PartitionBucket* bucket; member 296 PartitionBucket* bucket; member 607 page->bucket->slot_size)); in PartitionPointerToPage() 612 const PartitionBucket* bucket) { in PartitionBucketIsDirectMapped() argument 613 return !bucket->num_system_pages_per_slot_span; in PartitionBucketIsDirectMapped() 616 ALWAYS_INLINE size_t PartitionBucketBytes(const PartitionBucket* bucket) { in PartitionBucketBytes() argument 617 return bucket->num_system_pages_per_slot_span * kSystemPageSize; in PartitionBucketBytes() 620 ALWAYS_INLINE uint16_t PartitionBucketSlots(const PartitionBucket* bucket) { in PartitionBucketSlots() argument 621 return static_cast<uint16_t>(PartitionBucketBytes(bucket) / in PartitionBucketSlots() 622 bucket->slot_size); in PartitionBucketSlots() [all …]
|
/external/mesa3d/src/glx/ |
D | glxhash.c | 179 __glxHashBucketPtr bucket; in __glxHashDestroy() local 187 for (bucket = table->buckets[i]; bucket;) { in __glxHashDestroy() 188 next = bucket->next; in __glxHashDestroy() 189 HASH_FREE(bucket); in __glxHashDestroy() 190 bucket = next; in __glxHashDestroy() 205 __glxHashBucketPtr bucket; in HashFind() local 210 for (bucket = table->buckets[hash]; bucket; bucket = bucket->next) { in HashFind() 211 if (bucket->key == key) { in HashFind() 214 prev->next = bucket->next; in HashFind() 215 bucket->next = table->buckets[hash]; in HashFind() [all …]
|
/external/libcxx/test/std/containers/unord/unord.multiset/ |
D | local_iterators.pass.cpp | 45 C::size_type b = c.bucket(0); in main() 50 b = c.bucket(1); in main() 58 b = c.bucket(2); in main() 66 b = c.bucket(3); in main() 72 b = c.bucket(4); in main() 78 b = c.bucket(5); in main() 83 b = c.bucket(6); in main() 103 C::size_type b = c.bucket(0); in main() 108 b = c.bucket(1); in main() 116 b = c.bucket(2); in main() [all …]
|
D | local_iterators.fail.cpp | 45 C::size_type b = c.bucket(0); in main() 50 b = c.bucket(1); in main() 59 b = c.bucket(2); in main() 67 b = c.bucket(3); in main() 73 b = c.bucket(4); in main() 79 b = c.bucket(5); in main() 84 b = c.bucket(6); in main() 104 C::size_type b = c.bucket(0); in main() 109 b = c.bucket(1); in main() 117 b = c.bucket(2); in main() [all …]
|
/external/parameter-framework/asio-1.10.6/include/asio/detail/ |
D | hash_map.hpp | 103 size_t bucket = calculate_hash_value(k) % num_buckets_; in find() local 104 iterator it = buckets_[bucket].first; in find() 107 iterator end_it = buckets_[bucket].last; in find() 124 size_t bucket = calculate_hash_value(k) % num_buckets_; in find() local 125 const_iterator it = buckets_[bucket].first; in find() 128 const_iterator end_it = buckets_[bucket].last; in find() 145 size_t bucket = calculate_hash_value(v.first) % num_buckets_; in insert() local 146 iterator it = buckets_[bucket].first; in insert() 149 buckets_[bucket].first = buckets_[bucket].last = in insert() 152 return std::pair<iterator, bool>(buckets_[bucket].last, true); in insert() [all …]
|
/external/libcxx/test/std/containers/unord/unord.multimap/ |
D | local_iterators.pass.cpp | 46 C::size_type b = c.bucket(0); in main() 51 b = c.bucket(1); in main() 61 b = c.bucket(2); in main() 71 b = c.bucket(3); in main() 78 b = c.bucket(4); in main() 85 b = c.bucket(5); in main() 90 b = c.bucket(6); in main() 110 C::size_type b = c.bucket(0); in main() 115 b = c.bucket(1); in main() 125 b = c.bucket(2); in main() [all …]
|
D | local_iterators.fail.cpp | 46 C::size_type b = c.bucket(0); in main() 51 b = c.bucket(1); in main() 62 b = c.bucket(2); in main() 72 b = c.bucket(3); in main() 79 b = c.bucket(4); in main() 86 b = c.bucket(5); in main() 91 b = c.bucket(6); in main() 111 C::size_type b = c.bucket(0); in main() 116 b = c.bucket(1); in main() 126 b = c.bucket(2); in main() [all …]
|
/external/libcxx/test/std/containers/unord/unord.set/ |
D | local_iterators.pass.cpp | 45 C::size_type b = c.bucket(0); in main() 50 b = c.bucket(1); in main() 56 b = c.bucket(2); in main() 62 b = c.bucket(3); in main() 68 b = c.bucket(4); in main() 89 C::size_type b = c.bucket(0); in main() 94 b = c.bucket(1); in main() 100 b = c.bucket(2); in main() 106 b = c.bucket(3); in main() 112 b = c.bucket(4); in main() [all …]
|
D | local_iterators.fail.cpp | 43 C::size_type b = c.bucket(0); in main() 48 b = c.bucket(1); in main() 57 b = c.bucket(2); in main() 65 b = c.bucket(3); in main() 71 b = c.bucket(4); in main() 77 b = c.bucket(5); in main() 82 b = c.bucket(6); in main() 102 C::size_type b = c.bucket(0); in main() 107 b = c.bucket(1); in main() 115 b = c.bucket(2); in main() [all …]
|
/external/libmojo/third_party/jinja2/ |
D | bccache.py | 138 def load_bytecode(self, bucket): argument 145 def dump_bytecode(self, bucket): argument 178 bucket = Bucket(environment, key, checksum) 179 self.load_bytecode(bucket) 180 return bucket 182 def set_bucket(self, bucket): argument 184 self.dump_bytecode(bucket) 209 def _get_cache_filename(self, bucket): argument 210 return path.join(self.directory, self.pattern % bucket.key) 212 def load_bytecode(self, bucket): argument [all …]
|
/external/libdrm/etnaviv/ |
D | etnaviv_bo_cache.c | 82 struct etna_bo_bucket *bucket = &cache->cache_bucket[i]; in etna_bo_cache_cleanup() local 85 while (!LIST_IS_EMPTY(&bucket->list)) { in etna_bo_cache_cleanup() 86 bo = LIST_ENTRY(struct etna_bo, bucket->list.next, list); in etna_bo_cache_cleanup() 108 struct etna_bo_bucket *bucket = &cache->cache_bucket[i]; in get_bucket() local 109 if (bucket->size >= size) { in get_bucket() 110 return bucket; in get_bucket() 125 static struct etna_bo *find_in_bucket(struct etna_bo_bucket *bucket, uint32_t flags) in find_in_bucket() argument 130 while (!LIST_IS_EMPTY(&bucket->list)) { in find_in_bucket() 131 bo = LIST_ENTRY(struct etna_bo, bucket->list.next, list); in find_in_bucket() 154 struct etna_bo_bucket *bucket; in etna_bo_cache_alloc() local [all …]
|
/external/libcxx/test/std/containers/unord/unord.map/ |
D | local_iterators.pass.cpp | 46 C::size_type b = c.bucket(0); in main() 51 b = c.bucket(1); in main() 58 b = c.bucket(2); in main() 65 b = c.bucket(3); in main() 72 b = c.bucket(4); in main() 94 C::size_type b = c.bucket(0); in main() 99 b = c.bucket(1); in main() 106 b = c.bucket(2); in main() 113 b = c.bucket(3); in main() 120 b = c.bucket(4); in main() [all …]
|
/external/libdrm/freedreno/ |
D | freedreno_bo_cache.c | 95 struct fd_bo_bucket *bucket = &cache->cache_bucket[i]; in fd_bo_cache_cleanup() local 98 while (!LIST_IS_EMPTY(&bucket->list)) { in fd_bo_cache_cleanup() 99 bo = LIST_ENTRY(struct fd_bo, bucket->list.next, list); in fd_bo_cache_cleanup() 121 struct fd_bo_bucket *bucket = &cache->cache_bucket[i]; in get_bucket() local 122 if (bucket->size >= size) { in get_bucket() 123 return bucket; in get_bucket() 138 static struct fd_bo *find_in_bucket(struct fd_bo_bucket *bucket, uint32_t flags) in find_in_bucket() argument 150 if (!LIST_IS_EMPTY(&bucket->list)) { in find_in_bucket() 151 bo = LIST_ENTRY(struct fd_bo, bucket->list.next, list); in find_in_bucket() 169 struct fd_bo_bucket *bucket; in fd_bo_cache_alloc() local [all …]
|
/external/mesa3d/src/gallium/drivers/nouveau/ |
D | nouveau_mm.c | 36 struct mm_bucket bucket[MM_NUM_BUCKETS]; member 97 return &cache->bucket[MAX2(order, MM_MIN_ORDER) - MM_MIN_ORDER]; in mm_bucket_by_order() 167 struct mm_bucket *bucket; in nouveau_mm_allocate() local 172 bucket = mm_bucket_by_size(cache, size); in nouveau_mm_allocate() 173 if (!bucket) { in nouveau_mm_allocate() 184 if (!LIST_IS_EMPTY(&bucket->used)) { in nouveau_mm_allocate() 185 slab = LIST_ENTRY(struct mm_slab, bucket->used.next, head); in nouveau_mm_allocate() 187 if (LIST_IS_EMPTY(&bucket->free)) { in nouveau_mm_allocate() 190 slab = LIST_ENTRY(struct mm_slab, bucket->free.next, head); in nouveau_mm_allocate() 193 LIST_ADD(&slab->head, &bucket->used); in nouveau_mm_allocate() [all …]
|
/external/libchrome/base/trace_event/ |
D | heap_profiler_heap_dump_writer.cc | 79 std::vector<Bucket> GetSubbuckets(const Bucket& bucket, in GetSubbuckets() argument 85 for (const auto& context_and_metrics : bucket.metrics_by_context) { in GetSubbuckets() 89 const StackFrame* cursor = begin + bucket.backtrace_cursor; in GetSubbuckets() 98 subbucket.backtrace_cursor = bucket.backtrace_cursor + 1; in GetSubbuckets() 100 bucket.is_broken_down_by_type_name; in GetSubbuckets() 106 if (!bucket.is_broken_down_by_type_name) { in GetSubbuckets() 107 for (const auto& context_and_metrics : bucket.metrics_by_context) { in GetSubbuckets() 113 subbucket.backtrace_cursor = bucket.backtrace_cursor; in GetSubbuckets() 131 std::vector<Bucket> BreakDownBy(const Bucket& bucket, in BreakDownBy() argument 134 std::vector<Bucket> buckets = GetSubbuckets(bucket, break_by); in BreakDownBy() [all …]
|
/external/tensorflow/tensorflow/core/platform/s3/ |
D | s3_file_system.cc | 142 Status ParseS3Path(const string& fname, bool empty_object_ok, string* bucket, in ParseS3Path() argument 144 if (!bucket || !object) { in ParseS3Path() 153 *bucket = bucketp.ToString(); in ParseS3Path() 154 if (bucket->empty() || *bucket == ".") { in ParseS3Path() 169 S3RandomAccessFile(const string& bucket, const string& object, in S3RandomAccessFile() argument 171 : bucket_(bucket), object_(object), s3_client_(s3_client) {} in S3RandomAccessFile() 205 S3WritableFile(const string& bucket, const string& object, in S3WritableFile() argument 207 : bucket_(bucket), in S3WritableFile() 325 string bucket, object; in NewRandomAccessFile() local 326 TF_RETURN_IF_ERROR(ParseS3Path(fname, false, &bucket, &object)); in NewRandomAccessFile() [all …]
|
/external/icu/icu4j/main/classes/collate/src/com/ibm/icu/text/ |
D | AlphabeticIndex.java | 645 for (Bucket<V> bucket : buckets) { in getBucketLabels() 646 result.add(bucket.getLabel()); in getBucketLabels() 810 Bucket<V> bucket = currentBucket; in initBuckets() local 811 if (bucket.displayBucket != null) { in initBuckets() 812 bucket = bucket.displayBucket; in initBuckets() 814 if (bucket.records == null) { in initBuckets() 815 bucket.records = new ArrayList<Record<V>>(); in initBuckets() 817 bucket.records.add(r); in initBuckets() 1059 Bucket<V> bucket = new Bucket<V>(fixLabel(current), current, LabelType.NORMAL); in createBucketList() local 1060 bucketList.add(bucket); in createBucketList() [all …]
|
/external/icu/android_icu4j/src/main/java/android/icu/text/ |
D | AlphabeticIndex.java | 624 for (Bucket<V> bucket : buckets) { in getBucketLabels() 625 result.add(bucket.getLabel()); in getBucketLabels() 782 Bucket<V> bucket = currentBucket; in initBuckets() local 783 if (bucket.displayBucket != null) { in initBuckets() 784 bucket = bucket.displayBucket; in initBuckets() 786 if (bucket.records == null) { in initBuckets() 787 bucket.records = new ArrayList<Record<V>>(); in initBuckets() 789 bucket.records.add(r); in initBuckets() 1013 Bucket<V> bucket = new Bucket<V>(fixLabel(current), current, LabelType.NORMAL); in createBucketList() local 1014 bucketList.add(bucket); in createBucketList() [all …]
|
/external/chromium-trace/catapult/common/py_utils/py_utils/ |
D | cloud_storage.py | 190 def List(bucket): argument 191 query = 'gs://%s/' % bucket 196 def Exists(bucket, remote_path): argument 198 _RunCommand(['ls', 'gs://%s/%s' % (bucket, remote_path)]) 229 def Delete(bucket, remote_path): argument 230 url = 'gs://%s/%s' % (bucket, remote_path) 235 def Get(bucket, remote_path, local_path): argument 237 _GetLocked(bucket, remote_path, local_path) 338 def _GetLocked(bucket, remote_path, local_path): argument 339 url = 'gs://%s/%s' % (bucket, remote_path) [all …]
|
/external/tensorflow/tensorflow/core/platform/cloud/ |
D | gcs_file_system.cc | 158 Status ParseGcsPath(StringPiece fname, bool empty_object_ok, string* bucket, in ParseGcsPath() argument 160 if (!bucket || !object) { in ParseGcsPath() 169 *bucket = bucketp.ToString(); in ParseGcsPath() 170 if (bucket->empty() || *bucket == ".") { in ParseGcsPath() 326 GcsWritableFile(const string& bucket, const string& object, in GcsWritableFile() argument 331 : bucket_(bucket), in GcsWritableFile() 350 GcsWritableFile(const string& bucket, const string& object, in GcsWritableFile() argument 355 : bucket_(bucket), in GcsWritableFile() 777 string bucket, object; in NewRandomAccessFile() local 778 TF_RETURN_IF_ERROR(ParseGcsPath(fname, false, &bucket, &object)); in NewRandomAccessFile() [all …]
|
/external/jemalloc/src/ |
D | ckh.c | 53 ckh_bucket_search(ckh_t *ckh, size_t bucket, const void *key) in ckh_bucket_search() argument 59 cell = &ckh->tab[(bucket << LG_CKH_BUCKET_CELLS) + i]; in ckh_bucket_search() 61 return ((bucket << LG_CKH_BUCKET_CELLS) + i); in ckh_bucket_search() 73 size_t hashes[2], bucket, cell; in ckh_isearch() local 80 bucket = hashes[0] & ((ZU(1) << ckh->lg_curbuckets) - 1); in ckh_isearch() 81 cell = ckh_bucket_search(ckh, bucket, key); in ckh_isearch() 86 bucket = hashes[1] & ((ZU(1) << ckh->lg_curbuckets) - 1); in ckh_isearch() 87 cell = ckh_bucket_search(ckh, bucket, key); in ckh_isearch() 92 ckh_try_bucket_insert(ckh_t *ckh, size_t bucket, const void *key, in ckh_try_bucket_insert() argument 105 cell = &ckh->tab[(bucket << LG_CKH_BUCKET_CELLS) + in ckh_try_bucket_insert() [all …]
|