Searched defs:hash (Results 1 - 25 of 40) sorted by relevance

12

/system/core/include/utils/
H A DJenkinsHash.h17 /* Implementation of Jenkins one-at-a-time hash function. These choices are
29 /* The Jenkins hash of a sequence of 32 bit words A, B, C is:
35 inline uint32_t JenkinsHashMix(uint32_t hash, uint32_t data) { argument
36 hash += data;
37 hash += (hash << 10);
38 hash ^= (hash >> 6);
39 return hash;
42 hash_t JenkinsHashWhiten(uint32_t hash);
[all...]
/system/core/libutils/include/utils/
H A DJenkinsHash.h17 /* Implementation of Jenkins one-at-a-time hash function. These choices are
29 /* The Jenkins hash of a sequence of 32 bit words A, B, C is:
35 inline uint32_t JenkinsHashMix(uint32_t hash, uint32_t data) { argument
36 hash += data;
37 hash += (hash << 10);
38 hash ^= (hash >> 6);
39 return hash;
42 hash_t JenkinsHashWhiten(uint32_t hash);
[all...]
/system/core/libutils/
H A DJenkinsHash.cpp17 /* Implementation of Jenkins one-at-a-time hash function. These choices are
30 hash_t JenkinsHashWhiten(uint32_t hash) { argument
31 hash += (hash << 3);
32 hash ^= (hash >> 11);
33 hash += (hash << 15);
34 return hash;
37 uint32_t JenkinsHashMixBytes(uint32_t hash, cons argument
56 JenkinsHashMixShorts(uint32_t hash, const uint16_t* shorts, size_t size) argument
[all...]
/system/core/fs_mgr/
H A Dfs_mgr_priv_sha.h25 uint8_t hash[SHA256_DIGEST_LENGTH]; member in class:SHA256Hasher
37 SHA256_Final(hash, &sha256_ctx);
38 return hash;
45 uint8_t hash[SHA512_DIGEST_LENGTH]; member in class:SHA512Hasher
57 SHA512_Final(hash, &sha512_ctx);
58 return hash;
/system/core/libmemunreachable/
H A DLeak.h25 // Custom std::hash specialization so that Leak::Backtrace can be used
30 struct hash<android::Leak::Backtrace> { struct in namespace:std
45 std::hash<T> hasher;
/system/extras/ioshark/
H A Dcompile_ioshark.h31 u_int32_t hash, i; local
33 for(hash = i = 0; i < len; ++i) {
34 hash += key[i];
35 hash += (hash << 10);
36 hash ^= (hash >> 6);
38 hash += (hash << 3);
39 hash
[all...]
H A Dcompile_ioshark_subr.c68 u_int32_t hash; local
71 hash = jenkins_one_at_a_time_hash(pathname, strlen(pathname));
72 hash %= FILE_DB_HASHSIZE;
73 db_node = files_db_buckets[hash];
84 u_int32_t hash; local
89 hash = jenkins_one_at_a_time_hash(filename, strlen(filename));
90 hash %= FILE_DB_HASHSIZE;
96 db_node->next = files_db_buckets[hash];
98 files_db_buckets[hash] = db_node;
/system/update_engine/payload_consumer/
H A Dpayload_verifier.cc35 // padded hash will look as follows:
41 // bytes of actual data (i.e. the ASN.1 header complete with the hash) are
173 bool PayloadVerifier::PadRSA2048SHA256Hash(brillo::Blob* hash) { argument
174 TEST_AND_RETURN_FALSE(hash->size() == 32);
175 hash->insert(hash->begin(),
179 TEST_AND_RETURN_FALSE(hash->size() == 256);
H A Dinstall_plan.h64 brillo::Blob hash; // SHA256 hash of the payload member in struct:chromeos_update_engine::InstallPlan::Payload
74 hash == that.hash && type == that.type &&
114 // True if payload hash checks are mandatory based on the system state and
/system/bt/types/bluetooth/
H A Duuid.h126 // Custom std::hash specialization so that bluetooth::UUID can be used as a key
131 struct hash<bluetooth::Uuid> { struct in namespace:std
134 std::hash<std::string> hash_fn;
/system/update_engine/
H A Domaha_response.h49 std::string hash; member in struct:chromeos_update_engine::OmahaResponse::Package
/system/keymaster/km_openssl/
H A Dsoft_keymaster_enforcement.cpp69 uint8_t hash[EVP_MAX_MD_SIZE]; local
73 EVP_DigestFinal_ex(ctx.get(), hash, &hash_len)) {
75 memcpy(keyid, hash, sizeof(*keyid));
/system/libufdt/
H A Dufdt_prop_dict.c25 /* Empirical values for hash functions. */
45 int hash = _ufdt_prop_dict_str_hash(name); local
47 int idx = hash & (size - 1);
48 /* If collision, use linear probing to find idx in the hash table */
/system/nvram/hal/tests/
H A Dnvram_hal_test.cc194 uint8_t hash[SHA256_DIGEST_LENGTH]; local
195 SHA256(reinterpret_cast<const uint8_t*>(input.data()), input.size(), hash); local
196 return std::string(reinterpret_cast<const char*>(hash), SHA256_DIGEST_LENGTH);
/system/tools/hidl/
H A DHash.cpp71 std::string Hash::hexString(const std::vector<uint8_t> &hash) { argument
74 for (uint8_t i : hash) {
148 std::string hash = match.str(1); local
151 if (hash.size() == 0 && fqName.size() == 0) {
155 if (hash.size() == 0 || fqName.size() == 0) {
161 file->hashes[fqName].push_back(hash);
/system/core/libcutils/
H A Dhashmap.cpp30 int hash; member in struct:Entry
38 int (*hash)(void* key); member in struct:Hashmap
45 int (*hash)(void* key), bool (*equals)(void* keyA, void* keyB)) {
46 assert(hash != NULL);
70 map->hash = hash;
85 int h = map->hash(key);
101 static inline size_t calculateIndex(size_t bucketCount, int hash) { argument
102 return ((size_t) hash) & (bucketCount - 1);
122 size_t index = calculateIndex(newBucketCount, entry->hash);
174 createEntry(void* key, int hash, void* value) argument
198 int hash = hashKey(map, key); local
230 int hash = hashKey(map, key); local
245 int hash = hashKey(map, key); local
261 int hash = hashKey(map, key); local
293 int hash = hashKey(map, key); local
[all...]
H A Dstr_parms.cpp57 /* use djb hash unless we find it inadequate */
63 uint32_t hash = 5381; local
66 hash = ((hash << 5) + hash) + *p;
67 return (int)hash;
/system/extras/libfec/
H A Dfec_open.cpp185 uint8_t hash[SHA256_DIGEST_LENGTH]; local
186 SHA256_Final(hash, &ctx);
188 f->ecc.valid = !memcmp(hash, header.hash, SHA256_DIGEST_LENGTH);
421 if (f->verity.hash) {
422 delete[] f->verity.hash;
H A Dfec_private.h84 uint8_t *hash; member in struct:verity_info
H A Dfec_read.cpp82 return !verity_check_block(f, &f->verity.hash[n * SHA256_DIGEST_LENGTH],
91 if (!v->hash || unlikely(offset >= f->data_size)) {
102 return !memcmp(v->zero_hash, &v->hash[hash_offset], SHA256_DIGEST_LENGTH);
122 check(!use_erasures || f->verity.hash);
183 } else if (!f->verity.hash) {
284 verity hash tree; returns the number of corrections in `errors' */
292 check(f->verity.hash);
315 uint8_t *hash = &f->verity.hash[curr * SHA256_DIGEST_LENGTH]; local
333 if (likely(verity_check_block(f, hash, dat
[all...]
H A Dfec_verity.cpp87 /* computes the size of verity hash tree for `file_size' bytes and returns the
88 number of hash tree levels in `verity_levels,' and the number of hashes per
119 buffer `block', and copies the hash to `hash' */
121 uint8_t *hash)
133 check(hash);
134 SHA256_Final(hash, &ctx);
138 /* computes a verity hash for FEC_BLOCKSIZE bytes from buffer `block' and
146 uint8_t hash[SHA256_DIGEST_LENGTH]; local
148 if (unlikely(verity_hash(f, block, hash)
120 verity_hash(fec_handle *f, const uint8_t *block, uint8_t *hash) argument
159 ecc_read_hashes(fec_handle *f, uint64_t hash_offset, uint8_t *hash, uint64_t data_offset, uint8_t *data) argument
188 uint8_t hash[SHA256_DIGEST_LENGTH]; local
[all...]
/system/extras/libfec/include/fec/
H A Dio.h52 uint8_t hash[SHA256_DIGEST_LENGTH]; member in struct:fec_header
/system/extras/verity/fec/
H A Dimage.cpp281 uint8_t hash[SHA256_DIGEST_LENGTH]; local
282 SHA256(ctx->fec, ctx->fec_size, hash);
284 if (memcmp(hash, p->hash, SHA256_DIGEST_LENGTH) != 0) {
306 SHA256(ctx->fec, ctx->fec_size, f->hash);
/system/iot/attestation/atap/ops/
H A Datap_ops_provider.cpp140 uint8_t hash[ATAP_SHA256_DIGEST_LEN]) {
142 plaintext, plaintext_len, hash);
137 forward_sha256(AtapOps* ops, const uint8_t* plaintext, uint32_t plaintext_len, uint8_t hash[ATAP_SHA256_DIGEST_LEN]) argument
H A Dopenssl_ops.cpp229 uint8_t hash[ATAP_SHA256_DIGEST_LEN]) {
230 SHA256(plaintext, plaintext_len, hash);
227 sha256(const uint8_t* plaintext, uint32_t plaintext_len, uint8_t hash[ATAP_SHA256_DIGEST_LEN]) argument

Completed in 490 milliseconds

12