Home
last modified time | relevance | path

Searched refs:bucket (Results 1 - 25 of 123) sorted by relevance

12345

/third_party/libdrm/
H A Dxf86drmHash.c119 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 in HashFind()
170 HashBucketPtr bucket; drmHashLookup() local
183 HashBucketPtr bucket; drmHashInsert() local
203 HashBucketPtr bucket; drmHashDelete() local
[all...]
/third_party/mesa3d/src/glx/
H A Dglxhash.c179 __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 in HashFind()
234 __glxHashBucketPtr bucket; __glxHashLookup() local
250 __glxHashBucketPtr bucket; __glxHashInsert() local
277 __glxHashBucketPtr bucket; __glxHashDelete() local
337 count_entries(__glxHashBucketPtr bucket) count_entries() argument
359 __glxHashBucketPtr bucket; compute_dist() local
[all...]
/third_party/node/deps/v8/src/heap/
H A Dslot-set.h132 // 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.
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()
211 if (!SwapInNewBucket<access_mode>(bucket_index, bucket)) { in Insert()
232 Bucket* bucket = LoadBucket(bucket_index); Contains() local
242 Bucket* bucket = LoadBucket(bucket_index); Remove() local
266 Bucket* bucket; RemoveRange() local
324 Bucket* bucket = LoadBucket(bucket_index); Lookup() local
386 Bucket* bucket = LoadBucket<AccessMode::NON_ATOMIC>(bucket_index); CheckPossiblyEmptyBuckets() local
476 Bucket* bucket = LoadBucket(bucket_index); Iterate() local
512 Bucket* bucket = LoadBucket<AccessMode::NON_ATOMIC>(bucket_index); FreeBucketIfEmpty() local
524 ClearBucket(Bucket* bucket, int start_cell, int end_cell) ClearBucket() argument
536 Bucket* bucket = LoadBucket<access_mode>(bucket_index); ReleaseBucket() local
542 LoadBucket(Bucket** bucket) LoadBucket() argument
554 StoreBucket(Bucket** bucket, Bucket* value) StoreBucket() argument
592 Bucket** bucket(size_t bucket_index) { return buckets() + bucket_index; } bucket() function
[all...]
/third_party/node/deps/cares/src/lib/
H A Dares__htable_strvp.c60 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 in ares__htable_strvp_insert()
153 ares__htable_strvp_bucket_t *bucket = NULL; ares__htable_strvp_get() local
[all...]
H A Dares__htable_szvp.c60 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 in ares__htable_szvp_insert()
149 ares__htable_szvp_bucket_t *bucket = NULL; ares__htable_szvp_get() local
[all...]
H A Dares__htable_asvp.c60 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 in ares__htable_asvp_insert()
183 ares__htable_asvp_bucket_t *bucket = NULL; ares__htable_asvp_get() local
[all...]
/third_party/mesa3d/src/gallium/drivers/nouveau/
H A Dnouveau_mm.c38 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 in nouveau_mm_allocate()
226 struct mm_bucket *bucket = mm_bucket_by_order(slab->cache, slab->order); nouveau_mm_free() local
[all...]
/third_party/mesa3d/src/etnaviv/drm/
H A Detnaviv_bo_cache.c75 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 in find_in_bucket()
152 struct etna_bo_bucket *bucket; etna_bo_cache_alloc() local
174 struct etna_bo_bucket *bucket; etna_bo_cache_free() local
[all...]
/third_party/libdrm/etnaviv/
H A Detnaviv_bo_cache.c78 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 in find_in_bucket()
162 struct etna_bo_bucket *bucket; etna_bo_cache_alloc() local
183 struct etna_bo_bucket *bucket = get_bucket(cache, bo->size); etna_bo_cache_free() local
[all...]
/third_party/node/tools/inspector_protocol/jinja2/
H A Dbccache.py76 """Resets the bucket (unloads the bytecode)."""
101 raise TypeError('can\'t write empty 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)
146 def load_bytecode(self, bucket):
148 bucket
[all...]
/third_party/mesa3d/src/freedreno/drm/
H A Dfreedreno_bo_cache.c46 * @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(bucket->list.next, struct fd_bo, list); in fd_bo_cache_cleanup()
115 * way to the correct bucket size rather than looping.. in get_bucket()
118 struct fd_bo_bucket *bucket = &cache->cache_bucket[i]; in get_bucket() local
119 if (bucket->size >= size) { in get_bucket()
120 return bucket; in get_bucket()
128 find_in_bucket(struct fd_bo_bucket *bucket, uint32_t flags) in find_in_bucket() argument
140 list_for_each_entry (struct fd_bo, entry, &bucket in find_in_bucket()
159 struct fd_bo_bucket *bucket; fd_bo_cache_alloc() local
195 struct fd_bo_bucket *bucket = get_bucket(cache, bo->size); fd_bo_cache_free() local
[all...]
/third_party/mesa3d/src/virtio/vulkan/
H A Dvn_renderer_internal.c25 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()
125 struct vn_renderer_shmem_bucket *bucket = choose_bucket(cache, size, &idx); vn_renderer_shmem_cache_get() local
170 const struct vn_renderer_shmem_bucket *bucket = &cache->buckets[idx]; vn_renderer_shmem_cache_debug_dump() local
[all...]
/third_party/node/deps/v8/third_party/jinja2/
H A Dbccache.py53 """Resets the bucket (unloads the bytecode)."""
78 raise TypeError("can't write empty 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)
123 def load_bytecode(self, bucket):
125 bucket
[all...]
/third_party/skia/third_party/externals/jinja2/
H A Dbccache.py53 """Resets the bucket (unloads the bytecode)."""
78 raise TypeError("can't write empty 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)
123 def load_bytecode(self, bucket):
125 bucket
[all...]
/third_party/libdrm/freedreno/
H A Dfreedreno_bo_cache.c48 * @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 in find_in_bucket()
165 struct fd_bo_bucket *bucket; fd_bo_cache_alloc() local
196 struct fd_bo_bucket *bucket = get_bucket(cache, bo->size); fd_bo_cache_free() local
[all...]
/third_party/jinja2/
H A Dbccache.py60 """Resets the bucket (unloads the bytecode)."""
85 raise TypeError("can't write empty 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)
130 def load_bytecode(self, bucket: Bucket) -> None:
132 bucket
[all...]
/third_party/rust/crates/aho-corasick/src/packed/teddy/
H A Dcompile.rs247 // prefix to be in the same bucket, since it minimizes the amount in compile()
253 // same bucket. However, case insensitive searches are fairly in compile()
258 // the same bucket. in compile()
262 // same bucket, we ensure that we preserve correct leftmost-first in compile()
266 // the same bucket. The verification routine could be adjusted to in compile()
267 // support correct leftmost match semantics regardless of bucket in compile()
271 if let Some(&bucket) = lonibble_to_bucket.get(&lonybs) { in compile()
272 self.buckets[bucket].push(id); in compile()
277 let bucket = (self.buckets.len() - 1) in compile()
279 self.buckets[bucket] in compile()
[all...]
/third_party/node/deps/npm/node_modules/cacache/lib/
H A Dentry-index.js34 const bucket = bucketPath(cache, key)
35 const entries = await bucketEntries(bucket)
86 await mkdir(path.dirname(bucket), { recursive: true })
89 await moveFile(tmp.target, bucket)
113 const bucket = bucketPath(cache, key)
122 await mkdir(path.dirname(bucket), { recursive: true })
132 await appendFile(bucket, `\n${hashEntry(stringified)}\t${stringified}`)
146 const bucket = bucketPath(cache, key)
148 const entries = await bucketEntries(bucket)
172 const bucket
[all...]
/third_party/icu/icu4j/main/classes/collate/src/com/ibm/icu/text/
H A DAlphabeticIndex.java43 * (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&lt;Integer&gt; bucket : index) {
73 * if (showAll || bucket.size() != 0) {
74 * showLabelAtTop(UI, bucket.getLabel());
80 * for (AlphabeticIndex.Bucket&lt;Integer&gt; bucket : index) {
81 * if (bucket
[all...]
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/text/
H A DAlphabeticIndex.java44 * (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&lt;Integer&gt; bucket : index) {
74 * if (showAll || bucket.size() != 0) {
75 * showLabelAtTop(UI, bucket.getLabel());
81 * for (AlphabeticIndex.Bucket&lt;Integer&gt; bucket : index) {
82 * if (bucket
[all...]
/third_party/icu/icu4j/main/tests/collate/src/com/ibm/icu/dev/test/collator/
H A DAlphabeticIndexTest.java230 Bucket<Integer> bucket = find(alphabeticIndex, probe); in TestA()
231 assertEquals("locale " + test[0] + " name=" + probe + " in bucket", in TestA()
232 expectedLabel, bucket.getLabel()); in TestA()
237 for (Bucket<Integer> bucket : alphabeticIndex) { in find()
238 for (Record<Integer> record : bucket) { in find()
240 return bucket; in find()
322 for (Bucket<String> bucket : alphabeticIndex) { in TestEmpty()
324 LabelType labelType = bucket.getLabelType(); in TestEmpty()
370 for (Bucket<Double> bucket : alphabeticIndex) { in TestInflow()
371 LabelType labelType = bucket in TestInflow()
[all...]
/third_party/icu/ohos_icu4j/src/main/tests/ohos/global/icu/dev/test/collator/
H A DAlphabeticIndexTest.java233 Bucket<Integer> bucket = find(alphabeticIndex, probe); in TestA()
234 assertEquals("locale " + test[0] + " name=" + probe + " in bucket", in TestA()
235 expectedLabel, bucket.getLabel()); in TestA()
240 for (Bucket<Integer> bucket : alphabeticIndex) { in find()
241 for (Record<Integer> record : bucket) { in find()
243 return bucket; in find()
325 for (Bucket<String> bucket : alphabeticIndex) { in TestEmpty()
327 LabelType labelType = bucket.getLabelType(); in TestEmpty()
373 for (Bucket<Double> bucket : alphabeticIndex) { in TestInflow()
374 LabelType labelType = bucket in TestInflow()
[all...]
/third_party/mesa3d/src/gallium/drivers/svga/
H A Dsvga_screen_cache.c79 * Compute the bucket for this key.
102 unsigned bucket; in svga_screen_cache_lookup() local
107 bucket = svga_screen_cache_bucket(key); in svga_screen_cache_lookup()
111 curr = cache->bucket[bucket].next; in svga_screen_cache_lookup()
113 while (curr != &cache->bucket[bucket]) { in svga_screen_cache_lookup()
162 debug_printf("%s: cache %s after %u tries (bucket %d)\n", __FUNCTION__, in svga_screen_cache_lookup()
163 handle ? "hit" : "miss", tries, bucket); in svga_screen_cache_lookup()
337 unsigned bucket; in svga_screen_cache_flush() local
640 unsigned bucket; svga_screen_cache_dump() local
[all...]
/third_party/node/deps/v8/src/heap/cppgc/
H A Dpage-memory.cc174 void NormalPageMemoryPool::Add(size_t bucket, NormalPageMemoryRegion* pmr, in Add() argument
176 DCHECK_LT(bucket, kNumPoolBuckets); in Add()
177 pool_[bucket].push_back(std::make_pair(pmr, writeable_base)); in Add()
181 size_t bucket) { in Take()
182 DCHECK_LT(bucket, kNumPoolBuckets); in Take()
183 if (pool_[bucket].empty()) return {nullptr, nullptr}; in Take()
184 std::pair<NormalPageMemoryRegion*, Address> pair = pool_[bucket].back(); in Take()
185 pool_[bucket].pop_back(); in Take()
195 Address PageBackend::AllocateNormalPageMemory(size_t bucket) { in AllocateNormalPageMemory() argument
197 std::pair<NormalPageMemoryRegion*, Address> result = page_pool_.Take(bucket); in AllocateNormalPageMemory()
180 Take( size_t bucket) Take() argument
214 FreeNormalPageMemory(size_t bucket, Address writeable_base) FreeNormalPageMemory() argument
[all...]
/third_party/skia/third_party/externals/icu/source/i18n/
H A Dalphaindex.cpp151 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()
261 // or called after using the old-style bucket iterator API. in buildImmutableIndex()
332 // Ignore an index character that will land in the overflow bucket. in initLabels()
452 // underflow bucket in createBucketList()
453 Bucket *bucket = new Bucket(getUnderflowLabel(), emptyString_, U_ALPHAINDEX_UNDERFLOW); createBucketList() local
676 Bucket *bucket = currentBucket; initBuckets() local
[all...]

Completed in 16 milliseconds

12345