Home
last modified time | relevance | path

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

/linux/drivers/md/persistent-data/
A Ddm-btree-remove.c82 static void node_copy(struct btree_node *left, struct btree_node *right, int shift) in node_copy()
139 struct btree_node *n;
173 static void shift(struct btree_node *left, struct btree_node *right, int count) in shift()
241 struct btree_node *parent; in rebalance2()
271 struct btree_node *left, struct btree_node *center, struct btree_node *right, in delete_center_node()
302 struct btree_node *left, struct btree_node *center, struct btree_node *right, in redistribute3()
412 struct btree_node *n; in rebalance_children()
474 struct btree_node *n; in remove_raw()
524 struct btree_node *n; in dm_btree_remove()
567 struct btree_node *n; in remove_nearest()
[all …]
A Ddm-btree-internal.h39 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);
A Ddm-btree.c128 struct btree_node *n; in dm_btree_empty()
162 struct btree_node *n;
420 struct btree_node *n; in dm_btree_lookup_next_single()
547 static void redistribute2(struct btree_node *left, struct btree_node *right) in redistribute2()
574 static void redistribute3(struct btree_node *left, struct btree_node *center, in redistribute3()
702 struct btree_node *node; in shadow_child()
967 struct btree_node *node; in get_node_free_space()
1230 struct btree_node *n; in insert()
1415 struct btree_node *n; in walk_node()
1511 struct btree_node *bn; in inc_or_backtrack()
[all …]
A Ddm-btree-spine.c26 struct btree_node *n = dm_block_data(b); in node_prepare_for_write()
39 struct btree_node *n = dm_block_data(b); in node_check()
166 struct btree_node *ro_node(struct ro_spine *s) in ro_node()
A Ddm-space-map-common.c538 static bool contains_key(struct btree_node *n, uint64_t key, int index) in contains_key()
549 struct btree_node *n; in __sm_ll_inc_overflow()
581 struct btree_node *n; in sm_ll_inc_overflow()
767 struct btree_node *n; in __sm_ll_dec_overflow()
805 struct btree_node *n; in sm_ll_dec_overflow()
/linux/include/trace/events/
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,

Completed in 16 milliseconds