Home
last modified time | relevance | path

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

12

/linux-6.8/drivers/md/bcache/
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-6.8/fs/nilfs2/
Dbtree.c58 static int nilfs_btree_get_new_block(const struct nilfs_bmap *btree, in nilfs_btree_get_new_block()
112 static int nilfs_btree_node_size(const struct nilfs_bmap *btree) in nilfs_btree_node_size()
117 static int nilfs_btree_nchildren_per_block(const struct nilfs_bmap *btree) in nilfs_btree_nchildren_per_block()
410 nilfs_btree_get_root(const struct nilfs_bmap *btree) in nilfs_btree_get_root()
427 static int nilfs_btree_height(const struct nilfs_bmap *btree) in nilfs_btree_height()
433 nilfs_btree_get_node(const struct nilfs_bmap *btree, in nilfs_btree_get_node()
449 static int nilfs_btree_bad_node(const struct nilfs_bmap *btree, in nilfs_btree_bad_node()
470 static int __nilfs_btree_get_block(const struct nilfs_bmap *btree, __u64 ptr, in __nilfs_btree_get_block()
540 static int nilfs_btree_get_block(const struct nilfs_bmap *btree, __u64 ptr, in nilfs_btree_get_block()
546 static int nilfs_btree_do_lookup(const struct nilfs_bmap *btree, in nilfs_btree_do_lookup()
[all …]
/linux-6.8/fs/bcachefs/
Dbtree_types.h71 struct btree { struct
72 struct btree_bkey_cached_common c; argument
85 struct btree_node *data; argument
89 * Sets of sorted keys - the real btree node - plus a binary search tree argument
97 struct btree_nr_keys nr; argument
103 struct btree_write writes[2]; argument
105 /* Key/pointer for this btree node */ argument
128 * If a btree node isn't reachable yet, we don't want to kick off argument
144 * We never free a struct btree, except on shutdown - we just put it on argument
685 static inline bool btree_id_is_extents(enum btree_id btree) in btree_id_is_extents()
Dbbpos_types.h6 enum btree_id btree; member
10 static inline struct bbpos BBPOS(enum btree_id btree, struct bpos pos) in BBPOS()
Dbtree_write_buffer_types.h17 enum btree_id btree:8; member
39 enum btree_id btree:8; member
Dbtree_update.c540 enum btree_id btree, in bch2_btree_insert_clone_trans()
579 enum btree_id btree, struct bpos end) in bch2_bkey_get_empty_slot()
617 enum btree_id btree, struct bkey_i *k, in bch2_btree_insert_nonextent()
688 enum btree_id btree, struct bpos pos, in bch2_btree_delete()
788 int bch2_btree_bit_mod(struct btree_trans *trans, enum btree_id btree, in bch2_btree_bit_mod()
Dbtree_update.h68 enum btree_id btree, struct bpos pos) in bch2_btree_delete_at_buffered()
84 enum btree_id btree, in bch2_insert_snapshot_whiteouts()
127 enum btree_id btree, in bch2_trans_update_buffered()
Dbtree_write_buffer.h38 enum btree_id btree, struct bkey_i *k) in bch2_journal_key_to_wb()
Dsnapshot.c280 enum btree_id btree, unsigned level, in __bch2_mark_snapshot()
334 enum btree_id btree, unsigned level, in bch2_mark_snapshot()
1570 enum btree_id btree, in bch2_propagate_key_to_snapshot_leaf()
1610 enum btree_id btree, in bch2_propagate_key_to_snapshot_leaves()
Dbkey_methods.h126 enum btree_id btree, unsigned level, in bch2_key_trigger()
Dbackpointers.c490 enum btree_id btree, unsigned level, in check_extent_to_backpointers()
576 enum btree_id btree; in bch2_get_btree_in_memory_pos() local
Dbuckets_types.h50 u64 btree; member
Dbtree_write_buffer.c488 enum btree_id btree, struct bkey_i *k) in bch2_journal_key_to_wb_slowpath()
Dbkey_methods.c196 enum btree_id btree = type - 1; in __bch2_bkey_invalid() local
Dbtree_journal_iter.c263 void bch2_journal_key_overwritten(struct bch_fs *c, enum btree_id btree, in bch2_journal_key_overwritten()
Dalloc_background.c634 enum btree_id btree; in bch2_bucket_do_index() local
732 enum btree_id btree, unsigned level, in bch2_trigger_alloc()
Dbtree_cache.c1150 const char *bch2_btree_id_str(enum btree_id btree) in bch2_btree_id_str()
/linux-6.8/fs/hpfs/
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
Dhpfs.h456 struct bplus_header btree; /* b+ tree, 8 extents or 12 subtrees */ member
498 struct bplus_header btree; /* b+tree, 40 extents or 60 subtrees */ member
/linux-6.8/fs/xfs/libxfs/
Dxfs_da_btree.c674 struct xfs_da_node_entry *btree; in xfs_da3_root_split() local
1022 struct xfs_da_node_entry *btree; in xfs_da3_node_add() local
1392 struct xfs_da_node_entry *btree; in xfs_da3_fixhashpath() local
1447 struct xfs_da_node_entry *btree; in xfs_da3_node_remove() local
1582 struct xfs_da_node_entry *btree; in xfs_da3_node_lookup_int() local
1979 struct xfs_da_node_entry *btree; in xfs_da3_path_shift() local
2266 struct xfs_da_node_entry *btree; in xfs_da3_swap_lastblock() local
Dxfs_da_btree.h157 struct xfs_da_node_entry *btree; member
Dxfs_ag.c185 uint64_t btree = 0; in xfs_initialize_perag_data() local
/linux-6.8/rust/alloc/collections/
Dmod.rs10 mod btree; module
/linux-6.8/fs/xfs/
Dxfs_attr_list.c207 struct xfs_da_node_entry *btree; in xfs_attr_node_list_lookup() local
/linux-6.8/fs/xfs/scrub/
Ddabtree.c319 struct xfs_da_node_entry *btree; in xchk_da_btree_block() local

12