Home
last modified time | relevance | path

Searched refs:btree (Results 1 - 25 of 79) sorted by relevance

1234

/kernel/linux/linux-5.10/fs/hpfs/
H A Danode.c15 struct bplus_header *btree, unsigned sec, in hpfs_bplus_lookup()
24 if (bp_internal(btree)) { in hpfs_bplus_lookup()
25 for (i = 0; i < btree->n_used_nodes; i++) in hpfs_bplus_lookup()
26 if (le32_to_cpu(btree->u.internal[i].file_secno) > sec) { in hpfs_bplus_lookup()
27 a = le32_to_cpu(btree->u.internal[i].down); in hpfs_bplus_lookup()
30 btree = &anode->btree; in hpfs_bplus_lookup()
37 for (i = 0; i < btree->n_used_nodes; i++) in hpfs_bplus_lookup()
38 if (le32_to_cpu(btree->u.external[i].file_secno) <= sec && in hpfs_bplus_lookup()
39 le32_to_cpu(btree in hpfs_bplus_lookup()
14 hpfs_bplus_lookup(struct super_block *s, struct inode *inode, struct bplus_header *btree, unsigned sec, struct buffer_head *bh) hpfs_bplus_lookup() argument
63 struct bplus_header *btree; hpfs_add_sector_to_btree() local
274 hpfs_remove_btree(struct super_block *s, struct bplus_header *btree) hpfs_remove_btree() argument
404 struct bplus_header *btree; hpfs_truncate_btree() local
[all...]
H A Dmap.c180 if ((unsigned)fnode->btree.n_used_nodes + (unsigned)fnode->btree.n_free_nodes != in hpfs_map_fnode()
181 (bp_internal(&fnode->btree) ? 12 : 8)) { in hpfs_map_fnode()
187 if (le16_to_cpu(fnode->btree.first_free) != in hpfs_map_fnode()
188 8 + fnode->btree.n_used_nodes * (bp_internal(&fnode->btree) ? 8 : 12)) { in hpfs_map_fnode()
235 if ((unsigned)anode->btree.n_used_nodes + (unsigned)anode->btree.n_free_nodes != in hpfs_map_anode()
236 (bp_internal(&anode->btree) ? 60 : 40)) { in hpfs_map_anode()
240 if (le16_to_cpu(anode->btree in hpfs_map_anode()
[all...]
/kernel/linux/linux-6.6/fs/hpfs/
H A Danode.c15 struct bplus_header *btree, unsigned sec, in hpfs_bplus_lookup()
24 if (bp_internal(btree)) { in hpfs_bplus_lookup()
25 for (i = 0; i < btree->n_used_nodes; i++) in hpfs_bplus_lookup()
26 if (le32_to_cpu(btree->u.internal[i].file_secno) > sec) { in hpfs_bplus_lookup()
27 a = le32_to_cpu(btree->u.internal[i].down); in hpfs_bplus_lookup()
30 btree = &anode->btree; in hpfs_bplus_lookup()
37 for (i = 0; i < btree->n_used_nodes; i++) in hpfs_bplus_lookup()
38 if (le32_to_cpu(btree->u.external[i].file_secno) <= sec && in hpfs_bplus_lookup()
39 le32_to_cpu(btree in hpfs_bplus_lookup()
14 hpfs_bplus_lookup(struct super_block *s, struct inode *inode, struct bplus_header *btree, unsigned sec, struct buffer_head *bh) hpfs_bplus_lookup() argument
63 struct bplus_header *btree; hpfs_add_sector_to_btree() local
274 hpfs_remove_btree(struct super_block *s, struct bplus_header *btree) hpfs_remove_btree() argument
404 struct bplus_header *btree; hpfs_truncate_btree() local
[all...]
H A Dmap.c180 if ((unsigned)fnode->btree.n_used_nodes + (unsigned)fnode->btree.n_free_nodes != in hpfs_map_fnode()
181 (bp_internal(&fnode->btree) ? 12 : 8)) { in hpfs_map_fnode()
187 if (le16_to_cpu(fnode->btree.first_free) != in hpfs_map_fnode()
188 8 + fnode->btree.n_used_nodes * (bp_internal(&fnode->btree) ? 8 : 12)) { in hpfs_map_fnode()
235 if ((unsigned)anode->btree.n_used_nodes + (unsigned)anode->btree.n_free_nodes != in hpfs_map_anode()
236 (bp_internal(&anode->btree) ? 60 : 40)) { in hpfs_map_anode()
240 if (le16_to_cpu(anode->btree in hpfs_map_anode()
[all...]
/kernel/linux/linux-5.10/fs/nilfs2/
H A Dbtree.c3 * btree.c - NILFS B-tree.
17 #include "btree.h"
58 static int nilfs_btree_get_new_block(const struct nilfs_bmap *btree, in nilfs_btree_get_new_block() argument
61 struct inode *btnc_inode = NILFS_BMAP_I(btree)->i_assoc_inode; in nilfs_btree_get_new_block()
112 static int nilfs_btree_node_size(const struct nilfs_bmap *btree) in nilfs_btree_node_size() argument
114 return i_blocksize(btree->b_inode); in nilfs_btree_node_size()
117 static int nilfs_btree_nchildren_per_block(const struct nilfs_bmap *btree) in nilfs_btree_nchildren_per_block() argument
119 return btree->b_nchildren_per_block; in nilfs_btree_nchildren_per_block()
331 * nilfs_btree_node_broken - verify consistency of btree node
332 * @node: btree nod
410 nilfs_btree_get_root(const struct nilfs_bmap *btree) nilfs_btree_get_root() argument
427 nilfs_btree_height(const struct nilfs_bmap *btree) nilfs_btree_height() argument
433 nilfs_btree_get_node(const struct nilfs_bmap *btree, const struct nilfs_btree_path *path, int level, int *ncmaxp) nilfs_btree_get_node() argument
449 nilfs_btree_bad_node(const struct nilfs_bmap *btree, struct nilfs_btree_node *node, int level) nilfs_btree_bad_node() argument
470 __nilfs_btree_get_block(const struct nilfs_bmap *btree, __u64 ptr, struct buffer_head **bhp, const struct nilfs_btree_readahead_info *ra) __nilfs_btree_get_block() argument
540 nilfs_btree_get_block(const struct nilfs_bmap *btree, __u64 ptr, struct buffer_head **bhp) nilfs_btree_get_block() argument
546 nilfs_btree_do_lookup(const struct nilfs_bmap *btree, struct nilfs_btree_path *path, __u64 key, __u64 *ptrp, int minlevel, int readahead) nilfs_btree_do_lookup() argument
608 nilfs_btree_do_lookup_last(const struct nilfs_bmap *btree, struct nilfs_btree_path *path, __u64 *keyp, __u64 *ptrp) nilfs_btree_do_lookup_last() argument
657 nilfs_btree_get_next_key(const struct nilfs_bmap *btree, const struct nilfs_btree_path *path, int minlevel, __u64 *nextkey) nilfs_btree_get_next_key() argument
685 nilfs_btree_lookup(const struct nilfs_bmap *btree, __u64 key, int level, __u64 *ptrp) nilfs_btree_lookup() argument
702 nilfs_btree_lookup_contig(const struct nilfs_bmap *btree, __u64 key, __u64 *ptrp, unsigned int maxblocks) nilfs_btree_lookup_contig() argument
787 nilfs_btree_promote_key(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 key) nilfs_btree_promote_key() argument
809 nilfs_btree_do_insert(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_do_insert() argument
836 nilfs_btree_carry_left(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_carry_left() argument
882 nilfs_btree_carry_right(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_carry_right() argument
929 nilfs_btree_split(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_split() argument
979 nilfs_btree_grow(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_grow() argument
1008 nilfs_btree_find_near(const struct nilfs_bmap *btree, const struct nilfs_btree_path *path) nilfs_btree_find_near() argument
1037 nilfs_btree_find_target_v(const struct nilfs_bmap *btree, const struct nilfs_btree_path *path, __u64 key) nilfs_btree_find_target_v() argument
1057 nilfs_btree_prepare_insert(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int *levelp, __u64 key, __u64 ptr, struct nilfs_bmap_stats *stats) nilfs_btree_prepare_insert() argument
1206 nilfs_btree_commit_insert(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int maxlevel, __u64 key, __u64 ptr) nilfs_btree_commit_insert() argument
1230 nilfs_btree_insert(struct nilfs_bmap *btree, __u64 key, __u64 ptr) nilfs_btree_insert() argument
1259 nilfs_btree_do_delete(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_do_delete() argument
1284 nilfs_btree_borrow_left(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_borrow_left() argument
1316 nilfs_btree_borrow_right(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_borrow_right() argument
1349 nilfs_btree_concat_left(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_concat_left() argument
1375 nilfs_btree_concat_right(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_concat_right() argument
1400 nilfs_btree_shrink(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_shrink() argument
1424 nilfs_btree_nop(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_nop() argument
1430 nilfs_btree_prepare_delete(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int *levelp, struct nilfs_bmap_stats *stats, struct inode *dat) nilfs_btree_prepare_delete() argument
1565 nilfs_btree_commit_delete(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int maxlevel, struct inode *dat) nilfs_btree_commit_delete() argument
1580 nilfs_btree_delete(struct nilfs_bmap *btree, __u64 key) nilfs_btree_delete() argument
1611 nilfs_btree_seek_key(const struct nilfs_bmap *btree, __u64 start, __u64 *keyp) nilfs_btree_seek_key() argument
1632 nilfs_btree_last_key(const struct nilfs_bmap *btree, __u64 *keyp) nilfs_btree_last_key() argument
1648 nilfs_btree_check_delete(struct nilfs_bmap *btree, __u64 key) nilfs_btree_check_delete() argument
1687 nilfs_btree_gather_data(struct nilfs_bmap *btree, __u64 *keys, __u64 *ptrs, int nitems) nilfs_btree_gather_data() argument
1737 nilfs_btree_prepare_convert_and_insert(struct nilfs_bmap *btree, __u64 key, union nilfs_bmap_ptr_req *dreq, union nilfs_bmap_ptr_req *nreq, struct buffer_head **bhp, struct nilfs_bmap_stats *stats) nilfs_btree_prepare_convert_and_insert() argument
1794 nilfs_btree_commit_convert_and_insert(struct nilfs_bmap *btree, __u64 key, __u64 ptr, const __u64 *keys, const __u64 *ptrs, int n, union nilfs_bmap_ptr_req *dreq, union nilfs_bmap_ptr_req *nreq, struct buffer_head *bh) nilfs_btree_commit_convert_and_insert() argument
1866 nilfs_btree_convert_and_insert(struct nilfs_bmap *btree, __u64 key, __u64 ptr, const __u64 *keys, const __u64 *ptrs, int n) nilfs_btree_convert_and_insert() argument
1898 nilfs_btree_propagate_p(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, struct buffer_head *bh) nilfs_btree_propagate_p() argument
1910 nilfs_btree_prepare_update_v(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, struct inode *dat) nilfs_btree_prepare_update_v() argument
1945 nilfs_btree_commit_update_v(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, struct inode *dat) nilfs_btree_commit_update_v() argument
1969 nilfs_btree_abort_update_v(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, struct inode *dat) nilfs_btree_abort_update_v() argument
1981 nilfs_btree_prepare_propagate_v(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int minlevel, int *maxlevelp, struct inode *dat) nilfs_btree_prepare_propagate_v() argument
2016 nilfs_btree_commit_propagate_v(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int minlevel, int maxlevel, struct buffer_head *bh, struct inode *dat) nilfs_btree_commit_propagate_v() argument
2031 nilfs_btree_propagate_v(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, struct buffer_head *bh) nilfs_btree_propagate_v() argument
2066 nilfs_btree_propagate(struct nilfs_bmap *btree, struct buffer_head *bh) nilfs_btree_propagate() argument
2109 nilfs_btree_propagate_gc(struct nilfs_bmap *btree, struct buffer_head *bh) nilfs_btree_propagate_gc() argument
2115 nilfs_btree_add_dirty_buffer(struct nilfs_bmap *btree, struct list_head *lists, struct buffer_head *bh) nilfs_btree_add_dirty_buffer() argument
2150 nilfs_btree_lookup_dirty_buffers(struct nilfs_bmap *btree, struct list_head *listp) nilfs_btree_lookup_dirty_buffers() argument
2188 nilfs_btree_assign_p(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, struct buffer_head **bh, sector_t blocknr, union nilfs_binfo *binfo) nilfs_btree_assign_p() argument
2229 nilfs_btree_assign_v(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, struct buffer_head **bh, sector_t blocknr, union nilfs_binfo *binfo) nilfs_btree_assign_v() argument
2260 nilfs_btree_assign(struct nilfs_bmap *btree, struct buffer_head **bh, sector_t blocknr, union nilfs_binfo *binfo) nilfs_btree_assign() argument
2299 nilfs_btree_assign_gc(struct nilfs_bmap *btree, struct buffer_head **bh, sector_t blocknr, union nilfs_binfo *binfo) nilfs_btree_assign_gc() argument
2326 nilfs_btree_mark(struct nilfs_bmap *btree, __u64 key, int level) nilfs_btree_mark() argument
[all...]
/kernel/linux/linux-6.6/fs/nilfs2/
H A Dbtree.c17 #include "btree.h"
58 static int nilfs_btree_get_new_block(const struct nilfs_bmap *btree, in nilfs_btree_get_new_block() argument
61 struct inode *btnc_inode = NILFS_BMAP_I(btree)->i_assoc_inode; in nilfs_btree_get_new_block()
112 static int nilfs_btree_node_size(const struct nilfs_bmap *btree) in nilfs_btree_node_size() argument
114 return i_blocksize(btree->b_inode); in nilfs_btree_node_size()
117 static int nilfs_btree_nchildren_per_block(const struct nilfs_bmap *btree) in nilfs_btree_nchildren_per_block() argument
119 return btree->b_nchildren_per_block; in nilfs_btree_nchildren_per_block()
331 * nilfs_btree_node_broken - verify consistency of btree node
332 * @node: btree node block to be examined
334 * @inode: host inode of btree
410 nilfs_btree_get_root(const struct nilfs_bmap *btree) nilfs_btree_get_root() argument
427 nilfs_btree_height(const struct nilfs_bmap *btree) nilfs_btree_height() argument
433 nilfs_btree_get_node(const struct nilfs_bmap *btree, const struct nilfs_btree_path *path, int level, int *ncmaxp) nilfs_btree_get_node() argument
449 nilfs_btree_bad_node(const struct nilfs_bmap *btree, struct nilfs_btree_node *node, int level) nilfs_btree_bad_node() argument
470 __nilfs_btree_get_block(const struct nilfs_bmap *btree, __u64 ptr, struct buffer_head **bhp, const struct nilfs_btree_readahead_info *ra) __nilfs_btree_get_block() argument
540 nilfs_btree_get_block(const struct nilfs_bmap *btree, __u64 ptr, struct buffer_head **bhp) nilfs_btree_get_block() argument
546 nilfs_btree_do_lookup(const struct nilfs_bmap *btree, struct nilfs_btree_path *path, __u64 key, __u64 *ptrp, int minlevel, int readahead) nilfs_btree_do_lookup() argument
608 nilfs_btree_do_lookup_last(const struct nilfs_bmap *btree, struct nilfs_btree_path *path, __u64 *keyp, __u64 *ptrp) nilfs_btree_do_lookup_last() argument
657 nilfs_btree_get_next_key(const struct nilfs_bmap *btree, const struct nilfs_btree_path *path, int minlevel, __u64 *nextkey) nilfs_btree_get_next_key() argument
685 nilfs_btree_lookup(const struct nilfs_bmap *btree, __u64 key, int level, __u64 *ptrp) nilfs_btree_lookup() argument
702 nilfs_btree_lookup_contig(const struct nilfs_bmap *btree, __u64 key, __u64 *ptrp, unsigned int maxblocks) nilfs_btree_lookup_contig() argument
786 nilfs_btree_promote_key(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 key) nilfs_btree_promote_key() argument
808 nilfs_btree_do_insert(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_do_insert() argument
835 nilfs_btree_carry_left(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_carry_left() argument
881 nilfs_btree_carry_right(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_carry_right() argument
928 nilfs_btree_split(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_split() argument
978 nilfs_btree_grow(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_grow() argument
1007 nilfs_btree_find_near(const struct nilfs_bmap *btree, const struct nilfs_btree_path *path) nilfs_btree_find_near() argument
1036 nilfs_btree_find_target_v(const struct nilfs_bmap *btree, const struct nilfs_btree_path *path, __u64 key) nilfs_btree_find_target_v() argument
1056 nilfs_btree_prepare_insert(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int *levelp, __u64 key, __u64 ptr, struct nilfs_bmap_stats *stats) nilfs_btree_prepare_insert() argument
1205 nilfs_btree_commit_insert(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int maxlevel, __u64 key, __u64 ptr) nilfs_btree_commit_insert() argument
1229 nilfs_btree_insert(struct nilfs_bmap *btree, __u64 key, __u64 ptr) nilfs_btree_insert() argument
1258 nilfs_btree_do_delete(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_do_delete() argument
1283 nilfs_btree_borrow_left(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_borrow_left() argument
1315 nilfs_btree_borrow_right(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_borrow_right() argument
1348 nilfs_btree_concat_left(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_concat_left() argument
1374 nilfs_btree_concat_right(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_concat_right() argument
1399 nilfs_btree_shrink(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_shrink() argument
1423 nilfs_btree_nop(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_nop() argument
1429 nilfs_btree_prepare_delete(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int *levelp, struct nilfs_bmap_stats *stats, struct inode *dat) nilfs_btree_prepare_delete() argument
1564 nilfs_btree_commit_delete(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int maxlevel, struct inode *dat) nilfs_btree_commit_delete() argument
1579 nilfs_btree_delete(struct nilfs_bmap *btree, __u64 key) nilfs_btree_delete() argument
1610 nilfs_btree_seek_key(const struct nilfs_bmap *btree, __u64 start, __u64 *keyp) nilfs_btree_seek_key() argument
1631 nilfs_btree_last_key(const struct nilfs_bmap *btree, __u64 *keyp) nilfs_btree_last_key() argument
1647 nilfs_btree_check_delete(struct nilfs_bmap *btree, __u64 key) nilfs_btree_check_delete() argument
1685 nilfs_btree_gather_data(struct nilfs_bmap *btree, __u64 *keys, __u64 *ptrs, int nitems) nilfs_btree_gather_data() argument
1734 nilfs_btree_prepare_convert_and_insert(struct nilfs_bmap *btree, __u64 key, union nilfs_bmap_ptr_req *dreq, union nilfs_bmap_ptr_req *nreq, struct buffer_head **bhp, struct nilfs_bmap_stats *stats) nilfs_btree_prepare_convert_and_insert() argument
1791 nilfs_btree_commit_convert_and_insert(struct nilfs_bmap *btree, __u64 key, __u64 ptr, const __u64 *keys, const __u64 *ptrs, int n, union nilfs_bmap_ptr_req *dreq, union nilfs_bmap_ptr_req *nreq, struct buffer_head *bh) nilfs_btree_commit_convert_and_insert() argument
1863 nilfs_btree_convert_and_insert(struct nilfs_bmap *btree, __u64 key, __u64 ptr, const __u64 *keys, const __u64 *ptrs, int n) nilfs_btree_convert_and_insert() argument
1895 nilfs_btree_propagate_p(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, struct buffer_head *bh) nilfs_btree_propagate_p() argument
1907 nilfs_btree_prepare_update_v(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, struct inode *dat) nilfs_btree_prepare_update_v() argument
1942 nilfs_btree_commit_update_v(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, struct inode *dat) nilfs_btree_commit_update_v() argument
1966 nilfs_btree_abort_update_v(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, struct inode *dat) nilfs_btree_abort_update_v() argument
1978 nilfs_btree_prepare_propagate_v(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int minlevel, int *maxlevelp, struct inode *dat) nilfs_btree_prepare_propagate_v() argument
2013 nilfs_btree_commit_propagate_v(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int minlevel, int maxlevel, struct buffer_head *bh, struct inode *dat) nilfs_btree_commit_propagate_v() argument
2028 nilfs_btree_propagate_v(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, struct buffer_head *bh) nilfs_btree_propagate_v() argument
2063 nilfs_btree_propagate(struct nilfs_bmap *btree, struct buffer_head *bh) nilfs_btree_propagate() argument
2106 nilfs_btree_propagate_gc(struct nilfs_bmap *btree, struct buffer_head *bh) nilfs_btree_propagate_gc() argument
2112 nilfs_btree_add_dirty_buffer(struct nilfs_bmap *btree, struct list_head *lists, struct buffer_head *bh) nilfs_btree_add_dirty_buffer() argument
2147 nilfs_btree_lookup_dirty_buffers(struct nilfs_bmap *btree, struct list_head *listp) nilfs_btree_lookup_dirty_buffers() argument
2185 nilfs_btree_assign_p(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, struct buffer_head **bh, sector_t blocknr, union nilfs_binfo *binfo) nilfs_btree_assign_p() argument
2227 nilfs_btree_assign_v(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, struct buffer_head **bh, sector_t blocknr, union nilfs_binfo *binfo) nilfs_btree_assign_v() argument
2258 nilfs_btree_assign(struct nilfs_bmap *btree, struct buffer_head **bh, sector_t blocknr, union nilfs_binfo *binfo) nilfs_btree_assign() argument
2297 nilfs_btree_assign_gc(struct nilfs_bmap *btree, struct buffer_head **bh, sector_t blocknr, union nilfs_binfo *binfo) nilfs_btree_assign_gc() argument
2324 nilfs_btree_mark(struct nilfs_bmap *btree, __u64 key, int level) nilfs_btree_mark() argument
[all...]
/kernel/linux/linux-5.10/drivers/md/bcache/
H A Dbtree.h8 * At a high level, bcache's btree is relatively standard b+ tree. All keys and
12 * In the interior nodes, a struct bkey always points to a child btree node, and
15 * of the child node - this would allow us to have variable sized btree nodes
16 * (handy for keeping the depth of the btree 1 by expanding just the root).
21 * overlapping extents - when we read in a btree node from disk, the first thing
25 * struct btree_op is a central interface to the btree code. It's used for
31 * Btree nodes are cached in memory; traversing the btree might require reading
32 * in btree nodes which is handled mostly transparently.
34 * bch_btree_node_get() looks up a btree node in the cache and reads it in from
36 * btree() macr
117 struct btree { global() struct
[all...]
H A Dbtree.c17 * Indexing is done via a btree; nodes are not necessarily fully sorted, rather
25 #include "btree.h"
49 * On btree write error, mark bucket such that it won't be freed from the cache
70 * When btree depth > 1 and splitting an interior node, we have to make sure
107 static inline struct bset *write_block(struct btree *b) in write_block()
112 static void bch_btree_init_next(struct btree *b) in bch_btree_init_next()
139 static uint64_t btree_csum_set(struct btree *b, struct bset *i) in btree_csum_set()
148 void bch_btree_node_read_done(struct btree *b) in bch_btree_node_read_done()
150 const char *err = "bad btree header"; in bch_btree_node_read_done()
177 err = "bad btree heade in bch_btree_node_read_done()
[all...]
H A Dextents.c17 * Indexing is done via a btree; nodes are not necessarily fully sorted, rather
25 #include "btree.h"
66 /* Common among btree and extent ptrs */
128 struct btree *b = container_of(keys, struct btree, keys); in bch_bkey_dump()
162 cache_bug(c, "spotted btree ptr %s: %s", buf, bch_ptr_status(c, k)); in __bch_btree_ptr_invalid()
168 struct btree *b = container_of(bk, struct btree, keys); in bch_btree_ptr_invalid()
173 static bool btree_ptr_bad_expensive(struct btree *b, const struct bkey *k) in btree_ptr_bad_expensive()
199 "inconsistent btree pointe in btree_ptr_bad_expensive()
[all...]
H A Ddebug.h11 void bch_btree_verify(struct btree *b);
20 static inline void bch_btree_verify(struct btree *b) {} in bch_btree_verify()
/kernel/linux/linux-6.6/drivers/md/bcache/
H A Dbtree.h8 * At a high level, bcache's btree is relatively standard b+ tree. All keys and
12 * In the interior nodes, a struct bkey always points to a child btree node, and
15 * of the child node - this would allow us to have variable sized btree nodes
16 * (handy for keeping the depth of the btree 1 by expanding just the root).
21 * overlapping extents - when we read in a btree node from disk, the first thing
25 * struct btree_op is a central interface to the btree code. It's used for
31 * Btree nodes are cached in memory; traversing the btree might require reading
32 * in btree nodes which is handled mostly transparently.
34 * bch_btree_node_get() looks up a btree node in the cache and reads it in from
36 * btree() macr
117 struct btree { global() struct
[all...]
H A Dbtree.c17 * Indexing is done via a btree; nodes are not necessarily fully sorted, rather
25 #include "btree.h"
49 * On btree write error, mark bucket such that it won't be freed from the cache
70 * When btree depth > 1 and splitting an interior node, we have to make sure
107 static inline struct bset *write_block(struct btree *b) in write_block()
112 static void bch_btree_init_next(struct btree *b) in bch_btree_init_next()
139 static uint64_t btree_csum_set(struct btree *b, struct bset *i) in btree_csum_set()
148 void bch_btree_node_read_done(struct btree *b) in bch_btree_node_read_done()
150 const char *err = "bad btree header"; in bch_btree_node_read_done()
177 err = "bad btree heade in bch_btree_node_read_done()
[all...]
H A Dextents.c17 * Indexing is done via a btree; nodes are not necessarily fully sorted, rather
25 #include "btree.h"
66 /* Common among btree and extent ptrs */
128 struct btree *b = container_of(keys, struct btree, keys); in bch_bkey_dump()
162 cache_bug(c, "spotted btree ptr %s: %s", buf, bch_ptr_status(c, k)); in __bch_btree_ptr_invalid()
168 struct btree *b = container_of(bk, struct btree, keys); in bch_btree_ptr_invalid()
173 static bool btree_ptr_bad_expensive(struct btree *b, const struct bkey *k) in btree_ptr_bad_expensive()
199 "inconsistent btree pointe in btree_ptr_bad_expensive()
[all...]
H A Ddebug.h11 void bch_btree_verify(struct btree *b);
20 static inline void bch_btree_verify(struct btree *b) {} in bch_btree_verify()
/kernel/linux/linux-5.10/fs/xfs/libxfs/
H A Dxfs_da_btree.c140 to->btree = from3->__btree; in xfs_da3_node_hdr_from_disk()
148 to->btree = from->__btree; in xfs_da3_node_hdr_from_disk()
561 * Update the btree to show the new hashval for this child. in xfs_da3_split()
640 struct xfs_da_node_entry *btree; in xfs_da3_root_split() local
675 btree = icnodehdr.btree; in xfs_da3_root_split()
676 size = (int)((char *)&btree[icnodehdr.count] - (char *)oldroot); in xfs_da3_root_split()
734 btree = nodehdr.btree; in xfs_da3_root_split()
735 btree[ in xfs_da3_root_split()
1011 struct xfs_da_node_entry *btree; xfs_da3_node_add() local
1388 struct xfs_da_node_entry *btree; xfs_da3_fixhashpath() local
1443 struct xfs_da_node_entry *btree; xfs_da3_node_remove() local
1578 struct xfs_da_node_entry *btree; xfs_da3_node_lookup_int() local
1975 struct xfs_da_node_entry *btree; xfs_da3_path_shift() local
2262 struct xfs_da_node_entry *btree; xfs_da3_swap_lastblock() local
[all...]
/kernel/linux/linux-6.6/fs/xfs/libxfs/
H A Dxfs_da_btree.c152 to->btree = from3->__btree; in xfs_da3_node_hdr_from_disk()
160 to->btree = from->__btree; in xfs_da3_node_hdr_from_disk()
576 * Update the btree to show the new hashval for this child. in xfs_da3_split()
655 struct xfs_da_node_entry *btree; in xfs_da3_root_split() local
690 btree = icnodehdr.btree; in xfs_da3_root_split()
691 size = (int)((char *)&btree[icnodehdr.count] - (char *)oldroot); in xfs_da3_root_split()
749 btree = nodehdr.btree; in xfs_da3_root_split()
750 btree[ in xfs_da3_root_split()
1023 struct xfs_da_node_entry *btree; xfs_da3_node_add() local
1400 struct xfs_da_node_entry *btree; xfs_da3_fixhashpath() local
1455 struct xfs_da_node_entry *btree; xfs_da3_node_remove() local
1590 struct xfs_da_node_entry *btree; xfs_da3_node_lookup_int() local
1987 struct xfs_da_node_entry *btree; xfs_da3_path_shift() local
2274 struct xfs_da_node_entry *btree; xfs_da3_swap_lastblock() local
[all...]
/kernel/linux/linux-5.10/drivers/md/persistent-data/
H A DMakefile11 dm-btree.o \
12 dm-btree-remove.o \
13 dm-btree-spine.o
/kernel/linux/linux-6.6/drivers/md/persistent-data/
H A DMakefile11 dm-btree.o \
12 dm-btree-remove.o \
13 dm-btree-spine.o
/kernel/linux/linux-6.6/include/trace/events/
H A Dbcache.h64 TP_PROTO(struct btree *b),
258 TP_PROTO(struct btree *b),
263 TP_PROTO(struct btree *b),
283 TP_PROTO(struct btree *b),
293 TP_PROTO(struct btree *b),
333 TP_PROTO(struct btree *b, struct bkey *k, unsigned op, unsigned status),
366 TP_PROTO(struct btree *b, unsigned keys),
383 TP_PROTO(struct btree *b, unsigned keys),
388 TP_PROTO(struct btree *b, unsigned keys),
393 TP_PROTO(struct btree *
[all...]
/kernel/linux/linux-5.10/include/linux/
H A Dbtree.h29 * struct btree_head - btree head
41 /* btree geometry */
59 * btree_init_mempool - initialise a btree with given mempool
61 * @head: the btree head to initialise
70 * btree_init - initialise a btree
72 * @head: the btree head to initialise
75 * btree needs. Returns zero or a negative error code
84 * @head: the btree head to destroy
92 * btree_lookup - look up a key in the btree
94 * @head: the btree t
[all...]
/kernel/linux/linux-6.6/include/linux/
H A Dbtree.h29 * struct btree_head - btree head
41 /* btree geometry */
59 * btree_init_mempool - initialise a btree with given mempool
61 * @head: the btree head to initialise
70 * btree_init - initialise a btree
72 * @head: the btree head to initialise
75 * btree needs. Returns zero or a negative error code
84 * @head: the btree head to destroy
92 * btree_lookup - look up a key in the btree
94 * @head: the btree t
[all...]
/kernel/linux/linux-5.10/include/trace/events/
H A Dbcache.h64 TP_PROTO(struct btree *b),
258 TP_PROTO(struct btree *b),
263 TP_PROTO(struct btree *b),
283 TP_PROTO(struct btree *b),
293 TP_PROTO(struct btree *b),
333 TP_PROTO(struct btree *b, struct bkey *k, unsigned op, unsigned status),
366 TP_PROTO(struct btree *b, unsigned keys),
383 TP_PROTO(struct btree *b, unsigned keys),
388 TP_PROTO(struct btree *b, unsigned keys),
393 TP_PROTO(struct btree *
[all...]
/kernel/linux/linux-6.6/rust/alloc/collections/
H A Dmod.rs10 mod btree; modules
21 pub use super::btree::map::*;
29 pub use super::btree::set::*;
/kernel/linux/linux-5.10/fs/xfs/
H A Dxfs_attr_list.c198 * walk down the attr btree looking for the hash.
208 struct xfs_da_node_entry *btree; in xfs_attr_node_list_lookup() local
251 btree = nodehdr.btree; in xfs_attr_node_list_lookup()
252 for (i = 0; i < nodehdr.count; btree++, i++) { in xfs_attr_node_list_lookup()
253 if (cursor->hashval <= be32_to_cpu(btree->hashval)) { in xfs_attr_node_list_lookup()
254 cursor->blkno = be32_to_cpu(btree->before); in xfs_attr_node_list_lookup()
256 btree); in xfs_attr_node_list_lookup()
302 * starting from the btree root. in xfs_attr_node_list()
/kernel/linux/linux-6.6/fs/xfs/
H A Dxfs_attr_list.c198 * walk down the attr btree looking for the hash.
208 struct xfs_da_node_entry *btree; in xfs_attr_node_list_lookup() local
251 btree = nodehdr.btree; in xfs_attr_node_list_lookup()
252 for (i = 0; i < nodehdr.count; btree++, i++) { in xfs_attr_node_list_lookup()
253 if (cursor->hashval <= be32_to_cpu(btree->hashval)) { in xfs_attr_node_list_lookup()
254 cursor->blkno = be32_to_cpu(btree->before); in xfs_attr_node_list_lookup()
256 btree); in xfs_attr_node_list_lookup()
302 * starting from the btree root. in xfs_attr_node_list()

Completed in 19 milliseconds

1234