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()
118 	uint32_t total, n;  in calc_max_entries()  local
132 	struct btree_node *n;  in dm_btree_empty()  local
166 	struct btree_node *n;  member
428 	struct btree_node *n;  in dm_btree_lookup_next_single()  local
774 	struct btree_node *n;  in insert()  local
959 	struct btree_node *n;  in walk_node()  local
1002 	struct cursor_node *n = c->nodes + c->depth - 1;  in prefetch_values()  local
1017 	struct cursor_node *n = c->nodes + c->depth - 1;  in leaf_node()  local
1026 	struct cursor_node *n = c->nodes + c->depth;  in push_node()  local
1054 	struct cursor_node *n;  in inc_or_backtrack()  local
1077 	struct cursor_node *n;  in find_leaf()  local
1154 		struct cursor_node *n = c->nodes + c->depth - 1;  in dm_btree_cursor_get_value()  local