mirror of
https://github.com/versity/scoutfs.git
synced 2026-02-08 19:50:08 +00:00
d53ec115bc
Add scoutfs_item_prev() for searching for an item before a given key. This wasn't initially implemented because it's rarely needed and for a long time the segment reading and item cache populating code had a strong bias for iterating forward from the given search key. Since we've added limiting item cache reading to the keys covered by locks and reading in entire segments it's now very easy to iterate backwards through keys just like scoutfs_item_next() iterates forwards. The only remaining forward iteration bias was in check_range(). It had to give callers the start of the cached range that it found. Signed-off-by: Zach Brown <zab@versity.com>
76 lines
3.2 KiB
C
76 lines
3.2 KiB
C
#ifndef _SCOUTFS_ITEM_H_
|
|
#define _SCOUTFS_ITEM_H_
|
|
|
|
#include <linux/uio.h>
|
|
|
|
struct scoutfs_segment;
|
|
struct scoutfs_key;
|
|
|
|
int scoutfs_item_lookup(struct super_block *sb, struct scoutfs_key *key,
|
|
struct kvec *val, struct scoutfs_lock *lock);
|
|
int scoutfs_item_lookup_exact(struct super_block *sb,
|
|
struct scoutfs_key *key, struct kvec *val,
|
|
struct scoutfs_lock *lock);
|
|
int scoutfs_item_next(struct super_block *sb, struct scoutfs_key *key,
|
|
struct scoutfs_key *last, struct kvec *val,
|
|
struct scoutfs_lock *lock);
|
|
int scoutfs_item_prev(struct super_block *sb, struct scoutfs_key *key,
|
|
struct scoutfs_key *first, struct kvec *val,
|
|
struct scoutfs_lock *lock);
|
|
int scoutfs_item_create(struct super_block *sb, struct scoutfs_key *key,
|
|
struct kvec *val, struct scoutfs_lock *lock);
|
|
int scoutfs_item_create_force(struct super_block *sb,
|
|
struct scoutfs_key *key,
|
|
struct kvec *val, struct scoutfs_lock *lock);
|
|
int scoutfs_item_dirty(struct super_block *sb, struct scoutfs_key *key,
|
|
struct scoutfs_lock *lock);
|
|
int scoutfs_item_update(struct super_block *sb, struct scoutfs_key *key,
|
|
struct kvec *val, struct scoutfs_lock *lock);
|
|
void scoutfs_item_delete_dirty(struct super_block *sb,
|
|
struct scoutfs_key *key);
|
|
void scoutfs_item_update_dirty(struct super_block *sb,
|
|
struct scoutfs_key *key, struct kvec *val);
|
|
int scoutfs_item_delete(struct super_block *sb, struct scoutfs_key *key,
|
|
struct scoutfs_lock *lock);
|
|
int scoutfs_item_delete_force(struct super_block *sb,
|
|
struct scoutfs_key *key,
|
|
struct scoutfs_lock *lock);
|
|
int scoutfs_item_delete_save(struct super_block *sb,
|
|
struct scoutfs_key *key,
|
|
struct list_head *list,
|
|
struct scoutfs_lock *lock);
|
|
int scoutfs_item_restore(struct super_block *sb, struct list_head *list,
|
|
struct scoutfs_lock *lock);
|
|
|
|
int scoutfs_item_add_batch(struct super_block *sb, struct list_head *list,
|
|
struct scoutfs_key *key, struct kvec *val);
|
|
int scoutfs_item_insert_batch(struct super_block *sb, struct list_head *list,
|
|
struct scoutfs_key *start,
|
|
struct scoutfs_key *end);
|
|
void scoutfs_item_free_batch(struct super_block *sb, struct list_head *list);
|
|
|
|
bool scoutfs_item_has_dirty(struct super_block *sb);
|
|
bool scoutfs_item_range_cached(struct super_block *sb,
|
|
struct scoutfs_key *start,
|
|
struct scoutfs_key *end, bool dirty);
|
|
bool scoutfs_item_dirty_fits_single(struct super_block *sb, u32 nr_items,
|
|
u32 val_bytes);
|
|
int scoutfs_item_dirty_seg(struct super_block *sb, struct scoutfs_segment *seg);
|
|
int scoutfs_item_writeback(struct super_block *sb,
|
|
struct scoutfs_key *start,
|
|
struct scoutfs_key *end);
|
|
int scoutfs_item_invalidate(struct super_block *sb,
|
|
struct scoutfs_key *start,
|
|
struct scoutfs_key *end);
|
|
|
|
int scoutfs_item_copy_range_keys(struct super_block *sb,
|
|
struct scoutfs_key *key,
|
|
struct scoutfs_key *keys, unsigned nr);
|
|
int scoutfs_item_copy_keys(struct super_block *sb, struct scoutfs_key *key,
|
|
struct scoutfs_key *keys, unsigned nr);
|
|
|
|
int scoutfs_item_setup(struct super_block *sb);
|
|
void scoutfs_item_destroy(struct super_block *sb);
|
|
|
|
#endif
|