| /third_party/node/deps/v8/src/heap/ |
| D | slot-set.h | 132 // Each bucket is a bitmap with a bit corresponding to a single slot offset.
136 FREE_EMPTY_BUCKETS, // An empty bucket will be deallocated immediately.
137 KEEP_EMPTY_BUCKETS // An empty bucket will be kept.
155 size_t buckets_size = buckets * sizeof(Bucket*); in Allocate()
166 *slot_set->bucket(i) = nullptr; in Allocate()
182 DCHECK_NULL(*slot_set->bucket(i)); in Delete()
194 // Converts the slot offset into bucket index.
208 Bucket* bucket = LoadBucket<access_mode>(bucket_index); in Insert() local
209 if (bucket == nullptr) { in Insert()
210 bucket = new Bucket; in Insert()
[all …]
|
| /third_party/icu/icu4j/main/classes/collate/src/com/ibm/icu/text/ |
| D | AlphabeticIndex.java | 19 import com.ibm.icu.text.AlphabeticIndex.Bucket;
20 import com.ibm.icu.text.AlphabeticIndex.Bucket.LabelType;
43 * (bucket) of a larger "target" list. That is, each label corresponds to a bucket in
44 * the target list, where everything in the bucket is greater than or equal to the character
46 * they will be in sorted order in the right bucket.
51 * into an inflow bucket between the other two scripts.
72 * for (AlphabeticIndex.Bucket<Integer> bucket : index) {
73 * if (showAll || bucket.size() != 0) {
74 * showLabelAtTop(UI, bucket.getLabel());
80 * for (AlphabeticIndex.Bucket<Integer> bucket : index) {
[all …]
|
| /third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/text/ |
| D | AlphabeticIndex.java | 20 import ohos.global.icu.text.AlphabeticIndex.Bucket;
21 import ohos.global.icu.text.AlphabeticIndex.Bucket.LabelType;
44 * (bucket) of a larger "target" list. That is, each label corresponds to a bucket in
45 * the target list, where everything in the bucket is greater than or equal to the character
47 * they will be in sorted order in the right bucket.
52 * into an inflow bucket between the other two scripts.
73 * for (AlphabeticIndex.Bucket<Integer> bucket : index) {
74 * if (showAll || bucket.size() != 0) {
75 * showLabelAtTop(UI, bucket.getLabel());
81 * for (AlphabeticIndex.Bucket<Integer> bucket : index) {
[all …]
|
| /third_party/libdrm/ |
| D | xf86drmHash.c | 119 HashBucketPtr bucket; in drmHashDestroy() local
126 for (bucket = table->buckets[i]; bucket;) { in drmHashDestroy()
127 next = bucket->next; in drmHashDestroy()
128 drmFree(bucket); in drmHashDestroy()
129 bucket = next; in drmHashDestroy()
136 /* Find the bucket and organize the list so that this bucket is at the
144 HashBucketPtr bucket; in HashFind() local
148 for (bucket = table->buckets[hash]; bucket; bucket = bucket->next) { in HashFind()
149 if (bucket->key == key) { in HashFind()
152 prev->next = bucket->next; in HashFind()
[all …]
|
| /third_party/jinja2/ |
| D | bccache.py | 44 class Bucket: class
60 """Resets the bucket (unloads the bytecode)."""
85 raise TypeError("can't write empty bucket")
104 these methods are passed a :class:`~jinja2.bccache.Bucket`.
115 def load_bytecode(self, bucket):
116 filename = path.join(self.directory, bucket.key)
119 bucket.load_bytecode(f)
121 def dump_bytecode(self, bucket):
122 filename = path.join(self.directory, bucket.key)
124 bucket.write_bytecode(f)
[all …]
|
| /third_party/spirv-tools/source/ |
| D | enum_set.h | 35 // - Enums are stored in buckets (64 contiguous values max per bucket)
42 // - bucket 0, storing values in the range [ 0; 64[
43 // - bucket 1, storing values in the range [64; 128[
45 // - Buckets are stored in a sorted vector (sorted by bucket range).
46 // - Retrieval is done by computing the theoretical bucket index using the enum
49 // - Insertion is done by retrieving the bucket and either:
50 // - inserting a new bucket in the sorted vector when no buckets has a
52 // - setting the corresponding bit in the bucket.
54 // bucket is available. In our case, this happens at most 23 times for the
65 // Each bucket can hold up to `kBucketSize` distinct, contiguous enum values.
[all …]
|
| /third_party/mesa3d/src/gallium/drivers/nouveau/ |
| D | nouveau_mm.c | 38 struct mm_bucket bucket[MM_NUM_BUCKETS]; member
99 return &cache->bucket[MAX2(order, MM_MIN_ORDER) - MM_MIN_ORDER]; in mm_bucket_by_order()
123 mm_slab_new(struct nouveau_mman *cache, struct mm_bucket *bucket, int chunk_order) in mm_slab_new() argument
129 simple_mtx_assert_locked(&bucket->lock); in mm_slab_new()
155 assert(bucket == mm_bucket_by_order(cache, chunk_order)); in mm_slab_new()
156 list_add(&slab->head, &bucket->free); in mm_slab_new()
172 struct mm_bucket *bucket; in nouveau_mm_allocate() local
177 bucket = mm_bucket_by_size(cache, size); in nouveau_mm_allocate()
178 if (!bucket) { in nouveau_mm_allocate()
193 simple_mtx_lock(&bucket->lock); in nouveau_mm_allocate()
[all …]
|
| /third_party/node/deps/v8/third_party/jinja2/ |
| D | bccache.py | 37 class Bucket(object): class
53 """Resets the bucket (unloads the bytecode)."""
78 raise TypeError("can't write empty bucket")
97 these methods are passed a :class:`~jinja2.bccache.Bucket`.
108 def load_bytecode(self, bucket):
109 filename = path.join(self.directory, bucket.key)
112 bucket.load_bytecode(f)
114 def dump_bytecode(self, bucket):
115 filename = path.join(self.directory, bucket.key)
117 bucket.write_bytecode(f)
[all …]
|
| /third_party/skia/third_party/externals/jinja2/ |
| D | bccache.py | 37 class Bucket(object): class
53 """Resets the bucket (unloads the bytecode)."""
78 raise TypeError("can't write empty bucket")
97 these methods are passed a :class:`~jinja2.bccache.Bucket`.
108 def load_bytecode(self, bucket):
109 filename = path.join(self.directory, bucket.key)
112 bucket.load_bytecode(f)
114 def dump_bytecode(self, bucket):
115 filename = path.join(self.directory, bucket.key)
117 bucket.write_bytecode(f)
[all …]
|
| /third_party/skia/third_party/externals/angle2/infra/config/generated/ |
| D | luci-scheduler.cfg | 13 bucket: "luci.angle.ci"
23 bucket: "luci.angle.ci"
33 bucket: "luci.angle.ci"
43 bucket: "luci.angle.ci"
53 bucket: "luci.angle.ci"
63 bucket: "luci.angle.ci"
73 bucket: "luci.angle.ci"
83 bucket: "luci.angle.ci"
93 bucket: "luci.angle.ci"
103 bucket: "luci.angle.ci"
[all …]
|
| /third_party/node/tools/inspector_protocol/jinja2/ |
| D | bccache.py | 60 class Bucket(object): class
76 """Resets the bucket (unloads the bytecode)."""
101 raise TypeError('can\'t write empty bucket')
120 these methods are passed a :class:`~jinja2.bccache.Bucket`.
131 def load_bytecode(self, bucket):
132 filename = path.join(self.directory, bucket.key)
135 bucket.load_bytecode(f)
137 def dump_bytecode(self, bucket):
138 filename = path.join(self.directory, bucket.key)
140 bucket.write_bytecode(f)
[all …]
|
| /third_party/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()
197 /* Find the bucket and organize the list so that this bucket is at the
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()
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Support/ |
| D | FoldingSet.cpp | 184 /// GetNextPtr - In order to save space, each bucket is a
188 /// Nodes. If NextInBucketPtr is a bucket pointer, this method returns null:
191 // The low bit is set if this is the pointer back to the bucket. in GetNextPtr()
202 assert((Ptr & 1) && "Not a bucket pointer"); in GetBucketPtr()
206 /// GetBucketFor - Hash the specified node ID and return the hash bucket for
214 /// AllocateBuckets - Allocated initialized bucket memory.
218 // Set the very last bucket to be a non-null "pointer". in AllocateBuckets()
259 // Set all but the last bucket to null pointers. in clear()
262 // Set the very last bucket to be a non-null "pointer". in clear()
271 assert(isPowerOf2_32(NewBucketCount) && "Bad bucket count!"); in GrowBucketCount()
[all …]
|
| /third_party/node/deps/cares/src/lib/ |
| D | ares__htable_strvp.c | 60 static const void *bucket_key(const void *bucket) in bucket_key() argument
62 const ares__htable_strvp_bucket_t *arg = bucket; in bucket_key()
66 static void bucket_free(void *bucket) in bucket_free() argument
68 ares__htable_strvp_bucket_t *arg = bucket; in bucket_free()
118 ares__htable_strvp_bucket_t *bucket = NULL; in ares__htable_strvp_insert() local
124 bucket = ares_malloc(sizeof(*bucket)); in ares__htable_strvp_insert()
125 if (bucket == NULL) { in ares__htable_strvp_insert()
129 bucket->parent = htable; in ares__htable_strvp_insert()
130 bucket->key = ares_strdup(key); in ares__htable_strvp_insert()
131 if (bucket->key == NULL) { in ares__htable_strvp_insert()
[all …]
|
| D | ares__htable_szvp.c | 60 static const void *bucket_key(const void *bucket) in bucket_key() argument
62 const ares__htable_szvp_bucket_t *arg = bucket; in bucket_key()
66 static void bucket_free(void *bucket) in bucket_free() argument
68 ares__htable_szvp_bucket_t *arg = bucket; in bucket_free()
118 ares__htable_szvp_bucket_t *bucket = NULL; in ares__htable_szvp_insert() local
124 bucket = ares_malloc(sizeof(*bucket)); in ares__htable_szvp_insert()
125 if (bucket == NULL) { in ares__htable_szvp_insert()
129 bucket->parent = htable; in ares__htable_szvp_insert()
130 bucket->key = key; in ares__htable_szvp_insert()
131 bucket->val = val; in ares__htable_szvp_insert()
[all …]
|
| D | ares__htable_asvp.c | 60 static const void *bucket_key(const void *bucket) in bucket_key() argument
62 const ares__htable_asvp_bucket_t *arg = bucket; in bucket_key()
66 static void bucket_free(void *bucket) in bucket_free() argument
68 ares__htable_asvp_bucket_t *arg = bucket; in bucket_free()
152 ares__htable_asvp_bucket_t *bucket = NULL; in ares__htable_asvp_insert() local
158 bucket = ares_malloc(sizeof(*bucket)); in ares__htable_asvp_insert()
159 if (bucket == NULL) { in ares__htable_asvp_insert()
163 bucket->parent = htable; in ares__htable_asvp_insert()
164 bucket->key = key; in ares__htable_asvp_insert()
165 bucket->val = val; in ares__htable_asvp_insert()
[all …]
|
| D | ares__htable.h | 38 * 75% capacity. A rehash will be performed on the expanded bucket list.
64 /*! Callback to free the bucket
66 * \param[in] bucket user provided bucket
68 typedef void (*ares__htable_bucket_free_t)(void *bucket);
70 /*! Callback to extract the key from the user-provided bucket
72 * \param[in] bucket user provided bucket
73 * \return pointer to key held in bucket
75 typedef const void *(*ares__htable_bucket_key_t)(const void *bucket);
96 * \param[in] bucket_key Required. Callback to extract key from bucket.
97 * \param[in] bucket_free Required. Callback to free bucket.
[all …]
|
| /third_party/node/deps/icu-small/source/i18n/unicode/ |
| D | alphaindex.h | 41 * in the bucket with this label.
47 * Underflow Label. The bucket with this label contains names
48 * in scripts that sort before any of the bucket labels in this index.
54 * Inflow Label. The bucket with this label contains names
55 * in scripts that sort between two of the bucket labels in this index.
64 * Overflow Label. The bucket with this label contains names in scripts
65 * that sort after all of the bucket labels in this index.
105 * (bucket) of a larger "target" list. That is, each label corresponds to a bucket in
106 * the target list, where everything in the bucket is greater than or equal to the character
108 * they will be in sorted order in the right bucket.
[all …]
|
| /third_party/icu/icu4c/source/i18n/unicode/ |
| D | alphaindex.h | 41 * in the bucket with this label.
47 * Underflow Label. The bucket with this label contains names
48 * in scripts that sort before any of the bucket labels in this index.
54 * Inflow Label. The bucket with this label contains names
55 * in scripts that sort between two of the bucket labels in this index.
64 * Overflow Label. The bucket with this label contains names in scripts
65 * that sort after all of the bucket labels in this index.
105 * (bucket) of a larger "target" list. That is, each label corresponds to a bucket in
106 * the target list, where everything in the bucket is greater than or equal to the character
108 * they will be in sorted order in the right bucket.
[all …]
|
| /third_party/skia/third_party/externals/icu/source/i18n/unicode/ |
| D | alphaindex.h | 41 * in the bucket with this label.
47 * Undeflow Label. The bucket with this label contains names
48 * in scripts that sort before any of the bucket labels in this index.
54 * Inflow Label. The bucket with this label contains names
55 * in scripts that sort between two of the bucket labels in this index.
64 * Overflow Label. Te bucket with this label contains names in scripts
65 * that sort after all of the bucket labels in this index.
105 * (bucket) of a larger "target" list. That is, each label corresponds to a bucket in
106 * the target list, where everything in the bucket is greater than or equal to the character
108 * they will be in sorted order in the right bucket.
[all …]
|
| /third_party/mesa3d/src/etnaviv/drm/ |
| D | etnaviv_bo_cache.c | 75 struct etna_bo_bucket *bucket = &cache->cache_bucket[i]; in etna_bo_cache_cleanup() local
78 while (!list_is_empty(&bucket->list)) { in etna_bo_cache_cleanup()
79 bo = list_entry(bucket->list.next, struct etna_bo, list); in etna_bo_cache_cleanup()
99 * way to the correct bucket size rather than looping.. in get_bucket()
102 struct etna_bo_bucket *bucket = &cache->cache_bucket[i]; in get_bucket() local
103 if (bucket->size >= size) { in get_bucket()
104 return bucket; in get_bucket()
111 static struct etna_bo *find_in_bucket(struct etna_bo_bucket *bucket, uint32_t flags) in find_in_bucket() argument
117 if (list_is_empty(&bucket->list)) in find_in_bucket()
120 LIST_FOR_EACH_ENTRY_SAFE(bo, tmp, &bucket->list, list) { in find_in_bucket()
[all …]
|
| /third_party/libdrm/etnaviv/ |
| D | etnaviv_bo_cache.c | 78 struct etna_bo_bucket *bucket = &cache->cache_bucket[i]; in etna_bo_cache_cleanup() local
81 while (!LIST_IS_EMPTY(&bucket->list)) { in etna_bo_cache_cleanup()
82 bo = LIST_ENTRY(struct etna_bo, bucket->list.next, list); in etna_bo_cache_cleanup()
101 * way to the correct bucket size rather than looping.. in get_bucket()
104 struct etna_bo_bucket *bucket = &cache->cache_bucket[i]; in get_bucket() local
105 if (bucket->size >= size) { in get_bucket()
106 return bucket; in get_bucket()
121 static struct etna_bo *find_in_bucket(struct etna_bo_bucket *bucket, uint32_t flags) in find_in_bucket() argument
127 if (LIST_IS_EMPTY(&bucket->list)) in find_in_bucket()
130 LIST_FOR_EACH_ENTRY_SAFE(bo, tmp, &bucket->list, list) { in find_in_bucket()
[all …]
|
| /third_party/mesa3d/src/virtio/vulkan/ |
| D | vn_renderer_internal.c | 25 struct vn_renderer_shmem_bucket *bucket = &cache->buckets[i]; in vn_renderer_shmem_cache_init() local
26 list_inithead(&bucket->shmems); in vn_renderer_shmem_cache_init()
40 struct vn_renderer_shmem_bucket *bucket = &cache->buckets[idx]; in vn_renderer_shmem_cache_fini() local
43 &bucket->shmems, cache_head) in vn_renderer_shmem_cache_fini()
74 struct vn_renderer_shmem_bucket *bucket = &cache->buckets[idx]; in vn_renderer_shmem_cache_remove_expired_locked() local
76 assert(!list_is_empty(&bucket->shmems)); in vn_renderer_shmem_cache_remove_expired_locked()
78 &bucket->shmems, struct vn_renderer_shmem, cache_head); in vn_renderer_shmem_cache_remove_expired_locked()
82 &bucket->shmems, cache_head) { in vn_renderer_shmem_cache_remove_expired_locked()
100 struct vn_renderer_shmem_bucket *bucket = in vn_renderer_shmem_cache_add() local
102 if (!bucket) in vn_renderer_shmem_cache_add()
[all …]
|
| /third_party/skia/third_party/externals/icu/source/i18n/ |
| D | alphaindex.cpp | 82 inline AlphabeticIndex::Bucket *getBucket(const UVector &list, int32_t i) { in getBucket()
83 return static_cast<AlphabeticIndex::Bucket *>(list[i]); in getBucket()
151 const AlphabeticIndex::Bucket *bucket = getBucket(*bucketList_, i); in getBucketIndex() local
153 collatorPrimaryOnly.compare(name, bucket->lowerBoundary_, errorCode); in getBucketIndex()
160 const AlphabeticIndex::Bucket *bucket = getBucket(*bucketList_, start); in getBucketIndex() local
161 if (bucket->displayBucket_ != NULL) { in getBucketIndex()
162 bucket = bucket->displayBucket_; in getBucketIndex()
164 return bucket->displayIndex_; in getBucketIndex()
196 const AlphabeticIndex::Bucket *
261 // or called after using the old-style bucket iterator API. in buildImmutableIndex()
[all …]
|
| /third_party/libdrm/freedreno/ |
| D | freedreno_bo_cache.c | 48 * @coarse: if true, only power-of-two bucket sizes, otherwise
90 struct fd_bo_bucket *bucket = &cache->cache_bucket[i]; in fd_bo_cache_cleanup() local
93 while (!LIST_IS_EMPTY(&bucket->list)) { in fd_bo_cache_cleanup()
94 bo = LIST_ENTRY(struct fd_bo, bucket->list.next, list); in fd_bo_cache_cleanup()
114 * way to the correct bucket size rather than looping.. in get_bucket()
117 struct fd_bo_bucket *bucket = &cache->cache_bucket[i]; in get_bucket() local
118 if (bucket->size >= size) { in get_bucket()
119 return bucket; in get_bucket()
134 static struct fd_bo *find_in_bucket(struct fd_bo_bucket *bucket, uint32_t flags) in find_in_bucket() argument
146 if (!LIST_IS_EMPTY(&bucket->list)) { in find_in_bucket()
[all …]
|