/system/tools/hidl/test/hash_test/good/hash/1.0/ |
H A D | IHash.hal | 16 package test.hash.hash@1.0;
|
/system/tools/hidl/test/hash_test/bad/hash/1.0/ |
H A D | IHash.hal | 16 package test.hash.hash@1.0;
|
/system/core/libutils/ |
H A D | JenkinsHash.cpp | 17 /* 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/include/utils/ |
H A D | JenkinsHash.h | 17 /* 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 D | JenkinsHash.h | 17 /* 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/extras/ioshark/ |
H A D | compile_ioshark.h | 31 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 D | compile_ioshark_subr.c | 68 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/core/fs_mgr/ |
H A D | fs_mgr_priv_sha.h | 25 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/libcutils/ |
H A D | hashmap.cpp | 30 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 D | str_parms.cpp | 57 /* 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/chre/build/sys_support/qcom/ |
H A D | uimage_v2.lcs | 47 /* SysV hash section */ 48 .hash : { *(.hash) } : phdr1 50 /* GNU hash section */ 51 .gnu.hash : { *(.gnu.hash) }
|
/system/core/libmemunreachable/ |
H A D | Leak.h | 25 // 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/update_engine/payload_consumer/ |
H A D | payload_verifier.h | 44 // out_hash_data with the decoded raw hash. Returns true if successful, 50 // Pads a SHA256 hash so that it may be encrypted/signed with RSA2048 52 // hash should be a pointer to vector of exactly 256 bits. The vector 55 static bool PadRSA2048SHA256Hash(brillo::Blob* hash);
|
H A D | install_plan.h | 64 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
|
H A D | payload_verifier.cc | 35 // 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);
|
/system/update_engine/ |
H A D | omaha_response_handler_action_unittest.cc | 126 expected_hash += package.hash + ":"; 174 .hash = kPayloadHashHex}); 181 EXPECT_EQ(expected_hash_, install_plan.payloads[0].hash); 200 .hash = kPayloadHashHex}); 208 EXPECT_EQ(expected_hash_, install_plan.payloads[0].hash); 220 {.payload_urls = {kLongName}, .size = 12, .hash = kPayloadHashHex}); 228 EXPECT_EQ(expected_hash_, install_plan.payloads[0].hash); 251 .hash = kPayloadHashHex}); 254 .hash = kPayloadHashHex}); 262 EXPECT_EQ(expected_hash_, install_plan.payloads[0].hash); [all...] |
H A D | omaha_response.h | 49 std::string hash; member in struct:chromeos_update_engine::OmahaResponse::Package
|
H A D | omaha_response_handler_action.cc | 98 if (!base::HexStringToBytes(package.hash, &raw_hash)) { 99 LOG(ERROR) << "Failed to convert payload hash from hex string to bytes: " 100 << package.hash; 108 .hash = raw_hash, 111 update_check_response_hash += package.hash + ":"; 127 << "Unable to save the update check response hash."; 177 // We sometimes need to waive the hash checks in order to download from 181 // use without a hash. Additionally, we want to always waive hash checks on 185 // - Official URLs require a hash [all...] |
/system/vold/ |
H A D | KeyStorage.h | 47 bool createSecdiscardable(const std::string& path, std::string* hash); 48 bool readSecdiscardable(const std::string& path, std::string* hash);
|
/system/extras/libfec/ |
H A D | fec_verity.cpp | 87 /* 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...] |
H A D | fec_read.cpp | 82 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...] |
/system/tpm/trunks/ |
H A D | tpm_generated.cc | 2859 result = Serialize_TPMI_ALG_HASH(value.hash, buffer); 2887 result = Parse_TPMI_ALG_HASH(buffer, &value->hash, value_bytes); 6416 result = Serialize_TPMI_ALG_HASH(value.hash, buffer); 6434 result = Parse_TPMI_ALG_HASH(buffer, &value->hash, value_bytes); 6451 result = Serialize_TPMI_ALG_HASH(value.hash, buffer); 6469 result = Parse_TPMI_ALG_HASH(buffer, &value->hash, value_bytes); 6486 result = Serialize_TPMI_ALG_HASH(value.hash, buffer); 6509 result = Parse_TPMI_ALG_HASH(buffer, &value->hash, value_bytes); 8120 std::unique_ptr<crypto::SecureHash> hash( 8122 hash [all...] |
/system/tools/hidl/include_hash/hidl-hash/ |
H A D | Hash.h | 39 static std::string hexString(const std::vector<uint8_t> &hash);
|
/system/bt/types/bluetooth/ |
H A D | uuid.h | 126 // 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/tools/hidl/ |
H A D | Hash.cpp | 71 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);
|