Searched refs:dm_btree_cursor (Results 1 – 3 of 3) sorted by relevance
194 struct dm_btree_cursor { struct209 bool prefetch_leaves, struct dm_btree_cursor *c); argument210 void dm_btree_cursor_end(struct dm_btree_cursor *c);211 int dm_btree_cursor_next(struct dm_btree_cursor *c);212 int dm_btree_cursor_skip(struct dm_btree_cursor *c, uint32_t count);213 int dm_btree_cursor_get_value(struct dm_btree_cursor *c, uint64_t *key, void *value_le);
996 static void prefetch_values(struct dm_btree_cursor *c) in prefetch_values()1013 static bool leaf_node(struct dm_btree_cursor *c) in leaf_node()1021 static int push_node(struct dm_btree_cursor *c, dm_block_t b) in push_node()1044 static void pop_node(struct dm_btree_cursor *c) in pop_node()1050 static int inc_or_backtrack(struct dm_btree_cursor *c) in inc_or_backtrack()1072 static int find_leaf(struct dm_btree_cursor *c) in find_leaf()1101 bool prefetch_leaves, struct dm_btree_cursor *c) in dm_btree_cursor_begin()1118 void dm_btree_cursor_end(struct dm_btree_cursor *c) in dm_btree_cursor_end()1125 int dm_btree_cursor_next(struct dm_btree_cursor *c) in dm_btree_cursor_next()1138 int dm_btree_cursor_skip(struct dm_btree_cursor *c, uint32_t count) in dm_btree_cursor_skip()[all …]
197 struct dm_btree_cursor cursor;
