dm_btree_cursor
struct dm_btree_cursor cursor;
static void prefetch_values(struct dm_btree_cursor *c)
static bool leaf_node(struct dm_btree_cursor *c)
static int push_node(struct dm_btree_cursor *c, dm_block_t b)
static void pop_node(struct dm_btree_cursor *c)
static int inc_or_backtrack(struct dm_btree_cursor *c)
static int find_leaf(struct dm_btree_cursor *c)
bool prefetch_leaves, struct dm_btree_cursor *c)
void dm_btree_cursor_end(struct dm_btree_cursor *c)
int dm_btree_cursor_next(struct dm_btree_cursor *c)
int dm_btree_cursor_skip(struct dm_btree_cursor *c, uint32_t count)
int dm_btree_cursor_get_value(struct dm_btree_cursor *c, uint64_t *key, void *value_le)
bool prefetch_leaves, struct dm_btree_cursor *c);
void dm_btree_cursor_end(struct dm_btree_cursor *c);
int dm_btree_cursor_next(struct dm_btree_cursor *c);
int dm_btree_cursor_skip(struct dm_btree_cursor *c, uint32_t count);
int dm_btree_cursor_get_value(struct dm_btree_cursor *c, uint64_t *key, void *value_le);