Searched defs:bucket (Results 1 - 6 of 6) sorted by relevance

/frameworks/compile/mclinker/lib/Support/
H A DHandleToArea.cpp22 Bucket bucket;
23 bucket.hash_value = HashFunction()(
27 bucket.handle = pHandle;
28 bucket.area = pArea;
29 m_AreaMap.push_back(bucket);
47 HandleToAreaMap::iterator bucket, bEnd = m_AreaMap.end(); local
48 for (bucket = m_AreaMap.begin(); bucket != bEnd; ++bucket) {
49 if (bucket
64 HandleToAreaMap::iterator bucket, bEnd = m_AreaMap.end(); local
82 HandleToAreaMap::const_iterator bucket, bEnd = m_AreaMap.end(); local
[all...]
/frameworks/compile/mclinker/include/mcld/ADT/
H A DHashIterator.h43 bucket_type &bucket = m_pHashTable->m_Buckets[m_Index]; local
44 if (bucket_type::getTombstone() == bucket.Entry) {
47 else if (m_HashValue == bucket.FullHashValue) {
48 if (bucket.Entry->compare(pKey)) {
124 bucket_type &bucket = m_pHashTable->m_Buckets[m_Index]; local
126 if (bucket_type::getTombstone() == bucket.Entry ||
127 bucket_type::getEmptyBucket() == bucket.Entry) {
130 else if (m_HashValue == bucket.FullHashValue) {
/frameworks/native/include/utils/
H A DBasicHashtable.h31 // The collision flag indicates that the bucket is part of a collision chain
32 // such that at least two entries both hash to this bucket. When true, we
36 // The present flag indicates that the bucket contains an initialized entry value.
39 // Mask for 30 bits worth of the hash code that are stored within the bucket to
73 const size_t mBucketSize; // number of bytes per bucket including the entry
91 virtual bool compareBucketKey(const Bucket& bucket, const void* __restrict__ key) const = 0;
92 virtual void initializeBucketEntry(Bucket& bucket, const void* __restrict__ entry) const = 0;
93 virtual void destroyBucketEntry(Bucket& bucket) const = 0;
98 // Allocates a bucket array as a SharedBuffer.
101 // Releases a bucket arra
332 entryFor(const Bucket& bucket) argument
336 entryFor(Bucket& bucket) argument
369 compareBucketKey(const Bucket& bucket, const void* __restrict__ key) const argument
375 initializeBucketEntry(Bucket& bucket, const void* __restrict__ entry) const argument
[all...]
/frameworks/native/libs/utils/
H A DBasicHashtable.cpp84 Bucket& bucket = bucketAt(mBuckets, i); local
85 bucket.cookie = 0;
100 const Bucket& bucket = bucketAt(mBuckets, index); local
101 if (bucket.cookie & Bucket::PRESENT) {
119 const Bucket& bucket = bucketAt(mBuckets, size_t(index)); local
120 if (bucket.cookie & Bucket::PRESENT) {
121 if (compareBucketKey(bucket, key)) {
125 if (!(bucket.cookie & Bucket::COLLISION)) {
135 const Bucket& bucket = bucketAt(mBuckets, size_t(index)); local
136 if (bucket
158 Bucket* bucket = &bucketAt(mBuckets, size_t(index)); local
187 Bucket& bucket = bucketAt(mBuckets, index); local
248 Bucket& bucket = bucketAt(buckets, i); local
265 Bucket& bucket = bucketAt(buckets, i); local
[all...]
/frameworks/compile/mclinker/lib/Target/Mips/
H A DMipsLDBackend.cpp438 uint32_t* bucket = (word_array + 2); local
439 uint32_t* chain = (bucket + nbucket);
441 // initialize bucket
442 bzero((void*)bucket, nbucket);
449 chain[sym_idx] = bucket[bucket_pos];
450 bucket[bucket_pos] = sym_idx;
/frameworks/compile/mclinker/lib/Target/
H A DGNULDBackend.cpp1054 uint32_t* bucket = (word_array + 2); local
1055 uint32_t* chain = (bucket + nbucket);
1057 // initialize bucket
1058 bzero((void*)bucket, nbucket);
1066 chain[sym_idx] = bucket[bucket_pos];
1067 bucket[bucket_pos] = sym_idx;
1074 chain[sym_idx] = bucket[bucket_pos];
1075 bucket[bucket_pos] = sym_idx;
1641 /// getHashBucketCount - calculate hash bucket count.

Completed in 307 milliseconds