| /kernel/linux/linux-6.6/fs/btrfs/ |
| H A D | tree-mod-log.h | 40 u64 time_seq);
41 struct extent_buffer *btrfs_get_old_root(struct btrfs_root *root, u64 time_seq);
42 int btrfs_old_root_level(struct btrfs_root *root, u64 time_seq);
|
| H A D | tree-mod-log.c | 733 * Entries older than time_seq are ignored.
736 u64 time_seq) in tree_mod_log_oldest_root()
743 if (!time_seq) in tree_mod_log_oldest_root()
754 time_seq); in tree_mod_log_oldest_root()
789 * time_seq).
793 u64 time_seq, in tree_mod_log_rewind()
821 while (tm && tm->seq >= time_seq) { in tree_mod_log_rewind()
915 u64 time_seq) in btrfs_tree_mod_log_rewind()
920 if (!time_seq) in btrfs_tree_mod_log_rewind()
926 tm = tree_mod_log_search(fs_info, eb->start, time_seq); in btrfs_tree_mod_log_rewind()
735 tree_mod_log_oldest_root(struct extent_buffer *eb_root, u64 time_seq) tree_mod_log_oldest_root() argument
791 tree_mod_log_rewind(struct btrfs_fs_info *fs_info, struct extent_buffer *eb, u64 time_seq, struct tree_mod_elem *first_tm) tree_mod_log_rewind() argument
912 btrfs_tree_mod_log_rewind(struct btrfs_fs_info *fs_info, struct btrfs_path *path, struct extent_buffer *eb, u64 time_seq) btrfs_tree_mod_log_rewind() argument
972 btrfs_get_old_root(struct btrfs_root *root, u64 time_seq) btrfs_get_old_root() argument
1075 btrfs_old_root_level(struct btrfs_root *root, u64 time_seq) btrfs_old_root_level() argument
[all...] |
| H A D | ctree.h | 567 struct btrfs_path *p, u64 time_seq);
644 u64 time_seq);
678 int btrfs_next_old_item(struct btrfs_root *root, struct btrfs_path *path, u64 time_seq);
|
| H A D | backref.c | 512 if (ctx->time_seq == BTRFS_SEQ_LAST) in add_all_parents()
515 ret = btrfs_next_old_leaf(root, path, ctx->time_seq); in add_all_parents()
536 if (ctx->time_seq == BTRFS_SEQ_LAST) in add_all_parents()
539 ret = btrfs_next_old_leaf(root, path, ctx->time_seq); in add_all_parents()
576 if (ctx->time_seq == BTRFS_SEQ_LAST) in add_all_parents()
579 ret = btrfs_next_old_item(root, path, ctx->time_seq); in add_all_parents()
636 else if (ctx->time_seq == BTRFS_SEQ_LAST) in resolve_indirect_ref()
639 root_level = btrfs_old_root_level(root, ctx->time_seq); in resolve_indirect_ref()
667 if (ctx->time_seq == BTRFS_SEQ_LAST) in resolve_indirect_ref()
670 ret = btrfs_search_old_slot(root, &search_key, path, ctx->time_seq); in resolve_indirect_ref()
[all...] |
| H A D | backref.h | 85 u64 time_seq; member
|
| H A D | ctree.c | 2368 * denoted by the time_seq parameter.
2376 struct btrfs_path *p, u64 time_seq) in btrfs_search_old_slot()
2392 BUG_ON(time_seq); in btrfs_search_old_slot()
2397 b = btrfs_get_old_root(root, time_seq); in btrfs_search_old_slot()
2452 b = btrfs_tree_mod_log_rewind(fs_info, p, b, time_seq); in btrfs_search_old_slot()
4919 u64 time_seq) in btrfs_next_old_leaf()
4936 if (time_seq) in btrfs_next_old_leaf()
4951 if (time_seq) { in btrfs_next_old_leaf()
4952 ret = btrfs_search_old_slot(root, &key, path, time_seq); in btrfs_next_old_leaf()
5054 if (!ret && time_seq) { in btrfs_next_old_leaf()
2375 btrfs_search_old_slot(struct btrfs_root *root, const struct btrfs_key *key, struct btrfs_path *p, u64 time_seq) btrfs_search_old_slot() argument
4918 btrfs_next_old_leaf(struct btrfs_root *root, struct btrfs_path *path, u64 time_seq) btrfs_next_old_leaf() argument
5119 btrfs_next_old_item(struct btrfs_root *root, struct btrfs_path *path, u64 time_seq) btrfs_next_old_item() argument
[all...] |
| H A D | qgroup.c | 2837 * Use BTRFS_SEQ_LAST as time_seq to do special search, in btrfs_qgroup_account_extents()
2842 ctx.time_seq = BTRFS_SEQ_LAST; in btrfs_qgroup_account_extents()
|
| /kernel/linux/linux-5.10/fs/btrfs/ |
| H A D | backref.c | 421 int level, u64 time_seq, const u64 *extent_item_pos, in add_all_parents()
459 if (time_seq == SEQ_LAST) in add_all_parents()
462 ret = btrfs_next_old_leaf(root, path, time_seq); in add_all_parents()
483 if (time_seq == SEQ_LAST) in add_all_parents()
486 ret = btrfs_next_old_leaf(root, path, time_seq); in add_all_parents()
524 if (time_seq == SEQ_LAST) in add_all_parents()
527 ret = btrfs_next_old_item(root, path, time_seq); in add_all_parents()
542 struct btrfs_path *path, u64 time_seq, in resolve_indirect_ref()
584 else if (time_seq == SEQ_LAST) in resolve_indirect_ref()
587 root_level = btrfs_old_root_level(root, time_seq); in resolve_indirect_ref()
418 add_all_parents(struct btrfs_root *root, struct btrfs_path *path, struct ulist *parents, struct preftrees *preftrees, struct prelim_ref *ref, int level, u64 time_seq, const u64 *extent_item_pos, bool ignore_offset) add_all_parents() argument
541 resolve_indirect_ref(struct btrfs_fs_info *fs_info, struct btrfs_path *path, u64 time_seq, struct preftrees *preftrees, struct prelim_ref *ref, struct ulist *parents, const u64 *extent_item_pos, bool ignore_offset) resolve_indirect_ref() argument
684 resolve_indirect_refs(struct btrfs_fs_info *fs_info, struct btrfs_path *path, u64 time_seq, struct preftrees *preftrees, const u64 *extent_item_pos, struct share_check *sc, bool ignore_offset) resolve_indirect_refs() argument
1202 find_parent_nodes(struct btrfs_trans_handle *trans, struct btrfs_fs_info *fs_info, u64 bytenr, u64 time_seq, struct ulist *refs, struct ulist *roots, const u64 *extent_item_pos, struct share_check *sc, bool ignore_offset) global() argument
1460 btrfs_find_all_leafs(struct btrfs_trans_handle *trans, struct btrfs_fs_info *fs_info, u64 bytenr, u64 time_seq, struct ulist **leafs, const u64 *extent_item_pos, bool ignore_offset) global() argument
1494 btrfs_find_all_roots_safe(struct btrfs_trans_handle *trans, struct btrfs_fs_info *fs_info, u64 bytenr, u64 time_seq, struct ulist **roots, bool ignore_offset) global() argument
1534 btrfs_find_all_roots(struct btrfs_trans_handle *trans, struct btrfs_fs_info *fs_info, u64 bytenr, u64 time_seq, struct ulist **roots, bool ignore_offset) global() argument
[all...] |
| H A D | ctree.c | 1132 * entries older than time_seq are ignored.
1135 struct extent_buffer *eb_root, u64 time_seq) in __tree_mod_log_oldest_root()
1142 if (!time_seq) in __tree_mod_log_oldest_root()
1153 time_seq); in __tree_mod_log_oldest_root()
1187 * time_seq).
1191 u64 time_seq, struct tree_mod_elem *first_tm) in __tree_mod_log_rewind()
1202 while (tm && tm->seq >= time_seq) { in __tree_mod_log_rewind()
1269 struct extent_buffer *eb, u64 time_seq) in tree_mod_log_rewind()
1274 if (!time_seq) in tree_mod_log_rewind()
1280 tm = tree_mod_log_search(fs_info, eb->start, time_seq); in tree_mod_log_rewind()
1134 __tree_mod_log_oldest_root( struct extent_buffer *eb_root, u64 time_seq) __tree_mod_log_oldest_root() argument
1190 __tree_mod_log_rewind(struct btrfs_fs_info *fs_info, struct extent_buffer *eb, u64 time_seq, struct tree_mod_elem *first_tm) __tree_mod_log_rewind() argument
1268 tree_mod_log_rewind(struct btrfs_fs_info *fs_info, struct btrfs_path *path, struct extent_buffer *eb, u64 time_seq) tree_mod_log_rewind() argument
1330 get_old_root(struct btrfs_root *root, u64 time_seq) get_old_root() argument
1428 btrfs_old_root_level(struct btrfs_root *root, u64 time_seq) btrfs_old_root_level() argument
2963 btrfs_search_old_slot(struct btrfs_root *root, const struct btrfs_key *key, struct btrfs_path *p, u64 time_seq) btrfs_search_old_slot() argument
5447 btrfs_next_old_leaf(struct btrfs_root *root, struct btrfs_path *path, u64 time_seq) btrfs_next_old_leaf() argument
[all...] |
| H A D | backref.h | 45 u64 time_seq, struct ulist **leafs,
49 u64 time_seq, struct ulist **roots, bool ignore_offset);
|
| H A D | ctree.h | 2739 struct btrfs_path *p, u64 time_seq);
2784 u64 time_seq);
2786 struct btrfs_path *p, u64 time_seq) in btrfs_next_old_item()
2790 return btrfs_next_old_leaf(root, p, time_seq); in btrfs_next_old_item()
2832 int btrfs_old_root_level(struct btrfs_root *root, u64 time_seq);
2785 btrfs_next_old_item(struct btrfs_root *root, struct btrfs_path *p, u64 time_seq) btrfs_next_old_item() argument
|