| /linux-6.14.4/drivers/md/bcache/ |
| D | btree.h | 117 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.14.4/fs/nilfs2/ |
| D | btree.c | 58 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()
411 nilfs_btree_get_root(const struct nilfs_bmap *btree) in nilfs_btree_get_root()
428 static int nilfs_btree_height(const struct nilfs_bmap *btree) in nilfs_btree_height()
434 nilfs_btree_get_node(const struct nilfs_bmap *btree, in nilfs_btree_get_node()
450 static int nilfs_btree_bad_node(const struct nilfs_bmap *btree, in nilfs_btree_bad_node()
471 static int __nilfs_btree_get_block(const struct nilfs_bmap *btree, __u64 ptr, in __nilfs_btree_get_block()
541 static int nilfs_btree_get_block(const struct nilfs_bmap *btree, __u64 ptr, in nilfs_btree_get_block()
547 static int nilfs_btree_do_lookup(const struct nilfs_bmap *btree, in nilfs_btree_do_lookup()
[all …]
|
| /linux-6.14.4/fs/bcachefs/ |
| D | btree_types.h | 72 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 …]
|
| D | btree_write_buffer.h | 49 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()
|
| D | bbpos_types.h | 6 enum btree_id btree; member
10 static inline struct bbpos BBPOS(enum btree_id btree, struct bpos pos) in BBPOS()
|
| D | btree_gc.h | 39 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()
|
| D | btree_update.c | 550 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()
|
| D | btree_write_buffer_types.h | 17 enum btree_id btree:8; member
39 enum btree_id btree:8; member
|
| D | backpointers.c | 383 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()
|
| D | btree_cache.c | 316 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()
|
| D | btree_update.h | 71 enum btree_id btree, struct bpos pos) in bch2_btree_delete_at_buffered()
87 enum btree_id btree, in bch2_insert_snapshot_whiteouts()
133 enum btree_id btree, in bch2_trans_update_buffered()
|
| D | btree_write_buffer.c | 268 enum btree_id btree, struct bkey_i *k) in bch2_btree_write_buffer_insert_err()
705 int bch2_accounting_key_to_wb_slowpath(struct bch_fs *c, enum btree_id btree, in bch2_accounting_key_to_wb_slowpath()
723 enum btree_id btree, struct bkey_i *k) in bch2_journal_key_to_wb_slowpath()
|
| D | btree_gc_types.h | 21 enum btree_id btree:8; member
|
| D | recovery.c | 36 int bch2_btree_lost_data(struct bch_fs *c, enum btree_id btree) in bch2_btree_lost_data()
109 static void kill_btree(struct bch_fs *c, enum btree_id btree) in kill_btree()
|
| D | btree_journal_iter.c | 354 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()
|
| D | snapshot.c | 284 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
|
| D | btree_node_scan.c | 515 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()
|
| D | bkey_methods.h | 81 enum btree_id btree, unsigned level, in bch2_key_trigger()
|
| D | disk_accounting_format.h | 158 struct bch_acct_btree btree; member
|
| D | buckets_types.h | 45 u64 btree; member
|
| D | btree_gc.c | 659 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
|
| /linux-6.14.4/fs/hpfs/ |
| D | anode.c | 15 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-6.14.4/fs/xfs/libxfs/ |
| D | xfs_da_btree.c | 729 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-6.14.4/fs/xfs/scrub/ |
| D | listxattr.c | 139 struct xfs_da_node_entry *btree; in xchk_xattr_find_leftmost_leaf() local
|
| /linux-6.14.4/fs/xfs/ |
| D | xfs_attr_list.c | 221 struct xfs_da_node_entry *btree; in xfs_attr_node_list_lookup() local
|