41 static int bsearch(struct btree_node *n, uint64_t key, int want_hi)  in bsearch()
47 		uint64_t mid_key = le64_to_cpu(n->keys[mid]);  in bsearch()
61 int lower_bound(struct btree_node *n, uint64_t key)  in lower_bound()
81 		      uint64_t key, void *value)  in insert_at()
112 	size_t elt_size = sizeof(uint64_t) + value_size; /* key + value */  in calc_max_entries()
318 static int btree_lookup_raw(struct ro_spine *s, dm_block_t block, uint64_t key,  in btree_lookup_raw()
319 			    int (*search_fn)(struct btree_node *, uint64_t),  in btree_lookup_raw()  argument
320 			    uint64_t *result_key, void *v, size_t value_size)  in btree_lookup_raw()
349 		    uint64_t *keys, void *value_le)  in dm_btree_lookup()
353 	uint64_t rkey;  in dm_btree_lookup()
368 			size = sizeof(uint64_t);  in dm_btree_lookup()
424 			       unsigned parent_index, uint64_t key)  in btree_split_sibling()
454 		sizeof(uint64_t) : s->info->value_type.size;  in btree_split_sibling()
509 static int btree_split_beneath(struct shadow_spine *s, uint64_t key)  in btree_split_beneath()
597 			    uint64_t key, unsigned *index)  in btree_insert_raw()
659 		  uint64_t *keys, void *value, dm_block_t *new_root,  in insert()
693 			r = insert_at(sizeof(uint64_t), n, index,  in insert()
750 		    uint64_t *keys, void *value, dm_block_t *new_root)  in dm_btree_insert()
758 			   uint64_t *keys, void *value, dm_block_t *new_root,  in dm_btree_insert_notify()
769 		    uint64_t *result_key, dm_block_t *next_block)  in find_key()
802 			     bool find_highest, uint64_t *result_keys)  in dm_btree_find_key()
826 			      uint64_t *result_keys)  in dm_btree_find_highest_key()
833 			     uint64_t *result_keys)  in dm_btree_find_lowest_key()
846 		     int (*fn)(void *context, uint64_t *keys, void *leaf),  in walk_node()
853 	uint64_t keys;  in walk_node()
881 		  int (*fn)(void *context, uint64_t *keys, void *leaf),  in dm_btree_walk()