Home
last modified time | relevance | path

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

/linux/drivers/md/persistent-data/
H A Ddm-btree-remove.c60 static void node_shift(struct btree_node *n, int shift) in node_shift()
86 static int node_copy(struct btree_node *left, struct btree_node *right, int shift) in node_copy()
129 static void delete_at(struct btree_node *n, unsigned int index) in delete_at()
150 static unsigned int merge_threshold(struct btree_node *n) in merge_threshold()
158 struct btree_node *n;
162 struct btree_node *parent, in init_child()
192 static int shift(struct btree_node *left, struct btree_node *right, int count) in shift()
236 static int __rebalance2(struct dm_btree_info *info, struct btree_node *parent, in __rebalance2()
240 struct btree_node *left = l->n; in __rebalance2()
241 struct btree_node *right = r->n; in __rebalance2()
[all …]
H A Ddm-btree-internal.h40 struct btree_node { struct
52 void inc_children(struct dm_transaction_manager *tm, struct btree_node *n, argument
75 struct btree_node *ro_node(struct ro_spine *s);
109 static inline __le64 *key_ptr(struct btree_node *n, uint32_t index) in key_ptr()
114 static inline void *value_base(struct btree_node *n) in value_base()
119 static inline void *value_ptr(struct btree_node *n, uint32_t index) in value_ptr()
129 static inline uint64_t value64(struct btree_node *n, uint32_t index) in value64()
139 int lower_bound(struct btree_node *n, uint64_t key);
H A Ddm-btree.c44 static int bsearch(struct btree_node *n, uint64_t key, int want_hi) in bsearch()
64 int lower_bound(struct btree_node *n, uint64_t key) in lower_bound()
69 static int upper_bound(struct btree_node *n, uint64_t key) in upper_bound()
74 void inc_children(struct dm_transaction_manager *tm, struct btree_node *n, in inc_children()
86 static int insert_at(size_t value_size, struct btree_node *node, unsigned int index, in insert_at()
133 struct btree_node *n; in dm_btree_empty()
167 struct btree_node *n;
344 int (*search_fn)(struct btree_node *, uint64_t), in btree_lookup_raw() argument
425 struct btree_node *n; in dm_btree_lookup_next_single()
507 static void copy_entries(struct btree_node *dest, unsigned int dest_offset, in copy_entries()
[all …]
H A Ddm-btree-spine.c23 struct btree_node *n = dm_block_data(b); in node_prepare_for_write()
36 struct btree_node *n = dm_block_data(b); in node_check()
164 struct btree_node *ro_node(struct ro_spine *s) in ro_node()
/linux/include/trace/events/
H A Dbcache.h63 DECLARE_EVENT_CLASS(btree_node,
257 DEFINE_EVENT(btree_node, bcache_btree_read,
282 DEFINE_EVENT(btree_node, bcache_btree_node_alloc,
292 DEFINE_EVENT(btree_node, bcache_btree_node_free,
337 __field(u64, btree_node )
348 __entry->btree_node = PTR_BUCKET_NR(b->c, &b->key, 0);
360 __entry->btree_node, __entry->btree_level,
392 DEFINE_EVENT(btree_node, bcache_btree_set_root,
/linux/fs/bcachefs/
H A Dbtree_io.h107 struct btree_node *bn = container_of(i, struct btree_node, keys); in bset_encrypt()
197 struct btree_node *bn) in compat_btree_node()
H A Dbtree_cache.h94 return (btree_buf_bytes(b) - sizeof(struct btree_node)) / sizeof(u64); in btree_buf_max_u64s()
99 return (c->opts.btree_node_size - sizeof(struct btree_node)) / sizeof(u64); in btree_max_u64s()
H A Dbcachefs_format.h1451 struct btree_node { struct
1475 LE64_BITMASK(BTREE_NODE_ID_LO, struct btree_node, flags, 0, 4); argument
1476 LE64_BITMASK(BTREE_NODE_LEVEL, struct btree_node, flags, 4, 8);
1478 struct btree_node, flags, 8, 9);
1479 LE64_BITMASK(BTREE_NODE_ID_HI, struct btree_node, flags, 9, 25);
1481 LE64_BITMASK(BTREE_NODE_SEQ, struct btree_node, flags, 32, 64);
1483 static inline __u64 BTREE_NODE_ID(struct btree_node *n) in BTREE_NODE_ID()
1488 static inline void SET_BTREE_NODE_ID(struct btree_node *n, __u64 v) in SET_BTREE_NODE_ID()
H A Dbtree_io.c26 static void bch2_btree_node_header_to_text(struct printbuf *out, struct btree_node *bn) in bch2_btree_node_header_to_text()
297 struct btree_node *out; in btree_node_sort()
320 : __vstruct_bytes(struct btree_node, u64s); in btree_node_sort()
751 struct btree_node *bn = in validate_bset()
752 container_of(i, struct btree_node, keys); in validate_bset()
1012 struct btree_node *sorted; in bch2_btree_node_read_done()
1230 sizeof(struct btree_node) - in bch2_btree_node_read_done()
1425 struct btree_node *bn = data; in btree_node_sectors_written()
1448 struct btree_node *bn = data; in btree_node_has_extra_bsets()
1480 struct btree_node *bn = ra->buf[i]; in CLOSURE_CALLBACK()
[all …]
H A Dtrace.h120 DECLARE_EVENT_CLASS(btree_node,
484 DEFINE_EVENT(btree_node, btree_node_read,
509 DEFINE_EVENT(btree_node, btree_node_alloc,
514 DEFINE_EVENT(btree_node, btree_node_free,
547 DEFINE_EVENT(btree_node, btree_node_compact,
552 DEFINE_EVENT(btree_node, btree_node_merge,
557 DEFINE_EVENT(btree_node, btree_node_split,
562 DEFINE_EVENT(btree_node, btree_node_rewrite,
567 DEFINE_EVENT(btree_node, btree_node_set_root,
H A Dbkey_types.h224 x(btree_node) \
H A Ddebug.c38 struct btree_node *n_ondisk = c->verify_ondisk; in bch2_btree_verify_replica()
39 struct btree_node *n_sorted = c->verify_data->data; in bch2_btree_verify_replica()
186 struct btree_node *n_ondisk = NULL; in bch2_btree_node_ondisk_to_text()
H A Dbtree_types.h86 struct btree_node *data;
H A Dbtree_node_scan.c161 struct bio *bio, struct btree_node *bn, u64 offset) in try_read_btree_node()
H A Dbcachefs.h1063 struct btree_node *verify_ondisk;
H A Dbtree_update_interior.c214 return __vstruct_bytes(struct btree_node, u64s) < btree_buf_bytes(b); in bch2_btree_node_format_fits()
1512 if (__vstruct_bytes(struct btree_node, u64s) > btree_buf_bytes(b)) in __btree_split_node()
H A Dbtree_cache.c1460 btree_buf_bytes(b) - sizeof(struct btree_node), in bch2_btree_node_to_text()