]> git.proxmox.com Git - mirror_ubuntu-jammy-kernel.git/blame - fs/btrfs/ordered-data.h
Merge tag 'for-5.4/io_uring-2019-09-27' of git://git.kernel.dk/linux-block
[mirror_ubuntu-jammy-kernel.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,
55 /*
56 * indicates whether this ordered extent has done its due diligence in
57 * updating the isize
58 */
59 BTRFS_ORDERED_UPDATED_ISIZE,
60 /* Set when we have to truncate an extent */
61 BTRFS_ORDERED_TRUNCATED,
62 /* Regular IO for COW */
63 BTRFS_ORDERED_REGULAR,
64};
1af4a0aa 65
e6dcd2dc 66struct btrfs_ordered_extent {
eb84ae03 67 /* logical offset in the file */
e6dcd2dc 68 u64 file_offset;
eb84ae03
CM
69
70 /* disk byte number */
e6dcd2dc 71 u64 start;
eb84ae03 72
c8b97818 73 /* ram length of the extent in bytes */
e6dcd2dc 74 u64 len;
eb84ae03 75
c8b97818
CM
76 /* extent length on disk */
77 u64 disk_len;
78
8b62b72b
CM
79 /* number of bytes that still need writing */
80 u64 bytes_left;
81
b9a8cc5b
MX
82 /*
83 * the end of the ordered extent which is behind it but
84 * didn't update disk_i_size. Please see the comment of
85 * btrfs_ordered_update_i_size();
86 */
87 u64 outstanding_isize;
88
77cef2ec
JB
89 /*
90 * If we get truncated we need to adjust the file extent we enter for
91 * this ordered extent so that we do not expose stale data.
92 */
93 u64 truncated_len;
94
eb84ae03 95 /* flags (described above) */
e6dcd2dc 96 unsigned long flags;
eb84ae03 97
261507a0
LZ
98 /* compression algorithm */
99 int compress_type;
100
eb84ae03 101 /* reference count */
e76edab7 102 refcount_t refs;
eb84ae03 103
3eaa2885
CM
104 /* the inode we belong to */
105 struct inode *inode;
106
eb84ae03 107 /* list of checksums for insertion when the extent io is done */
e6dcd2dc 108 struct list_head list;
eb84ae03 109
2ab28f32
JB
110 /* If we need to wait on this to be done */
111 struct list_head log_list;
112
50d9aa99
JB
113 /* If the transaction needs to wait on this ordered extent */
114 struct list_head trans_list;
115
eb84ae03 116 /* used to wait for the BTRFS_ORDERED_COMPLETE bit */
e6dcd2dc 117 wait_queue_head_t wait;
eb84ae03
CM
118
119 /* our friendly rbtree entry */
e6dcd2dc 120 struct rb_node rb_node;
3eaa2885
CM
121
122 /* a per root list of all the pending ordered extents */
123 struct list_head root_extent_list;
5fd02043 124
d458b054 125 struct btrfs_work work;
e6dcd2dc 126
9afab882 127 struct completion completion;
d458b054 128 struct btrfs_work flush_work;
9afab882
MX
129 struct list_head work_list;
130};
e6dcd2dc 131
eb84ae03
CM
132/*
133 * calculates the total size you need to allocate for an ordered sum
134 * structure spanning 'bytes' in the file
135 */
da17066c 136static inline int btrfs_ordered_sum_size(struct btrfs_fs_info *fs_info,
9ba4611a 137 unsigned long bytes)
e6dcd2dc 138{
da17066c 139 int num_sectors = (int)DIV_ROUND_UP(bytes, fs_info->sectorsize);
af89e0dc
NB
140 int csum_size = btrfs_super_csum_size(fs_info->super_copy);
141
142 return sizeof(struct btrfs_ordered_sum) + num_sectors * csum_size;
e6dcd2dc
CM
143}
144
dc17ff8f
CM
145static inline void
146btrfs_ordered_inode_tree_init(struct btrfs_ordered_inode_tree *t)
147{
49958fd7 148 spin_lock_init(&t->lock);
6bef4d31 149 t->tree = RB_ROOT;
e6dcd2dc 150 t->last = NULL;
dc17ff8f
CM
151}
152
143bede5
JM
153void btrfs_put_ordered_extent(struct btrfs_ordered_extent *entry);
154void btrfs_remove_ordered_extent(struct inode *inode,
e6dcd2dc
CM
155 struct btrfs_ordered_extent *entry);
156int btrfs_dec_test_ordered_pending(struct inode *inode,
5a1a3df1 157 struct btrfs_ordered_extent **cached,
5fd02043 158 u64 file_offset, u64 io_size, int uptodate);
163cf09c
CM
159int btrfs_dec_test_first_ordered_pending(struct inode *inode,
160 struct btrfs_ordered_extent **cached,
5fd02043
JB
161 u64 *file_offset, u64 io_size,
162 int uptodate);
e6dcd2dc 163int btrfs_add_ordered_extent(struct inode *inode, u64 file_offset,
4b46fce2
JB
164 u64 start, u64 len, u64 disk_len, int type);
165int btrfs_add_ordered_extent_dio(struct inode *inode, u64 file_offset,
166 u64 start, u64 len, u64 disk_len, int type);
261507a0
LZ
167int btrfs_add_ordered_extent_compress(struct inode *inode, u64 file_offset,
168 u64 start, u64 len, u64 disk_len,
169 int type, int compress_type);
f9756261 170void btrfs_add_ordered_sum(struct btrfs_ordered_extent *entry,
143bede5 171 struct btrfs_ordered_sum *sum);
e6dcd2dc
CM
172struct btrfs_ordered_extent *btrfs_lookup_ordered_extent(struct inode *inode,
173 u64 file_offset);
eb84ae03
CM
174void btrfs_start_ordered_extent(struct inode *inode,
175 struct btrfs_ordered_extent *entry, int wait);
0ef8b726 176int btrfs_wait_ordered_range(struct inode *inode, u64 start, u64 len);
e6dcd2dc
CM
177struct btrfs_ordered_extent *
178btrfs_lookup_first_ordered_extent(struct inode * inode, u64 file_offset);
a776c6fa
NB
179struct btrfs_ordered_extent *btrfs_lookup_ordered_range(
180 struct btrfs_inode *inode,
181 u64 file_offset,
182 u64 len);
c2167754 183int btrfs_ordered_update_i_size(struct inode *inode, u64 offset,
dbe674a9 184 struct btrfs_ordered_extent *ordered);
e4100d98 185int btrfs_find_ordered_sum(struct inode *inode, u64 offset, u64 disk_bytenr,
1e25a2e3 186 u8 *sum, int len);
6374e57a 187u64 btrfs_wait_ordered_extents(struct btrfs_root *root, u64 nr,
578def7c 188 const u64 range_start, const u64 range_len);
6374e57a 189u64 btrfs_wait_ordered_roots(struct btrfs_fs_info *fs_info, u64 nr,
578def7c 190 const u64 range_start, const u64 range_len);
ffa87214
NB
191void btrfs_lock_and_flush_ordered_range(struct extent_io_tree *tree,
192 struct btrfs_inode *inode, u64 start,
193 u64 end,
194 struct extent_state **cached_state);
6352b91d 195int __init ordered_data_init(void);
e67c718b 196void __cold ordered_data_exit(void);
9888c340 197
dc17ff8f 198#endif