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