Home
last modified time | relevance | path

Searched refs:hashes (Results 1 – 8 of 8) sorted by relevance

/system/tools/hidl/
DHash.cpp31 static std::map<std::string, Hash> hashes; in getHash() local
33 auto it = hashes.find(path); in getHash()
35 if (hashes.find(path) == hashes.end()) { in getHash()
36 it = hashes.insert(it, {path, Hash(path)}); in getHash()
105 auto it = hashes.find(fqName); in lookup()
107 if (it == hashes.end()) { in lookup()
150 file->hashes[fqName].push_back(hash); in readHashFile()
156 std::map<std::string,std::vector<std::string>> hashes; member
/system/extras/verity/
Dbuild_verity_tree.cpp22 unsigned char *hashes; member
100 ctx->hashes, &s, in hash_chunk()
102 ctx->hashes += s; in hash_chunk()
105 memcpy(ctx->hashes, ctx->zero_block_hash, ctx->hash_size); in hash_chunk()
106 ctx->hashes += ctx->hash_size; in hash_chunk()
319 ctx.hashes = verity_tree_levels[0]; in main()
/system/extras/libfec/
Dfec_verity.cpp98 uint64_t hashes = file_size / FEC_BLOCKSIZE; in verity_get_size() local
102 level_hashes[level] = hashes; in verity_get_size()
105 hashes = fec_div_round_up(hashes * SHA256_DIGEST_LENGTH, FEC_BLOCKSIZE); in verity_get_size()
106 total += hashes; in verity_get_size()
109 } while (hashes > 1); in verity_get_size()
226 uint32_t hashes[levels]; in verify_tree() local
228 verity_get_size(v->data_blocks * FEC_BLOCKSIZE, NULL, hashes); in verify_tree()
232 uint32_t blocks = hashes[levels - i]; in verify_tree()
265 uint32_t blocks = hashes[levels - i]; in verify_tree()
/system/libhidl/transport/base/1.0/
DIBase.hal121 * Returns hashes of the source HAL files that define the interfaces of the
/system/tpm/trunks/generator/
Draw_commands_fixed.txt2989 TPM2_PCR_Read() or TPM2_PolicyPCR() could not complete until the hashes have been checked
6797 If the compared hashes are not the same, then the TPM shall return TPM_RC_POLICY_FAIL.
10978 Because that digest size changes according to the implemented hashes, the maximum amount of
16565 different hash algorithm. Rather than require that the external software generate multiple hashes o…
18840 The arg2.size and arg3.size fields are not included in the hashes.
18844 PolicyUpdate() uses two hashes because arg2 and arg3 are variable-sized and the concatenation of
20395 c) Extend the command code and the hashes computed in step a) above:
20457 the list of hashes to check for a match
20599 // Add each of the hashes in the list
Draw_commands.txt2989 TPM2_PCR_Read() or TPM2_PolicyPCR() could not complete until the hashes have been checked
6793 If the compared hashes are not the same, then the TPM shall return TPM_RC_POLICY_FAIL.
10967 Because that digest size changes according to the implemented hashes, the maximum amount of
16554 different hash algorithm. Rather than require that the external software generate multiple hashes o…
18829 The arg2.size and arg3.size fields are not included in the hashes.
18833 PolicyUpdate() uses two hashes because arg2 and arg3 are variable-sized and the concatenation of
20384 c) Extend the command code and the hashes computed in step a) above:
20446 the list of hashes to check for a match
20588 // Add each of the hashes in the list
Draw_structures.txt11499 This construct limits the number of hashes in the list to the number of digests implemented in the …
Draw_structures_fixed.txt11531 This construct limits the number of hashes in the list to the number of digests implemented in the …