HomeSort by relevance Sort by last modified time
    Searched refs:COLLISION (Results 1 - 3 of 3) sorted by null

  /system/core/libutils/
BasicHashtable.cpp 129 if (!(bucket.cookie & Bucket::COLLISION)) {
146 if (!(bucket.cookie & Bucket::COLLISION)) {
166 bucket->cookie |= Bucket::COLLISION;
172 uint32_t collision = bucket->cookie & Bucket::COLLISION; local
173 if (!collision) {
181 bucket->cookie = collision | Bucket::PRESENT | hash;
193 if (!(bucket.cookie & Bucket::COLLISION)) {
223 toBucket->cookie |= Bucket::COLLISION;
  /system/core/include/utils/
BasicHashtable.h 31 // The collision flag indicates that the bucket is part of a collision chain
34 static const uint32_t COLLISION = 0x80000000UL;
44 // Combined value that stores the collision and present flags as well as
79 size_t mFilledBuckets; // number of buckets for which collision or present is true
124 // Returns the index of the first bucket that is in the collision chain
132 // in the collision chain for the specified hash code, given the total number of buckets.
138 // Returns the index of the next bucket that is in the collision chain
  /system/core/libutils/tests/
BasicHashtable_test.cpp 108 bool* collision, bool* present, hash_t* hash) {
110 *collision = cookie & BasicHashtable<TKey, TEntry>::Bucket::COLLISION;
162 bool collision, present; local
164 BasicHashtableTest::cookieAt(h, i, &collision, &present, &hash);
168 ALOGD(" [%3u] = collision=%d, present=%d, hash=0x%08x, key=%3d, value=%3d, "
170 i, collision, present, hash, key, value, hash_type(key));
172 ALOGD(" [%3u] = collision=%d, present=%d",
173 i, collision, present);

Completed in 93 milliseconds