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 */ | |
5fd02043 | 72 | |
e6dcd2dc | 73 | struct btrfs_ordered_extent { |
eb84ae03 | 74 | /* logical offset in the file */ |
e6dcd2dc | 75 | u64 file_offset; |
eb84ae03 CM |
76 | |
77 | /* disk byte number */ | |
e6dcd2dc | 78 | u64 start; |
eb84ae03 | 79 | |
c8b97818 | 80 | /* ram length of the extent in bytes */ |
e6dcd2dc | 81 | u64 len; |
eb84ae03 | 82 | |
c8b97818 CM |
83 | /* extent length on disk */ |
84 | u64 disk_len; | |
85 | ||
8b62b72b CM |
86 | /* number of bytes that still need writing */ |
87 | u64 bytes_left; | |
88 | ||
2ab28f32 JB |
89 | /* number of bytes that still need csumming */ |
90 | u64 csum_bytes_left; | |
91 | ||
b9a8cc5b MX |
92 | /* |
93 | * the end of the ordered extent which is behind it but | |
94 | * didn't update disk_i_size. Please see the comment of | |
95 | * btrfs_ordered_update_i_size(); | |
96 | */ | |
97 | u64 outstanding_isize; | |
98 | ||
eb84ae03 | 99 | /* flags (described above) */ |
e6dcd2dc | 100 | unsigned long flags; |
eb84ae03 | 101 | |
261507a0 LZ |
102 | /* compression algorithm */ |
103 | int compress_type; | |
104 | ||
eb84ae03 | 105 | /* reference count */ |
e6dcd2dc | 106 | atomic_t refs; |
eb84ae03 | 107 | |
3eaa2885 CM |
108 | /* the inode we belong to */ |
109 | struct inode *inode; | |
110 | ||
eb84ae03 | 111 | /* list of checksums for insertion when the extent io is done */ |
e6dcd2dc | 112 | struct list_head list; |
eb84ae03 | 113 | |
2ab28f32 JB |
114 | /* If we need to wait on this to be done */ |
115 | struct list_head log_list; | |
116 | ||
eb84ae03 | 117 | /* used to wait for the BTRFS_ORDERED_COMPLETE bit */ |
e6dcd2dc | 118 | wait_queue_head_t wait; |
eb84ae03 CM |
119 | |
120 | /* our friendly rbtree entry */ | |
e6dcd2dc | 121 | struct rb_node rb_node; |
3eaa2885 CM |
122 | |
123 | /* a per root list of all the pending ordered extents */ | |
124 | struct list_head root_extent_list; | |
5fd02043 JB |
125 | |
126 | struct btrfs_work work; | |
e6dcd2dc | 127 | |
9afab882 MX |
128 | struct completion completion; |
129 | struct btrfs_work flush_work; | |
130 | struct list_head work_list; | |
131 | }; | |
e6dcd2dc | 132 | |
eb84ae03 CM |
133 | /* |
134 | * calculates the total size you need to allocate for an ordered sum | |
135 | * structure spanning 'bytes' in the file | |
136 | */ | |
9ba4611a CM |
137 | static inline int btrfs_ordered_sum_size(struct btrfs_root *root, |
138 | unsigned long bytes) | |
e6dcd2dc | 139 | { |
f51a4a18 MX |
140 | int num_sectors = (int)DIV_ROUND_UP(bytes, root->sectorsize); |
141 | return sizeof(struct btrfs_ordered_sum) + num_sectors * sizeof(u32); | |
e6dcd2dc CM |
142 | } |
143 | ||
dc17ff8f CM |
144 | static inline void |
145 | btrfs_ordered_inode_tree_init(struct btrfs_ordered_inode_tree *t) | |
146 | { | |
49958fd7 | 147 | spin_lock_init(&t->lock); |
6bef4d31 | 148 | t->tree = RB_ROOT; |
e6dcd2dc | 149 | t->last = NULL; |
dc17ff8f CM |
150 | } |
151 | ||
143bede5 JM |
152 | void btrfs_put_ordered_extent(struct btrfs_ordered_extent *entry); |
153 | void btrfs_remove_ordered_extent(struct inode *inode, | |
e6dcd2dc CM |
154 | struct btrfs_ordered_extent *entry); |
155 | int btrfs_dec_test_ordered_pending(struct inode *inode, | |
5a1a3df1 | 156 | struct btrfs_ordered_extent **cached, |
5fd02043 | 157 | u64 file_offset, u64 io_size, int uptodate); |
163cf09c CM |
158 | int btrfs_dec_test_first_ordered_pending(struct inode *inode, |
159 | struct btrfs_ordered_extent **cached, | |
5fd02043 JB |
160 | u64 *file_offset, u64 io_size, |
161 | int uptodate); | |
e6dcd2dc | 162 | int btrfs_add_ordered_extent(struct inode *inode, u64 file_offset, |
4b46fce2 JB |
163 | u64 start, u64 len, u64 disk_len, int type); |
164 | int btrfs_add_ordered_extent_dio(struct inode *inode, u64 file_offset, | |
165 | u64 start, u64 len, u64 disk_len, int type); | |
261507a0 LZ |
166 | int btrfs_add_ordered_extent_compress(struct inode *inode, u64 file_offset, |
167 | u64 start, u64 len, u64 disk_len, | |
168 | int type, int compress_type); | |
143bede5 JM |
169 | void btrfs_add_ordered_sum(struct inode *inode, |
170 | struct btrfs_ordered_extent *entry, | |
171 | struct btrfs_ordered_sum *sum); | |
e6dcd2dc CM |
172 | struct btrfs_ordered_extent *btrfs_lookup_ordered_extent(struct inode *inode, |
173 | u64 file_offset); | |
eb84ae03 CM |
174 | void btrfs_start_ordered_extent(struct inode *inode, |
175 | struct btrfs_ordered_extent *entry, int wait); | |
143bede5 | 176 | void btrfs_wait_ordered_range(struct inode *inode, u64 start, u64 len); |
e6dcd2dc CM |
177 | struct btrfs_ordered_extent * |
178 | btrfs_lookup_first_ordered_extent(struct inode * inode, u64 file_offset); | |
4b46fce2 JB |
179 | struct btrfs_ordered_extent *btrfs_lookup_ordered_range(struct inode *inode, |
180 | u64 file_offset, | |
181 | u64 len); | |
c2167754 | 182 | int btrfs_ordered_update_i_size(struct inode *inode, u64 offset, |
dbe674a9 | 183 | struct btrfs_ordered_extent *ordered); |
e4100d98 MX |
184 | int btrfs_find_ordered_sum(struct inode *inode, u64 offset, u64 disk_bytenr, |
185 | u32 *sum, int len); | |
569e0f35 JB |
186 | int btrfs_run_ordered_operations(struct btrfs_trans_handle *trans, |
187 | struct btrfs_root *root, int wait); | |
143bede5 JM |
188 | void btrfs_add_ordered_operation(struct btrfs_trans_handle *trans, |
189 | struct btrfs_root *root, | |
190 | struct inode *inode); | |
6bbe3a9c | 191 | void btrfs_wait_ordered_extents(struct btrfs_root *root, int delay_iput); |
199c2a9c MX |
192 | void btrfs_wait_all_ordered_extents(struct btrfs_fs_info *fs_info, |
193 | int delay_iput); | |
2ab28f32 JB |
194 | void btrfs_get_logged_extents(struct btrfs_root *log, struct inode *inode); |
195 | void btrfs_wait_logged_extents(struct btrfs_root *log, u64 transid); | |
196 | void btrfs_free_logged_extents(struct btrfs_root *log, u64 transid); | |
6352b91d MX |
197 | int __init ordered_data_init(void); |
198 | void ordered_data_exit(void); | |
dc17ff8f | 199 | #endif |