Home
last modified time | relevance | path

Searched refs:tree (Results 1 – 20 of 20) sorted by relevance

/trusty/user/app/storage/
Dblock_tree.c107 static void block_tree_set_sizes(struct block_tree* tree, in block_tree_set_sizes() argument
122 tree->key_size = key_size; in block_tree_set_sizes()
123 tree->child_data_size[0] = child_size; in block_tree_set_sizes()
124 tree->child_data_size[1] = data_size; in block_tree_set_sizes()
125 tree->key_count[0] = (payload_size - child_size) / (key_size + child_size); in block_tree_set_sizes()
127 tree->key_count[1] = (payload_size) / (key_size + data_size); in block_tree_set_sizes()
128 tree->block_size = block_size; in block_tree_set_sizes()
130 assert(tree->key_count[0] >= 2); in block_tree_set_sizes()
131 assert(tree->key_count[1] >= 2); in block_tree_set_sizes()
158 static unsigned int block_tree_max_key_count(const struct block_tree* tree, in block_tree_max_key_count() argument
[all …]
Dblock_map.c43 block_tree_init(&block_map->tree, block_size, block_num_size, in block_map_init()
45 block_map->tree.copy_on_write = 1; in block_map_init()
46 block_map->tree.allow_copy_on_write = 1; in block_map_init()
47 block_map->tree.root = *root; in block_map_init()
68 block_tree_walk(tr, &block_map->tree, index, false, &path); in block_map_get()
101 block_tree_walk(tr, &block_map->tree, index, false, &path); in block_map_set()
110 __func__, block_mac_to_block(tr, &block_map->tree.root), in block_map_set()
113 block_tree_remove(tr, &block_map->tree, index, in block_map_set()
124 __func__, block_mac_to_block(tr, &block_map->tree.root), in block_map_set()
127 block_tree_insert(tr, &block_map->tree, index, in block_map_set()
[all …]
Dblock_tree.h124 struct block_tree* tree; member
128 void block_tree_print(struct transaction* tr, const struct block_tree* tree);
129 bool block_tree_check(struct transaction* tr, const struct block_tree* tree);
132 struct block_tree* tree,
161 struct block_tree* tree,
166 struct block_tree* tree,
171 struct block_tree* tree,
178 struct block_tree* tree,
185 struct block_tree* tree,
189 void block_tree_init(struct block_tree* tree,
Dblock_map.h22 struct block_tree tree; member
26 { .tree = BLOCK_TREE_INITIAL_VALUE(block_map.tree), }
DREADME.md41 - block_tree - B+ tree implementation.
42 - block_set - Set operations built on top of B+ tree.
74 The free set B+ tree list every free block in the file system as a set of
75 ranges. The key value in the B+ tree is the start of a free range and the data
80 The file tree stores all the files in the file system. The key value is a hash
86 The block map tree is similar to the file tree except the key is the file block
Dfile.c55 struct block_tree* tree,
143 block_tree_print(tr, &block_map.tree); in file_print()
243 assert((block_map && block_map->tree.root_block_changed) || in file_block_map_update()
307 block_mac_to_block(tr, &block_map->tree.root)); in file_block_map_update()
309 file_entry_rw->block_map = block_map->tree.root; in file_block_map_update()
648 struct block_tree* tree, in file_tree_lookup() argument
661 block_tree_walk(tr, tree, hash - 1, false, tree_path); in file_tree_lookup()
673 block_tree_print(tr, tree); in file_tree_lookup()
705 block_tree_remove(tr, tree, hash, in file_tree_lookup()
716 block_tree_print(tr, tree); in file_tree_lookup()
[all …]
Dfs.h306 void fs_file_tree_init(const struct fs* fs, struct block_tree* tree);
Dsuper.c1129 void fs_file_tree_init(const struct fs* fs, struct block_tree* tree) { in fs_file_tree_init() argument
1135 block_tree_init(tree, fs->dev->block_size, block_num_size, block_mac_size, in fs_file_tree_init()
/trusty/user/base/app/device_tree/tests/
Dmain.c30 struct device_tree_idevice_tree* tree; member
38 _state->tree = NULL; in TEST_F_SETUP()
39 int rc = device_tree_get_service(&_state->tree); in TEST_F_SETUP()
41 ASSERT_NE(_state->tree, NULL); in TEST_F_SETUP()
45 rc = device_tree_idevice_tree_get_compatible_nodes(_state->tree, in TEST_F_SETUP()
67 device_tree_idevice_tree_release(&_state->tree); in TEST_F_TEARDOWN()
/trusty/user/base/app/device_tree/tests/dtb/
Dtest.dts17 /* A device tree overlay with a node for device tree tests */
26 * when the overlay is applied to a base device tree
/trusty/user/base/app/device_tree/tests/dtb/base/
Dbase.dts18 * An empty base device tree which the test device tree overlay will be applied
/trusty/kernel/lib/shared/device_tree/client/include/lib/shared/device_tree/
Ddevice_tree.h50 int device_tree_get_service(struct device_tree_idevice_tree** tree);
/trusty/user/app/keymaster/
Dkeymaster_attributes.proto23 // To generate the file using the tool chain in trusty tree, add the following
35 // Please check the nanopb version in trusty tree at external/nanopb-c to make
/trusty/kernel/lib/shared/device_tree/client/
Ddevice_tree.cpp52 int device_tree_get_service(device_tree_idevice_tree** tree) { in device_tree_get_service() argument
53 assert(tree != nullptr); in device_tree_get_service()
70 *tree = &bdr->cbinder; in device_tree_get_service()
/trusty/device/arm/generic-arm64/
DPREUPLOAD.cfg2 # Run mypy on all python scripts that exist in the tree. This will only generate
/trusty/vendor/google/aosp/
DPREUPLOAD.cfg2 # Run mypy on all python scripts that exist in the tree. This will only generate
/trusty/user/base/
DPREUPLOAD.cfg2 # Run mypy on all python scripts that exist in the tree. This will only generate
/trusty/kernel/lib/dtb_embedded/
Ddtb.ld29 ASSERT(SIZEOF(.dtb) > 0, "No embedded device tree blob was found");
/trusty/host/common/
DPREUPLOAD.cfg2 # Run mypy on all python scripts that exist in the tree. This will only generate
/trusty/user/app/storage/test/block_host_test/
Dblock_test.c301 mark_block_tree_in_use(tr, &block_map.tree, true, "file", in mark_files_in_use()
479 struct block_tree tree = BLOCK_TREE_INITIAL_VALUE(tree); in block_tree_test_etc() local
493 block_tree_init(&tree, block_size, key_size, child_size, child_size); in block_tree_test_etc()
495 tree.copy_on_write = true; in block_tree_test_etc()
496 tree.allow_copy_on_write = true; in block_tree_test_etc()
499 assert(tree.key_count[0] == order - 1); in block_tree_test_etc()
500 assert(tree.key_count[1] == order - 1); in block_tree_test_etc()
507 block_tree_insert(tr, &tree, key, i); in block_tree_test_etc()
520 block_tree_print(tr, &tree); in block_tree_test_etc()
526 block_tree_walk(tr, &tree, tmpkey, false, &path); in block_tree_test_etc()
[all …]