Searched refs:merkle (Results 1 - 14 of 14) sorted by relevance
/fuchsia/zircon/system/ulib/digest/ |
H A D | rules.mk | 13 $(LOCAL_DIR)/merkle-tree.cpp 36 $(LOCAL_DIR)/merkle-tree.cpp
|
H A D | merkle-tree.cpp | 5 #include <digest/merkle-tree.h>
|
/fuchsia/zircon/system/utest/digest/ |
H A D | rules.mk | 13 $(LOCAL_DIR)/merkle-tree.cpp \
|
H A D | merkle-tree.cpp | 5 #include <digest/merkle-tree.h>
|
/fuchsia/zircon/system/utest/blobfs-bench/ |
H A D | blobfs-bench.cpp | 12 #include <digest/merkle-tree.h> 50 fbl::unique_ptr<char[]> merkle; member in struct:__anon1297::BlobInfo 139 info->merkle = nullptr; 141 info->merkle.reset(new (&ac) char[info->size_merkle]); 145 ASSERT_EQ(MerkleTree::Create(&info->data[0], info->size_data, &info->merkle[0], 153 // Sanity-check the merkle tree 154 ASSERT_EQ(MerkleTree::Verify(&info->data[0], info->size_data, &info->merkle[0], 356 // There should be enough space for each blob, the merkle tree nodes, and the inodes.
|
/fuchsia/zircon/system/host/blobfs/ |
H A D | blobfs.h | 20 fbl::Array<uint8_t> merkle; member in struct:MerkleInfo 45 // Calculates merkle trees for the processed blobs, and determines
|
H A D | main.cpp | 27 fbl::move(info.merkle)); 151 &info.merkle)) != ZX_OK) { 183 // Remove all duplicate blobs by first sorting the merkle trees by
|
/fuchsia/zircon/system/host/merkleroot/ |
H A D | merkleroot.cpp | 19 #include <digest/merkle-tree.h>
|
/fuchsia/zircon/system/ulib/blobfs/include/blobfs/ |
H A D | format.h | 10 #include <digest/merkle-tree.h>
|
H A D | host.h | 139 // Create a merkle tree and digest from the supplied file. 144 // merkle tree generation. No other methods are thread safe. 149 digest::Digest digest, fbl::Array<uint8_t> merkle);
|
/fuchsia/zircon/system/ulib/blobfs/ |
H A D | host.cpp | 16 #include <digest/merkle-tree.h> 113 // From a buffer, create a merkle tree. 116 // Merkle digest and the output merkle tree as a uint8_t array. 131 // Given a buffer (and pre-computed merkle tree), add the buffer as a 134 digest::Digest digest, fbl::Array<uint8_t> merkle) { 174 } else if ((status = bs->WriteData(inode, merkle.get(), data)) != ZX_OK) { 306 digest::Digest digest, fbl::Array<uint8_t> merkle) { 314 fbl::move(digest), fbl::move(merkle)); 588 // Read in uncompressed merkle blocks. 133 blobfs_add_mapped_blob_with_merkle(Blobfs* bs, void* blob_data, uint64_t length, digest::Digest digest, fbl::Array<uint8_t> merkle) argument 305 blobfs_add_blob_with_merkle(Blobfs* bs, int data_fd, uint64_t length, digest::Digest digest, fbl::Array<uint8_t> merkle) argument
|
H A D | common.cpp | 15 #include <digest/merkle-tree.h>
|
H A D | blobfs.cpp | 14 #include <digest/merkle-tree.h> 253 // Read the uncompressed merkle tree. 291 // Read both the uncompressed merkle tree and data. 521 // methods to create the merkle tree as we write data, rather than
|
/fuchsia/zircon/system/utest/blobfs/ |
H A D | blobfs.cpp | 18 #include <digest/merkle-tree.h> 487 fbl::unique_ptr<char[]> merkle; member in struct:__anon1295::blob_info 578 info->merkle = nullptr; 580 info->merkle.reset(new (&ac) char[info->size_merkle]); 584 ASSERT_EQ(MerkleTree::Create(&info->data[0], info->size_data, &info->merkle[0], 591 // Sanity-check the merkle tree 592 ASSERT_EQ(MerkleTree::Verify(&info->data[0], info->size_data, &info->merkle[0],
|
Completed in 215 milliseconds