| /system/utest/fbl/include/fbl/tests/intrusive_containers/ |
| A D | intrusive_wavl_tree_checker.h | 49 if (tree.is_empty()) { in SanityCheck()
52 ASSERT_NULL(tree.root_, ""); in SanityCheck()
53 ASSERT_EQ(tree.sentinel(), tree.left_most_, ""); in SanityCheck()
54 ASSERT_EQ(tree.sentinel(), tree.right_most_, ""); in SanityCheck()
55 EXPECT_EQ(0u, tree.size(), ""); in SanityCheck()
60 ASSERT_NONNULL(tree.root_, ""); in SanityCheck()
65 ASSERT_EQ(tree.sentinel(), in SanityCheck()
71 ASSERT_EQ(tree.sentinel(), in SanityCheck()
75 EXPECT_LT(0u, tree.size(), ""); in SanityCheck()
86 RawPtrType node = tree.root_; in SanityCheck()
[all …]
|
| /system/ulib/digest/include/digest/ |
| A D | merkle-tree.h | 58 static zx_status_t Create(const void* data, size_t data_len, void* tree,
67 const void* tree, size_t tree_len, size_t offset,
83 zx_status_t CreateUpdate(const void* data, size_t length, void* tree);
90 zx_status_t CreateFinal(void* tree, Digest* digest);
107 const void* tree, size_t offset,
112 zx_status_t CreateFinalInternal(const void* data, void* tree, Digest* root);
182 zx_status_t merkle_tree_create(const void* data, size_t data_len, void* tree,
194 size_t length, void* tree);
198 zx_status_t merkle_tree_create_final(merkle_tree_t* mt, void* tree, void* out,
202 zx_status_t merkle_tree_verify(const void* data, size_t data_len, void* tree,
|
| /system/ulib/digest/ |
| A D | merkle-tree.cpp | 112 (rc = mt.CreateUpdate(data, data_len, tree)) != ZX_OK || in Create()
113 (rc = mt.CreateFinal(tree, digest)) != ZX_OK) { in Create()
162 if (!data || (!tree && length_ > kNodeSize)) { in CreateUpdate()
168 uint8_t* out = static_cast<uint8_t*>(tree) + tree_off; in CreateUpdate()
206 return CreateFinalInternal(nullptr, tree, root); in CreateFinal()
217 if (!root || (!tree && length_ > kNodeSize)) { in CreateFinalInternal()
241 return next_->CreateFinalInternal(tree, next, root); in CreateFinalInternal()
258 data = tree; in Verify()
261 tree = static_cast<const uint8_t*>(tree) + data_len; in Verify()
296 if (!data || data_len <= kNodeSize || !tree) { in VerifyLevel()
[all …]
|
| A D | rules.mk | 13 $(LOCAL_DIR)/merkle-tree.cpp
36 $(LOCAL_DIR)/merkle-tree.cpp
|
| /system/utest/fbl/ |
| A D | intrusive_wavl_tree_tests.cpp | 179 static bool VerifyBalance(const TreeType& tree, uint64_t depth) { in VerifyBalance() argument
184 if (tree.size()) { in VerifyBalance()
198 double log2N = log2(static_cast<double>(tree.size())); in VerifyBalance()
290 ASSERT_TRUE(tree.insert_or_find(BalanceTestObjPtr(ptr))); in DoBalanceTestInsert()
291 ASSERT_TRUE(WAVLTreeChecker::SanityCheck(tree)); in DoBalanceTestInsert()
296 static bool DoBalanceTestErase(BalanceTestTree& tree, BalanceTestObj* ptr) { in DoBalanceTestErase() argument
305 BalanceTestObjPtr erased = tree.erase(ptr->GetKey()); in DoBalanceTestErase()
311 ASSERT_TRUE(WAVLTreeChecker::SanityCheck(tree)); in DoBalanceTestErase()
336 BalanceTestTree tree; in WAVLBalanceTest() local
385 ASSERT_TRUE(DoBalanceTestInsert(tree, &objects[i])); in WAVLBalanceTest()
[all …]
|
| /system/ulib/fbl/include/fbl/ |
| A D | intrusive_wavl_tree_internal.h | 41 static bool VerifyRankRule(const TreeType& tree, typename TreeType::RawPtrType node) { in VerifyRankRule()
46 static bool VerifyBalance(const TreeType& tree, uint64_t depth) { in VerifyBalance()
|
| A D | intrusive_wavl_tree.h | 541 static RawPtrType& LRMost(ContainerType& tree) { return tree.left_most_; }
542 static RawPtrType& RLMost(ContainerType& tree) { return tree.right_most_; }
553 static RawPtrType& LRMost(ContainerType& tree) { return tree.right_most_; }
554 static RawPtrType& RLMost(ContainerType& tree) { return tree.left_most_; }
|
| /system/host/merkleroot/ |
| A D | merkleroot.cpp | 88 fbl::unique_ptr<uint8_t[]> tree; in handle_entry() local
92 tree.reset(new (&ac) uint8_t[len]); in handle_entry()
106 MerkleTree::Create(data, info.st_size, tree.get(), len, &digest); in handle_entry()
|
| /system/utest/digest/ |
| A D | rules.mk | 13 $(LOCAL_DIR)/merkle-tree.cpp \
|
| A D | merkle-tree.cpp | 194 bool CreateFinal(size_t data_len, const char* digest, void* data, void* tree) { in CreateFinal() argument
199 ASSERT_OK(merkleTree.CreateUpdate(data, data_len, tree)); in CreateFinal()
201 ASSERT_OK(merkleTree.CreateFinal(tree, &actual)); in CreateFinal()
|
| /system/uapp/lsusb/ |
| A D | lsusb.c | 421 bool tree = false; in main() local
430 tree = true; in main()
452 if (tree) { in main()
|
| /system/ulib/region-alloc/ |
| A D | region-alloc.cpp | 577 bool RegionAllocator::IntersectsLocked(const Region::WAVLTreeSortByBase& tree, in IntersectsLocked() argument
582 auto iter = tree.lower_bound(region.base); in IntersectsLocked()
|
| /system/host/fidl/ |
| A D | README.md | 68 The JSON IR is consumed by an out-of-tree program, named the **back-end**, that
|
| /system/ulib/region-alloc/include/region-alloc/ |
| A D | region-alloc.h | 541 bool IntersectsLocked(const Region::WAVLTreeSortByBase& tree,
|
| /system/ulib/blobfs/ |
| A D | vnode.cpp | 109 const void* tree = inode_.blob_size ? GetMerkle() : nullptr; in Verify() local
118 MerkleTree::Verify(data, data_size, tree, merkle_size, 0, data_size, digest); in Verify()
|