Searched refs:btree_node (Results 1 - 4 of 4) sorted by relevance
| /drivers/md/persistent-data/ |
| H A D | dm-btree-internal.h | 39 struct btree_node { struct
51 void inc_children(struct dm_transaction_manager *tm, struct btree_node *n,
74 struct btree_node *ro_node(struct ro_spine *s);
108 static inline __le64 *key_ptr(struct btree_node *n, uint32_t index)
113 static inline void *value_base(struct btree_node *n)
118 static inline void *value_ptr(struct btree_node *n, uint32_t index)
127 static inline uint64_t value64(struct btree_node *n, uint32_t index)
137 int lower_bound(struct btree_node *n, uint64_t key);
|
| H A D | dm-btree-remove.c | 56 static void node_shift(struct btree_node *n, int shift)
82 static void node_copy(struct btree_node *left, struct btree_node *right, int shift)
111 static void delete_at(struct btree_node *n, unsigned index)
131 static unsigned merge_threshold(struct btree_node *n)
139 struct btree_node *n;
143 struct btree_node *parent,
173 static void shift(struct btree_node *left, struct btree_node *right, int count)
199 static void __rebalance2(struct dm_btree_info *info, struct btree_node *paren
[all...] |
| H A D | dm-btree-spine.c | 26 struct btree_node *n = dm_block_data(b);
41 struct btree_node *n = dm_block_data(b);
88 .name = "btree_node",
174 struct btree_node *ro_node(struct ro_spine *s)
|
| H A D | dm-btree.c | 41 static int bsearch(struct btree_node *n, uint64_t key, int want_hi)
61 int lower_bound(struct btree_node *n, uint64_t key)
66 void inc_children(struct dm_transaction_manager *tm, struct btree_node *n,
80 static int insert_at(size_t value_size, struct btree_node *node, unsigned index,
125 struct btree_node *n;
157 struct btree_node *n;
319 int (*search_fn)(struct btree_node *, uint64_t),
430 struct btree_node *ln, *rn, *pn;
515 struct btree_node *pn, *ln, *rn;
600 struct btree_node *nod
[all...] |
Completed in 61 milliseconds