Loading...
1/*
2 * Copyright (C) 2008 Oracle. All rights reserved.
3 *
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public
6 * License v2 as published by the Free Software Foundation.
7 *
8 * This program is distributed in the hope that it will be useful,
9 * but WITHOUT ANY WARRANTY; without even the implied warranty of
10 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
11 * General Public License for more details.
12 *
13 * You should have received a copy of the GNU General Public
14 * License along with this program; if not, write to the
15 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
16 * Boston, MA 021110-1307, USA.
17 */
18
19#ifndef __TREE_LOG_
20#define __TREE_LOG_
21
22#include "ctree.h"
23#include "transaction.h"
24
25/* return value for btrfs_log_dentry_safe that means we don't need to log it at all */
26#define BTRFS_NO_LOG_SYNC 256
27
28struct btrfs_log_ctx {
29 int log_ret;
30 int log_transid;
31 int io_err;
32 bool log_new_dentries;
33 struct inode *inode;
34 struct list_head list;
35};
36
37static inline void btrfs_init_log_ctx(struct btrfs_log_ctx *ctx,
38 struct inode *inode)
39{
40 ctx->log_ret = 0;
41 ctx->log_transid = 0;
42 ctx->io_err = 0;
43 ctx->log_new_dentries = false;
44 ctx->inode = inode;
45 INIT_LIST_HEAD(&ctx->list);
46}
47
48static inline void btrfs_set_log_full_commit(struct btrfs_fs_info *fs_info,
49 struct btrfs_trans_handle *trans)
50{
51 ACCESS_ONCE(fs_info->last_trans_log_full_commit) = trans->transid;
52}
53
54static inline int btrfs_need_log_full_commit(struct btrfs_fs_info *fs_info,
55 struct btrfs_trans_handle *trans)
56{
57 return ACCESS_ONCE(fs_info->last_trans_log_full_commit) ==
58 trans->transid;
59}
60
61int btrfs_sync_log(struct btrfs_trans_handle *trans,
62 struct btrfs_root *root, struct btrfs_log_ctx *ctx);
63int btrfs_free_log(struct btrfs_trans_handle *trans, struct btrfs_root *root);
64int btrfs_free_log_root_tree(struct btrfs_trans_handle *trans,
65 struct btrfs_fs_info *fs_info);
66int btrfs_recover_log_trees(struct btrfs_root *tree_root);
67int btrfs_log_dentry_safe(struct btrfs_trans_handle *trans,
68 struct btrfs_root *root, struct dentry *dentry,
69 const loff_t start,
70 const loff_t end,
71 struct btrfs_log_ctx *ctx);
72int btrfs_del_dir_entries_in_log(struct btrfs_trans_handle *trans,
73 struct btrfs_root *root,
74 const char *name, int name_len,
75 struct inode *dir, u64 index);
76int btrfs_del_inode_ref_in_log(struct btrfs_trans_handle *trans,
77 struct btrfs_root *root,
78 const char *name, int name_len,
79 struct inode *inode, u64 dirid);
80void btrfs_end_log_trans(struct btrfs_root *root);
81int btrfs_pin_log_trans(struct btrfs_root *root);
82void btrfs_record_unlink_dir(struct btrfs_trans_handle *trans,
83 struct inode *dir, struct inode *inode,
84 int for_rename);
85void btrfs_record_snapshot_destroy(struct btrfs_trans_handle *trans,
86 struct inode *dir);
87int btrfs_log_new_name(struct btrfs_trans_handle *trans,
88 struct inode *inode, struct inode *old_dir,
89 struct dentry *parent);
90#endif
1/* SPDX-License-Identifier: GPL-2.0 */
2/*
3 * Copyright (C) 2008 Oracle. All rights reserved.
4 */
5
6#ifndef BTRFS_TREE_LOG_H
7#define BTRFS_TREE_LOG_H
8
9#include "ctree.h"
10#include "transaction.h"
11
12/* return value for btrfs_log_dentry_safe that means we don't need to log it at all */
13#define BTRFS_NO_LOG_SYNC 256
14
15struct btrfs_log_ctx {
16 int log_ret;
17 int log_transid;
18 bool log_new_dentries;
19 bool logging_new_name;
20 struct inode *inode;
21 struct list_head list;
22 /* Only used for fast fsyncs. */
23 struct list_head ordered_extents;
24};
25
26static inline void btrfs_init_log_ctx(struct btrfs_log_ctx *ctx,
27 struct inode *inode)
28{
29 ctx->log_ret = 0;
30 ctx->log_transid = 0;
31 ctx->log_new_dentries = false;
32 ctx->logging_new_name = false;
33 ctx->inode = inode;
34 INIT_LIST_HEAD(&ctx->list);
35 INIT_LIST_HEAD(&ctx->ordered_extents);
36}
37
38static inline void btrfs_release_log_ctx_extents(struct btrfs_log_ctx *ctx)
39{
40 struct btrfs_ordered_extent *ordered;
41 struct btrfs_ordered_extent *tmp;
42
43 ASSERT(inode_is_locked(ctx->inode));
44
45 list_for_each_entry_safe(ordered, tmp, &ctx->ordered_extents, log_list) {
46 list_del_init(&ordered->log_list);
47 btrfs_put_ordered_extent(ordered);
48 }
49}
50
51static inline void btrfs_set_log_full_commit(struct btrfs_trans_handle *trans)
52{
53 WRITE_ONCE(trans->fs_info->last_trans_log_full_commit, trans->transid);
54}
55
56static inline int btrfs_need_log_full_commit(struct btrfs_trans_handle *trans)
57{
58 return READ_ONCE(trans->fs_info->last_trans_log_full_commit) ==
59 trans->transid;
60}
61
62int btrfs_sync_log(struct btrfs_trans_handle *trans,
63 struct btrfs_root *root, struct btrfs_log_ctx *ctx);
64int btrfs_free_log(struct btrfs_trans_handle *trans, struct btrfs_root *root);
65int btrfs_free_log_root_tree(struct btrfs_trans_handle *trans,
66 struct btrfs_fs_info *fs_info);
67int btrfs_recover_log_trees(struct btrfs_root *tree_root);
68int btrfs_log_dentry_safe(struct btrfs_trans_handle *trans,
69 struct dentry *dentry,
70 struct btrfs_log_ctx *ctx);
71int btrfs_del_dir_entries_in_log(struct btrfs_trans_handle *trans,
72 struct btrfs_root *root,
73 const char *name, int name_len,
74 struct btrfs_inode *dir, u64 index);
75int btrfs_del_inode_ref_in_log(struct btrfs_trans_handle *trans,
76 struct btrfs_root *root,
77 const char *name, int name_len,
78 struct btrfs_inode *inode, u64 dirid);
79void btrfs_end_log_trans(struct btrfs_root *root);
80void btrfs_pin_log_trans(struct btrfs_root *root);
81void btrfs_record_unlink_dir(struct btrfs_trans_handle *trans,
82 struct btrfs_inode *dir, struct btrfs_inode *inode,
83 int for_rename);
84void btrfs_record_snapshot_destroy(struct btrfs_trans_handle *trans,
85 struct btrfs_inode *dir);
86void btrfs_log_new_name(struct btrfs_trans_handle *trans,
87 struct btrfs_inode *inode, struct btrfs_inode *old_dir,
88 struct dentry *parent);
89
90#endif