Lines Matching refs:btree_node
60 static void node_shift(struct btree_node *n, int shift) in node_shift()
86 static int node_copy(struct btree_node *left, struct btree_node *right, int shift) in node_copy()
129 static void delete_at(struct btree_node *n, unsigned int index) in delete_at()
150 static unsigned int merge_threshold(struct btree_node *n) in merge_threshold()
158 struct btree_node *n;
162 struct btree_node *parent, in init_child()
192 static int shift(struct btree_node *left, struct btree_node *right, int count) in shift()
236 static int __rebalance2(struct dm_btree_info *info, struct btree_node *parent, in __rebalance2()
240 struct btree_node *left = l->n; in __rebalance2()
241 struct btree_node *right = r->n; in __rebalance2()
283 struct btree_node *parent; in rebalance2()
311 static int delete_center_node(struct dm_btree_info *info, struct btree_node *parent, in delete_center_node()
313 struct btree_node *left, struct btree_node *center, struct btree_node *right, in delete_center_node()
351 static int redistribute3(struct dm_btree_info *info, struct btree_node *parent, in redistribute3()
353 struct btree_node *left, struct btree_node *center, struct btree_node *right, in redistribute3()
418 static int __rebalance3(struct dm_btree_info *info, struct btree_node *parent, in __rebalance3()
421 struct btree_node *left = l->n; in __rebalance3()
422 struct btree_node *center = c->n; in __rebalance3()
423 struct btree_node *right = r->n; in __rebalance3()
450 struct btree_node *parent = dm_block_data(shadow_current(s)); in rebalance3()
487 struct btree_node *n; in rebalance_children()
526 static int do_leaf(struct btree_node *n, uint64_t key, unsigned int *index) in do_leaf()
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()
699 struct btree_node *n; in remove_one()