41 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()
83 static int insert_at(size_t value_size, struct btree_node *node, unsigned index,  in insert_at()
128 	struct btree_node *n;  in dm_btree_empty()
162 	struct btree_node *n;
339 			    int (*search_fn)(struct btree_node *, uint64_t),  in btree_lookup_raw()  argument
420 	struct btree_node *n;  in dm_btree_lookup_next_single()
503 static void copy_entries(struct btree_node *dest, unsigned dest_offset,  in copy_entries()
504 			 struct btree_node *src, unsigned src_offset,  in copy_entries()
516 static void move_entries(struct btree_node *dest, unsigned dest_offset,  in move_entries()
517 			 struct btree_node *src, unsigned src_offset,  in move_entries()
529 static void shift_down(struct btree_node *n, unsigned count)  in shift_down()
538 static void shift_up(struct btree_node *n, unsigned count)  in shift_up()
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()
575 			  struct btree_node *right)  in redistribute3()
648 	struct btree_node *ln, *rn, *pn;  in split_one_into_two()
697 			struct btree_node *parent, unsigned index,  in shadow_child()
702 	struct btree_node *node;  in shadow_child()
732 	struct btree_node *ln, *rn, *mn, *pn;  in split_two_into_three()
833 	struct btree_node *pn, *ln, *rn;  in btree_split_beneath()
909 	struct btree_node *left, *right, *parent = dm_block_data(shadow_parent(s));  in rebalance_left()
938 	struct btree_node *left, *right, *parent = dm_block_data(shadow_parent(s));  in rebalance_right()
967 	struct btree_node *node;  in get_node_free_space()
994 	struct btree_node *parent = dm_block_data(shadow_parent(s));  in rebalance_or_split()
1050 static bool contains_key(struct btree_node *node, uint64_t key)  in contains_key()
1065 static bool has_space_for_insert(struct btree_node *node, uint64_t key)  in has_space_for_insert()
1084 	struct btree_node *node;  in btree_insert_raw()
1147 	struct btree_node *node;  in __btree_get_overwrite_leaf()
1214 static bool need_insert(struct btree_node *node, uint64_t *keys,  in need_insert()
1230 	struct btree_node *n;  in insert()
1415 	struct btree_node *n;  in walk_node()
1459 	struct btree_node *bn = dm_block_data(n->b);  in prefetch_values()
1474 	struct btree_node *bn = dm_block_data(n->b);  in leaf_node()
1511 	struct btree_node *bn;  in inc_or_backtrack()
1534 	struct btree_node *bn;  in find_leaf()
1611 		struct btree_node *bn = dm_block_data(n->b);  in dm_btree_cursor_get_value()