Lines Matching refs:Digest
25 const size_t kDigestsPerNode = MerkleTree::kNodeSize / Digest::kLength;
29 // Digest wrapper functions. These functions implement how a node in the Merkle
39 // Wrapper for Digest::Init. This primes the working |digest| initializing it
41 zx_status_t DigestInit(Digest* digest, uint64_t locality, size_t length) {
54 // Wrapper for Digest::Update. This will hash data from |in|, either |length|
57 size_t DigestUpdate(Digest* digest, const uint8_t* in, size_t offset, size_t length) {
65 // Wrapper for Digest::Final. This pads the hashed data with zeros up to a
67 void DigestFinal(Digest* digest, size_t offset) {
108 Digest* digest) {
197 digest_.CopyTo(out, Digest::kLength);
198 rc = next_->CreateUpdate(out, Digest::kLength, next);
199 out += Digest::kLength;
200 tree_off += Digest::kLength;
205 zx_status_t MerkleTree::CreateFinal(void* tree, Digest* root) {
209 zx_status_t MerkleTree::CreateFinalInternal(const void* data, void* tree, Digest* root) {
248 size_t offset, size_t length, const Digest& root) {
274 const Digest& expected) {
281 Digest actual;
309 Digest actual;
324 expected += Digest::kLength;
334 using digest::Digest;
391 Digest digest;
401 Digest digest;
411 if (root_len < Digest::kLength) {
414 Digest digest(static_cast<const uint8_t*>(root));