Commit | Line | Data |
---|---|---|
dc17ff8f CM |
1 | /* |
2 | * Copyright (C) 2007 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 __BTRFS_ORDERED_DATA__ | |
20 | #define __BTRFS_ORDERED_DATA__ | |
21 | ||
eb84ae03 | 22 | /* one of these per inode */ |
dc17ff8f | 23 | struct btrfs_ordered_inode_tree { |
49958fd7 | 24 | spinlock_t lock; |
dc17ff8f | 25 | struct rb_root tree; |
e6dcd2dc | 26 | struct rb_node *last; |
dc17ff8f CM |
27 | }; |
28 | ||
eb84ae03 CM |
29 | /* |
30 | * these are used to collect checksums done just before bios submission. | |
31 | * They are attached via a list into the ordered extent, and | |
32 | * checksum items are inserted into the tree after all the blocks in | |
33 | * the ordered extent are on disk | |
34 | */ | |
e6dcd2dc | 35 | struct btrfs_sector_sum { |
d20f7043 CM |
36 | /* bytenr on disk */ |
37 | u64 bytenr; | |
e6dcd2dc CM |
38 | u32 sum; |
39 | }; | |
40 | ||
41 | struct btrfs_ordered_sum { | |
d20f7043 CM |
42 | /* bytenr is the start of this extent on disk */ |
43 | u64 bytenr; | |
44 | ||
3edf7d33 CM |
45 | /* |
46 | * this is the length in bytes covered by the sums array below. | |
3edf7d33 CM |
47 | */ |
48 | unsigned long len; | |
e6dcd2dc | 49 | struct list_head list; |
eb84ae03 | 50 | /* last field is a variable length array of btrfs_sector_sums */ |
ed98b56a | 51 | struct btrfs_sector_sum sums[]; |
e6dcd2dc CM |
52 | }; |
53 | ||
eb84ae03 CM |
54 | /* |
55 | * bits for the flags field: | |
56 | * | |
57 | * BTRFS_ORDERED_IO_DONE is set when all of the blocks are written. | |
58 | * It is used to make sure metadata is inserted into the tree only once | |
59 | * per extent. | |
60 | * | |
61 | * BTRFS_ORDERED_COMPLETE is set when the extent is removed from the | |
62 | * rbtree, just before waking any waiters. It is used to indicate the | |
63 | * IO is done and any metadata is inserted into the tree. | |
64 | */ | |
e6dcd2dc | 65 | #define BTRFS_ORDERED_IO_DONE 0 /* set when all the pages are written */ |
eb84ae03 | 66 | |
e6dcd2dc | 67 | #define BTRFS_ORDERED_COMPLETE 1 /* set when removed from the tree */ |
e6dcd2dc | 68 | |
7ea394f1 YZ |
69 | #define BTRFS_ORDERED_NOCOW 2 /* set when we want to write in place */ |
70 | ||
261507a0 | 71 | #define BTRFS_ORDERED_COMPRESSED 3 /* writing a zlib compressed extent */ |
c8b97818 | 72 | |
d899e052 YZ |
73 | #define BTRFS_ORDERED_PREALLOC 4 /* set when writing to prealloced extent */ |
74 | ||
4b46fce2 JB |
75 | #define BTRFS_ORDERED_DIRECT 5 /* set when we're doing DIO with this extent */ |
76 | ||
5fd02043 JB |
77 | #define BTRFS_ORDERED_IOERR 6 /* We had an io error when writing this out */ |
78 | ||
48fc7f7e | 79 | #define BTRFS_ORDERED_UPDATED_ISIZE 7 /* indicates whether this ordered extent |
5fd02043 JB |
80 | * has done its due diligence in updating |
81 | * the isize. */ | |
2ab28f32 JB |
82 | #define BTRFS_ORDERED_LOGGED_CSUM 8 /* We've logged the csums on this ordered |
83 | ordered extent */ | |
5fd02043 | 84 | |
e6dcd2dc | 85 | struct btrfs_ordered_extent { |
eb84ae03 | 86 | /* logical offset in the file */ |
e6dcd2dc | 87 | u64 file_offset; |
eb84ae03 CM |
88 | |
89 | /* disk byte number */ | |
e6dcd2dc | 90 | u64 start; |
eb84ae03 | 91 | |
c8b97818 | 92 | /* ram length of the extent in bytes */ |
e6dcd2dc | 93 | u64 len; |
eb84ae03 | 94 | |
c8b97818 CM |
95 | /* extent length on disk */ |
96 | u64 disk_len; | |
97 | ||
8b62b72b CM |
98 | /* number of bytes that still need writing */ |
99 | u64 bytes_left; | |
100 | ||
2ab28f32 JB |
101 | /* number of bytes that still need csumming */ |
102 | u64 csum_bytes_left; | |
103 | ||
b9a8cc5b MX |
104 | /* |
105 | * the end of the ordered extent which is behind it but | |
106 | * didn't update disk_i_size. Please see the comment of | |
107 | * btrfs_ordered_update_i_size(); | |
108 | */ | |
109 | u64 outstanding_isize; | |
110 | ||
eb84ae03 | 111 | /* flags (described above) */ |
e6dcd2dc | 112 | unsigned long flags; |
eb84ae03 | 113 | |
261507a0 LZ |
114 | /* compression algorithm */ |
115 | int compress_type; | |
116 | ||
eb84ae03 | 117 | /* reference count */ |
e6dcd2dc | 118 | atomic_t refs; |
eb84ae03 | 119 | |
3eaa2885 CM |
120 | /* the inode we belong to */ |
121 | struct inode *inode; | |
122 | ||
eb84ae03 | 123 | /* list of checksums for insertion when the extent io is done */ |
e6dcd2dc | 124 | struct list_head list; |
eb84ae03 | 125 | |
2ab28f32 JB |
126 | /* If we need to wait on this to be done */ |
127 | struct list_head log_list; | |
128 | ||
eb84ae03 | 129 | /* used to wait for the BTRFS_ORDERED_COMPLETE bit */ |
e6dcd2dc | 130 | wait_queue_head_t wait; |
eb84ae03 CM |
131 | |
132 | /* our friendly rbtree entry */ | |
e6dcd2dc | 133 | struct rb_node rb_node; |
3eaa2885 CM |
134 | |
135 | /* a per root list of all the pending ordered extents */ | |
136 | struct list_head root_extent_list; | |
5fd02043 JB |
137 | |
138 | struct btrfs_work work; | |
e6dcd2dc | 139 | |
9afab882 MX |
140 | struct completion completion; |
141 | struct btrfs_work flush_work; | |
142 | struct list_head work_list; | |
143 | }; | |
e6dcd2dc | 144 | |
eb84ae03 CM |
145 | /* |
146 | * calculates the total size you need to allocate for an ordered sum | |
147 | * structure spanning 'bytes' in the file | |
148 | */ | |
9ba4611a CM |
149 | static inline int btrfs_ordered_sum_size(struct btrfs_root *root, |
150 | unsigned long bytes) | |
e6dcd2dc CM |
151 | { |
152 | unsigned long num_sectors = (bytes + root->sectorsize - 1) / | |
153 | root->sectorsize; | |
3edf7d33 | 154 | num_sectors++; |
e6dcd2dc CM |
155 | return sizeof(struct btrfs_ordered_sum) + |
156 | num_sectors * sizeof(struct btrfs_sector_sum); | |
157 | } | |
158 | ||
dc17ff8f CM |
159 | static inline void |
160 | btrfs_ordered_inode_tree_init(struct btrfs_ordered_inode_tree *t) | |
161 | { | |
49958fd7 | 162 | spin_lock_init(&t->lock); |
6bef4d31 | 163 | t->tree = RB_ROOT; |
e6dcd2dc | 164 | t->last = NULL; |
dc17ff8f CM |
165 | } |
166 | ||
143bede5 JM |
167 | void btrfs_put_ordered_extent(struct btrfs_ordered_extent *entry); |
168 | void btrfs_remove_ordered_extent(struct inode *inode, | |
e6dcd2dc CM |
169 | struct btrfs_ordered_extent *entry); |
170 | int btrfs_dec_test_ordered_pending(struct inode *inode, | |
5a1a3df1 | 171 | struct btrfs_ordered_extent **cached, |
5fd02043 | 172 | u64 file_offset, u64 io_size, int uptodate); |
163cf09c CM |
173 | int btrfs_dec_test_first_ordered_pending(struct inode *inode, |
174 | struct btrfs_ordered_extent **cached, | |
5fd02043 JB |
175 | u64 *file_offset, u64 io_size, |
176 | int uptodate); | |
e6dcd2dc | 177 | int btrfs_add_ordered_extent(struct inode *inode, u64 file_offset, |
4b46fce2 JB |
178 | u64 start, u64 len, u64 disk_len, int type); |
179 | int btrfs_add_ordered_extent_dio(struct inode *inode, u64 file_offset, | |
180 | u64 start, u64 len, u64 disk_len, int type); | |
261507a0 LZ |
181 | int btrfs_add_ordered_extent_compress(struct inode *inode, u64 file_offset, |
182 | u64 start, u64 len, u64 disk_len, | |
183 | int type, int compress_type); | |
143bede5 JM |
184 | void btrfs_add_ordered_sum(struct inode *inode, |
185 | struct btrfs_ordered_extent *entry, | |
186 | struct btrfs_ordered_sum *sum); | |
e6dcd2dc CM |
187 | struct btrfs_ordered_extent *btrfs_lookup_ordered_extent(struct inode *inode, |
188 | u64 file_offset); | |
eb84ae03 CM |
189 | void btrfs_start_ordered_extent(struct inode *inode, |
190 | struct btrfs_ordered_extent *entry, int wait); | |
143bede5 | 191 | void btrfs_wait_ordered_range(struct inode *inode, u64 start, u64 len); |
e6dcd2dc CM |
192 | struct btrfs_ordered_extent * |
193 | btrfs_lookup_first_ordered_extent(struct inode * inode, u64 file_offset); | |
4b46fce2 JB |
194 | struct btrfs_ordered_extent *btrfs_lookup_ordered_range(struct inode *inode, |
195 | u64 file_offset, | |
196 | u64 len); | |
c2167754 | 197 | int btrfs_ordered_update_i_size(struct inode *inode, u64 offset, |
dbe674a9 | 198 | struct btrfs_ordered_extent *ordered); |
e4100d98 MX |
199 | int btrfs_find_ordered_sum(struct inode *inode, u64 offset, u64 disk_bytenr, |
200 | u32 *sum, int len); | |
569e0f35 JB |
201 | int btrfs_run_ordered_operations(struct btrfs_trans_handle *trans, |
202 | struct btrfs_root *root, int wait); | |
143bede5 JM |
203 | void btrfs_add_ordered_operation(struct btrfs_trans_handle *trans, |
204 | struct btrfs_root *root, | |
205 | struct inode *inode); | |
6bbe3a9c | 206 | void btrfs_wait_ordered_extents(struct btrfs_root *root, int delay_iput); |
199c2a9c MX |
207 | void btrfs_wait_all_ordered_extents(struct btrfs_fs_info *fs_info, |
208 | int delay_iput); | |
2ab28f32 JB |
209 | void btrfs_get_logged_extents(struct btrfs_root *log, struct inode *inode); |
210 | void btrfs_wait_logged_extents(struct btrfs_root *log, u64 transid); | |
211 | void btrfs_free_logged_extents(struct btrfs_root *log, u64 transid); | |
6352b91d MX |
212 | int __init ordered_data_init(void); |
213 | void ordered_data_exit(void); | |
dc17ff8f | 214 | #endif |