/fuchsia/zircon/kernel/target/arm64/dtb/ |
H A D | update-device-tree.sh | 1 dtc -I dts -o dummy-device-tree.dtb -O dtb dummy-device-tree.dts
|
/fuchsia/zircon/system/utest/fbl/include/fbl/tests/intrusive_containers/ |
H A D | intrusive_wavl_tree_checker.h | 17 static bool VerifyParentBackLinks(const TreeType& tree, argument 40 static bool SanityCheck(const TreeType& tree) { argument 48 if (tree.is_empty()) { 49 // If the tree is empty, then the root should be null, and the 51 ASSERT_NULL(tree.root_, ""); 52 ASSERT_EQ(tree.sentinel(), tree.left_most_, ""); 53 ASSERT_EQ(tree.sentinel(), tree.right_most_, ""); 54 EXPECT_EQ(0u, tree [all...] |
/fuchsia/zircon/third_party/ulib/jemalloc/test/unit/ |
H A D | rb.c | 33 * Duplicates are not allowed in the tree, so force an 47 tree_t tree; local 50 tree_new(&tree); 52 assert_true(tree_empty(&tree), "Tree should be empty"); 53 assert_ptr_null(tree_first(&tree), "Unexpected node"); 54 assert_ptr_null(tree_last(&tree), "Unexpected node"); 58 assert_ptr_null(tree_search(&tree, &key), "Unexpected node"); 62 assert_ptr_null(tree_nsearch(&tree, &key), "Unexpected node"); 66 assert_ptr_null(tree_psearch(&tree, &key), "Unexpected node"); 115 tree_iterate_cb(tree_t *tree, node_ argument 143 tree_iterate(tree_t *tree) argument 154 tree_iterate_reverse(tree_t *tree) argument 165 node_remove(tree_t *tree, node_t *node, unsigned nnodes) argument 198 remove_iterate_cb(tree_t *tree, node_t *node, void *data) argument 209 remove_reverse_iterate_cb(tree_t *tree, node_t *node, void *data) argument 235 tree_t tree; local [all...] |
/fuchsia/zircon/system/ulib/digest/include/digest/ |
H A D | merkle-tree.h | 23 // digest::MerkleTree represents a hash tree that can be used to independently 26 // A Merkle tree is typically created for a given |data| and |data_len| using 29 // uint8_t *tree = malloc(tree_len); // or other allocation routine 31 // digest::MerkleTree::Create(data, data_len, tree, tree_len, &digest); 33 // At this point, |digest| contains the root digest for the Merkle tree 38 // data_len, tree, tree_len, offset, length, digest); 42 // data, tree, or root digest have been altered. 45 // This sets the size that the tree uses to chunk up the data and digests. 49 // Returns the minimum size needed to hold a Merkle tree for the given 50 // |data_len|. The tree consist [all...] |
/fuchsia/zircon/system/ulib/digest/ |
H A D | merkle-tree.cpp | 5 #include <digest/merkle-tree.h> 19 // Size of a node in bytes. Defined in tree.h. 23 // node-aligned length in one level of the Merkle tree, |L / kDigestsPerNode| is 30 // tree is hashed: 34 // * level is the height of the node in the tree (data nodes have level == 0). 79 // Helper functions for working between levels of the tree. 107 zx_status_t MerkleTree::Create(const void* data, size_t data_len, void* tree, size_t tree_len, argument 112 (rc = mt.CreateUpdate(data, data_len, tree)) != ZX_OK || 113 (rc = mt.CreateFinal(tree, digest)) != ZX_OK) { 127 // Data fits in a single node, making this the top level of the tree 146 CreateUpdate(const void* data, size_t length, void* tree) argument 205 CreateFinal(void* tree, Digest* root) argument 209 CreateFinalInternal(const void* data, void* tree, Digest* root) argument 247 Verify(const void* data, size_t data_len, const void* tree, size_t tree_len, size_t offset, size_t length, const Digest& root) argument 291 VerifyLevel(const void* data, size_t data_len, const void* tree, size_t offset, size_t length, uint64_t level) argument 367 merkle_tree_create_update(merkle_tree_t* mt, const void* data, size_t length, void* tree) argument 381 merkle_tree_create_final(merkle_tree_t* mt, void* tree, void* out, size_t out_len) argument 398 merkle_tree_create(const void* data, size_t data_len, void* tree, size_t tree_len, void* out, size_t out_len) argument 408 merkle_tree_verify(const void* data, size_t data_len, void* tree, size_t tree_len, size_t offset, size_t length, const void* root, size_t root_len) argument [all...] |
H A D | rules.mk | 13 $(LOCAL_DIR)/merkle-tree.cpp 36 $(LOCAL_DIR)/merkle-tree.cpp
|
/fuchsia/zircon/system/ulib/fbl/include/fbl/ |
H A D | intrusive_wavl_tree_internal.h | 41 static bool VerifyRankRule(const TreeType& tree, typename TreeType::RawPtrType node) { argument 46 static bool VerifyBalance(const TreeType& tree, uint64_t depth) { argument 54 // Prototypes for the WAVL tree node state. By default, we just use a bool to
|
H A D | intrusive_wavl_tree.h | 15 // WAVLTree<> is an implementation of a "Weak AVL" tree; a self 16 // balancing binary search tree whose rebalancing algorithm was 38 // upper_bound(key) : Finds the element (E) in the tree such that E.key > key 39 // lower_bound(key) : Finds the element (E) in the tree such that E.key >= key 41 // The worst depth of a WAVL tree depends on whether or not the tree has ever 43 // ++ If the tree has seen only insert operations, the worst case depth of the 44 // tree is log_phi(N), where phi is the golden ratio. This is the same bound 45 // as that of an AVL tree. 46 // ++ If the tree ha 520 LRMost(ContainerType& tree) argument 521 RLMost(ContainerType& tree) argument 535 LRMost(ContainerType& tree) argument 536 RLMost(ContainerType& tree) argument [all...] |
/fuchsia/zircon/system/host/merkleroot/ |
H A D | merkleroot.cpp | 19 #include <digest/merkle-tree.h> 88 fbl::unique_ptr<uint8_t[]> tree; local 92 tree.reset(new (&ac) uint8_t[len]); 106 MerkleTree::Create(data, info.st_size, tree.get(), len, &digest); 112 fprintf(stderr, "%s: Merkle tree creation failed: %d\n", 118 fprintf(stderr, "%s: Unable to print Merkle tree root: %d\n",
|
/fuchsia/zircon/system/utest/fbl/ |
H A D | intrusive_wavl_tree_tests.cpp | 142 static bool VerifyRankRule(const TreeType& tree, typename TreeType::RawPtrType node) { argument 149 // Check the rank rule. The rules for a WAVL tree are... 178 static bool VerifyBalance(const TreeType& tree, uint64_t depth) { argument 183 if (tree.size()) { 197 double log2N = log2(static_cast<double>(tree.size())); 280 static bool DoBalanceTestInsert(BalanceTestTree& tree, BalanceTestObj* ptr) { argument 283 // The selected object should not be in the tree. 287 // Put the object into the tree. Assert that it succeeds, then 288 // sanity check the tree. 289 ASSERT_TRUE(tree 295 DoBalanceTestErase(BalanceTestTree& tree, BalanceTestObj* ptr) argument 335 BalanceTestTree tree; local [all...] |
/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> 33 // tree. These determine those sizes in a consistent way. The only requirement 82 "Wrong tree length"); 194 bool CreateFinal(size_t data_len, const char* digest, void* data, void* tree) { argument 199 ASSERT_OK(merkleTree.CreateUpdate(data, data_len, tree)); 201 ASSERT_OK(merkleTree.CreateFinal(tree, &actual)); 639 // Create the Merkle tree 670 // Flip bit in tree (if large enough to have a tree)
|
/fuchsia/zircon/make/ |
H A D | board.mk | 39 # Linux device tree binary, so a dummy dtb is concatenated at the end of the 60 DUMMY_DTB := kernel/target/arm64/dtb/dummy-device-tree.dtb
|
H A D | engine.mk | 148 # location of the zircon source tree (i.e. usually . in a standalone build). 439 # Directory in the source tree where MODULE_FIRMWARE files are found.
|
/fuchsia/zircon/third_party/uapp/kilo/ |
H A D | rules.mk | 37 # zircon source tree. We do not expose a source directory, and we don't want to
|
/fuchsia/zircon/third_party/ulib/musl/third_party/tre/ |
H A D | regcomp.c | 1033 /* Inserts a catenation node to the root of the tree given in `node'. 1061 /* Inserts a catenation node to the root of the tree given in `node'. 1120 /* Adds tags to appropriate locations in the parse tree in `tree', so that 1122 static reg_errcode_t tre_add_tags(tre_mem_t mem, tre_stack_t* stack, tre_ast_node_t* tree, argument 1126 tre_ast_node_t* node = tree; /* Tree node we are currently looking at. */ 1532 assert(tree->num_tags == num_tags); 1967 /* Walk through the tree recursively. */ 2051 the nodes of the AST `tree'. */ 2052 static reg_errcode_t tre_compute_nfl(tre_mem_t mem, tre_stack_t* stack, tre_ast_node_t* tree) { argument 2440 tre_ast_node_t *tree, *tmp_ast_l, *tmp_ast_r; local [all...] |
/fuchsia/zircon/system/uapp/lsusb/ |
H A D | lsusb.c | 279 int depth; // depth in tree, or -1 if not computed yet 376 // print device tree recursively 393 bool tree = false; local 402 tree = true; 424 if (tree) { 440 printf(" -t Prints USB device tree\n");
|
/fuchsia/zircon/system/ulib/blobfs/include/blobfs/ |
H A D | format.h | 10 #include <digest/merkle-tree.h>
|
/fuchsia/zircon/system/ulib/region-alloc/ |
H A D | region-alloc.cpp | 408 // allocated_regions_by_base tree, but not in either of the avail_regions 527 // in the tree. 577 bool RegionAllocator::IntersectsLocked(const Region::WAVLTreeSortByBase& tree, 579 // Find the first entry in the tree whose base is >= region.base. If this 582 auto iter = tree.lower_bound(region.base); 586 // Check the element before us in the tree. If it exists, we know that it's
|
/fuchsia/zircon/system/ulib/blobfs/ |
H A D | common.cpp | 15 #include <digest/merkle-tree.h>
|
H A D | blobfs.cpp | 14 #include <digest/merkle-tree.h> 154 const void* tree = inode_.blob_size ? GetMerkle() : nullptr; local 163 zx_status_t status = MerkleTree::Verify(data, data_size, tree, 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 522 // waiting until the data is fully downloaded to create the tree.
|
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 291 // Calculate the actual Merkle tree.
|
/fuchsia/zircon/system/ulib/region-alloc/include/region-alloc/ |
H A D | region-alloc.h | 512 bool IntersectsLocked(const Region::WAVLTreeSortByBase& tree,
|
/fuchsia/zircon/system/utest/blobfs-bench/ |
H A D | blobfs-bench.cpp | 12 #include <digest/merkle-tree.h> 153 // Sanity-check the merkle tree 356 // There should be enough space for each blob, the merkle tree nodes, and the inodes.
|
/fuchsia/zircon/system/utest/blobfs/ |
H A D | blobfs.cpp | 18 #include <digest/merkle-tree.h> 493 // Creates an open blob with the provided Merkle tree + Data, and 527 // Creates a blob with the provided Merkle tree + Data, and 591 // Sanity-check the merkle tree
|