Searched refs:btree_node (Results 1 – 6 of 6) sorted by relevance
| /linux-6.1.9/drivers/md/persistent-data/ |
| D | dm-btree-remove.c | 59 static void node_shift(struct btree_node *n, int shift) in node_shift()
85 static int node_copy(struct btree_node *left, struct btree_node *right, int shift) in node_copy()
127 static void delete_at(struct btree_node *n, unsigned index) in delete_at()
147 static unsigned merge_threshold(struct btree_node *n) in merge_threshold()
155 struct btree_node *n;
159 struct btree_node *parent, in init_child()
189 static int shift(struct btree_node *left, struct btree_node *right, int count) in shift()
233 static int __rebalance2(struct dm_btree_info *info, struct btree_node *parent, in __rebalance2()
237 struct btree_node *left = l->n; in __rebalance2()
238 struct btree_node *right = r->n; in __rebalance2()
[all …]
|
| D | dm-btree-internal.h | 39 struct btree_node { struct
51 void inc_children(struct dm_transaction_manager *tm, struct btree_node *n, argument
74 struct btree_node *ro_node(struct ro_spine *s);
108 static inline __le64 *key_ptr(struct btree_node *n, uint32_t index) in key_ptr()
113 static inline void *value_base(struct btree_node *n) in value_base()
118 static inline void *value_ptr(struct btree_node *n, uint32_t index) in value_ptr()
127 static inline uint64_t value64(struct btree_node *n, uint32_t index) in value64()
137 int lower_bound(struct btree_node *n, uint64_t key);
|
| D | dm-btree.c | 41 static int bsearch(struct btree_node *n, uint64_t key, int want_hi) in bsearch()
61 int lower_bound(struct btree_node *n, uint64_t key) in lower_bound()
66 static int upper_bound(struct btree_node *n, uint64_t key) in upper_bound()
71 void inc_children(struct dm_transaction_manager *tm, struct btree_node *n, in inc_children()
83 static int insert_at(size_t value_size, struct btree_node *node, unsigned index, in insert_at()
130 struct btree_node *n; in dm_btree_empty()
164 struct btree_node *n;
341 int (*search_fn)(struct btree_node *, uint64_t), in btree_lookup_raw() argument
422 struct btree_node *n; in dm_btree_lookup_next_single()
505 static void copy_entries(struct btree_node *dest, unsigned dest_offset, in copy_entries()
[all …]
|
| D | dm-btree-spine.c | 22 struct btree_node *n = dm_block_data(b); in node_prepare_for_write()
35 struct btree_node *n = dm_block_data(b); in node_check()
164 struct btree_node *ro_node(struct ro_spine *s) in ro_node()
|
| D | dm-space-map-common.c | 543 static bool contains_key(struct btree_node *n, uint64_t key, int index) in contains_key()
554 struct btree_node *n; in __sm_ll_inc_overflow()
586 struct btree_node *n; in sm_ll_inc_overflow()
772 struct btree_node *n; in __sm_ll_dec_overflow()
810 struct btree_node *n; in sm_ll_dec_overflow()
|
| /linux-6.1.9/include/trace/events/ |
| D | bcache.h | 63 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,
|