btrfs: do not commit logs and transactions during link and rename operations
[linux-2.6-block.git] / fs / btrfs / ordered-data.h
CommitLineData
9888c340 1/* SPDX-License-Identifier: GPL-2.0 */
dc17ff8f
CM
2/*
3 * Copyright (C) 2007 Oracle. All rights reserved.
dc17ff8f
CM
4 */
5
9888c340
DS
6#ifndef BTRFS_ORDERED_DATA_H
7#define BTRFS_ORDERED_DATA_H
dc17ff8f 8
eb84ae03 9/* one of these per inode */
dc17ff8f 10struct btrfs_ordered_inode_tree {
49958fd7 11 spinlock_t lock;
dc17ff8f 12 struct rb_root tree;
e6dcd2dc 13 struct rb_node *last;
dc17ff8f
CM
14};
15
e6dcd2dc 16struct btrfs_ordered_sum {
d20f7043
CM
17 /* bytenr is the start of this extent on disk */
18 u64 bytenr;
19
3edf7d33
CM
20 /*
21 * this is the length in bytes covered by the sums array below.
3edf7d33 22 */
f51a4a18 23 int len;
e6dcd2dc 24 struct list_head list;
f51a4a18 25 /* last field is a variable length array of csums */
1e25a2e3 26 u8 sums[];
e6dcd2dc
CM
27};
28
eb84ae03
CM
29/*
30 * bits for the flags field:
31 *
32 * BTRFS_ORDERED_IO_DONE is set when all of the blocks are written.
33 * It is used to make sure metadata is inserted into the tree only once
34 * per extent.
35 *
36 * BTRFS_ORDERED_COMPLETE is set when the extent is removed from the
37 * rbtree, just before waking any waiters. It is used to indicate the
38 * IO is done and any metadata is inserted into the tree.
39 */
5b840301
DS
40enum {
41 /* set when all the pages are written */
42 BTRFS_ORDERED_IO_DONE,
43 /* set when removed from the tree */
44 BTRFS_ORDERED_COMPLETE,
45 /* set when we want to write in place */
46 BTRFS_ORDERED_NOCOW,
47 /* writing a zlib compressed extent */
48 BTRFS_ORDERED_COMPRESSED,
49 /* set when writing to preallocated extent */
50 BTRFS_ORDERED_PREALLOC,
51 /* set when we're doing DIO with this extent */
52 BTRFS_ORDERED_DIRECT,
53 /* We had an io error when writing this out */
54 BTRFS_ORDERED_IOERR,
5b840301
DS
55 /* Set when we have to truncate an extent */
56 BTRFS_ORDERED_TRUNCATED,
57 /* Regular IO for COW */
58 BTRFS_ORDERED_REGULAR,
59};
1af4a0aa 60
e6dcd2dc 61struct btrfs_ordered_extent {
eb84ae03 62 /* logical offset in the file */
e6dcd2dc 63 u64 file_offset;
eb84ae03 64
bffe633e
OS
65 /*
66 * These fields directly correspond to the same fields in
67 * btrfs_file_extent_item.
68 */
69 u64 disk_bytenr;
70 u64 num_bytes;
71 u64 disk_num_bytes;
c8b97818 72
8b62b72b
CM
73 /* number of bytes that still need writing */
74 u64 bytes_left;
75
b9a8cc5b
MX
76 /*
77 * the end of the ordered extent which is behind it but
78 * didn't update disk_i_size. Please see the comment of
79 * btrfs_ordered_update_i_size();
80 */
81 u64 outstanding_isize;
82
77cef2ec
JB
83 /*
84 * If we get truncated we need to adjust the file extent we enter for
85 * this ordered extent so that we do not expose stale data.
86 */
87 u64 truncated_len;
88
eb84ae03 89 /* flags (described above) */
e6dcd2dc 90 unsigned long flags;
eb84ae03 91
261507a0
LZ
92 /* compression algorithm */
93 int compress_type;
94
7dbeaad0
QW
95 /* Qgroup reserved space */
96 int qgroup_rsv;
97
eb84ae03 98 /* reference count */
e76edab7 99 refcount_t refs;
eb84ae03 100
3eaa2885
CM
101 /* the inode we belong to */
102 struct inode *inode;
103
eb84ae03 104 /* list of checksums for insertion when the extent io is done */
e6dcd2dc 105 struct list_head list;
eb84ae03
CM
106
107 /* used to wait for the BTRFS_ORDERED_COMPLETE bit */
e6dcd2dc 108 wait_queue_head_t wait;
eb84ae03
CM
109
110 /* our friendly rbtree entry */
e6dcd2dc 111 struct rb_node rb_node;
3eaa2885
CM
112
113 /* a per root list of all the pending ordered extents */
114 struct list_head root_extent_list;
5fd02043 115
d458b054 116 struct btrfs_work work;
e6dcd2dc 117
9afab882 118 struct completion completion;
d458b054 119 struct btrfs_work flush_work;
9afab882
MX
120 struct list_head work_list;
121};
e6dcd2dc 122
eb84ae03
CM
123/*
124 * calculates the total size you need to allocate for an ordered sum
125 * structure spanning 'bytes' in the file
126 */
da17066c 127static inline int btrfs_ordered_sum_size(struct btrfs_fs_info *fs_info,
9ba4611a 128 unsigned long bytes)
e6dcd2dc 129{
da17066c 130 int num_sectors = (int)DIV_ROUND_UP(bytes, fs_info->sectorsize);
af89e0dc
NB
131 int csum_size = btrfs_super_csum_size(fs_info->super_copy);
132
133 return sizeof(struct btrfs_ordered_sum) + num_sectors * csum_size;
e6dcd2dc
CM
134}
135
dc17ff8f
CM
136static inline void
137btrfs_ordered_inode_tree_init(struct btrfs_ordered_inode_tree *t)
138{
49958fd7 139 spin_lock_init(&t->lock);
6bef4d31 140 t->tree = RB_ROOT;
e6dcd2dc 141 t->last = NULL;
dc17ff8f
CM
142}
143
143bede5
JM
144void btrfs_put_ordered_extent(struct btrfs_ordered_extent *entry);
145void btrfs_remove_ordered_extent(struct inode *inode,
e6dcd2dc
CM
146 struct btrfs_ordered_extent *entry);
147int btrfs_dec_test_ordered_pending(struct inode *inode,
5a1a3df1 148 struct btrfs_ordered_extent **cached,
5fd02043 149 u64 file_offset, u64 io_size, int uptodate);
7095821e 150int btrfs_dec_test_first_ordered_pending(struct btrfs_inode *inode,
163cf09c 151 struct btrfs_ordered_extent **cached,
5fd02043
JB
152 u64 *file_offset, u64 io_size,
153 int uptodate);
e7fbf604 154int btrfs_add_ordered_extent(struct btrfs_inode *inode, u64 file_offset,
bffe633e
OS
155 u64 disk_bytenr, u64 num_bytes, u64 disk_num_bytes,
156 int type);
c1e09520 157int btrfs_add_ordered_extent_dio(struct btrfs_inode *inode, u64 file_offset,
bffe633e
OS
158 u64 disk_bytenr, u64 num_bytes,
159 u64 disk_num_bytes, int type);
4cc61209 160int btrfs_add_ordered_extent_compress(struct btrfs_inode *inode, u64 file_offset,
bffe633e
OS
161 u64 disk_bytenr, u64 num_bytes,
162 u64 disk_num_bytes, int type,
163 int compress_type);
f9756261 164void btrfs_add_ordered_sum(struct btrfs_ordered_extent *entry,
143bede5 165 struct btrfs_ordered_sum *sum);
c3504372 166struct btrfs_ordered_extent *btrfs_lookup_ordered_extent(struct btrfs_inode *inode,
e6dcd2dc 167 u64 file_offset);
eb84ae03
CM
168void btrfs_start_ordered_extent(struct inode *inode,
169 struct btrfs_ordered_extent *entry, int wait);
0ef8b726 170int btrfs_wait_ordered_range(struct inode *inode, u64 start, u64 len);
e6dcd2dc
CM
171struct btrfs_ordered_extent *
172btrfs_lookup_first_ordered_extent(struct inode * inode, u64 file_offset);
a776c6fa
NB
173struct btrfs_ordered_extent *btrfs_lookup_ordered_range(
174 struct btrfs_inode *inode,
175 u64 file_offset,
176 u64 len);
e4100d98 177int btrfs_find_ordered_sum(struct inode *inode, u64 offset, u64 disk_bytenr,
1e25a2e3 178 u8 *sum, int len);
6374e57a 179u64 btrfs_wait_ordered_extents(struct btrfs_root *root, u64 nr,
578def7c 180 const u64 range_start, const u64 range_len);
042528f8 181void btrfs_wait_ordered_roots(struct btrfs_fs_info *fs_info, u64 nr,
578def7c 182 const u64 range_start, const u64 range_len);
b272ae22 183void btrfs_lock_and_flush_ordered_range(struct btrfs_inode *inode, u64 start,
ffa87214
NB
184 u64 end,
185 struct extent_state **cached_state);
6352b91d 186int __init ordered_data_init(void);
e67c718b 187void __cold ordered_data_exit(void);
9888c340 188
dc17ff8f 189#endif