Home
last modified time | relevance | path

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

/linux-6.15/drivers/md/persistent-data/
H A Ddm-btree-remove.c86 static int node_copy(struct btree_node *left, struct btree_node *right, int shift) in node_copy()
158 struct btree_node *n;
192 static int shift(struct btree_node *left, struct btree_node *right, int count) in shift()
283 struct btree_node *parent; in rebalance2()
313 struct btree_node *left, struct btree_node *center, struct btree_node *right, in delete_center_node()
353 struct btree_node *left, struct btree_node *center, struct btree_node *right, in redistribute3()
487 struct btree_node *n; in rebalance_children()
549 struct btree_node *n; in remove_raw()
600 struct btree_node *n; in dm_btree_remove()
643 struct btree_node *n; in remove_nearest()
[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.c133 struct btree_node *n; in dm_btree_empty()
167 struct btree_node *n;
425 struct btree_node *n; in dm_btree_lookup_next_single()
553 static void redistribute2(struct btree_node *left, struct btree_node *right) in redistribute2()
582 static void redistribute3(struct btree_node *left, struct btree_node *center, in redistribute3()
713 struct btree_node *node; in shadow_child()
978 struct btree_node *node; in get_node_free_space()
1243 struct btree_node *n; in insert()
1428 struct btree_node *n; in walk_node()
1524 struct btree_node *bn; in inc_or_backtrack()
[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()
H A Ddm-space-map-common.c544 static bool contains_key(struct btree_node *n, uint64_t key, int index) in contains_key()
555 struct btree_node *n; in __sm_ll_inc_overflow()
587 struct btree_node *n; in sm_ll_inc_overflow()
775 struct btree_node *n; in __sm_ll_dec_overflow()
812 struct btree_node *n; in sm_ll_dec_overflow()
/linux-6.15/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-6.15/fs/bcachefs/
H A Dbtree_io.h108 struct btree_node *bn = container_of(i, struct btree_node, keys); in bset_encrypt()
201 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.h1467 struct btree_node { struct
1491 LE64_BITMASK(BTREE_NODE_ID_LO, struct btree_node, flags, 0, 4); argument
1492 LE64_BITMASK(BTREE_NODE_LEVEL, struct btree_node, flags, 4, 8);
1494 struct btree_node, flags, 8, 9);
1495 LE64_BITMASK(BTREE_NODE_ID_HI, struct btree_node, flags, 9, 25);
1497 LE64_BITMASK(BTREE_NODE_SEQ, struct btree_node, flags, 32, 64);
1499 static inline __u64 BTREE_NODE_ID(struct btree_node *n) in BTREE_NODE_ID()
1504 static inline void SET_BTREE_NODE_ID(struct btree_node *n, __u64 v) in SET_BTREE_NODE_ID()
H A Dbtree_io.c299 struct btree_node *out; in btree_node_sort()
322 : __vstruct_bytes(struct btree_node, u64s); in btree_node_sort()
754 struct btree_node *bn = in validate_bset()
1015 struct btree_node *sorted; in bch2_btree_node_read_done()
1233 sizeof(struct btree_node) - in bch2_btree_node_read_done()
1434 struct btree_node *bn = data; in btree_node_sectors_written()
1457 struct btree_node *bn = data; in btree_node_has_extra_bsets()
1489 struct btree_node *bn = ra->buf[i]; in CLOSURE_CALLBACK()
1530 struct btree_node *bn = ra->buf[i]; in CLOSURE_CALLBACK()
2235 struct btree_node *bn = NULL; in __bch2_btree_node_write()
[all …]
H A Dtrace.h120 DECLARE_EVENT_CLASS(btree_node,
508 DEFINE_EVENT(btree_node, btree_node_read,
533 DEFINE_EVENT(btree_node, btree_node_alloc,
538 DEFINE_EVENT(btree_node, btree_node_free,
571 DEFINE_EVENT(btree_node, btree_node_compact,
576 DEFINE_EVENT(btree_node, btree_node_merge,
581 DEFINE_EVENT(btree_node, btree_node_split,
586 DEFINE_EVENT(btree_node, btree_node_rewrite,
591 DEFINE_EVENT(btree_node, btree_node_set_root,
H A Dbkey_types.h224 x(btree_node) \
H A Ddebug.c39 struct btree_node *n_ondisk = c->verify_ondisk; in bch2_btree_verify_replica()
40 struct btree_node *n_sorted = c->verify_data->data; in bch2_btree_verify_replica()
187 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.c162 struct bio *bio, struct btree_node *bn, u64 offset) in try_read_btree_node()
H A Dbcachefs.h1072 struct btree_node *verify_ondisk;
H A Dbtree_update_interior.c211 return __vstruct_bytes(struct btree_node, u64s) < btree_buf_bytes(b); in bch2_btree_node_format_fits()
652 struct btree_node *b_data = READ_ONCE(b->data); in btree_node_seq_matches()
1515 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()