2 * Copyright (C) 2007 Oracle. All rights reserved.
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.
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.
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.
19 #include <linux/kernel.h>
20 #include <linux/bio.h>
21 #include <linux/buffer_head.h>
22 #include <linux/file.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>
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>
35 #include <linux/bit_spinlock.h>
36 #include <linux/xattr.h>
37 #include <linux/posix_acl.h>
38 #include <linux/falloc.h>
39 #include <linux/slab.h>
43 #include "transaction.h"
44 #include "btrfs_inode.h"
46 #include "print-tree.h"
48 #include "ordered-data.h"
51 #include "compression.h"
53 #include "free-space-cache.h"
55 struct btrfs_iget_args {
57 struct btrfs_root *root;
60 static const struct inode_operations btrfs_dir_inode_operations;
61 static const struct inode_operations btrfs_symlink_inode_operations;
62 static const struct inode_operations btrfs_dir_ro_inode_operations;
63 static const struct inode_operations btrfs_special_inode_operations;
64 static const struct inode_operations btrfs_file_inode_operations;
65 static const struct address_space_operations btrfs_aops;
66 static const struct address_space_operations btrfs_symlink_aops;
67 static const struct file_operations btrfs_dir_file_operations;
68 static struct extent_io_ops btrfs_extent_io_ops;
70 static struct kmem_cache *btrfs_inode_cachep;
71 struct kmem_cache *btrfs_trans_handle_cachep;
72 struct kmem_cache *btrfs_transaction_cachep;
73 struct kmem_cache *btrfs_path_cachep;
74 struct kmem_cache *btrfs_free_space_cachep;
77 static unsigned char btrfs_type_by_mode[S_IFMT >> S_SHIFT] = {
78 [S_IFREG >> S_SHIFT] = BTRFS_FT_REG_FILE,
79 [S_IFDIR >> S_SHIFT] = BTRFS_FT_DIR,
80 [S_IFCHR >> S_SHIFT] = BTRFS_FT_CHRDEV,
81 [S_IFBLK >> S_SHIFT] = BTRFS_FT_BLKDEV,
82 [S_IFIFO >> S_SHIFT] = BTRFS_FT_FIFO,
83 [S_IFSOCK >> S_SHIFT] = BTRFS_FT_SOCK,
84 [S_IFLNK >> S_SHIFT] = BTRFS_FT_SYMLINK,
87 static int btrfs_setsize(struct inode *inode, loff_t newsize);
88 static int btrfs_truncate(struct inode *inode);
89 static int btrfs_finish_ordered_io(struct inode *inode, u64 start, u64 end);
90 static noinline int cow_file_range(struct inode *inode,
91 struct page *locked_page,
92 u64 start, u64 end, int *page_started,
93 unsigned long *nr_written, int unlock);
95 static int btrfs_init_inode_security(struct btrfs_trans_handle *trans,
96 struct inode *inode, struct inode *dir)
100 err = btrfs_init_acl(trans, inode, dir);
102 err = btrfs_xattr_security_init(trans, inode, dir);
107 * this does all the hard work for inserting an inline extent into
108 * the btree. The caller should have done a btrfs_drop_extents so that
109 * no overlapping inline items exist in the btree
111 static noinline int insert_inline_extent(struct btrfs_trans_handle *trans,
112 struct btrfs_root *root, struct inode *inode,
113 u64 start, size_t size, size_t compressed_size,
114 struct page **compressed_pages)
116 struct btrfs_key key;
117 struct btrfs_path *path;
118 struct extent_buffer *leaf;
119 struct page *page = NULL;
122 struct btrfs_file_extent_item *ei;
125 size_t cur_size = size;
127 unsigned long offset;
128 int compress_type = BTRFS_COMPRESS_NONE;
130 if (compressed_size && compressed_pages) {
131 compress_type = root->fs_info->compress_type;
132 cur_size = compressed_size;
135 path = btrfs_alloc_path();
139 path->leave_spinning = 1;
140 btrfs_set_trans_block_group(trans, inode);
142 key.objectid = inode->i_ino;
144 btrfs_set_key_type(&key, BTRFS_EXTENT_DATA_KEY);
145 datasize = btrfs_file_extent_calc_inline_size(cur_size);
147 inode_add_bytes(inode, size);
148 ret = btrfs_insert_empty_item(trans, root, path, &key,
155 leaf = path->nodes[0];
156 ei = btrfs_item_ptr(leaf, path->slots[0],
157 struct btrfs_file_extent_item);
158 btrfs_set_file_extent_generation(leaf, ei, trans->transid);
159 btrfs_set_file_extent_type(leaf, ei, BTRFS_FILE_EXTENT_INLINE);
160 btrfs_set_file_extent_encryption(leaf, ei, 0);
161 btrfs_set_file_extent_other_encoding(leaf, ei, 0);
162 btrfs_set_file_extent_ram_bytes(leaf, ei, size);
163 ptr = btrfs_file_extent_inline_start(ei);
165 if (compress_type != BTRFS_COMPRESS_NONE) {
168 while (compressed_size > 0) {
169 cpage = compressed_pages[i];
170 cur_size = min_t(unsigned long, compressed_size,
173 kaddr = kmap_atomic(cpage, KM_USER0);
174 write_extent_buffer(leaf, kaddr, ptr, cur_size);
175 kunmap_atomic(kaddr, KM_USER0);
179 compressed_size -= cur_size;
181 btrfs_set_file_extent_compression(leaf, ei,
184 page = find_get_page(inode->i_mapping,
185 start >> PAGE_CACHE_SHIFT);
186 btrfs_set_file_extent_compression(leaf, ei, 0);
187 kaddr = kmap_atomic(page, KM_USER0);
188 offset = start & (PAGE_CACHE_SIZE - 1);
189 write_extent_buffer(leaf, kaddr + offset, ptr, size);
190 kunmap_atomic(kaddr, KM_USER0);
191 page_cache_release(page);
193 btrfs_mark_buffer_dirty(leaf);
194 btrfs_free_path(path);
197 * we're an inline extent, so nobody can
198 * extend the file past i_size without locking
199 * a page we already have locked.
201 * We must do any isize and inode updates
202 * before we unlock the pages. Otherwise we
203 * could end up racing with unlink.
205 BTRFS_I(inode)->disk_i_size = inode->i_size;
206 btrfs_update_inode(trans, root, inode);
210 btrfs_free_path(path);
216 * conditionally insert an inline extent into the file. This
217 * does the checks required to make sure the data is small enough
218 * to fit as an inline extent.
220 static noinline int cow_file_range_inline(struct btrfs_trans_handle *trans,
221 struct btrfs_root *root,
222 struct inode *inode, u64 start, u64 end,
223 size_t compressed_size,
224 struct page **compressed_pages)
226 u64 isize = i_size_read(inode);
227 u64 actual_end = min(end + 1, isize);
228 u64 inline_len = actual_end - start;
229 u64 aligned_end = (end + root->sectorsize - 1) &
230 ~((u64)root->sectorsize - 1);
232 u64 data_len = inline_len;
236 data_len = compressed_size;
239 actual_end >= PAGE_CACHE_SIZE ||
240 data_len >= BTRFS_MAX_INLINE_DATA_SIZE(root) ||
242 (actual_end & (root->sectorsize - 1)) == 0) ||
244 data_len > root->fs_info->max_inline) {
248 ret = btrfs_drop_extents(trans, inode, start, aligned_end,
252 if (isize > actual_end)
253 inline_len = min_t(u64, isize, actual_end);
254 ret = insert_inline_extent(trans, root, inode, start,
255 inline_len, compressed_size,
258 btrfs_delalloc_release_metadata(inode, end + 1 - start);
259 btrfs_drop_extent_cache(inode, start, aligned_end - 1, 0);
263 struct async_extent {
268 unsigned long nr_pages;
270 struct list_head list;
275 struct btrfs_root *root;
276 struct page *locked_page;
279 struct list_head extents;
280 struct btrfs_work work;
283 static noinline int add_async_extent(struct async_cow *cow,
284 u64 start, u64 ram_size,
287 unsigned long nr_pages,
290 struct async_extent *async_extent;
292 async_extent = kmalloc(sizeof(*async_extent), GFP_NOFS);
293 BUG_ON(!async_extent);
294 async_extent->start = start;
295 async_extent->ram_size = ram_size;
296 async_extent->compressed_size = compressed_size;
297 async_extent->pages = pages;
298 async_extent->nr_pages = nr_pages;
299 async_extent->compress_type = compress_type;
300 list_add_tail(&async_extent->list, &cow->extents);
305 * we create compressed extents in two phases. The first
306 * phase compresses a range of pages that have already been
307 * locked (both pages and state bits are locked).
309 * This is done inside an ordered work queue, and the compression
310 * is spread across many cpus. The actual IO submission is step
311 * two, and the ordered work queue takes care of making sure that
312 * happens in the same order things were put onto the queue by
313 * writepages and friends.
315 * If this code finds it can't get good compression, it puts an
316 * entry onto the work queue to write the uncompressed bytes. This
317 * makes sure that both compressed inodes and uncompressed inodes
318 * are written in the same order that pdflush sent them down.
320 static noinline int compress_file_range(struct inode *inode,
321 struct page *locked_page,
323 struct async_cow *async_cow,
326 struct btrfs_root *root = BTRFS_I(inode)->root;
327 struct btrfs_trans_handle *trans;
329 u64 blocksize = root->sectorsize;
331 u64 isize = i_size_read(inode);
333 struct page **pages = NULL;
334 unsigned long nr_pages;
335 unsigned long nr_pages_ret = 0;
336 unsigned long total_compressed = 0;
337 unsigned long total_in = 0;
338 unsigned long max_compressed = 128 * 1024;
339 unsigned long max_uncompressed = 128 * 1024;
342 int compress_type = root->fs_info->compress_type;
344 actual_end = min_t(u64, isize, end + 1);
347 nr_pages = (end >> PAGE_CACHE_SHIFT) - (start >> PAGE_CACHE_SHIFT) + 1;
348 nr_pages = min(nr_pages, (128 * 1024UL) / PAGE_CACHE_SIZE);
351 * we don't want to send crud past the end of i_size through
352 * compression, that's just a waste of CPU time. So, if the
353 * end of the file is before the start of our current
354 * requested range of bytes, we bail out to the uncompressed
355 * cleanup code that can deal with all of this.
357 * It isn't really the fastest way to fix things, but this is a
358 * very uncommon corner.
360 if (actual_end <= start)
361 goto cleanup_and_bail_uncompressed;
363 total_compressed = actual_end - start;
365 /* we want to make sure that amount of ram required to uncompress
366 * an extent is reasonable, so we limit the total size in ram
367 * of a compressed extent to 128k. This is a crucial number
368 * because it also controls how easily we can spread reads across
369 * cpus for decompression.
371 * We also want to make sure the amount of IO required to do
372 * a random read is reasonably small, so we limit the size of
373 * a compressed extent to 128k.
375 total_compressed = min(total_compressed, max_uncompressed);
376 num_bytes = (end - start + blocksize) & ~(blocksize - 1);
377 num_bytes = max(blocksize, num_bytes);
382 * we do compression for mount -o compress and when the
383 * inode has not been flagged as nocompress. This flag can
384 * change at any time if we discover bad compression ratios.
386 if (!(BTRFS_I(inode)->flags & BTRFS_INODE_NOCOMPRESS) &&
387 (btrfs_test_opt(root, COMPRESS) ||
388 (BTRFS_I(inode)->force_compress) ||
389 (BTRFS_I(inode)->flags & BTRFS_INODE_COMPRESS))) {
391 pages = kzalloc(sizeof(struct page *) * nr_pages, GFP_NOFS);
394 if (BTRFS_I(inode)->force_compress)
395 compress_type = BTRFS_I(inode)->force_compress;
397 ret = btrfs_compress_pages(compress_type,
398 inode->i_mapping, start,
399 total_compressed, pages,
400 nr_pages, &nr_pages_ret,
406 unsigned long offset = total_compressed &
407 (PAGE_CACHE_SIZE - 1);
408 struct page *page = pages[nr_pages_ret - 1];
411 /* zero the tail end of the last page, we might be
412 * sending it down to disk
415 kaddr = kmap_atomic(page, KM_USER0);
416 memset(kaddr + offset, 0,
417 PAGE_CACHE_SIZE - offset);
418 kunmap_atomic(kaddr, KM_USER0);
424 trans = btrfs_join_transaction(root, 1);
425 BUG_ON(IS_ERR(trans));
426 btrfs_set_trans_block_group(trans, inode);
427 trans->block_rsv = &root->fs_info->delalloc_block_rsv;
429 /* lets try to make an inline extent */
430 if (ret || total_in < (actual_end - start)) {
431 /* we didn't compress the entire range, try
432 * to make an uncompressed inline extent.
434 ret = cow_file_range_inline(trans, root, inode,
435 start, end, 0, NULL);
437 /* try making a compressed inline extent */
438 ret = cow_file_range_inline(trans, root, inode,
440 total_compressed, pages);
444 * inline extent creation worked, we don't need
445 * to create any more async work items. Unlock
446 * and free up our temp pages.
448 extent_clear_unlock_delalloc(inode,
449 &BTRFS_I(inode)->io_tree,
451 EXTENT_CLEAR_UNLOCK_PAGE | EXTENT_CLEAR_DIRTY |
452 EXTENT_CLEAR_DELALLOC |
453 EXTENT_SET_WRITEBACK | EXTENT_END_WRITEBACK);
455 btrfs_end_transaction(trans, root);
458 btrfs_end_transaction(trans, root);
463 * we aren't doing an inline extent round the compressed size
464 * up to a block size boundary so the allocator does sane
467 total_compressed = (total_compressed + blocksize - 1) &
471 * one last check to make sure the compression is really a
472 * win, compare the page count read with the blocks on disk
474 total_in = (total_in + PAGE_CACHE_SIZE - 1) &
475 ~(PAGE_CACHE_SIZE - 1);
476 if (total_compressed >= total_in) {
479 num_bytes = total_in;
482 if (!will_compress && pages) {
484 * the compression code ran but failed to make things smaller,
485 * free any pages it allocated and our page pointer array
487 for (i = 0; i < nr_pages_ret; i++) {
488 WARN_ON(pages[i]->mapping);
489 page_cache_release(pages[i]);
493 total_compressed = 0;
496 /* flag the file so we don't compress in the future */
497 if (!btrfs_test_opt(root, FORCE_COMPRESS) &&
498 !(BTRFS_I(inode)->force_compress)) {
499 BTRFS_I(inode)->flags |= BTRFS_INODE_NOCOMPRESS;
505 /* the async work queues will take care of doing actual
506 * allocation on disk for these compressed pages,
507 * and will submit them to the elevator.
509 add_async_extent(async_cow, start, num_bytes,
510 total_compressed, pages, nr_pages_ret,
513 if (start + num_bytes < end) {
520 cleanup_and_bail_uncompressed:
522 * No compression, but we still need to write the pages in
523 * the file we've been given so far. redirty the locked
524 * page if it corresponds to our extent and set things up
525 * for the async work queue to run cow_file_range to do
526 * the normal delalloc dance
528 if (page_offset(locked_page) >= start &&
529 page_offset(locked_page) <= end) {
530 __set_page_dirty_nobuffers(locked_page);
531 /* unlocked later on in the async handlers */
533 add_async_extent(async_cow, start, end - start + 1,
534 0, NULL, 0, BTRFS_COMPRESS_NONE);
542 for (i = 0; i < nr_pages_ret; i++) {
543 WARN_ON(pages[i]->mapping);
544 page_cache_release(pages[i]);
552 * phase two of compressed writeback. This is the ordered portion
553 * of the code, which only gets called in the order the work was
554 * queued. We walk all the async extents created by compress_file_range
555 * and send them down to the disk.
557 static noinline int submit_compressed_extents(struct inode *inode,
558 struct async_cow *async_cow)
560 struct async_extent *async_extent;
562 struct btrfs_trans_handle *trans;
563 struct btrfs_key ins;
564 struct extent_map *em;
565 struct btrfs_root *root = BTRFS_I(inode)->root;
566 struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree;
567 struct extent_io_tree *io_tree;
570 if (list_empty(&async_cow->extents))
574 while (!list_empty(&async_cow->extents)) {
575 async_extent = list_entry(async_cow->extents.next,
576 struct async_extent, list);
577 list_del(&async_extent->list);
579 io_tree = &BTRFS_I(inode)->io_tree;
582 /* did the compression code fall back to uncompressed IO? */
583 if (!async_extent->pages) {
584 int page_started = 0;
585 unsigned long nr_written = 0;
587 lock_extent(io_tree, async_extent->start,
588 async_extent->start +
589 async_extent->ram_size - 1, GFP_NOFS);
591 /* allocate blocks */
592 ret = cow_file_range(inode, async_cow->locked_page,
594 async_extent->start +
595 async_extent->ram_size - 1,
596 &page_started, &nr_written, 0);
599 * if page_started, cow_file_range inserted an
600 * inline extent and took care of all the unlocking
601 * and IO for us. Otherwise, we need to submit
602 * all those pages down to the drive.
604 if (!page_started && !ret)
605 extent_write_locked_range(io_tree,
606 inode, async_extent->start,
607 async_extent->start +
608 async_extent->ram_size - 1,
616 lock_extent(io_tree, async_extent->start,
617 async_extent->start + async_extent->ram_size - 1,
620 trans = btrfs_join_transaction(root, 1);
621 BUG_ON(IS_ERR(trans));
622 ret = btrfs_reserve_extent(trans, root,
623 async_extent->compressed_size,
624 async_extent->compressed_size,
627 btrfs_end_transaction(trans, root);
631 for (i = 0; i < async_extent->nr_pages; i++) {
632 WARN_ON(async_extent->pages[i]->mapping);
633 page_cache_release(async_extent->pages[i]);
635 kfree(async_extent->pages);
636 async_extent->nr_pages = 0;
637 async_extent->pages = NULL;
638 unlock_extent(io_tree, async_extent->start,
639 async_extent->start +
640 async_extent->ram_size - 1, GFP_NOFS);
645 * here we're doing allocation and writeback of the
648 btrfs_drop_extent_cache(inode, async_extent->start,
649 async_extent->start +
650 async_extent->ram_size - 1, 0);
652 em = alloc_extent_map(GFP_NOFS);
654 em->start = async_extent->start;
655 em->len = async_extent->ram_size;
656 em->orig_start = em->start;
658 em->block_start = ins.objectid;
659 em->block_len = ins.offset;
660 em->bdev = root->fs_info->fs_devices->latest_bdev;
661 em->compress_type = async_extent->compress_type;
662 set_bit(EXTENT_FLAG_PINNED, &em->flags);
663 set_bit(EXTENT_FLAG_COMPRESSED, &em->flags);
666 write_lock(&em_tree->lock);
667 ret = add_extent_mapping(em_tree, em);
668 write_unlock(&em_tree->lock);
669 if (ret != -EEXIST) {
673 btrfs_drop_extent_cache(inode, async_extent->start,
674 async_extent->start +
675 async_extent->ram_size - 1, 0);
678 ret = btrfs_add_ordered_extent_compress(inode,
681 async_extent->ram_size,
683 BTRFS_ORDERED_COMPRESSED,
684 async_extent->compress_type);
688 * clear dirty, set writeback and unlock the pages.
690 extent_clear_unlock_delalloc(inode,
691 &BTRFS_I(inode)->io_tree,
693 async_extent->start +
694 async_extent->ram_size - 1,
695 NULL, EXTENT_CLEAR_UNLOCK_PAGE |
696 EXTENT_CLEAR_UNLOCK |
697 EXTENT_CLEAR_DELALLOC |
698 EXTENT_CLEAR_DIRTY | EXTENT_SET_WRITEBACK);
700 ret = btrfs_submit_compressed_write(inode,
702 async_extent->ram_size,
704 ins.offset, async_extent->pages,
705 async_extent->nr_pages);
708 alloc_hint = ins.objectid + ins.offset;
716 static u64 get_extent_allocation_hint(struct inode *inode, u64 start,
719 struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree;
720 struct extent_map *em;
723 read_lock(&em_tree->lock);
724 em = search_extent_mapping(em_tree, start, num_bytes);
727 * if block start isn't an actual block number then find the
728 * first block in this inode and use that as a hint. If that
729 * block is also bogus then just don't worry about it.
731 if (em->block_start >= EXTENT_MAP_LAST_BYTE) {
733 em = search_extent_mapping(em_tree, 0, 0);
734 if (em && em->block_start < EXTENT_MAP_LAST_BYTE)
735 alloc_hint = em->block_start;
739 alloc_hint = em->block_start;
743 read_unlock(&em_tree->lock);
749 * when extent_io.c finds a delayed allocation range in the file,
750 * the call backs end up in this code. The basic idea is to
751 * allocate extents on disk for the range, and create ordered data structs
752 * in ram to track those extents.
754 * locked_page is the page that writepage had locked already. We use
755 * it to make sure we don't do extra locks or unlocks.
757 * *page_started is set to one if we unlock locked_page and do everything
758 * required to start IO on it. It may be clean and already done with
761 static noinline int cow_file_range(struct inode *inode,
762 struct page *locked_page,
763 u64 start, u64 end, int *page_started,
764 unsigned long *nr_written,
767 struct btrfs_root *root = BTRFS_I(inode)->root;
768 struct btrfs_trans_handle *trans;
771 unsigned long ram_size;
774 u64 blocksize = root->sectorsize;
775 struct btrfs_key ins;
776 struct extent_map *em;
777 struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree;
780 BUG_ON(root == root->fs_info->tree_root);
781 trans = btrfs_join_transaction(root, 1);
782 BUG_ON(IS_ERR(trans));
783 btrfs_set_trans_block_group(trans, inode);
784 trans->block_rsv = &root->fs_info->delalloc_block_rsv;
786 num_bytes = (end - start + blocksize) & ~(blocksize - 1);
787 num_bytes = max(blocksize, num_bytes);
788 disk_num_bytes = num_bytes;
792 /* lets try to make an inline extent */
793 ret = cow_file_range_inline(trans, root, inode,
794 start, end, 0, NULL);
796 extent_clear_unlock_delalloc(inode,
797 &BTRFS_I(inode)->io_tree,
799 EXTENT_CLEAR_UNLOCK_PAGE |
800 EXTENT_CLEAR_UNLOCK |
801 EXTENT_CLEAR_DELALLOC |
803 EXTENT_SET_WRITEBACK |
804 EXTENT_END_WRITEBACK);
806 *nr_written = *nr_written +
807 (end - start + PAGE_CACHE_SIZE) / PAGE_CACHE_SIZE;
814 BUG_ON(disk_num_bytes >
815 btrfs_super_total_bytes(&root->fs_info->super_copy));
817 alloc_hint = get_extent_allocation_hint(inode, start, num_bytes);
818 btrfs_drop_extent_cache(inode, start, start + num_bytes - 1, 0);
820 while (disk_num_bytes > 0) {
823 cur_alloc_size = disk_num_bytes;
824 ret = btrfs_reserve_extent(trans, root, cur_alloc_size,
825 root->sectorsize, 0, alloc_hint,
829 em = alloc_extent_map(GFP_NOFS);
832 em->orig_start = em->start;
833 ram_size = ins.offset;
834 em->len = ins.offset;
836 em->block_start = ins.objectid;
837 em->block_len = ins.offset;
838 em->bdev = root->fs_info->fs_devices->latest_bdev;
839 set_bit(EXTENT_FLAG_PINNED, &em->flags);
842 write_lock(&em_tree->lock);
843 ret = add_extent_mapping(em_tree, em);
844 write_unlock(&em_tree->lock);
845 if (ret != -EEXIST) {
849 btrfs_drop_extent_cache(inode, start,
850 start + ram_size - 1, 0);
853 cur_alloc_size = ins.offset;
854 ret = btrfs_add_ordered_extent(inode, start, ins.objectid,
855 ram_size, cur_alloc_size, 0);
858 if (root->root_key.objectid ==
859 BTRFS_DATA_RELOC_TREE_OBJECTID) {
860 ret = btrfs_reloc_clone_csums(inode, start,
865 if (disk_num_bytes < cur_alloc_size)
868 /* we're not doing compressed IO, don't unlock the first
869 * page (which the caller expects to stay locked), don't
870 * clear any dirty bits and don't set any writeback bits
872 * Do set the Private2 bit so we know this page was properly
873 * setup for writepage
875 op = unlock ? EXTENT_CLEAR_UNLOCK_PAGE : 0;
876 op |= EXTENT_CLEAR_UNLOCK | EXTENT_CLEAR_DELALLOC |
879 extent_clear_unlock_delalloc(inode, &BTRFS_I(inode)->io_tree,
880 start, start + ram_size - 1,
882 disk_num_bytes -= cur_alloc_size;
883 num_bytes -= cur_alloc_size;
884 alloc_hint = ins.objectid + ins.offset;
885 start += cur_alloc_size;
889 btrfs_end_transaction(trans, root);
895 * work queue call back to started compression on a file and pages
897 static noinline void async_cow_start(struct btrfs_work *work)
899 struct async_cow *async_cow;
901 async_cow = container_of(work, struct async_cow, work);
903 compress_file_range(async_cow->inode, async_cow->locked_page,
904 async_cow->start, async_cow->end, async_cow,
907 async_cow->inode = NULL;
911 * work queue call back to submit previously compressed pages
913 static noinline void async_cow_submit(struct btrfs_work *work)
915 struct async_cow *async_cow;
916 struct btrfs_root *root;
917 unsigned long nr_pages;
919 async_cow = container_of(work, struct async_cow, work);
921 root = async_cow->root;
922 nr_pages = (async_cow->end - async_cow->start + PAGE_CACHE_SIZE) >>
925 atomic_sub(nr_pages, &root->fs_info->async_delalloc_pages);
927 if (atomic_read(&root->fs_info->async_delalloc_pages) <
929 waitqueue_active(&root->fs_info->async_submit_wait))
930 wake_up(&root->fs_info->async_submit_wait);
932 if (async_cow->inode)
933 submit_compressed_extents(async_cow->inode, async_cow);
936 static noinline void async_cow_free(struct btrfs_work *work)
938 struct async_cow *async_cow;
939 async_cow = container_of(work, struct async_cow, work);
943 static int cow_file_range_async(struct inode *inode, struct page *locked_page,
944 u64 start, u64 end, int *page_started,
945 unsigned long *nr_written)
947 struct async_cow *async_cow;
948 struct btrfs_root *root = BTRFS_I(inode)->root;
949 unsigned long nr_pages;
951 int limit = 10 * 1024 * 1042;
953 clear_extent_bit(&BTRFS_I(inode)->io_tree, start, end, EXTENT_LOCKED,
954 1, 0, NULL, GFP_NOFS);
955 while (start < end) {
956 async_cow = kmalloc(sizeof(*async_cow), GFP_NOFS);
957 async_cow->inode = inode;
958 async_cow->root = root;
959 async_cow->locked_page = locked_page;
960 async_cow->start = start;
962 if (BTRFS_I(inode)->flags & BTRFS_INODE_NOCOMPRESS)
965 cur_end = min(end, start + 512 * 1024 - 1);
967 async_cow->end = cur_end;
968 INIT_LIST_HEAD(&async_cow->extents);
970 async_cow->work.func = async_cow_start;
971 async_cow->work.ordered_func = async_cow_submit;
972 async_cow->work.ordered_free = async_cow_free;
973 async_cow->work.flags = 0;
975 nr_pages = (cur_end - start + PAGE_CACHE_SIZE) >>
977 atomic_add(nr_pages, &root->fs_info->async_delalloc_pages);
979 btrfs_queue_worker(&root->fs_info->delalloc_workers,
982 if (atomic_read(&root->fs_info->async_delalloc_pages) > limit) {
983 wait_event(root->fs_info->async_submit_wait,
984 (atomic_read(&root->fs_info->async_delalloc_pages) <
988 while (atomic_read(&root->fs_info->async_submit_draining) &&
989 atomic_read(&root->fs_info->async_delalloc_pages)) {
990 wait_event(root->fs_info->async_submit_wait,
991 (atomic_read(&root->fs_info->async_delalloc_pages) ==
995 *nr_written += nr_pages;
1002 static noinline int csum_exist_in_range(struct btrfs_root *root,
1003 u64 bytenr, u64 num_bytes)
1006 struct btrfs_ordered_sum *sums;
1009 ret = btrfs_lookup_csums_range(root->fs_info->csum_root, bytenr,
1010 bytenr + num_bytes - 1, &list);
1011 if (ret == 0 && list_empty(&list))
1014 while (!list_empty(&list)) {
1015 sums = list_entry(list.next, struct btrfs_ordered_sum, list);
1016 list_del(&sums->list);
1023 * when nowcow writeback call back. This checks for snapshots or COW copies
1024 * of the extents that exist in the file, and COWs the file as required.
1026 * If no cow copies or snapshots exist, we write directly to the existing
1029 static noinline int run_delalloc_nocow(struct inode *inode,
1030 struct page *locked_page,
1031 u64 start, u64 end, int *page_started, int force,
1032 unsigned long *nr_written)
1034 struct btrfs_root *root = BTRFS_I(inode)->root;
1035 struct btrfs_trans_handle *trans;
1036 struct extent_buffer *leaf;
1037 struct btrfs_path *path;
1038 struct btrfs_file_extent_item *fi;
1039 struct btrfs_key found_key;
1051 bool nolock = false;
1053 path = btrfs_alloc_path();
1055 if (root == root->fs_info->tree_root) {
1057 trans = btrfs_join_transaction_nolock(root, 1);
1059 trans = btrfs_join_transaction(root, 1);
1061 BUG_ON(IS_ERR(trans));
1063 cow_start = (u64)-1;
1066 ret = btrfs_lookup_file_extent(trans, root, path, inode->i_ino,
1069 if (ret > 0 && path->slots[0] > 0 && check_prev) {
1070 leaf = path->nodes[0];
1071 btrfs_item_key_to_cpu(leaf, &found_key,
1072 path->slots[0] - 1);
1073 if (found_key.objectid == inode->i_ino &&
1074 found_key.type == BTRFS_EXTENT_DATA_KEY)
1079 leaf = path->nodes[0];
1080 if (path->slots[0] >= btrfs_header_nritems(leaf)) {
1081 ret = btrfs_next_leaf(root, path);
1086 leaf = path->nodes[0];
1092 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
1094 if (found_key.objectid > inode->i_ino ||
1095 found_key.type > BTRFS_EXTENT_DATA_KEY ||
1096 found_key.offset > end)
1099 if (found_key.offset > cur_offset) {
1100 extent_end = found_key.offset;
1105 fi = btrfs_item_ptr(leaf, path->slots[0],
1106 struct btrfs_file_extent_item);
1107 extent_type = btrfs_file_extent_type(leaf, fi);
1109 if (extent_type == BTRFS_FILE_EXTENT_REG ||
1110 extent_type == BTRFS_FILE_EXTENT_PREALLOC) {
1111 disk_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi);
1112 extent_offset = btrfs_file_extent_offset(leaf, fi);
1113 extent_end = found_key.offset +
1114 btrfs_file_extent_num_bytes(leaf, fi);
1115 if (extent_end <= start) {
1119 if (disk_bytenr == 0)
1121 if (btrfs_file_extent_compression(leaf, fi) ||
1122 btrfs_file_extent_encryption(leaf, fi) ||
1123 btrfs_file_extent_other_encoding(leaf, fi))
1125 if (extent_type == BTRFS_FILE_EXTENT_REG && !force)
1127 if (btrfs_extent_readonly(root, disk_bytenr))
1129 if (btrfs_cross_ref_exist(trans, root, inode->i_ino,
1131 extent_offset, disk_bytenr))
1133 disk_bytenr += extent_offset;
1134 disk_bytenr += cur_offset - found_key.offset;
1135 num_bytes = min(end + 1, extent_end) - cur_offset;
1137 * force cow if csum exists in the range.
1138 * this ensure that csum for a given extent are
1139 * either valid or do not exist.
1141 if (csum_exist_in_range(root, disk_bytenr, num_bytes))
1144 } else if (extent_type == BTRFS_FILE_EXTENT_INLINE) {
1145 extent_end = found_key.offset +
1146 btrfs_file_extent_inline_len(leaf, fi);
1147 extent_end = ALIGN(extent_end, root->sectorsize);
1152 if (extent_end <= start) {
1157 if (cow_start == (u64)-1)
1158 cow_start = cur_offset;
1159 cur_offset = extent_end;
1160 if (cur_offset > end)
1166 btrfs_release_path(root, path);
1167 if (cow_start != (u64)-1) {
1168 ret = cow_file_range(inode, locked_page, cow_start,
1169 found_key.offset - 1, page_started,
1172 cow_start = (u64)-1;
1175 if (extent_type == BTRFS_FILE_EXTENT_PREALLOC) {
1176 struct extent_map *em;
1177 struct extent_map_tree *em_tree;
1178 em_tree = &BTRFS_I(inode)->extent_tree;
1179 em = alloc_extent_map(GFP_NOFS);
1181 em->start = cur_offset;
1182 em->orig_start = em->start;
1183 em->len = num_bytes;
1184 em->block_len = num_bytes;
1185 em->block_start = disk_bytenr;
1186 em->bdev = root->fs_info->fs_devices->latest_bdev;
1187 set_bit(EXTENT_FLAG_PINNED, &em->flags);
1189 write_lock(&em_tree->lock);
1190 ret = add_extent_mapping(em_tree, em);
1191 write_unlock(&em_tree->lock);
1192 if (ret != -EEXIST) {
1193 free_extent_map(em);
1196 btrfs_drop_extent_cache(inode, em->start,
1197 em->start + em->len - 1, 0);
1199 type = BTRFS_ORDERED_PREALLOC;
1201 type = BTRFS_ORDERED_NOCOW;
1204 ret = btrfs_add_ordered_extent(inode, cur_offset, disk_bytenr,
1205 num_bytes, num_bytes, type);
1208 if (root->root_key.objectid ==
1209 BTRFS_DATA_RELOC_TREE_OBJECTID) {
1210 ret = btrfs_reloc_clone_csums(inode, cur_offset,
1215 extent_clear_unlock_delalloc(inode, &BTRFS_I(inode)->io_tree,
1216 cur_offset, cur_offset + num_bytes - 1,
1217 locked_page, EXTENT_CLEAR_UNLOCK_PAGE |
1218 EXTENT_CLEAR_UNLOCK | EXTENT_CLEAR_DELALLOC |
1219 EXTENT_SET_PRIVATE2);
1220 cur_offset = extent_end;
1221 if (cur_offset > end)
1224 btrfs_release_path(root, path);
1226 if (cur_offset <= end && cow_start == (u64)-1)
1227 cow_start = cur_offset;
1228 if (cow_start != (u64)-1) {
1229 ret = cow_file_range(inode, locked_page, cow_start, end,
1230 page_started, nr_written, 1);
1235 ret = btrfs_end_transaction_nolock(trans, root);
1238 ret = btrfs_end_transaction(trans, root);
1241 btrfs_free_path(path);
1246 * extent_io.c call back to do delayed allocation processing
1248 static int run_delalloc_range(struct inode *inode, struct page *locked_page,
1249 u64 start, u64 end, int *page_started,
1250 unsigned long *nr_written)
1253 struct btrfs_root *root = BTRFS_I(inode)->root;
1255 if (BTRFS_I(inode)->flags & BTRFS_INODE_NODATACOW)
1256 ret = run_delalloc_nocow(inode, locked_page, start, end,
1257 page_started, 1, nr_written);
1258 else if (BTRFS_I(inode)->flags & BTRFS_INODE_PREALLOC)
1259 ret = run_delalloc_nocow(inode, locked_page, start, end,
1260 page_started, 0, nr_written);
1261 else if (!btrfs_test_opt(root, COMPRESS) &&
1262 !(BTRFS_I(inode)->force_compress) &&
1263 !(BTRFS_I(inode)->flags & BTRFS_INODE_COMPRESS))
1264 ret = cow_file_range(inode, locked_page, start, end,
1265 page_started, nr_written, 1);
1267 ret = cow_file_range_async(inode, locked_page, start, end,
1268 page_started, nr_written);
1272 static int btrfs_split_extent_hook(struct inode *inode,
1273 struct extent_state *orig, u64 split)
1275 /* not delalloc, ignore it */
1276 if (!(orig->state & EXTENT_DELALLOC))
1279 atomic_inc(&BTRFS_I(inode)->outstanding_extents);
1284 * extent_io.c merge_extent_hook, used to track merged delayed allocation
1285 * extents so we can keep track of new extents that are just merged onto old
1286 * extents, such as when we are doing sequential writes, so we can properly
1287 * account for the metadata space we'll need.
1289 static int btrfs_merge_extent_hook(struct inode *inode,
1290 struct extent_state *new,
1291 struct extent_state *other)
1293 /* not delalloc, ignore it */
1294 if (!(other->state & EXTENT_DELALLOC))
1297 atomic_dec(&BTRFS_I(inode)->outstanding_extents);
1302 * extent_io.c set_bit_hook, used to track delayed allocation
1303 * bytes in this file, and to maintain the list of inodes that
1304 * have pending delalloc work to be done.
1306 static int btrfs_set_bit_hook(struct inode *inode,
1307 struct extent_state *state, int *bits)
1311 * set_bit and clear bit hooks normally require _irqsave/restore
1312 * but in this case, we are only testeing for the DELALLOC
1313 * bit, which is only set or cleared with irqs on
1315 if (!(state->state & EXTENT_DELALLOC) && (*bits & EXTENT_DELALLOC)) {
1316 struct btrfs_root *root = BTRFS_I(inode)->root;
1317 u64 len = state->end + 1 - state->start;
1318 int do_list = (root->root_key.objectid !=
1319 BTRFS_ROOT_TREE_OBJECTID);
1321 if (*bits & EXTENT_FIRST_DELALLOC)
1322 *bits &= ~EXTENT_FIRST_DELALLOC;
1324 atomic_inc(&BTRFS_I(inode)->outstanding_extents);
1326 spin_lock(&root->fs_info->delalloc_lock);
1327 BTRFS_I(inode)->delalloc_bytes += len;
1328 root->fs_info->delalloc_bytes += len;
1329 if (do_list && list_empty(&BTRFS_I(inode)->delalloc_inodes)) {
1330 list_add_tail(&BTRFS_I(inode)->delalloc_inodes,
1331 &root->fs_info->delalloc_inodes);
1333 spin_unlock(&root->fs_info->delalloc_lock);
1339 * extent_io.c clear_bit_hook, see set_bit_hook for why
1341 static int btrfs_clear_bit_hook(struct inode *inode,
1342 struct extent_state *state, int *bits)
1345 * set_bit and clear bit hooks normally require _irqsave/restore
1346 * but in this case, we are only testeing for the DELALLOC
1347 * bit, which is only set or cleared with irqs on
1349 if ((state->state & EXTENT_DELALLOC) && (*bits & EXTENT_DELALLOC)) {
1350 struct btrfs_root *root = BTRFS_I(inode)->root;
1351 u64 len = state->end + 1 - state->start;
1352 int do_list = (root->root_key.objectid !=
1353 BTRFS_ROOT_TREE_OBJECTID);
1355 if (*bits & EXTENT_FIRST_DELALLOC)
1356 *bits &= ~EXTENT_FIRST_DELALLOC;
1357 else if (!(*bits & EXTENT_DO_ACCOUNTING))
1358 atomic_dec(&BTRFS_I(inode)->outstanding_extents);
1360 if (*bits & EXTENT_DO_ACCOUNTING)
1361 btrfs_delalloc_release_metadata(inode, len);
1363 if (root->root_key.objectid != BTRFS_DATA_RELOC_TREE_OBJECTID
1365 btrfs_free_reserved_data_space(inode, len);
1367 spin_lock(&root->fs_info->delalloc_lock);
1368 root->fs_info->delalloc_bytes -= len;
1369 BTRFS_I(inode)->delalloc_bytes -= len;
1371 if (do_list && BTRFS_I(inode)->delalloc_bytes == 0 &&
1372 !list_empty(&BTRFS_I(inode)->delalloc_inodes)) {
1373 list_del_init(&BTRFS_I(inode)->delalloc_inodes);
1375 spin_unlock(&root->fs_info->delalloc_lock);
1381 * extent_io.c merge_bio_hook, this must check the chunk tree to make sure
1382 * we don't create bios that span stripes or chunks
1384 int btrfs_merge_bio_hook(struct page *page, unsigned long offset,
1385 size_t size, struct bio *bio,
1386 unsigned long bio_flags)
1388 struct btrfs_root *root = BTRFS_I(page->mapping->host)->root;
1389 struct btrfs_mapping_tree *map_tree;
1390 u64 logical = (u64)bio->bi_sector << 9;
1395 if (bio_flags & EXTENT_BIO_COMPRESSED)
1398 length = bio->bi_size;
1399 map_tree = &root->fs_info->mapping_tree;
1400 map_length = length;
1401 ret = btrfs_map_block(map_tree, READ, logical,
1402 &map_length, NULL, 0);
1404 if (map_length < length + size)
1410 * in order to insert checksums into the metadata in large chunks,
1411 * we wait until bio submission time. All the pages in the bio are
1412 * checksummed and sums are attached onto the ordered extent record.
1414 * At IO completion time the cums attached on the ordered extent record
1415 * are inserted into the btree
1417 static int __btrfs_submit_bio_start(struct inode *inode, int rw,
1418 struct bio *bio, int mirror_num,
1419 unsigned long bio_flags,
1422 struct btrfs_root *root = BTRFS_I(inode)->root;
1425 ret = btrfs_csum_one_bio(root, inode, bio, 0, 0);
1431 * in order to insert checksums into the metadata in large chunks,
1432 * we wait until bio submission time. All the pages in the bio are
1433 * checksummed and sums are attached onto the ordered extent record.
1435 * At IO completion time the cums attached on the ordered extent record
1436 * are inserted into the btree
1438 static int __btrfs_submit_bio_done(struct inode *inode, int rw, struct bio *bio,
1439 int mirror_num, unsigned long bio_flags,
1442 struct btrfs_root *root = BTRFS_I(inode)->root;
1443 return btrfs_map_bio(root, rw, bio, mirror_num, 1);
1447 * extent_io.c submission hook. This does the right thing for csum calculation
1448 * on write, or reading the csums from the tree before a read
1450 static int btrfs_submit_bio_hook(struct inode *inode, int rw, struct bio *bio,
1451 int mirror_num, unsigned long bio_flags,
1454 struct btrfs_root *root = BTRFS_I(inode)->root;
1458 skip_sum = BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM;
1460 if (root == root->fs_info->tree_root)
1461 ret = btrfs_bio_wq_end_io(root->fs_info, bio, 2);
1463 ret = btrfs_bio_wq_end_io(root->fs_info, bio, 0);
1466 if (!(rw & REQ_WRITE)) {
1467 if (bio_flags & EXTENT_BIO_COMPRESSED) {
1468 return btrfs_submit_compressed_read(inode, bio,
1469 mirror_num, bio_flags);
1470 } else if (!skip_sum) {
1471 ret = btrfs_lookup_bio_sums(root, inode, bio, NULL);
1476 } else if (!skip_sum) {
1477 /* csum items have already been cloned */
1478 if (root->root_key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID)
1480 /* we're doing a write, do the async checksumming */
1481 return btrfs_wq_submit_bio(BTRFS_I(inode)->root->fs_info,
1482 inode, rw, bio, mirror_num,
1483 bio_flags, bio_offset,
1484 __btrfs_submit_bio_start,
1485 __btrfs_submit_bio_done);
1489 return btrfs_map_bio(root, rw, bio, mirror_num, 0);
1493 * given a list of ordered sums record them in the inode. This happens
1494 * at IO completion time based on sums calculated at bio submission time.
1496 static noinline int add_pending_csums(struct btrfs_trans_handle *trans,
1497 struct inode *inode, u64 file_offset,
1498 struct list_head *list)
1500 struct btrfs_ordered_sum *sum;
1502 btrfs_set_trans_block_group(trans, inode);
1504 list_for_each_entry(sum, list, list) {
1505 btrfs_csum_file_blocks(trans,
1506 BTRFS_I(inode)->root->fs_info->csum_root, sum);
1511 int btrfs_set_extent_delalloc(struct inode *inode, u64 start, u64 end,
1512 struct extent_state **cached_state)
1514 if ((end & (PAGE_CACHE_SIZE - 1)) == 0)
1516 return set_extent_delalloc(&BTRFS_I(inode)->io_tree, start, end,
1517 cached_state, GFP_NOFS);
1520 /* see btrfs_writepage_start_hook for details on why this is required */
1521 struct btrfs_writepage_fixup {
1523 struct btrfs_work work;
1526 static void btrfs_writepage_fixup_worker(struct btrfs_work *work)
1528 struct btrfs_writepage_fixup *fixup;
1529 struct btrfs_ordered_extent *ordered;
1530 struct extent_state *cached_state = NULL;
1532 struct inode *inode;
1536 fixup = container_of(work, struct btrfs_writepage_fixup, work);
1540 if (!page->mapping || !PageDirty(page) || !PageChecked(page)) {
1541 ClearPageChecked(page);
1545 inode = page->mapping->host;
1546 page_start = page_offset(page);
1547 page_end = page_offset(page) + PAGE_CACHE_SIZE - 1;
1549 lock_extent_bits(&BTRFS_I(inode)->io_tree, page_start, page_end, 0,
1550 &cached_state, GFP_NOFS);
1552 /* already ordered? We're done */
1553 if (PagePrivate2(page))
1556 ordered = btrfs_lookup_ordered_extent(inode, page_start);
1558 unlock_extent_cached(&BTRFS_I(inode)->io_tree, page_start,
1559 page_end, &cached_state, GFP_NOFS);
1561 btrfs_start_ordered_extent(inode, ordered, 1);
1566 btrfs_set_extent_delalloc(inode, page_start, page_end, &cached_state);
1567 ClearPageChecked(page);
1569 unlock_extent_cached(&BTRFS_I(inode)->io_tree, page_start, page_end,
1570 &cached_state, GFP_NOFS);
1573 page_cache_release(page);
1578 * There are a few paths in the higher layers of the kernel that directly
1579 * set the page dirty bit without asking the filesystem if it is a
1580 * good idea. This causes problems because we want to make sure COW
1581 * properly happens and the data=ordered rules are followed.
1583 * In our case any range that doesn't have the ORDERED bit set
1584 * hasn't been properly setup for IO. We kick off an async process
1585 * to fix it up. The async helper will wait for ordered extents, set
1586 * the delalloc bit and make it safe to write the page.
1588 static int btrfs_writepage_start_hook(struct page *page, u64 start, u64 end)
1590 struct inode *inode = page->mapping->host;
1591 struct btrfs_writepage_fixup *fixup;
1592 struct btrfs_root *root = BTRFS_I(inode)->root;
1594 /* this page is properly in the ordered list */
1595 if (TestClearPagePrivate2(page))
1598 if (PageChecked(page))
1601 fixup = kzalloc(sizeof(*fixup), GFP_NOFS);
1605 SetPageChecked(page);
1606 page_cache_get(page);
1607 fixup->work.func = btrfs_writepage_fixup_worker;
1609 btrfs_queue_worker(&root->fs_info->fixup_workers, &fixup->work);
1613 static int insert_reserved_file_extent(struct btrfs_trans_handle *trans,
1614 struct inode *inode, u64 file_pos,
1615 u64 disk_bytenr, u64 disk_num_bytes,
1616 u64 num_bytes, u64 ram_bytes,
1617 u8 compression, u8 encryption,
1618 u16 other_encoding, int extent_type)
1620 struct btrfs_root *root = BTRFS_I(inode)->root;
1621 struct btrfs_file_extent_item *fi;
1622 struct btrfs_path *path;
1623 struct extent_buffer *leaf;
1624 struct btrfs_key ins;
1628 path = btrfs_alloc_path();
1631 path->leave_spinning = 1;
1634 * we may be replacing one extent in the tree with another.
1635 * The new extent is pinned in the extent map, and we don't want
1636 * to drop it from the cache until it is completely in the btree.
1638 * So, tell btrfs_drop_extents to leave this extent in the cache.
1639 * the caller is expected to unpin it and allow it to be merged
1642 ret = btrfs_drop_extents(trans, inode, file_pos, file_pos + num_bytes,
1646 ins.objectid = inode->i_ino;
1647 ins.offset = file_pos;
1648 ins.type = BTRFS_EXTENT_DATA_KEY;
1649 ret = btrfs_insert_empty_item(trans, root, path, &ins, sizeof(*fi));
1651 leaf = path->nodes[0];
1652 fi = btrfs_item_ptr(leaf, path->slots[0],
1653 struct btrfs_file_extent_item);
1654 btrfs_set_file_extent_generation(leaf, fi, trans->transid);
1655 btrfs_set_file_extent_type(leaf, fi, extent_type);
1656 btrfs_set_file_extent_disk_bytenr(leaf, fi, disk_bytenr);
1657 btrfs_set_file_extent_disk_num_bytes(leaf, fi, disk_num_bytes);
1658 btrfs_set_file_extent_offset(leaf, fi, 0);
1659 btrfs_set_file_extent_num_bytes(leaf, fi, num_bytes);
1660 btrfs_set_file_extent_ram_bytes(leaf, fi, ram_bytes);
1661 btrfs_set_file_extent_compression(leaf, fi, compression);
1662 btrfs_set_file_extent_encryption(leaf, fi, encryption);
1663 btrfs_set_file_extent_other_encoding(leaf, fi, other_encoding);
1665 btrfs_unlock_up_safe(path, 1);
1666 btrfs_set_lock_blocking(leaf);
1668 btrfs_mark_buffer_dirty(leaf);
1670 inode_add_bytes(inode, num_bytes);
1672 ins.objectid = disk_bytenr;
1673 ins.offset = disk_num_bytes;
1674 ins.type = BTRFS_EXTENT_ITEM_KEY;
1675 ret = btrfs_alloc_reserved_file_extent(trans, root,
1676 root->root_key.objectid,
1677 inode->i_ino, file_pos, &ins);
1679 btrfs_free_path(path);
1685 * helper function for btrfs_finish_ordered_io, this
1686 * just reads in some of the csum leaves to prime them into ram
1687 * before we start the transaction. It limits the amount of btree
1688 * reads required while inside the transaction.
1690 /* as ordered data IO finishes, this gets called so we can finish
1691 * an ordered extent if the range of bytes in the file it covers are
1694 static int btrfs_finish_ordered_io(struct inode *inode, u64 start, u64 end)
1696 struct btrfs_root *root = BTRFS_I(inode)->root;
1697 struct btrfs_trans_handle *trans = NULL;
1698 struct btrfs_ordered_extent *ordered_extent = NULL;
1699 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
1700 struct extent_state *cached_state = NULL;
1701 int compress_type = 0;
1703 bool nolock = false;
1705 ret = btrfs_dec_test_ordered_pending(inode, &ordered_extent, start,
1709 BUG_ON(!ordered_extent);
1711 nolock = (root == root->fs_info->tree_root);
1713 if (test_bit(BTRFS_ORDERED_NOCOW, &ordered_extent->flags)) {
1714 BUG_ON(!list_empty(&ordered_extent->list));
1715 ret = btrfs_ordered_update_i_size(inode, 0, ordered_extent);
1718 trans = btrfs_join_transaction_nolock(root, 1);
1720 trans = btrfs_join_transaction(root, 1);
1721 BUG_ON(IS_ERR(trans));
1722 btrfs_set_trans_block_group(trans, inode);
1723 trans->block_rsv = &root->fs_info->delalloc_block_rsv;
1724 ret = btrfs_update_inode(trans, root, inode);
1730 lock_extent_bits(io_tree, ordered_extent->file_offset,
1731 ordered_extent->file_offset + ordered_extent->len - 1,
1732 0, &cached_state, GFP_NOFS);
1735 trans = btrfs_join_transaction_nolock(root, 1);
1737 trans = btrfs_join_transaction(root, 1);
1738 BUG_ON(IS_ERR(trans));
1739 btrfs_set_trans_block_group(trans, inode);
1740 trans->block_rsv = &root->fs_info->delalloc_block_rsv;
1742 if (test_bit(BTRFS_ORDERED_COMPRESSED, &ordered_extent->flags))
1743 compress_type = ordered_extent->compress_type;
1744 if (test_bit(BTRFS_ORDERED_PREALLOC, &ordered_extent->flags)) {
1745 BUG_ON(compress_type);
1746 ret = btrfs_mark_extent_written(trans, inode,
1747 ordered_extent->file_offset,
1748 ordered_extent->file_offset +
1749 ordered_extent->len);
1752 BUG_ON(root == root->fs_info->tree_root);
1753 ret = insert_reserved_file_extent(trans, inode,
1754 ordered_extent->file_offset,
1755 ordered_extent->start,
1756 ordered_extent->disk_len,
1757 ordered_extent->len,
1758 ordered_extent->len,
1759 compress_type, 0, 0,
1760 BTRFS_FILE_EXTENT_REG);
1761 unpin_extent_cache(&BTRFS_I(inode)->extent_tree,
1762 ordered_extent->file_offset,
1763 ordered_extent->len);
1766 unlock_extent_cached(io_tree, ordered_extent->file_offset,
1767 ordered_extent->file_offset +
1768 ordered_extent->len - 1, &cached_state, GFP_NOFS);
1770 add_pending_csums(trans, inode, ordered_extent->file_offset,
1771 &ordered_extent->list);
1773 btrfs_ordered_update_i_size(inode, 0, ordered_extent);
1774 ret = btrfs_update_inode(trans, root, inode);
1779 btrfs_end_transaction_nolock(trans, root);
1781 btrfs_delalloc_release_metadata(inode, ordered_extent->len);
1783 btrfs_end_transaction(trans, root);
1787 btrfs_put_ordered_extent(ordered_extent);
1788 /* once for the tree */
1789 btrfs_put_ordered_extent(ordered_extent);
1794 static int btrfs_writepage_end_io_hook(struct page *page, u64 start, u64 end,
1795 struct extent_state *state, int uptodate)
1797 trace_btrfs_writepage_end_io_hook(page, start, end, uptodate);
1799 ClearPagePrivate2(page);
1800 return btrfs_finish_ordered_io(page->mapping->host, start, end);
1804 * When IO fails, either with EIO or csum verification fails, we
1805 * try other mirrors that might have a good copy of the data. This
1806 * io_failure_record is used to record state as we go through all the
1807 * mirrors. If another mirror has good data, the page is set up to date
1808 * and things continue. If a good mirror can't be found, the original
1809 * bio end_io callback is called to indicate things have failed.
1811 struct io_failure_record {
1816 unsigned long bio_flags;
1820 static int btrfs_io_failed_hook(struct bio *failed_bio,
1821 struct page *page, u64 start, u64 end,
1822 struct extent_state *state)
1824 struct io_failure_record *failrec = NULL;
1826 struct extent_map *em;
1827 struct inode *inode = page->mapping->host;
1828 struct extent_io_tree *failure_tree = &BTRFS_I(inode)->io_failure_tree;
1829 struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree;
1836 ret = get_state_private(failure_tree, start, &private);
1838 failrec = kmalloc(sizeof(*failrec), GFP_NOFS);
1841 failrec->start = start;
1842 failrec->len = end - start + 1;
1843 failrec->last_mirror = 0;
1844 failrec->bio_flags = 0;
1846 read_lock(&em_tree->lock);
1847 em = lookup_extent_mapping(em_tree, start, failrec->len);
1848 if (em->start > start || em->start + em->len < start) {
1849 free_extent_map(em);
1852 read_unlock(&em_tree->lock);
1854 if (!em || IS_ERR(em)) {
1858 logical = start - em->start;
1859 logical = em->block_start + logical;
1860 if (test_bit(EXTENT_FLAG_COMPRESSED, &em->flags)) {
1861 logical = em->block_start;
1862 failrec->bio_flags = EXTENT_BIO_COMPRESSED;
1863 extent_set_compress_type(&failrec->bio_flags,
1866 failrec->logical = logical;
1867 free_extent_map(em);
1868 set_extent_bits(failure_tree, start, end, EXTENT_LOCKED |
1869 EXTENT_DIRTY, GFP_NOFS);
1870 set_state_private(failure_tree, start,
1871 (u64)(unsigned long)failrec);
1873 failrec = (struct io_failure_record *)(unsigned long)private;
1875 num_copies = btrfs_num_copies(
1876 &BTRFS_I(inode)->root->fs_info->mapping_tree,
1877 failrec->logical, failrec->len);
1878 failrec->last_mirror++;
1880 spin_lock(&BTRFS_I(inode)->io_tree.lock);
1881 state = find_first_extent_bit_state(&BTRFS_I(inode)->io_tree,
1884 if (state && state->start != failrec->start)
1886 spin_unlock(&BTRFS_I(inode)->io_tree.lock);
1888 if (!state || failrec->last_mirror > num_copies) {
1889 set_state_private(failure_tree, failrec->start, 0);
1890 clear_extent_bits(failure_tree, failrec->start,
1891 failrec->start + failrec->len - 1,
1892 EXTENT_LOCKED | EXTENT_DIRTY, GFP_NOFS);
1896 bio = bio_alloc(GFP_NOFS, 1);
1897 bio->bi_private = state;
1898 bio->bi_end_io = failed_bio->bi_end_io;
1899 bio->bi_sector = failrec->logical >> 9;
1900 bio->bi_bdev = failed_bio->bi_bdev;
1903 bio_add_page(bio, page, failrec->len, start - page_offset(page));
1904 if (failed_bio->bi_rw & REQ_WRITE)
1909 ret = BTRFS_I(inode)->io_tree.ops->submit_bio_hook(inode, rw, bio,
1910 failrec->last_mirror,
1911 failrec->bio_flags, 0);
1916 * each time an IO finishes, we do a fast check in the IO failure tree
1917 * to see if we need to process or clean up an io_failure_record
1919 static int btrfs_clean_io_failures(struct inode *inode, u64 start)
1922 u64 private_failure;
1923 struct io_failure_record *failure;
1927 if (count_range_bits(&BTRFS_I(inode)->io_failure_tree, &private,
1928 (u64)-1, 1, EXTENT_DIRTY, 0)) {
1929 ret = get_state_private(&BTRFS_I(inode)->io_failure_tree,
1930 start, &private_failure);
1932 failure = (struct io_failure_record *)(unsigned long)
1934 set_state_private(&BTRFS_I(inode)->io_failure_tree,
1936 clear_extent_bits(&BTRFS_I(inode)->io_failure_tree,
1938 failure->start + failure->len - 1,
1939 EXTENT_DIRTY | EXTENT_LOCKED,
1948 * when reads are done, we need to check csums to verify the data is correct
1949 * if there's a match, we allow the bio to finish. If not, we go through
1950 * the io_failure_record routines to find good copies
1952 static int btrfs_readpage_end_io_hook(struct page *page, u64 start, u64 end,
1953 struct extent_state *state)
1955 size_t offset = start - ((u64)page->index << PAGE_CACHE_SHIFT);
1956 struct inode *inode = page->mapping->host;
1957 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
1959 u64 private = ~(u32)0;
1961 struct btrfs_root *root = BTRFS_I(inode)->root;
1964 if (PageChecked(page)) {
1965 ClearPageChecked(page);
1969 if (BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM)
1972 if (root->root_key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID &&
1973 test_range_bit(io_tree, start, end, EXTENT_NODATASUM, 1, NULL)) {
1974 clear_extent_bits(io_tree, start, end, EXTENT_NODATASUM,
1979 if (state && state->start == start) {
1980 private = state->private;
1983 ret = get_state_private(io_tree, start, &private);
1985 kaddr = kmap_atomic(page, KM_USER0);
1989 csum = btrfs_csum_data(root, kaddr + offset, csum, end - start + 1);
1990 btrfs_csum_final(csum, (char *)&csum);
1991 if (csum != private)
1994 kunmap_atomic(kaddr, KM_USER0);
1996 /* if the io failure tree for this inode is non-empty,
1997 * check to see if we've recovered from a failed IO
1999 btrfs_clean_io_failures(inode, start);
2003 if (printk_ratelimit()) {
2004 printk(KERN_INFO "btrfs csum failed ino %lu off %llu csum %u "
2005 "private %llu\n", page->mapping->host->i_ino,
2006 (unsigned long long)start, csum,
2007 (unsigned long long)private);
2009 memset(kaddr + offset, 1, end - start + 1);
2010 flush_dcache_page(page);
2011 kunmap_atomic(kaddr, KM_USER0);
2017 struct delayed_iput {
2018 struct list_head list;
2019 struct inode *inode;
2022 void btrfs_add_delayed_iput(struct inode *inode)
2024 struct btrfs_fs_info *fs_info = BTRFS_I(inode)->root->fs_info;
2025 struct delayed_iput *delayed;
2027 if (atomic_add_unless(&inode->i_count, -1, 1))
2030 delayed = kmalloc(sizeof(*delayed), GFP_NOFS | __GFP_NOFAIL);
2031 delayed->inode = inode;
2033 spin_lock(&fs_info->delayed_iput_lock);
2034 list_add_tail(&delayed->list, &fs_info->delayed_iputs);
2035 spin_unlock(&fs_info->delayed_iput_lock);
2038 void btrfs_run_delayed_iputs(struct btrfs_root *root)
2041 struct btrfs_fs_info *fs_info = root->fs_info;
2042 struct delayed_iput *delayed;
2045 spin_lock(&fs_info->delayed_iput_lock);
2046 empty = list_empty(&fs_info->delayed_iputs);
2047 spin_unlock(&fs_info->delayed_iput_lock);
2051 down_read(&root->fs_info->cleanup_work_sem);
2052 spin_lock(&fs_info->delayed_iput_lock);
2053 list_splice_init(&fs_info->delayed_iputs, &list);
2054 spin_unlock(&fs_info->delayed_iput_lock);
2056 while (!list_empty(&list)) {
2057 delayed = list_entry(list.next, struct delayed_iput, list);
2058 list_del(&delayed->list);
2059 iput(delayed->inode);
2062 up_read(&root->fs_info->cleanup_work_sem);
2066 * calculate extra metadata reservation when snapshotting a subvolume
2067 * contains orphan files.
2069 void btrfs_orphan_pre_snapshot(struct btrfs_trans_handle *trans,
2070 struct btrfs_pending_snapshot *pending,
2071 u64 *bytes_to_reserve)
2073 struct btrfs_root *root;
2074 struct btrfs_block_rsv *block_rsv;
2078 root = pending->root;
2079 if (!root->orphan_block_rsv || list_empty(&root->orphan_list))
2082 block_rsv = root->orphan_block_rsv;
2084 /* orphan block reservation for the snapshot */
2085 num_bytes = block_rsv->size;
2088 * after the snapshot is created, COWing tree blocks may use more
2089 * space than it frees. So we should make sure there is enough
2092 index = trans->transid & 0x1;
2093 if (block_rsv->reserved + block_rsv->freed[index] < block_rsv->size) {
2094 num_bytes += block_rsv->size -
2095 (block_rsv->reserved + block_rsv->freed[index]);
2098 *bytes_to_reserve += num_bytes;
2101 void btrfs_orphan_post_snapshot(struct btrfs_trans_handle *trans,
2102 struct btrfs_pending_snapshot *pending)
2104 struct btrfs_root *root = pending->root;
2105 struct btrfs_root *snap = pending->snap;
2106 struct btrfs_block_rsv *block_rsv;
2111 if (!root->orphan_block_rsv || list_empty(&root->orphan_list))
2114 /* refill source subvolume's orphan block reservation */
2115 block_rsv = root->orphan_block_rsv;
2116 index = trans->transid & 0x1;
2117 if (block_rsv->reserved + block_rsv->freed[index] < block_rsv->size) {
2118 num_bytes = block_rsv->size -
2119 (block_rsv->reserved + block_rsv->freed[index]);
2120 ret = btrfs_block_rsv_migrate(&pending->block_rsv,
2121 root->orphan_block_rsv,
2126 /* setup orphan block reservation for the snapshot */
2127 block_rsv = btrfs_alloc_block_rsv(snap);
2130 btrfs_add_durable_block_rsv(root->fs_info, block_rsv);
2131 snap->orphan_block_rsv = block_rsv;
2133 num_bytes = root->orphan_block_rsv->size;
2134 ret = btrfs_block_rsv_migrate(&pending->block_rsv,
2135 block_rsv, num_bytes);
2139 /* insert orphan item for the snapshot */
2140 WARN_ON(!root->orphan_item_inserted);
2141 ret = btrfs_insert_orphan_item(trans, root->fs_info->tree_root,
2142 snap->root_key.objectid);
2144 snap->orphan_item_inserted = 1;
2148 enum btrfs_orphan_cleanup_state {
2149 ORPHAN_CLEANUP_STARTED = 1,
2150 ORPHAN_CLEANUP_DONE = 2,
2154 * This is called in transaction commmit time. If there are no orphan
2155 * files in the subvolume, it removes orphan item and frees block_rsv
2158 void btrfs_orphan_commit_root(struct btrfs_trans_handle *trans,
2159 struct btrfs_root *root)
2163 if (!list_empty(&root->orphan_list) ||
2164 root->orphan_cleanup_state != ORPHAN_CLEANUP_DONE)
2167 if (root->orphan_item_inserted &&
2168 btrfs_root_refs(&root->root_item) > 0) {
2169 ret = btrfs_del_orphan_item(trans, root->fs_info->tree_root,
2170 root->root_key.objectid);
2172 root->orphan_item_inserted = 0;
2175 if (root->orphan_block_rsv) {
2176 WARN_ON(root->orphan_block_rsv->size > 0);
2177 btrfs_free_block_rsv(root, root->orphan_block_rsv);
2178 root->orphan_block_rsv = NULL;
2183 * This creates an orphan entry for the given inode in case something goes
2184 * wrong in the middle of an unlink/truncate.
2186 * NOTE: caller of this function should reserve 5 units of metadata for
2189 int btrfs_orphan_add(struct btrfs_trans_handle *trans, struct inode *inode)
2191 struct btrfs_root *root = BTRFS_I(inode)->root;
2192 struct btrfs_block_rsv *block_rsv = NULL;
2197 if (!root->orphan_block_rsv) {
2198 block_rsv = btrfs_alloc_block_rsv(root);
2202 spin_lock(&root->orphan_lock);
2203 if (!root->orphan_block_rsv) {
2204 root->orphan_block_rsv = block_rsv;
2205 } else if (block_rsv) {
2206 btrfs_free_block_rsv(root, block_rsv);
2210 if (list_empty(&BTRFS_I(inode)->i_orphan)) {
2211 list_add(&BTRFS_I(inode)->i_orphan, &root->orphan_list);
2214 * For proper ENOSPC handling, we should do orphan
2215 * cleanup when mounting. But this introduces backward
2216 * compatibility issue.
2218 if (!xchg(&root->orphan_item_inserted, 1))
2225 WARN_ON(!BTRFS_I(inode)->orphan_meta_reserved);
2228 if (!BTRFS_I(inode)->orphan_meta_reserved) {
2229 BTRFS_I(inode)->orphan_meta_reserved = 1;
2232 spin_unlock(&root->orphan_lock);
2235 btrfs_add_durable_block_rsv(root->fs_info, block_rsv);
2237 /* grab metadata reservation from transaction handle */
2239 ret = btrfs_orphan_reserve_metadata(trans, inode);
2243 /* insert an orphan item to track this unlinked/truncated file */
2245 ret = btrfs_insert_orphan_item(trans, root, inode->i_ino);
2249 /* insert an orphan item to track subvolume contains orphan files */
2251 ret = btrfs_insert_orphan_item(trans, root->fs_info->tree_root,
2252 root->root_key.objectid);
2259 * We have done the truncate/delete so we can go ahead and remove the orphan
2260 * item for this particular inode.
2262 int btrfs_orphan_del(struct btrfs_trans_handle *trans, struct inode *inode)
2264 struct btrfs_root *root = BTRFS_I(inode)->root;
2265 int delete_item = 0;
2266 int release_rsv = 0;
2269 spin_lock(&root->orphan_lock);
2270 if (!list_empty(&BTRFS_I(inode)->i_orphan)) {
2271 list_del_init(&BTRFS_I(inode)->i_orphan);
2275 if (BTRFS_I(inode)->orphan_meta_reserved) {
2276 BTRFS_I(inode)->orphan_meta_reserved = 0;
2279 spin_unlock(&root->orphan_lock);
2281 if (trans && delete_item) {
2282 ret = btrfs_del_orphan_item(trans, root, inode->i_ino);
2287 btrfs_orphan_release_metadata(inode);
2293 * this cleans up any orphans that may be left on the list from the last use
2296 int btrfs_orphan_cleanup(struct btrfs_root *root)
2298 struct btrfs_path *path;
2299 struct extent_buffer *leaf;
2300 struct btrfs_key key, found_key;
2301 struct btrfs_trans_handle *trans;
2302 struct inode *inode;
2303 int ret = 0, nr_unlink = 0, nr_truncate = 0;
2305 if (cmpxchg(&root->orphan_cleanup_state, 0, ORPHAN_CLEANUP_STARTED))
2308 path = btrfs_alloc_path();
2315 key.objectid = BTRFS_ORPHAN_OBJECTID;
2316 btrfs_set_key_type(&key, BTRFS_ORPHAN_ITEM_KEY);
2317 key.offset = (u64)-1;
2320 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
2325 * if ret == 0 means we found what we were searching for, which
2326 * is weird, but possible, so only screw with path if we didnt
2327 * find the key and see if we have stuff that matches
2331 if (path->slots[0] == 0)
2336 /* pull out the item */
2337 leaf = path->nodes[0];
2338 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
2340 /* make sure the item matches what we want */
2341 if (found_key.objectid != BTRFS_ORPHAN_OBJECTID)
2343 if (btrfs_key_type(&found_key) != BTRFS_ORPHAN_ITEM_KEY)
2346 /* release the path since we're done with it */
2347 btrfs_release_path(root, path);
2350 * this is where we are basically btrfs_lookup, without the
2351 * crossing root thing. we store the inode number in the
2352 * offset of the orphan item.
2354 found_key.objectid = found_key.offset;
2355 found_key.type = BTRFS_INODE_ITEM_KEY;
2356 found_key.offset = 0;
2357 inode = btrfs_iget(root->fs_info->sb, &found_key, root, NULL);
2358 if (IS_ERR(inode)) {
2359 ret = PTR_ERR(inode);
2364 * add this inode to the orphan list so btrfs_orphan_del does
2365 * the proper thing when we hit it
2367 spin_lock(&root->orphan_lock);
2368 list_add(&BTRFS_I(inode)->i_orphan, &root->orphan_list);
2369 spin_unlock(&root->orphan_lock);
2372 * if this is a bad inode, means we actually succeeded in
2373 * removing the inode, but not the orphan record, which means
2374 * we need to manually delete the orphan since iput will just
2375 * do a destroy_inode
2377 if (is_bad_inode(inode)) {
2378 trans = btrfs_start_transaction(root, 0);
2379 if (IS_ERR(trans)) {
2380 ret = PTR_ERR(trans);
2383 btrfs_orphan_del(trans, inode);
2384 btrfs_end_transaction(trans, root);
2389 /* if we have links, this was a truncate, lets do that */
2390 if (inode->i_nlink) {
2391 if (!S_ISREG(inode->i_mode)) {
2397 ret = btrfs_truncate(inode);
2402 /* this will do delete_inode and everything for us */
2407 root->orphan_cleanup_state = ORPHAN_CLEANUP_DONE;
2409 if (root->orphan_block_rsv)
2410 btrfs_block_rsv_release(root, root->orphan_block_rsv,
2413 if (root->orphan_block_rsv || root->orphan_item_inserted) {
2414 trans = btrfs_join_transaction(root, 1);
2416 btrfs_end_transaction(trans, root);
2420 printk(KERN_INFO "btrfs: unlinked %d orphans\n", nr_unlink);
2422 printk(KERN_INFO "btrfs: truncated %d orphans\n", nr_truncate);
2426 printk(KERN_CRIT "btrfs: could not do orphan cleanup %d\n", ret);
2427 btrfs_free_path(path);
2432 * very simple check to peek ahead in the leaf looking for xattrs. If we
2433 * don't find any xattrs, we know there can't be any acls.
2435 * slot is the slot the inode is in, objectid is the objectid of the inode
2437 static noinline int acls_after_inode_item(struct extent_buffer *leaf,
2438 int slot, u64 objectid)
2440 u32 nritems = btrfs_header_nritems(leaf);
2441 struct btrfs_key found_key;
2445 while (slot < nritems) {
2446 btrfs_item_key_to_cpu(leaf, &found_key, slot);
2448 /* we found a different objectid, there must not be acls */
2449 if (found_key.objectid != objectid)
2452 /* we found an xattr, assume we've got an acl */
2453 if (found_key.type == BTRFS_XATTR_ITEM_KEY)
2457 * we found a key greater than an xattr key, there can't
2458 * be any acls later on
2460 if (found_key.type > BTRFS_XATTR_ITEM_KEY)
2467 * it goes inode, inode backrefs, xattrs, extents,
2468 * so if there are a ton of hard links to an inode there can
2469 * be a lot of backrefs. Don't waste time searching too hard,
2470 * this is just an optimization
2475 /* we hit the end of the leaf before we found an xattr or
2476 * something larger than an xattr. We have to assume the inode
2483 * read an inode from the btree into the in-memory inode
2485 static void btrfs_read_locked_inode(struct inode *inode)
2487 struct btrfs_path *path;
2488 struct extent_buffer *leaf;
2489 struct btrfs_inode_item *inode_item;
2490 struct btrfs_timespec *tspec;
2491 struct btrfs_root *root = BTRFS_I(inode)->root;
2492 struct btrfs_key location;
2494 u64 alloc_group_block;
2498 path = btrfs_alloc_path();
2500 memcpy(&location, &BTRFS_I(inode)->location, sizeof(location));
2502 ret = btrfs_lookup_inode(NULL, root, path, &location, 0);
2506 leaf = path->nodes[0];
2507 inode_item = btrfs_item_ptr(leaf, path->slots[0],
2508 struct btrfs_inode_item);
2510 inode->i_mode = btrfs_inode_mode(leaf, inode_item);
2511 inode->i_nlink = btrfs_inode_nlink(leaf, inode_item);
2512 inode->i_uid = btrfs_inode_uid(leaf, inode_item);
2513 inode->i_gid = btrfs_inode_gid(leaf, inode_item);
2514 btrfs_i_size_write(inode, btrfs_inode_size(leaf, inode_item));
2516 tspec = btrfs_inode_atime(inode_item);
2517 inode->i_atime.tv_sec = btrfs_timespec_sec(leaf, tspec);
2518 inode->i_atime.tv_nsec = btrfs_timespec_nsec(leaf, tspec);
2520 tspec = btrfs_inode_mtime(inode_item);
2521 inode->i_mtime.tv_sec = btrfs_timespec_sec(leaf, tspec);
2522 inode->i_mtime.tv_nsec = btrfs_timespec_nsec(leaf, tspec);
2524 tspec = btrfs_inode_ctime(inode_item);
2525 inode->i_ctime.tv_sec = btrfs_timespec_sec(leaf, tspec);
2526 inode->i_ctime.tv_nsec = btrfs_timespec_nsec(leaf, tspec);
2528 inode_set_bytes(inode, btrfs_inode_nbytes(leaf, inode_item));
2529 BTRFS_I(inode)->generation = btrfs_inode_generation(leaf, inode_item);
2530 BTRFS_I(inode)->sequence = btrfs_inode_sequence(leaf, inode_item);
2531 inode->i_generation = BTRFS_I(inode)->generation;
2533 rdev = btrfs_inode_rdev(leaf, inode_item);
2535 BTRFS_I(inode)->index_cnt = (u64)-1;
2536 BTRFS_I(inode)->flags = btrfs_inode_flags(leaf, inode_item);
2538 alloc_group_block = btrfs_inode_block_group(leaf, inode_item);
2541 * try to precache a NULL acl entry for files that don't have
2542 * any xattrs or acls
2544 maybe_acls = acls_after_inode_item(leaf, path->slots[0], inode->i_ino);
2546 cache_no_acl(inode);
2548 BTRFS_I(inode)->block_group = btrfs_find_block_group(root, 0,
2549 alloc_group_block, 0);
2550 btrfs_free_path(path);
2553 switch (inode->i_mode & S_IFMT) {
2555 inode->i_mapping->a_ops = &btrfs_aops;
2556 inode->i_mapping->backing_dev_info = &root->fs_info->bdi;
2557 BTRFS_I(inode)->io_tree.ops = &btrfs_extent_io_ops;
2558 inode->i_fop = &btrfs_file_operations;
2559 inode->i_op = &btrfs_file_inode_operations;
2562 inode->i_fop = &btrfs_dir_file_operations;
2563 if (root == root->fs_info->tree_root)
2564 inode->i_op = &btrfs_dir_ro_inode_operations;
2566 inode->i_op = &btrfs_dir_inode_operations;
2569 inode->i_op = &btrfs_symlink_inode_operations;
2570 inode->i_mapping->a_ops = &btrfs_symlink_aops;
2571 inode->i_mapping->backing_dev_info = &root->fs_info->bdi;
2574 inode->i_op = &btrfs_special_inode_operations;
2575 init_special_inode(inode, inode->i_mode, rdev);
2579 btrfs_update_iflags(inode);
2583 btrfs_free_path(path);
2584 make_bad_inode(inode);
2588 * given a leaf and an inode, copy the inode fields into the leaf
2590 static void fill_inode_item(struct btrfs_trans_handle *trans,
2591 struct extent_buffer *leaf,
2592 struct btrfs_inode_item *item,
2593 struct inode *inode)
2595 btrfs_set_inode_uid(leaf, item, inode->i_uid);
2596 btrfs_set_inode_gid(leaf, item, inode->i_gid);
2597 btrfs_set_inode_size(leaf, item, BTRFS_I(inode)->disk_i_size);
2598 btrfs_set_inode_mode(leaf, item, inode->i_mode);
2599 btrfs_set_inode_nlink(leaf, item, inode->i_nlink);
2601 btrfs_set_timespec_sec(leaf, btrfs_inode_atime(item),
2602 inode->i_atime.tv_sec);
2603 btrfs_set_timespec_nsec(leaf, btrfs_inode_atime(item),
2604 inode->i_atime.tv_nsec);
2606 btrfs_set_timespec_sec(leaf, btrfs_inode_mtime(item),
2607 inode->i_mtime.tv_sec);
2608 btrfs_set_timespec_nsec(leaf, btrfs_inode_mtime(item),
2609 inode->i_mtime.tv_nsec);
2611 btrfs_set_timespec_sec(leaf, btrfs_inode_ctime(item),
2612 inode->i_ctime.tv_sec);
2613 btrfs_set_timespec_nsec(leaf, btrfs_inode_ctime(item),
2614 inode->i_ctime.tv_nsec);
2616 btrfs_set_inode_nbytes(leaf, item, inode_get_bytes(inode));
2617 btrfs_set_inode_generation(leaf, item, BTRFS_I(inode)->generation);
2618 btrfs_set_inode_sequence(leaf, item, BTRFS_I(inode)->sequence);
2619 btrfs_set_inode_transid(leaf, item, trans->transid);
2620 btrfs_set_inode_rdev(leaf, item, inode->i_rdev);
2621 btrfs_set_inode_flags(leaf, item, BTRFS_I(inode)->flags);
2622 btrfs_set_inode_block_group(leaf, item, BTRFS_I(inode)->block_group);
2626 * copy everything in the in-memory inode into the btree.
2628 noinline int btrfs_update_inode(struct btrfs_trans_handle *trans,
2629 struct btrfs_root *root, struct inode *inode)
2631 struct btrfs_inode_item *inode_item;
2632 struct btrfs_path *path;
2633 struct extent_buffer *leaf;
2636 path = btrfs_alloc_path();
2638 path->leave_spinning = 1;
2639 ret = btrfs_lookup_inode(trans, root, path,
2640 &BTRFS_I(inode)->location, 1);
2647 btrfs_unlock_up_safe(path, 1);
2648 leaf = path->nodes[0];
2649 inode_item = btrfs_item_ptr(leaf, path->slots[0],
2650 struct btrfs_inode_item);
2652 fill_inode_item(trans, leaf, inode_item, inode);
2653 btrfs_mark_buffer_dirty(leaf);
2654 btrfs_set_inode_last_trans(trans, inode);
2657 btrfs_free_path(path);
2663 * unlink helper that gets used here in inode.c and in the tree logging
2664 * recovery code. It remove a link in a directory with a given name, and
2665 * also drops the back refs in the inode to the directory
2667 static int __btrfs_unlink_inode(struct btrfs_trans_handle *trans,
2668 struct btrfs_root *root,
2669 struct inode *dir, struct inode *inode,
2670 const char *name, int name_len)
2672 struct btrfs_path *path;
2674 struct extent_buffer *leaf;
2675 struct btrfs_dir_item *di;
2676 struct btrfs_key key;
2679 path = btrfs_alloc_path();
2685 path->leave_spinning = 1;
2686 di = btrfs_lookup_dir_item(trans, root, path, dir->i_ino,
2687 name, name_len, -1);
2696 leaf = path->nodes[0];
2697 btrfs_dir_item_key_to_cpu(leaf, di, &key);
2698 ret = btrfs_delete_one_dir_name(trans, root, path, di);
2701 btrfs_release_path(root, path);
2703 ret = btrfs_del_inode_ref(trans, root, name, name_len,
2705 dir->i_ino, &index);
2707 printk(KERN_INFO "btrfs failed to delete reference to %.*s, "
2708 "inode %lu parent %lu\n", name_len, name,
2709 inode->i_ino, dir->i_ino);
2713 di = btrfs_lookup_dir_index_item(trans, root, path, dir->i_ino,
2714 index, name, name_len, -1);
2723 ret = btrfs_delete_one_dir_name(trans, root, path, di);
2724 btrfs_release_path(root, path);
2726 ret = btrfs_del_inode_ref_in_log(trans, root, name, name_len,
2728 BUG_ON(ret != 0 && ret != -ENOENT);
2730 ret = btrfs_del_dir_entries_in_log(trans, root, name, name_len,
2735 btrfs_free_path(path);
2739 btrfs_i_size_write(dir, dir->i_size - name_len * 2);
2740 inode->i_ctime = dir->i_mtime = dir->i_ctime = CURRENT_TIME;
2741 btrfs_update_inode(trans, root, dir);
2746 int btrfs_unlink_inode(struct btrfs_trans_handle *trans,
2747 struct btrfs_root *root,
2748 struct inode *dir, struct inode *inode,
2749 const char *name, int name_len)
2752 ret = __btrfs_unlink_inode(trans, root, dir, inode, name, name_len);
2754 btrfs_drop_nlink(inode);
2755 ret = btrfs_update_inode(trans, root, inode);
2761 /* helper to check if there is any shared block in the path */
2762 static int check_path_shared(struct btrfs_root *root,
2763 struct btrfs_path *path)
2765 struct extent_buffer *eb;
2769 for (level = 0; level < BTRFS_MAX_LEVEL; level++) {
2772 if (!path->nodes[level])
2774 eb = path->nodes[level];
2775 if (!btrfs_block_can_be_shared(root, eb))
2777 ret = btrfs_lookup_extent_info(NULL, root, eb->start, eb->len,
2786 * helper to start transaction for unlink and rmdir.
2788 * unlink and rmdir are special in btrfs, they do not always free space.
2789 * so in enospc case, we should make sure they will free space before
2790 * allowing them to use the global metadata reservation.
2792 static struct btrfs_trans_handle *__unlink_start_trans(struct inode *dir,
2793 struct dentry *dentry)
2795 struct btrfs_trans_handle *trans;
2796 struct btrfs_root *root = BTRFS_I(dir)->root;
2797 struct btrfs_path *path;
2798 struct btrfs_inode_ref *ref;
2799 struct btrfs_dir_item *di;
2800 struct inode *inode = dentry->d_inode;
2806 trans = btrfs_start_transaction(root, 10);
2807 if (!IS_ERR(trans) || PTR_ERR(trans) != -ENOSPC)
2810 if (inode->i_ino == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID)
2811 return ERR_PTR(-ENOSPC);
2813 /* check if there is someone else holds reference */
2814 if (S_ISDIR(inode->i_mode) && atomic_read(&inode->i_count) > 1)
2815 return ERR_PTR(-ENOSPC);
2817 if (atomic_read(&inode->i_count) > 2)
2818 return ERR_PTR(-ENOSPC);
2820 if (xchg(&root->fs_info->enospc_unlink, 1))
2821 return ERR_PTR(-ENOSPC);
2823 path = btrfs_alloc_path();
2825 root->fs_info->enospc_unlink = 0;
2826 return ERR_PTR(-ENOMEM);
2829 trans = btrfs_start_transaction(root, 0);
2830 if (IS_ERR(trans)) {
2831 btrfs_free_path(path);
2832 root->fs_info->enospc_unlink = 0;
2836 path->skip_locking = 1;
2837 path->search_commit_root = 1;
2839 ret = btrfs_lookup_inode(trans, root, path,
2840 &BTRFS_I(dir)->location, 0);
2846 if (check_path_shared(root, path))
2851 btrfs_release_path(root, path);
2853 ret = btrfs_lookup_inode(trans, root, path,
2854 &BTRFS_I(inode)->location, 0);
2860 if (check_path_shared(root, path))
2865 btrfs_release_path(root, path);
2867 if (ret == 0 && S_ISREG(inode->i_mode)) {
2868 ret = btrfs_lookup_file_extent(trans, root, path,
2869 inode->i_ino, (u64)-1, 0);
2875 if (check_path_shared(root, path))
2877 btrfs_release_path(root, path);
2885 di = btrfs_lookup_dir_item(trans, root, path, dir->i_ino,
2886 dentry->d_name.name, dentry->d_name.len, 0);
2892 if (check_path_shared(root, path))
2898 btrfs_release_path(root, path);
2900 ref = btrfs_lookup_inode_ref(trans, root, path,
2901 dentry->d_name.name, dentry->d_name.len,
2902 inode->i_ino, dir->i_ino, 0);
2908 if (check_path_shared(root, path))
2910 index = btrfs_inode_ref_index(path->nodes[0], ref);
2911 btrfs_release_path(root, path);
2913 di = btrfs_lookup_dir_index_item(trans, root, path, dir->i_ino, index,
2914 dentry->d_name.name, dentry->d_name.len, 0);
2919 BUG_ON(ret == -ENOENT);
2920 if (check_path_shared(root, path))
2925 btrfs_free_path(path);
2927 btrfs_end_transaction(trans, root);
2928 root->fs_info->enospc_unlink = 0;
2929 return ERR_PTR(err);
2932 trans->block_rsv = &root->fs_info->global_block_rsv;
2936 static void __unlink_end_trans(struct btrfs_trans_handle *trans,
2937 struct btrfs_root *root)
2939 if (trans->block_rsv == &root->fs_info->global_block_rsv) {
2940 BUG_ON(!root->fs_info->enospc_unlink);
2941 root->fs_info->enospc_unlink = 0;
2943 btrfs_end_transaction_throttle(trans, root);
2946 static int btrfs_unlink(struct inode *dir, struct dentry *dentry)
2948 struct btrfs_root *root = BTRFS_I(dir)->root;
2949 struct btrfs_trans_handle *trans;
2950 struct inode *inode = dentry->d_inode;
2952 unsigned long nr = 0;
2954 trans = __unlink_start_trans(dir, dentry);
2956 return PTR_ERR(trans);
2958 btrfs_set_trans_block_group(trans, dir);
2960 btrfs_record_unlink_dir(trans, dir, dentry->d_inode, 0);
2962 ret = btrfs_unlink_inode(trans, root, dir, dentry->d_inode,
2963 dentry->d_name.name, dentry->d_name.len);
2966 if (inode->i_nlink == 0) {
2967 ret = btrfs_orphan_add(trans, inode);
2971 nr = trans->blocks_used;
2972 __unlink_end_trans(trans, root);
2973 btrfs_btree_balance_dirty(root, nr);
2977 int btrfs_unlink_subvol(struct btrfs_trans_handle *trans,
2978 struct btrfs_root *root,
2979 struct inode *dir, u64 objectid,
2980 const char *name, int name_len)
2982 struct btrfs_path *path;
2983 struct extent_buffer *leaf;
2984 struct btrfs_dir_item *di;
2985 struct btrfs_key key;
2989 path = btrfs_alloc_path();
2993 di = btrfs_lookup_dir_item(trans, root, path, dir->i_ino,
2994 name, name_len, -1);
2995 BUG_ON(!di || IS_ERR(di));
2997 leaf = path->nodes[0];
2998 btrfs_dir_item_key_to_cpu(leaf, di, &key);
2999 WARN_ON(key.type != BTRFS_ROOT_ITEM_KEY || key.objectid != objectid);
3000 ret = btrfs_delete_one_dir_name(trans, root, path, di);
3002 btrfs_release_path(root, path);
3004 ret = btrfs_del_root_ref(trans, root->fs_info->tree_root,
3005 objectid, root->root_key.objectid,
3006 dir->i_ino, &index, name, name_len);
3008 BUG_ON(ret != -ENOENT);
3009 di = btrfs_search_dir_index_item(root, path, dir->i_ino,
3011 BUG_ON(!di || IS_ERR(di));
3013 leaf = path->nodes[0];
3014 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
3015 btrfs_release_path(root, path);
3019 di = btrfs_lookup_dir_index_item(trans, root, path, dir->i_ino,
3020 index, name, name_len, -1);
3021 BUG_ON(!di || IS_ERR(di));
3023 leaf = path->nodes[0];
3024 btrfs_dir_item_key_to_cpu(leaf, di, &key);
3025 WARN_ON(key.type != BTRFS_ROOT_ITEM_KEY || key.objectid != objectid);
3026 ret = btrfs_delete_one_dir_name(trans, root, path, di);
3028 btrfs_release_path(root, path);
3030 btrfs_i_size_write(dir, dir->i_size - name_len * 2);
3031 dir->i_mtime = dir->i_ctime = CURRENT_TIME;
3032 ret = btrfs_update_inode(trans, root, dir);
3035 btrfs_free_path(path);
3039 static int btrfs_rmdir(struct inode *dir, struct dentry *dentry)
3041 struct inode *inode = dentry->d_inode;
3043 struct btrfs_root *root = BTRFS_I(dir)->root;
3044 struct btrfs_trans_handle *trans;
3045 unsigned long nr = 0;
3047 if (inode->i_size > BTRFS_EMPTY_DIR_SIZE ||
3048 inode->i_ino == BTRFS_FIRST_FREE_OBJECTID)
3051 trans = __unlink_start_trans(dir, dentry);
3053 return PTR_ERR(trans);
3055 btrfs_set_trans_block_group(trans, dir);
3057 if (unlikely(inode->i_ino == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID)) {
3058 err = btrfs_unlink_subvol(trans, root, dir,
3059 BTRFS_I(inode)->location.objectid,
3060 dentry->d_name.name,
3061 dentry->d_name.len);
3065 err = btrfs_orphan_add(trans, inode);
3069 /* now the directory is empty */
3070 err = btrfs_unlink_inode(trans, root, dir, dentry->d_inode,
3071 dentry->d_name.name, dentry->d_name.len);
3073 btrfs_i_size_write(inode, 0);
3075 nr = trans->blocks_used;
3076 __unlink_end_trans(trans, root);
3077 btrfs_btree_balance_dirty(root, nr);
3084 * when truncating bytes in a file, it is possible to avoid reading
3085 * the leaves that contain only checksum items. This can be the
3086 * majority of the IO required to delete a large file, but it must
3087 * be done carefully.
3089 * The keys in the level just above the leaves are checked to make sure
3090 * the lowest key in a given leaf is a csum key, and starts at an offset
3091 * after the new size.
3093 * Then the key for the next leaf is checked to make sure it also has
3094 * a checksum item for the same file. If it does, we know our target leaf
3095 * contains only checksum items, and it can be safely freed without reading
3098 * This is just an optimization targeted at large files. It may do
3099 * nothing. It will return 0 unless things went badly.
3101 static noinline int drop_csum_leaves(struct btrfs_trans_handle *trans,
3102 struct btrfs_root *root,
3103 struct btrfs_path *path,
3104 struct inode *inode, u64 new_size)
3106 struct btrfs_key key;
3109 struct btrfs_key found_key;
3110 struct btrfs_key other_key;
3111 struct btrfs_leaf_ref *ref;
3115 path->lowest_level = 1;
3116 key.objectid = inode->i_ino;
3117 key.type = BTRFS_CSUM_ITEM_KEY;
3118 key.offset = new_size;
3120 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
3124 if (path->nodes[1] == NULL) {
3129 btrfs_node_key_to_cpu(path->nodes[1], &found_key, path->slots[1]);
3130 nritems = btrfs_header_nritems(path->nodes[1]);
3135 if (path->slots[1] >= nritems)
3138 /* did we find a key greater than anything we want to delete? */
3139 if (found_key.objectid > inode->i_ino ||
3140 (found_key.objectid == inode->i_ino && found_key.type > key.type))
3143 /* we check the next key in the node to make sure the leave contains
3144 * only checksum items. This comparison doesn't work if our
3145 * leaf is the last one in the node
3147 if (path->slots[1] + 1 >= nritems) {
3149 /* search forward from the last key in the node, this
3150 * will bring us into the next node in the tree
3152 btrfs_node_key_to_cpu(path->nodes[1], &found_key, nritems - 1);
3154 /* unlikely, but we inc below, so check to be safe */
3155 if (found_key.offset == (u64)-1)
3158 /* search_forward needs a path with locks held, do the
3159 * search again for the original key. It is possible
3160 * this will race with a balance and return a path that
3161 * we could modify, but this drop is just an optimization
3162 * and is allowed to miss some leaves.
3164 btrfs_release_path(root, path);
3167 /* setup a max key for search_forward */
3168 other_key.offset = (u64)-1;
3169 other_key.type = key.type;
3170 other_key.objectid = key.objectid;
3172 path->keep_locks = 1;
3173 ret = btrfs_search_forward(root, &found_key, &other_key,
3175 path->keep_locks = 0;
3176 if (ret || found_key.objectid != key.objectid ||
3177 found_key.type != key.type) {
3182 key.offset = found_key.offset;
3183 btrfs_release_path(root, path);
3188 /* we know there's one more slot after us in the tree,
3189 * read that key so we can verify it is also a checksum item
3191 btrfs_node_key_to_cpu(path->nodes[1], &other_key, path->slots[1] + 1);
3193 if (found_key.objectid < inode->i_ino)
3196 if (found_key.type != key.type || found_key.offset < new_size)
3200 * if the key for the next leaf isn't a csum key from this objectid,
3201 * we can't be sure there aren't good items inside this leaf.
3204 if (other_key.objectid != inode->i_ino || other_key.type != key.type)
3207 leaf_start = btrfs_node_blockptr(path->nodes[1], path->slots[1]);
3208 leaf_gen = btrfs_node_ptr_generation(path->nodes[1], path->slots[1]);
3210 * it is safe to delete this leaf, it contains only
3211 * csum items from this inode at an offset >= new_size
3213 ret = btrfs_del_leaf(trans, root, path, leaf_start);
3216 if (root->ref_cows && leaf_gen < trans->transid) {
3217 ref = btrfs_alloc_leaf_ref(root, 0);
3219 ref->root_gen = root->root_key.offset;
3220 ref->bytenr = leaf_start;
3222 ref->generation = leaf_gen;
3225 btrfs_sort_leaf_ref(ref);
3227 ret = btrfs_add_leaf_ref(root, ref, 0);
3229 btrfs_free_leaf_ref(root, ref);
3235 btrfs_release_path(root, path);
3237 if (other_key.objectid == inode->i_ino &&
3238 other_key.type == key.type && other_key.offset > key.offset) {
3239 key.offset = other_key.offset;
3245 /* fixup any changes we've made to the path */
3246 path->lowest_level = 0;
3247 path->keep_locks = 0;
3248 btrfs_release_path(root, path);
3255 * this can truncate away extent items, csum items and directory items.
3256 * It starts at a high offset and removes keys until it can't find
3257 * any higher than new_size
3259 * csum items that cross the new i_size are truncated to the new size
3262 * min_type is the minimum key type to truncate down to. If set to 0, this
3263 * will kill all the items on this inode, including the INODE_ITEM_KEY.
3265 int btrfs_truncate_inode_items(struct btrfs_trans_handle *trans,
3266 struct btrfs_root *root,
3267 struct inode *inode,
3268 u64 new_size, u32 min_type)
3270 struct btrfs_path *path;
3271 struct extent_buffer *leaf;
3272 struct btrfs_file_extent_item *fi;
3273 struct btrfs_key key;
3274 struct btrfs_key found_key;
3275 u64 extent_start = 0;
3276 u64 extent_num_bytes = 0;
3277 u64 extent_offset = 0;
3279 u64 mask = root->sectorsize - 1;
3280 u32 found_type = (u8)-1;
3283 int pending_del_nr = 0;
3284 int pending_del_slot = 0;
3285 int extent_type = -1;
3290 BUG_ON(new_size > 0 && min_type != BTRFS_EXTENT_DATA_KEY);
3292 if (root->ref_cows || root == root->fs_info->tree_root)
3293 btrfs_drop_extent_cache(inode, new_size & (~mask), (u64)-1, 0);
3295 path = btrfs_alloc_path();
3299 key.objectid = inode->i_ino;
3300 key.offset = (u64)-1;
3304 path->leave_spinning = 1;
3305 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
3312 /* there are no items in the tree for us to truncate, we're
3315 if (path->slots[0] == 0)
3322 leaf = path->nodes[0];
3323 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
3324 found_type = btrfs_key_type(&found_key);
3327 if (found_key.objectid != inode->i_ino)
3330 if (found_type < min_type)
3333 item_end = found_key.offset;
3334 if (found_type == BTRFS_EXTENT_DATA_KEY) {
3335 fi = btrfs_item_ptr(leaf, path->slots[0],
3336 struct btrfs_file_extent_item);
3337 extent_type = btrfs_file_extent_type(leaf, fi);
3338 encoding = btrfs_file_extent_compression(leaf, fi);
3339 encoding |= btrfs_file_extent_encryption(leaf, fi);
3340 encoding |= btrfs_file_extent_other_encoding(leaf, fi);
3342 if (extent_type != BTRFS_FILE_EXTENT_INLINE) {
3344 btrfs_file_extent_num_bytes(leaf, fi);
3345 } else if (extent_type == BTRFS_FILE_EXTENT_INLINE) {
3346 item_end += btrfs_file_extent_inline_len(leaf,
3351 if (found_type > min_type) {
3354 if (item_end < new_size)
3356 if (found_key.offset >= new_size)
3362 /* FIXME, shrink the extent if the ref count is only 1 */
3363 if (found_type != BTRFS_EXTENT_DATA_KEY)
3366 if (extent_type != BTRFS_FILE_EXTENT_INLINE) {
3368 extent_start = btrfs_file_extent_disk_bytenr(leaf, fi);
3369 if (!del_item && !encoding) {
3370 u64 orig_num_bytes =
3371 btrfs_file_extent_num_bytes(leaf, fi);
3372 extent_num_bytes = new_size -
3373 found_key.offset + root->sectorsize - 1;
3374 extent_num_bytes = extent_num_bytes &
3375 ~((u64)root->sectorsize - 1);
3376 btrfs_set_file_extent_num_bytes(leaf, fi,
3378 num_dec = (orig_num_bytes -
3380 if (root->ref_cows && extent_start != 0)
3381 inode_sub_bytes(inode, num_dec);
3382 btrfs_mark_buffer_dirty(leaf);
3385 btrfs_file_extent_disk_num_bytes(leaf,
3387 extent_offset = found_key.offset -
3388 btrfs_file_extent_offset(leaf, fi);
3390 /* FIXME blocksize != 4096 */
3391 num_dec = btrfs_file_extent_num_bytes(leaf, fi);
3392 if (extent_start != 0) {
3395 inode_sub_bytes(inode, num_dec);
3398 } else if (extent_type == BTRFS_FILE_EXTENT_INLINE) {
3400 * we can't truncate inline items that have had
3404 btrfs_file_extent_compression(leaf, fi) == 0 &&
3405 btrfs_file_extent_encryption(leaf, fi) == 0 &&
3406 btrfs_file_extent_other_encoding(leaf, fi) == 0) {
3407 u32 size = new_size - found_key.offset;
3409 if (root->ref_cows) {
3410 inode_sub_bytes(inode, item_end + 1 -
3414 btrfs_file_extent_calc_inline_size(size);
3415 ret = btrfs_truncate_item(trans, root, path,
3418 } else if (root->ref_cows) {
3419 inode_sub_bytes(inode, item_end + 1 -
3425 if (!pending_del_nr) {
3426 /* no pending yet, add ourselves */
3427 pending_del_slot = path->slots[0];
3429 } else if (pending_del_nr &&
3430 path->slots[0] + 1 == pending_del_slot) {
3431 /* hop on the pending chunk */
3433 pending_del_slot = path->slots[0];
3440 if (found_extent && (root->ref_cows ||
3441 root == root->fs_info->tree_root)) {
3442 btrfs_set_path_blocking(path);
3443 ret = btrfs_free_extent(trans, root, extent_start,
3444 extent_num_bytes, 0,
3445 btrfs_header_owner(leaf),
3446 inode->i_ino, extent_offset);
3450 if (found_type == BTRFS_INODE_ITEM_KEY)
3453 if (path->slots[0] == 0 ||
3454 path->slots[0] != pending_del_slot) {
3455 if (root->ref_cows) {
3459 if (pending_del_nr) {
3460 ret = btrfs_del_items(trans, root, path,
3466 btrfs_release_path(root, path);
3473 if (pending_del_nr) {
3474 ret = btrfs_del_items(trans, root, path, pending_del_slot,
3478 btrfs_free_path(path);
3483 * taken from block_truncate_page, but does cow as it zeros out
3484 * any bytes left in the last page in the file.
3486 static int btrfs_truncate_page(struct address_space *mapping, loff_t from)
3488 struct inode *inode = mapping->host;
3489 struct btrfs_root *root = BTRFS_I(inode)->root;
3490 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
3491 struct btrfs_ordered_extent *ordered;
3492 struct extent_state *cached_state = NULL;
3494 u32 blocksize = root->sectorsize;
3495 pgoff_t index = from >> PAGE_CACHE_SHIFT;
3496 unsigned offset = from & (PAGE_CACHE_SIZE-1);
3502 if ((offset & (blocksize - 1)) == 0)
3504 ret = btrfs_delalloc_reserve_space(inode, PAGE_CACHE_SIZE);
3510 page = grab_cache_page(mapping, index);
3512 btrfs_delalloc_release_space(inode, PAGE_CACHE_SIZE);
3516 page_start = page_offset(page);
3517 page_end = page_start + PAGE_CACHE_SIZE - 1;
3519 if (!PageUptodate(page)) {
3520 ret = btrfs_readpage(NULL, page);
3522 if (page->mapping != mapping) {
3524 page_cache_release(page);
3527 if (!PageUptodate(page)) {
3532 wait_on_page_writeback(page);
3534 lock_extent_bits(io_tree, page_start, page_end, 0, &cached_state,
3536 set_page_extent_mapped(page);
3538 ordered = btrfs_lookup_ordered_extent(inode, page_start);
3540 unlock_extent_cached(io_tree, page_start, page_end,
3541 &cached_state, GFP_NOFS);
3543 page_cache_release(page);
3544 btrfs_start_ordered_extent(inode, ordered, 1);
3545 btrfs_put_ordered_extent(ordered);
3549 clear_extent_bit(&BTRFS_I(inode)->io_tree, page_start, page_end,
3550 EXTENT_DIRTY | EXTENT_DELALLOC | EXTENT_DO_ACCOUNTING,
3551 0, 0, &cached_state, GFP_NOFS);
3553 ret = btrfs_set_extent_delalloc(inode, page_start, page_end,
3556 unlock_extent_cached(io_tree, page_start, page_end,
3557 &cached_state, GFP_NOFS);
3562 if (offset != PAGE_CACHE_SIZE) {
3564 memset(kaddr + offset, 0, PAGE_CACHE_SIZE - offset);
3565 flush_dcache_page(page);
3568 ClearPageChecked(page);
3569 set_page_dirty(page);
3570 unlock_extent_cached(io_tree, page_start, page_end, &cached_state,
3575 btrfs_delalloc_release_space(inode, PAGE_CACHE_SIZE);
3577 page_cache_release(page);
3583 * This function puts in dummy file extents for the area we're creating a hole
3584 * for. So if we are truncating this file to a larger size we need to insert
3585 * these file extents so that btrfs_get_extent will return a EXTENT_MAP_HOLE for
3586 * the range between oldsize and size
3588 int btrfs_cont_expand(struct inode *inode, loff_t oldsize, loff_t size)
3590 struct btrfs_trans_handle *trans;
3591 struct btrfs_root *root = BTRFS_I(inode)->root;
3592 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
3593 struct extent_map *em = NULL;
3594 struct extent_state *cached_state = NULL;
3595 u64 mask = root->sectorsize - 1;
3596 u64 hole_start = (oldsize + mask) & ~mask;
3597 u64 block_end = (size + mask) & ~mask;
3603 if (size <= hole_start)
3607 struct btrfs_ordered_extent *ordered;
3608 btrfs_wait_ordered_range(inode, hole_start,
3609 block_end - hole_start);
3610 lock_extent_bits(io_tree, hole_start, block_end - 1, 0,
3611 &cached_state, GFP_NOFS);
3612 ordered = btrfs_lookup_ordered_extent(inode, hole_start);
3615 unlock_extent_cached(io_tree, hole_start, block_end - 1,
3616 &cached_state, GFP_NOFS);
3617 btrfs_put_ordered_extent(ordered);
3620 cur_offset = hole_start;
3622 em = btrfs_get_extent(inode, NULL, 0, cur_offset,
3623 block_end - cur_offset, 0);
3624 BUG_ON(IS_ERR(em) || !em);
3625 last_byte = min(extent_map_end(em), block_end);
3626 last_byte = (last_byte + mask) & ~mask;
3627 if (!test_bit(EXTENT_FLAG_PREALLOC, &em->flags)) {
3629 hole_size = last_byte - cur_offset;
3631 trans = btrfs_start_transaction(root, 2);
3632 if (IS_ERR(trans)) {
3633 err = PTR_ERR(trans);
3636 btrfs_set_trans_block_group(trans, inode);
3638 err = btrfs_drop_extents(trans, inode, cur_offset,
3639 cur_offset + hole_size,
3644 err = btrfs_insert_file_extent(trans, root,
3645 inode->i_ino, cur_offset, 0,
3646 0, hole_size, 0, hole_size,
3651 btrfs_drop_extent_cache(inode, hole_start,
3654 btrfs_end_transaction(trans, root);
3656 free_extent_map(em);
3658 cur_offset = last_byte;
3659 if (cur_offset >= block_end)
3663 free_extent_map(em);
3664 unlock_extent_cached(io_tree, hole_start, block_end - 1, &cached_state,
3669 static int btrfs_setsize(struct inode *inode, loff_t newsize)
3671 loff_t oldsize = i_size_read(inode);
3674 if (newsize == oldsize)
3677 if (newsize > oldsize) {
3678 i_size_write(inode, newsize);
3679 btrfs_ordered_update_i_size(inode, i_size_read(inode), NULL);
3680 truncate_pagecache(inode, oldsize, newsize);
3681 ret = btrfs_cont_expand(inode, oldsize, newsize);
3683 btrfs_setsize(inode, oldsize);
3687 mark_inode_dirty(inode);
3691 * We're truncating a file that used to have good data down to
3692 * zero. Make sure it gets into the ordered flush list so that
3693 * any new writes get down to disk quickly.
3696 BTRFS_I(inode)->ordered_data_close = 1;
3698 /* we don't support swapfiles, so vmtruncate shouldn't fail */
3699 truncate_setsize(inode, newsize);
3700 ret = btrfs_truncate(inode);
3706 static int btrfs_setattr(struct dentry *dentry, struct iattr *attr)
3708 struct inode *inode = dentry->d_inode;
3709 struct btrfs_root *root = BTRFS_I(inode)->root;
3712 if (btrfs_root_readonly(root))
3715 err = inode_change_ok(inode, attr);
3719 if (S_ISREG(inode->i_mode) && (attr->ia_valid & ATTR_SIZE)) {
3720 err = btrfs_setsize(inode, attr->ia_size);
3725 if (attr->ia_valid) {
3726 setattr_copy(inode, attr);
3727 mark_inode_dirty(inode);
3729 if (attr->ia_valid & ATTR_MODE)
3730 err = btrfs_acl_chmod(inode);
3736 void btrfs_evict_inode(struct inode *inode)
3738 struct btrfs_trans_handle *trans;
3739 struct btrfs_root *root = BTRFS_I(inode)->root;
3743 trace_btrfs_inode_evict(inode);
3745 truncate_inode_pages(&inode->i_data, 0);
3746 if (inode->i_nlink && (btrfs_root_refs(&root->root_item) != 0 ||
3747 root == root->fs_info->tree_root))
3750 if (is_bad_inode(inode)) {
3751 btrfs_orphan_del(NULL, inode);
3754 /* do we really want it for ->i_nlink > 0 and zero btrfs_root_refs? */
3755 btrfs_wait_ordered_range(inode, 0, (u64)-1);
3757 if (root->fs_info->log_root_recovering) {
3758 BUG_ON(!list_empty(&BTRFS_I(inode)->i_orphan));
3762 if (inode->i_nlink > 0) {
3763 BUG_ON(btrfs_root_refs(&root->root_item) != 0);
3767 btrfs_i_size_write(inode, 0);
3770 trans = btrfs_start_transaction(root, 0);
3771 BUG_ON(IS_ERR(trans));
3772 btrfs_set_trans_block_group(trans, inode);
3773 trans->block_rsv = root->orphan_block_rsv;
3775 ret = btrfs_block_rsv_check(trans, root,
3776 root->orphan_block_rsv, 0, 5);
3778 BUG_ON(ret != -EAGAIN);
3779 ret = btrfs_commit_transaction(trans, root);
3784 ret = btrfs_truncate_inode_items(trans, root, inode, 0, 0);
3788 nr = trans->blocks_used;
3789 btrfs_end_transaction(trans, root);
3791 btrfs_btree_balance_dirty(root, nr);
3796 ret = btrfs_orphan_del(trans, inode);
3800 nr = trans->blocks_used;
3801 btrfs_end_transaction(trans, root);
3802 btrfs_btree_balance_dirty(root, nr);
3804 end_writeback(inode);
3809 * this returns the key found in the dir entry in the location pointer.
3810 * If no dir entries were found, location->objectid is 0.
3812 static int btrfs_inode_by_name(struct inode *dir, struct dentry *dentry,
3813 struct btrfs_key *location)
3815 const char *name = dentry->d_name.name;
3816 int namelen = dentry->d_name.len;
3817 struct btrfs_dir_item *di;
3818 struct btrfs_path *path;
3819 struct btrfs_root *root = BTRFS_I(dir)->root;
3822 path = btrfs_alloc_path();
3825 di = btrfs_lookup_dir_item(NULL, root, path, dir->i_ino, name,
3830 if (!di || IS_ERR(di))
3833 btrfs_dir_item_key_to_cpu(path->nodes[0], di, location);
3835 btrfs_free_path(path);
3838 location->objectid = 0;
3843 * when we hit a tree root in a directory, the btrfs part of the inode
3844 * needs to be changed to reflect the root directory of the tree root. This
3845 * is kind of like crossing a mount point.
3847 static int fixup_tree_root_location(struct btrfs_root *root,
3849 struct dentry *dentry,
3850 struct btrfs_key *location,
3851 struct btrfs_root **sub_root)
3853 struct btrfs_path *path;
3854 struct btrfs_root *new_root;
3855 struct btrfs_root_ref *ref;
3856 struct extent_buffer *leaf;
3860 path = btrfs_alloc_path();
3867 ret = btrfs_find_root_ref(root->fs_info->tree_root, path,
3868 BTRFS_I(dir)->root->root_key.objectid,
3869 location->objectid);
3876 leaf = path->nodes[0];
3877 ref = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_root_ref);
3878 if (btrfs_root_ref_dirid(leaf, ref) != dir->i_ino ||
3879 btrfs_root_ref_name_len(leaf, ref) != dentry->d_name.len)
3882 ret = memcmp_extent_buffer(leaf, dentry->d_name.name,
3883 (unsigned long)(ref + 1),
3884 dentry->d_name.len);
3888 btrfs_release_path(root->fs_info->tree_root, path);
3890 new_root = btrfs_read_fs_root_no_name(root->fs_info, location);
3891 if (IS_ERR(new_root)) {
3892 err = PTR_ERR(new_root);
3896 if (btrfs_root_refs(&new_root->root_item) == 0) {
3901 *sub_root = new_root;
3902 location->objectid = btrfs_root_dirid(&new_root->root_item);
3903 location->type = BTRFS_INODE_ITEM_KEY;
3904 location->offset = 0;
3907 btrfs_free_path(path);
3911 static void inode_tree_add(struct inode *inode)
3913 struct btrfs_root *root = BTRFS_I(inode)->root;
3914 struct btrfs_inode *entry;
3916 struct rb_node *parent;
3918 p = &root->inode_tree.rb_node;
3921 if (inode_unhashed(inode))
3924 spin_lock(&root->inode_lock);
3927 entry = rb_entry(parent, struct btrfs_inode, rb_node);
3929 if (inode->i_ino < entry->vfs_inode.i_ino)
3930 p = &parent->rb_left;
3931 else if (inode->i_ino > entry->vfs_inode.i_ino)
3932 p = &parent->rb_right;
3934 WARN_ON(!(entry->vfs_inode.i_state &
3935 (I_WILL_FREE | I_FREEING)));
3936 rb_erase(parent, &root->inode_tree);
3937 RB_CLEAR_NODE(parent);
3938 spin_unlock(&root->inode_lock);
3942 rb_link_node(&BTRFS_I(inode)->rb_node, parent, p);
3943 rb_insert_color(&BTRFS_I(inode)->rb_node, &root->inode_tree);
3944 spin_unlock(&root->inode_lock);
3947 static void inode_tree_del(struct inode *inode)
3949 struct btrfs_root *root = BTRFS_I(inode)->root;
3952 spin_lock(&root->inode_lock);
3953 if (!RB_EMPTY_NODE(&BTRFS_I(inode)->rb_node)) {
3954 rb_erase(&BTRFS_I(inode)->rb_node, &root->inode_tree);
3955 RB_CLEAR_NODE(&BTRFS_I(inode)->rb_node);
3956 empty = RB_EMPTY_ROOT(&root->inode_tree);
3958 spin_unlock(&root->inode_lock);
3961 * Free space cache has inodes in the tree root, but the tree root has a
3962 * root_refs of 0, so this could end up dropping the tree root as a
3963 * snapshot, so we need the extra !root->fs_info->tree_root check to
3964 * make sure we don't drop it.
3966 if (empty && btrfs_root_refs(&root->root_item) == 0 &&
3967 root != root->fs_info->tree_root) {
3968 synchronize_srcu(&root->fs_info->subvol_srcu);
3969 spin_lock(&root->inode_lock);
3970 empty = RB_EMPTY_ROOT(&root->inode_tree);
3971 spin_unlock(&root->inode_lock);
3973 btrfs_add_dead_root(root);
3977 int btrfs_invalidate_inodes(struct btrfs_root *root)
3979 struct rb_node *node;
3980 struct rb_node *prev;
3981 struct btrfs_inode *entry;
3982 struct inode *inode;
3985 WARN_ON(btrfs_root_refs(&root->root_item) != 0);
3987 spin_lock(&root->inode_lock);
3989 node = root->inode_tree.rb_node;
3993 entry = rb_entry(node, struct btrfs_inode, rb_node);
3995 if (objectid < entry->vfs_inode.i_ino)
3996 node = node->rb_left;
3997 else if (objectid > entry->vfs_inode.i_ino)
3998 node = node->rb_right;
4004 entry = rb_entry(prev, struct btrfs_inode, rb_node);
4005 if (objectid <= entry->vfs_inode.i_ino) {
4009 prev = rb_next(prev);
4013 entry = rb_entry(node, struct btrfs_inode, rb_node);
4014 objectid = entry->vfs_inode.i_ino + 1;
4015 inode = igrab(&entry->vfs_inode);
4017 spin_unlock(&root->inode_lock);
4018 if (atomic_read(&inode->i_count) > 1)
4019 d_prune_aliases(inode);
4021 * btrfs_drop_inode will have it removed from
4022 * the inode cache when its usage count
4027 spin_lock(&root->inode_lock);
4031 if (cond_resched_lock(&root->inode_lock))
4034 node = rb_next(node);
4036 spin_unlock(&root->inode_lock);
4040 static int btrfs_init_locked_inode(struct inode *inode, void *p)
4042 struct btrfs_iget_args *args = p;
4043 inode->i_ino = args->ino;
4044 BTRFS_I(inode)->root = args->root;
4045 btrfs_set_inode_space_info(args->root, inode);
4049 static int btrfs_find_actor(struct inode *inode, void *opaque)
4051 struct btrfs_iget_args *args = opaque;
4052 return args->ino == inode->i_ino &&
4053 args->root == BTRFS_I(inode)->root;
4056 static struct inode *btrfs_iget_locked(struct super_block *s,
4058 struct btrfs_root *root)
4060 struct inode *inode;
4061 struct btrfs_iget_args args;
4062 args.ino = objectid;
4065 inode = iget5_locked(s, objectid, btrfs_find_actor,
4066 btrfs_init_locked_inode,
4071 /* Get an inode object given its location and corresponding root.
4072 * Returns in *is_new if the inode was read from disk
4074 struct inode *btrfs_iget(struct super_block *s, struct btrfs_key *location,
4075 struct btrfs_root *root, int *new)
4077 struct inode *inode;
4079 inode = btrfs_iget_locked(s, location->objectid, root);
4081 return ERR_PTR(-ENOMEM);
4083 if (inode->i_state & I_NEW) {
4084 BTRFS_I(inode)->root = root;
4085 memcpy(&BTRFS_I(inode)->location, location, sizeof(*location));
4086 btrfs_read_locked_inode(inode);
4088 inode_tree_add(inode);
4089 unlock_new_inode(inode);
4097 static struct inode *new_simple_dir(struct super_block *s,
4098 struct btrfs_key *key,
4099 struct btrfs_root *root)
4101 struct inode *inode = new_inode(s);
4104 return ERR_PTR(-ENOMEM);
4106 BTRFS_I(inode)->root = root;
4107 memcpy(&BTRFS_I(inode)->location, key, sizeof(*key));
4108 BTRFS_I(inode)->dummy_inode = 1;
4110 inode->i_ino = BTRFS_EMPTY_SUBVOL_DIR_OBJECTID;
4111 inode->i_op = &simple_dir_inode_operations;
4112 inode->i_fop = &simple_dir_operations;
4113 inode->i_mode = S_IFDIR | S_IRUGO | S_IWUSR | S_IXUGO;
4114 inode->i_mtime = inode->i_atime = inode->i_ctime = CURRENT_TIME;
4119 struct inode *btrfs_lookup_dentry(struct inode *dir, struct dentry *dentry)
4121 struct inode *inode;
4122 struct btrfs_root *root = BTRFS_I(dir)->root;
4123 struct btrfs_root *sub_root = root;
4124 struct btrfs_key location;
4128 if (dentry->d_name.len > BTRFS_NAME_LEN)
4129 return ERR_PTR(-ENAMETOOLONG);
4131 ret = btrfs_inode_by_name(dir, dentry, &location);
4134 return ERR_PTR(ret);
4136 if (location.objectid == 0)
4139 if (location.type == BTRFS_INODE_ITEM_KEY) {
4140 inode = btrfs_iget(dir->i_sb, &location, root, NULL);
4144 BUG_ON(location.type != BTRFS_ROOT_ITEM_KEY);
4146 index = srcu_read_lock(&root->fs_info->subvol_srcu);
4147 ret = fixup_tree_root_location(root, dir, dentry,
4148 &location, &sub_root);
4151 inode = ERR_PTR(ret);
4153 inode = new_simple_dir(dir->i_sb, &location, sub_root);
4155 inode = btrfs_iget(dir->i_sb, &location, sub_root, NULL);
4157 srcu_read_unlock(&root->fs_info->subvol_srcu, index);
4159 if (!IS_ERR(inode) && root != sub_root) {
4160 down_read(&root->fs_info->cleanup_work_sem);
4161 if (!(inode->i_sb->s_flags & MS_RDONLY))
4162 ret = btrfs_orphan_cleanup(sub_root);
4163 up_read(&root->fs_info->cleanup_work_sem);
4165 inode = ERR_PTR(ret);
4171 static int btrfs_dentry_delete(const struct dentry *dentry)
4173 struct btrfs_root *root;
4175 if (!dentry->d_inode && !IS_ROOT(dentry))
4176 dentry = dentry->d_parent;
4178 if (dentry->d_inode) {
4179 root = BTRFS_I(dentry->d_inode)->root;
4180 if (btrfs_root_refs(&root->root_item) == 0)
4186 static struct dentry *btrfs_lookup(struct inode *dir, struct dentry *dentry,
4187 struct nameidata *nd)
4189 struct inode *inode;
4191 inode = btrfs_lookup_dentry(dir, dentry);
4193 return ERR_CAST(inode);
4195 return d_splice_alias(inode, dentry);
4198 static unsigned char btrfs_filetype_table[] = {
4199 DT_UNKNOWN, DT_REG, DT_DIR, DT_CHR, DT_BLK, DT_FIFO, DT_SOCK, DT_LNK
4202 static int btrfs_real_readdir(struct file *filp, void *dirent,
4205 struct inode *inode = filp->f_dentry->d_inode;
4206 struct btrfs_root *root = BTRFS_I(inode)->root;
4207 struct btrfs_item *item;
4208 struct btrfs_dir_item *di;
4209 struct btrfs_key key;
4210 struct btrfs_key found_key;
4211 struct btrfs_path *path;
4214 struct extent_buffer *leaf;
4217 unsigned char d_type;
4222 int key_type = BTRFS_DIR_INDEX_KEY;
4227 /* FIXME, use a real flag for deciding about the key type */
4228 if (root->fs_info->tree_root == root)
4229 key_type = BTRFS_DIR_ITEM_KEY;
4231 /* special case for "." */
4232 if (filp->f_pos == 0) {
4233 over = filldir(dirent, ".", 1,
4240 /* special case for .., just use the back ref */
4241 if (filp->f_pos == 1) {
4242 u64 pino = parent_ino(filp->f_path.dentry);
4243 over = filldir(dirent, "..", 2,
4249 path = btrfs_alloc_path();
4252 btrfs_set_key_type(&key, key_type);
4253 key.offset = filp->f_pos;
4254 key.objectid = inode->i_ino;
4256 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
4262 leaf = path->nodes[0];
4263 nritems = btrfs_header_nritems(leaf);
4264 slot = path->slots[0];
4265 if (advance || slot >= nritems) {
4266 if (slot >= nritems - 1) {
4267 ret = btrfs_next_leaf(root, path);
4270 leaf = path->nodes[0];
4271 nritems = btrfs_header_nritems(leaf);
4272 slot = path->slots[0];
4280 item = btrfs_item_nr(leaf, slot);
4281 btrfs_item_key_to_cpu(leaf, &found_key, slot);
4283 if (found_key.objectid != key.objectid)
4285 if (btrfs_key_type(&found_key) != key_type)
4287 if (found_key.offset < filp->f_pos)
4290 filp->f_pos = found_key.offset;
4292 di = btrfs_item_ptr(leaf, slot, struct btrfs_dir_item);
4294 di_total = btrfs_item_size(leaf, item);
4296 while (di_cur < di_total) {
4297 struct btrfs_key location;
4299 if (verify_dir_item(root, leaf, di))
4302 name_len = btrfs_dir_name_len(leaf, di);
4303 if (name_len <= sizeof(tmp_name)) {
4304 name_ptr = tmp_name;
4306 name_ptr = kmalloc(name_len, GFP_NOFS);
4312 read_extent_buffer(leaf, name_ptr,
4313 (unsigned long)(di + 1), name_len);
4315 d_type = btrfs_filetype_table[btrfs_dir_type(leaf, di)];
4316 btrfs_dir_item_key_to_cpu(leaf, di, &location);
4318 /* is this a reference to our own snapshot? If so
4321 if (location.type == BTRFS_ROOT_ITEM_KEY &&
4322 location.objectid == root->root_key.objectid) {
4326 over = filldir(dirent, name_ptr, name_len,
4327 found_key.offset, location.objectid,
4331 if (name_ptr != tmp_name)
4336 di_len = btrfs_dir_name_len(leaf, di) +
4337 btrfs_dir_data_len(leaf, di) + sizeof(*di);
4339 di = (struct btrfs_dir_item *)((char *)di + di_len);
4343 /* Reached end of directory/root. Bump pos past the last item. */
4344 if (key_type == BTRFS_DIR_INDEX_KEY)
4346 * 32-bit glibc will use getdents64, but then strtol -
4347 * so the last number we can serve is this.
4349 filp->f_pos = 0x7fffffff;
4355 btrfs_free_path(path);
4359 int btrfs_write_inode(struct inode *inode, struct writeback_control *wbc)
4361 struct btrfs_root *root = BTRFS_I(inode)->root;
4362 struct btrfs_trans_handle *trans;
4364 bool nolock = false;
4366 if (BTRFS_I(inode)->dummy_inode)
4370 nolock = (root->fs_info->closing && root == root->fs_info->tree_root);
4372 if (wbc->sync_mode == WB_SYNC_ALL) {
4374 trans = btrfs_join_transaction_nolock(root, 1);
4376 trans = btrfs_join_transaction(root, 1);
4378 return PTR_ERR(trans);
4379 btrfs_set_trans_block_group(trans, inode);
4381 ret = btrfs_end_transaction_nolock(trans, root);
4383 ret = btrfs_commit_transaction(trans, root);
4389 * This is somewhat expensive, updating the tree every time the
4390 * inode changes. But, it is most likely to find the inode in cache.
4391 * FIXME, needs more benchmarking...there are no reasons other than performance
4392 * to keep or drop this code.
4394 void btrfs_dirty_inode(struct inode *inode)
4396 struct btrfs_root *root = BTRFS_I(inode)->root;
4397 struct btrfs_trans_handle *trans;
4400 if (BTRFS_I(inode)->dummy_inode)
4403 trans = btrfs_join_transaction(root, 1);
4404 BUG_ON(IS_ERR(trans));
4405 btrfs_set_trans_block_group(trans, inode);
4407 ret = btrfs_update_inode(trans, root, inode);
4408 if (ret && ret == -ENOSPC) {
4409 /* whoops, lets try again with the full transaction */
4410 btrfs_end_transaction(trans, root);
4411 trans = btrfs_start_transaction(root, 1);
4412 if (IS_ERR(trans)) {
4413 if (printk_ratelimit()) {
4414 printk(KERN_ERR "btrfs: fail to "
4415 "dirty inode %lu error %ld\n",
4416 inode->i_ino, PTR_ERR(trans));
4420 btrfs_set_trans_block_group(trans, inode);
4422 ret = btrfs_update_inode(trans, root, inode);
4424 if (printk_ratelimit()) {
4425 printk(KERN_ERR "btrfs: fail to "
4426 "dirty inode %lu error %d\n",
4431 btrfs_end_transaction(trans, root);
4435 * find the highest existing sequence number in a directory
4436 * and then set the in-memory index_cnt variable to reflect
4437 * free sequence numbers
4439 static int btrfs_set_inode_index_count(struct inode *inode)
4441 struct btrfs_root *root = BTRFS_I(inode)->root;
4442 struct btrfs_key key, found_key;
4443 struct btrfs_path *path;
4444 struct extent_buffer *leaf;
4447 key.objectid = inode->i_ino;
4448 btrfs_set_key_type(&key, BTRFS_DIR_INDEX_KEY);
4449 key.offset = (u64)-1;
4451 path = btrfs_alloc_path();
4455 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
4458 /* FIXME: we should be able to handle this */
4464 * MAGIC NUMBER EXPLANATION:
4465 * since we search a directory based on f_pos we have to start at 2
4466 * since '.' and '..' have f_pos of 0 and 1 respectively, so everybody
4467 * else has to start at 2
4469 if (path->slots[0] == 0) {
4470 BTRFS_I(inode)->index_cnt = 2;
4476 leaf = path->nodes[0];
4477 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
4479 if (found_key.objectid != inode->i_ino ||
4480 btrfs_key_type(&found_key) != BTRFS_DIR_INDEX_KEY) {
4481 BTRFS_I(inode)->index_cnt = 2;
4485 BTRFS_I(inode)->index_cnt = found_key.offset + 1;
4487 btrfs_free_path(path);
4492 * helper to find a free sequence number in a given directory. This current
4493 * code is very simple, later versions will do smarter things in the btree
4495 int btrfs_set_inode_index(struct inode *dir, u64 *index)
4499 if (BTRFS_I(dir)->index_cnt == (u64)-1) {
4500 ret = btrfs_set_inode_index_count(dir);
4505 *index = BTRFS_I(dir)->index_cnt;
4506 BTRFS_I(dir)->index_cnt++;
4511 static struct inode *btrfs_new_inode(struct btrfs_trans_handle *trans,
4512 struct btrfs_root *root,
4514 const char *name, int name_len,
4515 u64 ref_objectid, u64 objectid,
4516 u64 alloc_hint, int mode, u64 *index)
4518 struct inode *inode;
4519 struct btrfs_inode_item *inode_item;
4520 struct btrfs_key *location;
4521 struct btrfs_path *path;
4522 struct btrfs_inode_ref *ref;
4523 struct btrfs_key key[2];
4529 path = btrfs_alloc_path();
4532 inode = new_inode(root->fs_info->sb);
4534 return ERR_PTR(-ENOMEM);
4537 trace_btrfs_inode_request(dir);
4539 ret = btrfs_set_inode_index(dir, index);
4542 return ERR_PTR(ret);
4546 * index_cnt is ignored for everything but a dir,
4547 * btrfs_get_inode_index_count has an explanation for the magic
4550 BTRFS_I(inode)->index_cnt = 2;
4551 BTRFS_I(inode)->root = root;
4552 BTRFS_I(inode)->generation = trans->transid;
4553 inode->i_generation = BTRFS_I(inode)->generation;
4554 btrfs_set_inode_space_info(root, inode);
4560 BTRFS_I(inode)->block_group =
4561 btrfs_find_block_group(root, 0, alloc_hint, owner);
4563 key[0].objectid = objectid;
4564 btrfs_set_key_type(&key[0], BTRFS_INODE_ITEM_KEY);
4567 key[1].objectid = objectid;
4568 btrfs_set_key_type(&key[1], BTRFS_INODE_REF_KEY);
4569 key[1].offset = ref_objectid;
4571 sizes[0] = sizeof(struct btrfs_inode_item);
4572 sizes[1] = name_len + sizeof(*ref);
4574 path->leave_spinning = 1;
4575 ret = btrfs_insert_empty_items(trans, root, path, key, sizes, 2);
4579 inode_init_owner(inode, dir, mode);
4580 inode->i_ino = objectid;
4581 inode_set_bytes(inode, 0);
4582 inode->i_mtime = inode->i_atime = inode->i_ctime = CURRENT_TIME;
4583 inode_item = btrfs_item_ptr(path->nodes[0], path->slots[0],
4584 struct btrfs_inode_item);
4585 fill_inode_item(trans, path->nodes[0], inode_item, inode);
4587 ref = btrfs_item_ptr(path->nodes[0], path->slots[0] + 1,
4588 struct btrfs_inode_ref);
4589 btrfs_set_inode_ref_name_len(path->nodes[0], ref, name_len);
4590 btrfs_set_inode_ref_index(path->nodes[0], ref, *index);
4591 ptr = (unsigned long)(ref + 1);
4592 write_extent_buffer(path->nodes[0], name, ptr, name_len);
4594 btrfs_mark_buffer_dirty(path->nodes[0]);
4595 btrfs_free_path(path);
4597 location = &BTRFS_I(inode)->location;
4598 location->objectid = objectid;
4599 location->offset = 0;
4600 btrfs_set_key_type(location, BTRFS_INODE_ITEM_KEY);
4602 btrfs_inherit_iflags(inode, dir);
4604 if ((mode & S_IFREG)) {
4605 if (btrfs_test_opt(root, NODATASUM))
4606 BTRFS_I(inode)->flags |= BTRFS_INODE_NODATASUM;
4607 if (btrfs_test_opt(root, NODATACOW) ||
4608 (BTRFS_I(dir)->flags & BTRFS_INODE_NODATACOW))
4609 BTRFS_I(inode)->flags |= BTRFS_INODE_NODATACOW;
4612 insert_inode_hash(inode);
4613 inode_tree_add(inode);
4615 trace_btrfs_inode_new(inode);
4620 BTRFS_I(dir)->index_cnt--;
4621 btrfs_free_path(path);
4623 return ERR_PTR(ret);
4626 static inline u8 btrfs_inode_type(struct inode *inode)
4628 return btrfs_type_by_mode[(inode->i_mode & S_IFMT) >> S_SHIFT];
4632 * utility function to add 'inode' into 'parent_inode' with
4633 * a give name and a given sequence number.
4634 * if 'add_backref' is true, also insert a backref from the
4635 * inode to the parent directory.
4637 int btrfs_add_link(struct btrfs_trans_handle *trans,
4638 struct inode *parent_inode, struct inode *inode,
4639 const char *name, int name_len, int add_backref, u64 index)
4642 struct btrfs_key key;
4643 struct btrfs_root *root = BTRFS_I(parent_inode)->root;
4645 if (unlikely(inode->i_ino == BTRFS_FIRST_FREE_OBJECTID)) {
4646 memcpy(&key, &BTRFS_I(inode)->root->root_key, sizeof(key));
4648 key.objectid = inode->i_ino;
4649 btrfs_set_key_type(&key, BTRFS_INODE_ITEM_KEY);
4653 if (unlikely(inode->i_ino == BTRFS_FIRST_FREE_OBJECTID)) {
4654 ret = btrfs_add_root_ref(trans, root->fs_info->tree_root,
4655 key.objectid, root->root_key.objectid,
4656 parent_inode->i_ino,
4657 index, name, name_len);
4658 } else if (add_backref) {
4659 ret = btrfs_insert_inode_ref(trans, root,
4660 name, name_len, inode->i_ino,
4661 parent_inode->i_ino, index);
4665 ret = btrfs_insert_dir_item(trans, root, name, name_len,
4666 parent_inode->i_ino, &key,
4667 btrfs_inode_type(inode), index);
4670 btrfs_i_size_write(parent_inode, parent_inode->i_size +
4672 parent_inode->i_mtime = parent_inode->i_ctime = CURRENT_TIME;
4673 ret = btrfs_update_inode(trans, root, parent_inode);
4678 static int btrfs_add_nondir(struct btrfs_trans_handle *trans,
4679 struct inode *dir, struct dentry *dentry,
4680 struct inode *inode, int backref, u64 index)
4682 int err = btrfs_add_link(trans, dir, inode,
4683 dentry->d_name.name, dentry->d_name.len,
4686 d_instantiate(dentry, inode);
4694 static int btrfs_mknod(struct inode *dir, struct dentry *dentry,
4695 int mode, dev_t rdev)
4697 struct btrfs_trans_handle *trans;
4698 struct btrfs_root *root = BTRFS_I(dir)->root;
4699 struct inode *inode = NULL;
4703 unsigned long nr = 0;
4706 if (!new_valid_dev(rdev))
4709 err = btrfs_find_free_objectid(NULL, root, dir->i_ino, &objectid);
4714 * 2 for inode item and ref
4716 * 1 for xattr if selinux is on
4718 trans = btrfs_start_transaction(root, 5);
4720 return PTR_ERR(trans);
4722 btrfs_set_trans_block_group(trans, dir);
4724 inode = btrfs_new_inode(trans, root, dir, dentry->d_name.name,
4725 dentry->d_name.len, dir->i_ino, objectid,
4726 BTRFS_I(dir)->block_group, mode, &index);
4727 err = PTR_ERR(inode);
4731 err = btrfs_init_inode_security(trans, inode, dir);
4737 btrfs_set_trans_block_group(trans, inode);
4738 err = btrfs_add_nondir(trans, dir, dentry, inode, 0, index);
4742 inode->i_op = &btrfs_special_inode_operations;
4743 init_special_inode(inode, inode->i_mode, rdev);
4744 btrfs_update_inode(trans, root, inode);
4746 btrfs_update_inode_block_group(trans, inode);
4747 btrfs_update_inode_block_group(trans, dir);
4749 nr = trans->blocks_used;
4750 btrfs_end_transaction_throttle(trans, root);
4751 btrfs_btree_balance_dirty(root, nr);
4753 inode_dec_link_count(inode);
4759 static int btrfs_create(struct inode *dir, struct dentry *dentry,
4760 int mode, struct nameidata *nd)
4762 struct btrfs_trans_handle *trans;
4763 struct btrfs_root *root = BTRFS_I(dir)->root;
4764 struct inode *inode = NULL;
4767 unsigned long nr = 0;
4771 err = btrfs_find_free_objectid(NULL, root, dir->i_ino, &objectid);
4775 * 2 for inode item and ref
4777 * 1 for xattr if selinux is on
4779 trans = btrfs_start_transaction(root, 5);
4781 return PTR_ERR(trans);
4783 btrfs_set_trans_block_group(trans, dir);
4785 inode = btrfs_new_inode(trans, root, dir, dentry->d_name.name,
4786 dentry->d_name.len, dir->i_ino, objectid,
4787 BTRFS_I(dir)->block_group, mode, &index);
4788 err = PTR_ERR(inode);
4792 err = btrfs_init_inode_security(trans, inode, dir);
4798 btrfs_set_trans_block_group(trans, inode);
4799 err = btrfs_add_nondir(trans, dir, dentry, inode, 0, index);
4803 inode->i_mapping->a_ops = &btrfs_aops;
4804 inode->i_mapping->backing_dev_info = &root->fs_info->bdi;
4805 inode->i_fop = &btrfs_file_operations;
4806 inode->i_op = &btrfs_file_inode_operations;
4807 BTRFS_I(inode)->io_tree.ops = &btrfs_extent_io_ops;
4809 btrfs_update_inode_block_group(trans, inode);
4810 btrfs_update_inode_block_group(trans, dir);
4812 nr = trans->blocks_used;
4813 btrfs_end_transaction_throttle(trans, root);
4815 inode_dec_link_count(inode);
4818 btrfs_btree_balance_dirty(root, nr);
4822 static int btrfs_link(struct dentry *old_dentry, struct inode *dir,
4823 struct dentry *dentry)
4825 struct btrfs_trans_handle *trans;
4826 struct btrfs_root *root = BTRFS_I(dir)->root;
4827 struct inode *inode = old_dentry->d_inode;
4829 unsigned long nr = 0;
4833 if (inode->i_nlink == 0)
4836 /* do not allow sys_link's with other subvols of the same device */
4837 if (root->objectid != BTRFS_I(inode)->root->objectid)
4840 if (inode->i_nlink == ~0U)
4843 btrfs_inc_nlink(inode);
4844 inode->i_ctime = CURRENT_TIME;
4846 err = btrfs_set_inode_index(dir, &index);
4851 * 2 items for inode and inode ref
4852 * 2 items for dir items
4853 * 1 item for parent inode
4855 trans = btrfs_start_transaction(root, 5);
4856 if (IS_ERR(trans)) {
4857 err = PTR_ERR(trans);
4861 btrfs_set_trans_block_group(trans, dir);
4864 err = btrfs_add_nondir(trans, dir, dentry, inode, 1, index);
4869 struct dentry *parent = dget_parent(dentry);
4870 btrfs_update_inode_block_group(trans, dir);
4871 err = btrfs_update_inode(trans, root, inode);
4873 btrfs_log_new_name(trans, inode, NULL, parent);
4877 nr = trans->blocks_used;
4878 btrfs_end_transaction_throttle(trans, root);
4881 inode_dec_link_count(inode);
4884 btrfs_btree_balance_dirty(root, nr);
4888 static int btrfs_mkdir(struct inode *dir, struct dentry *dentry, int mode)
4890 struct inode *inode = NULL;
4891 struct btrfs_trans_handle *trans;
4892 struct btrfs_root *root = BTRFS_I(dir)->root;
4894 int drop_on_err = 0;
4897 unsigned long nr = 1;
4899 err = btrfs_find_free_objectid(NULL, root, dir->i_ino, &objectid);
4904 * 2 items for inode and ref
4905 * 2 items for dir items
4906 * 1 for xattr if selinux is on
4908 trans = btrfs_start_transaction(root, 5);
4910 return PTR_ERR(trans);
4911 btrfs_set_trans_block_group(trans, dir);
4913 inode = btrfs_new_inode(trans, root, dir, dentry->d_name.name,
4914 dentry->d_name.len, dir->i_ino, objectid,
4915 BTRFS_I(dir)->block_group, S_IFDIR | mode,
4917 if (IS_ERR(inode)) {
4918 err = PTR_ERR(inode);
4924 err = btrfs_init_inode_security(trans, inode, dir);
4928 inode->i_op = &btrfs_dir_inode_operations;
4929 inode->i_fop = &btrfs_dir_file_operations;
4930 btrfs_set_trans_block_group(trans, inode);
4932 btrfs_i_size_write(inode, 0);
4933 err = btrfs_update_inode(trans, root, inode);
4937 err = btrfs_add_link(trans, dir, inode, dentry->d_name.name,
4938 dentry->d_name.len, 0, index);
4942 d_instantiate(dentry, inode);
4944 btrfs_update_inode_block_group(trans, inode);
4945 btrfs_update_inode_block_group(trans, dir);
4948 nr = trans->blocks_used;
4949 btrfs_end_transaction_throttle(trans, root);
4952 btrfs_btree_balance_dirty(root, nr);
4956 /* helper for btfs_get_extent. Given an existing extent in the tree,
4957 * and an extent that you want to insert, deal with overlap and insert
4958 * the new extent into the tree.
4960 static int merge_extent_mapping(struct extent_map_tree *em_tree,
4961 struct extent_map *existing,
4962 struct extent_map *em,
4963 u64 map_start, u64 map_len)
4967 BUG_ON(map_start < em->start || map_start >= extent_map_end(em));
4968 start_diff = map_start - em->start;
4969 em->start = map_start;
4971 if (em->block_start < EXTENT_MAP_LAST_BYTE &&
4972 !test_bit(EXTENT_FLAG_COMPRESSED, &em->flags)) {
4973 em->block_start += start_diff;
4974 em->block_len -= start_diff;
4976 return add_extent_mapping(em_tree, em);
4979 static noinline int uncompress_inline(struct btrfs_path *path,
4980 struct inode *inode, struct page *page,
4981 size_t pg_offset, u64 extent_offset,
4982 struct btrfs_file_extent_item *item)
4985 struct extent_buffer *leaf = path->nodes[0];
4988 unsigned long inline_size;
4992 WARN_ON(pg_offset != 0);
4993 compress_type = btrfs_file_extent_compression(leaf, item);
4994 max_size = btrfs_file_extent_ram_bytes(leaf, item);
4995 inline_size = btrfs_file_extent_inline_item_len(leaf,
4996 btrfs_item_nr(leaf, path->slots[0]));
4997 tmp = kmalloc(inline_size, GFP_NOFS);
4998 ptr = btrfs_file_extent_inline_start(item);
5000 read_extent_buffer(leaf, tmp, ptr, inline_size);
5002 max_size = min_t(unsigned long, PAGE_CACHE_SIZE, max_size);
5003 ret = btrfs_decompress(compress_type, tmp, page,
5004 extent_offset, inline_size, max_size);
5006 char *kaddr = kmap_atomic(page, KM_USER0);
5007 unsigned long copy_size = min_t(u64,
5008 PAGE_CACHE_SIZE - pg_offset,
5009 max_size - extent_offset);
5010 memset(kaddr + pg_offset, 0, copy_size);
5011 kunmap_atomic(kaddr, KM_USER0);
5018 * a bit scary, this does extent mapping from logical file offset to the disk.
5019 * the ugly parts come from merging extents from the disk with the in-ram
5020 * representation. This gets more complex because of the data=ordered code,
5021 * where the in-ram extents might be locked pending data=ordered completion.
5023 * This also copies inline extents directly into the page.
5026 struct extent_map *btrfs_get_extent(struct inode *inode, struct page *page,
5027 size_t pg_offset, u64 start, u64 len,
5033 u64 extent_start = 0;
5035 u64 objectid = inode->i_ino;
5037 struct btrfs_path *path = NULL;
5038 struct btrfs_root *root = BTRFS_I(inode)->root;
5039 struct btrfs_file_extent_item *item;
5040 struct extent_buffer *leaf;
5041 struct btrfs_key found_key;
5042 struct extent_map *em = NULL;
5043 struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree;
5044 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
5045 struct btrfs_trans_handle *trans = NULL;
5049 read_lock(&em_tree->lock);
5050 em = lookup_extent_mapping(em_tree, start, len);
5052 em->bdev = root->fs_info->fs_devices->latest_bdev;
5053 read_unlock(&em_tree->lock);
5056 if (em->start > start || em->start + em->len <= start)
5057 free_extent_map(em);
5058 else if (em->block_start == EXTENT_MAP_INLINE && page)
5059 free_extent_map(em);
5063 em = alloc_extent_map(GFP_NOFS);
5068 em->bdev = root->fs_info->fs_devices->latest_bdev;
5069 em->start = EXTENT_MAP_HOLE;
5070 em->orig_start = EXTENT_MAP_HOLE;
5072 em->block_len = (u64)-1;
5075 path = btrfs_alloc_path();
5079 ret = btrfs_lookup_file_extent(trans, root, path,
5080 objectid, start, trans != NULL);
5087 if (path->slots[0] == 0)
5092 leaf = path->nodes[0];
5093 item = btrfs_item_ptr(leaf, path->slots[0],
5094 struct btrfs_file_extent_item);
5095 /* are we inside the extent that was found? */
5096 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
5097 found_type = btrfs_key_type(&found_key);
5098 if (found_key.objectid != objectid ||
5099 found_type != BTRFS_EXTENT_DATA_KEY) {
5103 found_type = btrfs_file_extent_type(leaf, item);
5104 extent_start = found_key.offset;
5105 compress_type = btrfs_file_extent_compression(leaf, item);
5106 if (found_type == BTRFS_FILE_EXTENT_REG ||
5107 found_type == BTRFS_FILE_EXTENT_PREALLOC) {
5108 extent_end = extent_start +
5109 btrfs_file_extent_num_bytes(leaf, item);
5110 } else if (found_type == BTRFS_FILE_EXTENT_INLINE) {
5112 size = btrfs_file_extent_inline_len(leaf, item);
5113 extent_end = (extent_start + size + root->sectorsize - 1) &
5114 ~((u64)root->sectorsize - 1);
5117 if (start >= extent_end) {
5119 if (path->slots[0] >= btrfs_header_nritems(leaf)) {
5120 ret = btrfs_next_leaf(root, path);
5127 leaf = path->nodes[0];
5129 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
5130 if (found_key.objectid != objectid ||
5131 found_key.type != BTRFS_EXTENT_DATA_KEY)
5133 if (start + len <= found_key.offset)
5136 em->len = found_key.offset - start;
5140 if (found_type == BTRFS_FILE_EXTENT_REG ||
5141 found_type == BTRFS_FILE_EXTENT_PREALLOC) {
5142 em->start = extent_start;
5143 em->len = extent_end - extent_start;
5144 em->orig_start = extent_start -
5145 btrfs_file_extent_offset(leaf, item);
5146 bytenr = btrfs_file_extent_disk_bytenr(leaf, item);
5148 em->block_start = EXTENT_MAP_HOLE;
5151 if (compress_type != BTRFS_COMPRESS_NONE) {
5152 set_bit(EXTENT_FLAG_COMPRESSED, &em->flags);
5153 em->compress_type = compress_type;
5154 em->block_start = bytenr;
5155 em->block_len = btrfs_file_extent_disk_num_bytes(leaf,
5158 bytenr += btrfs_file_extent_offset(leaf, item);
5159 em->block_start = bytenr;
5160 em->block_len = em->len;
5161 if (found_type == BTRFS_FILE_EXTENT_PREALLOC)
5162 set_bit(EXTENT_FLAG_PREALLOC, &em->flags);
5165 } else if (found_type == BTRFS_FILE_EXTENT_INLINE) {
5169 size_t extent_offset;
5172 em->block_start = EXTENT_MAP_INLINE;
5173 if (!page || create) {
5174 em->start = extent_start;
5175 em->len = extent_end - extent_start;
5179 size = btrfs_file_extent_inline_len(leaf, item);
5180 extent_offset = page_offset(page) + pg_offset - extent_start;
5181 copy_size = min_t(u64, PAGE_CACHE_SIZE - pg_offset,
5182 size - extent_offset);
5183 em->start = extent_start + extent_offset;
5184 em->len = (copy_size + root->sectorsize - 1) &
5185 ~((u64)root->sectorsize - 1);
5186 em->orig_start = EXTENT_MAP_INLINE;
5187 if (compress_type) {
5188 set_bit(EXTENT_FLAG_COMPRESSED, &em->flags);
5189 em->compress_type = compress_type;
5191 ptr = btrfs_file_extent_inline_start(item) + extent_offset;
5192 if (create == 0 && !PageUptodate(page)) {
5193 if (btrfs_file_extent_compression(leaf, item) !=
5194 BTRFS_COMPRESS_NONE) {
5195 ret = uncompress_inline(path, inode, page,
5197 extent_offset, item);
5201 read_extent_buffer(leaf, map + pg_offset, ptr,
5203 if (pg_offset + copy_size < PAGE_CACHE_SIZE) {
5204 memset(map + pg_offset + copy_size, 0,
5205 PAGE_CACHE_SIZE - pg_offset -
5210 flush_dcache_page(page);
5211 } else if (create && PageUptodate(page)) {
5215 free_extent_map(em);
5217 btrfs_release_path(root, path);
5218 trans = btrfs_join_transaction(root, 1);
5220 return ERR_CAST(trans);
5224 write_extent_buffer(leaf, map + pg_offset, ptr,
5227 btrfs_mark_buffer_dirty(leaf);
5229 set_extent_uptodate(io_tree, em->start,
5230 extent_map_end(em) - 1, GFP_NOFS);
5233 printk(KERN_ERR "btrfs unknown found_type %d\n", found_type);
5240 em->block_start = EXTENT_MAP_HOLE;
5241 set_bit(EXTENT_FLAG_VACANCY, &em->flags);
5243 btrfs_release_path(root, path);
5244 if (em->start > start || extent_map_end(em) <= start) {
5245 printk(KERN_ERR "Btrfs: bad extent! em: [%llu %llu] passed "
5246 "[%llu %llu]\n", (unsigned long long)em->start,
5247 (unsigned long long)em->len,
5248 (unsigned long long)start,
5249 (unsigned long long)len);
5255 write_lock(&em_tree->lock);
5256 ret = add_extent_mapping(em_tree, em);
5257 /* it is possible that someone inserted the extent into the tree
5258 * while we had the lock dropped. It is also possible that
5259 * an overlapping map exists in the tree
5261 if (ret == -EEXIST) {
5262 struct extent_map *existing;
5266 existing = lookup_extent_mapping(em_tree, start, len);
5267 if (existing && (existing->start > start ||
5268 existing->start + existing->len <= start)) {
5269 free_extent_map(existing);
5273 existing = lookup_extent_mapping(em_tree, em->start,
5276 err = merge_extent_mapping(em_tree, existing,
5279 free_extent_map(existing);
5281 free_extent_map(em);
5286 free_extent_map(em);
5290 free_extent_map(em);
5295 write_unlock(&em_tree->lock);
5298 trace_btrfs_get_extent(root, em);
5301 btrfs_free_path(path);
5303 ret = btrfs_end_transaction(trans, root);
5308 free_extent_map(em);
5309 return ERR_PTR(err);
5314 struct extent_map *btrfs_get_extent_fiemap(struct inode *inode, struct page *page,
5315 size_t pg_offset, u64 start, u64 len,
5318 struct extent_map *em;
5319 struct extent_map *hole_em = NULL;
5320 u64 range_start = start;
5326 em = btrfs_get_extent(inode, page, pg_offset, start, len, create);
5331 * if our em maps to a hole, there might
5332 * actually be delalloc bytes behind it
5334 if (em->block_start != EXTENT_MAP_HOLE)
5340 /* check to see if we've wrapped (len == -1 or similar) */
5349 /* ok, we didn't find anything, lets look for delalloc */
5350 found = count_range_bits(&BTRFS_I(inode)->io_tree, &range_start,
5351 end, len, EXTENT_DELALLOC, 1);
5352 found_end = range_start + found;
5353 if (found_end < range_start)
5354 found_end = (u64)-1;
5357 * we didn't find anything useful, return
5358 * the original results from get_extent()
5360 if (range_start > end || found_end <= start) {
5366 /* adjust the range_start to make sure it doesn't
5367 * go backwards from the start they passed in
5369 range_start = max(start,range_start);
5370 found = found_end - range_start;
5373 u64 hole_start = start;
5376 em = alloc_extent_map(GFP_NOFS);
5382 * when btrfs_get_extent can't find anything it
5383 * returns one huge hole
5385 * make sure what it found really fits our range, and
5386 * adjust to make sure it is based on the start from
5390 u64 calc_end = extent_map_end(hole_em);
5392 if (calc_end <= start || (hole_em->start > end)) {
5393 free_extent_map(hole_em);
5396 hole_start = max(hole_em->start, start);
5397 hole_len = calc_end - hole_start;
5401 if (hole_em && range_start > hole_start) {
5402 /* our hole starts before our delalloc, so we
5403 * have to return just the parts of the hole
5404 * that go until the delalloc starts
5406 em->len = min(hole_len,
5407 range_start - hole_start);
5408 em->start = hole_start;
5409 em->orig_start = hole_start;
5411 * don't adjust block start at all,
5412 * it is fixed at EXTENT_MAP_HOLE
5414 em->block_start = hole_em->block_start;
5415 em->block_len = hole_len;
5417 em->start = range_start;
5419 em->orig_start = range_start;
5420 em->block_start = EXTENT_MAP_DELALLOC;
5421 em->block_len = found;
5423 } else if (hole_em) {
5428 free_extent_map(hole_em);
5430 free_extent_map(em);
5431 return ERR_PTR(err);
5436 static struct extent_map *btrfs_new_extent_direct(struct inode *inode,
5439 struct btrfs_root *root = BTRFS_I(inode)->root;
5440 struct btrfs_trans_handle *trans;
5441 struct extent_map *em;
5442 struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree;
5443 struct btrfs_key ins;
5447 btrfs_drop_extent_cache(inode, start, start + len - 1, 0);
5449 trans = btrfs_join_transaction(root, 0);
5451 return ERR_CAST(trans);
5453 trans->block_rsv = &root->fs_info->delalloc_block_rsv;
5455 alloc_hint = get_extent_allocation_hint(inode, start, len);
5456 ret = btrfs_reserve_extent(trans, root, len, root->sectorsize, 0,
5457 alloc_hint, (u64)-1, &ins, 1);
5463 em = alloc_extent_map(GFP_NOFS);
5465 em = ERR_PTR(-ENOMEM);
5470 em->orig_start = em->start;
5471 em->len = ins.offset;
5473 em->block_start = ins.objectid;
5474 em->block_len = ins.offset;
5475 em->bdev = root->fs_info->fs_devices->latest_bdev;
5476 set_bit(EXTENT_FLAG_PINNED, &em->flags);
5479 write_lock(&em_tree->lock);
5480 ret = add_extent_mapping(em_tree, em);
5481 write_unlock(&em_tree->lock);
5484 btrfs_drop_extent_cache(inode, start, start + em->len - 1, 0);
5487 ret = btrfs_add_ordered_extent_dio(inode, start, ins.objectid,
5488 ins.offset, ins.offset, 0);
5490 btrfs_free_reserved_extent(root, ins.objectid, ins.offset);
5494 btrfs_end_transaction(trans, root);
5499 * returns 1 when the nocow is safe, < 1 on error, 0 if the
5500 * block must be cow'd
5502 static noinline int can_nocow_odirect(struct btrfs_trans_handle *trans,
5503 struct inode *inode, u64 offset, u64 len)
5505 struct btrfs_path *path;
5507 struct extent_buffer *leaf;
5508 struct btrfs_root *root = BTRFS_I(inode)->root;
5509 struct btrfs_file_extent_item *fi;
5510 struct btrfs_key key;
5518 path = btrfs_alloc_path();
5522 ret = btrfs_lookup_file_extent(trans, root, path, inode->i_ino,
5527 slot = path->slots[0];
5530 /* can't find the item, must cow */
5537 leaf = path->nodes[0];
5538 btrfs_item_key_to_cpu(leaf, &key, slot);
5539 if (key.objectid != inode->i_ino ||
5540 key.type != BTRFS_EXTENT_DATA_KEY) {
5541 /* not our file or wrong item type, must cow */
5545 if (key.offset > offset) {
5546 /* Wrong offset, must cow */
5550 fi = btrfs_item_ptr(leaf, slot, struct btrfs_file_extent_item);
5551 found_type = btrfs_file_extent_type(leaf, fi);
5552 if (found_type != BTRFS_FILE_EXTENT_REG &&
5553 found_type != BTRFS_FILE_EXTENT_PREALLOC) {
5554 /* not a regular extent, must cow */
5557 disk_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi);
5558 backref_offset = btrfs_file_extent_offset(leaf, fi);
5560 extent_end = key.offset + btrfs_file_extent_num_bytes(leaf, fi);
5561 if (extent_end < offset + len) {
5562 /* extent doesn't include our full range, must cow */
5566 if (btrfs_extent_readonly(root, disk_bytenr))
5570 * look for other files referencing this extent, if we
5571 * find any we must cow
5573 if (btrfs_cross_ref_exist(trans, root, inode->i_ino,
5574 key.offset - backref_offset, disk_bytenr))
5578 * adjust disk_bytenr and num_bytes to cover just the bytes
5579 * in this extent we are about to write. If there
5580 * are any csums in that range we have to cow in order
5581 * to keep the csums correct
5583 disk_bytenr += backref_offset;
5584 disk_bytenr += offset - key.offset;
5585 num_bytes = min(offset + len, extent_end) - offset;
5586 if (csum_exist_in_range(root, disk_bytenr, num_bytes))
5589 * all of the above have passed, it is safe to overwrite this extent
5594 btrfs_free_path(path);
5598 static int btrfs_get_blocks_direct(struct inode *inode, sector_t iblock,
5599 struct buffer_head *bh_result, int create)
5601 struct extent_map *em;
5602 struct btrfs_root *root = BTRFS_I(inode)->root;
5603 u64 start = iblock << inode->i_blkbits;
5604 u64 len = bh_result->b_size;
5605 struct btrfs_trans_handle *trans;
5607 em = btrfs_get_extent(inode, NULL, 0, start, len, 0);
5612 * Ok for INLINE and COMPRESSED extents we need to fallback on buffered
5613 * io. INLINE is special, and we could probably kludge it in here, but
5614 * it's still buffered so for safety lets just fall back to the generic
5617 * For COMPRESSED we _have_ to read the entire extent in so we can
5618 * decompress it, so there will be buffering required no matter what we
5619 * do, so go ahead and fallback to buffered.
5621 * We return -ENOTBLK because thats what makes DIO go ahead and go back
5622 * to buffered IO. Don't blame me, this is the price we pay for using
5625 if (test_bit(EXTENT_FLAG_COMPRESSED, &em->flags) ||
5626 em->block_start == EXTENT_MAP_INLINE) {
5627 free_extent_map(em);
5631 /* Just a good old fashioned hole, return */
5632 if (!create && (em->block_start == EXTENT_MAP_HOLE ||
5633 test_bit(EXTENT_FLAG_PREALLOC, &em->flags))) {
5634 free_extent_map(em);
5635 /* DIO will do one hole at a time, so just unlock a sector */
5636 unlock_extent(&BTRFS_I(inode)->io_tree, start,
5637 start + root->sectorsize - 1, GFP_NOFS);
5642 * We don't allocate a new extent in the following cases
5644 * 1) The inode is marked as NODATACOW. In this case we'll just use the
5646 * 2) The extent is marked as PREALLOC. We're good to go here and can
5647 * just use the extent.
5651 len = em->len - (start - em->start);
5655 if (test_bit(EXTENT_FLAG_PREALLOC, &em->flags) ||
5656 ((BTRFS_I(inode)->flags & BTRFS_INODE_NODATACOW) &&
5657 em->block_start != EXTENT_MAP_HOLE)) {
5662 if (test_bit(EXTENT_FLAG_PREALLOC, &em->flags))
5663 type = BTRFS_ORDERED_PREALLOC;
5665 type = BTRFS_ORDERED_NOCOW;
5666 len = min(len, em->len - (start - em->start));
5667 block_start = em->block_start + (start - em->start);
5670 * we're not going to log anything, but we do need
5671 * to make sure the current transaction stays open
5672 * while we look for nocow cross refs
5674 trans = btrfs_join_transaction(root, 0);
5678 if (can_nocow_odirect(trans, inode, start, len) == 1) {
5679 ret = btrfs_add_ordered_extent_dio(inode, start,
5680 block_start, len, len, type);
5681 btrfs_end_transaction(trans, root);
5683 free_extent_map(em);
5688 btrfs_end_transaction(trans, root);
5692 * this will cow the extent, reset the len in case we changed
5695 len = bh_result->b_size;
5696 free_extent_map(em);
5697 em = btrfs_new_extent_direct(inode, start, len);
5700 len = min(len, em->len - (start - em->start));
5702 clear_extent_bit(&BTRFS_I(inode)->io_tree, start, start + len - 1,
5703 EXTENT_LOCKED | EXTENT_DELALLOC | EXTENT_DIRTY, 1,
5706 bh_result->b_blocknr = (em->block_start + (start - em->start)) >>
5708 bh_result->b_size = len;
5709 bh_result->b_bdev = em->bdev;
5710 set_buffer_mapped(bh_result);
5711 if (create && !test_bit(EXTENT_FLAG_PREALLOC, &em->flags))
5712 set_buffer_new(bh_result);
5714 free_extent_map(em);
5719 struct btrfs_dio_private {
5720 struct inode *inode;
5727 /* number of bios pending for this dio */
5728 atomic_t pending_bios;
5733 struct bio *orig_bio;
5736 static void btrfs_endio_direct_read(struct bio *bio, int err)
5738 struct btrfs_dio_private *dip = bio->bi_private;
5739 struct bio_vec *bvec_end = bio->bi_io_vec + bio->bi_vcnt - 1;
5740 struct bio_vec *bvec = bio->bi_io_vec;
5741 struct inode *inode = dip->inode;
5742 struct btrfs_root *root = BTRFS_I(inode)->root;
5744 u32 *private = dip->csums;
5746 start = dip->logical_offset;
5748 if (!(BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM)) {
5749 struct page *page = bvec->bv_page;
5752 unsigned long flags;
5754 local_irq_save(flags);
5755 kaddr = kmap_atomic(page, KM_IRQ0);
5756 csum = btrfs_csum_data(root, kaddr + bvec->bv_offset,
5757 csum, bvec->bv_len);
5758 btrfs_csum_final(csum, (char *)&csum);
5759 kunmap_atomic(kaddr, KM_IRQ0);
5760 local_irq_restore(flags);
5762 flush_dcache_page(bvec->bv_page);
5763 if (csum != *private) {
5764 printk(KERN_ERR "btrfs csum failed ino %lu off"
5765 " %llu csum %u private %u\n",
5766 inode->i_ino, (unsigned long long)start,
5772 start += bvec->bv_len;
5775 } while (bvec <= bvec_end);
5777 unlock_extent(&BTRFS_I(inode)->io_tree, dip->logical_offset,
5778 dip->logical_offset + dip->bytes - 1, GFP_NOFS);
5779 bio->bi_private = dip->private;
5784 /* If we had a csum failure make sure to clear the uptodate flag */
5786 clear_bit(BIO_UPTODATE, &bio->bi_flags);
5787 dio_end_io(bio, err);
5790 static void btrfs_endio_direct_write(struct bio *bio, int err)
5792 struct btrfs_dio_private *dip = bio->bi_private;
5793 struct inode *inode = dip->inode;
5794 struct btrfs_root *root = BTRFS_I(inode)->root;
5795 struct btrfs_trans_handle *trans;
5796 struct btrfs_ordered_extent *ordered = NULL;
5797 struct extent_state *cached_state = NULL;
5798 u64 ordered_offset = dip->logical_offset;
5799 u64 ordered_bytes = dip->bytes;
5805 ret = btrfs_dec_test_first_ordered_pending(inode, &ordered,
5813 trans = btrfs_join_transaction(root, 1);
5814 if (IS_ERR(trans)) {
5818 trans->block_rsv = &root->fs_info->delalloc_block_rsv;
5820 if (test_bit(BTRFS_ORDERED_NOCOW, &ordered->flags)) {
5821 ret = btrfs_ordered_update_i_size(inode, 0, ordered);
5823 ret = btrfs_update_inode(trans, root, inode);
5828 lock_extent_bits(&BTRFS_I(inode)->io_tree, ordered->file_offset,
5829 ordered->file_offset + ordered->len - 1, 0,
5830 &cached_state, GFP_NOFS);
5832 if (test_bit(BTRFS_ORDERED_PREALLOC, &ordered->flags)) {
5833 ret = btrfs_mark_extent_written(trans, inode,
5834 ordered->file_offset,
5835 ordered->file_offset +
5842 ret = insert_reserved_file_extent(trans, inode,
5843 ordered->file_offset,
5849 BTRFS_FILE_EXTENT_REG);
5850 unpin_extent_cache(&BTRFS_I(inode)->extent_tree,
5851 ordered->file_offset, ordered->len);
5859 add_pending_csums(trans, inode, ordered->file_offset, &ordered->list);
5860 btrfs_ordered_update_i_size(inode, 0, ordered);
5861 btrfs_update_inode(trans, root, inode);
5863 unlock_extent_cached(&BTRFS_I(inode)->io_tree, ordered->file_offset,
5864 ordered->file_offset + ordered->len - 1,
5865 &cached_state, GFP_NOFS);
5867 btrfs_delalloc_release_metadata(inode, ordered->len);
5868 btrfs_end_transaction(trans, root);
5869 ordered_offset = ordered->file_offset + ordered->len;
5870 btrfs_put_ordered_extent(ordered);
5871 btrfs_put_ordered_extent(ordered);
5875 * our bio might span multiple ordered extents. If we haven't
5876 * completed the accounting for the whole dio, go back and try again
5878 if (ordered_offset < dip->logical_offset + dip->bytes) {
5879 ordered_bytes = dip->logical_offset + dip->bytes -
5884 bio->bi_private = dip->private;
5889 /* If we had an error make sure to clear the uptodate flag */
5891 clear_bit(BIO_UPTODATE, &bio->bi_flags);
5892 dio_end_io(bio, err);
5895 static int __btrfs_submit_bio_start_direct_io(struct inode *inode, int rw,
5896 struct bio *bio, int mirror_num,
5897 unsigned long bio_flags, u64 offset)
5900 struct btrfs_root *root = BTRFS_I(inode)->root;
5901 ret = btrfs_csum_one_bio(root, inode, bio, offset, 1);
5906 static void btrfs_end_dio_bio(struct bio *bio, int err)
5908 struct btrfs_dio_private *dip = bio->bi_private;
5911 printk(KERN_ERR "btrfs direct IO failed ino %lu rw %lu "
5912 "sector %#Lx len %u err no %d\n",
5913 dip->inode->i_ino, bio->bi_rw,
5914 (unsigned long long)bio->bi_sector, bio->bi_size, err);
5918 * before atomic variable goto zero, we must make sure
5919 * dip->errors is perceived to be set.
5921 smp_mb__before_atomic_dec();
5924 /* if there are more bios still pending for this dio, just exit */
5925 if (!atomic_dec_and_test(&dip->pending_bios))
5929 bio_io_error(dip->orig_bio);
5931 set_bit(BIO_UPTODATE, &dip->orig_bio->bi_flags);
5932 bio_endio(dip->orig_bio, 0);
5938 static struct bio *btrfs_dio_bio_alloc(struct block_device *bdev,
5939 u64 first_sector, gfp_t gfp_flags)
5941 int nr_vecs = bio_get_nr_vecs(bdev);
5942 return btrfs_bio_alloc(bdev, first_sector, nr_vecs, gfp_flags);
5945 static inline int __btrfs_submit_dio_bio(struct bio *bio, struct inode *inode,
5946 int rw, u64 file_offset, int skip_sum,
5949 int write = rw & REQ_WRITE;
5950 struct btrfs_root *root = BTRFS_I(inode)->root;
5954 ret = btrfs_bio_wq_end_io(root->fs_info, bio, 0);
5958 if (write && !skip_sum) {
5959 ret = btrfs_wq_submit_bio(root->fs_info,
5960 inode, rw, bio, 0, 0,
5962 __btrfs_submit_bio_start_direct_io,
5963 __btrfs_submit_bio_done);
5965 } else if (!skip_sum) {
5966 ret = btrfs_lookup_bio_sums_dio(root, inode, bio,
5967 file_offset, csums);
5972 ret = btrfs_map_bio(root, rw, bio, 0, 1);
5978 static int btrfs_submit_direct_hook(int rw, struct btrfs_dio_private *dip,
5981 struct inode *inode = dip->inode;
5982 struct btrfs_root *root = BTRFS_I(inode)->root;
5983 struct btrfs_mapping_tree *map_tree = &root->fs_info->mapping_tree;
5985 struct bio *orig_bio = dip->orig_bio;
5986 struct bio_vec *bvec = orig_bio->bi_io_vec;
5987 u64 start_sector = orig_bio->bi_sector;
5988 u64 file_offset = dip->logical_offset;
5992 u32 *csums = dip->csums;
5994 int write = rw & REQ_WRITE;
5996 bio = btrfs_dio_bio_alloc(orig_bio->bi_bdev, start_sector, GFP_NOFS);
5999 bio->bi_private = dip;
6000 bio->bi_end_io = btrfs_end_dio_bio;
6001 atomic_inc(&dip->pending_bios);
6003 map_length = orig_bio->bi_size;
6004 ret = btrfs_map_block(map_tree, READ, start_sector << 9,
6005 &map_length, NULL, 0);
6011 while (bvec <= (orig_bio->bi_io_vec + orig_bio->bi_vcnt - 1)) {
6012 if (unlikely(map_length < submit_len + bvec->bv_len ||
6013 bio_add_page(bio, bvec->bv_page, bvec->bv_len,
6014 bvec->bv_offset) < bvec->bv_len)) {
6016 * inc the count before we submit the bio so
6017 * we know the end IO handler won't happen before
6018 * we inc the count. Otherwise, the dip might get freed
6019 * before we're done setting it up
6021 atomic_inc(&dip->pending_bios);
6022 ret = __btrfs_submit_dio_bio(bio, inode, rw,
6023 file_offset, skip_sum,
6027 atomic_dec(&dip->pending_bios);
6031 /* Write's use the ordered csums */
6032 if (!write && !skip_sum)
6033 csums = csums + nr_pages;
6034 start_sector += submit_len >> 9;
6035 file_offset += submit_len;
6040 bio = btrfs_dio_bio_alloc(orig_bio->bi_bdev,
6041 start_sector, GFP_NOFS);
6044 bio->bi_private = dip;
6045 bio->bi_end_io = btrfs_end_dio_bio;
6047 map_length = orig_bio->bi_size;
6048 ret = btrfs_map_block(map_tree, READ, start_sector << 9,
6049 &map_length, NULL, 0);
6055 submit_len += bvec->bv_len;
6061 ret = __btrfs_submit_dio_bio(bio, inode, rw, file_offset, skip_sum,
6070 * before atomic variable goto zero, we must
6071 * make sure dip->errors is perceived to be set.
6073 smp_mb__before_atomic_dec();
6074 if (atomic_dec_and_test(&dip->pending_bios))
6075 bio_io_error(dip->orig_bio);
6077 /* bio_end_io() will handle error, so we needn't return it */
6081 static void btrfs_submit_direct(int rw, struct bio *bio, struct inode *inode,
6084 struct btrfs_root *root = BTRFS_I(inode)->root;
6085 struct btrfs_dio_private *dip;
6086 struct bio_vec *bvec = bio->bi_io_vec;
6088 int write = rw & REQ_WRITE;
6091 skip_sum = BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM;
6093 dip = kmalloc(sizeof(*dip), GFP_NOFS);
6100 /* Write's use the ordered csum stuff, so we don't need dip->csums */
6101 if (!write && !skip_sum) {
6102 dip->csums = kmalloc(sizeof(u32) * bio->bi_vcnt, GFP_NOFS);
6110 dip->private = bio->bi_private;
6112 dip->logical_offset = file_offset;
6116 dip->bytes += bvec->bv_len;
6118 } while (bvec <= (bio->bi_io_vec + bio->bi_vcnt - 1));
6120 dip->disk_bytenr = (u64)bio->bi_sector << 9;
6121 bio->bi_private = dip;
6123 dip->orig_bio = bio;
6124 atomic_set(&dip->pending_bios, 0);
6127 bio->bi_end_io = btrfs_endio_direct_write;
6129 bio->bi_end_io = btrfs_endio_direct_read;
6131 ret = btrfs_submit_direct_hook(rw, dip, skip_sum);
6136 * If this is a write, we need to clean up the reserved space and kill
6137 * the ordered extent.
6140 struct btrfs_ordered_extent *ordered;
6141 ordered = btrfs_lookup_ordered_extent(inode, file_offset);
6142 if (!test_bit(BTRFS_ORDERED_PREALLOC, &ordered->flags) &&
6143 !test_bit(BTRFS_ORDERED_NOCOW, &ordered->flags))
6144 btrfs_free_reserved_extent(root, ordered->start,
6146 btrfs_put_ordered_extent(ordered);
6147 btrfs_put_ordered_extent(ordered);
6149 bio_endio(bio, ret);
6152 static ssize_t check_direct_IO(struct btrfs_root *root, int rw, struct kiocb *iocb,
6153 const struct iovec *iov, loff_t offset,
6154 unsigned long nr_segs)
6159 unsigned blocksize_mask = root->sectorsize - 1;
6160 ssize_t retval = -EINVAL;
6161 loff_t end = offset;
6163 if (offset & blocksize_mask)
6166 /* Check the memory alignment. Blocks cannot straddle pages */
6167 for (seg = 0; seg < nr_segs; seg++) {
6168 addr = (unsigned long)iov[seg].iov_base;
6169 size = iov[seg].iov_len;
6171 if ((addr & blocksize_mask) || (size & blocksize_mask))
6178 static ssize_t btrfs_direct_IO(int rw, struct kiocb *iocb,
6179 const struct iovec *iov, loff_t offset,
6180 unsigned long nr_segs)
6182 struct file *file = iocb->ki_filp;
6183 struct inode *inode = file->f_mapping->host;
6184 struct btrfs_ordered_extent *ordered;
6185 struct extent_state *cached_state = NULL;
6186 u64 lockstart, lockend;
6188 int writing = rw & WRITE;
6190 size_t count = iov_length(iov, nr_segs);
6192 if (check_direct_IO(BTRFS_I(inode)->root, rw, iocb, iov,
6198 lockend = offset + count - 1;
6201 ret = btrfs_delalloc_reserve_space(inode, count);
6207 lock_extent_bits(&BTRFS_I(inode)->io_tree, lockstart, lockend,
6208 0, &cached_state, GFP_NOFS);
6210 * We're concerned with the entire range that we're going to be
6211 * doing DIO to, so we need to make sure theres no ordered
6212 * extents in this range.
6214 ordered = btrfs_lookup_ordered_range(inode, lockstart,
6215 lockend - lockstart + 1);
6218 unlock_extent_cached(&BTRFS_I(inode)->io_tree, lockstart, lockend,
6219 &cached_state, GFP_NOFS);
6220 btrfs_start_ordered_extent(inode, ordered, 1);
6221 btrfs_put_ordered_extent(ordered);
6226 * we don't use btrfs_set_extent_delalloc because we don't want
6227 * the dirty or uptodate bits
6230 write_bits = EXTENT_DELALLOC | EXTENT_DO_ACCOUNTING;
6231 ret = set_extent_bit(&BTRFS_I(inode)->io_tree, lockstart, lockend,
6232 EXTENT_DELALLOC, 0, NULL, &cached_state,
6235 clear_extent_bit(&BTRFS_I(inode)->io_tree, lockstart,
6236 lockend, EXTENT_LOCKED | write_bits,
6237 1, 0, &cached_state, GFP_NOFS);
6242 free_extent_state(cached_state);
6243 cached_state = NULL;
6245 ret = __blockdev_direct_IO(rw, iocb, inode,
6246 BTRFS_I(inode)->root->fs_info->fs_devices->latest_bdev,
6247 iov, offset, nr_segs, btrfs_get_blocks_direct, NULL,
6248 btrfs_submit_direct, 0);
6250 if (ret < 0 && ret != -EIOCBQUEUED) {
6251 clear_extent_bit(&BTRFS_I(inode)->io_tree, offset,
6252 offset + iov_length(iov, nr_segs) - 1,
6253 EXTENT_LOCKED | write_bits, 1, 0,
6254 &cached_state, GFP_NOFS);
6255 } else if (ret >= 0 && ret < iov_length(iov, nr_segs)) {
6257 * We're falling back to buffered, unlock the section we didn't
6260 clear_extent_bit(&BTRFS_I(inode)->io_tree, offset + ret,
6261 offset + iov_length(iov, nr_segs) - 1,
6262 EXTENT_LOCKED | write_bits, 1, 0,
6263 &cached_state, GFP_NOFS);
6266 free_extent_state(cached_state);
6270 static int btrfs_fiemap(struct inode *inode, struct fiemap_extent_info *fieinfo,
6271 __u64 start, __u64 len)
6273 return extent_fiemap(inode, fieinfo, start, len, btrfs_get_extent_fiemap);
6276 int btrfs_readpage(struct file *file, struct page *page)
6278 struct extent_io_tree *tree;
6279 tree = &BTRFS_I(page->mapping->host)->io_tree;
6280 return extent_read_full_page(tree, page, btrfs_get_extent);
6283 static int btrfs_writepage(struct page *page, struct writeback_control *wbc)
6285 struct extent_io_tree *tree;
6288 if (current->flags & PF_MEMALLOC) {
6289 redirty_page_for_writepage(wbc, page);
6293 tree = &BTRFS_I(page->mapping->host)->io_tree;
6294 return extent_write_full_page(tree, page, btrfs_get_extent, wbc);
6297 int btrfs_writepages(struct address_space *mapping,
6298 struct writeback_control *wbc)
6300 struct extent_io_tree *tree;
6302 tree = &BTRFS_I(mapping->host)->io_tree;
6303 return extent_writepages(tree, mapping, btrfs_get_extent, wbc);
6307 btrfs_readpages(struct file *file, struct address_space *mapping,
6308 struct list_head *pages, unsigned nr_pages)
6310 struct extent_io_tree *tree;
6311 tree = &BTRFS_I(mapping->host)->io_tree;
6312 return extent_readpages(tree, mapping, pages, nr_pages,
6315 static int __btrfs_releasepage(struct page *page, gfp_t gfp_flags)
6317 struct extent_io_tree *tree;
6318 struct extent_map_tree *map;
6321 tree = &BTRFS_I(page->mapping->host)->io_tree;
6322 map = &BTRFS_I(page->mapping->host)->extent_tree;
6323 ret = try_release_extent_mapping(map, tree, page, gfp_flags);
6325 ClearPagePrivate(page);
6326 set_page_private(page, 0);
6327 page_cache_release(page);
6332 static int btrfs_releasepage(struct page *page, gfp_t gfp_flags)
6334 if (PageWriteback(page) || PageDirty(page))
6336 return __btrfs_releasepage(page, gfp_flags & GFP_NOFS);
6339 static void btrfs_invalidatepage(struct page *page, unsigned long offset)
6341 struct extent_io_tree *tree;
6342 struct btrfs_ordered_extent *ordered;
6343 struct extent_state *cached_state = NULL;
6344 u64 page_start = page_offset(page);
6345 u64 page_end = page_start + PAGE_CACHE_SIZE - 1;
6349 * we have the page locked, so new writeback can't start,
6350 * and the dirty bit won't be cleared while we are here.
6352 * Wait for IO on this page so that we can safely clear
6353 * the PagePrivate2 bit and do ordered accounting
6355 wait_on_page_writeback(page);
6357 tree = &BTRFS_I(page->mapping->host)->io_tree;
6359 btrfs_releasepage(page, GFP_NOFS);
6362 lock_extent_bits(tree, page_start, page_end, 0, &cached_state,
6364 ordered = btrfs_lookup_ordered_extent(page->mapping->host,
6368 * IO on this page will never be started, so we need
6369 * to account for any ordered extents now
6371 clear_extent_bit(tree, page_start, page_end,
6372 EXTENT_DIRTY | EXTENT_DELALLOC |
6373 EXTENT_LOCKED | EXTENT_DO_ACCOUNTING, 1, 0,
6374 &cached_state, GFP_NOFS);
6376 * whoever cleared the private bit is responsible
6377 * for the finish_ordered_io
6379 if (TestClearPagePrivate2(page)) {
6380 btrfs_finish_ordered_io(page->mapping->host,
6381 page_start, page_end);
6383 btrfs_put_ordered_extent(ordered);
6384 cached_state = NULL;
6385 lock_extent_bits(tree, page_start, page_end, 0, &cached_state,
6388 clear_extent_bit(tree, page_start, page_end,
6389 EXTENT_LOCKED | EXTENT_DIRTY | EXTENT_DELALLOC |
6390 EXTENT_DO_ACCOUNTING, 1, 1, &cached_state, GFP_NOFS);
6391 __btrfs_releasepage(page, GFP_NOFS);
6393 ClearPageChecked(page);
6394 if (PagePrivate(page)) {
6395 ClearPagePrivate(page);
6396 set_page_private(page, 0);
6397 page_cache_release(page);
6402 * btrfs_page_mkwrite() is not allowed to change the file size as it gets
6403 * called from a page fault handler when a page is first dirtied. Hence we must
6404 * be careful to check for EOF conditions here. We set the page up correctly
6405 * for a written page which means we get ENOSPC checking when writing into
6406 * holes and correct delalloc and unwritten extent mapping on filesystems that
6407 * support these features.
6409 * We are not allowed to take the i_mutex here so we have to play games to
6410 * protect against truncate races as the page could now be beyond EOF. Because
6411 * vmtruncate() writes the inode size before removing pages, once we have the
6412 * page lock we can determine safely if the page is beyond EOF. If it is not
6413 * beyond EOF, then the page is guaranteed safe against truncation until we
6416 int btrfs_page_mkwrite(struct vm_area_struct *vma, struct vm_fault *vmf)
6418 struct page *page = vmf->page;
6419 struct inode *inode = fdentry(vma->vm_file)->d_inode;
6420 struct btrfs_root *root = BTRFS_I(inode)->root;
6421 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
6422 struct btrfs_ordered_extent *ordered;
6423 struct extent_state *cached_state = NULL;
6425 unsigned long zero_start;
6431 ret = btrfs_delalloc_reserve_space(inode, PAGE_CACHE_SIZE);
6435 else /* -ENOSPC, -EIO, etc */
6436 ret = VM_FAULT_SIGBUS;
6440 ret = VM_FAULT_NOPAGE; /* make the VM retry the fault */
6443 size = i_size_read(inode);
6444 page_start = page_offset(page);
6445 page_end = page_start + PAGE_CACHE_SIZE - 1;
6447 if ((page->mapping != inode->i_mapping) ||
6448 (page_start >= size)) {
6449 /* page got truncated out from underneath us */
6452 wait_on_page_writeback(page);
6454 lock_extent_bits(io_tree, page_start, page_end, 0, &cached_state,
6456 set_page_extent_mapped(page);
6459 * we can't set the delalloc bits if there are pending ordered
6460 * extents. Drop our locks and wait for them to finish
6462 ordered = btrfs_lookup_ordered_extent(inode, page_start);
6464 unlock_extent_cached(io_tree, page_start, page_end,
6465 &cached_state, GFP_NOFS);
6467 btrfs_start_ordered_extent(inode, ordered, 1);
6468 btrfs_put_ordered_extent(ordered);
6473 * XXX - page_mkwrite gets called every time the page is dirtied, even
6474 * if it was already dirty, so for space accounting reasons we need to
6475 * clear any delalloc bits for the range we are fixing to save. There
6476 * is probably a better way to do this, but for now keep consistent with
6477 * prepare_pages in the normal write path.
6479 clear_extent_bit(&BTRFS_I(inode)->io_tree, page_start, page_end,
6480 EXTENT_DIRTY | EXTENT_DELALLOC | EXTENT_DO_ACCOUNTING,
6481 0, 0, &cached_state, GFP_NOFS);
6483 ret = btrfs_set_extent_delalloc(inode, page_start, page_end,
6486 unlock_extent_cached(io_tree, page_start, page_end,
6487 &cached_state, GFP_NOFS);
6488 ret = VM_FAULT_SIGBUS;
6493 /* page is wholly or partially inside EOF */
6494 if (page_start + PAGE_CACHE_SIZE > size)
6495 zero_start = size & ~PAGE_CACHE_MASK;
6497 zero_start = PAGE_CACHE_SIZE;
6499 if (zero_start != PAGE_CACHE_SIZE) {
6501 memset(kaddr + zero_start, 0, PAGE_CACHE_SIZE - zero_start);
6502 flush_dcache_page(page);
6505 ClearPageChecked(page);
6506 set_page_dirty(page);
6507 SetPageUptodate(page);
6509 BTRFS_I(inode)->last_trans = root->fs_info->generation;
6510 BTRFS_I(inode)->last_sub_trans = BTRFS_I(inode)->root->log_transid;
6512 unlock_extent_cached(io_tree, page_start, page_end, &cached_state, GFP_NOFS);
6516 return VM_FAULT_LOCKED;
6518 btrfs_delalloc_release_space(inode, PAGE_CACHE_SIZE);
6523 static int btrfs_truncate(struct inode *inode)
6525 struct btrfs_root *root = BTRFS_I(inode)->root;
6528 struct btrfs_trans_handle *trans;
6530 u64 mask = root->sectorsize - 1;
6532 ret = btrfs_truncate_page(inode->i_mapping, inode->i_size);
6536 btrfs_wait_ordered_range(inode, inode->i_size & (~mask), (u64)-1);
6537 btrfs_ordered_update_i_size(inode, inode->i_size, NULL);
6539 trans = btrfs_start_transaction(root, 5);
6541 return PTR_ERR(trans);
6543 btrfs_set_trans_block_group(trans, inode);
6545 ret = btrfs_orphan_add(trans, inode);
6547 btrfs_end_transaction(trans, root);
6551 nr = trans->blocks_used;
6552 btrfs_end_transaction(trans, root);
6553 btrfs_btree_balance_dirty(root, nr);
6555 /* Now start a transaction for the truncate */
6556 trans = btrfs_start_transaction(root, 0);
6558 return PTR_ERR(trans);
6559 btrfs_set_trans_block_group(trans, inode);
6560 trans->block_rsv = root->orphan_block_rsv;
6563 * setattr is responsible for setting the ordered_data_close flag,
6564 * but that is only tested during the last file release. That
6565 * could happen well after the next commit, leaving a great big
6566 * window where new writes may get lost if someone chooses to write
6567 * to this file after truncating to zero
6569 * The inode doesn't have any dirty data here, and so if we commit
6570 * this is a noop. If someone immediately starts writing to the inode
6571 * it is very likely we'll catch some of their writes in this
6572 * transaction, and the commit will find this file on the ordered
6573 * data list with good things to send down.
6575 * This is a best effort solution, there is still a window where
6576 * using truncate to replace the contents of the file will
6577 * end up with a zero length file after a crash.
6579 if (inode->i_size == 0 && BTRFS_I(inode)->ordered_data_close)
6580 btrfs_add_ordered_operation(trans, root, inode);
6584 trans = btrfs_start_transaction(root, 0);
6586 return PTR_ERR(trans);
6587 btrfs_set_trans_block_group(trans, inode);
6588 trans->block_rsv = root->orphan_block_rsv;
6591 ret = btrfs_block_rsv_check(trans, root,
6592 root->orphan_block_rsv, 0, 5);
6593 if (ret == -EAGAIN) {
6594 ret = btrfs_commit_transaction(trans, root);
6604 ret = btrfs_truncate_inode_items(trans, root, inode,
6606 BTRFS_EXTENT_DATA_KEY);
6607 if (ret != -EAGAIN) {
6612 ret = btrfs_update_inode(trans, root, inode);
6618 nr = trans->blocks_used;
6619 btrfs_end_transaction(trans, root);
6621 btrfs_btree_balance_dirty(root, nr);
6624 if (ret == 0 && inode->i_nlink > 0) {
6625 ret = btrfs_orphan_del(trans, inode);
6628 } else if (ret && inode->i_nlink > 0) {
6630 * Failed to do the truncate, remove us from the in memory
6633 ret = btrfs_orphan_del(NULL, inode);
6636 ret = btrfs_update_inode(trans, root, inode);
6640 nr = trans->blocks_used;
6641 ret = btrfs_end_transaction_throttle(trans, root);
6644 btrfs_btree_balance_dirty(root, nr);
6650 * create a new subvolume directory/inode (helper for the ioctl).
6652 int btrfs_create_subvol_root(struct btrfs_trans_handle *trans,
6653 struct btrfs_root *new_root,
6654 u64 new_dirid, u64 alloc_hint)
6656 struct inode *inode;
6660 inode = btrfs_new_inode(trans, new_root, NULL, "..", 2, new_dirid,
6661 new_dirid, alloc_hint, S_IFDIR | 0700, &index);
6663 return PTR_ERR(inode);
6664 inode->i_op = &btrfs_dir_inode_operations;
6665 inode->i_fop = &btrfs_dir_file_operations;
6668 btrfs_i_size_write(inode, 0);
6670 err = btrfs_update_inode(trans, new_root, inode);
6677 /* helper function for file defrag and space balancing. This
6678 * forces readahead on a given range of bytes in an inode
6680 unsigned long btrfs_force_ra(struct address_space *mapping,
6681 struct file_ra_state *ra, struct file *file,
6682 pgoff_t offset, pgoff_t last_index)
6684 pgoff_t req_size = last_index - offset + 1;
6686 page_cache_sync_readahead(mapping, ra, file, offset, req_size);
6687 return offset + req_size;
6690 struct inode *btrfs_alloc_inode(struct super_block *sb)
6692 struct btrfs_inode *ei;
6693 struct inode *inode;
6695 ei = kmem_cache_alloc(btrfs_inode_cachep, GFP_NOFS);
6700 ei->space_info = NULL;
6704 ei->last_sub_trans = 0;
6705 ei->logged_trans = 0;
6706 ei->delalloc_bytes = 0;
6707 ei->reserved_bytes = 0;
6708 ei->disk_i_size = 0;
6710 ei->index_cnt = (u64)-1;
6711 ei->last_unlink_trans = 0;
6713 atomic_set(&ei->outstanding_extents, 0);
6714 atomic_set(&ei->reserved_extents, 0);
6716 ei->ordered_data_close = 0;
6717 ei->orphan_meta_reserved = 0;
6718 ei->dummy_inode = 0;
6719 ei->force_compress = BTRFS_COMPRESS_NONE;
6721 inode = &ei->vfs_inode;
6722 extent_map_tree_init(&ei->extent_tree, GFP_NOFS);
6723 extent_io_tree_init(&ei->io_tree, &inode->i_data, GFP_NOFS);
6724 extent_io_tree_init(&ei->io_failure_tree, &inode->i_data, GFP_NOFS);
6725 mutex_init(&ei->log_mutex);
6726 btrfs_ordered_inode_tree_init(&ei->ordered_tree);
6727 INIT_LIST_HEAD(&ei->i_orphan);
6728 INIT_LIST_HEAD(&ei->delalloc_inodes);
6729 INIT_LIST_HEAD(&ei->ordered_operations);
6730 RB_CLEAR_NODE(&ei->rb_node);
6735 static void btrfs_i_callback(struct rcu_head *head)
6737 struct inode *inode = container_of(head, struct inode, i_rcu);
6738 INIT_LIST_HEAD(&inode->i_dentry);
6739 kmem_cache_free(btrfs_inode_cachep, BTRFS_I(inode));
6742 void btrfs_destroy_inode(struct inode *inode)
6744 struct btrfs_ordered_extent *ordered;
6745 struct btrfs_root *root = BTRFS_I(inode)->root;
6747 WARN_ON(!list_empty(&inode->i_dentry));
6748 WARN_ON(inode->i_data.nrpages);
6749 WARN_ON(atomic_read(&BTRFS_I(inode)->outstanding_extents));
6750 WARN_ON(atomic_read(&BTRFS_I(inode)->reserved_extents));
6753 * This can happen where we create an inode, but somebody else also
6754 * created the same inode and we need to destroy the one we already
6761 * Make sure we're properly removed from the ordered operation
6765 if (!list_empty(&BTRFS_I(inode)->ordered_operations)) {
6766 spin_lock(&root->fs_info->ordered_extent_lock);
6767 list_del_init(&BTRFS_I(inode)->ordered_operations);
6768 spin_unlock(&root->fs_info->ordered_extent_lock);
6771 if (root == root->fs_info->tree_root) {
6772 struct btrfs_block_group_cache *block_group;
6774 block_group = btrfs_lookup_block_group(root->fs_info,
6775 BTRFS_I(inode)->block_group);
6776 if (block_group && block_group->inode == inode) {
6777 spin_lock(&block_group->lock);
6778 block_group->inode = NULL;
6779 spin_unlock(&block_group->lock);
6780 btrfs_put_block_group(block_group);
6781 } else if (block_group) {
6782 btrfs_put_block_group(block_group);
6786 spin_lock(&root->orphan_lock);
6787 if (!list_empty(&BTRFS_I(inode)->i_orphan)) {
6788 printk(KERN_INFO "BTRFS: inode %lu still on the orphan list\n",
6790 list_del_init(&BTRFS_I(inode)->i_orphan);
6792 spin_unlock(&root->orphan_lock);
6795 ordered = btrfs_lookup_first_ordered_extent(inode, (u64)-1);
6799 printk(KERN_ERR "btrfs found ordered "
6800 "extent %llu %llu on inode cleanup\n",
6801 (unsigned long long)ordered->file_offset,
6802 (unsigned long long)ordered->len);
6803 btrfs_remove_ordered_extent(inode, ordered);
6804 btrfs_put_ordered_extent(ordered);
6805 btrfs_put_ordered_extent(ordered);
6808 inode_tree_del(inode);
6809 btrfs_drop_extent_cache(inode, 0, (u64)-1, 0);
6811 call_rcu(&inode->i_rcu, btrfs_i_callback);
6814 int btrfs_drop_inode(struct inode *inode)
6816 struct btrfs_root *root = BTRFS_I(inode)->root;
6818 if (btrfs_root_refs(&root->root_item) == 0 &&
6819 root != root->fs_info->tree_root)
6822 return generic_drop_inode(inode);
6825 static void init_once(void *foo)
6827 struct btrfs_inode *ei = (struct btrfs_inode *) foo;
6829 inode_init_once(&ei->vfs_inode);
6832 void btrfs_destroy_cachep(void)
6834 if (btrfs_inode_cachep)
6835 kmem_cache_destroy(btrfs_inode_cachep);
6836 if (btrfs_trans_handle_cachep)
6837 kmem_cache_destroy(btrfs_trans_handle_cachep);
6838 if (btrfs_transaction_cachep)
6839 kmem_cache_destroy(btrfs_transaction_cachep);
6840 if (btrfs_path_cachep)
6841 kmem_cache_destroy(btrfs_path_cachep);
6842 if (btrfs_free_space_cachep)
6843 kmem_cache_destroy(btrfs_free_space_cachep);
6846 int btrfs_init_cachep(void)
6848 btrfs_inode_cachep = kmem_cache_create("btrfs_inode_cache",
6849 sizeof(struct btrfs_inode), 0,
6850 SLAB_RECLAIM_ACCOUNT | SLAB_MEM_SPREAD, init_once);
6851 if (!btrfs_inode_cachep)
6854 btrfs_trans_handle_cachep = kmem_cache_create("btrfs_trans_handle_cache",
6855 sizeof(struct btrfs_trans_handle), 0,
6856 SLAB_RECLAIM_ACCOUNT | SLAB_MEM_SPREAD, NULL);
6857 if (!btrfs_trans_handle_cachep)
6860 btrfs_transaction_cachep = kmem_cache_create("btrfs_transaction_cache",
6861 sizeof(struct btrfs_transaction), 0,
6862 SLAB_RECLAIM_ACCOUNT | SLAB_MEM_SPREAD, NULL);
6863 if (!btrfs_transaction_cachep)
6866 btrfs_path_cachep = kmem_cache_create("btrfs_path_cache",
6867 sizeof(struct btrfs_path), 0,
6868 SLAB_RECLAIM_ACCOUNT | SLAB_MEM_SPREAD, NULL);
6869 if (!btrfs_path_cachep)
6872 btrfs_free_space_cachep = kmem_cache_create("btrfs_free_space_cache",
6873 sizeof(struct btrfs_free_space), 0,
6874 SLAB_RECLAIM_ACCOUNT | SLAB_MEM_SPREAD, NULL);
6875 if (!btrfs_free_space_cachep)
6880 btrfs_destroy_cachep();
6884 static int btrfs_getattr(struct vfsmount *mnt,
6885 struct dentry *dentry, struct kstat *stat)
6887 struct inode *inode = dentry->d_inode;
6888 generic_fillattr(inode, stat);
6889 stat->dev = BTRFS_I(inode)->root->anon_super.s_dev;
6890 stat->blksize = PAGE_CACHE_SIZE;
6891 stat->blocks = (inode_get_bytes(inode) +
6892 BTRFS_I(inode)->delalloc_bytes) >> 9;
6897 * If a file is moved, it will inherit the cow and compression flags of the new
6900 static void fixup_inode_flags(struct inode *dir, struct inode *inode)
6902 struct btrfs_inode *b_dir = BTRFS_I(dir);
6903 struct btrfs_inode *b_inode = BTRFS_I(inode);
6905 if (b_dir->flags & BTRFS_INODE_NODATACOW)
6906 b_inode->flags |= BTRFS_INODE_NODATACOW;
6908 b_inode->flags &= ~BTRFS_INODE_NODATACOW;
6910 if (b_dir->flags & BTRFS_INODE_COMPRESS)
6911 b_inode->flags |= BTRFS_INODE_COMPRESS;
6913 b_inode->flags &= ~BTRFS_INODE_COMPRESS;
6916 static int btrfs_rename(struct inode *old_dir, struct dentry *old_dentry,
6917 struct inode *new_dir, struct dentry *new_dentry)
6919 struct btrfs_trans_handle *trans;
6920 struct btrfs_root *root = BTRFS_I(old_dir)->root;
6921 struct btrfs_root *dest = BTRFS_I(new_dir)->root;
6922 struct inode *new_inode = new_dentry->d_inode;
6923 struct inode *old_inode = old_dentry->d_inode;
6924 struct timespec ctime = CURRENT_TIME;
6929 if (new_dir->i_ino == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID)
6932 /* we only allow rename subvolume link between subvolumes */
6933 if (old_inode->i_ino != BTRFS_FIRST_FREE_OBJECTID && root != dest)
6936 if (old_inode->i_ino == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID ||
6937 (new_inode && new_inode->i_ino == BTRFS_FIRST_FREE_OBJECTID))
6940 if (S_ISDIR(old_inode->i_mode) && new_inode &&
6941 new_inode->i_size > BTRFS_EMPTY_DIR_SIZE)
6944 * we're using rename to replace one file with another.
6945 * and the replacement file is large. Start IO on it now so
6946 * we don't add too much work to the end of the transaction
6948 if (new_inode && S_ISREG(old_inode->i_mode) && new_inode->i_size &&
6949 old_inode->i_size > BTRFS_ORDERED_OPERATIONS_FLUSH_LIMIT)
6950 filemap_flush(old_inode->i_mapping);
6952 /* close the racy window with snapshot create/destroy ioctl */
6953 if (old_inode->i_ino == BTRFS_FIRST_FREE_OBJECTID)
6954 down_read(&root->fs_info->subvol_sem);
6956 * We want to reserve the absolute worst case amount of items. So if
6957 * both inodes are subvols and we need to unlink them then that would
6958 * require 4 item modifications, but if they are both normal inodes it
6959 * would require 5 item modifications, so we'll assume their normal
6960 * inodes. So 5 * 2 is 10, plus 1 for the new link, so 11 total items
6961 * should cover the worst case number of items we'll modify.
6963 trans = btrfs_start_transaction(root, 20);
6965 return PTR_ERR(trans);
6967 btrfs_set_trans_block_group(trans, new_dir);
6970 btrfs_record_root_in_trans(trans, dest);
6972 ret = btrfs_set_inode_index(new_dir, &index);
6976 if (unlikely(old_inode->i_ino == BTRFS_FIRST_FREE_OBJECTID)) {
6977 /* force full log commit if subvolume involved. */
6978 root->fs_info->last_trans_log_full_commit = trans->transid;
6980 ret = btrfs_insert_inode_ref(trans, dest,
6981 new_dentry->d_name.name,
6982 new_dentry->d_name.len,
6984 new_dir->i_ino, index);
6988 * this is an ugly little race, but the rename is required
6989 * to make sure that if we crash, the inode is either at the
6990 * old name or the new one. pinning the log transaction lets
6991 * us make sure we don't allow a log commit to come in after
6992 * we unlink the name but before we add the new name back in.
6994 btrfs_pin_log_trans(root);
6997 * make sure the inode gets flushed if it is replacing
7000 if (new_inode && new_inode->i_size &&
7001 old_inode && S_ISREG(old_inode->i_mode)) {
7002 btrfs_add_ordered_operation(trans, root, old_inode);
7005 old_dir->i_ctime = old_dir->i_mtime = ctime;
7006 new_dir->i_ctime = new_dir->i_mtime = ctime;
7007 old_inode->i_ctime = ctime;
7009 if (old_dentry->d_parent != new_dentry->d_parent)
7010 btrfs_record_unlink_dir(trans, old_dir, old_inode, 1);
7012 if (unlikely(old_inode->i_ino == BTRFS_FIRST_FREE_OBJECTID)) {
7013 root_objectid = BTRFS_I(old_inode)->root->root_key.objectid;
7014 ret = btrfs_unlink_subvol(trans, root, old_dir, root_objectid,
7015 old_dentry->d_name.name,
7016 old_dentry->d_name.len);
7018 ret = __btrfs_unlink_inode(trans, root, old_dir,
7019 old_dentry->d_inode,
7020 old_dentry->d_name.name,
7021 old_dentry->d_name.len);
7023 ret = btrfs_update_inode(trans, root, old_inode);
7028 new_inode->i_ctime = CURRENT_TIME;
7029 if (unlikely(new_inode->i_ino ==
7030 BTRFS_EMPTY_SUBVOL_DIR_OBJECTID)) {
7031 root_objectid = BTRFS_I(new_inode)->location.objectid;
7032 ret = btrfs_unlink_subvol(trans, dest, new_dir,
7034 new_dentry->d_name.name,
7035 new_dentry->d_name.len);
7036 BUG_ON(new_inode->i_nlink == 0);
7038 ret = btrfs_unlink_inode(trans, dest, new_dir,
7039 new_dentry->d_inode,
7040 new_dentry->d_name.name,
7041 new_dentry->d_name.len);
7044 if (new_inode->i_nlink == 0) {
7045 ret = btrfs_orphan_add(trans, new_dentry->d_inode);
7050 fixup_inode_flags(new_dir, old_inode);
7052 ret = btrfs_add_link(trans, new_dir, old_inode,
7053 new_dentry->d_name.name,
7054 new_dentry->d_name.len, 0, index);
7057 if (old_inode->i_ino != BTRFS_FIRST_FREE_OBJECTID) {
7058 struct dentry *parent = dget_parent(new_dentry);
7059 btrfs_log_new_name(trans, old_inode, old_dir, parent);
7061 btrfs_end_log_trans(root);
7064 btrfs_end_transaction_throttle(trans, root);
7066 if (old_inode->i_ino == BTRFS_FIRST_FREE_OBJECTID)
7067 up_read(&root->fs_info->subvol_sem);
7073 * some fairly slow code that needs optimization. This walks the list
7074 * of all the inodes with pending delalloc and forces them to disk.
7076 int btrfs_start_delalloc_inodes(struct btrfs_root *root, int delay_iput)
7078 struct list_head *head = &root->fs_info->delalloc_inodes;
7079 struct btrfs_inode *binode;
7080 struct inode *inode;
7082 if (root->fs_info->sb->s_flags & MS_RDONLY)
7085 spin_lock(&root->fs_info->delalloc_lock);
7086 while (!list_empty(head)) {
7087 binode = list_entry(head->next, struct btrfs_inode,
7089 inode = igrab(&binode->vfs_inode);
7091 list_del_init(&binode->delalloc_inodes);
7092 spin_unlock(&root->fs_info->delalloc_lock);
7094 filemap_flush(inode->i_mapping);
7096 btrfs_add_delayed_iput(inode);
7101 spin_lock(&root->fs_info->delalloc_lock);
7103 spin_unlock(&root->fs_info->delalloc_lock);
7105 /* the filemap_flush will queue IO into the worker threads, but
7106 * we have to make sure the IO is actually started and that
7107 * ordered extents get created before we return
7109 atomic_inc(&root->fs_info->async_submit_draining);
7110 while (atomic_read(&root->fs_info->nr_async_submits) ||
7111 atomic_read(&root->fs_info->async_delalloc_pages)) {
7112 wait_event(root->fs_info->async_submit_wait,
7113 (atomic_read(&root->fs_info->nr_async_submits) == 0 &&
7114 atomic_read(&root->fs_info->async_delalloc_pages) == 0));
7116 atomic_dec(&root->fs_info->async_submit_draining);
7120 int btrfs_start_one_delalloc_inode(struct btrfs_root *root, int delay_iput,
7123 struct btrfs_inode *binode;
7124 struct inode *inode = NULL;
7126 spin_lock(&root->fs_info->delalloc_lock);
7127 while (!list_empty(&root->fs_info->delalloc_inodes)) {
7128 binode = list_entry(root->fs_info->delalloc_inodes.next,
7129 struct btrfs_inode, delalloc_inodes);
7130 inode = igrab(&binode->vfs_inode);
7132 list_move_tail(&binode->delalloc_inodes,
7133 &root->fs_info->delalloc_inodes);
7137 list_del_init(&binode->delalloc_inodes);
7138 cond_resched_lock(&root->fs_info->delalloc_lock);
7140 spin_unlock(&root->fs_info->delalloc_lock);
7144 filemap_write_and_wait(inode->i_mapping);
7146 * We have to do this because compression doesn't
7147 * actually set PG_writeback until it submits the pages
7148 * for IO, which happens in an async thread, so we could
7149 * race and not actually wait for any writeback pages
7150 * because they've not been submitted yet. Technically
7151 * this could still be the case for the ordered stuff
7152 * since the async thread may not have started to do its
7153 * work yet. If this becomes the case then we need to
7154 * figure out a way to make sure that in writepage we
7155 * wait for any async pages to be submitted before
7156 * returning so that fdatawait does what its supposed to
7159 btrfs_wait_ordered_range(inode, 0, (u64)-1);
7161 filemap_flush(inode->i_mapping);
7164 btrfs_add_delayed_iput(inode);
7172 static int btrfs_symlink(struct inode *dir, struct dentry *dentry,
7173 const char *symname)
7175 struct btrfs_trans_handle *trans;
7176 struct btrfs_root *root = BTRFS_I(dir)->root;
7177 struct btrfs_path *path;
7178 struct btrfs_key key;
7179 struct inode *inode = NULL;
7187 struct btrfs_file_extent_item *ei;
7188 struct extent_buffer *leaf;
7189 unsigned long nr = 0;
7191 name_len = strlen(symname) + 1;
7192 if (name_len > BTRFS_MAX_INLINE_DATA_SIZE(root))
7193 return -ENAMETOOLONG;
7195 err = btrfs_find_free_objectid(NULL, root, dir->i_ino, &objectid);
7199 * 2 items for inode item and ref
7200 * 2 items for dir items
7201 * 1 item for xattr if selinux is on
7203 trans = btrfs_start_transaction(root, 5);
7205 return PTR_ERR(trans);
7207 btrfs_set_trans_block_group(trans, dir);
7209 inode = btrfs_new_inode(trans, root, dir, dentry->d_name.name,
7210 dentry->d_name.len, dir->i_ino, objectid,
7211 BTRFS_I(dir)->block_group, S_IFLNK|S_IRWXUGO,
7213 err = PTR_ERR(inode);
7217 err = btrfs_init_inode_security(trans, inode, dir);
7223 btrfs_set_trans_block_group(trans, inode);
7224 err = btrfs_add_nondir(trans, dir, dentry, inode, 0, index);
7228 inode->i_mapping->a_ops = &btrfs_aops;
7229 inode->i_mapping->backing_dev_info = &root->fs_info->bdi;
7230 inode->i_fop = &btrfs_file_operations;
7231 inode->i_op = &btrfs_file_inode_operations;
7232 BTRFS_I(inode)->io_tree.ops = &btrfs_extent_io_ops;
7234 btrfs_update_inode_block_group(trans, inode);
7235 btrfs_update_inode_block_group(trans, dir);
7239 path = btrfs_alloc_path();
7241 key.objectid = inode->i_ino;
7243 btrfs_set_key_type(&key, BTRFS_EXTENT_DATA_KEY);
7244 datasize = btrfs_file_extent_calc_inline_size(name_len);
7245 err = btrfs_insert_empty_item(trans, root, path, &key,
7251 leaf = path->nodes[0];
7252 ei = btrfs_item_ptr(leaf, path->slots[0],
7253 struct btrfs_file_extent_item);
7254 btrfs_set_file_extent_generation(leaf, ei, trans->transid);
7255 btrfs_set_file_extent_type(leaf, ei,
7256 BTRFS_FILE_EXTENT_INLINE);
7257 btrfs_set_file_extent_encryption(leaf, ei, 0);
7258 btrfs_set_file_extent_compression(leaf, ei, 0);
7259 btrfs_set_file_extent_other_encoding(leaf, ei, 0);
7260 btrfs_set_file_extent_ram_bytes(leaf, ei, name_len);
7262 ptr = btrfs_file_extent_inline_start(ei);
7263 write_extent_buffer(leaf, symname, ptr, name_len);
7264 btrfs_mark_buffer_dirty(leaf);
7265 btrfs_free_path(path);
7267 inode->i_op = &btrfs_symlink_inode_operations;
7268 inode->i_mapping->a_ops = &btrfs_symlink_aops;
7269 inode->i_mapping->backing_dev_info = &root->fs_info->bdi;
7270 inode_set_bytes(inode, name_len);
7271 btrfs_i_size_write(inode, name_len - 1);
7272 err = btrfs_update_inode(trans, root, inode);
7277 nr = trans->blocks_used;
7278 btrfs_end_transaction_throttle(trans, root);
7280 inode_dec_link_count(inode);
7283 btrfs_btree_balance_dirty(root, nr);
7287 static int __btrfs_prealloc_file_range(struct inode *inode, int mode,
7288 u64 start, u64 num_bytes, u64 min_size,
7289 loff_t actual_len, u64 *alloc_hint,
7290 struct btrfs_trans_handle *trans)
7292 struct btrfs_root *root = BTRFS_I(inode)->root;
7293 struct btrfs_key ins;
7294 u64 cur_offset = start;
7297 bool own_trans = true;
7301 while (num_bytes > 0) {
7303 trans = btrfs_start_transaction(root, 3);
7304 if (IS_ERR(trans)) {
7305 ret = PTR_ERR(trans);
7310 ret = btrfs_reserve_extent(trans, root, num_bytes, min_size,
7311 0, *alloc_hint, (u64)-1, &ins, 1);
7314 btrfs_end_transaction(trans, root);
7318 ret = insert_reserved_file_extent(trans, inode,
7319 cur_offset, ins.objectid,
7320 ins.offset, ins.offset,
7321 ins.offset, 0, 0, 0,
7322 BTRFS_FILE_EXTENT_PREALLOC);
7324 btrfs_drop_extent_cache(inode, cur_offset,
7325 cur_offset + ins.offset -1, 0);
7327 num_bytes -= ins.offset;
7328 cur_offset += ins.offset;
7329 *alloc_hint = ins.objectid + ins.offset;
7331 inode->i_ctime = CURRENT_TIME;
7332 BTRFS_I(inode)->flags |= BTRFS_INODE_PREALLOC;
7333 if (!(mode & FALLOC_FL_KEEP_SIZE) &&
7334 (actual_len > inode->i_size) &&
7335 (cur_offset > inode->i_size)) {
7336 if (cur_offset > actual_len)
7337 i_size = actual_len;
7339 i_size = cur_offset;
7340 i_size_write(inode, i_size);
7341 btrfs_ordered_update_i_size(inode, i_size, NULL);
7344 ret = btrfs_update_inode(trans, root, inode);
7348 btrfs_end_transaction(trans, root);
7353 int btrfs_prealloc_file_range(struct inode *inode, int mode,
7354 u64 start, u64 num_bytes, u64 min_size,
7355 loff_t actual_len, u64 *alloc_hint)
7357 return __btrfs_prealloc_file_range(inode, mode, start, num_bytes,
7358 min_size, actual_len, alloc_hint,
7362 int btrfs_prealloc_file_range_trans(struct inode *inode,
7363 struct btrfs_trans_handle *trans, int mode,
7364 u64 start, u64 num_bytes, u64 min_size,
7365 loff_t actual_len, u64 *alloc_hint)
7367 return __btrfs_prealloc_file_range(inode, mode, start, num_bytes,
7368 min_size, actual_len, alloc_hint, trans);
7371 static int btrfs_set_page_dirty(struct page *page)
7373 return __set_page_dirty_nobuffers(page);
7376 static int btrfs_permission(struct inode *inode, int mask, unsigned int flags)
7378 struct btrfs_root *root = BTRFS_I(inode)->root;
7380 if (btrfs_root_readonly(root) && (mask & MAY_WRITE))
7382 if ((BTRFS_I(inode)->flags & BTRFS_INODE_READONLY) && (mask & MAY_WRITE))
7384 return generic_permission(inode, mask, flags, btrfs_check_acl);
7387 static const struct inode_operations btrfs_dir_inode_operations = {
7388 .getattr = btrfs_getattr,
7389 .lookup = btrfs_lookup,
7390 .create = btrfs_create,
7391 .unlink = btrfs_unlink,
7393 .mkdir = btrfs_mkdir,
7394 .rmdir = btrfs_rmdir,
7395 .rename = btrfs_rename,
7396 .symlink = btrfs_symlink,
7397 .setattr = btrfs_setattr,
7398 .mknod = btrfs_mknod,
7399 .setxattr = btrfs_setxattr,
7400 .getxattr = btrfs_getxattr,
7401 .listxattr = btrfs_listxattr,
7402 .removexattr = btrfs_removexattr,
7403 .permission = btrfs_permission,
7405 static const struct inode_operations btrfs_dir_ro_inode_operations = {
7406 .lookup = btrfs_lookup,
7407 .permission = btrfs_permission,
7410 static const struct file_operations btrfs_dir_file_operations = {
7411 .llseek = generic_file_llseek,
7412 .read = generic_read_dir,
7413 .readdir = btrfs_real_readdir,
7414 .unlocked_ioctl = btrfs_ioctl,
7415 #ifdef CONFIG_COMPAT
7416 .compat_ioctl = btrfs_ioctl,
7418 .release = btrfs_release_file,
7419 .fsync = btrfs_sync_file,
7422 static struct extent_io_ops btrfs_extent_io_ops = {
7423 .fill_delalloc = run_delalloc_range,
7424 .submit_bio_hook = btrfs_submit_bio_hook,
7425 .merge_bio_hook = btrfs_merge_bio_hook,
7426 .readpage_end_io_hook = btrfs_readpage_end_io_hook,
7427 .writepage_end_io_hook = btrfs_writepage_end_io_hook,
7428 .writepage_start_hook = btrfs_writepage_start_hook,
7429 .readpage_io_failed_hook = btrfs_io_failed_hook,
7430 .set_bit_hook = btrfs_set_bit_hook,
7431 .clear_bit_hook = btrfs_clear_bit_hook,
7432 .merge_extent_hook = btrfs_merge_extent_hook,
7433 .split_extent_hook = btrfs_split_extent_hook,
7437 * btrfs doesn't support the bmap operation because swapfiles
7438 * use bmap to make a mapping of extents in the file. They assume
7439 * these extents won't change over the life of the file and they
7440 * use the bmap result to do IO directly to the drive.
7442 * the btrfs bmap call would return logical addresses that aren't
7443 * suitable for IO and they also will change frequently as COW
7444 * operations happen. So, swapfile + btrfs == corruption.
7446 * For now we're avoiding this by dropping bmap.
7448 static const struct address_space_operations btrfs_aops = {
7449 .readpage = btrfs_readpage,
7450 .writepage = btrfs_writepage,
7451 .writepages = btrfs_writepages,
7452 .readpages = btrfs_readpages,
7453 .sync_page = block_sync_page,
7454 .direct_IO = btrfs_direct_IO,
7455 .invalidatepage = btrfs_invalidatepage,
7456 .releasepage = btrfs_releasepage,
7457 .set_page_dirty = btrfs_set_page_dirty,
7458 .error_remove_page = generic_error_remove_page,
7461 static const struct address_space_operations btrfs_symlink_aops = {
7462 .readpage = btrfs_readpage,
7463 .writepage = btrfs_writepage,
7464 .invalidatepage = btrfs_invalidatepage,
7465 .releasepage = btrfs_releasepage,
7468 static const struct inode_operations btrfs_file_inode_operations = {
7469 .getattr = btrfs_getattr,
7470 .setattr = btrfs_setattr,
7471 .setxattr = btrfs_setxattr,
7472 .getxattr = btrfs_getxattr,
7473 .listxattr = btrfs_listxattr,
7474 .removexattr = btrfs_removexattr,
7475 .permission = btrfs_permission,
7476 .fiemap = btrfs_fiemap,
7478 static const struct inode_operations btrfs_special_inode_operations = {
7479 .getattr = btrfs_getattr,
7480 .setattr = btrfs_setattr,
7481 .permission = btrfs_permission,
7482 .setxattr = btrfs_setxattr,
7483 .getxattr = btrfs_getxattr,
7484 .listxattr = btrfs_listxattr,
7485 .removexattr = btrfs_removexattr,
7487 static const struct inode_operations btrfs_symlink_inode_operations = {
7488 .readlink = generic_readlink,
7489 .follow_link = page_follow_link_light,
7490 .put_link = page_put_link,
7491 .getattr = btrfs_getattr,
7492 .permission = btrfs_permission,
7493 .setxattr = btrfs_setxattr,
7494 .getxattr = btrfs_getxattr,
7495 .listxattr = btrfs_listxattr,
7496 .removexattr = btrfs_removexattr,
7499 const struct dentry_operations btrfs_dentry_operations = {
7500 .d_delete = btrfs_dentry_delete,