Commit | Line | Data |
---|---|---|
6cbd5570 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 | ||
8f18cf13 | 19 | #include <linux/kernel.h> |
065631f6 | 20 | #include <linux/bio.h> |
39279cc3 | 21 | #include <linux/buffer_head.h> |
f2eb0a24 | 22 | #include <linux/file.h> |
39279cc3 CM |
23 | #include <linux/fs.h> |
24 | #include <linux/pagemap.h> | |
25 | #include <linux/highmem.h> | |
26 | #include <linux/time.h> | |
27 | #include <linux/init.h> | |
28 | #include <linux/string.h> | |
39279cc3 CM |
29 | #include <linux/backing-dev.h> |
30 | #include <linux/mpage.h> | |
31 | #include <linux/swap.h> | |
32 | #include <linux/writeback.h> | |
33 | #include <linux/statfs.h> | |
34 | #include <linux/compat.h> | |
9ebefb18 | 35 | #include <linux/bit_spinlock.h> |
5103e947 | 36 | #include <linux/xattr.h> |
33268eaf | 37 | #include <linux/posix_acl.h> |
d899e052 | 38 | #include <linux/falloc.h> |
5a0e3ad6 | 39 | #include <linux/slab.h> |
7a36ddec | 40 | #include <linux/ratelimit.h> |
4b4e25f2 | 41 | #include "compat.h" |
39279cc3 CM |
42 | #include "ctree.h" |
43 | #include "disk-io.h" | |
44 | #include "transaction.h" | |
45 | #include "btrfs_inode.h" | |
46 | #include "ioctl.h" | |
47 | #include "print-tree.h" | |
0b86a832 | 48 | #include "volumes.h" |
e6dcd2dc | 49 | #include "ordered-data.h" |
95819c05 | 50 | #include "xattr.h" |
e02119d5 | 51 | #include "tree-log.h" |
c8b97818 | 52 | #include "compression.h" |
b4ce94de | 53 | #include "locking.h" |
dc89e982 | 54 | #include "free-space-cache.h" |
581bb050 | 55 | #include "inode-map.h" |
39279cc3 CM |
56 | |
57 | struct btrfs_iget_args { | |
58 | u64 ino; | |
59 | struct btrfs_root *root; | |
60 | }; | |
61 | ||
6e1d5dcc AD |
62 | static const struct inode_operations btrfs_dir_inode_operations; |
63 | static const struct inode_operations btrfs_symlink_inode_operations; | |
64 | static const struct inode_operations btrfs_dir_ro_inode_operations; | |
65 | static const struct inode_operations btrfs_special_inode_operations; | |
66 | static const struct inode_operations btrfs_file_inode_operations; | |
7f09410b AD |
67 | static const struct address_space_operations btrfs_aops; |
68 | static const struct address_space_operations btrfs_symlink_aops; | |
828c0950 | 69 | static const struct file_operations btrfs_dir_file_operations; |
d1310b2e | 70 | static struct extent_io_ops btrfs_extent_io_ops; |
39279cc3 CM |
71 | |
72 | static struct kmem_cache *btrfs_inode_cachep; | |
73 | struct kmem_cache *btrfs_trans_handle_cachep; | |
74 | struct kmem_cache *btrfs_transaction_cachep; | |
39279cc3 | 75 | struct kmem_cache *btrfs_path_cachep; |
dc89e982 | 76 | struct kmem_cache *btrfs_free_space_cachep; |
39279cc3 CM |
77 | |
78 | #define S_SHIFT 12 | |
79 | static unsigned char btrfs_type_by_mode[S_IFMT >> S_SHIFT] = { | |
80 | [S_IFREG >> S_SHIFT] = BTRFS_FT_REG_FILE, | |
81 | [S_IFDIR >> S_SHIFT] = BTRFS_FT_DIR, | |
82 | [S_IFCHR >> S_SHIFT] = BTRFS_FT_CHRDEV, | |
83 | [S_IFBLK >> S_SHIFT] = BTRFS_FT_BLKDEV, | |
84 | [S_IFIFO >> S_SHIFT] = BTRFS_FT_FIFO, | |
85 | [S_IFSOCK >> S_SHIFT] = BTRFS_FT_SOCK, | |
86 | [S_IFLNK >> S_SHIFT] = BTRFS_FT_SYMLINK, | |
87 | }; | |
88 | ||
a41ad394 JB |
89 | static int btrfs_setsize(struct inode *inode, loff_t newsize); |
90 | static int btrfs_truncate(struct inode *inode); | |
c8b97818 | 91 | static int btrfs_finish_ordered_io(struct inode *inode, u64 start, u64 end); |
771ed689 CM |
92 | static noinline int cow_file_range(struct inode *inode, |
93 | struct page *locked_page, | |
94 | u64 start, u64 end, int *page_started, | |
95 | unsigned long *nr_written, int unlock); | |
7b128766 | 96 | |
f34f57a3 | 97 | static int btrfs_init_inode_security(struct btrfs_trans_handle *trans, |
2a7dba39 EP |
98 | struct inode *inode, struct inode *dir, |
99 | const struct qstr *qstr) | |
0279b4cd JO |
100 | { |
101 | int err; | |
102 | ||
f34f57a3 | 103 | err = btrfs_init_acl(trans, inode, dir); |
0279b4cd | 104 | if (!err) |
2a7dba39 | 105 | err = btrfs_xattr_security_init(trans, inode, dir, qstr); |
0279b4cd JO |
106 | return err; |
107 | } | |
108 | ||
c8b97818 CM |
109 | /* |
110 | * this does all the hard work for inserting an inline extent into | |
111 | * the btree. The caller should have done a btrfs_drop_extents so that | |
112 | * no overlapping inline items exist in the btree | |
113 | */ | |
d397712b | 114 | static noinline int insert_inline_extent(struct btrfs_trans_handle *trans, |
c8b97818 CM |
115 | struct btrfs_root *root, struct inode *inode, |
116 | u64 start, size_t size, size_t compressed_size, | |
fe3f566c | 117 | int compress_type, |
c8b97818 CM |
118 | struct page **compressed_pages) |
119 | { | |
120 | struct btrfs_key key; | |
121 | struct btrfs_path *path; | |
122 | struct extent_buffer *leaf; | |
123 | struct page *page = NULL; | |
124 | char *kaddr; | |
125 | unsigned long ptr; | |
126 | struct btrfs_file_extent_item *ei; | |
127 | int err = 0; | |
128 | int ret; | |
129 | size_t cur_size = size; | |
130 | size_t datasize; | |
131 | unsigned long offset; | |
c8b97818 | 132 | |
fe3f566c | 133 | if (compressed_size && compressed_pages) |
c8b97818 | 134 | cur_size = compressed_size; |
c8b97818 | 135 | |
d397712b CM |
136 | path = btrfs_alloc_path(); |
137 | if (!path) | |
c8b97818 CM |
138 | return -ENOMEM; |
139 | ||
b9473439 | 140 | path->leave_spinning = 1; |
c8b97818 | 141 | |
33345d01 | 142 | key.objectid = btrfs_ino(inode); |
c8b97818 CM |
143 | key.offset = start; |
144 | btrfs_set_key_type(&key, BTRFS_EXTENT_DATA_KEY); | |
c8b97818 CM |
145 | datasize = btrfs_file_extent_calc_inline_size(cur_size); |
146 | ||
147 | inode_add_bytes(inode, size); | |
148 | ret = btrfs_insert_empty_item(trans, root, path, &key, | |
149 | datasize); | |
150 | BUG_ON(ret); | |
151 | if (ret) { | |
152 | err = ret; | |
c8b97818 CM |
153 | goto fail; |
154 | } | |
155 | leaf = path->nodes[0]; | |
156 | ei = btrfs_item_ptr(leaf, path->slots[0], | |
157 | struct btrfs_file_extent_item); | |
158 | btrfs_set_file_extent_generation(leaf, ei, trans->transid); | |
159 | btrfs_set_file_extent_type(leaf, ei, BTRFS_FILE_EXTENT_INLINE); | |
160 | btrfs_set_file_extent_encryption(leaf, ei, 0); | |
161 | btrfs_set_file_extent_other_encoding(leaf, ei, 0); | |
162 | btrfs_set_file_extent_ram_bytes(leaf, ei, size); | |
163 | ptr = btrfs_file_extent_inline_start(ei); | |
164 | ||
261507a0 | 165 | if (compress_type != BTRFS_COMPRESS_NONE) { |
c8b97818 CM |
166 | struct page *cpage; |
167 | int i = 0; | |
d397712b | 168 | while (compressed_size > 0) { |
c8b97818 | 169 | cpage = compressed_pages[i]; |
5b050f04 | 170 | cur_size = min_t(unsigned long, compressed_size, |
c8b97818 CM |
171 | PAGE_CACHE_SIZE); |
172 | ||
b9473439 | 173 | kaddr = kmap_atomic(cpage, KM_USER0); |
c8b97818 | 174 | write_extent_buffer(leaf, kaddr, ptr, cur_size); |
b9473439 | 175 | kunmap_atomic(kaddr, KM_USER0); |
c8b97818 CM |
176 | |
177 | i++; | |
178 | ptr += cur_size; | |
179 | compressed_size -= cur_size; | |
180 | } | |
181 | btrfs_set_file_extent_compression(leaf, ei, | |
261507a0 | 182 | compress_type); |
c8b97818 CM |
183 | } else { |
184 | page = find_get_page(inode->i_mapping, | |
185 | start >> PAGE_CACHE_SHIFT); | |
186 | btrfs_set_file_extent_compression(leaf, ei, 0); | |
187 | kaddr = kmap_atomic(page, KM_USER0); | |
188 | offset = start & (PAGE_CACHE_SIZE - 1); | |
189 | write_extent_buffer(leaf, kaddr + offset, ptr, size); | |
190 | kunmap_atomic(kaddr, KM_USER0); | |
191 | page_cache_release(page); | |
192 | } | |
193 | btrfs_mark_buffer_dirty(leaf); | |
194 | btrfs_free_path(path); | |
195 | ||
c2167754 YZ |
196 | /* |
197 | * we're an inline extent, so nobody can | |
198 | * extend the file past i_size without locking | |
199 | * a page we already have locked. | |
200 | * | |
201 | * We must do any isize and inode updates | |
202 | * before we unlock the pages. Otherwise we | |
203 | * could end up racing with unlink. | |
204 | */ | |
c8b97818 CM |
205 | BTRFS_I(inode)->disk_i_size = inode->i_size; |
206 | btrfs_update_inode(trans, root, inode); | |
c2167754 | 207 | |
c8b97818 CM |
208 | return 0; |
209 | fail: | |
210 | btrfs_free_path(path); | |
211 | return err; | |
212 | } | |
213 | ||
214 | ||
215 | /* | |
216 | * conditionally insert an inline extent into the file. This | |
217 | * does the checks required to make sure the data is small enough | |
218 | * to fit as an inline extent. | |
219 | */ | |
7f366cfe | 220 | static noinline int cow_file_range_inline(struct btrfs_trans_handle *trans, |
c8b97818 CM |
221 | struct btrfs_root *root, |
222 | struct inode *inode, u64 start, u64 end, | |
fe3f566c | 223 | size_t compressed_size, int compress_type, |
c8b97818 CM |
224 | struct page **compressed_pages) |
225 | { | |
226 | u64 isize = i_size_read(inode); | |
227 | u64 actual_end = min(end + 1, isize); | |
228 | u64 inline_len = actual_end - start; | |
229 | u64 aligned_end = (end + root->sectorsize - 1) & | |
230 | ~((u64)root->sectorsize - 1); | |
231 | u64 hint_byte; | |
232 | u64 data_len = inline_len; | |
233 | int ret; | |
234 | ||
235 | if (compressed_size) | |
236 | data_len = compressed_size; | |
237 | ||
238 | if (start > 0 || | |
70b99e69 | 239 | actual_end >= PAGE_CACHE_SIZE || |
c8b97818 CM |
240 | data_len >= BTRFS_MAX_INLINE_DATA_SIZE(root) || |
241 | (!compressed_size && | |
242 | (actual_end & (root->sectorsize - 1)) == 0) || | |
243 | end + 1 < isize || | |
244 | data_len > root->fs_info->max_inline) { | |
245 | return 1; | |
246 | } | |
247 | ||
920bbbfb | 248 | ret = btrfs_drop_extents(trans, inode, start, aligned_end, |
a1ed835e | 249 | &hint_byte, 1); |
c8b97818 CM |
250 | BUG_ON(ret); |
251 | ||
252 | if (isize > actual_end) | |
253 | inline_len = min_t(u64, isize, actual_end); | |
254 | ret = insert_inline_extent(trans, root, inode, start, | |
255 | inline_len, compressed_size, | |
fe3f566c | 256 | compress_type, compressed_pages); |
c8b97818 | 257 | BUG_ON(ret); |
0ca1f7ce | 258 | btrfs_delalloc_release_metadata(inode, end + 1 - start); |
a1ed835e | 259 | btrfs_drop_extent_cache(inode, start, aligned_end - 1, 0); |
c8b97818 CM |
260 | return 0; |
261 | } | |
262 | ||
771ed689 CM |
263 | struct async_extent { |
264 | u64 start; | |
265 | u64 ram_size; | |
266 | u64 compressed_size; | |
267 | struct page **pages; | |
268 | unsigned long nr_pages; | |
261507a0 | 269 | int compress_type; |
771ed689 CM |
270 | struct list_head list; |
271 | }; | |
272 | ||
273 | struct async_cow { | |
274 | struct inode *inode; | |
275 | struct btrfs_root *root; | |
276 | struct page *locked_page; | |
277 | u64 start; | |
278 | u64 end; | |
279 | struct list_head extents; | |
280 | struct btrfs_work work; | |
281 | }; | |
282 | ||
283 | static noinline int add_async_extent(struct async_cow *cow, | |
284 | u64 start, u64 ram_size, | |
285 | u64 compressed_size, | |
286 | struct page **pages, | |
261507a0 LZ |
287 | unsigned long nr_pages, |
288 | int compress_type) | |
771ed689 CM |
289 | { |
290 | struct async_extent *async_extent; | |
291 | ||
292 | async_extent = kmalloc(sizeof(*async_extent), GFP_NOFS); | |
dac97e51 | 293 | BUG_ON(!async_extent); |
771ed689 CM |
294 | async_extent->start = start; |
295 | async_extent->ram_size = ram_size; | |
296 | async_extent->compressed_size = compressed_size; | |
297 | async_extent->pages = pages; | |
298 | async_extent->nr_pages = nr_pages; | |
261507a0 | 299 | async_extent->compress_type = compress_type; |
771ed689 CM |
300 | list_add_tail(&async_extent->list, &cow->extents); |
301 | return 0; | |
302 | } | |
303 | ||
d352ac68 | 304 | /* |
771ed689 CM |
305 | * we create compressed extents in two phases. The first |
306 | * phase compresses a range of pages that have already been | |
307 | * locked (both pages and state bits are locked). | |
c8b97818 | 308 | * |
771ed689 CM |
309 | * This is done inside an ordered work queue, and the compression |
310 | * is spread across many cpus. The actual IO submission is step | |
311 | * two, and the ordered work queue takes care of making sure that | |
312 | * happens in the same order things were put onto the queue by | |
313 | * writepages and friends. | |
c8b97818 | 314 | * |
771ed689 CM |
315 | * If this code finds it can't get good compression, it puts an |
316 | * entry onto the work queue to write the uncompressed bytes. This | |
317 | * makes sure that both compressed inodes and uncompressed inodes | |
318 | * are written in the same order that pdflush sent them down. | |
d352ac68 | 319 | */ |
771ed689 CM |
320 | static noinline int compress_file_range(struct inode *inode, |
321 | struct page *locked_page, | |
322 | u64 start, u64 end, | |
323 | struct async_cow *async_cow, | |
324 | int *num_added) | |
b888db2b CM |
325 | { |
326 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
327 | struct btrfs_trans_handle *trans; | |
db94535d | 328 | u64 num_bytes; |
db94535d | 329 | u64 blocksize = root->sectorsize; |
c8b97818 | 330 | u64 actual_end; |
42dc7bab | 331 | u64 isize = i_size_read(inode); |
e6dcd2dc | 332 | int ret = 0; |
c8b97818 CM |
333 | struct page **pages = NULL; |
334 | unsigned long nr_pages; | |
335 | unsigned long nr_pages_ret = 0; | |
336 | unsigned long total_compressed = 0; | |
337 | unsigned long total_in = 0; | |
338 | unsigned long max_compressed = 128 * 1024; | |
771ed689 | 339 | unsigned long max_uncompressed = 128 * 1024; |
c8b97818 CM |
340 | int i; |
341 | int will_compress; | |
261507a0 | 342 | int compress_type = root->fs_info->compress_type; |
b888db2b | 343 | |
4cb5300b CM |
344 | /* if this is a small write inside eof, kick off a defragbot */ |
345 | if (end <= BTRFS_I(inode)->disk_i_size && (end - start + 1) < 16 * 1024) | |
346 | btrfs_add_inode_defrag(NULL, inode); | |
347 | ||
42dc7bab | 348 | actual_end = min_t(u64, isize, end + 1); |
c8b97818 CM |
349 | again: |
350 | will_compress = 0; | |
351 | nr_pages = (end >> PAGE_CACHE_SHIFT) - (start >> PAGE_CACHE_SHIFT) + 1; | |
352 | nr_pages = min(nr_pages, (128 * 1024UL) / PAGE_CACHE_SIZE); | |
be20aa9d | 353 | |
f03d9301 CM |
354 | /* |
355 | * we don't want to send crud past the end of i_size through | |
356 | * compression, that's just a waste of CPU time. So, if the | |
357 | * end of the file is before the start of our current | |
358 | * requested range of bytes, we bail out to the uncompressed | |
359 | * cleanup code that can deal with all of this. | |
360 | * | |
361 | * It isn't really the fastest way to fix things, but this is a | |
362 | * very uncommon corner. | |
363 | */ | |
364 | if (actual_end <= start) | |
365 | goto cleanup_and_bail_uncompressed; | |
366 | ||
c8b97818 CM |
367 | total_compressed = actual_end - start; |
368 | ||
369 | /* we want to make sure that amount of ram required to uncompress | |
370 | * an extent is reasonable, so we limit the total size in ram | |
771ed689 CM |
371 | * of a compressed extent to 128k. This is a crucial number |
372 | * because it also controls how easily we can spread reads across | |
373 | * cpus for decompression. | |
374 | * | |
375 | * We also want to make sure the amount of IO required to do | |
376 | * a random read is reasonably small, so we limit the size of | |
377 | * a compressed extent to 128k. | |
c8b97818 CM |
378 | */ |
379 | total_compressed = min(total_compressed, max_uncompressed); | |
db94535d | 380 | num_bytes = (end - start + blocksize) & ~(blocksize - 1); |
be20aa9d | 381 | num_bytes = max(blocksize, num_bytes); |
c8b97818 CM |
382 | total_in = 0; |
383 | ret = 0; | |
db94535d | 384 | |
771ed689 CM |
385 | /* |
386 | * we do compression for mount -o compress and when the | |
387 | * inode has not been flagged as nocompress. This flag can | |
388 | * change at any time if we discover bad compression ratios. | |
c8b97818 | 389 | */ |
6cbff00f | 390 | if (!(BTRFS_I(inode)->flags & BTRFS_INODE_NOCOMPRESS) && |
1e701a32 | 391 | (btrfs_test_opt(root, COMPRESS) || |
75e7cb7f LB |
392 | (BTRFS_I(inode)->force_compress) || |
393 | (BTRFS_I(inode)->flags & BTRFS_INODE_COMPRESS))) { | |
c8b97818 | 394 | WARN_ON(pages); |
cfbc246e | 395 | pages = kzalloc(sizeof(struct page *) * nr_pages, GFP_NOFS); |
dac97e51 | 396 | BUG_ON(!pages); |
c8b97818 | 397 | |
261507a0 LZ |
398 | if (BTRFS_I(inode)->force_compress) |
399 | compress_type = BTRFS_I(inode)->force_compress; | |
400 | ||
401 | ret = btrfs_compress_pages(compress_type, | |
402 | inode->i_mapping, start, | |
403 | total_compressed, pages, | |
404 | nr_pages, &nr_pages_ret, | |
405 | &total_in, | |
406 | &total_compressed, | |
407 | max_compressed); | |
c8b97818 CM |
408 | |
409 | if (!ret) { | |
410 | unsigned long offset = total_compressed & | |
411 | (PAGE_CACHE_SIZE - 1); | |
412 | struct page *page = pages[nr_pages_ret - 1]; | |
413 | char *kaddr; | |
414 | ||
415 | /* zero the tail end of the last page, we might be | |
416 | * sending it down to disk | |
417 | */ | |
418 | if (offset) { | |
419 | kaddr = kmap_atomic(page, KM_USER0); | |
420 | memset(kaddr + offset, 0, | |
421 | PAGE_CACHE_SIZE - offset); | |
422 | kunmap_atomic(kaddr, KM_USER0); | |
423 | } | |
424 | will_compress = 1; | |
425 | } | |
426 | } | |
427 | if (start == 0) { | |
7a7eaa40 | 428 | trans = btrfs_join_transaction(root); |
3612b495 | 429 | BUG_ON(IS_ERR(trans)); |
0ca1f7ce | 430 | trans->block_rsv = &root->fs_info->delalloc_block_rsv; |
771ed689 | 431 | |
c8b97818 | 432 | /* lets try to make an inline extent */ |
771ed689 | 433 | if (ret || total_in < (actual_end - start)) { |
c8b97818 | 434 | /* we didn't compress the entire range, try |
771ed689 | 435 | * to make an uncompressed inline extent. |
c8b97818 CM |
436 | */ |
437 | ret = cow_file_range_inline(trans, root, inode, | |
fe3f566c | 438 | start, end, 0, 0, NULL); |
c8b97818 | 439 | } else { |
771ed689 | 440 | /* try making a compressed inline extent */ |
c8b97818 CM |
441 | ret = cow_file_range_inline(trans, root, inode, |
442 | start, end, | |
fe3f566c LZ |
443 | total_compressed, |
444 | compress_type, pages); | |
c8b97818 CM |
445 | } |
446 | if (ret == 0) { | |
771ed689 CM |
447 | /* |
448 | * inline extent creation worked, we don't need | |
449 | * to create any more async work items. Unlock | |
450 | * and free up our temp pages. | |
451 | */ | |
c8b97818 | 452 | extent_clear_unlock_delalloc(inode, |
a791e35e CM |
453 | &BTRFS_I(inode)->io_tree, |
454 | start, end, NULL, | |
455 | EXTENT_CLEAR_UNLOCK_PAGE | EXTENT_CLEAR_DIRTY | | |
a3429ab7 | 456 | EXTENT_CLEAR_DELALLOC | |
a791e35e | 457 | EXTENT_SET_WRITEBACK | EXTENT_END_WRITEBACK); |
c2167754 YZ |
458 | |
459 | btrfs_end_transaction(trans, root); | |
c8b97818 CM |
460 | goto free_pages_out; |
461 | } | |
c2167754 | 462 | btrfs_end_transaction(trans, root); |
c8b97818 CM |
463 | } |
464 | ||
465 | if (will_compress) { | |
466 | /* | |
467 | * we aren't doing an inline extent round the compressed size | |
468 | * up to a block size boundary so the allocator does sane | |
469 | * things | |
470 | */ | |
471 | total_compressed = (total_compressed + blocksize - 1) & | |
472 | ~(blocksize - 1); | |
473 | ||
474 | /* | |
475 | * one last check to make sure the compression is really a | |
476 | * win, compare the page count read with the blocks on disk | |
477 | */ | |
478 | total_in = (total_in + PAGE_CACHE_SIZE - 1) & | |
479 | ~(PAGE_CACHE_SIZE - 1); | |
480 | if (total_compressed >= total_in) { | |
481 | will_compress = 0; | |
482 | } else { | |
c8b97818 CM |
483 | num_bytes = total_in; |
484 | } | |
485 | } | |
486 | if (!will_compress && pages) { | |
487 | /* | |
488 | * the compression code ran but failed to make things smaller, | |
489 | * free any pages it allocated and our page pointer array | |
490 | */ | |
491 | for (i = 0; i < nr_pages_ret; i++) { | |
70b99e69 | 492 | WARN_ON(pages[i]->mapping); |
c8b97818 CM |
493 | page_cache_release(pages[i]); |
494 | } | |
495 | kfree(pages); | |
496 | pages = NULL; | |
497 | total_compressed = 0; | |
498 | nr_pages_ret = 0; | |
499 | ||
500 | /* flag the file so we don't compress in the future */ | |
1e701a32 CM |
501 | if (!btrfs_test_opt(root, FORCE_COMPRESS) && |
502 | !(BTRFS_I(inode)->force_compress)) { | |
a555f810 | 503 | BTRFS_I(inode)->flags |= BTRFS_INODE_NOCOMPRESS; |
1e701a32 | 504 | } |
c8b97818 | 505 | } |
771ed689 CM |
506 | if (will_compress) { |
507 | *num_added += 1; | |
c8b97818 | 508 | |
771ed689 CM |
509 | /* the async work queues will take care of doing actual |
510 | * allocation on disk for these compressed pages, | |
511 | * and will submit them to the elevator. | |
512 | */ | |
513 | add_async_extent(async_cow, start, num_bytes, | |
261507a0 LZ |
514 | total_compressed, pages, nr_pages_ret, |
515 | compress_type); | |
179e29e4 | 516 | |
24ae6365 | 517 | if (start + num_bytes < end) { |
771ed689 CM |
518 | start += num_bytes; |
519 | pages = NULL; | |
520 | cond_resched(); | |
521 | goto again; | |
522 | } | |
523 | } else { | |
f03d9301 | 524 | cleanup_and_bail_uncompressed: |
771ed689 CM |
525 | /* |
526 | * No compression, but we still need to write the pages in | |
527 | * the file we've been given so far. redirty the locked | |
528 | * page if it corresponds to our extent and set things up | |
529 | * for the async work queue to run cow_file_range to do | |
530 | * the normal delalloc dance | |
531 | */ | |
532 | if (page_offset(locked_page) >= start && | |
533 | page_offset(locked_page) <= end) { | |
534 | __set_page_dirty_nobuffers(locked_page); | |
535 | /* unlocked later on in the async handlers */ | |
536 | } | |
261507a0 LZ |
537 | add_async_extent(async_cow, start, end - start + 1, |
538 | 0, NULL, 0, BTRFS_COMPRESS_NONE); | |
771ed689 CM |
539 | *num_added += 1; |
540 | } | |
3b951516 | 541 | |
771ed689 CM |
542 | out: |
543 | return 0; | |
544 | ||
545 | free_pages_out: | |
546 | for (i = 0; i < nr_pages_ret; i++) { | |
547 | WARN_ON(pages[i]->mapping); | |
548 | page_cache_release(pages[i]); | |
549 | } | |
d397712b | 550 | kfree(pages); |
771ed689 CM |
551 | |
552 | goto out; | |
553 | } | |
554 | ||
555 | /* | |
556 | * phase two of compressed writeback. This is the ordered portion | |
557 | * of the code, which only gets called in the order the work was | |
558 | * queued. We walk all the async extents created by compress_file_range | |
559 | * and send them down to the disk. | |
560 | */ | |
561 | static noinline int submit_compressed_extents(struct inode *inode, | |
562 | struct async_cow *async_cow) | |
563 | { | |
564 | struct async_extent *async_extent; | |
565 | u64 alloc_hint = 0; | |
566 | struct btrfs_trans_handle *trans; | |
567 | struct btrfs_key ins; | |
568 | struct extent_map *em; | |
569 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
570 | struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree; | |
571 | struct extent_io_tree *io_tree; | |
f5a84ee3 | 572 | int ret = 0; |
771ed689 CM |
573 | |
574 | if (list_empty(&async_cow->extents)) | |
575 | return 0; | |
576 | ||
771ed689 | 577 | |
d397712b | 578 | while (!list_empty(&async_cow->extents)) { |
771ed689 CM |
579 | async_extent = list_entry(async_cow->extents.next, |
580 | struct async_extent, list); | |
581 | list_del(&async_extent->list); | |
c8b97818 | 582 | |
771ed689 CM |
583 | io_tree = &BTRFS_I(inode)->io_tree; |
584 | ||
f5a84ee3 | 585 | retry: |
771ed689 CM |
586 | /* did the compression code fall back to uncompressed IO? */ |
587 | if (!async_extent->pages) { | |
588 | int page_started = 0; | |
589 | unsigned long nr_written = 0; | |
590 | ||
591 | lock_extent(io_tree, async_extent->start, | |
2ac55d41 JB |
592 | async_extent->start + |
593 | async_extent->ram_size - 1, GFP_NOFS); | |
771ed689 CM |
594 | |
595 | /* allocate blocks */ | |
f5a84ee3 JB |
596 | ret = cow_file_range(inode, async_cow->locked_page, |
597 | async_extent->start, | |
598 | async_extent->start + | |
599 | async_extent->ram_size - 1, | |
600 | &page_started, &nr_written, 0); | |
771ed689 CM |
601 | |
602 | /* | |
603 | * if page_started, cow_file_range inserted an | |
604 | * inline extent and took care of all the unlocking | |
605 | * and IO for us. Otherwise, we need to submit | |
606 | * all those pages down to the drive. | |
607 | */ | |
f5a84ee3 | 608 | if (!page_started && !ret) |
771ed689 CM |
609 | extent_write_locked_range(io_tree, |
610 | inode, async_extent->start, | |
d397712b | 611 | async_extent->start + |
771ed689 CM |
612 | async_extent->ram_size - 1, |
613 | btrfs_get_extent, | |
614 | WB_SYNC_ALL); | |
615 | kfree(async_extent); | |
616 | cond_resched(); | |
617 | continue; | |
618 | } | |
619 | ||
620 | lock_extent(io_tree, async_extent->start, | |
621 | async_extent->start + async_extent->ram_size - 1, | |
622 | GFP_NOFS); | |
771ed689 | 623 | |
7a7eaa40 | 624 | trans = btrfs_join_transaction(root); |
3612b495 | 625 | BUG_ON(IS_ERR(trans)); |
74b21075 | 626 | trans->block_rsv = &root->fs_info->delalloc_block_rsv; |
771ed689 CM |
627 | ret = btrfs_reserve_extent(trans, root, |
628 | async_extent->compressed_size, | |
629 | async_extent->compressed_size, | |
630 | 0, alloc_hint, | |
631 | (u64)-1, &ins, 1); | |
c2167754 YZ |
632 | btrfs_end_transaction(trans, root); |
633 | ||
f5a84ee3 JB |
634 | if (ret) { |
635 | int i; | |
636 | for (i = 0; i < async_extent->nr_pages; i++) { | |
637 | WARN_ON(async_extent->pages[i]->mapping); | |
638 | page_cache_release(async_extent->pages[i]); | |
639 | } | |
640 | kfree(async_extent->pages); | |
641 | async_extent->nr_pages = 0; | |
642 | async_extent->pages = NULL; | |
643 | unlock_extent(io_tree, async_extent->start, | |
644 | async_extent->start + | |
645 | async_extent->ram_size - 1, GFP_NOFS); | |
646 | goto retry; | |
647 | } | |
648 | ||
c2167754 YZ |
649 | /* |
650 | * here we're doing allocation and writeback of the | |
651 | * compressed pages | |
652 | */ | |
653 | btrfs_drop_extent_cache(inode, async_extent->start, | |
654 | async_extent->start + | |
655 | async_extent->ram_size - 1, 0); | |
656 | ||
172ddd60 | 657 | em = alloc_extent_map(); |
c26a9203 | 658 | BUG_ON(!em); |
771ed689 CM |
659 | em->start = async_extent->start; |
660 | em->len = async_extent->ram_size; | |
445a6944 | 661 | em->orig_start = em->start; |
c8b97818 | 662 | |
771ed689 CM |
663 | em->block_start = ins.objectid; |
664 | em->block_len = ins.offset; | |
665 | em->bdev = root->fs_info->fs_devices->latest_bdev; | |
261507a0 | 666 | em->compress_type = async_extent->compress_type; |
771ed689 CM |
667 | set_bit(EXTENT_FLAG_PINNED, &em->flags); |
668 | set_bit(EXTENT_FLAG_COMPRESSED, &em->flags); | |
669 | ||
d397712b | 670 | while (1) { |
890871be | 671 | write_lock(&em_tree->lock); |
771ed689 | 672 | ret = add_extent_mapping(em_tree, em); |
890871be | 673 | write_unlock(&em_tree->lock); |
771ed689 CM |
674 | if (ret != -EEXIST) { |
675 | free_extent_map(em); | |
676 | break; | |
677 | } | |
678 | btrfs_drop_extent_cache(inode, async_extent->start, | |
679 | async_extent->start + | |
680 | async_extent->ram_size - 1, 0); | |
681 | } | |
682 | ||
261507a0 LZ |
683 | ret = btrfs_add_ordered_extent_compress(inode, |
684 | async_extent->start, | |
685 | ins.objectid, | |
686 | async_extent->ram_size, | |
687 | ins.offset, | |
688 | BTRFS_ORDERED_COMPRESSED, | |
689 | async_extent->compress_type); | |
771ed689 CM |
690 | BUG_ON(ret); |
691 | ||
771ed689 CM |
692 | /* |
693 | * clear dirty, set writeback and unlock the pages. | |
694 | */ | |
695 | extent_clear_unlock_delalloc(inode, | |
a791e35e CM |
696 | &BTRFS_I(inode)->io_tree, |
697 | async_extent->start, | |
698 | async_extent->start + | |
699 | async_extent->ram_size - 1, | |
700 | NULL, EXTENT_CLEAR_UNLOCK_PAGE | | |
701 | EXTENT_CLEAR_UNLOCK | | |
a3429ab7 | 702 | EXTENT_CLEAR_DELALLOC | |
a791e35e | 703 | EXTENT_CLEAR_DIRTY | EXTENT_SET_WRITEBACK); |
771ed689 CM |
704 | |
705 | ret = btrfs_submit_compressed_write(inode, | |
d397712b CM |
706 | async_extent->start, |
707 | async_extent->ram_size, | |
708 | ins.objectid, | |
709 | ins.offset, async_extent->pages, | |
710 | async_extent->nr_pages); | |
771ed689 CM |
711 | |
712 | BUG_ON(ret); | |
771ed689 CM |
713 | alloc_hint = ins.objectid + ins.offset; |
714 | kfree(async_extent); | |
715 | cond_resched(); | |
716 | } | |
717 | ||
771ed689 CM |
718 | return 0; |
719 | } | |
720 | ||
4b46fce2 JB |
721 | static u64 get_extent_allocation_hint(struct inode *inode, u64 start, |
722 | u64 num_bytes) | |
723 | { | |
724 | struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree; | |
725 | struct extent_map *em; | |
726 | u64 alloc_hint = 0; | |
727 | ||
728 | read_lock(&em_tree->lock); | |
729 | em = search_extent_mapping(em_tree, start, num_bytes); | |
730 | if (em) { | |
731 | /* | |
732 | * if block start isn't an actual block number then find the | |
733 | * first block in this inode and use that as a hint. If that | |
734 | * block is also bogus then just don't worry about it. | |
735 | */ | |
736 | if (em->block_start >= EXTENT_MAP_LAST_BYTE) { | |
737 | free_extent_map(em); | |
738 | em = search_extent_mapping(em_tree, 0, 0); | |
739 | if (em && em->block_start < EXTENT_MAP_LAST_BYTE) | |
740 | alloc_hint = em->block_start; | |
741 | if (em) | |
742 | free_extent_map(em); | |
743 | } else { | |
744 | alloc_hint = em->block_start; | |
745 | free_extent_map(em); | |
746 | } | |
747 | } | |
748 | read_unlock(&em_tree->lock); | |
749 | ||
750 | return alloc_hint; | |
751 | } | |
752 | ||
82d5902d LZ |
753 | static inline bool is_free_space_inode(struct btrfs_root *root, |
754 | struct inode *inode) | |
755 | { | |
756 | if (root == root->fs_info->tree_root || | |
757 | BTRFS_I(inode)->location.objectid == BTRFS_FREE_INO_OBJECTID) | |
758 | return true; | |
759 | return false; | |
760 | } | |
761 | ||
771ed689 CM |
762 | /* |
763 | * when extent_io.c finds a delayed allocation range in the file, | |
764 | * the call backs end up in this code. The basic idea is to | |
765 | * allocate extents on disk for the range, and create ordered data structs | |
766 | * in ram to track those extents. | |
767 | * | |
768 | * locked_page is the page that writepage had locked already. We use | |
769 | * it to make sure we don't do extra locks or unlocks. | |
770 | * | |
771 | * *page_started is set to one if we unlock locked_page and do everything | |
772 | * required to start IO on it. It may be clean and already done with | |
773 | * IO when we return. | |
774 | */ | |
775 | static noinline int cow_file_range(struct inode *inode, | |
776 | struct page *locked_page, | |
777 | u64 start, u64 end, int *page_started, | |
778 | unsigned long *nr_written, | |
779 | int unlock) | |
780 | { | |
781 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
782 | struct btrfs_trans_handle *trans; | |
783 | u64 alloc_hint = 0; | |
784 | u64 num_bytes; | |
785 | unsigned long ram_size; | |
786 | u64 disk_num_bytes; | |
787 | u64 cur_alloc_size; | |
788 | u64 blocksize = root->sectorsize; | |
771ed689 CM |
789 | struct btrfs_key ins; |
790 | struct extent_map *em; | |
791 | struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree; | |
792 | int ret = 0; | |
793 | ||
82d5902d | 794 | BUG_ON(is_free_space_inode(root, inode)); |
7a7eaa40 | 795 | trans = btrfs_join_transaction(root); |
3612b495 | 796 | BUG_ON(IS_ERR(trans)); |
0ca1f7ce | 797 | trans->block_rsv = &root->fs_info->delalloc_block_rsv; |
771ed689 | 798 | |
771ed689 CM |
799 | num_bytes = (end - start + blocksize) & ~(blocksize - 1); |
800 | num_bytes = max(blocksize, num_bytes); | |
801 | disk_num_bytes = num_bytes; | |
802 | ret = 0; | |
803 | ||
4cb5300b CM |
804 | /* if this is a small write inside eof, kick off defrag */ |
805 | if (end <= BTRFS_I(inode)->disk_i_size && num_bytes < 64 * 1024) | |
806 | btrfs_add_inode_defrag(trans, inode); | |
807 | ||
771ed689 CM |
808 | if (start == 0) { |
809 | /* lets try to make an inline extent */ | |
810 | ret = cow_file_range_inline(trans, root, inode, | |
fe3f566c | 811 | start, end, 0, 0, NULL); |
771ed689 CM |
812 | if (ret == 0) { |
813 | extent_clear_unlock_delalloc(inode, | |
a791e35e CM |
814 | &BTRFS_I(inode)->io_tree, |
815 | start, end, NULL, | |
816 | EXTENT_CLEAR_UNLOCK_PAGE | | |
817 | EXTENT_CLEAR_UNLOCK | | |
818 | EXTENT_CLEAR_DELALLOC | | |
819 | EXTENT_CLEAR_DIRTY | | |
820 | EXTENT_SET_WRITEBACK | | |
821 | EXTENT_END_WRITEBACK); | |
c2167754 | 822 | |
771ed689 CM |
823 | *nr_written = *nr_written + |
824 | (end - start + PAGE_CACHE_SIZE) / PAGE_CACHE_SIZE; | |
825 | *page_started = 1; | |
826 | ret = 0; | |
827 | goto out; | |
828 | } | |
829 | } | |
830 | ||
831 | BUG_ON(disk_num_bytes > | |
832 | btrfs_super_total_bytes(&root->fs_info->super_copy)); | |
833 | ||
4b46fce2 | 834 | alloc_hint = get_extent_allocation_hint(inode, start, num_bytes); |
771ed689 CM |
835 | btrfs_drop_extent_cache(inode, start, start + num_bytes - 1, 0); |
836 | ||
d397712b | 837 | while (disk_num_bytes > 0) { |
a791e35e CM |
838 | unsigned long op; |
839 | ||
287a0ab9 | 840 | cur_alloc_size = disk_num_bytes; |
e6dcd2dc | 841 | ret = btrfs_reserve_extent(trans, root, cur_alloc_size, |
771ed689 | 842 | root->sectorsize, 0, alloc_hint, |
e6dcd2dc | 843 | (u64)-1, &ins, 1); |
d397712b CM |
844 | BUG_ON(ret); |
845 | ||
172ddd60 | 846 | em = alloc_extent_map(); |
c26a9203 | 847 | BUG_ON(!em); |
e6dcd2dc | 848 | em->start = start; |
445a6944 | 849 | em->orig_start = em->start; |
771ed689 CM |
850 | ram_size = ins.offset; |
851 | em->len = ins.offset; | |
c8b97818 | 852 | |
e6dcd2dc | 853 | em->block_start = ins.objectid; |
c8b97818 | 854 | em->block_len = ins.offset; |
e6dcd2dc | 855 | em->bdev = root->fs_info->fs_devices->latest_bdev; |
7f3c74fb | 856 | set_bit(EXTENT_FLAG_PINNED, &em->flags); |
c8b97818 | 857 | |
d397712b | 858 | while (1) { |
890871be | 859 | write_lock(&em_tree->lock); |
e6dcd2dc | 860 | ret = add_extent_mapping(em_tree, em); |
890871be | 861 | write_unlock(&em_tree->lock); |
e6dcd2dc CM |
862 | if (ret != -EEXIST) { |
863 | free_extent_map(em); | |
864 | break; | |
865 | } | |
866 | btrfs_drop_extent_cache(inode, start, | |
c8b97818 | 867 | start + ram_size - 1, 0); |
e6dcd2dc CM |
868 | } |
869 | ||
98d20f67 | 870 | cur_alloc_size = ins.offset; |
e6dcd2dc | 871 | ret = btrfs_add_ordered_extent(inode, start, ins.objectid, |
771ed689 | 872 | ram_size, cur_alloc_size, 0); |
e6dcd2dc | 873 | BUG_ON(ret); |
c8b97818 | 874 | |
17d217fe YZ |
875 | if (root->root_key.objectid == |
876 | BTRFS_DATA_RELOC_TREE_OBJECTID) { | |
877 | ret = btrfs_reloc_clone_csums(inode, start, | |
878 | cur_alloc_size); | |
879 | BUG_ON(ret); | |
880 | } | |
881 | ||
d397712b | 882 | if (disk_num_bytes < cur_alloc_size) |
3b951516 | 883 | break; |
d397712b | 884 | |
c8b97818 CM |
885 | /* we're not doing compressed IO, don't unlock the first |
886 | * page (which the caller expects to stay locked), don't | |
887 | * clear any dirty bits and don't set any writeback bits | |
8b62b72b CM |
888 | * |
889 | * Do set the Private2 bit so we know this page was properly | |
890 | * setup for writepage | |
c8b97818 | 891 | */ |
a791e35e CM |
892 | op = unlock ? EXTENT_CLEAR_UNLOCK_PAGE : 0; |
893 | op |= EXTENT_CLEAR_UNLOCK | EXTENT_CLEAR_DELALLOC | | |
894 | EXTENT_SET_PRIVATE2; | |
895 | ||
c8b97818 CM |
896 | extent_clear_unlock_delalloc(inode, &BTRFS_I(inode)->io_tree, |
897 | start, start + ram_size - 1, | |
a791e35e | 898 | locked_page, op); |
c8b97818 | 899 | disk_num_bytes -= cur_alloc_size; |
c59f8951 CM |
900 | num_bytes -= cur_alloc_size; |
901 | alloc_hint = ins.objectid + ins.offset; | |
902 | start += cur_alloc_size; | |
b888db2b | 903 | } |
b888db2b | 904 | out: |
771ed689 | 905 | ret = 0; |
b888db2b | 906 | btrfs_end_transaction(trans, root); |
c8b97818 | 907 | |
be20aa9d | 908 | return ret; |
771ed689 | 909 | } |
c8b97818 | 910 | |
771ed689 CM |
911 | /* |
912 | * work queue call back to started compression on a file and pages | |
913 | */ | |
914 | static noinline void async_cow_start(struct btrfs_work *work) | |
915 | { | |
916 | struct async_cow *async_cow; | |
917 | int num_added = 0; | |
918 | async_cow = container_of(work, struct async_cow, work); | |
919 | ||
920 | compress_file_range(async_cow->inode, async_cow->locked_page, | |
921 | async_cow->start, async_cow->end, async_cow, | |
922 | &num_added); | |
923 | if (num_added == 0) | |
924 | async_cow->inode = NULL; | |
925 | } | |
926 | ||
927 | /* | |
928 | * work queue call back to submit previously compressed pages | |
929 | */ | |
930 | static noinline void async_cow_submit(struct btrfs_work *work) | |
931 | { | |
932 | struct async_cow *async_cow; | |
933 | struct btrfs_root *root; | |
934 | unsigned long nr_pages; | |
935 | ||
936 | async_cow = container_of(work, struct async_cow, work); | |
937 | ||
938 | root = async_cow->root; | |
939 | nr_pages = (async_cow->end - async_cow->start + PAGE_CACHE_SIZE) >> | |
940 | PAGE_CACHE_SHIFT; | |
941 | ||
942 | atomic_sub(nr_pages, &root->fs_info->async_delalloc_pages); | |
943 | ||
944 | if (atomic_read(&root->fs_info->async_delalloc_pages) < | |
945 | 5 * 1042 * 1024 && | |
946 | waitqueue_active(&root->fs_info->async_submit_wait)) | |
947 | wake_up(&root->fs_info->async_submit_wait); | |
948 | ||
d397712b | 949 | if (async_cow->inode) |
771ed689 | 950 | submit_compressed_extents(async_cow->inode, async_cow); |
771ed689 | 951 | } |
c8b97818 | 952 | |
771ed689 CM |
953 | static noinline void async_cow_free(struct btrfs_work *work) |
954 | { | |
955 | struct async_cow *async_cow; | |
956 | async_cow = container_of(work, struct async_cow, work); | |
957 | kfree(async_cow); | |
958 | } | |
959 | ||
960 | static int cow_file_range_async(struct inode *inode, struct page *locked_page, | |
961 | u64 start, u64 end, int *page_started, | |
962 | unsigned long *nr_written) | |
963 | { | |
964 | struct async_cow *async_cow; | |
965 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
966 | unsigned long nr_pages; | |
967 | u64 cur_end; | |
968 | int limit = 10 * 1024 * 1042; | |
969 | ||
a3429ab7 CM |
970 | clear_extent_bit(&BTRFS_I(inode)->io_tree, start, end, EXTENT_LOCKED, |
971 | 1, 0, NULL, GFP_NOFS); | |
d397712b | 972 | while (start < end) { |
771ed689 | 973 | async_cow = kmalloc(sizeof(*async_cow), GFP_NOFS); |
8d413713 | 974 | BUG_ON(!async_cow); |
771ed689 CM |
975 | async_cow->inode = inode; |
976 | async_cow->root = root; | |
977 | async_cow->locked_page = locked_page; | |
978 | async_cow->start = start; | |
979 | ||
6cbff00f | 980 | if (BTRFS_I(inode)->flags & BTRFS_INODE_NOCOMPRESS) |
771ed689 CM |
981 | cur_end = end; |
982 | else | |
983 | cur_end = min(end, start + 512 * 1024 - 1); | |
984 | ||
985 | async_cow->end = cur_end; | |
986 | INIT_LIST_HEAD(&async_cow->extents); | |
987 | ||
988 | async_cow->work.func = async_cow_start; | |
989 | async_cow->work.ordered_func = async_cow_submit; | |
990 | async_cow->work.ordered_free = async_cow_free; | |
991 | async_cow->work.flags = 0; | |
992 | ||
771ed689 CM |
993 | nr_pages = (cur_end - start + PAGE_CACHE_SIZE) >> |
994 | PAGE_CACHE_SHIFT; | |
995 | atomic_add(nr_pages, &root->fs_info->async_delalloc_pages); | |
996 | ||
997 | btrfs_queue_worker(&root->fs_info->delalloc_workers, | |
998 | &async_cow->work); | |
999 | ||
1000 | if (atomic_read(&root->fs_info->async_delalloc_pages) > limit) { | |
1001 | wait_event(root->fs_info->async_submit_wait, | |
1002 | (atomic_read(&root->fs_info->async_delalloc_pages) < | |
1003 | limit)); | |
1004 | } | |
1005 | ||
d397712b | 1006 | while (atomic_read(&root->fs_info->async_submit_draining) && |
771ed689 CM |
1007 | atomic_read(&root->fs_info->async_delalloc_pages)) { |
1008 | wait_event(root->fs_info->async_submit_wait, | |
1009 | (atomic_read(&root->fs_info->async_delalloc_pages) == | |
1010 | 0)); | |
1011 | } | |
1012 | ||
1013 | *nr_written += nr_pages; | |
1014 | start = cur_end + 1; | |
1015 | } | |
1016 | *page_started = 1; | |
1017 | return 0; | |
be20aa9d CM |
1018 | } |
1019 | ||
d397712b | 1020 | static noinline int csum_exist_in_range(struct btrfs_root *root, |
17d217fe YZ |
1021 | u64 bytenr, u64 num_bytes) |
1022 | { | |
1023 | int ret; | |
1024 | struct btrfs_ordered_sum *sums; | |
1025 | LIST_HEAD(list); | |
1026 | ||
07d400a6 | 1027 | ret = btrfs_lookup_csums_range(root->fs_info->csum_root, bytenr, |
a2de733c | 1028 | bytenr + num_bytes - 1, &list, 0); |
17d217fe YZ |
1029 | if (ret == 0 && list_empty(&list)) |
1030 | return 0; | |
1031 | ||
1032 | while (!list_empty(&list)) { | |
1033 | sums = list_entry(list.next, struct btrfs_ordered_sum, list); | |
1034 | list_del(&sums->list); | |
1035 | kfree(sums); | |
1036 | } | |
1037 | return 1; | |
1038 | } | |
1039 | ||
d352ac68 CM |
1040 | /* |
1041 | * when nowcow writeback call back. This checks for snapshots or COW copies | |
1042 | * of the extents that exist in the file, and COWs the file as required. | |
1043 | * | |
1044 | * If no cow copies or snapshots exist, we write directly to the existing | |
1045 | * blocks on disk | |
1046 | */ | |
7f366cfe CM |
1047 | static noinline int run_delalloc_nocow(struct inode *inode, |
1048 | struct page *locked_page, | |
771ed689 CM |
1049 | u64 start, u64 end, int *page_started, int force, |
1050 | unsigned long *nr_written) | |
be20aa9d | 1051 | { |
be20aa9d | 1052 | struct btrfs_root *root = BTRFS_I(inode)->root; |
7ea394f1 | 1053 | struct btrfs_trans_handle *trans; |
be20aa9d | 1054 | struct extent_buffer *leaf; |
be20aa9d | 1055 | struct btrfs_path *path; |
80ff3856 | 1056 | struct btrfs_file_extent_item *fi; |
be20aa9d | 1057 | struct btrfs_key found_key; |
80ff3856 YZ |
1058 | u64 cow_start; |
1059 | u64 cur_offset; | |
1060 | u64 extent_end; | |
5d4f98a2 | 1061 | u64 extent_offset; |
80ff3856 YZ |
1062 | u64 disk_bytenr; |
1063 | u64 num_bytes; | |
1064 | int extent_type; | |
1065 | int ret; | |
d899e052 | 1066 | int type; |
80ff3856 YZ |
1067 | int nocow; |
1068 | int check_prev = 1; | |
82d5902d | 1069 | bool nolock; |
33345d01 | 1070 | u64 ino = btrfs_ino(inode); |
be20aa9d CM |
1071 | |
1072 | path = btrfs_alloc_path(); | |
1073 | BUG_ON(!path); | |
82d5902d LZ |
1074 | |
1075 | nolock = is_free_space_inode(root, inode); | |
1076 | ||
1077 | if (nolock) | |
7a7eaa40 | 1078 | trans = btrfs_join_transaction_nolock(root); |
82d5902d | 1079 | else |
7a7eaa40 | 1080 | trans = btrfs_join_transaction(root); |
ff5714cc | 1081 | |
3612b495 | 1082 | BUG_ON(IS_ERR(trans)); |
74b21075 | 1083 | trans->block_rsv = &root->fs_info->delalloc_block_rsv; |
be20aa9d | 1084 | |
80ff3856 YZ |
1085 | cow_start = (u64)-1; |
1086 | cur_offset = start; | |
1087 | while (1) { | |
33345d01 | 1088 | ret = btrfs_lookup_file_extent(trans, root, path, ino, |
80ff3856 YZ |
1089 | cur_offset, 0); |
1090 | BUG_ON(ret < 0); | |
1091 | if (ret > 0 && path->slots[0] > 0 && check_prev) { | |
1092 | leaf = path->nodes[0]; | |
1093 | btrfs_item_key_to_cpu(leaf, &found_key, | |
1094 | path->slots[0] - 1); | |
33345d01 | 1095 | if (found_key.objectid == ino && |
80ff3856 YZ |
1096 | found_key.type == BTRFS_EXTENT_DATA_KEY) |
1097 | path->slots[0]--; | |
1098 | } | |
1099 | check_prev = 0; | |
1100 | next_slot: | |
1101 | leaf = path->nodes[0]; | |
1102 | if (path->slots[0] >= btrfs_header_nritems(leaf)) { | |
1103 | ret = btrfs_next_leaf(root, path); | |
1104 | if (ret < 0) | |
1105 | BUG_ON(1); | |
1106 | if (ret > 0) | |
1107 | break; | |
1108 | leaf = path->nodes[0]; | |
1109 | } | |
be20aa9d | 1110 | |
80ff3856 YZ |
1111 | nocow = 0; |
1112 | disk_bytenr = 0; | |
17d217fe | 1113 | num_bytes = 0; |
80ff3856 YZ |
1114 | btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); |
1115 | ||
33345d01 | 1116 | if (found_key.objectid > ino || |
80ff3856 YZ |
1117 | found_key.type > BTRFS_EXTENT_DATA_KEY || |
1118 | found_key.offset > end) | |
1119 | break; | |
1120 | ||
1121 | if (found_key.offset > cur_offset) { | |
1122 | extent_end = found_key.offset; | |
e9061e21 | 1123 | extent_type = 0; |
80ff3856 YZ |
1124 | goto out_check; |
1125 | } | |
1126 | ||
1127 | fi = btrfs_item_ptr(leaf, path->slots[0], | |
1128 | struct btrfs_file_extent_item); | |
1129 | extent_type = btrfs_file_extent_type(leaf, fi); | |
1130 | ||
d899e052 YZ |
1131 | if (extent_type == BTRFS_FILE_EXTENT_REG || |
1132 | extent_type == BTRFS_FILE_EXTENT_PREALLOC) { | |
80ff3856 | 1133 | disk_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); |
5d4f98a2 | 1134 | extent_offset = btrfs_file_extent_offset(leaf, fi); |
80ff3856 YZ |
1135 | extent_end = found_key.offset + |
1136 | btrfs_file_extent_num_bytes(leaf, fi); | |
1137 | if (extent_end <= start) { | |
1138 | path->slots[0]++; | |
1139 | goto next_slot; | |
1140 | } | |
17d217fe YZ |
1141 | if (disk_bytenr == 0) |
1142 | goto out_check; | |
80ff3856 YZ |
1143 | if (btrfs_file_extent_compression(leaf, fi) || |
1144 | btrfs_file_extent_encryption(leaf, fi) || | |
1145 | btrfs_file_extent_other_encoding(leaf, fi)) | |
1146 | goto out_check; | |
d899e052 YZ |
1147 | if (extent_type == BTRFS_FILE_EXTENT_REG && !force) |
1148 | goto out_check; | |
d2fb3437 | 1149 | if (btrfs_extent_readonly(root, disk_bytenr)) |
80ff3856 | 1150 | goto out_check; |
33345d01 | 1151 | if (btrfs_cross_ref_exist(trans, root, ino, |
5d4f98a2 YZ |
1152 | found_key.offset - |
1153 | extent_offset, disk_bytenr)) | |
17d217fe | 1154 | goto out_check; |
5d4f98a2 | 1155 | disk_bytenr += extent_offset; |
17d217fe YZ |
1156 | disk_bytenr += cur_offset - found_key.offset; |
1157 | num_bytes = min(end + 1, extent_end) - cur_offset; | |
1158 | /* | |
1159 | * force cow if csum exists in the range. | |
1160 | * this ensure that csum for a given extent are | |
1161 | * either valid or do not exist. | |
1162 | */ | |
1163 | if (csum_exist_in_range(root, disk_bytenr, num_bytes)) | |
1164 | goto out_check; | |
80ff3856 YZ |
1165 | nocow = 1; |
1166 | } else if (extent_type == BTRFS_FILE_EXTENT_INLINE) { | |
1167 | extent_end = found_key.offset + | |
1168 | btrfs_file_extent_inline_len(leaf, fi); | |
1169 | extent_end = ALIGN(extent_end, root->sectorsize); | |
1170 | } else { | |
1171 | BUG_ON(1); | |
1172 | } | |
1173 | out_check: | |
1174 | if (extent_end <= start) { | |
1175 | path->slots[0]++; | |
1176 | goto next_slot; | |
1177 | } | |
1178 | if (!nocow) { | |
1179 | if (cow_start == (u64)-1) | |
1180 | cow_start = cur_offset; | |
1181 | cur_offset = extent_end; | |
1182 | if (cur_offset > end) | |
1183 | break; | |
1184 | path->slots[0]++; | |
1185 | goto next_slot; | |
7ea394f1 YZ |
1186 | } |
1187 | ||
b3b4aa74 | 1188 | btrfs_release_path(path); |
80ff3856 YZ |
1189 | if (cow_start != (u64)-1) { |
1190 | ret = cow_file_range(inode, locked_page, cow_start, | |
771ed689 CM |
1191 | found_key.offset - 1, page_started, |
1192 | nr_written, 1); | |
80ff3856 YZ |
1193 | BUG_ON(ret); |
1194 | cow_start = (u64)-1; | |
7ea394f1 | 1195 | } |
80ff3856 | 1196 | |
d899e052 YZ |
1197 | if (extent_type == BTRFS_FILE_EXTENT_PREALLOC) { |
1198 | struct extent_map *em; | |
1199 | struct extent_map_tree *em_tree; | |
1200 | em_tree = &BTRFS_I(inode)->extent_tree; | |
172ddd60 | 1201 | em = alloc_extent_map(); |
c26a9203 | 1202 | BUG_ON(!em); |
d899e052 | 1203 | em->start = cur_offset; |
445a6944 | 1204 | em->orig_start = em->start; |
d899e052 YZ |
1205 | em->len = num_bytes; |
1206 | em->block_len = num_bytes; | |
1207 | em->block_start = disk_bytenr; | |
1208 | em->bdev = root->fs_info->fs_devices->latest_bdev; | |
1209 | set_bit(EXTENT_FLAG_PINNED, &em->flags); | |
1210 | while (1) { | |
890871be | 1211 | write_lock(&em_tree->lock); |
d899e052 | 1212 | ret = add_extent_mapping(em_tree, em); |
890871be | 1213 | write_unlock(&em_tree->lock); |
d899e052 YZ |
1214 | if (ret != -EEXIST) { |
1215 | free_extent_map(em); | |
1216 | break; | |
1217 | } | |
1218 | btrfs_drop_extent_cache(inode, em->start, | |
1219 | em->start + em->len - 1, 0); | |
1220 | } | |
1221 | type = BTRFS_ORDERED_PREALLOC; | |
1222 | } else { | |
1223 | type = BTRFS_ORDERED_NOCOW; | |
1224 | } | |
80ff3856 YZ |
1225 | |
1226 | ret = btrfs_add_ordered_extent(inode, cur_offset, disk_bytenr, | |
d899e052 YZ |
1227 | num_bytes, num_bytes, type); |
1228 | BUG_ON(ret); | |
771ed689 | 1229 | |
efa56464 YZ |
1230 | if (root->root_key.objectid == |
1231 | BTRFS_DATA_RELOC_TREE_OBJECTID) { | |
1232 | ret = btrfs_reloc_clone_csums(inode, cur_offset, | |
1233 | num_bytes); | |
1234 | BUG_ON(ret); | |
1235 | } | |
1236 | ||
d899e052 | 1237 | extent_clear_unlock_delalloc(inode, &BTRFS_I(inode)->io_tree, |
a791e35e CM |
1238 | cur_offset, cur_offset + num_bytes - 1, |
1239 | locked_page, EXTENT_CLEAR_UNLOCK_PAGE | | |
1240 | EXTENT_CLEAR_UNLOCK | EXTENT_CLEAR_DELALLOC | | |
1241 | EXTENT_SET_PRIVATE2); | |
80ff3856 YZ |
1242 | cur_offset = extent_end; |
1243 | if (cur_offset > end) | |
1244 | break; | |
be20aa9d | 1245 | } |
b3b4aa74 | 1246 | btrfs_release_path(path); |
80ff3856 YZ |
1247 | |
1248 | if (cur_offset <= end && cow_start == (u64)-1) | |
1249 | cow_start = cur_offset; | |
1250 | if (cow_start != (u64)-1) { | |
1251 | ret = cow_file_range(inode, locked_page, cow_start, end, | |
771ed689 | 1252 | page_started, nr_written, 1); |
80ff3856 YZ |
1253 | BUG_ON(ret); |
1254 | } | |
1255 | ||
0cb59c99 JB |
1256 | if (nolock) { |
1257 | ret = btrfs_end_transaction_nolock(trans, root); | |
1258 | BUG_ON(ret); | |
1259 | } else { | |
1260 | ret = btrfs_end_transaction(trans, root); | |
1261 | BUG_ON(ret); | |
1262 | } | |
7ea394f1 | 1263 | btrfs_free_path(path); |
80ff3856 | 1264 | return 0; |
be20aa9d CM |
1265 | } |
1266 | ||
d352ac68 CM |
1267 | /* |
1268 | * extent_io.c call back to do delayed allocation processing | |
1269 | */ | |
c8b97818 | 1270 | static int run_delalloc_range(struct inode *inode, struct page *locked_page, |
771ed689 CM |
1271 | u64 start, u64 end, int *page_started, |
1272 | unsigned long *nr_written) | |
be20aa9d | 1273 | { |
be20aa9d | 1274 | int ret; |
7f366cfe | 1275 | struct btrfs_root *root = BTRFS_I(inode)->root; |
a2135011 | 1276 | |
6cbff00f | 1277 | if (BTRFS_I(inode)->flags & BTRFS_INODE_NODATACOW) |
c8b97818 | 1278 | ret = run_delalloc_nocow(inode, locked_page, start, end, |
d397712b | 1279 | page_started, 1, nr_written); |
6cbff00f | 1280 | else if (BTRFS_I(inode)->flags & BTRFS_INODE_PREALLOC) |
d899e052 | 1281 | ret = run_delalloc_nocow(inode, locked_page, start, end, |
d397712b | 1282 | page_started, 0, nr_written); |
1e701a32 | 1283 | else if (!btrfs_test_opt(root, COMPRESS) && |
75e7cb7f LB |
1284 | !(BTRFS_I(inode)->force_compress) && |
1285 | !(BTRFS_I(inode)->flags & BTRFS_INODE_COMPRESS)) | |
7f366cfe CM |
1286 | ret = cow_file_range(inode, locked_page, start, end, |
1287 | page_started, nr_written, 1); | |
be20aa9d | 1288 | else |
771ed689 | 1289 | ret = cow_file_range_async(inode, locked_page, start, end, |
d397712b | 1290 | page_started, nr_written); |
b888db2b CM |
1291 | return ret; |
1292 | } | |
1293 | ||
9ed74f2d | 1294 | static int btrfs_split_extent_hook(struct inode *inode, |
0ca1f7ce | 1295 | struct extent_state *orig, u64 split) |
9ed74f2d | 1296 | { |
0ca1f7ce | 1297 | /* not delalloc, ignore it */ |
9ed74f2d JB |
1298 | if (!(orig->state & EXTENT_DELALLOC)) |
1299 | return 0; | |
1300 | ||
0ca1f7ce | 1301 | atomic_inc(&BTRFS_I(inode)->outstanding_extents); |
9ed74f2d JB |
1302 | return 0; |
1303 | } | |
1304 | ||
1305 | /* | |
1306 | * extent_io.c merge_extent_hook, used to track merged delayed allocation | |
1307 | * extents so we can keep track of new extents that are just merged onto old | |
1308 | * extents, such as when we are doing sequential writes, so we can properly | |
1309 | * account for the metadata space we'll need. | |
1310 | */ | |
1311 | static int btrfs_merge_extent_hook(struct inode *inode, | |
1312 | struct extent_state *new, | |
1313 | struct extent_state *other) | |
1314 | { | |
9ed74f2d JB |
1315 | /* not delalloc, ignore it */ |
1316 | if (!(other->state & EXTENT_DELALLOC)) | |
1317 | return 0; | |
1318 | ||
0ca1f7ce | 1319 | atomic_dec(&BTRFS_I(inode)->outstanding_extents); |
9ed74f2d JB |
1320 | return 0; |
1321 | } | |
1322 | ||
d352ac68 CM |
1323 | /* |
1324 | * extent_io.c set_bit_hook, used to track delayed allocation | |
1325 | * bytes in this file, and to maintain the list of inodes that | |
1326 | * have pending delalloc work to be done. | |
1327 | */ | |
0ca1f7ce YZ |
1328 | static int btrfs_set_bit_hook(struct inode *inode, |
1329 | struct extent_state *state, int *bits) | |
291d673e | 1330 | { |
9ed74f2d | 1331 | |
75eff68e CM |
1332 | /* |
1333 | * set_bit and clear bit hooks normally require _irqsave/restore | |
27160b6b | 1334 | * but in this case, we are only testing for the DELALLOC |
75eff68e CM |
1335 | * bit, which is only set or cleared with irqs on |
1336 | */ | |
0ca1f7ce | 1337 | if (!(state->state & EXTENT_DELALLOC) && (*bits & EXTENT_DELALLOC)) { |
291d673e | 1338 | struct btrfs_root *root = BTRFS_I(inode)->root; |
0ca1f7ce | 1339 | u64 len = state->end + 1 - state->start; |
82d5902d | 1340 | bool do_list = !is_free_space_inode(root, inode); |
9ed74f2d | 1341 | |
0ca1f7ce YZ |
1342 | if (*bits & EXTENT_FIRST_DELALLOC) |
1343 | *bits &= ~EXTENT_FIRST_DELALLOC; | |
1344 | else | |
1345 | atomic_inc(&BTRFS_I(inode)->outstanding_extents); | |
287a0ab9 | 1346 | |
75eff68e | 1347 | spin_lock(&root->fs_info->delalloc_lock); |
0ca1f7ce YZ |
1348 | BTRFS_I(inode)->delalloc_bytes += len; |
1349 | root->fs_info->delalloc_bytes += len; | |
0cb59c99 | 1350 | if (do_list && list_empty(&BTRFS_I(inode)->delalloc_inodes)) { |
ea8c2819 CM |
1351 | list_add_tail(&BTRFS_I(inode)->delalloc_inodes, |
1352 | &root->fs_info->delalloc_inodes); | |
1353 | } | |
75eff68e | 1354 | spin_unlock(&root->fs_info->delalloc_lock); |
291d673e CM |
1355 | } |
1356 | return 0; | |
1357 | } | |
1358 | ||
d352ac68 CM |
1359 | /* |
1360 | * extent_io.c clear_bit_hook, see set_bit_hook for why | |
1361 | */ | |
9ed74f2d | 1362 | static int btrfs_clear_bit_hook(struct inode *inode, |
0ca1f7ce | 1363 | struct extent_state *state, int *bits) |
291d673e | 1364 | { |
75eff68e CM |
1365 | /* |
1366 | * set_bit and clear bit hooks normally require _irqsave/restore | |
27160b6b | 1367 | * but in this case, we are only testing for the DELALLOC |
75eff68e CM |
1368 | * bit, which is only set or cleared with irqs on |
1369 | */ | |
0ca1f7ce | 1370 | if ((state->state & EXTENT_DELALLOC) && (*bits & EXTENT_DELALLOC)) { |
291d673e | 1371 | struct btrfs_root *root = BTRFS_I(inode)->root; |
0ca1f7ce | 1372 | u64 len = state->end + 1 - state->start; |
82d5902d | 1373 | bool do_list = !is_free_space_inode(root, inode); |
bcbfce8a | 1374 | |
0ca1f7ce YZ |
1375 | if (*bits & EXTENT_FIRST_DELALLOC) |
1376 | *bits &= ~EXTENT_FIRST_DELALLOC; | |
1377 | else if (!(*bits & EXTENT_DO_ACCOUNTING)) | |
1378 | atomic_dec(&BTRFS_I(inode)->outstanding_extents); | |
1379 | ||
1380 | if (*bits & EXTENT_DO_ACCOUNTING) | |
1381 | btrfs_delalloc_release_metadata(inode, len); | |
1382 | ||
0cb59c99 JB |
1383 | if (root->root_key.objectid != BTRFS_DATA_RELOC_TREE_OBJECTID |
1384 | && do_list) | |
0ca1f7ce | 1385 | btrfs_free_reserved_data_space(inode, len); |
9ed74f2d | 1386 | |
75eff68e | 1387 | spin_lock(&root->fs_info->delalloc_lock); |
0ca1f7ce YZ |
1388 | root->fs_info->delalloc_bytes -= len; |
1389 | BTRFS_I(inode)->delalloc_bytes -= len; | |
1390 | ||
0cb59c99 | 1391 | if (do_list && BTRFS_I(inode)->delalloc_bytes == 0 && |
ea8c2819 CM |
1392 | !list_empty(&BTRFS_I(inode)->delalloc_inodes)) { |
1393 | list_del_init(&BTRFS_I(inode)->delalloc_inodes); | |
1394 | } | |
75eff68e | 1395 | spin_unlock(&root->fs_info->delalloc_lock); |
291d673e CM |
1396 | } |
1397 | return 0; | |
1398 | } | |
1399 | ||
d352ac68 CM |
1400 | /* |
1401 | * extent_io.c merge_bio_hook, this must check the chunk tree to make sure | |
1402 | * we don't create bios that span stripes or chunks | |
1403 | */ | |
239b14b3 | 1404 | int btrfs_merge_bio_hook(struct page *page, unsigned long offset, |
c8b97818 CM |
1405 | size_t size, struct bio *bio, |
1406 | unsigned long bio_flags) | |
239b14b3 CM |
1407 | { |
1408 | struct btrfs_root *root = BTRFS_I(page->mapping->host)->root; | |
1409 | struct btrfs_mapping_tree *map_tree; | |
a62b9401 | 1410 | u64 logical = (u64)bio->bi_sector << 9; |
239b14b3 CM |
1411 | u64 length = 0; |
1412 | u64 map_length; | |
239b14b3 CM |
1413 | int ret; |
1414 | ||
771ed689 CM |
1415 | if (bio_flags & EXTENT_BIO_COMPRESSED) |
1416 | return 0; | |
1417 | ||
f2d8d74d | 1418 | length = bio->bi_size; |
239b14b3 CM |
1419 | map_tree = &root->fs_info->mapping_tree; |
1420 | map_length = length; | |
cea9e445 | 1421 | ret = btrfs_map_block(map_tree, READ, logical, |
f188591e | 1422 | &map_length, NULL, 0); |
cea9e445 | 1423 | |
d397712b | 1424 | if (map_length < length + size) |
239b14b3 | 1425 | return 1; |
411fc6bc | 1426 | return ret; |
239b14b3 CM |
1427 | } |
1428 | ||
d352ac68 CM |
1429 | /* |
1430 | * in order to insert checksums into the metadata in large chunks, | |
1431 | * we wait until bio submission time. All the pages in the bio are | |
1432 | * checksummed and sums are attached onto the ordered extent record. | |
1433 | * | |
1434 | * At IO completion time the cums attached on the ordered extent record | |
1435 | * are inserted into the btree | |
1436 | */ | |
d397712b CM |
1437 | static int __btrfs_submit_bio_start(struct inode *inode, int rw, |
1438 | struct bio *bio, int mirror_num, | |
eaf25d93 CM |
1439 | unsigned long bio_flags, |
1440 | u64 bio_offset) | |
065631f6 | 1441 | { |
065631f6 | 1442 | struct btrfs_root *root = BTRFS_I(inode)->root; |
065631f6 | 1443 | int ret = 0; |
e015640f | 1444 | |
d20f7043 | 1445 | ret = btrfs_csum_one_bio(root, inode, bio, 0, 0); |
44b8bd7e | 1446 | BUG_ON(ret); |
4a69a410 CM |
1447 | return 0; |
1448 | } | |
e015640f | 1449 | |
4a69a410 CM |
1450 | /* |
1451 | * in order to insert checksums into the metadata in large chunks, | |
1452 | * we wait until bio submission time. All the pages in the bio are | |
1453 | * checksummed and sums are attached onto the ordered extent record. | |
1454 | * | |
1455 | * At IO completion time the cums attached on the ordered extent record | |
1456 | * are inserted into the btree | |
1457 | */ | |
b2950863 | 1458 | static int __btrfs_submit_bio_done(struct inode *inode, int rw, struct bio *bio, |
eaf25d93 CM |
1459 | int mirror_num, unsigned long bio_flags, |
1460 | u64 bio_offset) | |
4a69a410 CM |
1461 | { |
1462 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
8b712842 | 1463 | return btrfs_map_bio(root, rw, bio, mirror_num, 1); |
44b8bd7e CM |
1464 | } |
1465 | ||
d352ac68 | 1466 | /* |
cad321ad CM |
1467 | * extent_io.c submission hook. This does the right thing for csum calculation |
1468 | * on write, or reading the csums from the tree before a read | |
d352ac68 | 1469 | */ |
b2950863 | 1470 | static int btrfs_submit_bio_hook(struct inode *inode, int rw, struct bio *bio, |
eaf25d93 CM |
1471 | int mirror_num, unsigned long bio_flags, |
1472 | u64 bio_offset) | |
44b8bd7e CM |
1473 | { |
1474 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
1475 | int ret = 0; | |
19b9bdb0 | 1476 | int skip_sum; |
44b8bd7e | 1477 | |
6cbff00f | 1478 | skip_sum = BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM; |
cad321ad | 1479 | |
82d5902d | 1480 | if (is_free_space_inode(root, inode)) |
0cb59c99 JB |
1481 | ret = btrfs_bio_wq_end_io(root->fs_info, bio, 2); |
1482 | else | |
1483 | ret = btrfs_bio_wq_end_io(root->fs_info, bio, 0); | |
e6dcd2dc | 1484 | BUG_ON(ret); |
065631f6 | 1485 | |
7b6d91da | 1486 | if (!(rw & REQ_WRITE)) { |
d20f7043 | 1487 | if (bio_flags & EXTENT_BIO_COMPRESSED) { |
c8b97818 CM |
1488 | return btrfs_submit_compressed_read(inode, bio, |
1489 | mirror_num, bio_flags); | |
c2db1073 TI |
1490 | } else if (!skip_sum) { |
1491 | ret = btrfs_lookup_bio_sums(root, inode, bio, NULL); | |
1492 | if (ret) | |
1493 | return ret; | |
1494 | } | |
4d1b5fb4 | 1495 | goto mapit; |
19b9bdb0 | 1496 | } else if (!skip_sum) { |
17d217fe YZ |
1497 | /* csum items have already been cloned */ |
1498 | if (root->root_key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID) | |
1499 | goto mapit; | |
19b9bdb0 CM |
1500 | /* we're doing a write, do the async checksumming */ |
1501 | return btrfs_wq_submit_bio(BTRFS_I(inode)->root->fs_info, | |
44b8bd7e | 1502 | inode, rw, bio, mirror_num, |
eaf25d93 CM |
1503 | bio_flags, bio_offset, |
1504 | __btrfs_submit_bio_start, | |
4a69a410 | 1505 | __btrfs_submit_bio_done); |
19b9bdb0 CM |
1506 | } |
1507 | ||
0b86a832 | 1508 | mapit: |
8b712842 | 1509 | return btrfs_map_bio(root, rw, bio, mirror_num, 0); |
065631f6 | 1510 | } |
6885f308 | 1511 | |
d352ac68 CM |
1512 | /* |
1513 | * given a list of ordered sums record them in the inode. This happens | |
1514 | * at IO completion time based on sums calculated at bio submission time. | |
1515 | */ | |
ba1da2f4 | 1516 | static noinline int add_pending_csums(struct btrfs_trans_handle *trans, |
e6dcd2dc CM |
1517 | struct inode *inode, u64 file_offset, |
1518 | struct list_head *list) | |
1519 | { | |
e6dcd2dc CM |
1520 | struct btrfs_ordered_sum *sum; |
1521 | ||
c6e30871 | 1522 | list_for_each_entry(sum, list, list) { |
d20f7043 CM |
1523 | btrfs_csum_file_blocks(trans, |
1524 | BTRFS_I(inode)->root->fs_info->csum_root, sum); | |
e6dcd2dc CM |
1525 | } |
1526 | return 0; | |
1527 | } | |
1528 | ||
2ac55d41 JB |
1529 | int btrfs_set_extent_delalloc(struct inode *inode, u64 start, u64 end, |
1530 | struct extent_state **cached_state) | |
ea8c2819 | 1531 | { |
d397712b | 1532 | if ((end & (PAGE_CACHE_SIZE - 1)) == 0) |
771ed689 | 1533 | WARN_ON(1); |
ea8c2819 | 1534 | return set_extent_delalloc(&BTRFS_I(inode)->io_tree, start, end, |
2ac55d41 | 1535 | cached_state, GFP_NOFS); |
ea8c2819 CM |
1536 | } |
1537 | ||
d352ac68 | 1538 | /* see btrfs_writepage_start_hook for details on why this is required */ |
247e743c CM |
1539 | struct btrfs_writepage_fixup { |
1540 | struct page *page; | |
1541 | struct btrfs_work work; | |
1542 | }; | |
1543 | ||
b2950863 | 1544 | static void btrfs_writepage_fixup_worker(struct btrfs_work *work) |
247e743c CM |
1545 | { |
1546 | struct btrfs_writepage_fixup *fixup; | |
1547 | struct btrfs_ordered_extent *ordered; | |
2ac55d41 | 1548 | struct extent_state *cached_state = NULL; |
247e743c CM |
1549 | struct page *page; |
1550 | struct inode *inode; | |
1551 | u64 page_start; | |
1552 | u64 page_end; | |
1553 | ||
1554 | fixup = container_of(work, struct btrfs_writepage_fixup, work); | |
1555 | page = fixup->page; | |
4a096752 | 1556 | again: |
247e743c CM |
1557 | lock_page(page); |
1558 | if (!page->mapping || !PageDirty(page) || !PageChecked(page)) { | |
1559 | ClearPageChecked(page); | |
1560 | goto out_page; | |
1561 | } | |
1562 | ||
1563 | inode = page->mapping->host; | |
1564 | page_start = page_offset(page); | |
1565 | page_end = page_offset(page) + PAGE_CACHE_SIZE - 1; | |
1566 | ||
2ac55d41 JB |
1567 | lock_extent_bits(&BTRFS_I(inode)->io_tree, page_start, page_end, 0, |
1568 | &cached_state, GFP_NOFS); | |
4a096752 CM |
1569 | |
1570 | /* already ordered? We're done */ | |
8b62b72b | 1571 | if (PagePrivate2(page)) |
247e743c | 1572 | goto out; |
4a096752 CM |
1573 | |
1574 | ordered = btrfs_lookup_ordered_extent(inode, page_start); | |
1575 | if (ordered) { | |
2ac55d41 JB |
1576 | unlock_extent_cached(&BTRFS_I(inode)->io_tree, page_start, |
1577 | page_end, &cached_state, GFP_NOFS); | |
4a096752 CM |
1578 | unlock_page(page); |
1579 | btrfs_start_ordered_extent(inode, ordered, 1); | |
1580 | goto again; | |
1581 | } | |
247e743c | 1582 | |
0ca1f7ce | 1583 | BUG(); |
2ac55d41 | 1584 | btrfs_set_extent_delalloc(inode, page_start, page_end, &cached_state); |
247e743c CM |
1585 | ClearPageChecked(page); |
1586 | out: | |
2ac55d41 JB |
1587 | unlock_extent_cached(&BTRFS_I(inode)->io_tree, page_start, page_end, |
1588 | &cached_state, GFP_NOFS); | |
247e743c CM |
1589 | out_page: |
1590 | unlock_page(page); | |
1591 | page_cache_release(page); | |
b897abec | 1592 | kfree(fixup); |
247e743c CM |
1593 | } |
1594 | ||
1595 | /* | |
1596 | * There are a few paths in the higher layers of the kernel that directly | |
1597 | * set the page dirty bit without asking the filesystem if it is a | |
1598 | * good idea. This causes problems because we want to make sure COW | |
1599 | * properly happens and the data=ordered rules are followed. | |
1600 | * | |
c8b97818 | 1601 | * In our case any range that doesn't have the ORDERED bit set |
247e743c CM |
1602 | * hasn't been properly setup for IO. We kick off an async process |
1603 | * to fix it up. The async helper will wait for ordered extents, set | |
1604 | * the delalloc bit and make it safe to write the page. | |
1605 | */ | |
b2950863 | 1606 | static int btrfs_writepage_start_hook(struct page *page, u64 start, u64 end) |
247e743c CM |
1607 | { |
1608 | struct inode *inode = page->mapping->host; | |
1609 | struct btrfs_writepage_fixup *fixup; | |
1610 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
247e743c | 1611 | |
8b62b72b CM |
1612 | /* this page is properly in the ordered list */ |
1613 | if (TestClearPagePrivate2(page)) | |
247e743c CM |
1614 | return 0; |
1615 | ||
1616 | if (PageChecked(page)) | |
1617 | return -EAGAIN; | |
1618 | ||
1619 | fixup = kzalloc(sizeof(*fixup), GFP_NOFS); | |
1620 | if (!fixup) | |
1621 | return -EAGAIN; | |
f421950f | 1622 | |
247e743c CM |
1623 | SetPageChecked(page); |
1624 | page_cache_get(page); | |
1625 | fixup->work.func = btrfs_writepage_fixup_worker; | |
1626 | fixup->page = page; | |
1627 | btrfs_queue_worker(&root->fs_info->fixup_workers, &fixup->work); | |
1628 | return -EAGAIN; | |
1629 | } | |
1630 | ||
d899e052 YZ |
1631 | static int insert_reserved_file_extent(struct btrfs_trans_handle *trans, |
1632 | struct inode *inode, u64 file_pos, | |
1633 | u64 disk_bytenr, u64 disk_num_bytes, | |
1634 | u64 num_bytes, u64 ram_bytes, | |
1635 | u8 compression, u8 encryption, | |
1636 | u16 other_encoding, int extent_type) | |
1637 | { | |
1638 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
1639 | struct btrfs_file_extent_item *fi; | |
1640 | struct btrfs_path *path; | |
1641 | struct extent_buffer *leaf; | |
1642 | struct btrfs_key ins; | |
1643 | u64 hint; | |
1644 | int ret; | |
1645 | ||
1646 | path = btrfs_alloc_path(); | |
1647 | BUG_ON(!path); | |
1648 | ||
b9473439 | 1649 | path->leave_spinning = 1; |
a1ed835e CM |
1650 | |
1651 | /* | |
1652 | * we may be replacing one extent in the tree with another. | |
1653 | * The new extent is pinned in the extent map, and we don't want | |
1654 | * to drop it from the cache until it is completely in the btree. | |
1655 | * | |
1656 | * So, tell btrfs_drop_extents to leave this extent in the cache. | |
1657 | * the caller is expected to unpin it and allow it to be merged | |
1658 | * with the others. | |
1659 | */ | |
920bbbfb YZ |
1660 | ret = btrfs_drop_extents(trans, inode, file_pos, file_pos + num_bytes, |
1661 | &hint, 0); | |
d899e052 YZ |
1662 | BUG_ON(ret); |
1663 | ||
33345d01 | 1664 | ins.objectid = btrfs_ino(inode); |
d899e052 YZ |
1665 | ins.offset = file_pos; |
1666 | ins.type = BTRFS_EXTENT_DATA_KEY; | |
1667 | ret = btrfs_insert_empty_item(trans, root, path, &ins, sizeof(*fi)); | |
1668 | BUG_ON(ret); | |
1669 | leaf = path->nodes[0]; | |
1670 | fi = btrfs_item_ptr(leaf, path->slots[0], | |
1671 | struct btrfs_file_extent_item); | |
1672 | btrfs_set_file_extent_generation(leaf, fi, trans->transid); | |
1673 | btrfs_set_file_extent_type(leaf, fi, extent_type); | |
1674 | btrfs_set_file_extent_disk_bytenr(leaf, fi, disk_bytenr); | |
1675 | btrfs_set_file_extent_disk_num_bytes(leaf, fi, disk_num_bytes); | |
1676 | btrfs_set_file_extent_offset(leaf, fi, 0); | |
1677 | btrfs_set_file_extent_num_bytes(leaf, fi, num_bytes); | |
1678 | btrfs_set_file_extent_ram_bytes(leaf, fi, ram_bytes); | |
1679 | btrfs_set_file_extent_compression(leaf, fi, compression); | |
1680 | btrfs_set_file_extent_encryption(leaf, fi, encryption); | |
1681 | btrfs_set_file_extent_other_encoding(leaf, fi, other_encoding); | |
b9473439 CM |
1682 | |
1683 | btrfs_unlock_up_safe(path, 1); | |
1684 | btrfs_set_lock_blocking(leaf); | |
1685 | ||
d899e052 YZ |
1686 | btrfs_mark_buffer_dirty(leaf); |
1687 | ||
1688 | inode_add_bytes(inode, num_bytes); | |
d899e052 YZ |
1689 | |
1690 | ins.objectid = disk_bytenr; | |
1691 | ins.offset = disk_num_bytes; | |
1692 | ins.type = BTRFS_EXTENT_ITEM_KEY; | |
5d4f98a2 YZ |
1693 | ret = btrfs_alloc_reserved_file_extent(trans, root, |
1694 | root->root_key.objectid, | |
33345d01 | 1695 | btrfs_ino(inode), file_pos, &ins); |
d899e052 | 1696 | BUG_ON(ret); |
d899e052 | 1697 | btrfs_free_path(path); |
b9473439 | 1698 | |
d899e052 YZ |
1699 | return 0; |
1700 | } | |
1701 | ||
5d13a98f CM |
1702 | /* |
1703 | * helper function for btrfs_finish_ordered_io, this | |
1704 | * just reads in some of the csum leaves to prime them into ram | |
1705 | * before we start the transaction. It limits the amount of btree | |
1706 | * reads required while inside the transaction. | |
1707 | */ | |
d352ac68 CM |
1708 | /* as ordered data IO finishes, this gets called so we can finish |
1709 | * an ordered extent if the range of bytes in the file it covers are | |
1710 | * fully written. | |
1711 | */ | |
211f90e6 | 1712 | static int btrfs_finish_ordered_io(struct inode *inode, u64 start, u64 end) |
e6dcd2dc | 1713 | { |
e6dcd2dc | 1714 | struct btrfs_root *root = BTRFS_I(inode)->root; |
0ca1f7ce | 1715 | struct btrfs_trans_handle *trans = NULL; |
5d13a98f | 1716 | struct btrfs_ordered_extent *ordered_extent = NULL; |
e6dcd2dc | 1717 | struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree; |
2ac55d41 | 1718 | struct extent_state *cached_state = NULL; |
261507a0 | 1719 | int compress_type = 0; |
e6dcd2dc | 1720 | int ret; |
82d5902d | 1721 | bool nolock; |
e6dcd2dc | 1722 | |
5a1a3df1 JB |
1723 | ret = btrfs_dec_test_ordered_pending(inode, &ordered_extent, start, |
1724 | end - start + 1); | |
ba1da2f4 | 1725 | if (!ret) |
e6dcd2dc | 1726 | return 0; |
e6dcd2dc | 1727 | BUG_ON(!ordered_extent); |
efd049fb | 1728 | |
82d5902d | 1729 | nolock = is_free_space_inode(root, inode); |
0cb59c99 | 1730 | |
c2167754 YZ |
1731 | if (test_bit(BTRFS_ORDERED_NOCOW, &ordered_extent->flags)) { |
1732 | BUG_ON(!list_empty(&ordered_extent->list)); | |
1733 | ret = btrfs_ordered_update_i_size(inode, 0, ordered_extent); | |
1734 | if (!ret) { | |
0cb59c99 | 1735 | if (nolock) |
7a7eaa40 | 1736 | trans = btrfs_join_transaction_nolock(root); |
0cb59c99 | 1737 | else |
7a7eaa40 | 1738 | trans = btrfs_join_transaction(root); |
3612b495 | 1739 | BUG_ON(IS_ERR(trans)); |
0ca1f7ce | 1740 | trans->block_rsv = &root->fs_info->delalloc_block_rsv; |
c2167754 YZ |
1741 | ret = btrfs_update_inode(trans, root, inode); |
1742 | BUG_ON(ret); | |
c2167754 YZ |
1743 | } |
1744 | goto out; | |
1745 | } | |
e6dcd2dc | 1746 | |
2ac55d41 JB |
1747 | lock_extent_bits(io_tree, ordered_extent->file_offset, |
1748 | ordered_extent->file_offset + ordered_extent->len - 1, | |
1749 | 0, &cached_state, GFP_NOFS); | |
e6dcd2dc | 1750 | |
0cb59c99 | 1751 | if (nolock) |
7a7eaa40 | 1752 | trans = btrfs_join_transaction_nolock(root); |
0cb59c99 | 1753 | else |
7a7eaa40 | 1754 | trans = btrfs_join_transaction(root); |
3612b495 | 1755 | BUG_ON(IS_ERR(trans)); |
0ca1f7ce | 1756 | trans->block_rsv = &root->fs_info->delalloc_block_rsv; |
c2167754 | 1757 | |
c8b97818 | 1758 | if (test_bit(BTRFS_ORDERED_COMPRESSED, &ordered_extent->flags)) |
261507a0 | 1759 | compress_type = ordered_extent->compress_type; |
d899e052 | 1760 | if (test_bit(BTRFS_ORDERED_PREALLOC, &ordered_extent->flags)) { |
261507a0 | 1761 | BUG_ON(compress_type); |
920bbbfb | 1762 | ret = btrfs_mark_extent_written(trans, inode, |
d899e052 YZ |
1763 | ordered_extent->file_offset, |
1764 | ordered_extent->file_offset + | |
1765 | ordered_extent->len); | |
1766 | BUG_ON(ret); | |
1767 | } else { | |
0af3d00b | 1768 | BUG_ON(root == root->fs_info->tree_root); |
d899e052 YZ |
1769 | ret = insert_reserved_file_extent(trans, inode, |
1770 | ordered_extent->file_offset, | |
1771 | ordered_extent->start, | |
1772 | ordered_extent->disk_len, | |
1773 | ordered_extent->len, | |
1774 | ordered_extent->len, | |
261507a0 | 1775 | compress_type, 0, 0, |
d899e052 | 1776 | BTRFS_FILE_EXTENT_REG); |
a1ed835e CM |
1777 | unpin_extent_cache(&BTRFS_I(inode)->extent_tree, |
1778 | ordered_extent->file_offset, | |
1779 | ordered_extent->len); | |
d899e052 YZ |
1780 | BUG_ON(ret); |
1781 | } | |
2ac55d41 JB |
1782 | unlock_extent_cached(io_tree, ordered_extent->file_offset, |
1783 | ordered_extent->file_offset + | |
1784 | ordered_extent->len - 1, &cached_state, GFP_NOFS); | |
1785 | ||
e6dcd2dc CM |
1786 | add_pending_csums(trans, inode, ordered_extent->file_offset, |
1787 | &ordered_extent->list); | |
1788 | ||
1ef30be1 JB |
1789 | ret = btrfs_ordered_update_i_size(inode, 0, ordered_extent); |
1790 | if (!ret) { | |
1791 | ret = btrfs_update_inode(trans, root, inode); | |
1792 | BUG_ON(ret); | |
1793 | } | |
1794 | ret = 0; | |
c2167754 | 1795 | out: |
0cb59c99 JB |
1796 | if (nolock) { |
1797 | if (trans) | |
1798 | btrfs_end_transaction_nolock(trans, root); | |
1799 | } else { | |
1800 | btrfs_delalloc_release_metadata(inode, ordered_extent->len); | |
1801 | if (trans) | |
1802 | btrfs_end_transaction(trans, root); | |
1803 | } | |
1804 | ||
e6dcd2dc CM |
1805 | /* once for us */ |
1806 | btrfs_put_ordered_extent(ordered_extent); | |
1807 | /* once for the tree */ | |
1808 | btrfs_put_ordered_extent(ordered_extent); | |
1809 | ||
e6dcd2dc CM |
1810 | return 0; |
1811 | } | |
1812 | ||
b2950863 | 1813 | static int btrfs_writepage_end_io_hook(struct page *page, u64 start, u64 end, |
211f90e6 CM |
1814 | struct extent_state *state, int uptodate) |
1815 | { | |
1abe9b8a | 1816 | trace_btrfs_writepage_end_io_hook(page, start, end, uptodate); |
1817 | ||
8b62b72b | 1818 | ClearPagePrivate2(page); |
211f90e6 CM |
1819 | return btrfs_finish_ordered_io(page->mapping->host, start, end); |
1820 | } | |
1821 | ||
d352ac68 CM |
1822 | /* |
1823 | * When IO fails, either with EIO or csum verification fails, we | |
1824 | * try other mirrors that might have a good copy of the data. This | |
1825 | * io_failure_record is used to record state as we go through all the | |
1826 | * mirrors. If another mirror has good data, the page is set up to date | |
1827 | * and things continue. If a good mirror can't be found, the original | |
1828 | * bio end_io callback is called to indicate things have failed. | |
1829 | */ | |
7e38326f CM |
1830 | struct io_failure_record { |
1831 | struct page *page; | |
1832 | u64 start; | |
1833 | u64 len; | |
1834 | u64 logical; | |
d20f7043 | 1835 | unsigned long bio_flags; |
7e38326f CM |
1836 | int last_mirror; |
1837 | }; | |
1838 | ||
b2950863 | 1839 | static int btrfs_io_failed_hook(struct bio *failed_bio, |
1259ab75 CM |
1840 | struct page *page, u64 start, u64 end, |
1841 | struct extent_state *state) | |
7e38326f CM |
1842 | { |
1843 | struct io_failure_record *failrec = NULL; | |
1844 | u64 private; | |
1845 | struct extent_map *em; | |
1846 | struct inode *inode = page->mapping->host; | |
1847 | struct extent_io_tree *failure_tree = &BTRFS_I(inode)->io_failure_tree; | |
3b951516 | 1848 | struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree; |
7e38326f CM |
1849 | struct bio *bio; |
1850 | int num_copies; | |
1851 | int ret; | |
1259ab75 | 1852 | int rw; |
7e38326f CM |
1853 | u64 logical; |
1854 | ||
1855 | ret = get_state_private(failure_tree, start, &private); | |
1856 | if (ret) { | |
7e38326f CM |
1857 | failrec = kmalloc(sizeof(*failrec), GFP_NOFS); |
1858 | if (!failrec) | |
1859 | return -ENOMEM; | |
1860 | failrec->start = start; | |
1861 | failrec->len = end - start + 1; | |
1862 | failrec->last_mirror = 0; | |
d20f7043 | 1863 | failrec->bio_flags = 0; |
7e38326f | 1864 | |
890871be | 1865 | read_lock(&em_tree->lock); |
3b951516 CM |
1866 | em = lookup_extent_mapping(em_tree, start, failrec->len); |
1867 | if (em->start > start || em->start + em->len < start) { | |
1868 | free_extent_map(em); | |
1869 | em = NULL; | |
1870 | } | |
890871be | 1871 | read_unlock(&em_tree->lock); |
7e38326f | 1872 | |
c704005d | 1873 | if (IS_ERR_OR_NULL(em)) { |
7e38326f CM |
1874 | kfree(failrec); |
1875 | return -EIO; | |
1876 | } | |
1877 | logical = start - em->start; | |
1878 | logical = em->block_start + logical; | |
d20f7043 CM |
1879 | if (test_bit(EXTENT_FLAG_COMPRESSED, &em->flags)) { |
1880 | logical = em->block_start; | |
1881 | failrec->bio_flags = EXTENT_BIO_COMPRESSED; | |
261507a0 LZ |
1882 | extent_set_compress_type(&failrec->bio_flags, |
1883 | em->compress_type); | |
d20f7043 | 1884 | } |
7e38326f CM |
1885 | failrec->logical = logical; |
1886 | free_extent_map(em); | |
1887 | set_extent_bits(failure_tree, start, end, EXTENT_LOCKED | | |
1888 | EXTENT_DIRTY, GFP_NOFS); | |
587f7704 CM |
1889 | set_state_private(failure_tree, start, |
1890 | (u64)(unsigned long)failrec); | |
7e38326f | 1891 | } else { |
587f7704 | 1892 | failrec = (struct io_failure_record *)(unsigned long)private; |
7e38326f CM |
1893 | } |
1894 | num_copies = btrfs_num_copies( | |
1895 | &BTRFS_I(inode)->root->fs_info->mapping_tree, | |
1896 | failrec->logical, failrec->len); | |
1897 | failrec->last_mirror++; | |
1898 | if (!state) { | |
cad321ad | 1899 | spin_lock(&BTRFS_I(inode)->io_tree.lock); |
7e38326f CM |
1900 | state = find_first_extent_bit_state(&BTRFS_I(inode)->io_tree, |
1901 | failrec->start, | |
1902 | EXTENT_LOCKED); | |
1903 | if (state && state->start != failrec->start) | |
1904 | state = NULL; | |
cad321ad | 1905 | spin_unlock(&BTRFS_I(inode)->io_tree.lock); |
7e38326f CM |
1906 | } |
1907 | if (!state || failrec->last_mirror > num_copies) { | |
1908 | set_state_private(failure_tree, failrec->start, 0); | |
1909 | clear_extent_bits(failure_tree, failrec->start, | |
1910 | failrec->start + failrec->len - 1, | |
1911 | EXTENT_LOCKED | EXTENT_DIRTY, GFP_NOFS); | |
1912 | kfree(failrec); | |
1913 | return -EIO; | |
1914 | } | |
1915 | bio = bio_alloc(GFP_NOFS, 1); | |
1916 | bio->bi_private = state; | |
1917 | bio->bi_end_io = failed_bio->bi_end_io; | |
1918 | bio->bi_sector = failrec->logical >> 9; | |
1919 | bio->bi_bdev = failed_bio->bi_bdev; | |
e1c4b745 | 1920 | bio->bi_size = 0; |
d20f7043 | 1921 | |
7e38326f | 1922 | bio_add_page(bio, page, failrec->len, start - page_offset(page)); |
7b6d91da | 1923 | if (failed_bio->bi_rw & REQ_WRITE) |
1259ab75 CM |
1924 | rw = WRITE; |
1925 | else | |
1926 | rw = READ; | |
1927 | ||
c2db1073 | 1928 | ret = BTRFS_I(inode)->io_tree.ops->submit_bio_hook(inode, rw, bio, |
c8b97818 | 1929 | failrec->last_mirror, |
eaf25d93 | 1930 | failrec->bio_flags, 0); |
c2db1073 | 1931 | return ret; |
1259ab75 CM |
1932 | } |
1933 | ||
d352ac68 CM |
1934 | /* |
1935 | * each time an IO finishes, we do a fast check in the IO failure tree | |
1936 | * to see if we need to process or clean up an io_failure_record | |
1937 | */ | |
b2950863 | 1938 | static int btrfs_clean_io_failures(struct inode *inode, u64 start) |
1259ab75 CM |
1939 | { |
1940 | u64 private; | |
1941 | u64 private_failure; | |
1942 | struct io_failure_record *failure; | |
1943 | int ret; | |
1944 | ||
1945 | private = 0; | |
1946 | if (count_range_bits(&BTRFS_I(inode)->io_failure_tree, &private, | |
ec29ed5b | 1947 | (u64)-1, 1, EXTENT_DIRTY, 0)) { |
1259ab75 CM |
1948 | ret = get_state_private(&BTRFS_I(inode)->io_failure_tree, |
1949 | start, &private_failure); | |
1950 | if (ret == 0) { | |
1951 | failure = (struct io_failure_record *)(unsigned long) | |
1952 | private_failure; | |
1953 | set_state_private(&BTRFS_I(inode)->io_failure_tree, | |
1954 | failure->start, 0); | |
1955 | clear_extent_bits(&BTRFS_I(inode)->io_failure_tree, | |
1956 | failure->start, | |
1957 | failure->start + failure->len - 1, | |
1958 | EXTENT_DIRTY | EXTENT_LOCKED, | |
1959 | GFP_NOFS); | |
1960 | kfree(failure); | |
1961 | } | |
1962 | } | |
7e38326f CM |
1963 | return 0; |
1964 | } | |
1965 | ||
d352ac68 CM |
1966 | /* |
1967 | * when reads are done, we need to check csums to verify the data is correct | |
1968 | * if there's a match, we allow the bio to finish. If not, we go through | |
1969 | * the io_failure_record routines to find good copies | |
1970 | */ | |
b2950863 | 1971 | static int btrfs_readpage_end_io_hook(struct page *page, u64 start, u64 end, |
70dec807 | 1972 | struct extent_state *state) |
07157aac | 1973 | { |
35ebb934 | 1974 | size_t offset = start - ((u64)page->index << PAGE_CACHE_SHIFT); |
07157aac | 1975 | struct inode *inode = page->mapping->host; |
d1310b2e | 1976 | struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree; |
07157aac | 1977 | char *kaddr; |
aadfeb6e | 1978 | u64 private = ~(u32)0; |
07157aac | 1979 | int ret; |
ff79f819 CM |
1980 | struct btrfs_root *root = BTRFS_I(inode)->root; |
1981 | u32 csum = ~(u32)0; | |
d1310b2e | 1982 | |
d20f7043 CM |
1983 | if (PageChecked(page)) { |
1984 | ClearPageChecked(page); | |
1985 | goto good; | |
1986 | } | |
6cbff00f CH |
1987 | |
1988 | if (BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM) | |
08d2f347 | 1989 | goto good; |
17d217fe YZ |
1990 | |
1991 | if (root->root_key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID && | |
9655d298 | 1992 | test_range_bit(io_tree, start, end, EXTENT_NODATASUM, 1, NULL)) { |
17d217fe YZ |
1993 | clear_extent_bits(io_tree, start, end, EXTENT_NODATASUM, |
1994 | GFP_NOFS); | |
b6cda9bc | 1995 | return 0; |
17d217fe | 1996 | } |
d20f7043 | 1997 | |
c2e639f0 | 1998 | if (state && state->start == start) { |
70dec807 CM |
1999 | private = state->private; |
2000 | ret = 0; | |
2001 | } else { | |
2002 | ret = get_state_private(io_tree, start, &private); | |
2003 | } | |
9ab86c8e | 2004 | kaddr = kmap_atomic(page, KM_USER0); |
d397712b | 2005 | if (ret) |
07157aac | 2006 | goto zeroit; |
d397712b | 2007 | |
ff79f819 CM |
2008 | csum = btrfs_csum_data(root, kaddr + offset, csum, end - start + 1); |
2009 | btrfs_csum_final(csum, (char *)&csum); | |
d397712b | 2010 | if (csum != private) |
07157aac | 2011 | goto zeroit; |
d397712b | 2012 | |
9ab86c8e | 2013 | kunmap_atomic(kaddr, KM_USER0); |
d20f7043 | 2014 | good: |
7e38326f CM |
2015 | /* if the io failure tree for this inode is non-empty, |
2016 | * check to see if we've recovered from a failed IO | |
2017 | */ | |
1259ab75 | 2018 | btrfs_clean_io_failures(inode, start); |
07157aac CM |
2019 | return 0; |
2020 | ||
2021 | zeroit: | |
945d8962 | 2022 | printk_ratelimited(KERN_INFO "btrfs csum failed ino %llu off %llu csum %u " |
33345d01 LZ |
2023 | "private %llu\n", |
2024 | (unsigned long long)btrfs_ino(page->mapping->host), | |
193f284d CM |
2025 | (unsigned long long)start, csum, |
2026 | (unsigned long long)private); | |
db94535d CM |
2027 | memset(kaddr + offset, 1, end - start + 1); |
2028 | flush_dcache_page(page); | |
9ab86c8e | 2029 | kunmap_atomic(kaddr, KM_USER0); |
3b951516 CM |
2030 | if (private == 0) |
2031 | return 0; | |
7e38326f | 2032 | return -EIO; |
07157aac | 2033 | } |
b888db2b | 2034 | |
24bbcf04 YZ |
2035 | struct delayed_iput { |
2036 | struct list_head list; | |
2037 | struct inode *inode; | |
2038 | }; | |
2039 | ||
2040 | void btrfs_add_delayed_iput(struct inode *inode) | |
2041 | { | |
2042 | struct btrfs_fs_info *fs_info = BTRFS_I(inode)->root->fs_info; | |
2043 | struct delayed_iput *delayed; | |
2044 | ||
2045 | if (atomic_add_unless(&inode->i_count, -1, 1)) | |
2046 | return; | |
2047 | ||
2048 | delayed = kmalloc(sizeof(*delayed), GFP_NOFS | __GFP_NOFAIL); | |
2049 | delayed->inode = inode; | |
2050 | ||
2051 | spin_lock(&fs_info->delayed_iput_lock); | |
2052 | list_add_tail(&delayed->list, &fs_info->delayed_iputs); | |
2053 | spin_unlock(&fs_info->delayed_iput_lock); | |
2054 | } | |
2055 | ||
2056 | void btrfs_run_delayed_iputs(struct btrfs_root *root) | |
2057 | { | |
2058 | LIST_HEAD(list); | |
2059 | struct btrfs_fs_info *fs_info = root->fs_info; | |
2060 | struct delayed_iput *delayed; | |
2061 | int empty; | |
2062 | ||
2063 | spin_lock(&fs_info->delayed_iput_lock); | |
2064 | empty = list_empty(&fs_info->delayed_iputs); | |
2065 | spin_unlock(&fs_info->delayed_iput_lock); | |
2066 | if (empty) | |
2067 | return; | |
2068 | ||
2069 | down_read(&root->fs_info->cleanup_work_sem); | |
2070 | spin_lock(&fs_info->delayed_iput_lock); | |
2071 | list_splice_init(&fs_info->delayed_iputs, &list); | |
2072 | spin_unlock(&fs_info->delayed_iput_lock); | |
2073 | ||
2074 | while (!list_empty(&list)) { | |
2075 | delayed = list_entry(list.next, struct delayed_iput, list); | |
2076 | list_del(&delayed->list); | |
2077 | iput(delayed->inode); | |
2078 | kfree(delayed); | |
2079 | } | |
2080 | up_read(&root->fs_info->cleanup_work_sem); | |
2081 | } | |
2082 | ||
d68fc57b YZ |
2083 | /* |
2084 | * calculate extra metadata reservation when snapshotting a subvolume | |
2085 | * contains orphan files. | |
2086 | */ | |
2087 | void btrfs_orphan_pre_snapshot(struct btrfs_trans_handle *trans, | |
2088 | struct btrfs_pending_snapshot *pending, | |
2089 | u64 *bytes_to_reserve) | |
2090 | { | |
2091 | struct btrfs_root *root; | |
2092 | struct btrfs_block_rsv *block_rsv; | |
2093 | u64 num_bytes; | |
2094 | int index; | |
2095 | ||
2096 | root = pending->root; | |
2097 | if (!root->orphan_block_rsv || list_empty(&root->orphan_list)) | |
2098 | return; | |
2099 | ||
2100 | block_rsv = root->orphan_block_rsv; | |
2101 | ||
2102 | /* orphan block reservation for the snapshot */ | |
2103 | num_bytes = block_rsv->size; | |
2104 | ||
2105 | /* | |
2106 | * after the snapshot is created, COWing tree blocks may use more | |
2107 | * space than it frees. So we should make sure there is enough | |
2108 | * reserved space. | |
2109 | */ | |
2110 | index = trans->transid & 0x1; | |
2111 | if (block_rsv->reserved + block_rsv->freed[index] < block_rsv->size) { | |
2112 | num_bytes += block_rsv->size - | |
2113 | (block_rsv->reserved + block_rsv->freed[index]); | |
2114 | } | |
2115 | ||
2116 | *bytes_to_reserve += num_bytes; | |
2117 | } | |
2118 | ||
2119 | void btrfs_orphan_post_snapshot(struct btrfs_trans_handle *trans, | |
2120 | struct btrfs_pending_snapshot *pending) | |
2121 | { | |
2122 | struct btrfs_root *root = pending->root; | |
2123 | struct btrfs_root *snap = pending->snap; | |
2124 | struct btrfs_block_rsv *block_rsv; | |
2125 | u64 num_bytes; | |
2126 | int index; | |
2127 | int ret; | |
2128 | ||
2129 | if (!root->orphan_block_rsv || list_empty(&root->orphan_list)) | |
2130 | return; | |
2131 | ||
2132 | /* refill source subvolume's orphan block reservation */ | |
2133 | block_rsv = root->orphan_block_rsv; | |
2134 | index = trans->transid & 0x1; | |
2135 | if (block_rsv->reserved + block_rsv->freed[index] < block_rsv->size) { | |
2136 | num_bytes = block_rsv->size - | |
2137 | (block_rsv->reserved + block_rsv->freed[index]); | |
2138 | ret = btrfs_block_rsv_migrate(&pending->block_rsv, | |
2139 | root->orphan_block_rsv, | |
2140 | num_bytes); | |
2141 | BUG_ON(ret); | |
2142 | } | |
2143 | ||
2144 | /* setup orphan block reservation for the snapshot */ | |
2145 | block_rsv = btrfs_alloc_block_rsv(snap); | |
2146 | BUG_ON(!block_rsv); | |
2147 | ||
2148 | btrfs_add_durable_block_rsv(root->fs_info, block_rsv); | |
2149 | snap->orphan_block_rsv = block_rsv; | |
2150 | ||
2151 | num_bytes = root->orphan_block_rsv->size; | |
2152 | ret = btrfs_block_rsv_migrate(&pending->block_rsv, | |
2153 | block_rsv, num_bytes); | |
2154 | BUG_ON(ret); | |
2155 | ||
2156 | #if 0 | |
2157 | /* insert orphan item for the snapshot */ | |
2158 | WARN_ON(!root->orphan_item_inserted); | |
2159 | ret = btrfs_insert_orphan_item(trans, root->fs_info->tree_root, | |
2160 | snap->root_key.objectid); | |
2161 | BUG_ON(ret); | |
2162 | snap->orphan_item_inserted = 1; | |
2163 | #endif | |
2164 | } | |
2165 | ||
2166 | enum btrfs_orphan_cleanup_state { | |
2167 | ORPHAN_CLEANUP_STARTED = 1, | |
2168 | ORPHAN_CLEANUP_DONE = 2, | |
2169 | }; | |
2170 | ||
2171 | /* | |
2172 | * This is called in transaction commmit time. If there are no orphan | |
2173 | * files in the subvolume, it removes orphan item and frees block_rsv | |
2174 | * structure. | |
2175 | */ | |
2176 | void btrfs_orphan_commit_root(struct btrfs_trans_handle *trans, | |
2177 | struct btrfs_root *root) | |
2178 | { | |
2179 | int ret; | |
2180 | ||
2181 | if (!list_empty(&root->orphan_list) || | |
2182 | root->orphan_cleanup_state != ORPHAN_CLEANUP_DONE) | |
2183 | return; | |
2184 | ||
2185 | if (root->orphan_item_inserted && | |
2186 | btrfs_root_refs(&root->root_item) > 0) { | |
2187 | ret = btrfs_del_orphan_item(trans, root->fs_info->tree_root, | |
2188 | root->root_key.objectid); | |
2189 | BUG_ON(ret); | |
2190 | root->orphan_item_inserted = 0; | |
2191 | } | |
2192 | ||
2193 | if (root->orphan_block_rsv) { | |
2194 | WARN_ON(root->orphan_block_rsv->size > 0); | |
2195 | btrfs_free_block_rsv(root, root->orphan_block_rsv); | |
2196 | root->orphan_block_rsv = NULL; | |
2197 | } | |
2198 | } | |
2199 | ||
7b128766 JB |
2200 | /* |
2201 | * This creates an orphan entry for the given inode in case something goes | |
2202 | * wrong in the middle of an unlink/truncate. | |
d68fc57b YZ |
2203 | * |
2204 | * NOTE: caller of this function should reserve 5 units of metadata for | |
2205 | * this function. | |
7b128766 JB |
2206 | */ |
2207 | int btrfs_orphan_add(struct btrfs_trans_handle *trans, struct inode *inode) | |
2208 | { | |
2209 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
d68fc57b YZ |
2210 | struct btrfs_block_rsv *block_rsv = NULL; |
2211 | int reserve = 0; | |
2212 | int insert = 0; | |
2213 | int ret; | |
7b128766 | 2214 | |
d68fc57b YZ |
2215 | if (!root->orphan_block_rsv) { |
2216 | block_rsv = btrfs_alloc_block_rsv(root); | |
2217 | BUG_ON(!block_rsv); | |
2218 | } | |
7b128766 | 2219 | |
d68fc57b YZ |
2220 | spin_lock(&root->orphan_lock); |
2221 | if (!root->orphan_block_rsv) { | |
2222 | root->orphan_block_rsv = block_rsv; | |
2223 | } else if (block_rsv) { | |
2224 | btrfs_free_block_rsv(root, block_rsv); | |
2225 | block_rsv = NULL; | |
7b128766 | 2226 | } |
7b128766 | 2227 | |
d68fc57b YZ |
2228 | if (list_empty(&BTRFS_I(inode)->i_orphan)) { |
2229 | list_add(&BTRFS_I(inode)->i_orphan, &root->orphan_list); | |
2230 | #if 0 | |
2231 | /* | |
2232 | * For proper ENOSPC handling, we should do orphan | |
2233 | * cleanup when mounting. But this introduces backward | |
2234 | * compatibility issue. | |
2235 | */ | |
2236 | if (!xchg(&root->orphan_item_inserted, 1)) | |
2237 | insert = 2; | |
2238 | else | |
2239 | insert = 1; | |
2240 | #endif | |
2241 | insert = 1; | |
7b128766 JB |
2242 | } |
2243 | ||
d68fc57b YZ |
2244 | if (!BTRFS_I(inode)->orphan_meta_reserved) { |
2245 | BTRFS_I(inode)->orphan_meta_reserved = 1; | |
2246 | reserve = 1; | |
2247 | } | |
2248 | spin_unlock(&root->orphan_lock); | |
7b128766 | 2249 | |
d68fc57b YZ |
2250 | if (block_rsv) |
2251 | btrfs_add_durable_block_rsv(root->fs_info, block_rsv); | |
7b128766 | 2252 | |
d68fc57b YZ |
2253 | /* grab metadata reservation from transaction handle */ |
2254 | if (reserve) { | |
2255 | ret = btrfs_orphan_reserve_metadata(trans, inode); | |
2256 | BUG_ON(ret); | |
2257 | } | |
7b128766 | 2258 | |
d68fc57b YZ |
2259 | /* insert an orphan item to track this unlinked/truncated file */ |
2260 | if (insert >= 1) { | |
33345d01 | 2261 | ret = btrfs_insert_orphan_item(trans, root, btrfs_ino(inode)); |
d68fc57b YZ |
2262 | BUG_ON(ret); |
2263 | } | |
2264 | ||
2265 | /* insert an orphan item to track subvolume contains orphan files */ | |
2266 | if (insert >= 2) { | |
2267 | ret = btrfs_insert_orphan_item(trans, root->fs_info->tree_root, | |
2268 | root->root_key.objectid); | |
2269 | BUG_ON(ret); | |
2270 | } | |
2271 | return 0; | |
7b128766 JB |
2272 | } |
2273 | ||
2274 | /* | |
2275 | * We have done the truncate/delete so we can go ahead and remove the orphan | |
2276 | * item for this particular inode. | |
2277 | */ | |
2278 | int btrfs_orphan_del(struct btrfs_trans_handle *trans, struct inode *inode) | |
2279 | { | |
2280 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
d68fc57b YZ |
2281 | int delete_item = 0; |
2282 | int release_rsv = 0; | |
7b128766 JB |
2283 | int ret = 0; |
2284 | ||
d68fc57b YZ |
2285 | spin_lock(&root->orphan_lock); |
2286 | if (!list_empty(&BTRFS_I(inode)->i_orphan)) { | |
2287 | list_del_init(&BTRFS_I(inode)->i_orphan); | |
2288 | delete_item = 1; | |
7b128766 JB |
2289 | } |
2290 | ||
d68fc57b YZ |
2291 | if (BTRFS_I(inode)->orphan_meta_reserved) { |
2292 | BTRFS_I(inode)->orphan_meta_reserved = 0; | |
2293 | release_rsv = 1; | |
7b128766 | 2294 | } |
d68fc57b | 2295 | spin_unlock(&root->orphan_lock); |
7b128766 | 2296 | |
d68fc57b | 2297 | if (trans && delete_item) { |
33345d01 | 2298 | ret = btrfs_del_orphan_item(trans, root, btrfs_ino(inode)); |
d68fc57b YZ |
2299 | BUG_ON(ret); |
2300 | } | |
7b128766 | 2301 | |
d68fc57b YZ |
2302 | if (release_rsv) |
2303 | btrfs_orphan_release_metadata(inode); | |
7b128766 | 2304 | |
d68fc57b | 2305 | return 0; |
7b128766 JB |
2306 | } |
2307 | ||
2308 | /* | |
2309 | * this cleans up any orphans that may be left on the list from the last use | |
2310 | * of this root. | |
2311 | */ | |
66b4ffd1 | 2312 | int btrfs_orphan_cleanup(struct btrfs_root *root) |
7b128766 JB |
2313 | { |
2314 | struct btrfs_path *path; | |
2315 | struct extent_buffer *leaf; | |
7b128766 JB |
2316 | struct btrfs_key key, found_key; |
2317 | struct btrfs_trans_handle *trans; | |
2318 | struct inode *inode; | |
2319 | int ret = 0, nr_unlink = 0, nr_truncate = 0; | |
2320 | ||
d68fc57b | 2321 | if (cmpxchg(&root->orphan_cleanup_state, 0, ORPHAN_CLEANUP_STARTED)) |
66b4ffd1 | 2322 | return 0; |
c71bf099 YZ |
2323 | |
2324 | path = btrfs_alloc_path(); | |
66b4ffd1 JB |
2325 | if (!path) { |
2326 | ret = -ENOMEM; | |
2327 | goto out; | |
2328 | } | |
7b128766 JB |
2329 | path->reada = -1; |
2330 | ||
2331 | key.objectid = BTRFS_ORPHAN_OBJECTID; | |
2332 | btrfs_set_key_type(&key, BTRFS_ORPHAN_ITEM_KEY); | |
2333 | key.offset = (u64)-1; | |
2334 | ||
7b128766 JB |
2335 | while (1) { |
2336 | ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); | |
66b4ffd1 JB |
2337 | if (ret < 0) |
2338 | goto out; | |
7b128766 JB |
2339 | |
2340 | /* | |
2341 | * if ret == 0 means we found what we were searching for, which | |
25985edc | 2342 | * is weird, but possible, so only screw with path if we didn't |
7b128766 JB |
2343 | * find the key and see if we have stuff that matches |
2344 | */ | |
2345 | if (ret > 0) { | |
66b4ffd1 | 2346 | ret = 0; |
7b128766 JB |
2347 | if (path->slots[0] == 0) |
2348 | break; | |
2349 | path->slots[0]--; | |
2350 | } | |
2351 | ||
2352 | /* pull out the item */ | |
2353 | leaf = path->nodes[0]; | |
7b128766 JB |
2354 | btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); |
2355 | ||
2356 | /* make sure the item matches what we want */ | |
2357 | if (found_key.objectid != BTRFS_ORPHAN_OBJECTID) | |
2358 | break; | |
2359 | if (btrfs_key_type(&found_key) != BTRFS_ORPHAN_ITEM_KEY) | |
2360 | break; | |
2361 | ||
2362 | /* release the path since we're done with it */ | |
b3b4aa74 | 2363 | btrfs_release_path(path); |
7b128766 JB |
2364 | |
2365 | /* | |
2366 | * this is where we are basically btrfs_lookup, without the | |
2367 | * crossing root thing. we store the inode number in the | |
2368 | * offset of the orphan item. | |
2369 | */ | |
5d4f98a2 YZ |
2370 | found_key.objectid = found_key.offset; |
2371 | found_key.type = BTRFS_INODE_ITEM_KEY; | |
2372 | found_key.offset = 0; | |
73f73415 | 2373 | inode = btrfs_iget(root->fs_info->sb, &found_key, root, NULL); |
66b4ffd1 JB |
2374 | if (IS_ERR(inode)) { |
2375 | ret = PTR_ERR(inode); | |
2376 | goto out; | |
2377 | } | |
7b128766 | 2378 | |
7b128766 JB |
2379 | /* |
2380 | * add this inode to the orphan list so btrfs_orphan_del does | |
2381 | * the proper thing when we hit it | |
2382 | */ | |
d68fc57b | 2383 | spin_lock(&root->orphan_lock); |
7b128766 | 2384 | list_add(&BTRFS_I(inode)->i_orphan, &root->orphan_list); |
d68fc57b | 2385 | spin_unlock(&root->orphan_lock); |
7b128766 JB |
2386 | |
2387 | /* | |
2388 | * if this is a bad inode, means we actually succeeded in | |
2389 | * removing the inode, but not the orphan record, which means | |
2390 | * we need to manually delete the orphan since iput will just | |
2391 | * do a destroy_inode | |
2392 | */ | |
2393 | if (is_bad_inode(inode)) { | |
a22285a6 | 2394 | trans = btrfs_start_transaction(root, 0); |
66b4ffd1 JB |
2395 | if (IS_ERR(trans)) { |
2396 | ret = PTR_ERR(trans); | |
2397 | goto out; | |
2398 | } | |
7b128766 | 2399 | btrfs_orphan_del(trans, inode); |
5b21f2ed | 2400 | btrfs_end_transaction(trans, root); |
7b128766 JB |
2401 | iput(inode); |
2402 | continue; | |
2403 | } | |
2404 | ||
2405 | /* if we have links, this was a truncate, lets do that */ | |
2406 | if (inode->i_nlink) { | |
a41ad394 JB |
2407 | if (!S_ISREG(inode->i_mode)) { |
2408 | WARN_ON(1); | |
2409 | iput(inode); | |
2410 | continue; | |
2411 | } | |
7b128766 | 2412 | nr_truncate++; |
66b4ffd1 | 2413 | ret = btrfs_truncate(inode); |
7b128766 JB |
2414 | } else { |
2415 | nr_unlink++; | |
2416 | } | |
2417 | ||
2418 | /* this will do delete_inode and everything for us */ | |
2419 | iput(inode); | |
66b4ffd1 JB |
2420 | if (ret) |
2421 | goto out; | |
7b128766 | 2422 | } |
d68fc57b YZ |
2423 | root->orphan_cleanup_state = ORPHAN_CLEANUP_DONE; |
2424 | ||
2425 | if (root->orphan_block_rsv) | |
2426 | btrfs_block_rsv_release(root, root->orphan_block_rsv, | |
2427 | (u64)-1); | |
2428 | ||
2429 | if (root->orphan_block_rsv || root->orphan_item_inserted) { | |
7a7eaa40 | 2430 | trans = btrfs_join_transaction(root); |
66b4ffd1 JB |
2431 | if (!IS_ERR(trans)) |
2432 | btrfs_end_transaction(trans, root); | |
d68fc57b | 2433 | } |
7b128766 JB |
2434 | |
2435 | if (nr_unlink) | |
2436 | printk(KERN_INFO "btrfs: unlinked %d orphans\n", nr_unlink); | |
2437 | if (nr_truncate) | |
2438 | printk(KERN_INFO "btrfs: truncated %d orphans\n", nr_truncate); | |
66b4ffd1 JB |
2439 | |
2440 | out: | |
2441 | if (ret) | |
2442 | printk(KERN_CRIT "btrfs: could not do orphan cleanup %d\n", ret); | |
2443 | btrfs_free_path(path); | |
2444 | return ret; | |
7b128766 JB |
2445 | } |
2446 | ||
46a53cca CM |
2447 | /* |
2448 | * very simple check to peek ahead in the leaf looking for xattrs. If we | |
2449 | * don't find any xattrs, we know there can't be any acls. | |
2450 | * | |
2451 | * slot is the slot the inode is in, objectid is the objectid of the inode | |
2452 | */ | |
2453 | static noinline int acls_after_inode_item(struct extent_buffer *leaf, | |
2454 | int slot, u64 objectid) | |
2455 | { | |
2456 | u32 nritems = btrfs_header_nritems(leaf); | |
2457 | struct btrfs_key found_key; | |
2458 | int scanned = 0; | |
2459 | ||
2460 | slot++; | |
2461 | while (slot < nritems) { | |
2462 | btrfs_item_key_to_cpu(leaf, &found_key, slot); | |
2463 | ||
2464 | /* we found a different objectid, there must not be acls */ | |
2465 | if (found_key.objectid != objectid) | |
2466 | return 0; | |
2467 | ||
2468 | /* we found an xattr, assume we've got an acl */ | |
2469 | if (found_key.type == BTRFS_XATTR_ITEM_KEY) | |
2470 | return 1; | |
2471 | ||
2472 | /* | |
2473 | * we found a key greater than an xattr key, there can't | |
2474 | * be any acls later on | |
2475 | */ | |
2476 | if (found_key.type > BTRFS_XATTR_ITEM_KEY) | |
2477 | return 0; | |
2478 | ||
2479 | slot++; | |
2480 | scanned++; | |
2481 | ||
2482 | /* | |
2483 | * it goes inode, inode backrefs, xattrs, extents, | |
2484 | * so if there are a ton of hard links to an inode there can | |
2485 | * be a lot of backrefs. Don't waste time searching too hard, | |
2486 | * this is just an optimization | |
2487 | */ | |
2488 | if (scanned >= 8) | |
2489 | break; | |
2490 | } | |
2491 | /* we hit the end of the leaf before we found an xattr or | |
2492 | * something larger than an xattr. We have to assume the inode | |
2493 | * has acls | |
2494 | */ | |
2495 | return 1; | |
2496 | } | |
2497 | ||
d352ac68 CM |
2498 | /* |
2499 | * read an inode from the btree into the in-memory inode | |
2500 | */ | |
5d4f98a2 | 2501 | static void btrfs_read_locked_inode(struct inode *inode) |
39279cc3 CM |
2502 | { |
2503 | struct btrfs_path *path; | |
5f39d397 | 2504 | struct extent_buffer *leaf; |
39279cc3 | 2505 | struct btrfs_inode_item *inode_item; |
0b86a832 | 2506 | struct btrfs_timespec *tspec; |
39279cc3 CM |
2507 | struct btrfs_root *root = BTRFS_I(inode)->root; |
2508 | struct btrfs_key location; | |
46a53cca | 2509 | int maybe_acls; |
618e21d5 | 2510 | u32 rdev; |
39279cc3 | 2511 | int ret; |
2f7e33d4 MX |
2512 | bool filled = false; |
2513 | ||
2514 | ret = btrfs_fill_inode(inode, &rdev); | |
2515 | if (!ret) | |
2516 | filled = true; | |
39279cc3 CM |
2517 | |
2518 | path = btrfs_alloc_path(); | |
2519 | BUG_ON(!path); | |
d90c7321 | 2520 | path->leave_spinning = 1; |
39279cc3 | 2521 | memcpy(&location, &BTRFS_I(inode)->location, sizeof(location)); |
dc17ff8f | 2522 | |
39279cc3 | 2523 | ret = btrfs_lookup_inode(NULL, root, path, &location, 0); |
5f39d397 | 2524 | if (ret) |
39279cc3 | 2525 | goto make_bad; |
39279cc3 | 2526 | |
5f39d397 | 2527 | leaf = path->nodes[0]; |
2f7e33d4 MX |
2528 | |
2529 | if (filled) | |
2530 | goto cache_acl; | |
2531 | ||
5f39d397 CM |
2532 | inode_item = btrfs_item_ptr(leaf, path->slots[0], |
2533 | struct btrfs_inode_item); | |
d90c7321 JB |
2534 | if (!leaf->map_token) |
2535 | map_private_extent_buffer(leaf, (unsigned long)inode_item, | |
2536 | sizeof(struct btrfs_inode_item), | |
2537 | &leaf->map_token, &leaf->kaddr, | |
2538 | &leaf->map_start, &leaf->map_len, | |
2539 | KM_USER1); | |
5f39d397 CM |
2540 | |
2541 | inode->i_mode = btrfs_inode_mode(leaf, inode_item); | |
2542 | inode->i_nlink = btrfs_inode_nlink(leaf, inode_item); | |
2543 | inode->i_uid = btrfs_inode_uid(leaf, inode_item); | |
2544 | inode->i_gid = btrfs_inode_gid(leaf, inode_item); | |
dbe674a9 | 2545 | btrfs_i_size_write(inode, btrfs_inode_size(leaf, inode_item)); |
5f39d397 CM |
2546 | |
2547 | tspec = btrfs_inode_atime(inode_item); | |
2548 | inode->i_atime.tv_sec = btrfs_timespec_sec(leaf, tspec); | |
2549 | inode->i_atime.tv_nsec = btrfs_timespec_nsec(leaf, tspec); | |
2550 | ||
2551 | tspec = btrfs_inode_mtime(inode_item); | |
2552 | inode->i_mtime.tv_sec = btrfs_timespec_sec(leaf, tspec); | |
2553 | inode->i_mtime.tv_nsec = btrfs_timespec_nsec(leaf, tspec); | |
2554 | ||
2555 | tspec = btrfs_inode_ctime(inode_item); | |
2556 | inode->i_ctime.tv_sec = btrfs_timespec_sec(leaf, tspec); | |
2557 | inode->i_ctime.tv_nsec = btrfs_timespec_nsec(leaf, tspec); | |
2558 | ||
a76a3cd4 | 2559 | inode_set_bytes(inode, btrfs_inode_nbytes(leaf, inode_item)); |
e02119d5 | 2560 | BTRFS_I(inode)->generation = btrfs_inode_generation(leaf, inode_item); |
c3027eb5 | 2561 | BTRFS_I(inode)->sequence = btrfs_inode_sequence(leaf, inode_item); |
e02119d5 | 2562 | inode->i_generation = BTRFS_I(inode)->generation; |
618e21d5 | 2563 | inode->i_rdev = 0; |
5f39d397 CM |
2564 | rdev = btrfs_inode_rdev(leaf, inode_item); |
2565 | ||
aec7477b | 2566 | BTRFS_I(inode)->index_cnt = (u64)-1; |
d2fb3437 | 2567 | BTRFS_I(inode)->flags = btrfs_inode_flags(leaf, inode_item); |
2f7e33d4 | 2568 | cache_acl: |
46a53cca CM |
2569 | /* |
2570 | * try to precache a NULL acl entry for files that don't have | |
2571 | * any xattrs or acls | |
2572 | */ | |
33345d01 LZ |
2573 | maybe_acls = acls_after_inode_item(leaf, path->slots[0], |
2574 | btrfs_ino(inode)); | |
72c04902 AV |
2575 | if (!maybe_acls) |
2576 | cache_no_acl(inode); | |
46a53cca | 2577 | |
d90c7321 JB |
2578 | if (leaf->map_token) { |
2579 | unmap_extent_buffer(leaf, leaf->map_token, KM_USER1); | |
2580 | leaf->map_token = NULL; | |
2581 | } | |
2582 | ||
39279cc3 | 2583 | btrfs_free_path(path); |
39279cc3 | 2584 | |
39279cc3 | 2585 | switch (inode->i_mode & S_IFMT) { |
39279cc3 CM |
2586 | case S_IFREG: |
2587 | inode->i_mapping->a_ops = &btrfs_aops; | |
04160088 | 2588 | inode->i_mapping->backing_dev_info = &root->fs_info->bdi; |
d1310b2e | 2589 | BTRFS_I(inode)->io_tree.ops = &btrfs_extent_io_ops; |
39279cc3 CM |
2590 | inode->i_fop = &btrfs_file_operations; |
2591 | inode->i_op = &btrfs_file_inode_operations; | |
2592 | break; | |
2593 | case S_IFDIR: | |
2594 | inode->i_fop = &btrfs_dir_file_operations; | |
2595 | if (root == root->fs_info->tree_root) | |
2596 | inode->i_op = &btrfs_dir_ro_inode_operations; | |
2597 | else | |
2598 | inode->i_op = &btrfs_dir_inode_operations; | |
2599 | break; | |
2600 | case S_IFLNK: | |
2601 | inode->i_op = &btrfs_symlink_inode_operations; | |
2602 | inode->i_mapping->a_ops = &btrfs_symlink_aops; | |
04160088 | 2603 | inode->i_mapping->backing_dev_info = &root->fs_info->bdi; |
39279cc3 | 2604 | break; |
618e21d5 | 2605 | default: |
0279b4cd | 2606 | inode->i_op = &btrfs_special_inode_operations; |
618e21d5 JB |
2607 | init_special_inode(inode, inode->i_mode, rdev); |
2608 | break; | |
39279cc3 | 2609 | } |
6cbff00f CH |
2610 | |
2611 | btrfs_update_iflags(inode); | |
39279cc3 CM |
2612 | return; |
2613 | ||
2614 | make_bad: | |
39279cc3 | 2615 | btrfs_free_path(path); |
39279cc3 CM |
2616 | make_bad_inode(inode); |
2617 | } | |
2618 | ||
d352ac68 CM |
2619 | /* |
2620 | * given a leaf and an inode, copy the inode fields into the leaf | |
2621 | */ | |
e02119d5 CM |
2622 | static void fill_inode_item(struct btrfs_trans_handle *trans, |
2623 | struct extent_buffer *leaf, | |
5f39d397 | 2624 | struct btrfs_inode_item *item, |
39279cc3 CM |
2625 | struct inode *inode) |
2626 | { | |
12ddb96c JB |
2627 | if (!leaf->map_token) |
2628 | map_private_extent_buffer(leaf, (unsigned long)item, | |
2629 | sizeof(struct btrfs_inode_item), | |
2630 | &leaf->map_token, &leaf->kaddr, | |
2631 | &leaf->map_start, &leaf->map_len, | |
2632 | KM_USER1); | |
2633 | ||
5f39d397 CM |
2634 | btrfs_set_inode_uid(leaf, item, inode->i_uid); |
2635 | btrfs_set_inode_gid(leaf, item, inode->i_gid); | |
dbe674a9 | 2636 | btrfs_set_inode_size(leaf, item, BTRFS_I(inode)->disk_i_size); |
5f39d397 CM |
2637 | btrfs_set_inode_mode(leaf, item, inode->i_mode); |
2638 | btrfs_set_inode_nlink(leaf, item, inode->i_nlink); | |
2639 | ||
2640 | btrfs_set_timespec_sec(leaf, btrfs_inode_atime(item), | |
2641 | inode->i_atime.tv_sec); | |
2642 | btrfs_set_timespec_nsec(leaf, btrfs_inode_atime(item), | |
2643 | inode->i_atime.tv_nsec); | |
2644 | ||
2645 | btrfs_set_timespec_sec(leaf, btrfs_inode_mtime(item), | |
2646 | inode->i_mtime.tv_sec); | |
2647 | btrfs_set_timespec_nsec(leaf, btrfs_inode_mtime(item), | |
2648 | inode->i_mtime.tv_nsec); | |
2649 | ||
2650 | btrfs_set_timespec_sec(leaf, btrfs_inode_ctime(item), | |
2651 | inode->i_ctime.tv_sec); | |
2652 | btrfs_set_timespec_nsec(leaf, btrfs_inode_ctime(item), | |
2653 | inode->i_ctime.tv_nsec); | |
2654 | ||
a76a3cd4 | 2655 | btrfs_set_inode_nbytes(leaf, item, inode_get_bytes(inode)); |
e02119d5 | 2656 | btrfs_set_inode_generation(leaf, item, BTRFS_I(inode)->generation); |
c3027eb5 | 2657 | btrfs_set_inode_sequence(leaf, item, BTRFS_I(inode)->sequence); |
e02119d5 | 2658 | btrfs_set_inode_transid(leaf, item, trans->transid); |
5f39d397 | 2659 | btrfs_set_inode_rdev(leaf, item, inode->i_rdev); |
b98b6767 | 2660 | btrfs_set_inode_flags(leaf, item, BTRFS_I(inode)->flags); |
d82a6f1d | 2661 | btrfs_set_inode_block_group(leaf, item, 0); |
12ddb96c JB |
2662 | |
2663 | if (leaf->map_token) { | |
2664 | unmap_extent_buffer(leaf, leaf->map_token, KM_USER1); | |
2665 | leaf->map_token = NULL; | |
2666 | } | |
39279cc3 CM |
2667 | } |
2668 | ||
d352ac68 CM |
2669 | /* |
2670 | * copy everything in the in-memory inode into the btree. | |
2671 | */ | |
d397712b CM |
2672 | noinline int btrfs_update_inode(struct btrfs_trans_handle *trans, |
2673 | struct btrfs_root *root, struct inode *inode) | |
39279cc3 CM |
2674 | { |
2675 | struct btrfs_inode_item *inode_item; | |
2676 | struct btrfs_path *path; | |
5f39d397 | 2677 | struct extent_buffer *leaf; |
39279cc3 CM |
2678 | int ret; |
2679 | ||
16cdcec7 | 2680 | /* |
149e2d76 MX |
2681 | * If the inode is a free space inode, we can deadlock during commit |
2682 | * if we put it into the delayed code. | |
2683 | * | |
2684 | * The data relocation inode should also be directly updated | |
2685 | * without delay | |
16cdcec7 | 2686 | */ |
149e2d76 MX |
2687 | if (!is_free_space_inode(root, inode) |
2688 | && root->root_key.objectid != BTRFS_DATA_RELOC_TREE_OBJECTID) { | |
16cdcec7 MX |
2689 | ret = btrfs_delayed_update_inode(trans, root, inode); |
2690 | if (!ret) | |
2691 | btrfs_set_inode_last_trans(trans, inode); | |
2692 | return ret; | |
2693 | } | |
2694 | ||
39279cc3 | 2695 | path = btrfs_alloc_path(); |
16cdcec7 MX |
2696 | if (!path) |
2697 | return -ENOMEM; | |
2698 | ||
b9473439 | 2699 | path->leave_spinning = 1; |
16cdcec7 MX |
2700 | ret = btrfs_lookup_inode(trans, root, path, &BTRFS_I(inode)->location, |
2701 | 1); | |
39279cc3 CM |
2702 | if (ret) { |
2703 | if (ret > 0) | |
2704 | ret = -ENOENT; | |
2705 | goto failed; | |
2706 | } | |
2707 | ||
b4ce94de | 2708 | btrfs_unlock_up_safe(path, 1); |
5f39d397 CM |
2709 | leaf = path->nodes[0]; |
2710 | inode_item = btrfs_item_ptr(leaf, path->slots[0], | |
16cdcec7 | 2711 | struct btrfs_inode_item); |
39279cc3 | 2712 | |
e02119d5 | 2713 | fill_inode_item(trans, leaf, inode_item, inode); |
5f39d397 | 2714 | btrfs_mark_buffer_dirty(leaf); |
15ee9bc7 | 2715 | btrfs_set_inode_last_trans(trans, inode); |
39279cc3 CM |
2716 | ret = 0; |
2717 | failed: | |
39279cc3 CM |
2718 | btrfs_free_path(path); |
2719 | return ret; | |
2720 | } | |
2721 | ||
d352ac68 CM |
2722 | /* |
2723 | * unlink helper that gets used here in inode.c and in the tree logging | |
2724 | * recovery code. It remove a link in a directory with a given name, and | |
2725 | * also drops the back refs in the inode to the directory | |
2726 | */ | |
92986796 AV |
2727 | static int __btrfs_unlink_inode(struct btrfs_trans_handle *trans, |
2728 | struct btrfs_root *root, | |
2729 | struct inode *dir, struct inode *inode, | |
2730 | const char *name, int name_len) | |
39279cc3 CM |
2731 | { |
2732 | struct btrfs_path *path; | |
39279cc3 | 2733 | int ret = 0; |
5f39d397 | 2734 | struct extent_buffer *leaf; |
39279cc3 | 2735 | struct btrfs_dir_item *di; |
5f39d397 | 2736 | struct btrfs_key key; |
aec7477b | 2737 | u64 index; |
33345d01 LZ |
2738 | u64 ino = btrfs_ino(inode); |
2739 | u64 dir_ino = btrfs_ino(dir); | |
39279cc3 CM |
2740 | |
2741 | path = btrfs_alloc_path(); | |
54aa1f4d CM |
2742 | if (!path) { |
2743 | ret = -ENOMEM; | |
554233a6 | 2744 | goto out; |
54aa1f4d CM |
2745 | } |
2746 | ||
b9473439 | 2747 | path->leave_spinning = 1; |
33345d01 | 2748 | di = btrfs_lookup_dir_item(trans, root, path, dir_ino, |
39279cc3 CM |
2749 | name, name_len, -1); |
2750 | if (IS_ERR(di)) { | |
2751 | ret = PTR_ERR(di); | |
2752 | goto err; | |
2753 | } | |
2754 | if (!di) { | |
2755 | ret = -ENOENT; | |
2756 | goto err; | |
2757 | } | |
5f39d397 CM |
2758 | leaf = path->nodes[0]; |
2759 | btrfs_dir_item_key_to_cpu(leaf, di, &key); | |
39279cc3 | 2760 | ret = btrfs_delete_one_dir_name(trans, root, path, di); |
54aa1f4d CM |
2761 | if (ret) |
2762 | goto err; | |
b3b4aa74 | 2763 | btrfs_release_path(path); |
39279cc3 | 2764 | |
33345d01 LZ |
2765 | ret = btrfs_del_inode_ref(trans, root, name, name_len, ino, |
2766 | dir_ino, &index); | |
aec7477b | 2767 | if (ret) { |
d397712b | 2768 | printk(KERN_INFO "btrfs failed to delete reference to %.*s, " |
33345d01 LZ |
2769 | "inode %llu parent %llu\n", name_len, name, |
2770 | (unsigned long long)ino, (unsigned long long)dir_ino); | |
aec7477b JB |
2771 | goto err; |
2772 | } | |
2773 | ||
16cdcec7 MX |
2774 | ret = btrfs_delete_delayed_dir_index(trans, root, dir, index); |
2775 | if (ret) | |
39279cc3 | 2776 | goto err; |
39279cc3 | 2777 | |
e02119d5 | 2778 | ret = btrfs_del_inode_ref_in_log(trans, root, name, name_len, |
33345d01 | 2779 | inode, dir_ino); |
49eb7e46 | 2780 | BUG_ON(ret != 0 && ret != -ENOENT); |
e02119d5 CM |
2781 | |
2782 | ret = btrfs_del_dir_entries_in_log(trans, root, name, name_len, | |
2783 | dir, index); | |
6418c961 CM |
2784 | if (ret == -ENOENT) |
2785 | ret = 0; | |
39279cc3 CM |
2786 | err: |
2787 | btrfs_free_path(path); | |
e02119d5 CM |
2788 | if (ret) |
2789 | goto out; | |
2790 | ||
2791 | btrfs_i_size_write(dir, dir->i_size - name_len * 2); | |
2792 | inode->i_ctime = dir->i_mtime = dir->i_ctime = CURRENT_TIME; | |
2793 | btrfs_update_inode(trans, root, dir); | |
e02119d5 | 2794 | out: |
39279cc3 CM |
2795 | return ret; |
2796 | } | |
2797 | ||
92986796 AV |
2798 | int btrfs_unlink_inode(struct btrfs_trans_handle *trans, |
2799 | struct btrfs_root *root, | |
2800 | struct inode *dir, struct inode *inode, | |
2801 | const char *name, int name_len) | |
2802 | { | |
2803 | int ret; | |
2804 | ret = __btrfs_unlink_inode(trans, root, dir, inode, name, name_len); | |
2805 | if (!ret) { | |
2806 | btrfs_drop_nlink(inode); | |
2807 | ret = btrfs_update_inode(trans, root, inode); | |
2808 | } | |
2809 | return ret; | |
2810 | } | |
2811 | ||
2812 | ||
a22285a6 YZ |
2813 | /* helper to check if there is any shared block in the path */ |
2814 | static int check_path_shared(struct btrfs_root *root, | |
2815 | struct btrfs_path *path) | |
39279cc3 | 2816 | { |
a22285a6 YZ |
2817 | struct extent_buffer *eb; |
2818 | int level; | |
0e4dcbef | 2819 | u64 refs = 1; |
5df6a9f6 | 2820 | |
a22285a6 | 2821 | for (level = 0; level < BTRFS_MAX_LEVEL; level++) { |
dedefd72 JB |
2822 | int ret; |
2823 | ||
a22285a6 YZ |
2824 | if (!path->nodes[level]) |
2825 | break; | |
2826 | eb = path->nodes[level]; | |
2827 | if (!btrfs_block_can_be_shared(root, eb)) | |
2828 | continue; | |
2829 | ret = btrfs_lookup_extent_info(NULL, root, eb->start, eb->len, | |
2830 | &refs, NULL); | |
2831 | if (refs > 1) | |
2832 | return 1; | |
5df6a9f6 | 2833 | } |
dedefd72 | 2834 | return 0; |
39279cc3 CM |
2835 | } |
2836 | ||
a22285a6 YZ |
2837 | /* |
2838 | * helper to start transaction for unlink and rmdir. | |
2839 | * | |
2840 | * unlink and rmdir are special in btrfs, they do not always free space. | |
2841 | * so in enospc case, we should make sure they will free space before | |
2842 | * allowing them to use the global metadata reservation. | |
2843 | */ | |
2844 | static struct btrfs_trans_handle *__unlink_start_trans(struct inode *dir, | |
2845 | struct dentry *dentry) | |
4df27c4d | 2846 | { |
39279cc3 | 2847 | struct btrfs_trans_handle *trans; |
a22285a6 | 2848 | struct btrfs_root *root = BTRFS_I(dir)->root; |
4df27c4d | 2849 | struct btrfs_path *path; |
a22285a6 | 2850 | struct btrfs_inode_ref *ref; |
4df27c4d | 2851 | struct btrfs_dir_item *di; |
7b128766 | 2852 | struct inode *inode = dentry->d_inode; |
4df27c4d | 2853 | u64 index; |
a22285a6 YZ |
2854 | int check_link = 1; |
2855 | int err = -ENOSPC; | |
4df27c4d | 2856 | int ret; |
33345d01 LZ |
2857 | u64 ino = btrfs_ino(inode); |
2858 | u64 dir_ino = btrfs_ino(dir); | |
4df27c4d | 2859 | |
a22285a6 YZ |
2860 | trans = btrfs_start_transaction(root, 10); |
2861 | if (!IS_ERR(trans) || PTR_ERR(trans) != -ENOSPC) | |
2862 | return trans; | |
4df27c4d | 2863 | |
33345d01 | 2864 | if (ino == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID) |
a22285a6 | 2865 | return ERR_PTR(-ENOSPC); |
4df27c4d | 2866 | |
a22285a6 YZ |
2867 | /* check if there is someone else holds reference */ |
2868 | if (S_ISDIR(inode->i_mode) && atomic_read(&inode->i_count) > 1) | |
2869 | return ERR_PTR(-ENOSPC); | |
4df27c4d | 2870 | |
a22285a6 YZ |
2871 | if (atomic_read(&inode->i_count) > 2) |
2872 | return ERR_PTR(-ENOSPC); | |
4df27c4d | 2873 | |
a22285a6 YZ |
2874 | if (xchg(&root->fs_info->enospc_unlink, 1)) |
2875 | return ERR_PTR(-ENOSPC); | |
2876 | ||
2877 | path = btrfs_alloc_path(); | |
2878 | if (!path) { | |
2879 | root->fs_info->enospc_unlink = 0; | |
2880 | return ERR_PTR(-ENOMEM); | |
4df27c4d YZ |
2881 | } |
2882 | ||
a22285a6 | 2883 | trans = btrfs_start_transaction(root, 0); |
5df6a9f6 | 2884 | if (IS_ERR(trans)) { |
a22285a6 YZ |
2885 | btrfs_free_path(path); |
2886 | root->fs_info->enospc_unlink = 0; | |
2887 | return trans; | |
2888 | } | |
4df27c4d | 2889 | |
a22285a6 YZ |
2890 | path->skip_locking = 1; |
2891 | path->search_commit_root = 1; | |
4df27c4d | 2892 | |
a22285a6 YZ |
2893 | ret = btrfs_lookup_inode(trans, root, path, |
2894 | &BTRFS_I(dir)->location, 0); | |
2895 | if (ret < 0) { | |
2896 | err = ret; | |
2897 | goto out; | |
2898 | } | |
2899 | if (ret == 0) { | |
2900 | if (check_path_shared(root, path)) | |
2901 | goto out; | |
2902 | } else { | |
2903 | check_link = 0; | |
5df6a9f6 | 2904 | } |
b3b4aa74 | 2905 | btrfs_release_path(path); |
a22285a6 YZ |
2906 | |
2907 | ret = btrfs_lookup_inode(trans, root, path, | |
2908 | &BTRFS_I(inode)->location, 0); | |
2909 | if (ret < 0) { | |
2910 | err = ret; | |
2911 | goto out; | |
2912 | } | |
2913 | if (ret == 0) { | |
2914 | if (check_path_shared(root, path)) | |
2915 | goto out; | |
2916 | } else { | |
2917 | check_link = 0; | |
2918 | } | |
b3b4aa74 | 2919 | btrfs_release_path(path); |
a22285a6 YZ |
2920 | |
2921 | if (ret == 0 && S_ISREG(inode->i_mode)) { | |
2922 | ret = btrfs_lookup_file_extent(trans, root, path, | |
33345d01 | 2923 | ino, (u64)-1, 0); |
a22285a6 YZ |
2924 | if (ret < 0) { |
2925 | err = ret; | |
2926 | goto out; | |
2927 | } | |
2928 | BUG_ON(ret == 0); | |
2929 | if (check_path_shared(root, path)) | |
2930 | goto out; | |
b3b4aa74 | 2931 | btrfs_release_path(path); |
a22285a6 YZ |
2932 | } |
2933 | ||
2934 | if (!check_link) { | |
2935 | err = 0; | |
2936 | goto out; | |
2937 | } | |
2938 | ||
33345d01 | 2939 | di = btrfs_lookup_dir_item(trans, root, path, dir_ino, |
a22285a6 YZ |
2940 | dentry->d_name.name, dentry->d_name.len, 0); |
2941 | if (IS_ERR(di)) { | |
2942 | err = PTR_ERR(di); | |
2943 | goto out; | |
2944 | } | |
2945 | if (di) { | |
2946 | if (check_path_shared(root, path)) | |
2947 | goto out; | |
2948 | } else { | |
2949 | err = 0; | |
2950 | goto out; | |
2951 | } | |
b3b4aa74 | 2952 | btrfs_release_path(path); |
a22285a6 YZ |
2953 | |
2954 | ref = btrfs_lookup_inode_ref(trans, root, path, | |
2955 | dentry->d_name.name, dentry->d_name.len, | |
33345d01 | 2956 | ino, dir_ino, 0); |
a22285a6 YZ |
2957 | if (IS_ERR(ref)) { |
2958 | err = PTR_ERR(ref); | |
2959 | goto out; | |
2960 | } | |
2961 | BUG_ON(!ref); | |
2962 | if (check_path_shared(root, path)) | |
2963 | goto out; | |
2964 | index = btrfs_inode_ref_index(path->nodes[0], ref); | |
b3b4aa74 | 2965 | btrfs_release_path(path); |
a22285a6 | 2966 | |
16cdcec7 MX |
2967 | /* |
2968 | * This is a commit root search, if we can lookup inode item and other | |
2969 | * relative items in the commit root, it means the transaction of | |
2970 | * dir/file creation has been committed, and the dir index item that we | |
2971 | * delay to insert has also been inserted into the commit root. So | |
2972 | * we needn't worry about the delayed insertion of the dir index item | |
2973 | * here. | |
2974 | */ | |
33345d01 | 2975 | di = btrfs_lookup_dir_index_item(trans, root, path, dir_ino, index, |
a22285a6 YZ |
2976 | dentry->d_name.name, dentry->d_name.len, 0); |
2977 | if (IS_ERR(di)) { | |
2978 | err = PTR_ERR(di); | |
2979 | goto out; | |
2980 | } | |
2981 | BUG_ON(ret == -ENOENT); | |
2982 | if (check_path_shared(root, path)) | |
2983 | goto out; | |
2984 | ||
2985 | err = 0; | |
2986 | out: | |
2987 | btrfs_free_path(path); | |
2988 | if (err) { | |
2989 | btrfs_end_transaction(trans, root); | |
2990 | root->fs_info->enospc_unlink = 0; | |
2991 | return ERR_PTR(err); | |
2992 | } | |
2993 | ||
2994 | trans->block_rsv = &root->fs_info->global_block_rsv; | |
2995 | return trans; | |
2996 | } | |
2997 | ||
2998 | static void __unlink_end_trans(struct btrfs_trans_handle *trans, | |
2999 | struct btrfs_root *root) | |
3000 | { | |
3001 | if (trans->block_rsv == &root->fs_info->global_block_rsv) { | |
3002 | BUG_ON(!root->fs_info->enospc_unlink); | |
3003 | root->fs_info->enospc_unlink = 0; | |
3004 | } | |
3005 | btrfs_end_transaction_throttle(trans, root); | |
3006 | } | |
3007 | ||
3008 | static int btrfs_unlink(struct inode *dir, struct dentry *dentry) | |
3009 | { | |
3010 | struct btrfs_root *root = BTRFS_I(dir)->root; | |
3011 | struct btrfs_trans_handle *trans; | |
3012 | struct inode *inode = dentry->d_inode; | |
3013 | int ret; | |
3014 | unsigned long nr = 0; | |
3015 | ||
3016 | trans = __unlink_start_trans(dir, dentry); | |
3017 | if (IS_ERR(trans)) | |
3018 | return PTR_ERR(trans); | |
5f39d397 | 3019 | |
12fcfd22 CM |
3020 | btrfs_record_unlink_dir(trans, dir, dentry->d_inode, 0); |
3021 | ||
e02119d5 CM |
3022 | ret = btrfs_unlink_inode(trans, root, dir, dentry->d_inode, |
3023 | dentry->d_name.name, dentry->d_name.len); | |
a22285a6 | 3024 | BUG_ON(ret); |
7b128766 | 3025 | |
a22285a6 | 3026 | if (inode->i_nlink == 0) { |
7b128766 | 3027 | ret = btrfs_orphan_add(trans, inode); |
a22285a6 YZ |
3028 | BUG_ON(ret); |
3029 | } | |
7b128766 | 3030 | |
d3c2fdcf | 3031 | nr = trans->blocks_used; |
a22285a6 | 3032 | __unlink_end_trans(trans, root); |
d3c2fdcf | 3033 | btrfs_btree_balance_dirty(root, nr); |
39279cc3 CM |
3034 | return ret; |
3035 | } | |
3036 | ||
4df27c4d YZ |
3037 | int btrfs_unlink_subvol(struct btrfs_trans_handle *trans, |
3038 | struct btrfs_root *root, | |
3039 | struct inode *dir, u64 objectid, | |
3040 | const char *name, int name_len) | |
3041 | { | |
3042 | struct btrfs_path *path; | |
3043 | struct extent_buffer *leaf; | |
3044 | struct btrfs_dir_item *di; | |
3045 | struct btrfs_key key; | |
3046 | u64 index; | |
3047 | int ret; | |
33345d01 | 3048 | u64 dir_ino = btrfs_ino(dir); |
4df27c4d YZ |
3049 | |
3050 | path = btrfs_alloc_path(); | |
3051 | if (!path) | |
3052 | return -ENOMEM; | |
3053 | ||
33345d01 | 3054 | di = btrfs_lookup_dir_item(trans, root, path, dir_ino, |
4df27c4d | 3055 | name, name_len, -1); |
c704005d | 3056 | BUG_ON(IS_ERR_OR_NULL(di)); |
4df27c4d YZ |
3057 | |
3058 | leaf = path->nodes[0]; | |
3059 | btrfs_dir_item_key_to_cpu(leaf, di, &key); | |
3060 | WARN_ON(key.type != BTRFS_ROOT_ITEM_KEY || key.objectid != objectid); | |
3061 | ret = btrfs_delete_one_dir_name(trans, root, path, di); | |
3062 | BUG_ON(ret); | |
b3b4aa74 | 3063 | btrfs_release_path(path); |
4df27c4d YZ |
3064 | |
3065 | ret = btrfs_del_root_ref(trans, root->fs_info->tree_root, | |
3066 | objectid, root->root_key.objectid, | |
33345d01 | 3067 | dir_ino, &index, name, name_len); |
4df27c4d YZ |
3068 | if (ret < 0) { |
3069 | BUG_ON(ret != -ENOENT); | |
33345d01 | 3070 | di = btrfs_search_dir_index_item(root, path, dir_ino, |
4df27c4d | 3071 | name, name_len); |
c704005d | 3072 | BUG_ON(IS_ERR_OR_NULL(di)); |
4df27c4d YZ |
3073 | |
3074 | leaf = path->nodes[0]; | |
3075 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); | |
b3b4aa74 | 3076 | btrfs_release_path(path); |
4df27c4d YZ |
3077 | index = key.offset; |
3078 | } | |
945d8962 | 3079 | btrfs_release_path(path); |
4df27c4d | 3080 | |
16cdcec7 | 3081 | ret = btrfs_delete_delayed_dir_index(trans, root, dir, index); |
4df27c4d | 3082 | BUG_ON(ret); |
4df27c4d YZ |
3083 | |
3084 | btrfs_i_size_write(dir, dir->i_size - name_len * 2); | |
3085 | dir->i_mtime = dir->i_ctime = CURRENT_TIME; | |
3086 | ret = btrfs_update_inode(trans, root, dir); | |
3087 | BUG_ON(ret); | |
4df27c4d | 3088 | |
71d7aed0 | 3089 | btrfs_free_path(path); |
4df27c4d YZ |
3090 | return 0; |
3091 | } | |
3092 | ||
39279cc3 CM |
3093 | static int btrfs_rmdir(struct inode *dir, struct dentry *dentry) |
3094 | { | |
3095 | struct inode *inode = dentry->d_inode; | |
1832a6d5 | 3096 | int err = 0; |
39279cc3 | 3097 | struct btrfs_root *root = BTRFS_I(dir)->root; |
39279cc3 | 3098 | struct btrfs_trans_handle *trans; |
1832a6d5 | 3099 | unsigned long nr = 0; |
39279cc3 | 3100 | |
3394e160 | 3101 | if (inode->i_size > BTRFS_EMPTY_DIR_SIZE || |
33345d01 | 3102 | btrfs_ino(inode) == BTRFS_FIRST_FREE_OBJECTID) |
134d4512 Y |
3103 | return -ENOTEMPTY; |
3104 | ||
a22285a6 YZ |
3105 | trans = __unlink_start_trans(dir, dentry); |
3106 | if (IS_ERR(trans)) | |
5df6a9f6 | 3107 | return PTR_ERR(trans); |
5df6a9f6 | 3108 | |
33345d01 | 3109 | if (unlikely(btrfs_ino(inode) == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID)) { |
4df27c4d YZ |
3110 | err = btrfs_unlink_subvol(trans, root, dir, |
3111 | BTRFS_I(inode)->location.objectid, | |
3112 | dentry->d_name.name, | |
3113 | dentry->d_name.len); | |
3114 | goto out; | |
3115 | } | |
3116 | ||
7b128766 JB |
3117 | err = btrfs_orphan_add(trans, inode); |
3118 | if (err) | |
4df27c4d | 3119 | goto out; |
7b128766 | 3120 | |
39279cc3 | 3121 | /* now the directory is empty */ |
e02119d5 CM |
3122 | err = btrfs_unlink_inode(trans, root, dir, dentry->d_inode, |
3123 | dentry->d_name.name, dentry->d_name.len); | |
d397712b | 3124 | if (!err) |
dbe674a9 | 3125 | btrfs_i_size_write(inode, 0); |
4df27c4d | 3126 | out: |
d3c2fdcf | 3127 | nr = trans->blocks_used; |
a22285a6 | 3128 | __unlink_end_trans(trans, root); |
d3c2fdcf | 3129 | btrfs_btree_balance_dirty(root, nr); |
3954401f | 3130 | |
39279cc3 CM |
3131 | return err; |
3132 | } | |
3133 | ||
39279cc3 CM |
3134 | /* |
3135 | * this can truncate away extent items, csum items and directory items. | |
3136 | * It starts at a high offset and removes keys until it can't find | |
d352ac68 | 3137 | * any higher than new_size |
39279cc3 CM |
3138 | * |
3139 | * csum items that cross the new i_size are truncated to the new size | |
3140 | * as well. | |
7b128766 JB |
3141 | * |
3142 | * min_type is the minimum key type to truncate down to. If set to 0, this | |
3143 | * will kill all the items on this inode, including the INODE_ITEM_KEY. | |
39279cc3 | 3144 | */ |
8082510e YZ |
3145 | int btrfs_truncate_inode_items(struct btrfs_trans_handle *trans, |
3146 | struct btrfs_root *root, | |
3147 | struct inode *inode, | |
3148 | u64 new_size, u32 min_type) | |
39279cc3 | 3149 | { |
39279cc3 | 3150 | struct btrfs_path *path; |
5f39d397 | 3151 | struct extent_buffer *leaf; |
39279cc3 | 3152 | struct btrfs_file_extent_item *fi; |
8082510e YZ |
3153 | struct btrfs_key key; |
3154 | struct btrfs_key found_key; | |
39279cc3 | 3155 | u64 extent_start = 0; |
db94535d | 3156 | u64 extent_num_bytes = 0; |
5d4f98a2 | 3157 | u64 extent_offset = 0; |
39279cc3 | 3158 | u64 item_end = 0; |
8082510e YZ |
3159 | u64 mask = root->sectorsize - 1; |
3160 | u32 found_type = (u8)-1; | |
39279cc3 CM |
3161 | int found_extent; |
3162 | int del_item; | |
85e21bac CM |
3163 | int pending_del_nr = 0; |
3164 | int pending_del_slot = 0; | |
179e29e4 | 3165 | int extent_type = -1; |
771ed689 | 3166 | int encoding; |
8082510e YZ |
3167 | int ret; |
3168 | int err = 0; | |
33345d01 | 3169 | u64 ino = btrfs_ino(inode); |
8082510e YZ |
3170 | |
3171 | BUG_ON(new_size > 0 && min_type != BTRFS_EXTENT_DATA_KEY); | |
39279cc3 | 3172 | |
0af3d00b | 3173 | if (root->ref_cows || root == root->fs_info->tree_root) |
5b21f2ed | 3174 | btrfs_drop_extent_cache(inode, new_size & (~mask), (u64)-1, 0); |
8082510e | 3175 | |
16cdcec7 MX |
3176 | /* |
3177 | * This function is also used to drop the items in the log tree before | |
3178 | * we relog the inode, so if root != BTRFS_I(inode)->root, it means | |
3179 | * it is used to drop the loged items. So we shouldn't kill the delayed | |
3180 | * items. | |
3181 | */ | |
3182 | if (min_type == 0 && root == BTRFS_I(inode)->root) | |
3183 | btrfs_kill_delayed_inode_items(inode); | |
3184 | ||
39279cc3 CM |
3185 | path = btrfs_alloc_path(); |
3186 | BUG_ON(!path); | |
33c17ad5 | 3187 | path->reada = -1; |
5f39d397 | 3188 | |
33345d01 | 3189 | key.objectid = ino; |
39279cc3 | 3190 | key.offset = (u64)-1; |
5f39d397 CM |
3191 | key.type = (u8)-1; |
3192 | ||
85e21bac | 3193 | search_again: |
b9473439 | 3194 | path->leave_spinning = 1; |
85e21bac | 3195 | ret = btrfs_search_slot(trans, root, &key, path, -1, 1); |
8082510e YZ |
3196 | if (ret < 0) { |
3197 | err = ret; | |
3198 | goto out; | |
3199 | } | |
d397712b | 3200 | |
85e21bac | 3201 | if (ret > 0) { |
e02119d5 CM |
3202 | /* there are no items in the tree for us to truncate, we're |
3203 | * done | |
3204 | */ | |
8082510e YZ |
3205 | if (path->slots[0] == 0) |
3206 | goto out; | |
85e21bac CM |
3207 | path->slots[0]--; |
3208 | } | |
3209 | ||
d397712b | 3210 | while (1) { |
39279cc3 | 3211 | fi = NULL; |
5f39d397 CM |
3212 | leaf = path->nodes[0]; |
3213 | btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); | |
3214 | found_type = btrfs_key_type(&found_key); | |
771ed689 | 3215 | encoding = 0; |
39279cc3 | 3216 | |
33345d01 | 3217 | if (found_key.objectid != ino) |
39279cc3 | 3218 | break; |
5f39d397 | 3219 | |
85e21bac | 3220 | if (found_type < min_type) |
39279cc3 CM |
3221 | break; |
3222 | ||
5f39d397 | 3223 | item_end = found_key.offset; |
39279cc3 | 3224 | if (found_type == BTRFS_EXTENT_DATA_KEY) { |
5f39d397 | 3225 | fi = btrfs_item_ptr(leaf, path->slots[0], |
39279cc3 | 3226 | struct btrfs_file_extent_item); |
179e29e4 | 3227 | extent_type = btrfs_file_extent_type(leaf, fi); |
771ed689 CM |
3228 | encoding = btrfs_file_extent_compression(leaf, fi); |
3229 | encoding |= btrfs_file_extent_encryption(leaf, fi); | |
3230 | encoding |= btrfs_file_extent_other_encoding(leaf, fi); | |
3231 | ||
179e29e4 | 3232 | if (extent_type != BTRFS_FILE_EXTENT_INLINE) { |
5f39d397 | 3233 | item_end += |
db94535d | 3234 | btrfs_file_extent_num_bytes(leaf, fi); |
179e29e4 | 3235 | } else if (extent_type == BTRFS_FILE_EXTENT_INLINE) { |
179e29e4 | 3236 | item_end += btrfs_file_extent_inline_len(leaf, |
c8b97818 | 3237 | fi); |
39279cc3 | 3238 | } |
008630c1 | 3239 | item_end--; |
39279cc3 | 3240 | } |
8082510e YZ |
3241 | if (found_type > min_type) { |
3242 | del_item = 1; | |
3243 | } else { | |
3244 | if (item_end < new_size) | |
b888db2b | 3245 | break; |
8082510e YZ |
3246 | if (found_key.offset >= new_size) |
3247 | del_item = 1; | |
3248 | else | |
3249 | del_item = 0; | |
39279cc3 | 3250 | } |
39279cc3 | 3251 | found_extent = 0; |
39279cc3 | 3252 | /* FIXME, shrink the extent if the ref count is only 1 */ |
179e29e4 CM |
3253 | if (found_type != BTRFS_EXTENT_DATA_KEY) |
3254 | goto delete; | |
3255 | ||
3256 | if (extent_type != BTRFS_FILE_EXTENT_INLINE) { | |
39279cc3 | 3257 | u64 num_dec; |
db94535d | 3258 | extent_start = btrfs_file_extent_disk_bytenr(leaf, fi); |
771ed689 | 3259 | if (!del_item && !encoding) { |
db94535d CM |
3260 | u64 orig_num_bytes = |
3261 | btrfs_file_extent_num_bytes(leaf, fi); | |
e02119d5 | 3262 | extent_num_bytes = new_size - |
5f39d397 | 3263 | found_key.offset + root->sectorsize - 1; |
b1632b10 Y |
3264 | extent_num_bytes = extent_num_bytes & |
3265 | ~((u64)root->sectorsize - 1); | |
db94535d CM |
3266 | btrfs_set_file_extent_num_bytes(leaf, fi, |
3267 | extent_num_bytes); | |
3268 | num_dec = (orig_num_bytes - | |
9069218d | 3269 | extent_num_bytes); |
e02119d5 | 3270 | if (root->ref_cows && extent_start != 0) |
a76a3cd4 | 3271 | inode_sub_bytes(inode, num_dec); |
5f39d397 | 3272 | btrfs_mark_buffer_dirty(leaf); |
39279cc3 | 3273 | } else { |
db94535d CM |
3274 | extent_num_bytes = |
3275 | btrfs_file_extent_disk_num_bytes(leaf, | |
3276 | fi); | |
5d4f98a2 YZ |
3277 | extent_offset = found_key.offset - |
3278 | btrfs_file_extent_offset(leaf, fi); | |
3279 | ||
39279cc3 | 3280 | /* FIXME blocksize != 4096 */ |
9069218d | 3281 | num_dec = btrfs_file_extent_num_bytes(leaf, fi); |
39279cc3 CM |
3282 | if (extent_start != 0) { |
3283 | found_extent = 1; | |
e02119d5 | 3284 | if (root->ref_cows) |
a76a3cd4 | 3285 | inode_sub_bytes(inode, num_dec); |
e02119d5 | 3286 | } |
39279cc3 | 3287 | } |
9069218d | 3288 | } else if (extent_type == BTRFS_FILE_EXTENT_INLINE) { |
c8b97818 CM |
3289 | /* |
3290 | * we can't truncate inline items that have had | |
3291 | * special encodings | |
3292 | */ | |
3293 | if (!del_item && | |
3294 | btrfs_file_extent_compression(leaf, fi) == 0 && | |
3295 | btrfs_file_extent_encryption(leaf, fi) == 0 && | |
3296 | btrfs_file_extent_other_encoding(leaf, fi) == 0) { | |
e02119d5 CM |
3297 | u32 size = new_size - found_key.offset; |
3298 | ||
3299 | if (root->ref_cows) { | |
a76a3cd4 YZ |
3300 | inode_sub_bytes(inode, item_end + 1 - |
3301 | new_size); | |
e02119d5 CM |
3302 | } |
3303 | size = | |
3304 | btrfs_file_extent_calc_inline_size(size); | |
9069218d | 3305 | ret = btrfs_truncate_item(trans, root, path, |
e02119d5 | 3306 | size, 1); |
e02119d5 | 3307 | } else if (root->ref_cows) { |
a76a3cd4 YZ |
3308 | inode_sub_bytes(inode, item_end + 1 - |
3309 | found_key.offset); | |
9069218d | 3310 | } |
39279cc3 | 3311 | } |
179e29e4 | 3312 | delete: |
39279cc3 | 3313 | if (del_item) { |
85e21bac CM |
3314 | if (!pending_del_nr) { |
3315 | /* no pending yet, add ourselves */ | |
3316 | pending_del_slot = path->slots[0]; | |
3317 | pending_del_nr = 1; | |
3318 | } else if (pending_del_nr && | |
3319 | path->slots[0] + 1 == pending_del_slot) { | |
3320 | /* hop on the pending chunk */ | |
3321 | pending_del_nr++; | |
3322 | pending_del_slot = path->slots[0]; | |
3323 | } else { | |
d397712b | 3324 | BUG(); |
85e21bac | 3325 | } |
39279cc3 CM |
3326 | } else { |
3327 | break; | |
3328 | } | |
0af3d00b JB |
3329 | if (found_extent && (root->ref_cows || |
3330 | root == root->fs_info->tree_root)) { | |
b9473439 | 3331 | btrfs_set_path_blocking(path); |
39279cc3 | 3332 | ret = btrfs_free_extent(trans, root, extent_start, |
5d4f98a2 YZ |
3333 | extent_num_bytes, 0, |
3334 | btrfs_header_owner(leaf), | |
33345d01 | 3335 | ino, extent_offset); |
39279cc3 CM |
3336 | BUG_ON(ret); |
3337 | } | |
85e21bac | 3338 | |
8082510e YZ |
3339 | if (found_type == BTRFS_INODE_ITEM_KEY) |
3340 | break; | |
3341 | ||
3342 | if (path->slots[0] == 0 || | |
3343 | path->slots[0] != pending_del_slot) { | |
82d5902d LZ |
3344 | if (root->ref_cows && |
3345 | BTRFS_I(inode)->location.objectid != | |
3346 | BTRFS_FREE_INO_OBJECTID) { | |
8082510e YZ |
3347 | err = -EAGAIN; |
3348 | goto out; | |
3349 | } | |
3350 | if (pending_del_nr) { | |
3351 | ret = btrfs_del_items(trans, root, path, | |
3352 | pending_del_slot, | |
3353 | pending_del_nr); | |
3354 | BUG_ON(ret); | |
3355 | pending_del_nr = 0; | |
3356 | } | |
b3b4aa74 | 3357 | btrfs_release_path(path); |
85e21bac | 3358 | goto search_again; |
8082510e YZ |
3359 | } else { |
3360 | path->slots[0]--; | |
85e21bac | 3361 | } |
39279cc3 | 3362 | } |
8082510e | 3363 | out: |
85e21bac CM |
3364 | if (pending_del_nr) { |
3365 | ret = btrfs_del_items(trans, root, path, pending_del_slot, | |
3366 | pending_del_nr); | |
d68fc57b | 3367 | BUG_ON(ret); |
85e21bac | 3368 | } |
39279cc3 | 3369 | btrfs_free_path(path); |
8082510e | 3370 | return err; |
39279cc3 CM |
3371 | } |
3372 | ||
3373 | /* | |
3374 | * taken from block_truncate_page, but does cow as it zeros out | |
3375 | * any bytes left in the last page in the file. | |
3376 | */ | |
3377 | static int btrfs_truncate_page(struct address_space *mapping, loff_t from) | |
3378 | { | |
3379 | struct inode *inode = mapping->host; | |
db94535d | 3380 | struct btrfs_root *root = BTRFS_I(inode)->root; |
e6dcd2dc CM |
3381 | struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree; |
3382 | struct btrfs_ordered_extent *ordered; | |
2ac55d41 | 3383 | struct extent_state *cached_state = NULL; |
e6dcd2dc | 3384 | char *kaddr; |
db94535d | 3385 | u32 blocksize = root->sectorsize; |
39279cc3 CM |
3386 | pgoff_t index = from >> PAGE_CACHE_SHIFT; |
3387 | unsigned offset = from & (PAGE_CACHE_SIZE-1); | |
3388 | struct page *page; | |
39279cc3 | 3389 | int ret = 0; |
a52d9a80 | 3390 | u64 page_start; |
e6dcd2dc | 3391 | u64 page_end; |
39279cc3 CM |
3392 | |
3393 | if ((offset & (blocksize - 1)) == 0) | |
3394 | goto out; | |
0ca1f7ce | 3395 | ret = btrfs_delalloc_reserve_space(inode, PAGE_CACHE_SIZE); |
5d5e103a JB |
3396 | if (ret) |
3397 | goto out; | |
39279cc3 CM |
3398 | |
3399 | ret = -ENOMEM; | |
211c17f5 | 3400 | again: |
39279cc3 | 3401 | page = grab_cache_page(mapping, index); |
5d5e103a | 3402 | if (!page) { |
0ca1f7ce | 3403 | btrfs_delalloc_release_space(inode, PAGE_CACHE_SIZE); |
39279cc3 | 3404 | goto out; |
5d5e103a | 3405 | } |
e6dcd2dc CM |
3406 | |
3407 | page_start = page_offset(page); | |
3408 | page_end = page_start + PAGE_CACHE_SIZE - 1; | |
3409 | ||
39279cc3 | 3410 | if (!PageUptodate(page)) { |
9ebefb18 | 3411 | ret = btrfs_readpage(NULL, page); |
39279cc3 | 3412 | lock_page(page); |
211c17f5 CM |
3413 | if (page->mapping != mapping) { |
3414 | unlock_page(page); | |
3415 | page_cache_release(page); | |
3416 | goto again; | |
3417 | } | |
39279cc3 CM |
3418 | if (!PageUptodate(page)) { |
3419 | ret = -EIO; | |
89642229 | 3420 | goto out_unlock; |
39279cc3 CM |
3421 | } |
3422 | } | |
211c17f5 | 3423 | wait_on_page_writeback(page); |
e6dcd2dc | 3424 | |
2ac55d41 JB |
3425 | lock_extent_bits(io_tree, page_start, page_end, 0, &cached_state, |
3426 | GFP_NOFS); | |
e6dcd2dc CM |
3427 | set_page_extent_mapped(page); |
3428 | ||
3429 | ordered = btrfs_lookup_ordered_extent(inode, page_start); | |
3430 | if (ordered) { | |
2ac55d41 JB |
3431 | unlock_extent_cached(io_tree, page_start, page_end, |
3432 | &cached_state, GFP_NOFS); | |
e6dcd2dc CM |
3433 | unlock_page(page); |
3434 | page_cache_release(page); | |
eb84ae03 | 3435 | btrfs_start_ordered_extent(inode, ordered, 1); |
e6dcd2dc CM |
3436 | btrfs_put_ordered_extent(ordered); |
3437 | goto again; | |
3438 | } | |
3439 | ||
2ac55d41 | 3440 | clear_extent_bit(&BTRFS_I(inode)->io_tree, page_start, page_end, |
5d5e103a | 3441 | EXTENT_DIRTY | EXTENT_DELALLOC | EXTENT_DO_ACCOUNTING, |
2ac55d41 | 3442 | 0, 0, &cached_state, GFP_NOFS); |
5d5e103a | 3443 | |
2ac55d41 JB |
3444 | ret = btrfs_set_extent_delalloc(inode, page_start, page_end, |
3445 | &cached_state); | |
9ed74f2d | 3446 | if (ret) { |
2ac55d41 JB |
3447 | unlock_extent_cached(io_tree, page_start, page_end, |
3448 | &cached_state, GFP_NOFS); | |
9ed74f2d JB |
3449 | goto out_unlock; |
3450 | } | |
3451 | ||
e6dcd2dc CM |
3452 | ret = 0; |
3453 | if (offset != PAGE_CACHE_SIZE) { | |
3454 | kaddr = kmap(page); | |
3455 | memset(kaddr + offset, 0, PAGE_CACHE_SIZE - offset); | |
3456 | flush_dcache_page(page); | |
3457 | kunmap(page); | |
3458 | } | |
247e743c | 3459 | ClearPageChecked(page); |
e6dcd2dc | 3460 | set_page_dirty(page); |
2ac55d41 JB |
3461 | unlock_extent_cached(io_tree, page_start, page_end, &cached_state, |
3462 | GFP_NOFS); | |
39279cc3 | 3463 | |
89642229 | 3464 | out_unlock: |
5d5e103a | 3465 | if (ret) |
0ca1f7ce | 3466 | btrfs_delalloc_release_space(inode, PAGE_CACHE_SIZE); |
39279cc3 CM |
3467 | unlock_page(page); |
3468 | page_cache_release(page); | |
3469 | out: | |
3470 | return ret; | |
3471 | } | |
3472 | ||
695a0d0d JB |
3473 | /* |
3474 | * This function puts in dummy file extents for the area we're creating a hole | |
3475 | * for. So if we are truncating this file to a larger size we need to insert | |
3476 | * these file extents so that btrfs_get_extent will return a EXTENT_MAP_HOLE for | |
3477 | * the range between oldsize and size | |
3478 | */ | |
a41ad394 | 3479 | int btrfs_cont_expand(struct inode *inode, loff_t oldsize, loff_t size) |
39279cc3 | 3480 | { |
9036c102 YZ |
3481 | struct btrfs_trans_handle *trans; |
3482 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
3483 | struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree; | |
a22285a6 | 3484 | struct extent_map *em = NULL; |
2ac55d41 | 3485 | struct extent_state *cached_state = NULL; |
9036c102 | 3486 | u64 mask = root->sectorsize - 1; |
a41ad394 | 3487 | u64 hole_start = (oldsize + mask) & ~mask; |
9036c102 YZ |
3488 | u64 block_end = (size + mask) & ~mask; |
3489 | u64 last_byte; | |
3490 | u64 cur_offset; | |
3491 | u64 hole_size; | |
9ed74f2d | 3492 | int err = 0; |
39279cc3 | 3493 | |
9036c102 YZ |
3494 | if (size <= hole_start) |
3495 | return 0; | |
3496 | ||
9036c102 YZ |
3497 | while (1) { |
3498 | struct btrfs_ordered_extent *ordered; | |
3499 | btrfs_wait_ordered_range(inode, hole_start, | |
3500 | block_end - hole_start); | |
2ac55d41 JB |
3501 | lock_extent_bits(io_tree, hole_start, block_end - 1, 0, |
3502 | &cached_state, GFP_NOFS); | |
9036c102 YZ |
3503 | ordered = btrfs_lookup_ordered_extent(inode, hole_start); |
3504 | if (!ordered) | |
3505 | break; | |
2ac55d41 JB |
3506 | unlock_extent_cached(io_tree, hole_start, block_end - 1, |
3507 | &cached_state, GFP_NOFS); | |
9036c102 YZ |
3508 | btrfs_put_ordered_extent(ordered); |
3509 | } | |
39279cc3 | 3510 | |
9036c102 YZ |
3511 | cur_offset = hole_start; |
3512 | while (1) { | |
3513 | em = btrfs_get_extent(inode, NULL, 0, cur_offset, | |
3514 | block_end - cur_offset, 0); | |
c704005d | 3515 | BUG_ON(IS_ERR_OR_NULL(em)); |
9036c102 YZ |
3516 | last_byte = min(extent_map_end(em), block_end); |
3517 | last_byte = (last_byte + mask) & ~mask; | |
8082510e | 3518 | if (!test_bit(EXTENT_FLAG_PREALLOC, &em->flags)) { |
771ed689 | 3519 | u64 hint_byte = 0; |
9036c102 | 3520 | hole_size = last_byte - cur_offset; |
9ed74f2d | 3521 | |
a22285a6 YZ |
3522 | trans = btrfs_start_transaction(root, 2); |
3523 | if (IS_ERR(trans)) { | |
3524 | err = PTR_ERR(trans); | |
9ed74f2d | 3525 | break; |
a22285a6 | 3526 | } |
8082510e YZ |
3527 | |
3528 | err = btrfs_drop_extents(trans, inode, cur_offset, | |
3529 | cur_offset + hole_size, | |
3530 | &hint_byte, 1); | |
3893e33b JB |
3531 | if (err) |
3532 | break; | |
8082510e | 3533 | |
9036c102 | 3534 | err = btrfs_insert_file_extent(trans, root, |
33345d01 | 3535 | btrfs_ino(inode), cur_offset, 0, |
9036c102 YZ |
3536 | 0, hole_size, 0, hole_size, |
3537 | 0, 0, 0); | |
3893e33b JB |
3538 | if (err) |
3539 | break; | |
8082510e | 3540 | |
9036c102 YZ |
3541 | btrfs_drop_extent_cache(inode, hole_start, |
3542 | last_byte - 1, 0); | |
8082510e YZ |
3543 | |
3544 | btrfs_end_transaction(trans, root); | |
9036c102 YZ |
3545 | } |
3546 | free_extent_map(em); | |
a22285a6 | 3547 | em = NULL; |
9036c102 | 3548 | cur_offset = last_byte; |
8082510e | 3549 | if (cur_offset >= block_end) |
9036c102 YZ |
3550 | break; |
3551 | } | |
1832a6d5 | 3552 | |
a22285a6 | 3553 | free_extent_map(em); |
2ac55d41 JB |
3554 | unlock_extent_cached(io_tree, hole_start, block_end - 1, &cached_state, |
3555 | GFP_NOFS); | |
9036c102 YZ |
3556 | return err; |
3557 | } | |
39279cc3 | 3558 | |
a41ad394 | 3559 | static int btrfs_setsize(struct inode *inode, loff_t newsize) |
8082510e | 3560 | { |
a41ad394 | 3561 | loff_t oldsize = i_size_read(inode); |
8082510e YZ |
3562 | int ret; |
3563 | ||
a41ad394 | 3564 | if (newsize == oldsize) |
8082510e YZ |
3565 | return 0; |
3566 | ||
a41ad394 JB |
3567 | if (newsize > oldsize) { |
3568 | i_size_write(inode, newsize); | |
3569 | btrfs_ordered_update_i_size(inode, i_size_read(inode), NULL); | |
3570 | truncate_pagecache(inode, oldsize, newsize); | |
3571 | ret = btrfs_cont_expand(inode, oldsize, newsize); | |
8082510e | 3572 | if (ret) { |
a41ad394 | 3573 | btrfs_setsize(inode, oldsize); |
8082510e YZ |
3574 | return ret; |
3575 | } | |
3576 | ||
930f028a | 3577 | mark_inode_dirty(inode); |
a41ad394 | 3578 | } else { |
8082510e | 3579 | |
a41ad394 JB |
3580 | /* |
3581 | * We're truncating a file that used to have good data down to | |
3582 | * zero. Make sure it gets into the ordered flush list so that | |
3583 | * any new writes get down to disk quickly. | |
3584 | */ | |
3585 | if (newsize == 0) | |
3586 | BTRFS_I(inode)->ordered_data_close = 1; | |
8082510e | 3587 | |
a41ad394 JB |
3588 | /* we don't support swapfiles, so vmtruncate shouldn't fail */ |
3589 | truncate_setsize(inode, newsize); | |
3590 | ret = btrfs_truncate(inode); | |
8082510e YZ |
3591 | } |
3592 | ||
a41ad394 | 3593 | return ret; |
8082510e YZ |
3594 | } |
3595 | ||
9036c102 YZ |
3596 | static int btrfs_setattr(struct dentry *dentry, struct iattr *attr) |
3597 | { | |
3598 | struct inode *inode = dentry->d_inode; | |
b83cc969 | 3599 | struct btrfs_root *root = BTRFS_I(inode)->root; |
9036c102 | 3600 | int err; |
39279cc3 | 3601 | |
b83cc969 LZ |
3602 | if (btrfs_root_readonly(root)) |
3603 | return -EROFS; | |
3604 | ||
9036c102 YZ |
3605 | err = inode_change_ok(inode, attr); |
3606 | if (err) | |
3607 | return err; | |
2bf5a725 | 3608 | |
5a3f23d5 | 3609 | if (S_ISREG(inode->i_mode) && (attr->ia_valid & ATTR_SIZE)) { |
a41ad394 | 3610 | err = btrfs_setsize(inode, attr->ia_size); |
8082510e YZ |
3611 | if (err) |
3612 | return err; | |
39279cc3 | 3613 | } |
9036c102 | 3614 | |
1025774c CH |
3615 | if (attr->ia_valid) { |
3616 | setattr_copy(inode, attr); | |
3617 | mark_inode_dirty(inode); | |
3618 | ||
3619 | if (attr->ia_valid & ATTR_MODE) | |
3620 | err = btrfs_acl_chmod(inode); | |
3621 | } | |
33268eaf | 3622 | |
39279cc3 CM |
3623 | return err; |
3624 | } | |
61295eb8 | 3625 | |
bd555975 | 3626 | void btrfs_evict_inode(struct inode *inode) |
39279cc3 CM |
3627 | { |
3628 | struct btrfs_trans_handle *trans; | |
3629 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
d3c2fdcf | 3630 | unsigned long nr; |
39279cc3 CM |
3631 | int ret; |
3632 | ||
1abe9b8a | 3633 | trace_btrfs_inode_evict(inode); |
3634 | ||
39279cc3 | 3635 | truncate_inode_pages(&inode->i_data, 0); |
0af3d00b | 3636 | if (inode->i_nlink && (btrfs_root_refs(&root->root_item) != 0 || |
82d5902d | 3637 | is_free_space_inode(root, inode))) |
bd555975 AV |
3638 | goto no_delete; |
3639 | ||
39279cc3 | 3640 | if (is_bad_inode(inode)) { |
7b128766 | 3641 | btrfs_orphan_del(NULL, inode); |
39279cc3 CM |
3642 | goto no_delete; |
3643 | } | |
bd555975 | 3644 | /* do we really want it for ->i_nlink > 0 and zero btrfs_root_refs? */ |
4a096752 | 3645 | btrfs_wait_ordered_range(inode, 0, (u64)-1); |
5f39d397 | 3646 | |
c71bf099 YZ |
3647 | if (root->fs_info->log_root_recovering) { |
3648 | BUG_ON(!list_empty(&BTRFS_I(inode)->i_orphan)); | |
3649 | goto no_delete; | |
3650 | } | |
3651 | ||
76dda93c YZ |
3652 | if (inode->i_nlink > 0) { |
3653 | BUG_ON(btrfs_root_refs(&root->root_item) != 0); | |
3654 | goto no_delete; | |
3655 | } | |
3656 | ||
dbe674a9 | 3657 | btrfs_i_size_write(inode, 0); |
5f39d397 | 3658 | |
8082510e | 3659 | while (1) { |
30b4caf5 | 3660 | trans = btrfs_join_transaction(root); |
d68fc57b | 3661 | BUG_ON(IS_ERR(trans)); |
d68fc57b YZ |
3662 | trans->block_rsv = root->orphan_block_rsv; |
3663 | ||
3664 | ret = btrfs_block_rsv_check(trans, root, | |
3665 | root->orphan_block_rsv, 0, 5); | |
3666 | if (ret) { | |
3667 | BUG_ON(ret != -EAGAIN); | |
3668 | ret = btrfs_commit_transaction(trans, root); | |
3669 | BUG_ON(ret); | |
3670 | continue; | |
3671 | } | |
7b128766 | 3672 | |
d68fc57b | 3673 | ret = btrfs_truncate_inode_items(trans, root, inode, 0, 0); |
8082510e YZ |
3674 | if (ret != -EAGAIN) |
3675 | break; | |
85e21bac | 3676 | |
8082510e YZ |
3677 | nr = trans->blocks_used; |
3678 | btrfs_end_transaction(trans, root); | |
3679 | trans = NULL; | |
3680 | btrfs_btree_balance_dirty(root, nr); | |
d68fc57b | 3681 | |
8082510e | 3682 | } |
5f39d397 | 3683 | |
8082510e YZ |
3684 | if (ret == 0) { |
3685 | ret = btrfs_orphan_del(trans, inode); | |
3686 | BUG_ON(ret); | |
3687 | } | |
54aa1f4d | 3688 | |
581bb050 LZ |
3689 | if (!(root == root->fs_info->tree_root || |
3690 | root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID)) | |
33345d01 | 3691 | btrfs_return_ino(root, btrfs_ino(inode)); |
581bb050 | 3692 | |
d3c2fdcf | 3693 | nr = trans->blocks_used; |
54aa1f4d | 3694 | btrfs_end_transaction(trans, root); |
d3c2fdcf | 3695 | btrfs_btree_balance_dirty(root, nr); |
39279cc3 | 3696 | no_delete: |
bd555975 | 3697 | end_writeback(inode); |
8082510e | 3698 | return; |
39279cc3 CM |
3699 | } |
3700 | ||
3701 | /* | |
3702 | * this returns the key found in the dir entry in the location pointer. | |
3703 | * If no dir entries were found, location->objectid is 0. | |
3704 | */ | |
3705 | static int btrfs_inode_by_name(struct inode *dir, struct dentry *dentry, | |
3706 | struct btrfs_key *location) | |
3707 | { | |
3708 | const char *name = dentry->d_name.name; | |
3709 | int namelen = dentry->d_name.len; | |
3710 | struct btrfs_dir_item *di; | |
3711 | struct btrfs_path *path; | |
3712 | struct btrfs_root *root = BTRFS_I(dir)->root; | |
0d9f7f3e | 3713 | int ret = 0; |
39279cc3 CM |
3714 | |
3715 | path = btrfs_alloc_path(); | |
3716 | BUG_ON(!path); | |
3954401f | 3717 | |
33345d01 | 3718 | di = btrfs_lookup_dir_item(NULL, root, path, btrfs_ino(dir), name, |
39279cc3 | 3719 | namelen, 0); |
0d9f7f3e Y |
3720 | if (IS_ERR(di)) |
3721 | ret = PTR_ERR(di); | |
d397712b | 3722 | |
c704005d | 3723 | if (IS_ERR_OR_NULL(di)) |
3954401f | 3724 | goto out_err; |
d397712b | 3725 | |
5f39d397 | 3726 | btrfs_dir_item_key_to_cpu(path->nodes[0], di, location); |
39279cc3 | 3727 | out: |
39279cc3 CM |
3728 | btrfs_free_path(path); |
3729 | return ret; | |
3954401f CM |
3730 | out_err: |
3731 | location->objectid = 0; | |
3732 | goto out; | |
39279cc3 CM |
3733 | } |
3734 | ||
3735 | /* | |
3736 | * when we hit a tree root in a directory, the btrfs part of the inode | |
3737 | * needs to be changed to reflect the root directory of the tree root. This | |
3738 | * is kind of like crossing a mount point. | |
3739 | */ | |
3740 | static int fixup_tree_root_location(struct btrfs_root *root, | |
4df27c4d YZ |
3741 | struct inode *dir, |
3742 | struct dentry *dentry, | |
3743 | struct btrfs_key *location, | |
3744 | struct btrfs_root **sub_root) | |
39279cc3 | 3745 | { |
4df27c4d YZ |
3746 | struct btrfs_path *path; |
3747 | struct btrfs_root *new_root; | |
3748 | struct btrfs_root_ref *ref; | |
3749 | struct extent_buffer *leaf; | |
3750 | int ret; | |
3751 | int err = 0; | |
39279cc3 | 3752 | |
4df27c4d YZ |
3753 | path = btrfs_alloc_path(); |
3754 | if (!path) { | |
3755 | err = -ENOMEM; | |
3756 | goto out; | |
3757 | } | |
39279cc3 | 3758 | |
4df27c4d YZ |
3759 | err = -ENOENT; |
3760 | ret = btrfs_find_root_ref(root->fs_info->tree_root, path, | |
3761 | BTRFS_I(dir)->root->root_key.objectid, | |
3762 | location->objectid); | |
3763 | if (ret) { | |
3764 | if (ret < 0) | |
3765 | err = ret; | |
3766 | goto out; | |
3767 | } | |
39279cc3 | 3768 | |
4df27c4d YZ |
3769 | leaf = path->nodes[0]; |
3770 | ref = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_root_ref); | |
33345d01 | 3771 | if (btrfs_root_ref_dirid(leaf, ref) != btrfs_ino(dir) || |
4df27c4d YZ |
3772 | btrfs_root_ref_name_len(leaf, ref) != dentry->d_name.len) |
3773 | goto out; | |
39279cc3 | 3774 | |
4df27c4d YZ |
3775 | ret = memcmp_extent_buffer(leaf, dentry->d_name.name, |
3776 | (unsigned long)(ref + 1), | |
3777 | dentry->d_name.len); | |
3778 | if (ret) | |
3779 | goto out; | |
3780 | ||
b3b4aa74 | 3781 | btrfs_release_path(path); |
4df27c4d YZ |
3782 | |
3783 | new_root = btrfs_read_fs_root_no_name(root->fs_info, location); | |
3784 | if (IS_ERR(new_root)) { | |
3785 | err = PTR_ERR(new_root); | |
3786 | goto out; | |
3787 | } | |
3788 | ||
3789 | if (btrfs_root_refs(&new_root->root_item) == 0) { | |
3790 | err = -ENOENT; | |
3791 | goto out; | |
3792 | } | |
3793 | ||
3794 | *sub_root = new_root; | |
3795 | location->objectid = btrfs_root_dirid(&new_root->root_item); | |
3796 | location->type = BTRFS_INODE_ITEM_KEY; | |
3797 | location->offset = 0; | |
3798 | err = 0; | |
3799 | out: | |
3800 | btrfs_free_path(path); | |
3801 | return err; | |
39279cc3 CM |
3802 | } |
3803 | ||
5d4f98a2 YZ |
3804 | static void inode_tree_add(struct inode *inode) |
3805 | { | |
3806 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
3807 | struct btrfs_inode *entry; | |
03e860bd FNP |
3808 | struct rb_node **p; |
3809 | struct rb_node *parent; | |
33345d01 | 3810 | u64 ino = btrfs_ino(inode); |
03e860bd FNP |
3811 | again: |
3812 | p = &root->inode_tree.rb_node; | |
3813 | parent = NULL; | |
5d4f98a2 | 3814 | |
1d3382cb | 3815 | if (inode_unhashed(inode)) |
76dda93c YZ |
3816 | return; |
3817 | ||
5d4f98a2 YZ |
3818 | spin_lock(&root->inode_lock); |
3819 | while (*p) { | |
3820 | parent = *p; | |
3821 | entry = rb_entry(parent, struct btrfs_inode, rb_node); | |
3822 | ||
33345d01 | 3823 | if (ino < btrfs_ino(&entry->vfs_inode)) |
03e860bd | 3824 | p = &parent->rb_left; |
33345d01 | 3825 | else if (ino > btrfs_ino(&entry->vfs_inode)) |
03e860bd | 3826 | p = &parent->rb_right; |
5d4f98a2 YZ |
3827 | else { |
3828 | WARN_ON(!(entry->vfs_inode.i_state & | |
a4ffdde6 | 3829 | (I_WILL_FREE | I_FREEING))); |
03e860bd FNP |
3830 | rb_erase(parent, &root->inode_tree); |
3831 | RB_CLEAR_NODE(parent); | |
3832 | spin_unlock(&root->inode_lock); | |
3833 | goto again; | |
5d4f98a2 YZ |
3834 | } |
3835 | } | |
3836 | rb_link_node(&BTRFS_I(inode)->rb_node, parent, p); | |
3837 | rb_insert_color(&BTRFS_I(inode)->rb_node, &root->inode_tree); | |
3838 | spin_unlock(&root->inode_lock); | |
3839 | } | |
3840 | ||
3841 | static void inode_tree_del(struct inode *inode) | |
3842 | { | |
3843 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
76dda93c | 3844 | int empty = 0; |
5d4f98a2 | 3845 | |
03e860bd | 3846 | spin_lock(&root->inode_lock); |
5d4f98a2 | 3847 | if (!RB_EMPTY_NODE(&BTRFS_I(inode)->rb_node)) { |
5d4f98a2 | 3848 | rb_erase(&BTRFS_I(inode)->rb_node, &root->inode_tree); |
5d4f98a2 | 3849 | RB_CLEAR_NODE(&BTRFS_I(inode)->rb_node); |
76dda93c | 3850 | empty = RB_EMPTY_ROOT(&root->inode_tree); |
5d4f98a2 | 3851 | } |
03e860bd | 3852 | spin_unlock(&root->inode_lock); |
76dda93c | 3853 | |
0af3d00b JB |
3854 | /* |
3855 | * Free space cache has inodes in the tree root, but the tree root has a | |
3856 | * root_refs of 0, so this could end up dropping the tree root as a | |
3857 | * snapshot, so we need the extra !root->fs_info->tree_root check to | |
3858 | * make sure we don't drop it. | |
3859 | */ | |
3860 | if (empty && btrfs_root_refs(&root->root_item) == 0 && | |
3861 | root != root->fs_info->tree_root) { | |
76dda93c YZ |
3862 | synchronize_srcu(&root->fs_info->subvol_srcu); |
3863 | spin_lock(&root->inode_lock); | |
3864 | empty = RB_EMPTY_ROOT(&root->inode_tree); | |
3865 | spin_unlock(&root->inode_lock); | |
3866 | if (empty) | |
3867 | btrfs_add_dead_root(root); | |
3868 | } | |
3869 | } | |
3870 | ||
3871 | int btrfs_invalidate_inodes(struct btrfs_root *root) | |
3872 | { | |
3873 | struct rb_node *node; | |
3874 | struct rb_node *prev; | |
3875 | struct btrfs_inode *entry; | |
3876 | struct inode *inode; | |
3877 | u64 objectid = 0; | |
3878 | ||
3879 | WARN_ON(btrfs_root_refs(&root->root_item) != 0); | |
3880 | ||
3881 | spin_lock(&root->inode_lock); | |
3882 | again: | |
3883 | node = root->inode_tree.rb_node; | |
3884 | prev = NULL; | |
3885 | while (node) { | |
3886 | prev = node; | |
3887 | entry = rb_entry(node, struct btrfs_inode, rb_node); | |
3888 | ||
33345d01 | 3889 | if (objectid < btrfs_ino(&entry->vfs_inode)) |
76dda93c | 3890 | node = node->rb_left; |
33345d01 | 3891 | else if (objectid > btrfs_ino(&entry->vfs_inode)) |
76dda93c YZ |
3892 | node = node->rb_right; |
3893 | else | |
3894 | break; | |
3895 | } | |
3896 | if (!node) { | |
3897 | while (prev) { | |
3898 | entry = rb_entry(prev, struct btrfs_inode, rb_node); | |
33345d01 | 3899 | if (objectid <= btrfs_ino(&entry->vfs_inode)) { |
76dda93c YZ |
3900 | node = prev; |
3901 | break; | |
3902 | } | |
3903 | prev = rb_next(prev); | |
3904 | } | |
3905 | } | |
3906 | while (node) { | |
3907 | entry = rb_entry(node, struct btrfs_inode, rb_node); | |
33345d01 | 3908 | objectid = btrfs_ino(&entry->vfs_inode) + 1; |
76dda93c YZ |
3909 | inode = igrab(&entry->vfs_inode); |
3910 | if (inode) { | |
3911 | spin_unlock(&root->inode_lock); | |
3912 | if (atomic_read(&inode->i_count) > 1) | |
3913 | d_prune_aliases(inode); | |
3914 | /* | |
45321ac5 | 3915 | * btrfs_drop_inode will have it removed from |
76dda93c YZ |
3916 | * the inode cache when its usage count |
3917 | * hits zero. | |
3918 | */ | |
3919 | iput(inode); | |
3920 | cond_resched(); | |
3921 | spin_lock(&root->inode_lock); | |
3922 | goto again; | |
3923 | } | |
3924 | ||
3925 | if (cond_resched_lock(&root->inode_lock)) | |
3926 | goto again; | |
3927 | ||
3928 | node = rb_next(node); | |
3929 | } | |
3930 | spin_unlock(&root->inode_lock); | |
3931 | return 0; | |
5d4f98a2 YZ |
3932 | } |
3933 | ||
e02119d5 CM |
3934 | static int btrfs_init_locked_inode(struct inode *inode, void *p) |
3935 | { | |
3936 | struct btrfs_iget_args *args = p; | |
3937 | inode->i_ino = args->ino; | |
e02119d5 | 3938 | BTRFS_I(inode)->root = args->root; |
6a63209f | 3939 | btrfs_set_inode_space_info(args->root, inode); |
39279cc3 CM |
3940 | return 0; |
3941 | } | |
3942 | ||
3943 | static int btrfs_find_actor(struct inode *inode, void *opaque) | |
3944 | { | |
3945 | struct btrfs_iget_args *args = opaque; | |
33345d01 | 3946 | return args->ino == btrfs_ino(inode) && |
d397712b | 3947 | args->root == BTRFS_I(inode)->root; |
39279cc3 CM |
3948 | } |
3949 | ||
5d4f98a2 YZ |
3950 | static struct inode *btrfs_iget_locked(struct super_block *s, |
3951 | u64 objectid, | |
3952 | struct btrfs_root *root) | |
39279cc3 CM |
3953 | { |
3954 | struct inode *inode; | |
3955 | struct btrfs_iget_args args; | |
3956 | args.ino = objectid; | |
3957 | args.root = root; | |
3958 | ||
3959 | inode = iget5_locked(s, objectid, btrfs_find_actor, | |
3960 | btrfs_init_locked_inode, | |
3961 | (void *)&args); | |
3962 | return inode; | |
3963 | } | |
3964 | ||
1a54ef8c BR |
3965 | /* Get an inode object given its location and corresponding root. |
3966 | * Returns in *is_new if the inode was read from disk | |
3967 | */ | |
3968 | struct inode *btrfs_iget(struct super_block *s, struct btrfs_key *location, | |
73f73415 | 3969 | struct btrfs_root *root, int *new) |
1a54ef8c BR |
3970 | { |
3971 | struct inode *inode; | |
3972 | ||
3973 | inode = btrfs_iget_locked(s, location->objectid, root); | |
3974 | if (!inode) | |
5d4f98a2 | 3975 | return ERR_PTR(-ENOMEM); |
1a54ef8c BR |
3976 | |
3977 | if (inode->i_state & I_NEW) { | |
3978 | BTRFS_I(inode)->root = root; | |
3979 | memcpy(&BTRFS_I(inode)->location, location, sizeof(*location)); | |
3980 | btrfs_read_locked_inode(inode); | |
5d4f98a2 | 3981 | inode_tree_add(inode); |
1a54ef8c | 3982 | unlock_new_inode(inode); |
73f73415 JB |
3983 | if (new) |
3984 | *new = 1; | |
1a54ef8c BR |
3985 | } |
3986 | ||
3987 | return inode; | |
3988 | } | |
3989 | ||
4df27c4d YZ |
3990 | static struct inode *new_simple_dir(struct super_block *s, |
3991 | struct btrfs_key *key, | |
3992 | struct btrfs_root *root) | |
3993 | { | |
3994 | struct inode *inode = new_inode(s); | |
3995 | ||
3996 | if (!inode) | |
3997 | return ERR_PTR(-ENOMEM); | |
3998 | ||
4df27c4d YZ |
3999 | BTRFS_I(inode)->root = root; |
4000 | memcpy(&BTRFS_I(inode)->location, key, sizeof(*key)); | |
4001 | BTRFS_I(inode)->dummy_inode = 1; | |
4002 | ||
4003 | inode->i_ino = BTRFS_EMPTY_SUBVOL_DIR_OBJECTID; | |
4004 | inode->i_op = &simple_dir_inode_operations; | |
4005 | inode->i_fop = &simple_dir_operations; | |
4006 | inode->i_mode = S_IFDIR | S_IRUGO | S_IWUSR | S_IXUGO; | |
4007 | inode->i_mtime = inode->i_atime = inode->i_ctime = CURRENT_TIME; | |
4008 | ||
4009 | return inode; | |
4010 | } | |
4011 | ||
3de4586c | 4012 | struct inode *btrfs_lookup_dentry(struct inode *dir, struct dentry *dentry) |
39279cc3 | 4013 | { |
d397712b | 4014 | struct inode *inode; |
4df27c4d | 4015 | struct btrfs_root *root = BTRFS_I(dir)->root; |
39279cc3 CM |
4016 | struct btrfs_root *sub_root = root; |
4017 | struct btrfs_key location; | |
76dda93c | 4018 | int index; |
5d4f98a2 | 4019 | int ret; |
39279cc3 CM |
4020 | |
4021 | if (dentry->d_name.len > BTRFS_NAME_LEN) | |
4022 | return ERR_PTR(-ENAMETOOLONG); | |
5f39d397 | 4023 | |
39279cc3 | 4024 | ret = btrfs_inode_by_name(dir, dentry, &location); |
5f39d397 | 4025 | |
39279cc3 CM |
4026 | if (ret < 0) |
4027 | return ERR_PTR(ret); | |
5f39d397 | 4028 | |
4df27c4d YZ |
4029 | if (location.objectid == 0) |
4030 | return NULL; | |
4031 | ||
4032 | if (location.type == BTRFS_INODE_ITEM_KEY) { | |
73f73415 | 4033 | inode = btrfs_iget(dir->i_sb, &location, root, NULL); |
4df27c4d YZ |
4034 | return inode; |
4035 | } | |
4036 | ||
4037 | BUG_ON(location.type != BTRFS_ROOT_ITEM_KEY); | |
4038 | ||
76dda93c | 4039 | index = srcu_read_lock(&root->fs_info->subvol_srcu); |
4df27c4d YZ |
4040 | ret = fixup_tree_root_location(root, dir, dentry, |
4041 | &location, &sub_root); | |
4042 | if (ret < 0) { | |
4043 | if (ret != -ENOENT) | |
4044 | inode = ERR_PTR(ret); | |
4045 | else | |
4046 | inode = new_simple_dir(dir->i_sb, &location, sub_root); | |
4047 | } else { | |
73f73415 | 4048 | inode = btrfs_iget(dir->i_sb, &location, sub_root, NULL); |
39279cc3 | 4049 | } |
76dda93c YZ |
4050 | srcu_read_unlock(&root->fs_info->subvol_srcu, index); |
4051 | ||
34d19bad | 4052 | if (!IS_ERR(inode) && root != sub_root) { |
c71bf099 YZ |
4053 | down_read(&root->fs_info->cleanup_work_sem); |
4054 | if (!(inode->i_sb->s_flags & MS_RDONLY)) | |
66b4ffd1 | 4055 | ret = btrfs_orphan_cleanup(sub_root); |
c71bf099 | 4056 | up_read(&root->fs_info->cleanup_work_sem); |
66b4ffd1 JB |
4057 | if (ret) |
4058 | inode = ERR_PTR(ret); | |
c71bf099 YZ |
4059 | } |
4060 | ||
3de4586c CM |
4061 | return inode; |
4062 | } | |
4063 | ||
fe15ce44 | 4064 | static int btrfs_dentry_delete(const struct dentry *dentry) |
76dda93c YZ |
4065 | { |
4066 | struct btrfs_root *root; | |
4067 | ||
efefb143 YZ |
4068 | if (!dentry->d_inode && !IS_ROOT(dentry)) |
4069 | dentry = dentry->d_parent; | |
76dda93c | 4070 | |
efefb143 YZ |
4071 | if (dentry->d_inode) { |
4072 | root = BTRFS_I(dentry->d_inode)->root; | |
4073 | if (btrfs_root_refs(&root->root_item) == 0) | |
4074 | return 1; | |
4075 | } | |
76dda93c YZ |
4076 | return 0; |
4077 | } | |
4078 | ||
3de4586c CM |
4079 | static struct dentry *btrfs_lookup(struct inode *dir, struct dentry *dentry, |
4080 | struct nameidata *nd) | |
4081 | { | |
a9049376 | 4082 | return d_splice_alias(btrfs_lookup_dentry(dir, dentry), dentry); |
39279cc3 CM |
4083 | } |
4084 | ||
16cdcec7 | 4085 | unsigned char btrfs_filetype_table[] = { |
39279cc3 CM |
4086 | DT_UNKNOWN, DT_REG, DT_DIR, DT_CHR, DT_BLK, DT_FIFO, DT_SOCK, DT_LNK |
4087 | }; | |
4088 | ||
cbdf5a24 DW |
4089 | static int btrfs_real_readdir(struct file *filp, void *dirent, |
4090 | filldir_t filldir) | |
39279cc3 | 4091 | { |
6da6abae | 4092 | struct inode *inode = filp->f_dentry->d_inode; |
39279cc3 CM |
4093 | struct btrfs_root *root = BTRFS_I(inode)->root; |
4094 | struct btrfs_item *item; | |
4095 | struct btrfs_dir_item *di; | |
4096 | struct btrfs_key key; | |
5f39d397 | 4097 | struct btrfs_key found_key; |
39279cc3 | 4098 | struct btrfs_path *path; |
16cdcec7 MX |
4099 | struct list_head ins_list; |
4100 | struct list_head del_list; | |
39279cc3 | 4101 | int ret; |
5f39d397 | 4102 | struct extent_buffer *leaf; |
39279cc3 | 4103 | int slot; |
39279cc3 CM |
4104 | unsigned char d_type; |
4105 | int over = 0; | |
4106 | u32 di_cur; | |
4107 | u32 di_total; | |
4108 | u32 di_len; | |
4109 | int key_type = BTRFS_DIR_INDEX_KEY; | |
5f39d397 CM |
4110 | char tmp_name[32]; |
4111 | char *name_ptr; | |
4112 | int name_len; | |
16cdcec7 | 4113 | int is_curr = 0; /* filp->f_pos points to the current index? */ |
39279cc3 CM |
4114 | |
4115 | /* FIXME, use a real flag for deciding about the key type */ | |
4116 | if (root->fs_info->tree_root == root) | |
4117 | key_type = BTRFS_DIR_ITEM_KEY; | |
5f39d397 | 4118 | |
3954401f CM |
4119 | /* special case for "." */ |
4120 | if (filp->f_pos == 0) { | |
33345d01 | 4121 | over = filldir(dirent, ".", 1, 1, btrfs_ino(inode), DT_DIR); |
3954401f CM |
4122 | if (over) |
4123 | return 0; | |
4124 | filp->f_pos = 1; | |
4125 | } | |
3954401f CM |
4126 | /* special case for .., just use the back ref */ |
4127 | if (filp->f_pos == 1) { | |
5ecc7e5d | 4128 | u64 pino = parent_ino(filp->f_path.dentry); |
3954401f | 4129 | over = filldir(dirent, "..", 2, |
5ecc7e5d | 4130 | 2, pino, DT_DIR); |
3954401f | 4131 | if (over) |
49593bfa | 4132 | return 0; |
3954401f CM |
4133 | filp->f_pos = 2; |
4134 | } | |
49593bfa | 4135 | path = btrfs_alloc_path(); |
16cdcec7 MX |
4136 | if (!path) |
4137 | return -ENOMEM; | |
ff5714cc | 4138 | |
026fd317 | 4139 | path->reada = 1; |
49593bfa | 4140 | |
16cdcec7 MX |
4141 | if (key_type == BTRFS_DIR_INDEX_KEY) { |
4142 | INIT_LIST_HEAD(&ins_list); | |
4143 | INIT_LIST_HEAD(&del_list); | |
4144 | btrfs_get_delayed_items(inode, &ins_list, &del_list); | |
4145 | } | |
4146 | ||
39279cc3 CM |
4147 | btrfs_set_key_type(&key, key_type); |
4148 | key.offset = filp->f_pos; | |
33345d01 | 4149 | key.objectid = btrfs_ino(inode); |
5f39d397 | 4150 | |
39279cc3 CM |
4151 | ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); |
4152 | if (ret < 0) | |
4153 | goto err; | |
49593bfa DW |
4154 | |
4155 | while (1) { | |
5f39d397 | 4156 | leaf = path->nodes[0]; |
39279cc3 | 4157 | slot = path->slots[0]; |
b9e03af0 LZ |
4158 | if (slot >= btrfs_header_nritems(leaf)) { |
4159 | ret = btrfs_next_leaf(root, path); | |
4160 | if (ret < 0) | |
4161 | goto err; | |
4162 | else if (ret > 0) | |
4163 | break; | |
4164 | continue; | |
39279cc3 | 4165 | } |
3de4586c | 4166 | |
5f39d397 CM |
4167 | item = btrfs_item_nr(leaf, slot); |
4168 | btrfs_item_key_to_cpu(leaf, &found_key, slot); | |
4169 | ||
4170 | if (found_key.objectid != key.objectid) | |
39279cc3 | 4171 | break; |
5f39d397 | 4172 | if (btrfs_key_type(&found_key) != key_type) |
39279cc3 | 4173 | break; |
5f39d397 | 4174 | if (found_key.offset < filp->f_pos) |
b9e03af0 | 4175 | goto next; |
16cdcec7 MX |
4176 | if (key_type == BTRFS_DIR_INDEX_KEY && |
4177 | btrfs_should_delete_dir_index(&del_list, | |
4178 | found_key.offset)) | |
4179 | goto next; | |
5f39d397 CM |
4180 | |
4181 | filp->f_pos = found_key.offset; | |
16cdcec7 | 4182 | is_curr = 1; |
49593bfa | 4183 | |
39279cc3 CM |
4184 | di = btrfs_item_ptr(leaf, slot, struct btrfs_dir_item); |
4185 | di_cur = 0; | |
5f39d397 | 4186 | di_total = btrfs_item_size(leaf, item); |
49593bfa DW |
4187 | |
4188 | while (di_cur < di_total) { | |
5f39d397 CM |
4189 | struct btrfs_key location; |
4190 | ||
22a94d44 JB |
4191 | if (verify_dir_item(root, leaf, di)) |
4192 | break; | |
4193 | ||
5f39d397 | 4194 | name_len = btrfs_dir_name_len(leaf, di); |
49593bfa | 4195 | if (name_len <= sizeof(tmp_name)) { |
5f39d397 CM |
4196 | name_ptr = tmp_name; |
4197 | } else { | |
4198 | name_ptr = kmalloc(name_len, GFP_NOFS); | |
49593bfa DW |
4199 | if (!name_ptr) { |
4200 | ret = -ENOMEM; | |
4201 | goto err; | |
4202 | } | |
5f39d397 CM |
4203 | } |
4204 | read_extent_buffer(leaf, name_ptr, | |
4205 | (unsigned long)(di + 1), name_len); | |
4206 | ||
4207 | d_type = btrfs_filetype_table[btrfs_dir_type(leaf, di)]; | |
4208 | btrfs_dir_item_key_to_cpu(leaf, di, &location); | |
3de4586c CM |
4209 | |
4210 | /* is this a reference to our own snapshot? If so | |
4211 | * skip it | |
4212 | */ | |
4213 | if (location.type == BTRFS_ROOT_ITEM_KEY && | |
4214 | location.objectid == root->root_key.objectid) { | |
4215 | over = 0; | |
4216 | goto skip; | |
4217 | } | |
5f39d397 | 4218 | over = filldir(dirent, name_ptr, name_len, |
49593bfa | 4219 | found_key.offset, location.objectid, |
39279cc3 | 4220 | d_type); |
5f39d397 | 4221 | |
3de4586c | 4222 | skip: |
5f39d397 CM |
4223 | if (name_ptr != tmp_name) |
4224 | kfree(name_ptr); | |
4225 | ||
39279cc3 CM |
4226 | if (over) |
4227 | goto nopos; | |
5103e947 | 4228 | di_len = btrfs_dir_name_len(leaf, di) + |
49593bfa | 4229 | btrfs_dir_data_len(leaf, di) + sizeof(*di); |
39279cc3 CM |
4230 | di_cur += di_len; |
4231 | di = (struct btrfs_dir_item *)((char *)di + di_len); | |
4232 | } | |
b9e03af0 LZ |
4233 | next: |
4234 | path->slots[0]++; | |
39279cc3 | 4235 | } |
49593bfa | 4236 | |
16cdcec7 MX |
4237 | if (key_type == BTRFS_DIR_INDEX_KEY) { |
4238 | if (is_curr) | |
4239 | filp->f_pos++; | |
4240 | ret = btrfs_readdir_delayed_dir_index(filp, dirent, filldir, | |
4241 | &ins_list); | |
4242 | if (ret) | |
4243 | goto nopos; | |
4244 | } | |
4245 | ||
49593bfa | 4246 | /* Reached end of directory/root. Bump pos past the last item. */ |
5e591a07 | 4247 | if (key_type == BTRFS_DIR_INDEX_KEY) |
406266ab JE |
4248 | /* |
4249 | * 32-bit glibc will use getdents64, but then strtol - | |
4250 | * so the last number we can serve is this. | |
4251 | */ | |
4252 | filp->f_pos = 0x7fffffff; | |
5e591a07 YZ |
4253 | else |
4254 | filp->f_pos++; | |
39279cc3 CM |
4255 | nopos: |
4256 | ret = 0; | |
4257 | err: | |
16cdcec7 MX |
4258 | if (key_type == BTRFS_DIR_INDEX_KEY) |
4259 | btrfs_put_delayed_items(&ins_list, &del_list); | |
39279cc3 | 4260 | btrfs_free_path(path); |
39279cc3 CM |
4261 | return ret; |
4262 | } | |
4263 | ||
a9185b41 | 4264 | int btrfs_write_inode(struct inode *inode, struct writeback_control *wbc) |
39279cc3 CM |
4265 | { |
4266 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
4267 | struct btrfs_trans_handle *trans; | |
4268 | int ret = 0; | |
0af3d00b | 4269 | bool nolock = false; |
39279cc3 | 4270 | |
8929ecfa | 4271 | if (BTRFS_I(inode)->dummy_inode) |
4ca8b41e CM |
4272 | return 0; |
4273 | ||
7841cb28 | 4274 | if (btrfs_fs_closing(root->fs_info) && is_free_space_inode(root, inode)) |
82d5902d | 4275 | nolock = true; |
0af3d00b | 4276 | |
a9185b41 | 4277 | if (wbc->sync_mode == WB_SYNC_ALL) { |
0af3d00b | 4278 | if (nolock) |
7a7eaa40 | 4279 | trans = btrfs_join_transaction_nolock(root); |
0af3d00b | 4280 | else |
7a7eaa40 | 4281 | trans = btrfs_join_transaction(root); |
3612b495 TI |
4282 | if (IS_ERR(trans)) |
4283 | return PTR_ERR(trans); | |
0af3d00b JB |
4284 | if (nolock) |
4285 | ret = btrfs_end_transaction_nolock(trans, root); | |
4286 | else | |
4287 | ret = btrfs_commit_transaction(trans, root); | |
39279cc3 CM |
4288 | } |
4289 | return ret; | |
4290 | } | |
4291 | ||
4292 | /* | |
54aa1f4d | 4293 | * This is somewhat expensive, updating the tree every time the |
39279cc3 CM |
4294 | * inode changes. But, it is most likely to find the inode in cache. |
4295 | * FIXME, needs more benchmarking...there are no reasons other than performance | |
4296 | * to keep or drop this code. | |
4297 | */ | |
aa385729 | 4298 | void btrfs_dirty_inode(struct inode *inode, int flags) |
39279cc3 CM |
4299 | { |
4300 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
4301 | struct btrfs_trans_handle *trans; | |
8929ecfa YZ |
4302 | int ret; |
4303 | ||
4304 | if (BTRFS_I(inode)->dummy_inode) | |
4305 | return; | |
39279cc3 | 4306 | |
7a7eaa40 | 4307 | trans = btrfs_join_transaction(root); |
3612b495 | 4308 | BUG_ON(IS_ERR(trans)); |
8929ecfa YZ |
4309 | |
4310 | ret = btrfs_update_inode(trans, root, inode); | |
94b60442 CM |
4311 | if (ret && ret == -ENOSPC) { |
4312 | /* whoops, lets try again with the full transaction */ | |
4313 | btrfs_end_transaction(trans, root); | |
4314 | trans = btrfs_start_transaction(root, 1); | |
9aeead73 | 4315 | if (IS_ERR(trans)) { |
7a36ddec | 4316 | printk_ratelimited(KERN_ERR "btrfs: fail to " |
33345d01 LZ |
4317 | "dirty inode %llu error %ld\n", |
4318 | (unsigned long long)btrfs_ino(inode), | |
4319 | PTR_ERR(trans)); | |
9aeead73 CM |
4320 | return; |
4321 | } | |
8929ecfa | 4322 | |
94b60442 CM |
4323 | ret = btrfs_update_inode(trans, root, inode); |
4324 | if (ret) { | |
7a36ddec | 4325 | printk_ratelimited(KERN_ERR "btrfs: fail to " |
33345d01 LZ |
4326 | "dirty inode %llu error %d\n", |
4327 | (unsigned long long)btrfs_ino(inode), | |
4328 | ret); | |
94b60442 CM |
4329 | } |
4330 | } | |
39279cc3 | 4331 | btrfs_end_transaction(trans, root); |
16cdcec7 MX |
4332 | if (BTRFS_I(inode)->delayed_node) |
4333 | btrfs_balance_delayed_items(root); | |
39279cc3 CM |
4334 | } |
4335 | ||
d352ac68 CM |
4336 | /* |
4337 | * find the highest existing sequence number in a directory | |
4338 | * and then set the in-memory index_cnt variable to reflect | |
4339 | * free sequence numbers | |
4340 | */ | |
aec7477b JB |
4341 | static int btrfs_set_inode_index_count(struct inode *inode) |
4342 | { | |
4343 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
4344 | struct btrfs_key key, found_key; | |
4345 | struct btrfs_path *path; | |
4346 | struct extent_buffer *leaf; | |
4347 | int ret; | |
4348 | ||
33345d01 | 4349 | key.objectid = btrfs_ino(inode); |
aec7477b JB |
4350 | btrfs_set_key_type(&key, BTRFS_DIR_INDEX_KEY); |
4351 | key.offset = (u64)-1; | |
4352 | ||
4353 | path = btrfs_alloc_path(); | |
4354 | if (!path) | |
4355 | return -ENOMEM; | |
4356 | ||
4357 | ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); | |
4358 | if (ret < 0) | |
4359 | goto out; | |
4360 | /* FIXME: we should be able to handle this */ | |
4361 | if (ret == 0) | |
4362 | goto out; | |
4363 | ret = 0; | |
4364 | ||
4365 | /* | |
4366 | * MAGIC NUMBER EXPLANATION: | |
4367 | * since we search a directory based on f_pos we have to start at 2 | |
4368 | * since '.' and '..' have f_pos of 0 and 1 respectively, so everybody | |
4369 | * else has to start at 2 | |
4370 | */ | |
4371 | if (path->slots[0] == 0) { | |
4372 | BTRFS_I(inode)->index_cnt = 2; | |
4373 | goto out; | |
4374 | } | |
4375 | ||
4376 | path->slots[0]--; | |
4377 | ||
4378 | leaf = path->nodes[0]; | |
4379 | btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); | |
4380 | ||
33345d01 | 4381 | if (found_key.objectid != btrfs_ino(inode) || |
aec7477b JB |
4382 | btrfs_key_type(&found_key) != BTRFS_DIR_INDEX_KEY) { |
4383 | BTRFS_I(inode)->index_cnt = 2; | |
4384 | goto out; | |
4385 | } | |
4386 | ||
4387 | BTRFS_I(inode)->index_cnt = found_key.offset + 1; | |
4388 | out: | |
4389 | btrfs_free_path(path); | |
4390 | return ret; | |
4391 | } | |
4392 | ||
d352ac68 CM |
4393 | /* |
4394 | * helper to find a free sequence number in a given directory. This current | |
4395 | * code is very simple, later versions will do smarter things in the btree | |
4396 | */ | |
3de4586c | 4397 | int btrfs_set_inode_index(struct inode *dir, u64 *index) |
aec7477b JB |
4398 | { |
4399 | int ret = 0; | |
4400 | ||
4401 | if (BTRFS_I(dir)->index_cnt == (u64)-1) { | |
16cdcec7 MX |
4402 | ret = btrfs_inode_delayed_dir_index_count(dir); |
4403 | if (ret) { | |
4404 | ret = btrfs_set_inode_index_count(dir); | |
4405 | if (ret) | |
4406 | return ret; | |
4407 | } | |
aec7477b JB |
4408 | } |
4409 | ||
00e4e6b3 | 4410 | *index = BTRFS_I(dir)->index_cnt; |
aec7477b JB |
4411 | BTRFS_I(dir)->index_cnt++; |
4412 | ||
4413 | return ret; | |
4414 | } | |
4415 | ||
39279cc3 CM |
4416 | static struct inode *btrfs_new_inode(struct btrfs_trans_handle *trans, |
4417 | struct btrfs_root *root, | |
aec7477b | 4418 | struct inode *dir, |
9c58309d | 4419 | const char *name, int name_len, |
d82a6f1d JB |
4420 | u64 ref_objectid, u64 objectid, int mode, |
4421 | u64 *index) | |
39279cc3 CM |
4422 | { |
4423 | struct inode *inode; | |
5f39d397 | 4424 | struct btrfs_inode_item *inode_item; |
39279cc3 | 4425 | struct btrfs_key *location; |
5f39d397 | 4426 | struct btrfs_path *path; |
9c58309d CM |
4427 | struct btrfs_inode_ref *ref; |
4428 | struct btrfs_key key[2]; | |
4429 | u32 sizes[2]; | |
4430 | unsigned long ptr; | |
39279cc3 CM |
4431 | int ret; |
4432 | int owner; | |
4433 | ||
5f39d397 CM |
4434 | path = btrfs_alloc_path(); |
4435 | BUG_ON(!path); | |
4436 | ||
39279cc3 | 4437 | inode = new_inode(root->fs_info->sb); |
8fb27640 YS |
4438 | if (!inode) { |
4439 | btrfs_free_path(path); | |
39279cc3 | 4440 | return ERR_PTR(-ENOMEM); |
8fb27640 | 4441 | } |
39279cc3 | 4442 | |
581bb050 LZ |
4443 | /* |
4444 | * we have to initialize this early, so we can reclaim the inode | |
4445 | * number if we fail afterwards in this function. | |
4446 | */ | |
4447 | inode->i_ino = objectid; | |
4448 | ||
aec7477b | 4449 | if (dir) { |
1abe9b8a | 4450 | trace_btrfs_inode_request(dir); |
4451 | ||
3de4586c | 4452 | ret = btrfs_set_inode_index(dir, index); |
09771430 | 4453 | if (ret) { |
8fb27640 | 4454 | btrfs_free_path(path); |
09771430 | 4455 | iput(inode); |
aec7477b | 4456 | return ERR_PTR(ret); |
09771430 | 4457 | } |
aec7477b JB |
4458 | } |
4459 | /* | |
4460 | * index_cnt is ignored for everything but a dir, | |
4461 | * btrfs_get_inode_index_count has an explanation for the magic | |
4462 | * number | |
4463 | */ | |
4464 | BTRFS_I(inode)->index_cnt = 2; | |
39279cc3 | 4465 | BTRFS_I(inode)->root = root; |
e02119d5 | 4466 | BTRFS_I(inode)->generation = trans->transid; |
76195853 | 4467 | inode->i_generation = BTRFS_I(inode)->generation; |
6a63209f | 4468 | btrfs_set_inode_space_info(root, inode); |
b888db2b | 4469 | |
39279cc3 CM |
4470 | if (mode & S_IFDIR) |
4471 | owner = 0; | |
4472 | else | |
4473 | owner = 1; | |
9c58309d CM |
4474 | |
4475 | key[0].objectid = objectid; | |
4476 | btrfs_set_key_type(&key[0], BTRFS_INODE_ITEM_KEY); | |
4477 | key[0].offset = 0; | |
4478 | ||
4479 | key[1].objectid = objectid; | |
4480 | btrfs_set_key_type(&key[1], BTRFS_INODE_REF_KEY); | |
4481 | key[1].offset = ref_objectid; | |
4482 | ||
4483 | sizes[0] = sizeof(struct btrfs_inode_item); | |
4484 | sizes[1] = name_len + sizeof(*ref); | |
4485 | ||
b9473439 | 4486 | path->leave_spinning = 1; |
9c58309d CM |
4487 | ret = btrfs_insert_empty_items(trans, root, path, key, sizes, 2); |
4488 | if (ret != 0) | |
5f39d397 CM |
4489 | goto fail; |
4490 | ||
ecc11fab | 4491 | inode_init_owner(inode, dir, mode); |
a76a3cd4 | 4492 | inode_set_bytes(inode, 0); |
39279cc3 | 4493 | inode->i_mtime = inode->i_atime = inode->i_ctime = CURRENT_TIME; |
5f39d397 CM |
4494 | inode_item = btrfs_item_ptr(path->nodes[0], path->slots[0], |
4495 | struct btrfs_inode_item); | |
e02119d5 | 4496 | fill_inode_item(trans, path->nodes[0], inode_item, inode); |
9c58309d CM |
4497 | |
4498 | ref = btrfs_item_ptr(path->nodes[0], path->slots[0] + 1, | |
4499 | struct btrfs_inode_ref); | |
4500 | btrfs_set_inode_ref_name_len(path->nodes[0], ref, name_len); | |
00e4e6b3 | 4501 | btrfs_set_inode_ref_index(path->nodes[0], ref, *index); |
9c58309d CM |
4502 | ptr = (unsigned long)(ref + 1); |
4503 | write_extent_buffer(path->nodes[0], name, ptr, name_len); | |
4504 | ||
5f39d397 CM |
4505 | btrfs_mark_buffer_dirty(path->nodes[0]); |
4506 | btrfs_free_path(path); | |
4507 | ||
39279cc3 CM |
4508 | location = &BTRFS_I(inode)->location; |
4509 | location->objectid = objectid; | |
39279cc3 CM |
4510 | location->offset = 0; |
4511 | btrfs_set_key_type(location, BTRFS_INODE_ITEM_KEY); | |
4512 | ||
6cbff00f CH |
4513 | btrfs_inherit_iflags(inode, dir); |
4514 | ||
94272164 CM |
4515 | if ((mode & S_IFREG)) { |
4516 | if (btrfs_test_opt(root, NODATASUM)) | |
4517 | BTRFS_I(inode)->flags |= BTRFS_INODE_NODATASUM; | |
75e7cb7f LB |
4518 | if (btrfs_test_opt(root, NODATACOW) || |
4519 | (BTRFS_I(dir)->flags & BTRFS_INODE_NODATACOW)) | |
94272164 CM |
4520 | BTRFS_I(inode)->flags |= BTRFS_INODE_NODATACOW; |
4521 | } | |
4522 | ||
39279cc3 | 4523 | insert_inode_hash(inode); |
5d4f98a2 | 4524 | inode_tree_add(inode); |
1abe9b8a | 4525 | |
4526 | trace_btrfs_inode_new(inode); | |
1973f0fa | 4527 | btrfs_set_inode_last_trans(trans, inode); |
1abe9b8a | 4528 | |
39279cc3 | 4529 | return inode; |
5f39d397 | 4530 | fail: |
aec7477b JB |
4531 | if (dir) |
4532 | BTRFS_I(dir)->index_cnt--; | |
5f39d397 | 4533 | btrfs_free_path(path); |
09771430 | 4534 | iput(inode); |
5f39d397 | 4535 | return ERR_PTR(ret); |
39279cc3 CM |
4536 | } |
4537 | ||
4538 | static inline u8 btrfs_inode_type(struct inode *inode) | |
4539 | { | |
4540 | return btrfs_type_by_mode[(inode->i_mode & S_IFMT) >> S_SHIFT]; | |
4541 | } | |
4542 | ||
d352ac68 CM |
4543 | /* |
4544 | * utility function to add 'inode' into 'parent_inode' with | |
4545 | * a give name and a given sequence number. | |
4546 | * if 'add_backref' is true, also insert a backref from the | |
4547 | * inode to the parent directory. | |
4548 | */ | |
e02119d5 CM |
4549 | int btrfs_add_link(struct btrfs_trans_handle *trans, |
4550 | struct inode *parent_inode, struct inode *inode, | |
4551 | const char *name, int name_len, int add_backref, u64 index) | |
39279cc3 | 4552 | { |
4df27c4d | 4553 | int ret = 0; |
39279cc3 | 4554 | struct btrfs_key key; |
e02119d5 | 4555 | struct btrfs_root *root = BTRFS_I(parent_inode)->root; |
33345d01 LZ |
4556 | u64 ino = btrfs_ino(inode); |
4557 | u64 parent_ino = btrfs_ino(parent_inode); | |
5f39d397 | 4558 | |
33345d01 | 4559 | if (unlikely(ino == BTRFS_FIRST_FREE_OBJECTID)) { |
4df27c4d YZ |
4560 | memcpy(&key, &BTRFS_I(inode)->root->root_key, sizeof(key)); |
4561 | } else { | |
33345d01 | 4562 | key.objectid = ino; |
4df27c4d YZ |
4563 | btrfs_set_key_type(&key, BTRFS_INODE_ITEM_KEY); |
4564 | key.offset = 0; | |
4565 | } | |
4566 | ||
33345d01 | 4567 | if (unlikely(ino == BTRFS_FIRST_FREE_OBJECTID)) { |
4df27c4d YZ |
4568 | ret = btrfs_add_root_ref(trans, root->fs_info->tree_root, |
4569 | key.objectid, root->root_key.objectid, | |
33345d01 | 4570 | parent_ino, index, name, name_len); |
4df27c4d | 4571 | } else if (add_backref) { |
33345d01 LZ |
4572 | ret = btrfs_insert_inode_ref(trans, root, name, name_len, ino, |
4573 | parent_ino, index); | |
4df27c4d | 4574 | } |
39279cc3 | 4575 | |
39279cc3 | 4576 | if (ret == 0) { |
4df27c4d | 4577 | ret = btrfs_insert_dir_item(trans, root, name, name_len, |
16cdcec7 | 4578 | parent_inode, &key, |
4df27c4d YZ |
4579 | btrfs_inode_type(inode), index); |
4580 | BUG_ON(ret); | |
4581 | ||
dbe674a9 | 4582 | btrfs_i_size_write(parent_inode, parent_inode->i_size + |
e02119d5 | 4583 | name_len * 2); |
79c44584 | 4584 | parent_inode->i_mtime = parent_inode->i_ctime = CURRENT_TIME; |
e02119d5 | 4585 | ret = btrfs_update_inode(trans, root, parent_inode); |
39279cc3 CM |
4586 | } |
4587 | return ret; | |
4588 | } | |
4589 | ||
4590 | static int btrfs_add_nondir(struct btrfs_trans_handle *trans, | |
a1b075d2 JB |
4591 | struct inode *dir, struct dentry *dentry, |
4592 | struct inode *inode, int backref, u64 index) | |
39279cc3 | 4593 | { |
a1b075d2 JB |
4594 | int err = btrfs_add_link(trans, dir, inode, |
4595 | dentry->d_name.name, dentry->d_name.len, | |
4596 | backref, index); | |
39279cc3 CM |
4597 | if (!err) { |
4598 | d_instantiate(dentry, inode); | |
4599 | return 0; | |
4600 | } | |
4601 | if (err > 0) | |
4602 | err = -EEXIST; | |
4603 | return err; | |
4604 | } | |
4605 | ||
618e21d5 JB |
4606 | static int btrfs_mknod(struct inode *dir, struct dentry *dentry, |
4607 | int mode, dev_t rdev) | |
4608 | { | |
4609 | struct btrfs_trans_handle *trans; | |
4610 | struct btrfs_root *root = BTRFS_I(dir)->root; | |
1832a6d5 | 4611 | struct inode *inode = NULL; |
618e21d5 JB |
4612 | int err; |
4613 | int drop_inode = 0; | |
4614 | u64 objectid; | |
1832a6d5 | 4615 | unsigned long nr = 0; |
00e4e6b3 | 4616 | u64 index = 0; |
618e21d5 JB |
4617 | |
4618 | if (!new_valid_dev(rdev)) | |
4619 | return -EINVAL; | |
4620 | ||
9ed74f2d JB |
4621 | /* |
4622 | * 2 for inode item and ref | |
4623 | * 2 for dir items | |
4624 | * 1 for xattr if selinux is on | |
4625 | */ | |
a22285a6 YZ |
4626 | trans = btrfs_start_transaction(root, 5); |
4627 | if (IS_ERR(trans)) | |
4628 | return PTR_ERR(trans); | |
1832a6d5 | 4629 | |
581bb050 LZ |
4630 | err = btrfs_find_free_ino(root, &objectid); |
4631 | if (err) | |
4632 | goto out_unlock; | |
4633 | ||
aec7477b | 4634 | inode = btrfs_new_inode(trans, root, dir, dentry->d_name.name, |
33345d01 | 4635 | dentry->d_name.len, btrfs_ino(dir), objectid, |
d82a6f1d | 4636 | mode, &index); |
7cf96da3 TI |
4637 | if (IS_ERR(inode)) { |
4638 | err = PTR_ERR(inode); | |
618e21d5 | 4639 | goto out_unlock; |
7cf96da3 | 4640 | } |
618e21d5 | 4641 | |
2a7dba39 | 4642 | err = btrfs_init_inode_security(trans, inode, dir, &dentry->d_name); |
33268eaf JB |
4643 | if (err) { |
4644 | drop_inode = 1; | |
4645 | goto out_unlock; | |
4646 | } | |
4647 | ||
a1b075d2 | 4648 | err = btrfs_add_nondir(trans, dir, dentry, inode, 0, index); |
618e21d5 JB |
4649 | if (err) |
4650 | drop_inode = 1; | |
4651 | else { | |
4652 | inode->i_op = &btrfs_special_inode_operations; | |
4653 | init_special_inode(inode, inode->i_mode, rdev); | |
1b4ab1bb | 4654 | btrfs_update_inode(trans, root, inode); |
618e21d5 | 4655 | } |
618e21d5 | 4656 | out_unlock: |
d3c2fdcf | 4657 | nr = trans->blocks_used; |
89ce8a63 | 4658 | btrfs_end_transaction_throttle(trans, root); |
a22285a6 | 4659 | btrfs_btree_balance_dirty(root, nr); |
618e21d5 JB |
4660 | if (drop_inode) { |
4661 | inode_dec_link_count(inode); | |
4662 | iput(inode); | |
4663 | } | |
618e21d5 JB |
4664 | return err; |
4665 | } | |
4666 | ||
39279cc3 CM |
4667 | static int btrfs_create(struct inode *dir, struct dentry *dentry, |
4668 | int mode, struct nameidata *nd) | |
4669 | { | |
4670 | struct btrfs_trans_handle *trans; | |
4671 | struct btrfs_root *root = BTRFS_I(dir)->root; | |
1832a6d5 | 4672 | struct inode *inode = NULL; |
39279cc3 | 4673 | int drop_inode = 0; |
a22285a6 | 4674 | int err; |
1832a6d5 | 4675 | unsigned long nr = 0; |
39279cc3 | 4676 | u64 objectid; |
00e4e6b3 | 4677 | u64 index = 0; |
39279cc3 | 4678 | |
9ed74f2d JB |
4679 | /* |
4680 | * 2 for inode item and ref | |
4681 | * 2 for dir items | |
4682 | * 1 for xattr if selinux is on | |
4683 | */ | |
a22285a6 YZ |
4684 | trans = btrfs_start_transaction(root, 5); |
4685 | if (IS_ERR(trans)) | |
4686 | return PTR_ERR(trans); | |
9ed74f2d | 4687 | |
581bb050 LZ |
4688 | err = btrfs_find_free_ino(root, &objectid); |
4689 | if (err) | |
4690 | goto out_unlock; | |
4691 | ||
aec7477b | 4692 | inode = btrfs_new_inode(trans, root, dir, dentry->d_name.name, |
33345d01 | 4693 | dentry->d_name.len, btrfs_ino(dir), objectid, |
d82a6f1d | 4694 | mode, &index); |
7cf96da3 TI |
4695 | if (IS_ERR(inode)) { |
4696 | err = PTR_ERR(inode); | |
39279cc3 | 4697 | goto out_unlock; |
7cf96da3 | 4698 | } |
39279cc3 | 4699 | |
2a7dba39 | 4700 | err = btrfs_init_inode_security(trans, inode, dir, &dentry->d_name); |
33268eaf JB |
4701 | if (err) { |
4702 | drop_inode = 1; | |
4703 | goto out_unlock; | |
4704 | } | |
4705 | ||
a1b075d2 | 4706 | err = btrfs_add_nondir(trans, dir, dentry, inode, 0, index); |
39279cc3 CM |
4707 | if (err) |
4708 | drop_inode = 1; | |
4709 | else { | |
4710 | inode->i_mapping->a_ops = &btrfs_aops; | |
04160088 | 4711 | inode->i_mapping->backing_dev_info = &root->fs_info->bdi; |
39279cc3 CM |
4712 | inode->i_fop = &btrfs_file_operations; |
4713 | inode->i_op = &btrfs_file_inode_operations; | |
d1310b2e | 4714 | BTRFS_I(inode)->io_tree.ops = &btrfs_extent_io_ops; |
39279cc3 | 4715 | } |
39279cc3 | 4716 | out_unlock: |
d3c2fdcf | 4717 | nr = trans->blocks_used; |
ab78c84d | 4718 | btrfs_end_transaction_throttle(trans, root); |
39279cc3 CM |
4719 | if (drop_inode) { |
4720 | inode_dec_link_count(inode); | |
4721 | iput(inode); | |
4722 | } | |
d3c2fdcf | 4723 | btrfs_btree_balance_dirty(root, nr); |
39279cc3 CM |
4724 | return err; |
4725 | } | |
4726 | ||
4727 | static int btrfs_link(struct dentry *old_dentry, struct inode *dir, | |
4728 | struct dentry *dentry) | |
4729 | { | |
4730 | struct btrfs_trans_handle *trans; | |
4731 | struct btrfs_root *root = BTRFS_I(dir)->root; | |
4732 | struct inode *inode = old_dentry->d_inode; | |
00e4e6b3 | 4733 | u64 index; |
1832a6d5 | 4734 | unsigned long nr = 0; |
39279cc3 CM |
4735 | int err; |
4736 | int drop_inode = 0; | |
4737 | ||
4a8be425 TH |
4738 | /* do not allow sys_link's with other subvols of the same device */ |
4739 | if (root->objectid != BTRFS_I(inode)->root->objectid) | |
3ab3564f | 4740 | return -EXDEV; |
4a8be425 | 4741 | |
c055e99e AV |
4742 | if (inode->i_nlink == ~0U) |
4743 | return -EMLINK; | |
4a8be425 | 4744 | |
3de4586c | 4745 | err = btrfs_set_inode_index(dir, &index); |
aec7477b JB |
4746 | if (err) |
4747 | goto fail; | |
4748 | ||
a22285a6 | 4749 | /* |
7e6b6465 | 4750 | * 2 items for inode and inode ref |
a22285a6 | 4751 | * 2 items for dir items |
7e6b6465 | 4752 | * 1 item for parent inode |
a22285a6 | 4753 | */ |
7e6b6465 | 4754 | trans = btrfs_start_transaction(root, 5); |
a22285a6 YZ |
4755 | if (IS_ERR(trans)) { |
4756 | err = PTR_ERR(trans); | |
4757 | goto fail; | |
4758 | } | |
5f39d397 | 4759 | |
3153495d MX |
4760 | btrfs_inc_nlink(inode); |
4761 | inode->i_ctime = CURRENT_TIME; | |
7de9c6ee | 4762 | ihold(inode); |
aec7477b | 4763 | |
a1b075d2 | 4764 | err = btrfs_add_nondir(trans, dir, dentry, inode, 1, index); |
5f39d397 | 4765 | |
a5719521 | 4766 | if (err) { |
54aa1f4d | 4767 | drop_inode = 1; |
a5719521 | 4768 | } else { |
6a912213 | 4769 | struct dentry *parent = dget_parent(dentry); |
a5719521 YZ |
4770 | err = btrfs_update_inode(trans, root, inode); |
4771 | BUG_ON(err); | |
6a912213 JB |
4772 | btrfs_log_new_name(trans, inode, NULL, parent); |
4773 | dput(parent); | |
a5719521 | 4774 | } |
39279cc3 | 4775 | |
d3c2fdcf | 4776 | nr = trans->blocks_used; |
ab78c84d | 4777 | btrfs_end_transaction_throttle(trans, root); |
1832a6d5 | 4778 | fail: |
39279cc3 CM |
4779 | if (drop_inode) { |
4780 | inode_dec_link_count(inode); | |
4781 | iput(inode); | |
4782 | } | |
d3c2fdcf | 4783 | btrfs_btree_balance_dirty(root, nr); |
39279cc3 CM |
4784 | return err; |
4785 | } | |
4786 | ||
39279cc3 CM |
4787 | static int btrfs_mkdir(struct inode *dir, struct dentry *dentry, int mode) |
4788 | { | |
b9d86667 | 4789 | struct inode *inode = NULL; |
39279cc3 CM |
4790 | struct btrfs_trans_handle *trans; |
4791 | struct btrfs_root *root = BTRFS_I(dir)->root; | |
4792 | int err = 0; | |
4793 | int drop_on_err = 0; | |
b9d86667 | 4794 | u64 objectid = 0; |
00e4e6b3 | 4795 | u64 index = 0; |
d3c2fdcf | 4796 | unsigned long nr = 1; |
39279cc3 | 4797 | |
9ed74f2d JB |
4798 | /* |
4799 | * 2 items for inode and ref | |
4800 | * 2 items for dir items | |
4801 | * 1 for xattr if selinux is on | |
4802 | */ | |
a22285a6 YZ |
4803 | trans = btrfs_start_transaction(root, 5); |
4804 | if (IS_ERR(trans)) | |
4805 | return PTR_ERR(trans); | |
39279cc3 | 4806 | |
581bb050 LZ |
4807 | err = btrfs_find_free_ino(root, &objectid); |
4808 | if (err) | |
4809 | goto out_fail; | |
4810 | ||
aec7477b | 4811 | inode = btrfs_new_inode(trans, root, dir, dentry->d_name.name, |
33345d01 | 4812 | dentry->d_name.len, btrfs_ino(dir), objectid, |
d82a6f1d | 4813 | S_IFDIR | mode, &index); |
39279cc3 CM |
4814 | if (IS_ERR(inode)) { |
4815 | err = PTR_ERR(inode); | |
4816 | goto out_fail; | |
4817 | } | |
5f39d397 | 4818 | |
39279cc3 | 4819 | drop_on_err = 1; |
33268eaf | 4820 | |
2a7dba39 | 4821 | err = btrfs_init_inode_security(trans, inode, dir, &dentry->d_name); |
33268eaf JB |
4822 | if (err) |
4823 | goto out_fail; | |
4824 | ||
39279cc3 CM |
4825 | inode->i_op = &btrfs_dir_inode_operations; |
4826 | inode->i_fop = &btrfs_dir_file_operations; | |
39279cc3 | 4827 | |
dbe674a9 | 4828 | btrfs_i_size_write(inode, 0); |
39279cc3 CM |
4829 | err = btrfs_update_inode(trans, root, inode); |
4830 | if (err) | |
4831 | goto out_fail; | |
5f39d397 | 4832 | |
a1b075d2 JB |
4833 | err = btrfs_add_link(trans, dir, inode, dentry->d_name.name, |
4834 | dentry->d_name.len, 0, index); | |
39279cc3 CM |
4835 | if (err) |
4836 | goto out_fail; | |
5f39d397 | 4837 | |
39279cc3 CM |
4838 | d_instantiate(dentry, inode); |
4839 | drop_on_err = 0; | |
39279cc3 CM |
4840 | |
4841 | out_fail: | |
d3c2fdcf | 4842 | nr = trans->blocks_used; |
ab78c84d | 4843 | btrfs_end_transaction_throttle(trans, root); |
39279cc3 CM |
4844 | if (drop_on_err) |
4845 | iput(inode); | |
d3c2fdcf | 4846 | btrfs_btree_balance_dirty(root, nr); |
39279cc3 CM |
4847 | return err; |
4848 | } | |
4849 | ||
d352ac68 CM |
4850 | /* helper for btfs_get_extent. Given an existing extent in the tree, |
4851 | * and an extent that you want to insert, deal with overlap and insert | |
4852 | * the new extent into the tree. | |
4853 | */ | |
3b951516 CM |
4854 | static int merge_extent_mapping(struct extent_map_tree *em_tree, |
4855 | struct extent_map *existing, | |
e6dcd2dc CM |
4856 | struct extent_map *em, |
4857 | u64 map_start, u64 map_len) | |
3b951516 CM |
4858 | { |
4859 | u64 start_diff; | |
3b951516 | 4860 | |
e6dcd2dc CM |
4861 | BUG_ON(map_start < em->start || map_start >= extent_map_end(em)); |
4862 | start_diff = map_start - em->start; | |
4863 | em->start = map_start; | |
4864 | em->len = map_len; | |
c8b97818 CM |
4865 | if (em->block_start < EXTENT_MAP_LAST_BYTE && |
4866 | !test_bit(EXTENT_FLAG_COMPRESSED, &em->flags)) { | |
e6dcd2dc | 4867 | em->block_start += start_diff; |
c8b97818 CM |
4868 | em->block_len -= start_diff; |
4869 | } | |
e6dcd2dc | 4870 | return add_extent_mapping(em_tree, em); |
3b951516 CM |
4871 | } |
4872 | ||
c8b97818 CM |
4873 | static noinline int uncompress_inline(struct btrfs_path *path, |
4874 | struct inode *inode, struct page *page, | |
4875 | size_t pg_offset, u64 extent_offset, | |
4876 | struct btrfs_file_extent_item *item) | |
4877 | { | |
4878 | int ret; | |
4879 | struct extent_buffer *leaf = path->nodes[0]; | |
4880 | char *tmp; | |
4881 | size_t max_size; | |
4882 | unsigned long inline_size; | |
4883 | unsigned long ptr; | |
261507a0 | 4884 | int compress_type; |
c8b97818 CM |
4885 | |
4886 | WARN_ON(pg_offset != 0); | |
261507a0 | 4887 | compress_type = btrfs_file_extent_compression(leaf, item); |
c8b97818 CM |
4888 | max_size = btrfs_file_extent_ram_bytes(leaf, item); |
4889 | inline_size = btrfs_file_extent_inline_item_len(leaf, | |
4890 | btrfs_item_nr(leaf, path->slots[0])); | |
4891 | tmp = kmalloc(inline_size, GFP_NOFS); | |
8d413713 TI |
4892 | if (!tmp) |
4893 | return -ENOMEM; | |
c8b97818 CM |
4894 | ptr = btrfs_file_extent_inline_start(item); |
4895 | ||
4896 | read_extent_buffer(leaf, tmp, ptr, inline_size); | |
4897 | ||
5b050f04 | 4898 | max_size = min_t(unsigned long, PAGE_CACHE_SIZE, max_size); |
261507a0 LZ |
4899 | ret = btrfs_decompress(compress_type, tmp, page, |
4900 | extent_offset, inline_size, max_size); | |
c8b97818 CM |
4901 | if (ret) { |
4902 | char *kaddr = kmap_atomic(page, KM_USER0); | |
4903 | unsigned long copy_size = min_t(u64, | |
4904 | PAGE_CACHE_SIZE - pg_offset, | |
4905 | max_size - extent_offset); | |
4906 | memset(kaddr + pg_offset, 0, copy_size); | |
4907 | kunmap_atomic(kaddr, KM_USER0); | |
4908 | } | |
4909 | kfree(tmp); | |
4910 | return 0; | |
4911 | } | |
4912 | ||
d352ac68 CM |
4913 | /* |
4914 | * a bit scary, this does extent mapping from logical file offset to the disk. | |
d397712b CM |
4915 | * the ugly parts come from merging extents from the disk with the in-ram |
4916 | * representation. This gets more complex because of the data=ordered code, | |
d352ac68 CM |
4917 | * where the in-ram extents might be locked pending data=ordered completion. |
4918 | * | |
4919 | * This also copies inline extents directly into the page. | |
4920 | */ | |
d397712b | 4921 | |
a52d9a80 | 4922 | struct extent_map *btrfs_get_extent(struct inode *inode, struct page *page, |
70dec807 | 4923 | size_t pg_offset, u64 start, u64 len, |
a52d9a80 CM |
4924 | int create) |
4925 | { | |
4926 | int ret; | |
4927 | int err = 0; | |
db94535d | 4928 | u64 bytenr; |
a52d9a80 CM |
4929 | u64 extent_start = 0; |
4930 | u64 extent_end = 0; | |
33345d01 | 4931 | u64 objectid = btrfs_ino(inode); |
a52d9a80 | 4932 | u32 found_type; |
f421950f | 4933 | struct btrfs_path *path = NULL; |
a52d9a80 CM |
4934 | struct btrfs_root *root = BTRFS_I(inode)->root; |
4935 | struct btrfs_file_extent_item *item; | |
5f39d397 CM |
4936 | struct extent_buffer *leaf; |
4937 | struct btrfs_key found_key; | |
a52d9a80 CM |
4938 | struct extent_map *em = NULL; |
4939 | struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree; | |
d1310b2e | 4940 | struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree; |
a52d9a80 | 4941 | struct btrfs_trans_handle *trans = NULL; |
261507a0 | 4942 | int compress_type; |
a52d9a80 | 4943 | |
a52d9a80 | 4944 | again: |
890871be | 4945 | read_lock(&em_tree->lock); |
d1310b2e | 4946 | em = lookup_extent_mapping(em_tree, start, len); |
a061fc8d CM |
4947 | if (em) |
4948 | em->bdev = root->fs_info->fs_devices->latest_bdev; | |
890871be | 4949 | read_unlock(&em_tree->lock); |
d1310b2e | 4950 | |
a52d9a80 | 4951 | if (em) { |
e1c4b745 CM |
4952 | if (em->start > start || em->start + em->len <= start) |
4953 | free_extent_map(em); | |
4954 | else if (em->block_start == EXTENT_MAP_INLINE && page) | |
70dec807 CM |
4955 | free_extent_map(em); |
4956 | else | |
4957 | goto out; | |
a52d9a80 | 4958 | } |
172ddd60 | 4959 | em = alloc_extent_map(); |
a52d9a80 | 4960 | if (!em) { |
d1310b2e CM |
4961 | err = -ENOMEM; |
4962 | goto out; | |
a52d9a80 | 4963 | } |
e6dcd2dc | 4964 | em->bdev = root->fs_info->fs_devices->latest_bdev; |
d1310b2e | 4965 | em->start = EXTENT_MAP_HOLE; |
445a6944 | 4966 | em->orig_start = EXTENT_MAP_HOLE; |
d1310b2e | 4967 | em->len = (u64)-1; |
c8b97818 | 4968 | em->block_len = (u64)-1; |
f421950f CM |
4969 | |
4970 | if (!path) { | |
4971 | path = btrfs_alloc_path(); | |
026fd317 JB |
4972 | if (!path) { |
4973 | err = -ENOMEM; | |
4974 | goto out; | |
4975 | } | |
4976 | /* | |
4977 | * Chances are we'll be called again, so go ahead and do | |
4978 | * readahead | |
4979 | */ | |
4980 | path->reada = 1; | |
f421950f CM |
4981 | } |
4982 | ||
179e29e4 CM |
4983 | ret = btrfs_lookup_file_extent(trans, root, path, |
4984 | objectid, start, trans != NULL); | |
a52d9a80 CM |
4985 | if (ret < 0) { |
4986 | err = ret; | |
4987 | goto out; | |
4988 | } | |
4989 | ||
4990 | if (ret != 0) { | |
4991 | if (path->slots[0] == 0) | |
4992 | goto not_found; | |
4993 | path->slots[0]--; | |
4994 | } | |
4995 | ||
5f39d397 CM |
4996 | leaf = path->nodes[0]; |
4997 | item = btrfs_item_ptr(leaf, path->slots[0], | |
a52d9a80 | 4998 | struct btrfs_file_extent_item); |
a52d9a80 | 4999 | /* are we inside the extent that was found? */ |
5f39d397 CM |
5000 | btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); |
5001 | found_type = btrfs_key_type(&found_key); | |
5002 | if (found_key.objectid != objectid || | |
a52d9a80 CM |
5003 | found_type != BTRFS_EXTENT_DATA_KEY) { |
5004 | goto not_found; | |
5005 | } | |
5006 | ||
5f39d397 CM |
5007 | found_type = btrfs_file_extent_type(leaf, item); |
5008 | extent_start = found_key.offset; | |
261507a0 | 5009 | compress_type = btrfs_file_extent_compression(leaf, item); |
d899e052 YZ |
5010 | if (found_type == BTRFS_FILE_EXTENT_REG || |
5011 | found_type == BTRFS_FILE_EXTENT_PREALLOC) { | |
a52d9a80 | 5012 | extent_end = extent_start + |
db94535d | 5013 | btrfs_file_extent_num_bytes(leaf, item); |
9036c102 YZ |
5014 | } else if (found_type == BTRFS_FILE_EXTENT_INLINE) { |
5015 | size_t size; | |
5016 | size = btrfs_file_extent_inline_len(leaf, item); | |
5017 | extent_end = (extent_start + size + root->sectorsize - 1) & | |
5018 | ~((u64)root->sectorsize - 1); | |
5019 | } | |
5020 | ||
5021 | if (start >= extent_end) { | |
5022 | path->slots[0]++; | |
5023 | if (path->slots[0] >= btrfs_header_nritems(leaf)) { | |
5024 | ret = btrfs_next_leaf(root, path); | |
5025 | if (ret < 0) { | |
5026 | err = ret; | |
5027 | goto out; | |
a52d9a80 | 5028 | } |
9036c102 YZ |
5029 | if (ret > 0) |
5030 | goto not_found; | |
5031 | leaf = path->nodes[0]; | |
a52d9a80 | 5032 | } |
9036c102 YZ |
5033 | btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); |
5034 | if (found_key.objectid != objectid || | |
5035 | found_key.type != BTRFS_EXTENT_DATA_KEY) | |
5036 | goto not_found; | |
5037 | if (start + len <= found_key.offset) | |
5038 | goto not_found; | |
5039 | em->start = start; | |
5040 | em->len = found_key.offset - start; | |
5041 | goto not_found_em; | |
5042 | } | |
5043 | ||
d899e052 YZ |
5044 | if (found_type == BTRFS_FILE_EXTENT_REG || |
5045 | found_type == BTRFS_FILE_EXTENT_PREALLOC) { | |
9036c102 YZ |
5046 | em->start = extent_start; |
5047 | em->len = extent_end - extent_start; | |
ff5b7ee3 YZ |
5048 | em->orig_start = extent_start - |
5049 | btrfs_file_extent_offset(leaf, item); | |
db94535d CM |
5050 | bytenr = btrfs_file_extent_disk_bytenr(leaf, item); |
5051 | if (bytenr == 0) { | |
5f39d397 | 5052 | em->block_start = EXTENT_MAP_HOLE; |
a52d9a80 CM |
5053 | goto insert; |
5054 | } | |
261507a0 | 5055 | if (compress_type != BTRFS_COMPRESS_NONE) { |
c8b97818 | 5056 | set_bit(EXTENT_FLAG_COMPRESSED, &em->flags); |
261507a0 | 5057 | em->compress_type = compress_type; |
c8b97818 CM |
5058 | em->block_start = bytenr; |
5059 | em->block_len = btrfs_file_extent_disk_num_bytes(leaf, | |
5060 | item); | |
5061 | } else { | |
5062 | bytenr += btrfs_file_extent_offset(leaf, item); | |
5063 | em->block_start = bytenr; | |
5064 | em->block_len = em->len; | |
d899e052 YZ |
5065 | if (found_type == BTRFS_FILE_EXTENT_PREALLOC) |
5066 | set_bit(EXTENT_FLAG_PREALLOC, &em->flags); | |
c8b97818 | 5067 | } |
a52d9a80 CM |
5068 | goto insert; |
5069 | } else if (found_type == BTRFS_FILE_EXTENT_INLINE) { | |
5f39d397 | 5070 | unsigned long ptr; |
a52d9a80 | 5071 | char *map; |
3326d1b0 CM |
5072 | size_t size; |
5073 | size_t extent_offset; | |
5074 | size_t copy_size; | |
a52d9a80 | 5075 | |
689f9346 | 5076 | em->block_start = EXTENT_MAP_INLINE; |
c8b97818 | 5077 | if (!page || create) { |
689f9346 | 5078 | em->start = extent_start; |
9036c102 | 5079 | em->len = extent_end - extent_start; |
689f9346 Y |
5080 | goto out; |
5081 | } | |
5f39d397 | 5082 | |
9036c102 YZ |
5083 | size = btrfs_file_extent_inline_len(leaf, item); |
5084 | extent_offset = page_offset(page) + pg_offset - extent_start; | |
70dec807 | 5085 | copy_size = min_t(u64, PAGE_CACHE_SIZE - pg_offset, |
3326d1b0 | 5086 | size - extent_offset); |
3326d1b0 | 5087 | em->start = extent_start + extent_offset; |
70dec807 CM |
5088 | em->len = (copy_size + root->sectorsize - 1) & |
5089 | ~((u64)root->sectorsize - 1); | |
ff5b7ee3 | 5090 | em->orig_start = EXTENT_MAP_INLINE; |
261507a0 | 5091 | if (compress_type) { |
c8b97818 | 5092 | set_bit(EXTENT_FLAG_COMPRESSED, &em->flags); |
261507a0 LZ |
5093 | em->compress_type = compress_type; |
5094 | } | |
689f9346 | 5095 | ptr = btrfs_file_extent_inline_start(item) + extent_offset; |
179e29e4 | 5096 | if (create == 0 && !PageUptodate(page)) { |
261507a0 LZ |
5097 | if (btrfs_file_extent_compression(leaf, item) != |
5098 | BTRFS_COMPRESS_NONE) { | |
c8b97818 CM |
5099 | ret = uncompress_inline(path, inode, page, |
5100 | pg_offset, | |
5101 | extent_offset, item); | |
5102 | BUG_ON(ret); | |
5103 | } else { | |
5104 | map = kmap(page); | |
5105 | read_extent_buffer(leaf, map + pg_offset, ptr, | |
5106 | copy_size); | |
93c82d57 CM |
5107 | if (pg_offset + copy_size < PAGE_CACHE_SIZE) { |
5108 | memset(map + pg_offset + copy_size, 0, | |
5109 | PAGE_CACHE_SIZE - pg_offset - | |
5110 | copy_size); | |
5111 | } | |
c8b97818 CM |
5112 | kunmap(page); |
5113 | } | |
179e29e4 CM |
5114 | flush_dcache_page(page); |
5115 | } else if (create && PageUptodate(page)) { | |
0ca1f7ce | 5116 | WARN_ON(1); |
179e29e4 CM |
5117 | if (!trans) { |
5118 | kunmap(page); | |
5119 | free_extent_map(em); | |
5120 | em = NULL; | |
ff5714cc | 5121 | |
b3b4aa74 | 5122 | btrfs_release_path(path); |
7a7eaa40 | 5123 | trans = btrfs_join_transaction(root); |
ff5714cc | 5124 | |
3612b495 TI |
5125 | if (IS_ERR(trans)) |
5126 | return ERR_CAST(trans); | |
179e29e4 CM |
5127 | goto again; |
5128 | } | |
c8b97818 | 5129 | map = kmap(page); |
70dec807 | 5130 | write_extent_buffer(leaf, map + pg_offset, ptr, |
179e29e4 | 5131 | copy_size); |
c8b97818 | 5132 | kunmap(page); |
179e29e4 | 5133 | btrfs_mark_buffer_dirty(leaf); |
a52d9a80 | 5134 | } |
d1310b2e | 5135 | set_extent_uptodate(io_tree, em->start, |
507903b8 | 5136 | extent_map_end(em) - 1, NULL, GFP_NOFS); |
a52d9a80 CM |
5137 | goto insert; |
5138 | } else { | |
d397712b | 5139 | printk(KERN_ERR "btrfs unknown found_type %d\n", found_type); |
a52d9a80 CM |
5140 | WARN_ON(1); |
5141 | } | |
5142 | not_found: | |
5143 | em->start = start; | |
d1310b2e | 5144 | em->len = len; |
a52d9a80 | 5145 | not_found_em: |
5f39d397 | 5146 | em->block_start = EXTENT_MAP_HOLE; |
9036c102 | 5147 | set_bit(EXTENT_FLAG_VACANCY, &em->flags); |
a52d9a80 | 5148 | insert: |
b3b4aa74 | 5149 | btrfs_release_path(path); |
d1310b2e | 5150 | if (em->start > start || extent_map_end(em) <= start) { |
d397712b CM |
5151 | printk(KERN_ERR "Btrfs: bad extent! em: [%llu %llu] passed " |
5152 | "[%llu %llu]\n", (unsigned long long)em->start, | |
5153 | (unsigned long long)em->len, | |
5154 | (unsigned long long)start, | |
5155 | (unsigned long long)len); | |
a52d9a80 CM |
5156 | err = -EIO; |
5157 | goto out; | |
5158 | } | |
d1310b2e CM |
5159 | |
5160 | err = 0; | |
890871be | 5161 | write_lock(&em_tree->lock); |
a52d9a80 | 5162 | ret = add_extent_mapping(em_tree, em); |
3b951516 CM |
5163 | /* it is possible that someone inserted the extent into the tree |
5164 | * while we had the lock dropped. It is also possible that | |
5165 | * an overlapping map exists in the tree | |
5166 | */ | |
a52d9a80 | 5167 | if (ret == -EEXIST) { |
3b951516 | 5168 | struct extent_map *existing; |
e6dcd2dc CM |
5169 | |
5170 | ret = 0; | |
5171 | ||
3b951516 | 5172 | existing = lookup_extent_mapping(em_tree, start, len); |
e1c4b745 CM |
5173 | if (existing && (existing->start > start || |
5174 | existing->start + existing->len <= start)) { | |
5175 | free_extent_map(existing); | |
5176 | existing = NULL; | |
5177 | } | |
3b951516 CM |
5178 | if (!existing) { |
5179 | existing = lookup_extent_mapping(em_tree, em->start, | |
5180 | em->len); | |
5181 | if (existing) { | |
5182 | err = merge_extent_mapping(em_tree, existing, | |
e6dcd2dc CM |
5183 | em, start, |
5184 | root->sectorsize); | |
3b951516 CM |
5185 | free_extent_map(existing); |
5186 | if (err) { | |
5187 | free_extent_map(em); | |
5188 | em = NULL; | |
5189 | } | |
5190 | } else { | |
5191 | err = -EIO; | |
3b951516 CM |
5192 | free_extent_map(em); |
5193 | em = NULL; | |
5194 | } | |
5195 | } else { | |
5196 | free_extent_map(em); | |
5197 | em = existing; | |
e6dcd2dc | 5198 | err = 0; |
a52d9a80 | 5199 | } |
a52d9a80 | 5200 | } |
890871be | 5201 | write_unlock(&em_tree->lock); |
a52d9a80 | 5202 | out: |
1abe9b8a | 5203 | |
5204 | trace_btrfs_get_extent(root, em); | |
5205 | ||
f421950f CM |
5206 | if (path) |
5207 | btrfs_free_path(path); | |
a52d9a80 CM |
5208 | if (trans) { |
5209 | ret = btrfs_end_transaction(trans, root); | |
d397712b | 5210 | if (!err) |
a52d9a80 CM |
5211 | err = ret; |
5212 | } | |
a52d9a80 CM |
5213 | if (err) { |
5214 | free_extent_map(em); | |
a52d9a80 CM |
5215 | return ERR_PTR(err); |
5216 | } | |
5217 | return em; | |
5218 | } | |
5219 | ||
ec29ed5b CM |
5220 | struct extent_map *btrfs_get_extent_fiemap(struct inode *inode, struct page *page, |
5221 | size_t pg_offset, u64 start, u64 len, | |
5222 | int create) | |
5223 | { | |
5224 | struct extent_map *em; | |
5225 | struct extent_map *hole_em = NULL; | |
5226 | u64 range_start = start; | |
5227 | u64 end; | |
5228 | u64 found; | |
5229 | u64 found_end; | |
5230 | int err = 0; | |
5231 | ||
5232 | em = btrfs_get_extent(inode, page, pg_offset, start, len, create); | |
5233 | if (IS_ERR(em)) | |
5234 | return em; | |
5235 | if (em) { | |
5236 | /* | |
5237 | * if our em maps to a hole, there might | |
5238 | * actually be delalloc bytes behind it | |
5239 | */ | |
5240 | if (em->block_start != EXTENT_MAP_HOLE) | |
5241 | return em; | |
5242 | else | |
5243 | hole_em = em; | |
5244 | } | |
5245 | ||
5246 | /* check to see if we've wrapped (len == -1 or similar) */ | |
5247 | end = start + len; | |
5248 | if (end < start) | |
5249 | end = (u64)-1; | |
5250 | else | |
5251 | end -= 1; | |
5252 | ||
5253 | em = NULL; | |
5254 | ||
5255 | /* ok, we didn't find anything, lets look for delalloc */ | |
5256 | found = count_range_bits(&BTRFS_I(inode)->io_tree, &range_start, | |
5257 | end, len, EXTENT_DELALLOC, 1); | |
5258 | found_end = range_start + found; | |
5259 | if (found_end < range_start) | |
5260 | found_end = (u64)-1; | |
5261 | ||
5262 | /* | |
5263 | * we didn't find anything useful, return | |
5264 | * the original results from get_extent() | |
5265 | */ | |
5266 | if (range_start > end || found_end <= start) { | |
5267 | em = hole_em; | |
5268 | hole_em = NULL; | |
5269 | goto out; | |
5270 | } | |
5271 | ||
5272 | /* adjust the range_start to make sure it doesn't | |
5273 | * go backwards from the start they passed in | |
5274 | */ | |
5275 | range_start = max(start,range_start); | |
5276 | found = found_end - range_start; | |
5277 | ||
5278 | if (found > 0) { | |
5279 | u64 hole_start = start; | |
5280 | u64 hole_len = len; | |
5281 | ||
172ddd60 | 5282 | em = alloc_extent_map(); |
ec29ed5b CM |
5283 | if (!em) { |
5284 | err = -ENOMEM; | |
5285 | goto out; | |
5286 | } | |
5287 | /* | |
5288 | * when btrfs_get_extent can't find anything it | |
5289 | * returns one huge hole | |
5290 | * | |
5291 | * make sure what it found really fits our range, and | |
5292 | * adjust to make sure it is based on the start from | |
5293 | * the caller | |
5294 | */ | |
5295 | if (hole_em) { | |
5296 | u64 calc_end = extent_map_end(hole_em); | |
5297 | ||
5298 | if (calc_end <= start || (hole_em->start > end)) { | |
5299 | free_extent_map(hole_em); | |
5300 | hole_em = NULL; | |
5301 | } else { | |
5302 | hole_start = max(hole_em->start, start); | |
5303 | hole_len = calc_end - hole_start; | |
5304 | } | |
5305 | } | |
5306 | em->bdev = NULL; | |
5307 | if (hole_em && range_start > hole_start) { | |
5308 | /* our hole starts before our delalloc, so we | |
5309 | * have to return just the parts of the hole | |
5310 | * that go until the delalloc starts | |
5311 | */ | |
5312 | em->len = min(hole_len, | |
5313 | range_start - hole_start); | |
5314 | em->start = hole_start; | |
5315 | em->orig_start = hole_start; | |
5316 | /* | |
5317 | * don't adjust block start at all, | |
5318 | * it is fixed at EXTENT_MAP_HOLE | |
5319 | */ | |
5320 | em->block_start = hole_em->block_start; | |
5321 | em->block_len = hole_len; | |
5322 | } else { | |
5323 | em->start = range_start; | |
5324 | em->len = found; | |
5325 | em->orig_start = range_start; | |
5326 | em->block_start = EXTENT_MAP_DELALLOC; | |
5327 | em->block_len = found; | |
5328 | } | |
5329 | } else if (hole_em) { | |
5330 | return hole_em; | |
5331 | } | |
5332 | out: | |
5333 | ||
5334 | free_extent_map(hole_em); | |
5335 | if (err) { | |
5336 | free_extent_map(em); | |
5337 | return ERR_PTR(err); | |
5338 | } | |
5339 | return em; | |
5340 | } | |
5341 | ||
4b46fce2 | 5342 | static struct extent_map *btrfs_new_extent_direct(struct inode *inode, |
16d299ac | 5343 | struct extent_map *em, |
4b46fce2 JB |
5344 | u64 start, u64 len) |
5345 | { | |
5346 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
5347 | struct btrfs_trans_handle *trans; | |
4b46fce2 JB |
5348 | struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree; |
5349 | struct btrfs_key ins; | |
5350 | u64 alloc_hint; | |
5351 | int ret; | |
16d299ac | 5352 | bool insert = false; |
4b46fce2 | 5353 | |
16d299ac JB |
5354 | /* |
5355 | * Ok if the extent map we looked up is a hole and is for the exact | |
5356 | * range we want, there is no reason to allocate a new one, however if | |
5357 | * it is not right then we need to free this one and drop the cache for | |
5358 | * our range. | |
5359 | */ | |
5360 | if (em->block_start != EXTENT_MAP_HOLE || em->start != start || | |
5361 | em->len != len) { | |
5362 | free_extent_map(em); | |
5363 | em = NULL; | |
5364 | insert = true; | |
5365 | btrfs_drop_extent_cache(inode, start, start + len - 1, 0); | |
5366 | } | |
4b46fce2 | 5367 | |
7a7eaa40 | 5368 | trans = btrfs_join_transaction(root); |
3612b495 TI |
5369 | if (IS_ERR(trans)) |
5370 | return ERR_CAST(trans); | |
4b46fce2 | 5371 | |
4cb5300b CM |
5372 | if (start <= BTRFS_I(inode)->disk_i_size && len < 64 * 1024) |
5373 | btrfs_add_inode_defrag(trans, inode); | |
5374 | ||
4b46fce2 JB |
5375 | trans->block_rsv = &root->fs_info->delalloc_block_rsv; |
5376 | ||
5377 | alloc_hint = get_extent_allocation_hint(inode, start, len); | |
5378 | ret = btrfs_reserve_extent(trans, root, len, root->sectorsize, 0, | |
5379 | alloc_hint, (u64)-1, &ins, 1); | |
5380 | if (ret) { | |
5381 | em = ERR_PTR(ret); | |
5382 | goto out; | |
5383 | } | |
5384 | ||
4b46fce2 | 5385 | if (!em) { |
172ddd60 | 5386 | em = alloc_extent_map(); |
16d299ac JB |
5387 | if (!em) { |
5388 | em = ERR_PTR(-ENOMEM); | |
5389 | goto out; | |
5390 | } | |
4b46fce2 JB |
5391 | } |
5392 | ||
5393 | em->start = start; | |
5394 | em->orig_start = em->start; | |
5395 | em->len = ins.offset; | |
5396 | ||
5397 | em->block_start = ins.objectid; | |
5398 | em->block_len = ins.offset; | |
5399 | em->bdev = root->fs_info->fs_devices->latest_bdev; | |
16d299ac JB |
5400 | |
5401 | /* | |
5402 | * We need to do this because if we're using the original em we searched | |
5403 | * for, we could have EXTENT_FLAG_VACANCY set, and we don't want that. | |
5404 | */ | |
5405 | em->flags = 0; | |
4b46fce2 JB |
5406 | set_bit(EXTENT_FLAG_PINNED, &em->flags); |
5407 | ||
16d299ac | 5408 | while (insert) { |
4b46fce2 JB |
5409 | write_lock(&em_tree->lock); |
5410 | ret = add_extent_mapping(em_tree, em); | |
5411 | write_unlock(&em_tree->lock); | |
5412 | if (ret != -EEXIST) | |
5413 | break; | |
5414 | btrfs_drop_extent_cache(inode, start, start + em->len - 1, 0); | |
5415 | } | |
5416 | ||
5417 | ret = btrfs_add_ordered_extent_dio(inode, start, ins.objectid, | |
5418 | ins.offset, ins.offset, 0); | |
5419 | if (ret) { | |
5420 | btrfs_free_reserved_extent(root, ins.objectid, ins.offset); | |
5421 | em = ERR_PTR(ret); | |
5422 | } | |
5423 | out: | |
5424 | btrfs_end_transaction(trans, root); | |
5425 | return em; | |
5426 | } | |
5427 | ||
46bfbb5c CM |
5428 | /* |
5429 | * returns 1 when the nocow is safe, < 1 on error, 0 if the | |
5430 | * block must be cow'd | |
5431 | */ | |
5432 | static noinline int can_nocow_odirect(struct btrfs_trans_handle *trans, | |
5433 | struct inode *inode, u64 offset, u64 len) | |
5434 | { | |
5435 | struct btrfs_path *path; | |
5436 | int ret; | |
5437 | struct extent_buffer *leaf; | |
5438 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
5439 | struct btrfs_file_extent_item *fi; | |
5440 | struct btrfs_key key; | |
5441 | u64 disk_bytenr; | |
5442 | u64 backref_offset; | |
5443 | u64 extent_end; | |
5444 | u64 num_bytes; | |
5445 | int slot; | |
5446 | int found_type; | |
5447 | ||
5448 | path = btrfs_alloc_path(); | |
5449 | if (!path) | |
5450 | return -ENOMEM; | |
5451 | ||
33345d01 | 5452 | ret = btrfs_lookup_file_extent(trans, root, path, btrfs_ino(inode), |
46bfbb5c CM |
5453 | offset, 0); |
5454 | if (ret < 0) | |
5455 | goto out; | |
5456 | ||
5457 | slot = path->slots[0]; | |
5458 | if (ret == 1) { | |
5459 | if (slot == 0) { | |
5460 | /* can't find the item, must cow */ | |
5461 | ret = 0; | |
5462 | goto out; | |
5463 | } | |
5464 | slot--; | |
5465 | } | |
5466 | ret = 0; | |
5467 | leaf = path->nodes[0]; | |
5468 | btrfs_item_key_to_cpu(leaf, &key, slot); | |
33345d01 | 5469 | if (key.objectid != btrfs_ino(inode) || |
46bfbb5c CM |
5470 | key.type != BTRFS_EXTENT_DATA_KEY) { |
5471 | /* not our file or wrong item type, must cow */ | |
5472 | goto out; | |
5473 | } | |
5474 | ||
5475 | if (key.offset > offset) { | |
5476 | /* Wrong offset, must cow */ | |
5477 | goto out; | |
5478 | } | |
5479 | ||
5480 | fi = btrfs_item_ptr(leaf, slot, struct btrfs_file_extent_item); | |
5481 | found_type = btrfs_file_extent_type(leaf, fi); | |
5482 | if (found_type != BTRFS_FILE_EXTENT_REG && | |
5483 | found_type != BTRFS_FILE_EXTENT_PREALLOC) { | |
5484 | /* not a regular extent, must cow */ | |
5485 | goto out; | |
5486 | } | |
5487 | disk_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); | |
5488 | backref_offset = btrfs_file_extent_offset(leaf, fi); | |
5489 | ||
5490 | extent_end = key.offset + btrfs_file_extent_num_bytes(leaf, fi); | |
5491 | if (extent_end < offset + len) { | |
5492 | /* extent doesn't include our full range, must cow */ | |
5493 | goto out; | |
5494 | } | |
5495 | ||
5496 | if (btrfs_extent_readonly(root, disk_bytenr)) | |
5497 | goto out; | |
5498 | ||
5499 | /* | |
5500 | * look for other files referencing this extent, if we | |
5501 | * find any we must cow | |
5502 | */ | |
33345d01 | 5503 | if (btrfs_cross_ref_exist(trans, root, btrfs_ino(inode), |
46bfbb5c CM |
5504 | key.offset - backref_offset, disk_bytenr)) |
5505 | goto out; | |
5506 | ||
5507 | /* | |
5508 | * adjust disk_bytenr and num_bytes to cover just the bytes | |
5509 | * in this extent we are about to write. If there | |
5510 | * are any csums in that range we have to cow in order | |
5511 | * to keep the csums correct | |
5512 | */ | |
5513 | disk_bytenr += backref_offset; | |
5514 | disk_bytenr += offset - key.offset; | |
5515 | num_bytes = min(offset + len, extent_end) - offset; | |
5516 | if (csum_exist_in_range(root, disk_bytenr, num_bytes)) | |
5517 | goto out; | |
5518 | /* | |
5519 | * all of the above have passed, it is safe to overwrite this extent | |
5520 | * without cow | |
5521 | */ | |
5522 | ret = 1; | |
5523 | out: | |
5524 | btrfs_free_path(path); | |
5525 | return ret; | |
5526 | } | |
5527 | ||
4b46fce2 JB |
5528 | static int btrfs_get_blocks_direct(struct inode *inode, sector_t iblock, |
5529 | struct buffer_head *bh_result, int create) | |
5530 | { | |
5531 | struct extent_map *em; | |
5532 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
5533 | u64 start = iblock << inode->i_blkbits; | |
5534 | u64 len = bh_result->b_size; | |
46bfbb5c | 5535 | struct btrfs_trans_handle *trans; |
4b46fce2 JB |
5536 | |
5537 | em = btrfs_get_extent(inode, NULL, 0, start, len, 0); | |
5538 | if (IS_ERR(em)) | |
5539 | return PTR_ERR(em); | |
5540 | ||
5541 | /* | |
5542 | * Ok for INLINE and COMPRESSED extents we need to fallback on buffered | |
5543 | * io. INLINE is special, and we could probably kludge it in here, but | |
5544 | * it's still buffered so for safety lets just fall back to the generic | |
5545 | * buffered path. | |
5546 | * | |
5547 | * For COMPRESSED we _have_ to read the entire extent in so we can | |
5548 | * decompress it, so there will be buffering required no matter what we | |
5549 | * do, so go ahead and fallback to buffered. | |
5550 | * | |
5551 | * We return -ENOTBLK because thats what makes DIO go ahead and go back | |
5552 | * to buffered IO. Don't blame me, this is the price we pay for using | |
5553 | * the generic code. | |
5554 | */ | |
5555 | if (test_bit(EXTENT_FLAG_COMPRESSED, &em->flags) || | |
5556 | em->block_start == EXTENT_MAP_INLINE) { | |
5557 | free_extent_map(em); | |
5558 | return -ENOTBLK; | |
5559 | } | |
5560 | ||
5561 | /* Just a good old fashioned hole, return */ | |
5562 | if (!create && (em->block_start == EXTENT_MAP_HOLE || | |
5563 | test_bit(EXTENT_FLAG_PREALLOC, &em->flags))) { | |
5564 | free_extent_map(em); | |
5565 | /* DIO will do one hole at a time, so just unlock a sector */ | |
5566 | unlock_extent(&BTRFS_I(inode)->io_tree, start, | |
5567 | start + root->sectorsize - 1, GFP_NOFS); | |
5568 | return 0; | |
5569 | } | |
5570 | ||
5571 | /* | |
5572 | * We don't allocate a new extent in the following cases | |
5573 | * | |
5574 | * 1) The inode is marked as NODATACOW. In this case we'll just use the | |
5575 | * existing extent. | |
5576 | * 2) The extent is marked as PREALLOC. We're good to go here and can | |
5577 | * just use the extent. | |
5578 | * | |
5579 | */ | |
46bfbb5c CM |
5580 | if (!create) { |
5581 | len = em->len - (start - em->start); | |
4b46fce2 | 5582 | goto map; |
46bfbb5c | 5583 | } |
4b46fce2 JB |
5584 | |
5585 | if (test_bit(EXTENT_FLAG_PREALLOC, &em->flags) || | |
5586 | ((BTRFS_I(inode)->flags & BTRFS_INODE_NODATACOW) && | |
5587 | em->block_start != EXTENT_MAP_HOLE)) { | |
4b46fce2 JB |
5588 | int type; |
5589 | int ret; | |
46bfbb5c | 5590 | u64 block_start; |
4b46fce2 JB |
5591 | |
5592 | if (test_bit(EXTENT_FLAG_PREALLOC, &em->flags)) | |
5593 | type = BTRFS_ORDERED_PREALLOC; | |
5594 | else | |
5595 | type = BTRFS_ORDERED_NOCOW; | |
46bfbb5c | 5596 | len = min(len, em->len - (start - em->start)); |
4b46fce2 | 5597 | block_start = em->block_start + (start - em->start); |
46bfbb5c CM |
5598 | |
5599 | /* | |
5600 | * we're not going to log anything, but we do need | |
5601 | * to make sure the current transaction stays open | |
5602 | * while we look for nocow cross refs | |
5603 | */ | |
7a7eaa40 | 5604 | trans = btrfs_join_transaction(root); |
3612b495 | 5605 | if (IS_ERR(trans)) |
46bfbb5c CM |
5606 | goto must_cow; |
5607 | ||
5608 | if (can_nocow_odirect(trans, inode, start, len) == 1) { | |
5609 | ret = btrfs_add_ordered_extent_dio(inode, start, | |
5610 | block_start, len, len, type); | |
5611 | btrfs_end_transaction(trans, root); | |
5612 | if (ret) { | |
5613 | free_extent_map(em); | |
5614 | return ret; | |
5615 | } | |
5616 | goto unlock; | |
4b46fce2 | 5617 | } |
46bfbb5c | 5618 | btrfs_end_transaction(trans, root); |
4b46fce2 | 5619 | } |
46bfbb5c CM |
5620 | must_cow: |
5621 | /* | |
5622 | * this will cow the extent, reset the len in case we changed | |
5623 | * it above | |
5624 | */ | |
5625 | len = bh_result->b_size; | |
16d299ac | 5626 | em = btrfs_new_extent_direct(inode, em, start, len); |
46bfbb5c CM |
5627 | if (IS_ERR(em)) |
5628 | return PTR_ERR(em); | |
5629 | len = min(len, em->len - (start - em->start)); | |
5630 | unlock: | |
4845e44f CM |
5631 | clear_extent_bit(&BTRFS_I(inode)->io_tree, start, start + len - 1, |
5632 | EXTENT_LOCKED | EXTENT_DELALLOC | EXTENT_DIRTY, 1, | |
5633 | 0, NULL, GFP_NOFS); | |
4b46fce2 JB |
5634 | map: |
5635 | bh_result->b_blocknr = (em->block_start + (start - em->start)) >> | |
5636 | inode->i_blkbits; | |
46bfbb5c | 5637 | bh_result->b_size = len; |
4b46fce2 JB |
5638 | bh_result->b_bdev = em->bdev; |
5639 | set_buffer_mapped(bh_result); | |
5640 | if (create && !test_bit(EXTENT_FLAG_PREALLOC, &em->flags)) | |
5641 | set_buffer_new(bh_result); | |
5642 | ||
5643 | free_extent_map(em); | |
5644 | ||
5645 | return 0; | |
5646 | } | |
5647 | ||
5648 | struct btrfs_dio_private { | |
5649 | struct inode *inode; | |
5650 | u64 logical_offset; | |
5651 | u64 disk_bytenr; | |
5652 | u64 bytes; | |
5653 | u32 *csums; | |
5654 | void *private; | |
e65e1535 MX |
5655 | |
5656 | /* number of bios pending for this dio */ | |
5657 | atomic_t pending_bios; | |
5658 | ||
5659 | /* IO errors */ | |
5660 | int errors; | |
5661 | ||
5662 | struct bio *orig_bio; | |
4b46fce2 JB |
5663 | }; |
5664 | ||
5665 | static void btrfs_endio_direct_read(struct bio *bio, int err) | |
5666 | { | |
e65e1535 | 5667 | struct btrfs_dio_private *dip = bio->bi_private; |
4b46fce2 JB |
5668 | struct bio_vec *bvec_end = bio->bi_io_vec + bio->bi_vcnt - 1; |
5669 | struct bio_vec *bvec = bio->bi_io_vec; | |
4b46fce2 JB |
5670 | struct inode *inode = dip->inode; |
5671 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
5672 | u64 start; | |
5673 | u32 *private = dip->csums; | |
5674 | ||
5675 | start = dip->logical_offset; | |
5676 | do { | |
5677 | if (!(BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM)) { | |
5678 | struct page *page = bvec->bv_page; | |
5679 | char *kaddr; | |
5680 | u32 csum = ~(u32)0; | |
5681 | unsigned long flags; | |
5682 | ||
5683 | local_irq_save(flags); | |
5684 | kaddr = kmap_atomic(page, KM_IRQ0); | |
5685 | csum = btrfs_csum_data(root, kaddr + bvec->bv_offset, | |
5686 | csum, bvec->bv_len); | |
5687 | btrfs_csum_final(csum, (char *)&csum); | |
5688 | kunmap_atomic(kaddr, KM_IRQ0); | |
5689 | local_irq_restore(flags); | |
5690 | ||
5691 | flush_dcache_page(bvec->bv_page); | |
5692 | if (csum != *private) { | |
33345d01 | 5693 | printk(KERN_ERR "btrfs csum failed ino %llu off" |
4b46fce2 | 5694 | " %llu csum %u private %u\n", |
33345d01 LZ |
5695 | (unsigned long long)btrfs_ino(inode), |
5696 | (unsigned long long)start, | |
4b46fce2 JB |
5697 | csum, *private); |
5698 | err = -EIO; | |
5699 | } | |
5700 | } | |
5701 | ||
5702 | start += bvec->bv_len; | |
5703 | private++; | |
5704 | bvec++; | |
5705 | } while (bvec <= bvec_end); | |
5706 | ||
5707 | unlock_extent(&BTRFS_I(inode)->io_tree, dip->logical_offset, | |
5708 | dip->logical_offset + dip->bytes - 1, GFP_NOFS); | |
5709 | bio->bi_private = dip->private; | |
5710 | ||
5711 | kfree(dip->csums); | |
5712 | kfree(dip); | |
c0da7aa1 JB |
5713 | |
5714 | /* If we had a csum failure make sure to clear the uptodate flag */ | |
5715 | if (err) | |
5716 | clear_bit(BIO_UPTODATE, &bio->bi_flags); | |
4b46fce2 JB |
5717 | dio_end_io(bio, err); |
5718 | } | |
5719 | ||
5720 | static void btrfs_endio_direct_write(struct bio *bio, int err) | |
5721 | { | |
5722 | struct btrfs_dio_private *dip = bio->bi_private; | |
5723 | struct inode *inode = dip->inode; | |
5724 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
5725 | struct btrfs_trans_handle *trans; | |
5726 | struct btrfs_ordered_extent *ordered = NULL; | |
5727 | struct extent_state *cached_state = NULL; | |
163cf09c CM |
5728 | u64 ordered_offset = dip->logical_offset; |
5729 | u64 ordered_bytes = dip->bytes; | |
4b46fce2 JB |
5730 | int ret; |
5731 | ||
5732 | if (err) | |
5733 | goto out_done; | |
163cf09c CM |
5734 | again: |
5735 | ret = btrfs_dec_test_first_ordered_pending(inode, &ordered, | |
5736 | &ordered_offset, | |
5737 | ordered_bytes); | |
4b46fce2 | 5738 | if (!ret) |
163cf09c | 5739 | goto out_test; |
4b46fce2 JB |
5740 | |
5741 | BUG_ON(!ordered); | |
5742 | ||
7a7eaa40 | 5743 | trans = btrfs_join_transaction(root); |
3612b495 | 5744 | if (IS_ERR(trans)) { |
4b46fce2 JB |
5745 | err = -ENOMEM; |
5746 | goto out; | |
5747 | } | |
5748 | trans->block_rsv = &root->fs_info->delalloc_block_rsv; | |
5749 | ||
5750 | if (test_bit(BTRFS_ORDERED_NOCOW, &ordered->flags)) { | |
5751 | ret = btrfs_ordered_update_i_size(inode, 0, ordered); | |
5752 | if (!ret) | |
5753 | ret = btrfs_update_inode(trans, root, inode); | |
5754 | err = ret; | |
5755 | goto out; | |
5756 | } | |
5757 | ||
5758 | lock_extent_bits(&BTRFS_I(inode)->io_tree, ordered->file_offset, | |
5759 | ordered->file_offset + ordered->len - 1, 0, | |
5760 | &cached_state, GFP_NOFS); | |
5761 | ||
5762 | if (test_bit(BTRFS_ORDERED_PREALLOC, &ordered->flags)) { | |
5763 | ret = btrfs_mark_extent_written(trans, inode, | |
5764 | ordered->file_offset, | |
5765 | ordered->file_offset + | |
5766 | ordered->len); | |
5767 | if (ret) { | |
5768 | err = ret; | |
5769 | goto out_unlock; | |
5770 | } | |
5771 | } else { | |
5772 | ret = insert_reserved_file_extent(trans, inode, | |
5773 | ordered->file_offset, | |
5774 | ordered->start, | |
5775 | ordered->disk_len, | |
5776 | ordered->len, | |
5777 | ordered->len, | |
5778 | 0, 0, 0, | |
5779 | BTRFS_FILE_EXTENT_REG); | |
5780 | unpin_extent_cache(&BTRFS_I(inode)->extent_tree, | |
5781 | ordered->file_offset, ordered->len); | |
5782 | if (ret) { | |
5783 | err = ret; | |
5784 | WARN_ON(1); | |
5785 | goto out_unlock; | |
5786 | } | |
5787 | } | |
5788 | ||
5789 | add_pending_csums(trans, inode, ordered->file_offset, &ordered->list); | |
1ef30be1 JB |
5790 | ret = btrfs_ordered_update_i_size(inode, 0, ordered); |
5791 | if (!ret) | |
5792 | btrfs_update_inode(trans, root, inode); | |
5793 | ret = 0; | |
4b46fce2 JB |
5794 | out_unlock: |
5795 | unlock_extent_cached(&BTRFS_I(inode)->io_tree, ordered->file_offset, | |
5796 | ordered->file_offset + ordered->len - 1, | |
5797 | &cached_state, GFP_NOFS); | |
5798 | out: | |
5799 | btrfs_delalloc_release_metadata(inode, ordered->len); | |
5800 | btrfs_end_transaction(trans, root); | |
163cf09c | 5801 | ordered_offset = ordered->file_offset + ordered->len; |
4b46fce2 JB |
5802 | btrfs_put_ordered_extent(ordered); |
5803 | btrfs_put_ordered_extent(ordered); | |
163cf09c CM |
5804 | |
5805 | out_test: | |
5806 | /* | |
5807 | * our bio might span multiple ordered extents. If we haven't | |
5808 | * completed the accounting for the whole dio, go back and try again | |
5809 | */ | |
5810 | if (ordered_offset < dip->logical_offset + dip->bytes) { | |
5811 | ordered_bytes = dip->logical_offset + dip->bytes - | |
5812 | ordered_offset; | |
5813 | goto again; | |
5814 | } | |
4b46fce2 JB |
5815 | out_done: |
5816 | bio->bi_private = dip->private; | |
5817 | ||
5818 | kfree(dip->csums); | |
5819 | kfree(dip); | |
c0da7aa1 JB |
5820 | |
5821 | /* If we had an error make sure to clear the uptodate flag */ | |
5822 | if (err) | |
5823 | clear_bit(BIO_UPTODATE, &bio->bi_flags); | |
4b46fce2 JB |
5824 | dio_end_io(bio, err); |
5825 | } | |
5826 | ||
eaf25d93 CM |
5827 | static int __btrfs_submit_bio_start_direct_io(struct inode *inode, int rw, |
5828 | struct bio *bio, int mirror_num, | |
5829 | unsigned long bio_flags, u64 offset) | |
5830 | { | |
5831 | int ret; | |
5832 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
5833 | ret = btrfs_csum_one_bio(root, inode, bio, offset, 1); | |
5834 | BUG_ON(ret); | |
5835 | return 0; | |
5836 | } | |
5837 | ||
e65e1535 MX |
5838 | static void btrfs_end_dio_bio(struct bio *bio, int err) |
5839 | { | |
5840 | struct btrfs_dio_private *dip = bio->bi_private; | |
5841 | ||
5842 | if (err) { | |
33345d01 | 5843 | printk(KERN_ERR "btrfs direct IO failed ino %llu rw %lu " |
3dd1462e | 5844 | "sector %#Lx len %u err no %d\n", |
33345d01 | 5845 | (unsigned long long)btrfs_ino(dip->inode), bio->bi_rw, |
3dd1462e | 5846 | (unsigned long long)bio->bi_sector, bio->bi_size, err); |
e65e1535 MX |
5847 | dip->errors = 1; |
5848 | ||
5849 | /* | |
5850 | * before atomic variable goto zero, we must make sure | |
5851 | * dip->errors is perceived to be set. | |
5852 | */ | |
5853 | smp_mb__before_atomic_dec(); | |
5854 | } | |
5855 | ||
5856 | /* if there are more bios still pending for this dio, just exit */ | |
5857 | if (!atomic_dec_and_test(&dip->pending_bios)) | |
5858 | goto out; | |
5859 | ||
5860 | if (dip->errors) | |
5861 | bio_io_error(dip->orig_bio); | |
5862 | else { | |
5863 | set_bit(BIO_UPTODATE, &dip->orig_bio->bi_flags); | |
5864 | bio_endio(dip->orig_bio, 0); | |
5865 | } | |
5866 | out: | |
5867 | bio_put(bio); | |
5868 | } | |
5869 | ||
5870 | static struct bio *btrfs_dio_bio_alloc(struct block_device *bdev, | |
5871 | u64 first_sector, gfp_t gfp_flags) | |
5872 | { | |
5873 | int nr_vecs = bio_get_nr_vecs(bdev); | |
5874 | return btrfs_bio_alloc(bdev, first_sector, nr_vecs, gfp_flags); | |
5875 | } | |
5876 | ||
5877 | static inline int __btrfs_submit_dio_bio(struct bio *bio, struct inode *inode, | |
5878 | int rw, u64 file_offset, int skip_sum, | |
1ae39938 | 5879 | u32 *csums, int async_submit) |
e65e1535 MX |
5880 | { |
5881 | int write = rw & REQ_WRITE; | |
5882 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
5883 | int ret; | |
5884 | ||
5885 | bio_get(bio); | |
5886 | ret = btrfs_bio_wq_end_io(root->fs_info, bio, 0); | |
5887 | if (ret) | |
5888 | goto err; | |
5889 | ||
1ae39938 JB |
5890 | if (skip_sum) |
5891 | goto map; | |
5892 | ||
5893 | if (write && async_submit) { | |
e65e1535 MX |
5894 | ret = btrfs_wq_submit_bio(root->fs_info, |
5895 | inode, rw, bio, 0, 0, | |
5896 | file_offset, | |
5897 | __btrfs_submit_bio_start_direct_io, | |
5898 | __btrfs_submit_bio_done); | |
5899 | goto err; | |
1ae39938 JB |
5900 | } else if (write) { |
5901 | /* | |
5902 | * If we aren't doing async submit, calculate the csum of the | |
5903 | * bio now. | |
5904 | */ | |
5905 | ret = btrfs_csum_one_bio(root, inode, bio, file_offset, 1); | |
5906 | if (ret) | |
5907 | goto err; | |
c2db1073 TI |
5908 | } else if (!skip_sum) { |
5909 | ret = btrfs_lookup_bio_sums_dio(root, inode, bio, | |
e65e1535 | 5910 | file_offset, csums); |
c2db1073 TI |
5911 | if (ret) |
5912 | goto err; | |
5913 | } | |
e65e1535 | 5914 | |
1ae39938 JB |
5915 | map: |
5916 | ret = btrfs_map_bio(root, rw, bio, 0, async_submit); | |
e65e1535 MX |
5917 | err: |
5918 | bio_put(bio); | |
5919 | return ret; | |
5920 | } | |
5921 | ||
5922 | static int btrfs_submit_direct_hook(int rw, struct btrfs_dio_private *dip, | |
5923 | int skip_sum) | |
5924 | { | |
5925 | struct inode *inode = dip->inode; | |
5926 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
5927 | struct btrfs_mapping_tree *map_tree = &root->fs_info->mapping_tree; | |
5928 | struct bio *bio; | |
5929 | struct bio *orig_bio = dip->orig_bio; | |
5930 | struct bio_vec *bvec = orig_bio->bi_io_vec; | |
5931 | u64 start_sector = orig_bio->bi_sector; | |
5932 | u64 file_offset = dip->logical_offset; | |
5933 | u64 submit_len = 0; | |
5934 | u64 map_length; | |
5935 | int nr_pages = 0; | |
5936 | u32 *csums = dip->csums; | |
5937 | int ret = 0; | |
1ae39938 | 5938 | int async_submit = 0; |
98bc3149 | 5939 | int write = rw & REQ_WRITE; |
e65e1535 | 5940 | |
e65e1535 MX |
5941 | map_length = orig_bio->bi_size; |
5942 | ret = btrfs_map_block(map_tree, READ, start_sector << 9, | |
5943 | &map_length, NULL, 0); | |
5944 | if (ret) { | |
64728bbb | 5945 | bio_put(orig_bio); |
e65e1535 MX |
5946 | return -EIO; |
5947 | } | |
5948 | ||
02f57c7a JB |
5949 | if (map_length >= orig_bio->bi_size) { |
5950 | bio = orig_bio; | |
5951 | goto submit; | |
5952 | } | |
5953 | ||
1ae39938 | 5954 | async_submit = 1; |
02f57c7a JB |
5955 | bio = btrfs_dio_bio_alloc(orig_bio->bi_bdev, start_sector, GFP_NOFS); |
5956 | if (!bio) | |
5957 | return -ENOMEM; | |
5958 | bio->bi_private = dip; | |
5959 | bio->bi_end_io = btrfs_end_dio_bio; | |
5960 | atomic_inc(&dip->pending_bios); | |
5961 | ||
e65e1535 MX |
5962 | while (bvec <= (orig_bio->bi_io_vec + orig_bio->bi_vcnt - 1)) { |
5963 | if (unlikely(map_length < submit_len + bvec->bv_len || | |
5964 | bio_add_page(bio, bvec->bv_page, bvec->bv_len, | |
5965 | bvec->bv_offset) < bvec->bv_len)) { | |
5966 | /* | |
5967 | * inc the count before we submit the bio so | |
5968 | * we know the end IO handler won't happen before | |
5969 | * we inc the count. Otherwise, the dip might get freed | |
5970 | * before we're done setting it up | |
5971 | */ | |
5972 | atomic_inc(&dip->pending_bios); | |
5973 | ret = __btrfs_submit_dio_bio(bio, inode, rw, | |
5974 | file_offset, skip_sum, | |
1ae39938 | 5975 | csums, async_submit); |
e65e1535 MX |
5976 | if (ret) { |
5977 | bio_put(bio); | |
5978 | atomic_dec(&dip->pending_bios); | |
5979 | goto out_err; | |
5980 | } | |
5981 | ||
98bc3149 JB |
5982 | /* Write's use the ordered csums */ |
5983 | if (!write && !skip_sum) | |
e65e1535 MX |
5984 | csums = csums + nr_pages; |
5985 | start_sector += submit_len >> 9; | |
5986 | file_offset += submit_len; | |
5987 | ||
5988 | submit_len = 0; | |
5989 | nr_pages = 0; | |
5990 | ||
5991 | bio = btrfs_dio_bio_alloc(orig_bio->bi_bdev, | |
5992 | start_sector, GFP_NOFS); | |
5993 | if (!bio) | |
5994 | goto out_err; | |
5995 | bio->bi_private = dip; | |
5996 | bio->bi_end_io = btrfs_end_dio_bio; | |
5997 | ||
5998 | map_length = orig_bio->bi_size; | |
5999 | ret = btrfs_map_block(map_tree, READ, start_sector << 9, | |
6000 | &map_length, NULL, 0); | |
6001 | if (ret) { | |
6002 | bio_put(bio); | |
6003 | goto out_err; | |
6004 | } | |
6005 | } else { | |
6006 | submit_len += bvec->bv_len; | |
6007 | nr_pages ++; | |
6008 | bvec++; | |
6009 | } | |
6010 | } | |
6011 | ||
02f57c7a | 6012 | submit: |
e65e1535 | 6013 | ret = __btrfs_submit_dio_bio(bio, inode, rw, file_offset, skip_sum, |
1ae39938 | 6014 | csums, async_submit); |
e65e1535 MX |
6015 | if (!ret) |
6016 | return 0; | |
6017 | ||
6018 | bio_put(bio); | |
6019 | out_err: | |
6020 | dip->errors = 1; | |
6021 | /* | |
6022 | * before atomic variable goto zero, we must | |
6023 | * make sure dip->errors is perceived to be set. | |
6024 | */ | |
6025 | smp_mb__before_atomic_dec(); | |
6026 | if (atomic_dec_and_test(&dip->pending_bios)) | |
6027 | bio_io_error(dip->orig_bio); | |
6028 | ||
6029 | /* bio_end_io() will handle error, so we needn't return it */ | |
6030 | return 0; | |
6031 | } | |
6032 | ||
4b46fce2 JB |
6033 | static void btrfs_submit_direct(int rw, struct bio *bio, struct inode *inode, |
6034 | loff_t file_offset) | |
6035 | { | |
6036 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
6037 | struct btrfs_dio_private *dip; | |
6038 | struct bio_vec *bvec = bio->bi_io_vec; | |
4b46fce2 | 6039 | int skip_sum; |
7b6d91da | 6040 | int write = rw & REQ_WRITE; |
4b46fce2 JB |
6041 | int ret = 0; |
6042 | ||
6043 | skip_sum = BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM; | |
6044 | ||
6045 | dip = kmalloc(sizeof(*dip), GFP_NOFS); | |
6046 | if (!dip) { | |
6047 | ret = -ENOMEM; | |
6048 | goto free_ordered; | |
6049 | } | |
6050 | dip->csums = NULL; | |
6051 | ||
98bc3149 JB |
6052 | /* Write's use the ordered csum stuff, so we don't need dip->csums */ |
6053 | if (!write && !skip_sum) { | |
4b46fce2 JB |
6054 | dip->csums = kmalloc(sizeof(u32) * bio->bi_vcnt, GFP_NOFS); |
6055 | if (!dip->csums) { | |
b4966b77 | 6056 | kfree(dip); |
4b46fce2 JB |
6057 | ret = -ENOMEM; |
6058 | goto free_ordered; | |
6059 | } | |
6060 | } | |
6061 | ||
6062 | dip->private = bio->bi_private; | |
6063 | dip->inode = inode; | |
6064 | dip->logical_offset = file_offset; | |
6065 | ||
4b46fce2 JB |
6066 | dip->bytes = 0; |
6067 | do { | |
6068 | dip->bytes += bvec->bv_len; | |
6069 | bvec++; | |
6070 | } while (bvec <= (bio->bi_io_vec + bio->bi_vcnt - 1)); | |
6071 | ||
46bfbb5c | 6072 | dip->disk_bytenr = (u64)bio->bi_sector << 9; |
4b46fce2 | 6073 | bio->bi_private = dip; |
e65e1535 MX |
6074 | dip->errors = 0; |
6075 | dip->orig_bio = bio; | |
6076 | atomic_set(&dip->pending_bios, 0); | |
4b46fce2 JB |
6077 | |
6078 | if (write) | |
6079 | bio->bi_end_io = btrfs_endio_direct_write; | |
6080 | else | |
6081 | bio->bi_end_io = btrfs_endio_direct_read; | |
6082 | ||
e65e1535 MX |
6083 | ret = btrfs_submit_direct_hook(rw, dip, skip_sum); |
6084 | if (!ret) | |
eaf25d93 | 6085 | return; |
4b46fce2 JB |
6086 | free_ordered: |
6087 | /* | |
6088 | * If this is a write, we need to clean up the reserved space and kill | |
6089 | * the ordered extent. | |
6090 | */ | |
6091 | if (write) { | |
6092 | struct btrfs_ordered_extent *ordered; | |
955256f2 | 6093 | ordered = btrfs_lookup_ordered_extent(inode, file_offset); |
4b46fce2 JB |
6094 | if (!test_bit(BTRFS_ORDERED_PREALLOC, &ordered->flags) && |
6095 | !test_bit(BTRFS_ORDERED_NOCOW, &ordered->flags)) | |
6096 | btrfs_free_reserved_extent(root, ordered->start, | |
6097 | ordered->disk_len); | |
6098 | btrfs_put_ordered_extent(ordered); | |
6099 | btrfs_put_ordered_extent(ordered); | |
6100 | } | |
6101 | bio_endio(bio, ret); | |
6102 | } | |
6103 | ||
5a5f79b5 CM |
6104 | static ssize_t check_direct_IO(struct btrfs_root *root, int rw, struct kiocb *iocb, |
6105 | const struct iovec *iov, loff_t offset, | |
6106 | unsigned long nr_segs) | |
6107 | { | |
6108 | int seg; | |
a1b75f7d | 6109 | int i; |
5a5f79b5 CM |
6110 | size_t size; |
6111 | unsigned long addr; | |
6112 | unsigned blocksize_mask = root->sectorsize - 1; | |
6113 | ssize_t retval = -EINVAL; | |
6114 | loff_t end = offset; | |
6115 | ||
6116 | if (offset & blocksize_mask) | |
6117 | goto out; | |
6118 | ||
6119 | /* Check the memory alignment. Blocks cannot straddle pages */ | |
6120 | for (seg = 0; seg < nr_segs; seg++) { | |
6121 | addr = (unsigned long)iov[seg].iov_base; | |
6122 | size = iov[seg].iov_len; | |
6123 | end += size; | |
a1b75f7d | 6124 | if ((addr & blocksize_mask) || (size & blocksize_mask)) |
5a5f79b5 | 6125 | goto out; |
a1b75f7d JB |
6126 | |
6127 | /* If this is a write we don't need to check anymore */ | |
6128 | if (rw & WRITE) | |
6129 | continue; | |
6130 | ||
6131 | /* | |
6132 | * Check to make sure we don't have duplicate iov_base's in this | |
6133 | * iovec, if so return EINVAL, otherwise we'll get csum errors | |
6134 | * when reading back. | |
6135 | */ | |
6136 | for (i = seg + 1; i < nr_segs; i++) { | |
6137 | if (iov[seg].iov_base == iov[i].iov_base) | |
6138 | goto out; | |
6139 | } | |
5a5f79b5 CM |
6140 | } |
6141 | retval = 0; | |
6142 | out: | |
6143 | return retval; | |
6144 | } | |
16432985 CM |
6145 | static ssize_t btrfs_direct_IO(int rw, struct kiocb *iocb, |
6146 | const struct iovec *iov, loff_t offset, | |
6147 | unsigned long nr_segs) | |
6148 | { | |
4b46fce2 JB |
6149 | struct file *file = iocb->ki_filp; |
6150 | struct inode *inode = file->f_mapping->host; | |
6151 | struct btrfs_ordered_extent *ordered; | |
4845e44f | 6152 | struct extent_state *cached_state = NULL; |
4b46fce2 JB |
6153 | u64 lockstart, lockend; |
6154 | ssize_t ret; | |
4845e44f CM |
6155 | int writing = rw & WRITE; |
6156 | int write_bits = 0; | |
3f7c579c | 6157 | size_t count = iov_length(iov, nr_segs); |
4b46fce2 | 6158 | |
5a5f79b5 CM |
6159 | if (check_direct_IO(BTRFS_I(inode)->root, rw, iocb, iov, |
6160 | offset, nr_segs)) { | |
6161 | return 0; | |
6162 | } | |
6163 | ||
4b46fce2 | 6164 | lockstart = offset; |
3f7c579c CM |
6165 | lockend = offset + count - 1; |
6166 | ||
6167 | if (writing) { | |
6168 | ret = btrfs_delalloc_reserve_space(inode, count); | |
6169 | if (ret) | |
6170 | goto out; | |
6171 | } | |
4845e44f | 6172 | |
4b46fce2 | 6173 | while (1) { |
4845e44f CM |
6174 | lock_extent_bits(&BTRFS_I(inode)->io_tree, lockstart, lockend, |
6175 | 0, &cached_state, GFP_NOFS); | |
4b46fce2 JB |
6176 | /* |
6177 | * We're concerned with the entire range that we're going to be | |
6178 | * doing DIO to, so we need to make sure theres no ordered | |
6179 | * extents in this range. | |
6180 | */ | |
6181 | ordered = btrfs_lookup_ordered_range(inode, lockstart, | |
6182 | lockend - lockstart + 1); | |
6183 | if (!ordered) | |
6184 | break; | |
4845e44f CM |
6185 | unlock_extent_cached(&BTRFS_I(inode)->io_tree, lockstart, lockend, |
6186 | &cached_state, GFP_NOFS); | |
4b46fce2 JB |
6187 | btrfs_start_ordered_extent(inode, ordered, 1); |
6188 | btrfs_put_ordered_extent(ordered); | |
6189 | cond_resched(); | |
6190 | } | |
6191 | ||
4845e44f CM |
6192 | /* |
6193 | * we don't use btrfs_set_extent_delalloc because we don't want | |
6194 | * the dirty or uptodate bits | |
6195 | */ | |
6196 | if (writing) { | |
6197 | write_bits = EXTENT_DELALLOC | EXTENT_DO_ACCOUNTING; | |
6198 | ret = set_extent_bit(&BTRFS_I(inode)->io_tree, lockstart, lockend, | |
6199 | EXTENT_DELALLOC, 0, NULL, &cached_state, | |
6200 | GFP_NOFS); | |
6201 | if (ret) { | |
6202 | clear_extent_bit(&BTRFS_I(inode)->io_tree, lockstart, | |
6203 | lockend, EXTENT_LOCKED | write_bits, | |
6204 | 1, 0, &cached_state, GFP_NOFS); | |
6205 | goto out; | |
6206 | } | |
6207 | } | |
6208 | ||
6209 | free_extent_state(cached_state); | |
6210 | cached_state = NULL; | |
6211 | ||
5a5f79b5 CM |
6212 | ret = __blockdev_direct_IO(rw, iocb, inode, |
6213 | BTRFS_I(inode)->root->fs_info->fs_devices->latest_bdev, | |
6214 | iov, offset, nr_segs, btrfs_get_blocks_direct, NULL, | |
6215 | btrfs_submit_direct, 0); | |
4b46fce2 JB |
6216 | |
6217 | if (ret < 0 && ret != -EIOCBQUEUED) { | |
4845e44f CM |
6218 | clear_extent_bit(&BTRFS_I(inode)->io_tree, offset, |
6219 | offset + iov_length(iov, nr_segs) - 1, | |
6220 | EXTENT_LOCKED | write_bits, 1, 0, | |
6221 | &cached_state, GFP_NOFS); | |
4b46fce2 JB |
6222 | } else if (ret >= 0 && ret < iov_length(iov, nr_segs)) { |
6223 | /* | |
6224 | * We're falling back to buffered, unlock the section we didn't | |
6225 | * do IO on. | |
6226 | */ | |
4845e44f CM |
6227 | clear_extent_bit(&BTRFS_I(inode)->io_tree, offset + ret, |
6228 | offset + iov_length(iov, nr_segs) - 1, | |
6229 | EXTENT_LOCKED | write_bits, 1, 0, | |
6230 | &cached_state, GFP_NOFS); | |
4b46fce2 | 6231 | } |
4845e44f CM |
6232 | out: |
6233 | free_extent_state(cached_state); | |
4b46fce2 | 6234 | return ret; |
16432985 CM |
6235 | } |
6236 | ||
1506fcc8 YS |
6237 | static int btrfs_fiemap(struct inode *inode, struct fiemap_extent_info *fieinfo, |
6238 | __u64 start, __u64 len) | |
6239 | { | |
ec29ed5b | 6240 | return extent_fiemap(inode, fieinfo, start, len, btrfs_get_extent_fiemap); |
1506fcc8 YS |
6241 | } |
6242 | ||
a52d9a80 | 6243 | int btrfs_readpage(struct file *file, struct page *page) |
9ebefb18 | 6244 | { |
d1310b2e CM |
6245 | struct extent_io_tree *tree; |
6246 | tree = &BTRFS_I(page->mapping->host)->io_tree; | |
a52d9a80 | 6247 | return extent_read_full_page(tree, page, btrfs_get_extent); |
9ebefb18 | 6248 | } |
1832a6d5 | 6249 | |
a52d9a80 | 6250 | static int btrfs_writepage(struct page *page, struct writeback_control *wbc) |
39279cc3 | 6251 | { |
d1310b2e | 6252 | struct extent_io_tree *tree; |
b888db2b CM |
6253 | |
6254 | ||
6255 | if (current->flags & PF_MEMALLOC) { | |
6256 | redirty_page_for_writepage(wbc, page); | |
6257 | unlock_page(page); | |
6258 | return 0; | |
6259 | } | |
d1310b2e | 6260 | tree = &BTRFS_I(page->mapping->host)->io_tree; |
a52d9a80 | 6261 | return extent_write_full_page(tree, page, btrfs_get_extent, wbc); |
9ebefb18 CM |
6262 | } |
6263 | ||
f421950f CM |
6264 | int btrfs_writepages(struct address_space *mapping, |
6265 | struct writeback_control *wbc) | |
b293f02e | 6266 | { |
d1310b2e | 6267 | struct extent_io_tree *tree; |
771ed689 | 6268 | |
d1310b2e | 6269 | tree = &BTRFS_I(mapping->host)->io_tree; |
b293f02e CM |
6270 | return extent_writepages(tree, mapping, btrfs_get_extent, wbc); |
6271 | } | |
6272 | ||
3ab2fb5a CM |
6273 | static int |
6274 | btrfs_readpages(struct file *file, struct address_space *mapping, | |
6275 | struct list_head *pages, unsigned nr_pages) | |
6276 | { | |
d1310b2e CM |
6277 | struct extent_io_tree *tree; |
6278 | tree = &BTRFS_I(mapping->host)->io_tree; | |
3ab2fb5a CM |
6279 | return extent_readpages(tree, mapping, pages, nr_pages, |
6280 | btrfs_get_extent); | |
6281 | } | |
e6dcd2dc | 6282 | static int __btrfs_releasepage(struct page *page, gfp_t gfp_flags) |
9ebefb18 | 6283 | { |
d1310b2e CM |
6284 | struct extent_io_tree *tree; |
6285 | struct extent_map_tree *map; | |
a52d9a80 | 6286 | int ret; |
8c2383c3 | 6287 | |
d1310b2e CM |
6288 | tree = &BTRFS_I(page->mapping->host)->io_tree; |
6289 | map = &BTRFS_I(page->mapping->host)->extent_tree; | |
70dec807 | 6290 | ret = try_release_extent_mapping(map, tree, page, gfp_flags); |
a52d9a80 CM |
6291 | if (ret == 1) { |
6292 | ClearPagePrivate(page); | |
6293 | set_page_private(page, 0); | |
6294 | page_cache_release(page); | |
39279cc3 | 6295 | } |
a52d9a80 | 6296 | return ret; |
39279cc3 CM |
6297 | } |
6298 | ||
e6dcd2dc CM |
6299 | static int btrfs_releasepage(struct page *page, gfp_t gfp_flags) |
6300 | { | |
98509cfc CM |
6301 | if (PageWriteback(page) || PageDirty(page)) |
6302 | return 0; | |
b335b003 | 6303 | return __btrfs_releasepage(page, gfp_flags & GFP_NOFS); |
e6dcd2dc CM |
6304 | } |
6305 | ||
a52d9a80 | 6306 | static void btrfs_invalidatepage(struct page *page, unsigned long offset) |
39279cc3 | 6307 | { |
d1310b2e | 6308 | struct extent_io_tree *tree; |
e6dcd2dc | 6309 | struct btrfs_ordered_extent *ordered; |
2ac55d41 | 6310 | struct extent_state *cached_state = NULL; |
e6dcd2dc CM |
6311 | u64 page_start = page_offset(page); |
6312 | u64 page_end = page_start + PAGE_CACHE_SIZE - 1; | |
39279cc3 | 6313 | |
8b62b72b CM |
6314 | |
6315 | /* | |
6316 | * we have the page locked, so new writeback can't start, | |
6317 | * and the dirty bit won't be cleared while we are here. | |
6318 | * | |
6319 | * Wait for IO on this page so that we can safely clear | |
6320 | * the PagePrivate2 bit and do ordered accounting | |
6321 | */ | |
e6dcd2dc | 6322 | wait_on_page_writeback(page); |
8b62b72b | 6323 | |
d1310b2e | 6324 | tree = &BTRFS_I(page->mapping->host)->io_tree; |
e6dcd2dc CM |
6325 | if (offset) { |
6326 | btrfs_releasepage(page, GFP_NOFS); | |
6327 | return; | |
6328 | } | |
2ac55d41 JB |
6329 | lock_extent_bits(tree, page_start, page_end, 0, &cached_state, |
6330 | GFP_NOFS); | |
e6dcd2dc CM |
6331 | ordered = btrfs_lookup_ordered_extent(page->mapping->host, |
6332 | page_offset(page)); | |
6333 | if (ordered) { | |
eb84ae03 CM |
6334 | /* |
6335 | * IO on this page will never be started, so we need | |
6336 | * to account for any ordered extents now | |
6337 | */ | |
e6dcd2dc CM |
6338 | clear_extent_bit(tree, page_start, page_end, |
6339 | EXTENT_DIRTY | EXTENT_DELALLOC | | |
32c00aff | 6340 | EXTENT_LOCKED | EXTENT_DO_ACCOUNTING, 1, 0, |
2ac55d41 | 6341 | &cached_state, GFP_NOFS); |
8b62b72b CM |
6342 | /* |
6343 | * whoever cleared the private bit is responsible | |
6344 | * for the finish_ordered_io | |
6345 | */ | |
6346 | if (TestClearPagePrivate2(page)) { | |
6347 | btrfs_finish_ordered_io(page->mapping->host, | |
6348 | page_start, page_end); | |
6349 | } | |
e6dcd2dc | 6350 | btrfs_put_ordered_extent(ordered); |
2ac55d41 JB |
6351 | cached_state = NULL; |
6352 | lock_extent_bits(tree, page_start, page_end, 0, &cached_state, | |
6353 | GFP_NOFS); | |
e6dcd2dc CM |
6354 | } |
6355 | clear_extent_bit(tree, page_start, page_end, | |
32c00aff | 6356 | EXTENT_LOCKED | EXTENT_DIRTY | EXTENT_DELALLOC | |
2ac55d41 | 6357 | EXTENT_DO_ACCOUNTING, 1, 1, &cached_state, GFP_NOFS); |
e6dcd2dc CM |
6358 | __btrfs_releasepage(page, GFP_NOFS); |
6359 | ||
4a096752 | 6360 | ClearPageChecked(page); |
9ad6b7bc | 6361 | if (PagePrivate(page)) { |
9ad6b7bc CM |
6362 | ClearPagePrivate(page); |
6363 | set_page_private(page, 0); | |
6364 | page_cache_release(page); | |
6365 | } | |
39279cc3 CM |
6366 | } |
6367 | ||
9ebefb18 CM |
6368 | /* |
6369 | * btrfs_page_mkwrite() is not allowed to change the file size as it gets | |
6370 | * called from a page fault handler when a page is first dirtied. Hence we must | |
6371 | * be careful to check for EOF conditions here. We set the page up correctly | |
6372 | * for a written page which means we get ENOSPC checking when writing into | |
6373 | * holes and correct delalloc and unwritten extent mapping on filesystems that | |
6374 | * support these features. | |
6375 | * | |
6376 | * We are not allowed to take the i_mutex here so we have to play games to | |
6377 | * protect against truncate races as the page could now be beyond EOF. Because | |
6378 | * vmtruncate() writes the inode size before removing pages, once we have the | |
6379 | * page lock we can determine safely if the page is beyond EOF. If it is not | |
6380 | * beyond EOF, then the page is guaranteed safe against truncation until we | |
6381 | * unlock the page. | |
6382 | */ | |
c2ec175c | 6383 | int btrfs_page_mkwrite(struct vm_area_struct *vma, struct vm_fault *vmf) |
9ebefb18 | 6384 | { |
c2ec175c | 6385 | struct page *page = vmf->page; |
6da6abae | 6386 | struct inode *inode = fdentry(vma->vm_file)->d_inode; |
1832a6d5 | 6387 | struct btrfs_root *root = BTRFS_I(inode)->root; |
e6dcd2dc CM |
6388 | struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree; |
6389 | struct btrfs_ordered_extent *ordered; | |
2ac55d41 | 6390 | struct extent_state *cached_state = NULL; |
e6dcd2dc CM |
6391 | char *kaddr; |
6392 | unsigned long zero_start; | |
9ebefb18 | 6393 | loff_t size; |
1832a6d5 | 6394 | int ret; |
a52d9a80 | 6395 | u64 page_start; |
e6dcd2dc | 6396 | u64 page_end; |
9ebefb18 | 6397 | |
0ca1f7ce | 6398 | ret = btrfs_delalloc_reserve_space(inode, PAGE_CACHE_SIZE); |
56a76f82 NP |
6399 | if (ret) { |
6400 | if (ret == -ENOMEM) | |
6401 | ret = VM_FAULT_OOM; | |
6402 | else /* -ENOSPC, -EIO, etc */ | |
6403 | ret = VM_FAULT_SIGBUS; | |
1832a6d5 | 6404 | goto out; |
56a76f82 | 6405 | } |
1832a6d5 | 6406 | |
56a76f82 | 6407 | ret = VM_FAULT_NOPAGE; /* make the VM retry the fault */ |
e6dcd2dc | 6408 | again: |
9ebefb18 | 6409 | lock_page(page); |
9ebefb18 | 6410 | size = i_size_read(inode); |
e6dcd2dc CM |
6411 | page_start = page_offset(page); |
6412 | page_end = page_start + PAGE_CACHE_SIZE - 1; | |
a52d9a80 | 6413 | |
9ebefb18 | 6414 | if ((page->mapping != inode->i_mapping) || |
e6dcd2dc | 6415 | (page_start >= size)) { |
9ebefb18 CM |
6416 | /* page got truncated out from underneath us */ |
6417 | goto out_unlock; | |
6418 | } | |
e6dcd2dc CM |
6419 | wait_on_page_writeback(page); |
6420 | ||
2ac55d41 JB |
6421 | lock_extent_bits(io_tree, page_start, page_end, 0, &cached_state, |
6422 | GFP_NOFS); | |
e6dcd2dc CM |
6423 | set_page_extent_mapped(page); |
6424 | ||
eb84ae03 CM |
6425 | /* |
6426 | * we can't set the delalloc bits if there are pending ordered | |
6427 | * extents. Drop our locks and wait for them to finish | |
6428 | */ | |
e6dcd2dc CM |
6429 | ordered = btrfs_lookup_ordered_extent(inode, page_start); |
6430 | if (ordered) { | |
2ac55d41 JB |
6431 | unlock_extent_cached(io_tree, page_start, page_end, |
6432 | &cached_state, GFP_NOFS); | |
e6dcd2dc | 6433 | unlock_page(page); |
eb84ae03 | 6434 | btrfs_start_ordered_extent(inode, ordered, 1); |
e6dcd2dc CM |
6435 | btrfs_put_ordered_extent(ordered); |
6436 | goto again; | |
6437 | } | |
6438 | ||
fbf19087 JB |
6439 | /* |
6440 | * XXX - page_mkwrite gets called every time the page is dirtied, even | |
6441 | * if it was already dirty, so for space accounting reasons we need to | |
6442 | * clear any delalloc bits for the range we are fixing to save. There | |
6443 | * is probably a better way to do this, but for now keep consistent with | |
6444 | * prepare_pages in the normal write path. | |
6445 | */ | |
2ac55d41 | 6446 | clear_extent_bit(&BTRFS_I(inode)->io_tree, page_start, page_end, |
32c00aff | 6447 | EXTENT_DIRTY | EXTENT_DELALLOC | EXTENT_DO_ACCOUNTING, |
2ac55d41 | 6448 | 0, 0, &cached_state, GFP_NOFS); |
fbf19087 | 6449 | |
2ac55d41 JB |
6450 | ret = btrfs_set_extent_delalloc(inode, page_start, page_end, |
6451 | &cached_state); | |
9ed74f2d | 6452 | if (ret) { |
2ac55d41 JB |
6453 | unlock_extent_cached(io_tree, page_start, page_end, |
6454 | &cached_state, GFP_NOFS); | |
9ed74f2d JB |
6455 | ret = VM_FAULT_SIGBUS; |
6456 | goto out_unlock; | |
6457 | } | |
e6dcd2dc | 6458 | ret = 0; |
9ebefb18 CM |
6459 | |
6460 | /* page is wholly or partially inside EOF */ | |
a52d9a80 | 6461 | if (page_start + PAGE_CACHE_SIZE > size) |
e6dcd2dc | 6462 | zero_start = size & ~PAGE_CACHE_MASK; |
9ebefb18 | 6463 | else |
e6dcd2dc | 6464 | zero_start = PAGE_CACHE_SIZE; |
9ebefb18 | 6465 | |
e6dcd2dc CM |
6466 | if (zero_start != PAGE_CACHE_SIZE) { |
6467 | kaddr = kmap(page); | |
6468 | memset(kaddr + zero_start, 0, PAGE_CACHE_SIZE - zero_start); | |
6469 | flush_dcache_page(page); | |
6470 | kunmap(page); | |
6471 | } | |
247e743c | 6472 | ClearPageChecked(page); |
e6dcd2dc | 6473 | set_page_dirty(page); |
50a9b214 | 6474 | SetPageUptodate(page); |
5a3f23d5 | 6475 | |
257c62e1 CM |
6476 | BTRFS_I(inode)->last_trans = root->fs_info->generation; |
6477 | BTRFS_I(inode)->last_sub_trans = BTRFS_I(inode)->root->log_transid; | |
6478 | ||
2ac55d41 | 6479 | unlock_extent_cached(io_tree, page_start, page_end, &cached_state, GFP_NOFS); |
9ebefb18 CM |
6480 | |
6481 | out_unlock: | |
50a9b214 CM |
6482 | if (!ret) |
6483 | return VM_FAULT_LOCKED; | |
9ebefb18 | 6484 | unlock_page(page); |
0ca1f7ce | 6485 | btrfs_delalloc_release_space(inode, PAGE_CACHE_SIZE); |
1832a6d5 | 6486 | out: |
9ebefb18 CM |
6487 | return ret; |
6488 | } | |
6489 | ||
a41ad394 | 6490 | static int btrfs_truncate(struct inode *inode) |
39279cc3 CM |
6491 | { |
6492 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
fcb80c2a | 6493 | struct btrfs_block_rsv *rsv; |
39279cc3 | 6494 | int ret; |
3893e33b | 6495 | int err = 0; |
39279cc3 | 6496 | struct btrfs_trans_handle *trans; |
d3c2fdcf | 6497 | unsigned long nr; |
dbe674a9 | 6498 | u64 mask = root->sectorsize - 1; |
39279cc3 | 6499 | |
5d5e103a JB |
6500 | ret = btrfs_truncate_page(inode->i_mapping, inode->i_size); |
6501 | if (ret) | |
a41ad394 | 6502 | return ret; |
8082510e | 6503 | |
4a096752 | 6504 | btrfs_wait_ordered_range(inode, inode->i_size & (~mask), (u64)-1); |
8082510e | 6505 | btrfs_ordered_update_i_size(inode, inode->i_size, NULL); |
39279cc3 | 6506 | |
fcb80c2a JB |
6507 | /* |
6508 | * Yes ladies and gentelment, this is indeed ugly. The fact is we have | |
6509 | * 3 things going on here | |
6510 | * | |
6511 | * 1) We need to reserve space for our orphan item and the space to | |
6512 | * delete our orphan item. Lord knows we don't want to have a dangling | |
6513 | * orphan item because we didn't reserve space to remove it. | |
6514 | * | |
6515 | * 2) We need to reserve space to update our inode. | |
6516 | * | |
6517 | * 3) We need to have something to cache all the space that is going to | |
6518 | * be free'd up by the truncate operation, but also have some slack | |
6519 | * space reserved in case it uses space during the truncate (thank you | |
6520 | * very much snapshotting). | |
6521 | * | |
6522 | * And we need these to all be seperate. The fact is we can use alot of | |
6523 | * space doing the truncate, and we have no earthly idea how much space | |
6524 | * we will use, so we need the truncate reservation to be seperate so it | |
6525 | * doesn't end up using space reserved for updating the inode or | |
6526 | * removing the orphan item. We also need to be able to stop the | |
6527 | * transaction and start a new one, which means we need to be able to | |
6528 | * update the inode several times, and we have no idea of knowing how | |
6529 | * many times that will be, so we can't just reserve 1 item for the | |
6530 | * entirety of the opration, so that has to be done seperately as well. | |
6531 | * Then there is the orphan item, which does indeed need to be held on | |
6532 | * to for the whole operation, and we need nobody to touch this reserved | |
6533 | * space except the orphan code. | |
6534 | * | |
6535 | * So that leaves us with | |
6536 | * | |
6537 | * 1) root->orphan_block_rsv - for the orphan deletion. | |
6538 | * 2) rsv - for the truncate reservation, which we will steal from the | |
6539 | * transaction reservation. | |
6540 | * 3) fs_info->trans_block_rsv - this will have 1 items worth left for | |
6541 | * updating the inode. | |
6542 | */ | |
6543 | rsv = btrfs_alloc_block_rsv(root); | |
6544 | if (!rsv) | |
6545 | return -ENOMEM; | |
6546 | btrfs_add_durable_block_rsv(root->fs_info, rsv); | |
f0cd846e | 6547 | |
fcb80c2a JB |
6548 | trans = btrfs_start_transaction(root, 4); |
6549 | if (IS_ERR(trans)) { | |
6550 | err = PTR_ERR(trans); | |
6551 | goto out; | |
6552 | } | |
f0cd846e | 6553 | |
fcb80c2a JB |
6554 | /* |
6555 | * Reserve space for the truncate process. Truncate should be adding | |
6556 | * space, but if there are snapshots it may end up using space. | |
6557 | */ | |
6558 | ret = btrfs_truncate_reserve_metadata(trans, root, rsv); | |
6559 | BUG_ON(ret); | |
f0cd846e JB |
6560 | |
6561 | ret = btrfs_orphan_add(trans, inode); | |
6562 | if (ret) { | |
6563 | btrfs_end_transaction(trans, root); | |
fcb80c2a | 6564 | goto out; |
f0cd846e JB |
6565 | } |
6566 | ||
6567 | nr = trans->blocks_used; | |
6568 | btrfs_end_transaction(trans, root); | |
6569 | btrfs_btree_balance_dirty(root, nr); | |
6570 | ||
fcb80c2a JB |
6571 | /* |
6572 | * Ok so we've already migrated our bytes over for the truncate, so here | |
6573 | * just reserve the one slot we need for updating the inode. | |
6574 | */ | |
6575 | trans = btrfs_start_transaction(root, 1); | |
6576 | if (IS_ERR(trans)) { | |
6577 | err = PTR_ERR(trans); | |
6578 | goto out; | |
6579 | } | |
fcb80c2a | 6580 | trans->block_rsv = rsv; |
5a3f23d5 CM |
6581 | |
6582 | /* | |
6583 | * setattr is responsible for setting the ordered_data_close flag, | |
6584 | * but that is only tested during the last file release. That | |
6585 | * could happen well after the next commit, leaving a great big | |
6586 | * window where new writes may get lost if someone chooses to write | |
6587 | * to this file after truncating to zero | |
6588 | * | |
6589 | * The inode doesn't have any dirty data here, and so if we commit | |
6590 | * this is a noop. If someone immediately starts writing to the inode | |
6591 | * it is very likely we'll catch some of their writes in this | |
6592 | * transaction, and the commit will find this file on the ordered | |
6593 | * data list with good things to send down. | |
6594 | * | |
6595 | * This is a best effort solution, there is still a window where | |
6596 | * using truncate to replace the contents of the file will | |
6597 | * end up with a zero length file after a crash. | |
6598 | */ | |
6599 | if (inode->i_size == 0 && BTRFS_I(inode)->ordered_data_close) | |
6600 | btrfs_add_ordered_operation(trans, root, inode); | |
6601 | ||
8082510e | 6602 | while (1) { |
d68fc57b | 6603 | if (!trans) { |
fcb80c2a JB |
6604 | trans = btrfs_start_transaction(root, 3); |
6605 | if (IS_ERR(trans)) { | |
6606 | err = PTR_ERR(trans); | |
6607 | goto out; | |
6608 | } | |
d68fc57b | 6609 | |
fcb80c2a JB |
6610 | ret = btrfs_truncate_reserve_metadata(trans, root, |
6611 | rsv); | |
6612 | BUG_ON(ret); | |
6613 | ||
fcb80c2a | 6614 | trans->block_rsv = rsv; |
d68fc57b YZ |
6615 | } |
6616 | ||
8082510e YZ |
6617 | ret = btrfs_truncate_inode_items(trans, root, inode, |
6618 | inode->i_size, | |
6619 | BTRFS_EXTENT_DATA_KEY); | |
3893e33b JB |
6620 | if (ret != -EAGAIN) { |
6621 | err = ret; | |
8082510e | 6622 | break; |
3893e33b | 6623 | } |
39279cc3 | 6624 | |
fcb80c2a | 6625 | trans->block_rsv = &root->fs_info->trans_block_rsv; |
8082510e | 6626 | ret = btrfs_update_inode(trans, root, inode); |
3893e33b JB |
6627 | if (ret) { |
6628 | err = ret; | |
6629 | break; | |
6630 | } | |
5f39d397 | 6631 | |
8082510e YZ |
6632 | nr = trans->blocks_used; |
6633 | btrfs_end_transaction(trans, root); | |
d68fc57b | 6634 | trans = NULL; |
8082510e | 6635 | btrfs_btree_balance_dirty(root, nr); |
8082510e YZ |
6636 | } |
6637 | ||
6638 | if (ret == 0 && inode->i_nlink > 0) { | |
fcb80c2a | 6639 | trans->block_rsv = root->orphan_block_rsv; |
8082510e | 6640 | ret = btrfs_orphan_del(trans, inode); |
3893e33b JB |
6641 | if (ret) |
6642 | err = ret; | |
ded5db9d JB |
6643 | } else if (ret && inode->i_nlink > 0) { |
6644 | /* | |
6645 | * Failed to do the truncate, remove us from the in memory | |
6646 | * orphan list. | |
6647 | */ | |
6648 | ret = btrfs_orphan_del(NULL, inode); | |
8082510e YZ |
6649 | } |
6650 | ||
fcb80c2a | 6651 | trans->block_rsv = &root->fs_info->trans_block_rsv; |
8082510e | 6652 | ret = btrfs_update_inode(trans, root, inode); |
3893e33b JB |
6653 | if (ret && !err) |
6654 | err = ret; | |
7b128766 | 6655 | |
7b128766 | 6656 | nr = trans->blocks_used; |
89ce8a63 | 6657 | ret = btrfs_end_transaction_throttle(trans, root); |
fcb80c2a JB |
6658 | btrfs_btree_balance_dirty(root, nr); |
6659 | ||
6660 | out: | |
6661 | btrfs_free_block_rsv(root, rsv); | |
6662 | ||
3893e33b JB |
6663 | if (ret && !err) |
6664 | err = ret; | |
a41ad394 | 6665 | |
3893e33b | 6666 | return err; |
39279cc3 CM |
6667 | } |
6668 | ||
d352ac68 CM |
6669 | /* |
6670 | * create a new subvolume directory/inode (helper for the ioctl). | |
6671 | */ | |
d2fb3437 | 6672 | int btrfs_create_subvol_root(struct btrfs_trans_handle *trans, |
d82a6f1d | 6673 | struct btrfs_root *new_root, u64 new_dirid) |
39279cc3 | 6674 | { |
39279cc3 | 6675 | struct inode *inode; |
76dda93c | 6676 | int err; |
00e4e6b3 | 6677 | u64 index = 0; |
39279cc3 | 6678 | |
aec7477b | 6679 | inode = btrfs_new_inode(trans, new_root, NULL, "..", 2, new_dirid, |
d82a6f1d | 6680 | new_dirid, S_IFDIR | 0700, &index); |
54aa1f4d | 6681 | if (IS_ERR(inode)) |
f46b5a66 | 6682 | return PTR_ERR(inode); |
39279cc3 CM |
6683 | inode->i_op = &btrfs_dir_inode_operations; |
6684 | inode->i_fop = &btrfs_dir_file_operations; | |
6685 | ||
39279cc3 | 6686 | inode->i_nlink = 1; |
dbe674a9 | 6687 | btrfs_i_size_write(inode, 0); |
3b96362c | 6688 | |
76dda93c YZ |
6689 | err = btrfs_update_inode(trans, new_root, inode); |
6690 | BUG_ON(err); | |
cb8e7090 | 6691 | |
76dda93c | 6692 | iput(inode); |
cb8e7090 | 6693 | return 0; |
39279cc3 CM |
6694 | } |
6695 | ||
d352ac68 CM |
6696 | /* helper function for file defrag and space balancing. This |
6697 | * forces readahead on a given range of bytes in an inode | |
6698 | */ | |
edbd8d4e | 6699 | unsigned long btrfs_force_ra(struct address_space *mapping, |
86479a04 CM |
6700 | struct file_ra_state *ra, struct file *file, |
6701 | pgoff_t offset, pgoff_t last_index) | |
6702 | { | |
8e7bf94f | 6703 | pgoff_t req_size = last_index - offset + 1; |
86479a04 | 6704 | |
86479a04 CM |
6705 | page_cache_sync_readahead(mapping, ra, file, offset, req_size); |
6706 | return offset + req_size; | |
86479a04 CM |
6707 | } |
6708 | ||
39279cc3 CM |
6709 | struct inode *btrfs_alloc_inode(struct super_block *sb) |
6710 | { | |
6711 | struct btrfs_inode *ei; | |
2ead6ae7 | 6712 | struct inode *inode; |
39279cc3 CM |
6713 | |
6714 | ei = kmem_cache_alloc(btrfs_inode_cachep, GFP_NOFS); | |
6715 | if (!ei) | |
6716 | return NULL; | |
2ead6ae7 YZ |
6717 | |
6718 | ei->root = NULL; | |
6719 | ei->space_info = NULL; | |
6720 | ei->generation = 0; | |
6721 | ei->sequence = 0; | |
15ee9bc7 | 6722 | ei->last_trans = 0; |
257c62e1 | 6723 | ei->last_sub_trans = 0; |
e02119d5 | 6724 | ei->logged_trans = 0; |
2ead6ae7 YZ |
6725 | ei->delalloc_bytes = 0; |
6726 | ei->reserved_bytes = 0; | |
6727 | ei->disk_i_size = 0; | |
6728 | ei->flags = 0; | |
6729 | ei->index_cnt = (u64)-1; | |
6730 | ei->last_unlink_trans = 0; | |
6731 | ||
0ca1f7ce | 6732 | atomic_set(&ei->outstanding_extents, 0); |
57a45ced | 6733 | atomic_set(&ei->reserved_extents, 0); |
2ead6ae7 YZ |
6734 | |
6735 | ei->ordered_data_close = 0; | |
d68fc57b | 6736 | ei->orphan_meta_reserved = 0; |
2ead6ae7 | 6737 | ei->dummy_inode = 0; |
4cb5300b | 6738 | ei->in_defrag = 0; |
261507a0 | 6739 | ei->force_compress = BTRFS_COMPRESS_NONE; |
2ead6ae7 | 6740 | |
16cdcec7 MX |
6741 | ei->delayed_node = NULL; |
6742 | ||
2ead6ae7 | 6743 | inode = &ei->vfs_inode; |
a8067e02 | 6744 | extent_map_tree_init(&ei->extent_tree); |
f993c883 DS |
6745 | extent_io_tree_init(&ei->io_tree, &inode->i_data); |
6746 | extent_io_tree_init(&ei->io_failure_tree, &inode->i_data); | |
2ead6ae7 | 6747 | mutex_init(&ei->log_mutex); |
e6dcd2dc | 6748 | btrfs_ordered_inode_tree_init(&ei->ordered_tree); |
7b128766 | 6749 | INIT_LIST_HEAD(&ei->i_orphan); |
2ead6ae7 | 6750 | INIT_LIST_HEAD(&ei->delalloc_inodes); |
5a3f23d5 | 6751 | INIT_LIST_HEAD(&ei->ordered_operations); |
2ead6ae7 YZ |
6752 | RB_CLEAR_NODE(&ei->rb_node); |
6753 | ||
6754 | return inode; | |
39279cc3 CM |
6755 | } |
6756 | ||
fa0d7e3d NP |
6757 | static void btrfs_i_callback(struct rcu_head *head) |
6758 | { | |
6759 | struct inode *inode = container_of(head, struct inode, i_rcu); | |
6760 | INIT_LIST_HEAD(&inode->i_dentry); | |
6761 | kmem_cache_free(btrfs_inode_cachep, BTRFS_I(inode)); | |
6762 | } | |
6763 | ||
39279cc3 CM |
6764 | void btrfs_destroy_inode(struct inode *inode) |
6765 | { | |
e6dcd2dc | 6766 | struct btrfs_ordered_extent *ordered; |
5a3f23d5 CM |
6767 | struct btrfs_root *root = BTRFS_I(inode)->root; |
6768 | ||
39279cc3 CM |
6769 | WARN_ON(!list_empty(&inode->i_dentry)); |
6770 | WARN_ON(inode->i_data.nrpages); | |
0ca1f7ce | 6771 | WARN_ON(atomic_read(&BTRFS_I(inode)->outstanding_extents)); |
57a45ced | 6772 | WARN_ON(atomic_read(&BTRFS_I(inode)->reserved_extents)); |
39279cc3 | 6773 | |
a6dbd429 JB |
6774 | /* |
6775 | * This can happen where we create an inode, but somebody else also | |
6776 | * created the same inode and we need to destroy the one we already | |
6777 | * created. | |
6778 | */ | |
6779 | if (!root) | |
6780 | goto free; | |
6781 | ||
5a3f23d5 CM |
6782 | /* |
6783 | * Make sure we're properly removed from the ordered operation | |
6784 | * lists. | |
6785 | */ | |
6786 | smp_mb(); | |
6787 | if (!list_empty(&BTRFS_I(inode)->ordered_operations)) { | |
6788 | spin_lock(&root->fs_info->ordered_extent_lock); | |
6789 | list_del_init(&BTRFS_I(inode)->ordered_operations); | |
6790 | spin_unlock(&root->fs_info->ordered_extent_lock); | |
6791 | } | |
6792 | ||
d68fc57b | 6793 | spin_lock(&root->orphan_lock); |
7b128766 | 6794 | if (!list_empty(&BTRFS_I(inode)->i_orphan)) { |
33345d01 LZ |
6795 | printk(KERN_INFO "BTRFS: inode %llu still on the orphan list\n", |
6796 | (unsigned long long)btrfs_ino(inode)); | |
8082510e | 6797 | list_del_init(&BTRFS_I(inode)->i_orphan); |
7b128766 | 6798 | } |
d68fc57b | 6799 | spin_unlock(&root->orphan_lock); |
7b128766 | 6800 | |
d397712b | 6801 | while (1) { |
e6dcd2dc CM |
6802 | ordered = btrfs_lookup_first_ordered_extent(inode, (u64)-1); |
6803 | if (!ordered) | |
6804 | break; | |
6805 | else { | |
d397712b CM |
6806 | printk(KERN_ERR "btrfs found ordered " |
6807 | "extent %llu %llu on inode cleanup\n", | |
6808 | (unsigned long long)ordered->file_offset, | |
6809 | (unsigned long long)ordered->len); | |
e6dcd2dc CM |
6810 | btrfs_remove_ordered_extent(inode, ordered); |
6811 | btrfs_put_ordered_extent(ordered); | |
6812 | btrfs_put_ordered_extent(ordered); | |
6813 | } | |
6814 | } | |
5d4f98a2 | 6815 | inode_tree_del(inode); |
5b21f2ed | 6816 | btrfs_drop_extent_cache(inode, 0, (u64)-1, 0); |
a6dbd429 | 6817 | free: |
16cdcec7 | 6818 | btrfs_remove_delayed_node(inode); |
fa0d7e3d | 6819 | call_rcu(&inode->i_rcu, btrfs_i_callback); |
39279cc3 CM |
6820 | } |
6821 | ||
45321ac5 | 6822 | int btrfs_drop_inode(struct inode *inode) |
76dda93c YZ |
6823 | { |
6824 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
45321ac5 | 6825 | |
0af3d00b | 6826 | if (btrfs_root_refs(&root->root_item) == 0 && |
82d5902d | 6827 | !is_free_space_inode(root, inode)) |
45321ac5 | 6828 | return 1; |
76dda93c | 6829 | else |
45321ac5 | 6830 | return generic_drop_inode(inode); |
76dda93c YZ |
6831 | } |
6832 | ||
0ee0fda0 | 6833 | static void init_once(void *foo) |
39279cc3 CM |
6834 | { |
6835 | struct btrfs_inode *ei = (struct btrfs_inode *) foo; | |
6836 | ||
6837 | inode_init_once(&ei->vfs_inode); | |
6838 | } | |
6839 | ||
6840 | void btrfs_destroy_cachep(void) | |
6841 | { | |
6842 | if (btrfs_inode_cachep) | |
6843 | kmem_cache_destroy(btrfs_inode_cachep); | |
6844 | if (btrfs_trans_handle_cachep) | |
6845 | kmem_cache_destroy(btrfs_trans_handle_cachep); | |
6846 | if (btrfs_transaction_cachep) | |
6847 | kmem_cache_destroy(btrfs_transaction_cachep); | |
39279cc3 CM |
6848 | if (btrfs_path_cachep) |
6849 | kmem_cache_destroy(btrfs_path_cachep); | |
dc89e982 JB |
6850 | if (btrfs_free_space_cachep) |
6851 | kmem_cache_destroy(btrfs_free_space_cachep); | |
39279cc3 CM |
6852 | } |
6853 | ||
6854 | int btrfs_init_cachep(void) | |
6855 | { | |
9601e3f6 CH |
6856 | btrfs_inode_cachep = kmem_cache_create("btrfs_inode_cache", |
6857 | sizeof(struct btrfs_inode), 0, | |
6858 | SLAB_RECLAIM_ACCOUNT | SLAB_MEM_SPREAD, init_once); | |
39279cc3 CM |
6859 | if (!btrfs_inode_cachep) |
6860 | goto fail; | |
9601e3f6 CH |
6861 | |
6862 | btrfs_trans_handle_cachep = kmem_cache_create("btrfs_trans_handle_cache", | |
6863 | sizeof(struct btrfs_trans_handle), 0, | |
6864 | SLAB_RECLAIM_ACCOUNT | SLAB_MEM_SPREAD, NULL); | |
39279cc3 CM |
6865 | if (!btrfs_trans_handle_cachep) |
6866 | goto fail; | |
9601e3f6 CH |
6867 | |
6868 | btrfs_transaction_cachep = kmem_cache_create("btrfs_transaction_cache", | |
6869 | sizeof(struct btrfs_transaction), 0, | |
6870 | SLAB_RECLAIM_ACCOUNT | SLAB_MEM_SPREAD, NULL); | |
39279cc3 CM |
6871 | if (!btrfs_transaction_cachep) |
6872 | goto fail; | |
9601e3f6 CH |
6873 | |
6874 | btrfs_path_cachep = kmem_cache_create("btrfs_path_cache", | |
6875 | sizeof(struct btrfs_path), 0, | |
6876 | SLAB_RECLAIM_ACCOUNT | SLAB_MEM_SPREAD, NULL); | |
39279cc3 CM |
6877 | if (!btrfs_path_cachep) |
6878 | goto fail; | |
9601e3f6 | 6879 | |
dc89e982 JB |
6880 | btrfs_free_space_cachep = kmem_cache_create("btrfs_free_space_cache", |
6881 | sizeof(struct btrfs_free_space), 0, | |
6882 | SLAB_RECLAIM_ACCOUNT | SLAB_MEM_SPREAD, NULL); | |
6883 | if (!btrfs_free_space_cachep) | |
6884 | goto fail; | |
6885 | ||
39279cc3 CM |
6886 | return 0; |
6887 | fail: | |
6888 | btrfs_destroy_cachep(); | |
6889 | return -ENOMEM; | |
6890 | } | |
6891 | ||
6892 | static int btrfs_getattr(struct vfsmount *mnt, | |
6893 | struct dentry *dentry, struct kstat *stat) | |
6894 | { | |
6895 | struct inode *inode = dentry->d_inode; | |
6896 | generic_fillattr(inode, stat); | |
0ee5dc67 | 6897 | stat->dev = BTRFS_I(inode)->root->anon_dev; |
d6667462 | 6898 | stat->blksize = PAGE_CACHE_SIZE; |
a76a3cd4 YZ |
6899 | stat->blocks = (inode_get_bytes(inode) + |
6900 | BTRFS_I(inode)->delalloc_bytes) >> 9; | |
39279cc3 CM |
6901 | return 0; |
6902 | } | |
6903 | ||
75e7cb7f LB |
6904 | /* |
6905 | * If a file is moved, it will inherit the cow and compression flags of the new | |
6906 | * directory. | |
6907 | */ | |
6908 | static void fixup_inode_flags(struct inode *dir, struct inode *inode) | |
6909 | { | |
6910 | struct btrfs_inode *b_dir = BTRFS_I(dir); | |
6911 | struct btrfs_inode *b_inode = BTRFS_I(inode); | |
6912 | ||
6913 | if (b_dir->flags & BTRFS_INODE_NODATACOW) | |
6914 | b_inode->flags |= BTRFS_INODE_NODATACOW; | |
6915 | else | |
6916 | b_inode->flags &= ~BTRFS_INODE_NODATACOW; | |
6917 | ||
6918 | if (b_dir->flags & BTRFS_INODE_COMPRESS) | |
6919 | b_inode->flags |= BTRFS_INODE_COMPRESS; | |
6920 | else | |
6921 | b_inode->flags &= ~BTRFS_INODE_COMPRESS; | |
6922 | } | |
6923 | ||
d397712b CM |
6924 | static int btrfs_rename(struct inode *old_dir, struct dentry *old_dentry, |
6925 | struct inode *new_dir, struct dentry *new_dentry) | |
39279cc3 CM |
6926 | { |
6927 | struct btrfs_trans_handle *trans; | |
6928 | struct btrfs_root *root = BTRFS_I(old_dir)->root; | |
4df27c4d | 6929 | struct btrfs_root *dest = BTRFS_I(new_dir)->root; |
39279cc3 CM |
6930 | struct inode *new_inode = new_dentry->d_inode; |
6931 | struct inode *old_inode = old_dentry->d_inode; | |
6932 | struct timespec ctime = CURRENT_TIME; | |
00e4e6b3 | 6933 | u64 index = 0; |
4df27c4d | 6934 | u64 root_objectid; |
39279cc3 | 6935 | int ret; |
33345d01 | 6936 | u64 old_ino = btrfs_ino(old_inode); |
39279cc3 | 6937 | |
33345d01 | 6938 | if (btrfs_ino(new_dir) == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID) |
f679a840 YZ |
6939 | return -EPERM; |
6940 | ||
4df27c4d | 6941 | /* we only allow rename subvolume link between subvolumes */ |
33345d01 | 6942 | if (old_ino != BTRFS_FIRST_FREE_OBJECTID && root != dest) |
3394e160 CM |
6943 | return -EXDEV; |
6944 | ||
33345d01 LZ |
6945 | if (old_ino == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID || |
6946 | (new_inode && btrfs_ino(new_inode) == BTRFS_FIRST_FREE_OBJECTID)) | |
39279cc3 | 6947 | return -ENOTEMPTY; |
5f39d397 | 6948 | |
4df27c4d YZ |
6949 | if (S_ISDIR(old_inode->i_mode) && new_inode && |
6950 | new_inode->i_size > BTRFS_EMPTY_DIR_SIZE) | |
6951 | return -ENOTEMPTY; | |
5a3f23d5 CM |
6952 | /* |
6953 | * we're using rename to replace one file with another. | |
6954 | * and the replacement file is large. Start IO on it now so | |
6955 | * we don't add too much work to the end of the transaction | |
6956 | */ | |
4baf8c92 | 6957 | if (new_inode && S_ISREG(old_inode->i_mode) && new_inode->i_size && |
5a3f23d5 CM |
6958 | old_inode->i_size > BTRFS_ORDERED_OPERATIONS_FLUSH_LIMIT) |
6959 | filemap_flush(old_inode->i_mapping); | |
6960 | ||
76dda93c | 6961 | /* close the racy window with snapshot create/destroy ioctl */ |
33345d01 | 6962 | if (old_ino == BTRFS_FIRST_FREE_OBJECTID) |
76dda93c | 6963 | down_read(&root->fs_info->subvol_sem); |
a22285a6 YZ |
6964 | /* |
6965 | * We want to reserve the absolute worst case amount of items. So if | |
6966 | * both inodes are subvols and we need to unlink them then that would | |
6967 | * require 4 item modifications, but if they are both normal inodes it | |
6968 | * would require 5 item modifications, so we'll assume their normal | |
6969 | * inodes. So 5 * 2 is 10, plus 1 for the new link, so 11 total items | |
6970 | * should cover the worst case number of items we'll modify. | |
6971 | */ | |
6972 | trans = btrfs_start_transaction(root, 20); | |
b44c59a8 JL |
6973 | if (IS_ERR(trans)) { |
6974 | ret = PTR_ERR(trans); | |
6975 | goto out_notrans; | |
6976 | } | |
76dda93c | 6977 | |
4df27c4d YZ |
6978 | if (dest != root) |
6979 | btrfs_record_root_in_trans(trans, dest); | |
5f39d397 | 6980 | |
a5719521 YZ |
6981 | ret = btrfs_set_inode_index(new_dir, &index); |
6982 | if (ret) | |
6983 | goto out_fail; | |
5a3f23d5 | 6984 | |
33345d01 | 6985 | if (unlikely(old_ino == BTRFS_FIRST_FREE_OBJECTID)) { |
4df27c4d YZ |
6986 | /* force full log commit if subvolume involved. */ |
6987 | root->fs_info->last_trans_log_full_commit = trans->transid; | |
6988 | } else { | |
a5719521 YZ |
6989 | ret = btrfs_insert_inode_ref(trans, dest, |
6990 | new_dentry->d_name.name, | |
6991 | new_dentry->d_name.len, | |
33345d01 LZ |
6992 | old_ino, |
6993 | btrfs_ino(new_dir), index); | |
a5719521 YZ |
6994 | if (ret) |
6995 | goto out_fail; | |
4df27c4d YZ |
6996 | /* |
6997 | * this is an ugly little race, but the rename is required | |
6998 | * to make sure that if we crash, the inode is either at the | |
6999 | * old name or the new one. pinning the log transaction lets | |
7000 | * us make sure we don't allow a log commit to come in after | |
7001 | * we unlink the name but before we add the new name back in. | |
7002 | */ | |
7003 | btrfs_pin_log_trans(root); | |
7004 | } | |
5a3f23d5 CM |
7005 | /* |
7006 | * make sure the inode gets flushed if it is replacing | |
7007 | * something. | |
7008 | */ | |
33345d01 | 7009 | if (new_inode && new_inode->i_size && S_ISREG(old_inode->i_mode)) |
5a3f23d5 | 7010 | btrfs_add_ordered_operation(trans, root, old_inode); |
5a3f23d5 | 7011 | |
39279cc3 CM |
7012 | old_dir->i_ctime = old_dir->i_mtime = ctime; |
7013 | new_dir->i_ctime = new_dir->i_mtime = ctime; | |
7014 | old_inode->i_ctime = ctime; | |
5f39d397 | 7015 | |
12fcfd22 CM |
7016 | if (old_dentry->d_parent != new_dentry->d_parent) |
7017 | btrfs_record_unlink_dir(trans, old_dir, old_inode, 1); | |
7018 | ||
33345d01 | 7019 | if (unlikely(old_ino == BTRFS_FIRST_FREE_OBJECTID)) { |
4df27c4d YZ |
7020 | root_objectid = BTRFS_I(old_inode)->root->root_key.objectid; |
7021 | ret = btrfs_unlink_subvol(trans, root, old_dir, root_objectid, | |
7022 | old_dentry->d_name.name, | |
7023 | old_dentry->d_name.len); | |
7024 | } else { | |
92986796 AV |
7025 | ret = __btrfs_unlink_inode(trans, root, old_dir, |
7026 | old_dentry->d_inode, | |
7027 | old_dentry->d_name.name, | |
7028 | old_dentry->d_name.len); | |
7029 | if (!ret) | |
7030 | ret = btrfs_update_inode(trans, root, old_inode); | |
4df27c4d YZ |
7031 | } |
7032 | BUG_ON(ret); | |
39279cc3 CM |
7033 | |
7034 | if (new_inode) { | |
7035 | new_inode->i_ctime = CURRENT_TIME; | |
33345d01 | 7036 | if (unlikely(btrfs_ino(new_inode) == |
4df27c4d YZ |
7037 | BTRFS_EMPTY_SUBVOL_DIR_OBJECTID)) { |
7038 | root_objectid = BTRFS_I(new_inode)->location.objectid; | |
7039 | ret = btrfs_unlink_subvol(trans, dest, new_dir, | |
7040 | root_objectid, | |
7041 | new_dentry->d_name.name, | |
7042 | new_dentry->d_name.len); | |
7043 | BUG_ON(new_inode->i_nlink == 0); | |
7044 | } else { | |
7045 | ret = btrfs_unlink_inode(trans, dest, new_dir, | |
7046 | new_dentry->d_inode, | |
7047 | new_dentry->d_name.name, | |
7048 | new_dentry->d_name.len); | |
7049 | } | |
7050 | BUG_ON(ret); | |
7b128766 | 7051 | if (new_inode->i_nlink == 0) { |
e02119d5 | 7052 | ret = btrfs_orphan_add(trans, new_dentry->d_inode); |
4df27c4d | 7053 | BUG_ON(ret); |
7b128766 | 7054 | } |
39279cc3 | 7055 | } |
aec7477b | 7056 | |
75e7cb7f LB |
7057 | fixup_inode_flags(new_dir, old_inode); |
7058 | ||
4df27c4d YZ |
7059 | ret = btrfs_add_link(trans, new_dir, old_inode, |
7060 | new_dentry->d_name.name, | |
a5719521 | 7061 | new_dentry->d_name.len, 0, index); |
4df27c4d | 7062 | BUG_ON(ret); |
39279cc3 | 7063 | |
33345d01 | 7064 | if (old_ino != BTRFS_FIRST_FREE_OBJECTID) { |
6a912213 JB |
7065 | struct dentry *parent = dget_parent(new_dentry); |
7066 | btrfs_log_new_name(trans, old_inode, old_dir, parent); | |
7067 | dput(parent); | |
4df27c4d YZ |
7068 | btrfs_end_log_trans(root); |
7069 | } | |
39279cc3 | 7070 | out_fail: |
ab78c84d | 7071 | btrfs_end_transaction_throttle(trans, root); |
b44c59a8 | 7072 | out_notrans: |
33345d01 | 7073 | if (old_ino == BTRFS_FIRST_FREE_OBJECTID) |
76dda93c | 7074 | up_read(&root->fs_info->subvol_sem); |
9ed74f2d | 7075 | |
39279cc3 CM |
7076 | return ret; |
7077 | } | |
7078 | ||
d352ac68 CM |
7079 | /* |
7080 | * some fairly slow code that needs optimization. This walks the list | |
7081 | * of all the inodes with pending delalloc and forces them to disk. | |
7082 | */ | |
24bbcf04 | 7083 | int btrfs_start_delalloc_inodes(struct btrfs_root *root, int delay_iput) |
ea8c2819 CM |
7084 | { |
7085 | struct list_head *head = &root->fs_info->delalloc_inodes; | |
7086 | struct btrfs_inode *binode; | |
5b21f2ed | 7087 | struct inode *inode; |
ea8c2819 | 7088 | |
c146afad YZ |
7089 | if (root->fs_info->sb->s_flags & MS_RDONLY) |
7090 | return -EROFS; | |
7091 | ||
75eff68e | 7092 | spin_lock(&root->fs_info->delalloc_lock); |
d397712b | 7093 | while (!list_empty(head)) { |
ea8c2819 CM |
7094 | binode = list_entry(head->next, struct btrfs_inode, |
7095 | delalloc_inodes); | |
5b21f2ed ZY |
7096 | inode = igrab(&binode->vfs_inode); |
7097 | if (!inode) | |
7098 | list_del_init(&binode->delalloc_inodes); | |
75eff68e | 7099 | spin_unlock(&root->fs_info->delalloc_lock); |
5b21f2ed | 7100 | if (inode) { |
8c8bee1d | 7101 | filemap_flush(inode->i_mapping); |
24bbcf04 YZ |
7102 | if (delay_iput) |
7103 | btrfs_add_delayed_iput(inode); | |
7104 | else | |
7105 | iput(inode); | |
5b21f2ed ZY |
7106 | } |
7107 | cond_resched(); | |
75eff68e | 7108 | spin_lock(&root->fs_info->delalloc_lock); |
ea8c2819 | 7109 | } |
75eff68e | 7110 | spin_unlock(&root->fs_info->delalloc_lock); |
8c8bee1d CM |
7111 | |
7112 | /* the filemap_flush will queue IO into the worker threads, but | |
7113 | * we have to make sure the IO is actually started and that | |
7114 | * ordered extents get created before we return | |
7115 | */ | |
7116 | atomic_inc(&root->fs_info->async_submit_draining); | |
d397712b | 7117 | while (atomic_read(&root->fs_info->nr_async_submits) || |
771ed689 | 7118 | atomic_read(&root->fs_info->async_delalloc_pages)) { |
8c8bee1d | 7119 | wait_event(root->fs_info->async_submit_wait, |
771ed689 CM |
7120 | (atomic_read(&root->fs_info->nr_async_submits) == 0 && |
7121 | atomic_read(&root->fs_info->async_delalloc_pages) == 0)); | |
8c8bee1d CM |
7122 | } |
7123 | atomic_dec(&root->fs_info->async_submit_draining); | |
ea8c2819 CM |
7124 | return 0; |
7125 | } | |
7126 | ||
39279cc3 CM |
7127 | static int btrfs_symlink(struct inode *dir, struct dentry *dentry, |
7128 | const char *symname) | |
7129 | { | |
7130 | struct btrfs_trans_handle *trans; | |
7131 | struct btrfs_root *root = BTRFS_I(dir)->root; | |
7132 | struct btrfs_path *path; | |
7133 | struct btrfs_key key; | |
1832a6d5 | 7134 | struct inode *inode = NULL; |
39279cc3 CM |
7135 | int err; |
7136 | int drop_inode = 0; | |
7137 | u64 objectid; | |
00e4e6b3 | 7138 | u64 index = 0 ; |
39279cc3 CM |
7139 | int name_len; |
7140 | int datasize; | |
5f39d397 | 7141 | unsigned long ptr; |
39279cc3 | 7142 | struct btrfs_file_extent_item *ei; |
5f39d397 | 7143 | struct extent_buffer *leaf; |
1832a6d5 | 7144 | unsigned long nr = 0; |
39279cc3 CM |
7145 | |
7146 | name_len = strlen(symname) + 1; | |
7147 | if (name_len > BTRFS_MAX_INLINE_DATA_SIZE(root)) | |
7148 | return -ENAMETOOLONG; | |
1832a6d5 | 7149 | |
9ed74f2d JB |
7150 | /* |
7151 | * 2 items for inode item and ref | |
7152 | * 2 items for dir items | |
7153 | * 1 item for xattr if selinux is on | |
7154 | */ | |
a22285a6 YZ |
7155 | trans = btrfs_start_transaction(root, 5); |
7156 | if (IS_ERR(trans)) | |
7157 | return PTR_ERR(trans); | |
1832a6d5 | 7158 | |
581bb050 LZ |
7159 | err = btrfs_find_free_ino(root, &objectid); |
7160 | if (err) | |
7161 | goto out_unlock; | |
7162 | ||
aec7477b | 7163 | inode = btrfs_new_inode(trans, root, dir, dentry->d_name.name, |
33345d01 | 7164 | dentry->d_name.len, btrfs_ino(dir), objectid, |
d82a6f1d | 7165 | S_IFLNK|S_IRWXUGO, &index); |
7cf96da3 TI |
7166 | if (IS_ERR(inode)) { |
7167 | err = PTR_ERR(inode); | |
39279cc3 | 7168 | goto out_unlock; |
7cf96da3 | 7169 | } |
39279cc3 | 7170 | |
2a7dba39 | 7171 | err = btrfs_init_inode_security(trans, inode, dir, &dentry->d_name); |
33268eaf JB |
7172 | if (err) { |
7173 | drop_inode = 1; | |
7174 | goto out_unlock; | |
7175 | } | |
7176 | ||
a1b075d2 | 7177 | err = btrfs_add_nondir(trans, dir, dentry, inode, 0, index); |
39279cc3 CM |
7178 | if (err) |
7179 | drop_inode = 1; | |
7180 | else { | |
7181 | inode->i_mapping->a_ops = &btrfs_aops; | |
04160088 | 7182 | inode->i_mapping->backing_dev_info = &root->fs_info->bdi; |
39279cc3 CM |
7183 | inode->i_fop = &btrfs_file_operations; |
7184 | inode->i_op = &btrfs_file_inode_operations; | |
d1310b2e | 7185 | BTRFS_I(inode)->io_tree.ops = &btrfs_extent_io_ops; |
39279cc3 | 7186 | } |
39279cc3 CM |
7187 | if (drop_inode) |
7188 | goto out_unlock; | |
7189 | ||
7190 | path = btrfs_alloc_path(); | |
7191 | BUG_ON(!path); | |
33345d01 | 7192 | key.objectid = btrfs_ino(inode); |
39279cc3 | 7193 | key.offset = 0; |
39279cc3 CM |
7194 | btrfs_set_key_type(&key, BTRFS_EXTENT_DATA_KEY); |
7195 | datasize = btrfs_file_extent_calc_inline_size(name_len); | |
7196 | err = btrfs_insert_empty_item(trans, root, path, &key, | |
7197 | datasize); | |
54aa1f4d CM |
7198 | if (err) { |
7199 | drop_inode = 1; | |
b0839166 | 7200 | btrfs_free_path(path); |
54aa1f4d CM |
7201 | goto out_unlock; |
7202 | } | |
5f39d397 CM |
7203 | leaf = path->nodes[0]; |
7204 | ei = btrfs_item_ptr(leaf, path->slots[0], | |
7205 | struct btrfs_file_extent_item); | |
7206 | btrfs_set_file_extent_generation(leaf, ei, trans->transid); | |
7207 | btrfs_set_file_extent_type(leaf, ei, | |
39279cc3 | 7208 | BTRFS_FILE_EXTENT_INLINE); |
c8b97818 CM |
7209 | btrfs_set_file_extent_encryption(leaf, ei, 0); |
7210 | btrfs_set_file_extent_compression(leaf, ei, 0); | |
7211 | btrfs_set_file_extent_other_encoding(leaf, ei, 0); | |
7212 | btrfs_set_file_extent_ram_bytes(leaf, ei, name_len); | |
7213 | ||
39279cc3 | 7214 | ptr = btrfs_file_extent_inline_start(ei); |
5f39d397 CM |
7215 | write_extent_buffer(leaf, symname, ptr, name_len); |
7216 | btrfs_mark_buffer_dirty(leaf); | |
39279cc3 | 7217 | btrfs_free_path(path); |
5f39d397 | 7218 | |
39279cc3 CM |
7219 | inode->i_op = &btrfs_symlink_inode_operations; |
7220 | inode->i_mapping->a_ops = &btrfs_symlink_aops; | |
04160088 | 7221 | inode->i_mapping->backing_dev_info = &root->fs_info->bdi; |
d899e052 | 7222 | inode_set_bytes(inode, name_len); |
dbe674a9 | 7223 | btrfs_i_size_write(inode, name_len - 1); |
54aa1f4d CM |
7224 | err = btrfs_update_inode(trans, root, inode); |
7225 | if (err) | |
7226 | drop_inode = 1; | |
39279cc3 CM |
7227 | |
7228 | out_unlock: | |
d3c2fdcf | 7229 | nr = trans->blocks_used; |
ab78c84d | 7230 | btrfs_end_transaction_throttle(trans, root); |
39279cc3 CM |
7231 | if (drop_inode) { |
7232 | inode_dec_link_count(inode); | |
7233 | iput(inode); | |
7234 | } | |
d3c2fdcf | 7235 | btrfs_btree_balance_dirty(root, nr); |
39279cc3 CM |
7236 | return err; |
7237 | } | |
16432985 | 7238 | |
0af3d00b JB |
7239 | static int __btrfs_prealloc_file_range(struct inode *inode, int mode, |
7240 | u64 start, u64 num_bytes, u64 min_size, | |
7241 | loff_t actual_len, u64 *alloc_hint, | |
7242 | struct btrfs_trans_handle *trans) | |
d899e052 | 7243 | { |
d899e052 YZ |
7244 | struct btrfs_root *root = BTRFS_I(inode)->root; |
7245 | struct btrfs_key ins; | |
d899e052 | 7246 | u64 cur_offset = start; |
55a61d1d | 7247 | u64 i_size; |
d899e052 | 7248 | int ret = 0; |
0af3d00b | 7249 | bool own_trans = true; |
d899e052 | 7250 | |
0af3d00b JB |
7251 | if (trans) |
7252 | own_trans = false; | |
d899e052 | 7253 | while (num_bytes > 0) { |
0af3d00b JB |
7254 | if (own_trans) { |
7255 | trans = btrfs_start_transaction(root, 3); | |
7256 | if (IS_ERR(trans)) { | |
7257 | ret = PTR_ERR(trans); | |
7258 | break; | |
7259 | } | |
5a303d5d YZ |
7260 | } |
7261 | ||
efa56464 YZ |
7262 | ret = btrfs_reserve_extent(trans, root, num_bytes, min_size, |
7263 | 0, *alloc_hint, (u64)-1, &ins, 1); | |
5a303d5d | 7264 | if (ret) { |
0af3d00b JB |
7265 | if (own_trans) |
7266 | btrfs_end_transaction(trans, root); | |
a22285a6 | 7267 | break; |
d899e052 | 7268 | } |
5a303d5d | 7269 | |
d899e052 YZ |
7270 | ret = insert_reserved_file_extent(trans, inode, |
7271 | cur_offset, ins.objectid, | |
7272 | ins.offset, ins.offset, | |
920bbbfb | 7273 | ins.offset, 0, 0, 0, |
d899e052 YZ |
7274 | BTRFS_FILE_EXTENT_PREALLOC); |
7275 | BUG_ON(ret); | |
a1ed835e CM |
7276 | btrfs_drop_extent_cache(inode, cur_offset, |
7277 | cur_offset + ins.offset -1, 0); | |
5a303d5d | 7278 | |
d899e052 YZ |
7279 | num_bytes -= ins.offset; |
7280 | cur_offset += ins.offset; | |
efa56464 | 7281 | *alloc_hint = ins.objectid + ins.offset; |
5a303d5d | 7282 | |
d899e052 | 7283 | inode->i_ctime = CURRENT_TIME; |
6cbff00f | 7284 | BTRFS_I(inode)->flags |= BTRFS_INODE_PREALLOC; |
d899e052 | 7285 | if (!(mode & FALLOC_FL_KEEP_SIZE) && |
efa56464 YZ |
7286 | (actual_len > inode->i_size) && |
7287 | (cur_offset > inode->i_size)) { | |
d1ea6a61 | 7288 | if (cur_offset > actual_len) |
55a61d1d | 7289 | i_size = actual_len; |
d1ea6a61 | 7290 | else |
55a61d1d JB |
7291 | i_size = cur_offset; |
7292 | i_size_write(inode, i_size); | |
7293 | btrfs_ordered_update_i_size(inode, i_size, NULL); | |
5a303d5d YZ |
7294 | } |
7295 | ||
d899e052 YZ |
7296 | ret = btrfs_update_inode(trans, root, inode); |
7297 | BUG_ON(ret); | |
d899e052 | 7298 | |
0af3d00b JB |
7299 | if (own_trans) |
7300 | btrfs_end_transaction(trans, root); | |
5a303d5d | 7301 | } |
d899e052 YZ |
7302 | return ret; |
7303 | } | |
7304 | ||
0af3d00b JB |
7305 | int btrfs_prealloc_file_range(struct inode *inode, int mode, |
7306 | u64 start, u64 num_bytes, u64 min_size, | |
7307 | loff_t actual_len, u64 *alloc_hint) | |
7308 | { | |
7309 | return __btrfs_prealloc_file_range(inode, mode, start, num_bytes, | |
7310 | min_size, actual_len, alloc_hint, | |
7311 | NULL); | |
7312 | } | |
7313 | ||
7314 | int btrfs_prealloc_file_range_trans(struct inode *inode, | |
7315 | struct btrfs_trans_handle *trans, int mode, | |
7316 | u64 start, u64 num_bytes, u64 min_size, | |
7317 | loff_t actual_len, u64 *alloc_hint) | |
7318 | { | |
7319 | return __btrfs_prealloc_file_range(inode, mode, start, num_bytes, | |
7320 | min_size, actual_len, alloc_hint, trans); | |
7321 | } | |
7322 | ||
e6dcd2dc CM |
7323 | static int btrfs_set_page_dirty(struct page *page) |
7324 | { | |
e6dcd2dc CM |
7325 | return __set_page_dirty_nobuffers(page); |
7326 | } | |
7327 | ||
10556cb2 | 7328 | static int btrfs_permission(struct inode *inode, int mask) |
fdebe2bd | 7329 | { |
b83cc969 LZ |
7330 | struct btrfs_root *root = BTRFS_I(inode)->root; |
7331 | ||
7332 | if (btrfs_root_readonly(root) && (mask & MAY_WRITE)) | |
7333 | return -EROFS; | |
6cbff00f | 7334 | if ((BTRFS_I(inode)->flags & BTRFS_INODE_READONLY) && (mask & MAY_WRITE)) |
fdebe2bd | 7335 | return -EACCES; |
2830ba7f | 7336 | return generic_permission(inode, mask); |
fdebe2bd | 7337 | } |
39279cc3 | 7338 | |
6e1d5dcc | 7339 | static const struct inode_operations btrfs_dir_inode_operations = { |
3394e160 | 7340 | .getattr = btrfs_getattr, |
39279cc3 CM |
7341 | .lookup = btrfs_lookup, |
7342 | .create = btrfs_create, | |
7343 | .unlink = btrfs_unlink, | |
7344 | .link = btrfs_link, | |
7345 | .mkdir = btrfs_mkdir, | |
7346 | .rmdir = btrfs_rmdir, | |
7347 | .rename = btrfs_rename, | |
7348 | .symlink = btrfs_symlink, | |
7349 | .setattr = btrfs_setattr, | |
618e21d5 | 7350 | .mknod = btrfs_mknod, |
95819c05 CH |
7351 | .setxattr = btrfs_setxattr, |
7352 | .getxattr = btrfs_getxattr, | |
5103e947 | 7353 | .listxattr = btrfs_listxattr, |
95819c05 | 7354 | .removexattr = btrfs_removexattr, |
fdebe2bd | 7355 | .permission = btrfs_permission, |
178ea735 | 7356 | .check_acl = btrfs_check_acl, |
39279cc3 | 7357 | }; |
6e1d5dcc | 7358 | static const struct inode_operations btrfs_dir_ro_inode_operations = { |
39279cc3 | 7359 | .lookup = btrfs_lookup, |
fdebe2bd | 7360 | .permission = btrfs_permission, |
178ea735 | 7361 | .check_acl = btrfs_check_acl, |
39279cc3 | 7362 | }; |
76dda93c | 7363 | |
828c0950 | 7364 | static const struct file_operations btrfs_dir_file_operations = { |
39279cc3 CM |
7365 | .llseek = generic_file_llseek, |
7366 | .read = generic_read_dir, | |
cbdf5a24 | 7367 | .readdir = btrfs_real_readdir, |
34287aa3 | 7368 | .unlocked_ioctl = btrfs_ioctl, |
39279cc3 | 7369 | #ifdef CONFIG_COMPAT |
34287aa3 | 7370 | .compat_ioctl = btrfs_ioctl, |
39279cc3 | 7371 | #endif |
6bf13c0c | 7372 | .release = btrfs_release_file, |
e02119d5 | 7373 | .fsync = btrfs_sync_file, |
39279cc3 CM |
7374 | }; |
7375 | ||
d1310b2e | 7376 | static struct extent_io_ops btrfs_extent_io_ops = { |
07157aac | 7377 | .fill_delalloc = run_delalloc_range, |
065631f6 | 7378 | .submit_bio_hook = btrfs_submit_bio_hook, |
239b14b3 | 7379 | .merge_bio_hook = btrfs_merge_bio_hook, |
07157aac | 7380 | .readpage_end_io_hook = btrfs_readpage_end_io_hook, |
e6dcd2dc | 7381 | .writepage_end_io_hook = btrfs_writepage_end_io_hook, |
247e743c | 7382 | .writepage_start_hook = btrfs_writepage_start_hook, |
1259ab75 | 7383 | .readpage_io_failed_hook = btrfs_io_failed_hook, |
b0c68f8b CM |
7384 | .set_bit_hook = btrfs_set_bit_hook, |
7385 | .clear_bit_hook = btrfs_clear_bit_hook, | |
9ed74f2d JB |
7386 | .merge_extent_hook = btrfs_merge_extent_hook, |
7387 | .split_extent_hook = btrfs_split_extent_hook, | |
07157aac CM |
7388 | }; |
7389 | ||
35054394 CM |
7390 | /* |
7391 | * btrfs doesn't support the bmap operation because swapfiles | |
7392 | * use bmap to make a mapping of extents in the file. They assume | |
7393 | * these extents won't change over the life of the file and they | |
7394 | * use the bmap result to do IO directly to the drive. | |
7395 | * | |
7396 | * the btrfs bmap call would return logical addresses that aren't | |
7397 | * suitable for IO and they also will change frequently as COW | |
7398 | * operations happen. So, swapfile + btrfs == corruption. | |
7399 | * | |
7400 | * For now we're avoiding this by dropping bmap. | |
7401 | */ | |
7f09410b | 7402 | static const struct address_space_operations btrfs_aops = { |
39279cc3 CM |
7403 | .readpage = btrfs_readpage, |
7404 | .writepage = btrfs_writepage, | |
b293f02e | 7405 | .writepages = btrfs_writepages, |
3ab2fb5a | 7406 | .readpages = btrfs_readpages, |
16432985 | 7407 | .direct_IO = btrfs_direct_IO, |
a52d9a80 CM |
7408 | .invalidatepage = btrfs_invalidatepage, |
7409 | .releasepage = btrfs_releasepage, | |
e6dcd2dc | 7410 | .set_page_dirty = btrfs_set_page_dirty, |
465fdd97 | 7411 | .error_remove_page = generic_error_remove_page, |
39279cc3 CM |
7412 | }; |
7413 | ||
7f09410b | 7414 | static const struct address_space_operations btrfs_symlink_aops = { |
39279cc3 CM |
7415 | .readpage = btrfs_readpage, |
7416 | .writepage = btrfs_writepage, | |
2bf5a725 CM |
7417 | .invalidatepage = btrfs_invalidatepage, |
7418 | .releasepage = btrfs_releasepage, | |
39279cc3 CM |
7419 | }; |
7420 | ||
6e1d5dcc | 7421 | static const struct inode_operations btrfs_file_inode_operations = { |
39279cc3 CM |
7422 | .getattr = btrfs_getattr, |
7423 | .setattr = btrfs_setattr, | |
95819c05 CH |
7424 | .setxattr = btrfs_setxattr, |
7425 | .getxattr = btrfs_getxattr, | |
5103e947 | 7426 | .listxattr = btrfs_listxattr, |
95819c05 | 7427 | .removexattr = btrfs_removexattr, |
fdebe2bd | 7428 | .permission = btrfs_permission, |
1506fcc8 | 7429 | .fiemap = btrfs_fiemap, |
178ea735 | 7430 | .check_acl = btrfs_check_acl, |
39279cc3 | 7431 | }; |
6e1d5dcc | 7432 | static const struct inode_operations btrfs_special_inode_operations = { |
618e21d5 JB |
7433 | .getattr = btrfs_getattr, |
7434 | .setattr = btrfs_setattr, | |
fdebe2bd | 7435 | .permission = btrfs_permission, |
95819c05 CH |
7436 | .setxattr = btrfs_setxattr, |
7437 | .getxattr = btrfs_getxattr, | |
33268eaf | 7438 | .listxattr = btrfs_listxattr, |
95819c05 | 7439 | .removexattr = btrfs_removexattr, |
178ea735 | 7440 | .check_acl = btrfs_check_acl, |
618e21d5 | 7441 | }; |
6e1d5dcc | 7442 | static const struct inode_operations btrfs_symlink_inode_operations = { |
39279cc3 CM |
7443 | .readlink = generic_readlink, |
7444 | .follow_link = page_follow_link_light, | |
7445 | .put_link = page_put_link, | |
f209561a | 7446 | .getattr = btrfs_getattr, |
fdebe2bd | 7447 | .permission = btrfs_permission, |
0279b4cd JO |
7448 | .setxattr = btrfs_setxattr, |
7449 | .getxattr = btrfs_getxattr, | |
7450 | .listxattr = btrfs_listxattr, | |
7451 | .removexattr = btrfs_removexattr, | |
178ea735 | 7452 | .check_acl = btrfs_check_acl, |
39279cc3 | 7453 | }; |
76dda93c | 7454 | |
82d339d9 | 7455 | const struct dentry_operations btrfs_dentry_operations = { |
76dda93c YZ |
7456 | .d_delete = btrfs_dentry_delete, |
7457 | }; |