Searched refs:Bucket (Results 1 - 3 of 3) sorted by relevance

/system/core/libutils/
H A DBasicHashtable.cpp29 mBucketSize(entrySize + sizeof(Bucket)), mHasTrivialDestructor(hasTrivialDestructor),
88 Bucket& bucket = bucketAt(mBuckets, i);
104 const Bucket& bucket = bucketAt(mBuckets, index);
105 if (bucket.cookie & Bucket::PRESENT) {
123 const Bucket& bucket = bucketAt(mBuckets, size_t(index));
124 if (bucket.cookie & Bucket::PRESENT) {
129 if (!(bucket.cookie & Bucket::COLLISION)) {
139 const Bucket& bucket = bucketAt(mBuckets, size_t(index));
140 if (bucket.cookie & Bucket::PRESENT) {
141 if ((bucket.cookie & Bucket
[all...]
/system/core/include/utils/
H A DBasicHashtable.h30 struct Bucket { struct in class:android::BasicHashtableImpl
83 inline const Bucket& bucketAt(const void* __restrict__ buckets, size_t index) const {
84 return *reinterpret_cast<const Bucket*>(
88 inline Bucket& bucketAt(void* __restrict__ buckets, size_t index) const {
89 return *reinterpret_cast<Bucket*>(static_cast<uint8_t*>(buckets) + index * mBucketSize);
92 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;
121 return (hash & Bucket::HASH_MASK) ^ (hash >> 30);
341 static inline const TEntry& entryFor(const Bucket
[all...]
/system/core/libutils/tests/
H A DBasicHashtable_test.cpp110 *collision = cookie & BasicHashtable<TKey, TEntry>::Bucket::COLLISION;
111 *present = cookie & BasicHashtable<TKey, TEntry>::Bucket::PRESENT;
112 *hash = cookie & BasicHashtable<TKey, TEntry>::Bucket::HASH_MASK;

Completed in 25 milliseconds