Home
last modified time | relevance | path

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

/drivers/md/persistent-data/
Ddm-btree-remove.c56 static void node_shift(struct btree_node *n, int shift) in node_shift()
82 static void node_copy(struct btree_node *left, struct btree_node *right, int shift) in node_copy()
111 static void delete_at(struct btree_node *n, unsigned index) in delete_at()
131 static unsigned merge_threshold(struct btree_node *n) in merge_threshold()
139 struct btree_node *n;
143 struct btree_node *parent, in init_child()
173 static void shift(struct btree_node *left, struct btree_node *right, int count) in shift()
199 static void __rebalance2(struct dm_btree_info *info, struct btree_node *parent, in __rebalance2()
202 struct btree_node *left = l->n; in __rebalance2()
203 struct btree_node *right = r->n; in __rebalance2()
[all …]
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);
Ddm-btree.c41 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()
85 static int insert_at(size_t value_size, struct btree_node *node, unsigned index, in insert_at()
132 struct btree_node *n; in dm_btree_empty()
166 struct btree_node *n;
342 int (*search_fn)(struct btree_node *, uint64_t), in btree_lookup_raw() argument
422 struct btree_node *n; in dm_btree_lookup_next_single()
529 struct btree_node *ln, *rn, *pn; in btree_split_sibling()
[all …]
Ddm-btree-spine.c26 struct btree_node *n = dm_block_data(b); in node_prepare_for_write()
41 struct btree_node *n = dm_block_data(b); in node_check()
170 struct btree_node *ro_node(struct ro_spine *s) in ro_node()