Searched refs:time_seq (Results 1 - 7 of 7) sorted by relevance

/linux-master/fs/btrfs/
H A Dtree-mod-log.h46 u64 time_seq);
47 struct extent_buffer *btrfs_get_old_root(struct btrfs_root *root, u64 time_seq);
48 int btrfs_old_root_level(struct btrfs_root *root, u64 time_seq);
H A Dtree-mod-log.c732 * Entries older than time_seq are ignored.
735 u64 time_seq)
742 if (!time_seq)
753 time_seq);
788 * time_seq).
792 u64 time_seq,
820 while (tm && tm->seq >= time_seq) {
914 u64 time_seq)
919 if (!time_seq)
925 tm = tree_mod_log_search(fs_info, eb->start, time_seq);
734 tree_mod_log_oldest_root(struct extent_buffer *eb_root, u64 time_seq) argument
790 tree_mod_log_rewind(struct btrfs_fs_info *fs_info, struct extent_buffer *eb, u64 time_seq, struct tree_mod_elem *first_tm) argument
911 btrfs_tree_mod_log_rewind(struct btrfs_fs_info *fs_info, struct btrfs_path *path, struct extent_buffer *eb, u64 time_seq) argument
971 btrfs_get_old_root(struct btrfs_root *root, u64 time_seq) argument
1074 btrfs_old_root_level(struct btrfs_root *root, u64 time_seq) argument
[all...]
H A Dctree.h581 struct btrfs_path *p, u64 time_seq);
654 u64 time_seq);
688 int btrfs_next_old_item(struct btrfs_root *root, struct btrfs_path *path, u64 time_seq);
H A Dbackref.h97 u64 time_seq; member in struct:btrfs_backref_walk_ctx
H A Dbackref.c509 if (ctx->time_seq == BTRFS_SEQ_LAST)
512 ret = btrfs_next_old_leaf(root, path, ctx->time_seq);
533 if (ctx->time_seq == BTRFS_SEQ_LAST)
536 ret = btrfs_next_old_leaf(root, path, ctx->time_seq);
573 if (ctx->time_seq == BTRFS_SEQ_LAST)
576 ret = btrfs_next_old_item(root, path, ctx->time_seq);
633 else if (ctx->time_seq == BTRFS_SEQ_LAST)
636 root_level = btrfs_old_root_level(root, ctx->time_seq);
664 if (ctx->time_seq == BTRFS_SEQ_LAST)
667 ret = btrfs_search_old_slot(root, &search_key, path, ctx->time_seq);
[all...]
H A Dctree.c2241 * denoted by the time_seq parameter.
2249 struct btrfs_path *p, u64 time_seq)
2265 BUG_ON(time_seq);
2270 b = btrfs_get_old_root(root, time_seq);
2325 b = btrfs_tree_mod_log_rewind(fs_info, p, b, time_seq);
4795 u64 time_seq)
4812 if (time_seq)
4827 if (time_seq) {
4828 ret = btrfs_search_old_slot(root, &key, path, time_seq);
4930 if (!ret && time_seq) {
2248 btrfs_search_old_slot(struct btrfs_root *root, const struct btrfs_key *key, struct btrfs_path *p, u64 time_seq) argument
4794 btrfs_next_old_leaf(struct btrfs_root *root, struct btrfs_path *path, u64 time_seq) argument
4995 btrfs_next_old_item(struct btrfs_root *root, struct btrfs_path *path, u64 time_seq) argument
[all...]
H A Dqgroup.c2961 * Use BTRFS_SEQ_LAST as time_seq to do special search,
2966 ctx.time_seq = BTRFS_SEQ_LAST;

Completed in 143 milliseconds