Home
last modified time | relevance | path

Searched refs:bucket (Results 1 – 3 of 3) sorted by relevance

/system/core/libutils/
DBasicHashtable.cpp88 Bucket& bucket = bucketAt(mBuckets, i); in clear() local
89 bucket.cookie = 0; in clear()
104 const Bucket& bucket = bucketAt(mBuckets, index); in next() local
105 if (bucket.cookie & Bucket::PRESENT) { in next()
123 const Bucket& bucket = bucketAt(mBuckets, size_t(index)); in find() local
124 if (bucket.cookie & Bucket::PRESENT) { in find()
125 if (compareBucketKey(bucket, key)) { in find()
129 if (!(bucket.cookie & Bucket::COLLISION)) { in find()
139 const Bucket& bucket = bucketAt(mBuckets, size_t(index)); in find() local
140 if (bucket.cookie & Bucket::PRESENT) { in find()
[all …]
/system/bt/osi/src/
Dhash_map.c32 hash_map_bucket_t *bucket; member
74 hash_map->bucket = zeroed_allocator->alloc(sizeof(hash_map_bucket_t) * num_bucket); in hash_map_new_internal()
75 if (hash_map->bucket == NULL) { in hash_map_new_internal()
95 hash_map->allocator->free(hash_map->bucket); in hash_map_free()
118 list_t *hash_bucket_list = hash_map->bucket[hash_key].list; in hash_map_has_key()
130 if (hash_map->bucket[hash_key].list == NULL) { in hash_map_set()
131 hash_map->bucket[hash_key].list = list_new_internal(bucket_free_, hash_map->allocator); in hash_map_set()
132 if (hash_map->bucket[hash_key].list == NULL) in hash_map_set()
135 list_t *hash_bucket_list = hash_map->bucket[hash_key].list; in hash_map_set()
161 list_t *hash_bucket_list = hash_map->bucket[hash_key].list; in hash_map_erase()
[all …]
/system/core/include/utils/
DBasicHashtable.h92 virtual bool compareBucketKey(const Bucket& bucket, const void* __restrict__ key) const = 0;
93 virtual void initializeBucketEntry(Bucket& bucket, const void* __restrict__ entry) const = 0;
94 virtual void destroyBucketEntry(Bucket& bucket) const = 0;
341 static inline const TEntry& entryFor(const Bucket& bucket) { in entryFor() argument
342 return reinterpret_cast<const TEntry&>(bucket.entry); in entryFor()
345 static inline TEntry& entryFor(Bucket& bucket) { in entryFor() argument
346 return reinterpret_cast<TEntry&>(bucket.entry); in entryFor()
349 virtual bool compareBucketKey(const Bucket& bucket, const void* __restrict__ key) const;
350 virtual void initializeBucketEntry(Bucket& bucket, const void* __restrict__ entry) const;
351 virtual void destroyBucketEntry(Bucket& bucket) const;
[all …]