Home
last modified time | relevance | path

Searched defs:btree (Results 1 – 25 of 34) sorted by relevance

12

/linux/drivers/md/bcache/
H A Dbtree.h117 struct btree { struct
121 /* Key/pointer for this btree node */ argument
127 struct btree *parent; argument
135 struct btree_keys keys; argument
137 /* For outstanding btree writes, used as a lock - protects write_idx */ argument
144 struct btree_write writes[2]; argument
152 static inline bool btree_node_ ## flag(struct btree *b) \ argument
/linux/fs/nilfs2/
H A Dbtree.c58 static int nilfs_btree_get_new_block(const struct nilfs_bmap *btree, in nilfs_btree_get_new_block() argument
112 static int nilfs_btree_node_size(const struct nilfs_bmap *btree) in nilfs_btree_node_size() argument
117 static int nilfs_btree_nchildren_per_block(const struct nilfs_bmap *btree) in nilfs_btree_nchildren_per_block() argument
411 nilfs_btree_get_root(const struct nilfs_bmap * btree) nilfs_btree_get_root() argument
428 nilfs_btree_height(const struct nilfs_bmap * btree) nilfs_btree_height() argument
434 nilfs_btree_get_node(const struct nilfs_bmap * btree,const struct nilfs_btree_path * path,int level,int * ncmaxp) nilfs_btree_get_node() argument
450 nilfs_btree_bad_node(const struct nilfs_bmap * btree,struct nilfs_btree_node * node,int level) nilfs_btree_bad_node() argument
471 __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
541 nilfs_btree_get_block(const struct nilfs_bmap * btree,__u64 ptr,struct buffer_head ** bhp) nilfs_btree_get_block() argument
547 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
609 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
658 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
686 nilfs_btree_lookup(const struct nilfs_bmap * btree,__u64 key,int level,__u64 * ptrp) nilfs_btree_lookup() argument
703 nilfs_btree_lookup_contig(const struct nilfs_bmap * btree,__u64 key,__u64 * ptrp,unsigned int maxblocks) nilfs_btree_lookup_contig() argument
792 nilfs_btree_promote_key(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,__u64 key) nilfs_btree_promote_key() argument
814 nilfs_btree_do_insert(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,__u64 * keyp,__u64 * ptrp) nilfs_btree_do_insert() argument
841 nilfs_btree_carry_left(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,__u64 * keyp,__u64 * ptrp) nilfs_btree_carry_left() argument
887 nilfs_btree_carry_right(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,__u64 * keyp,__u64 * ptrp) nilfs_btree_carry_right() argument
934 nilfs_btree_split(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,__u64 * keyp,__u64 * ptrp) nilfs_btree_split() argument
984 nilfs_btree_grow(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,__u64 * keyp,__u64 * ptrp) nilfs_btree_grow() argument
1013 nilfs_btree_find_near(const struct nilfs_bmap * btree,const struct nilfs_btree_path * path) nilfs_btree_find_near() argument
1042 nilfs_btree_find_target_v(const struct nilfs_bmap * btree,const struct nilfs_btree_path * path,__u64 key) nilfs_btree_find_target_v() argument
1062 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
1211 nilfs_btree_commit_insert(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int maxlevel,__u64 key,__u64 ptr) nilfs_btree_commit_insert() argument
1235 nilfs_btree_insert(struct nilfs_bmap * btree,__u64 key,__u64 ptr) nilfs_btree_insert() argument
1264 nilfs_btree_do_delete(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,__u64 * keyp,__u64 * ptrp) nilfs_btree_do_delete() argument
1289 nilfs_btree_borrow_left(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,__u64 * keyp,__u64 * ptrp) nilfs_btree_borrow_left() argument
1321 nilfs_btree_borrow_right(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,__u64 * keyp,__u64 * ptrp) nilfs_btree_borrow_right() argument
1354 nilfs_btree_concat_left(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,__u64 * keyp,__u64 * ptrp) nilfs_btree_concat_left() argument
1380 nilfs_btree_concat_right(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,__u64 * keyp,__u64 * ptrp) nilfs_btree_concat_right() argument
1405 nilfs_btree_shrink(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,__u64 * keyp,__u64 * ptrp) nilfs_btree_shrink() argument
1429 nilfs_btree_nop(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,__u64 * keyp,__u64 * ptrp) nilfs_btree_nop() argument
1435 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
1570 nilfs_btree_commit_delete(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int maxlevel,struct inode * dat) nilfs_btree_commit_delete() argument
1585 nilfs_btree_delete(struct nilfs_bmap * btree,__u64 key) nilfs_btree_delete() argument
1616 nilfs_btree_seek_key(const struct nilfs_bmap * btree,__u64 start,__u64 * keyp) nilfs_btree_seek_key() argument
1637 nilfs_btree_last_key(const struct nilfs_bmap * btree,__u64 * keyp) nilfs_btree_last_key() argument
1653 nilfs_btree_check_delete(struct nilfs_bmap * btree,__u64 key) nilfs_btree_check_delete() argument
1694 nilfs_btree_gather_data(struct nilfs_bmap * btree,__u64 * keys,__u64 * ptrs,int nitems) nilfs_btree_gather_data() argument
1743 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
1800 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
1881 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
1913 nilfs_btree_propagate_p(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,struct buffer_head * bh) nilfs_btree_propagate_p() argument
1925 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
1960 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
1984 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
1996 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
2031 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
2046 nilfs_btree_propagate_v(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,struct buffer_head * bh) nilfs_btree_propagate_v() argument
2081 nilfs_btree_propagate(struct nilfs_bmap * btree,struct buffer_head * bh) nilfs_btree_propagate() argument
2124 nilfs_btree_propagate_gc(struct nilfs_bmap * btree,struct buffer_head * bh) nilfs_btree_propagate_gc() argument
2130 nilfs_btree_add_dirty_buffer(struct nilfs_bmap * btree,struct list_head * lists,struct buffer_head * bh) nilfs_btree_add_dirty_buffer() argument
2165 nilfs_btree_lookup_dirty_buffers(struct nilfs_bmap * btree,struct list_head * listp) nilfs_btree_lookup_dirty_buffers() argument
2203 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
2245 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
2276 nilfs_btree_assign(struct nilfs_bmap * btree,struct buffer_head ** bh,sector_t blocknr,union nilfs_binfo * binfo) nilfs_btree_assign() argument
2315 nilfs_btree_assign_gc(struct nilfs_bmap * btree,struct buffer_head ** bh,sector_t blocknr,union nilfs_binfo * binfo) nilfs_btree_assign_gc() argument
2342 nilfs_btree_mark(struct nilfs_bmap * btree,__u64 key,int level) nilfs_btree_mark() argument
[all...]
/linux/fs/bcachefs/
H A Dbtree_types.h72 struct btree { struct
73 struct btree_bkey_cached_common c; argument
86 struct btree_node *data; argument
90 * Sets of sorted keys - the real btree node - plus a binary search tree argument
98 struct btree_nr_keys nr; argument
104 struct btree_write writes[2]; argument
106 /* Key/pointer for this btree node */ argument
129 * If a btree node isn't reachable yet, we don't want to kick off argument
152 enum bch_btree_cache_not_freed_reasons { argument
796 static inline bool btree_id_is_extents(enum btree_id btree) in btree_id_is_extents()
[all …]
H A Dbtree_write_buffer.h49 enum btree_id btree, struct bkey_i_accounting *k) in bch2_accounting_key_to_wb()
74 enum btree_id btree, struct bkey_i *k) in __bch2_journal_key_to_wb()
90 enum btree_id btree, struct bkey_i *k) in bch2_journal_key_to_wb()
H A Dbbpos_types.h6 enum btree_id btree; member
10 static inline struct bbpos BBPOS(enum btree_id btree, struct bpos pos) in BBPOS()
H A Dbtree_gc.h39 static inline struct gc_pos gc_pos_btree(enum btree_id btree, unsigned level, in gc_pos_btree()
50 static inline int gc_btree_order(enum btree_id btree) in gc_btree_order()
H A Dbtree_update.c550 enum btree_id btree, in bch2_btree_insert_clone_trans()
589 enum btree_id btree, struct bpos end) in bch2_bkey_get_empty_slot()
624 enum btree_id btree, struct bkey_i *k, in bch2_btree_insert_nonextent()
686 enum btree_id btree, struct bpos pos, in bch2_btree_delete()
802 int bch2_btree_bit_mod(struct btree_trans *trans, enum btree_id btree, in bch2_btree_bit_mod()
814 int bch2_btree_bit_mod_buffered(struct btree_trans *trans, enum btree_id btree, in bch2_btree_bit_mod_buffered()
H A Dbtree_write_buffer_types.h17 enum btree_id btree:8; member
39 enum btree_id btree:8; member
H A Dbackpointers.c383 static int drop_dev_and_update(struct btree_trans *trans, enum btree_id btree, in drop_dev_and_update()
396 enum btree_id btree, struct bkey_s_c extent, in check_extent_checksum()
584 enum btree_id btree, unsigned level, in check_extent_to_backpointers()
692 for (enum btree_id btree = start.btree; in bch2_get_btree_in_memory_pos() local
972 enum btree_id btree, unsigned level) in btree_node_get_and_pin()
H A Dbtree_cache.c316 enum btree_id btree, unsigned level, in bch2_btree_node_update_key_early()
1389 const char *bch2_btree_id_str(enum btree_id btree) in bch2_btree_id_str()
1394 void bch2_btree_id_to_text(struct printbuf *out, enum btree_id btree) in bch2_btree_id_to_text()
1402 void bch2_btree_id_level_to_text(struct printbuf *out, enum btree_id btree, unsigned level) in bch2_btree_id_level_to_text()
1410 enum btree_id btree, unsigned level, struct bkey_s_c k) in __bch2_btree_pos_to_text()
H A Dbtree_update.h71 enum btree_id btree, struct bpos pos) in bch2_btree_delete_at_buffered()
87 enum btree_id btree, in bch2_insert_snapshot_whiteouts()
130 enum btree_id btree, in bch2_trans_update_buffered()
H A Dbtree_gc_types.h21 enum btree_id btree:8; member
H A Dbtree_journal_iter.c354 bool bch2_key_deleted_in_journal(struct btree_trans *trans, enum btree_id btree, in bch2_key_deleted_in_journal()
432 void bch2_journal_key_overwritten(struct bch_fs *c, enum btree_id btree, in bch2_journal_key_overwritten()
760 void bch2_shoot_down_journal_keys(struct bch_fs *c, enum btree_id btree, in bch2_shoot_down_journal_keys()
H A Dsnapshot.c284 enum btree_id btree, unsigned level, in __bch2_mark_snapshot()
343 enum btree_id btree, unsigned level, in bch2_mark_snapshot()
899 enum btree_id btree; member
972 for (unsigned btree = 0; btree < BTREE_ID_NR; btree++) { in bch2_reconstruct_snapshots() local
1590 for (unsigned btree = 0; btree < BTREE_ID_NR; btree++) { in bch2_delete_dead_snapshots() local
H A Dbtree_node_scan.c515 bool bch2_btree_has_scanned_nodes(struct bch_fs *c, enum btree_id btree) in bch2_btree_has_scanned_nodes()
529 int bch2_get_scanned_nodes(struct bch_fs *c, enum btree_id btree, in bch2_get_scanned_nodes()
H A Dbkey_methods.h81 enum btree_id btree, unsigned level, in bch2_key_trigger()
H A Dbtree_write_buffer.c686 int bch2_accounting_key_to_wb_slowpath(struct bch_fs *c, enum btree_id btree, in bch2_accounting_key_to_wb_slowpath()
704 enum btree_id btree, struct bkey_i *k) in bch2_journal_key_to_wb_slowpath()
H A Ddisk_accounting_format.h158 struct bch_acct_btree btree; member
H A Dbuckets_types.h45 u64 btree; member
H A Dbtree_gc.c659 static int bch2_gc_btree(struct btree_trans *trans, enum btree_id btree, bool initial) in bch2_gc_btree()
730 unsigned btree = i < BTREE_ID_NR ? ids[i] : i; in bch2_gc_btrees() local
H A Dbkey_types.h235 enum btree_id btree; member
H A Dbuckets.c254 enum btree_id btree, unsigned level, struct bkey_s_c k, in bch2_check_fix_ptrs()
841 enum btree_id btree, unsigned level, in bch2_trigger_extent()
/linux/fs/hpfs/
H A Danode.c15 struct bplus_header *btree, unsigned sec, in hpfs_bplus_lookup()
63 struct bplus_header *btree; in hpfs_add_sector_to_btree() local
274 void hpfs_remove_btree(struct super_block *s, struct bplus_header *btree) in hpfs_remove_btree()
404 struct bplus_header *btree; in hpfs_truncate_btree() local
/linux/fs/xfs/libxfs/
H A Dxfs_da_btree.c729 struct xfs_da_node_entry *btree; in xfs_da3_root_split() local
1077 struct xfs_da_node_entry *btree; in xfs_da3_node_add() local
1463 struct xfs_da_node_entry *btree; in xfs_da3_fixhashpath() local
1518 struct xfs_da_node_entry *btree; in xfs_da3_node_remove() local
1653 struct xfs_da_node_entry *btree; in xfs_da3_node_lookup_int() local
2108 struct xfs_da_node_entry *btree; in xfs_da3_path_shift() local
2405 struct xfs_da_node_entry *btree; in xfs_da3_swap_lastblock() local
/linux/fs/xfs/
H A Dxfs_attr_list.c221 struct xfs_da_node_entry *btree; in xfs_attr_node_list_lookup() local

12