Home
last modified time | relevance | path

Searched refs:block_tree (Results 1 – 17 of 17) sorted by relevance

/trusty/user/app/storage/
Dblock_tree.h67 struct block_tree { struct
86 #define BLOCK_TREE_INITIAL_VALUE(block_tree) \ argument
88 0, 0, {0, 0}, {0, 0}, BLOCK_MAC_INITIAL_VALUE(block_tree.root), \
89 {0, 0, BLOCK_MAC_INITIAL_VALUE(block_tree.inserting.child), \
90 BLOCK_MAC_INITIAL_VALUE(block_tree.inserting.data)}, \
124 struct block_tree* tree;
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,
[all …]
Dblock_set.c142 block_tree_walk(tr, &set->block_tree, 0, true, &path); in block_set_print_ranges()
166 block_tree_print(tr, &set->block_tree); in block_set_print()
187 block_tree_walk(tr, &set->block_tree, 0, true, &path); in block_set_check_ranges()
223 valid = block_tree_check(tr, &set->block_tree); in block_set_check()
253 block_tree_walk(tr, &set->block_tree, min_block, true, &path); in block_set_find_next_block()
268 block_mac_to_block(tr, &set->block_tree.root), min_block, in_set, in block_set_find_next_block()
431 block_mac_to_block(tr, &set->block_tree.root), range.start, in block_set_add_range()
440 block_tree_walk(tr, &set->block_tree, range.start - 1, true, &path); in block_set_add_range()
450 block_tree_walk(tr, &set->block_tree, range.start - 1, true, &path); in block_set_add_range()
465 block_tree_insert(tr, &set->block_tree, range.start, range.end); in block_set_add_range()
[all …]
Dtransaction.h74 struct block_tree files_added;
75 struct block_tree files_updated;
76 struct block_tree files_removed;
Dblock_set.h54 struct block_tree block_tree; member
62 .block_tree = BLOCK_TREE_INITIAL_VALUE(block_set.block_tree), \
Dtransaction.c95 assert(!block_mac_valid(tr, &set_i->block_tree.root) || in transaction_merge_free_sets()
97 tr, block_mac_to_block(tr, &set_i->block_tree.root))); in transaction_merge_free_sets()
190 new_free_set->block_tree.copy_on_write = true; in transaction_rebuild_free_set()
191 new_free_set->block_tree.allow_copy_on_write = true; in transaction_rebuild_free_set()
313 block_tree_walk(tr, &free->block_tree, 0, true, &path); in check_free_tree()
434 &new_free_set.block_tree.root); in transaction_complete_etc()
454 if (block_mac_same_block(tr, &tr->fs->free.block_tree.root, in transaction_complete_etc()
455 &new_free_set.block_tree.root)) { in transaction_complete_etc()
460 assert(block_mac_eq(tr, &tr->fs->free.block_tree.root, in transaction_complete_etc()
461 &new_free_set.block_tree.root)); in transaction_complete_etc()
[all …]
Dcheckpoint.h36 struct block_tree* files,
Dcheckpoint.c120 struct block_tree* files, in checkpoint_read()
142 free->block_tree.root = checkpoint_ro->free; in checkpoint_read()
Dfs.h141 struct block_tree files;
306 void fs_file_tree_init(const struct fs* fs, struct block_tree* tree);
Dblock_tree.c107 static void block_tree_set_sizes(struct block_tree* tree, 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()
175 const struct block_tree* tree, in block_tree_node_max_key_count()
211 static void block_tree_node_shift(const struct block_tree* tree, in block_tree_node_shift()
361 const struct block_tree* tree, in block_tree_node_merge_entries()
394 static void block_tree_node_shift_down(const struct block_tree* tree, in block_tree_node_shift_down()
413 static void block_tree_node_clear_end(const struct block_tree* tree, in block_tree_node_clear_end()
435 static void block_tree_node_insert(const struct block_tree* tree, in block_tree_node_insert()
458 const struct block_tree* tree, in block_tree_node_get_key()
491 static void block_tree_node_set_key(const struct block_tree* tree, in block_tree_node_set_key()
[all …]
Dblock_map.h22 struct block_tree tree;
Dsuper.c413 bool fs_is_cleared = !block_mac_valid(tr, &fs->free.block_tree.root); in write_current_super_block()
420 tr, &fs->free.block_tree.root, &fs->files.root, &fs->checkpoint, in write_current_super_block()
598 struct block_tree checkpoint_files = in fs_set_roots()
603 fs->free.block_tree.root = *free; in fs_set_roots()
636 fs->free.block_tree.copy_on_write = true; in fs_set_roots()
702 fs->free.block_tree.copy_on_write = true; in fs_init_from_super()
1108 block_probe(fs, &fs->free.block_tree.root, false))) { in fs_check_quick()
1129 void fs_file_tree_init(const struct fs* fs, struct block_tree* tree) { in fs_file_tree_init()
Drules.mk87 $(LOCAL_DIR)/block_tree.c \
Dfile.c55 struct block_tree* tree,
648 struct block_tree* tree, in file_tree_lookup()
920 struct block_tree* tree = added ? &tr->files_added : &tr->fs->files; in file_iterate()
1431 struct block_tree new_files; in file_transaction_complete()
1696 struct block_tree files; in files_rebuild_free_set()
DREADME.md41 - block_tree - B+ tree implementation.
/trusty/user/app/storage/test/block_host_test/
Drules.mk28 $(STORAGE_DIR)/block_tree.c \
Dblock_test.c261 struct block_tree* block_tree, in mark_block_tree_in_use() argument
269 block_tree_walk(tr, block_tree, 0, true, &path); in mark_block_tree_in_use()
309 struct block_tree checkpoint_files = in check_fs_prepare()
334 mark_block_tree_in_use(tr, &tr->fs->free.block_tree, false, in check_fs_prepare()
347 mark_block_tree_in_use(tr, &tr->fs->checkpoint_free.block_tree, false, in check_fs_prepare()
479 struct block_tree tree = BLOCK_TREE_INITIAL_VALUE(tree); in block_tree_test_etc()
2501 block_tree_walk(tr, &tr->fs->free.block_tree, 0, true, &path); in select_free_block()
2571 block_mac_to_block(tr, &tr->fs->free.block_tree.root)); in fs_recovery_clear_roots_test()
/trusty/user/app/storage/test/storage_host_test/
Drules.mk29 $(STORAGE_DIR)/block_tree.c \