Home
last modified time | relevance | path

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

/Linux-v6.6/drivers/md/persistent-data/
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 …]
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);
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 …]
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()
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-v6.6/include/trace/events/
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,