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> |
4b4e25f2 | 39 | #include "compat.h" |
39279cc3 CM |
40 | #include "ctree.h" |
41 | #include "disk-io.h" | |
42 | #include "transaction.h" | |
43 | #include "btrfs_inode.h" | |
44 | #include "ioctl.h" | |
45 | #include "print-tree.h" | |
0b86a832 | 46 | #include "volumes.h" |
e6dcd2dc | 47 | #include "ordered-data.h" |
95819c05 | 48 | #include "xattr.h" |
e02119d5 | 49 | #include "tree-log.h" |
c8b97818 | 50 | #include "compression.h" |
b4ce94de | 51 | #include "locking.h" |
39279cc3 CM |
52 | |
53 | struct btrfs_iget_args { | |
54 | u64 ino; | |
55 | struct btrfs_root *root; | |
56 | }; | |
57 | ||
6e1d5dcc AD |
58 | static const struct inode_operations btrfs_dir_inode_operations; |
59 | static const struct inode_operations btrfs_symlink_inode_operations; | |
60 | static const struct inode_operations btrfs_dir_ro_inode_operations; | |
61 | static const struct inode_operations btrfs_special_inode_operations; | |
62 | static const struct inode_operations btrfs_file_inode_operations; | |
7f09410b AD |
63 | static const struct address_space_operations btrfs_aops; |
64 | static const struct address_space_operations btrfs_symlink_aops; | |
828c0950 | 65 | static const struct file_operations btrfs_dir_file_operations; |
d1310b2e | 66 | static struct extent_io_ops btrfs_extent_io_ops; |
39279cc3 CM |
67 | |
68 | static struct kmem_cache *btrfs_inode_cachep; | |
69 | struct kmem_cache *btrfs_trans_handle_cachep; | |
70 | struct kmem_cache *btrfs_transaction_cachep; | |
39279cc3 CM |
71 | struct kmem_cache *btrfs_path_cachep; |
72 | ||
73 | #define S_SHIFT 12 | |
74 | static unsigned char btrfs_type_by_mode[S_IFMT >> S_SHIFT] = { | |
75 | [S_IFREG >> S_SHIFT] = BTRFS_FT_REG_FILE, | |
76 | [S_IFDIR >> S_SHIFT] = BTRFS_FT_DIR, | |
77 | [S_IFCHR >> S_SHIFT] = BTRFS_FT_CHRDEV, | |
78 | [S_IFBLK >> S_SHIFT] = BTRFS_FT_BLKDEV, | |
79 | [S_IFIFO >> S_SHIFT] = BTRFS_FT_FIFO, | |
80 | [S_IFSOCK >> S_SHIFT] = BTRFS_FT_SOCK, | |
81 | [S_IFLNK >> S_SHIFT] = BTRFS_FT_SYMLINK, | |
82 | }; | |
83 | ||
7b128766 | 84 | static void btrfs_truncate(struct inode *inode); |
c8b97818 | 85 | static int btrfs_finish_ordered_io(struct inode *inode, u64 start, u64 end); |
771ed689 CM |
86 | static noinline int cow_file_range(struct inode *inode, |
87 | struct page *locked_page, | |
88 | u64 start, u64 end, int *page_started, | |
89 | unsigned long *nr_written, int unlock); | |
7b128766 | 90 | |
0279b4cd JO |
91 | static int btrfs_init_inode_security(struct inode *inode, struct inode *dir) |
92 | { | |
93 | int err; | |
94 | ||
95 | err = btrfs_init_acl(inode, dir); | |
96 | if (!err) | |
97 | err = btrfs_xattr_security_init(inode, dir); | |
98 | return err; | |
99 | } | |
100 | ||
c8b97818 CM |
101 | /* |
102 | * this does all the hard work for inserting an inline extent into | |
103 | * the btree. The caller should have done a btrfs_drop_extents so that | |
104 | * no overlapping inline items exist in the btree | |
105 | */ | |
d397712b | 106 | static noinline int insert_inline_extent(struct btrfs_trans_handle *trans, |
c8b97818 CM |
107 | struct btrfs_root *root, struct inode *inode, |
108 | u64 start, size_t size, size_t compressed_size, | |
109 | struct page **compressed_pages) | |
110 | { | |
111 | struct btrfs_key key; | |
112 | struct btrfs_path *path; | |
113 | struct extent_buffer *leaf; | |
114 | struct page *page = NULL; | |
115 | char *kaddr; | |
116 | unsigned long ptr; | |
117 | struct btrfs_file_extent_item *ei; | |
118 | int err = 0; | |
119 | int ret; | |
120 | size_t cur_size = size; | |
121 | size_t datasize; | |
122 | unsigned long offset; | |
123 | int use_compress = 0; | |
124 | ||
125 | if (compressed_size && compressed_pages) { | |
126 | use_compress = 1; | |
127 | cur_size = compressed_size; | |
128 | } | |
129 | ||
d397712b CM |
130 | path = btrfs_alloc_path(); |
131 | if (!path) | |
c8b97818 CM |
132 | return -ENOMEM; |
133 | ||
b9473439 | 134 | path->leave_spinning = 1; |
c8b97818 CM |
135 | btrfs_set_trans_block_group(trans, inode); |
136 | ||
137 | key.objectid = inode->i_ino; | |
138 | key.offset = start; | |
139 | btrfs_set_key_type(&key, BTRFS_EXTENT_DATA_KEY); | |
c8b97818 CM |
140 | datasize = btrfs_file_extent_calc_inline_size(cur_size); |
141 | ||
142 | inode_add_bytes(inode, size); | |
143 | ret = btrfs_insert_empty_item(trans, root, path, &key, | |
144 | datasize); | |
145 | BUG_ON(ret); | |
146 | if (ret) { | |
147 | err = ret; | |
c8b97818 CM |
148 | goto fail; |
149 | } | |
150 | leaf = path->nodes[0]; | |
151 | ei = btrfs_item_ptr(leaf, path->slots[0], | |
152 | struct btrfs_file_extent_item); | |
153 | btrfs_set_file_extent_generation(leaf, ei, trans->transid); | |
154 | btrfs_set_file_extent_type(leaf, ei, BTRFS_FILE_EXTENT_INLINE); | |
155 | btrfs_set_file_extent_encryption(leaf, ei, 0); | |
156 | btrfs_set_file_extent_other_encoding(leaf, ei, 0); | |
157 | btrfs_set_file_extent_ram_bytes(leaf, ei, size); | |
158 | ptr = btrfs_file_extent_inline_start(ei); | |
159 | ||
160 | if (use_compress) { | |
161 | struct page *cpage; | |
162 | int i = 0; | |
d397712b | 163 | while (compressed_size > 0) { |
c8b97818 | 164 | cpage = compressed_pages[i]; |
5b050f04 | 165 | cur_size = min_t(unsigned long, compressed_size, |
c8b97818 CM |
166 | PAGE_CACHE_SIZE); |
167 | ||
b9473439 | 168 | kaddr = kmap_atomic(cpage, KM_USER0); |
c8b97818 | 169 | write_extent_buffer(leaf, kaddr, ptr, cur_size); |
b9473439 | 170 | kunmap_atomic(kaddr, KM_USER0); |
c8b97818 CM |
171 | |
172 | i++; | |
173 | ptr += cur_size; | |
174 | compressed_size -= cur_size; | |
175 | } | |
176 | btrfs_set_file_extent_compression(leaf, ei, | |
177 | BTRFS_COMPRESS_ZLIB); | |
178 | } else { | |
179 | page = find_get_page(inode->i_mapping, | |
180 | start >> PAGE_CACHE_SHIFT); | |
181 | btrfs_set_file_extent_compression(leaf, ei, 0); | |
182 | kaddr = kmap_atomic(page, KM_USER0); | |
183 | offset = start & (PAGE_CACHE_SIZE - 1); | |
184 | write_extent_buffer(leaf, kaddr + offset, ptr, size); | |
185 | kunmap_atomic(kaddr, KM_USER0); | |
186 | page_cache_release(page); | |
187 | } | |
188 | btrfs_mark_buffer_dirty(leaf); | |
189 | btrfs_free_path(path); | |
190 | ||
c2167754 YZ |
191 | /* |
192 | * we're an inline extent, so nobody can | |
193 | * extend the file past i_size without locking | |
194 | * a page we already have locked. | |
195 | * | |
196 | * We must do any isize and inode updates | |
197 | * before we unlock the pages. Otherwise we | |
198 | * could end up racing with unlink. | |
199 | */ | |
c8b97818 CM |
200 | BTRFS_I(inode)->disk_i_size = inode->i_size; |
201 | btrfs_update_inode(trans, root, inode); | |
c2167754 | 202 | |
c8b97818 CM |
203 | return 0; |
204 | fail: | |
205 | btrfs_free_path(path); | |
206 | return err; | |
207 | } | |
208 | ||
209 | ||
210 | /* | |
211 | * conditionally insert an inline extent into the file. This | |
212 | * does the checks required to make sure the data is small enough | |
213 | * to fit as an inline extent. | |
214 | */ | |
7f366cfe | 215 | static noinline int cow_file_range_inline(struct btrfs_trans_handle *trans, |
c8b97818 CM |
216 | struct btrfs_root *root, |
217 | struct inode *inode, u64 start, u64 end, | |
218 | size_t compressed_size, | |
219 | struct page **compressed_pages) | |
220 | { | |
221 | u64 isize = i_size_read(inode); | |
222 | u64 actual_end = min(end + 1, isize); | |
223 | u64 inline_len = actual_end - start; | |
224 | u64 aligned_end = (end + root->sectorsize - 1) & | |
225 | ~((u64)root->sectorsize - 1); | |
226 | u64 hint_byte; | |
227 | u64 data_len = inline_len; | |
228 | int ret; | |
229 | ||
230 | if (compressed_size) | |
231 | data_len = compressed_size; | |
232 | ||
233 | if (start > 0 || | |
70b99e69 | 234 | actual_end >= PAGE_CACHE_SIZE || |
c8b97818 CM |
235 | data_len >= BTRFS_MAX_INLINE_DATA_SIZE(root) || |
236 | (!compressed_size && | |
237 | (actual_end & (root->sectorsize - 1)) == 0) || | |
238 | end + 1 < isize || | |
239 | data_len > root->fs_info->max_inline) { | |
240 | return 1; | |
241 | } | |
242 | ||
920bbbfb | 243 | ret = btrfs_drop_extents(trans, inode, start, aligned_end, |
a1ed835e | 244 | &hint_byte, 1); |
c8b97818 CM |
245 | BUG_ON(ret); |
246 | ||
247 | if (isize > actual_end) | |
248 | inline_len = min_t(u64, isize, actual_end); | |
249 | ret = insert_inline_extent(trans, root, inode, start, | |
250 | inline_len, compressed_size, | |
251 | compressed_pages); | |
252 | BUG_ON(ret); | |
a1ed835e | 253 | btrfs_drop_extent_cache(inode, start, aligned_end - 1, 0); |
c8b97818 CM |
254 | return 0; |
255 | } | |
256 | ||
771ed689 CM |
257 | struct async_extent { |
258 | u64 start; | |
259 | u64 ram_size; | |
260 | u64 compressed_size; | |
261 | struct page **pages; | |
262 | unsigned long nr_pages; | |
263 | struct list_head list; | |
264 | }; | |
265 | ||
266 | struct async_cow { | |
267 | struct inode *inode; | |
268 | struct btrfs_root *root; | |
269 | struct page *locked_page; | |
270 | u64 start; | |
271 | u64 end; | |
272 | struct list_head extents; | |
273 | struct btrfs_work work; | |
274 | }; | |
275 | ||
276 | static noinline int add_async_extent(struct async_cow *cow, | |
277 | u64 start, u64 ram_size, | |
278 | u64 compressed_size, | |
279 | struct page **pages, | |
280 | unsigned long nr_pages) | |
281 | { | |
282 | struct async_extent *async_extent; | |
283 | ||
284 | async_extent = kmalloc(sizeof(*async_extent), GFP_NOFS); | |
285 | async_extent->start = start; | |
286 | async_extent->ram_size = ram_size; | |
287 | async_extent->compressed_size = compressed_size; | |
288 | async_extent->pages = pages; | |
289 | async_extent->nr_pages = nr_pages; | |
290 | list_add_tail(&async_extent->list, &cow->extents); | |
291 | return 0; | |
292 | } | |
293 | ||
d352ac68 | 294 | /* |
771ed689 CM |
295 | * we create compressed extents in two phases. The first |
296 | * phase compresses a range of pages that have already been | |
297 | * locked (both pages and state bits are locked). | |
c8b97818 | 298 | * |
771ed689 CM |
299 | * This is done inside an ordered work queue, and the compression |
300 | * is spread across many cpus. The actual IO submission is step | |
301 | * two, and the ordered work queue takes care of making sure that | |
302 | * happens in the same order things were put onto the queue by | |
303 | * writepages and friends. | |
c8b97818 | 304 | * |
771ed689 CM |
305 | * If this code finds it can't get good compression, it puts an |
306 | * entry onto the work queue to write the uncompressed bytes. This | |
307 | * makes sure that both compressed inodes and uncompressed inodes | |
308 | * are written in the same order that pdflush sent them down. | |
d352ac68 | 309 | */ |
771ed689 CM |
310 | static noinline int compress_file_range(struct inode *inode, |
311 | struct page *locked_page, | |
312 | u64 start, u64 end, | |
313 | struct async_cow *async_cow, | |
314 | int *num_added) | |
b888db2b CM |
315 | { |
316 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
317 | struct btrfs_trans_handle *trans; | |
db94535d | 318 | u64 num_bytes; |
c8b97818 CM |
319 | u64 orig_start; |
320 | u64 disk_num_bytes; | |
db94535d | 321 | u64 blocksize = root->sectorsize; |
c8b97818 | 322 | u64 actual_end; |
42dc7bab | 323 | u64 isize = i_size_read(inode); |
e6dcd2dc | 324 | int ret = 0; |
c8b97818 CM |
325 | struct page **pages = NULL; |
326 | unsigned long nr_pages; | |
327 | unsigned long nr_pages_ret = 0; | |
328 | unsigned long total_compressed = 0; | |
329 | unsigned long total_in = 0; | |
330 | unsigned long max_compressed = 128 * 1024; | |
771ed689 | 331 | unsigned long max_uncompressed = 128 * 1024; |
c8b97818 CM |
332 | int i; |
333 | int will_compress; | |
b888db2b | 334 | |
c8b97818 CM |
335 | orig_start = start; |
336 | ||
42dc7bab | 337 | actual_end = min_t(u64, isize, end + 1); |
c8b97818 CM |
338 | again: |
339 | will_compress = 0; | |
340 | nr_pages = (end >> PAGE_CACHE_SHIFT) - (start >> PAGE_CACHE_SHIFT) + 1; | |
341 | nr_pages = min(nr_pages, (128 * 1024UL) / PAGE_CACHE_SIZE); | |
be20aa9d | 342 | |
f03d9301 CM |
343 | /* |
344 | * we don't want to send crud past the end of i_size through | |
345 | * compression, that's just a waste of CPU time. So, if the | |
346 | * end of the file is before the start of our current | |
347 | * requested range of bytes, we bail out to the uncompressed | |
348 | * cleanup code that can deal with all of this. | |
349 | * | |
350 | * It isn't really the fastest way to fix things, but this is a | |
351 | * very uncommon corner. | |
352 | */ | |
353 | if (actual_end <= start) | |
354 | goto cleanup_and_bail_uncompressed; | |
355 | ||
c8b97818 CM |
356 | total_compressed = actual_end - start; |
357 | ||
358 | /* we want to make sure that amount of ram required to uncompress | |
359 | * an extent is reasonable, so we limit the total size in ram | |
771ed689 CM |
360 | * of a compressed extent to 128k. This is a crucial number |
361 | * because it also controls how easily we can spread reads across | |
362 | * cpus for decompression. | |
363 | * | |
364 | * We also want to make sure the amount of IO required to do | |
365 | * a random read is reasonably small, so we limit the size of | |
366 | * a compressed extent to 128k. | |
c8b97818 CM |
367 | */ |
368 | total_compressed = min(total_compressed, max_uncompressed); | |
db94535d | 369 | num_bytes = (end - start + blocksize) & ~(blocksize - 1); |
be20aa9d | 370 | num_bytes = max(blocksize, num_bytes); |
c8b97818 CM |
371 | disk_num_bytes = num_bytes; |
372 | total_in = 0; | |
373 | ret = 0; | |
db94535d | 374 | |
771ed689 CM |
375 | /* |
376 | * we do compression for mount -o compress and when the | |
377 | * inode has not been flagged as nocompress. This flag can | |
378 | * change at any time if we discover bad compression ratios. | |
c8b97818 | 379 | */ |
6cbff00f | 380 | if (!(BTRFS_I(inode)->flags & BTRFS_INODE_NOCOMPRESS) && |
c8b97818 CM |
381 | btrfs_test_opt(root, COMPRESS)) { |
382 | WARN_ON(pages); | |
cfbc246e | 383 | pages = kzalloc(sizeof(struct page *) * nr_pages, GFP_NOFS); |
c8b97818 | 384 | |
c8b97818 CM |
385 | ret = btrfs_zlib_compress_pages(inode->i_mapping, start, |
386 | total_compressed, pages, | |
387 | nr_pages, &nr_pages_ret, | |
388 | &total_in, | |
389 | &total_compressed, | |
390 | max_compressed); | |
391 | ||
392 | if (!ret) { | |
393 | unsigned long offset = total_compressed & | |
394 | (PAGE_CACHE_SIZE - 1); | |
395 | struct page *page = pages[nr_pages_ret - 1]; | |
396 | char *kaddr; | |
397 | ||
398 | /* zero the tail end of the last page, we might be | |
399 | * sending it down to disk | |
400 | */ | |
401 | if (offset) { | |
402 | kaddr = kmap_atomic(page, KM_USER0); | |
403 | memset(kaddr + offset, 0, | |
404 | PAGE_CACHE_SIZE - offset); | |
405 | kunmap_atomic(kaddr, KM_USER0); | |
406 | } | |
407 | will_compress = 1; | |
408 | } | |
409 | } | |
410 | if (start == 0) { | |
771ed689 CM |
411 | trans = btrfs_join_transaction(root, 1); |
412 | BUG_ON(!trans); | |
413 | btrfs_set_trans_block_group(trans, inode); | |
414 | ||
c8b97818 | 415 | /* lets try to make an inline extent */ |
771ed689 | 416 | if (ret || total_in < (actual_end - start)) { |
c8b97818 | 417 | /* we didn't compress the entire range, try |
771ed689 | 418 | * to make an uncompressed inline extent. |
c8b97818 CM |
419 | */ |
420 | ret = cow_file_range_inline(trans, root, inode, | |
421 | start, end, 0, NULL); | |
422 | } else { | |
771ed689 | 423 | /* try making a compressed inline extent */ |
c8b97818 CM |
424 | ret = cow_file_range_inline(trans, root, inode, |
425 | start, end, | |
426 | total_compressed, pages); | |
427 | } | |
428 | if (ret == 0) { | |
771ed689 CM |
429 | /* |
430 | * inline extent creation worked, we don't need | |
431 | * to create any more async work items. Unlock | |
432 | * and free up our temp pages. | |
433 | */ | |
c8b97818 | 434 | extent_clear_unlock_delalloc(inode, |
a791e35e CM |
435 | &BTRFS_I(inode)->io_tree, |
436 | start, end, NULL, | |
437 | EXTENT_CLEAR_UNLOCK_PAGE | EXTENT_CLEAR_DIRTY | | |
a3429ab7 | 438 | EXTENT_CLEAR_DELALLOC | |
32c00aff | 439 | EXTENT_CLEAR_ACCOUNTING | |
a791e35e | 440 | EXTENT_SET_WRITEBACK | EXTENT_END_WRITEBACK); |
c2167754 YZ |
441 | |
442 | btrfs_end_transaction(trans, root); | |
c8b97818 CM |
443 | goto free_pages_out; |
444 | } | |
c2167754 | 445 | btrfs_end_transaction(trans, root); |
c8b97818 CM |
446 | } |
447 | ||
448 | if (will_compress) { | |
449 | /* | |
450 | * we aren't doing an inline extent round the compressed size | |
451 | * up to a block size boundary so the allocator does sane | |
452 | * things | |
453 | */ | |
454 | total_compressed = (total_compressed + blocksize - 1) & | |
455 | ~(blocksize - 1); | |
456 | ||
457 | /* | |
458 | * one last check to make sure the compression is really a | |
459 | * win, compare the page count read with the blocks on disk | |
460 | */ | |
461 | total_in = (total_in + PAGE_CACHE_SIZE - 1) & | |
462 | ~(PAGE_CACHE_SIZE - 1); | |
463 | if (total_compressed >= total_in) { | |
464 | will_compress = 0; | |
465 | } else { | |
466 | disk_num_bytes = total_compressed; | |
467 | num_bytes = total_in; | |
468 | } | |
469 | } | |
470 | if (!will_compress && pages) { | |
471 | /* | |
472 | * the compression code ran but failed to make things smaller, | |
473 | * free any pages it allocated and our page pointer array | |
474 | */ | |
475 | for (i = 0; i < nr_pages_ret; i++) { | |
70b99e69 | 476 | WARN_ON(pages[i]->mapping); |
c8b97818 CM |
477 | page_cache_release(pages[i]); |
478 | } | |
479 | kfree(pages); | |
480 | pages = NULL; | |
481 | total_compressed = 0; | |
482 | nr_pages_ret = 0; | |
483 | ||
484 | /* flag the file so we don't compress in the future */ | |
6cbff00f | 485 | BTRFS_I(inode)->flags |= BTRFS_INODE_NOCOMPRESS; |
c8b97818 | 486 | } |
771ed689 CM |
487 | if (will_compress) { |
488 | *num_added += 1; | |
c8b97818 | 489 | |
771ed689 CM |
490 | /* the async work queues will take care of doing actual |
491 | * allocation on disk for these compressed pages, | |
492 | * and will submit them to the elevator. | |
493 | */ | |
494 | add_async_extent(async_cow, start, num_bytes, | |
495 | total_compressed, pages, nr_pages_ret); | |
179e29e4 | 496 | |
42dc7bab | 497 | if (start + num_bytes < end && start + num_bytes < actual_end) { |
771ed689 CM |
498 | start += num_bytes; |
499 | pages = NULL; | |
500 | cond_resched(); | |
501 | goto again; | |
502 | } | |
503 | } else { | |
f03d9301 | 504 | cleanup_and_bail_uncompressed: |
771ed689 CM |
505 | /* |
506 | * No compression, but we still need to write the pages in | |
507 | * the file we've been given so far. redirty the locked | |
508 | * page if it corresponds to our extent and set things up | |
509 | * for the async work queue to run cow_file_range to do | |
510 | * the normal delalloc dance | |
511 | */ | |
512 | if (page_offset(locked_page) >= start && | |
513 | page_offset(locked_page) <= end) { | |
514 | __set_page_dirty_nobuffers(locked_page); | |
515 | /* unlocked later on in the async handlers */ | |
516 | } | |
517 | add_async_extent(async_cow, start, end - start + 1, 0, NULL, 0); | |
518 | *num_added += 1; | |
519 | } | |
3b951516 | 520 | |
771ed689 CM |
521 | out: |
522 | return 0; | |
523 | ||
524 | free_pages_out: | |
525 | for (i = 0; i < nr_pages_ret; i++) { | |
526 | WARN_ON(pages[i]->mapping); | |
527 | page_cache_release(pages[i]); | |
528 | } | |
d397712b | 529 | kfree(pages); |
771ed689 CM |
530 | |
531 | goto out; | |
532 | } | |
533 | ||
534 | /* | |
535 | * phase two of compressed writeback. This is the ordered portion | |
536 | * of the code, which only gets called in the order the work was | |
537 | * queued. We walk all the async extents created by compress_file_range | |
538 | * and send them down to the disk. | |
539 | */ | |
540 | static noinline int submit_compressed_extents(struct inode *inode, | |
541 | struct async_cow *async_cow) | |
542 | { | |
543 | struct async_extent *async_extent; | |
544 | u64 alloc_hint = 0; | |
545 | struct btrfs_trans_handle *trans; | |
546 | struct btrfs_key ins; | |
547 | struct extent_map *em; | |
548 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
549 | struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree; | |
550 | struct extent_io_tree *io_tree; | |
f5a84ee3 | 551 | int ret = 0; |
771ed689 CM |
552 | |
553 | if (list_empty(&async_cow->extents)) | |
554 | return 0; | |
555 | ||
771ed689 | 556 | |
d397712b | 557 | while (!list_empty(&async_cow->extents)) { |
771ed689 CM |
558 | async_extent = list_entry(async_cow->extents.next, |
559 | struct async_extent, list); | |
560 | list_del(&async_extent->list); | |
c8b97818 | 561 | |
771ed689 CM |
562 | io_tree = &BTRFS_I(inode)->io_tree; |
563 | ||
f5a84ee3 | 564 | retry: |
771ed689 CM |
565 | /* did the compression code fall back to uncompressed IO? */ |
566 | if (!async_extent->pages) { | |
567 | int page_started = 0; | |
568 | unsigned long nr_written = 0; | |
569 | ||
570 | lock_extent(io_tree, async_extent->start, | |
d397712b CM |
571 | async_extent->start + |
572 | async_extent->ram_size - 1, GFP_NOFS); | |
771ed689 CM |
573 | |
574 | /* allocate blocks */ | |
f5a84ee3 JB |
575 | ret = cow_file_range(inode, async_cow->locked_page, |
576 | async_extent->start, | |
577 | async_extent->start + | |
578 | async_extent->ram_size - 1, | |
579 | &page_started, &nr_written, 0); | |
771ed689 CM |
580 | |
581 | /* | |
582 | * if page_started, cow_file_range inserted an | |
583 | * inline extent and took care of all the unlocking | |
584 | * and IO for us. Otherwise, we need to submit | |
585 | * all those pages down to the drive. | |
586 | */ | |
f5a84ee3 | 587 | if (!page_started && !ret) |
771ed689 CM |
588 | extent_write_locked_range(io_tree, |
589 | inode, async_extent->start, | |
d397712b | 590 | async_extent->start + |
771ed689 CM |
591 | async_extent->ram_size - 1, |
592 | btrfs_get_extent, | |
593 | WB_SYNC_ALL); | |
594 | kfree(async_extent); | |
595 | cond_resched(); | |
596 | continue; | |
597 | } | |
598 | ||
599 | lock_extent(io_tree, async_extent->start, | |
600 | async_extent->start + async_extent->ram_size - 1, | |
601 | GFP_NOFS); | |
771ed689 | 602 | |
c2167754 | 603 | trans = btrfs_join_transaction(root, 1); |
771ed689 CM |
604 | ret = btrfs_reserve_extent(trans, root, |
605 | async_extent->compressed_size, | |
606 | async_extent->compressed_size, | |
607 | 0, alloc_hint, | |
608 | (u64)-1, &ins, 1); | |
c2167754 YZ |
609 | btrfs_end_transaction(trans, root); |
610 | ||
f5a84ee3 JB |
611 | if (ret) { |
612 | int i; | |
613 | for (i = 0; i < async_extent->nr_pages; i++) { | |
614 | WARN_ON(async_extent->pages[i]->mapping); | |
615 | page_cache_release(async_extent->pages[i]); | |
616 | } | |
617 | kfree(async_extent->pages); | |
618 | async_extent->nr_pages = 0; | |
619 | async_extent->pages = NULL; | |
620 | unlock_extent(io_tree, async_extent->start, | |
621 | async_extent->start + | |
622 | async_extent->ram_size - 1, GFP_NOFS); | |
623 | goto retry; | |
624 | } | |
625 | ||
c2167754 YZ |
626 | /* |
627 | * here we're doing allocation and writeback of the | |
628 | * compressed pages | |
629 | */ | |
630 | btrfs_drop_extent_cache(inode, async_extent->start, | |
631 | async_extent->start + | |
632 | async_extent->ram_size - 1, 0); | |
633 | ||
771ed689 CM |
634 | em = alloc_extent_map(GFP_NOFS); |
635 | em->start = async_extent->start; | |
636 | em->len = async_extent->ram_size; | |
445a6944 | 637 | em->orig_start = em->start; |
c8b97818 | 638 | |
771ed689 CM |
639 | em->block_start = ins.objectid; |
640 | em->block_len = ins.offset; | |
641 | em->bdev = root->fs_info->fs_devices->latest_bdev; | |
642 | set_bit(EXTENT_FLAG_PINNED, &em->flags); | |
643 | set_bit(EXTENT_FLAG_COMPRESSED, &em->flags); | |
644 | ||
d397712b | 645 | while (1) { |
890871be | 646 | write_lock(&em_tree->lock); |
771ed689 | 647 | ret = add_extent_mapping(em_tree, em); |
890871be | 648 | write_unlock(&em_tree->lock); |
771ed689 CM |
649 | if (ret != -EEXIST) { |
650 | free_extent_map(em); | |
651 | break; | |
652 | } | |
653 | btrfs_drop_extent_cache(inode, async_extent->start, | |
654 | async_extent->start + | |
655 | async_extent->ram_size - 1, 0); | |
656 | } | |
657 | ||
658 | ret = btrfs_add_ordered_extent(inode, async_extent->start, | |
659 | ins.objectid, | |
660 | async_extent->ram_size, | |
661 | ins.offset, | |
662 | BTRFS_ORDERED_COMPRESSED); | |
663 | BUG_ON(ret); | |
664 | ||
771ed689 CM |
665 | /* |
666 | * clear dirty, set writeback and unlock the pages. | |
667 | */ | |
668 | extent_clear_unlock_delalloc(inode, | |
a791e35e CM |
669 | &BTRFS_I(inode)->io_tree, |
670 | async_extent->start, | |
671 | async_extent->start + | |
672 | async_extent->ram_size - 1, | |
673 | NULL, EXTENT_CLEAR_UNLOCK_PAGE | | |
674 | EXTENT_CLEAR_UNLOCK | | |
a3429ab7 | 675 | EXTENT_CLEAR_DELALLOC | |
a791e35e | 676 | EXTENT_CLEAR_DIRTY | EXTENT_SET_WRITEBACK); |
771ed689 CM |
677 | |
678 | ret = btrfs_submit_compressed_write(inode, | |
d397712b CM |
679 | async_extent->start, |
680 | async_extent->ram_size, | |
681 | ins.objectid, | |
682 | ins.offset, async_extent->pages, | |
683 | async_extent->nr_pages); | |
771ed689 CM |
684 | |
685 | BUG_ON(ret); | |
771ed689 CM |
686 | alloc_hint = ins.objectid + ins.offset; |
687 | kfree(async_extent); | |
688 | cond_resched(); | |
689 | } | |
690 | ||
771ed689 CM |
691 | return 0; |
692 | } | |
693 | ||
694 | /* | |
695 | * when extent_io.c finds a delayed allocation range in the file, | |
696 | * the call backs end up in this code. The basic idea is to | |
697 | * allocate extents on disk for the range, and create ordered data structs | |
698 | * in ram to track those extents. | |
699 | * | |
700 | * locked_page is the page that writepage had locked already. We use | |
701 | * it to make sure we don't do extra locks or unlocks. | |
702 | * | |
703 | * *page_started is set to one if we unlock locked_page and do everything | |
704 | * required to start IO on it. It may be clean and already done with | |
705 | * IO when we return. | |
706 | */ | |
707 | static noinline int cow_file_range(struct inode *inode, | |
708 | struct page *locked_page, | |
709 | u64 start, u64 end, int *page_started, | |
710 | unsigned long *nr_written, | |
711 | int unlock) | |
712 | { | |
713 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
714 | struct btrfs_trans_handle *trans; | |
715 | u64 alloc_hint = 0; | |
716 | u64 num_bytes; | |
717 | unsigned long ram_size; | |
718 | u64 disk_num_bytes; | |
719 | u64 cur_alloc_size; | |
720 | u64 blocksize = root->sectorsize; | |
721 | u64 actual_end; | |
42dc7bab | 722 | u64 isize = i_size_read(inode); |
771ed689 CM |
723 | struct btrfs_key ins; |
724 | struct extent_map *em; | |
725 | struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree; | |
726 | int ret = 0; | |
727 | ||
728 | trans = btrfs_join_transaction(root, 1); | |
729 | BUG_ON(!trans); | |
730 | btrfs_set_trans_block_group(trans, inode); | |
731 | ||
42dc7bab | 732 | actual_end = min_t(u64, isize, end + 1); |
771ed689 CM |
733 | |
734 | num_bytes = (end - start + blocksize) & ~(blocksize - 1); | |
735 | num_bytes = max(blocksize, num_bytes); | |
736 | disk_num_bytes = num_bytes; | |
737 | ret = 0; | |
738 | ||
739 | if (start == 0) { | |
740 | /* lets try to make an inline extent */ | |
741 | ret = cow_file_range_inline(trans, root, inode, | |
742 | start, end, 0, NULL); | |
743 | if (ret == 0) { | |
744 | extent_clear_unlock_delalloc(inode, | |
a791e35e CM |
745 | &BTRFS_I(inode)->io_tree, |
746 | start, end, NULL, | |
747 | EXTENT_CLEAR_UNLOCK_PAGE | | |
748 | EXTENT_CLEAR_UNLOCK | | |
749 | EXTENT_CLEAR_DELALLOC | | |
32c00aff | 750 | EXTENT_CLEAR_ACCOUNTING | |
a791e35e CM |
751 | EXTENT_CLEAR_DIRTY | |
752 | EXTENT_SET_WRITEBACK | | |
753 | EXTENT_END_WRITEBACK); | |
c2167754 | 754 | |
771ed689 CM |
755 | *nr_written = *nr_written + |
756 | (end - start + PAGE_CACHE_SIZE) / PAGE_CACHE_SIZE; | |
757 | *page_started = 1; | |
758 | ret = 0; | |
759 | goto out; | |
760 | } | |
761 | } | |
762 | ||
763 | BUG_ON(disk_num_bytes > | |
764 | btrfs_super_total_bytes(&root->fs_info->super_copy)); | |
765 | ||
b917b7c3 CM |
766 | |
767 | read_lock(&BTRFS_I(inode)->extent_tree.lock); | |
768 | em = search_extent_mapping(&BTRFS_I(inode)->extent_tree, | |
769 | start, num_bytes); | |
770 | if (em) { | |
6346c939 JB |
771 | /* |
772 | * if block start isn't an actual block number then find the | |
773 | * first block in this inode and use that as a hint. If that | |
774 | * block is also bogus then just don't worry about it. | |
775 | */ | |
776 | if (em->block_start >= EXTENT_MAP_LAST_BYTE) { | |
777 | free_extent_map(em); | |
778 | em = search_extent_mapping(em_tree, 0, 0); | |
779 | if (em && em->block_start < EXTENT_MAP_LAST_BYTE) | |
780 | alloc_hint = em->block_start; | |
781 | if (em) | |
782 | free_extent_map(em); | |
783 | } else { | |
784 | alloc_hint = em->block_start; | |
785 | free_extent_map(em); | |
786 | } | |
b917b7c3 CM |
787 | } |
788 | read_unlock(&BTRFS_I(inode)->extent_tree.lock); | |
771ed689 CM |
789 | btrfs_drop_extent_cache(inode, start, start + num_bytes - 1, 0); |
790 | ||
d397712b | 791 | while (disk_num_bytes > 0) { |
a791e35e CM |
792 | unsigned long op; |
793 | ||
c8b97818 | 794 | cur_alloc_size = min(disk_num_bytes, root->fs_info->max_extent); |
e6dcd2dc | 795 | ret = btrfs_reserve_extent(trans, root, cur_alloc_size, |
771ed689 | 796 | root->sectorsize, 0, alloc_hint, |
e6dcd2dc | 797 | (u64)-1, &ins, 1); |
d397712b CM |
798 | BUG_ON(ret); |
799 | ||
e6dcd2dc CM |
800 | em = alloc_extent_map(GFP_NOFS); |
801 | em->start = start; | |
445a6944 | 802 | em->orig_start = em->start; |
771ed689 CM |
803 | ram_size = ins.offset; |
804 | em->len = ins.offset; | |
c8b97818 | 805 | |
e6dcd2dc | 806 | em->block_start = ins.objectid; |
c8b97818 | 807 | em->block_len = ins.offset; |
e6dcd2dc | 808 | em->bdev = root->fs_info->fs_devices->latest_bdev; |
7f3c74fb | 809 | set_bit(EXTENT_FLAG_PINNED, &em->flags); |
c8b97818 | 810 | |
d397712b | 811 | while (1) { |
890871be | 812 | write_lock(&em_tree->lock); |
e6dcd2dc | 813 | ret = add_extent_mapping(em_tree, em); |
890871be | 814 | write_unlock(&em_tree->lock); |
e6dcd2dc CM |
815 | if (ret != -EEXIST) { |
816 | free_extent_map(em); | |
817 | break; | |
818 | } | |
819 | btrfs_drop_extent_cache(inode, start, | |
c8b97818 | 820 | start + ram_size - 1, 0); |
e6dcd2dc CM |
821 | } |
822 | ||
98d20f67 | 823 | cur_alloc_size = ins.offset; |
e6dcd2dc | 824 | ret = btrfs_add_ordered_extent(inode, start, ins.objectid, |
771ed689 | 825 | ram_size, cur_alloc_size, 0); |
e6dcd2dc | 826 | BUG_ON(ret); |
c8b97818 | 827 | |
17d217fe YZ |
828 | if (root->root_key.objectid == |
829 | BTRFS_DATA_RELOC_TREE_OBJECTID) { | |
830 | ret = btrfs_reloc_clone_csums(inode, start, | |
831 | cur_alloc_size); | |
832 | BUG_ON(ret); | |
833 | } | |
834 | ||
d397712b | 835 | if (disk_num_bytes < cur_alloc_size) |
3b951516 | 836 | break; |
d397712b | 837 | |
c8b97818 CM |
838 | /* we're not doing compressed IO, don't unlock the first |
839 | * page (which the caller expects to stay locked), don't | |
840 | * clear any dirty bits and don't set any writeback bits | |
8b62b72b CM |
841 | * |
842 | * Do set the Private2 bit so we know this page was properly | |
843 | * setup for writepage | |
c8b97818 | 844 | */ |
a791e35e CM |
845 | op = unlock ? EXTENT_CLEAR_UNLOCK_PAGE : 0; |
846 | op |= EXTENT_CLEAR_UNLOCK | EXTENT_CLEAR_DELALLOC | | |
847 | EXTENT_SET_PRIVATE2; | |
848 | ||
c8b97818 CM |
849 | extent_clear_unlock_delalloc(inode, &BTRFS_I(inode)->io_tree, |
850 | start, start + ram_size - 1, | |
a791e35e | 851 | locked_page, op); |
c8b97818 | 852 | disk_num_bytes -= cur_alloc_size; |
c59f8951 CM |
853 | num_bytes -= cur_alloc_size; |
854 | alloc_hint = ins.objectid + ins.offset; | |
855 | start += cur_alloc_size; | |
b888db2b | 856 | } |
b888db2b | 857 | out: |
771ed689 | 858 | ret = 0; |
b888db2b | 859 | btrfs_end_transaction(trans, root); |
c8b97818 | 860 | |
be20aa9d | 861 | return ret; |
771ed689 | 862 | } |
c8b97818 | 863 | |
771ed689 CM |
864 | /* |
865 | * work queue call back to started compression on a file and pages | |
866 | */ | |
867 | static noinline void async_cow_start(struct btrfs_work *work) | |
868 | { | |
869 | struct async_cow *async_cow; | |
870 | int num_added = 0; | |
871 | async_cow = container_of(work, struct async_cow, work); | |
872 | ||
873 | compress_file_range(async_cow->inode, async_cow->locked_page, | |
874 | async_cow->start, async_cow->end, async_cow, | |
875 | &num_added); | |
876 | if (num_added == 0) | |
877 | async_cow->inode = NULL; | |
878 | } | |
879 | ||
880 | /* | |
881 | * work queue call back to submit previously compressed pages | |
882 | */ | |
883 | static noinline void async_cow_submit(struct btrfs_work *work) | |
884 | { | |
885 | struct async_cow *async_cow; | |
886 | struct btrfs_root *root; | |
887 | unsigned long nr_pages; | |
888 | ||
889 | async_cow = container_of(work, struct async_cow, work); | |
890 | ||
891 | root = async_cow->root; | |
892 | nr_pages = (async_cow->end - async_cow->start + PAGE_CACHE_SIZE) >> | |
893 | PAGE_CACHE_SHIFT; | |
894 | ||
895 | atomic_sub(nr_pages, &root->fs_info->async_delalloc_pages); | |
896 | ||
897 | if (atomic_read(&root->fs_info->async_delalloc_pages) < | |
898 | 5 * 1042 * 1024 && | |
899 | waitqueue_active(&root->fs_info->async_submit_wait)) | |
900 | wake_up(&root->fs_info->async_submit_wait); | |
901 | ||
d397712b | 902 | if (async_cow->inode) |
771ed689 | 903 | submit_compressed_extents(async_cow->inode, async_cow); |
771ed689 | 904 | } |
c8b97818 | 905 | |
771ed689 CM |
906 | static noinline void async_cow_free(struct btrfs_work *work) |
907 | { | |
908 | struct async_cow *async_cow; | |
909 | async_cow = container_of(work, struct async_cow, work); | |
910 | kfree(async_cow); | |
911 | } | |
912 | ||
913 | static int cow_file_range_async(struct inode *inode, struct page *locked_page, | |
914 | u64 start, u64 end, int *page_started, | |
915 | unsigned long *nr_written) | |
916 | { | |
917 | struct async_cow *async_cow; | |
918 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
919 | unsigned long nr_pages; | |
920 | u64 cur_end; | |
921 | int limit = 10 * 1024 * 1042; | |
922 | ||
a3429ab7 CM |
923 | clear_extent_bit(&BTRFS_I(inode)->io_tree, start, end, EXTENT_LOCKED, |
924 | 1, 0, NULL, GFP_NOFS); | |
d397712b | 925 | while (start < end) { |
771ed689 CM |
926 | async_cow = kmalloc(sizeof(*async_cow), GFP_NOFS); |
927 | async_cow->inode = inode; | |
928 | async_cow->root = root; | |
929 | async_cow->locked_page = locked_page; | |
930 | async_cow->start = start; | |
931 | ||
6cbff00f | 932 | if (BTRFS_I(inode)->flags & BTRFS_INODE_NOCOMPRESS) |
771ed689 CM |
933 | cur_end = end; |
934 | else | |
935 | cur_end = min(end, start + 512 * 1024 - 1); | |
936 | ||
937 | async_cow->end = cur_end; | |
938 | INIT_LIST_HEAD(&async_cow->extents); | |
939 | ||
940 | async_cow->work.func = async_cow_start; | |
941 | async_cow->work.ordered_func = async_cow_submit; | |
942 | async_cow->work.ordered_free = async_cow_free; | |
943 | async_cow->work.flags = 0; | |
944 | ||
771ed689 CM |
945 | nr_pages = (cur_end - start + PAGE_CACHE_SIZE) >> |
946 | PAGE_CACHE_SHIFT; | |
947 | atomic_add(nr_pages, &root->fs_info->async_delalloc_pages); | |
948 | ||
949 | btrfs_queue_worker(&root->fs_info->delalloc_workers, | |
950 | &async_cow->work); | |
951 | ||
952 | if (atomic_read(&root->fs_info->async_delalloc_pages) > limit) { | |
953 | wait_event(root->fs_info->async_submit_wait, | |
954 | (atomic_read(&root->fs_info->async_delalloc_pages) < | |
955 | limit)); | |
956 | } | |
957 | ||
d397712b | 958 | while (atomic_read(&root->fs_info->async_submit_draining) && |
771ed689 CM |
959 | atomic_read(&root->fs_info->async_delalloc_pages)) { |
960 | wait_event(root->fs_info->async_submit_wait, | |
961 | (atomic_read(&root->fs_info->async_delalloc_pages) == | |
962 | 0)); | |
963 | } | |
964 | ||
965 | *nr_written += nr_pages; | |
966 | start = cur_end + 1; | |
967 | } | |
968 | *page_started = 1; | |
969 | return 0; | |
be20aa9d CM |
970 | } |
971 | ||
d397712b | 972 | static noinline int csum_exist_in_range(struct btrfs_root *root, |
17d217fe YZ |
973 | u64 bytenr, u64 num_bytes) |
974 | { | |
975 | int ret; | |
976 | struct btrfs_ordered_sum *sums; | |
977 | LIST_HEAD(list); | |
978 | ||
07d400a6 YZ |
979 | ret = btrfs_lookup_csums_range(root->fs_info->csum_root, bytenr, |
980 | bytenr + num_bytes - 1, &list); | |
17d217fe YZ |
981 | if (ret == 0 && list_empty(&list)) |
982 | return 0; | |
983 | ||
984 | while (!list_empty(&list)) { | |
985 | sums = list_entry(list.next, struct btrfs_ordered_sum, list); | |
986 | list_del(&sums->list); | |
987 | kfree(sums); | |
988 | } | |
989 | return 1; | |
990 | } | |
991 | ||
d352ac68 CM |
992 | /* |
993 | * when nowcow writeback call back. This checks for snapshots or COW copies | |
994 | * of the extents that exist in the file, and COWs the file as required. | |
995 | * | |
996 | * If no cow copies or snapshots exist, we write directly to the existing | |
997 | * blocks on disk | |
998 | */ | |
7f366cfe CM |
999 | static noinline int run_delalloc_nocow(struct inode *inode, |
1000 | struct page *locked_page, | |
771ed689 CM |
1001 | u64 start, u64 end, int *page_started, int force, |
1002 | unsigned long *nr_written) | |
be20aa9d | 1003 | { |
be20aa9d | 1004 | struct btrfs_root *root = BTRFS_I(inode)->root; |
7ea394f1 | 1005 | struct btrfs_trans_handle *trans; |
be20aa9d | 1006 | struct extent_buffer *leaf; |
be20aa9d | 1007 | struct btrfs_path *path; |
80ff3856 | 1008 | struct btrfs_file_extent_item *fi; |
be20aa9d | 1009 | struct btrfs_key found_key; |
80ff3856 YZ |
1010 | u64 cow_start; |
1011 | u64 cur_offset; | |
1012 | u64 extent_end; | |
5d4f98a2 | 1013 | u64 extent_offset; |
80ff3856 YZ |
1014 | u64 disk_bytenr; |
1015 | u64 num_bytes; | |
1016 | int extent_type; | |
1017 | int ret; | |
d899e052 | 1018 | int type; |
80ff3856 YZ |
1019 | int nocow; |
1020 | int check_prev = 1; | |
be20aa9d CM |
1021 | |
1022 | path = btrfs_alloc_path(); | |
1023 | BUG_ON(!path); | |
7ea394f1 YZ |
1024 | trans = btrfs_join_transaction(root, 1); |
1025 | BUG_ON(!trans); | |
be20aa9d | 1026 | |
80ff3856 YZ |
1027 | cow_start = (u64)-1; |
1028 | cur_offset = start; | |
1029 | while (1) { | |
1030 | ret = btrfs_lookup_file_extent(trans, root, path, inode->i_ino, | |
1031 | cur_offset, 0); | |
1032 | BUG_ON(ret < 0); | |
1033 | if (ret > 0 && path->slots[0] > 0 && check_prev) { | |
1034 | leaf = path->nodes[0]; | |
1035 | btrfs_item_key_to_cpu(leaf, &found_key, | |
1036 | path->slots[0] - 1); | |
1037 | if (found_key.objectid == inode->i_ino && | |
1038 | found_key.type == BTRFS_EXTENT_DATA_KEY) | |
1039 | path->slots[0]--; | |
1040 | } | |
1041 | check_prev = 0; | |
1042 | next_slot: | |
1043 | leaf = path->nodes[0]; | |
1044 | if (path->slots[0] >= btrfs_header_nritems(leaf)) { | |
1045 | ret = btrfs_next_leaf(root, path); | |
1046 | if (ret < 0) | |
1047 | BUG_ON(1); | |
1048 | if (ret > 0) | |
1049 | break; | |
1050 | leaf = path->nodes[0]; | |
1051 | } | |
be20aa9d | 1052 | |
80ff3856 YZ |
1053 | nocow = 0; |
1054 | disk_bytenr = 0; | |
17d217fe | 1055 | num_bytes = 0; |
80ff3856 YZ |
1056 | btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); |
1057 | ||
1058 | if (found_key.objectid > inode->i_ino || | |
1059 | found_key.type > BTRFS_EXTENT_DATA_KEY || | |
1060 | found_key.offset > end) | |
1061 | break; | |
1062 | ||
1063 | if (found_key.offset > cur_offset) { | |
1064 | extent_end = found_key.offset; | |
e9061e21 | 1065 | extent_type = 0; |
80ff3856 YZ |
1066 | goto out_check; |
1067 | } | |
1068 | ||
1069 | fi = btrfs_item_ptr(leaf, path->slots[0], | |
1070 | struct btrfs_file_extent_item); | |
1071 | extent_type = btrfs_file_extent_type(leaf, fi); | |
1072 | ||
d899e052 YZ |
1073 | if (extent_type == BTRFS_FILE_EXTENT_REG || |
1074 | extent_type == BTRFS_FILE_EXTENT_PREALLOC) { | |
80ff3856 | 1075 | disk_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); |
5d4f98a2 | 1076 | extent_offset = btrfs_file_extent_offset(leaf, fi); |
80ff3856 YZ |
1077 | extent_end = found_key.offset + |
1078 | btrfs_file_extent_num_bytes(leaf, fi); | |
1079 | if (extent_end <= start) { | |
1080 | path->slots[0]++; | |
1081 | goto next_slot; | |
1082 | } | |
17d217fe YZ |
1083 | if (disk_bytenr == 0) |
1084 | goto out_check; | |
80ff3856 YZ |
1085 | if (btrfs_file_extent_compression(leaf, fi) || |
1086 | btrfs_file_extent_encryption(leaf, fi) || | |
1087 | btrfs_file_extent_other_encoding(leaf, fi)) | |
1088 | goto out_check; | |
d899e052 YZ |
1089 | if (extent_type == BTRFS_FILE_EXTENT_REG && !force) |
1090 | goto out_check; | |
d2fb3437 | 1091 | if (btrfs_extent_readonly(root, disk_bytenr)) |
80ff3856 | 1092 | goto out_check; |
17d217fe | 1093 | if (btrfs_cross_ref_exist(trans, root, inode->i_ino, |
5d4f98a2 YZ |
1094 | found_key.offset - |
1095 | extent_offset, disk_bytenr)) | |
17d217fe | 1096 | goto out_check; |
5d4f98a2 | 1097 | disk_bytenr += extent_offset; |
17d217fe YZ |
1098 | disk_bytenr += cur_offset - found_key.offset; |
1099 | num_bytes = min(end + 1, extent_end) - cur_offset; | |
1100 | /* | |
1101 | * force cow if csum exists in the range. | |
1102 | * this ensure that csum for a given extent are | |
1103 | * either valid or do not exist. | |
1104 | */ | |
1105 | if (csum_exist_in_range(root, disk_bytenr, num_bytes)) | |
1106 | goto out_check; | |
80ff3856 YZ |
1107 | nocow = 1; |
1108 | } else if (extent_type == BTRFS_FILE_EXTENT_INLINE) { | |
1109 | extent_end = found_key.offset + | |
1110 | btrfs_file_extent_inline_len(leaf, fi); | |
1111 | extent_end = ALIGN(extent_end, root->sectorsize); | |
1112 | } else { | |
1113 | BUG_ON(1); | |
1114 | } | |
1115 | out_check: | |
1116 | if (extent_end <= start) { | |
1117 | path->slots[0]++; | |
1118 | goto next_slot; | |
1119 | } | |
1120 | if (!nocow) { | |
1121 | if (cow_start == (u64)-1) | |
1122 | cow_start = cur_offset; | |
1123 | cur_offset = extent_end; | |
1124 | if (cur_offset > end) | |
1125 | break; | |
1126 | path->slots[0]++; | |
1127 | goto next_slot; | |
7ea394f1 YZ |
1128 | } |
1129 | ||
1130 | btrfs_release_path(root, path); | |
80ff3856 YZ |
1131 | if (cow_start != (u64)-1) { |
1132 | ret = cow_file_range(inode, locked_page, cow_start, | |
771ed689 CM |
1133 | found_key.offset - 1, page_started, |
1134 | nr_written, 1); | |
80ff3856 YZ |
1135 | BUG_ON(ret); |
1136 | cow_start = (u64)-1; | |
7ea394f1 | 1137 | } |
80ff3856 | 1138 | |
d899e052 YZ |
1139 | if (extent_type == BTRFS_FILE_EXTENT_PREALLOC) { |
1140 | struct extent_map *em; | |
1141 | struct extent_map_tree *em_tree; | |
1142 | em_tree = &BTRFS_I(inode)->extent_tree; | |
1143 | em = alloc_extent_map(GFP_NOFS); | |
1144 | em->start = cur_offset; | |
445a6944 | 1145 | em->orig_start = em->start; |
d899e052 YZ |
1146 | em->len = num_bytes; |
1147 | em->block_len = num_bytes; | |
1148 | em->block_start = disk_bytenr; | |
1149 | em->bdev = root->fs_info->fs_devices->latest_bdev; | |
1150 | set_bit(EXTENT_FLAG_PINNED, &em->flags); | |
1151 | while (1) { | |
890871be | 1152 | write_lock(&em_tree->lock); |
d899e052 | 1153 | ret = add_extent_mapping(em_tree, em); |
890871be | 1154 | write_unlock(&em_tree->lock); |
d899e052 YZ |
1155 | if (ret != -EEXIST) { |
1156 | free_extent_map(em); | |
1157 | break; | |
1158 | } | |
1159 | btrfs_drop_extent_cache(inode, em->start, | |
1160 | em->start + em->len - 1, 0); | |
1161 | } | |
1162 | type = BTRFS_ORDERED_PREALLOC; | |
1163 | } else { | |
1164 | type = BTRFS_ORDERED_NOCOW; | |
1165 | } | |
80ff3856 YZ |
1166 | |
1167 | ret = btrfs_add_ordered_extent(inode, cur_offset, disk_bytenr, | |
d899e052 YZ |
1168 | num_bytes, num_bytes, type); |
1169 | BUG_ON(ret); | |
771ed689 | 1170 | |
d899e052 | 1171 | extent_clear_unlock_delalloc(inode, &BTRFS_I(inode)->io_tree, |
a791e35e CM |
1172 | cur_offset, cur_offset + num_bytes - 1, |
1173 | locked_page, EXTENT_CLEAR_UNLOCK_PAGE | | |
1174 | EXTENT_CLEAR_UNLOCK | EXTENT_CLEAR_DELALLOC | | |
1175 | EXTENT_SET_PRIVATE2); | |
80ff3856 YZ |
1176 | cur_offset = extent_end; |
1177 | if (cur_offset > end) | |
1178 | break; | |
be20aa9d | 1179 | } |
80ff3856 YZ |
1180 | btrfs_release_path(root, path); |
1181 | ||
1182 | if (cur_offset <= end && cow_start == (u64)-1) | |
1183 | cow_start = cur_offset; | |
1184 | if (cow_start != (u64)-1) { | |
1185 | ret = cow_file_range(inode, locked_page, cow_start, end, | |
771ed689 | 1186 | page_started, nr_written, 1); |
80ff3856 YZ |
1187 | BUG_ON(ret); |
1188 | } | |
1189 | ||
1190 | ret = btrfs_end_transaction(trans, root); | |
1191 | BUG_ON(ret); | |
7ea394f1 | 1192 | btrfs_free_path(path); |
80ff3856 | 1193 | return 0; |
be20aa9d CM |
1194 | } |
1195 | ||
d352ac68 CM |
1196 | /* |
1197 | * extent_io.c call back to do delayed allocation processing | |
1198 | */ | |
c8b97818 | 1199 | static int run_delalloc_range(struct inode *inode, struct page *locked_page, |
771ed689 CM |
1200 | u64 start, u64 end, int *page_started, |
1201 | unsigned long *nr_written) | |
be20aa9d | 1202 | { |
be20aa9d | 1203 | int ret; |
7f366cfe | 1204 | struct btrfs_root *root = BTRFS_I(inode)->root; |
a2135011 | 1205 | |
6cbff00f | 1206 | if (BTRFS_I(inode)->flags & BTRFS_INODE_NODATACOW) |
c8b97818 | 1207 | ret = run_delalloc_nocow(inode, locked_page, start, end, |
d397712b | 1208 | page_started, 1, nr_written); |
6cbff00f | 1209 | else if (BTRFS_I(inode)->flags & BTRFS_INODE_PREALLOC) |
d899e052 | 1210 | ret = run_delalloc_nocow(inode, locked_page, start, end, |
d397712b | 1211 | page_started, 0, nr_written); |
7f366cfe CM |
1212 | else if (!btrfs_test_opt(root, COMPRESS)) |
1213 | ret = cow_file_range(inode, locked_page, start, end, | |
1214 | page_started, nr_written, 1); | |
be20aa9d | 1215 | else |
771ed689 | 1216 | ret = cow_file_range_async(inode, locked_page, start, end, |
d397712b | 1217 | page_started, nr_written); |
b888db2b CM |
1218 | return ret; |
1219 | } | |
1220 | ||
9ed74f2d JB |
1221 | static int btrfs_split_extent_hook(struct inode *inode, |
1222 | struct extent_state *orig, u64 split) | |
1223 | { | |
1224 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
1225 | u64 size; | |
1226 | ||
1227 | if (!(orig->state & EXTENT_DELALLOC)) | |
1228 | return 0; | |
1229 | ||
1230 | size = orig->end - orig->start + 1; | |
1231 | if (size > root->fs_info->max_extent) { | |
1232 | u64 num_extents; | |
1233 | u64 new_size; | |
1234 | ||
1235 | new_size = orig->end - split + 1; | |
1236 | num_extents = div64_u64(size + root->fs_info->max_extent - 1, | |
1237 | root->fs_info->max_extent); | |
1238 | ||
1239 | /* | |
32c00aff JB |
1240 | * if we break a large extent up then leave oustanding_extents |
1241 | * be, since we've already accounted for the large extent. | |
9ed74f2d JB |
1242 | */ |
1243 | if (div64_u64(new_size + root->fs_info->max_extent - 1, | |
1244 | root->fs_info->max_extent) < num_extents) | |
1245 | return 0; | |
1246 | } | |
1247 | ||
32c00aff JB |
1248 | spin_lock(&BTRFS_I(inode)->accounting_lock); |
1249 | BTRFS_I(inode)->outstanding_extents++; | |
1250 | spin_unlock(&BTRFS_I(inode)->accounting_lock); | |
9ed74f2d JB |
1251 | |
1252 | return 0; | |
1253 | } | |
1254 | ||
1255 | /* | |
1256 | * extent_io.c merge_extent_hook, used to track merged delayed allocation | |
1257 | * extents so we can keep track of new extents that are just merged onto old | |
1258 | * extents, such as when we are doing sequential writes, so we can properly | |
1259 | * account for the metadata space we'll need. | |
1260 | */ | |
1261 | static int btrfs_merge_extent_hook(struct inode *inode, | |
1262 | struct extent_state *new, | |
1263 | struct extent_state *other) | |
1264 | { | |
1265 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
1266 | u64 new_size, old_size; | |
1267 | u64 num_extents; | |
1268 | ||
1269 | /* not delalloc, ignore it */ | |
1270 | if (!(other->state & EXTENT_DELALLOC)) | |
1271 | return 0; | |
1272 | ||
1273 | old_size = other->end - other->start + 1; | |
1274 | if (new->start < other->start) | |
1275 | new_size = other->end - new->start + 1; | |
1276 | else | |
1277 | new_size = new->end - other->start + 1; | |
1278 | ||
1279 | /* we're not bigger than the max, unreserve the space and go */ | |
1280 | if (new_size <= root->fs_info->max_extent) { | |
32c00aff JB |
1281 | spin_lock(&BTRFS_I(inode)->accounting_lock); |
1282 | BTRFS_I(inode)->outstanding_extents--; | |
1283 | spin_unlock(&BTRFS_I(inode)->accounting_lock); | |
9ed74f2d JB |
1284 | return 0; |
1285 | } | |
1286 | ||
1287 | /* | |
1288 | * If we grew by another max_extent, just return, we want to keep that | |
1289 | * reserved amount. | |
1290 | */ | |
1291 | num_extents = div64_u64(old_size + root->fs_info->max_extent - 1, | |
1292 | root->fs_info->max_extent); | |
1293 | if (div64_u64(new_size + root->fs_info->max_extent - 1, | |
1294 | root->fs_info->max_extent) > num_extents) | |
1295 | return 0; | |
1296 | ||
32c00aff JB |
1297 | spin_lock(&BTRFS_I(inode)->accounting_lock); |
1298 | BTRFS_I(inode)->outstanding_extents--; | |
1299 | spin_unlock(&BTRFS_I(inode)->accounting_lock); | |
9ed74f2d JB |
1300 | |
1301 | return 0; | |
1302 | } | |
1303 | ||
d352ac68 CM |
1304 | /* |
1305 | * extent_io.c set_bit_hook, used to track delayed allocation | |
1306 | * bytes in this file, and to maintain the list of inodes that | |
1307 | * have pending delalloc work to be done. | |
1308 | */ | |
b2950863 | 1309 | static int btrfs_set_bit_hook(struct inode *inode, u64 start, u64 end, |
b0c68f8b | 1310 | unsigned long old, unsigned long bits) |
291d673e | 1311 | { |
9ed74f2d | 1312 | |
75eff68e CM |
1313 | /* |
1314 | * set_bit and clear bit hooks normally require _irqsave/restore | |
1315 | * but in this case, we are only testeing for the DELALLOC | |
1316 | * bit, which is only set or cleared with irqs on | |
1317 | */ | |
b0c68f8b | 1318 | if (!(old & EXTENT_DELALLOC) && (bits & EXTENT_DELALLOC)) { |
291d673e | 1319 | struct btrfs_root *root = BTRFS_I(inode)->root; |
9ed74f2d | 1320 | |
32c00aff JB |
1321 | spin_lock(&BTRFS_I(inode)->accounting_lock); |
1322 | BTRFS_I(inode)->outstanding_extents++; | |
1323 | spin_unlock(&BTRFS_I(inode)->accounting_lock); | |
6a63209f | 1324 | btrfs_delalloc_reserve_space(root, inode, end - start + 1); |
75eff68e | 1325 | spin_lock(&root->fs_info->delalloc_lock); |
9069218d | 1326 | BTRFS_I(inode)->delalloc_bytes += end - start + 1; |
291d673e | 1327 | root->fs_info->delalloc_bytes += end - start + 1; |
ea8c2819 CM |
1328 | if (list_empty(&BTRFS_I(inode)->delalloc_inodes)) { |
1329 | list_add_tail(&BTRFS_I(inode)->delalloc_inodes, | |
1330 | &root->fs_info->delalloc_inodes); | |
1331 | } | |
75eff68e | 1332 | spin_unlock(&root->fs_info->delalloc_lock); |
291d673e CM |
1333 | } |
1334 | return 0; | |
1335 | } | |
1336 | ||
d352ac68 CM |
1337 | /* |
1338 | * extent_io.c clear_bit_hook, see set_bit_hook for why | |
1339 | */ | |
9ed74f2d JB |
1340 | static int btrfs_clear_bit_hook(struct inode *inode, |
1341 | struct extent_state *state, unsigned long bits) | |
291d673e | 1342 | { |
75eff68e CM |
1343 | /* |
1344 | * set_bit and clear bit hooks normally require _irqsave/restore | |
1345 | * but in this case, we are only testeing for the DELALLOC | |
1346 | * bit, which is only set or cleared with irqs on | |
1347 | */ | |
9ed74f2d | 1348 | if ((state->state & EXTENT_DELALLOC) && (bits & EXTENT_DELALLOC)) { |
291d673e | 1349 | struct btrfs_root *root = BTRFS_I(inode)->root; |
bcbfce8a | 1350 | |
32c00aff JB |
1351 | if (bits & EXTENT_DO_ACCOUNTING) { |
1352 | spin_lock(&BTRFS_I(inode)->accounting_lock); | |
1353 | BTRFS_I(inode)->outstanding_extents--; | |
1354 | spin_unlock(&BTRFS_I(inode)->accounting_lock); | |
1355 | btrfs_unreserve_metadata_for_delalloc(root, inode, 1); | |
1356 | } | |
9ed74f2d | 1357 | |
75eff68e | 1358 | spin_lock(&root->fs_info->delalloc_lock); |
9ed74f2d JB |
1359 | if (state->end - state->start + 1 > |
1360 | root->fs_info->delalloc_bytes) { | |
d397712b CM |
1361 | printk(KERN_INFO "btrfs warning: delalloc account " |
1362 | "%llu %llu\n", | |
9ed74f2d JB |
1363 | (unsigned long long) |
1364 | state->end - state->start + 1, | |
d397712b CM |
1365 | (unsigned long long) |
1366 | root->fs_info->delalloc_bytes); | |
6a63209f | 1367 | btrfs_delalloc_free_space(root, inode, (u64)-1); |
b0c68f8b | 1368 | root->fs_info->delalloc_bytes = 0; |
9069218d | 1369 | BTRFS_I(inode)->delalloc_bytes = 0; |
b0c68f8b | 1370 | } else { |
6a63209f | 1371 | btrfs_delalloc_free_space(root, inode, |
9ed74f2d JB |
1372 | state->end - |
1373 | state->start + 1); | |
1374 | root->fs_info->delalloc_bytes -= state->end - | |
1375 | state->start + 1; | |
1376 | BTRFS_I(inode)->delalloc_bytes -= state->end - | |
1377 | state->start + 1; | |
b0c68f8b | 1378 | } |
ea8c2819 CM |
1379 | if (BTRFS_I(inode)->delalloc_bytes == 0 && |
1380 | !list_empty(&BTRFS_I(inode)->delalloc_inodes)) { | |
1381 | list_del_init(&BTRFS_I(inode)->delalloc_inodes); | |
1382 | } | |
75eff68e | 1383 | spin_unlock(&root->fs_info->delalloc_lock); |
291d673e CM |
1384 | } |
1385 | return 0; | |
1386 | } | |
1387 | ||
d352ac68 CM |
1388 | /* |
1389 | * extent_io.c merge_bio_hook, this must check the chunk tree to make sure | |
1390 | * we don't create bios that span stripes or chunks | |
1391 | */ | |
239b14b3 | 1392 | int btrfs_merge_bio_hook(struct page *page, unsigned long offset, |
c8b97818 CM |
1393 | size_t size, struct bio *bio, |
1394 | unsigned long bio_flags) | |
239b14b3 CM |
1395 | { |
1396 | struct btrfs_root *root = BTRFS_I(page->mapping->host)->root; | |
1397 | struct btrfs_mapping_tree *map_tree; | |
a62b9401 | 1398 | u64 logical = (u64)bio->bi_sector << 9; |
239b14b3 CM |
1399 | u64 length = 0; |
1400 | u64 map_length; | |
239b14b3 CM |
1401 | int ret; |
1402 | ||
771ed689 CM |
1403 | if (bio_flags & EXTENT_BIO_COMPRESSED) |
1404 | return 0; | |
1405 | ||
f2d8d74d | 1406 | length = bio->bi_size; |
239b14b3 CM |
1407 | map_tree = &root->fs_info->mapping_tree; |
1408 | map_length = length; | |
cea9e445 | 1409 | ret = btrfs_map_block(map_tree, READ, logical, |
f188591e | 1410 | &map_length, NULL, 0); |
cea9e445 | 1411 | |
d397712b | 1412 | if (map_length < length + size) |
239b14b3 | 1413 | return 1; |
239b14b3 CM |
1414 | return 0; |
1415 | } | |
1416 | ||
d352ac68 CM |
1417 | /* |
1418 | * in order to insert checksums into the metadata in large chunks, | |
1419 | * we wait until bio submission time. All the pages in the bio are | |
1420 | * checksummed and sums are attached onto the ordered extent record. | |
1421 | * | |
1422 | * At IO completion time the cums attached on the ordered extent record | |
1423 | * are inserted into the btree | |
1424 | */ | |
d397712b CM |
1425 | static int __btrfs_submit_bio_start(struct inode *inode, int rw, |
1426 | struct bio *bio, int mirror_num, | |
1427 | unsigned long bio_flags) | |
065631f6 | 1428 | { |
065631f6 | 1429 | struct btrfs_root *root = BTRFS_I(inode)->root; |
065631f6 | 1430 | int ret = 0; |
e015640f | 1431 | |
d20f7043 | 1432 | ret = btrfs_csum_one_bio(root, inode, bio, 0, 0); |
44b8bd7e | 1433 | BUG_ON(ret); |
4a69a410 CM |
1434 | return 0; |
1435 | } | |
e015640f | 1436 | |
4a69a410 CM |
1437 | /* |
1438 | * in order to insert checksums into the metadata in large chunks, | |
1439 | * we wait until bio submission time. All the pages in the bio are | |
1440 | * checksummed and sums are attached onto the ordered extent record. | |
1441 | * | |
1442 | * At IO completion time the cums attached on the ordered extent record | |
1443 | * are inserted into the btree | |
1444 | */ | |
b2950863 | 1445 | static int __btrfs_submit_bio_done(struct inode *inode, int rw, struct bio *bio, |
4a69a410 CM |
1446 | int mirror_num, unsigned long bio_flags) |
1447 | { | |
1448 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
8b712842 | 1449 | return btrfs_map_bio(root, rw, bio, mirror_num, 1); |
44b8bd7e CM |
1450 | } |
1451 | ||
d352ac68 | 1452 | /* |
cad321ad CM |
1453 | * extent_io.c submission hook. This does the right thing for csum calculation |
1454 | * on write, or reading the csums from the tree before a read | |
d352ac68 | 1455 | */ |
b2950863 | 1456 | static int btrfs_submit_bio_hook(struct inode *inode, int rw, struct bio *bio, |
c8b97818 | 1457 | int mirror_num, unsigned long bio_flags) |
44b8bd7e CM |
1458 | { |
1459 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
1460 | int ret = 0; | |
19b9bdb0 | 1461 | int skip_sum; |
44b8bd7e | 1462 | |
6cbff00f | 1463 | skip_sum = BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM; |
cad321ad | 1464 | |
e6dcd2dc CM |
1465 | ret = btrfs_bio_wq_end_io(root->fs_info, bio, 0); |
1466 | BUG_ON(ret); | |
065631f6 | 1467 | |
4d1b5fb4 | 1468 | if (!(rw & (1 << BIO_RW))) { |
d20f7043 | 1469 | if (bio_flags & EXTENT_BIO_COMPRESSED) { |
c8b97818 CM |
1470 | return btrfs_submit_compressed_read(inode, bio, |
1471 | mirror_num, bio_flags); | |
d20f7043 CM |
1472 | } else if (!skip_sum) |
1473 | btrfs_lookup_bio_sums(root, inode, bio, NULL); | |
4d1b5fb4 | 1474 | goto mapit; |
19b9bdb0 | 1475 | } else if (!skip_sum) { |
17d217fe YZ |
1476 | /* csum items have already been cloned */ |
1477 | if (root->root_key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID) | |
1478 | goto mapit; | |
19b9bdb0 CM |
1479 | /* we're doing a write, do the async checksumming */ |
1480 | return btrfs_wq_submit_bio(BTRFS_I(inode)->root->fs_info, | |
44b8bd7e | 1481 | inode, rw, bio, mirror_num, |
4a69a410 CM |
1482 | bio_flags, __btrfs_submit_bio_start, |
1483 | __btrfs_submit_bio_done); | |
19b9bdb0 CM |
1484 | } |
1485 | ||
0b86a832 | 1486 | mapit: |
8b712842 | 1487 | return btrfs_map_bio(root, rw, bio, mirror_num, 0); |
065631f6 | 1488 | } |
6885f308 | 1489 | |
d352ac68 CM |
1490 | /* |
1491 | * given a list of ordered sums record them in the inode. This happens | |
1492 | * at IO completion time based on sums calculated at bio submission time. | |
1493 | */ | |
ba1da2f4 | 1494 | static noinline int add_pending_csums(struct btrfs_trans_handle *trans, |
e6dcd2dc CM |
1495 | struct inode *inode, u64 file_offset, |
1496 | struct list_head *list) | |
1497 | { | |
e6dcd2dc CM |
1498 | struct btrfs_ordered_sum *sum; |
1499 | ||
1500 | btrfs_set_trans_block_group(trans, inode); | |
c6e30871 QF |
1501 | |
1502 | list_for_each_entry(sum, list, list) { | |
d20f7043 CM |
1503 | btrfs_csum_file_blocks(trans, |
1504 | BTRFS_I(inode)->root->fs_info->csum_root, sum); | |
e6dcd2dc CM |
1505 | } |
1506 | return 0; | |
1507 | } | |
1508 | ||
ea8c2819 CM |
1509 | int btrfs_set_extent_delalloc(struct inode *inode, u64 start, u64 end) |
1510 | { | |
d397712b | 1511 | if ((end & (PAGE_CACHE_SIZE - 1)) == 0) |
771ed689 | 1512 | WARN_ON(1); |
ea8c2819 CM |
1513 | return set_extent_delalloc(&BTRFS_I(inode)->io_tree, start, end, |
1514 | GFP_NOFS); | |
1515 | } | |
1516 | ||
d352ac68 | 1517 | /* see btrfs_writepage_start_hook for details on why this is required */ |
247e743c CM |
1518 | struct btrfs_writepage_fixup { |
1519 | struct page *page; | |
1520 | struct btrfs_work work; | |
1521 | }; | |
1522 | ||
b2950863 | 1523 | static void btrfs_writepage_fixup_worker(struct btrfs_work *work) |
247e743c CM |
1524 | { |
1525 | struct btrfs_writepage_fixup *fixup; | |
1526 | struct btrfs_ordered_extent *ordered; | |
1527 | struct page *page; | |
1528 | struct inode *inode; | |
1529 | u64 page_start; | |
1530 | u64 page_end; | |
1531 | ||
1532 | fixup = container_of(work, struct btrfs_writepage_fixup, work); | |
1533 | page = fixup->page; | |
4a096752 | 1534 | again: |
247e743c CM |
1535 | lock_page(page); |
1536 | if (!page->mapping || !PageDirty(page) || !PageChecked(page)) { | |
1537 | ClearPageChecked(page); | |
1538 | goto out_page; | |
1539 | } | |
1540 | ||
1541 | inode = page->mapping->host; | |
1542 | page_start = page_offset(page); | |
1543 | page_end = page_offset(page) + PAGE_CACHE_SIZE - 1; | |
1544 | ||
1545 | lock_extent(&BTRFS_I(inode)->io_tree, page_start, page_end, GFP_NOFS); | |
4a096752 CM |
1546 | |
1547 | /* already ordered? We're done */ | |
8b62b72b | 1548 | if (PagePrivate2(page)) |
247e743c | 1549 | goto out; |
4a096752 CM |
1550 | |
1551 | ordered = btrfs_lookup_ordered_extent(inode, page_start); | |
1552 | if (ordered) { | |
1553 | unlock_extent(&BTRFS_I(inode)->io_tree, page_start, | |
1554 | page_end, GFP_NOFS); | |
1555 | unlock_page(page); | |
1556 | btrfs_start_ordered_extent(inode, ordered, 1); | |
1557 | goto again; | |
1558 | } | |
247e743c | 1559 | |
ea8c2819 | 1560 | btrfs_set_extent_delalloc(inode, page_start, page_end); |
247e743c CM |
1561 | ClearPageChecked(page); |
1562 | out: | |
1563 | unlock_extent(&BTRFS_I(inode)->io_tree, page_start, page_end, GFP_NOFS); | |
1564 | out_page: | |
1565 | unlock_page(page); | |
1566 | page_cache_release(page); | |
1567 | } | |
1568 | ||
1569 | /* | |
1570 | * There are a few paths in the higher layers of the kernel that directly | |
1571 | * set the page dirty bit without asking the filesystem if it is a | |
1572 | * good idea. This causes problems because we want to make sure COW | |
1573 | * properly happens and the data=ordered rules are followed. | |
1574 | * | |
c8b97818 | 1575 | * In our case any range that doesn't have the ORDERED bit set |
247e743c CM |
1576 | * hasn't been properly setup for IO. We kick off an async process |
1577 | * to fix it up. The async helper will wait for ordered extents, set | |
1578 | * the delalloc bit and make it safe to write the page. | |
1579 | */ | |
b2950863 | 1580 | static int btrfs_writepage_start_hook(struct page *page, u64 start, u64 end) |
247e743c CM |
1581 | { |
1582 | struct inode *inode = page->mapping->host; | |
1583 | struct btrfs_writepage_fixup *fixup; | |
1584 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
247e743c | 1585 | |
8b62b72b CM |
1586 | /* this page is properly in the ordered list */ |
1587 | if (TestClearPagePrivate2(page)) | |
247e743c CM |
1588 | return 0; |
1589 | ||
1590 | if (PageChecked(page)) | |
1591 | return -EAGAIN; | |
1592 | ||
1593 | fixup = kzalloc(sizeof(*fixup), GFP_NOFS); | |
1594 | if (!fixup) | |
1595 | return -EAGAIN; | |
f421950f | 1596 | |
247e743c CM |
1597 | SetPageChecked(page); |
1598 | page_cache_get(page); | |
1599 | fixup->work.func = btrfs_writepage_fixup_worker; | |
1600 | fixup->page = page; | |
1601 | btrfs_queue_worker(&root->fs_info->fixup_workers, &fixup->work); | |
1602 | return -EAGAIN; | |
1603 | } | |
1604 | ||
d899e052 YZ |
1605 | static int insert_reserved_file_extent(struct btrfs_trans_handle *trans, |
1606 | struct inode *inode, u64 file_pos, | |
1607 | u64 disk_bytenr, u64 disk_num_bytes, | |
1608 | u64 num_bytes, u64 ram_bytes, | |
1609 | u8 compression, u8 encryption, | |
1610 | u16 other_encoding, int extent_type) | |
1611 | { | |
1612 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
1613 | struct btrfs_file_extent_item *fi; | |
1614 | struct btrfs_path *path; | |
1615 | struct extent_buffer *leaf; | |
1616 | struct btrfs_key ins; | |
1617 | u64 hint; | |
1618 | int ret; | |
1619 | ||
1620 | path = btrfs_alloc_path(); | |
1621 | BUG_ON(!path); | |
1622 | ||
b9473439 | 1623 | path->leave_spinning = 1; |
a1ed835e CM |
1624 | |
1625 | /* | |
1626 | * we may be replacing one extent in the tree with another. | |
1627 | * The new extent is pinned in the extent map, and we don't want | |
1628 | * to drop it from the cache until it is completely in the btree. | |
1629 | * | |
1630 | * So, tell btrfs_drop_extents to leave this extent in the cache. | |
1631 | * the caller is expected to unpin it and allow it to be merged | |
1632 | * with the others. | |
1633 | */ | |
920bbbfb YZ |
1634 | ret = btrfs_drop_extents(trans, inode, file_pos, file_pos + num_bytes, |
1635 | &hint, 0); | |
d899e052 YZ |
1636 | BUG_ON(ret); |
1637 | ||
1638 | ins.objectid = inode->i_ino; | |
1639 | ins.offset = file_pos; | |
1640 | ins.type = BTRFS_EXTENT_DATA_KEY; | |
1641 | ret = btrfs_insert_empty_item(trans, root, path, &ins, sizeof(*fi)); | |
1642 | BUG_ON(ret); | |
1643 | leaf = path->nodes[0]; | |
1644 | fi = btrfs_item_ptr(leaf, path->slots[0], | |
1645 | struct btrfs_file_extent_item); | |
1646 | btrfs_set_file_extent_generation(leaf, fi, trans->transid); | |
1647 | btrfs_set_file_extent_type(leaf, fi, extent_type); | |
1648 | btrfs_set_file_extent_disk_bytenr(leaf, fi, disk_bytenr); | |
1649 | btrfs_set_file_extent_disk_num_bytes(leaf, fi, disk_num_bytes); | |
1650 | btrfs_set_file_extent_offset(leaf, fi, 0); | |
1651 | btrfs_set_file_extent_num_bytes(leaf, fi, num_bytes); | |
1652 | btrfs_set_file_extent_ram_bytes(leaf, fi, ram_bytes); | |
1653 | btrfs_set_file_extent_compression(leaf, fi, compression); | |
1654 | btrfs_set_file_extent_encryption(leaf, fi, encryption); | |
1655 | btrfs_set_file_extent_other_encoding(leaf, fi, other_encoding); | |
b9473439 CM |
1656 | |
1657 | btrfs_unlock_up_safe(path, 1); | |
1658 | btrfs_set_lock_blocking(leaf); | |
1659 | ||
d899e052 YZ |
1660 | btrfs_mark_buffer_dirty(leaf); |
1661 | ||
1662 | inode_add_bytes(inode, num_bytes); | |
d899e052 YZ |
1663 | |
1664 | ins.objectid = disk_bytenr; | |
1665 | ins.offset = disk_num_bytes; | |
1666 | ins.type = BTRFS_EXTENT_ITEM_KEY; | |
5d4f98a2 YZ |
1667 | ret = btrfs_alloc_reserved_file_extent(trans, root, |
1668 | root->root_key.objectid, | |
1669 | inode->i_ino, file_pos, &ins); | |
d899e052 | 1670 | BUG_ON(ret); |
d899e052 | 1671 | btrfs_free_path(path); |
b9473439 | 1672 | |
d899e052 YZ |
1673 | return 0; |
1674 | } | |
1675 | ||
5d13a98f CM |
1676 | /* |
1677 | * helper function for btrfs_finish_ordered_io, this | |
1678 | * just reads in some of the csum leaves to prime them into ram | |
1679 | * before we start the transaction. It limits the amount of btree | |
1680 | * reads required while inside the transaction. | |
1681 | */ | |
1682 | static noinline void reada_csum(struct btrfs_root *root, | |
1683 | struct btrfs_path *path, | |
1684 | struct btrfs_ordered_extent *ordered_extent) | |
1685 | { | |
1686 | struct btrfs_ordered_sum *sum; | |
1687 | u64 bytenr; | |
1688 | ||
1689 | sum = list_entry(ordered_extent->list.next, struct btrfs_ordered_sum, | |
1690 | list); | |
1691 | bytenr = sum->sums[0].bytenr; | |
1692 | ||
1693 | /* | |
1694 | * we don't care about the results, the point of this search is | |
1695 | * just to get the btree leaves into ram | |
1696 | */ | |
1697 | btrfs_lookup_csum(NULL, root->fs_info->csum_root, path, bytenr, 0); | |
1698 | } | |
1699 | ||
d352ac68 CM |
1700 | /* as ordered data IO finishes, this gets called so we can finish |
1701 | * an ordered extent if the range of bytes in the file it covers are | |
1702 | * fully written. | |
1703 | */ | |
211f90e6 | 1704 | static int btrfs_finish_ordered_io(struct inode *inode, u64 start, u64 end) |
e6dcd2dc | 1705 | { |
e6dcd2dc CM |
1706 | struct btrfs_root *root = BTRFS_I(inode)->root; |
1707 | struct btrfs_trans_handle *trans; | |
5d13a98f | 1708 | struct btrfs_ordered_extent *ordered_extent = NULL; |
e6dcd2dc | 1709 | struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree; |
b7ec40d7 | 1710 | struct btrfs_path *path; |
d899e052 | 1711 | int compressed = 0; |
e6dcd2dc CM |
1712 | int ret; |
1713 | ||
1714 | ret = btrfs_dec_test_ordered_pending(inode, start, end - start + 1); | |
ba1da2f4 | 1715 | if (!ret) |
e6dcd2dc | 1716 | return 0; |
e6dcd2dc | 1717 | |
b7ec40d7 CM |
1718 | /* |
1719 | * before we join the transaction, try to do some of our IO. | |
1720 | * This will limit the amount of IO that we have to do with | |
1721 | * the transaction running. We're unlikely to need to do any | |
1722 | * IO if the file extents are new, the disk_i_size checks | |
1723 | * covers the most common case. | |
1724 | */ | |
1725 | if (start < BTRFS_I(inode)->disk_i_size) { | |
1726 | path = btrfs_alloc_path(); | |
1727 | if (path) { | |
1728 | ret = btrfs_lookup_file_extent(NULL, root, path, | |
1729 | inode->i_ino, | |
1730 | start, 0); | |
5d13a98f CM |
1731 | ordered_extent = btrfs_lookup_ordered_extent(inode, |
1732 | start); | |
1733 | if (!list_empty(&ordered_extent->list)) { | |
1734 | btrfs_release_path(root, path); | |
1735 | reada_csum(root, path, ordered_extent); | |
1736 | } | |
b7ec40d7 CM |
1737 | btrfs_free_path(path); |
1738 | } | |
1739 | } | |
1740 | ||
5d13a98f CM |
1741 | if (!ordered_extent) |
1742 | ordered_extent = btrfs_lookup_ordered_extent(inode, start); | |
e6dcd2dc | 1743 | BUG_ON(!ordered_extent); |
c2167754 YZ |
1744 | if (test_bit(BTRFS_ORDERED_NOCOW, &ordered_extent->flags)) { |
1745 | BUG_ON(!list_empty(&ordered_extent->list)); | |
1746 | ret = btrfs_ordered_update_i_size(inode, 0, ordered_extent); | |
1747 | if (!ret) { | |
1748 | trans = btrfs_join_transaction(root, 1); | |
1749 | ret = btrfs_update_inode(trans, root, inode); | |
1750 | BUG_ON(ret); | |
1751 | btrfs_end_transaction(trans, root); | |
1752 | } | |
1753 | goto out; | |
1754 | } | |
e6dcd2dc CM |
1755 | |
1756 | lock_extent(io_tree, ordered_extent->file_offset, | |
1757 | ordered_extent->file_offset + ordered_extent->len - 1, | |
1758 | GFP_NOFS); | |
1759 | ||
c2167754 YZ |
1760 | trans = btrfs_join_transaction(root, 1); |
1761 | ||
c8b97818 | 1762 | if (test_bit(BTRFS_ORDERED_COMPRESSED, &ordered_extent->flags)) |
d899e052 YZ |
1763 | compressed = 1; |
1764 | if (test_bit(BTRFS_ORDERED_PREALLOC, &ordered_extent->flags)) { | |
1765 | BUG_ON(compressed); | |
920bbbfb | 1766 | ret = btrfs_mark_extent_written(trans, inode, |
d899e052 YZ |
1767 | ordered_extent->file_offset, |
1768 | ordered_extent->file_offset + | |
1769 | ordered_extent->len); | |
1770 | BUG_ON(ret); | |
1771 | } else { | |
1772 | ret = insert_reserved_file_extent(trans, inode, | |
1773 | ordered_extent->file_offset, | |
1774 | ordered_extent->start, | |
1775 | ordered_extent->disk_len, | |
1776 | ordered_extent->len, | |
1777 | ordered_extent->len, | |
1778 | compressed, 0, 0, | |
1779 | BTRFS_FILE_EXTENT_REG); | |
a1ed835e CM |
1780 | unpin_extent_cache(&BTRFS_I(inode)->extent_tree, |
1781 | ordered_extent->file_offset, | |
1782 | ordered_extent->len); | |
d899e052 YZ |
1783 | BUG_ON(ret); |
1784 | } | |
e6dcd2dc CM |
1785 | unlock_extent(io_tree, ordered_extent->file_offset, |
1786 | ordered_extent->file_offset + ordered_extent->len - 1, | |
1787 | GFP_NOFS); | |
1788 | add_pending_csums(trans, inode, ordered_extent->file_offset, | |
1789 | &ordered_extent->list); | |
1790 | ||
c2167754 YZ |
1791 | /* this also removes the ordered extent from the tree */ |
1792 | btrfs_ordered_update_i_size(inode, 0, ordered_extent); | |
1793 | ret = btrfs_update_inode(trans, root, inode); | |
1794 | BUG_ON(ret); | |
1795 | btrfs_end_transaction(trans, root); | |
1796 | out: | |
e6dcd2dc CM |
1797 | /* once for us */ |
1798 | btrfs_put_ordered_extent(ordered_extent); | |
1799 | /* once for the tree */ | |
1800 | btrfs_put_ordered_extent(ordered_extent); | |
1801 | ||
e6dcd2dc CM |
1802 | return 0; |
1803 | } | |
1804 | ||
b2950863 | 1805 | static int btrfs_writepage_end_io_hook(struct page *page, u64 start, u64 end, |
211f90e6 CM |
1806 | struct extent_state *state, int uptodate) |
1807 | { | |
8b62b72b | 1808 | ClearPagePrivate2(page); |
211f90e6 CM |
1809 | return btrfs_finish_ordered_io(page->mapping->host, start, end); |
1810 | } | |
1811 | ||
d352ac68 CM |
1812 | /* |
1813 | * When IO fails, either with EIO or csum verification fails, we | |
1814 | * try other mirrors that might have a good copy of the data. This | |
1815 | * io_failure_record is used to record state as we go through all the | |
1816 | * mirrors. If another mirror has good data, the page is set up to date | |
1817 | * and things continue. If a good mirror can't be found, the original | |
1818 | * bio end_io callback is called to indicate things have failed. | |
1819 | */ | |
7e38326f CM |
1820 | struct io_failure_record { |
1821 | struct page *page; | |
1822 | u64 start; | |
1823 | u64 len; | |
1824 | u64 logical; | |
d20f7043 | 1825 | unsigned long bio_flags; |
7e38326f CM |
1826 | int last_mirror; |
1827 | }; | |
1828 | ||
b2950863 | 1829 | static int btrfs_io_failed_hook(struct bio *failed_bio, |
1259ab75 CM |
1830 | struct page *page, u64 start, u64 end, |
1831 | struct extent_state *state) | |
7e38326f CM |
1832 | { |
1833 | struct io_failure_record *failrec = NULL; | |
1834 | u64 private; | |
1835 | struct extent_map *em; | |
1836 | struct inode *inode = page->mapping->host; | |
1837 | struct extent_io_tree *failure_tree = &BTRFS_I(inode)->io_failure_tree; | |
3b951516 | 1838 | struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree; |
7e38326f CM |
1839 | struct bio *bio; |
1840 | int num_copies; | |
1841 | int ret; | |
1259ab75 | 1842 | int rw; |
7e38326f CM |
1843 | u64 logical; |
1844 | ||
1845 | ret = get_state_private(failure_tree, start, &private); | |
1846 | if (ret) { | |
7e38326f CM |
1847 | failrec = kmalloc(sizeof(*failrec), GFP_NOFS); |
1848 | if (!failrec) | |
1849 | return -ENOMEM; | |
1850 | failrec->start = start; | |
1851 | failrec->len = end - start + 1; | |
1852 | failrec->last_mirror = 0; | |
d20f7043 | 1853 | failrec->bio_flags = 0; |
7e38326f | 1854 | |
890871be | 1855 | read_lock(&em_tree->lock); |
3b951516 CM |
1856 | em = lookup_extent_mapping(em_tree, start, failrec->len); |
1857 | if (em->start > start || em->start + em->len < start) { | |
1858 | free_extent_map(em); | |
1859 | em = NULL; | |
1860 | } | |
890871be | 1861 | read_unlock(&em_tree->lock); |
7e38326f CM |
1862 | |
1863 | if (!em || IS_ERR(em)) { | |
1864 | kfree(failrec); | |
1865 | return -EIO; | |
1866 | } | |
1867 | logical = start - em->start; | |
1868 | logical = em->block_start + logical; | |
d20f7043 CM |
1869 | if (test_bit(EXTENT_FLAG_COMPRESSED, &em->flags)) { |
1870 | logical = em->block_start; | |
1871 | failrec->bio_flags = EXTENT_BIO_COMPRESSED; | |
1872 | } | |
7e38326f CM |
1873 | failrec->logical = logical; |
1874 | free_extent_map(em); | |
1875 | set_extent_bits(failure_tree, start, end, EXTENT_LOCKED | | |
1876 | EXTENT_DIRTY, GFP_NOFS); | |
587f7704 CM |
1877 | set_state_private(failure_tree, start, |
1878 | (u64)(unsigned long)failrec); | |
7e38326f | 1879 | } else { |
587f7704 | 1880 | failrec = (struct io_failure_record *)(unsigned long)private; |
7e38326f CM |
1881 | } |
1882 | num_copies = btrfs_num_copies( | |
1883 | &BTRFS_I(inode)->root->fs_info->mapping_tree, | |
1884 | failrec->logical, failrec->len); | |
1885 | failrec->last_mirror++; | |
1886 | if (!state) { | |
cad321ad | 1887 | spin_lock(&BTRFS_I(inode)->io_tree.lock); |
7e38326f CM |
1888 | state = find_first_extent_bit_state(&BTRFS_I(inode)->io_tree, |
1889 | failrec->start, | |
1890 | EXTENT_LOCKED); | |
1891 | if (state && state->start != failrec->start) | |
1892 | state = NULL; | |
cad321ad | 1893 | spin_unlock(&BTRFS_I(inode)->io_tree.lock); |
7e38326f CM |
1894 | } |
1895 | if (!state || failrec->last_mirror > num_copies) { | |
1896 | set_state_private(failure_tree, failrec->start, 0); | |
1897 | clear_extent_bits(failure_tree, failrec->start, | |
1898 | failrec->start + failrec->len - 1, | |
1899 | EXTENT_LOCKED | EXTENT_DIRTY, GFP_NOFS); | |
1900 | kfree(failrec); | |
1901 | return -EIO; | |
1902 | } | |
1903 | bio = bio_alloc(GFP_NOFS, 1); | |
1904 | bio->bi_private = state; | |
1905 | bio->bi_end_io = failed_bio->bi_end_io; | |
1906 | bio->bi_sector = failrec->logical >> 9; | |
1907 | bio->bi_bdev = failed_bio->bi_bdev; | |
e1c4b745 | 1908 | bio->bi_size = 0; |
d20f7043 | 1909 | |
7e38326f | 1910 | bio_add_page(bio, page, failrec->len, start - page_offset(page)); |
1259ab75 CM |
1911 | if (failed_bio->bi_rw & (1 << BIO_RW)) |
1912 | rw = WRITE; | |
1913 | else | |
1914 | rw = READ; | |
1915 | ||
1916 | BTRFS_I(inode)->io_tree.ops->submit_bio_hook(inode, rw, bio, | |
c8b97818 | 1917 | failrec->last_mirror, |
d20f7043 | 1918 | failrec->bio_flags); |
1259ab75 CM |
1919 | return 0; |
1920 | } | |
1921 | ||
d352ac68 CM |
1922 | /* |
1923 | * each time an IO finishes, we do a fast check in the IO failure tree | |
1924 | * to see if we need to process or clean up an io_failure_record | |
1925 | */ | |
b2950863 | 1926 | static int btrfs_clean_io_failures(struct inode *inode, u64 start) |
1259ab75 CM |
1927 | { |
1928 | u64 private; | |
1929 | u64 private_failure; | |
1930 | struct io_failure_record *failure; | |
1931 | int ret; | |
1932 | ||
1933 | private = 0; | |
1934 | if (count_range_bits(&BTRFS_I(inode)->io_failure_tree, &private, | |
1935 | (u64)-1, 1, EXTENT_DIRTY)) { | |
1936 | ret = get_state_private(&BTRFS_I(inode)->io_failure_tree, | |
1937 | start, &private_failure); | |
1938 | if (ret == 0) { | |
1939 | failure = (struct io_failure_record *)(unsigned long) | |
1940 | private_failure; | |
1941 | set_state_private(&BTRFS_I(inode)->io_failure_tree, | |
1942 | failure->start, 0); | |
1943 | clear_extent_bits(&BTRFS_I(inode)->io_failure_tree, | |
1944 | failure->start, | |
1945 | failure->start + failure->len - 1, | |
1946 | EXTENT_DIRTY | EXTENT_LOCKED, | |
1947 | GFP_NOFS); | |
1948 | kfree(failure); | |
1949 | } | |
1950 | } | |
7e38326f CM |
1951 | return 0; |
1952 | } | |
1953 | ||
d352ac68 CM |
1954 | /* |
1955 | * when reads are done, we need to check csums to verify the data is correct | |
1956 | * if there's a match, we allow the bio to finish. If not, we go through | |
1957 | * the io_failure_record routines to find good copies | |
1958 | */ | |
b2950863 | 1959 | static int btrfs_readpage_end_io_hook(struct page *page, u64 start, u64 end, |
70dec807 | 1960 | struct extent_state *state) |
07157aac | 1961 | { |
35ebb934 | 1962 | size_t offset = start - ((u64)page->index << PAGE_CACHE_SHIFT); |
07157aac | 1963 | struct inode *inode = page->mapping->host; |
d1310b2e | 1964 | struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree; |
07157aac | 1965 | char *kaddr; |
aadfeb6e | 1966 | u64 private = ~(u32)0; |
07157aac | 1967 | int ret; |
ff79f819 CM |
1968 | struct btrfs_root *root = BTRFS_I(inode)->root; |
1969 | u32 csum = ~(u32)0; | |
d1310b2e | 1970 | |
d20f7043 CM |
1971 | if (PageChecked(page)) { |
1972 | ClearPageChecked(page); | |
1973 | goto good; | |
1974 | } | |
6cbff00f CH |
1975 | |
1976 | if (BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM) | |
17d217fe YZ |
1977 | return 0; |
1978 | ||
1979 | if (root->root_key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID && | |
9655d298 | 1980 | test_range_bit(io_tree, start, end, EXTENT_NODATASUM, 1, NULL)) { |
17d217fe YZ |
1981 | clear_extent_bits(io_tree, start, end, EXTENT_NODATASUM, |
1982 | GFP_NOFS); | |
b6cda9bc | 1983 | return 0; |
17d217fe | 1984 | } |
d20f7043 | 1985 | |
c2e639f0 | 1986 | if (state && state->start == start) { |
70dec807 CM |
1987 | private = state->private; |
1988 | ret = 0; | |
1989 | } else { | |
1990 | ret = get_state_private(io_tree, start, &private); | |
1991 | } | |
9ab86c8e | 1992 | kaddr = kmap_atomic(page, KM_USER0); |
d397712b | 1993 | if (ret) |
07157aac | 1994 | goto zeroit; |
d397712b | 1995 | |
ff79f819 CM |
1996 | csum = btrfs_csum_data(root, kaddr + offset, csum, end - start + 1); |
1997 | btrfs_csum_final(csum, (char *)&csum); | |
d397712b | 1998 | if (csum != private) |
07157aac | 1999 | goto zeroit; |
d397712b | 2000 | |
9ab86c8e | 2001 | kunmap_atomic(kaddr, KM_USER0); |
d20f7043 | 2002 | good: |
7e38326f CM |
2003 | /* if the io failure tree for this inode is non-empty, |
2004 | * check to see if we've recovered from a failed IO | |
2005 | */ | |
1259ab75 | 2006 | btrfs_clean_io_failures(inode, start); |
07157aac CM |
2007 | return 0; |
2008 | ||
2009 | zeroit: | |
193f284d CM |
2010 | if (printk_ratelimit()) { |
2011 | printk(KERN_INFO "btrfs csum failed ino %lu off %llu csum %u " | |
2012 | "private %llu\n", page->mapping->host->i_ino, | |
2013 | (unsigned long long)start, csum, | |
2014 | (unsigned long long)private); | |
2015 | } | |
db94535d CM |
2016 | memset(kaddr + offset, 1, end - start + 1); |
2017 | flush_dcache_page(page); | |
9ab86c8e | 2018 | kunmap_atomic(kaddr, KM_USER0); |
3b951516 CM |
2019 | if (private == 0) |
2020 | return 0; | |
7e38326f | 2021 | return -EIO; |
07157aac | 2022 | } |
b888db2b | 2023 | |
7b128766 JB |
2024 | /* |
2025 | * This creates an orphan entry for the given inode in case something goes | |
2026 | * wrong in the middle of an unlink/truncate. | |
2027 | */ | |
2028 | int btrfs_orphan_add(struct btrfs_trans_handle *trans, struct inode *inode) | |
2029 | { | |
2030 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
2031 | int ret = 0; | |
2032 | ||
bcc63abb | 2033 | spin_lock(&root->list_lock); |
7b128766 JB |
2034 | |
2035 | /* already on the orphan list, we're good */ | |
2036 | if (!list_empty(&BTRFS_I(inode)->i_orphan)) { | |
bcc63abb | 2037 | spin_unlock(&root->list_lock); |
7b128766 JB |
2038 | return 0; |
2039 | } | |
2040 | ||
2041 | list_add(&BTRFS_I(inode)->i_orphan, &root->orphan_list); | |
2042 | ||
bcc63abb | 2043 | spin_unlock(&root->list_lock); |
7b128766 JB |
2044 | |
2045 | /* | |
2046 | * insert an orphan item to track this unlinked/truncated file | |
2047 | */ | |
2048 | ret = btrfs_insert_orphan_item(trans, root, inode->i_ino); | |
2049 | ||
2050 | return ret; | |
2051 | } | |
2052 | ||
2053 | /* | |
2054 | * We have done the truncate/delete so we can go ahead and remove the orphan | |
2055 | * item for this particular inode. | |
2056 | */ | |
2057 | int btrfs_orphan_del(struct btrfs_trans_handle *trans, struct inode *inode) | |
2058 | { | |
2059 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
2060 | int ret = 0; | |
2061 | ||
bcc63abb | 2062 | spin_lock(&root->list_lock); |
7b128766 JB |
2063 | |
2064 | if (list_empty(&BTRFS_I(inode)->i_orphan)) { | |
bcc63abb | 2065 | spin_unlock(&root->list_lock); |
7b128766 JB |
2066 | return 0; |
2067 | } | |
2068 | ||
2069 | list_del_init(&BTRFS_I(inode)->i_orphan); | |
2070 | if (!trans) { | |
bcc63abb | 2071 | spin_unlock(&root->list_lock); |
7b128766 JB |
2072 | return 0; |
2073 | } | |
2074 | ||
bcc63abb | 2075 | spin_unlock(&root->list_lock); |
7b128766 JB |
2076 | |
2077 | ret = btrfs_del_orphan_item(trans, root, inode->i_ino); | |
2078 | ||
2079 | return ret; | |
2080 | } | |
2081 | ||
2082 | /* | |
2083 | * this cleans up any orphans that may be left on the list from the last use | |
2084 | * of this root. | |
2085 | */ | |
2086 | void btrfs_orphan_cleanup(struct btrfs_root *root) | |
2087 | { | |
2088 | struct btrfs_path *path; | |
2089 | struct extent_buffer *leaf; | |
2090 | struct btrfs_item *item; | |
2091 | struct btrfs_key key, found_key; | |
2092 | struct btrfs_trans_handle *trans; | |
2093 | struct inode *inode; | |
2094 | int ret = 0, nr_unlink = 0, nr_truncate = 0; | |
2095 | ||
c71bf099 | 2096 | if (!xchg(&root->clean_orphans, 0)) |
7b128766 | 2097 | return; |
c71bf099 YZ |
2098 | |
2099 | path = btrfs_alloc_path(); | |
2100 | BUG_ON(!path); | |
7b128766 JB |
2101 | path->reada = -1; |
2102 | ||
2103 | key.objectid = BTRFS_ORPHAN_OBJECTID; | |
2104 | btrfs_set_key_type(&key, BTRFS_ORPHAN_ITEM_KEY); | |
2105 | key.offset = (u64)-1; | |
2106 | ||
7b128766 JB |
2107 | while (1) { |
2108 | ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); | |
2109 | if (ret < 0) { | |
2110 | printk(KERN_ERR "Error searching slot for orphan: %d" | |
2111 | "\n", ret); | |
2112 | break; | |
2113 | } | |
2114 | ||
2115 | /* | |
2116 | * if ret == 0 means we found what we were searching for, which | |
2117 | * is weird, but possible, so only screw with path if we didnt | |
2118 | * find the key and see if we have stuff that matches | |
2119 | */ | |
2120 | if (ret > 0) { | |
2121 | if (path->slots[0] == 0) | |
2122 | break; | |
2123 | path->slots[0]--; | |
2124 | } | |
2125 | ||
2126 | /* pull out the item */ | |
2127 | leaf = path->nodes[0]; | |
2128 | item = btrfs_item_nr(leaf, path->slots[0]); | |
2129 | btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); | |
2130 | ||
2131 | /* make sure the item matches what we want */ | |
2132 | if (found_key.objectid != BTRFS_ORPHAN_OBJECTID) | |
2133 | break; | |
2134 | if (btrfs_key_type(&found_key) != BTRFS_ORPHAN_ITEM_KEY) | |
2135 | break; | |
2136 | ||
2137 | /* release the path since we're done with it */ | |
2138 | btrfs_release_path(root, path); | |
2139 | ||
2140 | /* | |
2141 | * this is where we are basically btrfs_lookup, without the | |
2142 | * crossing root thing. we store the inode number in the | |
2143 | * offset of the orphan item. | |
2144 | */ | |
5d4f98a2 YZ |
2145 | found_key.objectid = found_key.offset; |
2146 | found_key.type = BTRFS_INODE_ITEM_KEY; | |
2147 | found_key.offset = 0; | |
2148 | inode = btrfs_iget(root->fs_info->sb, &found_key, root); | |
2149 | if (IS_ERR(inode)) | |
7b128766 JB |
2150 | break; |
2151 | ||
7b128766 JB |
2152 | /* |
2153 | * add this inode to the orphan list so btrfs_orphan_del does | |
2154 | * the proper thing when we hit it | |
2155 | */ | |
bcc63abb | 2156 | spin_lock(&root->list_lock); |
7b128766 | 2157 | list_add(&BTRFS_I(inode)->i_orphan, &root->orphan_list); |
bcc63abb | 2158 | spin_unlock(&root->list_lock); |
7b128766 JB |
2159 | |
2160 | /* | |
2161 | * if this is a bad inode, means we actually succeeded in | |
2162 | * removing the inode, but not the orphan record, which means | |
2163 | * we need to manually delete the orphan since iput will just | |
2164 | * do a destroy_inode | |
2165 | */ | |
2166 | if (is_bad_inode(inode)) { | |
5b21f2ed | 2167 | trans = btrfs_start_transaction(root, 1); |
7b128766 | 2168 | btrfs_orphan_del(trans, inode); |
5b21f2ed | 2169 | btrfs_end_transaction(trans, root); |
7b128766 JB |
2170 | iput(inode); |
2171 | continue; | |
2172 | } | |
2173 | ||
2174 | /* if we have links, this was a truncate, lets do that */ | |
2175 | if (inode->i_nlink) { | |
2176 | nr_truncate++; | |
2177 | btrfs_truncate(inode); | |
2178 | } else { | |
2179 | nr_unlink++; | |
2180 | } | |
2181 | ||
2182 | /* this will do delete_inode and everything for us */ | |
2183 | iput(inode); | |
2184 | } | |
2185 | ||
2186 | if (nr_unlink) | |
2187 | printk(KERN_INFO "btrfs: unlinked %d orphans\n", nr_unlink); | |
2188 | if (nr_truncate) | |
2189 | printk(KERN_INFO "btrfs: truncated %d orphans\n", nr_truncate); | |
2190 | ||
2191 | btrfs_free_path(path); | |
7b128766 JB |
2192 | } |
2193 | ||
46a53cca CM |
2194 | /* |
2195 | * very simple check to peek ahead in the leaf looking for xattrs. If we | |
2196 | * don't find any xattrs, we know there can't be any acls. | |
2197 | * | |
2198 | * slot is the slot the inode is in, objectid is the objectid of the inode | |
2199 | */ | |
2200 | static noinline int acls_after_inode_item(struct extent_buffer *leaf, | |
2201 | int slot, u64 objectid) | |
2202 | { | |
2203 | u32 nritems = btrfs_header_nritems(leaf); | |
2204 | struct btrfs_key found_key; | |
2205 | int scanned = 0; | |
2206 | ||
2207 | slot++; | |
2208 | while (slot < nritems) { | |
2209 | btrfs_item_key_to_cpu(leaf, &found_key, slot); | |
2210 | ||
2211 | /* we found a different objectid, there must not be acls */ | |
2212 | if (found_key.objectid != objectid) | |
2213 | return 0; | |
2214 | ||
2215 | /* we found an xattr, assume we've got an acl */ | |
2216 | if (found_key.type == BTRFS_XATTR_ITEM_KEY) | |
2217 | return 1; | |
2218 | ||
2219 | /* | |
2220 | * we found a key greater than an xattr key, there can't | |
2221 | * be any acls later on | |
2222 | */ | |
2223 | if (found_key.type > BTRFS_XATTR_ITEM_KEY) | |
2224 | return 0; | |
2225 | ||
2226 | slot++; | |
2227 | scanned++; | |
2228 | ||
2229 | /* | |
2230 | * it goes inode, inode backrefs, xattrs, extents, | |
2231 | * so if there are a ton of hard links to an inode there can | |
2232 | * be a lot of backrefs. Don't waste time searching too hard, | |
2233 | * this is just an optimization | |
2234 | */ | |
2235 | if (scanned >= 8) | |
2236 | break; | |
2237 | } | |
2238 | /* we hit the end of the leaf before we found an xattr or | |
2239 | * something larger than an xattr. We have to assume the inode | |
2240 | * has acls | |
2241 | */ | |
2242 | return 1; | |
2243 | } | |
2244 | ||
d352ac68 CM |
2245 | /* |
2246 | * read an inode from the btree into the in-memory inode | |
2247 | */ | |
5d4f98a2 | 2248 | static void btrfs_read_locked_inode(struct inode *inode) |
39279cc3 CM |
2249 | { |
2250 | struct btrfs_path *path; | |
5f39d397 | 2251 | struct extent_buffer *leaf; |
39279cc3 | 2252 | struct btrfs_inode_item *inode_item; |
0b86a832 | 2253 | struct btrfs_timespec *tspec; |
39279cc3 CM |
2254 | struct btrfs_root *root = BTRFS_I(inode)->root; |
2255 | struct btrfs_key location; | |
46a53cca | 2256 | int maybe_acls; |
39279cc3 | 2257 | u64 alloc_group_block; |
618e21d5 | 2258 | u32 rdev; |
39279cc3 CM |
2259 | int ret; |
2260 | ||
2261 | path = btrfs_alloc_path(); | |
2262 | BUG_ON(!path); | |
39279cc3 | 2263 | memcpy(&location, &BTRFS_I(inode)->location, sizeof(location)); |
dc17ff8f | 2264 | |
39279cc3 | 2265 | ret = btrfs_lookup_inode(NULL, root, path, &location, 0); |
5f39d397 | 2266 | if (ret) |
39279cc3 | 2267 | goto make_bad; |
39279cc3 | 2268 | |
5f39d397 CM |
2269 | leaf = path->nodes[0]; |
2270 | inode_item = btrfs_item_ptr(leaf, path->slots[0], | |
2271 | struct btrfs_inode_item); | |
2272 | ||
2273 | inode->i_mode = btrfs_inode_mode(leaf, inode_item); | |
2274 | inode->i_nlink = btrfs_inode_nlink(leaf, inode_item); | |
2275 | inode->i_uid = btrfs_inode_uid(leaf, inode_item); | |
2276 | inode->i_gid = btrfs_inode_gid(leaf, inode_item); | |
dbe674a9 | 2277 | btrfs_i_size_write(inode, btrfs_inode_size(leaf, inode_item)); |
5f39d397 CM |
2278 | |
2279 | tspec = btrfs_inode_atime(inode_item); | |
2280 | inode->i_atime.tv_sec = btrfs_timespec_sec(leaf, tspec); | |
2281 | inode->i_atime.tv_nsec = btrfs_timespec_nsec(leaf, tspec); | |
2282 | ||
2283 | tspec = btrfs_inode_mtime(inode_item); | |
2284 | inode->i_mtime.tv_sec = btrfs_timespec_sec(leaf, tspec); | |
2285 | inode->i_mtime.tv_nsec = btrfs_timespec_nsec(leaf, tspec); | |
2286 | ||
2287 | tspec = btrfs_inode_ctime(inode_item); | |
2288 | inode->i_ctime.tv_sec = btrfs_timespec_sec(leaf, tspec); | |
2289 | inode->i_ctime.tv_nsec = btrfs_timespec_nsec(leaf, tspec); | |
2290 | ||
a76a3cd4 | 2291 | inode_set_bytes(inode, btrfs_inode_nbytes(leaf, inode_item)); |
e02119d5 | 2292 | BTRFS_I(inode)->generation = btrfs_inode_generation(leaf, inode_item); |
c3027eb5 | 2293 | BTRFS_I(inode)->sequence = btrfs_inode_sequence(leaf, inode_item); |
e02119d5 | 2294 | inode->i_generation = BTRFS_I(inode)->generation; |
618e21d5 | 2295 | inode->i_rdev = 0; |
5f39d397 CM |
2296 | rdev = btrfs_inode_rdev(leaf, inode_item); |
2297 | ||
aec7477b | 2298 | BTRFS_I(inode)->index_cnt = (u64)-1; |
d2fb3437 | 2299 | BTRFS_I(inode)->flags = btrfs_inode_flags(leaf, inode_item); |
aec7477b | 2300 | |
5f39d397 | 2301 | alloc_group_block = btrfs_inode_block_group(leaf, inode_item); |
b4ce94de | 2302 | |
46a53cca CM |
2303 | /* |
2304 | * try to precache a NULL acl entry for files that don't have | |
2305 | * any xattrs or acls | |
2306 | */ | |
2307 | maybe_acls = acls_after_inode_item(leaf, path->slots[0], inode->i_ino); | |
72c04902 AV |
2308 | if (!maybe_acls) |
2309 | cache_no_acl(inode); | |
46a53cca | 2310 | |
d2fb3437 YZ |
2311 | BTRFS_I(inode)->block_group = btrfs_find_block_group(root, 0, |
2312 | alloc_group_block, 0); | |
39279cc3 CM |
2313 | btrfs_free_path(path); |
2314 | inode_item = NULL; | |
2315 | ||
39279cc3 | 2316 | switch (inode->i_mode & S_IFMT) { |
39279cc3 CM |
2317 | case S_IFREG: |
2318 | inode->i_mapping->a_ops = &btrfs_aops; | |
04160088 | 2319 | inode->i_mapping->backing_dev_info = &root->fs_info->bdi; |
d1310b2e | 2320 | BTRFS_I(inode)->io_tree.ops = &btrfs_extent_io_ops; |
39279cc3 CM |
2321 | inode->i_fop = &btrfs_file_operations; |
2322 | inode->i_op = &btrfs_file_inode_operations; | |
2323 | break; | |
2324 | case S_IFDIR: | |
2325 | inode->i_fop = &btrfs_dir_file_operations; | |
2326 | if (root == root->fs_info->tree_root) | |
2327 | inode->i_op = &btrfs_dir_ro_inode_operations; | |
2328 | else | |
2329 | inode->i_op = &btrfs_dir_inode_operations; | |
2330 | break; | |
2331 | case S_IFLNK: | |
2332 | inode->i_op = &btrfs_symlink_inode_operations; | |
2333 | inode->i_mapping->a_ops = &btrfs_symlink_aops; | |
04160088 | 2334 | inode->i_mapping->backing_dev_info = &root->fs_info->bdi; |
39279cc3 | 2335 | break; |
618e21d5 | 2336 | default: |
0279b4cd | 2337 | inode->i_op = &btrfs_special_inode_operations; |
618e21d5 JB |
2338 | init_special_inode(inode, inode->i_mode, rdev); |
2339 | break; | |
39279cc3 | 2340 | } |
6cbff00f CH |
2341 | |
2342 | btrfs_update_iflags(inode); | |
39279cc3 CM |
2343 | return; |
2344 | ||
2345 | make_bad: | |
39279cc3 | 2346 | btrfs_free_path(path); |
39279cc3 CM |
2347 | make_bad_inode(inode); |
2348 | } | |
2349 | ||
d352ac68 CM |
2350 | /* |
2351 | * given a leaf and an inode, copy the inode fields into the leaf | |
2352 | */ | |
e02119d5 CM |
2353 | static void fill_inode_item(struct btrfs_trans_handle *trans, |
2354 | struct extent_buffer *leaf, | |
5f39d397 | 2355 | struct btrfs_inode_item *item, |
39279cc3 CM |
2356 | struct inode *inode) |
2357 | { | |
5f39d397 CM |
2358 | btrfs_set_inode_uid(leaf, item, inode->i_uid); |
2359 | btrfs_set_inode_gid(leaf, item, inode->i_gid); | |
dbe674a9 | 2360 | btrfs_set_inode_size(leaf, item, BTRFS_I(inode)->disk_i_size); |
5f39d397 CM |
2361 | btrfs_set_inode_mode(leaf, item, inode->i_mode); |
2362 | btrfs_set_inode_nlink(leaf, item, inode->i_nlink); | |
2363 | ||
2364 | btrfs_set_timespec_sec(leaf, btrfs_inode_atime(item), | |
2365 | inode->i_atime.tv_sec); | |
2366 | btrfs_set_timespec_nsec(leaf, btrfs_inode_atime(item), | |
2367 | inode->i_atime.tv_nsec); | |
2368 | ||
2369 | btrfs_set_timespec_sec(leaf, btrfs_inode_mtime(item), | |
2370 | inode->i_mtime.tv_sec); | |
2371 | btrfs_set_timespec_nsec(leaf, btrfs_inode_mtime(item), | |
2372 | inode->i_mtime.tv_nsec); | |
2373 | ||
2374 | btrfs_set_timespec_sec(leaf, btrfs_inode_ctime(item), | |
2375 | inode->i_ctime.tv_sec); | |
2376 | btrfs_set_timespec_nsec(leaf, btrfs_inode_ctime(item), | |
2377 | inode->i_ctime.tv_nsec); | |
2378 | ||
a76a3cd4 | 2379 | btrfs_set_inode_nbytes(leaf, item, inode_get_bytes(inode)); |
e02119d5 | 2380 | btrfs_set_inode_generation(leaf, item, BTRFS_I(inode)->generation); |
c3027eb5 | 2381 | btrfs_set_inode_sequence(leaf, item, BTRFS_I(inode)->sequence); |
e02119d5 | 2382 | btrfs_set_inode_transid(leaf, item, trans->transid); |
5f39d397 | 2383 | btrfs_set_inode_rdev(leaf, item, inode->i_rdev); |
b98b6767 | 2384 | btrfs_set_inode_flags(leaf, item, BTRFS_I(inode)->flags); |
d2fb3437 | 2385 | btrfs_set_inode_block_group(leaf, item, BTRFS_I(inode)->block_group); |
39279cc3 CM |
2386 | } |
2387 | ||
d352ac68 CM |
2388 | /* |
2389 | * copy everything in the in-memory inode into the btree. | |
2390 | */ | |
d397712b CM |
2391 | noinline int btrfs_update_inode(struct btrfs_trans_handle *trans, |
2392 | struct btrfs_root *root, struct inode *inode) | |
39279cc3 CM |
2393 | { |
2394 | struct btrfs_inode_item *inode_item; | |
2395 | struct btrfs_path *path; | |
5f39d397 | 2396 | struct extent_buffer *leaf; |
39279cc3 CM |
2397 | int ret; |
2398 | ||
2399 | path = btrfs_alloc_path(); | |
2400 | BUG_ON(!path); | |
b9473439 | 2401 | path->leave_spinning = 1; |
39279cc3 CM |
2402 | ret = btrfs_lookup_inode(trans, root, path, |
2403 | &BTRFS_I(inode)->location, 1); | |
2404 | if (ret) { | |
2405 | if (ret > 0) | |
2406 | ret = -ENOENT; | |
2407 | goto failed; | |
2408 | } | |
2409 | ||
b4ce94de | 2410 | btrfs_unlock_up_safe(path, 1); |
5f39d397 CM |
2411 | leaf = path->nodes[0]; |
2412 | inode_item = btrfs_item_ptr(leaf, path->slots[0], | |
39279cc3 CM |
2413 | struct btrfs_inode_item); |
2414 | ||
e02119d5 | 2415 | fill_inode_item(trans, leaf, inode_item, inode); |
5f39d397 | 2416 | btrfs_mark_buffer_dirty(leaf); |
15ee9bc7 | 2417 | btrfs_set_inode_last_trans(trans, inode); |
39279cc3 CM |
2418 | ret = 0; |
2419 | failed: | |
39279cc3 CM |
2420 | btrfs_free_path(path); |
2421 | return ret; | |
2422 | } | |
2423 | ||
2424 | ||
d352ac68 CM |
2425 | /* |
2426 | * unlink helper that gets used here in inode.c and in the tree logging | |
2427 | * recovery code. It remove a link in a directory with a given name, and | |
2428 | * also drops the back refs in the inode to the directory | |
2429 | */ | |
e02119d5 CM |
2430 | int btrfs_unlink_inode(struct btrfs_trans_handle *trans, |
2431 | struct btrfs_root *root, | |
2432 | struct inode *dir, struct inode *inode, | |
2433 | const char *name, int name_len) | |
39279cc3 CM |
2434 | { |
2435 | struct btrfs_path *path; | |
39279cc3 | 2436 | int ret = 0; |
5f39d397 | 2437 | struct extent_buffer *leaf; |
39279cc3 | 2438 | struct btrfs_dir_item *di; |
5f39d397 | 2439 | struct btrfs_key key; |
aec7477b | 2440 | u64 index; |
39279cc3 CM |
2441 | |
2442 | path = btrfs_alloc_path(); | |
54aa1f4d CM |
2443 | if (!path) { |
2444 | ret = -ENOMEM; | |
2445 | goto err; | |
2446 | } | |
2447 | ||
b9473439 | 2448 | path->leave_spinning = 1; |
39279cc3 CM |
2449 | di = btrfs_lookup_dir_item(trans, root, path, dir->i_ino, |
2450 | name, name_len, -1); | |
2451 | if (IS_ERR(di)) { | |
2452 | ret = PTR_ERR(di); | |
2453 | goto err; | |
2454 | } | |
2455 | if (!di) { | |
2456 | ret = -ENOENT; | |
2457 | goto err; | |
2458 | } | |
5f39d397 CM |
2459 | leaf = path->nodes[0]; |
2460 | btrfs_dir_item_key_to_cpu(leaf, di, &key); | |
39279cc3 | 2461 | ret = btrfs_delete_one_dir_name(trans, root, path, di); |
54aa1f4d CM |
2462 | if (ret) |
2463 | goto err; | |
39279cc3 CM |
2464 | btrfs_release_path(root, path); |
2465 | ||
aec7477b | 2466 | ret = btrfs_del_inode_ref(trans, root, name, name_len, |
e02119d5 CM |
2467 | inode->i_ino, |
2468 | dir->i_ino, &index); | |
aec7477b | 2469 | if (ret) { |
d397712b | 2470 | printk(KERN_INFO "btrfs failed to delete reference to %.*s, " |
aec7477b | 2471 | "inode %lu parent %lu\n", name_len, name, |
e02119d5 | 2472 | inode->i_ino, dir->i_ino); |
aec7477b JB |
2473 | goto err; |
2474 | } | |
2475 | ||
39279cc3 | 2476 | di = btrfs_lookup_dir_index_item(trans, root, path, dir->i_ino, |
aec7477b | 2477 | index, name, name_len, -1); |
39279cc3 CM |
2478 | if (IS_ERR(di)) { |
2479 | ret = PTR_ERR(di); | |
2480 | goto err; | |
2481 | } | |
2482 | if (!di) { | |
2483 | ret = -ENOENT; | |
2484 | goto err; | |
2485 | } | |
2486 | ret = btrfs_delete_one_dir_name(trans, root, path, di); | |
925baedd | 2487 | btrfs_release_path(root, path); |
39279cc3 | 2488 | |
e02119d5 CM |
2489 | ret = btrfs_del_inode_ref_in_log(trans, root, name, name_len, |
2490 | inode, dir->i_ino); | |
49eb7e46 | 2491 | BUG_ON(ret != 0 && ret != -ENOENT); |
e02119d5 CM |
2492 | |
2493 | ret = btrfs_del_dir_entries_in_log(trans, root, name, name_len, | |
2494 | dir, index); | |
2495 | BUG_ON(ret); | |
39279cc3 CM |
2496 | err: |
2497 | btrfs_free_path(path); | |
e02119d5 CM |
2498 | if (ret) |
2499 | goto out; | |
2500 | ||
2501 | btrfs_i_size_write(dir, dir->i_size - name_len * 2); | |
2502 | inode->i_ctime = dir->i_mtime = dir->i_ctime = CURRENT_TIME; | |
2503 | btrfs_update_inode(trans, root, dir); | |
2504 | btrfs_drop_nlink(inode); | |
2505 | ret = btrfs_update_inode(trans, root, inode); | |
e02119d5 | 2506 | out: |
39279cc3 CM |
2507 | return ret; |
2508 | } | |
2509 | ||
2510 | static int btrfs_unlink(struct inode *dir, struct dentry *dentry) | |
2511 | { | |
2512 | struct btrfs_root *root; | |
2513 | struct btrfs_trans_handle *trans; | |
7b128766 | 2514 | struct inode *inode = dentry->d_inode; |
39279cc3 | 2515 | int ret; |
1832a6d5 | 2516 | unsigned long nr = 0; |
39279cc3 CM |
2517 | |
2518 | root = BTRFS_I(dir)->root; | |
1832a6d5 | 2519 | |
5df6a9f6 JB |
2520 | /* |
2521 | * 5 items for unlink inode | |
2522 | * 1 for orphan | |
2523 | */ | |
2524 | ret = btrfs_reserve_metadata_space(root, 6); | |
2525 | if (ret) | |
2526 | return ret; | |
2527 | ||
39279cc3 | 2528 | trans = btrfs_start_transaction(root, 1); |
5df6a9f6 JB |
2529 | if (IS_ERR(trans)) { |
2530 | btrfs_unreserve_metadata_space(root, 6); | |
2531 | return PTR_ERR(trans); | |
2532 | } | |
5f39d397 | 2533 | |
39279cc3 | 2534 | btrfs_set_trans_block_group(trans, dir); |
12fcfd22 CM |
2535 | |
2536 | btrfs_record_unlink_dir(trans, dir, dentry->d_inode, 0); | |
2537 | ||
e02119d5 CM |
2538 | ret = btrfs_unlink_inode(trans, root, dir, dentry->d_inode, |
2539 | dentry->d_name.name, dentry->d_name.len); | |
7b128766 JB |
2540 | |
2541 | if (inode->i_nlink == 0) | |
2542 | ret = btrfs_orphan_add(trans, inode); | |
2543 | ||
d3c2fdcf | 2544 | nr = trans->blocks_used; |
5f39d397 | 2545 | |
89ce8a63 | 2546 | btrfs_end_transaction_throttle(trans, root); |
5df6a9f6 | 2547 | btrfs_unreserve_metadata_space(root, 6); |
d3c2fdcf | 2548 | btrfs_btree_balance_dirty(root, nr); |
39279cc3 CM |
2549 | return ret; |
2550 | } | |
2551 | ||
4df27c4d YZ |
2552 | int btrfs_unlink_subvol(struct btrfs_trans_handle *trans, |
2553 | struct btrfs_root *root, | |
2554 | struct inode *dir, u64 objectid, | |
2555 | const char *name, int name_len) | |
2556 | { | |
2557 | struct btrfs_path *path; | |
2558 | struct extent_buffer *leaf; | |
2559 | struct btrfs_dir_item *di; | |
2560 | struct btrfs_key key; | |
2561 | u64 index; | |
2562 | int ret; | |
2563 | ||
2564 | path = btrfs_alloc_path(); | |
2565 | if (!path) | |
2566 | return -ENOMEM; | |
2567 | ||
2568 | di = btrfs_lookup_dir_item(trans, root, path, dir->i_ino, | |
2569 | name, name_len, -1); | |
2570 | BUG_ON(!di || IS_ERR(di)); | |
2571 | ||
2572 | leaf = path->nodes[0]; | |
2573 | btrfs_dir_item_key_to_cpu(leaf, di, &key); | |
2574 | WARN_ON(key.type != BTRFS_ROOT_ITEM_KEY || key.objectid != objectid); | |
2575 | ret = btrfs_delete_one_dir_name(trans, root, path, di); | |
2576 | BUG_ON(ret); | |
2577 | btrfs_release_path(root, path); | |
2578 | ||
2579 | ret = btrfs_del_root_ref(trans, root->fs_info->tree_root, | |
2580 | objectid, root->root_key.objectid, | |
2581 | dir->i_ino, &index, name, name_len); | |
2582 | if (ret < 0) { | |
2583 | BUG_ON(ret != -ENOENT); | |
2584 | di = btrfs_search_dir_index_item(root, path, dir->i_ino, | |
2585 | name, name_len); | |
2586 | BUG_ON(!di || IS_ERR(di)); | |
2587 | ||
2588 | leaf = path->nodes[0]; | |
2589 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); | |
2590 | btrfs_release_path(root, path); | |
2591 | index = key.offset; | |
2592 | } | |
2593 | ||
2594 | di = btrfs_lookup_dir_index_item(trans, root, path, dir->i_ino, | |
2595 | index, name, name_len, -1); | |
2596 | BUG_ON(!di || IS_ERR(di)); | |
2597 | ||
2598 | leaf = path->nodes[0]; | |
2599 | btrfs_dir_item_key_to_cpu(leaf, di, &key); | |
2600 | WARN_ON(key.type != BTRFS_ROOT_ITEM_KEY || key.objectid != objectid); | |
2601 | ret = btrfs_delete_one_dir_name(trans, root, path, di); | |
2602 | BUG_ON(ret); | |
2603 | btrfs_release_path(root, path); | |
2604 | ||
2605 | btrfs_i_size_write(dir, dir->i_size - name_len * 2); | |
2606 | dir->i_mtime = dir->i_ctime = CURRENT_TIME; | |
2607 | ret = btrfs_update_inode(trans, root, dir); | |
2608 | BUG_ON(ret); | |
2609 | dir->i_sb->s_dirt = 1; | |
2610 | ||
2611 | btrfs_free_path(path); | |
2612 | return 0; | |
2613 | } | |
2614 | ||
39279cc3 CM |
2615 | static int btrfs_rmdir(struct inode *dir, struct dentry *dentry) |
2616 | { | |
2617 | struct inode *inode = dentry->d_inode; | |
1832a6d5 | 2618 | int err = 0; |
39279cc3 CM |
2619 | int ret; |
2620 | struct btrfs_root *root = BTRFS_I(dir)->root; | |
39279cc3 | 2621 | struct btrfs_trans_handle *trans; |
1832a6d5 | 2622 | unsigned long nr = 0; |
39279cc3 | 2623 | |
3394e160 | 2624 | if (inode->i_size > BTRFS_EMPTY_DIR_SIZE || |
4df27c4d | 2625 | inode->i_ino == BTRFS_FIRST_FREE_OBJECTID) |
134d4512 Y |
2626 | return -ENOTEMPTY; |
2627 | ||
5df6a9f6 JB |
2628 | ret = btrfs_reserve_metadata_space(root, 5); |
2629 | if (ret) | |
2630 | return ret; | |
2631 | ||
39279cc3 | 2632 | trans = btrfs_start_transaction(root, 1); |
5df6a9f6 JB |
2633 | if (IS_ERR(trans)) { |
2634 | btrfs_unreserve_metadata_space(root, 5); | |
2635 | return PTR_ERR(trans); | |
2636 | } | |
2637 | ||
39279cc3 | 2638 | btrfs_set_trans_block_group(trans, dir); |
39279cc3 | 2639 | |
4df27c4d YZ |
2640 | if (unlikely(inode->i_ino == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID)) { |
2641 | err = btrfs_unlink_subvol(trans, root, dir, | |
2642 | BTRFS_I(inode)->location.objectid, | |
2643 | dentry->d_name.name, | |
2644 | dentry->d_name.len); | |
2645 | goto out; | |
2646 | } | |
2647 | ||
7b128766 JB |
2648 | err = btrfs_orphan_add(trans, inode); |
2649 | if (err) | |
4df27c4d | 2650 | goto out; |
7b128766 | 2651 | |
39279cc3 | 2652 | /* now the directory is empty */ |
e02119d5 CM |
2653 | err = btrfs_unlink_inode(trans, root, dir, dentry->d_inode, |
2654 | dentry->d_name.name, dentry->d_name.len); | |
d397712b | 2655 | if (!err) |
dbe674a9 | 2656 | btrfs_i_size_write(inode, 0); |
4df27c4d | 2657 | out: |
d3c2fdcf | 2658 | nr = trans->blocks_used; |
89ce8a63 | 2659 | ret = btrfs_end_transaction_throttle(trans, root); |
5df6a9f6 | 2660 | btrfs_unreserve_metadata_space(root, 5); |
d3c2fdcf | 2661 | btrfs_btree_balance_dirty(root, nr); |
3954401f | 2662 | |
39279cc3 CM |
2663 | if (ret && !err) |
2664 | err = ret; | |
2665 | return err; | |
2666 | } | |
2667 | ||
d20f7043 | 2668 | #if 0 |
323ac95b CM |
2669 | /* |
2670 | * when truncating bytes in a file, it is possible to avoid reading | |
2671 | * the leaves that contain only checksum items. This can be the | |
2672 | * majority of the IO required to delete a large file, but it must | |
2673 | * be done carefully. | |
2674 | * | |
2675 | * The keys in the level just above the leaves are checked to make sure | |
2676 | * the lowest key in a given leaf is a csum key, and starts at an offset | |
2677 | * after the new size. | |
2678 | * | |
2679 | * Then the key for the next leaf is checked to make sure it also has | |
2680 | * a checksum item for the same file. If it does, we know our target leaf | |
2681 | * contains only checksum items, and it can be safely freed without reading | |
2682 | * it. | |
2683 | * | |
2684 | * This is just an optimization targeted at large files. It may do | |
2685 | * nothing. It will return 0 unless things went badly. | |
2686 | */ | |
2687 | static noinline int drop_csum_leaves(struct btrfs_trans_handle *trans, | |
2688 | struct btrfs_root *root, | |
2689 | struct btrfs_path *path, | |
2690 | struct inode *inode, u64 new_size) | |
2691 | { | |
2692 | struct btrfs_key key; | |
2693 | int ret; | |
2694 | int nritems; | |
2695 | struct btrfs_key found_key; | |
2696 | struct btrfs_key other_key; | |
5b84e8d6 YZ |
2697 | struct btrfs_leaf_ref *ref; |
2698 | u64 leaf_gen; | |
2699 | u64 leaf_start; | |
323ac95b CM |
2700 | |
2701 | path->lowest_level = 1; | |
2702 | key.objectid = inode->i_ino; | |
2703 | key.type = BTRFS_CSUM_ITEM_KEY; | |
2704 | key.offset = new_size; | |
2705 | again: | |
2706 | ret = btrfs_search_slot(trans, root, &key, path, -1, 1); | |
2707 | if (ret < 0) | |
2708 | goto out; | |
2709 | ||
2710 | if (path->nodes[1] == NULL) { | |
2711 | ret = 0; | |
2712 | goto out; | |
2713 | } | |
2714 | ret = 0; | |
2715 | btrfs_node_key_to_cpu(path->nodes[1], &found_key, path->slots[1]); | |
2716 | nritems = btrfs_header_nritems(path->nodes[1]); | |
2717 | ||
2718 | if (!nritems) | |
2719 | goto out; | |
2720 | ||
2721 | if (path->slots[1] >= nritems) | |
2722 | goto next_node; | |
2723 | ||
2724 | /* did we find a key greater than anything we want to delete? */ | |
2725 | if (found_key.objectid > inode->i_ino || | |
2726 | (found_key.objectid == inode->i_ino && found_key.type > key.type)) | |
2727 | goto out; | |
2728 | ||
2729 | /* we check the next key in the node to make sure the leave contains | |
2730 | * only checksum items. This comparison doesn't work if our | |
2731 | * leaf is the last one in the node | |
2732 | */ | |
2733 | if (path->slots[1] + 1 >= nritems) { | |
2734 | next_node: | |
2735 | /* search forward from the last key in the node, this | |
2736 | * will bring us into the next node in the tree | |
2737 | */ | |
2738 | btrfs_node_key_to_cpu(path->nodes[1], &found_key, nritems - 1); | |
2739 | ||
2740 | /* unlikely, but we inc below, so check to be safe */ | |
2741 | if (found_key.offset == (u64)-1) | |
2742 | goto out; | |
2743 | ||
2744 | /* search_forward needs a path with locks held, do the | |
2745 | * search again for the original key. It is possible | |
2746 | * this will race with a balance and return a path that | |
2747 | * we could modify, but this drop is just an optimization | |
2748 | * and is allowed to miss some leaves. | |
2749 | */ | |
2750 | btrfs_release_path(root, path); | |
2751 | found_key.offset++; | |
2752 | ||
2753 | /* setup a max key for search_forward */ | |
2754 | other_key.offset = (u64)-1; | |
2755 | other_key.type = key.type; | |
2756 | other_key.objectid = key.objectid; | |
2757 | ||
2758 | path->keep_locks = 1; | |
2759 | ret = btrfs_search_forward(root, &found_key, &other_key, | |
2760 | path, 0, 0); | |
2761 | path->keep_locks = 0; | |
2762 | if (ret || found_key.objectid != key.objectid || | |
2763 | found_key.type != key.type) { | |
2764 | ret = 0; | |
2765 | goto out; | |
2766 | } | |
2767 | ||
2768 | key.offset = found_key.offset; | |
2769 | btrfs_release_path(root, path); | |
2770 | cond_resched(); | |
2771 | goto again; | |
2772 | } | |
2773 | ||
2774 | /* we know there's one more slot after us in the tree, | |
2775 | * read that key so we can verify it is also a checksum item | |
2776 | */ | |
2777 | btrfs_node_key_to_cpu(path->nodes[1], &other_key, path->slots[1] + 1); | |
2778 | ||
2779 | if (found_key.objectid < inode->i_ino) | |
2780 | goto next_key; | |
2781 | ||
2782 | if (found_key.type != key.type || found_key.offset < new_size) | |
2783 | goto next_key; | |
2784 | ||
2785 | /* | |
2786 | * if the key for the next leaf isn't a csum key from this objectid, | |
2787 | * we can't be sure there aren't good items inside this leaf. | |
2788 | * Bail out | |
2789 | */ | |
2790 | if (other_key.objectid != inode->i_ino || other_key.type != key.type) | |
2791 | goto out; | |
2792 | ||
5b84e8d6 YZ |
2793 | leaf_start = btrfs_node_blockptr(path->nodes[1], path->slots[1]); |
2794 | leaf_gen = btrfs_node_ptr_generation(path->nodes[1], path->slots[1]); | |
323ac95b CM |
2795 | /* |
2796 | * it is safe to delete this leaf, it contains only | |
2797 | * csum items from this inode at an offset >= new_size | |
2798 | */ | |
5b84e8d6 | 2799 | ret = btrfs_del_leaf(trans, root, path, leaf_start); |
323ac95b CM |
2800 | BUG_ON(ret); |
2801 | ||
5b84e8d6 YZ |
2802 | if (root->ref_cows && leaf_gen < trans->transid) { |
2803 | ref = btrfs_alloc_leaf_ref(root, 0); | |
2804 | if (ref) { | |
2805 | ref->root_gen = root->root_key.offset; | |
2806 | ref->bytenr = leaf_start; | |
2807 | ref->owner = 0; | |
2808 | ref->generation = leaf_gen; | |
2809 | ref->nritems = 0; | |
2810 | ||
bd56b302 CM |
2811 | btrfs_sort_leaf_ref(ref); |
2812 | ||
5b84e8d6 YZ |
2813 | ret = btrfs_add_leaf_ref(root, ref, 0); |
2814 | WARN_ON(ret); | |
2815 | btrfs_free_leaf_ref(root, ref); | |
2816 | } else { | |
2817 | WARN_ON(1); | |
2818 | } | |
2819 | } | |
323ac95b CM |
2820 | next_key: |
2821 | btrfs_release_path(root, path); | |
2822 | ||
2823 | if (other_key.objectid == inode->i_ino && | |
2824 | other_key.type == key.type && other_key.offset > key.offset) { | |
2825 | key.offset = other_key.offset; | |
2826 | cond_resched(); | |
2827 | goto again; | |
2828 | } | |
2829 | ret = 0; | |
2830 | out: | |
2831 | /* fixup any changes we've made to the path */ | |
2832 | path->lowest_level = 0; | |
2833 | path->keep_locks = 0; | |
2834 | btrfs_release_path(root, path); | |
2835 | return ret; | |
2836 | } | |
2837 | ||
d20f7043 CM |
2838 | #endif |
2839 | ||
39279cc3 CM |
2840 | /* |
2841 | * this can truncate away extent items, csum items and directory items. | |
2842 | * It starts at a high offset and removes keys until it can't find | |
d352ac68 | 2843 | * any higher than new_size |
39279cc3 CM |
2844 | * |
2845 | * csum items that cross the new i_size are truncated to the new size | |
2846 | * as well. | |
7b128766 JB |
2847 | * |
2848 | * min_type is the minimum key type to truncate down to. If set to 0, this | |
2849 | * will kill all the items on this inode, including the INODE_ITEM_KEY. | |
39279cc3 | 2850 | */ |
8082510e YZ |
2851 | int btrfs_truncate_inode_items(struct btrfs_trans_handle *trans, |
2852 | struct btrfs_root *root, | |
2853 | struct inode *inode, | |
2854 | u64 new_size, u32 min_type) | |
39279cc3 | 2855 | { |
39279cc3 | 2856 | struct btrfs_path *path; |
5f39d397 | 2857 | struct extent_buffer *leaf; |
39279cc3 | 2858 | struct btrfs_file_extent_item *fi; |
8082510e YZ |
2859 | struct btrfs_key key; |
2860 | struct btrfs_key found_key; | |
39279cc3 | 2861 | u64 extent_start = 0; |
db94535d | 2862 | u64 extent_num_bytes = 0; |
5d4f98a2 | 2863 | u64 extent_offset = 0; |
39279cc3 | 2864 | u64 item_end = 0; |
8082510e YZ |
2865 | u64 mask = root->sectorsize - 1; |
2866 | u32 found_type = (u8)-1; | |
39279cc3 CM |
2867 | int found_extent; |
2868 | int del_item; | |
85e21bac CM |
2869 | int pending_del_nr = 0; |
2870 | int pending_del_slot = 0; | |
179e29e4 | 2871 | int extent_type = -1; |
771ed689 | 2872 | int encoding; |
8082510e YZ |
2873 | int ret; |
2874 | int err = 0; | |
2875 | ||
2876 | BUG_ON(new_size > 0 && min_type != BTRFS_EXTENT_DATA_KEY); | |
39279cc3 | 2877 | |
e02119d5 | 2878 | if (root->ref_cows) |
5b21f2ed | 2879 | btrfs_drop_extent_cache(inode, new_size & (~mask), (u64)-1, 0); |
8082510e | 2880 | |
39279cc3 CM |
2881 | path = btrfs_alloc_path(); |
2882 | BUG_ON(!path); | |
33c17ad5 | 2883 | path->reada = -1; |
5f39d397 | 2884 | |
39279cc3 CM |
2885 | key.objectid = inode->i_ino; |
2886 | key.offset = (u64)-1; | |
5f39d397 CM |
2887 | key.type = (u8)-1; |
2888 | ||
85e21bac | 2889 | search_again: |
b9473439 | 2890 | path->leave_spinning = 1; |
85e21bac | 2891 | ret = btrfs_search_slot(trans, root, &key, path, -1, 1); |
8082510e YZ |
2892 | if (ret < 0) { |
2893 | err = ret; | |
2894 | goto out; | |
2895 | } | |
d397712b | 2896 | |
85e21bac | 2897 | if (ret > 0) { |
e02119d5 CM |
2898 | /* there are no items in the tree for us to truncate, we're |
2899 | * done | |
2900 | */ | |
8082510e YZ |
2901 | if (path->slots[0] == 0) |
2902 | goto out; | |
85e21bac CM |
2903 | path->slots[0]--; |
2904 | } | |
2905 | ||
d397712b | 2906 | while (1) { |
39279cc3 | 2907 | fi = NULL; |
5f39d397 CM |
2908 | leaf = path->nodes[0]; |
2909 | btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); | |
2910 | found_type = btrfs_key_type(&found_key); | |
771ed689 | 2911 | encoding = 0; |
39279cc3 | 2912 | |
5f39d397 | 2913 | if (found_key.objectid != inode->i_ino) |
39279cc3 | 2914 | break; |
5f39d397 | 2915 | |
85e21bac | 2916 | if (found_type < min_type) |
39279cc3 CM |
2917 | break; |
2918 | ||
5f39d397 | 2919 | item_end = found_key.offset; |
39279cc3 | 2920 | if (found_type == BTRFS_EXTENT_DATA_KEY) { |
5f39d397 | 2921 | fi = btrfs_item_ptr(leaf, path->slots[0], |
39279cc3 | 2922 | struct btrfs_file_extent_item); |
179e29e4 | 2923 | extent_type = btrfs_file_extent_type(leaf, fi); |
771ed689 CM |
2924 | encoding = btrfs_file_extent_compression(leaf, fi); |
2925 | encoding |= btrfs_file_extent_encryption(leaf, fi); | |
2926 | encoding |= btrfs_file_extent_other_encoding(leaf, fi); | |
2927 | ||
179e29e4 | 2928 | if (extent_type != BTRFS_FILE_EXTENT_INLINE) { |
5f39d397 | 2929 | item_end += |
db94535d | 2930 | btrfs_file_extent_num_bytes(leaf, fi); |
179e29e4 | 2931 | } else if (extent_type == BTRFS_FILE_EXTENT_INLINE) { |
179e29e4 | 2932 | item_end += btrfs_file_extent_inline_len(leaf, |
c8b97818 | 2933 | fi); |
39279cc3 | 2934 | } |
008630c1 | 2935 | item_end--; |
39279cc3 | 2936 | } |
8082510e YZ |
2937 | if (found_type > min_type) { |
2938 | del_item = 1; | |
2939 | } else { | |
2940 | if (item_end < new_size) | |
b888db2b | 2941 | break; |
8082510e YZ |
2942 | if (found_key.offset >= new_size) |
2943 | del_item = 1; | |
2944 | else | |
2945 | del_item = 0; | |
39279cc3 | 2946 | } |
39279cc3 | 2947 | found_extent = 0; |
39279cc3 | 2948 | /* FIXME, shrink the extent if the ref count is only 1 */ |
179e29e4 CM |
2949 | if (found_type != BTRFS_EXTENT_DATA_KEY) |
2950 | goto delete; | |
2951 | ||
2952 | if (extent_type != BTRFS_FILE_EXTENT_INLINE) { | |
39279cc3 | 2953 | u64 num_dec; |
db94535d | 2954 | extent_start = btrfs_file_extent_disk_bytenr(leaf, fi); |
771ed689 | 2955 | if (!del_item && !encoding) { |
db94535d CM |
2956 | u64 orig_num_bytes = |
2957 | btrfs_file_extent_num_bytes(leaf, fi); | |
e02119d5 | 2958 | extent_num_bytes = new_size - |
5f39d397 | 2959 | found_key.offset + root->sectorsize - 1; |
b1632b10 Y |
2960 | extent_num_bytes = extent_num_bytes & |
2961 | ~((u64)root->sectorsize - 1); | |
db94535d CM |
2962 | btrfs_set_file_extent_num_bytes(leaf, fi, |
2963 | extent_num_bytes); | |
2964 | num_dec = (orig_num_bytes - | |
9069218d | 2965 | extent_num_bytes); |
e02119d5 | 2966 | if (root->ref_cows && extent_start != 0) |
a76a3cd4 | 2967 | inode_sub_bytes(inode, num_dec); |
5f39d397 | 2968 | btrfs_mark_buffer_dirty(leaf); |
39279cc3 | 2969 | } else { |
db94535d CM |
2970 | extent_num_bytes = |
2971 | btrfs_file_extent_disk_num_bytes(leaf, | |
2972 | fi); | |
5d4f98a2 YZ |
2973 | extent_offset = found_key.offset - |
2974 | btrfs_file_extent_offset(leaf, fi); | |
2975 | ||
39279cc3 | 2976 | /* FIXME blocksize != 4096 */ |
9069218d | 2977 | num_dec = btrfs_file_extent_num_bytes(leaf, fi); |
39279cc3 CM |
2978 | if (extent_start != 0) { |
2979 | found_extent = 1; | |
e02119d5 | 2980 | if (root->ref_cows) |
a76a3cd4 | 2981 | inode_sub_bytes(inode, num_dec); |
e02119d5 | 2982 | } |
39279cc3 | 2983 | } |
9069218d | 2984 | } else if (extent_type == BTRFS_FILE_EXTENT_INLINE) { |
c8b97818 CM |
2985 | /* |
2986 | * we can't truncate inline items that have had | |
2987 | * special encodings | |
2988 | */ | |
2989 | if (!del_item && | |
2990 | btrfs_file_extent_compression(leaf, fi) == 0 && | |
2991 | btrfs_file_extent_encryption(leaf, fi) == 0 && | |
2992 | btrfs_file_extent_other_encoding(leaf, fi) == 0) { | |
e02119d5 CM |
2993 | u32 size = new_size - found_key.offset; |
2994 | ||
2995 | if (root->ref_cows) { | |
a76a3cd4 YZ |
2996 | inode_sub_bytes(inode, item_end + 1 - |
2997 | new_size); | |
e02119d5 CM |
2998 | } |
2999 | size = | |
3000 | btrfs_file_extent_calc_inline_size(size); | |
9069218d | 3001 | ret = btrfs_truncate_item(trans, root, path, |
e02119d5 | 3002 | size, 1); |
9069218d | 3003 | BUG_ON(ret); |
e02119d5 | 3004 | } else if (root->ref_cows) { |
a76a3cd4 YZ |
3005 | inode_sub_bytes(inode, item_end + 1 - |
3006 | found_key.offset); | |
9069218d | 3007 | } |
39279cc3 | 3008 | } |
179e29e4 | 3009 | delete: |
39279cc3 | 3010 | if (del_item) { |
85e21bac CM |
3011 | if (!pending_del_nr) { |
3012 | /* no pending yet, add ourselves */ | |
3013 | pending_del_slot = path->slots[0]; | |
3014 | pending_del_nr = 1; | |
3015 | } else if (pending_del_nr && | |
3016 | path->slots[0] + 1 == pending_del_slot) { | |
3017 | /* hop on the pending chunk */ | |
3018 | pending_del_nr++; | |
3019 | pending_del_slot = path->slots[0]; | |
3020 | } else { | |
d397712b | 3021 | BUG(); |
85e21bac | 3022 | } |
39279cc3 CM |
3023 | } else { |
3024 | break; | |
3025 | } | |
5d4f98a2 | 3026 | if (found_extent && root->ref_cows) { |
b9473439 | 3027 | btrfs_set_path_blocking(path); |
39279cc3 | 3028 | ret = btrfs_free_extent(trans, root, extent_start, |
5d4f98a2 YZ |
3029 | extent_num_bytes, 0, |
3030 | btrfs_header_owner(leaf), | |
3031 | inode->i_ino, extent_offset); | |
39279cc3 CM |
3032 | BUG_ON(ret); |
3033 | } | |
85e21bac | 3034 | |
8082510e YZ |
3035 | if (found_type == BTRFS_INODE_ITEM_KEY) |
3036 | break; | |
3037 | ||
3038 | if (path->slots[0] == 0 || | |
3039 | path->slots[0] != pending_del_slot) { | |
3040 | if (root->ref_cows) { | |
3041 | err = -EAGAIN; | |
3042 | goto out; | |
3043 | } | |
3044 | if (pending_del_nr) { | |
3045 | ret = btrfs_del_items(trans, root, path, | |
3046 | pending_del_slot, | |
3047 | pending_del_nr); | |
3048 | BUG_ON(ret); | |
3049 | pending_del_nr = 0; | |
3050 | } | |
85e21bac CM |
3051 | btrfs_release_path(root, path); |
3052 | goto search_again; | |
8082510e YZ |
3053 | } else { |
3054 | path->slots[0]--; | |
85e21bac | 3055 | } |
39279cc3 | 3056 | } |
8082510e | 3057 | out: |
85e21bac CM |
3058 | if (pending_del_nr) { |
3059 | ret = btrfs_del_items(trans, root, path, pending_del_slot, | |
3060 | pending_del_nr); | |
3061 | } | |
39279cc3 | 3062 | btrfs_free_path(path); |
8082510e | 3063 | return err; |
39279cc3 CM |
3064 | } |
3065 | ||
3066 | /* | |
3067 | * taken from block_truncate_page, but does cow as it zeros out | |
3068 | * any bytes left in the last page in the file. | |
3069 | */ | |
3070 | static int btrfs_truncate_page(struct address_space *mapping, loff_t from) | |
3071 | { | |
3072 | struct inode *inode = mapping->host; | |
db94535d | 3073 | struct btrfs_root *root = BTRFS_I(inode)->root; |
e6dcd2dc CM |
3074 | struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree; |
3075 | struct btrfs_ordered_extent *ordered; | |
3076 | char *kaddr; | |
db94535d | 3077 | u32 blocksize = root->sectorsize; |
39279cc3 CM |
3078 | pgoff_t index = from >> PAGE_CACHE_SHIFT; |
3079 | unsigned offset = from & (PAGE_CACHE_SIZE-1); | |
3080 | struct page *page; | |
39279cc3 | 3081 | int ret = 0; |
a52d9a80 | 3082 | u64 page_start; |
e6dcd2dc | 3083 | u64 page_end; |
39279cc3 CM |
3084 | |
3085 | if ((offset & (blocksize - 1)) == 0) | |
3086 | goto out; | |
5d5e103a JB |
3087 | ret = btrfs_check_data_free_space(root, inode, PAGE_CACHE_SIZE); |
3088 | if (ret) | |
3089 | goto out; | |
3090 | ||
3091 | ret = btrfs_reserve_metadata_for_delalloc(root, inode, 1); | |
3092 | if (ret) | |
3093 | goto out; | |
39279cc3 CM |
3094 | |
3095 | ret = -ENOMEM; | |
211c17f5 | 3096 | again: |
39279cc3 | 3097 | page = grab_cache_page(mapping, index); |
5d5e103a JB |
3098 | if (!page) { |
3099 | btrfs_free_reserved_data_space(root, inode, PAGE_CACHE_SIZE); | |
3100 | btrfs_unreserve_metadata_for_delalloc(root, inode, 1); | |
39279cc3 | 3101 | goto out; |
5d5e103a | 3102 | } |
e6dcd2dc CM |
3103 | |
3104 | page_start = page_offset(page); | |
3105 | page_end = page_start + PAGE_CACHE_SIZE - 1; | |
3106 | ||
39279cc3 | 3107 | if (!PageUptodate(page)) { |
9ebefb18 | 3108 | ret = btrfs_readpage(NULL, page); |
39279cc3 | 3109 | lock_page(page); |
211c17f5 CM |
3110 | if (page->mapping != mapping) { |
3111 | unlock_page(page); | |
3112 | page_cache_release(page); | |
3113 | goto again; | |
3114 | } | |
39279cc3 CM |
3115 | if (!PageUptodate(page)) { |
3116 | ret = -EIO; | |
89642229 | 3117 | goto out_unlock; |
39279cc3 CM |
3118 | } |
3119 | } | |
211c17f5 | 3120 | wait_on_page_writeback(page); |
e6dcd2dc CM |
3121 | |
3122 | lock_extent(io_tree, page_start, page_end, GFP_NOFS); | |
3123 | set_page_extent_mapped(page); | |
3124 | ||
3125 | ordered = btrfs_lookup_ordered_extent(inode, page_start); | |
3126 | if (ordered) { | |
3127 | unlock_extent(io_tree, page_start, page_end, GFP_NOFS); | |
3128 | unlock_page(page); | |
3129 | page_cache_release(page); | |
eb84ae03 | 3130 | btrfs_start_ordered_extent(inode, ordered, 1); |
e6dcd2dc CM |
3131 | btrfs_put_ordered_extent(ordered); |
3132 | goto again; | |
3133 | } | |
3134 | ||
5d5e103a JB |
3135 | clear_extent_bits(&BTRFS_I(inode)->io_tree, page_start, page_end, |
3136 | EXTENT_DIRTY | EXTENT_DELALLOC | EXTENT_DO_ACCOUNTING, | |
3137 | GFP_NOFS); | |
3138 | ||
9ed74f2d JB |
3139 | ret = btrfs_set_extent_delalloc(inode, page_start, page_end); |
3140 | if (ret) { | |
3141 | unlock_extent(io_tree, page_start, page_end, GFP_NOFS); | |
3142 | goto out_unlock; | |
3143 | } | |
3144 | ||
e6dcd2dc CM |
3145 | ret = 0; |
3146 | if (offset != PAGE_CACHE_SIZE) { | |
3147 | kaddr = kmap(page); | |
3148 | memset(kaddr + offset, 0, PAGE_CACHE_SIZE - offset); | |
3149 | flush_dcache_page(page); | |
3150 | kunmap(page); | |
3151 | } | |
247e743c | 3152 | ClearPageChecked(page); |
e6dcd2dc CM |
3153 | set_page_dirty(page); |
3154 | unlock_extent(io_tree, page_start, page_end, GFP_NOFS); | |
39279cc3 | 3155 | |
89642229 | 3156 | out_unlock: |
5d5e103a JB |
3157 | if (ret) |
3158 | btrfs_free_reserved_data_space(root, inode, PAGE_CACHE_SIZE); | |
3159 | btrfs_unreserve_metadata_for_delalloc(root, inode, 1); | |
39279cc3 CM |
3160 | unlock_page(page); |
3161 | page_cache_release(page); | |
3162 | out: | |
3163 | return ret; | |
3164 | } | |
3165 | ||
9036c102 | 3166 | int btrfs_cont_expand(struct inode *inode, loff_t size) |
39279cc3 | 3167 | { |
9036c102 YZ |
3168 | struct btrfs_trans_handle *trans; |
3169 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
3170 | struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree; | |
3171 | struct extent_map *em; | |
3172 | u64 mask = root->sectorsize - 1; | |
3173 | u64 hole_start = (inode->i_size + mask) & ~mask; | |
3174 | u64 block_end = (size + mask) & ~mask; | |
3175 | u64 last_byte; | |
3176 | u64 cur_offset; | |
3177 | u64 hole_size; | |
9ed74f2d | 3178 | int err = 0; |
39279cc3 | 3179 | |
9036c102 YZ |
3180 | if (size <= hole_start) |
3181 | return 0; | |
3182 | ||
9036c102 YZ |
3183 | while (1) { |
3184 | struct btrfs_ordered_extent *ordered; | |
3185 | btrfs_wait_ordered_range(inode, hole_start, | |
3186 | block_end - hole_start); | |
3187 | lock_extent(io_tree, hole_start, block_end - 1, GFP_NOFS); | |
3188 | ordered = btrfs_lookup_ordered_extent(inode, hole_start); | |
3189 | if (!ordered) | |
3190 | break; | |
3191 | unlock_extent(io_tree, hole_start, block_end - 1, GFP_NOFS); | |
3192 | btrfs_put_ordered_extent(ordered); | |
3193 | } | |
39279cc3 | 3194 | |
9036c102 YZ |
3195 | cur_offset = hole_start; |
3196 | while (1) { | |
3197 | em = btrfs_get_extent(inode, NULL, 0, cur_offset, | |
3198 | block_end - cur_offset, 0); | |
3199 | BUG_ON(IS_ERR(em) || !em); | |
3200 | last_byte = min(extent_map_end(em), block_end); | |
3201 | last_byte = (last_byte + mask) & ~mask; | |
8082510e | 3202 | if (!test_bit(EXTENT_FLAG_PREALLOC, &em->flags)) { |
771ed689 | 3203 | u64 hint_byte = 0; |
9036c102 | 3204 | hole_size = last_byte - cur_offset; |
9ed74f2d | 3205 | |
8082510e | 3206 | err = btrfs_reserve_metadata_space(root, 2); |
9ed74f2d JB |
3207 | if (err) |
3208 | break; | |
3209 | ||
8082510e YZ |
3210 | trans = btrfs_start_transaction(root, 1); |
3211 | btrfs_set_trans_block_group(trans, inode); | |
3212 | ||
3213 | err = btrfs_drop_extents(trans, inode, cur_offset, | |
3214 | cur_offset + hole_size, | |
3215 | &hint_byte, 1); | |
3216 | BUG_ON(err); | |
3217 | ||
9036c102 YZ |
3218 | err = btrfs_insert_file_extent(trans, root, |
3219 | inode->i_ino, cur_offset, 0, | |
3220 | 0, hole_size, 0, hole_size, | |
3221 | 0, 0, 0); | |
8082510e YZ |
3222 | BUG_ON(err); |
3223 | ||
9036c102 YZ |
3224 | btrfs_drop_extent_cache(inode, hole_start, |
3225 | last_byte - 1, 0); | |
8082510e YZ |
3226 | |
3227 | btrfs_end_transaction(trans, root); | |
3228 | btrfs_unreserve_metadata_space(root, 2); | |
9036c102 YZ |
3229 | } |
3230 | free_extent_map(em); | |
3231 | cur_offset = last_byte; | |
8082510e | 3232 | if (cur_offset >= block_end) |
9036c102 YZ |
3233 | break; |
3234 | } | |
1832a6d5 | 3235 | |
9036c102 YZ |
3236 | unlock_extent(io_tree, hole_start, block_end - 1, GFP_NOFS); |
3237 | return err; | |
3238 | } | |
39279cc3 | 3239 | |
8082510e YZ |
3240 | static int btrfs_setattr_size(struct inode *inode, struct iattr *attr) |
3241 | { | |
3242 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
3243 | struct btrfs_trans_handle *trans; | |
3244 | unsigned long nr; | |
3245 | int ret; | |
3246 | ||
3247 | if (attr->ia_size == inode->i_size) | |
3248 | return 0; | |
3249 | ||
3250 | if (attr->ia_size > inode->i_size) { | |
3251 | unsigned long limit; | |
3252 | limit = current->signal->rlim[RLIMIT_FSIZE].rlim_cur; | |
3253 | if (attr->ia_size > inode->i_sb->s_maxbytes) | |
3254 | return -EFBIG; | |
3255 | if (limit != RLIM_INFINITY && attr->ia_size > limit) { | |
3256 | send_sig(SIGXFSZ, current, 0); | |
3257 | return -EFBIG; | |
3258 | } | |
3259 | } | |
3260 | ||
3261 | ret = btrfs_reserve_metadata_space(root, 1); | |
3262 | if (ret) | |
3263 | return ret; | |
3264 | ||
3265 | trans = btrfs_start_transaction(root, 1); | |
3266 | btrfs_set_trans_block_group(trans, inode); | |
3267 | ||
3268 | ret = btrfs_orphan_add(trans, inode); | |
3269 | BUG_ON(ret); | |
3270 | ||
3271 | nr = trans->blocks_used; | |
3272 | btrfs_end_transaction(trans, root); | |
3273 | btrfs_unreserve_metadata_space(root, 1); | |
3274 | btrfs_btree_balance_dirty(root, nr); | |
3275 | ||
3276 | if (attr->ia_size > inode->i_size) { | |
3277 | ret = btrfs_cont_expand(inode, attr->ia_size); | |
3278 | if (ret) { | |
3279 | btrfs_truncate(inode); | |
3280 | return ret; | |
3281 | } | |
3282 | ||
3283 | i_size_write(inode, attr->ia_size); | |
3284 | btrfs_ordered_update_i_size(inode, inode->i_size, NULL); | |
3285 | ||
3286 | trans = btrfs_start_transaction(root, 1); | |
3287 | btrfs_set_trans_block_group(trans, inode); | |
3288 | ||
3289 | ret = btrfs_update_inode(trans, root, inode); | |
3290 | BUG_ON(ret); | |
3291 | if (inode->i_nlink > 0) { | |
3292 | ret = btrfs_orphan_del(trans, inode); | |
3293 | BUG_ON(ret); | |
3294 | } | |
3295 | nr = trans->blocks_used; | |
3296 | btrfs_end_transaction(trans, root); | |
3297 | btrfs_btree_balance_dirty(root, nr); | |
3298 | return 0; | |
3299 | } | |
3300 | ||
3301 | /* | |
3302 | * We're truncating a file that used to have good data down to | |
3303 | * zero. Make sure it gets into the ordered flush list so that | |
3304 | * any new writes get down to disk quickly. | |
3305 | */ | |
3306 | if (attr->ia_size == 0) | |
3307 | BTRFS_I(inode)->ordered_data_close = 1; | |
3308 | ||
3309 | /* we don't support swapfiles, so vmtruncate shouldn't fail */ | |
3310 | ret = vmtruncate(inode, attr->ia_size); | |
3311 | BUG_ON(ret); | |
3312 | ||
3313 | return 0; | |
3314 | } | |
3315 | ||
9036c102 YZ |
3316 | static int btrfs_setattr(struct dentry *dentry, struct iattr *attr) |
3317 | { | |
3318 | struct inode *inode = dentry->d_inode; | |
3319 | int err; | |
39279cc3 | 3320 | |
9036c102 YZ |
3321 | err = inode_change_ok(inode, attr); |
3322 | if (err) | |
3323 | return err; | |
2bf5a725 | 3324 | |
5a3f23d5 | 3325 | if (S_ISREG(inode->i_mode) && (attr->ia_valid & ATTR_SIZE)) { |
8082510e YZ |
3326 | err = btrfs_setattr_size(inode, attr); |
3327 | if (err) | |
3328 | return err; | |
39279cc3 | 3329 | } |
8082510e | 3330 | attr->ia_valid &= ~ATTR_SIZE; |
9036c102 | 3331 | |
8082510e YZ |
3332 | if (attr->ia_valid) |
3333 | err = inode_setattr(inode, attr); | |
33268eaf JB |
3334 | |
3335 | if (!err && ((attr->ia_valid & ATTR_MODE))) | |
3336 | err = btrfs_acl_chmod(inode); | |
39279cc3 CM |
3337 | return err; |
3338 | } | |
61295eb8 | 3339 | |
39279cc3 CM |
3340 | void btrfs_delete_inode(struct inode *inode) |
3341 | { | |
3342 | struct btrfs_trans_handle *trans; | |
3343 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
d3c2fdcf | 3344 | unsigned long nr; |
39279cc3 CM |
3345 | int ret; |
3346 | ||
3347 | truncate_inode_pages(&inode->i_data, 0); | |
3348 | if (is_bad_inode(inode)) { | |
7b128766 | 3349 | btrfs_orphan_del(NULL, inode); |
39279cc3 CM |
3350 | goto no_delete; |
3351 | } | |
4a096752 | 3352 | btrfs_wait_ordered_range(inode, 0, (u64)-1); |
5f39d397 | 3353 | |
c71bf099 YZ |
3354 | if (root->fs_info->log_root_recovering) { |
3355 | BUG_ON(!list_empty(&BTRFS_I(inode)->i_orphan)); | |
3356 | goto no_delete; | |
3357 | } | |
3358 | ||
76dda93c YZ |
3359 | if (inode->i_nlink > 0) { |
3360 | BUG_ON(btrfs_root_refs(&root->root_item) != 0); | |
3361 | goto no_delete; | |
3362 | } | |
3363 | ||
dbe674a9 | 3364 | btrfs_i_size_write(inode, 0); |
5f39d397 | 3365 | |
8082510e YZ |
3366 | while (1) { |
3367 | trans = btrfs_start_transaction(root, 1); | |
3368 | btrfs_set_trans_block_group(trans, inode); | |
3369 | ret = btrfs_truncate_inode_items(trans, root, inode, 0, 0); | |
7b128766 | 3370 | |
8082510e YZ |
3371 | if (ret != -EAGAIN) |
3372 | break; | |
85e21bac | 3373 | |
8082510e YZ |
3374 | nr = trans->blocks_used; |
3375 | btrfs_end_transaction(trans, root); | |
3376 | trans = NULL; | |
3377 | btrfs_btree_balance_dirty(root, nr); | |
3378 | } | |
5f39d397 | 3379 | |
8082510e YZ |
3380 | if (ret == 0) { |
3381 | ret = btrfs_orphan_del(trans, inode); | |
3382 | BUG_ON(ret); | |
3383 | } | |
54aa1f4d | 3384 | |
d3c2fdcf | 3385 | nr = trans->blocks_used; |
54aa1f4d | 3386 | btrfs_end_transaction(trans, root); |
d3c2fdcf | 3387 | btrfs_btree_balance_dirty(root, nr); |
39279cc3 CM |
3388 | no_delete: |
3389 | clear_inode(inode); | |
8082510e | 3390 | return; |
39279cc3 CM |
3391 | } |
3392 | ||
3393 | /* | |
3394 | * this returns the key found in the dir entry in the location pointer. | |
3395 | * If no dir entries were found, location->objectid is 0. | |
3396 | */ | |
3397 | static int btrfs_inode_by_name(struct inode *dir, struct dentry *dentry, | |
3398 | struct btrfs_key *location) | |
3399 | { | |
3400 | const char *name = dentry->d_name.name; | |
3401 | int namelen = dentry->d_name.len; | |
3402 | struct btrfs_dir_item *di; | |
3403 | struct btrfs_path *path; | |
3404 | struct btrfs_root *root = BTRFS_I(dir)->root; | |
0d9f7f3e | 3405 | int ret = 0; |
39279cc3 CM |
3406 | |
3407 | path = btrfs_alloc_path(); | |
3408 | BUG_ON(!path); | |
3954401f | 3409 | |
39279cc3 CM |
3410 | di = btrfs_lookup_dir_item(NULL, root, path, dir->i_ino, name, |
3411 | namelen, 0); | |
0d9f7f3e Y |
3412 | if (IS_ERR(di)) |
3413 | ret = PTR_ERR(di); | |
d397712b CM |
3414 | |
3415 | if (!di || IS_ERR(di)) | |
3954401f | 3416 | goto out_err; |
d397712b | 3417 | |
5f39d397 | 3418 | btrfs_dir_item_key_to_cpu(path->nodes[0], di, location); |
39279cc3 | 3419 | out: |
39279cc3 CM |
3420 | btrfs_free_path(path); |
3421 | return ret; | |
3954401f CM |
3422 | out_err: |
3423 | location->objectid = 0; | |
3424 | goto out; | |
39279cc3 CM |
3425 | } |
3426 | ||
3427 | /* | |
3428 | * when we hit a tree root in a directory, the btrfs part of the inode | |
3429 | * needs to be changed to reflect the root directory of the tree root. This | |
3430 | * is kind of like crossing a mount point. | |
3431 | */ | |
3432 | static int fixup_tree_root_location(struct btrfs_root *root, | |
4df27c4d YZ |
3433 | struct inode *dir, |
3434 | struct dentry *dentry, | |
3435 | struct btrfs_key *location, | |
3436 | struct btrfs_root **sub_root) | |
39279cc3 | 3437 | { |
4df27c4d YZ |
3438 | struct btrfs_path *path; |
3439 | struct btrfs_root *new_root; | |
3440 | struct btrfs_root_ref *ref; | |
3441 | struct extent_buffer *leaf; | |
3442 | int ret; | |
3443 | int err = 0; | |
39279cc3 | 3444 | |
4df27c4d YZ |
3445 | path = btrfs_alloc_path(); |
3446 | if (!path) { | |
3447 | err = -ENOMEM; | |
3448 | goto out; | |
3449 | } | |
39279cc3 | 3450 | |
4df27c4d YZ |
3451 | err = -ENOENT; |
3452 | ret = btrfs_find_root_ref(root->fs_info->tree_root, path, | |
3453 | BTRFS_I(dir)->root->root_key.objectid, | |
3454 | location->objectid); | |
3455 | if (ret) { | |
3456 | if (ret < 0) | |
3457 | err = ret; | |
3458 | goto out; | |
3459 | } | |
39279cc3 | 3460 | |
4df27c4d YZ |
3461 | leaf = path->nodes[0]; |
3462 | ref = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_root_ref); | |
3463 | if (btrfs_root_ref_dirid(leaf, ref) != dir->i_ino || | |
3464 | btrfs_root_ref_name_len(leaf, ref) != dentry->d_name.len) | |
3465 | goto out; | |
39279cc3 | 3466 | |
4df27c4d YZ |
3467 | ret = memcmp_extent_buffer(leaf, dentry->d_name.name, |
3468 | (unsigned long)(ref + 1), | |
3469 | dentry->d_name.len); | |
3470 | if (ret) | |
3471 | goto out; | |
3472 | ||
3473 | btrfs_release_path(root->fs_info->tree_root, path); | |
3474 | ||
3475 | new_root = btrfs_read_fs_root_no_name(root->fs_info, location); | |
3476 | if (IS_ERR(new_root)) { | |
3477 | err = PTR_ERR(new_root); | |
3478 | goto out; | |
3479 | } | |
3480 | ||
3481 | if (btrfs_root_refs(&new_root->root_item) == 0) { | |
3482 | err = -ENOENT; | |
3483 | goto out; | |
3484 | } | |
3485 | ||
3486 | *sub_root = new_root; | |
3487 | location->objectid = btrfs_root_dirid(&new_root->root_item); | |
3488 | location->type = BTRFS_INODE_ITEM_KEY; | |
3489 | location->offset = 0; | |
3490 | err = 0; | |
3491 | out: | |
3492 | btrfs_free_path(path); | |
3493 | return err; | |
39279cc3 CM |
3494 | } |
3495 | ||
5d4f98a2 YZ |
3496 | static void inode_tree_add(struct inode *inode) |
3497 | { | |
3498 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
3499 | struct btrfs_inode *entry; | |
03e860bd FNP |
3500 | struct rb_node **p; |
3501 | struct rb_node *parent; | |
03e860bd FNP |
3502 | again: |
3503 | p = &root->inode_tree.rb_node; | |
3504 | parent = NULL; | |
5d4f98a2 | 3505 | |
76dda93c YZ |
3506 | if (hlist_unhashed(&inode->i_hash)) |
3507 | return; | |
3508 | ||
5d4f98a2 YZ |
3509 | spin_lock(&root->inode_lock); |
3510 | while (*p) { | |
3511 | parent = *p; | |
3512 | entry = rb_entry(parent, struct btrfs_inode, rb_node); | |
3513 | ||
3514 | if (inode->i_ino < entry->vfs_inode.i_ino) | |
03e860bd | 3515 | p = &parent->rb_left; |
5d4f98a2 | 3516 | else if (inode->i_ino > entry->vfs_inode.i_ino) |
03e860bd | 3517 | p = &parent->rb_right; |
5d4f98a2 YZ |
3518 | else { |
3519 | WARN_ON(!(entry->vfs_inode.i_state & | |
3520 | (I_WILL_FREE | I_FREEING | I_CLEAR))); | |
03e860bd FNP |
3521 | rb_erase(parent, &root->inode_tree); |
3522 | RB_CLEAR_NODE(parent); | |
3523 | spin_unlock(&root->inode_lock); | |
3524 | goto again; | |
5d4f98a2 YZ |
3525 | } |
3526 | } | |
3527 | rb_link_node(&BTRFS_I(inode)->rb_node, parent, p); | |
3528 | rb_insert_color(&BTRFS_I(inode)->rb_node, &root->inode_tree); | |
3529 | spin_unlock(&root->inode_lock); | |
3530 | } | |
3531 | ||
3532 | static void inode_tree_del(struct inode *inode) | |
3533 | { | |
3534 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
76dda93c | 3535 | int empty = 0; |
5d4f98a2 | 3536 | |
03e860bd | 3537 | spin_lock(&root->inode_lock); |
5d4f98a2 | 3538 | if (!RB_EMPTY_NODE(&BTRFS_I(inode)->rb_node)) { |
5d4f98a2 | 3539 | rb_erase(&BTRFS_I(inode)->rb_node, &root->inode_tree); |
5d4f98a2 | 3540 | RB_CLEAR_NODE(&BTRFS_I(inode)->rb_node); |
76dda93c | 3541 | empty = RB_EMPTY_ROOT(&root->inode_tree); |
5d4f98a2 | 3542 | } |
03e860bd | 3543 | spin_unlock(&root->inode_lock); |
76dda93c YZ |
3544 | |
3545 | if (empty && btrfs_root_refs(&root->root_item) == 0) { | |
3546 | synchronize_srcu(&root->fs_info->subvol_srcu); | |
3547 | spin_lock(&root->inode_lock); | |
3548 | empty = RB_EMPTY_ROOT(&root->inode_tree); | |
3549 | spin_unlock(&root->inode_lock); | |
3550 | if (empty) | |
3551 | btrfs_add_dead_root(root); | |
3552 | } | |
3553 | } | |
3554 | ||
3555 | int btrfs_invalidate_inodes(struct btrfs_root *root) | |
3556 | { | |
3557 | struct rb_node *node; | |
3558 | struct rb_node *prev; | |
3559 | struct btrfs_inode *entry; | |
3560 | struct inode *inode; | |
3561 | u64 objectid = 0; | |
3562 | ||
3563 | WARN_ON(btrfs_root_refs(&root->root_item) != 0); | |
3564 | ||
3565 | spin_lock(&root->inode_lock); | |
3566 | again: | |
3567 | node = root->inode_tree.rb_node; | |
3568 | prev = NULL; | |
3569 | while (node) { | |
3570 | prev = node; | |
3571 | entry = rb_entry(node, struct btrfs_inode, rb_node); | |
3572 | ||
3573 | if (objectid < entry->vfs_inode.i_ino) | |
3574 | node = node->rb_left; | |
3575 | else if (objectid > entry->vfs_inode.i_ino) | |
3576 | node = node->rb_right; | |
3577 | else | |
3578 | break; | |
3579 | } | |
3580 | if (!node) { | |
3581 | while (prev) { | |
3582 | entry = rb_entry(prev, struct btrfs_inode, rb_node); | |
3583 | if (objectid <= entry->vfs_inode.i_ino) { | |
3584 | node = prev; | |
3585 | break; | |
3586 | } | |
3587 | prev = rb_next(prev); | |
3588 | } | |
3589 | } | |
3590 | while (node) { | |
3591 | entry = rb_entry(node, struct btrfs_inode, rb_node); | |
3592 | objectid = entry->vfs_inode.i_ino + 1; | |
3593 | inode = igrab(&entry->vfs_inode); | |
3594 | if (inode) { | |
3595 | spin_unlock(&root->inode_lock); | |
3596 | if (atomic_read(&inode->i_count) > 1) | |
3597 | d_prune_aliases(inode); | |
3598 | /* | |
3599 | * btrfs_drop_inode will remove it from | |
3600 | * the inode cache when its usage count | |
3601 | * hits zero. | |
3602 | */ | |
3603 | iput(inode); | |
3604 | cond_resched(); | |
3605 | spin_lock(&root->inode_lock); | |
3606 | goto again; | |
3607 | } | |
3608 | ||
3609 | if (cond_resched_lock(&root->inode_lock)) | |
3610 | goto again; | |
3611 | ||
3612 | node = rb_next(node); | |
3613 | } | |
3614 | spin_unlock(&root->inode_lock); | |
3615 | return 0; | |
5d4f98a2 YZ |
3616 | } |
3617 | ||
e02119d5 | 3618 | static noinline void init_btrfs_i(struct inode *inode) |
39279cc3 | 3619 | { |
e02119d5 CM |
3620 | struct btrfs_inode *bi = BTRFS_I(inode); |
3621 | ||
e02119d5 | 3622 | bi->generation = 0; |
c3027eb5 | 3623 | bi->sequence = 0; |
e02119d5 | 3624 | bi->last_trans = 0; |
257c62e1 | 3625 | bi->last_sub_trans = 0; |
e02119d5 CM |
3626 | bi->logged_trans = 0; |
3627 | bi->delalloc_bytes = 0; | |
6a63209f | 3628 | bi->reserved_bytes = 0; |
e02119d5 CM |
3629 | bi->disk_i_size = 0; |
3630 | bi->flags = 0; | |
3631 | bi->index_cnt = (u64)-1; | |
12fcfd22 | 3632 | bi->last_unlink_trans = 0; |
2757495c | 3633 | bi->ordered_data_close = 0; |
d1310b2e CM |
3634 | extent_map_tree_init(&BTRFS_I(inode)->extent_tree, GFP_NOFS); |
3635 | extent_io_tree_init(&BTRFS_I(inode)->io_tree, | |
b888db2b | 3636 | inode->i_mapping, GFP_NOFS); |
7e38326f CM |
3637 | extent_io_tree_init(&BTRFS_I(inode)->io_failure_tree, |
3638 | inode->i_mapping, GFP_NOFS); | |
ea8c2819 | 3639 | INIT_LIST_HEAD(&BTRFS_I(inode)->delalloc_inodes); |
5a3f23d5 | 3640 | INIT_LIST_HEAD(&BTRFS_I(inode)->ordered_operations); |
5d4f98a2 | 3641 | RB_CLEAR_NODE(&BTRFS_I(inode)->rb_node); |
ba1da2f4 | 3642 | btrfs_ordered_inode_tree_init(&BTRFS_I(inode)->ordered_tree); |
e02119d5 CM |
3643 | mutex_init(&BTRFS_I(inode)->log_mutex); |
3644 | } | |
3645 | ||
3646 | static int btrfs_init_locked_inode(struct inode *inode, void *p) | |
3647 | { | |
3648 | struct btrfs_iget_args *args = p; | |
3649 | inode->i_ino = args->ino; | |
3650 | init_btrfs_i(inode); | |
3651 | BTRFS_I(inode)->root = args->root; | |
6a63209f | 3652 | btrfs_set_inode_space_info(args->root, inode); |
39279cc3 CM |
3653 | return 0; |
3654 | } | |
3655 | ||
3656 | static int btrfs_find_actor(struct inode *inode, void *opaque) | |
3657 | { | |
3658 | struct btrfs_iget_args *args = opaque; | |
d397712b CM |
3659 | return args->ino == inode->i_ino && |
3660 | args->root == BTRFS_I(inode)->root; | |
39279cc3 CM |
3661 | } |
3662 | ||
5d4f98a2 YZ |
3663 | static struct inode *btrfs_iget_locked(struct super_block *s, |
3664 | u64 objectid, | |
3665 | struct btrfs_root *root) | |
39279cc3 CM |
3666 | { |
3667 | struct inode *inode; | |
3668 | struct btrfs_iget_args args; | |
3669 | args.ino = objectid; | |
3670 | args.root = root; | |
3671 | ||
3672 | inode = iget5_locked(s, objectid, btrfs_find_actor, | |
3673 | btrfs_init_locked_inode, | |
3674 | (void *)&args); | |
3675 | return inode; | |
3676 | } | |
3677 | ||
1a54ef8c BR |
3678 | /* Get an inode object given its location and corresponding root. |
3679 | * Returns in *is_new if the inode was read from disk | |
3680 | */ | |
3681 | struct inode *btrfs_iget(struct super_block *s, struct btrfs_key *location, | |
5d4f98a2 | 3682 | struct btrfs_root *root) |
1a54ef8c BR |
3683 | { |
3684 | struct inode *inode; | |
3685 | ||
3686 | inode = btrfs_iget_locked(s, location->objectid, root); | |
3687 | if (!inode) | |
5d4f98a2 | 3688 | return ERR_PTR(-ENOMEM); |
1a54ef8c BR |
3689 | |
3690 | if (inode->i_state & I_NEW) { | |
3691 | BTRFS_I(inode)->root = root; | |
3692 | memcpy(&BTRFS_I(inode)->location, location, sizeof(*location)); | |
3693 | btrfs_read_locked_inode(inode); | |
5d4f98a2 YZ |
3694 | |
3695 | inode_tree_add(inode); | |
1a54ef8c | 3696 | unlock_new_inode(inode); |
1a54ef8c BR |
3697 | } |
3698 | ||
3699 | return inode; | |
3700 | } | |
3701 | ||
4df27c4d YZ |
3702 | static struct inode *new_simple_dir(struct super_block *s, |
3703 | struct btrfs_key *key, | |
3704 | struct btrfs_root *root) | |
3705 | { | |
3706 | struct inode *inode = new_inode(s); | |
3707 | ||
3708 | if (!inode) | |
3709 | return ERR_PTR(-ENOMEM); | |
3710 | ||
3711 | init_btrfs_i(inode); | |
3712 | ||
3713 | BTRFS_I(inode)->root = root; | |
3714 | memcpy(&BTRFS_I(inode)->location, key, sizeof(*key)); | |
3715 | BTRFS_I(inode)->dummy_inode = 1; | |
3716 | ||
3717 | inode->i_ino = BTRFS_EMPTY_SUBVOL_DIR_OBJECTID; | |
3718 | inode->i_op = &simple_dir_inode_operations; | |
3719 | inode->i_fop = &simple_dir_operations; | |
3720 | inode->i_mode = S_IFDIR | S_IRUGO | S_IWUSR | S_IXUGO; | |
3721 | inode->i_mtime = inode->i_atime = inode->i_ctime = CURRENT_TIME; | |
3722 | ||
3723 | return inode; | |
3724 | } | |
3725 | ||
3de4586c | 3726 | struct inode *btrfs_lookup_dentry(struct inode *dir, struct dentry *dentry) |
39279cc3 | 3727 | { |
d397712b | 3728 | struct inode *inode; |
4df27c4d | 3729 | struct btrfs_root *root = BTRFS_I(dir)->root; |
39279cc3 CM |
3730 | struct btrfs_root *sub_root = root; |
3731 | struct btrfs_key location; | |
76dda93c | 3732 | int index; |
5d4f98a2 | 3733 | int ret; |
39279cc3 | 3734 | |
76dda93c YZ |
3735 | dentry->d_op = &btrfs_dentry_operations; |
3736 | ||
39279cc3 CM |
3737 | if (dentry->d_name.len > BTRFS_NAME_LEN) |
3738 | return ERR_PTR(-ENAMETOOLONG); | |
5f39d397 | 3739 | |
39279cc3 | 3740 | ret = btrfs_inode_by_name(dir, dentry, &location); |
5f39d397 | 3741 | |
39279cc3 CM |
3742 | if (ret < 0) |
3743 | return ERR_PTR(ret); | |
5f39d397 | 3744 | |
4df27c4d YZ |
3745 | if (location.objectid == 0) |
3746 | return NULL; | |
3747 | ||
3748 | if (location.type == BTRFS_INODE_ITEM_KEY) { | |
3749 | inode = btrfs_iget(dir->i_sb, &location, root); | |
3750 | return inode; | |
3751 | } | |
3752 | ||
3753 | BUG_ON(location.type != BTRFS_ROOT_ITEM_KEY); | |
3754 | ||
76dda93c | 3755 | index = srcu_read_lock(&root->fs_info->subvol_srcu); |
4df27c4d YZ |
3756 | ret = fixup_tree_root_location(root, dir, dentry, |
3757 | &location, &sub_root); | |
3758 | if (ret < 0) { | |
3759 | if (ret != -ENOENT) | |
3760 | inode = ERR_PTR(ret); | |
3761 | else | |
3762 | inode = new_simple_dir(dir->i_sb, &location, sub_root); | |
3763 | } else { | |
5d4f98a2 | 3764 | inode = btrfs_iget(dir->i_sb, &location, sub_root); |
39279cc3 | 3765 | } |
76dda93c YZ |
3766 | srcu_read_unlock(&root->fs_info->subvol_srcu, index); |
3767 | ||
c71bf099 YZ |
3768 | if (root != sub_root) { |
3769 | down_read(&root->fs_info->cleanup_work_sem); | |
3770 | if (!(inode->i_sb->s_flags & MS_RDONLY)) | |
3771 | btrfs_orphan_cleanup(sub_root); | |
3772 | up_read(&root->fs_info->cleanup_work_sem); | |
3773 | } | |
3774 | ||
3de4586c CM |
3775 | return inode; |
3776 | } | |
3777 | ||
76dda93c YZ |
3778 | static int btrfs_dentry_delete(struct dentry *dentry) |
3779 | { | |
3780 | struct btrfs_root *root; | |
3781 | ||
efefb143 YZ |
3782 | if (!dentry->d_inode && !IS_ROOT(dentry)) |
3783 | dentry = dentry->d_parent; | |
76dda93c | 3784 | |
efefb143 YZ |
3785 | if (dentry->d_inode) { |
3786 | root = BTRFS_I(dentry->d_inode)->root; | |
3787 | if (btrfs_root_refs(&root->root_item) == 0) | |
3788 | return 1; | |
3789 | } | |
76dda93c YZ |
3790 | return 0; |
3791 | } | |
3792 | ||
3de4586c CM |
3793 | static struct dentry *btrfs_lookup(struct inode *dir, struct dentry *dentry, |
3794 | struct nameidata *nd) | |
3795 | { | |
3796 | struct inode *inode; | |
3797 | ||
3de4586c CM |
3798 | inode = btrfs_lookup_dentry(dir, dentry); |
3799 | if (IS_ERR(inode)) | |
3800 | return ERR_CAST(inode); | |
7b128766 | 3801 | |
39279cc3 CM |
3802 | return d_splice_alias(inode, dentry); |
3803 | } | |
3804 | ||
39279cc3 CM |
3805 | static unsigned char btrfs_filetype_table[] = { |
3806 | DT_UNKNOWN, DT_REG, DT_DIR, DT_CHR, DT_BLK, DT_FIFO, DT_SOCK, DT_LNK | |
3807 | }; | |
3808 | ||
cbdf5a24 DW |
3809 | static int btrfs_real_readdir(struct file *filp, void *dirent, |
3810 | filldir_t filldir) | |
39279cc3 | 3811 | { |
6da6abae | 3812 | struct inode *inode = filp->f_dentry->d_inode; |
39279cc3 CM |
3813 | struct btrfs_root *root = BTRFS_I(inode)->root; |
3814 | struct btrfs_item *item; | |
3815 | struct btrfs_dir_item *di; | |
3816 | struct btrfs_key key; | |
5f39d397 | 3817 | struct btrfs_key found_key; |
39279cc3 CM |
3818 | struct btrfs_path *path; |
3819 | int ret; | |
3820 | u32 nritems; | |
5f39d397 | 3821 | struct extent_buffer *leaf; |
39279cc3 CM |
3822 | int slot; |
3823 | int advance; | |
3824 | unsigned char d_type; | |
3825 | int over = 0; | |
3826 | u32 di_cur; | |
3827 | u32 di_total; | |
3828 | u32 di_len; | |
3829 | int key_type = BTRFS_DIR_INDEX_KEY; | |
5f39d397 CM |
3830 | char tmp_name[32]; |
3831 | char *name_ptr; | |
3832 | int name_len; | |
39279cc3 CM |
3833 | |
3834 | /* FIXME, use a real flag for deciding about the key type */ | |
3835 | if (root->fs_info->tree_root == root) | |
3836 | key_type = BTRFS_DIR_ITEM_KEY; | |
5f39d397 | 3837 | |
3954401f CM |
3838 | /* special case for "." */ |
3839 | if (filp->f_pos == 0) { | |
3840 | over = filldir(dirent, ".", 1, | |
3841 | 1, inode->i_ino, | |
3842 | DT_DIR); | |
3843 | if (over) | |
3844 | return 0; | |
3845 | filp->f_pos = 1; | |
3846 | } | |
3954401f CM |
3847 | /* special case for .., just use the back ref */ |
3848 | if (filp->f_pos == 1) { | |
5ecc7e5d | 3849 | u64 pino = parent_ino(filp->f_path.dentry); |
3954401f | 3850 | over = filldir(dirent, "..", 2, |
5ecc7e5d | 3851 | 2, pino, DT_DIR); |
3954401f | 3852 | if (over) |
49593bfa | 3853 | return 0; |
3954401f CM |
3854 | filp->f_pos = 2; |
3855 | } | |
49593bfa DW |
3856 | path = btrfs_alloc_path(); |
3857 | path->reada = 2; | |
3858 | ||
39279cc3 CM |
3859 | btrfs_set_key_type(&key, key_type); |
3860 | key.offset = filp->f_pos; | |
49593bfa | 3861 | key.objectid = inode->i_ino; |
5f39d397 | 3862 | |
39279cc3 CM |
3863 | ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); |
3864 | if (ret < 0) | |
3865 | goto err; | |
3866 | advance = 0; | |
49593bfa DW |
3867 | |
3868 | while (1) { | |
5f39d397 CM |
3869 | leaf = path->nodes[0]; |
3870 | nritems = btrfs_header_nritems(leaf); | |
39279cc3 CM |
3871 | slot = path->slots[0]; |
3872 | if (advance || slot >= nritems) { | |
49593bfa | 3873 | if (slot >= nritems - 1) { |
39279cc3 CM |
3874 | ret = btrfs_next_leaf(root, path); |
3875 | if (ret) | |
3876 | break; | |
5f39d397 CM |
3877 | leaf = path->nodes[0]; |
3878 | nritems = btrfs_header_nritems(leaf); | |
39279cc3 CM |
3879 | slot = path->slots[0]; |
3880 | } else { | |
3881 | slot++; | |
3882 | path->slots[0]++; | |
3883 | } | |
3884 | } | |
3de4586c | 3885 | |
39279cc3 | 3886 | advance = 1; |
5f39d397 CM |
3887 | item = btrfs_item_nr(leaf, slot); |
3888 | btrfs_item_key_to_cpu(leaf, &found_key, slot); | |
3889 | ||
3890 | if (found_key.objectid != key.objectid) | |
39279cc3 | 3891 | break; |
5f39d397 | 3892 | if (btrfs_key_type(&found_key) != key_type) |
39279cc3 | 3893 | break; |
5f39d397 | 3894 | if (found_key.offset < filp->f_pos) |
39279cc3 | 3895 | continue; |
5f39d397 CM |
3896 | |
3897 | filp->f_pos = found_key.offset; | |
49593bfa | 3898 | |
39279cc3 CM |
3899 | di = btrfs_item_ptr(leaf, slot, struct btrfs_dir_item); |
3900 | di_cur = 0; | |
5f39d397 | 3901 | di_total = btrfs_item_size(leaf, item); |
49593bfa DW |
3902 | |
3903 | while (di_cur < di_total) { | |
5f39d397 CM |
3904 | struct btrfs_key location; |
3905 | ||
3906 | name_len = btrfs_dir_name_len(leaf, di); | |
49593bfa | 3907 | if (name_len <= sizeof(tmp_name)) { |
5f39d397 CM |
3908 | name_ptr = tmp_name; |
3909 | } else { | |
3910 | name_ptr = kmalloc(name_len, GFP_NOFS); | |
49593bfa DW |
3911 | if (!name_ptr) { |
3912 | ret = -ENOMEM; | |
3913 | goto err; | |
3914 | } | |
5f39d397 CM |
3915 | } |
3916 | read_extent_buffer(leaf, name_ptr, | |
3917 | (unsigned long)(di + 1), name_len); | |
3918 | ||
3919 | d_type = btrfs_filetype_table[btrfs_dir_type(leaf, di)]; | |
3920 | btrfs_dir_item_key_to_cpu(leaf, di, &location); | |
3de4586c CM |
3921 | |
3922 | /* is this a reference to our own snapshot? If so | |
3923 | * skip it | |
3924 | */ | |
3925 | if (location.type == BTRFS_ROOT_ITEM_KEY && | |
3926 | location.objectid == root->root_key.objectid) { | |
3927 | over = 0; | |
3928 | goto skip; | |
3929 | } | |
5f39d397 | 3930 | over = filldir(dirent, name_ptr, name_len, |
49593bfa | 3931 | found_key.offset, location.objectid, |
39279cc3 | 3932 | d_type); |
5f39d397 | 3933 | |
3de4586c | 3934 | skip: |
5f39d397 CM |
3935 | if (name_ptr != tmp_name) |
3936 | kfree(name_ptr); | |
3937 | ||
39279cc3 CM |
3938 | if (over) |
3939 | goto nopos; | |
5103e947 | 3940 | di_len = btrfs_dir_name_len(leaf, di) + |
49593bfa | 3941 | btrfs_dir_data_len(leaf, di) + sizeof(*di); |
39279cc3 CM |
3942 | di_cur += di_len; |
3943 | di = (struct btrfs_dir_item *)((char *)di + di_len); | |
3944 | } | |
3945 | } | |
49593bfa DW |
3946 | |
3947 | /* Reached end of directory/root. Bump pos past the last item. */ | |
5e591a07 | 3948 | if (key_type == BTRFS_DIR_INDEX_KEY) |
89f135d8 | 3949 | filp->f_pos = INT_LIMIT(off_t); |
5e591a07 YZ |
3950 | else |
3951 | filp->f_pos++; | |
39279cc3 CM |
3952 | nopos: |
3953 | ret = 0; | |
3954 | err: | |
39279cc3 | 3955 | btrfs_free_path(path); |
39279cc3 CM |
3956 | return ret; |
3957 | } | |
3958 | ||
3959 | int btrfs_write_inode(struct inode *inode, int wait) | |
3960 | { | |
3961 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
3962 | struct btrfs_trans_handle *trans; | |
3963 | int ret = 0; | |
3964 | ||
c146afad | 3965 | if (root->fs_info->btree_inode == inode) |
4ca8b41e CM |
3966 | return 0; |
3967 | ||
39279cc3 | 3968 | if (wait) { |
f9295749 | 3969 | trans = btrfs_join_transaction(root, 1); |
39279cc3 CM |
3970 | btrfs_set_trans_block_group(trans, inode); |
3971 | ret = btrfs_commit_transaction(trans, root); | |
39279cc3 CM |
3972 | } |
3973 | return ret; | |
3974 | } | |
3975 | ||
3976 | /* | |
54aa1f4d | 3977 | * This is somewhat expensive, updating the tree every time the |
39279cc3 CM |
3978 | * inode changes. But, it is most likely to find the inode in cache. |
3979 | * FIXME, needs more benchmarking...there are no reasons other than performance | |
3980 | * to keep or drop this code. | |
3981 | */ | |
3982 | void btrfs_dirty_inode(struct inode *inode) | |
3983 | { | |
3984 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
3985 | struct btrfs_trans_handle *trans; | |
3986 | ||
f9295749 | 3987 | trans = btrfs_join_transaction(root, 1); |
39279cc3 CM |
3988 | btrfs_set_trans_block_group(trans, inode); |
3989 | btrfs_update_inode(trans, root, inode); | |
3990 | btrfs_end_transaction(trans, root); | |
39279cc3 CM |
3991 | } |
3992 | ||
d352ac68 CM |
3993 | /* |
3994 | * find the highest existing sequence number in a directory | |
3995 | * and then set the in-memory index_cnt variable to reflect | |
3996 | * free sequence numbers | |
3997 | */ | |
aec7477b JB |
3998 | static int btrfs_set_inode_index_count(struct inode *inode) |
3999 | { | |
4000 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
4001 | struct btrfs_key key, found_key; | |
4002 | struct btrfs_path *path; | |
4003 | struct extent_buffer *leaf; | |
4004 | int ret; | |
4005 | ||
4006 | key.objectid = inode->i_ino; | |
4007 | btrfs_set_key_type(&key, BTRFS_DIR_INDEX_KEY); | |
4008 | key.offset = (u64)-1; | |
4009 | ||
4010 | path = btrfs_alloc_path(); | |
4011 | if (!path) | |
4012 | return -ENOMEM; | |
4013 | ||
4014 | ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); | |
4015 | if (ret < 0) | |
4016 | goto out; | |
4017 | /* FIXME: we should be able to handle this */ | |
4018 | if (ret == 0) | |
4019 | goto out; | |
4020 | ret = 0; | |
4021 | ||
4022 | /* | |
4023 | * MAGIC NUMBER EXPLANATION: | |
4024 | * since we search a directory based on f_pos we have to start at 2 | |
4025 | * since '.' and '..' have f_pos of 0 and 1 respectively, so everybody | |
4026 | * else has to start at 2 | |
4027 | */ | |
4028 | if (path->slots[0] == 0) { | |
4029 | BTRFS_I(inode)->index_cnt = 2; | |
4030 | goto out; | |
4031 | } | |
4032 | ||
4033 | path->slots[0]--; | |
4034 | ||
4035 | leaf = path->nodes[0]; | |
4036 | btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); | |
4037 | ||
4038 | if (found_key.objectid != inode->i_ino || | |
4039 | btrfs_key_type(&found_key) != BTRFS_DIR_INDEX_KEY) { | |
4040 | BTRFS_I(inode)->index_cnt = 2; | |
4041 | goto out; | |
4042 | } | |
4043 | ||
4044 | BTRFS_I(inode)->index_cnt = found_key.offset + 1; | |
4045 | out: | |
4046 | btrfs_free_path(path); | |
4047 | return ret; | |
4048 | } | |
4049 | ||
d352ac68 CM |
4050 | /* |
4051 | * helper to find a free sequence number in a given directory. This current | |
4052 | * code is very simple, later versions will do smarter things in the btree | |
4053 | */ | |
3de4586c | 4054 | int btrfs_set_inode_index(struct inode *dir, u64 *index) |
aec7477b JB |
4055 | { |
4056 | int ret = 0; | |
4057 | ||
4058 | if (BTRFS_I(dir)->index_cnt == (u64)-1) { | |
4059 | ret = btrfs_set_inode_index_count(dir); | |
d397712b | 4060 | if (ret) |
aec7477b JB |
4061 | return ret; |
4062 | } | |
4063 | ||
00e4e6b3 | 4064 | *index = BTRFS_I(dir)->index_cnt; |
aec7477b JB |
4065 | BTRFS_I(dir)->index_cnt++; |
4066 | ||
4067 | return ret; | |
4068 | } | |
4069 | ||
39279cc3 CM |
4070 | static struct inode *btrfs_new_inode(struct btrfs_trans_handle *trans, |
4071 | struct btrfs_root *root, | |
aec7477b | 4072 | struct inode *dir, |
9c58309d | 4073 | const char *name, int name_len, |
d2fb3437 YZ |
4074 | u64 ref_objectid, u64 objectid, |
4075 | u64 alloc_hint, int mode, u64 *index) | |
39279cc3 CM |
4076 | { |
4077 | struct inode *inode; | |
5f39d397 | 4078 | struct btrfs_inode_item *inode_item; |
39279cc3 | 4079 | struct btrfs_key *location; |
5f39d397 | 4080 | struct btrfs_path *path; |
9c58309d CM |
4081 | struct btrfs_inode_ref *ref; |
4082 | struct btrfs_key key[2]; | |
4083 | u32 sizes[2]; | |
4084 | unsigned long ptr; | |
39279cc3 CM |
4085 | int ret; |
4086 | int owner; | |
4087 | ||
5f39d397 CM |
4088 | path = btrfs_alloc_path(); |
4089 | BUG_ON(!path); | |
4090 | ||
39279cc3 CM |
4091 | inode = new_inode(root->fs_info->sb); |
4092 | if (!inode) | |
4093 | return ERR_PTR(-ENOMEM); | |
4094 | ||
aec7477b | 4095 | if (dir) { |
3de4586c | 4096 | ret = btrfs_set_inode_index(dir, index); |
09771430 SF |
4097 | if (ret) { |
4098 | iput(inode); | |
aec7477b | 4099 | return ERR_PTR(ret); |
09771430 | 4100 | } |
aec7477b JB |
4101 | } |
4102 | /* | |
4103 | * index_cnt is ignored for everything but a dir, | |
4104 | * btrfs_get_inode_index_count has an explanation for the magic | |
4105 | * number | |
4106 | */ | |
e02119d5 | 4107 | init_btrfs_i(inode); |
aec7477b | 4108 | BTRFS_I(inode)->index_cnt = 2; |
39279cc3 | 4109 | BTRFS_I(inode)->root = root; |
e02119d5 | 4110 | BTRFS_I(inode)->generation = trans->transid; |
6a63209f | 4111 | btrfs_set_inode_space_info(root, inode); |
b888db2b | 4112 | |
39279cc3 CM |
4113 | if (mode & S_IFDIR) |
4114 | owner = 0; | |
4115 | else | |
4116 | owner = 1; | |
d2fb3437 YZ |
4117 | BTRFS_I(inode)->block_group = |
4118 | btrfs_find_block_group(root, 0, alloc_hint, owner); | |
9c58309d CM |
4119 | |
4120 | key[0].objectid = objectid; | |
4121 | btrfs_set_key_type(&key[0], BTRFS_INODE_ITEM_KEY); | |
4122 | key[0].offset = 0; | |
4123 | ||
4124 | key[1].objectid = objectid; | |
4125 | btrfs_set_key_type(&key[1], BTRFS_INODE_REF_KEY); | |
4126 | key[1].offset = ref_objectid; | |
4127 | ||
4128 | sizes[0] = sizeof(struct btrfs_inode_item); | |
4129 | sizes[1] = name_len + sizeof(*ref); | |
4130 | ||
b9473439 | 4131 | path->leave_spinning = 1; |
9c58309d CM |
4132 | ret = btrfs_insert_empty_items(trans, root, path, key, sizes, 2); |
4133 | if (ret != 0) | |
5f39d397 CM |
4134 | goto fail; |
4135 | ||
79683f2d | 4136 | inode->i_uid = current_fsuid(); |
8c087b51 | 4137 | |
42f15d77 | 4138 | if (dir && (dir->i_mode & S_ISGID)) { |
8c087b51 CB |
4139 | inode->i_gid = dir->i_gid; |
4140 | if (S_ISDIR(mode)) | |
4141 | mode |= S_ISGID; | |
4142 | } else | |
4143 | inode->i_gid = current_fsgid(); | |
4144 | ||
39279cc3 CM |
4145 | inode->i_mode = mode; |
4146 | inode->i_ino = objectid; | |
a76a3cd4 | 4147 | inode_set_bytes(inode, 0); |
39279cc3 | 4148 | inode->i_mtime = inode->i_atime = inode->i_ctime = CURRENT_TIME; |
5f39d397 CM |
4149 | inode_item = btrfs_item_ptr(path->nodes[0], path->slots[0], |
4150 | struct btrfs_inode_item); | |
e02119d5 | 4151 | fill_inode_item(trans, path->nodes[0], inode_item, inode); |
9c58309d CM |
4152 | |
4153 | ref = btrfs_item_ptr(path->nodes[0], path->slots[0] + 1, | |
4154 | struct btrfs_inode_ref); | |
4155 | btrfs_set_inode_ref_name_len(path->nodes[0], ref, name_len); | |
00e4e6b3 | 4156 | btrfs_set_inode_ref_index(path->nodes[0], ref, *index); |
9c58309d CM |
4157 | ptr = (unsigned long)(ref + 1); |
4158 | write_extent_buffer(path->nodes[0], name, ptr, name_len); | |
4159 | ||
5f39d397 CM |
4160 | btrfs_mark_buffer_dirty(path->nodes[0]); |
4161 | btrfs_free_path(path); | |
4162 | ||
39279cc3 CM |
4163 | location = &BTRFS_I(inode)->location; |
4164 | location->objectid = objectid; | |
39279cc3 CM |
4165 | location->offset = 0; |
4166 | btrfs_set_key_type(location, BTRFS_INODE_ITEM_KEY); | |
4167 | ||
6cbff00f CH |
4168 | btrfs_inherit_iflags(inode, dir); |
4169 | ||
94272164 CM |
4170 | if ((mode & S_IFREG)) { |
4171 | if (btrfs_test_opt(root, NODATASUM)) | |
4172 | BTRFS_I(inode)->flags |= BTRFS_INODE_NODATASUM; | |
4173 | if (btrfs_test_opt(root, NODATACOW)) | |
4174 | BTRFS_I(inode)->flags |= BTRFS_INODE_NODATACOW; | |
4175 | } | |
4176 | ||
39279cc3 | 4177 | insert_inode_hash(inode); |
5d4f98a2 | 4178 | inode_tree_add(inode); |
39279cc3 | 4179 | return inode; |
5f39d397 | 4180 | fail: |
aec7477b JB |
4181 | if (dir) |
4182 | BTRFS_I(dir)->index_cnt--; | |
5f39d397 | 4183 | btrfs_free_path(path); |
09771430 | 4184 | iput(inode); |
5f39d397 | 4185 | return ERR_PTR(ret); |
39279cc3 CM |
4186 | } |
4187 | ||
4188 | static inline u8 btrfs_inode_type(struct inode *inode) | |
4189 | { | |
4190 | return btrfs_type_by_mode[(inode->i_mode & S_IFMT) >> S_SHIFT]; | |
4191 | } | |
4192 | ||
d352ac68 CM |
4193 | /* |
4194 | * utility function to add 'inode' into 'parent_inode' with | |
4195 | * a give name and a given sequence number. | |
4196 | * if 'add_backref' is true, also insert a backref from the | |
4197 | * inode to the parent directory. | |
4198 | */ | |
e02119d5 CM |
4199 | int btrfs_add_link(struct btrfs_trans_handle *trans, |
4200 | struct inode *parent_inode, struct inode *inode, | |
4201 | const char *name, int name_len, int add_backref, u64 index) | |
39279cc3 | 4202 | { |
4df27c4d | 4203 | int ret = 0; |
39279cc3 | 4204 | struct btrfs_key key; |
e02119d5 | 4205 | struct btrfs_root *root = BTRFS_I(parent_inode)->root; |
5f39d397 | 4206 | |
4df27c4d YZ |
4207 | if (unlikely(inode->i_ino == BTRFS_FIRST_FREE_OBJECTID)) { |
4208 | memcpy(&key, &BTRFS_I(inode)->root->root_key, sizeof(key)); | |
4209 | } else { | |
4210 | key.objectid = inode->i_ino; | |
4211 | btrfs_set_key_type(&key, BTRFS_INODE_ITEM_KEY); | |
4212 | key.offset = 0; | |
4213 | } | |
4214 | ||
4215 | if (unlikely(inode->i_ino == BTRFS_FIRST_FREE_OBJECTID)) { | |
4216 | ret = btrfs_add_root_ref(trans, root->fs_info->tree_root, | |
4217 | key.objectid, root->root_key.objectid, | |
4218 | parent_inode->i_ino, | |
4219 | index, name, name_len); | |
4220 | } else if (add_backref) { | |
4221 | ret = btrfs_insert_inode_ref(trans, root, | |
4222 | name, name_len, inode->i_ino, | |
4223 | parent_inode->i_ino, index); | |
4224 | } | |
39279cc3 | 4225 | |
39279cc3 | 4226 | if (ret == 0) { |
4df27c4d YZ |
4227 | ret = btrfs_insert_dir_item(trans, root, name, name_len, |
4228 | parent_inode->i_ino, &key, | |
4229 | btrfs_inode_type(inode), index); | |
4230 | BUG_ON(ret); | |
4231 | ||
dbe674a9 | 4232 | btrfs_i_size_write(parent_inode, parent_inode->i_size + |
e02119d5 | 4233 | name_len * 2); |
79c44584 | 4234 | parent_inode->i_mtime = parent_inode->i_ctime = CURRENT_TIME; |
e02119d5 | 4235 | ret = btrfs_update_inode(trans, root, parent_inode); |
39279cc3 CM |
4236 | } |
4237 | return ret; | |
4238 | } | |
4239 | ||
4240 | static int btrfs_add_nondir(struct btrfs_trans_handle *trans, | |
9c58309d | 4241 | struct dentry *dentry, struct inode *inode, |
00e4e6b3 | 4242 | int backref, u64 index) |
39279cc3 | 4243 | { |
e02119d5 CM |
4244 | int err = btrfs_add_link(trans, dentry->d_parent->d_inode, |
4245 | inode, dentry->d_name.name, | |
4246 | dentry->d_name.len, backref, index); | |
39279cc3 CM |
4247 | if (!err) { |
4248 | d_instantiate(dentry, inode); | |
4249 | return 0; | |
4250 | } | |
4251 | if (err > 0) | |
4252 | err = -EEXIST; | |
4253 | return err; | |
4254 | } | |
4255 | ||
618e21d5 JB |
4256 | static int btrfs_mknod(struct inode *dir, struct dentry *dentry, |
4257 | int mode, dev_t rdev) | |
4258 | { | |
4259 | struct btrfs_trans_handle *trans; | |
4260 | struct btrfs_root *root = BTRFS_I(dir)->root; | |
1832a6d5 | 4261 | struct inode *inode = NULL; |
618e21d5 JB |
4262 | int err; |
4263 | int drop_inode = 0; | |
4264 | u64 objectid; | |
1832a6d5 | 4265 | unsigned long nr = 0; |
00e4e6b3 | 4266 | u64 index = 0; |
618e21d5 JB |
4267 | |
4268 | if (!new_valid_dev(rdev)) | |
4269 | return -EINVAL; | |
4270 | ||
9ed74f2d JB |
4271 | /* |
4272 | * 2 for inode item and ref | |
4273 | * 2 for dir items | |
4274 | * 1 for xattr if selinux is on | |
4275 | */ | |
4276 | err = btrfs_reserve_metadata_space(root, 5); | |
1832a6d5 | 4277 | if (err) |
9ed74f2d | 4278 | return err; |
1832a6d5 | 4279 | |
618e21d5 | 4280 | trans = btrfs_start_transaction(root, 1); |
9ed74f2d JB |
4281 | if (!trans) |
4282 | goto fail; | |
618e21d5 JB |
4283 | btrfs_set_trans_block_group(trans, dir); |
4284 | ||
4285 | err = btrfs_find_free_objectid(trans, root, dir->i_ino, &objectid); | |
4286 | if (err) { | |
4287 | err = -ENOSPC; | |
4288 | goto out_unlock; | |
4289 | } | |
4290 | ||
aec7477b | 4291 | inode = btrfs_new_inode(trans, root, dir, dentry->d_name.name, |
9c58309d CM |
4292 | dentry->d_name.len, |
4293 | dentry->d_parent->d_inode->i_ino, objectid, | |
00e4e6b3 | 4294 | BTRFS_I(dir)->block_group, mode, &index); |
618e21d5 JB |
4295 | err = PTR_ERR(inode); |
4296 | if (IS_ERR(inode)) | |
4297 | goto out_unlock; | |
4298 | ||
0279b4cd | 4299 | err = btrfs_init_inode_security(inode, dir); |
33268eaf JB |
4300 | if (err) { |
4301 | drop_inode = 1; | |
4302 | goto out_unlock; | |
4303 | } | |
4304 | ||
618e21d5 | 4305 | btrfs_set_trans_block_group(trans, inode); |
00e4e6b3 | 4306 | err = btrfs_add_nondir(trans, dentry, inode, 0, index); |
618e21d5 JB |
4307 | if (err) |
4308 | drop_inode = 1; | |
4309 | else { | |
4310 | inode->i_op = &btrfs_special_inode_operations; | |
4311 | init_special_inode(inode, inode->i_mode, rdev); | |
1b4ab1bb | 4312 | btrfs_update_inode(trans, root, inode); |
618e21d5 | 4313 | } |
618e21d5 JB |
4314 | btrfs_update_inode_block_group(trans, inode); |
4315 | btrfs_update_inode_block_group(trans, dir); | |
4316 | out_unlock: | |
d3c2fdcf | 4317 | nr = trans->blocks_used; |
89ce8a63 | 4318 | btrfs_end_transaction_throttle(trans, root); |
1832a6d5 | 4319 | fail: |
9ed74f2d | 4320 | btrfs_unreserve_metadata_space(root, 5); |
618e21d5 JB |
4321 | if (drop_inode) { |
4322 | inode_dec_link_count(inode); | |
4323 | iput(inode); | |
4324 | } | |
d3c2fdcf | 4325 | btrfs_btree_balance_dirty(root, nr); |
618e21d5 JB |
4326 | return err; |
4327 | } | |
4328 | ||
39279cc3 CM |
4329 | static int btrfs_create(struct inode *dir, struct dentry *dentry, |
4330 | int mode, struct nameidata *nd) | |
4331 | { | |
4332 | struct btrfs_trans_handle *trans; | |
4333 | struct btrfs_root *root = BTRFS_I(dir)->root; | |
1832a6d5 | 4334 | struct inode *inode = NULL; |
39279cc3 CM |
4335 | int err; |
4336 | int drop_inode = 0; | |
1832a6d5 | 4337 | unsigned long nr = 0; |
39279cc3 | 4338 | u64 objectid; |
00e4e6b3 | 4339 | u64 index = 0; |
39279cc3 | 4340 | |
9ed74f2d JB |
4341 | /* |
4342 | * 2 for inode item and ref | |
4343 | * 2 for dir items | |
4344 | * 1 for xattr if selinux is on | |
4345 | */ | |
4346 | err = btrfs_reserve_metadata_space(root, 5); | |
1832a6d5 | 4347 | if (err) |
9ed74f2d JB |
4348 | return err; |
4349 | ||
39279cc3 | 4350 | trans = btrfs_start_transaction(root, 1); |
9ed74f2d JB |
4351 | if (!trans) |
4352 | goto fail; | |
39279cc3 CM |
4353 | btrfs_set_trans_block_group(trans, dir); |
4354 | ||
4355 | err = btrfs_find_free_objectid(trans, root, dir->i_ino, &objectid); | |
4356 | if (err) { | |
4357 | err = -ENOSPC; | |
4358 | goto out_unlock; | |
4359 | } | |
4360 | ||
aec7477b | 4361 | inode = btrfs_new_inode(trans, root, dir, dentry->d_name.name, |
9c58309d CM |
4362 | dentry->d_name.len, |
4363 | dentry->d_parent->d_inode->i_ino, | |
00e4e6b3 CM |
4364 | objectid, BTRFS_I(dir)->block_group, mode, |
4365 | &index); | |
39279cc3 CM |
4366 | err = PTR_ERR(inode); |
4367 | if (IS_ERR(inode)) | |
4368 | goto out_unlock; | |
4369 | ||
0279b4cd | 4370 | err = btrfs_init_inode_security(inode, dir); |
33268eaf JB |
4371 | if (err) { |
4372 | drop_inode = 1; | |
4373 | goto out_unlock; | |
4374 | } | |
4375 | ||
39279cc3 | 4376 | btrfs_set_trans_block_group(trans, inode); |
00e4e6b3 | 4377 | err = btrfs_add_nondir(trans, dentry, inode, 0, index); |
39279cc3 CM |
4378 | if (err) |
4379 | drop_inode = 1; | |
4380 | else { | |
4381 | inode->i_mapping->a_ops = &btrfs_aops; | |
04160088 | 4382 | inode->i_mapping->backing_dev_info = &root->fs_info->bdi; |
39279cc3 CM |
4383 | inode->i_fop = &btrfs_file_operations; |
4384 | inode->i_op = &btrfs_file_inode_operations; | |
d1310b2e | 4385 | BTRFS_I(inode)->io_tree.ops = &btrfs_extent_io_ops; |
39279cc3 | 4386 | } |
39279cc3 CM |
4387 | btrfs_update_inode_block_group(trans, inode); |
4388 | btrfs_update_inode_block_group(trans, dir); | |
4389 | out_unlock: | |
d3c2fdcf | 4390 | nr = trans->blocks_used; |
ab78c84d | 4391 | btrfs_end_transaction_throttle(trans, root); |
1832a6d5 | 4392 | fail: |
9ed74f2d | 4393 | btrfs_unreserve_metadata_space(root, 5); |
39279cc3 CM |
4394 | if (drop_inode) { |
4395 | inode_dec_link_count(inode); | |
4396 | iput(inode); | |
4397 | } | |
d3c2fdcf | 4398 | btrfs_btree_balance_dirty(root, nr); |
39279cc3 CM |
4399 | return err; |
4400 | } | |
4401 | ||
4402 | static int btrfs_link(struct dentry *old_dentry, struct inode *dir, | |
4403 | struct dentry *dentry) | |
4404 | { | |
4405 | struct btrfs_trans_handle *trans; | |
4406 | struct btrfs_root *root = BTRFS_I(dir)->root; | |
4407 | struct inode *inode = old_dentry->d_inode; | |
00e4e6b3 | 4408 | u64 index; |
1832a6d5 | 4409 | unsigned long nr = 0; |
39279cc3 CM |
4410 | int err; |
4411 | int drop_inode = 0; | |
4412 | ||
4413 | if (inode->i_nlink == 0) | |
4414 | return -ENOENT; | |
4415 | ||
9ed74f2d JB |
4416 | /* |
4417 | * 1 item for inode ref | |
4418 | * 2 items for dir items | |
4419 | */ | |
4420 | err = btrfs_reserve_metadata_space(root, 3); | |
1832a6d5 | 4421 | if (err) |
9ed74f2d JB |
4422 | return err; |
4423 | ||
4424 | btrfs_inc_nlink(inode); | |
4425 | ||
3de4586c | 4426 | err = btrfs_set_inode_index(dir, &index); |
aec7477b JB |
4427 | if (err) |
4428 | goto fail; | |
4429 | ||
39279cc3 | 4430 | trans = btrfs_start_transaction(root, 1); |
5f39d397 | 4431 | |
39279cc3 CM |
4432 | btrfs_set_trans_block_group(trans, dir); |
4433 | atomic_inc(&inode->i_count); | |
aec7477b | 4434 | |
00e4e6b3 | 4435 | err = btrfs_add_nondir(trans, dentry, inode, 1, index); |
5f39d397 | 4436 | |
a5719521 | 4437 | if (err) { |
54aa1f4d | 4438 | drop_inode = 1; |
a5719521 YZ |
4439 | } else { |
4440 | btrfs_update_inode_block_group(trans, dir); | |
4441 | err = btrfs_update_inode(trans, root, inode); | |
4442 | BUG_ON(err); | |
4443 | btrfs_log_new_name(trans, inode, NULL, dentry->d_parent); | |
4444 | } | |
39279cc3 | 4445 | |
d3c2fdcf | 4446 | nr = trans->blocks_used; |
ab78c84d | 4447 | btrfs_end_transaction_throttle(trans, root); |
1832a6d5 | 4448 | fail: |
9ed74f2d | 4449 | btrfs_unreserve_metadata_space(root, 3); |
39279cc3 CM |
4450 | if (drop_inode) { |
4451 | inode_dec_link_count(inode); | |
4452 | iput(inode); | |
4453 | } | |
d3c2fdcf | 4454 | btrfs_btree_balance_dirty(root, nr); |
39279cc3 CM |
4455 | return err; |
4456 | } | |
4457 | ||
39279cc3 CM |
4458 | static int btrfs_mkdir(struct inode *dir, struct dentry *dentry, int mode) |
4459 | { | |
b9d86667 | 4460 | struct inode *inode = NULL; |
39279cc3 CM |
4461 | struct btrfs_trans_handle *trans; |
4462 | struct btrfs_root *root = BTRFS_I(dir)->root; | |
4463 | int err = 0; | |
4464 | int drop_on_err = 0; | |
b9d86667 | 4465 | u64 objectid = 0; |
00e4e6b3 | 4466 | u64 index = 0; |
d3c2fdcf | 4467 | unsigned long nr = 1; |
39279cc3 | 4468 | |
9ed74f2d JB |
4469 | /* |
4470 | * 2 items for inode and ref | |
4471 | * 2 items for dir items | |
4472 | * 1 for xattr if selinux is on | |
4473 | */ | |
4474 | err = btrfs_reserve_metadata_space(root, 5); | |
1832a6d5 | 4475 | if (err) |
9ed74f2d | 4476 | return err; |
1832a6d5 | 4477 | |
39279cc3 | 4478 | trans = btrfs_start_transaction(root, 1); |
9ed74f2d JB |
4479 | if (!trans) { |
4480 | err = -ENOMEM; | |
39279cc3 CM |
4481 | goto out_unlock; |
4482 | } | |
9ed74f2d | 4483 | btrfs_set_trans_block_group(trans, dir); |
39279cc3 CM |
4484 | |
4485 | err = btrfs_find_free_objectid(trans, root, dir->i_ino, &objectid); | |
4486 | if (err) { | |
4487 | err = -ENOSPC; | |
4488 | goto out_unlock; | |
4489 | } | |
4490 | ||
aec7477b | 4491 | inode = btrfs_new_inode(trans, root, dir, dentry->d_name.name, |
9c58309d CM |
4492 | dentry->d_name.len, |
4493 | dentry->d_parent->d_inode->i_ino, objectid, | |
00e4e6b3 CM |
4494 | BTRFS_I(dir)->block_group, S_IFDIR | mode, |
4495 | &index); | |
39279cc3 CM |
4496 | if (IS_ERR(inode)) { |
4497 | err = PTR_ERR(inode); | |
4498 | goto out_fail; | |
4499 | } | |
5f39d397 | 4500 | |
39279cc3 | 4501 | drop_on_err = 1; |
33268eaf | 4502 | |
0279b4cd | 4503 | err = btrfs_init_inode_security(inode, dir); |
33268eaf JB |
4504 | if (err) |
4505 | goto out_fail; | |
4506 | ||
39279cc3 CM |
4507 | inode->i_op = &btrfs_dir_inode_operations; |
4508 | inode->i_fop = &btrfs_dir_file_operations; | |
4509 | btrfs_set_trans_block_group(trans, inode); | |
4510 | ||
dbe674a9 | 4511 | btrfs_i_size_write(inode, 0); |
39279cc3 CM |
4512 | err = btrfs_update_inode(trans, root, inode); |
4513 | if (err) | |
4514 | goto out_fail; | |
5f39d397 | 4515 | |
e02119d5 CM |
4516 | err = btrfs_add_link(trans, dentry->d_parent->d_inode, |
4517 | inode, dentry->d_name.name, | |
4518 | dentry->d_name.len, 0, index); | |
39279cc3 CM |
4519 | if (err) |
4520 | goto out_fail; | |
5f39d397 | 4521 | |
39279cc3 CM |
4522 | d_instantiate(dentry, inode); |
4523 | drop_on_err = 0; | |
39279cc3 CM |
4524 | btrfs_update_inode_block_group(trans, inode); |
4525 | btrfs_update_inode_block_group(trans, dir); | |
4526 | ||
4527 | out_fail: | |
d3c2fdcf | 4528 | nr = trans->blocks_used; |
ab78c84d | 4529 | btrfs_end_transaction_throttle(trans, root); |
5f39d397 | 4530 | |
39279cc3 | 4531 | out_unlock: |
9ed74f2d | 4532 | btrfs_unreserve_metadata_space(root, 5); |
39279cc3 CM |
4533 | if (drop_on_err) |
4534 | iput(inode); | |
d3c2fdcf | 4535 | btrfs_btree_balance_dirty(root, nr); |
39279cc3 CM |
4536 | return err; |
4537 | } | |
4538 | ||
d352ac68 CM |
4539 | /* helper for btfs_get_extent. Given an existing extent in the tree, |
4540 | * and an extent that you want to insert, deal with overlap and insert | |
4541 | * the new extent into the tree. | |
4542 | */ | |
3b951516 CM |
4543 | static int merge_extent_mapping(struct extent_map_tree *em_tree, |
4544 | struct extent_map *existing, | |
e6dcd2dc CM |
4545 | struct extent_map *em, |
4546 | u64 map_start, u64 map_len) | |
3b951516 CM |
4547 | { |
4548 | u64 start_diff; | |
3b951516 | 4549 | |
e6dcd2dc CM |
4550 | BUG_ON(map_start < em->start || map_start >= extent_map_end(em)); |
4551 | start_diff = map_start - em->start; | |
4552 | em->start = map_start; | |
4553 | em->len = map_len; | |
c8b97818 CM |
4554 | if (em->block_start < EXTENT_MAP_LAST_BYTE && |
4555 | !test_bit(EXTENT_FLAG_COMPRESSED, &em->flags)) { | |
e6dcd2dc | 4556 | em->block_start += start_diff; |
c8b97818 CM |
4557 | em->block_len -= start_diff; |
4558 | } | |
e6dcd2dc | 4559 | return add_extent_mapping(em_tree, em); |
3b951516 CM |
4560 | } |
4561 | ||
c8b97818 CM |
4562 | static noinline int uncompress_inline(struct btrfs_path *path, |
4563 | struct inode *inode, struct page *page, | |
4564 | size_t pg_offset, u64 extent_offset, | |
4565 | struct btrfs_file_extent_item *item) | |
4566 | { | |
4567 | int ret; | |
4568 | struct extent_buffer *leaf = path->nodes[0]; | |
4569 | char *tmp; | |
4570 | size_t max_size; | |
4571 | unsigned long inline_size; | |
4572 | unsigned long ptr; | |
4573 | ||
4574 | WARN_ON(pg_offset != 0); | |
4575 | max_size = btrfs_file_extent_ram_bytes(leaf, item); | |
4576 | inline_size = btrfs_file_extent_inline_item_len(leaf, | |
4577 | btrfs_item_nr(leaf, path->slots[0])); | |
4578 | tmp = kmalloc(inline_size, GFP_NOFS); | |
4579 | ptr = btrfs_file_extent_inline_start(item); | |
4580 | ||
4581 | read_extent_buffer(leaf, tmp, ptr, inline_size); | |
4582 | ||
5b050f04 | 4583 | max_size = min_t(unsigned long, PAGE_CACHE_SIZE, max_size); |
c8b97818 CM |
4584 | ret = btrfs_zlib_decompress(tmp, page, extent_offset, |
4585 | inline_size, max_size); | |
4586 | if (ret) { | |
4587 | char *kaddr = kmap_atomic(page, KM_USER0); | |
4588 | unsigned long copy_size = min_t(u64, | |
4589 | PAGE_CACHE_SIZE - pg_offset, | |
4590 | max_size - extent_offset); | |
4591 | memset(kaddr + pg_offset, 0, copy_size); | |
4592 | kunmap_atomic(kaddr, KM_USER0); | |
4593 | } | |
4594 | kfree(tmp); | |
4595 | return 0; | |
4596 | } | |
4597 | ||
d352ac68 CM |
4598 | /* |
4599 | * a bit scary, this does extent mapping from logical file offset to the disk. | |
d397712b CM |
4600 | * the ugly parts come from merging extents from the disk with the in-ram |
4601 | * representation. This gets more complex because of the data=ordered code, | |
d352ac68 CM |
4602 | * where the in-ram extents might be locked pending data=ordered completion. |
4603 | * | |
4604 | * This also copies inline extents directly into the page. | |
4605 | */ | |
d397712b | 4606 | |
a52d9a80 | 4607 | struct extent_map *btrfs_get_extent(struct inode *inode, struct page *page, |
70dec807 | 4608 | size_t pg_offset, u64 start, u64 len, |
a52d9a80 CM |
4609 | int create) |
4610 | { | |
4611 | int ret; | |
4612 | int err = 0; | |
db94535d | 4613 | u64 bytenr; |
a52d9a80 CM |
4614 | u64 extent_start = 0; |
4615 | u64 extent_end = 0; | |
4616 | u64 objectid = inode->i_ino; | |
4617 | u32 found_type; | |
f421950f | 4618 | struct btrfs_path *path = NULL; |
a52d9a80 CM |
4619 | struct btrfs_root *root = BTRFS_I(inode)->root; |
4620 | struct btrfs_file_extent_item *item; | |
5f39d397 CM |
4621 | struct extent_buffer *leaf; |
4622 | struct btrfs_key found_key; | |
a52d9a80 CM |
4623 | struct extent_map *em = NULL; |
4624 | struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree; | |
d1310b2e | 4625 | struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree; |
a52d9a80 | 4626 | struct btrfs_trans_handle *trans = NULL; |
c8b97818 | 4627 | int compressed; |
a52d9a80 | 4628 | |
a52d9a80 | 4629 | again: |
890871be | 4630 | read_lock(&em_tree->lock); |
d1310b2e | 4631 | em = lookup_extent_mapping(em_tree, start, len); |
a061fc8d CM |
4632 | if (em) |
4633 | em->bdev = root->fs_info->fs_devices->latest_bdev; | |
890871be | 4634 | read_unlock(&em_tree->lock); |
d1310b2e | 4635 | |
a52d9a80 | 4636 | if (em) { |
e1c4b745 CM |
4637 | if (em->start > start || em->start + em->len <= start) |
4638 | free_extent_map(em); | |
4639 | else if (em->block_start == EXTENT_MAP_INLINE && page) | |
70dec807 CM |
4640 | free_extent_map(em); |
4641 | else | |
4642 | goto out; | |
a52d9a80 | 4643 | } |
d1310b2e | 4644 | em = alloc_extent_map(GFP_NOFS); |
a52d9a80 | 4645 | if (!em) { |
d1310b2e CM |
4646 | err = -ENOMEM; |
4647 | goto out; | |
a52d9a80 | 4648 | } |
e6dcd2dc | 4649 | em->bdev = root->fs_info->fs_devices->latest_bdev; |
d1310b2e | 4650 | em->start = EXTENT_MAP_HOLE; |
445a6944 | 4651 | em->orig_start = EXTENT_MAP_HOLE; |
d1310b2e | 4652 | em->len = (u64)-1; |
c8b97818 | 4653 | em->block_len = (u64)-1; |
f421950f CM |
4654 | |
4655 | if (!path) { | |
4656 | path = btrfs_alloc_path(); | |
4657 | BUG_ON(!path); | |
4658 | } | |
4659 | ||
179e29e4 CM |
4660 | ret = btrfs_lookup_file_extent(trans, root, path, |
4661 | objectid, start, trans != NULL); | |
a52d9a80 CM |
4662 | if (ret < 0) { |
4663 | err = ret; | |
4664 | goto out; | |
4665 | } | |
4666 | ||
4667 | if (ret != 0) { | |
4668 | if (path->slots[0] == 0) | |
4669 | goto not_found; | |
4670 | path->slots[0]--; | |
4671 | } | |
4672 | ||
5f39d397 CM |
4673 | leaf = path->nodes[0]; |
4674 | item = btrfs_item_ptr(leaf, path->slots[0], | |
a52d9a80 | 4675 | struct btrfs_file_extent_item); |
a52d9a80 | 4676 | /* are we inside the extent that was found? */ |
5f39d397 CM |
4677 | btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); |
4678 | found_type = btrfs_key_type(&found_key); | |
4679 | if (found_key.objectid != objectid || | |
a52d9a80 CM |
4680 | found_type != BTRFS_EXTENT_DATA_KEY) { |
4681 | goto not_found; | |
4682 | } | |
4683 | ||
5f39d397 CM |
4684 | found_type = btrfs_file_extent_type(leaf, item); |
4685 | extent_start = found_key.offset; | |
c8b97818 | 4686 | compressed = btrfs_file_extent_compression(leaf, item); |
d899e052 YZ |
4687 | if (found_type == BTRFS_FILE_EXTENT_REG || |
4688 | found_type == BTRFS_FILE_EXTENT_PREALLOC) { | |
a52d9a80 | 4689 | extent_end = extent_start + |
db94535d | 4690 | btrfs_file_extent_num_bytes(leaf, item); |
9036c102 YZ |
4691 | } else if (found_type == BTRFS_FILE_EXTENT_INLINE) { |
4692 | size_t size; | |
4693 | size = btrfs_file_extent_inline_len(leaf, item); | |
4694 | extent_end = (extent_start + size + root->sectorsize - 1) & | |
4695 | ~((u64)root->sectorsize - 1); | |
4696 | } | |
4697 | ||
4698 | if (start >= extent_end) { | |
4699 | path->slots[0]++; | |
4700 | if (path->slots[0] >= btrfs_header_nritems(leaf)) { | |
4701 | ret = btrfs_next_leaf(root, path); | |
4702 | if (ret < 0) { | |
4703 | err = ret; | |
4704 | goto out; | |
a52d9a80 | 4705 | } |
9036c102 YZ |
4706 | if (ret > 0) |
4707 | goto not_found; | |
4708 | leaf = path->nodes[0]; | |
a52d9a80 | 4709 | } |
9036c102 YZ |
4710 | btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); |
4711 | if (found_key.objectid != objectid || | |
4712 | found_key.type != BTRFS_EXTENT_DATA_KEY) | |
4713 | goto not_found; | |
4714 | if (start + len <= found_key.offset) | |
4715 | goto not_found; | |
4716 | em->start = start; | |
4717 | em->len = found_key.offset - start; | |
4718 | goto not_found_em; | |
4719 | } | |
4720 | ||
d899e052 YZ |
4721 | if (found_type == BTRFS_FILE_EXTENT_REG || |
4722 | found_type == BTRFS_FILE_EXTENT_PREALLOC) { | |
9036c102 YZ |
4723 | em->start = extent_start; |
4724 | em->len = extent_end - extent_start; | |
ff5b7ee3 YZ |
4725 | em->orig_start = extent_start - |
4726 | btrfs_file_extent_offset(leaf, item); | |
db94535d CM |
4727 | bytenr = btrfs_file_extent_disk_bytenr(leaf, item); |
4728 | if (bytenr == 0) { | |
5f39d397 | 4729 | em->block_start = EXTENT_MAP_HOLE; |
a52d9a80 CM |
4730 | goto insert; |
4731 | } | |
c8b97818 CM |
4732 | if (compressed) { |
4733 | set_bit(EXTENT_FLAG_COMPRESSED, &em->flags); | |
4734 | em->block_start = bytenr; | |
4735 | em->block_len = btrfs_file_extent_disk_num_bytes(leaf, | |
4736 | item); | |
4737 | } else { | |
4738 | bytenr += btrfs_file_extent_offset(leaf, item); | |
4739 | em->block_start = bytenr; | |
4740 | em->block_len = em->len; | |
d899e052 YZ |
4741 | if (found_type == BTRFS_FILE_EXTENT_PREALLOC) |
4742 | set_bit(EXTENT_FLAG_PREALLOC, &em->flags); | |
c8b97818 | 4743 | } |
a52d9a80 CM |
4744 | goto insert; |
4745 | } else if (found_type == BTRFS_FILE_EXTENT_INLINE) { | |
5f39d397 | 4746 | unsigned long ptr; |
a52d9a80 | 4747 | char *map; |
3326d1b0 CM |
4748 | size_t size; |
4749 | size_t extent_offset; | |
4750 | size_t copy_size; | |
a52d9a80 | 4751 | |
689f9346 | 4752 | em->block_start = EXTENT_MAP_INLINE; |
c8b97818 | 4753 | if (!page || create) { |
689f9346 | 4754 | em->start = extent_start; |
9036c102 | 4755 | em->len = extent_end - extent_start; |
689f9346 Y |
4756 | goto out; |
4757 | } | |
5f39d397 | 4758 | |
9036c102 YZ |
4759 | size = btrfs_file_extent_inline_len(leaf, item); |
4760 | extent_offset = page_offset(page) + pg_offset - extent_start; | |
70dec807 | 4761 | copy_size = min_t(u64, PAGE_CACHE_SIZE - pg_offset, |
3326d1b0 | 4762 | size - extent_offset); |
3326d1b0 | 4763 | em->start = extent_start + extent_offset; |
70dec807 CM |
4764 | em->len = (copy_size + root->sectorsize - 1) & |
4765 | ~((u64)root->sectorsize - 1); | |
ff5b7ee3 | 4766 | em->orig_start = EXTENT_MAP_INLINE; |
c8b97818 CM |
4767 | if (compressed) |
4768 | set_bit(EXTENT_FLAG_COMPRESSED, &em->flags); | |
689f9346 | 4769 | ptr = btrfs_file_extent_inline_start(item) + extent_offset; |
179e29e4 | 4770 | if (create == 0 && !PageUptodate(page)) { |
c8b97818 CM |
4771 | if (btrfs_file_extent_compression(leaf, item) == |
4772 | BTRFS_COMPRESS_ZLIB) { | |
4773 | ret = uncompress_inline(path, inode, page, | |
4774 | pg_offset, | |
4775 | extent_offset, item); | |
4776 | BUG_ON(ret); | |
4777 | } else { | |
4778 | map = kmap(page); | |
4779 | read_extent_buffer(leaf, map + pg_offset, ptr, | |
4780 | copy_size); | |
93c82d57 CM |
4781 | if (pg_offset + copy_size < PAGE_CACHE_SIZE) { |
4782 | memset(map + pg_offset + copy_size, 0, | |
4783 | PAGE_CACHE_SIZE - pg_offset - | |
4784 | copy_size); | |
4785 | } | |
c8b97818 CM |
4786 | kunmap(page); |
4787 | } | |
179e29e4 CM |
4788 | flush_dcache_page(page); |
4789 | } else if (create && PageUptodate(page)) { | |
4790 | if (!trans) { | |
4791 | kunmap(page); | |
4792 | free_extent_map(em); | |
4793 | em = NULL; | |
4794 | btrfs_release_path(root, path); | |
f9295749 | 4795 | trans = btrfs_join_transaction(root, 1); |
179e29e4 CM |
4796 | goto again; |
4797 | } | |
c8b97818 | 4798 | map = kmap(page); |
70dec807 | 4799 | write_extent_buffer(leaf, map + pg_offset, ptr, |
179e29e4 | 4800 | copy_size); |
c8b97818 | 4801 | kunmap(page); |
179e29e4 | 4802 | btrfs_mark_buffer_dirty(leaf); |
a52d9a80 | 4803 | } |
d1310b2e CM |
4804 | set_extent_uptodate(io_tree, em->start, |
4805 | extent_map_end(em) - 1, GFP_NOFS); | |
a52d9a80 CM |
4806 | goto insert; |
4807 | } else { | |
d397712b | 4808 | printk(KERN_ERR "btrfs unknown found_type %d\n", found_type); |
a52d9a80 CM |
4809 | WARN_ON(1); |
4810 | } | |
4811 | not_found: | |
4812 | em->start = start; | |
d1310b2e | 4813 | em->len = len; |
a52d9a80 | 4814 | not_found_em: |
5f39d397 | 4815 | em->block_start = EXTENT_MAP_HOLE; |
9036c102 | 4816 | set_bit(EXTENT_FLAG_VACANCY, &em->flags); |
a52d9a80 CM |
4817 | insert: |
4818 | btrfs_release_path(root, path); | |
d1310b2e | 4819 | if (em->start > start || extent_map_end(em) <= start) { |
d397712b CM |
4820 | printk(KERN_ERR "Btrfs: bad extent! em: [%llu %llu] passed " |
4821 | "[%llu %llu]\n", (unsigned long long)em->start, | |
4822 | (unsigned long long)em->len, | |
4823 | (unsigned long long)start, | |
4824 | (unsigned long long)len); | |
a52d9a80 CM |
4825 | err = -EIO; |
4826 | goto out; | |
4827 | } | |
d1310b2e CM |
4828 | |
4829 | err = 0; | |
890871be | 4830 | write_lock(&em_tree->lock); |
a52d9a80 | 4831 | ret = add_extent_mapping(em_tree, em); |
3b951516 CM |
4832 | /* it is possible that someone inserted the extent into the tree |
4833 | * while we had the lock dropped. It is also possible that | |
4834 | * an overlapping map exists in the tree | |
4835 | */ | |
a52d9a80 | 4836 | if (ret == -EEXIST) { |
3b951516 | 4837 | struct extent_map *existing; |
e6dcd2dc CM |
4838 | |
4839 | ret = 0; | |
4840 | ||
3b951516 | 4841 | existing = lookup_extent_mapping(em_tree, start, len); |
e1c4b745 CM |
4842 | if (existing && (existing->start > start || |
4843 | existing->start + existing->len <= start)) { | |
4844 | free_extent_map(existing); | |
4845 | existing = NULL; | |
4846 | } | |
3b951516 CM |
4847 | if (!existing) { |
4848 | existing = lookup_extent_mapping(em_tree, em->start, | |
4849 | em->len); | |
4850 | if (existing) { | |
4851 | err = merge_extent_mapping(em_tree, existing, | |
e6dcd2dc CM |
4852 | em, start, |
4853 | root->sectorsize); | |
3b951516 CM |
4854 | free_extent_map(existing); |
4855 | if (err) { | |
4856 | free_extent_map(em); | |
4857 | em = NULL; | |
4858 | } | |
4859 | } else { | |
4860 | err = -EIO; | |
3b951516 CM |
4861 | free_extent_map(em); |
4862 | em = NULL; | |
4863 | } | |
4864 | } else { | |
4865 | free_extent_map(em); | |
4866 | em = existing; | |
e6dcd2dc | 4867 | err = 0; |
a52d9a80 | 4868 | } |
a52d9a80 | 4869 | } |
890871be | 4870 | write_unlock(&em_tree->lock); |
a52d9a80 | 4871 | out: |
f421950f CM |
4872 | if (path) |
4873 | btrfs_free_path(path); | |
a52d9a80 CM |
4874 | if (trans) { |
4875 | ret = btrfs_end_transaction(trans, root); | |
d397712b | 4876 | if (!err) |
a52d9a80 CM |
4877 | err = ret; |
4878 | } | |
a52d9a80 CM |
4879 | if (err) { |
4880 | free_extent_map(em); | |
a52d9a80 CM |
4881 | return ERR_PTR(err); |
4882 | } | |
4883 | return em; | |
4884 | } | |
4885 | ||
16432985 CM |
4886 | static ssize_t btrfs_direct_IO(int rw, struct kiocb *iocb, |
4887 | const struct iovec *iov, loff_t offset, | |
4888 | unsigned long nr_segs) | |
4889 | { | |
e1c4b745 | 4890 | return -EINVAL; |
16432985 CM |
4891 | } |
4892 | ||
1506fcc8 YS |
4893 | static int btrfs_fiemap(struct inode *inode, struct fiemap_extent_info *fieinfo, |
4894 | __u64 start, __u64 len) | |
4895 | { | |
4896 | return extent_fiemap(inode, fieinfo, start, len, btrfs_get_extent); | |
4897 | } | |
4898 | ||
a52d9a80 | 4899 | int btrfs_readpage(struct file *file, struct page *page) |
9ebefb18 | 4900 | { |
d1310b2e CM |
4901 | struct extent_io_tree *tree; |
4902 | tree = &BTRFS_I(page->mapping->host)->io_tree; | |
a52d9a80 | 4903 | return extent_read_full_page(tree, page, btrfs_get_extent); |
9ebefb18 | 4904 | } |
1832a6d5 | 4905 | |
a52d9a80 | 4906 | static int btrfs_writepage(struct page *page, struct writeback_control *wbc) |
39279cc3 | 4907 | { |
d1310b2e | 4908 | struct extent_io_tree *tree; |
b888db2b CM |
4909 | |
4910 | ||
4911 | if (current->flags & PF_MEMALLOC) { | |
4912 | redirty_page_for_writepage(wbc, page); | |
4913 | unlock_page(page); | |
4914 | return 0; | |
4915 | } | |
d1310b2e | 4916 | tree = &BTRFS_I(page->mapping->host)->io_tree; |
a52d9a80 | 4917 | return extent_write_full_page(tree, page, btrfs_get_extent, wbc); |
9ebefb18 CM |
4918 | } |
4919 | ||
f421950f CM |
4920 | int btrfs_writepages(struct address_space *mapping, |
4921 | struct writeback_control *wbc) | |
b293f02e | 4922 | { |
d1310b2e | 4923 | struct extent_io_tree *tree; |
771ed689 | 4924 | |
d1310b2e | 4925 | tree = &BTRFS_I(mapping->host)->io_tree; |
b293f02e CM |
4926 | return extent_writepages(tree, mapping, btrfs_get_extent, wbc); |
4927 | } | |
4928 | ||
3ab2fb5a CM |
4929 | static int |
4930 | btrfs_readpages(struct file *file, struct address_space *mapping, | |
4931 | struct list_head *pages, unsigned nr_pages) | |
4932 | { | |
d1310b2e CM |
4933 | struct extent_io_tree *tree; |
4934 | tree = &BTRFS_I(mapping->host)->io_tree; | |
3ab2fb5a CM |
4935 | return extent_readpages(tree, mapping, pages, nr_pages, |
4936 | btrfs_get_extent); | |
4937 | } | |
e6dcd2dc | 4938 | static int __btrfs_releasepage(struct page *page, gfp_t gfp_flags) |
9ebefb18 | 4939 | { |
d1310b2e CM |
4940 | struct extent_io_tree *tree; |
4941 | struct extent_map_tree *map; | |
a52d9a80 | 4942 | int ret; |
8c2383c3 | 4943 | |
d1310b2e CM |
4944 | tree = &BTRFS_I(page->mapping->host)->io_tree; |
4945 | map = &BTRFS_I(page->mapping->host)->extent_tree; | |
70dec807 | 4946 | ret = try_release_extent_mapping(map, tree, page, gfp_flags); |
a52d9a80 CM |
4947 | if (ret == 1) { |
4948 | ClearPagePrivate(page); | |
4949 | set_page_private(page, 0); | |
4950 | page_cache_release(page); | |
39279cc3 | 4951 | } |
a52d9a80 | 4952 | return ret; |
39279cc3 CM |
4953 | } |
4954 | ||
e6dcd2dc CM |
4955 | static int btrfs_releasepage(struct page *page, gfp_t gfp_flags) |
4956 | { | |
98509cfc CM |
4957 | if (PageWriteback(page) || PageDirty(page)) |
4958 | return 0; | |
b335b003 | 4959 | return __btrfs_releasepage(page, gfp_flags & GFP_NOFS); |
e6dcd2dc CM |
4960 | } |
4961 | ||
a52d9a80 | 4962 | static void btrfs_invalidatepage(struct page *page, unsigned long offset) |
39279cc3 | 4963 | { |
d1310b2e | 4964 | struct extent_io_tree *tree; |
e6dcd2dc CM |
4965 | struct btrfs_ordered_extent *ordered; |
4966 | u64 page_start = page_offset(page); | |
4967 | u64 page_end = page_start + PAGE_CACHE_SIZE - 1; | |
39279cc3 | 4968 | |
8b62b72b CM |
4969 | |
4970 | /* | |
4971 | * we have the page locked, so new writeback can't start, | |
4972 | * and the dirty bit won't be cleared while we are here. | |
4973 | * | |
4974 | * Wait for IO on this page so that we can safely clear | |
4975 | * the PagePrivate2 bit and do ordered accounting | |
4976 | */ | |
e6dcd2dc | 4977 | wait_on_page_writeback(page); |
8b62b72b | 4978 | |
d1310b2e | 4979 | tree = &BTRFS_I(page->mapping->host)->io_tree; |
e6dcd2dc CM |
4980 | if (offset) { |
4981 | btrfs_releasepage(page, GFP_NOFS); | |
4982 | return; | |
4983 | } | |
e6dcd2dc CM |
4984 | lock_extent(tree, page_start, page_end, GFP_NOFS); |
4985 | ordered = btrfs_lookup_ordered_extent(page->mapping->host, | |
4986 | page_offset(page)); | |
4987 | if (ordered) { | |
eb84ae03 CM |
4988 | /* |
4989 | * IO on this page will never be started, so we need | |
4990 | * to account for any ordered extents now | |
4991 | */ | |
e6dcd2dc CM |
4992 | clear_extent_bit(tree, page_start, page_end, |
4993 | EXTENT_DIRTY | EXTENT_DELALLOC | | |
32c00aff JB |
4994 | EXTENT_LOCKED | EXTENT_DO_ACCOUNTING, 1, 0, |
4995 | NULL, GFP_NOFS); | |
8b62b72b CM |
4996 | /* |
4997 | * whoever cleared the private bit is responsible | |
4998 | * for the finish_ordered_io | |
4999 | */ | |
5000 | if (TestClearPagePrivate2(page)) { | |
5001 | btrfs_finish_ordered_io(page->mapping->host, | |
5002 | page_start, page_end); | |
5003 | } | |
e6dcd2dc CM |
5004 | btrfs_put_ordered_extent(ordered); |
5005 | lock_extent(tree, page_start, page_end, GFP_NOFS); | |
5006 | } | |
5007 | clear_extent_bit(tree, page_start, page_end, | |
32c00aff JB |
5008 | EXTENT_LOCKED | EXTENT_DIRTY | EXTENT_DELALLOC | |
5009 | EXTENT_DO_ACCOUNTING, 1, 1, NULL, GFP_NOFS); | |
e6dcd2dc CM |
5010 | __btrfs_releasepage(page, GFP_NOFS); |
5011 | ||
4a096752 | 5012 | ClearPageChecked(page); |
9ad6b7bc | 5013 | if (PagePrivate(page)) { |
9ad6b7bc CM |
5014 | ClearPagePrivate(page); |
5015 | set_page_private(page, 0); | |
5016 | page_cache_release(page); | |
5017 | } | |
39279cc3 CM |
5018 | } |
5019 | ||
9ebefb18 CM |
5020 | /* |
5021 | * btrfs_page_mkwrite() is not allowed to change the file size as it gets | |
5022 | * called from a page fault handler when a page is first dirtied. Hence we must | |
5023 | * be careful to check for EOF conditions here. We set the page up correctly | |
5024 | * for a written page which means we get ENOSPC checking when writing into | |
5025 | * holes and correct delalloc and unwritten extent mapping on filesystems that | |
5026 | * support these features. | |
5027 | * | |
5028 | * We are not allowed to take the i_mutex here so we have to play games to | |
5029 | * protect against truncate races as the page could now be beyond EOF. Because | |
5030 | * vmtruncate() writes the inode size before removing pages, once we have the | |
5031 | * page lock we can determine safely if the page is beyond EOF. If it is not | |
5032 | * beyond EOF, then the page is guaranteed safe against truncation until we | |
5033 | * unlock the page. | |
5034 | */ | |
c2ec175c | 5035 | int btrfs_page_mkwrite(struct vm_area_struct *vma, struct vm_fault *vmf) |
9ebefb18 | 5036 | { |
c2ec175c | 5037 | struct page *page = vmf->page; |
6da6abae | 5038 | struct inode *inode = fdentry(vma->vm_file)->d_inode; |
1832a6d5 | 5039 | struct btrfs_root *root = BTRFS_I(inode)->root; |
e6dcd2dc CM |
5040 | struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree; |
5041 | struct btrfs_ordered_extent *ordered; | |
5042 | char *kaddr; | |
5043 | unsigned long zero_start; | |
9ebefb18 | 5044 | loff_t size; |
1832a6d5 | 5045 | int ret; |
a52d9a80 | 5046 | u64 page_start; |
e6dcd2dc | 5047 | u64 page_end; |
9ebefb18 | 5048 | |
6a63209f | 5049 | ret = btrfs_check_data_free_space(root, inode, PAGE_CACHE_SIZE); |
56a76f82 NP |
5050 | if (ret) { |
5051 | if (ret == -ENOMEM) | |
5052 | ret = VM_FAULT_OOM; | |
5053 | else /* -ENOSPC, -EIO, etc */ | |
5054 | ret = VM_FAULT_SIGBUS; | |
1832a6d5 | 5055 | goto out; |
56a76f82 | 5056 | } |
1832a6d5 | 5057 | |
9ed74f2d JB |
5058 | ret = btrfs_reserve_metadata_for_delalloc(root, inode, 1); |
5059 | if (ret) { | |
5060 | btrfs_free_reserved_data_space(root, inode, PAGE_CACHE_SIZE); | |
5061 | ret = VM_FAULT_SIGBUS; | |
5062 | goto out; | |
5063 | } | |
5064 | ||
56a76f82 | 5065 | ret = VM_FAULT_NOPAGE; /* make the VM retry the fault */ |
e6dcd2dc | 5066 | again: |
9ebefb18 | 5067 | lock_page(page); |
9ebefb18 | 5068 | size = i_size_read(inode); |
e6dcd2dc CM |
5069 | page_start = page_offset(page); |
5070 | page_end = page_start + PAGE_CACHE_SIZE - 1; | |
a52d9a80 | 5071 | |
9ebefb18 | 5072 | if ((page->mapping != inode->i_mapping) || |
e6dcd2dc | 5073 | (page_start >= size)) { |
6a63209f | 5074 | btrfs_free_reserved_data_space(root, inode, PAGE_CACHE_SIZE); |
9ebefb18 CM |
5075 | /* page got truncated out from underneath us */ |
5076 | goto out_unlock; | |
5077 | } | |
e6dcd2dc CM |
5078 | wait_on_page_writeback(page); |
5079 | ||
5080 | lock_extent(io_tree, page_start, page_end, GFP_NOFS); | |
5081 | set_page_extent_mapped(page); | |
5082 | ||
eb84ae03 CM |
5083 | /* |
5084 | * we can't set the delalloc bits if there are pending ordered | |
5085 | * extents. Drop our locks and wait for them to finish | |
5086 | */ | |
e6dcd2dc CM |
5087 | ordered = btrfs_lookup_ordered_extent(inode, page_start); |
5088 | if (ordered) { | |
5089 | unlock_extent(io_tree, page_start, page_end, GFP_NOFS); | |
5090 | unlock_page(page); | |
eb84ae03 | 5091 | btrfs_start_ordered_extent(inode, ordered, 1); |
e6dcd2dc CM |
5092 | btrfs_put_ordered_extent(ordered); |
5093 | goto again; | |
5094 | } | |
5095 | ||
fbf19087 JB |
5096 | /* |
5097 | * XXX - page_mkwrite gets called every time the page is dirtied, even | |
5098 | * if it was already dirty, so for space accounting reasons we need to | |
5099 | * clear any delalloc bits for the range we are fixing to save. There | |
5100 | * is probably a better way to do this, but for now keep consistent with | |
5101 | * prepare_pages in the normal write path. | |
5102 | */ | |
5103 | clear_extent_bits(&BTRFS_I(inode)->io_tree, page_start, page_end, | |
32c00aff JB |
5104 | EXTENT_DIRTY | EXTENT_DELALLOC | EXTENT_DO_ACCOUNTING, |
5105 | GFP_NOFS); | |
fbf19087 | 5106 | |
9ed74f2d JB |
5107 | ret = btrfs_set_extent_delalloc(inode, page_start, page_end); |
5108 | if (ret) { | |
5109 | unlock_extent(io_tree, page_start, page_end, GFP_NOFS); | |
5110 | ret = VM_FAULT_SIGBUS; | |
fbf19087 | 5111 | btrfs_free_reserved_data_space(root, inode, PAGE_CACHE_SIZE); |
9ed74f2d JB |
5112 | goto out_unlock; |
5113 | } | |
e6dcd2dc | 5114 | ret = 0; |
9ebefb18 CM |
5115 | |
5116 | /* page is wholly or partially inside EOF */ | |
a52d9a80 | 5117 | if (page_start + PAGE_CACHE_SIZE > size) |
e6dcd2dc | 5118 | zero_start = size & ~PAGE_CACHE_MASK; |
9ebefb18 | 5119 | else |
e6dcd2dc | 5120 | zero_start = PAGE_CACHE_SIZE; |
9ebefb18 | 5121 | |
e6dcd2dc CM |
5122 | if (zero_start != PAGE_CACHE_SIZE) { |
5123 | kaddr = kmap(page); | |
5124 | memset(kaddr + zero_start, 0, PAGE_CACHE_SIZE - zero_start); | |
5125 | flush_dcache_page(page); | |
5126 | kunmap(page); | |
5127 | } | |
247e743c | 5128 | ClearPageChecked(page); |
e6dcd2dc | 5129 | set_page_dirty(page); |
50a9b214 | 5130 | SetPageUptodate(page); |
5a3f23d5 | 5131 | |
257c62e1 CM |
5132 | BTRFS_I(inode)->last_trans = root->fs_info->generation; |
5133 | BTRFS_I(inode)->last_sub_trans = BTRFS_I(inode)->root->log_transid; | |
5134 | ||
e6dcd2dc | 5135 | unlock_extent(io_tree, page_start, page_end, GFP_NOFS); |
9ebefb18 CM |
5136 | |
5137 | out_unlock: | |
9ed74f2d | 5138 | btrfs_unreserve_metadata_for_delalloc(root, inode, 1); |
50a9b214 CM |
5139 | if (!ret) |
5140 | return VM_FAULT_LOCKED; | |
9ebefb18 | 5141 | unlock_page(page); |
1832a6d5 | 5142 | out: |
9ebefb18 CM |
5143 | return ret; |
5144 | } | |
5145 | ||
39279cc3 CM |
5146 | static void btrfs_truncate(struct inode *inode) |
5147 | { | |
5148 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
5149 | int ret; | |
5150 | struct btrfs_trans_handle *trans; | |
d3c2fdcf | 5151 | unsigned long nr; |
dbe674a9 | 5152 | u64 mask = root->sectorsize - 1; |
39279cc3 | 5153 | |
8082510e YZ |
5154 | if (!S_ISREG(inode->i_mode)) { |
5155 | WARN_ON(1); | |
39279cc3 | 5156 | return; |
8082510e | 5157 | } |
39279cc3 | 5158 | |
5d5e103a JB |
5159 | ret = btrfs_truncate_page(inode->i_mapping, inode->i_size); |
5160 | if (ret) | |
5161 | return; | |
8082510e | 5162 | |
4a096752 | 5163 | btrfs_wait_ordered_range(inode, inode->i_size & (~mask), (u64)-1); |
8082510e | 5164 | btrfs_ordered_update_i_size(inode, inode->i_size, NULL); |
39279cc3 | 5165 | |
39279cc3 | 5166 | trans = btrfs_start_transaction(root, 1); |
8082510e | 5167 | btrfs_set_trans_block_group(trans, inode); |
5a3f23d5 CM |
5168 | |
5169 | /* | |
5170 | * setattr is responsible for setting the ordered_data_close flag, | |
5171 | * but that is only tested during the last file release. That | |
5172 | * could happen well after the next commit, leaving a great big | |
5173 | * window where new writes may get lost if someone chooses to write | |
5174 | * to this file after truncating to zero | |
5175 | * | |
5176 | * The inode doesn't have any dirty data here, and so if we commit | |
5177 | * this is a noop. If someone immediately starts writing to the inode | |
5178 | * it is very likely we'll catch some of their writes in this | |
5179 | * transaction, and the commit will find this file on the ordered | |
5180 | * data list with good things to send down. | |
5181 | * | |
5182 | * This is a best effort solution, there is still a window where | |
5183 | * using truncate to replace the contents of the file will | |
5184 | * end up with a zero length file after a crash. | |
5185 | */ | |
5186 | if (inode->i_size == 0 && BTRFS_I(inode)->ordered_data_close) | |
5187 | btrfs_add_ordered_operation(trans, root, inode); | |
5188 | ||
8082510e YZ |
5189 | while (1) { |
5190 | ret = btrfs_truncate_inode_items(trans, root, inode, | |
5191 | inode->i_size, | |
5192 | BTRFS_EXTENT_DATA_KEY); | |
5193 | if (ret != -EAGAIN) | |
5194 | break; | |
39279cc3 | 5195 | |
8082510e YZ |
5196 | ret = btrfs_update_inode(trans, root, inode); |
5197 | BUG_ON(ret); | |
5f39d397 | 5198 | |
8082510e YZ |
5199 | nr = trans->blocks_used; |
5200 | btrfs_end_transaction(trans, root); | |
5201 | btrfs_btree_balance_dirty(root, nr); | |
5202 | ||
5203 | trans = btrfs_start_transaction(root, 1); | |
5204 | btrfs_set_trans_block_group(trans, inode); | |
5205 | } | |
5206 | ||
5207 | if (ret == 0 && inode->i_nlink > 0) { | |
5208 | ret = btrfs_orphan_del(trans, inode); | |
5209 | BUG_ON(ret); | |
5210 | } | |
5211 | ||
5212 | ret = btrfs_update_inode(trans, root, inode); | |
7b128766 JB |
5213 | BUG_ON(ret); |
5214 | ||
7b128766 | 5215 | nr = trans->blocks_used; |
89ce8a63 | 5216 | ret = btrfs_end_transaction_throttle(trans, root); |
39279cc3 | 5217 | BUG_ON(ret); |
d3c2fdcf | 5218 | btrfs_btree_balance_dirty(root, nr); |
39279cc3 CM |
5219 | } |
5220 | ||
d352ac68 CM |
5221 | /* |
5222 | * create a new subvolume directory/inode (helper for the ioctl). | |
5223 | */ | |
d2fb3437 | 5224 | int btrfs_create_subvol_root(struct btrfs_trans_handle *trans, |
76dda93c | 5225 | struct btrfs_root *new_root, |
d2fb3437 | 5226 | u64 new_dirid, u64 alloc_hint) |
39279cc3 | 5227 | { |
39279cc3 | 5228 | struct inode *inode; |
76dda93c | 5229 | int err; |
00e4e6b3 | 5230 | u64 index = 0; |
39279cc3 | 5231 | |
aec7477b | 5232 | inode = btrfs_new_inode(trans, new_root, NULL, "..", 2, new_dirid, |
d2fb3437 | 5233 | new_dirid, alloc_hint, S_IFDIR | 0700, &index); |
54aa1f4d | 5234 | if (IS_ERR(inode)) |
f46b5a66 | 5235 | return PTR_ERR(inode); |
39279cc3 CM |
5236 | inode->i_op = &btrfs_dir_inode_operations; |
5237 | inode->i_fop = &btrfs_dir_file_operations; | |
5238 | ||
39279cc3 | 5239 | inode->i_nlink = 1; |
dbe674a9 | 5240 | btrfs_i_size_write(inode, 0); |
3b96362c | 5241 | |
76dda93c YZ |
5242 | err = btrfs_update_inode(trans, new_root, inode); |
5243 | BUG_ON(err); | |
cb8e7090 | 5244 | |
76dda93c | 5245 | iput(inode); |
cb8e7090 | 5246 | return 0; |
39279cc3 CM |
5247 | } |
5248 | ||
d352ac68 CM |
5249 | /* helper function for file defrag and space balancing. This |
5250 | * forces readahead on a given range of bytes in an inode | |
5251 | */ | |
edbd8d4e | 5252 | unsigned long btrfs_force_ra(struct address_space *mapping, |
86479a04 CM |
5253 | struct file_ra_state *ra, struct file *file, |
5254 | pgoff_t offset, pgoff_t last_index) | |
5255 | { | |
8e7bf94f | 5256 | pgoff_t req_size = last_index - offset + 1; |
86479a04 | 5257 | |
86479a04 CM |
5258 | page_cache_sync_readahead(mapping, ra, file, offset, req_size); |
5259 | return offset + req_size; | |
86479a04 CM |
5260 | } |
5261 | ||
39279cc3 CM |
5262 | struct inode *btrfs_alloc_inode(struct super_block *sb) |
5263 | { | |
5264 | struct btrfs_inode *ei; | |
5265 | ||
5266 | ei = kmem_cache_alloc(btrfs_inode_cachep, GFP_NOFS); | |
5267 | if (!ei) | |
5268 | return NULL; | |
15ee9bc7 | 5269 | ei->last_trans = 0; |
257c62e1 | 5270 | ei->last_sub_trans = 0; |
e02119d5 | 5271 | ei->logged_trans = 0; |
32c00aff JB |
5272 | ei->outstanding_extents = 0; |
5273 | ei->reserved_extents = 0; | |
a6dbd429 | 5274 | ei->root = NULL; |
32c00aff | 5275 | spin_lock_init(&ei->accounting_lock); |
e6dcd2dc | 5276 | btrfs_ordered_inode_tree_init(&ei->ordered_tree); |
7b128766 | 5277 | INIT_LIST_HEAD(&ei->i_orphan); |
5a3f23d5 | 5278 | INIT_LIST_HEAD(&ei->ordered_operations); |
39279cc3 CM |
5279 | return &ei->vfs_inode; |
5280 | } | |
5281 | ||
5282 | void btrfs_destroy_inode(struct inode *inode) | |
5283 | { | |
e6dcd2dc | 5284 | struct btrfs_ordered_extent *ordered; |
5a3f23d5 CM |
5285 | struct btrfs_root *root = BTRFS_I(inode)->root; |
5286 | ||
39279cc3 CM |
5287 | WARN_ON(!list_empty(&inode->i_dentry)); |
5288 | WARN_ON(inode->i_data.nrpages); | |
5289 | ||
a6dbd429 JB |
5290 | /* |
5291 | * This can happen where we create an inode, but somebody else also | |
5292 | * created the same inode and we need to destroy the one we already | |
5293 | * created. | |
5294 | */ | |
5295 | if (!root) | |
5296 | goto free; | |
5297 | ||
5a3f23d5 CM |
5298 | /* |
5299 | * Make sure we're properly removed from the ordered operation | |
5300 | * lists. | |
5301 | */ | |
5302 | smp_mb(); | |
5303 | if (!list_empty(&BTRFS_I(inode)->ordered_operations)) { | |
5304 | spin_lock(&root->fs_info->ordered_extent_lock); | |
5305 | list_del_init(&BTRFS_I(inode)->ordered_operations); | |
5306 | spin_unlock(&root->fs_info->ordered_extent_lock); | |
5307 | } | |
5308 | ||
5309 | spin_lock(&root->list_lock); | |
7b128766 | 5310 | if (!list_empty(&BTRFS_I(inode)->i_orphan)) { |
8082510e YZ |
5311 | printk(KERN_INFO "BTRFS: inode %lu still on the orphan list\n", |
5312 | inode->i_ino); | |
5313 | list_del_init(&BTRFS_I(inode)->i_orphan); | |
7b128766 | 5314 | } |
5a3f23d5 | 5315 | spin_unlock(&root->list_lock); |
7b128766 | 5316 | |
d397712b | 5317 | while (1) { |
e6dcd2dc CM |
5318 | ordered = btrfs_lookup_first_ordered_extent(inode, (u64)-1); |
5319 | if (!ordered) | |
5320 | break; | |
5321 | else { | |
d397712b CM |
5322 | printk(KERN_ERR "btrfs found ordered " |
5323 | "extent %llu %llu on inode cleanup\n", | |
5324 | (unsigned long long)ordered->file_offset, | |
5325 | (unsigned long long)ordered->len); | |
e6dcd2dc CM |
5326 | btrfs_remove_ordered_extent(inode, ordered); |
5327 | btrfs_put_ordered_extent(ordered); | |
5328 | btrfs_put_ordered_extent(ordered); | |
5329 | } | |
5330 | } | |
5d4f98a2 | 5331 | inode_tree_del(inode); |
5b21f2ed | 5332 | btrfs_drop_extent_cache(inode, 0, (u64)-1, 0); |
a6dbd429 | 5333 | free: |
39279cc3 CM |
5334 | kmem_cache_free(btrfs_inode_cachep, BTRFS_I(inode)); |
5335 | } | |
5336 | ||
76dda93c YZ |
5337 | void btrfs_drop_inode(struct inode *inode) |
5338 | { | |
5339 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
5340 | ||
5341 | if (inode->i_nlink > 0 && btrfs_root_refs(&root->root_item) == 0) | |
5342 | generic_delete_inode(inode); | |
5343 | else | |
5344 | generic_drop_inode(inode); | |
5345 | } | |
5346 | ||
0ee0fda0 | 5347 | static void init_once(void *foo) |
39279cc3 CM |
5348 | { |
5349 | struct btrfs_inode *ei = (struct btrfs_inode *) foo; | |
5350 | ||
5351 | inode_init_once(&ei->vfs_inode); | |
5352 | } | |
5353 | ||
5354 | void btrfs_destroy_cachep(void) | |
5355 | { | |
5356 | if (btrfs_inode_cachep) | |
5357 | kmem_cache_destroy(btrfs_inode_cachep); | |
5358 | if (btrfs_trans_handle_cachep) | |
5359 | kmem_cache_destroy(btrfs_trans_handle_cachep); | |
5360 | if (btrfs_transaction_cachep) | |
5361 | kmem_cache_destroy(btrfs_transaction_cachep); | |
39279cc3 CM |
5362 | if (btrfs_path_cachep) |
5363 | kmem_cache_destroy(btrfs_path_cachep); | |
5364 | } | |
5365 | ||
5366 | int btrfs_init_cachep(void) | |
5367 | { | |
9601e3f6 CH |
5368 | btrfs_inode_cachep = kmem_cache_create("btrfs_inode_cache", |
5369 | sizeof(struct btrfs_inode), 0, | |
5370 | SLAB_RECLAIM_ACCOUNT | SLAB_MEM_SPREAD, init_once); | |
39279cc3 CM |
5371 | if (!btrfs_inode_cachep) |
5372 | goto fail; | |
9601e3f6 CH |
5373 | |
5374 | btrfs_trans_handle_cachep = kmem_cache_create("btrfs_trans_handle_cache", | |
5375 | sizeof(struct btrfs_trans_handle), 0, | |
5376 | SLAB_RECLAIM_ACCOUNT | SLAB_MEM_SPREAD, NULL); | |
39279cc3 CM |
5377 | if (!btrfs_trans_handle_cachep) |
5378 | goto fail; | |
9601e3f6 CH |
5379 | |
5380 | btrfs_transaction_cachep = kmem_cache_create("btrfs_transaction_cache", | |
5381 | sizeof(struct btrfs_transaction), 0, | |
5382 | SLAB_RECLAIM_ACCOUNT | SLAB_MEM_SPREAD, NULL); | |
39279cc3 CM |
5383 | if (!btrfs_transaction_cachep) |
5384 | goto fail; | |
9601e3f6 CH |
5385 | |
5386 | btrfs_path_cachep = kmem_cache_create("btrfs_path_cache", | |
5387 | sizeof(struct btrfs_path), 0, | |
5388 | SLAB_RECLAIM_ACCOUNT | SLAB_MEM_SPREAD, NULL); | |
39279cc3 CM |
5389 | if (!btrfs_path_cachep) |
5390 | goto fail; | |
9601e3f6 | 5391 | |
39279cc3 CM |
5392 | return 0; |
5393 | fail: | |
5394 | btrfs_destroy_cachep(); | |
5395 | return -ENOMEM; | |
5396 | } | |
5397 | ||
5398 | static int btrfs_getattr(struct vfsmount *mnt, | |
5399 | struct dentry *dentry, struct kstat *stat) | |
5400 | { | |
5401 | struct inode *inode = dentry->d_inode; | |
5402 | generic_fillattr(inode, stat); | |
3394e160 | 5403 | stat->dev = BTRFS_I(inode)->root->anon_super.s_dev; |
d6667462 | 5404 | stat->blksize = PAGE_CACHE_SIZE; |
a76a3cd4 YZ |
5405 | stat->blocks = (inode_get_bytes(inode) + |
5406 | BTRFS_I(inode)->delalloc_bytes) >> 9; | |
39279cc3 CM |
5407 | return 0; |
5408 | } | |
5409 | ||
d397712b CM |
5410 | static int btrfs_rename(struct inode *old_dir, struct dentry *old_dentry, |
5411 | struct inode *new_dir, struct dentry *new_dentry) | |
39279cc3 CM |
5412 | { |
5413 | struct btrfs_trans_handle *trans; | |
5414 | struct btrfs_root *root = BTRFS_I(old_dir)->root; | |
4df27c4d | 5415 | struct btrfs_root *dest = BTRFS_I(new_dir)->root; |
39279cc3 CM |
5416 | struct inode *new_inode = new_dentry->d_inode; |
5417 | struct inode *old_inode = old_dentry->d_inode; | |
5418 | struct timespec ctime = CURRENT_TIME; | |
00e4e6b3 | 5419 | u64 index = 0; |
4df27c4d | 5420 | u64 root_objectid; |
39279cc3 CM |
5421 | int ret; |
5422 | ||
f679a840 YZ |
5423 | if (new_dir->i_ino == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID) |
5424 | return -EPERM; | |
5425 | ||
4df27c4d YZ |
5426 | /* we only allow rename subvolume link between subvolumes */ |
5427 | if (old_inode->i_ino != BTRFS_FIRST_FREE_OBJECTID && root != dest) | |
3394e160 CM |
5428 | return -EXDEV; |
5429 | ||
4df27c4d YZ |
5430 | if (old_inode->i_ino == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID || |
5431 | (new_inode && new_inode->i_ino == BTRFS_FIRST_FREE_OBJECTID)) | |
39279cc3 | 5432 | return -ENOTEMPTY; |
5f39d397 | 5433 | |
4df27c4d YZ |
5434 | if (S_ISDIR(old_inode->i_mode) && new_inode && |
5435 | new_inode->i_size > BTRFS_EMPTY_DIR_SIZE) | |
5436 | return -ENOTEMPTY; | |
0660b5af | 5437 | |
9ed74f2d | 5438 | /* |
5df6a9f6 JB |
5439 | * We want to reserve the absolute worst case amount of items. So if |
5440 | * both inodes are subvols and we need to unlink them then that would | |
5441 | * require 4 item modifications, but if they are both normal inodes it | |
5442 | * would require 5 item modifications, so we'll assume their normal | |
5443 | * inodes. So 5 * 2 is 10, plus 1 for the new link, so 11 total items | |
5444 | * should cover the worst case number of items we'll modify. | |
9ed74f2d | 5445 | */ |
5df6a9f6 | 5446 | ret = btrfs_reserve_metadata_space(root, 11); |
1832a6d5 | 5447 | if (ret) |
4df27c4d | 5448 | return ret; |
1832a6d5 | 5449 | |
5a3f23d5 CM |
5450 | /* |
5451 | * we're using rename to replace one file with another. | |
5452 | * and the replacement file is large. Start IO on it now so | |
5453 | * we don't add too much work to the end of the transaction | |
5454 | */ | |
4baf8c92 | 5455 | if (new_inode && S_ISREG(old_inode->i_mode) && new_inode->i_size && |
5a3f23d5 CM |
5456 | old_inode->i_size > BTRFS_ORDERED_OPERATIONS_FLUSH_LIMIT) |
5457 | filemap_flush(old_inode->i_mapping); | |
5458 | ||
76dda93c YZ |
5459 | /* close the racy window with snapshot create/destroy ioctl */ |
5460 | if (old_inode->i_ino == BTRFS_FIRST_FREE_OBJECTID) | |
5461 | down_read(&root->fs_info->subvol_sem); | |
5462 | ||
39279cc3 | 5463 | trans = btrfs_start_transaction(root, 1); |
a5719521 | 5464 | btrfs_set_trans_block_group(trans, new_dir); |
5f39d397 | 5465 | |
4df27c4d YZ |
5466 | if (dest != root) |
5467 | btrfs_record_root_in_trans(trans, dest); | |
5f39d397 | 5468 | |
a5719521 YZ |
5469 | ret = btrfs_set_inode_index(new_dir, &index); |
5470 | if (ret) | |
5471 | goto out_fail; | |
5a3f23d5 | 5472 | |
a5719521 | 5473 | if (unlikely(old_inode->i_ino == BTRFS_FIRST_FREE_OBJECTID)) { |
4df27c4d YZ |
5474 | /* force full log commit if subvolume involved. */ |
5475 | root->fs_info->last_trans_log_full_commit = trans->transid; | |
5476 | } else { | |
a5719521 YZ |
5477 | ret = btrfs_insert_inode_ref(trans, dest, |
5478 | new_dentry->d_name.name, | |
5479 | new_dentry->d_name.len, | |
5480 | old_inode->i_ino, | |
5481 | new_dir->i_ino, index); | |
5482 | if (ret) | |
5483 | goto out_fail; | |
4df27c4d YZ |
5484 | /* |
5485 | * this is an ugly little race, but the rename is required | |
5486 | * to make sure that if we crash, the inode is either at the | |
5487 | * old name or the new one. pinning the log transaction lets | |
5488 | * us make sure we don't allow a log commit to come in after | |
5489 | * we unlink the name but before we add the new name back in. | |
5490 | */ | |
5491 | btrfs_pin_log_trans(root); | |
5492 | } | |
5a3f23d5 CM |
5493 | /* |
5494 | * make sure the inode gets flushed if it is replacing | |
5495 | * something. | |
5496 | */ | |
5497 | if (new_inode && new_inode->i_size && | |
5498 | old_inode && S_ISREG(old_inode->i_mode)) { | |
5499 | btrfs_add_ordered_operation(trans, root, old_inode); | |
5500 | } | |
5501 | ||
39279cc3 CM |
5502 | old_dir->i_ctime = old_dir->i_mtime = ctime; |
5503 | new_dir->i_ctime = new_dir->i_mtime = ctime; | |
5504 | old_inode->i_ctime = ctime; | |
5f39d397 | 5505 | |
12fcfd22 CM |
5506 | if (old_dentry->d_parent != new_dentry->d_parent) |
5507 | btrfs_record_unlink_dir(trans, old_dir, old_inode, 1); | |
5508 | ||
4df27c4d YZ |
5509 | if (unlikely(old_inode->i_ino == BTRFS_FIRST_FREE_OBJECTID)) { |
5510 | root_objectid = BTRFS_I(old_inode)->root->root_key.objectid; | |
5511 | ret = btrfs_unlink_subvol(trans, root, old_dir, root_objectid, | |
5512 | old_dentry->d_name.name, | |
5513 | old_dentry->d_name.len); | |
5514 | } else { | |
5515 | btrfs_inc_nlink(old_dentry->d_inode); | |
5516 | ret = btrfs_unlink_inode(trans, root, old_dir, | |
5517 | old_dentry->d_inode, | |
5518 | old_dentry->d_name.name, | |
5519 | old_dentry->d_name.len); | |
5520 | } | |
5521 | BUG_ON(ret); | |
39279cc3 CM |
5522 | |
5523 | if (new_inode) { | |
5524 | new_inode->i_ctime = CURRENT_TIME; | |
4df27c4d YZ |
5525 | if (unlikely(new_inode->i_ino == |
5526 | BTRFS_EMPTY_SUBVOL_DIR_OBJECTID)) { | |
5527 | root_objectid = BTRFS_I(new_inode)->location.objectid; | |
5528 | ret = btrfs_unlink_subvol(trans, dest, new_dir, | |
5529 | root_objectid, | |
5530 | new_dentry->d_name.name, | |
5531 | new_dentry->d_name.len); | |
5532 | BUG_ON(new_inode->i_nlink == 0); | |
5533 | } else { | |
5534 | ret = btrfs_unlink_inode(trans, dest, new_dir, | |
5535 | new_dentry->d_inode, | |
5536 | new_dentry->d_name.name, | |
5537 | new_dentry->d_name.len); | |
5538 | } | |
5539 | BUG_ON(ret); | |
7b128766 | 5540 | if (new_inode->i_nlink == 0) { |
e02119d5 | 5541 | ret = btrfs_orphan_add(trans, new_dentry->d_inode); |
4df27c4d | 5542 | BUG_ON(ret); |
7b128766 | 5543 | } |
39279cc3 | 5544 | } |
aec7477b | 5545 | |
4df27c4d YZ |
5546 | ret = btrfs_add_link(trans, new_dir, old_inode, |
5547 | new_dentry->d_name.name, | |
a5719521 | 5548 | new_dentry->d_name.len, 0, index); |
4df27c4d | 5549 | BUG_ON(ret); |
39279cc3 | 5550 | |
4df27c4d YZ |
5551 | if (old_inode->i_ino != BTRFS_FIRST_FREE_OBJECTID) { |
5552 | btrfs_log_new_name(trans, old_inode, old_dir, | |
5553 | new_dentry->d_parent); | |
5554 | btrfs_end_log_trans(root); | |
5555 | } | |
39279cc3 | 5556 | out_fail: |
ab78c84d | 5557 | btrfs_end_transaction_throttle(trans, root); |
4df27c4d | 5558 | |
76dda93c YZ |
5559 | if (old_inode->i_ino == BTRFS_FIRST_FREE_OBJECTID) |
5560 | up_read(&root->fs_info->subvol_sem); | |
9ed74f2d | 5561 | |
5df6a9f6 | 5562 | btrfs_unreserve_metadata_space(root, 11); |
39279cc3 CM |
5563 | return ret; |
5564 | } | |
5565 | ||
d352ac68 CM |
5566 | /* |
5567 | * some fairly slow code that needs optimization. This walks the list | |
5568 | * of all the inodes with pending delalloc and forces them to disk. | |
5569 | */ | |
ea8c2819 CM |
5570 | int btrfs_start_delalloc_inodes(struct btrfs_root *root) |
5571 | { | |
5572 | struct list_head *head = &root->fs_info->delalloc_inodes; | |
5573 | struct btrfs_inode *binode; | |
5b21f2ed | 5574 | struct inode *inode; |
ea8c2819 | 5575 | |
c146afad YZ |
5576 | if (root->fs_info->sb->s_flags & MS_RDONLY) |
5577 | return -EROFS; | |
5578 | ||
75eff68e | 5579 | spin_lock(&root->fs_info->delalloc_lock); |
d397712b | 5580 | while (!list_empty(head)) { |
ea8c2819 CM |
5581 | binode = list_entry(head->next, struct btrfs_inode, |
5582 | delalloc_inodes); | |
5b21f2ed ZY |
5583 | inode = igrab(&binode->vfs_inode); |
5584 | if (!inode) | |
5585 | list_del_init(&binode->delalloc_inodes); | |
75eff68e | 5586 | spin_unlock(&root->fs_info->delalloc_lock); |
5b21f2ed | 5587 | if (inode) { |
8c8bee1d | 5588 | filemap_flush(inode->i_mapping); |
5b21f2ed ZY |
5589 | iput(inode); |
5590 | } | |
5591 | cond_resched(); | |
75eff68e | 5592 | spin_lock(&root->fs_info->delalloc_lock); |
ea8c2819 | 5593 | } |
75eff68e | 5594 | spin_unlock(&root->fs_info->delalloc_lock); |
8c8bee1d CM |
5595 | |
5596 | /* the filemap_flush will queue IO into the worker threads, but | |
5597 | * we have to make sure the IO is actually started and that | |
5598 | * ordered extents get created before we return | |
5599 | */ | |
5600 | atomic_inc(&root->fs_info->async_submit_draining); | |
d397712b | 5601 | while (atomic_read(&root->fs_info->nr_async_submits) || |
771ed689 | 5602 | atomic_read(&root->fs_info->async_delalloc_pages)) { |
8c8bee1d | 5603 | wait_event(root->fs_info->async_submit_wait, |
771ed689 CM |
5604 | (atomic_read(&root->fs_info->nr_async_submits) == 0 && |
5605 | atomic_read(&root->fs_info->async_delalloc_pages) == 0)); | |
8c8bee1d CM |
5606 | } |
5607 | atomic_dec(&root->fs_info->async_submit_draining); | |
ea8c2819 CM |
5608 | return 0; |
5609 | } | |
5610 | ||
39279cc3 CM |
5611 | static int btrfs_symlink(struct inode *dir, struct dentry *dentry, |
5612 | const char *symname) | |
5613 | { | |
5614 | struct btrfs_trans_handle *trans; | |
5615 | struct btrfs_root *root = BTRFS_I(dir)->root; | |
5616 | struct btrfs_path *path; | |
5617 | struct btrfs_key key; | |
1832a6d5 | 5618 | struct inode *inode = NULL; |
39279cc3 CM |
5619 | int err; |
5620 | int drop_inode = 0; | |
5621 | u64 objectid; | |
00e4e6b3 | 5622 | u64 index = 0 ; |
39279cc3 CM |
5623 | int name_len; |
5624 | int datasize; | |
5f39d397 | 5625 | unsigned long ptr; |
39279cc3 | 5626 | struct btrfs_file_extent_item *ei; |
5f39d397 | 5627 | struct extent_buffer *leaf; |
1832a6d5 | 5628 | unsigned long nr = 0; |
39279cc3 CM |
5629 | |
5630 | name_len = strlen(symname) + 1; | |
5631 | if (name_len > BTRFS_MAX_INLINE_DATA_SIZE(root)) | |
5632 | return -ENAMETOOLONG; | |
1832a6d5 | 5633 | |
9ed74f2d JB |
5634 | /* |
5635 | * 2 items for inode item and ref | |
5636 | * 2 items for dir items | |
5637 | * 1 item for xattr if selinux is on | |
5638 | */ | |
5639 | err = btrfs_reserve_metadata_space(root, 5); | |
1832a6d5 | 5640 | if (err) |
9ed74f2d | 5641 | return err; |
1832a6d5 | 5642 | |
39279cc3 | 5643 | trans = btrfs_start_transaction(root, 1); |
9ed74f2d JB |
5644 | if (!trans) |
5645 | goto out_fail; | |
39279cc3 CM |
5646 | btrfs_set_trans_block_group(trans, dir); |
5647 | ||
5648 | err = btrfs_find_free_objectid(trans, root, dir->i_ino, &objectid); | |
5649 | if (err) { | |
5650 | err = -ENOSPC; | |
5651 | goto out_unlock; | |
5652 | } | |
5653 | ||
aec7477b | 5654 | inode = btrfs_new_inode(trans, root, dir, dentry->d_name.name, |
9c58309d CM |
5655 | dentry->d_name.len, |
5656 | dentry->d_parent->d_inode->i_ino, objectid, | |
00e4e6b3 CM |
5657 | BTRFS_I(dir)->block_group, S_IFLNK|S_IRWXUGO, |
5658 | &index); | |
39279cc3 CM |
5659 | err = PTR_ERR(inode); |
5660 | if (IS_ERR(inode)) | |
5661 | goto out_unlock; | |
5662 | ||
0279b4cd | 5663 | err = btrfs_init_inode_security(inode, dir); |
33268eaf JB |
5664 | if (err) { |
5665 | drop_inode = 1; | |
5666 | goto out_unlock; | |
5667 | } | |
5668 | ||
39279cc3 | 5669 | btrfs_set_trans_block_group(trans, inode); |
00e4e6b3 | 5670 | err = btrfs_add_nondir(trans, dentry, inode, 0, index); |
39279cc3 CM |
5671 | if (err) |
5672 | drop_inode = 1; | |
5673 | else { | |
5674 | inode->i_mapping->a_ops = &btrfs_aops; | |
04160088 | 5675 | inode->i_mapping->backing_dev_info = &root->fs_info->bdi; |
39279cc3 CM |
5676 | inode->i_fop = &btrfs_file_operations; |
5677 | inode->i_op = &btrfs_file_inode_operations; | |
d1310b2e | 5678 | BTRFS_I(inode)->io_tree.ops = &btrfs_extent_io_ops; |
39279cc3 | 5679 | } |
39279cc3 CM |
5680 | btrfs_update_inode_block_group(trans, inode); |
5681 | btrfs_update_inode_block_group(trans, dir); | |
5682 | if (drop_inode) | |
5683 | goto out_unlock; | |
5684 | ||
5685 | path = btrfs_alloc_path(); | |
5686 | BUG_ON(!path); | |
5687 | key.objectid = inode->i_ino; | |
5688 | key.offset = 0; | |
39279cc3 CM |
5689 | btrfs_set_key_type(&key, BTRFS_EXTENT_DATA_KEY); |
5690 | datasize = btrfs_file_extent_calc_inline_size(name_len); | |
5691 | err = btrfs_insert_empty_item(trans, root, path, &key, | |
5692 | datasize); | |
54aa1f4d CM |
5693 | if (err) { |
5694 | drop_inode = 1; | |
5695 | goto out_unlock; | |
5696 | } | |
5f39d397 CM |
5697 | leaf = path->nodes[0]; |
5698 | ei = btrfs_item_ptr(leaf, path->slots[0], | |
5699 | struct btrfs_file_extent_item); | |
5700 | btrfs_set_file_extent_generation(leaf, ei, trans->transid); | |
5701 | btrfs_set_file_extent_type(leaf, ei, | |
39279cc3 | 5702 | BTRFS_FILE_EXTENT_INLINE); |
c8b97818 CM |
5703 | btrfs_set_file_extent_encryption(leaf, ei, 0); |
5704 | btrfs_set_file_extent_compression(leaf, ei, 0); | |
5705 | btrfs_set_file_extent_other_encoding(leaf, ei, 0); | |
5706 | btrfs_set_file_extent_ram_bytes(leaf, ei, name_len); | |
5707 | ||
39279cc3 | 5708 | ptr = btrfs_file_extent_inline_start(ei); |
5f39d397 CM |
5709 | write_extent_buffer(leaf, symname, ptr, name_len); |
5710 | btrfs_mark_buffer_dirty(leaf); | |
39279cc3 | 5711 | btrfs_free_path(path); |
5f39d397 | 5712 | |
39279cc3 CM |
5713 | inode->i_op = &btrfs_symlink_inode_operations; |
5714 | inode->i_mapping->a_ops = &btrfs_symlink_aops; | |
04160088 | 5715 | inode->i_mapping->backing_dev_info = &root->fs_info->bdi; |
d899e052 | 5716 | inode_set_bytes(inode, name_len); |
dbe674a9 | 5717 | btrfs_i_size_write(inode, name_len - 1); |
54aa1f4d CM |
5718 | err = btrfs_update_inode(trans, root, inode); |
5719 | if (err) | |
5720 | drop_inode = 1; | |
39279cc3 CM |
5721 | |
5722 | out_unlock: | |
d3c2fdcf | 5723 | nr = trans->blocks_used; |
ab78c84d | 5724 | btrfs_end_transaction_throttle(trans, root); |
1832a6d5 | 5725 | out_fail: |
9ed74f2d | 5726 | btrfs_unreserve_metadata_space(root, 5); |
39279cc3 CM |
5727 | if (drop_inode) { |
5728 | inode_dec_link_count(inode); | |
5729 | iput(inode); | |
5730 | } | |
d3c2fdcf | 5731 | btrfs_btree_balance_dirty(root, nr); |
39279cc3 CM |
5732 | return err; |
5733 | } | |
16432985 | 5734 | |
5a303d5d | 5735 | static int prealloc_file_range(struct inode *inode, u64 start, u64 end, |
920bbbfb | 5736 | u64 alloc_hint, int mode) |
d899e052 | 5737 | { |
5a303d5d | 5738 | struct btrfs_trans_handle *trans; |
d899e052 YZ |
5739 | struct btrfs_root *root = BTRFS_I(inode)->root; |
5740 | struct btrfs_key ins; | |
5741 | u64 alloc_size; | |
5742 | u64 cur_offset = start; | |
5743 | u64 num_bytes = end - start; | |
5744 | int ret = 0; | |
5745 | ||
d899e052 YZ |
5746 | while (num_bytes > 0) { |
5747 | alloc_size = min(num_bytes, root->fs_info->max_extent); | |
9ed74f2d | 5748 | |
d899e052 YZ |
5749 | ret = btrfs_reserve_extent(trans, root, alloc_size, |
5750 | root->sectorsize, 0, alloc_hint, | |
5751 | (u64)-1, &ins, 1); | |
5752 | if (ret) { | |
5753 | WARN_ON(1); | |
5a303d5d YZ |
5754 | break; |
5755 | } | |
5756 | ||
5757 | ret = btrfs_reserve_metadata_space(root, 3); | |
5758 | if (ret) { | |
5759 | btrfs_free_reserved_extent(root, ins.objectid, | |
5760 | ins.offset); | |
5761 | break; | |
d899e052 | 5762 | } |
5a303d5d YZ |
5763 | |
5764 | trans = btrfs_start_transaction(root, 1); | |
5765 | ||
d899e052 YZ |
5766 | ret = insert_reserved_file_extent(trans, inode, |
5767 | cur_offset, ins.objectid, | |
5768 | ins.offset, ins.offset, | |
920bbbfb | 5769 | ins.offset, 0, 0, 0, |
d899e052 YZ |
5770 | BTRFS_FILE_EXTENT_PREALLOC); |
5771 | BUG_ON(ret); | |
a1ed835e CM |
5772 | btrfs_drop_extent_cache(inode, cur_offset, |
5773 | cur_offset + ins.offset -1, 0); | |
5a303d5d | 5774 | |
d899e052 YZ |
5775 | num_bytes -= ins.offset; |
5776 | cur_offset += ins.offset; | |
5777 | alloc_hint = ins.objectid + ins.offset; | |
5a303d5d | 5778 | |
d899e052 | 5779 | inode->i_ctime = CURRENT_TIME; |
6cbff00f | 5780 | BTRFS_I(inode)->flags |= BTRFS_INODE_PREALLOC; |
d899e052 | 5781 | if (!(mode & FALLOC_FL_KEEP_SIZE) && |
5a303d5d YZ |
5782 | cur_offset > inode->i_size) { |
5783 | i_size_write(inode, cur_offset); | |
5784 | btrfs_ordered_update_i_size(inode, cur_offset, NULL); | |
5785 | } | |
5786 | ||
d899e052 YZ |
5787 | ret = btrfs_update_inode(trans, root, inode); |
5788 | BUG_ON(ret); | |
d899e052 | 5789 | |
5a303d5d YZ |
5790 | btrfs_end_transaction(trans, root); |
5791 | btrfs_unreserve_metadata_space(root, 3); | |
5792 | } | |
d899e052 YZ |
5793 | return ret; |
5794 | } | |
5795 | ||
5796 | static long btrfs_fallocate(struct inode *inode, int mode, | |
5797 | loff_t offset, loff_t len) | |
5798 | { | |
5799 | u64 cur_offset; | |
5800 | u64 last_byte; | |
5801 | u64 alloc_start; | |
5802 | u64 alloc_end; | |
5803 | u64 alloc_hint = 0; | |
e980b50c | 5804 | u64 locked_end; |
d899e052 YZ |
5805 | u64 mask = BTRFS_I(inode)->root->sectorsize - 1; |
5806 | struct extent_map *em; | |
5807 | int ret; | |
5808 | ||
5809 | alloc_start = offset & ~mask; | |
5810 | alloc_end = (offset + len + mask) & ~mask; | |
5811 | ||
546888da CM |
5812 | /* |
5813 | * wait for ordered IO before we have any locks. We'll loop again | |
5814 | * below with the locks held. | |
5815 | */ | |
5816 | btrfs_wait_ordered_range(inode, alloc_start, alloc_end - alloc_start); | |
5817 | ||
d899e052 YZ |
5818 | mutex_lock(&inode->i_mutex); |
5819 | if (alloc_start > inode->i_size) { | |
5820 | ret = btrfs_cont_expand(inode, alloc_start); | |
5821 | if (ret) | |
5822 | goto out; | |
5823 | } | |
5824 | ||
5a303d5d | 5825 | ret = btrfs_check_data_free_space(BTRFS_I(inode)->root, inode, |
a970b0a1 JB |
5826 | alloc_end - alloc_start); |
5827 | if (ret) | |
5828 | goto out; | |
5829 | ||
e980b50c | 5830 | locked_end = alloc_end - 1; |
d899e052 YZ |
5831 | while (1) { |
5832 | struct btrfs_ordered_extent *ordered; | |
546888da | 5833 | |
546888da CM |
5834 | /* the extent lock is ordered inside the running |
5835 | * transaction | |
5836 | */ | |
e980b50c CM |
5837 | lock_extent(&BTRFS_I(inode)->io_tree, alloc_start, locked_end, |
5838 | GFP_NOFS); | |
d899e052 YZ |
5839 | ordered = btrfs_lookup_first_ordered_extent(inode, |
5840 | alloc_end - 1); | |
5841 | if (ordered && | |
5842 | ordered->file_offset + ordered->len > alloc_start && | |
5843 | ordered->file_offset < alloc_end) { | |
5844 | btrfs_put_ordered_extent(ordered); | |
5845 | unlock_extent(&BTRFS_I(inode)->io_tree, | |
e980b50c | 5846 | alloc_start, locked_end, GFP_NOFS); |
546888da CM |
5847 | /* |
5848 | * we can't wait on the range with the transaction | |
5849 | * running or with the extent lock held | |
5850 | */ | |
d899e052 YZ |
5851 | btrfs_wait_ordered_range(inode, alloc_start, |
5852 | alloc_end - alloc_start); | |
5853 | } else { | |
5854 | if (ordered) | |
5855 | btrfs_put_ordered_extent(ordered); | |
5856 | break; | |
5857 | } | |
5858 | } | |
5859 | ||
5860 | cur_offset = alloc_start; | |
5861 | while (1) { | |
5862 | em = btrfs_get_extent(inode, NULL, 0, cur_offset, | |
5863 | alloc_end - cur_offset, 0); | |
5864 | BUG_ON(IS_ERR(em) || !em); | |
5865 | last_byte = min(extent_map_end(em), alloc_end); | |
5866 | last_byte = (last_byte + mask) & ~mask; | |
5a303d5d YZ |
5867 | if (em->block_start == EXTENT_MAP_HOLE || |
5868 | (cur_offset >= inode->i_size && | |
5869 | !test_bit(EXTENT_FLAG_PREALLOC, &em->flags))) { | |
5870 | ret = prealloc_file_range(inode, | |
5871 | cur_offset, last_byte, | |
5872 | alloc_hint, mode); | |
d899e052 YZ |
5873 | if (ret < 0) { |
5874 | free_extent_map(em); | |
5875 | break; | |
5876 | } | |
5877 | } | |
5878 | if (em->block_start <= EXTENT_MAP_LAST_BYTE) | |
5879 | alloc_hint = em->block_start; | |
5880 | free_extent_map(em); | |
5881 | ||
5882 | cur_offset = last_byte; | |
5883 | if (cur_offset >= alloc_end) { | |
5884 | ret = 0; | |
5885 | break; | |
5886 | } | |
5887 | } | |
e980b50c | 5888 | unlock_extent(&BTRFS_I(inode)->io_tree, alloc_start, locked_end, |
d899e052 | 5889 | GFP_NOFS); |
546888da | 5890 | |
5a303d5d YZ |
5891 | btrfs_free_reserved_data_space(BTRFS_I(inode)->root, inode, |
5892 | alloc_end - alloc_start); | |
d899e052 YZ |
5893 | out: |
5894 | mutex_unlock(&inode->i_mutex); | |
5895 | return ret; | |
5896 | } | |
5897 | ||
e6dcd2dc CM |
5898 | static int btrfs_set_page_dirty(struct page *page) |
5899 | { | |
e6dcd2dc CM |
5900 | return __set_page_dirty_nobuffers(page); |
5901 | } | |
5902 | ||
0ee0fda0 | 5903 | static int btrfs_permission(struct inode *inode, int mask) |
fdebe2bd | 5904 | { |
6cbff00f | 5905 | if ((BTRFS_I(inode)->flags & BTRFS_INODE_READONLY) && (mask & MAY_WRITE)) |
fdebe2bd | 5906 | return -EACCES; |
33268eaf | 5907 | return generic_permission(inode, mask, btrfs_check_acl); |
fdebe2bd | 5908 | } |
39279cc3 | 5909 | |
6e1d5dcc | 5910 | static const struct inode_operations btrfs_dir_inode_operations = { |
3394e160 | 5911 | .getattr = btrfs_getattr, |
39279cc3 CM |
5912 | .lookup = btrfs_lookup, |
5913 | .create = btrfs_create, | |
5914 | .unlink = btrfs_unlink, | |
5915 | .link = btrfs_link, | |
5916 | .mkdir = btrfs_mkdir, | |
5917 | .rmdir = btrfs_rmdir, | |
5918 | .rename = btrfs_rename, | |
5919 | .symlink = btrfs_symlink, | |
5920 | .setattr = btrfs_setattr, | |
618e21d5 | 5921 | .mknod = btrfs_mknod, |
95819c05 CH |
5922 | .setxattr = btrfs_setxattr, |
5923 | .getxattr = btrfs_getxattr, | |
5103e947 | 5924 | .listxattr = btrfs_listxattr, |
95819c05 | 5925 | .removexattr = btrfs_removexattr, |
fdebe2bd | 5926 | .permission = btrfs_permission, |
39279cc3 | 5927 | }; |
6e1d5dcc | 5928 | static const struct inode_operations btrfs_dir_ro_inode_operations = { |
39279cc3 | 5929 | .lookup = btrfs_lookup, |
fdebe2bd | 5930 | .permission = btrfs_permission, |
39279cc3 | 5931 | }; |
76dda93c | 5932 | |
828c0950 | 5933 | static const struct file_operations btrfs_dir_file_operations = { |
39279cc3 CM |
5934 | .llseek = generic_file_llseek, |
5935 | .read = generic_read_dir, | |
cbdf5a24 | 5936 | .readdir = btrfs_real_readdir, |
34287aa3 | 5937 | .unlocked_ioctl = btrfs_ioctl, |
39279cc3 | 5938 | #ifdef CONFIG_COMPAT |
34287aa3 | 5939 | .compat_ioctl = btrfs_ioctl, |
39279cc3 | 5940 | #endif |
6bf13c0c | 5941 | .release = btrfs_release_file, |
e02119d5 | 5942 | .fsync = btrfs_sync_file, |
39279cc3 CM |
5943 | }; |
5944 | ||
d1310b2e | 5945 | static struct extent_io_ops btrfs_extent_io_ops = { |
07157aac | 5946 | .fill_delalloc = run_delalloc_range, |
065631f6 | 5947 | .submit_bio_hook = btrfs_submit_bio_hook, |
239b14b3 | 5948 | .merge_bio_hook = btrfs_merge_bio_hook, |
07157aac | 5949 | .readpage_end_io_hook = btrfs_readpage_end_io_hook, |
e6dcd2dc | 5950 | .writepage_end_io_hook = btrfs_writepage_end_io_hook, |
247e743c | 5951 | .writepage_start_hook = btrfs_writepage_start_hook, |
1259ab75 | 5952 | .readpage_io_failed_hook = btrfs_io_failed_hook, |
b0c68f8b CM |
5953 | .set_bit_hook = btrfs_set_bit_hook, |
5954 | .clear_bit_hook = btrfs_clear_bit_hook, | |
9ed74f2d JB |
5955 | .merge_extent_hook = btrfs_merge_extent_hook, |
5956 | .split_extent_hook = btrfs_split_extent_hook, | |
07157aac CM |
5957 | }; |
5958 | ||
35054394 CM |
5959 | /* |
5960 | * btrfs doesn't support the bmap operation because swapfiles | |
5961 | * use bmap to make a mapping of extents in the file. They assume | |
5962 | * these extents won't change over the life of the file and they | |
5963 | * use the bmap result to do IO directly to the drive. | |
5964 | * | |
5965 | * the btrfs bmap call would return logical addresses that aren't | |
5966 | * suitable for IO and they also will change frequently as COW | |
5967 | * operations happen. So, swapfile + btrfs == corruption. | |
5968 | * | |
5969 | * For now we're avoiding this by dropping bmap. | |
5970 | */ | |
7f09410b | 5971 | static const struct address_space_operations btrfs_aops = { |
39279cc3 CM |
5972 | .readpage = btrfs_readpage, |
5973 | .writepage = btrfs_writepage, | |
b293f02e | 5974 | .writepages = btrfs_writepages, |
3ab2fb5a | 5975 | .readpages = btrfs_readpages, |
39279cc3 | 5976 | .sync_page = block_sync_page, |
16432985 | 5977 | .direct_IO = btrfs_direct_IO, |
a52d9a80 CM |
5978 | .invalidatepage = btrfs_invalidatepage, |
5979 | .releasepage = btrfs_releasepage, | |
e6dcd2dc | 5980 | .set_page_dirty = btrfs_set_page_dirty, |
465fdd97 | 5981 | .error_remove_page = generic_error_remove_page, |
39279cc3 CM |
5982 | }; |
5983 | ||
7f09410b | 5984 | static const struct address_space_operations btrfs_symlink_aops = { |
39279cc3 CM |
5985 | .readpage = btrfs_readpage, |
5986 | .writepage = btrfs_writepage, | |
2bf5a725 CM |
5987 | .invalidatepage = btrfs_invalidatepage, |
5988 | .releasepage = btrfs_releasepage, | |
39279cc3 CM |
5989 | }; |
5990 | ||
6e1d5dcc | 5991 | static const struct inode_operations btrfs_file_inode_operations = { |
39279cc3 CM |
5992 | .truncate = btrfs_truncate, |
5993 | .getattr = btrfs_getattr, | |
5994 | .setattr = btrfs_setattr, | |
95819c05 CH |
5995 | .setxattr = btrfs_setxattr, |
5996 | .getxattr = btrfs_getxattr, | |
5103e947 | 5997 | .listxattr = btrfs_listxattr, |
95819c05 | 5998 | .removexattr = btrfs_removexattr, |
fdebe2bd | 5999 | .permission = btrfs_permission, |
d899e052 | 6000 | .fallocate = btrfs_fallocate, |
1506fcc8 | 6001 | .fiemap = btrfs_fiemap, |
39279cc3 | 6002 | }; |
6e1d5dcc | 6003 | static const struct inode_operations btrfs_special_inode_operations = { |
618e21d5 JB |
6004 | .getattr = btrfs_getattr, |
6005 | .setattr = btrfs_setattr, | |
fdebe2bd | 6006 | .permission = btrfs_permission, |
95819c05 CH |
6007 | .setxattr = btrfs_setxattr, |
6008 | .getxattr = btrfs_getxattr, | |
33268eaf | 6009 | .listxattr = btrfs_listxattr, |
95819c05 | 6010 | .removexattr = btrfs_removexattr, |
618e21d5 | 6011 | }; |
6e1d5dcc | 6012 | static const struct inode_operations btrfs_symlink_inode_operations = { |
39279cc3 CM |
6013 | .readlink = generic_readlink, |
6014 | .follow_link = page_follow_link_light, | |
6015 | .put_link = page_put_link, | |
fdebe2bd | 6016 | .permission = btrfs_permission, |
0279b4cd JO |
6017 | .setxattr = btrfs_setxattr, |
6018 | .getxattr = btrfs_getxattr, | |
6019 | .listxattr = btrfs_listxattr, | |
6020 | .removexattr = btrfs_removexattr, | |
39279cc3 | 6021 | }; |
76dda93c | 6022 | |
82d339d9 | 6023 | const struct dentry_operations btrfs_dentry_operations = { |
76dda93c YZ |
6024 | .d_delete = btrfs_dentry_delete, |
6025 | }; |