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>
42 #include "transaction.h"
43 #include "btrfs_inode.h"
45 #include "print-tree.h"
47 #include "ordered-data.h"
50 #include "compression.h"
53 struct btrfs_iget_args
{
55 struct btrfs_root
*root
;
58 static struct inode_operations btrfs_dir_inode_operations
;
59 static struct inode_operations btrfs_symlink_inode_operations
;
60 static struct inode_operations btrfs_dir_ro_inode_operations
;
61 static struct inode_operations btrfs_special_inode_operations
;
62 static struct inode_operations btrfs_file_inode_operations
;
63 static struct address_space_operations btrfs_aops
;
64 static struct address_space_operations btrfs_symlink_aops
;
65 static struct file_operations btrfs_dir_file_operations
;
66 static struct extent_io_ops btrfs_extent_io_ops
;
68 static struct kmem_cache
*btrfs_inode_cachep
;
69 struct kmem_cache
*btrfs_trans_handle_cachep
;
70 struct kmem_cache
*btrfs_transaction_cachep
;
71 struct kmem_cache
*btrfs_path_cachep
;
74 static unsigned char btrfs_type_by_mode
[S_IFMT
>> S_SHIFT
] = {
75 [S_IFREG
>> S_SHIFT
] = BTRFS_FT_REG_FILE
,
76 [S_IFDIR
>> S_SHIFT
] = BTRFS_FT_DIR
,
77 [S_IFCHR
>> S_SHIFT
] = BTRFS_FT_CHRDEV
,
78 [S_IFBLK
>> S_SHIFT
] = BTRFS_FT_BLKDEV
,
79 [S_IFIFO
>> S_SHIFT
] = BTRFS_FT_FIFO
,
80 [S_IFSOCK
>> S_SHIFT
] = BTRFS_FT_SOCK
,
81 [S_IFLNK
>> S_SHIFT
] = BTRFS_FT_SYMLINK
,
84 static void btrfs_truncate(struct inode
*inode
);
85 static int btrfs_finish_ordered_io(struct inode
*inode
, u64 start
, u64 end
);
86 static noinline
int cow_file_range(struct inode
*inode
,
87 struct page
*locked_page
,
88 u64 start
, u64 end
, int *page_started
,
89 unsigned long *nr_written
, int unlock
);
91 static int btrfs_init_inode_security(struct inode
*inode
, struct inode
*dir
)
95 err
= btrfs_init_acl(inode
, dir
);
97 err
= btrfs_xattr_security_init(inode
, dir
);
102 * this does all the hard work for inserting an inline extent into
103 * the btree. The caller should have done a btrfs_drop_extents so that
104 * no overlapping inline items exist in the btree
106 static noinline
int insert_inline_extent(struct btrfs_trans_handle
*trans
,
107 struct btrfs_root
*root
, struct inode
*inode
,
108 u64 start
, size_t size
, size_t compressed_size
,
109 struct page
**compressed_pages
)
111 struct btrfs_key key
;
112 struct btrfs_path
*path
;
113 struct extent_buffer
*leaf
;
114 struct page
*page
= NULL
;
117 struct btrfs_file_extent_item
*ei
;
120 size_t cur_size
= size
;
122 unsigned long offset
;
123 int use_compress
= 0;
125 if (compressed_size
&& compressed_pages
) {
127 cur_size
= compressed_size
;
130 path
= btrfs_alloc_path();
134 path
->leave_spinning
= 1;
135 btrfs_set_trans_block_group(trans
, inode
);
137 key
.objectid
= inode
->i_ino
;
139 btrfs_set_key_type(&key
, BTRFS_EXTENT_DATA_KEY
);
140 datasize
= btrfs_file_extent_calc_inline_size(cur_size
);
142 inode_add_bytes(inode
, size
);
143 ret
= btrfs_insert_empty_item(trans
, root
, path
, &key
,
150 leaf
= path
->nodes
[0];
151 ei
= btrfs_item_ptr(leaf
, path
->slots
[0],
152 struct btrfs_file_extent_item
);
153 btrfs_set_file_extent_generation(leaf
, ei
, trans
->transid
);
154 btrfs_set_file_extent_type(leaf
, ei
, BTRFS_FILE_EXTENT_INLINE
);
155 btrfs_set_file_extent_encryption(leaf
, ei
, 0);
156 btrfs_set_file_extent_other_encoding(leaf
, ei
, 0);
157 btrfs_set_file_extent_ram_bytes(leaf
, ei
, size
);
158 ptr
= btrfs_file_extent_inline_start(ei
);
163 while (compressed_size
> 0) {
164 cpage
= compressed_pages
[i
];
165 cur_size
= min_t(unsigned long, compressed_size
,
168 kaddr
= kmap_atomic(cpage
, KM_USER0
);
169 write_extent_buffer(leaf
, kaddr
, ptr
, cur_size
);
170 kunmap_atomic(kaddr
, KM_USER0
);
174 compressed_size
-= cur_size
;
176 btrfs_set_file_extent_compression(leaf
, ei
,
177 BTRFS_COMPRESS_ZLIB
);
179 page
= find_get_page(inode
->i_mapping
,
180 start
>> PAGE_CACHE_SHIFT
);
181 btrfs_set_file_extent_compression(leaf
, ei
, 0);
182 kaddr
= kmap_atomic(page
, KM_USER0
);
183 offset
= start
& (PAGE_CACHE_SIZE
- 1);
184 write_extent_buffer(leaf
, kaddr
+ offset
, ptr
, size
);
185 kunmap_atomic(kaddr
, KM_USER0
);
186 page_cache_release(page
);
188 btrfs_mark_buffer_dirty(leaf
);
189 btrfs_free_path(path
);
191 BTRFS_I(inode
)->disk_i_size
= inode
->i_size
;
192 btrfs_update_inode(trans
, root
, inode
);
195 btrfs_free_path(path
);
201 * conditionally insert an inline extent into the file. This
202 * does the checks required to make sure the data is small enough
203 * to fit as an inline extent.
205 static noinline
int cow_file_range_inline(struct btrfs_trans_handle
*trans
,
206 struct btrfs_root
*root
,
207 struct inode
*inode
, u64 start
, u64 end
,
208 size_t compressed_size
,
209 struct page
**compressed_pages
)
211 u64 isize
= i_size_read(inode
);
212 u64 actual_end
= min(end
+ 1, isize
);
213 u64 inline_len
= actual_end
- start
;
214 u64 aligned_end
= (end
+ root
->sectorsize
- 1) &
215 ~((u64
)root
->sectorsize
- 1);
217 u64 data_len
= inline_len
;
221 data_len
= compressed_size
;
224 actual_end
>= PAGE_CACHE_SIZE
||
225 data_len
>= BTRFS_MAX_INLINE_DATA_SIZE(root
) ||
227 (actual_end
& (root
->sectorsize
- 1)) == 0) ||
229 data_len
> root
->fs_info
->max_inline
) {
233 ret
= btrfs_drop_extents(trans
, root
, inode
, start
,
234 aligned_end
, aligned_end
, start
,
238 if (isize
> actual_end
)
239 inline_len
= min_t(u64
, isize
, actual_end
);
240 ret
= insert_inline_extent(trans
, root
, inode
, start
,
241 inline_len
, compressed_size
,
244 btrfs_drop_extent_cache(inode
, start
, aligned_end
- 1, 0);
248 struct async_extent
{
253 unsigned long nr_pages
;
254 struct list_head list
;
259 struct btrfs_root
*root
;
260 struct page
*locked_page
;
263 struct list_head extents
;
264 struct btrfs_work work
;
267 static noinline
int add_async_extent(struct async_cow
*cow
,
268 u64 start
, u64 ram_size
,
271 unsigned long nr_pages
)
273 struct async_extent
*async_extent
;
275 async_extent
= kmalloc(sizeof(*async_extent
), GFP_NOFS
);
276 async_extent
->start
= start
;
277 async_extent
->ram_size
= ram_size
;
278 async_extent
->compressed_size
= compressed_size
;
279 async_extent
->pages
= pages
;
280 async_extent
->nr_pages
= nr_pages
;
281 list_add_tail(&async_extent
->list
, &cow
->extents
);
286 * we create compressed extents in two phases. The first
287 * phase compresses a range of pages that have already been
288 * locked (both pages and state bits are locked).
290 * This is done inside an ordered work queue, and the compression
291 * is spread across many cpus. The actual IO submission is step
292 * two, and the ordered work queue takes care of making sure that
293 * happens in the same order things were put onto the queue by
294 * writepages and friends.
296 * If this code finds it can't get good compression, it puts an
297 * entry onto the work queue to write the uncompressed bytes. This
298 * makes sure that both compressed inodes and uncompressed inodes
299 * are written in the same order that pdflush sent them down.
301 static noinline
int compress_file_range(struct inode
*inode
,
302 struct page
*locked_page
,
304 struct async_cow
*async_cow
,
307 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
308 struct btrfs_trans_handle
*trans
;
312 u64 blocksize
= root
->sectorsize
;
314 u64 isize
= i_size_read(inode
);
316 struct page
**pages
= NULL
;
317 unsigned long nr_pages
;
318 unsigned long nr_pages_ret
= 0;
319 unsigned long total_compressed
= 0;
320 unsigned long total_in
= 0;
321 unsigned long max_compressed
= 128 * 1024;
322 unsigned long max_uncompressed
= 128 * 1024;
328 actual_end
= min_t(u64
, isize
, end
+ 1);
331 nr_pages
= (end
>> PAGE_CACHE_SHIFT
) - (start
>> PAGE_CACHE_SHIFT
) + 1;
332 nr_pages
= min(nr_pages
, (128 * 1024UL) / PAGE_CACHE_SIZE
);
335 * we don't want to send crud past the end of i_size through
336 * compression, that's just a waste of CPU time. So, if the
337 * end of the file is before the start of our current
338 * requested range of bytes, we bail out to the uncompressed
339 * cleanup code that can deal with all of this.
341 * It isn't really the fastest way to fix things, but this is a
342 * very uncommon corner.
344 if (actual_end
<= start
)
345 goto cleanup_and_bail_uncompressed
;
347 total_compressed
= actual_end
- start
;
349 /* we want to make sure that amount of ram required to uncompress
350 * an extent is reasonable, so we limit the total size in ram
351 * of a compressed extent to 128k. This is a crucial number
352 * because it also controls how easily we can spread reads across
353 * cpus for decompression.
355 * We also want to make sure the amount of IO required to do
356 * a random read is reasonably small, so we limit the size of
357 * a compressed extent to 128k.
359 total_compressed
= min(total_compressed
, max_uncompressed
);
360 num_bytes
= (end
- start
+ blocksize
) & ~(blocksize
- 1);
361 num_bytes
= max(blocksize
, num_bytes
);
362 disk_num_bytes
= num_bytes
;
367 * we do compression for mount -o compress and when the
368 * inode has not been flagged as nocompress. This flag can
369 * change at any time if we discover bad compression ratios.
371 if (!(BTRFS_I(inode
)->flags
& BTRFS_INODE_NOCOMPRESS
) &&
372 btrfs_test_opt(root
, COMPRESS
)) {
374 pages
= kzalloc(sizeof(struct page
*) * nr_pages
, GFP_NOFS
);
376 ret
= btrfs_zlib_compress_pages(inode
->i_mapping
, start
,
377 total_compressed
, pages
,
378 nr_pages
, &nr_pages_ret
,
384 unsigned long offset
= total_compressed
&
385 (PAGE_CACHE_SIZE
- 1);
386 struct page
*page
= pages
[nr_pages_ret
- 1];
389 /* zero the tail end of the last page, we might be
390 * sending it down to disk
393 kaddr
= kmap_atomic(page
, KM_USER0
);
394 memset(kaddr
+ offset
, 0,
395 PAGE_CACHE_SIZE
- offset
);
396 kunmap_atomic(kaddr
, KM_USER0
);
402 trans
= btrfs_join_transaction(root
, 1);
404 btrfs_set_trans_block_group(trans
, inode
);
406 /* lets try to make an inline extent */
407 if (ret
|| total_in
< (actual_end
- start
)) {
408 /* we didn't compress the entire range, try
409 * to make an uncompressed inline extent.
411 ret
= cow_file_range_inline(trans
, root
, inode
,
412 start
, end
, 0, NULL
);
414 /* try making a compressed inline extent */
415 ret
= cow_file_range_inline(trans
, root
, inode
,
417 total_compressed
, pages
);
419 btrfs_end_transaction(trans
, root
);
422 * inline extent creation worked, we don't need
423 * to create any more async work items. Unlock
424 * and free up our temp pages.
426 extent_clear_unlock_delalloc(inode
,
427 &BTRFS_I(inode
)->io_tree
,
428 start
, end
, NULL
, 1, 0,
437 * we aren't doing an inline extent round the compressed size
438 * up to a block size boundary so the allocator does sane
441 total_compressed
= (total_compressed
+ blocksize
- 1) &
445 * one last check to make sure the compression is really a
446 * win, compare the page count read with the blocks on disk
448 total_in
= (total_in
+ PAGE_CACHE_SIZE
- 1) &
449 ~(PAGE_CACHE_SIZE
- 1);
450 if (total_compressed
>= total_in
) {
453 disk_num_bytes
= total_compressed
;
454 num_bytes
= total_in
;
457 if (!will_compress
&& pages
) {
459 * the compression code ran but failed to make things smaller,
460 * free any pages it allocated and our page pointer array
462 for (i
= 0; i
< nr_pages_ret
; i
++) {
463 WARN_ON(pages
[i
]->mapping
);
464 page_cache_release(pages
[i
]);
468 total_compressed
= 0;
471 /* flag the file so we don't compress in the future */
472 BTRFS_I(inode
)->flags
|= BTRFS_INODE_NOCOMPRESS
;
477 /* the async work queues will take care of doing actual
478 * allocation on disk for these compressed pages,
479 * and will submit them to the elevator.
481 add_async_extent(async_cow
, start
, num_bytes
,
482 total_compressed
, pages
, nr_pages_ret
);
484 if (start
+ num_bytes
< end
&& start
+ num_bytes
< actual_end
) {
491 cleanup_and_bail_uncompressed
:
493 * No compression, but we still need to write the pages in
494 * the file we've been given so far. redirty the locked
495 * page if it corresponds to our extent and set things up
496 * for the async work queue to run cow_file_range to do
497 * the normal delalloc dance
499 if (page_offset(locked_page
) >= start
&&
500 page_offset(locked_page
) <= end
) {
501 __set_page_dirty_nobuffers(locked_page
);
502 /* unlocked later on in the async handlers */
504 add_async_extent(async_cow
, start
, end
- start
+ 1, 0, NULL
, 0);
512 for (i
= 0; i
< nr_pages_ret
; i
++) {
513 WARN_ON(pages
[i
]->mapping
);
514 page_cache_release(pages
[i
]);
522 * phase two of compressed writeback. This is the ordered portion
523 * of the code, which only gets called in the order the work was
524 * queued. We walk all the async extents created by compress_file_range
525 * and send them down to the disk.
527 static noinline
int submit_compressed_extents(struct inode
*inode
,
528 struct async_cow
*async_cow
)
530 struct async_extent
*async_extent
;
532 struct btrfs_trans_handle
*trans
;
533 struct btrfs_key ins
;
534 struct extent_map
*em
;
535 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
536 struct extent_map_tree
*em_tree
= &BTRFS_I(inode
)->extent_tree
;
537 struct extent_io_tree
*io_tree
;
540 if (list_empty(&async_cow
->extents
))
543 trans
= btrfs_join_transaction(root
, 1);
545 while (!list_empty(&async_cow
->extents
)) {
546 async_extent
= list_entry(async_cow
->extents
.next
,
547 struct async_extent
, list
);
548 list_del(&async_extent
->list
);
550 io_tree
= &BTRFS_I(inode
)->io_tree
;
552 /* did the compression code fall back to uncompressed IO? */
553 if (!async_extent
->pages
) {
554 int page_started
= 0;
555 unsigned long nr_written
= 0;
557 lock_extent(io_tree
, async_extent
->start
,
558 async_extent
->start
+
559 async_extent
->ram_size
- 1, GFP_NOFS
);
561 /* allocate blocks */
562 cow_file_range(inode
, async_cow
->locked_page
,
564 async_extent
->start
+
565 async_extent
->ram_size
- 1,
566 &page_started
, &nr_written
, 0);
569 * if page_started, cow_file_range inserted an
570 * inline extent and took care of all the unlocking
571 * and IO for us. Otherwise, we need to submit
572 * all those pages down to the drive.
575 extent_write_locked_range(io_tree
,
576 inode
, async_extent
->start
,
577 async_extent
->start
+
578 async_extent
->ram_size
- 1,
586 lock_extent(io_tree
, async_extent
->start
,
587 async_extent
->start
+ async_extent
->ram_size
- 1,
590 * here we're doing allocation and writeback of the
593 btrfs_drop_extent_cache(inode
, async_extent
->start
,
594 async_extent
->start
+
595 async_extent
->ram_size
- 1, 0);
597 ret
= btrfs_reserve_extent(trans
, root
,
598 async_extent
->compressed_size
,
599 async_extent
->compressed_size
,
603 em
= alloc_extent_map(GFP_NOFS
);
604 em
->start
= async_extent
->start
;
605 em
->len
= async_extent
->ram_size
;
606 em
->orig_start
= em
->start
;
608 em
->block_start
= ins
.objectid
;
609 em
->block_len
= ins
.offset
;
610 em
->bdev
= root
->fs_info
->fs_devices
->latest_bdev
;
611 set_bit(EXTENT_FLAG_PINNED
, &em
->flags
);
612 set_bit(EXTENT_FLAG_COMPRESSED
, &em
->flags
);
615 write_lock(&em_tree
->lock
);
616 ret
= add_extent_mapping(em_tree
, em
);
617 write_unlock(&em_tree
->lock
);
618 if (ret
!= -EEXIST
) {
622 btrfs_drop_extent_cache(inode
, async_extent
->start
,
623 async_extent
->start
+
624 async_extent
->ram_size
- 1, 0);
627 ret
= btrfs_add_ordered_extent(inode
, async_extent
->start
,
629 async_extent
->ram_size
,
631 BTRFS_ORDERED_COMPRESSED
);
634 btrfs_end_transaction(trans
, root
);
637 * clear dirty, set writeback and unlock the pages.
639 extent_clear_unlock_delalloc(inode
,
640 &BTRFS_I(inode
)->io_tree
,
642 async_extent
->start
+
643 async_extent
->ram_size
- 1,
644 NULL
, 1, 1, 0, 1, 1, 0, 0);
646 ret
= btrfs_submit_compressed_write(inode
,
648 async_extent
->ram_size
,
650 ins
.offset
, async_extent
->pages
,
651 async_extent
->nr_pages
);
654 trans
= btrfs_join_transaction(root
, 1);
655 alloc_hint
= ins
.objectid
+ ins
.offset
;
660 btrfs_end_transaction(trans
, root
);
665 * when extent_io.c finds a delayed allocation range in the file,
666 * the call backs end up in this code. The basic idea is to
667 * allocate extents on disk for the range, and create ordered data structs
668 * in ram to track those extents.
670 * locked_page is the page that writepage had locked already. We use
671 * it to make sure we don't do extra locks or unlocks.
673 * *page_started is set to one if we unlock locked_page and do everything
674 * required to start IO on it. It may be clean and already done with
677 static noinline
int cow_file_range(struct inode
*inode
,
678 struct page
*locked_page
,
679 u64 start
, u64 end
, int *page_started
,
680 unsigned long *nr_written
,
683 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
684 struct btrfs_trans_handle
*trans
;
687 unsigned long ram_size
;
690 u64 blocksize
= root
->sectorsize
;
692 u64 isize
= i_size_read(inode
);
693 struct btrfs_key ins
;
694 struct extent_map
*em
;
695 struct extent_map_tree
*em_tree
= &BTRFS_I(inode
)->extent_tree
;
698 trans
= btrfs_join_transaction(root
, 1);
700 btrfs_set_trans_block_group(trans
, inode
);
702 actual_end
= min_t(u64
, isize
, end
+ 1);
704 num_bytes
= (end
- start
+ blocksize
) & ~(blocksize
- 1);
705 num_bytes
= max(blocksize
, num_bytes
);
706 disk_num_bytes
= num_bytes
;
710 /* lets try to make an inline extent */
711 ret
= cow_file_range_inline(trans
, root
, inode
,
712 start
, end
, 0, NULL
);
714 extent_clear_unlock_delalloc(inode
,
715 &BTRFS_I(inode
)->io_tree
,
716 start
, end
, NULL
, 1, 1,
718 *nr_written
= *nr_written
+
719 (end
- start
+ PAGE_CACHE_SIZE
) / PAGE_CACHE_SIZE
;
726 BUG_ON(disk_num_bytes
>
727 btrfs_super_total_bytes(&root
->fs_info
->super_copy
));
730 read_lock(&BTRFS_I(inode
)->extent_tree
.lock
);
731 em
= search_extent_mapping(&BTRFS_I(inode
)->extent_tree
,
734 alloc_hint
= em
->block_start
;
737 read_unlock(&BTRFS_I(inode
)->extent_tree
.lock
);
738 btrfs_drop_extent_cache(inode
, start
, start
+ num_bytes
- 1, 0);
740 while (disk_num_bytes
> 0) {
741 cur_alloc_size
= min(disk_num_bytes
, root
->fs_info
->max_extent
);
742 ret
= btrfs_reserve_extent(trans
, root
, cur_alloc_size
,
743 root
->sectorsize
, 0, alloc_hint
,
747 em
= alloc_extent_map(GFP_NOFS
);
749 em
->orig_start
= em
->start
;
750 ram_size
= ins
.offset
;
751 em
->len
= ins
.offset
;
753 em
->block_start
= ins
.objectid
;
754 em
->block_len
= ins
.offset
;
755 em
->bdev
= root
->fs_info
->fs_devices
->latest_bdev
;
756 set_bit(EXTENT_FLAG_PINNED
, &em
->flags
);
759 write_lock(&em_tree
->lock
);
760 ret
= add_extent_mapping(em_tree
, em
);
761 write_unlock(&em_tree
->lock
);
762 if (ret
!= -EEXIST
) {
766 btrfs_drop_extent_cache(inode
, start
,
767 start
+ ram_size
- 1, 0);
770 cur_alloc_size
= ins
.offset
;
771 ret
= btrfs_add_ordered_extent(inode
, start
, ins
.objectid
,
772 ram_size
, cur_alloc_size
, 0);
775 if (root
->root_key
.objectid
==
776 BTRFS_DATA_RELOC_TREE_OBJECTID
) {
777 ret
= btrfs_reloc_clone_csums(inode
, start
,
782 if (disk_num_bytes
< cur_alloc_size
)
785 /* we're not doing compressed IO, don't unlock the first
786 * page (which the caller expects to stay locked), don't
787 * clear any dirty bits and don't set any writeback bits
789 * Do set the Private2 bit so we know this page was properly
790 * setup for writepage
792 extent_clear_unlock_delalloc(inode
, &BTRFS_I(inode
)->io_tree
,
793 start
, start
+ ram_size
- 1,
794 locked_page
, unlock
, 1,
796 disk_num_bytes
-= cur_alloc_size
;
797 num_bytes
-= cur_alloc_size
;
798 alloc_hint
= ins
.objectid
+ ins
.offset
;
799 start
+= cur_alloc_size
;
803 btrfs_end_transaction(trans
, root
);
809 * work queue call back to started compression on a file and pages
811 static noinline
void async_cow_start(struct btrfs_work
*work
)
813 struct async_cow
*async_cow
;
815 async_cow
= container_of(work
, struct async_cow
, work
);
817 compress_file_range(async_cow
->inode
, async_cow
->locked_page
,
818 async_cow
->start
, async_cow
->end
, async_cow
,
821 async_cow
->inode
= NULL
;
825 * work queue call back to submit previously compressed pages
827 static noinline
void async_cow_submit(struct btrfs_work
*work
)
829 struct async_cow
*async_cow
;
830 struct btrfs_root
*root
;
831 unsigned long nr_pages
;
833 async_cow
= container_of(work
, struct async_cow
, work
);
835 root
= async_cow
->root
;
836 nr_pages
= (async_cow
->end
- async_cow
->start
+ PAGE_CACHE_SIZE
) >>
839 atomic_sub(nr_pages
, &root
->fs_info
->async_delalloc_pages
);
841 if (atomic_read(&root
->fs_info
->async_delalloc_pages
) <
843 waitqueue_active(&root
->fs_info
->async_submit_wait
))
844 wake_up(&root
->fs_info
->async_submit_wait
);
846 if (async_cow
->inode
)
847 submit_compressed_extents(async_cow
->inode
, async_cow
);
850 static noinline
void async_cow_free(struct btrfs_work
*work
)
852 struct async_cow
*async_cow
;
853 async_cow
= container_of(work
, struct async_cow
, work
);
857 static int cow_file_range_async(struct inode
*inode
, struct page
*locked_page
,
858 u64 start
, u64 end
, int *page_started
,
859 unsigned long *nr_written
)
861 struct async_cow
*async_cow
;
862 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
863 unsigned long nr_pages
;
865 int limit
= 10 * 1024 * 1042;
867 clear_extent_bit(&BTRFS_I(inode
)->io_tree
, start
, end
, EXTENT_LOCKED
|
868 EXTENT_DELALLOC
, 1, 0, NULL
, GFP_NOFS
);
869 while (start
< end
) {
870 async_cow
= kmalloc(sizeof(*async_cow
), GFP_NOFS
);
871 async_cow
->inode
= inode
;
872 async_cow
->root
= root
;
873 async_cow
->locked_page
= locked_page
;
874 async_cow
->start
= start
;
876 if (BTRFS_I(inode
)->flags
& BTRFS_INODE_NOCOMPRESS
)
879 cur_end
= min(end
, start
+ 512 * 1024 - 1);
881 async_cow
->end
= cur_end
;
882 INIT_LIST_HEAD(&async_cow
->extents
);
884 async_cow
->work
.func
= async_cow_start
;
885 async_cow
->work
.ordered_func
= async_cow_submit
;
886 async_cow
->work
.ordered_free
= async_cow_free
;
887 async_cow
->work
.flags
= 0;
889 nr_pages
= (cur_end
- start
+ PAGE_CACHE_SIZE
) >>
891 atomic_add(nr_pages
, &root
->fs_info
->async_delalloc_pages
);
893 btrfs_queue_worker(&root
->fs_info
->delalloc_workers
,
896 if (atomic_read(&root
->fs_info
->async_delalloc_pages
) > limit
) {
897 wait_event(root
->fs_info
->async_submit_wait
,
898 (atomic_read(&root
->fs_info
->async_delalloc_pages
) <
902 while (atomic_read(&root
->fs_info
->async_submit_draining
) &&
903 atomic_read(&root
->fs_info
->async_delalloc_pages
)) {
904 wait_event(root
->fs_info
->async_submit_wait
,
905 (atomic_read(&root
->fs_info
->async_delalloc_pages
) ==
909 *nr_written
+= nr_pages
;
916 static noinline
int csum_exist_in_range(struct btrfs_root
*root
,
917 u64 bytenr
, u64 num_bytes
)
920 struct btrfs_ordered_sum
*sums
;
923 ret
= btrfs_lookup_csums_range(root
->fs_info
->csum_root
, bytenr
,
924 bytenr
+ num_bytes
- 1, &list
);
925 if (ret
== 0 && list_empty(&list
))
928 while (!list_empty(&list
)) {
929 sums
= list_entry(list
.next
, struct btrfs_ordered_sum
, list
);
930 list_del(&sums
->list
);
937 * when nowcow writeback call back. This checks for snapshots or COW copies
938 * of the extents that exist in the file, and COWs the file as required.
940 * If no cow copies or snapshots exist, we write directly to the existing
943 static noinline
int run_delalloc_nocow(struct inode
*inode
,
944 struct page
*locked_page
,
945 u64 start
, u64 end
, int *page_started
, int force
,
946 unsigned long *nr_written
)
948 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
949 struct btrfs_trans_handle
*trans
;
950 struct extent_buffer
*leaf
;
951 struct btrfs_path
*path
;
952 struct btrfs_file_extent_item
*fi
;
953 struct btrfs_key found_key
;
966 path
= btrfs_alloc_path();
968 trans
= btrfs_join_transaction(root
, 1);
974 ret
= btrfs_lookup_file_extent(trans
, root
, path
, inode
->i_ino
,
977 if (ret
> 0 && path
->slots
[0] > 0 && check_prev
) {
978 leaf
= path
->nodes
[0];
979 btrfs_item_key_to_cpu(leaf
, &found_key
,
981 if (found_key
.objectid
== inode
->i_ino
&&
982 found_key
.type
== BTRFS_EXTENT_DATA_KEY
)
987 leaf
= path
->nodes
[0];
988 if (path
->slots
[0] >= btrfs_header_nritems(leaf
)) {
989 ret
= btrfs_next_leaf(root
, path
);
994 leaf
= path
->nodes
[0];
1000 btrfs_item_key_to_cpu(leaf
, &found_key
, path
->slots
[0]);
1002 if (found_key
.objectid
> inode
->i_ino
||
1003 found_key
.type
> BTRFS_EXTENT_DATA_KEY
||
1004 found_key
.offset
> end
)
1007 if (found_key
.offset
> cur_offset
) {
1008 extent_end
= found_key
.offset
;
1012 fi
= btrfs_item_ptr(leaf
, path
->slots
[0],
1013 struct btrfs_file_extent_item
);
1014 extent_type
= btrfs_file_extent_type(leaf
, fi
);
1016 if (extent_type
== BTRFS_FILE_EXTENT_REG
||
1017 extent_type
== BTRFS_FILE_EXTENT_PREALLOC
) {
1018 disk_bytenr
= btrfs_file_extent_disk_bytenr(leaf
, fi
);
1019 extent_offset
= btrfs_file_extent_offset(leaf
, fi
);
1020 extent_end
= found_key
.offset
+
1021 btrfs_file_extent_num_bytes(leaf
, fi
);
1022 if (extent_end
<= start
) {
1026 if (disk_bytenr
== 0)
1028 if (btrfs_file_extent_compression(leaf
, fi
) ||
1029 btrfs_file_extent_encryption(leaf
, fi
) ||
1030 btrfs_file_extent_other_encoding(leaf
, fi
))
1032 if (extent_type
== BTRFS_FILE_EXTENT_REG
&& !force
)
1034 if (btrfs_extent_readonly(root
, disk_bytenr
))
1036 if (btrfs_cross_ref_exist(trans
, root
, inode
->i_ino
,
1038 extent_offset
, disk_bytenr
))
1040 disk_bytenr
+= extent_offset
;
1041 disk_bytenr
+= cur_offset
- found_key
.offset
;
1042 num_bytes
= min(end
+ 1, extent_end
) - cur_offset
;
1044 * force cow if csum exists in the range.
1045 * this ensure that csum for a given extent are
1046 * either valid or do not exist.
1048 if (csum_exist_in_range(root
, disk_bytenr
, num_bytes
))
1051 } else if (extent_type
== BTRFS_FILE_EXTENT_INLINE
) {
1052 extent_end
= found_key
.offset
+
1053 btrfs_file_extent_inline_len(leaf
, fi
);
1054 extent_end
= ALIGN(extent_end
, root
->sectorsize
);
1059 if (extent_end
<= start
) {
1064 if (cow_start
== (u64
)-1)
1065 cow_start
= cur_offset
;
1066 cur_offset
= extent_end
;
1067 if (cur_offset
> end
)
1073 btrfs_release_path(root
, path
);
1074 if (cow_start
!= (u64
)-1) {
1075 ret
= cow_file_range(inode
, locked_page
, cow_start
,
1076 found_key
.offset
- 1, page_started
,
1079 cow_start
= (u64
)-1;
1082 if (extent_type
== BTRFS_FILE_EXTENT_PREALLOC
) {
1083 struct extent_map
*em
;
1084 struct extent_map_tree
*em_tree
;
1085 em_tree
= &BTRFS_I(inode
)->extent_tree
;
1086 em
= alloc_extent_map(GFP_NOFS
);
1087 em
->start
= cur_offset
;
1088 em
->orig_start
= em
->start
;
1089 em
->len
= num_bytes
;
1090 em
->block_len
= num_bytes
;
1091 em
->block_start
= disk_bytenr
;
1092 em
->bdev
= root
->fs_info
->fs_devices
->latest_bdev
;
1093 set_bit(EXTENT_FLAG_PINNED
, &em
->flags
);
1095 write_lock(&em_tree
->lock
);
1096 ret
= add_extent_mapping(em_tree
, em
);
1097 write_unlock(&em_tree
->lock
);
1098 if (ret
!= -EEXIST
) {
1099 free_extent_map(em
);
1102 btrfs_drop_extent_cache(inode
, em
->start
,
1103 em
->start
+ em
->len
- 1, 0);
1105 type
= BTRFS_ORDERED_PREALLOC
;
1107 type
= BTRFS_ORDERED_NOCOW
;
1110 ret
= btrfs_add_ordered_extent(inode
, cur_offset
, disk_bytenr
,
1111 num_bytes
, num_bytes
, type
);
1114 extent_clear_unlock_delalloc(inode
, &BTRFS_I(inode
)->io_tree
,
1115 cur_offset
, cur_offset
+ num_bytes
- 1,
1116 locked_page
, 1, 1, 1, 0, 0, 0, 1);
1117 cur_offset
= extent_end
;
1118 if (cur_offset
> end
)
1121 btrfs_release_path(root
, path
);
1123 if (cur_offset
<= end
&& cow_start
== (u64
)-1)
1124 cow_start
= cur_offset
;
1125 if (cow_start
!= (u64
)-1) {
1126 ret
= cow_file_range(inode
, locked_page
, cow_start
, end
,
1127 page_started
, nr_written
, 1);
1131 ret
= btrfs_end_transaction(trans
, root
);
1133 btrfs_free_path(path
);
1138 * extent_io.c call back to do delayed allocation processing
1140 static int run_delalloc_range(struct inode
*inode
, struct page
*locked_page
,
1141 u64 start
, u64 end
, int *page_started
,
1142 unsigned long *nr_written
)
1145 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
1147 if (BTRFS_I(inode
)->flags
& BTRFS_INODE_NODATACOW
)
1148 ret
= run_delalloc_nocow(inode
, locked_page
, start
, end
,
1149 page_started
, 1, nr_written
);
1150 else if (BTRFS_I(inode
)->flags
& BTRFS_INODE_PREALLOC
)
1151 ret
= run_delalloc_nocow(inode
, locked_page
, start
, end
,
1152 page_started
, 0, nr_written
);
1153 else if (!btrfs_test_opt(root
, COMPRESS
))
1154 ret
= cow_file_range(inode
, locked_page
, start
, end
,
1155 page_started
, nr_written
, 1);
1157 ret
= cow_file_range_async(inode
, locked_page
, start
, end
,
1158 page_started
, nr_written
);
1163 * extent_io.c set_bit_hook, used to track delayed allocation
1164 * bytes in this file, and to maintain the list of inodes that
1165 * have pending delalloc work to be done.
1167 static int btrfs_set_bit_hook(struct inode
*inode
, u64 start
, u64 end
,
1168 unsigned long old
, unsigned long bits
)
1171 * set_bit and clear bit hooks normally require _irqsave/restore
1172 * but in this case, we are only testeing for the DELALLOC
1173 * bit, which is only set or cleared with irqs on
1175 if (!(old
& EXTENT_DELALLOC
) && (bits
& EXTENT_DELALLOC
)) {
1176 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
1177 btrfs_delalloc_reserve_space(root
, inode
, end
- start
+ 1);
1178 spin_lock(&root
->fs_info
->delalloc_lock
);
1179 BTRFS_I(inode
)->delalloc_bytes
+= end
- start
+ 1;
1180 root
->fs_info
->delalloc_bytes
+= end
- start
+ 1;
1181 if (list_empty(&BTRFS_I(inode
)->delalloc_inodes
)) {
1182 list_add_tail(&BTRFS_I(inode
)->delalloc_inodes
,
1183 &root
->fs_info
->delalloc_inodes
);
1185 spin_unlock(&root
->fs_info
->delalloc_lock
);
1191 * extent_io.c clear_bit_hook, see set_bit_hook for why
1193 static int btrfs_clear_bit_hook(struct inode
*inode
, u64 start
, u64 end
,
1194 unsigned long old
, unsigned long bits
)
1197 * set_bit and clear bit hooks normally require _irqsave/restore
1198 * but in this case, we are only testeing for the DELALLOC
1199 * bit, which is only set or cleared with irqs on
1201 if ((old
& EXTENT_DELALLOC
) && (bits
& EXTENT_DELALLOC
)) {
1202 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
1204 spin_lock(&root
->fs_info
->delalloc_lock
);
1205 if (end
- start
+ 1 > root
->fs_info
->delalloc_bytes
) {
1206 printk(KERN_INFO
"btrfs warning: delalloc account "
1208 (unsigned long long)end
- start
+ 1,
1209 (unsigned long long)
1210 root
->fs_info
->delalloc_bytes
);
1211 btrfs_delalloc_free_space(root
, inode
, (u64
)-1);
1212 root
->fs_info
->delalloc_bytes
= 0;
1213 BTRFS_I(inode
)->delalloc_bytes
= 0;
1215 btrfs_delalloc_free_space(root
, inode
,
1217 root
->fs_info
->delalloc_bytes
-= end
- start
+ 1;
1218 BTRFS_I(inode
)->delalloc_bytes
-= end
- start
+ 1;
1220 if (BTRFS_I(inode
)->delalloc_bytes
== 0 &&
1221 !list_empty(&BTRFS_I(inode
)->delalloc_inodes
)) {
1222 list_del_init(&BTRFS_I(inode
)->delalloc_inodes
);
1224 spin_unlock(&root
->fs_info
->delalloc_lock
);
1230 * extent_io.c merge_bio_hook, this must check the chunk tree to make sure
1231 * we don't create bios that span stripes or chunks
1233 int btrfs_merge_bio_hook(struct page
*page
, unsigned long offset
,
1234 size_t size
, struct bio
*bio
,
1235 unsigned long bio_flags
)
1237 struct btrfs_root
*root
= BTRFS_I(page
->mapping
->host
)->root
;
1238 struct btrfs_mapping_tree
*map_tree
;
1239 u64 logical
= (u64
)bio
->bi_sector
<< 9;
1244 if (bio_flags
& EXTENT_BIO_COMPRESSED
)
1247 length
= bio
->bi_size
;
1248 map_tree
= &root
->fs_info
->mapping_tree
;
1249 map_length
= length
;
1250 ret
= btrfs_map_block(map_tree
, READ
, logical
,
1251 &map_length
, NULL
, 0);
1253 if (map_length
< length
+ size
)
1259 * in order to insert checksums into the metadata in large chunks,
1260 * we wait until bio submission time. All the pages in the bio are
1261 * checksummed and sums are attached onto the ordered extent record.
1263 * At IO completion time the cums attached on the ordered extent record
1264 * are inserted into the btree
1266 static int __btrfs_submit_bio_start(struct inode
*inode
, int rw
,
1267 struct bio
*bio
, int mirror_num
,
1268 unsigned long bio_flags
)
1270 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
1273 ret
= btrfs_csum_one_bio(root
, inode
, bio
, 0, 0);
1279 * in order to insert checksums into the metadata in large chunks,
1280 * we wait until bio submission time. All the pages in the bio are
1281 * checksummed and sums are attached onto the ordered extent record.
1283 * At IO completion time the cums attached on the ordered extent record
1284 * are inserted into the btree
1286 static int __btrfs_submit_bio_done(struct inode
*inode
, int rw
, struct bio
*bio
,
1287 int mirror_num
, unsigned long bio_flags
)
1289 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
1290 return btrfs_map_bio(root
, rw
, bio
, mirror_num
, 1);
1294 * extent_io.c submission hook. This does the right thing for csum calculation
1295 * on write, or reading the csums from the tree before a read
1297 static int btrfs_submit_bio_hook(struct inode
*inode
, int rw
, struct bio
*bio
,
1298 int mirror_num
, unsigned long bio_flags
)
1300 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
1304 skip_sum
= BTRFS_I(inode
)->flags
& BTRFS_INODE_NODATASUM
;
1306 ret
= btrfs_bio_wq_end_io(root
->fs_info
, bio
, 0);
1309 if (!(rw
& (1 << BIO_RW
))) {
1310 if (bio_flags
& EXTENT_BIO_COMPRESSED
) {
1311 return btrfs_submit_compressed_read(inode
, bio
,
1312 mirror_num
, bio_flags
);
1313 } else if (!skip_sum
)
1314 btrfs_lookup_bio_sums(root
, inode
, bio
, NULL
);
1316 } else if (!skip_sum
) {
1317 /* csum items have already been cloned */
1318 if (root
->root_key
.objectid
== BTRFS_DATA_RELOC_TREE_OBJECTID
)
1320 /* we're doing a write, do the async checksumming */
1321 return btrfs_wq_submit_bio(BTRFS_I(inode
)->root
->fs_info
,
1322 inode
, rw
, bio
, mirror_num
,
1323 bio_flags
, __btrfs_submit_bio_start
,
1324 __btrfs_submit_bio_done
);
1328 return btrfs_map_bio(root
, rw
, bio
, mirror_num
, 0);
1332 * given a list of ordered sums record them in the inode. This happens
1333 * at IO completion time based on sums calculated at bio submission time.
1335 static noinline
int add_pending_csums(struct btrfs_trans_handle
*trans
,
1336 struct inode
*inode
, u64 file_offset
,
1337 struct list_head
*list
)
1339 struct btrfs_ordered_sum
*sum
;
1341 btrfs_set_trans_block_group(trans
, inode
);
1343 list_for_each_entry(sum
, list
, list
) {
1344 btrfs_csum_file_blocks(trans
,
1345 BTRFS_I(inode
)->root
->fs_info
->csum_root
, sum
);
1350 int btrfs_set_extent_delalloc(struct inode
*inode
, u64 start
, u64 end
)
1352 if ((end
& (PAGE_CACHE_SIZE
- 1)) == 0)
1354 return set_extent_delalloc(&BTRFS_I(inode
)->io_tree
, start
, end
,
1358 /* see btrfs_writepage_start_hook for details on why this is required */
1359 struct btrfs_writepage_fixup
{
1361 struct btrfs_work work
;
1364 static void btrfs_writepage_fixup_worker(struct btrfs_work
*work
)
1366 struct btrfs_writepage_fixup
*fixup
;
1367 struct btrfs_ordered_extent
*ordered
;
1369 struct inode
*inode
;
1373 fixup
= container_of(work
, struct btrfs_writepage_fixup
, work
);
1377 if (!page
->mapping
|| !PageDirty(page
) || !PageChecked(page
)) {
1378 ClearPageChecked(page
);
1382 inode
= page
->mapping
->host
;
1383 page_start
= page_offset(page
);
1384 page_end
= page_offset(page
) + PAGE_CACHE_SIZE
- 1;
1386 lock_extent(&BTRFS_I(inode
)->io_tree
, page_start
, page_end
, GFP_NOFS
);
1388 /* already ordered? We're done */
1389 if (PagePrivate2(page
))
1392 ordered
= btrfs_lookup_ordered_extent(inode
, page_start
);
1394 unlock_extent(&BTRFS_I(inode
)->io_tree
, page_start
,
1395 page_end
, GFP_NOFS
);
1397 btrfs_start_ordered_extent(inode
, ordered
, 1);
1401 btrfs_set_extent_delalloc(inode
, page_start
, page_end
);
1402 ClearPageChecked(page
);
1404 unlock_extent(&BTRFS_I(inode
)->io_tree
, page_start
, page_end
, GFP_NOFS
);
1407 page_cache_release(page
);
1411 * There are a few paths in the higher layers of the kernel that directly
1412 * set the page dirty bit without asking the filesystem if it is a
1413 * good idea. This causes problems because we want to make sure COW
1414 * properly happens and the data=ordered rules are followed.
1416 * In our case any range that doesn't have the ORDERED bit set
1417 * hasn't been properly setup for IO. We kick off an async process
1418 * to fix it up. The async helper will wait for ordered extents, set
1419 * the delalloc bit and make it safe to write the page.
1421 static int btrfs_writepage_start_hook(struct page
*page
, u64 start
, u64 end
)
1423 struct inode
*inode
= page
->mapping
->host
;
1424 struct btrfs_writepage_fixup
*fixup
;
1425 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
1427 /* this page is properly in the ordered list */
1428 if (TestClearPagePrivate2(page
))
1431 if (PageChecked(page
))
1434 fixup
= kzalloc(sizeof(*fixup
), GFP_NOFS
);
1438 SetPageChecked(page
);
1439 page_cache_get(page
);
1440 fixup
->work
.func
= btrfs_writepage_fixup_worker
;
1442 btrfs_queue_worker(&root
->fs_info
->fixup_workers
, &fixup
->work
);
1446 static int insert_reserved_file_extent(struct btrfs_trans_handle
*trans
,
1447 struct inode
*inode
, u64 file_pos
,
1448 u64 disk_bytenr
, u64 disk_num_bytes
,
1449 u64 num_bytes
, u64 ram_bytes
,
1451 u8 compression
, u8 encryption
,
1452 u16 other_encoding
, int extent_type
)
1454 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
1455 struct btrfs_file_extent_item
*fi
;
1456 struct btrfs_path
*path
;
1457 struct extent_buffer
*leaf
;
1458 struct btrfs_key ins
;
1462 path
= btrfs_alloc_path();
1465 path
->leave_spinning
= 1;
1468 * we may be replacing one extent in the tree with another.
1469 * The new extent is pinned in the extent map, and we don't want
1470 * to drop it from the cache until it is completely in the btree.
1472 * So, tell btrfs_drop_extents to leave this extent in the cache.
1473 * the caller is expected to unpin it and allow it to be merged
1476 ret
= btrfs_drop_extents(trans
, root
, inode
, file_pos
,
1477 file_pos
+ num_bytes
, locked_end
,
1478 file_pos
, &hint
, 0);
1481 ins
.objectid
= inode
->i_ino
;
1482 ins
.offset
= file_pos
;
1483 ins
.type
= BTRFS_EXTENT_DATA_KEY
;
1484 ret
= btrfs_insert_empty_item(trans
, root
, path
, &ins
, sizeof(*fi
));
1486 leaf
= path
->nodes
[0];
1487 fi
= btrfs_item_ptr(leaf
, path
->slots
[0],
1488 struct btrfs_file_extent_item
);
1489 btrfs_set_file_extent_generation(leaf
, fi
, trans
->transid
);
1490 btrfs_set_file_extent_type(leaf
, fi
, extent_type
);
1491 btrfs_set_file_extent_disk_bytenr(leaf
, fi
, disk_bytenr
);
1492 btrfs_set_file_extent_disk_num_bytes(leaf
, fi
, disk_num_bytes
);
1493 btrfs_set_file_extent_offset(leaf
, fi
, 0);
1494 btrfs_set_file_extent_num_bytes(leaf
, fi
, num_bytes
);
1495 btrfs_set_file_extent_ram_bytes(leaf
, fi
, ram_bytes
);
1496 btrfs_set_file_extent_compression(leaf
, fi
, compression
);
1497 btrfs_set_file_extent_encryption(leaf
, fi
, encryption
);
1498 btrfs_set_file_extent_other_encoding(leaf
, fi
, other_encoding
);
1500 btrfs_unlock_up_safe(path
, 1);
1501 btrfs_set_lock_blocking(leaf
);
1503 btrfs_mark_buffer_dirty(leaf
);
1505 inode_add_bytes(inode
, num_bytes
);
1507 ins
.objectid
= disk_bytenr
;
1508 ins
.offset
= disk_num_bytes
;
1509 ins
.type
= BTRFS_EXTENT_ITEM_KEY
;
1510 ret
= btrfs_alloc_reserved_file_extent(trans
, root
,
1511 root
->root_key
.objectid
,
1512 inode
->i_ino
, file_pos
, &ins
);
1514 btrfs_free_path(path
);
1520 * helper function for btrfs_finish_ordered_io, this
1521 * just reads in some of the csum leaves to prime them into ram
1522 * before we start the transaction. It limits the amount of btree
1523 * reads required while inside the transaction.
1525 static noinline
void reada_csum(struct btrfs_root
*root
,
1526 struct btrfs_path
*path
,
1527 struct btrfs_ordered_extent
*ordered_extent
)
1529 struct btrfs_ordered_sum
*sum
;
1532 sum
= list_entry(ordered_extent
->list
.next
, struct btrfs_ordered_sum
,
1534 bytenr
= sum
->sums
[0].bytenr
;
1537 * we don't care about the results, the point of this search is
1538 * just to get the btree leaves into ram
1540 btrfs_lookup_csum(NULL
, root
->fs_info
->csum_root
, path
, bytenr
, 0);
1543 /* as ordered data IO finishes, this gets called so we can finish
1544 * an ordered extent if the range of bytes in the file it covers are
1547 static int btrfs_finish_ordered_io(struct inode
*inode
, u64 start
, u64 end
)
1549 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
1550 struct btrfs_trans_handle
*trans
;
1551 struct btrfs_ordered_extent
*ordered_extent
= NULL
;
1552 struct extent_io_tree
*io_tree
= &BTRFS_I(inode
)->io_tree
;
1553 struct btrfs_path
*path
;
1557 ret
= btrfs_dec_test_ordered_pending(inode
, start
, end
- start
+ 1);
1562 * before we join the transaction, try to do some of our IO.
1563 * This will limit the amount of IO that we have to do with
1564 * the transaction running. We're unlikely to need to do any
1565 * IO if the file extents are new, the disk_i_size checks
1566 * covers the most common case.
1568 if (start
< BTRFS_I(inode
)->disk_i_size
) {
1569 path
= btrfs_alloc_path();
1571 ret
= btrfs_lookup_file_extent(NULL
, root
, path
,
1574 ordered_extent
= btrfs_lookup_ordered_extent(inode
,
1576 if (!list_empty(&ordered_extent
->list
)) {
1577 btrfs_release_path(root
, path
);
1578 reada_csum(root
, path
, ordered_extent
);
1580 btrfs_free_path(path
);
1584 trans
= btrfs_join_transaction(root
, 1);
1586 if (!ordered_extent
)
1587 ordered_extent
= btrfs_lookup_ordered_extent(inode
, start
);
1588 BUG_ON(!ordered_extent
);
1589 if (test_bit(BTRFS_ORDERED_NOCOW
, &ordered_extent
->flags
))
1592 lock_extent(io_tree
, ordered_extent
->file_offset
,
1593 ordered_extent
->file_offset
+ ordered_extent
->len
- 1,
1596 if (test_bit(BTRFS_ORDERED_COMPRESSED
, &ordered_extent
->flags
))
1598 if (test_bit(BTRFS_ORDERED_PREALLOC
, &ordered_extent
->flags
)) {
1600 ret
= btrfs_mark_extent_written(trans
, root
, inode
,
1601 ordered_extent
->file_offset
,
1602 ordered_extent
->file_offset
+
1603 ordered_extent
->len
);
1606 ret
= insert_reserved_file_extent(trans
, inode
,
1607 ordered_extent
->file_offset
,
1608 ordered_extent
->start
,
1609 ordered_extent
->disk_len
,
1610 ordered_extent
->len
,
1611 ordered_extent
->len
,
1612 ordered_extent
->file_offset
+
1613 ordered_extent
->len
,
1615 BTRFS_FILE_EXTENT_REG
);
1616 unpin_extent_cache(&BTRFS_I(inode
)->extent_tree
,
1617 ordered_extent
->file_offset
,
1618 ordered_extent
->len
);
1621 unlock_extent(io_tree
, ordered_extent
->file_offset
,
1622 ordered_extent
->file_offset
+ ordered_extent
->len
- 1,
1625 add_pending_csums(trans
, inode
, ordered_extent
->file_offset
,
1626 &ordered_extent
->list
);
1628 mutex_lock(&BTRFS_I(inode
)->extent_mutex
);
1629 btrfs_ordered_update_i_size(inode
, ordered_extent
);
1630 btrfs_update_inode(trans
, root
, inode
);
1631 btrfs_remove_ordered_extent(inode
, ordered_extent
);
1632 mutex_unlock(&BTRFS_I(inode
)->extent_mutex
);
1635 btrfs_put_ordered_extent(ordered_extent
);
1636 /* once for the tree */
1637 btrfs_put_ordered_extent(ordered_extent
);
1639 btrfs_end_transaction(trans
, root
);
1643 static int btrfs_writepage_end_io_hook(struct page
*page
, u64 start
, u64 end
,
1644 struct extent_state
*state
, int uptodate
)
1646 ClearPagePrivate2(page
);
1647 return btrfs_finish_ordered_io(page
->mapping
->host
, start
, end
);
1651 * When IO fails, either with EIO or csum verification fails, we
1652 * try other mirrors that might have a good copy of the data. This
1653 * io_failure_record is used to record state as we go through all the
1654 * mirrors. If another mirror has good data, the page is set up to date
1655 * and things continue. If a good mirror can't be found, the original
1656 * bio end_io callback is called to indicate things have failed.
1658 struct io_failure_record
{
1663 unsigned long bio_flags
;
1667 static int btrfs_io_failed_hook(struct bio
*failed_bio
,
1668 struct page
*page
, u64 start
, u64 end
,
1669 struct extent_state
*state
)
1671 struct io_failure_record
*failrec
= NULL
;
1673 struct extent_map
*em
;
1674 struct inode
*inode
= page
->mapping
->host
;
1675 struct extent_io_tree
*failure_tree
= &BTRFS_I(inode
)->io_failure_tree
;
1676 struct extent_map_tree
*em_tree
= &BTRFS_I(inode
)->extent_tree
;
1683 ret
= get_state_private(failure_tree
, start
, &private);
1685 failrec
= kmalloc(sizeof(*failrec
), GFP_NOFS
);
1688 failrec
->start
= start
;
1689 failrec
->len
= end
- start
+ 1;
1690 failrec
->last_mirror
= 0;
1691 failrec
->bio_flags
= 0;
1693 read_lock(&em_tree
->lock
);
1694 em
= lookup_extent_mapping(em_tree
, start
, failrec
->len
);
1695 if (em
->start
> start
|| em
->start
+ em
->len
< start
) {
1696 free_extent_map(em
);
1699 read_unlock(&em_tree
->lock
);
1701 if (!em
|| IS_ERR(em
)) {
1705 logical
= start
- em
->start
;
1706 logical
= em
->block_start
+ logical
;
1707 if (test_bit(EXTENT_FLAG_COMPRESSED
, &em
->flags
)) {
1708 logical
= em
->block_start
;
1709 failrec
->bio_flags
= EXTENT_BIO_COMPRESSED
;
1711 failrec
->logical
= logical
;
1712 free_extent_map(em
);
1713 set_extent_bits(failure_tree
, start
, end
, EXTENT_LOCKED
|
1714 EXTENT_DIRTY
, GFP_NOFS
);
1715 set_state_private(failure_tree
, start
,
1716 (u64
)(unsigned long)failrec
);
1718 failrec
= (struct io_failure_record
*)(unsigned long)private;
1720 num_copies
= btrfs_num_copies(
1721 &BTRFS_I(inode
)->root
->fs_info
->mapping_tree
,
1722 failrec
->logical
, failrec
->len
);
1723 failrec
->last_mirror
++;
1725 spin_lock(&BTRFS_I(inode
)->io_tree
.lock
);
1726 state
= find_first_extent_bit_state(&BTRFS_I(inode
)->io_tree
,
1729 if (state
&& state
->start
!= failrec
->start
)
1731 spin_unlock(&BTRFS_I(inode
)->io_tree
.lock
);
1733 if (!state
|| failrec
->last_mirror
> num_copies
) {
1734 set_state_private(failure_tree
, failrec
->start
, 0);
1735 clear_extent_bits(failure_tree
, failrec
->start
,
1736 failrec
->start
+ failrec
->len
- 1,
1737 EXTENT_LOCKED
| EXTENT_DIRTY
, GFP_NOFS
);
1741 bio
= bio_alloc(GFP_NOFS
, 1);
1742 bio
->bi_private
= state
;
1743 bio
->bi_end_io
= failed_bio
->bi_end_io
;
1744 bio
->bi_sector
= failrec
->logical
>> 9;
1745 bio
->bi_bdev
= failed_bio
->bi_bdev
;
1748 bio_add_page(bio
, page
, failrec
->len
, start
- page_offset(page
));
1749 if (failed_bio
->bi_rw
& (1 << BIO_RW
))
1754 BTRFS_I(inode
)->io_tree
.ops
->submit_bio_hook(inode
, rw
, bio
,
1755 failrec
->last_mirror
,
1756 failrec
->bio_flags
);
1761 * each time an IO finishes, we do a fast check in the IO failure tree
1762 * to see if we need to process or clean up an io_failure_record
1764 static int btrfs_clean_io_failures(struct inode
*inode
, u64 start
)
1767 u64 private_failure
;
1768 struct io_failure_record
*failure
;
1772 if (count_range_bits(&BTRFS_I(inode
)->io_failure_tree
, &private,
1773 (u64
)-1, 1, EXTENT_DIRTY
)) {
1774 ret
= get_state_private(&BTRFS_I(inode
)->io_failure_tree
,
1775 start
, &private_failure
);
1777 failure
= (struct io_failure_record
*)(unsigned long)
1779 set_state_private(&BTRFS_I(inode
)->io_failure_tree
,
1781 clear_extent_bits(&BTRFS_I(inode
)->io_failure_tree
,
1783 failure
->start
+ failure
->len
- 1,
1784 EXTENT_DIRTY
| EXTENT_LOCKED
,
1793 * when reads are done, we need to check csums to verify the data is correct
1794 * if there's a match, we allow the bio to finish. If not, we go through
1795 * the io_failure_record routines to find good copies
1797 static int btrfs_readpage_end_io_hook(struct page
*page
, u64 start
, u64 end
,
1798 struct extent_state
*state
)
1800 size_t offset
= start
- ((u64
)page
->index
<< PAGE_CACHE_SHIFT
);
1801 struct inode
*inode
= page
->mapping
->host
;
1802 struct extent_io_tree
*io_tree
= &BTRFS_I(inode
)->io_tree
;
1804 u64
private = ~(u32
)0;
1806 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
1809 if (PageChecked(page
)) {
1810 ClearPageChecked(page
);
1814 if (BTRFS_I(inode
)->flags
& BTRFS_INODE_NODATASUM
)
1817 if (root
->root_key
.objectid
== BTRFS_DATA_RELOC_TREE_OBJECTID
&&
1818 test_range_bit(io_tree
, start
, end
, EXTENT_NODATASUM
, 1, NULL
)) {
1819 clear_extent_bits(io_tree
, start
, end
, EXTENT_NODATASUM
,
1824 if (state
&& state
->start
== start
) {
1825 private = state
->private;
1828 ret
= get_state_private(io_tree
, start
, &private);
1830 kaddr
= kmap_atomic(page
, KM_USER0
);
1834 csum
= btrfs_csum_data(root
, kaddr
+ offset
, csum
, end
- start
+ 1);
1835 btrfs_csum_final(csum
, (char *)&csum
);
1836 if (csum
!= private)
1839 kunmap_atomic(kaddr
, KM_USER0
);
1841 /* if the io failure tree for this inode is non-empty,
1842 * check to see if we've recovered from a failed IO
1844 btrfs_clean_io_failures(inode
, start
);
1848 if (printk_ratelimit()) {
1849 printk(KERN_INFO
"btrfs csum failed ino %lu off %llu csum %u "
1850 "private %llu\n", page
->mapping
->host
->i_ino
,
1851 (unsigned long long)start
, csum
,
1852 (unsigned long long)private);
1854 memset(kaddr
+ offset
, 1, end
- start
+ 1);
1855 flush_dcache_page(page
);
1856 kunmap_atomic(kaddr
, KM_USER0
);
1863 * This creates an orphan entry for the given inode in case something goes
1864 * wrong in the middle of an unlink/truncate.
1866 int btrfs_orphan_add(struct btrfs_trans_handle
*trans
, struct inode
*inode
)
1868 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
1871 spin_lock(&root
->list_lock
);
1873 /* already on the orphan list, we're good */
1874 if (!list_empty(&BTRFS_I(inode
)->i_orphan
)) {
1875 spin_unlock(&root
->list_lock
);
1879 list_add(&BTRFS_I(inode
)->i_orphan
, &root
->orphan_list
);
1881 spin_unlock(&root
->list_lock
);
1884 * insert an orphan item to track this unlinked/truncated file
1886 ret
= btrfs_insert_orphan_item(trans
, root
, inode
->i_ino
);
1892 * We have done the truncate/delete so we can go ahead and remove the orphan
1893 * item for this particular inode.
1895 int btrfs_orphan_del(struct btrfs_trans_handle
*trans
, struct inode
*inode
)
1897 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
1900 spin_lock(&root
->list_lock
);
1902 if (list_empty(&BTRFS_I(inode
)->i_orphan
)) {
1903 spin_unlock(&root
->list_lock
);
1907 list_del_init(&BTRFS_I(inode
)->i_orphan
);
1909 spin_unlock(&root
->list_lock
);
1913 spin_unlock(&root
->list_lock
);
1915 ret
= btrfs_del_orphan_item(trans
, root
, inode
->i_ino
);
1921 * this cleans up any orphans that may be left on the list from the last use
1924 void btrfs_orphan_cleanup(struct btrfs_root
*root
)
1926 struct btrfs_path
*path
;
1927 struct extent_buffer
*leaf
;
1928 struct btrfs_item
*item
;
1929 struct btrfs_key key
, found_key
;
1930 struct btrfs_trans_handle
*trans
;
1931 struct inode
*inode
;
1932 int ret
= 0, nr_unlink
= 0, nr_truncate
= 0;
1934 path
= btrfs_alloc_path();
1939 key
.objectid
= BTRFS_ORPHAN_OBJECTID
;
1940 btrfs_set_key_type(&key
, BTRFS_ORPHAN_ITEM_KEY
);
1941 key
.offset
= (u64
)-1;
1945 ret
= btrfs_search_slot(NULL
, root
, &key
, path
, 0, 0);
1947 printk(KERN_ERR
"Error searching slot for orphan: %d"
1953 * if ret == 0 means we found what we were searching for, which
1954 * is weird, but possible, so only screw with path if we didnt
1955 * find the key and see if we have stuff that matches
1958 if (path
->slots
[0] == 0)
1963 /* pull out the item */
1964 leaf
= path
->nodes
[0];
1965 item
= btrfs_item_nr(leaf
, path
->slots
[0]);
1966 btrfs_item_key_to_cpu(leaf
, &found_key
, path
->slots
[0]);
1968 /* make sure the item matches what we want */
1969 if (found_key
.objectid
!= BTRFS_ORPHAN_OBJECTID
)
1971 if (btrfs_key_type(&found_key
) != BTRFS_ORPHAN_ITEM_KEY
)
1974 /* release the path since we're done with it */
1975 btrfs_release_path(root
, path
);
1978 * this is where we are basically btrfs_lookup, without the
1979 * crossing root thing. we store the inode number in the
1980 * offset of the orphan item.
1982 found_key
.objectid
= found_key
.offset
;
1983 found_key
.type
= BTRFS_INODE_ITEM_KEY
;
1984 found_key
.offset
= 0;
1985 inode
= btrfs_iget(root
->fs_info
->sb
, &found_key
, root
);
1990 * add this inode to the orphan list so btrfs_orphan_del does
1991 * the proper thing when we hit it
1993 spin_lock(&root
->list_lock
);
1994 list_add(&BTRFS_I(inode
)->i_orphan
, &root
->orphan_list
);
1995 spin_unlock(&root
->list_lock
);
1998 * if this is a bad inode, means we actually succeeded in
1999 * removing the inode, but not the orphan record, which means
2000 * we need to manually delete the orphan since iput will just
2001 * do a destroy_inode
2003 if (is_bad_inode(inode
)) {
2004 trans
= btrfs_start_transaction(root
, 1);
2005 btrfs_orphan_del(trans
, inode
);
2006 btrfs_end_transaction(trans
, root
);
2011 /* if we have links, this was a truncate, lets do that */
2012 if (inode
->i_nlink
) {
2014 btrfs_truncate(inode
);
2019 /* this will do delete_inode and everything for us */
2024 printk(KERN_INFO
"btrfs: unlinked %d orphans\n", nr_unlink
);
2026 printk(KERN_INFO
"btrfs: truncated %d orphans\n", nr_truncate
);
2028 btrfs_free_path(path
);
2032 * very simple check to peek ahead in the leaf looking for xattrs. If we
2033 * don't find any xattrs, we know there can't be any acls.
2035 * slot is the slot the inode is in, objectid is the objectid of the inode
2037 static noinline
int acls_after_inode_item(struct extent_buffer
*leaf
,
2038 int slot
, u64 objectid
)
2040 u32 nritems
= btrfs_header_nritems(leaf
);
2041 struct btrfs_key found_key
;
2045 while (slot
< nritems
) {
2046 btrfs_item_key_to_cpu(leaf
, &found_key
, slot
);
2048 /* we found a different objectid, there must not be acls */
2049 if (found_key
.objectid
!= objectid
)
2052 /* we found an xattr, assume we've got an acl */
2053 if (found_key
.type
== BTRFS_XATTR_ITEM_KEY
)
2057 * we found a key greater than an xattr key, there can't
2058 * be any acls later on
2060 if (found_key
.type
> BTRFS_XATTR_ITEM_KEY
)
2067 * it goes inode, inode backrefs, xattrs, extents,
2068 * so if there are a ton of hard links to an inode there can
2069 * be a lot of backrefs. Don't waste time searching too hard,
2070 * this is just an optimization
2075 /* we hit the end of the leaf before we found an xattr or
2076 * something larger than an xattr. We have to assume the inode
2083 * read an inode from the btree into the in-memory inode
2085 static void btrfs_read_locked_inode(struct inode
*inode
)
2087 struct btrfs_path
*path
;
2088 struct extent_buffer
*leaf
;
2089 struct btrfs_inode_item
*inode_item
;
2090 struct btrfs_timespec
*tspec
;
2091 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
2092 struct btrfs_key location
;
2094 u64 alloc_group_block
;
2098 path
= btrfs_alloc_path();
2100 memcpy(&location
, &BTRFS_I(inode
)->location
, sizeof(location
));
2102 ret
= btrfs_lookup_inode(NULL
, root
, path
, &location
, 0);
2106 leaf
= path
->nodes
[0];
2107 inode_item
= btrfs_item_ptr(leaf
, path
->slots
[0],
2108 struct btrfs_inode_item
);
2110 inode
->i_mode
= btrfs_inode_mode(leaf
, inode_item
);
2111 inode
->i_nlink
= btrfs_inode_nlink(leaf
, inode_item
);
2112 inode
->i_uid
= btrfs_inode_uid(leaf
, inode_item
);
2113 inode
->i_gid
= btrfs_inode_gid(leaf
, inode_item
);
2114 btrfs_i_size_write(inode
, btrfs_inode_size(leaf
, inode_item
));
2116 tspec
= btrfs_inode_atime(inode_item
);
2117 inode
->i_atime
.tv_sec
= btrfs_timespec_sec(leaf
, tspec
);
2118 inode
->i_atime
.tv_nsec
= btrfs_timespec_nsec(leaf
, tspec
);
2120 tspec
= btrfs_inode_mtime(inode_item
);
2121 inode
->i_mtime
.tv_sec
= btrfs_timespec_sec(leaf
, tspec
);
2122 inode
->i_mtime
.tv_nsec
= btrfs_timespec_nsec(leaf
, tspec
);
2124 tspec
= btrfs_inode_ctime(inode_item
);
2125 inode
->i_ctime
.tv_sec
= btrfs_timespec_sec(leaf
, tspec
);
2126 inode
->i_ctime
.tv_nsec
= btrfs_timespec_nsec(leaf
, tspec
);
2128 inode_set_bytes(inode
, btrfs_inode_nbytes(leaf
, inode_item
));
2129 BTRFS_I(inode
)->generation
= btrfs_inode_generation(leaf
, inode_item
);
2130 BTRFS_I(inode
)->sequence
= btrfs_inode_sequence(leaf
, inode_item
);
2131 inode
->i_generation
= BTRFS_I(inode
)->generation
;
2133 rdev
= btrfs_inode_rdev(leaf
, inode_item
);
2135 BTRFS_I(inode
)->index_cnt
= (u64
)-1;
2136 BTRFS_I(inode
)->flags
= btrfs_inode_flags(leaf
, inode_item
);
2138 alloc_group_block
= btrfs_inode_block_group(leaf
, inode_item
);
2141 * try to precache a NULL acl entry for files that don't have
2142 * any xattrs or acls
2144 maybe_acls
= acls_after_inode_item(leaf
, path
->slots
[0], inode
->i_ino
);
2146 cache_no_acl(inode
);
2148 BTRFS_I(inode
)->block_group
= btrfs_find_block_group(root
, 0,
2149 alloc_group_block
, 0);
2150 btrfs_free_path(path
);
2153 switch (inode
->i_mode
& S_IFMT
) {
2155 inode
->i_mapping
->a_ops
= &btrfs_aops
;
2156 inode
->i_mapping
->backing_dev_info
= &root
->fs_info
->bdi
;
2157 BTRFS_I(inode
)->io_tree
.ops
= &btrfs_extent_io_ops
;
2158 inode
->i_fop
= &btrfs_file_operations
;
2159 inode
->i_op
= &btrfs_file_inode_operations
;
2162 inode
->i_fop
= &btrfs_dir_file_operations
;
2163 if (root
== root
->fs_info
->tree_root
)
2164 inode
->i_op
= &btrfs_dir_ro_inode_operations
;
2166 inode
->i_op
= &btrfs_dir_inode_operations
;
2169 inode
->i_op
= &btrfs_symlink_inode_operations
;
2170 inode
->i_mapping
->a_ops
= &btrfs_symlink_aops
;
2171 inode
->i_mapping
->backing_dev_info
= &root
->fs_info
->bdi
;
2174 inode
->i_op
= &btrfs_special_inode_operations
;
2175 init_special_inode(inode
, inode
->i_mode
, rdev
);
2179 btrfs_update_iflags(inode
);
2183 btrfs_free_path(path
);
2184 make_bad_inode(inode
);
2188 * given a leaf and an inode, copy the inode fields into the leaf
2190 static void fill_inode_item(struct btrfs_trans_handle
*trans
,
2191 struct extent_buffer
*leaf
,
2192 struct btrfs_inode_item
*item
,
2193 struct inode
*inode
)
2195 btrfs_set_inode_uid(leaf
, item
, inode
->i_uid
);
2196 btrfs_set_inode_gid(leaf
, item
, inode
->i_gid
);
2197 btrfs_set_inode_size(leaf
, item
, BTRFS_I(inode
)->disk_i_size
);
2198 btrfs_set_inode_mode(leaf
, item
, inode
->i_mode
);
2199 btrfs_set_inode_nlink(leaf
, item
, inode
->i_nlink
);
2201 btrfs_set_timespec_sec(leaf
, btrfs_inode_atime(item
),
2202 inode
->i_atime
.tv_sec
);
2203 btrfs_set_timespec_nsec(leaf
, btrfs_inode_atime(item
),
2204 inode
->i_atime
.tv_nsec
);
2206 btrfs_set_timespec_sec(leaf
, btrfs_inode_mtime(item
),
2207 inode
->i_mtime
.tv_sec
);
2208 btrfs_set_timespec_nsec(leaf
, btrfs_inode_mtime(item
),
2209 inode
->i_mtime
.tv_nsec
);
2211 btrfs_set_timespec_sec(leaf
, btrfs_inode_ctime(item
),
2212 inode
->i_ctime
.tv_sec
);
2213 btrfs_set_timespec_nsec(leaf
, btrfs_inode_ctime(item
),
2214 inode
->i_ctime
.tv_nsec
);
2216 btrfs_set_inode_nbytes(leaf
, item
, inode_get_bytes(inode
));
2217 btrfs_set_inode_generation(leaf
, item
, BTRFS_I(inode
)->generation
);
2218 btrfs_set_inode_sequence(leaf
, item
, BTRFS_I(inode
)->sequence
);
2219 btrfs_set_inode_transid(leaf
, item
, trans
->transid
);
2220 btrfs_set_inode_rdev(leaf
, item
, inode
->i_rdev
);
2221 btrfs_set_inode_flags(leaf
, item
, BTRFS_I(inode
)->flags
);
2222 btrfs_set_inode_block_group(leaf
, item
, BTRFS_I(inode
)->block_group
);
2226 * copy everything in the in-memory inode into the btree.
2228 noinline
int btrfs_update_inode(struct btrfs_trans_handle
*trans
,
2229 struct btrfs_root
*root
, struct inode
*inode
)
2231 struct btrfs_inode_item
*inode_item
;
2232 struct btrfs_path
*path
;
2233 struct extent_buffer
*leaf
;
2236 path
= btrfs_alloc_path();
2238 path
->leave_spinning
= 1;
2239 ret
= btrfs_lookup_inode(trans
, root
, path
,
2240 &BTRFS_I(inode
)->location
, 1);
2247 btrfs_unlock_up_safe(path
, 1);
2248 leaf
= path
->nodes
[0];
2249 inode_item
= btrfs_item_ptr(leaf
, path
->slots
[0],
2250 struct btrfs_inode_item
);
2252 fill_inode_item(trans
, leaf
, inode_item
, inode
);
2253 btrfs_mark_buffer_dirty(leaf
);
2254 btrfs_set_inode_last_trans(trans
, inode
);
2257 btrfs_free_path(path
);
2263 * unlink helper that gets used here in inode.c and in the tree logging
2264 * recovery code. It remove a link in a directory with a given name, and
2265 * also drops the back refs in the inode to the directory
2267 int btrfs_unlink_inode(struct btrfs_trans_handle
*trans
,
2268 struct btrfs_root
*root
,
2269 struct inode
*dir
, struct inode
*inode
,
2270 const char *name
, int name_len
)
2272 struct btrfs_path
*path
;
2274 struct extent_buffer
*leaf
;
2275 struct btrfs_dir_item
*di
;
2276 struct btrfs_key key
;
2279 path
= btrfs_alloc_path();
2285 path
->leave_spinning
= 1;
2286 di
= btrfs_lookup_dir_item(trans
, root
, path
, dir
->i_ino
,
2287 name
, name_len
, -1);
2296 leaf
= path
->nodes
[0];
2297 btrfs_dir_item_key_to_cpu(leaf
, di
, &key
);
2298 ret
= btrfs_delete_one_dir_name(trans
, root
, path
, di
);
2301 btrfs_release_path(root
, path
);
2303 ret
= btrfs_del_inode_ref(trans
, root
, name
, name_len
,
2305 dir
->i_ino
, &index
);
2307 printk(KERN_INFO
"btrfs failed to delete reference to %.*s, "
2308 "inode %lu parent %lu\n", name_len
, name
,
2309 inode
->i_ino
, dir
->i_ino
);
2313 di
= btrfs_lookup_dir_index_item(trans
, root
, path
, dir
->i_ino
,
2314 index
, name
, name_len
, -1);
2323 ret
= btrfs_delete_one_dir_name(trans
, root
, path
, di
);
2324 btrfs_release_path(root
, path
);
2326 ret
= btrfs_del_inode_ref_in_log(trans
, root
, name
, name_len
,
2328 BUG_ON(ret
!= 0 && ret
!= -ENOENT
);
2330 ret
= btrfs_del_dir_entries_in_log(trans
, root
, name
, name_len
,
2334 btrfs_free_path(path
);
2338 btrfs_i_size_write(dir
, dir
->i_size
- name_len
* 2);
2339 inode
->i_ctime
= dir
->i_mtime
= dir
->i_ctime
= CURRENT_TIME
;
2340 btrfs_update_inode(trans
, root
, dir
);
2341 btrfs_drop_nlink(inode
);
2342 ret
= btrfs_update_inode(trans
, root
, inode
);
2347 static int btrfs_unlink(struct inode
*dir
, struct dentry
*dentry
)
2349 struct btrfs_root
*root
;
2350 struct btrfs_trans_handle
*trans
;
2351 struct inode
*inode
= dentry
->d_inode
;
2353 unsigned long nr
= 0;
2355 root
= BTRFS_I(dir
)->root
;
2357 trans
= btrfs_start_transaction(root
, 1);
2359 btrfs_set_trans_block_group(trans
, dir
);
2361 btrfs_record_unlink_dir(trans
, dir
, dentry
->d_inode
, 0);
2363 ret
= btrfs_unlink_inode(trans
, root
, dir
, dentry
->d_inode
,
2364 dentry
->d_name
.name
, dentry
->d_name
.len
);
2366 if (inode
->i_nlink
== 0)
2367 ret
= btrfs_orphan_add(trans
, inode
);
2369 nr
= trans
->blocks_used
;
2371 btrfs_end_transaction_throttle(trans
, root
);
2372 btrfs_btree_balance_dirty(root
, nr
);
2376 static int btrfs_rmdir(struct inode
*dir
, struct dentry
*dentry
)
2378 struct inode
*inode
= dentry
->d_inode
;
2381 struct btrfs_root
*root
= BTRFS_I(dir
)->root
;
2382 struct btrfs_trans_handle
*trans
;
2383 unsigned long nr
= 0;
2386 * the FIRST_FREE_OBJECTID check makes sure we don't try to rmdir
2387 * the root of a subvolume or snapshot
2389 if (inode
->i_size
> BTRFS_EMPTY_DIR_SIZE
||
2390 inode
->i_ino
== BTRFS_FIRST_FREE_OBJECTID
) {
2394 trans
= btrfs_start_transaction(root
, 1);
2395 btrfs_set_trans_block_group(trans
, dir
);
2397 err
= btrfs_orphan_add(trans
, inode
);
2401 /* now the directory is empty */
2402 err
= btrfs_unlink_inode(trans
, root
, dir
, dentry
->d_inode
,
2403 dentry
->d_name
.name
, dentry
->d_name
.len
);
2405 btrfs_i_size_write(inode
, 0);
2408 nr
= trans
->blocks_used
;
2409 ret
= btrfs_end_transaction_throttle(trans
, root
);
2410 btrfs_btree_balance_dirty(root
, nr
);
2419 * when truncating bytes in a file, it is possible to avoid reading
2420 * the leaves that contain only checksum items. This can be the
2421 * majority of the IO required to delete a large file, but it must
2422 * be done carefully.
2424 * The keys in the level just above the leaves are checked to make sure
2425 * the lowest key in a given leaf is a csum key, and starts at an offset
2426 * after the new size.
2428 * Then the key for the next leaf is checked to make sure it also has
2429 * a checksum item for the same file. If it does, we know our target leaf
2430 * contains only checksum items, and it can be safely freed without reading
2433 * This is just an optimization targeted at large files. It may do
2434 * nothing. It will return 0 unless things went badly.
2436 static noinline
int drop_csum_leaves(struct btrfs_trans_handle
*trans
,
2437 struct btrfs_root
*root
,
2438 struct btrfs_path
*path
,
2439 struct inode
*inode
, u64 new_size
)
2441 struct btrfs_key key
;
2444 struct btrfs_key found_key
;
2445 struct btrfs_key other_key
;
2446 struct btrfs_leaf_ref
*ref
;
2450 path
->lowest_level
= 1;
2451 key
.objectid
= inode
->i_ino
;
2452 key
.type
= BTRFS_CSUM_ITEM_KEY
;
2453 key
.offset
= new_size
;
2455 ret
= btrfs_search_slot(trans
, root
, &key
, path
, -1, 1);
2459 if (path
->nodes
[1] == NULL
) {
2464 btrfs_node_key_to_cpu(path
->nodes
[1], &found_key
, path
->slots
[1]);
2465 nritems
= btrfs_header_nritems(path
->nodes
[1]);
2470 if (path
->slots
[1] >= nritems
)
2473 /* did we find a key greater than anything we want to delete? */
2474 if (found_key
.objectid
> inode
->i_ino
||
2475 (found_key
.objectid
== inode
->i_ino
&& found_key
.type
> key
.type
))
2478 /* we check the next key in the node to make sure the leave contains
2479 * only checksum items. This comparison doesn't work if our
2480 * leaf is the last one in the node
2482 if (path
->slots
[1] + 1 >= nritems
) {
2484 /* search forward from the last key in the node, this
2485 * will bring us into the next node in the tree
2487 btrfs_node_key_to_cpu(path
->nodes
[1], &found_key
, nritems
- 1);
2489 /* unlikely, but we inc below, so check to be safe */
2490 if (found_key
.offset
== (u64
)-1)
2493 /* search_forward needs a path with locks held, do the
2494 * search again for the original key. It is possible
2495 * this will race with a balance and return a path that
2496 * we could modify, but this drop is just an optimization
2497 * and is allowed to miss some leaves.
2499 btrfs_release_path(root
, path
);
2502 /* setup a max key for search_forward */
2503 other_key
.offset
= (u64
)-1;
2504 other_key
.type
= key
.type
;
2505 other_key
.objectid
= key
.objectid
;
2507 path
->keep_locks
= 1;
2508 ret
= btrfs_search_forward(root
, &found_key
, &other_key
,
2510 path
->keep_locks
= 0;
2511 if (ret
|| found_key
.objectid
!= key
.objectid
||
2512 found_key
.type
!= key
.type
) {
2517 key
.offset
= found_key
.offset
;
2518 btrfs_release_path(root
, path
);
2523 /* we know there's one more slot after us in the tree,
2524 * read that key so we can verify it is also a checksum item
2526 btrfs_node_key_to_cpu(path
->nodes
[1], &other_key
, path
->slots
[1] + 1);
2528 if (found_key
.objectid
< inode
->i_ino
)
2531 if (found_key
.type
!= key
.type
|| found_key
.offset
< new_size
)
2535 * if the key for the next leaf isn't a csum key from this objectid,
2536 * we can't be sure there aren't good items inside this leaf.
2539 if (other_key
.objectid
!= inode
->i_ino
|| other_key
.type
!= key
.type
)
2542 leaf_start
= btrfs_node_blockptr(path
->nodes
[1], path
->slots
[1]);
2543 leaf_gen
= btrfs_node_ptr_generation(path
->nodes
[1], path
->slots
[1]);
2545 * it is safe to delete this leaf, it contains only
2546 * csum items from this inode at an offset >= new_size
2548 ret
= btrfs_del_leaf(trans
, root
, path
, leaf_start
);
2551 if (root
->ref_cows
&& leaf_gen
< trans
->transid
) {
2552 ref
= btrfs_alloc_leaf_ref(root
, 0);
2554 ref
->root_gen
= root
->root_key
.offset
;
2555 ref
->bytenr
= leaf_start
;
2557 ref
->generation
= leaf_gen
;
2560 btrfs_sort_leaf_ref(ref
);
2562 ret
= btrfs_add_leaf_ref(root
, ref
, 0);
2564 btrfs_free_leaf_ref(root
, ref
);
2570 btrfs_release_path(root
, path
);
2572 if (other_key
.objectid
== inode
->i_ino
&&
2573 other_key
.type
== key
.type
&& other_key
.offset
> key
.offset
) {
2574 key
.offset
= other_key
.offset
;
2580 /* fixup any changes we've made to the path */
2581 path
->lowest_level
= 0;
2582 path
->keep_locks
= 0;
2583 btrfs_release_path(root
, path
);
2590 * this can truncate away extent items, csum items and directory items.
2591 * It starts at a high offset and removes keys until it can't find
2592 * any higher than new_size
2594 * csum items that cross the new i_size are truncated to the new size
2597 * min_type is the minimum key type to truncate down to. If set to 0, this
2598 * will kill all the items on this inode, including the INODE_ITEM_KEY.
2600 noinline
int btrfs_truncate_inode_items(struct btrfs_trans_handle
*trans
,
2601 struct btrfs_root
*root
,
2602 struct inode
*inode
,
2603 u64 new_size
, u32 min_type
)
2606 struct btrfs_path
*path
;
2607 struct btrfs_key key
;
2608 struct btrfs_key found_key
;
2609 u32 found_type
= (u8
)-1;
2610 struct extent_buffer
*leaf
;
2611 struct btrfs_file_extent_item
*fi
;
2612 u64 extent_start
= 0;
2613 u64 extent_num_bytes
= 0;
2614 u64 extent_offset
= 0;
2618 int pending_del_nr
= 0;
2619 int pending_del_slot
= 0;
2620 int extent_type
= -1;
2622 u64 mask
= root
->sectorsize
- 1;
2625 btrfs_drop_extent_cache(inode
, new_size
& (~mask
), (u64
)-1, 0);
2626 path
= btrfs_alloc_path();
2630 /* FIXME, add redo link to tree so we don't leak on crash */
2631 key
.objectid
= inode
->i_ino
;
2632 key
.offset
= (u64
)-1;
2636 path
->leave_spinning
= 1;
2637 ret
= btrfs_search_slot(trans
, root
, &key
, path
, -1, 1);
2642 /* there are no items in the tree for us to truncate, we're
2645 if (path
->slots
[0] == 0) {
2654 leaf
= path
->nodes
[0];
2655 btrfs_item_key_to_cpu(leaf
, &found_key
, path
->slots
[0]);
2656 found_type
= btrfs_key_type(&found_key
);
2659 if (found_key
.objectid
!= inode
->i_ino
)
2662 if (found_type
< min_type
)
2665 item_end
= found_key
.offset
;
2666 if (found_type
== BTRFS_EXTENT_DATA_KEY
) {
2667 fi
= btrfs_item_ptr(leaf
, path
->slots
[0],
2668 struct btrfs_file_extent_item
);
2669 extent_type
= btrfs_file_extent_type(leaf
, fi
);
2670 encoding
= btrfs_file_extent_compression(leaf
, fi
);
2671 encoding
|= btrfs_file_extent_encryption(leaf
, fi
);
2672 encoding
|= btrfs_file_extent_other_encoding(leaf
, fi
);
2674 if (extent_type
!= BTRFS_FILE_EXTENT_INLINE
) {
2676 btrfs_file_extent_num_bytes(leaf
, fi
);
2677 } else if (extent_type
== BTRFS_FILE_EXTENT_INLINE
) {
2678 item_end
+= btrfs_file_extent_inline_len(leaf
,
2683 if (item_end
< new_size
) {
2684 if (found_type
== BTRFS_DIR_ITEM_KEY
)
2685 found_type
= BTRFS_INODE_ITEM_KEY
;
2686 else if (found_type
== BTRFS_EXTENT_ITEM_KEY
)
2687 found_type
= BTRFS_EXTENT_DATA_KEY
;
2688 else if (found_type
== BTRFS_EXTENT_DATA_KEY
)
2689 found_type
= BTRFS_XATTR_ITEM_KEY
;
2690 else if (found_type
== BTRFS_XATTR_ITEM_KEY
)
2691 found_type
= BTRFS_INODE_REF_KEY
;
2692 else if (found_type
)
2696 btrfs_set_key_type(&key
, found_type
);
2699 if (found_key
.offset
>= new_size
)
2705 /* FIXME, shrink the extent if the ref count is only 1 */
2706 if (found_type
!= BTRFS_EXTENT_DATA_KEY
)
2709 if (extent_type
!= BTRFS_FILE_EXTENT_INLINE
) {
2711 extent_start
= btrfs_file_extent_disk_bytenr(leaf
, fi
);
2712 if (!del_item
&& !encoding
) {
2713 u64 orig_num_bytes
=
2714 btrfs_file_extent_num_bytes(leaf
, fi
);
2715 extent_num_bytes
= new_size
-
2716 found_key
.offset
+ root
->sectorsize
- 1;
2717 extent_num_bytes
= extent_num_bytes
&
2718 ~((u64
)root
->sectorsize
- 1);
2719 btrfs_set_file_extent_num_bytes(leaf
, fi
,
2721 num_dec
= (orig_num_bytes
-
2723 if (root
->ref_cows
&& extent_start
!= 0)
2724 inode_sub_bytes(inode
, num_dec
);
2725 btrfs_mark_buffer_dirty(leaf
);
2728 btrfs_file_extent_disk_num_bytes(leaf
,
2730 extent_offset
= found_key
.offset
-
2731 btrfs_file_extent_offset(leaf
, fi
);
2733 /* FIXME blocksize != 4096 */
2734 num_dec
= btrfs_file_extent_num_bytes(leaf
, fi
);
2735 if (extent_start
!= 0) {
2738 inode_sub_bytes(inode
, num_dec
);
2741 } else if (extent_type
== BTRFS_FILE_EXTENT_INLINE
) {
2743 * we can't truncate inline items that have had
2747 btrfs_file_extent_compression(leaf
, fi
) == 0 &&
2748 btrfs_file_extent_encryption(leaf
, fi
) == 0 &&
2749 btrfs_file_extent_other_encoding(leaf
, fi
) == 0) {
2750 u32 size
= new_size
- found_key
.offset
;
2752 if (root
->ref_cows
) {
2753 inode_sub_bytes(inode
, item_end
+ 1 -
2757 btrfs_file_extent_calc_inline_size(size
);
2758 ret
= btrfs_truncate_item(trans
, root
, path
,
2761 } else if (root
->ref_cows
) {
2762 inode_sub_bytes(inode
, item_end
+ 1 -
2768 if (!pending_del_nr
) {
2769 /* no pending yet, add ourselves */
2770 pending_del_slot
= path
->slots
[0];
2772 } else if (pending_del_nr
&&
2773 path
->slots
[0] + 1 == pending_del_slot
) {
2774 /* hop on the pending chunk */
2776 pending_del_slot
= path
->slots
[0];
2783 if (found_extent
&& root
->ref_cows
) {
2784 btrfs_set_path_blocking(path
);
2785 ret
= btrfs_free_extent(trans
, root
, extent_start
,
2786 extent_num_bytes
, 0,
2787 btrfs_header_owner(leaf
),
2788 inode
->i_ino
, extent_offset
);
2792 if (path
->slots
[0] == 0) {
2795 btrfs_release_path(root
, path
);
2796 if (found_type
== BTRFS_INODE_ITEM_KEY
)
2802 if (pending_del_nr
&&
2803 path
->slots
[0] + 1 != pending_del_slot
) {
2804 struct btrfs_key debug
;
2806 btrfs_item_key_to_cpu(path
->nodes
[0], &debug
,
2808 ret
= btrfs_del_items(trans
, root
, path
,
2813 btrfs_release_path(root
, path
);
2814 if (found_type
== BTRFS_INODE_ITEM_KEY
)
2821 if (pending_del_nr
) {
2822 ret
= btrfs_del_items(trans
, root
, path
, pending_del_slot
,
2825 btrfs_free_path(path
);
2830 * taken from block_truncate_page, but does cow as it zeros out
2831 * any bytes left in the last page in the file.
2833 static int btrfs_truncate_page(struct address_space
*mapping
, loff_t from
)
2835 struct inode
*inode
= mapping
->host
;
2836 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
2837 struct extent_io_tree
*io_tree
= &BTRFS_I(inode
)->io_tree
;
2838 struct btrfs_ordered_extent
*ordered
;
2840 u32 blocksize
= root
->sectorsize
;
2841 pgoff_t index
= from
>> PAGE_CACHE_SHIFT
;
2842 unsigned offset
= from
& (PAGE_CACHE_SIZE
-1);
2848 if ((offset
& (blocksize
- 1)) == 0)
2853 page
= grab_cache_page(mapping
, index
);
2857 page_start
= page_offset(page
);
2858 page_end
= page_start
+ PAGE_CACHE_SIZE
- 1;
2860 if (!PageUptodate(page
)) {
2861 ret
= btrfs_readpage(NULL
, page
);
2863 if (page
->mapping
!= mapping
) {
2865 page_cache_release(page
);
2868 if (!PageUptodate(page
)) {
2873 wait_on_page_writeback(page
);
2875 lock_extent(io_tree
, page_start
, page_end
, GFP_NOFS
);
2876 set_page_extent_mapped(page
);
2878 ordered
= btrfs_lookup_ordered_extent(inode
, page_start
);
2880 unlock_extent(io_tree
, page_start
, page_end
, GFP_NOFS
);
2882 page_cache_release(page
);
2883 btrfs_start_ordered_extent(inode
, ordered
, 1);
2884 btrfs_put_ordered_extent(ordered
);
2888 btrfs_set_extent_delalloc(inode
, page_start
, page_end
);
2890 if (offset
!= PAGE_CACHE_SIZE
) {
2892 memset(kaddr
+ offset
, 0, PAGE_CACHE_SIZE
- offset
);
2893 flush_dcache_page(page
);
2896 ClearPageChecked(page
);
2897 set_page_dirty(page
);
2898 unlock_extent(io_tree
, page_start
, page_end
, GFP_NOFS
);
2902 page_cache_release(page
);
2907 int btrfs_cont_expand(struct inode
*inode
, loff_t size
)
2909 struct btrfs_trans_handle
*trans
;
2910 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
2911 struct extent_io_tree
*io_tree
= &BTRFS_I(inode
)->io_tree
;
2912 struct extent_map
*em
;
2913 u64 mask
= root
->sectorsize
- 1;
2914 u64 hole_start
= (inode
->i_size
+ mask
) & ~mask
;
2915 u64 block_end
= (size
+ mask
) & ~mask
;
2921 if (size
<= hole_start
)
2924 err
= btrfs_check_metadata_free_space(root
);
2928 btrfs_truncate_page(inode
->i_mapping
, inode
->i_size
);
2931 struct btrfs_ordered_extent
*ordered
;
2932 btrfs_wait_ordered_range(inode
, hole_start
,
2933 block_end
- hole_start
);
2934 lock_extent(io_tree
, hole_start
, block_end
- 1, GFP_NOFS
);
2935 ordered
= btrfs_lookup_ordered_extent(inode
, hole_start
);
2938 unlock_extent(io_tree
, hole_start
, block_end
- 1, GFP_NOFS
);
2939 btrfs_put_ordered_extent(ordered
);
2942 trans
= btrfs_start_transaction(root
, 1);
2943 btrfs_set_trans_block_group(trans
, inode
);
2945 cur_offset
= hole_start
;
2947 em
= btrfs_get_extent(inode
, NULL
, 0, cur_offset
,
2948 block_end
- cur_offset
, 0);
2949 BUG_ON(IS_ERR(em
) || !em
);
2950 last_byte
= min(extent_map_end(em
), block_end
);
2951 last_byte
= (last_byte
+ mask
) & ~mask
;
2952 if (test_bit(EXTENT_FLAG_VACANCY
, &em
->flags
)) {
2954 hole_size
= last_byte
- cur_offset
;
2955 err
= btrfs_drop_extents(trans
, root
, inode
,
2957 cur_offset
+ hole_size
,
2959 cur_offset
, &hint_byte
, 1);
2962 err
= btrfs_insert_file_extent(trans
, root
,
2963 inode
->i_ino
, cur_offset
, 0,
2964 0, hole_size
, 0, hole_size
,
2966 btrfs_drop_extent_cache(inode
, hole_start
,
2969 free_extent_map(em
);
2970 cur_offset
= last_byte
;
2971 if (err
|| cur_offset
>= block_end
)
2975 btrfs_end_transaction(trans
, root
);
2976 unlock_extent(io_tree
, hole_start
, block_end
- 1, GFP_NOFS
);
2980 static int btrfs_setattr(struct dentry
*dentry
, struct iattr
*attr
)
2982 struct inode
*inode
= dentry
->d_inode
;
2985 err
= inode_change_ok(inode
, attr
);
2989 if (S_ISREG(inode
->i_mode
) && (attr
->ia_valid
& ATTR_SIZE
)) {
2990 if (attr
->ia_size
> inode
->i_size
) {
2991 err
= btrfs_cont_expand(inode
, attr
->ia_size
);
2994 } else if (inode
->i_size
> 0 &&
2995 attr
->ia_size
== 0) {
2997 /* we're truncating a file that used to have good
2998 * data down to zero. Make sure it gets into
2999 * the ordered flush list so that any new writes
3000 * get down to disk quickly.
3002 BTRFS_I(inode
)->ordered_data_close
= 1;
3006 err
= inode_setattr(inode
, attr
);
3008 if (!err
&& ((attr
->ia_valid
& ATTR_MODE
)))
3009 err
= btrfs_acl_chmod(inode
);
3013 void btrfs_delete_inode(struct inode
*inode
)
3015 struct btrfs_trans_handle
*trans
;
3016 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
3020 truncate_inode_pages(&inode
->i_data
, 0);
3021 if (is_bad_inode(inode
)) {
3022 btrfs_orphan_del(NULL
, inode
);
3025 btrfs_wait_ordered_range(inode
, 0, (u64
)-1);
3027 btrfs_i_size_write(inode
, 0);
3028 trans
= btrfs_join_transaction(root
, 1);
3030 btrfs_set_trans_block_group(trans
, inode
);
3031 ret
= btrfs_truncate_inode_items(trans
, root
, inode
, inode
->i_size
, 0);
3033 btrfs_orphan_del(NULL
, inode
);
3034 goto no_delete_lock
;
3037 btrfs_orphan_del(trans
, inode
);
3039 nr
= trans
->blocks_used
;
3042 btrfs_end_transaction(trans
, root
);
3043 btrfs_btree_balance_dirty(root
, nr
);
3047 nr
= trans
->blocks_used
;
3048 btrfs_end_transaction(trans
, root
);
3049 btrfs_btree_balance_dirty(root
, nr
);
3055 * this returns the key found in the dir entry in the location pointer.
3056 * If no dir entries were found, location->objectid is 0.
3058 static int btrfs_inode_by_name(struct inode
*dir
, struct dentry
*dentry
,
3059 struct btrfs_key
*location
)
3061 const char *name
= dentry
->d_name
.name
;
3062 int namelen
= dentry
->d_name
.len
;
3063 struct btrfs_dir_item
*di
;
3064 struct btrfs_path
*path
;
3065 struct btrfs_root
*root
= BTRFS_I(dir
)->root
;
3068 path
= btrfs_alloc_path();
3071 di
= btrfs_lookup_dir_item(NULL
, root
, path
, dir
->i_ino
, name
,
3076 if (!di
|| IS_ERR(di
))
3079 btrfs_dir_item_key_to_cpu(path
->nodes
[0], di
, location
);
3081 btrfs_free_path(path
);
3084 location
->objectid
= 0;
3089 * when we hit a tree root in a directory, the btrfs part of the inode
3090 * needs to be changed to reflect the root directory of the tree root. This
3091 * is kind of like crossing a mount point.
3093 static int fixup_tree_root_location(struct btrfs_root
*root
,
3094 struct btrfs_key
*location
,
3095 struct btrfs_root
**sub_root
,
3096 struct dentry
*dentry
)
3098 struct btrfs_root_item
*ri
;
3100 if (btrfs_key_type(location
) != BTRFS_ROOT_ITEM_KEY
)
3102 if (location
->objectid
== BTRFS_ROOT_TREE_OBJECTID
)
3105 *sub_root
= btrfs_read_fs_root(root
->fs_info
, location
,
3106 dentry
->d_name
.name
,
3107 dentry
->d_name
.len
);
3108 if (IS_ERR(*sub_root
))
3109 return PTR_ERR(*sub_root
);
3111 ri
= &(*sub_root
)->root_item
;
3112 location
->objectid
= btrfs_root_dirid(ri
);
3113 btrfs_set_key_type(location
, BTRFS_INODE_ITEM_KEY
);
3114 location
->offset
= 0;
3119 static void inode_tree_add(struct inode
*inode
)
3121 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
3122 struct btrfs_inode
*entry
;
3124 struct rb_node
*parent
;
3127 p
= &root
->inode_tree
.rb_node
;
3130 spin_lock(&root
->inode_lock
);
3133 entry
= rb_entry(parent
, struct btrfs_inode
, rb_node
);
3135 if (inode
->i_ino
< entry
->vfs_inode
.i_ino
)
3136 p
= &parent
->rb_left
;
3137 else if (inode
->i_ino
> entry
->vfs_inode
.i_ino
)
3138 p
= &parent
->rb_right
;
3140 WARN_ON(!(entry
->vfs_inode
.i_state
&
3141 (I_WILL_FREE
| I_FREEING
| I_CLEAR
)));
3142 rb_erase(parent
, &root
->inode_tree
);
3143 RB_CLEAR_NODE(parent
);
3144 spin_unlock(&root
->inode_lock
);
3148 rb_link_node(&BTRFS_I(inode
)->rb_node
, parent
, p
);
3149 rb_insert_color(&BTRFS_I(inode
)->rb_node
, &root
->inode_tree
);
3150 spin_unlock(&root
->inode_lock
);
3153 static void inode_tree_del(struct inode
*inode
)
3155 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
3157 spin_lock(&root
->inode_lock
);
3158 if (!RB_EMPTY_NODE(&BTRFS_I(inode
)->rb_node
)) {
3159 rb_erase(&BTRFS_I(inode
)->rb_node
, &root
->inode_tree
);
3160 RB_CLEAR_NODE(&BTRFS_I(inode
)->rb_node
);
3162 spin_unlock(&root
->inode_lock
);
3165 static noinline
void init_btrfs_i(struct inode
*inode
)
3167 struct btrfs_inode
*bi
= BTRFS_I(inode
);
3172 bi
->logged_trans
= 0;
3173 bi
->delalloc_bytes
= 0;
3174 bi
->reserved_bytes
= 0;
3175 bi
->disk_i_size
= 0;
3177 bi
->index_cnt
= (u64
)-1;
3178 bi
->last_unlink_trans
= 0;
3179 bi
->ordered_data_close
= 0;
3180 extent_map_tree_init(&BTRFS_I(inode
)->extent_tree
, GFP_NOFS
);
3181 extent_io_tree_init(&BTRFS_I(inode
)->io_tree
,
3182 inode
->i_mapping
, GFP_NOFS
);
3183 extent_io_tree_init(&BTRFS_I(inode
)->io_failure_tree
,
3184 inode
->i_mapping
, GFP_NOFS
);
3185 INIT_LIST_HEAD(&BTRFS_I(inode
)->delalloc_inodes
);
3186 INIT_LIST_HEAD(&BTRFS_I(inode
)->ordered_operations
);
3187 RB_CLEAR_NODE(&BTRFS_I(inode
)->rb_node
);
3188 btrfs_ordered_inode_tree_init(&BTRFS_I(inode
)->ordered_tree
);
3189 mutex_init(&BTRFS_I(inode
)->extent_mutex
);
3190 mutex_init(&BTRFS_I(inode
)->log_mutex
);
3193 static int btrfs_init_locked_inode(struct inode
*inode
, void *p
)
3195 struct btrfs_iget_args
*args
= p
;
3196 inode
->i_ino
= args
->ino
;
3197 init_btrfs_i(inode
);
3198 BTRFS_I(inode
)->root
= args
->root
;
3199 btrfs_set_inode_space_info(args
->root
, inode
);
3203 static int btrfs_find_actor(struct inode
*inode
, void *opaque
)
3205 struct btrfs_iget_args
*args
= opaque
;
3206 return args
->ino
== inode
->i_ino
&&
3207 args
->root
== BTRFS_I(inode
)->root
;
3210 static struct inode
*btrfs_iget_locked(struct super_block
*s
,
3212 struct btrfs_root
*root
)
3214 struct inode
*inode
;
3215 struct btrfs_iget_args args
;
3216 args
.ino
= objectid
;
3219 inode
= iget5_locked(s
, objectid
, btrfs_find_actor
,
3220 btrfs_init_locked_inode
,
3225 /* Get an inode object given its location and corresponding root.
3226 * Returns in *is_new if the inode was read from disk
3228 struct inode
*btrfs_iget(struct super_block
*s
, struct btrfs_key
*location
,
3229 struct btrfs_root
*root
)
3231 struct inode
*inode
;
3233 inode
= btrfs_iget_locked(s
, location
->objectid
, root
);
3235 return ERR_PTR(-ENOMEM
);
3237 if (inode
->i_state
& I_NEW
) {
3238 BTRFS_I(inode
)->root
= root
;
3239 memcpy(&BTRFS_I(inode
)->location
, location
, sizeof(*location
));
3240 btrfs_read_locked_inode(inode
);
3242 inode_tree_add(inode
);
3243 unlock_new_inode(inode
);
3249 struct inode
*btrfs_lookup_dentry(struct inode
*dir
, struct dentry
*dentry
)
3251 struct inode
*inode
;
3252 struct btrfs_inode
*bi
= BTRFS_I(dir
);
3253 struct btrfs_root
*root
= bi
->root
;
3254 struct btrfs_root
*sub_root
= root
;
3255 struct btrfs_key location
;
3258 if (dentry
->d_name
.len
> BTRFS_NAME_LEN
)
3259 return ERR_PTR(-ENAMETOOLONG
);
3261 ret
= btrfs_inode_by_name(dir
, dentry
, &location
);
3264 return ERR_PTR(ret
);
3267 if (location
.objectid
) {
3268 ret
= fixup_tree_root_location(root
, &location
, &sub_root
,
3271 return ERR_PTR(ret
);
3273 return ERR_PTR(-ENOENT
);
3274 inode
= btrfs_iget(dir
->i_sb
, &location
, sub_root
);
3276 return ERR_CAST(inode
);
3281 static struct dentry
*btrfs_lookup(struct inode
*dir
, struct dentry
*dentry
,
3282 struct nameidata
*nd
)
3284 struct inode
*inode
;
3286 if (dentry
->d_name
.len
> BTRFS_NAME_LEN
)
3287 return ERR_PTR(-ENAMETOOLONG
);
3289 inode
= btrfs_lookup_dentry(dir
, dentry
);
3291 return ERR_CAST(inode
);
3293 return d_splice_alias(inode
, dentry
);
3296 static unsigned char btrfs_filetype_table
[] = {
3297 DT_UNKNOWN
, DT_REG
, DT_DIR
, DT_CHR
, DT_BLK
, DT_FIFO
, DT_SOCK
, DT_LNK
3300 static int btrfs_real_readdir(struct file
*filp
, void *dirent
,
3303 struct inode
*inode
= filp
->f_dentry
->d_inode
;
3304 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
3305 struct btrfs_item
*item
;
3306 struct btrfs_dir_item
*di
;
3307 struct btrfs_key key
;
3308 struct btrfs_key found_key
;
3309 struct btrfs_path
*path
;
3312 struct extent_buffer
*leaf
;
3315 unsigned char d_type
;
3320 int key_type
= BTRFS_DIR_INDEX_KEY
;
3325 /* FIXME, use a real flag for deciding about the key type */
3326 if (root
->fs_info
->tree_root
== root
)
3327 key_type
= BTRFS_DIR_ITEM_KEY
;
3329 /* special case for "." */
3330 if (filp
->f_pos
== 0) {
3331 over
= filldir(dirent
, ".", 1,
3338 /* special case for .., just use the back ref */
3339 if (filp
->f_pos
== 1) {
3340 u64 pino
= parent_ino(filp
->f_path
.dentry
);
3341 over
= filldir(dirent
, "..", 2,
3347 path
= btrfs_alloc_path();
3350 btrfs_set_key_type(&key
, key_type
);
3351 key
.offset
= filp
->f_pos
;
3352 key
.objectid
= inode
->i_ino
;
3354 ret
= btrfs_search_slot(NULL
, root
, &key
, path
, 0, 0);
3360 leaf
= path
->nodes
[0];
3361 nritems
= btrfs_header_nritems(leaf
);
3362 slot
= path
->slots
[0];
3363 if (advance
|| slot
>= nritems
) {
3364 if (slot
>= nritems
- 1) {
3365 ret
= btrfs_next_leaf(root
, path
);
3368 leaf
= path
->nodes
[0];
3369 nritems
= btrfs_header_nritems(leaf
);
3370 slot
= path
->slots
[0];
3378 item
= btrfs_item_nr(leaf
, slot
);
3379 btrfs_item_key_to_cpu(leaf
, &found_key
, slot
);
3381 if (found_key
.objectid
!= key
.objectid
)
3383 if (btrfs_key_type(&found_key
) != key_type
)
3385 if (found_key
.offset
< filp
->f_pos
)
3388 filp
->f_pos
= found_key
.offset
;
3390 di
= btrfs_item_ptr(leaf
, slot
, struct btrfs_dir_item
);
3392 di_total
= btrfs_item_size(leaf
, item
);
3394 while (di_cur
< di_total
) {
3395 struct btrfs_key location
;
3397 name_len
= btrfs_dir_name_len(leaf
, di
);
3398 if (name_len
<= sizeof(tmp_name
)) {
3399 name_ptr
= tmp_name
;
3401 name_ptr
= kmalloc(name_len
, GFP_NOFS
);
3407 read_extent_buffer(leaf
, name_ptr
,
3408 (unsigned long)(di
+ 1), name_len
);
3410 d_type
= btrfs_filetype_table
[btrfs_dir_type(leaf
, di
)];
3411 btrfs_dir_item_key_to_cpu(leaf
, di
, &location
);
3413 /* is this a reference to our own snapshot? If so
3416 if (location
.type
== BTRFS_ROOT_ITEM_KEY
&&
3417 location
.objectid
== root
->root_key
.objectid
) {
3421 over
= filldir(dirent
, name_ptr
, name_len
,
3422 found_key
.offset
, location
.objectid
,
3426 if (name_ptr
!= tmp_name
)
3431 di_len
= btrfs_dir_name_len(leaf
, di
) +
3432 btrfs_dir_data_len(leaf
, di
) + sizeof(*di
);
3434 di
= (struct btrfs_dir_item
*)((char *)di
+ di_len
);
3438 /* Reached end of directory/root. Bump pos past the last item. */
3439 if (key_type
== BTRFS_DIR_INDEX_KEY
)
3440 filp
->f_pos
= INT_LIMIT(off_t
);
3446 btrfs_free_path(path
);
3450 int btrfs_write_inode(struct inode
*inode
, int wait
)
3452 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
3453 struct btrfs_trans_handle
*trans
;
3456 if (root
->fs_info
->btree_inode
== inode
)
3460 trans
= btrfs_join_transaction(root
, 1);
3461 btrfs_set_trans_block_group(trans
, inode
);
3462 ret
= btrfs_commit_transaction(trans
, root
);
3468 * This is somewhat expensive, updating the tree every time the
3469 * inode changes. But, it is most likely to find the inode in cache.
3470 * FIXME, needs more benchmarking...there are no reasons other than performance
3471 * to keep or drop this code.
3473 void btrfs_dirty_inode(struct inode
*inode
)
3475 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
3476 struct btrfs_trans_handle
*trans
;
3478 trans
= btrfs_join_transaction(root
, 1);
3479 btrfs_set_trans_block_group(trans
, inode
);
3480 btrfs_update_inode(trans
, root
, inode
);
3481 btrfs_end_transaction(trans
, root
);
3485 * find the highest existing sequence number in a directory
3486 * and then set the in-memory index_cnt variable to reflect
3487 * free sequence numbers
3489 static int btrfs_set_inode_index_count(struct inode
*inode
)
3491 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
3492 struct btrfs_key key
, found_key
;
3493 struct btrfs_path
*path
;
3494 struct extent_buffer
*leaf
;
3497 key
.objectid
= inode
->i_ino
;
3498 btrfs_set_key_type(&key
, BTRFS_DIR_INDEX_KEY
);
3499 key
.offset
= (u64
)-1;
3501 path
= btrfs_alloc_path();
3505 ret
= btrfs_search_slot(NULL
, root
, &key
, path
, 0, 0);
3508 /* FIXME: we should be able to handle this */
3514 * MAGIC NUMBER EXPLANATION:
3515 * since we search a directory based on f_pos we have to start at 2
3516 * since '.' and '..' have f_pos of 0 and 1 respectively, so everybody
3517 * else has to start at 2
3519 if (path
->slots
[0] == 0) {
3520 BTRFS_I(inode
)->index_cnt
= 2;
3526 leaf
= path
->nodes
[0];
3527 btrfs_item_key_to_cpu(leaf
, &found_key
, path
->slots
[0]);
3529 if (found_key
.objectid
!= inode
->i_ino
||
3530 btrfs_key_type(&found_key
) != BTRFS_DIR_INDEX_KEY
) {
3531 BTRFS_I(inode
)->index_cnt
= 2;
3535 BTRFS_I(inode
)->index_cnt
= found_key
.offset
+ 1;
3537 btrfs_free_path(path
);
3542 * helper to find a free sequence number in a given directory. This current
3543 * code is very simple, later versions will do smarter things in the btree
3545 int btrfs_set_inode_index(struct inode
*dir
, u64
*index
)
3549 if (BTRFS_I(dir
)->index_cnt
== (u64
)-1) {
3550 ret
= btrfs_set_inode_index_count(dir
);
3555 *index
= BTRFS_I(dir
)->index_cnt
;
3556 BTRFS_I(dir
)->index_cnt
++;
3561 static struct inode
*btrfs_new_inode(struct btrfs_trans_handle
*trans
,
3562 struct btrfs_root
*root
,
3564 const char *name
, int name_len
,
3565 u64 ref_objectid
, u64 objectid
,
3566 u64 alloc_hint
, int mode
, u64
*index
)
3568 struct inode
*inode
;
3569 struct btrfs_inode_item
*inode_item
;
3570 struct btrfs_key
*location
;
3571 struct btrfs_path
*path
;
3572 struct btrfs_inode_ref
*ref
;
3573 struct btrfs_key key
[2];
3579 path
= btrfs_alloc_path();
3582 inode
= new_inode(root
->fs_info
->sb
);
3584 return ERR_PTR(-ENOMEM
);
3587 ret
= btrfs_set_inode_index(dir
, index
);
3590 return ERR_PTR(ret
);
3594 * index_cnt is ignored for everything but a dir,
3595 * btrfs_get_inode_index_count has an explanation for the magic
3598 init_btrfs_i(inode
);
3599 BTRFS_I(inode
)->index_cnt
= 2;
3600 BTRFS_I(inode
)->root
= root
;
3601 BTRFS_I(inode
)->generation
= trans
->transid
;
3602 btrfs_set_inode_space_info(root
, inode
);
3608 BTRFS_I(inode
)->block_group
=
3609 btrfs_find_block_group(root
, 0, alloc_hint
, owner
);
3611 key
[0].objectid
= objectid
;
3612 btrfs_set_key_type(&key
[0], BTRFS_INODE_ITEM_KEY
);
3615 key
[1].objectid
= objectid
;
3616 btrfs_set_key_type(&key
[1], BTRFS_INODE_REF_KEY
);
3617 key
[1].offset
= ref_objectid
;
3619 sizes
[0] = sizeof(struct btrfs_inode_item
);
3620 sizes
[1] = name_len
+ sizeof(*ref
);
3622 path
->leave_spinning
= 1;
3623 ret
= btrfs_insert_empty_items(trans
, root
, path
, key
, sizes
, 2);
3627 inode
->i_uid
= current_fsuid();
3629 if (dir
&& (dir
->i_mode
& S_ISGID
)) {
3630 inode
->i_gid
= dir
->i_gid
;
3634 inode
->i_gid
= current_fsgid();
3636 inode
->i_mode
= mode
;
3637 inode
->i_ino
= objectid
;
3638 inode_set_bytes(inode
, 0);
3639 inode
->i_mtime
= inode
->i_atime
= inode
->i_ctime
= CURRENT_TIME
;
3640 inode_item
= btrfs_item_ptr(path
->nodes
[0], path
->slots
[0],
3641 struct btrfs_inode_item
);
3642 fill_inode_item(trans
, path
->nodes
[0], inode_item
, inode
);
3644 ref
= btrfs_item_ptr(path
->nodes
[0], path
->slots
[0] + 1,
3645 struct btrfs_inode_ref
);
3646 btrfs_set_inode_ref_name_len(path
->nodes
[0], ref
, name_len
);
3647 btrfs_set_inode_ref_index(path
->nodes
[0], ref
, *index
);
3648 ptr
= (unsigned long)(ref
+ 1);
3649 write_extent_buffer(path
->nodes
[0], name
, ptr
, name_len
);
3651 btrfs_mark_buffer_dirty(path
->nodes
[0]);
3652 btrfs_free_path(path
);
3654 location
= &BTRFS_I(inode
)->location
;
3655 location
->objectid
= objectid
;
3656 location
->offset
= 0;
3657 btrfs_set_key_type(location
, BTRFS_INODE_ITEM_KEY
);
3659 btrfs_inherit_iflags(inode
, dir
);
3661 if ((mode
& S_IFREG
)) {
3662 if (btrfs_test_opt(root
, NODATASUM
))
3663 BTRFS_I(inode
)->flags
|= BTRFS_INODE_NODATASUM
;
3664 if (btrfs_test_opt(root
, NODATACOW
))
3665 BTRFS_I(inode
)->flags
|= BTRFS_INODE_NODATACOW
;
3668 insert_inode_hash(inode
);
3669 inode_tree_add(inode
);
3673 BTRFS_I(dir
)->index_cnt
--;
3674 btrfs_free_path(path
);
3676 return ERR_PTR(ret
);
3679 static inline u8
btrfs_inode_type(struct inode
*inode
)
3681 return btrfs_type_by_mode
[(inode
->i_mode
& S_IFMT
) >> S_SHIFT
];
3685 * utility function to add 'inode' into 'parent_inode' with
3686 * a give name and a given sequence number.
3687 * if 'add_backref' is true, also insert a backref from the
3688 * inode to the parent directory.
3690 int btrfs_add_link(struct btrfs_trans_handle
*trans
,
3691 struct inode
*parent_inode
, struct inode
*inode
,
3692 const char *name
, int name_len
, int add_backref
, u64 index
)
3695 struct btrfs_key key
;
3696 struct btrfs_root
*root
= BTRFS_I(parent_inode
)->root
;
3698 key
.objectid
= inode
->i_ino
;
3699 btrfs_set_key_type(&key
, BTRFS_INODE_ITEM_KEY
);
3702 ret
= btrfs_insert_dir_item(trans
, root
, name
, name_len
,
3703 parent_inode
->i_ino
,
3704 &key
, btrfs_inode_type(inode
),
3708 ret
= btrfs_insert_inode_ref(trans
, root
,
3711 parent_inode
->i_ino
,
3714 btrfs_i_size_write(parent_inode
, parent_inode
->i_size
+
3716 parent_inode
->i_mtime
= parent_inode
->i_ctime
= CURRENT_TIME
;
3717 ret
= btrfs_update_inode(trans
, root
, parent_inode
);
3722 static int btrfs_add_nondir(struct btrfs_trans_handle
*trans
,
3723 struct dentry
*dentry
, struct inode
*inode
,
3724 int backref
, u64 index
)
3726 int err
= btrfs_add_link(trans
, dentry
->d_parent
->d_inode
,
3727 inode
, dentry
->d_name
.name
,
3728 dentry
->d_name
.len
, backref
, index
);
3730 d_instantiate(dentry
, inode
);
3738 static int btrfs_mknod(struct inode
*dir
, struct dentry
*dentry
,
3739 int mode
, dev_t rdev
)
3741 struct btrfs_trans_handle
*trans
;
3742 struct btrfs_root
*root
= BTRFS_I(dir
)->root
;
3743 struct inode
*inode
= NULL
;
3747 unsigned long nr
= 0;
3750 if (!new_valid_dev(rdev
))
3753 err
= btrfs_check_metadata_free_space(root
);
3757 trans
= btrfs_start_transaction(root
, 1);
3758 btrfs_set_trans_block_group(trans
, dir
);
3760 err
= btrfs_find_free_objectid(trans
, root
, dir
->i_ino
, &objectid
);
3766 inode
= btrfs_new_inode(trans
, root
, dir
, dentry
->d_name
.name
,
3768 dentry
->d_parent
->d_inode
->i_ino
, objectid
,
3769 BTRFS_I(dir
)->block_group
, mode
, &index
);
3770 err
= PTR_ERR(inode
);
3774 err
= btrfs_init_inode_security(inode
, dir
);
3780 btrfs_set_trans_block_group(trans
, inode
);
3781 err
= btrfs_add_nondir(trans
, dentry
, inode
, 0, index
);
3785 inode
->i_op
= &btrfs_special_inode_operations
;
3786 init_special_inode(inode
, inode
->i_mode
, rdev
);
3787 btrfs_update_inode(trans
, root
, inode
);
3789 btrfs_update_inode_block_group(trans
, inode
);
3790 btrfs_update_inode_block_group(trans
, dir
);
3792 nr
= trans
->blocks_used
;
3793 btrfs_end_transaction_throttle(trans
, root
);
3796 inode_dec_link_count(inode
);
3799 btrfs_btree_balance_dirty(root
, nr
);
3803 static int btrfs_create(struct inode
*dir
, struct dentry
*dentry
,
3804 int mode
, struct nameidata
*nd
)
3806 struct btrfs_trans_handle
*trans
;
3807 struct btrfs_root
*root
= BTRFS_I(dir
)->root
;
3808 struct inode
*inode
= NULL
;
3811 unsigned long nr
= 0;
3815 err
= btrfs_check_metadata_free_space(root
);
3818 trans
= btrfs_start_transaction(root
, 1);
3819 btrfs_set_trans_block_group(trans
, dir
);
3821 err
= btrfs_find_free_objectid(trans
, root
, dir
->i_ino
, &objectid
);
3827 inode
= btrfs_new_inode(trans
, root
, dir
, dentry
->d_name
.name
,
3829 dentry
->d_parent
->d_inode
->i_ino
,
3830 objectid
, BTRFS_I(dir
)->block_group
, mode
,
3832 err
= PTR_ERR(inode
);
3836 err
= btrfs_init_inode_security(inode
, dir
);
3842 btrfs_set_trans_block_group(trans
, inode
);
3843 err
= btrfs_add_nondir(trans
, dentry
, inode
, 0, index
);
3847 inode
->i_mapping
->a_ops
= &btrfs_aops
;
3848 inode
->i_mapping
->backing_dev_info
= &root
->fs_info
->bdi
;
3849 inode
->i_fop
= &btrfs_file_operations
;
3850 inode
->i_op
= &btrfs_file_inode_operations
;
3851 BTRFS_I(inode
)->io_tree
.ops
= &btrfs_extent_io_ops
;
3853 btrfs_update_inode_block_group(trans
, inode
);
3854 btrfs_update_inode_block_group(trans
, dir
);
3856 nr
= trans
->blocks_used
;
3857 btrfs_end_transaction_throttle(trans
, root
);
3860 inode_dec_link_count(inode
);
3863 btrfs_btree_balance_dirty(root
, nr
);
3867 static int btrfs_link(struct dentry
*old_dentry
, struct inode
*dir
,
3868 struct dentry
*dentry
)
3870 struct btrfs_trans_handle
*trans
;
3871 struct btrfs_root
*root
= BTRFS_I(dir
)->root
;
3872 struct inode
*inode
= old_dentry
->d_inode
;
3874 unsigned long nr
= 0;
3878 if (inode
->i_nlink
== 0)
3881 btrfs_inc_nlink(inode
);
3882 err
= btrfs_check_metadata_free_space(root
);
3885 err
= btrfs_set_inode_index(dir
, &index
);
3889 trans
= btrfs_start_transaction(root
, 1);
3891 btrfs_set_trans_block_group(trans
, dir
);
3892 atomic_inc(&inode
->i_count
);
3894 err
= btrfs_add_nondir(trans
, dentry
, inode
, 1, index
);
3899 btrfs_update_inode_block_group(trans
, dir
);
3900 err
= btrfs_update_inode(trans
, root
, inode
);
3905 nr
= trans
->blocks_used
;
3907 btrfs_log_new_name(trans
, inode
, NULL
, dentry
->d_parent
);
3908 btrfs_end_transaction_throttle(trans
, root
);
3911 inode_dec_link_count(inode
);
3914 btrfs_btree_balance_dirty(root
, nr
);
3918 static int btrfs_mkdir(struct inode
*dir
, struct dentry
*dentry
, int mode
)
3920 struct inode
*inode
= NULL
;
3921 struct btrfs_trans_handle
*trans
;
3922 struct btrfs_root
*root
= BTRFS_I(dir
)->root
;
3924 int drop_on_err
= 0;
3927 unsigned long nr
= 1;
3929 err
= btrfs_check_metadata_free_space(root
);
3933 trans
= btrfs_start_transaction(root
, 1);
3934 btrfs_set_trans_block_group(trans
, dir
);
3936 if (IS_ERR(trans
)) {
3937 err
= PTR_ERR(trans
);
3941 err
= btrfs_find_free_objectid(trans
, root
, dir
->i_ino
, &objectid
);
3947 inode
= btrfs_new_inode(trans
, root
, dir
, dentry
->d_name
.name
,
3949 dentry
->d_parent
->d_inode
->i_ino
, objectid
,
3950 BTRFS_I(dir
)->block_group
, S_IFDIR
| mode
,
3952 if (IS_ERR(inode
)) {
3953 err
= PTR_ERR(inode
);
3959 err
= btrfs_init_inode_security(inode
, dir
);
3963 inode
->i_op
= &btrfs_dir_inode_operations
;
3964 inode
->i_fop
= &btrfs_dir_file_operations
;
3965 btrfs_set_trans_block_group(trans
, inode
);
3967 btrfs_i_size_write(inode
, 0);
3968 err
= btrfs_update_inode(trans
, root
, inode
);
3972 err
= btrfs_add_link(trans
, dentry
->d_parent
->d_inode
,
3973 inode
, dentry
->d_name
.name
,
3974 dentry
->d_name
.len
, 0, index
);
3978 d_instantiate(dentry
, inode
);
3980 btrfs_update_inode_block_group(trans
, inode
);
3981 btrfs_update_inode_block_group(trans
, dir
);
3984 nr
= trans
->blocks_used
;
3985 btrfs_end_transaction_throttle(trans
, root
);
3990 btrfs_btree_balance_dirty(root
, nr
);
3994 /* helper for btfs_get_extent. Given an existing extent in the tree,
3995 * and an extent that you want to insert, deal with overlap and insert
3996 * the new extent into the tree.
3998 static int merge_extent_mapping(struct extent_map_tree
*em_tree
,
3999 struct extent_map
*existing
,
4000 struct extent_map
*em
,
4001 u64 map_start
, u64 map_len
)
4005 BUG_ON(map_start
< em
->start
|| map_start
>= extent_map_end(em
));
4006 start_diff
= map_start
- em
->start
;
4007 em
->start
= map_start
;
4009 if (em
->block_start
< EXTENT_MAP_LAST_BYTE
&&
4010 !test_bit(EXTENT_FLAG_COMPRESSED
, &em
->flags
)) {
4011 em
->block_start
+= start_diff
;
4012 em
->block_len
-= start_diff
;
4014 return add_extent_mapping(em_tree
, em
);
4017 static noinline
int uncompress_inline(struct btrfs_path
*path
,
4018 struct inode
*inode
, struct page
*page
,
4019 size_t pg_offset
, u64 extent_offset
,
4020 struct btrfs_file_extent_item
*item
)
4023 struct extent_buffer
*leaf
= path
->nodes
[0];
4026 unsigned long inline_size
;
4029 WARN_ON(pg_offset
!= 0);
4030 max_size
= btrfs_file_extent_ram_bytes(leaf
, item
);
4031 inline_size
= btrfs_file_extent_inline_item_len(leaf
,
4032 btrfs_item_nr(leaf
, path
->slots
[0]));
4033 tmp
= kmalloc(inline_size
, GFP_NOFS
);
4034 ptr
= btrfs_file_extent_inline_start(item
);
4036 read_extent_buffer(leaf
, tmp
, ptr
, inline_size
);
4038 max_size
= min_t(unsigned long, PAGE_CACHE_SIZE
, max_size
);
4039 ret
= btrfs_zlib_decompress(tmp
, page
, extent_offset
,
4040 inline_size
, max_size
);
4042 char *kaddr
= kmap_atomic(page
, KM_USER0
);
4043 unsigned long copy_size
= min_t(u64
,
4044 PAGE_CACHE_SIZE
- pg_offset
,
4045 max_size
- extent_offset
);
4046 memset(kaddr
+ pg_offset
, 0, copy_size
);
4047 kunmap_atomic(kaddr
, KM_USER0
);
4054 * a bit scary, this does extent mapping from logical file offset to the disk.
4055 * the ugly parts come from merging extents from the disk with the in-ram
4056 * representation. This gets more complex because of the data=ordered code,
4057 * where the in-ram extents might be locked pending data=ordered completion.
4059 * This also copies inline extents directly into the page.
4062 struct extent_map
*btrfs_get_extent(struct inode
*inode
, struct page
*page
,
4063 size_t pg_offset
, u64 start
, u64 len
,
4069 u64 extent_start
= 0;
4071 u64 objectid
= inode
->i_ino
;
4073 struct btrfs_path
*path
= NULL
;
4074 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
4075 struct btrfs_file_extent_item
*item
;
4076 struct extent_buffer
*leaf
;
4077 struct btrfs_key found_key
;
4078 struct extent_map
*em
= NULL
;
4079 struct extent_map_tree
*em_tree
= &BTRFS_I(inode
)->extent_tree
;
4080 struct extent_io_tree
*io_tree
= &BTRFS_I(inode
)->io_tree
;
4081 struct btrfs_trans_handle
*trans
= NULL
;
4085 read_lock(&em_tree
->lock
);
4086 em
= lookup_extent_mapping(em_tree
, start
, len
);
4088 em
->bdev
= root
->fs_info
->fs_devices
->latest_bdev
;
4089 read_unlock(&em_tree
->lock
);
4092 if (em
->start
> start
|| em
->start
+ em
->len
<= start
)
4093 free_extent_map(em
);
4094 else if (em
->block_start
== EXTENT_MAP_INLINE
&& page
)
4095 free_extent_map(em
);
4099 em
= alloc_extent_map(GFP_NOFS
);
4104 em
->bdev
= root
->fs_info
->fs_devices
->latest_bdev
;
4105 em
->start
= EXTENT_MAP_HOLE
;
4106 em
->orig_start
= EXTENT_MAP_HOLE
;
4108 em
->block_len
= (u64
)-1;
4111 path
= btrfs_alloc_path();
4115 ret
= btrfs_lookup_file_extent(trans
, root
, path
,
4116 objectid
, start
, trans
!= NULL
);
4123 if (path
->slots
[0] == 0)
4128 leaf
= path
->nodes
[0];
4129 item
= btrfs_item_ptr(leaf
, path
->slots
[0],
4130 struct btrfs_file_extent_item
);
4131 /* are we inside the extent that was found? */
4132 btrfs_item_key_to_cpu(leaf
, &found_key
, path
->slots
[0]);
4133 found_type
= btrfs_key_type(&found_key
);
4134 if (found_key
.objectid
!= objectid
||
4135 found_type
!= BTRFS_EXTENT_DATA_KEY
) {
4139 found_type
= btrfs_file_extent_type(leaf
, item
);
4140 extent_start
= found_key
.offset
;
4141 compressed
= btrfs_file_extent_compression(leaf
, item
);
4142 if (found_type
== BTRFS_FILE_EXTENT_REG
||
4143 found_type
== BTRFS_FILE_EXTENT_PREALLOC
) {
4144 extent_end
= extent_start
+
4145 btrfs_file_extent_num_bytes(leaf
, item
);
4146 } else if (found_type
== BTRFS_FILE_EXTENT_INLINE
) {
4148 size
= btrfs_file_extent_inline_len(leaf
, item
);
4149 extent_end
= (extent_start
+ size
+ root
->sectorsize
- 1) &
4150 ~((u64
)root
->sectorsize
- 1);
4153 if (start
>= extent_end
) {
4155 if (path
->slots
[0] >= btrfs_header_nritems(leaf
)) {
4156 ret
= btrfs_next_leaf(root
, path
);
4163 leaf
= path
->nodes
[0];
4165 btrfs_item_key_to_cpu(leaf
, &found_key
, path
->slots
[0]);
4166 if (found_key
.objectid
!= objectid
||
4167 found_key
.type
!= BTRFS_EXTENT_DATA_KEY
)
4169 if (start
+ len
<= found_key
.offset
)
4172 em
->len
= found_key
.offset
- start
;
4176 if (found_type
== BTRFS_FILE_EXTENT_REG
||
4177 found_type
== BTRFS_FILE_EXTENT_PREALLOC
) {
4178 em
->start
= extent_start
;
4179 em
->len
= extent_end
- extent_start
;
4180 em
->orig_start
= extent_start
-
4181 btrfs_file_extent_offset(leaf
, item
);
4182 bytenr
= btrfs_file_extent_disk_bytenr(leaf
, item
);
4184 em
->block_start
= EXTENT_MAP_HOLE
;
4188 set_bit(EXTENT_FLAG_COMPRESSED
, &em
->flags
);
4189 em
->block_start
= bytenr
;
4190 em
->block_len
= btrfs_file_extent_disk_num_bytes(leaf
,
4193 bytenr
+= btrfs_file_extent_offset(leaf
, item
);
4194 em
->block_start
= bytenr
;
4195 em
->block_len
= em
->len
;
4196 if (found_type
== BTRFS_FILE_EXTENT_PREALLOC
)
4197 set_bit(EXTENT_FLAG_PREALLOC
, &em
->flags
);
4200 } else if (found_type
== BTRFS_FILE_EXTENT_INLINE
) {
4204 size_t extent_offset
;
4207 em
->block_start
= EXTENT_MAP_INLINE
;
4208 if (!page
|| create
) {
4209 em
->start
= extent_start
;
4210 em
->len
= extent_end
- extent_start
;
4214 size
= btrfs_file_extent_inline_len(leaf
, item
);
4215 extent_offset
= page_offset(page
) + pg_offset
- extent_start
;
4216 copy_size
= min_t(u64
, PAGE_CACHE_SIZE
- pg_offset
,
4217 size
- extent_offset
);
4218 em
->start
= extent_start
+ extent_offset
;
4219 em
->len
= (copy_size
+ root
->sectorsize
- 1) &
4220 ~((u64
)root
->sectorsize
- 1);
4221 em
->orig_start
= EXTENT_MAP_INLINE
;
4223 set_bit(EXTENT_FLAG_COMPRESSED
, &em
->flags
);
4224 ptr
= btrfs_file_extent_inline_start(item
) + extent_offset
;
4225 if (create
== 0 && !PageUptodate(page
)) {
4226 if (btrfs_file_extent_compression(leaf
, item
) ==
4227 BTRFS_COMPRESS_ZLIB
) {
4228 ret
= uncompress_inline(path
, inode
, page
,
4230 extent_offset
, item
);
4234 read_extent_buffer(leaf
, map
+ pg_offset
, ptr
,
4236 if (pg_offset
+ copy_size
< PAGE_CACHE_SIZE
) {
4237 memset(map
+ pg_offset
+ copy_size
, 0,
4238 PAGE_CACHE_SIZE
- pg_offset
-
4243 flush_dcache_page(page
);
4244 } else if (create
&& PageUptodate(page
)) {
4247 free_extent_map(em
);
4249 btrfs_release_path(root
, path
);
4250 trans
= btrfs_join_transaction(root
, 1);
4254 write_extent_buffer(leaf
, map
+ pg_offset
, ptr
,
4257 btrfs_mark_buffer_dirty(leaf
);
4259 set_extent_uptodate(io_tree
, em
->start
,
4260 extent_map_end(em
) - 1, GFP_NOFS
);
4263 printk(KERN_ERR
"btrfs unknown found_type %d\n", found_type
);
4270 em
->block_start
= EXTENT_MAP_HOLE
;
4271 set_bit(EXTENT_FLAG_VACANCY
, &em
->flags
);
4273 btrfs_release_path(root
, path
);
4274 if (em
->start
> start
|| extent_map_end(em
) <= start
) {
4275 printk(KERN_ERR
"Btrfs: bad extent! em: [%llu %llu] passed "
4276 "[%llu %llu]\n", (unsigned long long)em
->start
,
4277 (unsigned long long)em
->len
,
4278 (unsigned long long)start
,
4279 (unsigned long long)len
);
4285 write_lock(&em_tree
->lock
);
4286 ret
= add_extent_mapping(em_tree
, em
);
4287 /* it is possible that someone inserted the extent into the tree
4288 * while we had the lock dropped. It is also possible that
4289 * an overlapping map exists in the tree
4291 if (ret
== -EEXIST
) {
4292 struct extent_map
*existing
;
4296 existing
= lookup_extent_mapping(em_tree
, start
, len
);
4297 if (existing
&& (existing
->start
> start
||
4298 existing
->start
+ existing
->len
<= start
)) {
4299 free_extent_map(existing
);
4303 existing
= lookup_extent_mapping(em_tree
, em
->start
,
4306 err
= merge_extent_mapping(em_tree
, existing
,
4309 free_extent_map(existing
);
4311 free_extent_map(em
);
4316 free_extent_map(em
);
4320 free_extent_map(em
);
4325 write_unlock(&em_tree
->lock
);
4328 btrfs_free_path(path
);
4330 ret
= btrfs_end_transaction(trans
, root
);
4335 free_extent_map(em
);
4336 return ERR_PTR(err
);
4341 static ssize_t
btrfs_direct_IO(int rw
, struct kiocb
*iocb
,
4342 const struct iovec
*iov
, loff_t offset
,
4343 unsigned long nr_segs
)
4348 static int btrfs_fiemap(struct inode
*inode
, struct fiemap_extent_info
*fieinfo
,
4349 __u64 start
, __u64 len
)
4351 return extent_fiemap(inode
, fieinfo
, start
, len
, btrfs_get_extent
);
4354 int btrfs_readpage(struct file
*file
, struct page
*page
)
4356 struct extent_io_tree
*tree
;
4357 tree
= &BTRFS_I(page
->mapping
->host
)->io_tree
;
4358 return extent_read_full_page(tree
, page
, btrfs_get_extent
);
4361 static int btrfs_writepage(struct page
*page
, struct writeback_control
*wbc
)
4363 struct extent_io_tree
*tree
;
4366 if (current
->flags
& PF_MEMALLOC
) {
4367 redirty_page_for_writepage(wbc
, page
);
4371 tree
= &BTRFS_I(page
->mapping
->host
)->io_tree
;
4372 return extent_write_full_page(tree
, page
, btrfs_get_extent
, wbc
);
4375 int btrfs_writepages(struct address_space
*mapping
,
4376 struct writeback_control
*wbc
)
4378 struct extent_io_tree
*tree
;
4380 tree
= &BTRFS_I(mapping
->host
)->io_tree
;
4381 return extent_writepages(tree
, mapping
, btrfs_get_extent
, wbc
);
4385 btrfs_readpages(struct file
*file
, struct address_space
*mapping
,
4386 struct list_head
*pages
, unsigned nr_pages
)
4388 struct extent_io_tree
*tree
;
4389 tree
= &BTRFS_I(mapping
->host
)->io_tree
;
4390 return extent_readpages(tree
, mapping
, pages
, nr_pages
,
4393 static int __btrfs_releasepage(struct page
*page
, gfp_t gfp_flags
)
4395 struct extent_io_tree
*tree
;
4396 struct extent_map_tree
*map
;
4399 tree
= &BTRFS_I(page
->mapping
->host
)->io_tree
;
4400 map
= &BTRFS_I(page
->mapping
->host
)->extent_tree
;
4401 ret
= try_release_extent_mapping(map
, tree
, page
, gfp_flags
);
4403 ClearPagePrivate(page
);
4404 set_page_private(page
, 0);
4405 page_cache_release(page
);
4410 static int btrfs_releasepage(struct page
*page
, gfp_t gfp_flags
)
4412 if (PageWriteback(page
) || PageDirty(page
))
4414 return __btrfs_releasepage(page
, gfp_flags
& GFP_NOFS
);
4417 static void btrfs_invalidatepage(struct page
*page
, unsigned long offset
)
4419 struct extent_io_tree
*tree
;
4420 struct btrfs_ordered_extent
*ordered
;
4421 u64 page_start
= page_offset(page
);
4422 u64 page_end
= page_start
+ PAGE_CACHE_SIZE
- 1;
4426 * we have the page locked, so new writeback can't start,
4427 * and the dirty bit won't be cleared while we are here.
4429 * Wait for IO on this page so that we can safely clear
4430 * the PagePrivate2 bit and do ordered accounting
4432 wait_on_page_writeback(page
);
4434 tree
= &BTRFS_I(page
->mapping
->host
)->io_tree
;
4436 btrfs_releasepage(page
, GFP_NOFS
);
4439 lock_extent(tree
, page_start
, page_end
, GFP_NOFS
);
4440 ordered
= btrfs_lookup_ordered_extent(page
->mapping
->host
,
4444 * IO on this page will never be started, so we need
4445 * to account for any ordered extents now
4447 clear_extent_bit(tree
, page_start
, page_end
,
4448 EXTENT_DIRTY
| EXTENT_DELALLOC
|
4449 EXTENT_LOCKED
, 1, 0, NULL
, GFP_NOFS
);
4451 * whoever cleared the private bit is responsible
4452 * for the finish_ordered_io
4454 if (TestClearPagePrivate2(page
)) {
4455 btrfs_finish_ordered_io(page
->mapping
->host
,
4456 page_start
, page_end
);
4458 btrfs_put_ordered_extent(ordered
);
4459 lock_extent(tree
, page_start
, page_end
, GFP_NOFS
);
4461 clear_extent_bit(tree
, page_start
, page_end
,
4462 EXTENT_LOCKED
| EXTENT_DIRTY
| EXTENT_DELALLOC
,
4463 1, 1, NULL
, GFP_NOFS
);
4464 __btrfs_releasepage(page
, GFP_NOFS
);
4466 ClearPageChecked(page
);
4467 if (PagePrivate(page
)) {
4468 ClearPagePrivate(page
);
4469 set_page_private(page
, 0);
4470 page_cache_release(page
);
4475 * btrfs_page_mkwrite() is not allowed to change the file size as it gets
4476 * called from a page fault handler when a page is first dirtied. Hence we must
4477 * be careful to check for EOF conditions here. We set the page up correctly
4478 * for a written page which means we get ENOSPC checking when writing into
4479 * holes and correct delalloc and unwritten extent mapping on filesystems that
4480 * support these features.
4482 * We are not allowed to take the i_mutex here so we have to play games to
4483 * protect against truncate races as the page could now be beyond EOF. Because
4484 * vmtruncate() writes the inode size before removing pages, once we have the
4485 * page lock we can determine safely if the page is beyond EOF. If it is not
4486 * beyond EOF, then the page is guaranteed safe against truncation until we
4489 int btrfs_page_mkwrite(struct vm_area_struct
*vma
, struct vm_fault
*vmf
)
4491 struct page
*page
= vmf
->page
;
4492 struct inode
*inode
= fdentry(vma
->vm_file
)->d_inode
;
4493 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
4494 struct extent_io_tree
*io_tree
= &BTRFS_I(inode
)->io_tree
;
4495 struct btrfs_ordered_extent
*ordered
;
4497 unsigned long zero_start
;
4503 ret
= btrfs_check_data_free_space(root
, inode
, PAGE_CACHE_SIZE
);
4507 else /* -ENOSPC, -EIO, etc */
4508 ret
= VM_FAULT_SIGBUS
;
4512 ret
= VM_FAULT_NOPAGE
; /* make the VM retry the fault */
4515 size
= i_size_read(inode
);
4516 page_start
= page_offset(page
);
4517 page_end
= page_start
+ PAGE_CACHE_SIZE
- 1;
4519 if ((page
->mapping
!= inode
->i_mapping
) ||
4520 (page_start
>= size
)) {
4521 btrfs_free_reserved_data_space(root
, inode
, PAGE_CACHE_SIZE
);
4522 /* page got truncated out from underneath us */
4525 wait_on_page_writeback(page
);
4527 lock_extent(io_tree
, page_start
, page_end
, GFP_NOFS
);
4528 set_page_extent_mapped(page
);
4531 * we can't set the delalloc bits if there are pending ordered
4532 * extents. Drop our locks and wait for them to finish
4534 ordered
= btrfs_lookup_ordered_extent(inode
, page_start
);
4536 unlock_extent(io_tree
, page_start
, page_end
, GFP_NOFS
);
4538 btrfs_start_ordered_extent(inode
, ordered
, 1);
4539 btrfs_put_ordered_extent(ordered
);
4543 btrfs_set_extent_delalloc(inode
, page_start
, page_end
);
4546 /* page is wholly or partially inside EOF */
4547 if (page_start
+ PAGE_CACHE_SIZE
> size
)
4548 zero_start
= size
& ~PAGE_CACHE_MASK
;
4550 zero_start
= PAGE_CACHE_SIZE
;
4552 if (zero_start
!= PAGE_CACHE_SIZE
) {
4554 memset(kaddr
+ zero_start
, 0, PAGE_CACHE_SIZE
- zero_start
);
4555 flush_dcache_page(page
);
4558 ClearPageChecked(page
);
4559 set_page_dirty(page
);
4560 SetPageUptodate(page
);
4562 BTRFS_I(inode
)->last_trans
= root
->fs_info
->generation
+ 1;
4563 unlock_extent(io_tree
, page_start
, page_end
, GFP_NOFS
);
4567 return VM_FAULT_LOCKED
;
4573 static void btrfs_truncate(struct inode
*inode
)
4575 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
4577 struct btrfs_trans_handle
*trans
;
4579 u64 mask
= root
->sectorsize
- 1;
4581 if (!S_ISREG(inode
->i_mode
))
4583 if (IS_APPEND(inode
) || IS_IMMUTABLE(inode
))
4586 btrfs_truncate_page(inode
->i_mapping
, inode
->i_size
);
4587 btrfs_wait_ordered_range(inode
, inode
->i_size
& (~mask
), (u64
)-1);
4589 trans
= btrfs_start_transaction(root
, 1);
4592 * setattr is responsible for setting the ordered_data_close flag,
4593 * but that is only tested during the last file release. That
4594 * could happen well after the next commit, leaving a great big
4595 * window where new writes may get lost if someone chooses to write
4596 * to this file after truncating to zero
4598 * The inode doesn't have any dirty data here, and so if we commit
4599 * this is a noop. If someone immediately starts writing to the inode
4600 * it is very likely we'll catch some of their writes in this
4601 * transaction, and the commit will find this file on the ordered
4602 * data list with good things to send down.
4604 * This is a best effort solution, there is still a window where
4605 * using truncate to replace the contents of the file will
4606 * end up with a zero length file after a crash.
4608 if (inode
->i_size
== 0 && BTRFS_I(inode
)->ordered_data_close
)
4609 btrfs_add_ordered_operation(trans
, root
, inode
);
4611 btrfs_set_trans_block_group(trans
, inode
);
4612 btrfs_i_size_write(inode
, inode
->i_size
);
4614 ret
= btrfs_orphan_add(trans
, inode
);
4617 /* FIXME, add redo link to tree so we don't leak on crash */
4618 ret
= btrfs_truncate_inode_items(trans
, root
, inode
, inode
->i_size
,
4619 BTRFS_EXTENT_DATA_KEY
);
4620 btrfs_update_inode(trans
, root
, inode
);
4622 ret
= btrfs_orphan_del(trans
, inode
);
4626 nr
= trans
->blocks_used
;
4627 ret
= btrfs_end_transaction_throttle(trans
, root
);
4629 btrfs_btree_balance_dirty(root
, nr
);
4633 * create a new subvolume directory/inode (helper for the ioctl).
4635 int btrfs_create_subvol_root(struct btrfs_trans_handle
*trans
,
4636 struct btrfs_root
*new_root
, struct dentry
*dentry
,
4637 u64 new_dirid
, u64 alloc_hint
)
4639 struct inode
*inode
;
4643 inode
= btrfs_new_inode(trans
, new_root
, NULL
, "..", 2, new_dirid
,
4644 new_dirid
, alloc_hint
, S_IFDIR
| 0700, &index
);
4646 return PTR_ERR(inode
);
4647 inode
->i_op
= &btrfs_dir_inode_operations
;
4648 inode
->i_fop
= &btrfs_dir_file_operations
;
4651 btrfs_i_size_write(inode
, 0);
4653 error
= btrfs_update_inode(trans
, new_root
, inode
);
4657 d_instantiate(dentry
, inode
);
4661 /* helper function for file defrag and space balancing. This
4662 * forces readahead on a given range of bytes in an inode
4664 unsigned long btrfs_force_ra(struct address_space
*mapping
,
4665 struct file_ra_state
*ra
, struct file
*file
,
4666 pgoff_t offset
, pgoff_t last_index
)
4668 pgoff_t req_size
= last_index
- offset
+ 1;
4670 page_cache_sync_readahead(mapping
, ra
, file
, offset
, req_size
);
4671 return offset
+ req_size
;
4674 struct inode
*btrfs_alloc_inode(struct super_block
*sb
)
4676 struct btrfs_inode
*ei
;
4678 ei
= kmem_cache_alloc(btrfs_inode_cachep
, GFP_NOFS
);
4682 ei
->logged_trans
= 0;
4683 btrfs_ordered_inode_tree_init(&ei
->ordered_tree
);
4684 INIT_LIST_HEAD(&ei
->i_orphan
);
4685 INIT_LIST_HEAD(&ei
->ordered_operations
);
4686 return &ei
->vfs_inode
;
4689 void btrfs_destroy_inode(struct inode
*inode
)
4691 struct btrfs_ordered_extent
*ordered
;
4692 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
4694 WARN_ON(!list_empty(&inode
->i_dentry
));
4695 WARN_ON(inode
->i_data
.nrpages
);
4698 * Make sure we're properly removed from the ordered operation
4702 if (!list_empty(&BTRFS_I(inode
)->ordered_operations
)) {
4703 spin_lock(&root
->fs_info
->ordered_extent_lock
);
4704 list_del_init(&BTRFS_I(inode
)->ordered_operations
);
4705 spin_unlock(&root
->fs_info
->ordered_extent_lock
);
4708 spin_lock(&root
->list_lock
);
4709 if (!list_empty(&BTRFS_I(inode
)->i_orphan
)) {
4710 printk(KERN_ERR
"BTRFS: inode %lu: inode still on the orphan"
4711 " list\n", inode
->i_ino
);
4714 spin_unlock(&root
->list_lock
);
4717 ordered
= btrfs_lookup_first_ordered_extent(inode
, (u64
)-1);
4721 printk(KERN_ERR
"btrfs found ordered "
4722 "extent %llu %llu on inode cleanup\n",
4723 (unsigned long long)ordered
->file_offset
,
4724 (unsigned long long)ordered
->len
);
4725 btrfs_remove_ordered_extent(inode
, ordered
);
4726 btrfs_put_ordered_extent(ordered
);
4727 btrfs_put_ordered_extent(ordered
);
4730 inode_tree_del(inode
);
4731 btrfs_drop_extent_cache(inode
, 0, (u64
)-1, 0);
4732 kmem_cache_free(btrfs_inode_cachep
, BTRFS_I(inode
));
4735 static void init_once(void *foo
)
4737 struct btrfs_inode
*ei
= (struct btrfs_inode
*) foo
;
4739 inode_init_once(&ei
->vfs_inode
);
4742 void btrfs_destroy_cachep(void)
4744 if (btrfs_inode_cachep
)
4745 kmem_cache_destroy(btrfs_inode_cachep
);
4746 if (btrfs_trans_handle_cachep
)
4747 kmem_cache_destroy(btrfs_trans_handle_cachep
);
4748 if (btrfs_transaction_cachep
)
4749 kmem_cache_destroy(btrfs_transaction_cachep
);
4750 if (btrfs_path_cachep
)
4751 kmem_cache_destroy(btrfs_path_cachep
);
4754 int btrfs_init_cachep(void)
4756 btrfs_inode_cachep
= kmem_cache_create("btrfs_inode_cache",
4757 sizeof(struct btrfs_inode
), 0,
4758 SLAB_RECLAIM_ACCOUNT
| SLAB_MEM_SPREAD
, init_once
);
4759 if (!btrfs_inode_cachep
)
4762 btrfs_trans_handle_cachep
= kmem_cache_create("btrfs_trans_handle_cache",
4763 sizeof(struct btrfs_trans_handle
), 0,
4764 SLAB_RECLAIM_ACCOUNT
| SLAB_MEM_SPREAD
, NULL
);
4765 if (!btrfs_trans_handle_cachep
)
4768 btrfs_transaction_cachep
= kmem_cache_create("btrfs_transaction_cache",
4769 sizeof(struct btrfs_transaction
), 0,
4770 SLAB_RECLAIM_ACCOUNT
| SLAB_MEM_SPREAD
, NULL
);
4771 if (!btrfs_transaction_cachep
)
4774 btrfs_path_cachep
= kmem_cache_create("btrfs_path_cache",
4775 sizeof(struct btrfs_path
), 0,
4776 SLAB_RECLAIM_ACCOUNT
| SLAB_MEM_SPREAD
, NULL
);
4777 if (!btrfs_path_cachep
)
4782 btrfs_destroy_cachep();
4786 static int btrfs_getattr(struct vfsmount
*mnt
,
4787 struct dentry
*dentry
, struct kstat
*stat
)
4789 struct inode
*inode
= dentry
->d_inode
;
4790 generic_fillattr(inode
, stat
);
4791 stat
->dev
= BTRFS_I(inode
)->root
->anon_super
.s_dev
;
4792 stat
->blksize
= PAGE_CACHE_SIZE
;
4793 stat
->blocks
= (inode_get_bytes(inode
) +
4794 BTRFS_I(inode
)->delalloc_bytes
) >> 9;
4798 static int btrfs_rename(struct inode
*old_dir
, struct dentry
*old_dentry
,
4799 struct inode
*new_dir
, struct dentry
*new_dentry
)
4801 struct btrfs_trans_handle
*trans
;
4802 struct btrfs_root
*root
= BTRFS_I(old_dir
)->root
;
4803 struct inode
*new_inode
= new_dentry
->d_inode
;
4804 struct inode
*old_inode
= old_dentry
->d_inode
;
4805 struct timespec ctime
= CURRENT_TIME
;
4809 /* we're not allowed to rename between subvolumes */
4810 if (BTRFS_I(old_inode
)->root
->root_key
.objectid
!=
4811 BTRFS_I(new_dir
)->root
->root_key
.objectid
)
4814 if (S_ISDIR(old_inode
->i_mode
) && new_inode
&&
4815 new_inode
->i_size
> BTRFS_EMPTY_DIR_SIZE
) {
4819 /* to rename a snapshot or subvolume, we need to juggle the
4820 * backrefs. This isn't coded yet
4822 if (old_inode
->i_ino
== BTRFS_FIRST_FREE_OBJECTID
)
4825 ret
= btrfs_check_metadata_free_space(root
);
4830 * we're using rename to replace one file with another.
4831 * and the replacement file is large. Start IO on it now so
4832 * we don't add too much work to the end of the transaction
4834 if (new_inode
&& S_ISREG(old_inode
->i_mode
) && new_inode
->i_size
&&
4835 old_inode
->i_size
> BTRFS_ORDERED_OPERATIONS_FLUSH_LIMIT
)
4836 filemap_flush(old_inode
->i_mapping
);
4838 trans
= btrfs_start_transaction(root
, 1);
4841 * make sure the inode gets flushed if it is replacing
4844 if (new_inode
&& new_inode
->i_size
&&
4845 old_inode
&& S_ISREG(old_inode
->i_mode
)) {
4846 btrfs_add_ordered_operation(trans
, root
, old_inode
);
4850 * this is an ugly little race, but the rename is required to make
4851 * sure that if we crash, the inode is either at the old name
4852 * or the new one. pinning the log transaction lets us make sure
4853 * we don't allow a log commit to come in after we unlink the
4854 * name but before we add the new name back in.
4856 btrfs_pin_log_trans(root
);
4858 btrfs_set_trans_block_group(trans
, new_dir
);
4860 btrfs_inc_nlink(old_dentry
->d_inode
);
4861 old_dir
->i_ctime
= old_dir
->i_mtime
= ctime
;
4862 new_dir
->i_ctime
= new_dir
->i_mtime
= ctime
;
4863 old_inode
->i_ctime
= ctime
;
4865 if (old_dentry
->d_parent
!= new_dentry
->d_parent
)
4866 btrfs_record_unlink_dir(trans
, old_dir
, old_inode
, 1);
4868 ret
= btrfs_unlink_inode(trans
, root
, old_dir
, old_dentry
->d_inode
,
4869 old_dentry
->d_name
.name
,
4870 old_dentry
->d_name
.len
);
4875 new_inode
->i_ctime
= CURRENT_TIME
;
4876 ret
= btrfs_unlink_inode(trans
, root
, new_dir
,
4877 new_dentry
->d_inode
,
4878 new_dentry
->d_name
.name
,
4879 new_dentry
->d_name
.len
);
4882 if (new_inode
->i_nlink
== 0) {
4883 ret
= btrfs_orphan_add(trans
, new_dentry
->d_inode
);
4889 ret
= btrfs_set_inode_index(new_dir
, &index
);
4893 ret
= btrfs_add_link(trans
, new_dentry
->d_parent
->d_inode
,
4894 old_inode
, new_dentry
->d_name
.name
,
4895 new_dentry
->d_name
.len
, 1, index
);
4899 btrfs_log_new_name(trans
, old_inode
, old_dir
,
4900 new_dentry
->d_parent
);
4903 /* this btrfs_end_log_trans just allows the current
4904 * log-sub transaction to complete
4906 btrfs_end_log_trans(root
);
4907 btrfs_end_transaction_throttle(trans
, root
);
4913 * some fairly slow code that needs optimization. This walks the list
4914 * of all the inodes with pending delalloc and forces them to disk.
4916 int btrfs_start_delalloc_inodes(struct btrfs_root
*root
)
4918 struct list_head
*head
= &root
->fs_info
->delalloc_inodes
;
4919 struct btrfs_inode
*binode
;
4920 struct inode
*inode
;
4922 if (root
->fs_info
->sb
->s_flags
& MS_RDONLY
)
4925 spin_lock(&root
->fs_info
->delalloc_lock
);
4926 while (!list_empty(head
)) {
4927 binode
= list_entry(head
->next
, struct btrfs_inode
,
4929 inode
= igrab(&binode
->vfs_inode
);
4931 list_del_init(&binode
->delalloc_inodes
);
4932 spin_unlock(&root
->fs_info
->delalloc_lock
);
4934 filemap_flush(inode
->i_mapping
);
4938 spin_lock(&root
->fs_info
->delalloc_lock
);
4940 spin_unlock(&root
->fs_info
->delalloc_lock
);
4942 /* the filemap_flush will queue IO into the worker threads, but
4943 * we have to make sure the IO is actually started and that
4944 * ordered extents get created before we return
4946 atomic_inc(&root
->fs_info
->async_submit_draining
);
4947 while (atomic_read(&root
->fs_info
->nr_async_submits
) ||
4948 atomic_read(&root
->fs_info
->async_delalloc_pages
)) {
4949 wait_event(root
->fs_info
->async_submit_wait
,
4950 (atomic_read(&root
->fs_info
->nr_async_submits
) == 0 &&
4951 atomic_read(&root
->fs_info
->async_delalloc_pages
) == 0));
4953 atomic_dec(&root
->fs_info
->async_submit_draining
);
4957 static int btrfs_symlink(struct inode
*dir
, struct dentry
*dentry
,
4958 const char *symname
)
4960 struct btrfs_trans_handle
*trans
;
4961 struct btrfs_root
*root
= BTRFS_I(dir
)->root
;
4962 struct btrfs_path
*path
;
4963 struct btrfs_key key
;
4964 struct inode
*inode
= NULL
;
4972 struct btrfs_file_extent_item
*ei
;
4973 struct extent_buffer
*leaf
;
4974 unsigned long nr
= 0;
4976 name_len
= strlen(symname
) + 1;
4977 if (name_len
> BTRFS_MAX_INLINE_DATA_SIZE(root
))
4978 return -ENAMETOOLONG
;
4980 err
= btrfs_check_metadata_free_space(root
);
4984 trans
= btrfs_start_transaction(root
, 1);
4985 btrfs_set_trans_block_group(trans
, dir
);
4987 err
= btrfs_find_free_objectid(trans
, root
, dir
->i_ino
, &objectid
);
4993 inode
= btrfs_new_inode(trans
, root
, dir
, dentry
->d_name
.name
,
4995 dentry
->d_parent
->d_inode
->i_ino
, objectid
,
4996 BTRFS_I(dir
)->block_group
, S_IFLNK
|S_IRWXUGO
,
4998 err
= PTR_ERR(inode
);
5002 err
= btrfs_init_inode_security(inode
, dir
);
5008 btrfs_set_trans_block_group(trans
, inode
);
5009 err
= btrfs_add_nondir(trans
, dentry
, inode
, 0, index
);
5013 inode
->i_mapping
->a_ops
= &btrfs_aops
;
5014 inode
->i_mapping
->backing_dev_info
= &root
->fs_info
->bdi
;
5015 inode
->i_fop
= &btrfs_file_operations
;
5016 inode
->i_op
= &btrfs_file_inode_operations
;
5017 BTRFS_I(inode
)->io_tree
.ops
= &btrfs_extent_io_ops
;
5019 btrfs_update_inode_block_group(trans
, inode
);
5020 btrfs_update_inode_block_group(trans
, dir
);
5024 path
= btrfs_alloc_path();
5026 key
.objectid
= inode
->i_ino
;
5028 btrfs_set_key_type(&key
, BTRFS_EXTENT_DATA_KEY
);
5029 datasize
= btrfs_file_extent_calc_inline_size(name_len
);
5030 err
= btrfs_insert_empty_item(trans
, root
, path
, &key
,
5036 leaf
= path
->nodes
[0];
5037 ei
= btrfs_item_ptr(leaf
, path
->slots
[0],
5038 struct btrfs_file_extent_item
);
5039 btrfs_set_file_extent_generation(leaf
, ei
, trans
->transid
);
5040 btrfs_set_file_extent_type(leaf
, ei
,
5041 BTRFS_FILE_EXTENT_INLINE
);
5042 btrfs_set_file_extent_encryption(leaf
, ei
, 0);
5043 btrfs_set_file_extent_compression(leaf
, ei
, 0);
5044 btrfs_set_file_extent_other_encoding(leaf
, ei
, 0);
5045 btrfs_set_file_extent_ram_bytes(leaf
, ei
, name_len
);
5047 ptr
= btrfs_file_extent_inline_start(ei
);
5048 write_extent_buffer(leaf
, symname
, ptr
, name_len
);
5049 btrfs_mark_buffer_dirty(leaf
);
5050 btrfs_free_path(path
);
5052 inode
->i_op
= &btrfs_symlink_inode_operations
;
5053 inode
->i_mapping
->a_ops
= &btrfs_symlink_aops
;
5054 inode
->i_mapping
->backing_dev_info
= &root
->fs_info
->bdi
;
5055 inode_set_bytes(inode
, name_len
);
5056 btrfs_i_size_write(inode
, name_len
- 1);
5057 err
= btrfs_update_inode(trans
, root
, inode
);
5062 nr
= trans
->blocks_used
;
5063 btrfs_end_transaction_throttle(trans
, root
);
5066 inode_dec_link_count(inode
);
5069 btrfs_btree_balance_dirty(root
, nr
);
5073 static int prealloc_file_range(struct btrfs_trans_handle
*trans
,
5074 struct inode
*inode
, u64 start
, u64 end
,
5075 u64 locked_end
, u64 alloc_hint
, int mode
)
5077 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
5078 struct btrfs_key ins
;
5080 u64 cur_offset
= start
;
5081 u64 num_bytes
= end
- start
;
5084 while (num_bytes
> 0) {
5085 alloc_size
= min(num_bytes
, root
->fs_info
->max_extent
);
5086 ret
= btrfs_reserve_extent(trans
, root
, alloc_size
,
5087 root
->sectorsize
, 0, alloc_hint
,
5093 ret
= insert_reserved_file_extent(trans
, inode
,
5094 cur_offset
, ins
.objectid
,
5095 ins
.offset
, ins
.offset
,
5096 ins
.offset
, locked_end
,
5098 BTRFS_FILE_EXTENT_PREALLOC
);
5100 btrfs_drop_extent_cache(inode
, cur_offset
,
5101 cur_offset
+ ins
.offset
-1, 0);
5102 num_bytes
-= ins
.offset
;
5103 cur_offset
+= ins
.offset
;
5104 alloc_hint
= ins
.objectid
+ ins
.offset
;
5107 if (cur_offset
> start
) {
5108 inode
->i_ctime
= CURRENT_TIME
;
5109 BTRFS_I(inode
)->flags
|= BTRFS_INODE_PREALLOC
;
5110 if (!(mode
& FALLOC_FL_KEEP_SIZE
) &&
5111 cur_offset
> i_size_read(inode
))
5112 btrfs_i_size_write(inode
, cur_offset
);
5113 ret
= btrfs_update_inode(trans
, root
, inode
);
5120 static long btrfs_fallocate(struct inode
*inode
, int mode
,
5121 loff_t offset
, loff_t len
)
5129 u64 mask
= BTRFS_I(inode
)->root
->sectorsize
- 1;
5130 struct extent_map
*em
;
5131 struct btrfs_trans_handle
*trans
;
5132 struct btrfs_root
*root
;
5135 alloc_start
= offset
& ~mask
;
5136 alloc_end
= (offset
+ len
+ mask
) & ~mask
;
5139 * wait for ordered IO before we have any locks. We'll loop again
5140 * below with the locks held.
5142 btrfs_wait_ordered_range(inode
, alloc_start
, alloc_end
- alloc_start
);
5144 mutex_lock(&inode
->i_mutex
);
5145 if (alloc_start
> inode
->i_size
) {
5146 ret
= btrfs_cont_expand(inode
, alloc_start
);
5151 root
= BTRFS_I(inode
)->root
;
5153 ret
= btrfs_check_data_free_space(root
, inode
,
5154 alloc_end
- alloc_start
);
5158 locked_end
= alloc_end
- 1;
5160 struct btrfs_ordered_extent
*ordered
;
5162 trans
= btrfs_start_transaction(BTRFS_I(inode
)->root
, 1);
5168 /* the extent lock is ordered inside the running
5171 lock_extent(&BTRFS_I(inode
)->io_tree
, alloc_start
, locked_end
,
5173 ordered
= btrfs_lookup_first_ordered_extent(inode
,
5176 ordered
->file_offset
+ ordered
->len
> alloc_start
&&
5177 ordered
->file_offset
< alloc_end
) {
5178 btrfs_put_ordered_extent(ordered
);
5179 unlock_extent(&BTRFS_I(inode
)->io_tree
,
5180 alloc_start
, locked_end
, GFP_NOFS
);
5181 btrfs_end_transaction(trans
, BTRFS_I(inode
)->root
);
5184 * we can't wait on the range with the transaction
5185 * running or with the extent lock held
5187 btrfs_wait_ordered_range(inode
, alloc_start
,
5188 alloc_end
- alloc_start
);
5191 btrfs_put_ordered_extent(ordered
);
5196 cur_offset
= alloc_start
;
5198 em
= btrfs_get_extent(inode
, NULL
, 0, cur_offset
,
5199 alloc_end
- cur_offset
, 0);
5200 BUG_ON(IS_ERR(em
) || !em
);
5201 last_byte
= min(extent_map_end(em
), alloc_end
);
5202 last_byte
= (last_byte
+ mask
) & ~mask
;
5203 if (em
->block_start
== EXTENT_MAP_HOLE
) {
5204 ret
= prealloc_file_range(trans
, inode
, cur_offset
,
5205 last_byte
, locked_end
+ 1,
5208 free_extent_map(em
);
5212 if (em
->block_start
<= EXTENT_MAP_LAST_BYTE
)
5213 alloc_hint
= em
->block_start
;
5214 free_extent_map(em
);
5216 cur_offset
= last_byte
;
5217 if (cur_offset
>= alloc_end
) {
5222 unlock_extent(&BTRFS_I(inode
)->io_tree
, alloc_start
, locked_end
,
5225 btrfs_end_transaction(trans
, BTRFS_I(inode
)->root
);
5227 btrfs_free_reserved_data_space(root
, inode
, alloc_end
- alloc_start
);
5229 mutex_unlock(&inode
->i_mutex
);
5233 static int btrfs_set_page_dirty(struct page
*page
)
5235 return __set_page_dirty_nobuffers(page
);
5238 static int btrfs_permission(struct inode
*inode
, int mask
)
5240 if ((BTRFS_I(inode
)->flags
& BTRFS_INODE_READONLY
) && (mask
& MAY_WRITE
))
5242 return generic_permission(inode
, mask
, btrfs_check_acl
);
5245 static struct inode_operations btrfs_dir_inode_operations
= {
5246 .getattr
= btrfs_getattr
,
5247 .lookup
= btrfs_lookup
,
5248 .create
= btrfs_create
,
5249 .unlink
= btrfs_unlink
,
5251 .mkdir
= btrfs_mkdir
,
5252 .rmdir
= btrfs_rmdir
,
5253 .rename
= btrfs_rename
,
5254 .symlink
= btrfs_symlink
,
5255 .setattr
= btrfs_setattr
,
5256 .mknod
= btrfs_mknod
,
5257 .setxattr
= btrfs_setxattr
,
5258 .getxattr
= btrfs_getxattr
,
5259 .listxattr
= btrfs_listxattr
,
5260 .removexattr
= btrfs_removexattr
,
5261 .permission
= btrfs_permission
,
5263 static struct inode_operations btrfs_dir_ro_inode_operations
= {
5264 .lookup
= btrfs_lookup
,
5265 .permission
= btrfs_permission
,
5267 static struct file_operations btrfs_dir_file_operations
= {
5268 .llseek
= generic_file_llseek
,
5269 .read
= generic_read_dir
,
5270 .readdir
= btrfs_real_readdir
,
5271 .unlocked_ioctl
= btrfs_ioctl
,
5272 #ifdef CONFIG_COMPAT
5273 .compat_ioctl
= btrfs_ioctl
,
5275 .release
= btrfs_release_file
,
5276 .fsync
= btrfs_sync_file
,
5279 static struct extent_io_ops btrfs_extent_io_ops
= {
5280 .fill_delalloc
= run_delalloc_range
,
5281 .submit_bio_hook
= btrfs_submit_bio_hook
,
5282 .merge_bio_hook
= btrfs_merge_bio_hook
,
5283 .readpage_end_io_hook
= btrfs_readpage_end_io_hook
,
5284 .writepage_end_io_hook
= btrfs_writepage_end_io_hook
,
5285 .writepage_start_hook
= btrfs_writepage_start_hook
,
5286 .readpage_io_failed_hook
= btrfs_io_failed_hook
,
5287 .set_bit_hook
= btrfs_set_bit_hook
,
5288 .clear_bit_hook
= btrfs_clear_bit_hook
,
5292 * btrfs doesn't support the bmap operation because swapfiles
5293 * use bmap to make a mapping of extents in the file. They assume
5294 * these extents won't change over the life of the file and they
5295 * use the bmap result to do IO directly to the drive.
5297 * the btrfs bmap call would return logical addresses that aren't
5298 * suitable for IO and they also will change frequently as COW
5299 * operations happen. So, swapfile + btrfs == corruption.
5301 * For now we're avoiding this by dropping bmap.
5303 static struct address_space_operations btrfs_aops
= {
5304 .readpage
= btrfs_readpage
,
5305 .writepage
= btrfs_writepage
,
5306 .writepages
= btrfs_writepages
,
5307 .readpages
= btrfs_readpages
,
5308 .sync_page
= block_sync_page
,
5309 .direct_IO
= btrfs_direct_IO
,
5310 .invalidatepage
= btrfs_invalidatepage
,
5311 .releasepage
= btrfs_releasepage
,
5312 .set_page_dirty
= btrfs_set_page_dirty
,
5315 static struct address_space_operations btrfs_symlink_aops
= {
5316 .readpage
= btrfs_readpage
,
5317 .writepage
= btrfs_writepage
,
5318 .invalidatepage
= btrfs_invalidatepage
,
5319 .releasepage
= btrfs_releasepage
,
5322 static struct inode_operations btrfs_file_inode_operations
= {
5323 .truncate
= btrfs_truncate
,
5324 .getattr
= btrfs_getattr
,
5325 .setattr
= btrfs_setattr
,
5326 .setxattr
= btrfs_setxattr
,
5327 .getxattr
= btrfs_getxattr
,
5328 .listxattr
= btrfs_listxattr
,
5329 .removexattr
= btrfs_removexattr
,
5330 .permission
= btrfs_permission
,
5331 .fallocate
= btrfs_fallocate
,
5332 .fiemap
= btrfs_fiemap
,
5334 static struct inode_operations btrfs_special_inode_operations
= {
5335 .getattr
= btrfs_getattr
,
5336 .setattr
= btrfs_setattr
,
5337 .permission
= btrfs_permission
,
5338 .setxattr
= btrfs_setxattr
,
5339 .getxattr
= btrfs_getxattr
,
5340 .listxattr
= btrfs_listxattr
,
5341 .removexattr
= btrfs_removexattr
,
5343 static struct inode_operations btrfs_symlink_inode_operations
= {
5344 .readlink
= generic_readlink
,
5345 .follow_link
= page_follow_link_light
,
5346 .put_link
= page_put_link
,
5347 .permission
= btrfs_permission
,
5348 .setxattr
= btrfs_setxattr
,
5349 .getxattr
= btrfs_getxattr
,
5350 .listxattr
= btrfs_listxattr
,
5351 .removexattr
= btrfs_removexattr
,