| /kernel/linux/linux-5.10/fs/btrfs/ |
| H A D | tree-log.c | 3585 struct btrfs_key min_key; in log_dir_items() local
3598 min_key.objectid = ino; in log_dir_items()
3599 min_key.type = key_type; in log_dir_items()
3600 min_key.offset = min_offset; in log_dir_items()
3602 ret = btrfs_search_forward(root, &min_key, path, trans->transid); in log_dir_items()
3608 if (ret != 0 || min_key.objectid != ino || min_key.type != key_type) { in log_dir_items()
3609 min_key.objectid = ino; in log_dir_items()
3610 min_key.type = key_type; in log_dir_items()
3611 min_key in log_dir_items()
3792 u64 min_key; log_directory_changes() local
5095 copy_inode_items_to_log(struct btrfs_trans_handle *trans, struct btrfs_inode *inode, struct btrfs_key *min_key, const struct btrfs_key *max_key, struct btrfs_path *path, struct btrfs_path *dst_path, const u64 logged_isize, const bool recursive_logging, const int inode_only, struct btrfs_log_ctx *ctx, bool *need_log_inode_item) copy_inode_items_to_log() argument
5267 struct btrfs_key min_key; btrfs_log_inode() local
5681 struct btrfs_key min_key; log_new_dir_dentries() local
[all...] |
| H A D | ioctl.c | 1104 struct btrfs_key min_key; in find_new_extents() local
1115 min_key.objectid = ino; in find_new_extents()
1116 min_key.type = BTRFS_EXTENT_DATA_KEY; in find_new_extents()
1117 min_key.offset = *off; in find_new_extents()
1120 ret = btrfs_search_forward(root, &min_key, path, newer_than); in find_new_extents()
1124 if (min_key.objectid != ino) in find_new_extents()
1126 if (min_key.type != BTRFS_EXTENT_DATA_KEY) in find_new_extents()
1136 check_defrag_in_cache(inode, min_key.offset, thresh)) { in find_new_extents()
1137 *off = min_key.offset; in find_new_extents()
1144 btrfs_item_key_to_cpu(leaf, &min_key, pat in find_new_extents()
[all...] |
| H A D | relocation.c | 1490 * [min_key, max_key)
1493 struct btrfs_key *min_key, in invalidate_extent_cache()
1502 objectid = min_key->objectid; in invalidate_extent_cache()
1524 if (unlikely(min_key->objectid == ino)) { in invalidate_extent_cache()
1525 if (min_key->type > BTRFS_EXTENT_DATA_KEY) in invalidate_extent_cache()
1527 if (min_key->type < BTRFS_EXTENT_DATA_KEY) in invalidate_extent_cache()
1530 start = min_key->offset; in invalidate_extent_cache()
1492 invalidate_extent_cache(struct btrfs_root *root, struct btrfs_key *min_key, struct btrfs_key *max_key) invalidate_extent_cache() argument
|
| H A D | ctree.c | 5237 * A helper function to walk down the tree starting at min_key, and looking
5242 * into min_key, so you can call btrfs_search_slot with cow=1 on the
5255 int btrfs_search_forward(struct btrfs_root *root, struct btrfs_key *min_key, in btrfs_search_forward() argument
5283 sret = btrfs_bin_search(cur, min_key, &slot); in btrfs_search_forward()
5322 sret = btrfs_find_next_key(root, path, min_key, level, in btrfs_search_forward()
5356 memcpy(min_key, &found_key, sizeof(found_key)); in btrfs_search_forward()
|
| H A D | ctree.h | 2705 int btrfs_search_forward(struct btrfs_root *root, struct btrfs_key *min_key,
|
| /kernel/linux/linux-6.6/fs/btrfs/ |
| H A D | tree-log.c | 3756 struct btrfs_key min_key; in log_dir_items() local
3764 min_key.objectid = ino; in log_dir_items()
3765 min_key.type = BTRFS_DIR_INDEX_KEY; in log_dir_items()
3766 min_key.offset = min_offset; in log_dir_items()
3768 ret = btrfs_search_forward(root, &min_key, path, trans->transid); in log_dir_items()
3774 if (ret != 0 || min_key.objectid != ino || in log_dir_items()
3775 min_key.type != BTRFS_DIR_INDEX_KEY) { in log_dir_items()
3776 min_key.objectid = ino; in log_dir_items()
3777 min_key.type = BTRFS_DIR_INDEX_KEY; in log_dir_items()
3778 min_key in log_dir_items()
4012 u64 min_key; log_directory_changes() local
5791 copy_inode_items_to_log(struct btrfs_trans_handle *trans, struct btrfs_inode *inode, struct btrfs_key *min_key, const struct btrfs_key *max_key, struct btrfs_path *path, struct btrfs_path *dst_path, const u64 logged_isize, const int inode_only, struct btrfs_log_ctx *ctx, bool *need_log_inode_item) copy_inode_items_to_log() argument
6335 struct btrfs_key min_key; btrfs_log_inode() local
[all...] |
| H A D | relocation.c | 1518 * [min_key, max_key)
1521 struct btrfs_key *min_key, in invalidate_extent_cache()
1530 objectid = min_key->objectid; in invalidate_extent_cache()
1554 if (unlikely(min_key->objectid == ino)) { in invalidate_extent_cache()
1555 if (min_key->type > BTRFS_EXTENT_DATA_KEY) in invalidate_extent_cache()
1557 if (min_key->type < BTRFS_EXTENT_DATA_KEY) in invalidate_extent_cache()
1560 start = min_key->offset; in invalidate_extent_cache()
1520 invalidate_extent_cache(struct btrfs_root *root, struct btrfs_key *min_key, struct btrfs_key *max_key) invalidate_extent_cache() argument
|
| H A D | ctree.h | 528 int btrfs_search_forward(struct btrfs_root *root, struct btrfs_key *min_key,
|
| H A D | ctree.c | 4720 * A helper function to walk down the tree starting at min_key, and looking
4725 * into min_key, so you can call btrfs_search_slot with cow=1 on the
4738 int btrfs_search_forward(struct btrfs_root *root, struct btrfs_key *min_key, in btrfs_search_forward() argument
4767 sret = btrfs_bin_search(cur, 0, min_key, &slot); in btrfs_search_forward()
4805 sret = btrfs_find_next_key(root, path, min_key, level, in btrfs_search_forward()
4837 memcpy(min_key, &found_key, sizeof(found_key)); in btrfs_search_forward()
|
| /kernel/linux/linux-5.10/fs/ubifs/ |
| H A D | replay.c | 184 union ubifs_key min_key, max_key; in trun_remove_range() local
197 data_key_init(c, &min_key, ino, min_blk); in trun_remove_range()
200 return ubifs_tnc_remove_range(c, &min_key, &max_key); in trun_remove_range()
|
| /kernel/linux/linux-6.6/fs/ubifs/ |
| H A D | replay.c | 184 union ubifs_key min_key, max_key; in trun_remove_range() local
197 data_key_init(c, &min_key, ino, min_blk); in trun_remove_range()
200 return ubifs_tnc_remove_range(c, &min_key, &max_key); in trun_remove_range()
|