Searched refs:btree_node (Results 1 – 6 of 6) sorted by relevance
| /linux-6.3-rc2/drivers/md/persistent-data/ |
| A D | dm-btree-remove.c | 86 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 …]
|
| A D | dm-btree-internal.h | 40 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);
|
| A D | dm-btree.c | 133 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 …]
|
| A D | dm-btree-spine.c | 23 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()
|
| A D | dm-space-map-common.c | 544 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.3-rc2/include/trace/events/ |
| A 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,
|
Completed in 12 milliseconds