Lines Matching refs:Digest
25 const size_t kDigestsPerNode = MerkleTree::kNodeSize / Digest::kLength;
41 zx_status_t DigestInit(Digest* digest, uint64_t locality, size_t length) { in DigestInit()
57 size_t DigestUpdate(Digest* digest, const uint8_t* in, size_t offset, size_t length) { in DigestUpdate()
67 void DigestFinal(Digest* digest, size_t offset) { in DigestFinal()
108 Digest* digest) { in Create()
197 digest_.CopyTo(out, Digest::kLength); in CreateUpdate()
198 rc = next_->CreateUpdate(out, Digest::kLength, next); in CreateUpdate()
199 out += Digest::kLength; in CreateUpdate()
200 tree_off += Digest::kLength; in CreateUpdate()
205 zx_status_t MerkleTree::CreateFinal(void* tree, Digest* root) { in CreateFinal()
209 zx_status_t MerkleTree::CreateFinalInternal(const void* data, void* tree, Digest* root) { in CreateFinalInternal()
248 size_t offset, size_t length, const Digest& root) { in Verify()
274 const Digest& expected) { in VerifyRoot()
281 Digest actual; in VerifyRoot()
309 Digest actual; in VerifyLevel()
324 expected += Digest::kLength; in VerifyLevel()
334 using digest::Digest;
391 Digest digest; in merkle_tree_create_final()
401 Digest digest; in merkle_tree_create()
411 if (root_len < Digest::kLength) { in merkle_tree_verify()
414 Digest digest(static_cast<const uint8_t*>(root)); in merkle_tree_verify()