Home
last modified time | relevance | path

Searched refs:hash (Results 1 – 23 of 23) sorted by relevance

/system/core/libutils/
DJenkinsHash.cpp26 hash_t JenkinsHashWhiten(uint32_t hash) { in JenkinsHashWhiten() argument
27 hash += (hash << 3); in JenkinsHashWhiten()
28 hash ^= (hash >> 11); in JenkinsHashWhiten()
29 hash += (hash << 15); in JenkinsHashWhiten()
30 return hash; in JenkinsHashWhiten()
33 uint32_t JenkinsHashMixBytes(uint32_t hash, const uint8_t* bytes, size_t size) { in JenkinsHashMixBytes() argument
34 hash = JenkinsHashMix(hash, (uint32_t)size); in JenkinsHashMixBytes()
38 hash = JenkinsHashMix(hash, data); in JenkinsHashMixBytes()
44 hash = JenkinsHashMix(hash, data); in JenkinsHashMixBytes()
46 return hash; in JenkinsHashMixBytes()
[all …]
DBasicHashtable.cpp113 ssize_t BasicHashtableImpl::find(ssize_t index, hash_t hash, in find() argument
119 hash = trimHash(hash); in find()
121 index = chainStart(hash, mBucketCount); in find()
135 size_t inc = chainIncrement(hash, mBucketCount); in find()
141 if ((bucket.cookie & Bucket::HASH_MASK) == hash in find()
152 size_t BasicHashtableImpl::add(hash_t hash, const void* entry) { in add() argument
159 hash = trimHash(hash); in add()
161 size_t index = chainStart(hash, mBucketCount); in add()
164 size_t inc = chainIncrement(hash, mBucketCount); in add()
181 bucket->cookie = collision | Bucket::PRESENT | hash; in add()
[all …]
/system/core/include/utils/
DJenkinsHash.h32 inline uint32_t JenkinsHashMix(uint32_t hash, uint32_t data) { in JenkinsHashMix() argument
33 hash += data; in JenkinsHashMix()
34 hash += (hash << 10); in JenkinsHashMix()
35 hash ^= (hash >> 6); in JenkinsHashMix()
36 return hash; in JenkinsHashMix()
39 hash_t JenkinsHashWhiten(uint32_t hash);
42 uint32_t JenkinsHashMixBytes(uint32_t hash, const uint8_t* bytes, size_t size);
44 uint32_t JenkinsHashMixShorts(uint32_t hash, const uint16_t* shorts, size_t size);
DBasicHashtable.h69 ssize_t find(ssize_t index, hash_t hash, const void* __restrict__ key) const;
70 size_t add(hash_t hash, const void* __restrict__ entry);
120 inline static hash_t trimHash(hash_t hash) { in trimHash() argument
121 return (hash & Bucket::HASH_MASK) ^ (hash >> 30); in trimHash()
127 inline static size_t chainStart(hash_t hash, size_t count) { in chainStart() argument
128 return hash % count; in chainStart()
134 inline static size_t chainIncrement(hash_t hash, size_t count) { in chainIncrement() argument
135 return ((hash >> 7) | (hash << 25)) % (count - 1) + 1; in chainIncrement()
280 inline ssize_t find(ssize_t index, hash_t hash, const TKey& key) const { in find() argument
281 return BasicHashtableImpl::find(index, hash, &key); in find()
[all …]
DLruCache.h128 hash_t hash = hash_type(key); in get() local
129 ssize_t index = mTable->find(-1, hash, key); in get()
145 hash_t hash = hash_type(key); in put() local
146 ssize_t index = mTable->find(-1, hash, key); in put()
156 index = mTable->add(hash, initEntry); in put()
164 hash_t hash = hash_type(key); in remove() local
165 ssize_t index = mTable->find(-1, hash, key); in remove()
/system/core/libcutils/
Dhashmap.c29 int hash; member
37 int (*hash)(void* key); member
44 int (*hash)(void* key), bool (*equals)(void* keyA, void* keyB)) { in hashmapCreate()
45 assert(hash != NULL); in hashmapCreate()
69 map->hash = hash; in hashmapCreate()
81 int h = map->hash(key); in hashKey()
97 static inline size_t calculateIndex(size_t bucketCount, int hash) { in calculateIndex() argument
98 return ((size_t) hash) & (bucketCount - 1); in calculateIndex()
118 size_t index = calculateIndex(newBucketCount, entry->hash); in expandIfNecessary()
166 static Entry* createEntry(void* key, int hash, void* value) { in createEntry() argument
[all …]
Dstr_parms.c47 uint32_t hash = 5381; in str_hash_fn() local
51 hash = ((hash << 5) + hash) + *p; in str_hash_fn()
52 return (int)hash; in str_hash_fn()
/system/bt/osi/src/
Dhash_functions.c36 hash_index_t hash = 5381; in hash_function_string() local
40 hash = ((hash << 5) + hash ) + name[i]; in hash_function_string()
41 return hash; in hash_function_string()
/system/bt/btcore/src/
Dbdaddr.c96 hash_index_t hash = 5381; in hash_function_bdaddr() local
99 hash = ((hash << 5) + hash) + bytes[i]; in hash_function_bdaddr()
100 return hash; in hash_function_bdaddr()
/system/core/libmincrypt/test/
Drsa_test.c800 unsigned char hash[SHA_DIGEST_SIZE]; in main() local
809 SHA_hash(message, mlen, hash); \ in main()
811 int result = RSA_verify(&key_15, signature, slen, hash, sizeof(hash)); \ in main()
Decdsa_test.c227 p256_int hash; in main() local
268 p256_from_bin(hash_buf, &hash); \ in main()
271 if (result) { result = p256_ecdsa_verify(&key_x, &key_y, &hash, &r, &s); } \ in main()
/system/extras/ext4_utils/
Dcontents.c344 u32 hash = 0; in ext4_xattr_hash_entry() local
349 hash = (hash << NAME_HASH_SHIFT) ^ in ext4_xattr_hash_entry()
350 (hash >> (8*sizeof(hash) - NAME_HASH_SHIFT)) ^ in ext4_xattr_hash_entry()
359 hash = (hash << VALUE_HASH_SHIFT) ^ in ext4_xattr_hash_entry()
360 (hash >> (8*sizeof(hash) - VALUE_HASH_SHIFT)) ^ in ext4_xattr_hash_entry()
364 entry->e_hash = cpu_to_le32(hash); in ext4_xattr_hash_entry()
/system/core/include/mincrypt/
Dhash-internal.h42 const uint8_t* (* const hash)(const void*, int, uint8_t*); member
56 #define HASH_hash(data, len, digest) (ctx)->f->hash(data, len, digest)
Drsa.h51 const uint8_t* hash,
/system/extras/ksmutils/
Dksminfo.c48 uint32_t hash; member
203 uint32_t hash; in read_pages() local
260 hash = hashword(data, pm_kernel_pagesize(ker) / sizeof(*data), 17); in read_pages()
263 if (kp->pages[k].hash == hash) break; in read_pages()
286 kp->pages[kp->len].hash = hash; in read_pages()
353 printf("KSM CRC 0x%08x:", kp->pages[i].hash); in print_pages()
/system/core/include/cutils/
Dhashmap.h42 int (*hash)(void* key), bool (*equals)(void* keyA, void* keyB));
/system/core/libmincrypt/
Drsa.c252 const uint8_t *hash, in RSA_verify() argument
283 buf[i] ^= *hash++; in RSA_verify()
/system/core/libziparchive/
Dzip_archive.cc347 uint32_t hash = 0; in ComputeHash() local
352 hash = hash * 31 + *str++; in ComputeHash()
355 return hash; in ComputeHash()
365 const uint32_t hash = ComputeHash(name); in EntryToIndex() local
368 uint32_t ent = hash & (hash_table_size - 1); in EntryToIndex()
387 const uint64_t hash = ComputeHash(name); in AddToHash() local
388 uint32_t ent = hash & (hash_table_size - 1); in AddToHash()
/system/core/libutils/tests/
DBasicHashtable_test.cpp113 bool* collision, bool* present, hash_t* hash) { in cookieAt() argument
117 *hash = cookie & BasicHashtable<TKey, TEntry>::Bucket::HASH_MASK; in cookieAt()
168 hash_t hash; in dump() local
169 BasicHashtableTest::cookieAt(h, i, &collision, &present, &hash); in dump()
175 i, collision, present, hash, key, value, hash_type(key)); in dump()
/system/keymaster/
Dkeymaster_enforcement.cpp382 uint8_t hash[EVP_MAX_MD_SIZE]; in CreateKeyId() local
386 EVP_DigestFinal_ex(ctx.get(), hash, &hash_len)) { in CreateKeyId()
388 memcpy(keyid, hash, sizeof(*keyid)); in CreateKeyId()
/system/core/init/
Dinit.h55 unsigned hash; member
/system/extras/verity/
DVerityVerifier.java310 private boolean checkBlock(byte[] hash, byte[] data) { in checkBlock() argument
314 return Arrays.equals(hash, digest.digest()); in checkBlock()
/system/core/logcat/
Devent.logtags43 # "account" is the java hash of the account name