378 		    uint64_t *keys, void *value_le)  in dm_btree_lookup()  argument
392 			value_p = value_le;  in dm_btree_lookup()
423 				       uint64_t key, uint64_t *rkey, void *value_le)  in dm_btree_lookup_next_single()  argument
452 		r = dm_btree_lookup_next_single(info, value64(n, i), key, rkey, value_le);  in dm_btree_lookup_next_single()
455 			r = dm_btree_lookup_next_single(info, value64(n, i), key, rkey, value_le);  in dm_btree_lookup_next_single()
466 		memcpy(value_le, value_ptr(n, i), info->value_type.size);  in dm_btree_lookup_next_single()
474 			 uint64_t *keys, uint64_t *rkey, void *value_le)  in dm_btree_lookup_next()  argument
497 	r = dm_btree_lookup_next_single(info, root, keys[level], rkey, value_le);  in dm_btree_lookup_next()
1001 	__le64 value_le;  in prefetch_values()  local
1006 	BUG_ON(c->info->value_type.size != sizeof(value_le));  in prefetch_values()
1010 		memcpy(&value_le, value_ptr(bn, i), sizeof(value_le));  in prefetch_values()
1011 		dm_bm_prefetch(bm, le64_to_cpu(value_le));  in prefetch_values()
1079 	__le64 value_le;  in find_leaf()  local
1088 		memcpy(&value_le, value_ptr(bn, n->index), sizeof(value_le));  in find_leaf()
1089 		r = push_node(c, le64_to_cpu(value_le));  in find_leaf()
1151 int dm_btree_cursor_get_value(struct dm_btree_cursor *c, uint64_t *key, void *value_le)  in dm_btree_cursor_get_value()  argument
1161 		memcpy(value_le, value_ptr(bn, n->index), c->info->value_type.size);  in dm_btree_cursor_get_value()