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>
40 #include <linux/ratelimit.h>
44 #include "transaction.h"
45 #include "btrfs_inode.h"
47 #include "print-tree.h"
48 #include "ordered-data.h"
52 #include "compression.h"
54 #include "free-space-cache.h"
55 #include "inode-map.h"
57 struct btrfs_iget_args {
59 struct btrfs_root *root;
62 static const struct inode_operations btrfs_dir_inode_operations;
63 static const struct inode_operations btrfs_symlink_inode_operations;
64 static const struct inode_operations btrfs_dir_ro_inode_operations;
65 static const struct inode_operations btrfs_special_inode_operations;
66 static const struct inode_operations btrfs_file_inode_operations;
67 static const struct address_space_operations btrfs_aops;
68 static const struct address_space_operations btrfs_symlink_aops;
69 static const struct file_operations btrfs_dir_file_operations;
70 static struct extent_io_ops btrfs_extent_io_ops;
72 static struct kmem_cache *btrfs_inode_cachep;
73 struct kmem_cache *btrfs_trans_handle_cachep;
74 struct kmem_cache *btrfs_transaction_cachep;
75 struct kmem_cache *btrfs_path_cachep;
76 struct kmem_cache *btrfs_free_space_cachep;
79 static unsigned char btrfs_type_by_mode[S_IFMT >> S_SHIFT] = {
80 [S_IFREG >> S_SHIFT] = BTRFS_FT_REG_FILE,
81 [S_IFDIR >> S_SHIFT] = BTRFS_FT_DIR,
82 [S_IFCHR >> S_SHIFT] = BTRFS_FT_CHRDEV,
83 [S_IFBLK >> S_SHIFT] = BTRFS_FT_BLKDEV,
84 [S_IFIFO >> S_SHIFT] = BTRFS_FT_FIFO,
85 [S_IFSOCK >> S_SHIFT] = BTRFS_FT_SOCK,
86 [S_IFLNK >> S_SHIFT] = BTRFS_FT_SYMLINK,
89 static int btrfs_setsize(struct inode *inode, loff_t newsize);
90 static int btrfs_truncate(struct inode *inode);
91 static int btrfs_finish_ordered_io(struct inode *inode, u64 start, u64 end);
92 static noinline int cow_file_range(struct inode *inode,
93 struct page *locked_page,
94 u64 start, u64 end, int *page_started,
95 unsigned long *nr_written, int unlock);
96 static noinline int btrfs_update_inode_fallback(struct btrfs_trans_handle *trans,
97 struct btrfs_root *root, struct inode *inode);
99 static int btrfs_init_inode_security(struct btrfs_trans_handle *trans,
100 struct inode *inode, struct inode *dir,
101 const struct qstr *qstr)
105 err = btrfs_init_acl(trans, inode, dir);
107 err = btrfs_xattr_security_init(trans, inode, dir, qstr);
112 * this does all the hard work for inserting an inline extent into
113 * the btree. The caller should have done a btrfs_drop_extents so that
114 * no overlapping inline items exist in the btree
116 static noinline int insert_inline_extent(struct btrfs_trans_handle *trans,
117 struct btrfs_root *root, struct inode *inode,
118 u64 start, size_t size, size_t compressed_size,
120 struct page **compressed_pages)
122 struct btrfs_key key;
123 struct btrfs_path *path;
124 struct extent_buffer *leaf;
125 struct page *page = NULL;
128 struct btrfs_file_extent_item *ei;
131 size_t cur_size = size;
133 unsigned long offset;
135 if (compressed_size && compressed_pages)
136 cur_size = compressed_size;
138 path = btrfs_alloc_path();
142 path->leave_spinning = 1;
144 key.objectid = btrfs_ino(inode);
146 btrfs_set_key_type(&key, BTRFS_EXTENT_DATA_KEY);
147 datasize = btrfs_file_extent_calc_inline_size(cur_size);
149 inode_add_bytes(inode, size);
150 ret = btrfs_insert_empty_item(trans, root, path, &key,
157 leaf = path->nodes[0];
158 ei = btrfs_item_ptr(leaf, path->slots[0],
159 struct btrfs_file_extent_item);
160 btrfs_set_file_extent_generation(leaf, ei, trans->transid);
161 btrfs_set_file_extent_type(leaf, ei, BTRFS_FILE_EXTENT_INLINE);
162 btrfs_set_file_extent_encryption(leaf, ei, 0);
163 btrfs_set_file_extent_other_encoding(leaf, ei, 0);
164 btrfs_set_file_extent_ram_bytes(leaf, ei, size);
165 ptr = btrfs_file_extent_inline_start(ei);
167 if (compress_type != BTRFS_COMPRESS_NONE) {
170 while (compressed_size > 0) {
171 cpage = compressed_pages[i];
172 cur_size = min_t(unsigned long, compressed_size,
175 kaddr = kmap_atomic(cpage, KM_USER0);
176 write_extent_buffer(leaf, kaddr, ptr, cur_size);
177 kunmap_atomic(kaddr, KM_USER0);
181 compressed_size -= cur_size;
183 btrfs_set_file_extent_compression(leaf, ei,
186 page = find_get_page(inode->i_mapping,
187 start >> PAGE_CACHE_SHIFT);
188 btrfs_set_file_extent_compression(leaf, ei, 0);
189 kaddr = kmap_atomic(page, KM_USER0);
190 offset = start & (PAGE_CACHE_SIZE - 1);
191 write_extent_buffer(leaf, kaddr + offset, ptr, size);
192 kunmap_atomic(kaddr, KM_USER0);
193 page_cache_release(page);
195 btrfs_mark_buffer_dirty(leaf);
196 btrfs_free_path(path);
199 * we're an inline extent, so nobody can
200 * extend the file past i_size without locking
201 * a page we already have locked.
203 * We must do any isize and inode updates
204 * before we unlock the pages. Otherwise we
205 * could end up racing with unlink.
207 BTRFS_I(inode)->disk_i_size = inode->i_size;
208 btrfs_update_inode(trans, root, inode);
212 btrfs_free_path(path);
218 * conditionally insert an inline extent into the file. This
219 * does the checks required to make sure the data is small enough
220 * to fit as an inline extent.
222 static noinline int cow_file_range_inline(struct btrfs_trans_handle *trans,
223 struct btrfs_root *root,
224 struct inode *inode, u64 start, u64 end,
225 size_t compressed_size, int compress_type,
226 struct page **compressed_pages)
228 u64 isize = i_size_read(inode);
229 u64 actual_end = min(end + 1, isize);
230 u64 inline_len = actual_end - start;
231 u64 aligned_end = (end + root->sectorsize - 1) &
232 ~((u64)root->sectorsize - 1);
234 u64 data_len = inline_len;
238 data_len = compressed_size;
241 actual_end >= PAGE_CACHE_SIZE ||
242 data_len >= BTRFS_MAX_INLINE_DATA_SIZE(root) ||
244 (actual_end & (root->sectorsize - 1)) == 0) ||
246 data_len > root->fs_info->max_inline) {
250 ret = btrfs_drop_extents(trans, inode, start, aligned_end,
254 if (isize > actual_end)
255 inline_len = min_t(u64, isize, actual_end);
256 ret = insert_inline_extent(trans, root, inode, start,
257 inline_len, compressed_size,
258 compress_type, compressed_pages);
260 btrfs_delalloc_release_metadata(inode, end + 1 - start);
261 btrfs_drop_extent_cache(inode, start, aligned_end - 1, 0);
265 struct async_extent {
270 unsigned long nr_pages;
272 struct list_head list;
277 struct btrfs_root *root;
278 struct page *locked_page;
281 struct list_head extents;
282 struct btrfs_work work;
285 static noinline int add_async_extent(struct async_cow *cow,
286 u64 start, u64 ram_size,
289 unsigned long nr_pages,
292 struct async_extent *async_extent;
294 async_extent = kmalloc(sizeof(*async_extent), GFP_NOFS);
295 BUG_ON(!async_extent);
296 async_extent->start = start;
297 async_extent->ram_size = ram_size;
298 async_extent->compressed_size = compressed_size;
299 async_extent->pages = pages;
300 async_extent->nr_pages = nr_pages;
301 async_extent->compress_type = compress_type;
302 list_add_tail(&async_extent->list, &cow->extents);
307 * we create compressed extents in two phases. The first
308 * phase compresses a range of pages that have already been
309 * locked (both pages and state bits are locked).
311 * This is done inside an ordered work queue, and the compression
312 * is spread across many cpus. The actual IO submission is step
313 * two, and the ordered work queue takes care of making sure that
314 * happens in the same order things were put onto the queue by
315 * writepages and friends.
317 * If this code finds it can't get good compression, it puts an
318 * entry onto the work queue to write the uncompressed bytes. This
319 * makes sure that both compressed inodes and uncompressed inodes
320 * are written in the same order that pdflush sent them down.
322 static noinline int compress_file_range(struct inode *inode,
323 struct page *locked_page,
325 struct async_cow *async_cow,
328 struct btrfs_root *root = BTRFS_I(inode)->root;
329 struct btrfs_trans_handle *trans;
331 u64 blocksize = root->sectorsize;
333 u64 isize = i_size_read(inode);
335 struct page **pages = NULL;
336 unsigned long nr_pages;
337 unsigned long nr_pages_ret = 0;
338 unsigned long total_compressed = 0;
339 unsigned long total_in = 0;
340 unsigned long max_compressed = 128 * 1024;
341 unsigned long max_uncompressed = 128 * 1024;
344 int compress_type = root->fs_info->compress_type;
346 /* if this is a small write inside eof, kick off a defragbot */
347 if (end <= BTRFS_I(inode)->disk_i_size && (end - start + 1) < 16 * 1024)
348 btrfs_add_inode_defrag(NULL, inode);
350 actual_end = min_t(u64, isize, end + 1);
353 nr_pages = (end >> PAGE_CACHE_SHIFT) - (start >> PAGE_CACHE_SHIFT) + 1;
354 nr_pages = min(nr_pages, (128 * 1024UL) / PAGE_CACHE_SIZE);
357 * we don't want to send crud past the end of i_size through
358 * compression, that's just a waste of CPU time. So, if the
359 * end of the file is before the start of our current
360 * requested range of bytes, we bail out to the uncompressed
361 * cleanup code that can deal with all of this.
363 * It isn't really the fastest way to fix things, but this is a
364 * very uncommon corner.
366 if (actual_end <= start)
367 goto cleanup_and_bail_uncompressed;
369 total_compressed = actual_end - start;
371 /* we want to make sure that amount of ram required to uncompress
372 * an extent is reasonable, so we limit the total size in ram
373 * of a compressed extent to 128k. This is a crucial number
374 * because it also controls how easily we can spread reads across
375 * cpus for decompression.
377 * We also want to make sure the amount of IO required to do
378 * a random read is reasonably small, so we limit the size of
379 * a compressed extent to 128k.
381 total_compressed = min(total_compressed, max_uncompressed);
382 num_bytes = (end - start + blocksize) & ~(blocksize - 1);
383 num_bytes = max(blocksize, num_bytes);
388 * we do compression for mount -o compress and when the
389 * inode has not been flagged as nocompress. This flag can
390 * change at any time if we discover bad compression ratios.
392 if (!(BTRFS_I(inode)->flags & BTRFS_INODE_NOCOMPRESS) &&
393 (btrfs_test_opt(root, COMPRESS) ||
394 (BTRFS_I(inode)->force_compress) ||
395 (BTRFS_I(inode)->flags & BTRFS_INODE_COMPRESS))) {
397 pages = kzalloc(sizeof(struct page *) * nr_pages, GFP_NOFS);
399 /* just bail out to the uncompressed code */
403 if (BTRFS_I(inode)->force_compress)
404 compress_type = BTRFS_I(inode)->force_compress;
406 ret = btrfs_compress_pages(compress_type,
407 inode->i_mapping, start,
408 total_compressed, pages,
409 nr_pages, &nr_pages_ret,
415 unsigned long offset = total_compressed &
416 (PAGE_CACHE_SIZE - 1);
417 struct page *page = pages[nr_pages_ret - 1];
420 /* zero the tail end of the last page, we might be
421 * sending it down to disk
424 kaddr = kmap_atomic(page, KM_USER0);
425 memset(kaddr + offset, 0,
426 PAGE_CACHE_SIZE - offset);
427 kunmap_atomic(kaddr, KM_USER0);
434 trans = btrfs_join_transaction(root);
435 BUG_ON(IS_ERR(trans));
436 trans->block_rsv = &root->fs_info->delalloc_block_rsv;
438 /* lets try to make an inline extent */
439 if (ret || total_in < (actual_end - start)) {
440 /* we didn't compress the entire range, try
441 * to make an uncompressed inline extent.
443 ret = cow_file_range_inline(trans, root, inode,
444 start, end, 0, 0, NULL);
446 /* try making a compressed inline extent */
447 ret = cow_file_range_inline(trans, root, inode,
450 compress_type, pages);
454 * inline extent creation worked, we don't need
455 * to create any more async work items. Unlock
456 * and free up our temp pages.
458 extent_clear_unlock_delalloc(inode,
459 &BTRFS_I(inode)->io_tree,
461 EXTENT_CLEAR_UNLOCK_PAGE | EXTENT_CLEAR_DIRTY |
462 EXTENT_CLEAR_DELALLOC |
463 EXTENT_SET_WRITEBACK | EXTENT_END_WRITEBACK);
465 btrfs_end_transaction(trans, root);
468 btrfs_end_transaction(trans, root);
473 * we aren't doing an inline extent round the compressed size
474 * up to a block size boundary so the allocator does sane
477 total_compressed = (total_compressed + blocksize - 1) &
481 * one last check to make sure the compression is really a
482 * win, compare the page count read with the blocks on disk
484 total_in = (total_in + PAGE_CACHE_SIZE - 1) &
485 ~(PAGE_CACHE_SIZE - 1);
486 if (total_compressed >= total_in) {
489 num_bytes = total_in;
492 if (!will_compress && pages) {
494 * the compression code ran but failed to make things smaller,
495 * free any pages it allocated and our page pointer array
497 for (i = 0; i < nr_pages_ret; i++) {
498 WARN_ON(pages[i]->mapping);
499 page_cache_release(pages[i]);
503 total_compressed = 0;
506 /* flag the file so we don't compress in the future */
507 if (!btrfs_test_opt(root, FORCE_COMPRESS) &&
508 !(BTRFS_I(inode)->force_compress)) {
509 BTRFS_I(inode)->flags |= BTRFS_INODE_NOCOMPRESS;
515 /* the async work queues will take care of doing actual
516 * allocation on disk for these compressed pages,
517 * and will submit them to the elevator.
519 add_async_extent(async_cow, start, num_bytes,
520 total_compressed, pages, nr_pages_ret,
523 if (start + num_bytes < end) {
530 cleanup_and_bail_uncompressed:
532 * No compression, but we still need to write the pages in
533 * the file we've been given so far. redirty the locked
534 * page if it corresponds to our extent and set things up
535 * for the async work queue to run cow_file_range to do
536 * the normal delalloc dance
538 if (page_offset(locked_page) >= start &&
539 page_offset(locked_page) <= end) {
540 __set_page_dirty_nobuffers(locked_page);
541 /* unlocked later on in the async handlers */
543 add_async_extent(async_cow, start, end - start + 1,
544 0, NULL, 0, BTRFS_COMPRESS_NONE);
552 for (i = 0; i < nr_pages_ret; i++) {
553 WARN_ON(pages[i]->mapping);
554 page_cache_release(pages[i]);
562 * phase two of compressed writeback. This is the ordered portion
563 * of the code, which only gets called in the order the work was
564 * queued. We walk all the async extents created by compress_file_range
565 * and send them down to the disk.
567 static noinline int submit_compressed_extents(struct inode *inode,
568 struct async_cow *async_cow)
570 struct async_extent *async_extent;
572 struct btrfs_trans_handle *trans;
573 struct btrfs_key ins;
574 struct extent_map *em;
575 struct btrfs_root *root = BTRFS_I(inode)->root;
576 struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree;
577 struct extent_io_tree *io_tree;
580 if (list_empty(&async_cow->extents))
584 while (!list_empty(&async_cow->extents)) {
585 async_extent = list_entry(async_cow->extents.next,
586 struct async_extent, list);
587 list_del(&async_extent->list);
589 io_tree = &BTRFS_I(inode)->io_tree;
592 /* did the compression code fall back to uncompressed IO? */
593 if (!async_extent->pages) {
594 int page_started = 0;
595 unsigned long nr_written = 0;
597 lock_extent(io_tree, async_extent->start,
598 async_extent->start +
599 async_extent->ram_size - 1, GFP_NOFS);
601 /* allocate blocks */
602 ret = cow_file_range(inode, async_cow->locked_page,
604 async_extent->start +
605 async_extent->ram_size - 1,
606 &page_started, &nr_written, 0);
609 * if page_started, cow_file_range inserted an
610 * inline extent and took care of all the unlocking
611 * and IO for us. Otherwise, we need to submit
612 * all those pages down to the drive.
614 if (!page_started && !ret)
615 extent_write_locked_range(io_tree,
616 inode, async_extent->start,
617 async_extent->start +
618 async_extent->ram_size - 1,
626 lock_extent(io_tree, async_extent->start,
627 async_extent->start + async_extent->ram_size - 1,
630 trans = btrfs_join_transaction(root);
631 BUG_ON(IS_ERR(trans));
632 trans->block_rsv = &root->fs_info->delalloc_block_rsv;
633 ret = btrfs_reserve_extent(trans, root,
634 async_extent->compressed_size,
635 async_extent->compressed_size,
638 btrfs_end_transaction(trans, root);
642 for (i = 0; i < async_extent->nr_pages; i++) {
643 WARN_ON(async_extent->pages[i]->mapping);
644 page_cache_release(async_extent->pages[i]);
646 kfree(async_extent->pages);
647 async_extent->nr_pages = 0;
648 async_extent->pages = NULL;
649 unlock_extent(io_tree, async_extent->start,
650 async_extent->start +
651 async_extent->ram_size - 1, GFP_NOFS);
656 * here we're doing allocation and writeback of the
659 btrfs_drop_extent_cache(inode, async_extent->start,
660 async_extent->start +
661 async_extent->ram_size - 1, 0);
663 em = alloc_extent_map();
665 em->start = async_extent->start;
666 em->len = async_extent->ram_size;
667 em->orig_start = em->start;
669 em->block_start = ins.objectid;
670 em->block_len = ins.offset;
671 em->bdev = root->fs_info->fs_devices->latest_bdev;
672 em->compress_type = async_extent->compress_type;
673 set_bit(EXTENT_FLAG_PINNED, &em->flags);
674 set_bit(EXTENT_FLAG_COMPRESSED, &em->flags);
677 write_lock(&em_tree->lock);
678 ret = add_extent_mapping(em_tree, em);
679 write_unlock(&em_tree->lock);
680 if (ret != -EEXIST) {
684 btrfs_drop_extent_cache(inode, async_extent->start,
685 async_extent->start +
686 async_extent->ram_size - 1, 0);
689 ret = btrfs_add_ordered_extent_compress(inode,
692 async_extent->ram_size,
694 BTRFS_ORDERED_COMPRESSED,
695 async_extent->compress_type);
699 * clear dirty, set writeback and unlock the pages.
701 extent_clear_unlock_delalloc(inode,
702 &BTRFS_I(inode)->io_tree,
704 async_extent->start +
705 async_extent->ram_size - 1,
706 NULL, EXTENT_CLEAR_UNLOCK_PAGE |
707 EXTENT_CLEAR_UNLOCK |
708 EXTENT_CLEAR_DELALLOC |
709 EXTENT_CLEAR_DIRTY | EXTENT_SET_WRITEBACK);
711 ret = btrfs_submit_compressed_write(inode,
713 async_extent->ram_size,
715 ins.offset, async_extent->pages,
716 async_extent->nr_pages);
719 alloc_hint = ins.objectid + ins.offset;
727 static u64 get_extent_allocation_hint(struct inode *inode, u64 start,
730 struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree;
731 struct extent_map *em;
734 read_lock(&em_tree->lock);
735 em = search_extent_mapping(em_tree, start, num_bytes);
738 * if block start isn't an actual block number then find the
739 * first block in this inode and use that as a hint. If that
740 * block is also bogus then just don't worry about it.
742 if (em->block_start >= EXTENT_MAP_LAST_BYTE) {
744 em = search_extent_mapping(em_tree, 0, 0);
745 if (em && em->block_start < EXTENT_MAP_LAST_BYTE)
746 alloc_hint = em->block_start;
750 alloc_hint = em->block_start;
754 read_unlock(&em_tree->lock);
760 * when extent_io.c finds a delayed allocation range in the file,
761 * the call backs end up in this code. The basic idea is to
762 * allocate extents on disk for the range, and create ordered data structs
763 * in ram to track those extents.
765 * locked_page is the page that writepage had locked already. We use
766 * it to make sure we don't do extra locks or unlocks.
768 * *page_started is set to one if we unlock locked_page and do everything
769 * required to start IO on it. It may be clean and already done with
772 static noinline int cow_file_range(struct inode *inode,
773 struct page *locked_page,
774 u64 start, u64 end, int *page_started,
775 unsigned long *nr_written,
778 struct btrfs_root *root = BTRFS_I(inode)->root;
779 struct btrfs_trans_handle *trans;
782 unsigned long ram_size;
785 u64 blocksize = root->sectorsize;
786 struct btrfs_key ins;
787 struct extent_map *em;
788 struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree;
791 BUG_ON(btrfs_is_free_space_inode(root, inode));
792 trans = btrfs_join_transaction(root);
793 BUG_ON(IS_ERR(trans));
794 trans->block_rsv = &root->fs_info->delalloc_block_rsv;
796 num_bytes = (end - start + blocksize) & ~(blocksize - 1);
797 num_bytes = max(blocksize, num_bytes);
798 disk_num_bytes = num_bytes;
801 /* if this is a small write inside eof, kick off defrag */
802 if (end <= BTRFS_I(inode)->disk_i_size && num_bytes < 64 * 1024)
803 btrfs_add_inode_defrag(trans, inode);
806 /* lets try to make an inline extent */
807 ret = cow_file_range_inline(trans, root, inode,
808 start, end, 0, 0, NULL);
810 extent_clear_unlock_delalloc(inode,
811 &BTRFS_I(inode)->io_tree,
813 EXTENT_CLEAR_UNLOCK_PAGE |
814 EXTENT_CLEAR_UNLOCK |
815 EXTENT_CLEAR_DELALLOC |
817 EXTENT_SET_WRITEBACK |
818 EXTENT_END_WRITEBACK);
820 *nr_written = *nr_written +
821 (end - start + PAGE_CACHE_SIZE) / PAGE_CACHE_SIZE;
828 BUG_ON(disk_num_bytes >
829 btrfs_super_total_bytes(root->fs_info->super_copy));
831 alloc_hint = get_extent_allocation_hint(inode, start, num_bytes);
832 btrfs_drop_extent_cache(inode, start, start + num_bytes - 1, 0);
834 while (disk_num_bytes > 0) {
837 cur_alloc_size = disk_num_bytes;
838 ret = btrfs_reserve_extent(trans, root, cur_alloc_size,
839 root->sectorsize, 0, alloc_hint,
843 em = alloc_extent_map();
846 em->orig_start = em->start;
847 ram_size = ins.offset;
848 em->len = ins.offset;
850 em->block_start = ins.objectid;
851 em->block_len = ins.offset;
852 em->bdev = root->fs_info->fs_devices->latest_bdev;
853 set_bit(EXTENT_FLAG_PINNED, &em->flags);
856 write_lock(&em_tree->lock);
857 ret = add_extent_mapping(em_tree, em);
858 write_unlock(&em_tree->lock);
859 if (ret != -EEXIST) {
863 btrfs_drop_extent_cache(inode, start,
864 start + ram_size - 1, 0);
867 cur_alloc_size = ins.offset;
868 ret = btrfs_add_ordered_extent(inode, start, ins.objectid,
869 ram_size, cur_alloc_size, 0);
872 if (root->root_key.objectid ==
873 BTRFS_DATA_RELOC_TREE_OBJECTID) {
874 ret = btrfs_reloc_clone_csums(inode, start,
879 if (disk_num_bytes < cur_alloc_size)
882 /* we're not doing compressed IO, don't unlock the first
883 * page (which the caller expects to stay locked), don't
884 * clear any dirty bits and don't set any writeback bits
886 * Do set the Private2 bit so we know this page was properly
887 * setup for writepage
889 op = unlock ? EXTENT_CLEAR_UNLOCK_PAGE : 0;
890 op |= EXTENT_CLEAR_UNLOCK | EXTENT_CLEAR_DELALLOC |
893 extent_clear_unlock_delalloc(inode, &BTRFS_I(inode)->io_tree,
894 start, start + ram_size - 1,
896 disk_num_bytes -= cur_alloc_size;
897 num_bytes -= cur_alloc_size;
898 alloc_hint = ins.objectid + ins.offset;
899 start += cur_alloc_size;
903 btrfs_end_transaction(trans, root);
909 * work queue call back to started compression on a file and pages
911 static noinline void async_cow_start(struct btrfs_work *work)
913 struct async_cow *async_cow;
915 async_cow = container_of(work, struct async_cow, work);
917 compress_file_range(async_cow->inode, async_cow->locked_page,
918 async_cow->start, async_cow->end, async_cow,
921 async_cow->inode = NULL;
925 * work queue call back to submit previously compressed pages
927 static noinline void async_cow_submit(struct btrfs_work *work)
929 struct async_cow *async_cow;
930 struct btrfs_root *root;
931 unsigned long nr_pages;
933 async_cow = container_of(work, struct async_cow, work);
935 root = async_cow->root;
936 nr_pages = (async_cow->end - async_cow->start + PAGE_CACHE_SIZE) >>
939 atomic_sub(nr_pages, &root->fs_info->async_delalloc_pages);
941 if (atomic_read(&root->fs_info->async_delalloc_pages) <
943 waitqueue_active(&root->fs_info->async_submit_wait))
944 wake_up(&root->fs_info->async_submit_wait);
946 if (async_cow->inode)
947 submit_compressed_extents(async_cow->inode, async_cow);
950 static noinline void async_cow_free(struct btrfs_work *work)
952 struct async_cow *async_cow;
953 async_cow = container_of(work, struct async_cow, work);
957 static int cow_file_range_async(struct inode *inode, struct page *locked_page,
958 u64 start, u64 end, int *page_started,
959 unsigned long *nr_written)
961 struct async_cow *async_cow;
962 struct btrfs_root *root = BTRFS_I(inode)->root;
963 unsigned long nr_pages;
965 int limit = 10 * 1024 * 1042;
967 clear_extent_bit(&BTRFS_I(inode)->io_tree, start, end, EXTENT_LOCKED,
968 1, 0, NULL, GFP_NOFS);
969 while (start < end) {
970 async_cow = kmalloc(sizeof(*async_cow), GFP_NOFS);
972 async_cow->inode = inode;
973 async_cow->root = root;
974 async_cow->locked_page = locked_page;
975 async_cow->start = start;
977 if (BTRFS_I(inode)->flags & BTRFS_INODE_NOCOMPRESS)
980 cur_end = min(end, start + 512 * 1024 - 1);
982 async_cow->end = cur_end;
983 INIT_LIST_HEAD(&async_cow->extents);
985 async_cow->work.func = async_cow_start;
986 async_cow->work.ordered_func = async_cow_submit;
987 async_cow->work.ordered_free = async_cow_free;
988 async_cow->work.flags = 0;
990 nr_pages = (cur_end - start + PAGE_CACHE_SIZE) >>
992 atomic_add(nr_pages, &root->fs_info->async_delalloc_pages);
994 btrfs_queue_worker(&root->fs_info->delalloc_workers,
997 if (atomic_read(&root->fs_info->async_delalloc_pages) > limit) {
998 wait_event(root->fs_info->async_submit_wait,
999 (atomic_read(&root->fs_info->async_delalloc_pages) <
1003 while (atomic_read(&root->fs_info->async_submit_draining) &&
1004 atomic_read(&root->fs_info->async_delalloc_pages)) {
1005 wait_event(root->fs_info->async_submit_wait,
1006 (atomic_read(&root->fs_info->async_delalloc_pages) ==
1010 *nr_written += nr_pages;
1011 start = cur_end + 1;
1017 static noinline int csum_exist_in_range(struct btrfs_root *root,
1018 u64 bytenr, u64 num_bytes)
1021 struct btrfs_ordered_sum *sums;
1024 ret = btrfs_lookup_csums_range(root->fs_info->csum_root, bytenr,
1025 bytenr + num_bytes - 1, &list, 0);
1026 if (ret == 0 && list_empty(&list))
1029 while (!list_empty(&list)) {
1030 sums = list_entry(list.next, struct btrfs_ordered_sum, list);
1031 list_del(&sums->list);
1038 * when nowcow writeback call back. This checks for snapshots or COW copies
1039 * of the extents that exist in the file, and COWs the file as required.
1041 * If no cow copies or snapshots exist, we write directly to the existing
1044 static noinline int run_delalloc_nocow(struct inode *inode,
1045 struct page *locked_page,
1046 u64 start, u64 end, int *page_started, int force,
1047 unsigned long *nr_written)
1049 struct btrfs_root *root = BTRFS_I(inode)->root;
1050 struct btrfs_trans_handle *trans;
1051 struct extent_buffer *leaf;
1052 struct btrfs_path *path;
1053 struct btrfs_file_extent_item *fi;
1054 struct btrfs_key found_key;
1067 u64 ino = btrfs_ino(inode);
1069 path = btrfs_alloc_path();
1073 nolock = btrfs_is_free_space_inode(root, inode);
1076 trans = btrfs_join_transaction_nolock(root);
1078 trans = btrfs_join_transaction(root);
1080 BUG_ON(IS_ERR(trans));
1081 trans->block_rsv = &root->fs_info->delalloc_block_rsv;
1083 cow_start = (u64)-1;
1086 ret = btrfs_lookup_file_extent(trans, root, path, ino,
1089 if (ret > 0 && path->slots[0] > 0 && check_prev) {
1090 leaf = path->nodes[0];
1091 btrfs_item_key_to_cpu(leaf, &found_key,
1092 path->slots[0] - 1);
1093 if (found_key.objectid == ino &&
1094 found_key.type == BTRFS_EXTENT_DATA_KEY)
1099 leaf = path->nodes[0];
1100 if (path->slots[0] >= btrfs_header_nritems(leaf)) {
1101 ret = btrfs_next_leaf(root, path);
1106 leaf = path->nodes[0];
1112 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
1114 if (found_key.objectid > ino ||
1115 found_key.type > BTRFS_EXTENT_DATA_KEY ||
1116 found_key.offset > end)
1119 if (found_key.offset > cur_offset) {
1120 extent_end = found_key.offset;
1125 fi = btrfs_item_ptr(leaf, path->slots[0],
1126 struct btrfs_file_extent_item);
1127 extent_type = btrfs_file_extent_type(leaf, fi);
1129 if (extent_type == BTRFS_FILE_EXTENT_REG ||
1130 extent_type == BTRFS_FILE_EXTENT_PREALLOC) {
1131 disk_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi);
1132 extent_offset = btrfs_file_extent_offset(leaf, fi);
1133 extent_end = found_key.offset +
1134 btrfs_file_extent_num_bytes(leaf, fi);
1135 if (extent_end <= start) {
1139 if (disk_bytenr == 0)
1141 if (btrfs_file_extent_compression(leaf, fi) ||
1142 btrfs_file_extent_encryption(leaf, fi) ||
1143 btrfs_file_extent_other_encoding(leaf, fi))
1145 if (extent_type == BTRFS_FILE_EXTENT_REG && !force)
1147 if (btrfs_extent_readonly(root, disk_bytenr))
1149 if (btrfs_cross_ref_exist(trans, root, ino,
1151 extent_offset, disk_bytenr))
1153 disk_bytenr += extent_offset;
1154 disk_bytenr += cur_offset - found_key.offset;
1155 num_bytes = min(end + 1, extent_end) - cur_offset;
1157 * force cow if csum exists in the range.
1158 * this ensure that csum for a given extent are
1159 * either valid or do not exist.
1161 if (csum_exist_in_range(root, disk_bytenr, num_bytes))
1164 } else if (extent_type == BTRFS_FILE_EXTENT_INLINE) {
1165 extent_end = found_key.offset +
1166 btrfs_file_extent_inline_len(leaf, fi);
1167 extent_end = ALIGN(extent_end, root->sectorsize);
1172 if (extent_end <= start) {
1177 if (cow_start == (u64)-1)
1178 cow_start = cur_offset;
1179 cur_offset = extent_end;
1180 if (cur_offset > end)
1186 btrfs_release_path(path);
1187 if (cow_start != (u64)-1) {
1188 ret = cow_file_range(inode, locked_page, cow_start,
1189 found_key.offset - 1, page_started,
1192 cow_start = (u64)-1;
1195 if (extent_type == BTRFS_FILE_EXTENT_PREALLOC) {
1196 struct extent_map *em;
1197 struct extent_map_tree *em_tree;
1198 em_tree = &BTRFS_I(inode)->extent_tree;
1199 em = alloc_extent_map();
1201 em->start = cur_offset;
1202 em->orig_start = em->start;
1203 em->len = num_bytes;
1204 em->block_len = num_bytes;
1205 em->block_start = disk_bytenr;
1206 em->bdev = root->fs_info->fs_devices->latest_bdev;
1207 set_bit(EXTENT_FLAG_PINNED, &em->flags);
1209 write_lock(&em_tree->lock);
1210 ret = add_extent_mapping(em_tree, em);
1211 write_unlock(&em_tree->lock);
1212 if (ret != -EEXIST) {
1213 free_extent_map(em);
1216 btrfs_drop_extent_cache(inode, em->start,
1217 em->start + em->len - 1, 0);
1219 type = BTRFS_ORDERED_PREALLOC;
1221 type = BTRFS_ORDERED_NOCOW;
1224 ret = btrfs_add_ordered_extent(inode, cur_offset, disk_bytenr,
1225 num_bytes, num_bytes, type);
1228 if (root->root_key.objectid ==
1229 BTRFS_DATA_RELOC_TREE_OBJECTID) {
1230 ret = btrfs_reloc_clone_csums(inode, cur_offset,
1235 extent_clear_unlock_delalloc(inode, &BTRFS_I(inode)->io_tree,
1236 cur_offset, cur_offset + num_bytes - 1,
1237 locked_page, EXTENT_CLEAR_UNLOCK_PAGE |
1238 EXTENT_CLEAR_UNLOCK | EXTENT_CLEAR_DELALLOC |
1239 EXTENT_SET_PRIVATE2);
1240 cur_offset = extent_end;
1241 if (cur_offset > end)
1244 btrfs_release_path(path);
1246 if (cur_offset <= end && cow_start == (u64)-1)
1247 cow_start = cur_offset;
1248 if (cow_start != (u64)-1) {
1249 ret = cow_file_range(inode, locked_page, cow_start, end,
1250 page_started, nr_written, 1);
1255 ret = btrfs_end_transaction_nolock(trans, root);
1258 ret = btrfs_end_transaction(trans, root);
1261 btrfs_free_path(path);
1266 * extent_io.c call back to do delayed allocation processing
1268 static int run_delalloc_range(struct inode *inode, struct page *locked_page,
1269 u64 start, u64 end, int *page_started,
1270 unsigned long *nr_written)
1273 struct btrfs_root *root = BTRFS_I(inode)->root;
1275 if (BTRFS_I(inode)->flags & BTRFS_INODE_NODATACOW)
1276 ret = run_delalloc_nocow(inode, locked_page, start, end,
1277 page_started, 1, nr_written);
1278 else if (BTRFS_I(inode)->flags & BTRFS_INODE_PREALLOC)
1279 ret = run_delalloc_nocow(inode, locked_page, start, end,
1280 page_started, 0, nr_written);
1281 else if (!btrfs_test_opt(root, COMPRESS) &&
1282 !(BTRFS_I(inode)->force_compress) &&
1283 !(BTRFS_I(inode)->flags & BTRFS_INODE_COMPRESS))
1284 ret = cow_file_range(inode, locked_page, start, end,
1285 page_started, nr_written, 1);
1287 ret = cow_file_range_async(inode, locked_page, start, end,
1288 page_started, nr_written);
1292 static void btrfs_split_extent_hook(struct inode *inode,
1293 struct extent_state *orig, u64 split)
1295 /* not delalloc, ignore it */
1296 if (!(orig->state & EXTENT_DELALLOC))
1299 spin_lock(&BTRFS_I(inode)->lock);
1300 BTRFS_I(inode)->outstanding_extents++;
1301 spin_unlock(&BTRFS_I(inode)->lock);
1305 * extent_io.c merge_extent_hook, used to track merged delayed allocation
1306 * extents so we can keep track of new extents that are just merged onto old
1307 * extents, such as when we are doing sequential writes, so we can properly
1308 * account for the metadata space we'll need.
1310 static void btrfs_merge_extent_hook(struct inode *inode,
1311 struct extent_state *new,
1312 struct extent_state *other)
1314 /* not delalloc, ignore it */
1315 if (!(other->state & EXTENT_DELALLOC))
1318 spin_lock(&BTRFS_I(inode)->lock);
1319 BTRFS_I(inode)->outstanding_extents--;
1320 spin_unlock(&BTRFS_I(inode)->lock);
1324 * extent_io.c set_bit_hook, used to track delayed allocation
1325 * bytes in this file, and to maintain the list of inodes that
1326 * have pending delalloc work to be done.
1328 static void btrfs_set_bit_hook(struct inode *inode,
1329 struct extent_state *state, int *bits)
1333 * set_bit and clear bit hooks normally require _irqsave/restore
1334 * but in this case, we are only testing for the DELALLOC
1335 * bit, which is only set or cleared with irqs on
1337 if (!(state->state & EXTENT_DELALLOC) && (*bits & EXTENT_DELALLOC)) {
1338 struct btrfs_root *root = BTRFS_I(inode)->root;
1339 u64 len = state->end + 1 - state->start;
1340 bool do_list = !btrfs_is_free_space_inode(root, inode);
1342 if (*bits & EXTENT_FIRST_DELALLOC) {
1343 *bits &= ~EXTENT_FIRST_DELALLOC;
1345 spin_lock(&BTRFS_I(inode)->lock);
1346 BTRFS_I(inode)->outstanding_extents++;
1347 spin_unlock(&BTRFS_I(inode)->lock);
1350 spin_lock(&root->fs_info->delalloc_lock);
1351 BTRFS_I(inode)->delalloc_bytes += len;
1352 root->fs_info->delalloc_bytes += len;
1353 if (do_list && list_empty(&BTRFS_I(inode)->delalloc_inodes)) {
1354 list_add_tail(&BTRFS_I(inode)->delalloc_inodes,
1355 &root->fs_info->delalloc_inodes);
1357 spin_unlock(&root->fs_info->delalloc_lock);
1362 * extent_io.c clear_bit_hook, see set_bit_hook for why
1364 static void btrfs_clear_bit_hook(struct inode *inode,
1365 struct extent_state *state, int *bits)
1368 * set_bit and clear bit hooks normally require _irqsave/restore
1369 * but in this case, we are only testing for the DELALLOC
1370 * bit, which is only set or cleared with irqs on
1372 if ((state->state & EXTENT_DELALLOC) && (*bits & EXTENT_DELALLOC)) {
1373 struct btrfs_root *root = BTRFS_I(inode)->root;
1374 u64 len = state->end + 1 - state->start;
1375 bool do_list = !btrfs_is_free_space_inode(root, inode);
1377 if (*bits & EXTENT_FIRST_DELALLOC) {
1378 *bits &= ~EXTENT_FIRST_DELALLOC;
1379 } else if (!(*bits & EXTENT_DO_ACCOUNTING)) {
1380 spin_lock(&BTRFS_I(inode)->lock);
1381 BTRFS_I(inode)->outstanding_extents--;
1382 spin_unlock(&BTRFS_I(inode)->lock);
1385 if (*bits & EXTENT_DO_ACCOUNTING)
1386 btrfs_delalloc_release_metadata(inode, len);
1388 if (root->root_key.objectid != BTRFS_DATA_RELOC_TREE_OBJECTID
1390 btrfs_free_reserved_data_space(inode, len);
1392 spin_lock(&root->fs_info->delalloc_lock);
1393 root->fs_info->delalloc_bytes -= len;
1394 BTRFS_I(inode)->delalloc_bytes -= len;
1396 if (do_list && BTRFS_I(inode)->delalloc_bytes == 0 &&
1397 !list_empty(&BTRFS_I(inode)->delalloc_inodes)) {
1398 list_del_init(&BTRFS_I(inode)->delalloc_inodes);
1400 spin_unlock(&root->fs_info->delalloc_lock);
1405 * extent_io.c merge_bio_hook, this must check the chunk tree to make sure
1406 * we don't create bios that span stripes or chunks
1408 int btrfs_merge_bio_hook(struct page *page, unsigned long offset,
1409 size_t size, struct bio *bio,
1410 unsigned long bio_flags)
1412 struct btrfs_root *root = BTRFS_I(page->mapping->host)->root;
1413 struct btrfs_mapping_tree *map_tree;
1414 u64 logical = (u64)bio->bi_sector << 9;
1419 if (bio_flags & EXTENT_BIO_COMPRESSED)
1422 length = bio->bi_size;
1423 map_tree = &root->fs_info->mapping_tree;
1424 map_length = length;
1425 ret = btrfs_map_block(map_tree, READ, logical,
1426 &map_length, NULL, 0);
1428 if (map_length < length + size)
1434 * in order to insert checksums into the metadata in large chunks,
1435 * we wait until bio submission time. All the pages in the bio are
1436 * checksummed and sums are attached onto the ordered extent record.
1438 * At IO completion time the cums attached on the ordered extent record
1439 * are inserted into the btree
1441 static int __btrfs_submit_bio_start(struct inode *inode, int rw,
1442 struct bio *bio, int mirror_num,
1443 unsigned long bio_flags,
1446 struct btrfs_root *root = BTRFS_I(inode)->root;
1449 ret = btrfs_csum_one_bio(root, inode, bio, 0, 0);
1455 * in order to insert checksums into the metadata in large chunks,
1456 * we wait until bio submission time. All the pages in the bio are
1457 * checksummed and sums are attached onto the ordered extent record.
1459 * At IO completion time the cums attached on the ordered extent record
1460 * are inserted into the btree
1462 static int __btrfs_submit_bio_done(struct inode *inode, int rw, struct bio *bio,
1463 int mirror_num, unsigned long bio_flags,
1466 struct btrfs_root *root = BTRFS_I(inode)->root;
1467 return btrfs_map_bio(root, rw, bio, mirror_num, 1);
1471 * extent_io.c submission hook. This does the right thing for csum calculation
1472 * on write, or reading the csums from the tree before a read
1474 static int btrfs_submit_bio_hook(struct inode *inode, int rw, struct bio *bio,
1475 int mirror_num, unsigned long bio_flags,
1478 struct btrfs_root *root = BTRFS_I(inode)->root;
1482 skip_sum = BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM;
1484 if (btrfs_is_free_space_inode(root, inode))
1485 ret = btrfs_bio_wq_end_io(root->fs_info, bio, 2);
1487 ret = btrfs_bio_wq_end_io(root->fs_info, bio, 0);
1490 if (!(rw & REQ_WRITE)) {
1491 if (bio_flags & EXTENT_BIO_COMPRESSED) {
1492 return btrfs_submit_compressed_read(inode, bio,
1493 mirror_num, bio_flags);
1494 } else if (!skip_sum) {
1495 ret = btrfs_lookup_bio_sums(root, inode, bio, NULL);
1500 } else if (!skip_sum) {
1501 /* csum items have already been cloned */
1502 if (root->root_key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID)
1504 /* we're doing a write, do the async checksumming */
1505 return btrfs_wq_submit_bio(BTRFS_I(inode)->root->fs_info,
1506 inode, rw, bio, mirror_num,
1507 bio_flags, bio_offset,
1508 __btrfs_submit_bio_start,
1509 __btrfs_submit_bio_done);
1513 return btrfs_map_bio(root, rw, bio, mirror_num, 0);
1517 * given a list of ordered sums record them in the inode. This happens
1518 * at IO completion time based on sums calculated at bio submission time.
1520 static noinline int add_pending_csums(struct btrfs_trans_handle *trans,
1521 struct inode *inode, u64 file_offset,
1522 struct list_head *list)
1524 struct btrfs_ordered_sum *sum;
1526 list_for_each_entry(sum, list, list) {
1527 btrfs_csum_file_blocks(trans,
1528 BTRFS_I(inode)->root->fs_info->csum_root, sum);
1533 int btrfs_set_extent_delalloc(struct inode *inode, u64 start, u64 end,
1534 struct extent_state **cached_state)
1536 if ((end & (PAGE_CACHE_SIZE - 1)) == 0)
1538 return set_extent_delalloc(&BTRFS_I(inode)->io_tree, start, end,
1539 cached_state, GFP_NOFS);
1542 /* see btrfs_writepage_start_hook for details on why this is required */
1543 struct btrfs_writepage_fixup {
1545 struct btrfs_work work;
1548 static void btrfs_writepage_fixup_worker(struct btrfs_work *work)
1550 struct btrfs_writepage_fixup *fixup;
1551 struct btrfs_ordered_extent *ordered;
1552 struct extent_state *cached_state = NULL;
1554 struct inode *inode;
1558 fixup = container_of(work, struct btrfs_writepage_fixup, work);
1562 if (!page->mapping || !PageDirty(page) || !PageChecked(page)) {
1563 ClearPageChecked(page);
1567 inode = page->mapping->host;
1568 page_start = page_offset(page);
1569 page_end = page_offset(page) + PAGE_CACHE_SIZE - 1;
1571 lock_extent_bits(&BTRFS_I(inode)->io_tree, page_start, page_end, 0,
1572 &cached_state, GFP_NOFS);
1574 /* already ordered? We're done */
1575 if (PagePrivate2(page))
1578 ordered = btrfs_lookup_ordered_extent(inode, page_start);
1580 unlock_extent_cached(&BTRFS_I(inode)->io_tree, page_start,
1581 page_end, &cached_state, GFP_NOFS);
1583 btrfs_start_ordered_extent(inode, ordered, 1);
1588 btrfs_set_extent_delalloc(inode, page_start, page_end, &cached_state);
1589 ClearPageChecked(page);
1591 unlock_extent_cached(&BTRFS_I(inode)->io_tree, page_start, page_end,
1592 &cached_state, GFP_NOFS);
1595 page_cache_release(page);
1600 * There are a few paths in the higher layers of the kernel that directly
1601 * set the page dirty bit without asking the filesystem if it is a
1602 * good idea. This causes problems because we want to make sure COW
1603 * properly happens and the data=ordered rules are followed.
1605 * In our case any range that doesn't have the ORDERED bit set
1606 * hasn't been properly setup for IO. We kick off an async process
1607 * to fix it up. The async helper will wait for ordered extents, set
1608 * the delalloc bit and make it safe to write the page.
1610 static int btrfs_writepage_start_hook(struct page *page, u64 start, u64 end)
1612 struct inode *inode = page->mapping->host;
1613 struct btrfs_writepage_fixup *fixup;
1614 struct btrfs_root *root = BTRFS_I(inode)->root;
1616 /* this page is properly in the ordered list */
1617 if (TestClearPagePrivate2(page))
1620 if (PageChecked(page))
1623 fixup = kzalloc(sizeof(*fixup), GFP_NOFS);
1627 SetPageChecked(page);
1628 page_cache_get(page);
1629 fixup->work.func = btrfs_writepage_fixup_worker;
1631 btrfs_queue_worker(&root->fs_info->fixup_workers, &fixup->work);
1635 static int insert_reserved_file_extent(struct btrfs_trans_handle *trans,
1636 struct inode *inode, u64 file_pos,
1637 u64 disk_bytenr, u64 disk_num_bytes,
1638 u64 num_bytes, u64 ram_bytes,
1639 u8 compression, u8 encryption,
1640 u16 other_encoding, int extent_type)
1642 struct btrfs_root *root = BTRFS_I(inode)->root;
1643 struct btrfs_file_extent_item *fi;
1644 struct btrfs_path *path;
1645 struct extent_buffer *leaf;
1646 struct btrfs_key ins;
1650 path = btrfs_alloc_path();
1654 path->leave_spinning = 1;
1657 * we may be replacing one extent in the tree with another.
1658 * The new extent is pinned in the extent map, and we don't want
1659 * to drop it from the cache until it is completely in the btree.
1661 * So, tell btrfs_drop_extents to leave this extent in the cache.
1662 * the caller is expected to unpin it and allow it to be merged
1665 ret = btrfs_drop_extents(trans, inode, file_pos, file_pos + num_bytes,
1669 ins.objectid = btrfs_ino(inode);
1670 ins.offset = file_pos;
1671 ins.type = BTRFS_EXTENT_DATA_KEY;
1672 ret = btrfs_insert_empty_item(trans, root, path, &ins, sizeof(*fi));
1674 leaf = path->nodes[0];
1675 fi = btrfs_item_ptr(leaf, path->slots[0],
1676 struct btrfs_file_extent_item);
1677 btrfs_set_file_extent_generation(leaf, fi, trans->transid);
1678 btrfs_set_file_extent_type(leaf, fi, extent_type);
1679 btrfs_set_file_extent_disk_bytenr(leaf, fi, disk_bytenr);
1680 btrfs_set_file_extent_disk_num_bytes(leaf, fi, disk_num_bytes);
1681 btrfs_set_file_extent_offset(leaf, fi, 0);
1682 btrfs_set_file_extent_num_bytes(leaf, fi, num_bytes);
1683 btrfs_set_file_extent_ram_bytes(leaf, fi, ram_bytes);
1684 btrfs_set_file_extent_compression(leaf, fi, compression);
1685 btrfs_set_file_extent_encryption(leaf, fi, encryption);
1686 btrfs_set_file_extent_other_encoding(leaf, fi, other_encoding);
1688 btrfs_unlock_up_safe(path, 1);
1689 btrfs_set_lock_blocking(leaf);
1691 btrfs_mark_buffer_dirty(leaf);
1693 inode_add_bytes(inode, num_bytes);
1695 ins.objectid = disk_bytenr;
1696 ins.offset = disk_num_bytes;
1697 ins.type = BTRFS_EXTENT_ITEM_KEY;
1698 ret = btrfs_alloc_reserved_file_extent(trans, root,
1699 root->root_key.objectid,
1700 btrfs_ino(inode), file_pos, &ins);
1702 btrfs_free_path(path);
1708 * helper function for btrfs_finish_ordered_io, this
1709 * just reads in some of the csum leaves to prime them into ram
1710 * before we start the transaction. It limits the amount of btree
1711 * reads required while inside the transaction.
1713 /* as ordered data IO finishes, this gets called so we can finish
1714 * an ordered extent if the range of bytes in the file it covers are
1717 static int btrfs_finish_ordered_io(struct inode *inode, u64 start, u64 end)
1719 struct btrfs_root *root = BTRFS_I(inode)->root;
1720 struct btrfs_trans_handle *trans = NULL;
1721 struct btrfs_ordered_extent *ordered_extent = NULL;
1722 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
1723 struct extent_state *cached_state = NULL;
1724 int compress_type = 0;
1728 ret = btrfs_dec_test_ordered_pending(inode, &ordered_extent, start,
1732 BUG_ON(!ordered_extent);
1734 nolock = btrfs_is_free_space_inode(root, inode);
1736 if (test_bit(BTRFS_ORDERED_NOCOW, &ordered_extent->flags)) {
1737 BUG_ON(!list_empty(&ordered_extent->list));
1738 ret = btrfs_ordered_update_i_size(inode, 0, ordered_extent);
1741 trans = btrfs_join_transaction_nolock(root);
1743 trans = btrfs_join_transaction(root);
1744 BUG_ON(IS_ERR(trans));
1745 trans->block_rsv = &root->fs_info->delalloc_block_rsv;
1746 ret = btrfs_update_inode_fallback(trans, root, inode);
1752 lock_extent_bits(io_tree, ordered_extent->file_offset,
1753 ordered_extent->file_offset + ordered_extent->len - 1,
1754 0, &cached_state, GFP_NOFS);
1757 trans = btrfs_join_transaction_nolock(root);
1759 trans = btrfs_join_transaction(root);
1760 BUG_ON(IS_ERR(trans));
1761 trans->block_rsv = &root->fs_info->delalloc_block_rsv;
1763 if (test_bit(BTRFS_ORDERED_COMPRESSED, &ordered_extent->flags))
1764 compress_type = ordered_extent->compress_type;
1765 if (test_bit(BTRFS_ORDERED_PREALLOC, &ordered_extent->flags)) {
1766 BUG_ON(compress_type);
1767 ret = btrfs_mark_extent_written(trans, inode,
1768 ordered_extent->file_offset,
1769 ordered_extent->file_offset +
1770 ordered_extent->len);
1773 BUG_ON(root == root->fs_info->tree_root);
1774 ret = insert_reserved_file_extent(trans, inode,
1775 ordered_extent->file_offset,
1776 ordered_extent->start,
1777 ordered_extent->disk_len,
1778 ordered_extent->len,
1779 ordered_extent->len,
1780 compress_type, 0, 0,
1781 BTRFS_FILE_EXTENT_REG);
1782 unpin_extent_cache(&BTRFS_I(inode)->extent_tree,
1783 ordered_extent->file_offset,
1784 ordered_extent->len);
1787 unlock_extent_cached(io_tree, ordered_extent->file_offset,
1788 ordered_extent->file_offset +
1789 ordered_extent->len - 1, &cached_state, GFP_NOFS);
1791 add_pending_csums(trans, inode, ordered_extent->file_offset,
1792 &ordered_extent->list);
1794 ret = btrfs_ordered_update_i_size(inode, 0, ordered_extent);
1795 if (!ret || !test_bit(BTRFS_ORDERED_PREALLOC, &ordered_extent->flags)) {
1796 ret = btrfs_update_inode_fallback(trans, root, inode);
1801 if (root != root->fs_info->tree_root)
1802 btrfs_delalloc_release_metadata(inode, ordered_extent->len);
1805 btrfs_end_transaction_nolock(trans, root);
1807 btrfs_end_transaction(trans, root);
1811 btrfs_put_ordered_extent(ordered_extent);
1812 /* once for the tree */
1813 btrfs_put_ordered_extent(ordered_extent);
1818 static int btrfs_writepage_end_io_hook(struct page *page, u64 start, u64 end,
1819 struct extent_state *state, int uptodate)
1821 trace_btrfs_writepage_end_io_hook(page, start, end, uptodate);
1823 ClearPagePrivate2(page);
1824 return btrfs_finish_ordered_io(page->mapping->host, start, end);
1828 * when reads are done, we need to check csums to verify the data is correct
1829 * if there's a match, we allow the bio to finish. If not, the code in
1830 * extent_io.c will try to find good copies for us.
1832 static int btrfs_readpage_end_io_hook(struct page *page, u64 start, u64 end,
1833 struct extent_state *state)
1835 size_t offset = start - ((u64)page->index << PAGE_CACHE_SHIFT);
1836 struct inode *inode = page->mapping->host;
1837 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
1839 u64 private = ~(u32)0;
1841 struct btrfs_root *root = BTRFS_I(inode)->root;
1844 if (PageChecked(page)) {
1845 ClearPageChecked(page);
1849 if (BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM)
1852 if (root->root_key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID &&
1853 test_range_bit(io_tree, start, end, EXTENT_NODATASUM, 1, NULL)) {
1854 clear_extent_bits(io_tree, start, end, EXTENT_NODATASUM,
1859 if (state && state->start == start) {
1860 private = state->private;
1863 ret = get_state_private(io_tree, start, &private);
1865 kaddr = kmap_atomic(page, KM_USER0);
1869 csum = btrfs_csum_data(root, kaddr + offset, csum, end - start + 1);
1870 btrfs_csum_final(csum, (char *)&csum);
1871 if (csum != private)
1874 kunmap_atomic(kaddr, KM_USER0);
1879 printk_ratelimited(KERN_INFO "btrfs csum failed ino %llu off %llu csum %u "
1881 (unsigned long long)btrfs_ino(page->mapping->host),
1882 (unsigned long long)start, csum,
1883 (unsigned long long)private);
1884 memset(kaddr + offset, 1, end - start + 1);
1885 flush_dcache_page(page);
1886 kunmap_atomic(kaddr, KM_USER0);
1892 struct delayed_iput {
1893 struct list_head list;
1894 struct inode *inode;
1897 void btrfs_add_delayed_iput(struct inode *inode)
1899 struct btrfs_fs_info *fs_info = BTRFS_I(inode)->root->fs_info;
1900 struct delayed_iput *delayed;
1902 if (atomic_add_unless(&inode->i_count, -1, 1))
1905 delayed = kmalloc(sizeof(*delayed), GFP_NOFS | __GFP_NOFAIL);
1906 delayed->inode = inode;
1908 spin_lock(&fs_info->delayed_iput_lock);
1909 list_add_tail(&delayed->list, &fs_info->delayed_iputs);
1910 spin_unlock(&fs_info->delayed_iput_lock);
1913 void btrfs_run_delayed_iputs(struct btrfs_root *root)
1916 struct btrfs_fs_info *fs_info = root->fs_info;
1917 struct delayed_iput *delayed;
1920 spin_lock(&fs_info->delayed_iput_lock);
1921 empty = list_empty(&fs_info->delayed_iputs);
1922 spin_unlock(&fs_info->delayed_iput_lock);
1926 down_read(&root->fs_info->cleanup_work_sem);
1927 spin_lock(&fs_info->delayed_iput_lock);
1928 list_splice_init(&fs_info->delayed_iputs, &list);
1929 spin_unlock(&fs_info->delayed_iput_lock);
1931 while (!list_empty(&list)) {
1932 delayed = list_entry(list.next, struct delayed_iput, list);
1933 list_del(&delayed->list);
1934 iput(delayed->inode);
1937 up_read(&root->fs_info->cleanup_work_sem);
1940 enum btrfs_orphan_cleanup_state {
1941 ORPHAN_CLEANUP_STARTED = 1,
1942 ORPHAN_CLEANUP_DONE = 2,
1946 * This is called in transaction commmit time. If there are no orphan
1947 * files in the subvolume, it removes orphan item and frees block_rsv
1950 void btrfs_orphan_commit_root(struct btrfs_trans_handle *trans,
1951 struct btrfs_root *root)
1955 if (!list_empty(&root->orphan_list) ||
1956 root->orphan_cleanup_state != ORPHAN_CLEANUP_DONE)
1959 if (root->orphan_item_inserted &&
1960 btrfs_root_refs(&root->root_item) > 0) {
1961 ret = btrfs_del_orphan_item(trans, root->fs_info->tree_root,
1962 root->root_key.objectid);
1964 root->orphan_item_inserted = 0;
1967 if (root->orphan_block_rsv) {
1968 WARN_ON(root->orphan_block_rsv->size > 0);
1969 btrfs_free_block_rsv(root, root->orphan_block_rsv);
1970 root->orphan_block_rsv = NULL;
1975 * This creates an orphan entry for the given inode in case something goes
1976 * wrong in the middle of an unlink/truncate.
1978 * NOTE: caller of this function should reserve 5 units of metadata for
1981 int btrfs_orphan_add(struct btrfs_trans_handle *trans, struct inode *inode)
1983 struct btrfs_root *root = BTRFS_I(inode)->root;
1984 struct btrfs_block_rsv *block_rsv = NULL;
1989 if (!root->orphan_block_rsv) {
1990 block_rsv = btrfs_alloc_block_rsv(root);
1995 spin_lock(&root->orphan_lock);
1996 if (!root->orphan_block_rsv) {
1997 root->orphan_block_rsv = block_rsv;
1998 } else if (block_rsv) {
1999 btrfs_free_block_rsv(root, block_rsv);
2003 if (list_empty(&BTRFS_I(inode)->i_orphan)) {
2004 list_add(&BTRFS_I(inode)->i_orphan, &root->orphan_list);
2007 * For proper ENOSPC handling, we should do orphan
2008 * cleanup when mounting. But this introduces backward
2009 * compatibility issue.
2011 if (!xchg(&root->orphan_item_inserted, 1))
2019 if (!BTRFS_I(inode)->orphan_meta_reserved) {
2020 BTRFS_I(inode)->orphan_meta_reserved = 1;
2023 spin_unlock(&root->orphan_lock);
2025 /* grab metadata reservation from transaction handle */
2027 ret = btrfs_orphan_reserve_metadata(trans, inode);
2031 /* insert an orphan item to track this unlinked/truncated file */
2033 ret = btrfs_insert_orphan_item(trans, root, btrfs_ino(inode));
2037 /* insert an orphan item to track subvolume contains orphan files */
2039 ret = btrfs_insert_orphan_item(trans, root->fs_info->tree_root,
2040 root->root_key.objectid);
2047 * We have done the truncate/delete so we can go ahead and remove the orphan
2048 * item for this particular inode.
2050 int btrfs_orphan_del(struct btrfs_trans_handle *trans, struct inode *inode)
2052 struct btrfs_root *root = BTRFS_I(inode)->root;
2053 int delete_item = 0;
2054 int release_rsv = 0;
2057 spin_lock(&root->orphan_lock);
2058 if (!list_empty(&BTRFS_I(inode)->i_orphan)) {
2059 list_del_init(&BTRFS_I(inode)->i_orphan);
2063 if (BTRFS_I(inode)->orphan_meta_reserved) {
2064 BTRFS_I(inode)->orphan_meta_reserved = 0;
2067 spin_unlock(&root->orphan_lock);
2069 if (trans && delete_item) {
2070 ret = btrfs_del_orphan_item(trans, root, btrfs_ino(inode));
2075 btrfs_orphan_release_metadata(inode);
2081 * this cleans up any orphans that may be left on the list from the last use
2084 int btrfs_orphan_cleanup(struct btrfs_root *root)
2086 struct btrfs_path *path;
2087 struct extent_buffer *leaf;
2088 struct btrfs_key key, found_key;
2089 struct btrfs_trans_handle *trans;
2090 struct inode *inode;
2091 u64 last_objectid = 0;
2092 int ret = 0, nr_unlink = 0, nr_truncate = 0;
2094 if (cmpxchg(&root->orphan_cleanup_state, 0, ORPHAN_CLEANUP_STARTED))
2097 path = btrfs_alloc_path();
2104 key.objectid = BTRFS_ORPHAN_OBJECTID;
2105 btrfs_set_key_type(&key, BTRFS_ORPHAN_ITEM_KEY);
2106 key.offset = (u64)-1;
2109 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
2114 * if ret == 0 means we found what we were searching for, which
2115 * is weird, but possible, so only screw with path if we didn't
2116 * find the key and see if we have stuff that matches
2120 if (path->slots[0] == 0)
2125 /* pull out the item */
2126 leaf = path->nodes[0];
2127 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
2129 /* make sure the item matches what we want */
2130 if (found_key.objectid != BTRFS_ORPHAN_OBJECTID)
2132 if (btrfs_key_type(&found_key) != BTRFS_ORPHAN_ITEM_KEY)
2135 /* release the path since we're done with it */
2136 btrfs_release_path(path);
2139 * this is where we are basically btrfs_lookup, without the
2140 * crossing root thing. we store the inode number in the
2141 * offset of the orphan item.
2144 if (found_key.offset == last_objectid) {
2145 printk(KERN_ERR "btrfs: Error removing orphan entry, "
2146 "stopping orphan cleanup\n");
2151 last_objectid = found_key.offset;
2153 found_key.objectid = found_key.offset;
2154 found_key.type = BTRFS_INODE_ITEM_KEY;
2155 found_key.offset = 0;
2156 inode = btrfs_iget(root->fs_info->sb, &found_key, root, NULL);
2157 ret = PTR_RET(inode);
2158 if (ret && ret != -ESTALE)
2161 if (ret == -ESTALE && root == root->fs_info->tree_root) {
2162 struct btrfs_root *dead_root;
2163 struct btrfs_fs_info *fs_info = root->fs_info;
2164 int is_dead_root = 0;
2167 * this is an orphan in the tree root. Currently these
2168 * could come from 2 sources:
2169 * a) a snapshot deletion in progress
2170 * b) a free space cache inode
2171 * We need to distinguish those two, as the snapshot
2172 * orphan must not get deleted.
2173 * find_dead_roots already ran before us, so if this
2174 * is a snapshot deletion, we should find the root
2175 * in the dead_roots list
2177 spin_lock(&fs_info->trans_lock);
2178 list_for_each_entry(dead_root, &fs_info->dead_roots,
2180 if (dead_root->root_key.objectid ==
2181 found_key.objectid) {
2186 spin_unlock(&fs_info->trans_lock);
2188 /* prevent this orphan from being found again */
2189 key.offset = found_key.objectid - 1;
2194 * Inode is already gone but the orphan item is still there,
2195 * kill the orphan item.
2197 if (ret == -ESTALE) {
2198 trans = btrfs_start_transaction(root, 1);
2199 if (IS_ERR(trans)) {
2200 ret = PTR_ERR(trans);
2203 ret = btrfs_del_orphan_item(trans, root,
2204 found_key.objectid);
2206 btrfs_end_transaction(trans, root);
2211 * add this inode to the orphan list so btrfs_orphan_del does
2212 * the proper thing when we hit it
2214 spin_lock(&root->orphan_lock);
2215 list_add(&BTRFS_I(inode)->i_orphan, &root->orphan_list);
2216 spin_unlock(&root->orphan_lock);
2218 /* if we have links, this was a truncate, lets do that */
2219 if (inode->i_nlink) {
2220 if (!S_ISREG(inode->i_mode)) {
2226 ret = btrfs_truncate(inode);
2231 /* this will do delete_inode and everything for us */
2236 /* release the path since we're done with it */
2237 btrfs_release_path(path);
2239 root->orphan_cleanup_state = ORPHAN_CLEANUP_DONE;
2241 if (root->orphan_block_rsv)
2242 btrfs_block_rsv_release(root, root->orphan_block_rsv,
2245 if (root->orphan_block_rsv || root->orphan_item_inserted) {
2246 trans = btrfs_join_transaction(root);
2248 btrfs_end_transaction(trans, root);
2252 printk(KERN_INFO "btrfs: unlinked %d orphans\n", nr_unlink);
2254 printk(KERN_INFO "btrfs: truncated %d orphans\n", nr_truncate);
2258 printk(KERN_CRIT "btrfs: could not do orphan cleanup %d\n", ret);
2259 btrfs_free_path(path);
2264 * very simple check to peek ahead in the leaf looking for xattrs. If we
2265 * don't find any xattrs, we know there can't be any acls.
2267 * slot is the slot the inode is in, objectid is the objectid of the inode
2269 static noinline int acls_after_inode_item(struct extent_buffer *leaf,
2270 int slot, u64 objectid)
2272 u32 nritems = btrfs_header_nritems(leaf);
2273 struct btrfs_key found_key;
2277 while (slot < nritems) {
2278 btrfs_item_key_to_cpu(leaf, &found_key, slot);
2280 /* we found a different objectid, there must not be acls */
2281 if (found_key.objectid != objectid)
2284 /* we found an xattr, assume we've got an acl */
2285 if (found_key.type == BTRFS_XATTR_ITEM_KEY)
2289 * we found a key greater than an xattr key, there can't
2290 * be any acls later on
2292 if (found_key.type > BTRFS_XATTR_ITEM_KEY)
2299 * it goes inode, inode backrefs, xattrs, extents,
2300 * so if there are a ton of hard links to an inode there can
2301 * be a lot of backrefs. Don't waste time searching too hard,
2302 * this is just an optimization
2307 /* we hit the end of the leaf before we found an xattr or
2308 * something larger than an xattr. We have to assume the inode
2315 * read an inode from the btree into the in-memory inode
2317 static void btrfs_read_locked_inode(struct inode *inode)
2319 struct btrfs_path *path;
2320 struct extent_buffer *leaf;
2321 struct btrfs_inode_item *inode_item;
2322 struct btrfs_timespec *tspec;
2323 struct btrfs_root *root = BTRFS_I(inode)->root;
2324 struct btrfs_key location;
2328 bool filled = false;
2330 ret = btrfs_fill_inode(inode, &rdev);
2334 path = btrfs_alloc_path();
2338 path->leave_spinning = 1;
2339 memcpy(&location, &BTRFS_I(inode)->location, sizeof(location));
2341 ret = btrfs_lookup_inode(NULL, root, path, &location, 0);
2345 leaf = path->nodes[0];
2350 inode_item = btrfs_item_ptr(leaf, path->slots[0],
2351 struct btrfs_inode_item);
2352 inode->i_mode = btrfs_inode_mode(leaf, inode_item);
2353 inode->i_nlink = btrfs_inode_nlink(leaf, inode_item);
2354 inode->i_uid = btrfs_inode_uid(leaf, inode_item);
2355 inode->i_gid = btrfs_inode_gid(leaf, inode_item);
2356 btrfs_i_size_write(inode, btrfs_inode_size(leaf, inode_item));
2358 tspec = btrfs_inode_atime(inode_item);
2359 inode->i_atime.tv_sec = btrfs_timespec_sec(leaf, tspec);
2360 inode->i_atime.tv_nsec = btrfs_timespec_nsec(leaf, tspec);
2362 tspec = btrfs_inode_mtime(inode_item);
2363 inode->i_mtime.tv_sec = btrfs_timespec_sec(leaf, tspec);
2364 inode->i_mtime.tv_nsec = btrfs_timespec_nsec(leaf, tspec);
2366 tspec = btrfs_inode_ctime(inode_item);
2367 inode->i_ctime.tv_sec = btrfs_timespec_sec(leaf, tspec);
2368 inode->i_ctime.tv_nsec = btrfs_timespec_nsec(leaf, tspec);
2370 inode_set_bytes(inode, btrfs_inode_nbytes(leaf, inode_item));
2371 BTRFS_I(inode)->generation = btrfs_inode_generation(leaf, inode_item);
2372 BTRFS_I(inode)->sequence = btrfs_inode_sequence(leaf, inode_item);
2373 inode->i_generation = BTRFS_I(inode)->generation;
2375 rdev = btrfs_inode_rdev(leaf, inode_item);
2377 BTRFS_I(inode)->index_cnt = (u64)-1;
2378 BTRFS_I(inode)->flags = btrfs_inode_flags(leaf, inode_item);
2381 * try to precache a NULL acl entry for files that don't have
2382 * any xattrs or acls
2384 maybe_acls = acls_after_inode_item(leaf, path->slots[0],
2387 cache_no_acl(inode);
2389 btrfs_free_path(path);
2391 switch (inode->i_mode & S_IFMT) {
2393 inode->i_mapping->a_ops = &btrfs_aops;
2394 inode->i_mapping->backing_dev_info = &root->fs_info->bdi;
2395 BTRFS_I(inode)->io_tree.ops = &btrfs_extent_io_ops;
2396 inode->i_fop = &btrfs_file_operations;
2397 inode->i_op = &btrfs_file_inode_operations;
2400 inode->i_fop = &btrfs_dir_file_operations;
2401 if (root == root->fs_info->tree_root)
2402 inode->i_op = &btrfs_dir_ro_inode_operations;
2404 inode->i_op = &btrfs_dir_inode_operations;
2407 inode->i_op = &btrfs_symlink_inode_operations;
2408 inode->i_mapping->a_ops = &btrfs_symlink_aops;
2409 inode->i_mapping->backing_dev_info = &root->fs_info->bdi;
2412 inode->i_op = &btrfs_special_inode_operations;
2413 init_special_inode(inode, inode->i_mode, rdev);
2417 btrfs_update_iflags(inode);
2421 btrfs_free_path(path);
2422 make_bad_inode(inode);
2426 * given a leaf and an inode, copy the inode fields into the leaf
2428 static void fill_inode_item(struct btrfs_trans_handle *trans,
2429 struct extent_buffer *leaf,
2430 struct btrfs_inode_item *item,
2431 struct inode *inode)
2433 btrfs_set_inode_uid(leaf, item, inode->i_uid);
2434 btrfs_set_inode_gid(leaf, item, inode->i_gid);
2435 btrfs_set_inode_size(leaf, item, BTRFS_I(inode)->disk_i_size);
2436 btrfs_set_inode_mode(leaf, item, inode->i_mode);
2437 btrfs_set_inode_nlink(leaf, item, inode->i_nlink);
2439 btrfs_set_timespec_sec(leaf, btrfs_inode_atime(item),
2440 inode->i_atime.tv_sec);
2441 btrfs_set_timespec_nsec(leaf, btrfs_inode_atime(item),
2442 inode->i_atime.tv_nsec);
2444 btrfs_set_timespec_sec(leaf, btrfs_inode_mtime(item),
2445 inode->i_mtime.tv_sec);
2446 btrfs_set_timespec_nsec(leaf, btrfs_inode_mtime(item),
2447 inode->i_mtime.tv_nsec);
2449 btrfs_set_timespec_sec(leaf, btrfs_inode_ctime(item),
2450 inode->i_ctime.tv_sec);
2451 btrfs_set_timespec_nsec(leaf, btrfs_inode_ctime(item),
2452 inode->i_ctime.tv_nsec);
2454 btrfs_set_inode_nbytes(leaf, item, inode_get_bytes(inode));
2455 btrfs_set_inode_generation(leaf, item, BTRFS_I(inode)->generation);
2456 btrfs_set_inode_sequence(leaf, item, BTRFS_I(inode)->sequence);
2457 btrfs_set_inode_transid(leaf, item, trans->transid);
2458 btrfs_set_inode_rdev(leaf, item, inode->i_rdev);
2459 btrfs_set_inode_flags(leaf, item, BTRFS_I(inode)->flags);
2460 btrfs_set_inode_block_group(leaf, item, 0);
2464 * copy everything in the in-memory inode into the btree.
2466 static noinline int btrfs_update_inode_item(struct btrfs_trans_handle *trans,
2467 struct btrfs_root *root, struct inode *inode)
2469 struct btrfs_inode_item *inode_item;
2470 struct btrfs_path *path;
2471 struct extent_buffer *leaf;
2474 path = btrfs_alloc_path();
2478 path->leave_spinning = 1;
2479 ret = btrfs_lookup_inode(trans, root, path, &BTRFS_I(inode)->location,
2487 btrfs_unlock_up_safe(path, 1);
2488 leaf = path->nodes[0];
2489 inode_item = btrfs_item_ptr(leaf, path->slots[0],
2490 struct btrfs_inode_item);
2492 fill_inode_item(trans, leaf, inode_item, inode);
2493 btrfs_mark_buffer_dirty(leaf);
2494 btrfs_set_inode_last_trans(trans, inode);
2497 btrfs_free_path(path);
2502 * copy everything in the in-memory inode into the btree.
2504 noinline int btrfs_update_inode(struct btrfs_trans_handle *trans,
2505 struct btrfs_root *root, struct inode *inode)
2510 * If the inode is a free space inode, we can deadlock during commit
2511 * if we put it into the delayed code.
2513 * The data relocation inode should also be directly updated
2516 if (!btrfs_is_free_space_inode(root, inode)
2517 && root->root_key.objectid != BTRFS_DATA_RELOC_TREE_OBJECTID) {
2518 ret = btrfs_delayed_update_inode(trans, root, inode);
2520 btrfs_set_inode_last_trans(trans, inode);
2524 return btrfs_update_inode_item(trans, root, inode);
2527 static noinline int btrfs_update_inode_fallback(struct btrfs_trans_handle *trans,
2528 struct btrfs_root *root, struct inode *inode)
2532 ret = btrfs_update_inode(trans, root, inode);
2534 return btrfs_update_inode_item(trans, root, inode);
2539 * unlink helper that gets used here in inode.c and in the tree logging
2540 * recovery code. It remove a link in a directory with a given name, and
2541 * also drops the back refs in the inode to the directory
2543 static int __btrfs_unlink_inode(struct btrfs_trans_handle *trans,
2544 struct btrfs_root *root,
2545 struct inode *dir, struct inode *inode,
2546 const char *name, int name_len)
2548 struct btrfs_path *path;
2550 struct extent_buffer *leaf;
2551 struct btrfs_dir_item *di;
2552 struct btrfs_key key;
2554 u64 ino = btrfs_ino(inode);
2555 u64 dir_ino = btrfs_ino(dir);
2557 path = btrfs_alloc_path();
2563 path->leave_spinning = 1;
2564 di = btrfs_lookup_dir_item(trans, root, path, dir_ino,
2565 name, name_len, -1);
2574 leaf = path->nodes[0];
2575 btrfs_dir_item_key_to_cpu(leaf, di, &key);
2576 ret = btrfs_delete_one_dir_name(trans, root, path, di);
2579 btrfs_release_path(path);
2581 ret = btrfs_del_inode_ref(trans, root, name, name_len, ino,
2584 printk(KERN_INFO "btrfs failed to delete reference to %.*s, "
2585 "inode %llu parent %llu\n", name_len, name,
2586 (unsigned long long)ino, (unsigned long long)dir_ino);
2590 ret = btrfs_delete_delayed_dir_index(trans, root, dir, index);
2594 ret = btrfs_del_inode_ref_in_log(trans, root, name, name_len,
2596 BUG_ON(ret != 0 && ret != -ENOENT);
2598 ret = btrfs_del_dir_entries_in_log(trans, root, name, name_len,
2603 btrfs_free_path(path);
2607 btrfs_i_size_write(dir, dir->i_size - name_len * 2);
2608 inode->i_ctime = dir->i_mtime = dir->i_ctime = CURRENT_TIME;
2609 btrfs_update_inode(trans, root, dir);
2614 int btrfs_unlink_inode(struct btrfs_trans_handle *trans,
2615 struct btrfs_root *root,
2616 struct inode *dir, struct inode *inode,
2617 const char *name, int name_len)
2620 ret = __btrfs_unlink_inode(trans, root, dir, inode, name, name_len);
2622 btrfs_drop_nlink(inode);
2623 ret = btrfs_update_inode(trans, root, inode);
2629 /* helper to check if there is any shared block in the path */
2630 static int check_path_shared(struct btrfs_root *root,
2631 struct btrfs_path *path)
2633 struct extent_buffer *eb;
2637 for (level = 0; level < BTRFS_MAX_LEVEL; level++) {
2640 if (!path->nodes[level])
2642 eb = path->nodes[level];
2643 if (!btrfs_block_can_be_shared(root, eb))
2645 ret = btrfs_lookup_extent_info(NULL, root, eb->start, eb->len,
2654 * helper to start transaction for unlink and rmdir.
2656 * unlink and rmdir are special in btrfs, they do not always free space.
2657 * so in enospc case, we should make sure they will free space before
2658 * allowing them to use the global metadata reservation.
2660 static struct btrfs_trans_handle *__unlink_start_trans(struct inode *dir,
2661 struct dentry *dentry)
2663 struct btrfs_trans_handle *trans;
2664 struct btrfs_root *root = BTRFS_I(dir)->root;
2665 struct btrfs_path *path;
2666 struct btrfs_inode_ref *ref;
2667 struct btrfs_dir_item *di;
2668 struct inode *inode = dentry->d_inode;
2673 u64 ino = btrfs_ino(inode);
2674 u64 dir_ino = btrfs_ino(dir);
2677 * 1 for the possible orphan item
2678 * 1 for the dir item
2679 * 1 for the dir index
2680 * 1 for the inode ref
2681 * 1 for the inode ref in the tree log
2682 * 2 for the dir entries in the log
2685 trans = btrfs_start_transaction(root, 8);
2686 if (!IS_ERR(trans) || PTR_ERR(trans) != -ENOSPC)
2689 if (ino == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID)
2690 return ERR_PTR(-ENOSPC);
2692 /* check if there is someone else holds reference */
2693 if (S_ISDIR(inode->i_mode) && atomic_read(&inode->i_count) > 1)
2694 return ERR_PTR(-ENOSPC);
2696 if (atomic_read(&inode->i_count) > 2)
2697 return ERR_PTR(-ENOSPC);
2699 if (xchg(&root->fs_info->enospc_unlink, 1))
2700 return ERR_PTR(-ENOSPC);
2702 path = btrfs_alloc_path();
2704 root->fs_info->enospc_unlink = 0;
2705 return ERR_PTR(-ENOMEM);
2708 /* 1 for the orphan item */
2709 trans = btrfs_start_transaction(root, 1);
2710 if (IS_ERR(trans)) {
2711 btrfs_free_path(path);
2712 root->fs_info->enospc_unlink = 0;
2716 path->skip_locking = 1;
2717 path->search_commit_root = 1;
2719 ret = btrfs_lookup_inode(trans, root, path,
2720 &BTRFS_I(dir)->location, 0);
2726 if (check_path_shared(root, path))
2731 btrfs_release_path(path);
2733 ret = btrfs_lookup_inode(trans, root, path,
2734 &BTRFS_I(inode)->location, 0);
2740 if (check_path_shared(root, path))
2745 btrfs_release_path(path);
2747 if (ret == 0 && S_ISREG(inode->i_mode)) {
2748 ret = btrfs_lookup_file_extent(trans, root, path,
2755 if (check_path_shared(root, path))
2757 btrfs_release_path(path);
2765 di = btrfs_lookup_dir_item(trans, root, path, dir_ino,
2766 dentry->d_name.name, dentry->d_name.len, 0);
2772 if (check_path_shared(root, path))
2778 btrfs_release_path(path);
2780 ref = btrfs_lookup_inode_ref(trans, root, path,
2781 dentry->d_name.name, dentry->d_name.len,
2788 if (check_path_shared(root, path))
2790 index = btrfs_inode_ref_index(path->nodes[0], ref);
2791 btrfs_release_path(path);
2794 * This is a commit root search, if we can lookup inode item and other
2795 * relative items in the commit root, it means the transaction of
2796 * dir/file creation has been committed, and the dir index item that we
2797 * delay to insert has also been inserted into the commit root. So
2798 * we needn't worry about the delayed insertion of the dir index item
2801 di = btrfs_lookup_dir_index_item(trans, root, path, dir_ino, index,
2802 dentry->d_name.name, dentry->d_name.len, 0);
2807 BUG_ON(ret == -ENOENT);
2808 if (check_path_shared(root, path))
2813 btrfs_free_path(path);
2814 /* Migrate the orphan reservation over */
2816 err = btrfs_block_rsv_migrate(trans->block_rsv,
2817 &root->fs_info->global_block_rsv,
2818 trans->bytes_reserved);
2821 btrfs_end_transaction(trans, root);
2822 root->fs_info->enospc_unlink = 0;
2823 return ERR_PTR(err);
2826 trans->block_rsv = &root->fs_info->global_block_rsv;
2830 static void __unlink_end_trans(struct btrfs_trans_handle *trans,
2831 struct btrfs_root *root)
2833 if (trans->block_rsv == &root->fs_info->global_block_rsv) {
2834 btrfs_block_rsv_release(root, trans->block_rsv,
2835 trans->bytes_reserved);
2836 trans->block_rsv = &root->fs_info->trans_block_rsv;
2837 BUG_ON(!root->fs_info->enospc_unlink);
2838 root->fs_info->enospc_unlink = 0;
2840 btrfs_end_transaction_throttle(trans, root);
2843 static int btrfs_unlink(struct inode *dir, struct dentry *dentry)
2845 struct btrfs_root *root = BTRFS_I(dir)->root;
2846 struct btrfs_trans_handle *trans;
2847 struct inode *inode = dentry->d_inode;
2849 unsigned long nr = 0;
2851 trans = __unlink_start_trans(dir, dentry);
2853 return PTR_ERR(trans);
2855 btrfs_record_unlink_dir(trans, dir, dentry->d_inode, 0);
2857 ret = btrfs_unlink_inode(trans, root, dir, dentry->d_inode,
2858 dentry->d_name.name, dentry->d_name.len);
2862 if (inode->i_nlink == 0) {
2863 ret = btrfs_orphan_add(trans, inode);
2869 nr = trans->blocks_used;
2870 __unlink_end_trans(trans, root);
2871 btrfs_btree_balance_dirty(root, nr);
2875 int btrfs_unlink_subvol(struct btrfs_trans_handle *trans,
2876 struct btrfs_root *root,
2877 struct inode *dir, u64 objectid,
2878 const char *name, int name_len)
2880 struct btrfs_path *path;
2881 struct extent_buffer *leaf;
2882 struct btrfs_dir_item *di;
2883 struct btrfs_key key;
2886 u64 dir_ino = btrfs_ino(dir);
2888 path = btrfs_alloc_path();
2892 di = btrfs_lookup_dir_item(trans, root, path, dir_ino,
2893 name, name_len, -1);
2894 BUG_ON(IS_ERR_OR_NULL(di));
2896 leaf = path->nodes[0];
2897 btrfs_dir_item_key_to_cpu(leaf, di, &key);
2898 WARN_ON(key.type != BTRFS_ROOT_ITEM_KEY || key.objectid != objectid);
2899 ret = btrfs_delete_one_dir_name(trans, root, path, di);
2901 btrfs_release_path(path);
2903 ret = btrfs_del_root_ref(trans, root->fs_info->tree_root,
2904 objectid, root->root_key.objectid,
2905 dir_ino, &index, name, name_len);
2907 BUG_ON(ret != -ENOENT);
2908 di = btrfs_search_dir_index_item(root, path, dir_ino,
2910 BUG_ON(IS_ERR_OR_NULL(di));
2912 leaf = path->nodes[0];
2913 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
2914 btrfs_release_path(path);
2917 btrfs_release_path(path);
2919 ret = btrfs_delete_delayed_dir_index(trans, root, dir, index);
2922 btrfs_i_size_write(dir, dir->i_size - name_len * 2);
2923 dir->i_mtime = dir->i_ctime = CURRENT_TIME;
2924 ret = btrfs_update_inode(trans, root, dir);
2927 btrfs_free_path(path);
2931 static int btrfs_rmdir(struct inode *dir, struct dentry *dentry)
2933 struct inode *inode = dentry->d_inode;
2935 struct btrfs_root *root = BTRFS_I(dir)->root;
2936 struct btrfs_trans_handle *trans;
2937 unsigned long nr = 0;
2939 if (inode->i_size > BTRFS_EMPTY_DIR_SIZE ||
2940 btrfs_ino(inode) == BTRFS_FIRST_FREE_OBJECTID)
2943 trans = __unlink_start_trans(dir, dentry);
2945 return PTR_ERR(trans);
2947 if (unlikely(btrfs_ino(inode) == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID)) {
2948 err = btrfs_unlink_subvol(trans, root, dir,
2949 BTRFS_I(inode)->location.objectid,
2950 dentry->d_name.name,
2951 dentry->d_name.len);
2955 err = btrfs_orphan_add(trans, inode);
2959 /* now the directory is empty */
2960 err = btrfs_unlink_inode(trans, root, dir, dentry->d_inode,
2961 dentry->d_name.name, dentry->d_name.len);
2963 btrfs_i_size_write(inode, 0);
2965 nr = trans->blocks_used;
2966 __unlink_end_trans(trans, root);
2967 btrfs_btree_balance_dirty(root, nr);
2973 * this can truncate away extent items, csum items and directory items.
2974 * It starts at a high offset and removes keys until it can't find
2975 * any higher than new_size
2977 * csum items that cross the new i_size are truncated to the new size
2980 * min_type is the minimum key type to truncate down to. If set to 0, this
2981 * will kill all the items on this inode, including the INODE_ITEM_KEY.
2983 int btrfs_truncate_inode_items(struct btrfs_trans_handle *trans,
2984 struct btrfs_root *root,
2985 struct inode *inode,
2986 u64 new_size, u32 min_type)
2988 struct btrfs_path *path;
2989 struct extent_buffer *leaf;
2990 struct btrfs_file_extent_item *fi;
2991 struct btrfs_key key;
2992 struct btrfs_key found_key;
2993 u64 extent_start = 0;
2994 u64 extent_num_bytes = 0;
2995 u64 extent_offset = 0;
2997 u64 mask = root->sectorsize - 1;
2998 u32 found_type = (u8)-1;
3001 int pending_del_nr = 0;
3002 int pending_del_slot = 0;
3003 int extent_type = -1;
3007 u64 ino = btrfs_ino(inode);
3009 BUG_ON(new_size > 0 && min_type != BTRFS_EXTENT_DATA_KEY);
3011 path = btrfs_alloc_path();
3016 if (root->ref_cows || root == root->fs_info->tree_root)
3017 btrfs_drop_extent_cache(inode, new_size & (~mask), (u64)-1, 0);
3020 * This function is also used to drop the items in the log tree before
3021 * we relog the inode, so if root != BTRFS_I(inode)->root, it means
3022 * it is used to drop the loged items. So we shouldn't kill the delayed
3025 if (min_type == 0 && root == BTRFS_I(inode)->root)
3026 btrfs_kill_delayed_inode_items(inode);
3029 key.offset = (u64)-1;
3033 path->leave_spinning = 1;
3034 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
3041 /* there are no items in the tree for us to truncate, we're
3044 if (path->slots[0] == 0)
3051 leaf = path->nodes[0];
3052 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
3053 found_type = btrfs_key_type(&found_key);
3056 if (found_key.objectid != ino)
3059 if (found_type < min_type)
3062 item_end = found_key.offset;
3063 if (found_type == BTRFS_EXTENT_DATA_KEY) {
3064 fi = btrfs_item_ptr(leaf, path->slots[0],
3065 struct btrfs_file_extent_item);
3066 extent_type = btrfs_file_extent_type(leaf, fi);
3067 encoding = btrfs_file_extent_compression(leaf, fi);
3068 encoding |= btrfs_file_extent_encryption(leaf, fi);
3069 encoding |= btrfs_file_extent_other_encoding(leaf, fi);
3071 if (extent_type != BTRFS_FILE_EXTENT_INLINE) {
3073 btrfs_file_extent_num_bytes(leaf, fi);
3074 } else if (extent_type == BTRFS_FILE_EXTENT_INLINE) {
3075 item_end += btrfs_file_extent_inline_len(leaf,
3080 if (found_type > min_type) {
3083 if (item_end < new_size)
3085 if (found_key.offset >= new_size)
3091 /* FIXME, shrink the extent if the ref count is only 1 */
3092 if (found_type != BTRFS_EXTENT_DATA_KEY)
3095 if (extent_type != BTRFS_FILE_EXTENT_INLINE) {
3097 extent_start = btrfs_file_extent_disk_bytenr(leaf, fi);
3098 if (!del_item && !encoding) {
3099 u64 orig_num_bytes =
3100 btrfs_file_extent_num_bytes(leaf, fi);
3101 extent_num_bytes = new_size -
3102 found_key.offset + root->sectorsize - 1;
3103 extent_num_bytes = extent_num_bytes &
3104 ~((u64)root->sectorsize - 1);
3105 btrfs_set_file_extent_num_bytes(leaf, fi,
3107 num_dec = (orig_num_bytes -
3109 if (root->ref_cows && extent_start != 0)
3110 inode_sub_bytes(inode, num_dec);
3111 btrfs_mark_buffer_dirty(leaf);
3114 btrfs_file_extent_disk_num_bytes(leaf,
3116 extent_offset = found_key.offset -
3117 btrfs_file_extent_offset(leaf, fi);
3119 /* FIXME blocksize != 4096 */
3120 num_dec = btrfs_file_extent_num_bytes(leaf, fi);
3121 if (extent_start != 0) {
3124 inode_sub_bytes(inode, num_dec);
3127 } else if (extent_type == BTRFS_FILE_EXTENT_INLINE) {
3129 * we can't truncate inline items that have had
3133 btrfs_file_extent_compression(leaf, fi) == 0 &&
3134 btrfs_file_extent_encryption(leaf, fi) == 0 &&
3135 btrfs_file_extent_other_encoding(leaf, fi) == 0) {
3136 u32 size = new_size - found_key.offset;
3138 if (root->ref_cows) {
3139 inode_sub_bytes(inode, item_end + 1 -
3143 btrfs_file_extent_calc_inline_size(size);
3144 ret = btrfs_truncate_item(trans, root, path,
3146 } else if (root->ref_cows) {
3147 inode_sub_bytes(inode, item_end + 1 -
3153 if (!pending_del_nr) {
3154 /* no pending yet, add ourselves */
3155 pending_del_slot = path->slots[0];
3157 } else if (pending_del_nr &&
3158 path->slots[0] + 1 == pending_del_slot) {
3159 /* hop on the pending chunk */
3161 pending_del_slot = path->slots[0];
3168 if (found_extent && (root->ref_cows ||
3169 root == root->fs_info->tree_root)) {
3170 btrfs_set_path_blocking(path);
3171 ret = btrfs_free_extent(trans, root, extent_start,
3172 extent_num_bytes, 0,
3173 btrfs_header_owner(leaf),
3174 ino, extent_offset);
3178 if (found_type == BTRFS_INODE_ITEM_KEY)
3181 if (path->slots[0] == 0 ||
3182 path->slots[0] != pending_del_slot) {
3183 if (root->ref_cows &&
3184 BTRFS_I(inode)->location.objectid !=
3185 BTRFS_FREE_INO_OBJECTID) {
3189 if (pending_del_nr) {
3190 ret = btrfs_del_items(trans, root, path,
3196 btrfs_release_path(path);
3203 if (pending_del_nr) {
3204 ret = btrfs_del_items(trans, root, path, pending_del_slot,
3208 btrfs_free_path(path);
3213 * taken from block_truncate_page, but does cow as it zeros out
3214 * any bytes left in the last page in the file.
3216 static int btrfs_truncate_page(struct address_space *mapping, loff_t from)
3218 struct inode *inode = mapping->host;
3219 struct btrfs_root *root = BTRFS_I(inode)->root;
3220 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
3221 struct btrfs_ordered_extent *ordered;
3222 struct extent_state *cached_state = NULL;
3224 u32 blocksize = root->sectorsize;
3225 pgoff_t index = from >> PAGE_CACHE_SHIFT;
3226 unsigned offset = from & (PAGE_CACHE_SIZE-1);
3228 gfp_t mask = btrfs_alloc_write_mask(mapping);
3233 if ((offset & (blocksize - 1)) == 0)
3235 ret = btrfs_delalloc_reserve_space(inode, PAGE_CACHE_SIZE);
3241 page = find_or_create_page(mapping, index, mask);
3243 btrfs_delalloc_release_space(inode, PAGE_CACHE_SIZE);
3247 page_start = page_offset(page);
3248 page_end = page_start + PAGE_CACHE_SIZE - 1;
3250 if (!PageUptodate(page)) {
3251 ret = btrfs_readpage(NULL, page);
3253 if (page->mapping != mapping) {
3255 page_cache_release(page);
3258 if (!PageUptodate(page)) {
3263 wait_on_page_writeback(page);
3265 lock_extent_bits(io_tree, page_start, page_end, 0, &cached_state,
3267 set_page_extent_mapped(page);
3269 ordered = btrfs_lookup_ordered_extent(inode, page_start);
3271 unlock_extent_cached(io_tree, page_start, page_end,
3272 &cached_state, GFP_NOFS);
3274 page_cache_release(page);
3275 btrfs_start_ordered_extent(inode, ordered, 1);
3276 btrfs_put_ordered_extent(ordered);
3280 clear_extent_bit(&BTRFS_I(inode)->io_tree, page_start, page_end,
3281 EXTENT_DIRTY | EXTENT_DELALLOC | EXTENT_DO_ACCOUNTING,
3282 0, 0, &cached_state, GFP_NOFS);
3284 ret = btrfs_set_extent_delalloc(inode, page_start, page_end,
3287 unlock_extent_cached(io_tree, page_start, page_end,
3288 &cached_state, GFP_NOFS);
3293 if (offset != PAGE_CACHE_SIZE) {
3295 memset(kaddr + offset, 0, PAGE_CACHE_SIZE - offset);
3296 flush_dcache_page(page);
3299 ClearPageChecked(page);
3300 set_page_dirty(page);
3301 unlock_extent_cached(io_tree, page_start, page_end, &cached_state,
3306 btrfs_delalloc_release_space(inode, PAGE_CACHE_SIZE);
3308 page_cache_release(page);
3314 * This function puts in dummy file extents for the area we're creating a hole
3315 * for. So if we are truncating this file to a larger size we need to insert
3316 * these file extents so that btrfs_get_extent will return a EXTENT_MAP_HOLE for
3317 * the range between oldsize and size
3319 int btrfs_cont_expand(struct inode *inode, loff_t oldsize, loff_t size)
3321 struct btrfs_trans_handle *trans;
3322 struct btrfs_root *root = BTRFS_I(inode)->root;
3323 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
3324 struct extent_map *em = NULL;
3325 struct extent_state *cached_state = NULL;
3326 u64 mask = root->sectorsize - 1;
3327 u64 hole_start = (oldsize + mask) & ~mask;
3328 u64 block_end = (size + mask) & ~mask;
3334 if (size <= hole_start)
3338 struct btrfs_ordered_extent *ordered;
3339 btrfs_wait_ordered_range(inode, hole_start,
3340 block_end - hole_start);
3341 lock_extent_bits(io_tree, hole_start, block_end - 1, 0,
3342 &cached_state, GFP_NOFS);
3343 ordered = btrfs_lookup_ordered_extent(inode, hole_start);
3346 unlock_extent_cached(io_tree, hole_start, block_end - 1,
3347 &cached_state, GFP_NOFS);
3348 btrfs_put_ordered_extent(ordered);
3351 cur_offset = hole_start;
3353 em = btrfs_get_extent(inode, NULL, 0, cur_offset,
3354 block_end - cur_offset, 0);
3355 BUG_ON(IS_ERR_OR_NULL(em));
3356 last_byte = min(extent_map_end(em), block_end);
3357 last_byte = (last_byte + mask) & ~mask;
3358 if (!test_bit(EXTENT_FLAG_PREALLOC, &em->flags)) {
3360 hole_size = last_byte - cur_offset;
3362 trans = btrfs_start_transaction(root, 3);
3363 if (IS_ERR(trans)) {
3364 err = PTR_ERR(trans);
3368 err = btrfs_drop_extents(trans, inode, cur_offset,
3369 cur_offset + hole_size,
3372 btrfs_update_inode(trans, root, inode);
3373 btrfs_end_transaction(trans, root);
3377 err = btrfs_insert_file_extent(trans, root,
3378 btrfs_ino(inode), cur_offset, 0,
3379 0, hole_size, 0, hole_size,
3382 btrfs_update_inode(trans, root, inode);
3383 btrfs_end_transaction(trans, root);
3387 btrfs_drop_extent_cache(inode, hole_start,
3390 btrfs_update_inode(trans, root, inode);
3391 btrfs_end_transaction(trans, root);
3393 free_extent_map(em);
3395 cur_offset = last_byte;
3396 if (cur_offset >= block_end)
3400 free_extent_map(em);
3401 unlock_extent_cached(io_tree, hole_start, block_end - 1, &cached_state,
3406 static int btrfs_setsize(struct inode *inode, loff_t newsize)
3408 struct btrfs_root *root = BTRFS_I(inode)->root;
3409 struct btrfs_trans_handle *trans;
3410 loff_t oldsize = i_size_read(inode);
3413 if (newsize == oldsize)
3416 if (newsize > oldsize) {
3417 truncate_pagecache(inode, oldsize, newsize);
3418 ret = btrfs_cont_expand(inode, oldsize, newsize);
3422 trans = btrfs_start_transaction(root, 1);
3424 return PTR_ERR(trans);
3426 i_size_write(inode, newsize);
3427 btrfs_ordered_update_i_size(inode, i_size_read(inode), NULL);
3428 ret = btrfs_update_inode(trans, root, inode);
3430 btrfs_end_transaction_throttle(trans, root);
3434 * We're truncating a file that used to have good data down to
3435 * zero. Make sure it gets into the ordered flush list so that
3436 * any new writes get down to disk quickly.
3439 BTRFS_I(inode)->ordered_data_close = 1;
3441 /* we don't support swapfiles, so vmtruncate shouldn't fail */
3442 truncate_setsize(inode, newsize);
3443 ret = btrfs_truncate(inode);
3449 static int btrfs_setattr(struct dentry *dentry, struct iattr *attr)
3451 struct inode *inode = dentry->d_inode;
3452 struct btrfs_root *root = BTRFS_I(inode)->root;
3455 if (btrfs_root_readonly(root))
3458 err = inode_change_ok(inode, attr);
3462 if (S_ISREG(inode->i_mode) && (attr->ia_valid & ATTR_SIZE)) {
3463 err = btrfs_setsize(inode, attr->ia_size);
3468 if (attr->ia_valid) {
3469 setattr_copy(inode, attr);
3470 mark_inode_dirty(inode);
3472 if (attr->ia_valid & ATTR_MODE)
3473 err = btrfs_acl_chmod(inode);
3479 void btrfs_evict_inode(struct inode *inode)
3481 struct btrfs_trans_handle *trans;
3482 struct btrfs_root *root = BTRFS_I(inode)->root;
3483 struct btrfs_block_rsv *rsv, *global_rsv;
3484 u64 min_size = btrfs_calc_trunc_metadata_size(root, 1);
3488 trace_btrfs_inode_evict(inode);
3490 truncate_inode_pages(&inode->i_data, 0);
3491 if (inode->i_nlink && (btrfs_root_refs(&root->root_item) != 0 ||
3492 btrfs_is_free_space_inode(root, inode)))
3495 if (is_bad_inode(inode)) {
3496 btrfs_orphan_del(NULL, inode);
3499 /* do we really want it for ->i_nlink > 0 and zero btrfs_root_refs? */
3500 btrfs_wait_ordered_range(inode, 0, (u64)-1);
3502 if (root->fs_info->log_root_recovering) {
3503 BUG_ON(!list_empty(&BTRFS_I(inode)->i_orphan));
3507 if (inode->i_nlink > 0) {
3508 BUG_ON(btrfs_root_refs(&root->root_item) != 0);
3512 rsv = btrfs_alloc_block_rsv(root);
3514 btrfs_orphan_del(NULL, inode);
3517 rsv->size = min_size;
3518 global_rsv = &root->fs_info->global_block_rsv;
3520 btrfs_i_size_write(inode, 0);
3523 * This is a bit simpler than btrfs_truncate since
3525 * 1) We've already reserved our space for our orphan item in the
3527 * 2) We're going to delete the inode item, so we don't need to update
3530 * So we just need to reserve some slack space in case we add bytes when
3531 * doing the truncate.
3534 ret = btrfs_block_rsv_refill_noflush(root, rsv, min_size);
3537 * Try and steal from the global reserve since we will
3538 * likely not use this space anyway, we want to try as
3539 * hard as possible to get this to work.
3542 ret = btrfs_block_rsv_migrate(global_rsv, rsv, min_size);
3545 printk(KERN_WARNING "Could not get space for a "
3546 "delete, will truncate on mount %d\n", ret);
3547 btrfs_orphan_del(NULL, inode);
3548 btrfs_free_block_rsv(root, rsv);
3552 trans = btrfs_start_transaction(root, 0);
3553 if (IS_ERR(trans)) {
3554 btrfs_orphan_del(NULL, inode);
3555 btrfs_free_block_rsv(root, rsv);
3559 trans->block_rsv = rsv;
3561 ret = btrfs_truncate_inode_items(trans, root, inode, 0, 0);
3565 nr = trans->blocks_used;
3566 btrfs_end_transaction(trans, root);
3568 btrfs_btree_balance_dirty(root, nr);
3571 btrfs_free_block_rsv(root, rsv);
3574 trans->block_rsv = root->orphan_block_rsv;
3575 ret = btrfs_orphan_del(trans, inode);
3579 trans->block_rsv = &root->fs_info->trans_block_rsv;
3580 if (!(root == root->fs_info->tree_root ||
3581 root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID))
3582 btrfs_return_ino(root, btrfs_ino(inode));
3584 nr = trans->blocks_used;
3585 btrfs_end_transaction(trans, root);
3586 btrfs_btree_balance_dirty(root, nr);
3588 end_writeback(inode);
3593 * this returns the key found in the dir entry in the location pointer.
3594 * If no dir entries were found, location->objectid is 0.
3596 static int btrfs_inode_by_name(struct inode *dir, struct dentry *dentry,
3597 struct btrfs_key *location)
3599 const char *name = dentry->d_name.name;
3600 int namelen = dentry->d_name.len;
3601 struct btrfs_dir_item *di;
3602 struct btrfs_path *path;
3603 struct btrfs_root *root = BTRFS_I(dir)->root;
3606 path = btrfs_alloc_path();
3610 di = btrfs_lookup_dir_item(NULL, root, path, btrfs_ino(dir), name,
3615 if (IS_ERR_OR_NULL(di))
3618 btrfs_dir_item_key_to_cpu(path->nodes[0], di, location);
3620 btrfs_free_path(path);
3623 location->objectid = 0;
3628 * when we hit a tree root in a directory, the btrfs part of the inode
3629 * needs to be changed to reflect the root directory of the tree root. This
3630 * is kind of like crossing a mount point.
3632 static int fixup_tree_root_location(struct btrfs_root *root,
3634 struct dentry *dentry,
3635 struct btrfs_key *location,
3636 struct btrfs_root **sub_root)
3638 struct btrfs_path *path;
3639 struct btrfs_root *new_root;
3640 struct btrfs_root_ref *ref;
3641 struct extent_buffer *leaf;
3645 path = btrfs_alloc_path();
3652 ret = btrfs_find_root_ref(root->fs_info->tree_root, path,
3653 BTRFS_I(dir)->root->root_key.objectid,
3654 location->objectid);
3661 leaf = path->nodes[0];
3662 ref = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_root_ref);
3663 if (btrfs_root_ref_dirid(leaf, ref) != btrfs_ino(dir) ||
3664 btrfs_root_ref_name_len(leaf, ref) != dentry->d_name.len)
3667 ret = memcmp_extent_buffer(leaf, dentry->d_name.name,
3668 (unsigned long)(ref + 1),
3669 dentry->d_name.len);
3673 btrfs_release_path(path);
3675 new_root = btrfs_read_fs_root_no_name(root->fs_info, location);
3676 if (IS_ERR(new_root)) {
3677 err = PTR_ERR(new_root);
3681 if (btrfs_root_refs(&new_root->root_item) == 0) {
3686 *sub_root = new_root;
3687 location->objectid = btrfs_root_dirid(&new_root->root_item);
3688 location->type = BTRFS_INODE_ITEM_KEY;
3689 location->offset = 0;
3692 btrfs_free_path(path);
3696 static void inode_tree_add(struct inode *inode)
3698 struct btrfs_root *root = BTRFS_I(inode)->root;
3699 struct btrfs_inode *entry;
3701 struct rb_node *parent;
3702 u64 ino = btrfs_ino(inode);
3704 p = &root->inode_tree.rb_node;
3707 if (inode_unhashed(inode))
3710 spin_lock(&root->inode_lock);
3713 entry = rb_entry(parent, struct btrfs_inode, rb_node);
3715 if (ino < btrfs_ino(&entry->vfs_inode))
3716 p = &parent->rb_left;
3717 else if (ino > btrfs_ino(&entry->vfs_inode))
3718 p = &parent->rb_right;
3720 WARN_ON(!(entry->vfs_inode.i_state &
3721 (I_WILL_FREE | I_FREEING)));
3722 rb_erase(parent, &root->inode_tree);
3723 RB_CLEAR_NODE(parent);
3724 spin_unlock(&root->inode_lock);
3728 rb_link_node(&BTRFS_I(inode)->rb_node, parent, p);
3729 rb_insert_color(&BTRFS_I(inode)->rb_node, &root->inode_tree);
3730 spin_unlock(&root->inode_lock);
3733 static void inode_tree_del(struct inode *inode)
3735 struct btrfs_root *root = BTRFS_I(inode)->root;
3738 spin_lock(&root->inode_lock);
3739 if (!RB_EMPTY_NODE(&BTRFS_I(inode)->rb_node)) {
3740 rb_erase(&BTRFS_I(inode)->rb_node, &root->inode_tree);
3741 RB_CLEAR_NODE(&BTRFS_I(inode)->rb_node);
3742 empty = RB_EMPTY_ROOT(&root->inode_tree);
3744 spin_unlock(&root->inode_lock);
3747 * Free space cache has inodes in the tree root, but the tree root has a
3748 * root_refs of 0, so this could end up dropping the tree root as a
3749 * snapshot, so we need the extra !root->fs_info->tree_root check to
3750 * make sure we don't drop it.
3752 if (empty && btrfs_root_refs(&root->root_item) == 0 &&
3753 root != root->fs_info->tree_root) {
3754 synchronize_srcu(&root->fs_info->subvol_srcu);
3755 spin_lock(&root->inode_lock);
3756 empty = RB_EMPTY_ROOT(&root->inode_tree);
3757 spin_unlock(&root->inode_lock);
3759 btrfs_add_dead_root(root);
3763 int btrfs_invalidate_inodes(struct btrfs_root *root)
3765 struct rb_node *node;
3766 struct rb_node *prev;
3767 struct btrfs_inode *entry;
3768 struct inode *inode;
3771 WARN_ON(btrfs_root_refs(&root->root_item) != 0);
3773 spin_lock(&root->inode_lock);
3775 node = root->inode_tree.rb_node;
3779 entry = rb_entry(node, struct btrfs_inode, rb_node);
3781 if (objectid < btrfs_ino(&entry->vfs_inode))
3782 node = node->rb_left;
3783 else if (objectid > btrfs_ino(&entry->vfs_inode))
3784 node = node->rb_right;
3790 entry = rb_entry(prev, struct btrfs_inode, rb_node);
3791 if (objectid <= btrfs_ino(&entry->vfs_inode)) {
3795 prev = rb_next(prev);
3799 entry = rb_entry(node, struct btrfs_inode, rb_node);
3800 objectid = btrfs_ino(&entry->vfs_inode) + 1;
3801 inode = igrab(&entry->vfs_inode);
3803 spin_unlock(&root->inode_lock);
3804 if (atomic_read(&inode->i_count) > 1)
3805 d_prune_aliases(inode);
3807 * btrfs_drop_inode will have it removed from
3808 * the inode cache when its usage count
3813 spin_lock(&root->inode_lock);
3817 if (cond_resched_lock(&root->inode_lock))
3820 node = rb_next(node);
3822 spin_unlock(&root->inode_lock);
3826 static int btrfs_init_locked_inode(struct inode *inode, void *p)
3828 struct btrfs_iget_args *args = p;
3829 inode->i_ino = args->ino;
3830 BTRFS_I(inode)->root = args->root;
3831 btrfs_set_inode_space_info(args->root, inode);
3835 static int btrfs_find_actor(struct inode *inode, void *opaque)
3837 struct btrfs_iget_args *args = opaque;
3838 return args->ino == btrfs_ino(inode) &&
3839 args->root == BTRFS_I(inode)->root;
3842 static struct inode *btrfs_iget_locked(struct super_block *s,
3844 struct btrfs_root *root)
3846 struct inode *inode;
3847 struct btrfs_iget_args args;
3848 args.ino = objectid;
3851 inode = iget5_locked(s, objectid, btrfs_find_actor,
3852 btrfs_init_locked_inode,
3857 /* Get an inode object given its location and corresponding root.
3858 * Returns in *is_new if the inode was read from disk
3860 struct inode *btrfs_iget(struct super_block *s, struct btrfs_key *location,
3861 struct btrfs_root *root, int *new)
3863 struct inode *inode;
3865 inode = btrfs_iget_locked(s, location->objectid, root);
3867 return ERR_PTR(-ENOMEM);
3869 if (inode->i_state & I_NEW) {
3870 BTRFS_I(inode)->root = root;
3871 memcpy(&BTRFS_I(inode)->location, location, sizeof(*location));
3872 btrfs_read_locked_inode(inode);
3873 if (!is_bad_inode(inode)) {
3874 inode_tree_add(inode);
3875 unlock_new_inode(inode);
3879 unlock_new_inode(inode);
3881 inode = ERR_PTR(-ESTALE);
3888 static struct inode *new_simple_dir(struct super_block *s,
3889 struct btrfs_key *key,
3890 struct btrfs_root *root)
3892 struct inode *inode = new_inode(s);
3895 return ERR_PTR(-ENOMEM);
3897 BTRFS_I(inode)->root = root;
3898 memcpy(&BTRFS_I(inode)->location, key, sizeof(*key));
3899 BTRFS_I(inode)->dummy_inode = 1;
3901 inode->i_ino = BTRFS_EMPTY_SUBVOL_DIR_OBJECTID;
3902 inode->i_op = &simple_dir_inode_operations;
3903 inode->i_fop = &simple_dir_operations;
3904 inode->i_mode = S_IFDIR | S_IRUGO | S_IWUSR | S_IXUGO;
3905 inode->i_mtime = inode->i_atime = inode->i_ctime = CURRENT_TIME;
3910 struct inode *btrfs_lookup_dentry(struct inode *dir, struct dentry *dentry)
3912 struct inode *inode;
3913 struct btrfs_root *root = BTRFS_I(dir)->root;
3914 struct btrfs_root *sub_root = root;
3915 struct btrfs_key location;
3919 if (dentry->d_name.len > BTRFS_NAME_LEN)
3920 return ERR_PTR(-ENAMETOOLONG);
3922 if (unlikely(d_need_lookup(dentry))) {
3923 memcpy(&location, dentry->d_fsdata, sizeof(struct btrfs_key));
3924 kfree(dentry->d_fsdata);
3925 dentry->d_fsdata = NULL;
3926 /* This thing is hashed, drop it for now */
3929 ret = btrfs_inode_by_name(dir, dentry, &location);
3933 return ERR_PTR(ret);
3935 if (location.objectid == 0)
3938 if (location.type == BTRFS_INODE_ITEM_KEY) {
3939 inode = btrfs_iget(dir->i_sb, &location, root, NULL);
3943 BUG_ON(location.type != BTRFS_ROOT_ITEM_KEY);
3945 index = srcu_read_lock(&root->fs_info->subvol_srcu);
3946 ret = fixup_tree_root_location(root, dir, dentry,
3947 &location, &sub_root);
3950 inode = ERR_PTR(ret);
3952 inode = new_simple_dir(dir->i_sb, &location, sub_root);
3954 inode = btrfs_iget(dir->i_sb, &location, sub_root, NULL);
3956 srcu_read_unlock(&root->fs_info->subvol_srcu, index);
3958 if (!IS_ERR(inode) && root != sub_root) {
3959 down_read(&root->fs_info->cleanup_work_sem);
3960 if (!(inode->i_sb->s_flags & MS_RDONLY))
3961 ret = btrfs_orphan_cleanup(sub_root);
3962 up_read(&root->fs_info->cleanup_work_sem);
3964 inode = ERR_PTR(ret);
3970 static int btrfs_dentry_delete(const struct dentry *dentry)
3972 struct btrfs_root *root;
3974 if (!dentry->d_inode && !IS_ROOT(dentry))
3975 dentry = dentry->d_parent;
3977 if (dentry->d_inode) {
3978 root = BTRFS_I(dentry->d_inode)->root;
3979 if (btrfs_root_refs(&root->root_item) == 0)
3985 static void btrfs_dentry_release(struct dentry *dentry)
3987 if (dentry->d_fsdata)
3988 kfree(dentry->d_fsdata);
3991 static struct dentry *btrfs_lookup(struct inode *dir, struct dentry *dentry,
3992 struct nameidata *nd)
3996 ret = d_splice_alias(btrfs_lookup_dentry(dir, dentry), dentry);
3997 if (unlikely(d_need_lookup(dentry))) {
3998 spin_lock(&dentry->d_lock);
3999 dentry->d_flags &= ~DCACHE_NEED_LOOKUP;
4000 spin_unlock(&dentry->d_lock);
4005 unsigned char btrfs_filetype_table[] = {
4006 DT_UNKNOWN, DT_REG, DT_DIR, DT_CHR, DT_BLK, DT_FIFO, DT_SOCK, DT_LNK
4009 static int btrfs_real_readdir(struct file *filp, void *dirent,
4012 struct inode *inode = filp->f_dentry->d_inode;
4013 struct btrfs_root *root = BTRFS_I(inode)->root;
4014 struct btrfs_item *item;
4015 struct btrfs_dir_item *di;
4016 struct btrfs_key key;
4017 struct btrfs_key found_key;
4018 struct btrfs_path *path;
4019 struct list_head ins_list;
4020 struct list_head del_list;
4023 struct extent_buffer *leaf;
4025 unsigned char d_type;
4030 int key_type = BTRFS_DIR_INDEX_KEY;
4034 int is_curr = 0; /* filp->f_pos points to the current index? */
4036 /* FIXME, use a real flag for deciding about the key type */
4037 if (root->fs_info->tree_root == root)
4038 key_type = BTRFS_DIR_ITEM_KEY;
4040 /* special case for "." */
4041 if (filp->f_pos == 0) {
4042 over = filldir(dirent, ".", 1,
4043 filp->f_pos, btrfs_ino(inode), DT_DIR);
4048 /* special case for .., just use the back ref */
4049 if (filp->f_pos == 1) {
4050 u64 pino = parent_ino(filp->f_path.dentry);
4051 over = filldir(dirent, "..", 2,
4052 filp->f_pos, pino, DT_DIR);
4057 path = btrfs_alloc_path();
4063 if (key_type == BTRFS_DIR_INDEX_KEY) {
4064 INIT_LIST_HEAD(&ins_list);
4065 INIT_LIST_HEAD(&del_list);
4066 btrfs_get_delayed_items(inode, &ins_list, &del_list);
4069 btrfs_set_key_type(&key, key_type);
4070 key.offset = filp->f_pos;
4071 key.objectid = btrfs_ino(inode);
4073 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
4078 leaf = path->nodes[0];
4079 slot = path->slots[0];
4080 if (slot >= btrfs_header_nritems(leaf)) {
4081 ret = btrfs_next_leaf(root, path);
4089 item = btrfs_item_nr(leaf, slot);
4090 btrfs_item_key_to_cpu(leaf, &found_key, slot);
4092 if (found_key.objectid != key.objectid)
4094 if (btrfs_key_type(&found_key) != key_type)
4096 if (found_key.offset < filp->f_pos)
4098 if (key_type == BTRFS_DIR_INDEX_KEY &&
4099 btrfs_should_delete_dir_index(&del_list,
4103 filp->f_pos = found_key.offset;
4106 di = btrfs_item_ptr(leaf, slot, struct btrfs_dir_item);
4108 di_total = btrfs_item_size(leaf, item);
4110 while (di_cur < di_total) {
4111 struct btrfs_key location;
4114 if (verify_dir_item(root, leaf, di))
4117 name_len = btrfs_dir_name_len(leaf, di);
4118 if (name_len <= sizeof(tmp_name)) {
4119 name_ptr = tmp_name;
4121 name_ptr = kmalloc(name_len, GFP_NOFS);
4127 read_extent_buffer(leaf, name_ptr,
4128 (unsigned long)(di + 1), name_len);
4130 d_type = btrfs_filetype_table[btrfs_dir_type(leaf, di)];
4131 btrfs_dir_item_key_to_cpu(leaf, di, &location);
4135 q.hash = full_name_hash(q.name, q.len);
4136 tmp = d_lookup(filp->f_dentry, &q);
4138 struct btrfs_key *newkey;
4140 newkey = kzalloc(sizeof(struct btrfs_key),
4144 tmp = d_alloc(filp->f_dentry, &q);
4150 memcpy(newkey, &location,
4151 sizeof(struct btrfs_key));
4152 tmp->d_fsdata = newkey;
4153 tmp->d_flags |= DCACHE_NEED_LOOKUP;
4160 /* is this a reference to our own snapshot? If so
4163 if (location.type == BTRFS_ROOT_ITEM_KEY &&
4164 location.objectid == root->root_key.objectid) {
4168 over = filldir(dirent, name_ptr, name_len,
4169 found_key.offset, location.objectid,
4173 if (name_ptr != tmp_name)
4178 di_len = btrfs_dir_name_len(leaf, di) +
4179 btrfs_dir_data_len(leaf, di) + sizeof(*di);
4181 di = (struct btrfs_dir_item *)((char *)di + di_len);
4187 if (key_type == BTRFS_DIR_INDEX_KEY) {
4190 ret = btrfs_readdir_delayed_dir_index(filp, dirent, filldir,
4196 /* Reached end of directory/root. Bump pos past the last item. */
4197 if (key_type == BTRFS_DIR_INDEX_KEY)
4199 * 32-bit glibc will use getdents64, but then strtol -
4200 * so the last number we can serve is this.
4202 filp->f_pos = 0x7fffffff;
4208 if (key_type == BTRFS_DIR_INDEX_KEY)
4209 btrfs_put_delayed_items(&ins_list, &del_list);
4210 btrfs_free_path(path);
4214 int btrfs_write_inode(struct inode *inode, struct writeback_control *wbc)
4216 struct btrfs_root *root = BTRFS_I(inode)->root;
4217 struct btrfs_trans_handle *trans;
4219 bool nolock = false;
4221 if (BTRFS_I(inode)->dummy_inode)
4224 if (btrfs_fs_closing(root->fs_info) && btrfs_is_free_space_inode(root, inode))
4227 if (wbc->sync_mode == WB_SYNC_ALL) {
4229 trans = btrfs_join_transaction_nolock(root);
4231 trans = btrfs_join_transaction(root);
4233 return PTR_ERR(trans);
4235 ret = btrfs_end_transaction_nolock(trans, root);
4237 ret = btrfs_commit_transaction(trans, root);
4243 * This is somewhat expensive, updating the tree every time the
4244 * inode changes. But, it is most likely to find the inode in cache.
4245 * FIXME, needs more benchmarking...there are no reasons other than performance
4246 * to keep or drop this code.
4248 void btrfs_dirty_inode(struct inode *inode, int flags)
4250 struct btrfs_root *root = BTRFS_I(inode)->root;
4251 struct btrfs_trans_handle *trans;
4254 if (BTRFS_I(inode)->dummy_inode)
4257 trans = btrfs_join_transaction(root);
4258 BUG_ON(IS_ERR(trans));
4260 ret = btrfs_update_inode(trans, root, inode);
4261 if (ret && ret == -ENOSPC) {
4262 /* whoops, lets try again with the full transaction */
4263 btrfs_end_transaction(trans, root);
4264 trans = btrfs_start_transaction(root, 1);
4265 if (IS_ERR(trans)) {
4266 printk_ratelimited(KERN_ERR "btrfs: fail to "
4267 "dirty inode %llu error %ld\n",
4268 (unsigned long long)btrfs_ino(inode),
4273 ret = btrfs_update_inode(trans, root, inode);
4275 printk_ratelimited(KERN_ERR "btrfs: fail to "
4276 "dirty inode %llu error %d\n",
4277 (unsigned long long)btrfs_ino(inode),
4281 btrfs_end_transaction(trans, root);
4282 if (BTRFS_I(inode)->delayed_node)
4283 btrfs_balance_delayed_items(root);
4287 * find the highest existing sequence number in a directory
4288 * and then set the in-memory index_cnt variable to reflect
4289 * free sequence numbers
4291 static int btrfs_set_inode_index_count(struct inode *inode)
4293 struct btrfs_root *root = BTRFS_I(inode)->root;
4294 struct btrfs_key key, found_key;
4295 struct btrfs_path *path;
4296 struct extent_buffer *leaf;
4299 key.objectid = btrfs_ino(inode);
4300 btrfs_set_key_type(&key, BTRFS_DIR_INDEX_KEY);
4301 key.offset = (u64)-1;
4303 path = btrfs_alloc_path();
4307 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
4310 /* FIXME: we should be able to handle this */
4316 * MAGIC NUMBER EXPLANATION:
4317 * since we search a directory based on f_pos we have to start at 2
4318 * since '.' and '..' have f_pos of 0 and 1 respectively, so everybody
4319 * else has to start at 2
4321 if (path->slots[0] == 0) {
4322 BTRFS_I(inode)->index_cnt = 2;
4328 leaf = path->nodes[0];
4329 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
4331 if (found_key.objectid != btrfs_ino(inode) ||
4332 btrfs_key_type(&found_key) != BTRFS_DIR_INDEX_KEY) {
4333 BTRFS_I(inode)->index_cnt = 2;
4337 BTRFS_I(inode)->index_cnt = found_key.offset + 1;
4339 btrfs_free_path(path);
4344 * helper to find a free sequence number in a given directory. This current
4345 * code is very simple, later versions will do smarter things in the btree
4347 int btrfs_set_inode_index(struct inode *dir, u64 *index)
4351 if (BTRFS_I(dir)->index_cnt == (u64)-1) {
4352 ret = btrfs_inode_delayed_dir_index_count(dir);
4354 ret = btrfs_set_inode_index_count(dir);
4360 *index = BTRFS_I(dir)->index_cnt;
4361 BTRFS_I(dir)->index_cnt++;
4366 static struct inode *btrfs_new_inode(struct btrfs_trans_handle *trans,
4367 struct btrfs_root *root,
4369 const char *name, int name_len,
4370 u64 ref_objectid, u64 objectid, int mode,
4373 struct inode *inode;
4374 struct btrfs_inode_item *inode_item;
4375 struct btrfs_key *location;
4376 struct btrfs_path *path;
4377 struct btrfs_inode_ref *ref;
4378 struct btrfs_key key[2];
4384 path = btrfs_alloc_path();
4386 return ERR_PTR(-ENOMEM);
4388 inode = new_inode(root->fs_info->sb);
4390 btrfs_free_path(path);
4391 return ERR_PTR(-ENOMEM);
4395 * we have to initialize this early, so we can reclaim the inode
4396 * number if we fail afterwards in this function.
4398 inode->i_ino = objectid;
4401 trace_btrfs_inode_request(dir);
4403 ret = btrfs_set_inode_index(dir, index);
4405 btrfs_free_path(path);
4407 return ERR_PTR(ret);
4411 * index_cnt is ignored for everything but a dir,
4412 * btrfs_get_inode_index_count has an explanation for the magic
4415 BTRFS_I(inode)->index_cnt = 2;
4416 BTRFS_I(inode)->root = root;
4417 BTRFS_I(inode)->generation = trans->transid;
4418 inode->i_generation = BTRFS_I(inode)->generation;
4419 btrfs_set_inode_space_info(root, inode);
4426 key[0].objectid = objectid;
4427 btrfs_set_key_type(&key[0], BTRFS_INODE_ITEM_KEY);
4430 key[1].objectid = objectid;
4431 btrfs_set_key_type(&key[1], BTRFS_INODE_REF_KEY);
4432 key[1].offset = ref_objectid;
4434 sizes[0] = sizeof(struct btrfs_inode_item);
4435 sizes[1] = name_len + sizeof(*ref);
4437 path->leave_spinning = 1;
4438 ret = btrfs_insert_empty_items(trans, root, path, key, sizes, 2);
4442 inode_init_owner(inode, dir, mode);
4443 inode_set_bytes(inode, 0);
4444 inode->i_mtime = inode->i_atime = inode->i_ctime = CURRENT_TIME;
4445 inode_item = btrfs_item_ptr(path->nodes[0], path->slots[0],
4446 struct btrfs_inode_item);
4447 fill_inode_item(trans, path->nodes[0], inode_item, inode);
4449 ref = btrfs_item_ptr(path->nodes[0], path->slots[0] + 1,
4450 struct btrfs_inode_ref);
4451 btrfs_set_inode_ref_name_len(path->nodes[0], ref, name_len);
4452 btrfs_set_inode_ref_index(path->nodes[0], ref, *index);
4453 ptr = (unsigned long)(ref + 1);
4454 write_extent_buffer(path->nodes[0], name, ptr, name_len);
4456 btrfs_mark_buffer_dirty(path->nodes[0]);
4457 btrfs_free_path(path);
4459 location = &BTRFS_I(inode)->location;
4460 location->objectid = objectid;
4461 location->offset = 0;
4462 btrfs_set_key_type(location, BTRFS_INODE_ITEM_KEY);
4464 btrfs_inherit_iflags(inode, dir);
4466 if (S_ISREG(mode)) {
4467 if (btrfs_test_opt(root, NODATASUM))
4468 BTRFS_I(inode)->flags |= BTRFS_INODE_NODATASUM;
4469 if (btrfs_test_opt(root, NODATACOW) ||
4470 (BTRFS_I(dir)->flags & BTRFS_INODE_NODATACOW))
4471 BTRFS_I(inode)->flags |= BTRFS_INODE_NODATACOW;
4474 insert_inode_hash(inode);
4475 inode_tree_add(inode);
4477 trace_btrfs_inode_new(inode);
4478 btrfs_set_inode_last_trans(trans, inode);
4483 BTRFS_I(dir)->index_cnt--;
4484 btrfs_free_path(path);
4486 return ERR_PTR(ret);
4489 static inline u8 btrfs_inode_type(struct inode *inode)
4491 return btrfs_type_by_mode[(inode->i_mode & S_IFMT) >> S_SHIFT];
4495 * utility function to add 'inode' into 'parent_inode' with
4496 * a give name and a given sequence number.
4497 * if 'add_backref' is true, also insert a backref from the
4498 * inode to the parent directory.
4500 int btrfs_add_link(struct btrfs_trans_handle *trans,
4501 struct inode *parent_inode, struct inode *inode,
4502 const char *name, int name_len, int add_backref, u64 index)
4505 struct btrfs_key key;
4506 struct btrfs_root *root = BTRFS_I(parent_inode)->root;
4507 u64 ino = btrfs_ino(inode);
4508 u64 parent_ino = btrfs_ino(parent_inode);
4510 if (unlikely(ino == BTRFS_FIRST_FREE_OBJECTID)) {
4511 memcpy(&key, &BTRFS_I(inode)->root->root_key, sizeof(key));
4514 btrfs_set_key_type(&key, BTRFS_INODE_ITEM_KEY);
4518 if (unlikely(ino == BTRFS_FIRST_FREE_OBJECTID)) {
4519 ret = btrfs_add_root_ref(trans, root->fs_info->tree_root,
4520 key.objectid, root->root_key.objectid,
4521 parent_ino, index, name, name_len);
4522 } else if (add_backref) {
4523 ret = btrfs_insert_inode_ref(trans, root, name, name_len, ino,
4528 ret = btrfs_insert_dir_item(trans, root, name, name_len,
4530 btrfs_inode_type(inode), index);
4533 btrfs_i_size_write(parent_inode, parent_inode->i_size +
4535 parent_inode->i_mtime = parent_inode->i_ctime = CURRENT_TIME;
4536 ret = btrfs_update_inode(trans, root, parent_inode);
4541 static int btrfs_add_nondir(struct btrfs_trans_handle *trans,
4542 struct inode *dir, struct dentry *dentry,
4543 struct inode *inode, int backref, u64 index)
4545 int err = btrfs_add_link(trans, dir, inode,
4546 dentry->d_name.name, dentry->d_name.len,
4549 d_instantiate(dentry, inode);
4557 static int btrfs_mknod(struct inode *dir, struct dentry *dentry,
4558 int mode, dev_t rdev)
4560 struct btrfs_trans_handle *trans;
4561 struct btrfs_root *root = BTRFS_I(dir)->root;
4562 struct inode *inode = NULL;
4566 unsigned long nr = 0;
4569 if (!new_valid_dev(rdev))
4573 * 2 for inode item and ref
4575 * 1 for xattr if selinux is on
4577 trans = btrfs_start_transaction(root, 5);
4579 return PTR_ERR(trans);
4581 err = btrfs_find_free_ino(root, &objectid);
4585 inode = btrfs_new_inode(trans, root, dir, dentry->d_name.name,
4586 dentry->d_name.len, btrfs_ino(dir), objectid,
4588 if (IS_ERR(inode)) {
4589 err = PTR_ERR(inode);
4593 err = btrfs_init_inode_security(trans, inode, dir, &dentry->d_name);
4599 err = btrfs_add_nondir(trans, dir, dentry, inode, 0, index);
4603 inode->i_op = &btrfs_special_inode_operations;
4604 init_special_inode(inode, inode->i_mode, rdev);
4605 btrfs_update_inode(trans, root, inode);
4608 nr = trans->blocks_used;
4609 btrfs_end_transaction_throttle(trans, root);
4610 btrfs_btree_balance_dirty(root, nr);
4612 inode_dec_link_count(inode);
4618 static int btrfs_create(struct inode *dir, struct dentry *dentry,
4619 int mode, struct nameidata *nd)
4621 struct btrfs_trans_handle *trans;
4622 struct btrfs_root *root = BTRFS_I(dir)->root;
4623 struct inode *inode = NULL;
4626 unsigned long nr = 0;
4631 * 2 for inode item and ref
4633 * 1 for xattr if selinux is on
4635 trans = btrfs_start_transaction(root, 5);
4637 return PTR_ERR(trans);
4639 err = btrfs_find_free_ino(root, &objectid);
4643 inode = btrfs_new_inode(trans, root, dir, dentry->d_name.name,
4644 dentry->d_name.len, btrfs_ino(dir), objectid,
4646 if (IS_ERR(inode)) {
4647 err = PTR_ERR(inode);
4651 err = btrfs_init_inode_security(trans, inode, dir, &dentry->d_name);
4657 err = btrfs_add_nondir(trans, dir, dentry, inode, 0, index);
4661 inode->i_mapping->a_ops = &btrfs_aops;
4662 inode->i_mapping->backing_dev_info = &root->fs_info->bdi;
4663 inode->i_fop = &btrfs_file_operations;
4664 inode->i_op = &btrfs_file_inode_operations;
4665 BTRFS_I(inode)->io_tree.ops = &btrfs_extent_io_ops;
4668 nr = trans->blocks_used;
4669 btrfs_end_transaction_throttle(trans, root);
4671 inode_dec_link_count(inode);
4674 btrfs_btree_balance_dirty(root, nr);
4678 static int btrfs_link(struct dentry *old_dentry, struct inode *dir,
4679 struct dentry *dentry)
4681 struct btrfs_trans_handle *trans;
4682 struct btrfs_root *root = BTRFS_I(dir)->root;
4683 struct inode *inode = old_dentry->d_inode;
4685 unsigned long nr = 0;
4689 /* do not allow sys_link's with other subvols of the same device */
4690 if (root->objectid != BTRFS_I(inode)->root->objectid)
4693 if (inode->i_nlink == ~0U)
4696 err = btrfs_set_inode_index(dir, &index);
4701 * 2 items for inode and inode ref
4702 * 2 items for dir items
4703 * 1 item for parent inode
4705 trans = btrfs_start_transaction(root, 5);
4706 if (IS_ERR(trans)) {
4707 err = PTR_ERR(trans);
4711 btrfs_inc_nlink(inode);
4712 inode->i_ctime = CURRENT_TIME;
4715 err = btrfs_add_nondir(trans, dir, dentry, inode, 1, index);
4720 struct dentry *parent = dentry->d_parent;
4721 err = btrfs_update_inode(trans, root, inode);
4723 btrfs_log_new_name(trans, inode, NULL, parent);
4726 nr = trans->blocks_used;
4727 btrfs_end_transaction_throttle(trans, root);
4730 inode_dec_link_count(inode);
4733 btrfs_btree_balance_dirty(root, nr);
4737 static int btrfs_mkdir(struct inode *dir, struct dentry *dentry, int mode)
4739 struct inode *inode = NULL;
4740 struct btrfs_trans_handle *trans;
4741 struct btrfs_root *root = BTRFS_I(dir)->root;
4743 int drop_on_err = 0;
4746 unsigned long nr = 1;
4749 * 2 items for inode and ref
4750 * 2 items for dir items
4751 * 1 for xattr if selinux is on
4753 trans = btrfs_start_transaction(root, 5);
4755 return PTR_ERR(trans);
4757 err = btrfs_find_free_ino(root, &objectid);
4761 inode = btrfs_new_inode(trans, root, dir, dentry->d_name.name,
4762 dentry->d_name.len, btrfs_ino(dir), objectid,
4763 S_IFDIR | mode, &index);
4764 if (IS_ERR(inode)) {
4765 err = PTR_ERR(inode);
4771 err = btrfs_init_inode_security(trans, inode, dir, &dentry->d_name);
4775 inode->i_op = &btrfs_dir_inode_operations;
4776 inode->i_fop = &btrfs_dir_file_operations;
4778 btrfs_i_size_write(inode, 0);
4779 err = btrfs_update_inode(trans, root, inode);
4783 err = btrfs_add_link(trans, dir, inode, dentry->d_name.name,
4784 dentry->d_name.len, 0, index);
4788 d_instantiate(dentry, inode);
4792 nr = trans->blocks_used;
4793 btrfs_end_transaction_throttle(trans, root);
4796 btrfs_btree_balance_dirty(root, nr);
4800 /* helper for btfs_get_extent. Given an existing extent in the tree,
4801 * and an extent that you want to insert, deal with overlap and insert
4802 * the new extent into the tree.
4804 static int merge_extent_mapping(struct extent_map_tree *em_tree,
4805 struct extent_map *existing,
4806 struct extent_map *em,
4807 u64 map_start, u64 map_len)
4811 BUG_ON(map_start < em->start || map_start >= extent_map_end(em));
4812 start_diff = map_start - em->start;
4813 em->start = map_start;
4815 if (em->block_start < EXTENT_MAP_LAST_BYTE &&
4816 !test_bit(EXTENT_FLAG_COMPRESSED, &em->flags)) {
4817 em->block_start += start_diff;
4818 em->block_len -= start_diff;
4820 return add_extent_mapping(em_tree, em);
4823 static noinline int uncompress_inline(struct btrfs_path *path,
4824 struct inode *inode, struct page *page,
4825 size_t pg_offset, u64 extent_offset,
4826 struct btrfs_file_extent_item *item)
4829 struct extent_buffer *leaf = path->nodes[0];
4832 unsigned long inline_size;
4836 WARN_ON(pg_offset != 0);
4837 compress_type = btrfs_file_extent_compression(leaf, item);
4838 max_size = btrfs_file_extent_ram_bytes(leaf, item);
4839 inline_size = btrfs_file_extent_inline_item_len(leaf,
4840 btrfs_item_nr(leaf, path->slots[0]));
4841 tmp = kmalloc(inline_size, GFP_NOFS);
4844 ptr = btrfs_file_extent_inline_start(item);
4846 read_extent_buffer(leaf, tmp, ptr, inline_size);
4848 max_size = min_t(unsigned long, PAGE_CACHE_SIZE, max_size);
4849 ret = btrfs_decompress(compress_type, tmp, page,
4850 extent_offset, inline_size, max_size);
4852 char *kaddr = kmap_atomic(page, KM_USER0);
4853 unsigned long copy_size = min_t(u64,
4854 PAGE_CACHE_SIZE - pg_offset,
4855 max_size - extent_offset);
4856 memset(kaddr + pg_offset, 0, copy_size);
4857 kunmap_atomic(kaddr, KM_USER0);
4864 * a bit scary, this does extent mapping from logical file offset to the disk.
4865 * the ugly parts come from merging extents from the disk with the in-ram
4866 * representation. This gets more complex because of the data=ordered code,
4867 * where the in-ram extents might be locked pending data=ordered completion.
4869 * This also copies inline extents directly into the page.
4872 struct extent_map *btrfs_get_extent(struct inode *inode, struct page *page,
4873 size_t pg_offset, u64 start, u64 len,
4879 u64 extent_start = 0;
4881 u64 objectid = btrfs_ino(inode);
4883 struct btrfs_path *path = NULL;
4884 struct btrfs_root *root = BTRFS_I(inode)->root;
4885 struct btrfs_file_extent_item *item;
4886 struct extent_buffer *leaf;
4887 struct btrfs_key found_key;
4888 struct extent_map *em = NULL;
4889 struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree;
4890 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
4891 struct btrfs_trans_handle *trans = NULL;
4895 read_lock(&em_tree->lock);
4896 em = lookup_extent_mapping(em_tree, start, len);
4898 em->bdev = root->fs_info->fs_devices->latest_bdev;
4899 read_unlock(&em_tree->lock);
4902 if (em->start > start || em->start + em->len <= start)
4903 free_extent_map(em);
4904 else if (em->block_start == EXTENT_MAP_INLINE && page)
4905 free_extent_map(em);
4909 em = alloc_extent_map();
4914 em->bdev = root->fs_info->fs_devices->latest_bdev;
4915 em->start = EXTENT_MAP_HOLE;
4916 em->orig_start = EXTENT_MAP_HOLE;
4918 em->block_len = (u64)-1;
4921 path = btrfs_alloc_path();
4927 * Chances are we'll be called again, so go ahead and do
4933 ret = btrfs_lookup_file_extent(trans, root, path,
4934 objectid, start, trans != NULL);
4941 if (path->slots[0] == 0)
4946 leaf = path->nodes[0];
4947 item = btrfs_item_ptr(leaf, path->slots[0],
4948 struct btrfs_file_extent_item);
4949 /* are we inside the extent that was found? */
4950 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
4951 found_type = btrfs_key_type(&found_key);
4952 if (found_key.objectid != objectid ||
4953 found_type != BTRFS_EXTENT_DATA_KEY) {
4957 found_type = btrfs_file_extent_type(leaf, item);
4958 extent_start = found_key.offset;
4959 compress_type = btrfs_file_extent_compression(leaf, item);
4960 if (found_type == BTRFS_FILE_EXTENT_REG ||
4961 found_type == BTRFS_FILE_EXTENT_PREALLOC) {
4962 extent_end = extent_start +
4963 btrfs_file_extent_num_bytes(leaf, item);
4964 } else if (found_type == BTRFS_FILE_EXTENT_INLINE) {
4966 size = btrfs_file_extent_inline_len(leaf, item);
4967 extent_end = (extent_start + size + root->sectorsize - 1) &
4968 ~((u64)root->sectorsize - 1);
4971 if (start >= extent_end) {
4973 if (path->slots[0] >= btrfs_header_nritems(leaf)) {
4974 ret = btrfs_next_leaf(root, path);
4981 leaf = path->nodes[0];
4983 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
4984 if (found_key.objectid != objectid ||
4985 found_key.type != BTRFS_EXTENT_DATA_KEY)
4987 if (start + len <= found_key.offset)
4990 em->len = found_key.offset - start;
4994 if (found_type == BTRFS_FILE_EXTENT_REG ||
4995 found_type == BTRFS_FILE_EXTENT_PREALLOC) {
4996 em->start = extent_start;
4997 em->len = extent_end - extent_start;
4998 em->orig_start = extent_start -
4999 btrfs_file_extent_offset(leaf, item);
5000 bytenr = btrfs_file_extent_disk_bytenr(leaf, item);
5002 em->block_start = EXTENT_MAP_HOLE;
5005 if (compress_type != BTRFS_COMPRESS_NONE) {
5006 set_bit(EXTENT_FLAG_COMPRESSED, &em->flags);
5007 em->compress_type = compress_type;
5008 em->block_start = bytenr;
5009 em->block_len = btrfs_file_extent_disk_num_bytes(leaf,
5012 bytenr += btrfs_file_extent_offset(leaf, item);
5013 em->block_start = bytenr;
5014 em->block_len = em->len;
5015 if (found_type == BTRFS_FILE_EXTENT_PREALLOC)
5016 set_bit(EXTENT_FLAG_PREALLOC, &em->flags);
5019 } else if (found_type == BTRFS_FILE_EXTENT_INLINE) {
5023 size_t extent_offset;
5026 em->block_start = EXTENT_MAP_INLINE;
5027 if (!page || create) {
5028 em->start = extent_start;
5029 em->len = extent_end - extent_start;
5033 size = btrfs_file_extent_inline_len(leaf, item);
5034 extent_offset = page_offset(page) + pg_offset - extent_start;
5035 copy_size = min_t(u64, PAGE_CACHE_SIZE - pg_offset,
5036 size - extent_offset);
5037 em->start = extent_start + extent_offset;
5038 em->len = (copy_size + root->sectorsize - 1) &
5039 ~((u64)root->sectorsize - 1);
5040 em->orig_start = EXTENT_MAP_INLINE;
5041 if (compress_type) {
5042 set_bit(EXTENT_FLAG_COMPRESSED, &em->flags);
5043 em->compress_type = compress_type;
5045 ptr = btrfs_file_extent_inline_start(item) + extent_offset;
5046 if (create == 0 && !PageUptodate(page)) {
5047 if (btrfs_file_extent_compression(leaf, item) !=
5048 BTRFS_COMPRESS_NONE) {
5049 ret = uncompress_inline(path, inode, page,
5051 extent_offset, item);
5055 read_extent_buffer(leaf, map + pg_offset, ptr,
5057 if (pg_offset + copy_size < PAGE_CACHE_SIZE) {
5058 memset(map + pg_offset + copy_size, 0,
5059 PAGE_CACHE_SIZE - pg_offset -
5064 flush_dcache_page(page);
5065 } else if (create && PageUptodate(page)) {
5069 free_extent_map(em);
5072 btrfs_release_path(path);
5073 trans = btrfs_join_transaction(root);
5076 return ERR_CAST(trans);
5080 write_extent_buffer(leaf, map + pg_offset, ptr,
5083 btrfs_mark_buffer_dirty(leaf);
5085 set_extent_uptodate(io_tree, em->start,
5086 extent_map_end(em) - 1, NULL, GFP_NOFS);
5089 printk(KERN_ERR "btrfs unknown found_type %d\n", found_type);
5096 em->block_start = EXTENT_MAP_HOLE;
5097 set_bit(EXTENT_FLAG_VACANCY, &em->flags);
5099 btrfs_release_path(path);
5100 if (em->start > start || extent_map_end(em) <= start) {
5101 printk(KERN_ERR "Btrfs: bad extent! em: [%llu %llu] passed "
5102 "[%llu %llu]\n", (unsigned long long)em->start,
5103 (unsigned long long)em->len,
5104 (unsigned long long)start,
5105 (unsigned long long)len);
5111 write_lock(&em_tree->lock);
5112 ret = add_extent_mapping(em_tree, em);
5113 /* it is possible that someone inserted the extent into the tree
5114 * while we had the lock dropped. It is also possible that
5115 * an overlapping map exists in the tree
5117 if (ret == -EEXIST) {
5118 struct extent_map *existing;
5122 existing = lookup_extent_mapping(em_tree, start, len);
5123 if (existing && (existing->start > start ||
5124 existing->start + existing->len <= start)) {
5125 free_extent_map(existing);
5129 existing = lookup_extent_mapping(em_tree, em->start,
5132 err = merge_extent_mapping(em_tree, existing,
5135 free_extent_map(existing);
5137 free_extent_map(em);
5142 free_extent_map(em);
5146 free_extent_map(em);
5151 write_unlock(&em_tree->lock);
5154 trace_btrfs_get_extent(root, em);
5157 btrfs_free_path(path);
5159 ret = btrfs_end_transaction(trans, root);
5164 free_extent_map(em);
5165 return ERR_PTR(err);
5170 struct extent_map *btrfs_get_extent_fiemap(struct inode *inode, struct page *page,
5171 size_t pg_offset, u64 start, u64 len,
5174 struct extent_map *em;
5175 struct extent_map *hole_em = NULL;
5176 u64 range_start = start;
5182 em = btrfs_get_extent(inode, page, pg_offset, start, len, create);
5187 * if our em maps to a hole, there might
5188 * actually be delalloc bytes behind it
5190 if (em->block_start != EXTENT_MAP_HOLE)
5196 /* check to see if we've wrapped (len == -1 or similar) */
5205 /* ok, we didn't find anything, lets look for delalloc */
5206 found = count_range_bits(&BTRFS_I(inode)->io_tree, &range_start,
5207 end, len, EXTENT_DELALLOC, 1);
5208 found_end = range_start + found;
5209 if (found_end < range_start)
5210 found_end = (u64)-1;
5213 * we didn't find anything useful, return
5214 * the original results from get_extent()
5216 if (range_start > end || found_end <= start) {
5222 /* adjust the range_start to make sure it doesn't
5223 * go backwards from the start they passed in
5225 range_start = max(start,range_start);
5226 found = found_end - range_start;
5229 u64 hole_start = start;
5232 em = alloc_extent_map();
5238 * when btrfs_get_extent can't find anything it
5239 * returns one huge hole
5241 * make sure what it found really fits our range, and
5242 * adjust to make sure it is based on the start from
5246 u64 calc_end = extent_map_end(hole_em);
5248 if (calc_end <= start || (hole_em->start > end)) {
5249 free_extent_map(hole_em);
5252 hole_start = max(hole_em->start, start);
5253 hole_len = calc_end - hole_start;
5257 if (hole_em && range_start > hole_start) {
5258 /* our hole starts before our delalloc, so we
5259 * have to return just the parts of the hole
5260 * that go until the delalloc starts
5262 em->len = min(hole_len,
5263 range_start - hole_start);
5264 em->start = hole_start;
5265 em->orig_start = hole_start;
5267 * don't adjust block start at all,
5268 * it is fixed at EXTENT_MAP_HOLE
5270 em->block_start = hole_em->block_start;
5271 em->block_len = hole_len;
5273 em->start = range_start;
5275 em->orig_start = range_start;
5276 em->block_start = EXTENT_MAP_DELALLOC;
5277 em->block_len = found;
5279 } else if (hole_em) {
5284 free_extent_map(hole_em);
5286 free_extent_map(em);
5287 return ERR_PTR(err);
5292 static struct extent_map *btrfs_new_extent_direct(struct inode *inode,
5293 struct extent_map *em,
5296 struct btrfs_root *root = BTRFS_I(inode)->root;
5297 struct btrfs_trans_handle *trans;
5298 struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree;
5299 struct btrfs_key ins;
5302 bool insert = false;
5305 * Ok if the extent map we looked up is a hole and is for the exact
5306 * range we want, there is no reason to allocate a new one, however if
5307 * it is not right then we need to free this one and drop the cache for
5310 if (em->block_start != EXTENT_MAP_HOLE || em->start != start ||
5312 free_extent_map(em);
5315 btrfs_drop_extent_cache(inode, start, start + len - 1, 0);
5318 trans = btrfs_join_transaction(root);
5320 return ERR_CAST(trans);
5322 if (start <= BTRFS_I(inode)->disk_i_size && len < 64 * 1024)
5323 btrfs_add_inode_defrag(trans, inode);
5325 trans->block_rsv = &root->fs_info->delalloc_block_rsv;
5327 alloc_hint = get_extent_allocation_hint(inode, start, len);
5328 ret = btrfs_reserve_extent(trans, root, len, root->sectorsize, 0,
5329 alloc_hint, (u64)-1, &ins, 1);
5336 em = alloc_extent_map();
5338 em = ERR_PTR(-ENOMEM);
5344 em->orig_start = em->start;
5345 em->len = ins.offset;
5347 em->block_start = ins.objectid;
5348 em->block_len = ins.offset;
5349 em->bdev = root->fs_info->fs_devices->latest_bdev;
5352 * We need to do this because if we're using the original em we searched
5353 * for, we could have EXTENT_FLAG_VACANCY set, and we don't want that.
5356 set_bit(EXTENT_FLAG_PINNED, &em->flags);
5359 write_lock(&em_tree->lock);
5360 ret = add_extent_mapping(em_tree, em);
5361 write_unlock(&em_tree->lock);
5364 btrfs_drop_extent_cache(inode, start, start + em->len - 1, 0);
5367 ret = btrfs_add_ordered_extent_dio(inode, start, ins.objectid,
5368 ins.offset, ins.offset, 0);
5370 btrfs_free_reserved_extent(root, ins.objectid, ins.offset);
5374 btrfs_end_transaction(trans, root);
5379 * returns 1 when the nocow is safe, < 1 on error, 0 if the
5380 * block must be cow'd
5382 static noinline int can_nocow_odirect(struct btrfs_trans_handle *trans,
5383 struct inode *inode, u64 offset, u64 len)
5385 struct btrfs_path *path;
5387 struct extent_buffer *leaf;
5388 struct btrfs_root *root = BTRFS_I(inode)->root;
5389 struct btrfs_file_extent_item *fi;
5390 struct btrfs_key key;
5398 path = btrfs_alloc_path();
5402 ret = btrfs_lookup_file_extent(trans, root, path, btrfs_ino(inode),
5407 slot = path->slots[0];
5410 /* can't find the item, must cow */
5417 leaf = path->nodes[0];
5418 btrfs_item_key_to_cpu(leaf, &key, slot);
5419 if (key.objectid != btrfs_ino(inode) ||
5420 key.type != BTRFS_EXTENT_DATA_KEY) {
5421 /* not our file or wrong item type, must cow */
5425 if (key.offset > offset) {
5426 /* Wrong offset, must cow */
5430 fi = btrfs_item_ptr(leaf, slot, struct btrfs_file_extent_item);
5431 found_type = btrfs_file_extent_type(leaf, fi);
5432 if (found_type != BTRFS_FILE_EXTENT_REG &&
5433 found_type != BTRFS_FILE_EXTENT_PREALLOC) {
5434 /* not a regular extent, must cow */
5437 disk_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi);
5438 backref_offset = btrfs_file_extent_offset(leaf, fi);
5440 extent_end = key.offset + btrfs_file_extent_num_bytes(leaf, fi);
5441 if (extent_end < offset + len) {
5442 /* extent doesn't include our full range, must cow */
5446 if (btrfs_extent_readonly(root, disk_bytenr))
5450 * look for other files referencing this extent, if we
5451 * find any we must cow
5453 if (btrfs_cross_ref_exist(trans, root, btrfs_ino(inode),
5454 key.offset - backref_offset, disk_bytenr))
5458 * adjust disk_bytenr and num_bytes to cover just the bytes
5459 * in this extent we are about to write. If there
5460 * are any csums in that range we have to cow in order
5461 * to keep the csums correct
5463 disk_bytenr += backref_offset;
5464 disk_bytenr += offset - key.offset;
5465 num_bytes = min(offset + len, extent_end) - offset;
5466 if (csum_exist_in_range(root, disk_bytenr, num_bytes))
5469 * all of the above have passed, it is safe to overwrite this extent
5474 btrfs_free_path(path);
5478 static int btrfs_get_blocks_direct(struct inode *inode, sector_t iblock,
5479 struct buffer_head *bh_result, int create)
5481 struct extent_map *em;
5482 struct btrfs_root *root = BTRFS_I(inode)->root;
5483 u64 start = iblock << inode->i_blkbits;
5484 u64 len = bh_result->b_size;
5485 struct btrfs_trans_handle *trans;
5487 em = btrfs_get_extent(inode, NULL, 0, start, len, 0);
5492 * Ok for INLINE and COMPRESSED extents we need to fallback on buffered
5493 * io. INLINE is special, and we could probably kludge it in here, but
5494 * it's still buffered so for safety lets just fall back to the generic
5497 * For COMPRESSED we _have_ to read the entire extent in so we can
5498 * decompress it, so there will be buffering required no matter what we
5499 * do, so go ahead and fallback to buffered.
5501 * We return -ENOTBLK because thats what makes DIO go ahead and go back
5502 * to buffered IO. Don't blame me, this is the price we pay for using
5505 if (test_bit(EXTENT_FLAG_COMPRESSED, &em->flags) ||
5506 em->block_start == EXTENT_MAP_INLINE) {
5507 free_extent_map(em);
5511 /* Just a good old fashioned hole, return */
5512 if (!create && (em->block_start == EXTENT_MAP_HOLE ||
5513 test_bit(EXTENT_FLAG_PREALLOC, &em->flags))) {
5514 free_extent_map(em);
5515 /* DIO will do one hole at a time, so just unlock a sector */
5516 unlock_extent(&BTRFS_I(inode)->io_tree, start,
5517 start + root->sectorsize - 1, GFP_NOFS);
5522 * We don't allocate a new extent in the following cases
5524 * 1) The inode is marked as NODATACOW. In this case we'll just use the
5526 * 2) The extent is marked as PREALLOC. We're good to go here and can
5527 * just use the extent.
5531 len = em->len - (start - em->start);
5535 if (test_bit(EXTENT_FLAG_PREALLOC, &em->flags) ||
5536 ((BTRFS_I(inode)->flags & BTRFS_INODE_NODATACOW) &&
5537 em->block_start != EXTENT_MAP_HOLE)) {
5542 if (test_bit(EXTENT_FLAG_PREALLOC, &em->flags))
5543 type = BTRFS_ORDERED_PREALLOC;
5545 type = BTRFS_ORDERED_NOCOW;
5546 len = min(len, em->len - (start - em->start));
5547 block_start = em->block_start + (start - em->start);
5550 * we're not going to log anything, but we do need
5551 * to make sure the current transaction stays open
5552 * while we look for nocow cross refs
5554 trans = btrfs_join_transaction(root);
5558 if (can_nocow_odirect(trans, inode, start, len) == 1) {
5559 ret = btrfs_add_ordered_extent_dio(inode, start,
5560 block_start, len, len, type);
5561 btrfs_end_transaction(trans, root);
5563 free_extent_map(em);
5568 btrfs_end_transaction(trans, root);
5572 * this will cow the extent, reset the len in case we changed
5575 len = bh_result->b_size;
5576 em = btrfs_new_extent_direct(inode, em, start, len);
5579 len = min(len, em->len - (start - em->start));
5581 clear_extent_bit(&BTRFS_I(inode)->io_tree, start, start + len - 1,
5582 EXTENT_LOCKED | EXTENT_DELALLOC | EXTENT_DIRTY, 1,
5585 bh_result->b_blocknr = (em->block_start + (start - em->start)) >>
5587 bh_result->b_size = len;
5588 bh_result->b_bdev = em->bdev;
5589 set_buffer_mapped(bh_result);
5590 if (create && !test_bit(EXTENT_FLAG_PREALLOC, &em->flags))
5591 set_buffer_new(bh_result);
5593 free_extent_map(em);
5598 struct btrfs_dio_private {
5599 struct inode *inode;
5606 /* number of bios pending for this dio */
5607 atomic_t pending_bios;
5612 struct bio *orig_bio;
5615 static void btrfs_endio_direct_read(struct bio *bio, int err)
5617 struct btrfs_dio_private *dip = bio->bi_private;
5618 struct bio_vec *bvec_end = bio->bi_io_vec + bio->bi_vcnt - 1;
5619 struct bio_vec *bvec = bio->bi_io_vec;
5620 struct inode *inode = dip->inode;
5621 struct btrfs_root *root = BTRFS_I(inode)->root;
5623 u32 *private = dip->csums;
5625 start = dip->logical_offset;
5627 if (!(BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM)) {
5628 struct page *page = bvec->bv_page;
5631 unsigned long flags;
5633 local_irq_save(flags);
5634 kaddr = kmap_atomic(page, KM_IRQ0);
5635 csum = btrfs_csum_data(root, kaddr + bvec->bv_offset,
5636 csum, bvec->bv_len);
5637 btrfs_csum_final(csum, (char *)&csum);
5638 kunmap_atomic(kaddr, KM_IRQ0);
5639 local_irq_restore(flags);
5641 flush_dcache_page(bvec->bv_page);
5642 if (csum != *private) {
5643 printk(KERN_ERR "btrfs csum failed ino %llu off"
5644 " %llu csum %u private %u\n",
5645 (unsigned long long)btrfs_ino(inode),
5646 (unsigned long long)start,
5652 start += bvec->bv_len;
5655 } while (bvec <= bvec_end);
5657 unlock_extent(&BTRFS_I(inode)->io_tree, dip->logical_offset,
5658 dip->logical_offset + dip->bytes - 1, GFP_NOFS);
5659 bio->bi_private = dip->private;
5664 /* If we had a csum failure make sure to clear the uptodate flag */
5666 clear_bit(BIO_UPTODATE, &bio->bi_flags);
5667 dio_end_io(bio, err);
5670 static void btrfs_endio_direct_write(struct bio *bio, int err)
5672 struct btrfs_dio_private *dip = bio->bi_private;
5673 struct inode *inode = dip->inode;
5674 struct btrfs_root *root = BTRFS_I(inode)->root;
5675 struct btrfs_trans_handle *trans;
5676 struct btrfs_ordered_extent *ordered = NULL;
5677 struct extent_state *cached_state = NULL;
5678 u64 ordered_offset = dip->logical_offset;
5679 u64 ordered_bytes = dip->bytes;
5685 ret = btrfs_dec_test_first_ordered_pending(inode, &ordered,
5693 trans = btrfs_join_transaction(root);
5694 if (IS_ERR(trans)) {
5698 trans->block_rsv = &root->fs_info->delalloc_block_rsv;
5700 if (test_bit(BTRFS_ORDERED_NOCOW, &ordered->flags)) {
5701 ret = btrfs_ordered_update_i_size(inode, 0, ordered);
5703 err = btrfs_update_inode_fallback(trans, root, inode);
5707 lock_extent_bits(&BTRFS_I(inode)->io_tree, ordered->file_offset,
5708 ordered->file_offset + ordered->len - 1, 0,
5709 &cached_state, GFP_NOFS);
5711 if (test_bit(BTRFS_ORDERED_PREALLOC, &ordered->flags)) {
5712 ret = btrfs_mark_extent_written(trans, inode,
5713 ordered->file_offset,
5714 ordered->file_offset +
5721 ret = insert_reserved_file_extent(trans, inode,
5722 ordered->file_offset,
5728 BTRFS_FILE_EXTENT_REG);
5729 unpin_extent_cache(&BTRFS_I(inode)->extent_tree,
5730 ordered->file_offset, ordered->len);
5738 add_pending_csums(trans, inode, ordered->file_offset, &ordered->list);
5739 ret = btrfs_ordered_update_i_size(inode, 0, ordered);
5740 if (!ret || !test_bit(BTRFS_ORDERED_PREALLOC, &ordered->flags))
5741 btrfs_update_inode_fallback(trans, root, inode);
5744 unlock_extent_cached(&BTRFS_I(inode)->io_tree, ordered->file_offset,
5745 ordered->file_offset + ordered->len - 1,
5746 &cached_state, GFP_NOFS);
5748 btrfs_delalloc_release_metadata(inode, ordered->len);
5749 btrfs_end_transaction(trans, root);
5750 ordered_offset = ordered->file_offset + ordered->len;
5751 btrfs_put_ordered_extent(ordered);
5752 btrfs_put_ordered_extent(ordered);
5756 * our bio might span multiple ordered extents. If we haven't
5757 * completed the accounting for the whole dio, go back and try again
5759 if (ordered_offset < dip->logical_offset + dip->bytes) {
5760 ordered_bytes = dip->logical_offset + dip->bytes -
5765 bio->bi_private = dip->private;
5770 /* If we had an error make sure to clear the uptodate flag */
5772 clear_bit(BIO_UPTODATE, &bio->bi_flags);
5773 dio_end_io(bio, err);
5776 static int __btrfs_submit_bio_start_direct_io(struct inode *inode, int rw,
5777 struct bio *bio, int mirror_num,
5778 unsigned long bio_flags, u64 offset)
5781 struct btrfs_root *root = BTRFS_I(inode)->root;
5782 ret = btrfs_csum_one_bio(root, inode, bio, offset, 1);
5787 static void btrfs_end_dio_bio(struct bio *bio, int err)
5789 struct btrfs_dio_private *dip = bio->bi_private;
5792 printk(KERN_ERR "btrfs direct IO failed ino %llu rw %lu "
5793 "sector %#Lx len %u err no %d\n",
5794 (unsigned long long)btrfs_ino(dip->inode), bio->bi_rw,
5795 (unsigned long long)bio->bi_sector, bio->bi_size, err);
5799 * before atomic variable goto zero, we must make sure
5800 * dip->errors is perceived to be set.
5802 smp_mb__before_atomic_dec();
5805 /* if there are more bios still pending for this dio, just exit */
5806 if (!atomic_dec_and_test(&dip->pending_bios))
5810 bio_io_error(dip->orig_bio);
5812 set_bit(BIO_UPTODATE, &dip->orig_bio->bi_flags);
5813 bio_endio(dip->orig_bio, 0);
5819 static struct bio *btrfs_dio_bio_alloc(struct block_device *bdev,
5820 u64 first_sector, gfp_t gfp_flags)
5822 int nr_vecs = bio_get_nr_vecs(bdev);
5823 return btrfs_bio_alloc(bdev, first_sector, nr_vecs, gfp_flags);
5826 static inline int __btrfs_submit_dio_bio(struct bio *bio, struct inode *inode,
5827 int rw, u64 file_offset, int skip_sum,
5828 u32 *csums, int async_submit)
5830 int write = rw & REQ_WRITE;
5831 struct btrfs_root *root = BTRFS_I(inode)->root;
5835 ret = btrfs_bio_wq_end_io(root->fs_info, bio, 0);
5842 if (write && async_submit) {
5843 ret = btrfs_wq_submit_bio(root->fs_info,
5844 inode, rw, bio, 0, 0,
5846 __btrfs_submit_bio_start_direct_io,
5847 __btrfs_submit_bio_done);
5851 * If we aren't doing async submit, calculate the csum of the
5854 ret = btrfs_csum_one_bio(root, inode, bio, file_offset, 1);
5857 } else if (!skip_sum) {
5858 ret = btrfs_lookup_bio_sums_dio(root, inode, bio,
5859 file_offset, csums);
5865 ret = btrfs_map_bio(root, rw, bio, 0, async_submit);
5871 static int btrfs_submit_direct_hook(int rw, struct btrfs_dio_private *dip,
5874 struct inode *inode = dip->inode;
5875 struct btrfs_root *root = BTRFS_I(inode)->root;
5876 struct btrfs_mapping_tree *map_tree = &root->fs_info->mapping_tree;
5878 struct bio *orig_bio = dip->orig_bio;
5879 struct bio_vec *bvec = orig_bio->bi_io_vec;
5880 u64 start_sector = orig_bio->bi_sector;
5881 u64 file_offset = dip->logical_offset;
5885 u32 *csums = dip->csums;
5887 int async_submit = 0;
5888 int write = rw & REQ_WRITE;
5890 map_length = orig_bio->bi_size;
5891 ret = btrfs_map_block(map_tree, READ, start_sector << 9,
5892 &map_length, NULL, 0);
5898 if (map_length >= orig_bio->bi_size) {
5904 bio = btrfs_dio_bio_alloc(orig_bio->bi_bdev, start_sector, GFP_NOFS);
5907 bio->bi_private = dip;
5908 bio->bi_end_io = btrfs_end_dio_bio;
5909 atomic_inc(&dip->pending_bios);
5911 while (bvec <= (orig_bio->bi_io_vec + orig_bio->bi_vcnt - 1)) {
5912 if (unlikely(map_length < submit_len + bvec->bv_len ||
5913 bio_add_page(bio, bvec->bv_page, bvec->bv_len,
5914 bvec->bv_offset) < bvec->bv_len)) {
5916 * inc the count before we submit the bio so
5917 * we know the end IO handler won't happen before
5918 * we inc the count. Otherwise, the dip might get freed
5919 * before we're done setting it up
5921 atomic_inc(&dip->pending_bios);
5922 ret = __btrfs_submit_dio_bio(bio, inode, rw,
5923 file_offset, skip_sum,
5924 csums, async_submit);
5927 atomic_dec(&dip->pending_bios);
5931 /* Write's use the ordered csums */
5932 if (!write && !skip_sum)
5933 csums = csums + nr_pages;
5934 start_sector += submit_len >> 9;
5935 file_offset += submit_len;
5940 bio = btrfs_dio_bio_alloc(orig_bio->bi_bdev,
5941 start_sector, GFP_NOFS);
5944 bio->bi_private = dip;
5945 bio->bi_end_io = btrfs_end_dio_bio;
5947 map_length = orig_bio->bi_size;
5948 ret = btrfs_map_block(map_tree, READ, start_sector << 9,
5949 &map_length, NULL, 0);
5955 submit_len += bvec->bv_len;
5962 ret = __btrfs_submit_dio_bio(bio, inode, rw, file_offset, skip_sum,
5963 csums, async_submit);
5971 * before atomic variable goto zero, we must
5972 * make sure dip->errors is perceived to be set.
5974 smp_mb__before_atomic_dec();
5975 if (atomic_dec_and_test(&dip->pending_bios))
5976 bio_io_error(dip->orig_bio);
5978 /* bio_end_io() will handle error, so we needn't return it */
5982 static void btrfs_submit_direct(int rw, struct bio *bio, struct inode *inode,
5985 struct btrfs_root *root = BTRFS_I(inode)->root;
5986 struct btrfs_dio_private *dip;
5987 struct bio_vec *bvec = bio->bi_io_vec;
5989 int write = rw & REQ_WRITE;
5992 skip_sum = BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM;
5994 dip = kmalloc(sizeof(*dip), GFP_NOFS);
6001 /* Write's use the ordered csum stuff, so we don't need dip->csums */
6002 if (!write && !skip_sum) {
6003 dip->csums = kmalloc(sizeof(u32) * bio->bi_vcnt, GFP_NOFS);
6011 dip->private = bio->bi_private;
6013 dip->logical_offset = file_offset;
6017 dip->bytes += bvec->bv_len;
6019 } while (bvec <= (bio->bi_io_vec + bio->bi_vcnt - 1));
6021 dip->disk_bytenr = (u64)bio->bi_sector << 9;
6022 bio->bi_private = dip;
6024 dip->orig_bio = bio;
6025 atomic_set(&dip->pending_bios, 0);
6028 bio->bi_end_io = btrfs_endio_direct_write;
6030 bio->bi_end_io = btrfs_endio_direct_read;
6032 ret = btrfs_submit_direct_hook(rw, dip, skip_sum);
6037 * If this is a write, we need to clean up the reserved space and kill
6038 * the ordered extent.
6041 struct btrfs_ordered_extent *ordered;
6042 ordered = btrfs_lookup_ordered_extent(inode, file_offset);
6043 if (!test_bit(BTRFS_ORDERED_PREALLOC, &ordered->flags) &&
6044 !test_bit(BTRFS_ORDERED_NOCOW, &ordered->flags))
6045 btrfs_free_reserved_extent(root, ordered->start,
6047 btrfs_put_ordered_extent(ordered);
6048 btrfs_put_ordered_extent(ordered);
6050 bio_endio(bio, ret);
6053 static ssize_t check_direct_IO(struct btrfs_root *root, int rw, struct kiocb *iocb,
6054 const struct iovec *iov, loff_t offset,
6055 unsigned long nr_segs)
6061 unsigned blocksize_mask = root->sectorsize - 1;
6062 ssize_t retval = -EINVAL;
6063 loff_t end = offset;
6065 if (offset & blocksize_mask)
6068 /* Check the memory alignment. Blocks cannot straddle pages */
6069 for (seg = 0; seg < nr_segs; seg++) {
6070 addr = (unsigned long)iov[seg].iov_base;
6071 size = iov[seg].iov_len;
6073 if ((addr & blocksize_mask) || (size & blocksize_mask))
6076 /* If this is a write we don't need to check anymore */
6081 * Check to make sure we don't have duplicate iov_base's in this
6082 * iovec, if so return EINVAL, otherwise we'll get csum errors
6083 * when reading back.
6085 for (i = seg + 1; i < nr_segs; i++) {
6086 if (iov[seg].iov_base == iov[i].iov_base)
6094 static ssize_t btrfs_direct_IO(int rw, struct kiocb *iocb,
6095 const struct iovec *iov, loff_t offset,
6096 unsigned long nr_segs)
6098 struct file *file = iocb->ki_filp;
6099 struct inode *inode = file->f_mapping->host;
6100 struct btrfs_ordered_extent *ordered;
6101 struct extent_state *cached_state = NULL;
6102 u64 lockstart, lockend;
6104 int writing = rw & WRITE;
6106 size_t count = iov_length(iov, nr_segs);
6108 if (check_direct_IO(BTRFS_I(inode)->root, rw, iocb, iov,
6114 lockend = offset + count - 1;
6117 ret = btrfs_delalloc_reserve_space(inode, count);
6123 lock_extent_bits(&BTRFS_I(inode)->io_tree, lockstart, lockend,
6124 0, &cached_state, GFP_NOFS);
6126 * We're concerned with the entire range that we're going to be
6127 * doing DIO to, so we need to make sure theres no ordered
6128 * extents in this range.
6130 ordered = btrfs_lookup_ordered_range(inode, lockstart,
6131 lockend - lockstart + 1);
6134 unlock_extent_cached(&BTRFS_I(inode)->io_tree, lockstart, lockend,
6135 &cached_state, GFP_NOFS);
6136 btrfs_start_ordered_extent(inode, ordered, 1);
6137 btrfs_put_ordered_extent(ordered);
6142 * we don't use btrfs_set_extent_delalloc because we don't want
6143 * the dirty or uptodate bits
6146 write_bits = EXTENT_DELALLOC | EXTENT_DO_ACCOUNTING;
6147 ret = set_extent_bit(&BTRFS_I(inode)->io_tree, lockstart, lockend,
6148 EXTENT_DELALLOC, 0, NULL, &cached_state,
6151 clear_extent_bit(&BTRFS_I(inode)->io_tree, lockstart,
6152 lockend, EXTENT_LOCKED | write_bits,
6153 1, 0, &cached_state, GFP_NOFS);
6158 free_extent_state(cached_state);
6159 cached_state = NULL;
6161 ret = __blockdev_direct_IO(rw, iocb, inode,
6162 BTRFS_I(inode)->root->fs_info->fs_devices->latest_bdev,
6163 iov, offset, nr_segs, btrfs_get_blocks_direct, NULL,
6164 btrfs_submit_direct, 0);
6166 if (ret < 0 && ret != -EIOCBQUEUED) {
6167 clear_extent_bit(&BTRFS_I(inode)->io_tree, offset,
6168 offset + iov_length(iov, nr_segs) - 1,
6169 EXTENT_LOCKED | write_bits, 1, 0,
6170 &cached_state, GFP_NOFS);
6171 } else if (ret >= 0 && ret < iov_length(iov, nr_segs)) {
6173 * We're falling back to buffered, unlock the section we didn't
6176 clear_extent_bit(&BTRFS_I(inode)->io_tree, offset + ret,
6177 offset + iov_length(iov, nr_segs) - 1,
6178 EXTENT_LOCKED | write_bits, 1, 0,
6179 &cached_state, GFP_NOFS);
6182 free_extent_state(cached_state);
6186 static int btrfs_fiemap(struct inode *inode, struct fiemap_extent_info *fieinfo,
6187 __u64 start, __u64 len)
6189 return extent_fiemap(inode, fieinfo, start, len, btrfs_get_extent_fiemap);
6192 int btrfs_readpage(struct file *file, struct page *page)
6194 struct extent_io_tree *tree;
6195 tree = &BTRFS_I(page->mapping->host)->io_tree;
6196 return extent_read_full_page(tree, page, btrfs_get_extent, 0);
6199 static int btrfs_writepage(struct page *page, struct writeback_control *wbc)
6201 struct extent_io_tree *tree;
6204 if (current->flags & PF_MEMALLOC) {
6205 redirty_page_for_writepage(wbc, page);
6209 tree = &BTRFS_I(page->mapping->host)->io_tree;
6210 return extent_write_full_page(tree, page, btrfs_get_extent, wbc);
6213 int btrfs_writepages(struct address_space *mapping,
6214 struct writeback_control *wbc)
6216 struct extent_io_tree *tree;
6218 tree = &BTRFS_I(mapping->host)->io_tree;
6219 return extent_writepages(tree, mapping, btrfs_get_extent, wbc);
6223 btrfs_readpages(struct file *file, struct address_space *mapping,
6224 struct list_head *pages, unsigned nr_pages)
6226 struct extent_io_tree *tree;
6227 tree = &BTRFS_I(mapping->host)->io_tree;
6228 return extent_readpages(tree, mapping, pages, nr_pages,
6231 static int __btrfs_releasepage(struct page *page, gfp_t gfp_flags)
6233 struct extent_io_tree *tree;
6234 struct extent_map_tree *map;
6237 tree = &BTRFS_I(page->mapping->host)->io_tree;
6238 map = &BTRFS_I(page->mapping->host)->extent_tree;
6239 ret = try_release_extent_mapping(map, tree, page, gfp_flags);
6241 ClearPagePrivate(page);
6242 set_page_private(page, 0);
6243 page_cache_release(page);
6248 static int btrfs_releasepage(struct page *page, gfp_t gfp_flags)
6250 if (PageWriteback(page) || PageDirty(page))
6252 return __btrfs_releasepage(page, gfp_flags & GFP_NOFS);
6255 static void btrfs_invalidatepage(struct page *page, unsigned long offset)
6257 struct extent_io_tree *tree;
6258 struct btrfs_ordered_extent *ordered;
6259 struct extent_state *cached_state = NULL;
6260 u64 page_start = page_offset(page);
6261 u64 page_end = page_start + PAGE_CACHE_SIZE - 1;
6265 * we have the page locked, so new writeback can't start,
6266 * and the dirty bit won't be cleared while we are here.
6268 * Wait for IO on this page so that we can safely clear
6269 * the PagePrivate2 bit and do ordered accounting
6271 wait_on_page_writeback(page);
6273 tree = &BTRFS_I(page->mapping->host)->io_tree;
6275 btrfs_releasepage(page, GFP_NOFS);
6278 lock_extent_bits(tree, page_start, page_end, 0, &cached_state,
6280 ordered = btrfs_lookup_ordered_extent(page->mapping->host,
6284 * IO on this page will never be started, so we need
6285 * to account for any ordered extents now
6287 clear_extent_bit(tree, page_start, page_end,
6288 EXTENT_DIRTY | EXTENT_DELALLOC |
6289 EXTENT_LOCKED | EXTENT_DO_ACCOUNTING, 1, 0,
6290 &cached_state, GFP_NOFS);
6292 * whoever cleared the private bit is responsible
6293 * for the finish_ordered_io
6295 if (TestClearPagePrivate2(page)) {
6296 btrfs_finish_ordered_io(page->mapping->host,
6297 page_start, page_end);
6299 btrfs_put_ordered_extent(ordered);
6300 cached_state = NULL;
6301 lock_extent_bits(tree, page_start, page_end, 0, &cached_state,
6304 clear_extent_bit(tree, page_start, page_end,
6305 EXTENT_LOCKED | EXTENT_DIRTY | EXTENT_DELALLOC |
6306 EXTENT_DO_ACCOUNTING, 1, 1, &cached_state, GFP_NOFS);
6307 __btrfs_releasepage(page, GFP_NOFS);
6309 ClearPageChecked(page);
6310 if (PagePrivate(page)) {
6311 ClearPagePrivate(page);
6312 set_page_private(page, 0);
6313 page_cache_release(page);
6318 * btrfs_page_mkwrite() is not allowed to change the file size as it gets
6319 * called from a page fault handler when a page is first dirtied. Hence we must
6320 * be careful to check for EOF conditions here. We set the page up correctly
6321 * for a written page which means we get ENOSPC checking when writing into
6322 * holes and correct delalloc and unwritten extent mapping on filesystems that
6323 * support these features.
6325 * We are not allowed to take the i_mutex here so we have to play games to
6326 * protect against truncate races as the page could now be beyond EOF. Because
6327 * vmtruncate() writes the inode size before removing pages, once we have the
6328 * page lock we can determine safely if the page is beyond EOF. If it is not
6329 * beyond EOF, then the page is guaranteed safe against truncation until we
6332 int btrfs_page_mkwrite(struct vm_area_struct *vma, struct vm_fault *vmf)
6334 struct page *page = vmf->page;
6335 struct inode *inode = fdentry(vma->vm_file)->d_inode;
6336 struct btrfs_root *root = BTRFS_I(inode)->root;
6337 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
6338 struct btrfs_ordered_extent *ordered;
6339 struct extent_state *cached_state = NULL;
6341 unsigned long zero_start;
6347 ret = btrfs_delalloc_reserve_space(inode, PAGE_CACHE_SIZE);
6351 else /* -ENOSPC, -EIO, etc */
6352 ret = VM_FAULT_SIGBUS;
6356 ret = VM_FAULT_NOPAGE; /* make the VM retry the fault */
6359 size = i_size_read(inode);
6360 page_start = page_offset(page);
6361 page_end = page_start + PAGE_CACHE_SIZE - 1;
6363 if ((page->mapping != inode->i_mapping) ||
6364 (page_start >= size)) {
6365 /* page got truncated out from underneath us */
6368 wait_on_page_writeback(page);
6370 lock_extent_bits(io_tree, page_start, page_end, 0, &cached_state,
6372 set_page_extent_mapped(page);
6375 * we can't set the delalloc bits if there are pending ordered
6376 * extents. Drop our locks and wait for them to finish
6378 ordered = btrfs_lookup_ordered_extent(inode, page_start);
6380 unlock_extent_cached(io_tree, page_start, page_end,
6381 &cached_state, GFP_NOFS);
6383 btrfs_start_ordered_extent(inode, ordered, 1);
6384 btrfs_put_ordered_extent(ordered);
6389 * XXX - page_mkwrite gets called every time the page is dirtied, even
6390 * if it was already dirty, so for space accounting reasons we need to
6391 * clear any delalloc bits for the range we are fixing to save. There
6392 * is probably a better way to do this, but for now keep consistent with
6393 * prepare_pages in the normal write path.
6395 clear_extent_bit(&BTRFS_I(inode)->io_tree, page_start, page_end,
6396 EXTENT_DIRTY | EXTENT_DELALLOC | EXTENT_DO_ACCOUNTING,
6397 0, 0, &cached_state, GFP_NOFS);
6399 ret = btrfs_set_extent_delalloc(inode, page_start, page_end,
6402 unlock_extent_cached(io_tree, page_start, page_end,
6403 &cached_state, GFP_NOFS);
6404 ret = VM_FAULT_SIGBUS;
6409 /* page is wholly or partially inside EOF */
6410 if (page_start + PAGE_CACHE_SIZE > size)
6411 zero_start = size & ~PAGE_CACHE_MASK;
6413 zero_start = PAGE_CACHE_SIZE;
6415 if (zero_start != PAGE_CACHE_SIZE) {
6417 memset(kaddr + zero_start, 0, PAGE_CACHE_SIZE - zero_start);
6418 flush_dcache_page(page);
6421 ClearPageChecked(page);
6422 set_page_dirty(page);
6423 SetPageUptodate(page);
6425 BTRFS_I(inode)->last_trans = root->fs_info->generation;
6426 BTRFS_I(inode)->last_sub_trans = BTRFS_I(inode)->root->log_transid;
6428 unlock_extent_cached(io_tree, page_start, page_end, &cached_state, GFP_NOFS);
6432 return VM_FAULT_LOCKED;
6434 btrfs_delalloc_release_space(inode, PAGE_CACHE_SIZE);
6439 static int btrfs_truncate(struct inode *inode)
6441 struct btrfs_root *root = BTRFS_I(inode)->root;
6442 struct btrfs_block_rsv *rsv;
6445 struct btrfs_trans_handle *trans;
6447 u64 mask = root->sectorsize - 1;
6448 u64 min_size = btrfs_calc_trunc_metadata_size(root, 1);
6450 ret = btrfs_truncate_page(inode->i_mapping, inode->i_size);
6454 btrfs_wait_ordered_range(inode, inode->i_size & (~mask), (u64)-1);
6455 btrfs_ordered_update_i_size(inode, inode->i_size, NULL);
6458 * Yes ladies and gentelment, this is indeed ugly. The fact is we have
6459 * 3 things going on here
6461 * 1) We need to reserve space for our orphan item and the space to
6462 * delete our orphan item. Lord knows we don't want to have a dangling
6463 * orphan item because we didn't reserve space to remove it.
6465 * 2) We need to reserve space to update our inode.
6467 * 3) We need to have something to cache all the space that is going to
6468 * be free'd up by the truncate operation, but also have some slack
6469 * space reserved in case it uses space during the truncate (thank you
6470 * very much snapshotting).
6472 * And we need these to all be seperate. The fact is we can use alot of
6473 * space doing the truncate, and we have no earthly idea how much space
6474 * we will use, so we need the truncate reservation to be seperate so it
6475 * doesn't end up using space reserved for updating the inode or
6476 * removing the orphan item. We also need to be able to stop the
6477 * transaction and start a new one, which means we need to be able to
6478 * update the inode several times, and we have no idea of knowing how
6479 * many times that will be, so we can't just reserve 1 item for the
6480 * entirety of the opration, so that has to be done seperately as well.
6481 * Then there is the orphan item, which does indeed need to be held on
6482 * to for the whole operation, and we need nobody to touch this reserved
6483 * space except the orphan code.
6485 * So that leaves us with
6487 * 1) root->orphan_block_rsv - for the orphan deletion.
6488 * 2) rsv - for the truncate reservation, which we will steal from the
6489 * transaction reservation.
6490 * 3) fs_info->trans_block_rsv - this will have 1 items worth left for
6491 * updating the inode.
6493 rsv = btrfs_alloc_block_rsv(root);
6496 rsv->size = min_size;
6499 * 1 for the truncate slack space
6500 * 1 for the orphan item we're going to add
6501 * 1 for the orphan item deletion
6502 * 1 for updating the inode.
6504 trans = btrfs_start_transaction(root, 4);
6505 if (IS_ERR(trans)) {
6506 err = PTR_ERR(trans);
6510 /* Migrate the slack space for the truncate to our reserve */
6511 ret = btrfs_block_rsv_migrate(&root->fs_info->trans_block_rsv, rsv,
6515 ret = btrfs_orphan_add(trans, inode);
6517 btrfs_end_transaction(trans, root);
6522 * setattr is responsible for setting the ordered_data_close flag,
6523 * but that is only tested during the last file release. That
6524 * could happen well after the next commit, leaving a great big
6525 * window where new writes may get lost if someone chooses to write
6526 * to this file after truncating to zero
6528 * The inode doesn't have any dirty data here, and so if we commit
6529 * this is a noop. If someone immediately starts writing to the inode
6530 * it is very likely we'll catch some of their writes in this
6531 * transaction, and the commit will find this file on the ordered
6532 * data list with good things to send down.
6534 * This is a best effort solution, there is still a window where
6535 * using truncate to replace the contents of the file will
6536 * end up with a zero length file after a crash.
6538 if (inode->i_size == 0 && BTRFS_I(inode)->ordered_data_close)
6539 btrfs_add_ordered_operation(trans, root, inode);
6542 ret = btrfs_block_rsv_refill(root, rsv, min_size);
6545 * This can only happen with the original transaction we
6546 * started above, every other time we shouldn't have a
6547 * transaction started yet.
6556 /* Just need the 1 for updating the inode */
6557 trans = btrfs_start_transaction(root, 1);
6558 if (IS_ERR(trans)) {
6559 err = PTR_ERR(trans);
6564 trans->block_rsv = rsv;
6566 ret = btrfs_truncate_inode_items(trans, root, inode,
6568 BTRFS_EXTENT_DATA_KEY);
6569 if (ret != -EAGAIN) {
6574 trans->block_rsv = &root->fs_info->trans_block_rsv;
6575 ret = btrfs_update_inode(trans, root, inode);
6581 nr = trans->blocks_used;
6582 btrfs_end_transaction(trans, root);
6584 btrfs_btree_balance_dirty(root, nr);
6587 if (ret == 0 && inode->i_nlink > 0) {
6588 trans->block_rsv = root->orphan_block_rsv;
6589 ret = btrfs_orphan_del(trans, inode);
6592 } else if (ret && inode->i_nlink > 0) {
6594 * Failed to do the truncate, remove us from the in memory
6597 ret = btrfs_orphan_del(NULL, inode);
6601 trans->block_rsv = &root->fs_info->trans_block_rsv;
6602 ret = btrfs_update_inode(trans, root, inode);
6606 nr = trans->blocks_used;
6607 ret = btrfs_end_transaction_throttle(trans, root);
6608 btrfs_btree_balance_dirty(root, nr);
6612 btrfs_free_block_rsv(root, rsv);
6621 * create a new subvolume directory/inode (helper for the ioctl).
6623 int btrfs_create_subvol_root(struct btrfs_trans_handle *trans,
6624 struct btrfs_root *new_root, u64 new_dirid)
6626 struct inode *inode;
6630 inode = btrfs_new_inode(trans, new_root, NULL, "..", 2, new_dirid,
6631 new_dirid, S_IFDIR | 0700, &index);
6633 return PTR_ERR(inode);
6634 inode->i_op = &btrfs_dir_inode_operations;
6635 inode->i_fop = &btrfs_dir_file_operations;
6638 btrfs_i_size_write(inode, 0);
6640 err = btrfs_update_inode(trans, new_root, inode);
6647 struct inode *btrfs_alloc_inode(struct super_block *sb)
6649 struct btrfs_inode *ei;
6650 struct inode *inode;
6652 ei = kmem_cache_alloc(btrfs_inode_cachep, GFP_NOFS);
6657 ei->space_info = NULL;
6661 ei->last_sub_trans = 0;
6662 ei->logged_trans = 0;
6663 ei->delalloc_bytes = 0;
6664 ei->disk_i_size = 0;
6667 ei->index_cnt = (u64)-1;
6668 ei->last_unlink_trans = 0;
6670 spin_lock_init(&ei->lock);
6671 ei->outstanding_extents = 0;
6672 ei->reserved_extents = 0;
6674 ei->ordered_data_close = 0;
6675 ei->orphan_meta_reserved = 0;
6676 ei->dummy_inode = 0;
6678 ei->delalloc_meta_reserved = 0;
6679 ei->force_compress = BTRFS_COMPRESS_NONE;
6681 ei->delayed_node = NULL;
6683 inode = &ei->vfs_inode;
6684 extent_map_tree_init(&ei->extent_tree);
6685 extent_io_tree_init(&ei->io_tree, &inode->i_data);
6686 extent_io_tree_init(&ei->io_failure_tree, &inode->i_data);
6687 mutex_init(&ei->log_mutex);
6688 btrfs_ordered_inode_tree_init(&ei->ordered_tree);
6689 INIT_LIST_HEAD(&ei->i_orphan);
6690 INIT_LIST_HEAD(&ei->delalloc_inodes);
6691 INIT_LIST_HEAD(&ei->ordered_operations);
6692 RB_CLEAR_NODE(&ei->rb_node);
6697 static void btrfs_i_callback(struct rcu_head *head)
6699 struct inode *inode = container_of(head, struct inode, i_rcu);
6700 INIT_LIST_HEAD(&inode->i_dentry);
6701 kmem_cache_free(btrfs_inode_cachep, BTRFS_I(inode));
6704 void btrfs_destroy_inode(struct inode *inode)
6706 struct btrfs_ordered_extent *ordered;
6707 struct btrfs_root *root = BTRFS_I(inode)->root;
6709 WARN_ON(!list_empty(&inode->i_dentry));
6710 WARN_ON(inode->i_data.nrpages);
6711 WARN_ON(BTRFS_I(inode)->outstanding_extents);
6712 WARN_ON(BTRFS_I(inode)->reserved_extents);
6713 WARN_ON(BTRFS_I(inode)->delalloc_bytes);
6714 WARN_ON(BTRFS_I(inode)->csum_bytes);
6717 * This can happen where we create an inode, but somebody else also
6718 * created the same inode and we need to destroy the one we already
6725 * Make sure we're properly removed from the ordered operation
6729 if (!list_empty(&BTRFS_I(inode)->ordered_operations)) {
6730 spin_lock(&root->fs_info->ordered_extent_lock);
6731 list_del_init(&BTRFS_I(inode)->ordered_operations);
6732 spin_unlock(&root->fs_info->ordered_extent_lock);
6735 spin_lock(&root->orphan_lock);
6736 if (!list_empty(&BTRFS_I(inode)->i_orphan)) {
6737 printk(KERN_INFO "BTRFS: inode %llu still on the orphan list\n",
6738 (unsigned long long)btrfs_ino(inode));
6739 list_del_init(&BTRFS_I(inode)->i_orphan);
6741 spin_unlock(&root->orphan_lock);
6744 ordered = btrfs_lookup_first_ordered_extent(inode, (u64)-1);
6748 printk(KERN_ERR "btrfs found ordered "
6749 "extent %llu %llu on inode cleanup\n",
6750 (unsigned long long)ordered->file_offset,
6751 (unsigned long long)ordered->len);
6752 btrfs_remove_ordered_extent(inode, ordered);
6753 btrfs_put_ordered_extent(ordered);
6754 btrfs_put_ordered_extent(ordered);
6757 inode_tree_del(inode);
6758 btrfs_drop_extent_cache(inode, 0, (u64)-1, 0);
6760 btrfs_remove_delayed_node(inode);
6761 call_rcu(&inode->i_rcu, btrfs_i_callback);
6764 int btrfs_drop_inode(struct inode *inode)
6766 struct btrfs_root *root = BTRFS_I(inode)->root;
6768 if (btrfs_root_refs(&root->root_item) == 0 &&
6769 !btrfs_is_free_space_inode(root, inode))
6772 return generic_drop_inode(inode);
6775 static void init_once(void *foo)
6777 struct btrfs_inode *ei = (struct btrfs_inode *) foo;
6779 inode_init_once(&ei->vfs_inode);
6782 void btrfs_destroy_cachep(void)
6784 if (btrfs_inode_cachep)
6785 kmem_cache_destroy(btrfs_inode_cachep);
6786 if (btrfs_trans_handle_cachep)
6787 kmem_cache_destroy(btrfs_trans_handle_cachep);
6788 if (btrfs_transaction_cachep)
6789 kmem_cache_destroy(btrfs_transaction_cachep);
6790 if (btrfs_path_cachep)
6791 kmem_cache_destroy(btrfs_path_cachep);
6792 if (btrfs_free_space_cachep)
6793 kmem_cache_destroy(btrfs_free_space_cachep);
6796 int btrfs_init_cachep(void)
6798 btrfs_inode_cachep = kmem_cache_create("btrfs_inode_cache",
6799 sizeof(struct btrfs_inode), 0,
6800 SLAB_RECLAIM_ACCOUNT | SLAB_MEM_SPREAD, init_once);
6801 if (!btrfs_inode_cachep)
6804 btrfs_trans_handle_cachep = kmem_cache_create("btrfs_trans_handle_cache",
6805 sizeof(struct btrfs_trans_handle), 0,
6806 SLAB_RECLAIM_ACCOUNT | SLAB_MEM_SPREAD, NULL);
6807 if (!btrfs_trans_handle_cachep)
6810 btrfs_transaction_cachep = kmem_cache_create("btrfs_transaction_cache",
6811 sizeof(struct btrfs_transaction), 0,
6812 SLAB_RECLAIM_ACCOUNT | SLAB_MEM_SPREAD, NULL);
6813 if (!btrfs_transaction_cachep)
6816 btrfs_path_cachep = kmem_cache_create("btrfs_path_cache",
6817 sizeof(struct btrfs_path), 0,
6818 SLAB_RECLAIM_ACCOUNT | SLAB_MEM_SPREAD, NULL);
6819 if (!btrfs_path_cachep)
6822 btrfs_free_space_cachep = kmem_cache_create("btrfs_free_space_cache",
6823 sizeof(struct btrfs_free_space), 0,
6824 SLAB_RECLAIM_ACCOUNT | SLAB_MEM_SPREAD, NULL);
6825 if (!btrfs_free_space_cachep)
6830 btrfs_destroy_cachep();
6834 static int btrfs_getattr(struct vfsmount *mnt,
6835 struct dentry *dentry, struct kstat *stat)
6837 struct inode *inode = dentry->d_inode;
6838 u32 blocksize = inode->i_sb->s_blocksize;
6840 generic_fillattr(inode, stat);
6841 stat->dev = BTRFS_I(inode)->root->anon_dev;
6842 stat->blksize = PAGE_CACHE_SIZE;
6843 stat->blocks = (ALIGN(inode_get_bytes(inode), blocksize) +
6844 ALIGN(BTRFS_I(inode)->delalloc_bytes, blocksize)) >> 9;
6849 * If a file is moved, it will inherit the cow and compression flags of the new
6852 static void fixup_inode_flags(struct inode *dir, struct inode *inode)
6854 struct btrfs_inode *b_dir = BTRFS_I(dir);
6855 struct btrfs_inode *b_inode = BTRFS_I(inode);
6857 if (b_dir->flags & BTRFS_INODE_NODATACOW)
6858 b_inode->flags |= BTRFS_INODE_NODATACOW;
6860 b_inode->flags &= ~BTRFS_INODE_NODATACOW;
6862 if (b_dir->flags & BTRFS_INODE_COMPRESS)
6863 b_inode->flags |= BTRFS_INODE_COMPRESS;
6865 b_inode->flags &= ~BTRFS_INODE_COMPRESS;
6868 static int btrfs_rename(struct inode *old_dir, struct dentry *old_dentry,
6869 struct inode *new_dir, struct dentry *new_dentry)
6871 struct btrfs_trans_handle *trans;
6872 struct btrfs_root *root = BTRFS_I(old_dir)->root;
6873 struct btrfs_root *dest = BTRFS_I(new_dir)->root;
6874 struct inode *new_inode = new_dentry->d_inode;
6875 struct inode *old_inode = old_dentry->d_inode;
6876 struct timespec ctime = CURRENT_TIME;
6880 u64 old_ino = btrfs_ino(old_inode);
6882 if (btrfs_ino(new_dir) == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID)
6885 /* we only allow rename subvolume link between subvolumes */
6886 if (old_ino != BTRFS_FIRST_FREE_OBJECTID && root != dest)
6889 if (old_ino == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID ||
6890 (new_inode && btrfs_ino(new_inode) == BTRFS_FIRST_FREE_OBJECTID))
6893 if (S_ISDIR(old_inode->i_mode) && new_inode &&
6894 new_inode->i_size > BTRFS_EMPTY_DIR_SIZE)
6897 * we're using rename to replace one file with another.
6898 * and the replacement file is large. Start IO on it now so
6899 * we don't add too much work to the end of the transaction
6901 if (new_inode && S_ISREG(old_inode->i_mode) && new_inode->i_size &&
6902 old_inode->i_size > BTRFS_ORDERED_OPERATIONS_FLUSH_LIMIT)
6903 filemap_flush(old_inode->i_mapping);
6905 /* close the racy window with snapshot create/destroy ioctl */
6906 if (old_ino == BTRFS_FIRST_FREE_OBJECTID)
6907 down_read(&root->fs_info->subvol_sem);
6909 * We want to reserve the absolute worst case amount of items. So if
6910 * both inodes are subvols and we need to unlink them then that would
6911 * require 4 item modifications, but if they are both normal inodes it
6912 * would require 5 item modifications, so we'll assume their normal
6913 * inodes. So 5 * 2 is 10, plus 1 for the new link, so 11 total items
6914 * should cover the worst case number of items we'll modify.
6916 trans = btrfs_start_transaction(root, 20);
6917 if (IS_ERR(trans)) {
6918 ret = PTR_ERR(trans);
6923 btrfs_record_root_in_trans(trans, dest);
6925 ret = btrfs_set_inode_index(new_dir, &index);
6929 if (unlikely(old_ino == BTRFS_FIRST_FREE_OBJECTID)) {
6930 /* force full log commit if subvolume involved. */
6931 root->fs_info->last_trans_log_full_commit = trans->transid;
6933 ret = btrfs_insert_inode_ref(trans, dest,
6934 new_dentry->d_name.name,
6935 new_dentry->d_name.len,
6937 btrfs_ino(new_dir), index);
6941 * this is an ugly little race, but the rename is required
6942 * to make sure that if we crash, the inode is either at the
6943 * old name or the new one. pinning the log transaction lets
6944 * us make sure we don't allow a log commit to come in after
6945 * we unlink the name but before we add the new name back in.
6947 btrfs_pin_log_trans(root);
6950 * make sure the inode gets flushed if it is replacing
6953 if (new_inode && new_inode->i_size && S_ISREG(old_inode->i_mode))
6954 btrfs_add_ordered_operation(trans, root, old_inode);
6956 old_dir->i_ctime = old_dir->i_mtime = ctime;
6957 new_dir->i_ctime = new_dir->i_mtime = ctime;
6958 old_inode->i_ctime = ctime;
6960 if (old_dentry->d_parent != new_dentry->d_parent)
6961 btrfs_record_unlink_dir(trans, old_dir, old_inode, 1);
6963 if (unlikely(old_ino == BTRFS_FIRST_FREE_OBJECTID)) {
6964 root_objectid = BTRFS_I(old_inode)->root->root_key.objectid;
6965 ret = btrfs_unlink_subvol(trans, root, old_dir, root_objectid,
6966 old_dentry->d_name.name,
6967 old_dentry->d_name.len);
6969 ret = __btrfs_unlink_inode(trans, root, old_dir,
6970 old_dentry->d_inode,
6971 old_dentry->d_name.name,
6972 old_dentry->d_name.len);
6974 ret = btrfs_update_inode(trans, root, old_inode);
6979 new_inode->i_ctime = CURRENT_TIME;
6980 if (unlikely(btrfs_ino(new_inode) ==
6981 BTRFS_EMPTY_SUBVOL_DIR_OBJECTID)) {
6982 root_objectid = BTRFS_I(new_inode)->location.objectid;
6983 ret = btrfs_unlink_subvol(trans, dest, new_dir,
6985 new_dentry->d_name.name,
6986 new_dentry->d_name.len);
6987 BUG_ON(new_inode->i_nlink == 0);
6989 ret = btrfs_unlink_inode(trans, dest, new_dir,
6990 new_dentry->d_inode,
6991 new_dentry->d_name.name,
6992 new_dentry->d_name.len);
6995 if (new_inode->i_nlink == 0) {
6996 ret = btrfs_orphan_add(trans, new_dentry->d_inode);
7001 fixup_inode_flags(new_dir, old_inode);
7003 ret = btrfs_add_link(trans, new_dir, old_inode,
7004 new_dentry->d_name.name,
7005 new_dentry->d_name.len, 0, index);
7008 if (old_ino != BTRFS_FIRST_FREE_OBJECTID) {
7009 struct dentry *parent = new_dentry->d_parent;
7010 btrfs_log_new_name(trans, old_inode, old_dir, parent);
7011 btrfs_end_log_trans(root);
7014 btrfs_end_transaction_throttle(trans, root);
7016 if (old_ino == BTRFS_FIRST_FREE_OBJECTID)
7017 up_read(&root->fs_info->subvol_sem);
7023 * some fairly slow code that needs optimization. This walks the list
7024 * of all the inodes with pending delalloc and forces them to disk.
7026 int btrfs_start_delalloc_inodes(struct btrfs_root *root, int delay_iput)
7028 struct list_head *head = &root->fs_info->delalloc_inodes;
7029 struct btrfs_inode *binode;
7030 struct inode *inode;
7032 if (root->fs_info->sb->s_flags & MS_RDONLY)
7035 spin_lock(&root->fs_info->delalloc_lock);
7036 while (!list_empty(head)) {
7037 binode = list_entry(head->next, struct btrfs_inode,
7039 inode = igrab(&binode->vfs_inode);
7041 list_del_init(&binode->delalloc_inodes);
7042 spin_unlock(&root->fs_info->delalloc_lock);
7044 filemap_flush(inode->i_mapping);
7046 btrfs_add_delayed_iput(inode);
7051 spin_lock(&root->fs_info->delalloc_lock);
7053 spin_unlock(&root->fs_info->delalloc_lock);
7055 /* the filemap_flush will queue IO into the worker threads, but
7056 * we have to make sure the IO is actually started and that
7057 * ordered extents get created before we return
7059 atomic_inc(&root->fs_info->async_submit_draining);
7060 while (atomic_read(&root->fs_info->nr_async_submits) ||
7061 atomic_read(&root->fs_info->async_delalloc_pages)) {
7062 wait_event(root->fs_info->async_submit_wait,
7063 (atomic_read(&root->fs_info->nr_async_submits) == 0 &&
7064 atomic_read(&root->fs_info->async_delalloc_pages) == 0));
7066 atomic_dec(&root->fs_info->async_submit_draining);
7070 static int btrfs_symlink(struct inode *dir, struct dentry *dentry,
7071 const char *symname)
7073 struct btrfs_trans_handle *trans;
7074 struct btrfs_root *root = BTRFS_I(dir)->root;
7075 struct btrfs_path *path;
7076 struct btrfs_key key;
7077 struct inode *inode = NULL;
7085 struct btrfs_file_extent_item *ei;
7086 struct extent_buffer *leaf;
7087 unsigned long nr = 0;
7089 name_len = strlen(symname) + 1;
7090 if (name_len > BTRFS_MAX_INLINE_DATA_SIZE(root))
7091 return -ENAMETOOLONG;
7094 * 2 items for inode item and ref
7095 * 2 items for dir items
7096 * 1 item for xattr if selinux is on
7098 trans = btrfs_start_transaction(root, 5);
7100 return PTR_ERR(trans);
7102 err = btrfs_find_free_ino(root, &objectid);
7106 inode = btrfs_new_inode(trans, root, dir, dentry->d_name.name,
7107 dentry->d_name.len, btrfs_ino(dir), objectid,
7108 S_IFLNK|S_IRWXUGO, &index);
7109 if (IS_ERR(inode)) {
7110 err = PTR_ERR(inode);
7114 err = btrfs_init_inode_security(trans, inode, dir, &dentry->d_name);
7120 err = btrfs_add_nondir(trans, dir, dentry, inode, 0, index);
7124 inode->i_mapping->a_ops = &btrfs_aops;
7125 inode->i_mapping->backing_dev_info = &root->fs_info->bdi;
7126 inode->i_fop = &btrfs_file_operations;
7127 inode->i_op = &btrfs_file_inode_operations;
7128 BTRFS_I(inode)->io_tree.ops = &btrfs_extent_io_ops;
7133 path = btrfs_alloc_path();
7139 key.objectid = btrfs_ino(inode);
7141 btrfs_set_key_type(&key, BTRFS_EXTENT_DATA_KEY);
7142 datasize = btrfs_file_extent_calc_inline_size(name_len);
7143 err = btrfs_insert_empty_item(trans, root, path, &key,
7147 btrfs_free_path(path);
7150 leaf = path->nodes[0];
7151 ei = btrfs_item_ptr(leaf, path->slots[0],
7152 struct btrfs_file_extent_item);
7153 btrfs_set_file_extent_generation(leaf, ei, trans->transid);
7154 btrfs_set_file_extent_type(leaf, ei,
7155 BTRFS_FILE_EXTENT_INLINE);
7156 btrfs_set_file_extent_encryption(leaf, ei, 0);
7157 btrfs_set_file_extent_compression(leaf, ei, 0);
7158 btrfs_set_file_extent_other_encoding(leaf, ei, 0);
7159 btrfs_set_file_extent_ram_bytes(leaf, ei, name_len);
7161 ptr = btrfs_file_extent_inline_start(ei);
7162 write_extent_buffer(leaf, symname, ptr, name_len);
7163 btrfs_mark_buffer_dirty(leaf);
7164 btrfs_free_path(path);
7166 inode->i_op = &btrfs_symlink_inode_operations;
7167 inode->i_mapping->a_ops = &btrfs_symlink_aops;
7168 inode->i_mapping->backing_dev_info = &root->fs_info->bdi;
7169 inode_set_bytes(inode, name_len);
7170 btrfs_i_size_write(inode, name_len - 1);
7171 err = btrfs_update_inode(trans, root, inode);
7176 nr = trans->blocks_used;
7177 btrfs_end_transaction_throttle(trans, root);
7179 inode_dec_link_count(inode);
7182 btrfs_btree_balance_dirty(root, nr);
7186 static int __btrfs_prealloc_file_range(struct inode *inode, int mode,
7187 u64 start, u64 num_bytes, u64 min_size,
7188 loff_t actual_len, u64 *alloc_hint,
7189 struct btrfs_trans_handle *trans)
7191 struct btrfs_root *root = BTRFS_I(inode)->root;
7192 struct btrfs_key ins;
7193 u64 cur_offset = start;
7196 bool own_trans = true;
7200 while (num_bytes > 0) {
7202 trans = btrfs_start_transaction(root, 3);
7203 if (IS_ERR(trans)) {
7204 ret = PTR_ERR(trans);
7209 ret = btrfs_reserve_extent(trans, root, num_bytes, min_size,
7210 0, *alloc_hint, (u64)-1, &ins, 1);
7213 btrfs_end_transaction(trans, root);
7217 ret = insert_reserved_file_extent(trans, inode,
7218 cur_offset, ins.objectid,
7219 ins.offset, ins.offset,
7220 ins.offset, 0, 0, 0,
7221 BTRFS_FILE_EXTENT_PREALLOC);
7223 btrfs_drop_extent_cache(inode, cur_offset,
7224 cur_offset + ins.offset -1, 0);
7226 num_bytes -= ins.offset;
7227 cur_offset += ins.offset;
7228 *alloc_hint = ins.objectid + ins.offset;
7230 inode->i_ctime = CURRENT_TIME;
7231 BTRFS_I(inode)->flags |= BTRFS_INODE_PREALLOC;
7232 if (!(mode & FALLOC_FL_KEEP_SIZE) &&
7233 (actual_len > inode->i_size) &&
7234 (cur_offset > inode->i_size)) {
7235 if (cur_offset > actual_len)
7236 i_size = actual_len;
7238 i_size = cur_offset;
7239 i_size_write(inode, i_size);
7240 btrfs_ordered_update_i_size(inode, i_size, NULL);
7243 ret = btrfs_update_inode(trans, root, inode);
7247 btrfs_end_transaction(trans, root);
7252 int btrfs_prealloc_file_range(struct inode *inode, int mode,
7253 u64 start, u64 num_bytes, u64 min_size,
7254 loff_t actual_len, u64 *alloc_hint)
7256 return __btrfs_prealloc_file_range(inode, mode, start, num_bytes,
7257 min_size, actual_len, alloc_hint,
7261 int btrfs_prealloc_file_range_trans(struct inode *inode,
7262 struct btrfs_trans_handle *trans, int mode,
7263 u64 start, u64 num_bytes, u64 min_size,
7264 loff_t actual_len, u64 *alloc_hint)
7266 return __btrfs_prealloc_file_range(inode, mode, start, num_bytes,
7267 min_size, actual_len, alloc_hint, trans);
7270 static int btrfs_set_page_dirty(struct page *page)
7272 return __set_page_dirty_nobuffers(page);
7275 static int btrfs_permission(struct inode *inode, int mask)
7277 struct btrfs_root *root = BTRFS_I(inode)->root;
7278 umode_t mode = inode->i_mode;
7280 if (mask & MAY_WRITE &&
7281 (S_ISREG(mode) || S_ISDIR(mode) || S_ISLNK(mode))) {
7282 if (btrfs_root_readonly(root))
7284 if (BTRFS_I(inode)->flags & BTRFS_INODE_READONLY)
7287 return generic_permission(inode, mask);
7290 static const struct inode_operations btrfs_dir_inode_operations = {
7291 .getattr = btrfs_getattr,
7292 .lookup = btrfs_lookup,
7293 .create = btrfs_create,
7294 .unlink = btrfs_unlink,
7296 .mkdir = btrfs_mkdir,
7297 .rmdir = btrfs_rmdir,
7298 .rename = btrfs_rename,
7299 .symlink = btrfs_symlink,
7300 .setattr = btrfs_setattr,
7301 .mknod = btrfs_mknod,
7302 .setxattr = btrfs_setxattr,
7303 .getxattr = btrfs_getxattr,
7304 .listxattr = btrfs_listxattr,
7305 .removexattr = btrfs_removexattr,
7306 .permission = btrfs_permission,
7307 .get_acl = btrfs_get_acl,
7309 static const struct inode_operations btrfs_dir_ro_inode_operations = {
7310 .lookup = btrfs_lookup,
7311 .permission = btrfs_permission,
7312 .get_acl = btrfs_get_acl,
7315 static const struct file_operations btrfs_dir_file_operations = {
7316 .llseek = generic_file_llseek,
7317 .read = generic_read_dir,
7318 .readdir = btrfs_real_readdir,
7319 .unlocked_ioctl = btrfs_ioctl,
7320 #ifdef CONFIG_COMPAT
7321 .compat_ioctl = btrfs_ioctl,
7323 .release = btrfs_release_file,
7324 .fsync = btrfs_sync_file,
7327 static struct extent_io_ops btrfs_extent_io_ops = {
7328 .fill_delalloc = run_delalloc_range,
7329 .submit_bio_hook = btrfs_submit_bio_hook,
7330 .merge_bio_hook = btrfs_merge_bio_hook,
7331 .readpage_end_io_hook = btrfs_readpage_end_io_hook,
7332 .writepage_end_io_hook = btrfs_writepage_end_io_hook,
7333 .writepage_start_hook = btrfs_writepage_start_hook,
7334 .set_bit_hook = btrfs_set_bit_hook,
7335 .clear_bit_hook = btrfs_clear_bit_hook,
7336 .merge_extent_hook = btrfs_merge_extent_hook,
7337 .split_extent_hook = btrfs_split_extent_hook,
7341 * btrfs doesn't support the bmap operation because swapfiles
7342 * use bmap to make a mapping of extents in the file. They assume
7343 * these extents won't change over the life of the file and they
7344 * use the bmap result to do IO directly to the drive.
7346 * the btrfs bmap call would return logical addresses that aren't
7347 * suitable for IO and they also will change frequently as COW
7348 * operations happen. So, swapfile + btrfs == corruption.
7350 * For now we're avoiding this by dropping bmap.
7352 static const struct address_space_operations btrfs_aops = {
7353 .readpage = btrfs_readpage,
7354 .writepage = btrfs_writepage,
7355 .writepages = btrfs_writepages,
7356 .readpages = btrfs_readpages,
7357 .direct_IO = btrfs_direct_IO,
7358 .invalidatepage = btrfs_invalidatepage,
7359 .releasepage = btrfs_releasepage,
7360 .set_page_dirty = btrfs_set_page_dirty,
7361 .error_remove_page = generic_error_remove_page,
7364 static const struct address_space_operations btrfs_symlink_aops = {
7365 .readpage = btrfs_readpage,
7366 .writepage = btrfs_writepage,
7367 .invalidatepage = btrfs_invalidatepage,
7368 .releasepage = btrfs_releasepage,
7371 static const struct inode_operations btrfs_file_inode_operations = {
7372 .getattr = btrfs_getattr,
7373 .setattr = btrfs_setattr,
7374 .setxattr = btrfs_setxattr,
7375 .getxattr = btrfs_getxattr,
7376 .listxattr = btrfs_listxattr,
7377 .removexattr = btrfs_removexattr,
7378 .permission = btrfs_permission,
7379 .fiemap = btrfs_fiemap,
7380 .get_acl = btrfs_get_acl,
7382 static const struct inode_operations btrfs_special_inode_operations = {
7383 .getattr = btrfs_getattr,
7384 .setattr = btrfs_setattr,
7385 .permission = btrfs_permission,
7386 .setxattr = btrfs_setxattr,
7387 .getxattr = btrfs_getxattr,
7388 .listxattr = btrfs_listxattr,
7389 .removexattr = btrfs_removexattr,
7390 .get_acl = btrfs_get_acl,
7392 static const struct inode_operations btrfs_symlink_inode_operations = {
7393 .readlink = generic_readlink,
7394 .follow_link = page_follow_link_light,
7395 .put_link = page_put_link,
7396 .getattr = btrfs_getattr,
7397 .permission = btrfs_permission,
7398 .setxattr = btrfs_setxattr,
7399 .getxattr = btrfs_getxattr,
7400 .listxattr = btrfs_listxattr,
7401 .removexattr = btrfs_removexattr,
7402 .get_acl = btrfs_get_acl,
7405 const struct dentry_operations btrfs_dentry_operations = {
7406 .d_delete = btrfs_dentry_delete,
7407 .d_release = btrfs_dentry_release,