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/smp_lock.h>
30 #include <linux/backing-dev.h>
31 #include <linux/mpage.h>
32 #include <linux/swap.h>
33 #include <linux/writeback.h>
34 #include <linux/statfs.h>
35 #include <linux/compat.h>
36 #include <linux/bit_spinlock.h>
37 #include <linux/version.h>
38 #include <linux/xattr.h>
39 #include <linux/posix_acl.h>
42 #include "transaction.h"
43 #include "btrfs_inode.h"
45 #include "print-tree.h"
47 #include "ordered-data.h"
52 struct btrfs_iget_args
{
54 struct btrfs_root
*root
;
57 static struct inode_operations btrfs_dir_inode_operations
;
58 static struct inode_operations btrfs_symlink_inode_operations
;
59 static struct inode_operations btrfs_dir_ro_inode_operations
;
60 static struct inode_operations btrfs_special_inode_operations
;
61 static struct inode_operations btrfs_file_inode_operations
;
62 static struct address_space_operations btrfs_aops
;
63 static struct address_space_operations btrfs_symlink_aops
;
64 static struct file_operations btrfs_dir_file_operations
;
65 static struct extent_io_ops btrfs_extent_io_ops
;
67 static struct kmem_cache
*btrfs_inode_cachep
;
68 struct kmem_cache
*btrfs_trans_handle_cachep
;
69 struct kmem_cache
*btrfs_transaction_cachep
;
70 struct kmem_cache
*btrfs_bit_radix_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
);
87 * a very lame attempt at stopping writes when the FS is 85% full. There
88 * are countless ways this is incorrect, but it is better than nothing.
90 int btrfs_check_free_space(struct btrfs_root
*root
, u64 num_required
,
99 spin_lock_irqsave(&root
->fs_info
->delalloc_lock
, flags
);
100 total
= btrfs_super_total_bytes(&root
->fs_info
->super_copy
);
101 used
= btrfs_super_bytes_used(&root
->fs_info
->super_copy
);
109 if (used
+ root
->fs_info
->delalloc_bytes
+ num_required
> thresh
)
111 spin_unlock_irqrestore(&root
->fs_info
->delalloc_lock
, flags
);
116 * when extent_io.c finds a delayed allocation range in the file,
117 * the call backs end up in this code. The basic idea is to
118 * allocate extents on disk for the range, and create ordered data structs
119 * in ram to track those extents.
121 static int cow_file_range(struct inode
*inode
, u64 start
, u64 end
)
123 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
124 struct btrfs_trans_handle
*trans
;
128 u64 blocksize
= root
->sectorsize
;
130 struct btrfs_key ins
;
131 struct extent_map
*em
;
132 struct extent_map_tree
*em_tree
= &BTRFS_I(inode
)->extent_tree
;
135 trans
= btrfs_join_transaction(root
, 1);
137 btrfs_set_trans_block_group(trans
, inode
);
139 num_bytes
= (end
- start
+ blocksize
) & ~(blocksize
- 1);
140 num_bytes
= max(blocksize
, num_bytes
);
141 orig_num_bytes
= num_bytes
;
143 if (alloc_hint
== EXTENT_MAP_INLINE
)
146 BUG_ON(num_bytes
> btrfs_super_total_bytes(&root
->fs_info
->super_copy
));
147 mutex_lock(&BTRFS_I(inode
)->extent_mutex
);
148 btrfs_drop_extent_cache(inode
, start
, start
+ num_bytes
- 1, 0);
149 mutex_unlock(&BTRFS_I(inode
)->extent_mutex
);
151 while(num_bytes
> 0) {
152 cur_alloc_size
= min(num_bytes
, root
->fs_info
->max_extent
);
153 ret
= btrfs_reserve_extent(trans
, root
, cur_alloc_size
,
154 root
->sectorsize
, 0, alloc_hint
,
160 em
= alloc_extent_map(GFP_NOFS
);
162 em
->len
= ins
.offset
;
163 em
->block_start
= ins
.objectid
;
164 em
->bdev
= root
->fs_info
->fs_devices
->latest_bdev
;
165 mutex_lock(&BTRFS_I(inode
)->extent_mutex
);
166 set_bit(EXTENT_FLAG_PINNED
, &em
->flags
);
168 spin_lock(&em_tree
->lock
);
169 ret
= add_extent_mapping(em_tree
, em
);
170 spin_unlock(&em_tree
->lock
);
171 if (ret
!= -EEXIST
) {
175 btrfs_drop_extent_cache(inode
, start
,
176 start
+ ins
.offset
- 1, 0);
178 mutex_unlock(&BTRFS_I(inode
)->extent_mutex
);
180 cur_alloc_size
= ins
.offset
;
181 ret
= btrfs_add_ordered_extent(inode
, start
, ins
.objectid
,
184 if (num_bytes
< cur_alloc_size
) {
185 printk("num_bytes %Lu cur_alloc %Lu\n", num_bytes
,
189 num_bytes
-= cur_alloc_size
;
190 alloc_hint
= ins
.objectid
+ ins
.offset
;
191 start
+= cur_alloc_size
;
194 btrfs_end_transaction(trans
, root
);
199 * when nowcow writeback call back. This checks for snapshots or COW copies
200 * of the extents that exist in the file, and COWs the file as required.
202 * If no cow copies or snapshots exist, we write directly to the existing
205 static int run_delalloc_nocow(struct inode
*inode
, u64 start
, u64 end
)
212 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
213 struct btrfs_block_group_cache
*block_group
;
214 struct btrfs_trans_handle
*trans
;
215 struct extent_buffer
*leaf
;
217 struct btrfs_path
*path
;
218 struct btrfs_file_extent_item
*item
;
221 struct btrfs_key found_key
;
223 total_fs_bytes
= btrfs_super_total_bytes(&root
->fs_info
->super_copy
);
224 path
= btrfs_alloc_path();
226 trans
= btrfs_join_transaction(root
, 1);
229 ret
= btrfs_lookup_file_extent(NULL
, root
, path
,
230 inode
->i_ino
, start
, 0);
237 if (path
->slots
[0] == 0)
242 leaf
= path
->nodes
[0];
243 item
= btrfs_item_ptr(leaf
, path
->slots
[0],
244 struct btrfs_file_extent_item
);
246 /* are we inside the extent that was found? */
247 btrfs_item_key_to_cpu(leaf
, &found_key
, path
->slots
[0]);
248 found_type
= btrfs_key_type(&found_key
);
249 if (found_key
.objectid
!= inode
->i_ino
||
250 found_type
!= BTRFS_EXTENT_DATA_KEY
)
253 found_type
= btrfs_file_extent_type(leaf
, item
);
254 extent_start
= found_key
.offset
;
255 if (found_type
== BTRFS_FILE_EXTENT_REG
) {
256 u64 extent_num_bytes
;
258 extent_num_bytes
= btrfs_file_extent_num_bytes(leaf
, item
);
259 extent_end
= extent_start
+ extent_num_bytes
;
262 if (loops
&& start
!= extent_start
)
265 if (start
< extent_start
|| start
>= extent_end
)
268 bytenr
= btrfs_file_extent_disk_bytenr(leaf
, item
);
272 if (btrfs_cross_ref_exists(trans
, root
, &found_key
, bytenr
))
275 * we may be called by the resizer, make sure we're inside
276 * the limits of the FS
278 block_group
= btrfs_lookup_block_group(root
->fs_info
,
280 if (!block_group
|| block_group
->ro
)
283 bytenr
+= btrfs_file_extent_offset(leaf
, item
);
284 extent_num_bytes
= min(end
+ 1, extent_end
) - start
;
285 ret
= btrfs_add_ordered_extent(inode
, start
, bytenr
,
286 extent_num_bytes
, 1);
292 btrfs_release_path(root
, path
);
300 btrfs_end_transaction(trans
, root
);
301 btrfs_free_path(path
);
302 return cow_file_range(inode
, start
, end
);
306 btrfs_end_transaction(trans
, root
);
307 btrfs_free_path(path
);
312 * extent_io.c call back to do delayed allocation processing
314 static int run_delalloc_range(struct inode
*inode
, u64 start
, u64 end
)
316 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
319 if (btrfs_test_opt(root
, NODATACOW
) ||
320 btrfs_test_flag(inode
, NODATACOW
))
321 ret
= run_delalloc_nocow(inode
, start
, end
);
323 ret
= cow_file_range(inode
, start
, end
);
329 * extent_io.c set_bit_hook, used to track delayed allocation
330 * bytes in this file, and to maintain the list of inodes that
331 * have pending delalloc work to be done.
333 int btrfs_set_bit_hook(struct inode
*inode
, u64 start
, u64 end
,
334 unsigned long old
, unsigned long bits
)
337 if (!(old
& EXTENT_DELALLOC
) && (bits
& EXTENT_DELALLOC
)) {
338 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
339 spin_lock_irqsave(&root
->fs_info
->delalloc_lock
, flags
);
340 BTRFS_I(inode
)->delalloc_bytes
+= end
- start
+ 1;
341 root
->fs_info
->delalloc_bytes
+= end
- start
+ 1;
342 if (list_empty(&BTRFS_I(inode
)->delalloc_inodes
)) {
343 list_add_tail(&BTRFS_I(inode
)->delalloc_inodes
,
344 &root
->fs_info
->delalloc_inodes
);
346 spin_unlock_irqrestore(&root
->fs_info
->delalloc_lock
, flags
);
352 * extent_io.c clear_bit_hook, see set_bit_hook for why
354 int btrfs_clear_bit_hook(struct inode
*inode
, u64 start
, u64 end
,
355 unsigned long old
, unsigned long bits
)
357 if ((old
& EXTENT_DELALLOC
) && (bits
& EXTENT_DELALLOC
)) {
358 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
361 spin_lock_irqsave(&root
->fs_info
->delalloc_lock
, flags
);
362 if (end
- start
+ 1 > root
->fs_info
->delalloc_bytes
) {
363 printk("warning: delalloc account %Lu %Lu\n",
364 end
- start
+ 1, root
->fs_info
->delalloc_bytes
);
365 root
->fs_info
->delalloc_bytes
= 0;
366 BTRFS_I(inode
)->delalloc_bytes
= 0;
368 root
->fs_info
->delalloc_bytes
-= end
- start
+ 1;
369 BTRFS_I(inode
)->delalloc_bytes
-= end
- start
+ 1;
371 if (BTRFS_I(inode
)->delalloc_bytes
== 0 &&
372 !list_empty(&BTRFS_I(inode
)->delalloc_inodes
)) {
373 list_del_init(&BTRFS_I(inode
)->delalloc_inodes
);
375 spin_unlock_irqrestore(&root
->fs_info
->delalloc_lock
, flags
);
381 * extent_io.c merge_bio_hook, this must check the chunk tree to make sure
382 * we don't create bios that span stripes or chunks
384 int btrfs_merge_bio_hook(struct page
*page
, unsigned long offset
,
385 size_t size
, struct bio
*bio
)
387 struct btrfs_root
*root
= BTRFS_I(page
->mapping
->host
)->root
;
388 struct btrfs_mapping_tree
*map_tree
;
389 u64 logical
= (u64
)bio
->bi_sector
<< 9;
394 length
= bio
->bi_size
;
395 map_tree
= &root
->fs_info
->mapping_tree
;
397 ret
= btrfs_map_block(map_tree
, READ
, logical
,
398 &map_length
, NULL
, 0);
400 if (map_length
< length
+ size
) {
407 * in order to insert checksums into the metadata in large chunks,
408 * we wait until bio submission time. All the pages in the bio are
409 * checksummed and sums are attached onto the ordered extent record.
411 * At IO completion time the cums attached on the ordered extent record
412 * are inserted into the btree
414 int __btrfs_submit_bio_hook(struct inode
*inode
, int rw
, struct bio
*bio
,
417 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
420 ret
= btrfs_csum_one_bio(root
, inode
, bio
);
423 return btrfs_map_bio(root
, rw
, bio
, mirror_num
, 1);
427 * extent_io.c submission hook. This does the right thing for csum calculation on write,
428 * or reading the csums from the tree before a read
430 int btrfs_submit_bio_hook(struct inode
*inode
, int rw
, struct bio
*bio
,
433 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
436 ret
= btrfs_bio_wq_end_io(root
->fs_info
, bio
, 0);
439 if (btrfs_test_opt(root
, NODATASUM
) ||
440 btrfs_test_flag(inode
, NODATASUM
)) {
444 if (!(rw
& (1 << BIO_RW
))) {
445 btrfs_lookup_bio_sums(root
, inode
, bio
);
448 return btrfs_wq_submit_bio(BTRFS_I(inode
)->root
->fs_info
,
449 inode
, rw
, bio
, mirror_num
,
450 __btrfs_submit_bio_hook
);
452 return btrfs_map_bio(root
, rw
, bio
, mirror_num
, 0);
456 * given a list of ordered sums record them in the inode. This happens
457 * at IO completion time based on sums calculated at bio submission time.
459 static noinline
int add_pending_csums(struct btrfs_trans_handle
*trans
,
460 struct inode
*inode
, u64 file_offset
,
461 struct list_head
*list
)
463 struct list_head
*cur
;
464 struct btrfs_ordered_sum
*sum
;
466 btrfs_set_trans_block_group(trans
, inode
);
467 list_for_each(cur
, list
) {
468 sum
= list_entry(cur
, struct btrfs_ordered_sum
, list
);
469 btrfs_csum_file_blocks(trans
, BTRFS_I(inode
)->root
,
475 int btrfs_set_extent_delalloc(struct inode
*inode
, u64 start
, u64 end
)
477 return set_extent_delalloc(&BTRFS_I(inode
)->io_tree
, start
, end
,
481 /* see btrfs_writepage_start_hook for details on why this is required */
482 struct btrfs_writepage_fixup
{
484 struct btrfs_work work
;
487 void btrfs_writepage_fixup_worker(struct btrfs_work
*work
)
489 struct btrfs_writepage_fixup
*fixup
;
490 struct btrfs_ordered_extent
*ordered
;
496 fixup
= container_of(work
, struct btrfs_writepage_fixup
, work
);
500 if (!page
->mapping
|| !PageDirty(page
) || !PageChecked(page
)) {
501 ClearPageChecked(page
);
505 inode
= page
->mapping
->host
;
506 page_start
= page_offset(page
);
507 page_end
= page_offset(page
) + PAGE_CACHE_SIZE
- 1;
509 lock_extent(&BTRFS_I(inode
)->io_tree
, page_start
, page_end
, GFP_NOFS
);
511 /* already ordered? We're done */
512 if (test_range_bit(&BTRFS_I(inode
)->io_tree
, page_start
, page_end
,
513 EXTENT_ORDERED
, 0)) {
517 ordered
= btrfs_lookup_ordered_extent(inode
, page_start
);
519 unlock_extent(&BTRFS_I(inode
)->io_tree
, page_start
,
522 btrfs_start_ordered_extent(inode
, ordered
, 1);
526 btrfs_set_extent_delalloc(inode
, page_start
, page_end
);
527 ClearPageChecked(page
);
529 unlock_extent(&BTRFS_I(inode
)->io_tree
, page_start
, page_end
, GFP_NOFS
);
532 page_cache_release(page
);
536 * There are a few paths in the higher layers of the kernel that directly
537 * set the page dirty bit without asking the filesystem if it is a
538 * good idea. This causes problems because we want to make sure COW
539 * properly happens and the data=ordered rules are followed.
541 * In our case any range that doesn't have the EXTENT_ORDERED bit set
542 * hasn't been properly setup for IO. We kick off an async process
543 * to fix it up. The async helper will wait for ordered extents, set
544 * the delalloc bit and make it safe to write the page.
546 int btrfs_writepage_start_hook(struct page
*page
, u64 start
, u64 end
)
548 struct inode
*inode
= page
->mapping
->host
;
549 struct btrfs_writepage_fixup
*fixup
;
550 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
553 ret
= test_range_bit(&BTRFS_I(inode
)->io_tree
, start
, end
,
558 if (PageChecked(page
))
561 fixup
= kzalloc(sizeof(*fixup
), GFP_NOFS
);
565 SetPageChecked(page
);
566 page_cache_get(page
);
567 fixup
->work
.func
= btrfs_writepage_fixup_worker
;
569 btrfs_queue_worker(&root
->fs_info
->fixup_workers
, &fixup
->work
);
573 /* as ordered data IO finishes, this gets called so we can finish
574 * an ordered extent if the range of bytes in the file it covers are
577 static int btrfs_finish_ordered_io(struct inode
*inode
, u64 start
, u64 end
)
579 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
580 struct btrfs_trans_handle
*trans
;
581 struct btrfs_ordered_extent
*ordered_extent
;
582 struct extent_io_tree
*io_tree
= &BTRFS_I(inode
)->io_tree
;
583 struct btrfs_file_extent_item
*extent_item
;
584 struct btrfs_path
*path
= NULL
;
585 struct extent_buffer
*leaf
;
587 struct list_head list
;
588 struct btrfs_key ins
;
591 ret
= btrfs_dec_test_ordered_pending(inode
, start
, end
- start
+ 1);
595 trans
= btrfs_join_transaction(root
, 1);
597 ordered_extent
= btrfs_lookup_ordered_extent(inode
, start
);
598 BUG_ON(!ordered_extent
);
599 if (test_bit(BTRFS_ORDERED_NOCOW
, &ordered_extent
->flags
))
602 path
= btrfs_alloc_path();
605 lock_extent(io_tree
, ordered_extent
->file_offset
,
606 ordered_extent
->file_offset
+ ordered_extent
->len
- 1,
609 INIT_LIST_HEAD(&list
);
611 mutex_lock(&BTRFS_I(inode
)->extent_mutex
);
613 ret
= btrfs_drop_extents(trans
, root
, inode
,
614 ordered_extent
->file_offset
,
615 ordered_extent
->file_offset
+
617 ordered_extent
->file_offset
, &alloc_hint
);
620 ins
.objectid
= inode
->i_ino
;
621 ins
.offset
= ordered_extent
->file_offset
;
622 ins
.type
= BTRFS_EXTENT_DATA_KEY
;
623 ret
= btrfs_insert_empty_item(trans
, root
, path
, &ins
,
624 sizeof(*extent_item
));
626 leaf
= path
->nodes
[0];
627 extent_item
= btrfs_item_ptr(leaf
, path
->slots
[0],
628 struct btrfs_file_extent_item
);
629 btrfs_set_file_extent_generation(leaf
, extent_item
, trans
->transid
);
630 btrfs_set_file_extent_type(leaf
, extent_item
, BTRFS_FILE_EXTENT_REG
);
631 btrfs_set_file_extent_disk_bytenr(leaf
, extent_item
,
632 ordered_extent
->start
);
633 btrfs_set_file_extent_disk_num_bytes(leaf
, extent_item
,
634 ordered_extent
->len
);
635 btrfs_set_file_extent_offset(leaf
, extent_item
, 0);
636 btrfs_set_file_extent_num_bytes(leaf
, extent_item
,
637 ordered_extent
->len
);
638 btrfs_mark_buffer_dirty(leaf
);
640 btrfs_drop_extent_cache(inode
, ordered_extent
->file_offset
,
641 ordered_extent
->file_offset
+
642 ordered_extent
->len
- 1, 0);
643 mutex_unlock(&BTRFS_I(inode
)->extent_mutex
);
645 ins
.objectid
= ordered_extent
->start
;
646 ins
.offset
= ordered_extent
->len
;
647 ins
.type
= BTRFS_EXTENT_ITEM_KEY
;
648 ret
= btrfs_alloc_reserved_extent(trans
, root
, leaf
->start
,
649 root
->root_key
.objectid
,
650 trans
->transid
, inode
->i_ino
,
651 ordered_extent
->file_offset
, &ins
);
653 btrfs_release_path(root
, path
);
655 inode_add_bytes(inode
, ordered_extent
->len
);
656 unlock_extent(io_tree
, ordered_extent
->file_offset
,
657 ordered_extent
->file_offset
+ ordered_extent
->len
- 1,
660 add_pending_csums(trans
, inode
, ordered_extent
->file_offset
,
661 &ordered_extent
->list
);
663 mutex_lock(&BTRFS_I(inode
)->extent_mutex
);
664 btrfs_ordered_update_i_size(inode
, ordered_extent
);
665 btrfs_update_inode(trans
, root
, inode
);
666 btrfs_remove_ordered_extent(inode
, ordered_extent
);
667 mutex_unlock(&BTRFS_I(inode
)->extent_mutex
);
670 btrfs_put_ordered_extent(ordered_extent
);
671 /* once for the tree */
672 btrfs_put_ordered_extent(ordered_extent
);
674 btrfs_end_transaction(trans
, root
);
676 btrfs_free_path(path
);
680 int btrfs_writepage_end_io_hook(struct page
*page
, u64 start
, u64 end
,
681 struct extent_state
*state
, int uptodate
)
683 return btrfs_finish_ordered_io(page
->mapping
->host
, start
, end
);
687 * When IO fails, either with EIO or csum verification fails, we
688 * try other mirrors that might have a good copy of the data. This
689 * io_failure_record is used to record state as we go through all the
690 * mirrors. If another mirror has good data, the page is set up to date
691 * and things continue. If a good mirror can't be found, the original
692 * bio end_io callback is called to indicate things have failed.
694 struct io_failure_record
{
702 int btrfs_io_failed_hook(struct bio
*failed_bio
,
703 struct page
*page
, u64 start
, u64 end
,
704 struct extent_state
*state
)
706 struct io_failure_record
*failrec
= NULL
;
708 struct extent_map
*em
;
709 struct inode
*inode
= page
->mapping
->host
;
710 struct extent_io_tree
*failure_tree
= &BTRFS_I(inode
)->io_failure_tree
;
711 struct extent_map_tree
*em_tree
= &BTRFS_I(inode
)->extent_tree
;
718 ret
= get_state_private(failure_tree
, start
, &private);
720 failrec
= kmalloc(sizeof(*failrec
), GFP_NOFS
);
723 failrec
->start
= start
;
724 failrec
->len
= end
- start
+ 1;
725 failrec
->last_mirror
= 0;
727 spin_lock(&em_tree
->lock
);
728 em
= lookup_extent_mapping(em_tree
, start
, failrec
->len
);
729 if (em
->start
> start
|| em
->start
+ em
->len
< start
) {
733 spin_unlock(&em_tree
->lock
);
735 if (!em
|| IS_ERR(em
)) {
739 logical
= start
- em
->start
;
740 logical
= em
->block_start
+ logical
;
741 failrec
->logical
= logical
;
743 set_extent_bits(failure_tree
, start
, end
, EXTENT_LOCKED
|
744 EXTENT_DIRTY
, GFP_NOFS
);
745 set_state_private(failure_tree
, start
,
746 (u64
)(unsigned long)failrec
);
748 failrec
= (struct io_failure_record
*)(unsigned long)private;
750 num_copies
= btrfs_num_copies(
751 &BTRFS_I(inode
)->root
->fs_info
->mapping_tree
,
752 failrec
->logical
, failrec
->len
);
753 failrec
->last_mirror
++;
755 spin_lock_irq(&BTRFS_I(inode
)->io_tree
.lock
);
756 state
= find_first_extent_bit_state(&BTRFS_I(inode
)->io_tree
,
759 if (state
&& state
->start
!= failrec
->start
)
761 spin_unlock_irq(&BTRFS_I(inode
)->io_tree
.lock
);
763 if (!state
|| failrec
->last_mirror
> num_copies
) {
764 set_state_private(failure_tree
, failrec
->start
, 0);
765 clear_extent_bits(failure_tree
, failrec
->start
,
766 failrec
->start
+ failrec
->len
- 1,
767 EXTENT_LOCKED
| EXTENT_DIRTY
, GFP_NOFS
);
771 bio
= bio_alloc(GFP_NOFS
, 1);
772 bio
->bi_private
= state
;
773 bio
->bi_end_io
= failed_bio
->bi_end_io
;
774 bio
->bi_sector
= failrec
->logical
>> 9;
775 bio
->bi_bdev
= failed_bio
->bi_bdev
;
777 bio_add_page(bio
, page
, failrec
->len
, start
- page_offset(page
));
778 if (failed_bio
->bi_rw
& (1 << BIO_RW
))
783 BTRFS_I(inode
)->io_tree
.ops
->submit_bio_hook(inode
, rw
, bio
,
784 failrec
->last_mirror
);
789 * each time an IO finishes, we do a fast check in the IO failure tree
790 * to see if we need to process or clean up an io_failure_record
792 int btrfs_clean_io_failures(struct inode
*inode
, u64 start
)
796 struct io_failure_record
*failure
;
800 if (count_range_bits(&BTRFS_I(inode
)->io_failure_tree
, &private,
801 (u64
)-1, 1, EXTENT_DIRTY
)) {
802 ret
= get_state_private(&BTRFS_I(inode
)->io_failure_tree
,
803 start
, &private_failure
);
805 failure
= (struct io_failure_record
*)(unsigned long)
807 set_state_private(&BTRFS_I(inode
)->io_failure_tree
,
809 clear_extent_bits(&BTRFS_I(inode
)->io_failure_tree
,
811 failure
->start
+ failure
->len
- 1,
812 EXTENT_DIRTY
| EXTENT_LOCKED
,
821 * when reads are done, we need to check csums to verify the data is correct
822 * if there's a match, we allow the bio to finish. If not, we go through
823 * the io_failure_record routines to find good copies
825 int btrfs_readpage_end_io_hook(struct page
*page
, u64 start
, u64 end
,
826 struct extent_state
*state
)
828 size_t offset
= start
- ((u64
)page
->index
<< PAGE_CACHE_SHIFT
);
829 struct inode
*inode
= page
->mapping
->host
;
830 struct extent_io_tree
*io_tree
= &BTRFS_I(inode
)->io_tree
;
832 u64
private = ~(u32
)0;
834 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
838 if (btrfs_test_opt(root
, NODATASUM
) ||
839 btrfs_test_flag(inode
, NODATASUM
))
841 if (state
&& state
->start
== start
) {
842 private = state
->private;
845 ret
= get_state_private(io_tree
, start
, &private);
847 local_irq_save(flags
);
848 kaddr
= kmap_atomic(page
, KM_IRQ0
);
852 csum
= btrfs_csum_data(root
, kaddr
+ offset
, csum
, end
- start
+ 1);
853 btrfs_csum_final(csum
, (char *)&csum
);
854 if (csum
!= private) {
857 kunmap_atomic(kaddr
, KM_IRQ0
);
858 local_irq_restore(flags
);
860 /* if the io failure tree for this inode is non-empty,
861 * check to see if we've recovered from a failed IO
863 btrfs_clean_io_failures(inode
, start
);
867 printk("btrfs csum failed ino %lu off %llu csum %u private %Lu\n",
868 page
->mapping
->host
->i_ino
, (unsigned long long)start
, csum
,
870 memset(kaddr
+ offset
, 1, end
- start
+ 1);
871 flush_dcache_page(page
);
872 kunmap_atomic(kaddr
, KM_IRQ0
);
873 local_irq_restore(flags
);
880 * This creates an orphan entry for the given inode in case something goes
881 * wrong in the middle of an unlink/truncate.
883 int btrfs_orphan_add(struct btrfs_trans_handle
*trans
, struct inode
*inode
)
885 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
888 spin_lock(&root
->list_lock
);
890 /* already on the orphan list, we're good */
891 if (!list_empty(&BTRFS_I(inode
)->i_orphan
)) {
892 spin_unlock(&root
->list_lock
);
896 list_add(&BTRFS_I(inode
)->i_orphan
, &root
->orphan_list
);
898 spin_unlock(&root
->list_lock
);
901 * insert an orphan item to track this unlinked/truncated file
903 ret
= btrfs_insert_orphan_item(trans
, root
, inode
->i_ino
);
909 * We have done the truncate/delete so we can go ahead and remove the orphan
910 * item for this particular inode.
912 int btrfs_orphan_del(struct btrfs_trans_handle
*trans
, struct inode
*inode
)
914 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
917 spin_lock(&root
->list_lock
);
919 if (list_empty(&BTRFS_I(inode
)->i_orphan
)) {
920 spin_unlock(&root
->list_lock
);
924 list_del_init(&BTRFS_I(inode
)->i_orphan
);
926 spin_unlock(&root
->list_lock
);
930 spin_unlock(&root
->list_lock
);
932 ret
= btrfs_del_orphan_item(trans
, root
, inode
->i_ino
);
938 * this cleans up any orphans that may be left on the list from the last use
941 void btrfs_orphan_cleanup(struct btrfs_root
*root
)
943 struct btrfs_path
*path
;
944 struct extent_buffer
*leaf
;
945 struct btrfs_item
*item
;
946 struct btrfs_key key
, found_key
;
947 struct btrfs_trans_handle
*trans
;
949 int ret
= 0, nr_unlink
= 0, nr_truncate
= 0;
951 /* don't do orphan cleanup if the fs is readonly. */
952 if (root
->fs_info
->sb
->s_flags
& MS_RDONLY
)
955 path
= btrfs_alloc_path();
960 key
.objectid
= BTRFS_ORPHAN_OBJECTID
;
961 btrfs_set_key_type(&key
, BTRFS_ORPHAN_ITEM_KEY
);
962 key
.offset
= (u64
)-1;
966 ret
= btrfs_search_slot(NULL
, root
, &key
, path
, 0, 0);
968 printk(KERN_ERR
"Error searching slot for orphan: %d"
974 * if ret == 0 means we found what we were searching for, which
975 * is weird, but possible, so only screw with path if we didnt
976 * find the key and see if we have stuff that matches
979 if (path
->slots
[0] == 0)
984 /* pull out the item */
985 leaf
= path
->nodes
[0];
986 item
= btrfs_item_nr(leaf
, path
->slots
[0]);
987 btrfs_item_key_to_cpu(leaf
, &found_key
, path
->slots
[0]);
989 /* make sure the item matches what we want */
990 if (found_key
.objectid
!= BTRFS_ORPHAN_OBJECTID
)
992 if (btrfs_key_type(&found_key
) != BTRFS_ORPHAN_ITEM_KEY
)
995 /* release the path since we're done with it */
996 btrfs_release_path(root
, path
);
999 * this is where we are basically btrfs_lookup, without the
1000 * crossing root thing. we store the inode number in the
1001 * offset of the orphan item.
1003 inode
= btrfs_iget_locked(root
->fs_info
->sb
,
1004 found_key
.offset
, root
);
1008 if (inode
->i_state
& I_NEW
) {
1009 BTRFS_I(inode
)->root
= root
;
1011 /* have to set the location manually */
1012 BTRFS_I(inode
)->location
.objectid
= inode
->i_ino
;
1013 BTRFS_I(inode
)->location
.type
= BTRFS_INODE_ITEM_KEY
;
1014 BTRFS_I(inode
)->location
.offset
= 0;
1016 btrfs_read_locked_inode(inode
);
1017 unlock_new_inode(inode
);
1021 * add this inode to the orphan list so btrfs_orphan_del does
1022 * the proper thing when we hit it
1024 spin_lock(&root
->list_lock
);
1025 list_add(&BTRFS_I(inode
)->i_orphan
, &root
->orphan_list
);
1026 spin_unlock(&root
->list_lock
);
1029 * if this is a bad inode, means we actually succeeded in
1030 * removing the inode, but not the orphan record, which means
1031 * we need to manually delete the orphan since iput will just
1032 * do a destroy_inode
1034 if (is_bad_inode(inode
)) {
1035 trans
= btrfs_start_transaction(root
, 1);
1036 btrfs_orphan_del(trans
, inode
);
1037 btrfs_end_transaction(trans
, root
);
1042 /* if we have links, this was a truncate, lets do that */
1043 if (inode
->i_nlink
) {
1045 btrfs_truncate(inode
);
1050 /* this will do delete_inode and everything for us */
1055 printk(KERN_INFO
"btrfs: unlinked %d orphans\n", nr_unlink
);
1057 printk(KERN_INFO
"btrfs: truncated %d orphans\n", nr_truncate
);
1059 btrfs_free_path(path
);
1063 * read an inode from the btree into the in-memory inode
1065 void btrfs_read_locked_inode(struct inode
*inode
)
1067 struct btrfs_path
*path
;
1068 struct extent_buffer
*leaf
;
1069 struct btrfs_inode_item
*inode_item
;
1070 struct btrfs_timespec
*tspec
;
1071 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
1072 struct btrfs_key location
;
1073 u64 alloc_group_block
;
1077 path
= btrfs_alloc_path();
1079 memcpy(&location
, &BTRFS_I(inode
)->location
, sizeof(location
));
1081 ret
= btrfs_lookup_inode(NULL
, root
, path
, &location
, 0);
1085 leaf
= path
->nodes
[0];
1086 inode_item
= btrfs_item_ptr(leaf
, path
->slots
[0],
1087 struct btrfs_inode_item
);
1089 inode
->i_mode
= btrfs_inode_mode(leaf
, inode_item
);
1090 inode
->i_nlink
= btrfs_inode_nlink(leaf
, inode_item
);
1091 inode
->i_uid
= btrfs_inode_uid(leaf
, inode_item
);
1092 inode
->i_gid
= btrfs_inode_gid(leaf
, inode_item
);
1093 btrfs_i_size_write(inode
, btrfs_inode_size(leaf
, inode_item
));
1095 tspec
= btrfs_inode_atime(inode_item
);
1096 inode
->i_atime
.tv_sec
= btrfs_timespec_sec(leaf
, tspec
);
1097 inode
->i_atime
.tv_nsec
= btrfs_timespec_nsec(leaf
, tspec
);
1099 tspec
= btrfs_inode_mtime(inode_item
);
1100 inode
->i_mtime
.tv_sec
= btrfs_timespec_sec(leaf
, tspec
);
1101 inode
->i_mtime
.tv_nsec
= btrfs_timespec_nsec(leaf
, tspec
);
1103 tspec
= btrfs_inode_ctime(inode_item
);
1104 inode
->i_ctime
.tv_sec
= btrfs_timespec_sec(leaf
, tspec
);
1105 inode
->i_ctime
.tv_nsec
= btrfs_timespec_nsec(leaf
, tspec
);
1107 inode_set_bytes(inode
, btrfs_inode_nbytes(leaf
, inode_item
));
1108 BTRFS_I(inode
)->generation
= btrfs_inode_generation(leaf
, inode_item
);
1109 inode
->i_generation
= BTRFS_I(inode
)->generation
;
1111 rdev
= btrfs_inode_rdev(leaf
, inode_item
);
1113 BTRFS_I(inode
)->index_cnt
= (u64
)-1;
1115 alloc_group_block
= btrfs_inode_block_group(leaf
, inode_item
);
1116 BTRFS_I(inode
)->block_group
= btrfs_lookup_block_group(root
->fs_info
,
1118 BTRFS_I(inode
)->flags
= btrfs_inode_flags(leaf
, inode_item
);
1119 if (!BTRFS_I(inode
)->block_group
) {
1120 BTRFS_I(inode
)->block_group
= btrfs_find_block_group(root
,
1122 BTRFS_BLOCK_GROUP_METADATA
, 0);
1124 btrfs_free_path(path
);
1127 switch (inode
->i_mode
& S_IFMT
) {
1129 inode
->i_mapping
->a_ops
= &btrfs_aops
;
1130 inode
->i_mapping
->backing_dev_info
= &root
->fs_info
->bdi
;
1131 BTRFS_I(inode
)->io_tree
.ops
= &btrfs_extent_io_ops
;
1132 inode
->i_fop
= &btrfs_file_operations
;
1133 inode
->i_op
= &btrfs_file_inode_operations
;
1136 inode
->i_fop
= &btrfs_dir_file_operations
;
1137 if (root
== root
->fs_info
->tree_root
)
1138 inode
->i_op
= &btrfs_dir_ro_inode_operations
;
1140 inode
->i_op
= &btrfs_dir_inode_operations
;
1143 inode
->i_op
= &btrfs_symlink_inode_operations
;
1144 inode
->i_mapping
->a_ops
= &btrfs_symlink_aops
;
1145 inode
->i_mapping
->backing_dev_info
= &root
->fs_info
->bdi
;
1148 init_special_inode(inode
, inode
->i_mode
, rdev
);
1154 btrfs_free_path(path
);
1155 make_bad_inode(inode
);
1159 * given a leaf and an inode, copy the inode fields into the leaf
1161 static void fill_inode_item(struct btrfs_trans_handle
*trans
,
1162 struct extent_buffer
*leaf
,
1163 struct btrfs_inode_item
*item
,
1164 struct inode
*inode
)
1166 btrfs_set_inode_uid(leaf
, item
, inode
->i_uid
);
1167 btrfs_set_inode_gid(leaf
, item
, inode
->i_gid
);
1168 btrfs_set_inode_size(leaf
, item
, BTRFS_I(inode
)->disk_i_size
);
1169 btrfs_set_inode_mode(leaf
, item
, inode
->i_mode
);
1170 btrfs_set_inode_nlink(leaf
, item
, inode
->i_nlink
);
1172 btrfs_set_timespec_sec(leaf
, btrfs_inode_atime(item
),
1173 inode
->i_atime
.tv_sec
);
1174 btrfs_set_timespec_nsec(leaf
, btrfs_inode_atime(item
),
1175 inode
->i_atime
.tv_nsec
);
1177 btrfs_set_timespec_sec(leaf
, btrfs_inode_mtime(item
),
1178 inode
->i_mtime
.tv_sec
);
1179 btrfs_set_timespec_nsec(leaf
, btrfs_inode_mtime(item
),
1180 inode
->i_mtime
.tv_nsec
);
1182 btrfs_set_timespec_sec(leaf
, btrfs_inode_ctime(item
),
1183 inode
->i_ctime
.tv_sec
);
1184 btrfs_set_timespec_nsec(leaf
, btrfs_inode_ctime(item
),
1185 inode
->i_ctime
.tv_nsec
);
1187 btrfs_set_inode_nbytes(leaf
, item
, inode_get_bytes(inode
));
1188 btrfs_set_inode_generation(leaf
, item
, BTRFS_I(inode
)->generation
);
1189 btrfs_set_inode_transid(leaf
, item
, trans
->transid
);
1190 btrfs_set_inode_rdev(leaf
, item
, inode
->i_rdev
);
1191 btrfs_set_inode_flags(leaf
, item
, BTRFS_I(inode
)->flags
);
1192 btrfs_set_inode_block_group(leaf
, item
,
1193 BTRFS_I(inode
)->block_group
->key
.objectid
);
1197 * copy everything in the in-memory inode into the btree.
1199 int noinline
btrfs_update_inode(struct btrfs_trans_handle
*trans
,
1200 struct btrfs_root
*root
,
1201 struct inode
*inode
)
1203 struct btrfs_inode_item
*inode_item
;
1204 struct btrfs_path
*path
;
1205 struct extent_buffer
*leaf
;
1208 path
= btrfs_alloc_path();
1210 ret
= btrfs_lookup_inode(trans
, root
, path
,
1211 &BTRFS_I(inode
)->location
, 1);
1218 leaf
= path
->nodes
[0];
1219 inode_item
= btrfs_item_ptr(leaf
, path
->slots
[0],
1220 struct btrfs_inode_item
);
1222 fill_inode_item(trans
, leaf
, inode_item
, inode
);
1223 btrfs_mark_buffer_dirty(leaf
);
1224 btrfs_set_inode_last_trans(trans
, inode
);
1227 btrfs_free_path(path
);
1233 * unlink helper that gets used here in inode.c and in the tree logging
1234 * recovery code. It remove a link in a directory with a given name, and
1235 * also drops the back refs in the inode to the directory
1237 int btrfs_unlink_inode(struct btrfs_trans_handle
*trans
,
1238 struct btrfs_root
*root
,
1239 struct inode
*dir
, struct inode
*inode
,
1240 const char *name
, int name_len
)
1242 struct btrfs_path
*path
;
1244 struct extent_buffer
*leaf
;
1245 struct btrfs_dir_item
*di
;
1246 struct btrfs_key key
;
1249 path
= btrfs_alloc_path();
1255 di
= btrfs_lookup_dir_item(trans
, root
, path
, dir
->i_ino
,
1256 name
, name_len
, -1);
1265 leaf
= path
->nodes
[0];
1266 btrfs_dir_item_key_to_cpu(leaf
, di
, &key
);
1267 ret
= btrfs_delete_one_dir_name(trans
, root
, path
, di
);
1270 btrfs_release_path(root
, path
);
1272 ret
= btrfs_del_inode_ref(trans
, root
, name
, name_len
,
1274 dir
->i_ino
, &index
);
1276 printk("failed to delete reference to %.*s, "
1277 "inode %lu parent %lu\n", name_len
, name
,
1278 inode
->i_ino
, dir
->i_ino
);
1282 di
= btrfs_lookup_dir_index_item(trans
, root
, path
, dir
->i_ino
,
1283 index
, name
, name_len
, -1);
1292 ret
= btrfs_delete_one_dir_name(trans
, root
, path
, di
);
1293 btrfs_release_path(root
, path
);
1295 ret
= btrfs_del_inode_ref_in_log(trans
, root
, name
, name_len
,
1297 BUG_ON(ret
!= 0 && ret
!= -ENOENT
);
1299 BTRFS_I(dir
)->log_dirty_trans
= trans
->transid
;
1301 ret
= btrfs_del_dir_entries_in_log(trans
, root
, name
, name_len
,
1305 btrfs_free_path(path
);
1309 btrfs_i_size_write(dir
, dir
->i_size
- name_len
* 2);
1310 inode
->i_ctime
= dir
->i_mtime
= dir
->i_ctime
= CURRENT_TIME
;
1311 btrfs_update_inode(trans
, root
, dir
);
1312 btrfs_drop_nlink(inode
);
1313 ret
= btrfs_update_inode(trans
, root
, inode
);
1314 dir
->i_sb
->s_dirt
= 1;
1319 static int btrfs_unlink(struct inode
*dir
, struct dentry
*dentry
)
1321 struct btrfs_root
*root
;
1322 struct btrfs_trans_handle
*trans
;
1323 struct inode
*inode
= dentry
->d_inode
;
1325 unsigned long nr
= 0;
1327 root
= BTRFS_I(dir
)->root
;
1329 ret
= btrfs_check_free_space(root
, 1, 1);
1333 trans
= btrfs_start_transaction(root
, 1);
1335 btrfs_set_trans_block_group(trans
, dir
);
1336 ret
= btrfs_unlink_inode(trans
, root
, dir
, dentry
->d_inode
,
1337 dentry
->d_name
.name
, dentry
->d_name
.len
);
1339 if (inode
->i_nlink
== 0)
1340 ret
= btrfs_orphan_add(trans
, inode
);
1342 nr
= trans
->blocks_used
;
1344 btrfs_end_transaction_throttle(trans
, root
);
1346 btrfs_btree_balance_dirty(root
, nr
);
1350 static int btrfs_rmdir(struct inode
*dir
, struct dentry
*dentry
)
1352 struct inode
*inode
= dentry
->d_inode
;
1355 struct btrfs_root
*root
= BTRFS_I(dir
)->root
;
1356 struct btrfs_trans_handle
*trans
;
1357 unsigned long nr
= 0;
1359 if (inode
->i_size
> BTRFS_EMPTY_DIR_SIZE
) {
1363 ret
= btrfs_check_free_space(root
, 1, 1);
1367 trans
= btrfs_start_transaction(root
, 1);
1368 btrfs_set_trans_block_group(trans
, dir
);
1370 err
= btrfs_orphan_add(trans
, inode
);
1374 /* now the directory is empty */
1375 err
= btrfs_unlink_inode(trans
, root
, dir
, dentry
->d_inode
,
1376 dentry
->d_name
.name
, dentry
->d_name
.len
);
1378 btrfs_i_size_write(inode
, 0);
1382 nr
= trans
->blocks_used
;
1383 ret
= btrfs_end_transaction_throttle(trans
, root
);
1385 btrfs_btree_balance_dirty(root
, nr
);
1393 * when truncating bytes in a file, it is possible to avoid reading
1394 * the leaves that contain only checksum items. This can be the
1395 * majority of the IO required to delete a large file, but it must
1396 * be done carefully.
1398 * The keys in the level just above the leaves are checked to make sure
1399 * the lowest key in a given leaf is a csum key, and starts at an offset
1400 * after the new size.
1402 * Then the key for the next leaf is checked to make sure it also has
1403 * a checksum item for the same file. If it does, we know our target leaf
1404 * contains only checksum items, and it can be safely freed without reading
1407 * This is just an optimization targeted at large files. It may do
1408 * nothing. It will return 0 unless things went badly.
1410 static noinline
int drop_csum_leaves(struct btrfs_trans_handle
*trans
,
1411 struct btrfs_root
*root
,
1412 struct btrfs_path
*path
,
1413 struct inode
*inode
, u64 new_size
)
1415 struct btrfs_key key
;
1418 struct btrfs_key found_key
;
1419 struct btrfs_key other_key
;
1421 path
->lowest_level
= 1;
1422 key
.objectid
= inode
->i_ino
;
1423 key
.type
= BTRFS_CSUM_ITEM_KEY
;
1424 key
.offset
= new_size
;
1426 ret
= btrfs_search_slot(trans
, root
, &key
, path
, -1, 1);
1430 if (path
->nodes
[1] == NULL
) {
1435 btrfs_node_key_to_cpu(path
->nodes
[1], &found_key
, path
->slots
[1]);
1436 nritems
= btrfs_header_nritems(path
->nodes
[1]);
1441 if (path
->slots
[1] >= nritems
)
1444 /* did we find a key greater than anything we want to delete? */
1445 if (found_key
.objectid
> inode
->i_ino
||
1446 (found_key
.objectid
== inode
->i_ino
&& found_key
.type
> key
.type
))
1449 /* we check the next key in the node to make sure the leave contains
1450 * only checksum items. This comparison doesn't work if our
1451 * leaf is the last one in the node
1453 if (path
->slots
[1] + 1 >= nritems
) {
1455 /* search forward from the last key in the node, this
1456 * will bring us into the next node in the tree
1458 btrfs_node_key_to_cpu(path
->nodes
[1], &found_key
, nritems
- 1);
1460 /* unlikely, but we inc below, so check to be safe */
1461 if (found_key
.offset
== (u64
)-1)
1464 /* search_forward needs a path with locks held, do the
1465 * search again for the original key. It is possible
1466 * this will race with a balance and return a path that
1467 * we could modify, but this drop is just an optimization
1468 * and is allowed to miss some leaves.
1470 btrfs_release_path(root
, path
);
1473 /* setup a max key for search_forward */
1474 other_key
.offset
= (u64
)-1;
1475 other_key
.type
= key
.type
;
1476 other_key
.objectid
= key
.objectid
;
1478 path
->keep_locks
= 1;
1479 ret
= btrfs_search_forward(root
, &found_key
, &other_key
,
1481 path
->keep_locks
= 0;
1482 if (ret
|| found_key
.objectid
!= key
.objectid
||
1483 found_key
.type
!= key
.type
) {
1488 key
.offset
= found_key
.offset
;
1489 btrfs_release_path(root
, path
);
1494 /* we know there's one more slot after us in the tree,
1495 * read that key so we can verify it is also a checksum item
1497 btrfs_node_key_to_cpu(path
->nodes
[1], &other_key
, path
->slots
[1] + 1);
1499 if (found_key
.objectid
< inode
->i_ino
)
1502 if (found_key
.type
!= key
.type
|| found_key
.offset
< new_size
)
1506 * if the key for the next leaf isn't a csum key from this objectid,
1507 * we can't be sure there aren't good items inside this leaf.
1510 if (other_key
.objectid
!= inode
->i_ino
|| other_key
.type
!= key
.type
)
1514 * it is safe to delete this leaf, it contains only
1515 * csum items from this inode at an offset >= new_size
1517 ret
= btrfs_del_leaf(trans
, root
, path
,
1518 btrfs_node_blockptr(path
->nodes
[1],
1523 btrfs_release_path(root
, path
);
1525 if (other_key
.objectid
== inode
->i_ino
&&
1526 other_key
.type
== key
.type
&& other_key
.offset
> key
.offset
) {
1527 key
.offset
= other_key
.offset
;
1533 /* fixup any changes we've made to the path */
1534 path
->lowest_level
= 0;
1535 path
->keep_locks
= 0;
1536 btrfs_release_path(root
, path
);
1541 * this can truncate away extent items, csum items and directory items.
1542 * It starts at a high offset and removes keys until it can't find
1543 * any higher than new_size
1545 * csum items that cross the new i_size are truncated to the new size
1548 * min_type is the minimum key type to truncate down to. If set to 0, this
1549 * will kill all the items on this inode, including the INODE_ITEM_KEY.
1551 noinline
int btrfs_truncate_inode_items(struct btrfs_trans_handle
*trans
,
1552 struct btrfs_root
*root
,
1553 struct inode
*inode
,
1554 u64 new_size
, u32 min_type
)
1557 struct btrfs_path
*path
;
1558 struct btrfs_key key
;
1559 struct btrfs_key found_key
;
1561 struct extent_buffer
*leaf
;
1562 struct btrfs_file_extent_item
*fi
;
1563 u64 extent_start
= 0;
1564 u64 extent_num_bytes
= 0;
1570 int pending_del_nr
= 0;
1571 int pending_del_slot
= 0;
1572 int extent_type
= -1;
1573 u64 mask
= root
->sectorsize
- 1;
1576 btrfs_drop_extent_cache(inode
, new_size
& (~mask
), (u64
)-1, 0);
1577 path
= btrfs_alloc_path();
1581 /* FIXME, add redo link to tree so we don't leak on crash */
1582 key
.objectid
= inode
->i_ino
;
1583 key
.offset
= (u64
)-1;
1586 btrfs_init_path(path
);
1588 ret
= drop_csum_leaves(trans
, root
, path
, inode
, new_size
);
1592 ret
= btrfs_search_slot(trans
, root
, &key
, path
, -1, 1);
1597 /* there are no items in the tree for us to truncate, we're
1600 if (path
->slots
[0] == 0) {
1609 leaf
= path
->nodes
[0];
1610 btrfs_item_key_to_cpu(leaf
, &found_key
, path
->slots
[0]);
1611 found_type
= btrfs_key_type(&found_key
);
1613 if (found_key
.objectid
!= inode
->i_ino
)
1616 if (found_type
< min_type
)
1619 item_end
= found_key
.offset
;
1620 if (found_type
== BTRFS_EXTENT_DATA_KEY
) {
1621 fi
= btrfs_item_ptr(leaf
, path
->slots
[0],
1622 struct btrfs_file_extent_item
);
1623 extent_type
= btrfs_file_extent_type(leaf
, fi
);
1624 if (extent_type
!= BTRFS_FILE_EXTENT_INLINE
) {
1626 btrfs_file_extent_num_bytes(leaf
, fi
);
1627 } else if (extent_type
== BTRFS_FILE_EXTENT_INLINE
) {
1628 struct btrfs_item
*item
= btrfs_item_nr(leaf
,
1630 item_end
+= btrfs_file_extent_inline_len(leaf
,
1635 if (found_type
== BTRFS_CSUM_ITEM_KEY
) {
1636 ret
= btrfs_csum_truncate(trans
, root
, path
,
1640 if (item_end
< new_size
) {
1641 if (found_type
== BTRFS_DIR_ITEM_KEY
) {
1642 found_type
= BTRFS_INODE_ITEM_KEY
;
1643 } else if (found_type
== BTRFS_EXTENT_ITEM_KEY
) {
1644 found_type
= BTRFS_CSUM_ITEM_KEY
;
1645 } else if (found_type
== BTRFS_EXTENT_DATA_KEY
) {
1646 found_type
= BTRFS_XATTR_ITEM_KEY
;
1647 } else if (found_type
== BTRFS_XATTR_ITEM_KEY
) {
1648 found_type
= BTRFS_INODE_REF_KEY
;
1649 } else if (found_type
) {
1654 btrfs_set_key_type(&key
, found_type
);
1657 if (found_key
.offset
>= new_size
)
1663 /* FIXME, shrink the extent if the ref count is only 1 */
1664 if (found_type
!= BTRFS_EXTENT_DATA_KEY
)
1667 if (extent_type
!= BTRFS_FILE_EXTENT_INLINE
) {
1669 extent_start
= btrfs_file_extent_disk_bytenr(leaf
, fi
);
1671 u64 orig_num_bytes
=
1672 btrfs_file_extent_num_bytes(leaf
, fi
);
1673 extent_num_bytes
= new_size
-
1674 found_key
.offset
+ root
->sectorsize
- 1;
1675 extent_num_bytes
= extent_num_bytes
&
1676 ~((u64
)root
->sectorsize
- 1);
1677 btrfs_set_file_extent_num_bytes(leaf
, fi
,
1679 num_dec
= (orig_num_bytes
-
1681 if (root
->ref_cows
&& extent_start
!= 0)
1682 inode_sub_bytes(inode
, num_dec
);
1683 btrfs_mark_buffer_dirty(leaf
);
1686 btrfs_file_extent_disk_num_bytes(leaf
,
1688 /* FIXME blocksize != 4096 */
1689 num_dec
= btrfs_file_extent_num_bytes(leaf
, fi
);
1690 if (extent_start
!= 0) {
1693 inode_sub_bytes(inode
, num_dec
);
1695 root_gen
= btrfs_header_generation(leaf
);
1696 root_owner
= btrfs_header_owner(leaf
);
1698 } else if (extent_type
== BTRFS_FILE_EXTENT_INLINE
) {
1700 u32 size
= new_size
- found_key
.offset
;
1702 if (root
->ref_cows
) {
1703 inode_sub_bytes(inode
, item_end
+ 1 -
1707 btrfs_file_extent_calc_inline_size(size
);
1708 ret
= btrfs_truncate_item(trans
, root
, path
,
1711 } else if (root
->ref_cows
) {
1712 inode_sub_bytes(inode
, item_end
+ 1 -
1718 if (!pending_del_nr
) {
1719 /* no pending yet, add ourselves */
1720 pending_del_slot
= path
->slots
[0];
1722 } else if (pending_del_nr
&&
1723 path
->slots
[0] + 1 == pending_del_slot
) {
1724 /* hop on the pending chunk */
1726 pending_del_slot
= path
->slots
[0];
1728 printk("bad pending slot %d pending_del_nr %d pending_del_slot %d\n", path
->slots
[0], pending_del_nr
, pending_del_slot
);
1734 ret
= btrfs_free_extent(trans
, root
, extent_start
,
1736 leaf
->start
, root_owner
,
1737 root_gen
, inode
->i_ino
,
1738 found_key
.offset
, 0);
1742 if (path
->slots
[0] == 0) {
1745 btrfs_release_path(root
, path
);
1750 if (pending_del_nr
&&
1751 path
->slots
[0] + 1 != pending_del_slot
) {
1752 struct btrfs_key debug
;
1754 btrfs_item_key_to_cpu(path
->nodes
[0], &debug
,
1756 ret
= btrfs_del_items(trans
, root
, path
,
1761 btrfs_release_path(root
, path
);
1767 if (pending_del_nr
) {
1768 ret
= btrfs_del_items(trans
, root
, path
, pending_del_slot
,
1771 btrfs_free_path(path
);
1772 inode
->i_sb
->s_dirt
= 1;
1777 * taken from block_truncate_page, but does cow as it zeros out
1778 * any bytes left in the last page in the file.
1780 static int btrfs_truncate_page(struct address_space
*mapping
, loff_t from
)
1782 struct inode
*inode
= mapping
->host
;
1783 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
1784 struct extent_io_tree
*io_tree
= &BTRFS_I(inode
)->io_tree
;
1785 struct btrfs_ordered_extent
*ordered
;
1787 u32 blocksize
= root
->sectorsize
;
1788 pgoff_t index
= from
>> PAGE_CACHE_SHIFT
;
1789 unsigned offset
= from
& (PAGE_CACHE_SIZE
-1);
1795 if ((offset
& (blocksize
- 1)) == 0)
1800 page
= grab_cache_page(mapping
, index
);
1804 page_start
= page_offset(page
);
1805 page_end
= page_start
+ PAGE_CACHE_SIZE
- 1;
1807 if (!PageUptodate(page
)) {
1808 ret
= btrfs_readpage(NULL
, page
);
1810 if (page
->mapping
!= mapping
) {
1812 page_cache_release(page
);
1815 if (!PageUptodate(page
)) {
1820 wait_on_page_writeback(page
);
1822 lock_extent(io_tree
, page_start
, page_end
, GFP_NOFS
);
1823 set_page_extent_mapped(page
);
1825 ordered
= btrfs_lookup_ordered_extent(inode
, page_start
);
1827 unlock_extent(io_tree
, page_start
, page_end
, GFP_NOFS
);
1829 page_cache_release(page
);
1830 btrfs_start_ordered_extent(inode
, ordered
, 1);
1831 btrfs_put_ordered_extent(ordered
);
1835 btrfs_set_extent_delalloc(inode
, page_start
, page_end
);
1837 if (offset
!= PAGE_CACHE_SIZE
) {
1839 memset(kaddr
+ offset
, 0, PAGE_CACHE_SIZE
- offset
);
1840 flush_dcache_page(page
);
1843 ClearPageChecked(page
);
1844 set_page_dirty(page
);
1845 unlock_extent(io_tree
, page_start
, page_end
, GFP_NOFS
);
1849 page_cache_release(page
);
1854 static int btrfs_setattr(struct dentry
*dentry
, struct iattr
*attr
)
1856 struct inode
*inode
= dentry
->d_inode
;
1859 err
= inode_change_ok(inode
, attr
);
1863 if (S_ISREG(inode
->i_mode
) &&
1864 attr
->ia_valid
& ATTR_SIZE
&& attr
->ia_size
> inode
->i_size
) {
1865 struct btrfs_trans_handle
*trans
;
1866 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
1867 struct extent_io_tree
*io_tree
= &BTRFS_I(inode
)->io_tree
;
1869 u64 mask
= root
->sectorsize
- 1;
1870 u64 hole_start
= (inode
->i_size
+ mask
) & ~mask
;
1871 u64 block_end
= (attr
->ia_size
+ mask
) & ~mask
;
1875 if (attr
->ia_size
<= hole_start
)
1878 err
= btrfs_check_free_space(root
, 1, 0);
1882 btrfs_truncate_page(inode
->i_mapping
, inode
->i_size
);
1884 hole_size
= block_end
- hole_start
;
1886 struct btrfs_ordered_extent
*ordered
;
1887 btrfs_wait_ordered_range(inode
, hole_start
, hole_size
);
1889 lock_extent(io_tree
, hole_start
, block_end
- 1, GFP_NOFS
);
1890 ordered
= btrfs_lookup_ordered_extent(inode
, hole_start
);
1892 unlock_extent(io_tree
, hole_start
,
1893 block_end
- 1, GFP_NOFS
);
1894 btrfs_put_ordered_extent(ordered
);
1900 trans
= btrfs_start_transaction(root
, 1);
1901 btrfs_set_trans_block_group(trans
, inode
);
1902 mutex_lock(&BTRFS_I(inode
)->extent_mutex
);
1903 err
= btrfs_drop_extents(trans
, root
, inode
,
1904 hole_start
, block_end
, hole_start
,
1907 if (alloc_hint
!= EXTENT_MAP_INLINE
) {
1908 err
= btrfs_insert_file_extent(trans
, root
,
1912 btrfs_drop_extent_cache(inode
, hole_start
,
1914 btrfs_check_file(root
, inode
);
1916 mutex_unlock(&BTRFS_I(inode
)->extent_mutex
);
1917 btrfs_end_transaction(trans
, root
);
1918 unlock_extent(io_tree
, hole_start
, block_end
- 1, GFP_NOFS
);
1923 err
= inode_setattr(inode
, attr
);
1925 if (!err
&& ((attr
->ia_valid
& ATTR_MODE
)))
1926 err
= btrfs_acl_chmod(inode
);
1931 void btrfs_delete_inode(struct inode
*inode
)
1933 struct btrfs_trans_handle
*trans
;
1934 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
1938 truncate_inode_pages(&inode
->i_data
, 0);
1939 if (is_bad_inode(inode
)) {
1940 btrfs_orphan_del(NULL
, inode
);
1943 btrfs_wait_ordered_range(inode
, 0, (u64
)-1);
1945 btrfs_i_size_write(inode
, 0);
1946 trans
= btrfs_start_transaction(root
, 1);
1948 btrfs_set_trans_block_group(trans
, inode
);
1949 ret
= btrfs_truncate_inode_items(trans
, root
, inode
, inode
->i_size
, 0);
1951 btrfs_orphan_del(NULL
, inode
);
1952 goto no_delete_lock
;
1955 btrfs_orphan_del(trans
, inode
);
1957 nr
= trans
->blocks_used
;
1960 btrfs_end_transaction(trans
, root
);
1961 btrfs_btree_balance_dirty(root
, nr
);
1965 nr
= trans
->blocks_used
;
1966 btrfs_end_transaction(trans
, root
);
1967 btrfs_btree_balance_dirty(root
, nr
);
1973 * this returns the key found in the dir entry in the location pointer.
1974 * If no dir entries were found, location->objectid is 0.
1976 static int btrfs_inode_by_name(struct inode
*dir
, struct dentry
*dentry
,
1977 struct btrfs_key
*location
)
1979 const char *name
= dentry
->d_name
.name
;
1980 int namelen
= dentry
->d_name
.len
;
1981 struct btrfs_dir_item
*di
;
1982 struct btrfs_path
*path
;
1983 struct btrfs_root
*root
= BTRFS_I(dir
)->root
;
1986 path
= btrfs_alloc_path();
1989 di
= btrfs_lookup_dir_item(NULL
, root
, path
, dir
->i_ino
, name
,
1993 if (!di
|| IS_ERR(di
)) {
1996 btrfs_dir_item_key_to_cpu(path
->nodes
[0], di
, location
);
1998 btrfs_free_path(path
);
2001 location
->objectid
= 0;
2006 * when we hit a tree root in a directory, the btrfs part of the inode
2007 * needs to be changed to reflect the root directory of the tree root. This
2008 * is kind of like crossing a mount point.
2010 static int fixup_tree_root_location(struct btrfs_root
*root
,
2011 struct btrfs_key
*location
,
2012 struct btrfs_root
**sub_root
,
2013 struct dentry
*dentry
)
2015 struct btrfs_root_item
*ri
;
2017 if (btrfs_key_type(location
) != BTRFS_ROOT_ITEM_KEY
)
2019 if (location
->objectid
== BTRFS_ROOT_TREE_OBJECTID
)
2022 *sub_root
= btrfs_read_fs_root(root
->fs_info
, location
,
2023 dentry
->d_name
.name
,
2024 dentry
->d_name
.len
);
2025 if (IS_ERR(*sub_root
))
2026 return PTR_ERR(*sub_root
);
2028 ri
= &(*sub_root
)->root_item
;
2029 location
->objectid
= btrfs_root_dirid(ri
);
2030 btrfs_set_key_type(location
, BTRFS_INODE_ITEM_KEY
);
2031 location
->offset
= 0;
2036 static noinline
void init_btrfs_i(struct inode
*inode
)
2038 struct btrfs_inode
*bi
= BTRFS_I(inode
);
2041 bi
->i_default_acl
= NULL
;
2045 bi
->logged_trans
= 0;
2046 bi
->delalloc_bytes
= 0;
2047 bi
->disk_i_size
= 0;
2049 bi
->index_cnt
= (u64
)-1;
2050 bi
->log_dirty_trans
= 0;
2051 extent_map_tree_init(&BTRFS_I(inode
)->extent_tree
, GFP_NOFS
);
2052 extent_io_tree_init(&BTRFS_I(inode
)->io_tree
,
2053 inode
->i_mapping
, GFP_NOFS
);
2054 extent_io_tree_init(&BTRFS_I(inode
)->io_failure_tree
,
2055 inode
->i_mapping
, GFP_NOFS
);
2056 INIT_LIST_HEAD(&BTRFS_I(inode
)->delalloc_inodes
);
2057 btrfs_ordered_inode_tree_init(&BTRFS_I(inode
)->ordered_tree
);
2058 mutex_init(&BTRFS_I(inode
)->csum_mutex
);
2059 mutex_init(&BTRFS_I(inode
)->extent_mutex
);
2060 mutex_init(&BTRFS_I(inode
)->log_mutex
);
2063 static int btrfs_init_locked_inode(struct inode
*inode
, void *p
)
2065 struct btrfs_iget_args
*args
= p
;
2066 inode
->i_ino
= args
->ino
;
2067 init_btrfs_i(inode
);
2068 BTRFS_I(inode
)->root
= args
->root
;
2072 static int btrfs_find_actor(struct inode
*inode
, void *opaque
)
2074 struct btrfs_iget_args
*args
= opaque
;
2075 return (args
->ino
== inode
->i_ino
&&
2076 args
->root
== BTRFS_I(inode
)->root
);
2079 struct inode
*btrfs_ilookup(struct super_block
*s
, u64 objectid
,
2080 struct btrfs_root
*root
, int wait
)
2082 struct inode
*inode
;
2083 struct btrfs_iget_args args
;
2084 args
.ino
= objectid
;
2088 inode
= ilookup5(s
, objectid
, btrfs_find_actor
,
2091 inode
= ilookup5_nowait(s
, objectid
, btrfs_find_actor
,
2097 struct inode
*btrfs_iget_locked(struct super_block
*s
, u64 objectid
,
2098 struct btrfs_root
*root
)
2100 struct inode
*inode
;
2101 struct btrfs_iget_args args
;
2102 args
.ino
= objectid
;
2105 inode
= iget5_locked(s
, objectid
, btrfs_find_actor
,
2106 btrfs_init_locked_inode
,
2111 /* Get an inode object given its location and corresponding root.
2112 * Returns in *is_new if the inode was read from disk
2114 struct inode
*btrfs_iget(struct super_block
*s
, struct btrfs_key
*location
,
2115 struct btrfs_root
*root
, int *is_new
)
2117 struct inode
*inode
;
2119 inode
= btrfs_iget_locked(s
, location
->objectid
, root
);
2121 return ERR_PTR(-EACCES
);
2123 if (inode
->i_state
& I_NEW
) {
2124 BTRFS_I(inode
)->root
= root
;
2125 memcpy(&BTRFS_I(inode
)->location
, location
, sizeof(*location
));
2126 btrfs_read_locked_inode(inode
);
2127 unlock_new_inode(inode
);
2138 static struct dentry
*btrfs_lookup(struct inode
*dir
, struct dentry
*dentry
,
2139 struct nameidata
*nd
)
2141 struct inode
* inode
;
2142 struct btrfs_inode
*bi
= BTRFS_I(dir
);
2143 struct btrfs_root
*root
= bi
->root
;
2144 struct btrfs_root
*sub_root
= root
;
2145 struct btrfs_key location
;
2146 int ret
, new, do_orphan
= 0;
2148 if (dentry
->d_name
.len
> BTRFS_NAME_LEN
)
2149 return ERR_PTR(-ENAMETOOLONG
);
2151 ret
= btrfs_inode_by_name(dir
, dentry
, &location
);
2154 return ERR_PTR(ret
);
2157 if (location
.objectid
) {
2158 ret
= fixup_tree_root_location(root
, &location
, &sub_root
,
2161 return ERR_PTR(ret
);
2163 return ERR_PTR(-ENOENT
);
2164 inode
= btrfs_iget(dir
->i_sb
, &location
, sub_root
, &new);
2166 return ERR_CAST(inode
);
2168 /* the inode and parent dir are two different roots */
2169 if (new && root
!= sub_root
) {
2171 sub_root
->inode
= inode
;
2176 if (unlikely(do_orphan
))
2177 btrfs_orphan_cleanup(sub_root
);
2179 return d_splice_alias(inode
, dentry
);
2182 static unsigned char btrfs_filetype_table
[] = {
2183 DT_UNKNOWN
, DT_REG
, DT_DIR
, DT_CHR
, DT_BLK
, DT_FIFO
, DT_SOCK
, DT_LNK
2186 static int btrfs_real_readdir(struct file
*filp
, void *dirent
,
2189 struct inode
*inode
= filp
->f_dentry
->d_inode
;
2190 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
2191 struct btrfs_item
*item
;
2192 struct btrfs_dir_item
*di
;
2193 struct btrfs_key key
;
2194 struct btrfs_key found_key
;
2195 struct btrfs_path
*path
;
2198 struct extent_buffer
*leaf
;
2201 unsigned char d_type
;
2206 int key_type
= BTRFS_DIR_INDEX_KEY
;
2211 /* FIXME, use a real flag for deciding about the key type */
2212 if (root
->fs_info
->tree_root
== root
)
2213 key_type
= BTRFS_DIR_ITEM_KEY
;
2215 /* special case for "." */
2216 if (filp
->f_pos
== 0) {
2217 over
= filldir(dirent
, ".", 1,
2224 /* special case for .., just use the back ref */
2225 if (filp
->f_pos
== 1) {
2226 u64 pino
= parent_ino(filp
->f_path
.dentry
);
2227 over
= filldir(dirent
, "..", 2,
2234 path
= btrfs_alloc_path();
2237 btrfs_set_key_type(&key
, key_type
);
2238 key
.offset
= filp
->f_pos
;
2239 key
.objectid
= inode
->i_ino
;
2241 ret
= btrfs_search_slot(NULL
, root
, &key
, path
, 0, 0);
2247 leaf
= path
->nodes
[0];
2248 nritems
= btrfs_header_nritems(leaf
);
2249 slot
= path
->slots
[0];
2250 if (advance
|| slot
>= nritems
) {
2251 if (slot
>= nritems
- 1) {
2252 ret
= btrfs_next_leaf(root
, path
);
2255 leaf
= path
->nodes
[0];
2256 nritems
= btrfs_header_nritems(leaf
);
2257 slot
= path
->slots
[0];
2264 item
= btrfs_item_nr(leaf
, slot
);
2265 btrfs_item_key_to_cpu(leaf
, &found_key
, slot
);
2267 if (found_key
.objectid
!= key
.objectid
)
2269 if (btrfs_key_type(&found_key
) != key_type
)
2271 if (found_key
.offset
< filp
->f_pos
)
2274 filp
->f_pos
= found_key
.offset
;
2276 di
= btrfs_item_ptr(leaf
, slot
, struct btrfs_dir_item
);
2278 di_total
= btrfs_item_size(leaf
, item
);
2280 while (di_cur
< di_total
) {
2281 struct btrfs_key location
;
2283 name_len
= btrfs_dir_name_len(leaf
, di
);
2284 if (name_len
<= sizeof(tmp_name
)) {
2285 name_ptr
= tmp_name
;
2287 name_ptr
= kmalloc(name_len
, GFP_NOFS
);
2293 read_extent_buffer(leaf
, name_ptr
,
2294 (unsigned long)(di
+ 1), name_len
);
2296 d_type
= btrfs_filetype_table
[btrfs_dir_type(leaf
, di
)];
2297 btrfs_dir_item_key_to_cpu(leaf
, di
, &location
);
2298 over
= filldir(dirent
, name_ptr
, name_len
,
2299 found_key
.offset
, location
.objectid
,
2302 if (name_ptr
!= tmp_name
)
2308 di_len
= btrfs_dir_name_len(leaf
, di
) +
2309 btrfs_dir_data_len(leaf
, di
) + sizeof(*di
);
2311 di
= (struct btrfs_dir_item
*)((char *)di
+ di_len
);
2315 /* Reached end of directory/root. Bump pos past the last item. */
2316 if (key_type
== BTRFS_DIR_INDEX_KEY
)
2317 filp
->f_pos
= INT_LIMIT(typeof(filp
->f_pos
));
2323 btrfs_free_path(path
);
2327 int btrfs_write_inode(struct inode
*inode
, int wait
)
2329 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
2330 struct btrfs_trans_handle
*trans
;
2333 if (root
->fs_info
->closing
> 1)
2337 trans
= btrfs_join_transaction(root
, 1);
2338 btrfs_set_trans_block_group(trans
, inode
);
2339 ret
= btrfs_commit_transaction(trans
, root
);
2345 * This is somewhat expensive, updating the tree every time the
2346 * inode changes. But, it is most likely to find the inode in cache.
2347 * FIXME, needs more benchmarking...there are no reasons other than performance
2348 * to keep or drop this code.
2350 void btrfs_dirty_inode(struct inode
*inode
)
2352 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
2353 struct btrfs_trans_handle
*trans
;
2355 trans
= btrfs_join_transaction(root
, 1);
2356 btrfs_set_trans_block_group(trans
, inode
);
2357 btrfs_update_inode(trans
, root
, inode
);
2358 btrfs_end_transaction(trans
, root
);
2362 * find the highest existing sequence number in a directory
2363 * and then set the in-memory index_cnt variable to reflect
2364 * free sequence numbers
2366 static int btrfs_set_inode_index_count(struct inode
*inode
)
2368 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
2369 struct btrfs_key key
, found_key
;
2370 struct btrfs_path
*path
;
2371 struct extent_buffer
*leaf
;
2374 key
.objectid
= inode
->i_ino
;
2375 btrfs_set_key_type(&key
, BTRFS_DIR_INDEX_KEY
);
2376 key
.offset
= (u64
)-1;
2378 path
= btrfs_alloc_path();
2382 ret
= btrfs_search_slot(NULL
, root
, &key
, path
, 0, 0);
2385 /* FIXME: we should be able to handle this */
2391 * MAGIC NUMBER EXPLANATION:
2392 * since we search a directory based on f_pos we have to start at 2
2393 * since '.' and '..' have f_pos of 0 and 1 respectively, so everybody
2394 * else has to start at 2
2396 if (path
->slots
[0] == 0) {
2397 BTRFS_I(inode
)->index_cnt
= 2;
2403 leaf
= path
->nodes
[0];
2404 btrfs_item_key_to_cpu(leaf
, &found_key
, path
->slots
[0]);
2406 if (found_key
.objectid
!= inode
->i_ino
||
2407 btrfs_key_type(&found_key
) != BTRFS_DIR_INDEX_KEY
) {
2408 BTRFS_I(inode
)->index_cnt
= 2;
2412 BTRFS_I(inode
)->index_cnt
= found_key
.offset
+ 1;
2414 btrfs_free_path(path
);
2419 * helper to find a free sequence number in a given directory. This current
2420 * code is very simple, later versions will do smarter things in the btree
2422 static int btrfs_set_inode_index(struct inode
*dir
, struct inode
*inode
,
2427 if (BTRFS_I(dir
)->index_cnt
== (u64
)-1) {
2428 ret
= btrfs_set_inode_index_count(dir
);
2434 *index
= BTRFS_I(dir
)->index_cnt
;
2435 BTRFS_I(dir
)->index_cnt
++;
2440 static struct inode
*btrfs_new_inode(struct btrfs_trans_handle
*trans
,
2441 struct btrfs_root
*root
,
2443 const char *name
, int name_len
,
2446 struct btrfs_block_group_cache
*group
,
2447 int mode
, u64
*index
)
2449 struct inode
*inode
;
2450 struct btrfs_inode_item
*inode_item
;
2451 struct btrfs_block_group_cache
*new_inode_group
;
2452 struct btrfs_key
*location
;
2453 struct btrfs_path
*path
;
2454 struct btrfs_inode_ref
*ref
;
2455 struct btrfs_key key
[2];
2461 path
= btrfs_alloc_path();
2464 inode
= new_inode(root
->fs_info
->sb
);
2466 return ERR_PTR(-ENOMEM
);
2469 ret
= btrfs_set_inode_index(dir
, inode
, index
);
2471 return ERR_PTR(ret
);
2474 * index_cnt is ignored for everything but a dir,
2475 * btrfs_get_inode_index_count has an explanation for the magic
2478 init_btrfs_i(inode
);
2479 BTRFS_I(inode
)->index_cnt
= 2;
2480 BTRFS_I(inode
)->root
= root
;
2481 BTRFS_I(inode
)->generation
= trans
->transid
;
2487 new_inode_group
= btrfs_find_block_group(root
, group
, 0,
2488 BTRFS_BLOCK_GROUP_METADATA
, owner
);
2489 if (!new_inode_group
) {
2490 printk("find_block group failed\n");
2491 new_inode_group
= group
;
2493 BTRFS_I(inode
)->block_group
= new_inode_group
;
2495 key
[0].objectid
= objectid
;
2496 btrfs_set_key_type(&key
[0], BTRFS_INODE_ITEM_KEY
);
2499 key
[1].objectid
= objectid
;
2500 btrfs_set_key_type(&key
[1], BTRFS_INODE_REF_KEY
);
2501 key
[1].offset
= ref_objectid
;
2503 sizes
[0] = sizeof(struct btrfs_inode_item
);
2504 sizes
[1] = name_len
+ sizeof(*ref
);
2506 ret
= btrfs_insert_empty_items(trans
, root
, path
, key
, sizes
, 2);
2510 if (objectid
> root
->highest_inode
)
2511 root
->highest_inode
= objectid
;
2513 inode
->i_uid
= current
->fsuid
;
2514 inode
->i_gid
= current
->fsgid
;
2515 inode
->i_mode
= mode
;
2516 inode
->i_ino
= objectid
;
2517 inode_set_bytes(inode
, 0);
2518 inode
->i_mtime
= inode
->i_atime
= inode
->i_ctime
= CURRENT_TIME
;
2519 inode_item
= btrfs_item_ptr(path
->nodes
[0], path
->slots
[0],
2520 struct btrfs_inode_item
);
2521 fill_inode_item(trans
, path
->nodes
[0], inode_item
, inode
);
2523 ref
= btrfs_item_ptr(path
->nodes
[0], path
->slots
[0] + 1,
2524 struct btrfs_inode_ref
);
2525 btrfs_set_inode_ref_name_len(path
->nodes
[0], ref
, name_len
);
2526 btrfs_set_inode_ref_index(path
->nodes
[0], ref
, *index
);
2527 ptr
= (unsigned long)(ref
+ 1);
2528 write_extent_buffer(path
->nodes
[0], name
, ptr
, name_len
);
2530 btrfs_mark_buffer_dirty(path
->nodes
[0]);
2531 btrfs_free_path(path
);
2533 location
= &BTRFS_I(inode
)->location
;
2534 location
->objectid
= objectid
;
2535 location
->offset
= 0;
2536 btrfs_set_key_type(location
, BTRFS_INODE_ITEM_KEY
);
2538 insert_inode_hash(inode
);
2542 BTRFS_I(dir
)->index_cnt
--;
2543 btrfs_free_path(path
);
2544 return ERR_PTR(ret
);
2547 static inline u8
btrfs_inode_type(struct inode
*inode
)
2549 return btrfs_type_by_mode
[(inode
->i_mode
& S_IFMT
) >> S_SHIFT
];
2553 * utility function to add 'inode' into 'parent_inode' with
2554 * a give name and a given sequence number.
2555 * if 'add_backref' is true, also insert a backref from the
2556 * inode to the parent directory.
2558 int btrfs_add_link(struct btrfs_trans_handle
*trans
,
2559 struct inode
*parent_inode
, struct inode
*inode
,
2560 const char *name
, int name_len
, int add_backref
, u64 index
)
2563 struct btrfs_key key
;
2564 struct btrfs_root
*root
= BTRFS_I(parent_inode
)->root
;
2566 key
.objectid
= inode
->i_ino
;
2567 btrfs_set_key_type(&key
, BTRFS_INODE_ITEM_KEY
);
2570 ret
= btrfs_insert_dir_item(trans
, root
, name
, name_len
,
2571 parent_inode
->i_ino
,
2572 &key
, btrfs_inode_type(inode
),
2576 ret
= btrfs_insert_inode_ref(trans
, root
,
2579 parent_inode
->i_ino
,
2582 btrfs_i_size_write(parent_inode
, parent_inode
->i_size
+
2584 parent_inode
->i_mtime
= parent_inode
->i_ctime
= CURRENT_TIME
;
2585 ret
= btrfs_update_inode(trans
, root
, parent_inode
);
2590 static int btrfs_add_nondir(struct btrfs_trans_handle
*trans
,
2591 struct dentry
*dentry
, struct inode
*inode
,
2592 int backref
, u64 index
)
2594 int err
= btrfs_add_link(trans
, dentry
->d_parent
->d_inode
,
2595 inode
, dentry
->d_name
.name
,
2596 dentry
->d_name
.len
, backref
, index
);
2598 d_instantiate(dentry
, inode
);
2606 static int btrfs_mknod(struct inode
*dir
, struct dentry
*dentry
,
2607 int mode
, dev_t rdev
)
2609 struct btrfs_trans_handle
*trans
;
2610 struct btrfs_root
*root
= BTRFS_I(dir
)->root
;
2611 struct inode
*inode
= NULL
;
2615 unsigned long nr
= 0;
2618 if (!new_valid_dev(rdev
))
2621 err
= btrfs_check_free_space(root
, 1, 0);
2625 trans
= btrfs_start_transaction(root
, 1);
2626 btrfs_set_trans_block_group(trans
, dir
);
2628 err
= btrfs_find_free_objectid(trans
, root
, dir
->i_ino
, &objectid
);
2634 inode
= btrfs_new_inode(trans
, root
, dir
, dentry
->d_name
.name
,
2636 dentry
->d_parent
->d_inode
->i_ino
, objectid
,
2637 BTRFS_I(dir
)->block_group
, mode
, &index
);
2638 err
= PTR_ERR(inode
);
2642 err
= btrfs_init_acl(inode
, dir
);
2648 btrfs_set_trans_block_group(trans
, inode
);
2649 err
= btrfs_add_nondir(trans
, dentry
, inode
, 0, index
);
2653 inode
->i_op
= &btrfs_special_inode_operations
;
2654 init_special_inode(inode
, inode
->i_mode
, rdev
);
2655 btrfs_update_inode(trans
, root
, inode
);
2657 dir
->i_sb
->s_dirt
= 1;
2658 btrfs_update_inode_block_group(trans
, inode
);
2659 btrfs_update_inode_block_group(trans
, dir
);
2661 nr
= trans
->blocks_used
;
2662 btrfs_end_transaction_throttle(trans
, root
);
2665 inode_dec_link_count(inode
);
2668 btrfs_btree_balance_dirty(root
, nr
);
2672 static int btrfs_create(struct inode
*dir
, struct dentry
*dentry
,
2673 int mode
, struct nameidata
*nd
)
2675 struct btrfs_trans_handle
*trans
;
2676 struct btrfs_root
*root
= BTRFS_I(dir
)->root
;
2677 struct inode
*inode
= NULL
;
2680 unsigned long nr
= 0;
2684 err
= btrfs_check_free_space(root
, 1, 0);
2687 trans
= btrfs_start_transaction(root
, 1);
2688 btrfs_set_trans_block_group(trans
, dir
);
2690 err
= btrfs_find_free_objectid(trans
, root
, dir
->i_ino
, &objectid
);
2696 inode
= btrfs_new_inode(trans
, root
, dir
, dentry
->d_name
.name
,
2698 dentry
->d_parent
->d_inode
->i_ino
,
2699 objectid
, BTRFS_I(dir
)->block_group
, mode
,
2701 err
= PTR_ERR(inode
);
2705 err
= btrfs_init_acl(inode
, dir
);
2711 btrfs_set_trans_block_group(trans
, inode
);
2712 err
= btrfs_add_nondir(trans
, dentry
, inode
, 0, index
);
2716 inode
->i_mapping
->a_ops
= &btrfs_aops
;
2717 inode
->i_mapping
->backing_dev_info
= &root
->fs_info
->bdi
;
2718 inode
->i_fop
= &btrfs_file_operations
;
2719 inode
->i_op
= &btrfs_file_inode_operations
;
2720 BTRFS_I(inode
)->io_tree
.ops
= &btrfs_extent_io_ops
;
2722 dir
->i_sb
->s_dirt
= 1;
2723 btrfs_update_inode_block_group(trans
, inode
);
2724 btrfs_update_inode_block_group(trans
, dir
);
2726 nr
= trans
->blocks_used
;
2727 btrfs_end_transaction_throttle(trans
, root
);
2730 inode_dec_link_count(inode
);
2733 btrfs_btree_balance_dirty(root
, nr
);
2737 static int btrfs_link(struct dentry
*old_dentry
, struct inode
*dir
,
2738 struct dentry
*dentry
)
2740 struct btrfs_trans_handle
*trans
;
2741 struct btrfs_root
*root
= BTRFS_I(dir
)->root
;
2742 struct inode
*inode
= old_dentry
->d_inode
;
2744 unsigned long nr
= 0;
2748 if (inode
->i_nlink
== 0)
2751 btrfs_inc_nlink(inode
);
2752 err
= btrfs_check_free_space(root
, 1, 0);
2755 err
= btrfs_set_inode_index(dir
, inode
, &index
);
2759 trans
= btrfs_start_transaction(root
, 1);
2761 btrfs_set_trans_block_group(trans
, dir
);
2762 atomic_inc(&inode
->i_count
);
2764 err
= btrfs_add_nondir(trans
, dentry
, inode
, 1, index
);
2769 dir
->i_sb
->s_dirt
= 1;
2770 btrfs_update_inode_block_group(trans
, dir
);
2771 err
= btrfs_update_inode(trans
, root
, inode
);
2776 nr
= trans
->blocks_used
;
2777 btrfs_end_transaction_throttle(trans
, root
);
2780 inode_dec_link_count(inode
);
2783 btrfs_btree_balance_dirty(root
, nr
);
2787 static int btrfs_mkdir(struct inode
*dir
, struct dentry
*dentry
, int mode
)
2789 struct inode
*inode
= NULL
;
2790 struct btrfs_trans_handle
*trans
;
2791 struct btrfs_root
*root
= BTRFS_I(dir
)->root
;
2793 int drop_on_err
= 0;
2796 unsigned long nr
= 1;
2798 err
= btrfs_check_free_space(root
, 1, 0);
2802 trans
= btrfs_start_transaction(root
, 1);
2803 btrfs_set_trans_block_group(trans
, dir
);
2805 if (IS_ERR(trans
)) {
2806 err
= PTR_ERR(trans
);
2810 err
= btrfs_find_free_objectid(trans
, root
, dir
->i_ino
, &objectid
);
2816 inode
= btrfs_new_inode(trans
, root
, dir
, dentry
->d_name
.name
,
2818 dentry
->d_parent
->d_inode
->i_ino
, objectid
,
2819 BTRFS_I(dir
)->block_group
, S_IFDIR
| mode
,
2821 if (IS_ERR(inode
)) {
2822 err
= PTR_ERR(inode
);
2828 err
= btrfs_init_acl(inode
, dir
);
2832 inode
->i_op
= &btrfs_dir_inode_operations
;
2833 inode
->i_fop
= &btrfs_dir_file_operations
;
2834 btrfs_set_trans_block_group(trans
, inode
);
2836 btrfs_i_size_write(inode
, 0);
2837 err
= btrfs_update_inode(trans
, root
, inode
);
2841 err
= btrfs_add_link(trans
, dentry
->d_parent
->d_inode
,
2842 inode
, dentry
->d_name
.name
,
2843 dentry
->d_name
.len
, 0, index
);
2847 d_instantiate(dentry
, inode
);
2849 dir
->i_sb
->s_dirt
= 1;
2850 btrfs_update_inode_block_group(trans
, inode
);
2851 btrfs_update_inode_block_group(trans
, dir
);
2854 nr
= trans
->blocks_used
;
2855 btrfs_end_transaction_throttle(trans
, root
);
2860 btrfs_btree_balance_dirty(root
, nr
);
2864 /* helper for btfs_get_extent. Given an existing extent in the tree,
2865 * and an extent that you want to insert, deal with overlap and insert
2866 * the new extent into the tree.
2868 static int merge_extent_mapping(struct extent_map_tree
*em_tree
,
2869 struct extent_map
*existing
,
2870 struct extent_map
*em
,
2871 u64 map_start
, u64 map_len
)
2875 BUG_ON(map_start
< em
->start
|| map_start
>= extent_map_end(em
));
2876 start_diff
= map_start
- em
->start
;
2877 em
->start
= map_start
;
2879 if (em
->block_start
< EXTENT_MAP_LAST_BYTE
)
2880 em
->block_start
+= start_diff
;
2881 return add_extent_mapping(em_tree
, em
);
2885 * a bit scary, this does extent mapping from logical file offset to the disk.
2886 * the ugly parts come from merging extents from the disk with the
2887 * in-ram representation. This gets more complex because of the data=ordered code,
2888 * where the in-ram extents might be locked pending data=ordered completion.
2890 * This also copies inline extents directly into the page.
2892 struct extent_map
*btrfs_get_extent(struct inode
*inode
, struct page
*page
,
2893 size_t pg_offset
, u64 start
, u64 len
,
2899 u64 extent_start
= 0;
2901 u64 objectid
= inode
->i_ino
;
2903 struct btrfs_path
*path
= NULL
;
2904 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
2905 struct btrfs_file_extent_item
*item
;
2906 struct extent_buffer
*leaf
;
2907 struct btrfs_key found_key
;
2908 struct extent_map
*em
= NULL
;
2909 struct extent_map_tree
*em_tree
= &BTRFS_I(inode
)->extent_tree
;
2910 struct extent_io_tree
*io_tree
= &BTRFS_I(inode
)->io_tree
;
2911 struct btrfs_trans_handle
*trans
= NULL
;
2914 spin_lock(&em_tree
->lock
);
2915 em
= lookup_extent_mapping(em_tree
, start
, len
);
2917 em
->bdev
= root
->fs_info
->fs_devices
->latest_bdev
;
2918 spin_unlock(&em_tree
->lock
);
2921 if (em
->start
> start
|| em
->start
+ em
->len
<= start
)
2922 free_extent_map(em
);
2923 else if (em
->block_start
== EXTENT_MAP_INLINE
&& page
)
2924 free_extent_map(em
);
2928 em
= alloc_extent_map(GFP_NOFS
);
2933 em
->bdev
= root
->fs_info
->fs_devices
->latest_bdev
;
2934 em
->start
= EXTENT_MAP_HOLE
;
2938 path
= btrfs_alloc_path();
2942 ret
= btrfs_lookup_file_extent(trans
, root
, path
,
2943 objectid
, start
, trans
!= NULL
);
2950 if (path
->slots
[0] == 0)
2955 leaf
= path
->nodes
[0];
2956 item
= btrfs_item_ptr(leaf
, path
->slots
[0],
2957 struct btrfs_file_extent_item
);
2958 /* are we inside the extent that was found? */
2959 btrfs_item_key_to_cpu(leaf
, &found_key
, path
->slots
[0]);
2960 found_type
= btrfs_key_type(&found_key
);
2961 if (found_key
.objectid
!= objectid
||
2962 found_type
!= BTRFS_EXTENT_DATA_KEY
) {
2966 found_type
= btrfs_file_extent_type(leaf
, item
);
2967 extent_start
= found_key
.offset
;
2968 if (found_type
== BTRFS_FILE_EXTENT_REG
) {
2969 extent_end
= extent_start
+
2970 btrfs_file_extent_num_bytes(leaf
, item
);
2972 if (start
< extent_start
|| start
>= extent_end
) {
2974 if (start
< extent_start
) {
2975 if (start
+ len
<= extent_start
)
2977 em
->len
= extent_end
- extent_start
;
2983 bytenr
= btrfs_file_extent_disk_bytenr(leaf
, item
);
2985 em
->start
= extent_start
;
2986 em
->len
= extent_end
- extent_start
;
2987 em
->block_start
= EXTENT_MAP_HOLE
;
2990 bytenr
+= btrfs_file_extent_offset(leaf
, item
);
2991 em
->block_start
= bytenr
;
2992 em
->start
= extent_start
;
2993 em
->len
= extent_end
- extent_start
;
2995 } else if (found_type
== BTRFS_FILE_EXTENT_INLINE
) {
3000 size_t extent_offset
;
3003 size
= btrfs_file_extent_inline_len(leaf
, btrfs_item_nr(leaf
,
3005 extent_end
= (extent_start
+ size
+ root
->sectorsize
- 1) &
3006 ~((u64
)root
->sectorsize
- 1);
3007 if (start
< extent_start
|| start
>= extent_end
) {
3009 if (start
< extent_start
) {
3010 if (start
+ len
<= extent_start
)
3012 em
->len
= extent_end
- extent_start
;
3018 em
->block_start
= EXTENT_MAP_INLINE
;
3021 em
->start
= extent_start
;
3026 page_start
= page_offset(page
) + pg_offset
;
3027 extent_offset
= page_start
- extent_start
;
3028 copy_size
= min_t(u64
, PAGE_CACHE_SIZE
- pg_offset
,
3029 size
- extent_offset
);
3030 em
->start
= extent_start
+ extent_offset
;
3031 em
->len
= (copy_size
+ root
->sectorsize
- 1) &
3032 ~((u64
)root
->sectorsize
- 1);
3034 ptr
= btrfs_file_extent_inline_start(item
) + extent_offset
;
3035 if (create
== 0 && !PageUptodate(page
)) {
3036 read_extent_buffer(leaf
, map
+ pg_offset
, ptr
,
3038 flush_dcache_page(page
);
3039 } else if (create
&& PageUptodate(page
)) {
3042 free_extent_map(em
);
3044 btrfs_release_path(root
, path
);
3045 trans
= btrfs_join_transaction(root
, 1);
3048 write_extent_buffer(leaf
, map
+ pg_offset
, ptr
,
3050 btrfs_mark_buffer_dirty(leaf
);
3053 set_extent_uptodate(io_tree
, em
->start
,
3054 extent_map_end(em
) - 1, GFP_NOFS
);
3057 printk("unkknown found_type %d\n", found_type
);
3064 em
->block_start
= EXTENT_MAP_HOLE
;
3066 btrfs_release_path(root
, path
);
3067 if (em
->start
> start
|| extent_map_end(em
) <= start
) {
3068 printk("bad extent! em: [%Lu %Lu] passed [%Lu %Lu]\n", em
->start
, em
->len
, start
, len
);
3074 spin_lock(&em_tree
->lock
);
3075 ret
= add_extent_mapping(em_tree
, em
);
3076 /* it is possible that someone inserted the extent into the tree
3077 * while we had the lock dropped. It is also possible that
3078 * an overlapping map exists in the tree
3080 if (ret
== -EEXIST
) {
3081 struct extent_map
*existing
;
3085 existing
= lookup_extent_mapping(em_tree
, start
, len
);
3086 if (existing
&& (existing
->start
> start
||
3087 existing
->start
+ existing
->len
<= start
)) {
3088 free_extent_map(existing
);
3092 existing
= lookup_extent_mapping(em_tree
, em
->start
,
3095 err
= merge_extent_mapping(em_tree
, existing
,
3098 free_extent_map(existing
);
3100 free_extent_map(em
);
3105 printk("failing to insert %Lu %Lu\n",
3107 free_extent_map(em
);
3111 free_extent_map(em
);
3116 spin_unlock(&em_tree
->lock
);
3119 btrfs_free_path(path
);
3121 ret
= btrfs_end_transaction(trans
, root
);
3127 free_extent_map(em
);
3129 return ERR_PTR(err
);
3134 static ssize_t
btrfs_direct_IO(int rw
, struct kiocb
*iocb
,
3135 const struct iovec
*iov
, loff_t offset
,
3136 unsigned long nr_segs
)
3141 static sector_t
btrfs_bmap(struct address_space
*mapping
, sector_t iblock
)
3143 return extent_bmap(mapping
, iblock
, btrfs_get_extent
);
3146 int btrfs_readpage(struct file
*file
, struct page
*page
)
3148 struct extent_io_tree
*tree
;
3149 tree
= &BTRFS_I(page
->mapping
->host
)->io_tree
;
3150 return extent_read_full_page(tree
, page
, btrfs_get_extent
);
3153 static int btrfs_writepage(struct page
*page
, struct writeback_control
*wbc
)
3155 struct extent_io_tree
*tree
;
3158 if (current
->flags
& PF_MEMALLOC
) {
3159 redirty_page_for_writepage(wbc
, page
);
3163 tree
= &BTRFS_I(page
->mapping
->host
)->io_tree
;
3164 return extent_write_full_page(tree
, page
, btrfs_get_extent
, wbc
);
3167 int btrfs_writepages(struct address_space
*mapping
,
3168 struct writeback_control
*wbc
)
3170 struct extent_io_tree
*tree
;
3171 tree
= &BTRFS_I(mapping
->host
)->io_tree
;
3172 return extent_writepages(tree
, mapping
, btrfs_get_extent
, wbc
);
3176 btrfs_readpages(struct file
*file
, struct address_space
*mapping
,
3177 struct list_head
*pages
, unsigned nr_pages
)
3179 struct extent_io_tree
*tree
;
3180 tree
= &BTRFS_I(mapping
->host
)->io_tree
;
3181 return extent_readpages(tree
, mapping
, pages
, nr_pages
,
3184 static int __btrfs_releasepage(struct page
*page
, gfp_t gfp_flags
)
3186 struct extent_io_tree
*tree
;
3187 struct extent_map_tree
*map
;
3190 tree
= &BTRFS_I(page
->mapping
->host
)->io_tree
;
3191 map
= &BTRFS_I(page
->mapping
->host
)->extent_tree
;
3192 ret
= try_release_extent_mapping(map
, tree
, page
, gfp_flags
);
3194 ClearPagePrivate(page
);
3195 set_page_private(page
, 0);
3196 page_cache_release(page
);
3201 static int btrfs_releasepage(struct page
*page
, gfp_t gfp_flags
)
3203 if (PageWriteback(page
) || PageDirty(page
))
3205 return __btrfs_releasepage(page
, gfp_flags
);
3208 static void btrfs_invalidatepage(struct page
*page
, unsigned long offset
)
3210 struct extent_io_tree
*tree
;
3211 struct btrfs_ordered_extent
*ordered
;
3212 u64 page_start
= page_offset(page
);
3213 u64 page_end
= page_start
+ PAGE_CACHE_SIZE
- 1;
3215 wait_on_page_writeback(page
);
3216 tree
= &BTRFS_I(page
->mapping
->host
)->io_tree
;
3218 btrfs_releasepage(page
, GFP_NOFS
);
3222 lock_extent(tree
, page_start
, page_end
, GFP_NOFS
);
3223 ordered
= btrfs_lookup_ordered_extent(page
->mapping
->host
,
3227 * IO on this page will never be started, so we need
3228 * to account for any ordered extents now
3230 clear_extent_bit(tree
, page_start
, page_end
,
3231 EXTENT_DIRTY
| EXTENT_DELALLOC
|
3232 EXTENT_LOCKED
, 1, 0, GFP_NOFS
);
3233 btrfs_finish_ordered_io(page
->mapping
->host
,
3234 page_start
, page_end
);
3235 btrfs_put_ordered_extent(ordered
);
3236 lock_extent(tree
, page_start
, page_end
, GFP_NOFS
);
3238 clear_extent_bit(tree
, page_start
, page_end
,
3239 EXTENT_LOCKED
| EXTENT_DIRTY
| EXTENT_DELALLOC
|
3242 __btrfs_releasepage(page
, GFP_NOFS
);
3244 ClearPageChecked(page
);
3245 if (PagePrivate(page
)) {
3246 ClearPagePrivate(page
);
3247 set_page_private(page
, 0);
3248 page_cache_release(page
);
3253 * btrfs_page_mkwrite() is not allowed to change the file size as it gets
3254 * called from a page fault handler when a page is first dirtied. Hence we must
3255 * be careful to check for EOF conditions here. We set the page up correctly
3256 * for a written page which means we get ENOSPC checking when writing into
3257 * holes and correct delalloc and unwritten extent mapping on filesystems that
3258 * support these features.
3260 * We are not allowed to take the i_mutex here so we have to play games to
3261 * protect against truncate races as the page could now be beyond EOF. Because
3262 * vmtruncate() writes the inode size before removing pages, once we have the
3263 * page lock we can determine safely if the page is beyond EOF. If it is not
3264 * beyond EOF, then the page is guaranteed safe against truncation until we
3267 int btrfs_page_mkwrite(struct vm_area_struct
*vma
, struct page
*page
)
3269 struct inode
*inode
= fdentry(vma
->vm_file
)->d_inode
;
3270 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
3271 struct extent_io_tree
*io_tree
= &BTRFS_I(inode
)->io_tree
;
3272 struct btrfs_ordered_extent
*ordered
;
3274 unsigned long zero_start
;
3280 ret
= btrfs_check_free_space(root
, PAGE_CACHE_SIZE
, 0);
3287 size
= i_size_read(inode
);
3288 page_start
= page_offset(page
);
3289 page_end
= page_start
+ PAGE_CACHE_SIZE
- 1;
3291 if ((page
->mapping
!= inode
->i_mapping
) ||
3292 (page_start
>= size
)) {
3293 /* page got truncated out from underneath us */
3296 wait_on_page_writeback(page
);
3298 lock_extent(io_tree
, page_start
, page_end
, GFP_NOFS
);
3299 set_page_extent_mapped(page
);
3302 * we can't set the delalloc bits if there are pending ordered
3303 * extents. Drop our locks and wait for them to finish
3305 ordered
= btrfs_lookup_ordered_extent(inode
, page_start
);
3307 unlock_extent(io_tree
, page_start
, page_end
, GFP_NOFS
);
3309 btrfs_start_ordered_extent(inode
, ordered
, 1);
3310 btrfs_put_ordered_extent(ordered
);
3314 btrfs_set_extent_delalloc(inode
, page_start
, page_end
);
3317 /* page is wholly or partially inside EOF */
3318 if (page_start
+ PAGE_CACHE_SIZE
> size
)
3319 zero_start
= size
& ~PAGE_CACHE_MASK
;
3321 zero_start
= PAGE_CACHE_SIZE
;
3323 if (zero_start
!= PAGE_CACHE_SIZE
) {
3325 memset(kaddr
+ zero_start
, 0, PAGE_CACHE_SIZE
- zero_start
);
3326 flush_dcache_page(page
);
3329 ClearPageChecked(page
);
3330 set_page_dirty(page
);
3331 unlock_extent(io_tree
, page_start
, page_end
, GFP_NOFS
);
3339 static void btrfs_truncate(struct inode
*inode
)
3341 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
3343 struct btrfs_trans_handle
*trans
;
3345 u64 mask
= root
->sectorsize
- 1;
3347 if (!S_ISREG(inode
->i_mode
))
3349 if (IS_APPEND(inode
) || IS_IMMUTABLE(inode
))
3352 btrfs_truncate_page(inode
->i_mapping
, inode
->i_size
);
3353 btrfs_wait_ordered_range(inode
, inode
->i_size
& (~mask
), (u64
)-1);
3355 trans
= btrfs_start_transaction(root
, 1);
3356 btrfs_set_trans_block_group(trans
, inode
);
3357 btrfs_i_size_write(inode
, inode
->i_size
);
3359 ret
= btrfs_orphan_add(trans
, inode
);
3362 /* FIXME, add redo link to tree so we don't leak on crash */
3363 ret
= btrfs_truncate_inode_items(trans
, root
, inode
, inode
->i_size
,
3364 BTRFS_EXTENT_DATA_KEY
);
3365 btrfs_update_inode(trans
, root
, inode
);
3367 ret
= btrfs_orphan_del(trans
, inode
);
3371 nr
= trans
->blocks_used
;
3372 ret
= btrfs_end_transaction_throttle(trans
, root
);
3374 btrfs_btree_balance_dirty(root
, nr
);
3378 * Invalidate a single dcache entry at the root of the filesystem.
3379 * Needed after creation of snapshot or subvolume.
3381 void btrfs_invalidate_dcache_root(struct btrfs_root
*root
, char *name
,
3384 struct dentry
*alias
, *entry
;
3387 alias
= d_find_alias(root
->fs_info
->sb
->s_root
->d_inode
);
3391 /* change me if btrfs ever gets a d_hash operation */
3392 qstr
.hash
= full_name_hash(qstr
.name
, qstr
.len
);
3393 entry
= d_lookup(alias
, &qstr
);
3396 d_invalidate(entry
);
3403 * create a new subvolume directory/inode (helper for the ioctl).
3405 int btrfs_create_subvol_root(struct btrfs_root
*new_root
,
3406 struct btrfs_trans_handle
*trans
, u64 new_dirid
,
3407 struct btrfs_block_group_cache
*block_group
)
3409 struct inode
*inode
;
3412 inode
= btrfs_new_inode(trans
, new_root
, NULL
, "..", 2, new_dirid
,
3413 new_dirid
, block_group
, S_IFDIR
| 0700, &index
);
3415 return PTR_ERR(inode
);
3416 inode
->i_op
= &btrfs_dir_inode_operations
;
3417 inode
->i_fop
= &btrfs_dir_file_operations
;
3418 new_root
->inode
= inode
;
3421 btrfs_i_size_write(inode
, 0);
3423 return btrfs_update_inode(trans
, new_root
, inode
);
3426 /* helper function for file defrag and space balancing. This
3427 * forces readahead on a given range of bytes in an inode
3429 unsigned long btrfs_force_ra(struct address_space
*mapping
,
3430 struct file_ra_state
*ra
, struct file
*file
,
3431 pgoff_t offset
, pgoff_t last_index
)
3433 pgoff_t req_size
= last_index
- offset
+ 1;
3435 page_cache_sync_readahead(mapping
, ra
, file
, offset
, req_size
);
3436 return offset
+ req_size
;
3439 struct inode
*btrfs_alloc_inode(struct super_block
*sb
)
3441 struct btrfs_inode
*ei
;
3443 ei
= kmem_cache_alloc(btrfs_inode_cachep
, GFP_NOFS
);
3447 ei
->logged_trans
= 0;
3448 btrfs_ordered_inode_tree_init(&ei
->ordered_tree
);
3449 ei
->i_acl
= BTRFS_ACL_NOT_CACHED
;
3450 ei
->i_default_acl
= BTRFS_ACL_NOT_CACHED
;
3451 INIT_LIST_HEAD(&ei
->i_orphan
);
3452 return &ei
->vfs_inode
;
3455 void btrfs_destroy_inode(struct inode
*inode
)
3457 struct btrfs_ordered_extent
*ordered
;
3458 WARN_ON(!list_empty(&inode
->i_dentry
));
3459 WARN_ON(inode
->i_data
.nrpages
);
3461 if (BTRFS_I(inode
)->i_acl
&&
3462 BTRFS_I(inode
)->i_acl
!= BTRFS_ACL_NOT_CACHED
)
3463 posix_acl_release(BTRFS_I(inode
)->i_acl
);
3464 if (BTRFS_I(inode
)->i_default_acl
&&
3465 BTRFS_I(inode
)->i_default_acl
!= BTRFS_ACL_NOT_CACHED
)
3466 posix_acl_release(BTRFS_I(inode
)->i_default_acl
);
3468 spin_lock(&BTRFS_I(inode
)->root
->list_lock
);
3469 if (!list_empty(&BTRFS_I(inode
)->i_orphan
)) {
3470 printk(KERN_ERR
"BTRFS: inode %lu: inode still on the orphan"
3471 " list\n", inode
->i_ino
);
3474 spin_unlock(&BTRFS_I(inode
)->root
->list_lock
);
3477 ordered
= btrfs_lookup_first_ordered_extent(inode
, (u64
)-1);
3481 printk("found ordered extent %Lu %Lu\n",
3482 ordered
->file_offset
, ordered
->len
);
3483 btrfs_remove_ordered_extent(inode
, ordered
);
3484 btrfs_put_ordered_extent(ordered
);
3485 btrfs_put_ordered_extent(ordered
);
3488 btrfs_drop_extent_cache(inode
, 0, (u64
)-1, 0);
3489 kmem_cache_free(btrfs_inode_cachep
, BTRFS_I(inode
));
3492 static void init_once(void *foo
)
3494 struct btrfs_inode
*ei
= (struct btrfs_inode
*) foo
;
3496 inode_init_once(&ei
->vfs_inode
);
3499 void btrfs_destroy_cachep(void)
3501 if (btrfs_inode_cachep
)
3502 kmem_cache_destroy(btrfs_inode_cachep
);
3503 if (btrfs_trans_handle_cachep
)
3504 kmem_cache_destroy(btrfs_trans_handle_cachep
);
3505 if (btrfs_transaction_cachep
)
3506 kmem_cache_destroy(btrfs_transaction_cachep
);
3507 if (btrfs_bit_radix_cachep
)
3508 kmem_cache_destroy(btrfs_bit_radix_cachep
);
3509 if (btrfs_path_cachep
)
3510 kmem_cache_destroy(btrfs_path_cachep
);
3513 struct kmem_cache
*btrfs_cache_create(const char *name
, size_t size
,
3514 unsigned long extra_flags
,
3515 void (*ctor
)(void *))
3517 return kmem_cache_create(name
, size
, 0, (SLAB_RECLAIM_ACCOUNT
|
3518 SLAB_MEM_SPREAD
| extra_flags
), ctor
);
3521 int btrfs_init_cachep(void)
3523 btrfs_inode_cachep
= btrfs_cache_create("btrfs_inode_cache",
3524 sizeof(struct btrfs_inode
),
3526 if (!btrfs_inode_cachep
)
3528 btrfs_trans_handle_cachep
=
3529 btrfs_cache_create("btrfs_trans_handle_cache",
3530 sizeof(struct btrfs_trans_handle
),
3532 if (!btrfs_trans_handle_cachep
)
3534 btrfs_transaction_cachep
= btrfs_cache_create("btrfs_transaction_cache",
3535 sizeof(struct btrfs_transaction
),
3537 if (!btrfs_transaction_cachep
)
3539 btrfs_path_cachep
= btrfs_cache_create("btrfs_path_cache",
3540 sizeof(struct btrfs_path
),
3542 if (!btrfs_path_cachep
)
3544 btrfs_bit_radix_cachep
= btrfs_cache_create("btrfs_radix", 256,
3545 SLAB_DESTROY_BY_RCU
, NULL
);
3546 if (!btrfs_bit_radix_cachep
)
3550 btrfs_destroy_cachep();
3554 static int btrfs_getattr(struct vfsmount
*mnt
,
3555 struct dentry
*dentry
, struct kstat
*stat
)
3557 struct inode
*inode
= dentry
->d_inode
;
3558 generic_fillattr(inode
, stat
);
3559 stat
->blksize
= PAGE_CACHE_SIZE
;
3560 stat
->blocks
= (inode_get_bytes(inode
) +
3561 BTRFS_I(inode
)->delalloc_bytes
) >> 9;
3565 static int btrfs_rename(struct inode
* old_dir
, struct dentry
*old_dentry
,
3566 struct inode
* new_dir
,struct dentry
*new_dentry
)
3568 struct btrfs_trans_handle
*trans
;
3569 struct btrfs_root
*root
= BTRFS_I(old_dir
)->root
;
3570 struct inode
*new_inode
= new_dentry
->d_inode
;
3571 struct inode
*old_inode
= old_dentry
->d_inode
;
3572 struct timespec ctime
= CURRENT_TIME
;
3576 if (S_ISDIR(old_inode
->i_mode
) && new_inode
&&
3577 new_inode
->i_size
> BTRFS_EMPTY_DIR_SIZE
) {
3581 ret
= btrfs_check_free_space(root
, 1, 0);
3585 trans
= btrfs_start_transaction(root
, 1);
3587 btrfs_set_trans_block_group(trans
, new_dir
);
3589 btrfs_inc_nlink(old_dentry
->d_inode
);
3590 old_dir
->i_ctime
= old_dir
->i_mtime
= ctime
;
3591 new_dir
->i_ctime
= new_dir
->i_mtime
= ctime
;
3592 old_inode
->i_ctime
= ctime
;
3594 ret
= btrfs_unlink_inode(trans
, root
, old_dir
, old_dentry
->d_inode
,
3595 old_dentry
->d_name
.name
,
3596 old_dentry
->d_name
.len
);
3601 new_inode
->i_ctime
= CURRENT_TIME
;
3602 ret
= btrfs_unlink_inode(trans
, root
, new_dir
,
3603 new_dentry
->d_inode
,
3604 new_dentry
->d_name
.name
,
3605 new_dentry
->d_name
.len
);
3608 if (new_inode
->i_nlink
== 0) {
3609 ret
= btrfs_orphan_add(trans
, new_dentry
->d_inode
);
3615 ret
= btrfs_set_inode_index(new_dir
, old_inode
, &index
);
3619 ret
= btrfs_add_link(trans
, new_dentry
->d_parent
->d_inode
,
3620 old_inode
, new_dentry
->d_name
.name
,
3621 new_dentry
->d_name
.len
, 1, index
);
3626 btrfs_end_transaction_throttle(trans
, root
);
3632 * some fairly slow code that needs optimization. This walks the list
3633 * of all the inodes with pending delalloc and forces them to disk.
3635 int btrfs_start_delalloc_inodes(struct btrfs_root
*root
)
3637 struct list_head
*head
= &root
->fs_info
->delalloc_inodes
;
3638 struct btrfs_inode
*binode
;
3639 struct inode
*inode
;
3640 unsigned long flags
;
3642 spin_lock_irqsave(&root
->fs_info
->delalloc_lock
, flags
);
3643 while(!list_empty(head
)) {
3644 binode
= list_entry(head
->next
, struct btrfs_inode
,
3646 inode
= igrab(&binode
->vfs_inode
);
3648 list_del_init(&binode
->delalloc_inodes
);
3649 spin_unlock_irqrestore(&root
->fs_info
->delalloc_lock
, flags
);
3651 filemap_flush(inode
->i_mapping
);
3655 spin_lock_irqsave(&root
->fs_info
->delalloc_lock
, flags
);
3657 spin_unlock_irqrestore(&root
->fs_info
->delalloc_lock
, flags
);
3659 /* the filemap_flush will queue IO into the worker threads, but
3660 * we have to make sure the IO is actually started and that
3661 * ordered extents get created before we return
3663 atomic_inc(&root
->fs_info
->async_submit_draining
);
3664 while(atomic_read(&root
->fs_info
->nr_async_submits
)) {
3665 wait_event(root
->fs_info
->async_submit_wait
,
3666 (atomic_read(&root
->fs_info
->nr_async_submits
) == 0));
3668 atomic_dec(&root
->fs_info
->async_submit_draining
);
3672 static int btrfs_symlink(struct inode
*dir
, struct dentry
*dentry
,
3673 const char *symname
)
3675 struct btrfs_trans_handle
*trans
;
3676 struct btrfs_root
*root
= BTRFS_I(dir
)->root
;
3677 struct btrfs_path
*path
;
3678 struct btrfs_key key
;
3679 struct inode
*inode
= NULL
;
3687 struct btrfs_file_extent_item
*ei
;
3688 struct extent_buffer
*leaf
;
3689 unsigned long nr
= 0;
3691 name_len
= strlen(symname
) + 1;
3692 if (name_len
> BTRFS_MAX_INLINE_DATA_SIZE(root
))
3693 return -ENAMETOOLONG
;
3695 err
= btrfs_check_free_space(root
, 1, 0);
3699 trans
= btrfs_start_transaction(root
, 1);
3700 btrfs_set_trans_block_group(trans
, dir
);
3702 err
= btrfs_find_free_objectid(trans
, root
, dir
->i_ino
, &objectid
);
3708 inode
= btrfs_new_inode(trans
, root
, dir
, dentry
->d_name
.name
,
3710 dentry
->d_parent
->d_inode
->i_ino
, objectid
,
3711 BTRFS_I(dir
)->block_group
, S_IFLNK
|S_IRWXUGO
,
3713 err
= PTR_ERR(inode
);
3717 err
= btrfs_init_acl(inode
, dir
);
3723 btrfs_set_trans_block_group(trans
, inode
);
3724 err
= btrfs_add_nondir(trans
, dentry
, inode
, 0, index
);
3728 inode
->i_mapping
->a_ops
= &btrfs_aops
;
3729 inode
->i_mapping
->backing_dev_info
= &root
->fs_info
->bdi
;
3730 inode
->i_fop
= &btrfs_file_operations
;
3731 inode
->i_op
= &btrfs_file_inode_operations
;
3732 BTRFS_I(inode
)->io_tree
.ops
= &btrfs_extent_io_ops
;
3734 dir
->i_sb
->s_dirt
= 1;
3735 btrfs_update_inode_block_group(trans
, inode
);
3736 btrfs_update_inode_block_group(trans
, dir
);
3740 path
= btrfs_alloc_path();
3742 key
.objectid
= inode
->i_ino
;
3744 btrfs_set_key_type(&key
, BTRFS_EXTENT_DATA_KEY
);
3745 datasize
= btrfs_file_extent_calc_inline_size(name_len
);
3746 err
= btrfs_insert_empty_item(trans
, root
, path
, &key
,
3752 leaf
= path
->nodes
[0];
3753 ei
= btrfs_item_ptr(leaf
, path
->slots
[0],
3754 struct btrfs_file_extent_item
);
3755 btrfs_set_file_extent_generation(leaf
, ei
, trans
->transid
);
3756 btrfs_set_file_extent_type(leaf
, ei
,
3757 BTRFS_FILE_EXTENT_INLINE
);
3758 ptr
= btrfs_file_extent_inline_start(ei
);
3759 write_extent_buffer(leaf
, symname
, ptr
, name_len
);
3760 btrfs_mark_buffer_dirty(leaf
);
3761 btrfs_free_path(path
);
3763 inode
->i_op
= &btrfs_symlink_inode_operations
;
3764 inode
->i_mapping
->a_ops
= &btrfs_symlink_aops
;
3765 inode
->i_mapping
->backing_dev_info
= &root
->fs_info
->bdi
;
3766 btrfs_i_size_write(inode
, name_len
- 1);
3767 err
= btrfs_update_inode(trans
, root
, inode
);
3772 nr
= trans
->blocks_used
;
3773 btrfs_end_transaction_throttle(trans
, root
);
3776 inode_dec_link_count(inode
);
3779 btrfs_btree_balance_dirty(root
, nr
);
3783 static int btrfs_set_page_dirty(struct page
*page
)
3785 return __set_page_dirty_nobuffers(page
);
3788 static int btrfs_permission(struct inode
*inode
, int mask
)
3790 if (btrfs_test_flag(inode
, READONLY
) && (mask
& MAY_WRITE
))
3792 return generic_permission(inode
, mask
, btrfs_check_acl
);
3795 static struct inode_operations btrfs_dir_inode_operations
= {
3796 .lookup
= btrfs_lookup
,
3797 .create
= btrfs_create
,
3798 .unlink
= btrfs_unlink
,
3800 .mkdir
= btrfs_mkdir
,
3801 .rmdir
= btrfs_rmdir
,
3802 .rename
= btrfs_rename
,
3803 .symlink
= btrfs_symlink
,
3804 .setattr
= btrfs_setattr
,
3805 .mknod
= btrfs_mknod
,
3806 .setxattr
= btrfs_setxattr
,
3807 .getxattr
= btrfs_getxattr
,
3808 .listxattr
= btrfs_listxattr
,
3809 .removexattr
= btrfs_removexattr
,
3810 .permission
= btrfs_permission
,
3812 static struct inode_operations btrfs_dir_ro_inode_operations
= {
3813 .lookup
= btrfs_lookup
,
3814 .permission
= btrfs_permission
,
3816 static struct file_operations btrfs_dir_file_operations
= {
3817 .llseek
= generic_file_llseek
,
3818 .read
= generic_read_dir
,
3819 .readdir
= btrfs_real_readdir
,
3820 .unlocked_ioctl
= btrfs_ioctl
,
3821 #ifdef CONFIG_COMPAT
3822 .compat_ioctl
= btrfs_ioctl
,
3824 .release
= btrfs_release_file
,
3825 .fsync
= btrfs_sync_file
,
3828 static struct extent_io_ops btrfs_extent_io_ops
= {
3829 .fill_delalloc
= run_delalloc_range
,
3830 .submit_bio_hook
= btrfs_submit_bio_hook
,
3831 .merge_bio_hook
= btrfs_merge_bio_hook
,
3832 .readpage_end_io_hook
= btrfs_readpage_end_io_hook
,
3833 .writepage_end_io_hook
= btrfs_writepage_end_io_hook
,
3834 .writepage_start_hook
= btrfs_writepage_start_hook
,
3835 .readpage_io_failed_hook
= btrfs_io_failed_hook
,
3836 .set_bit_hook
= btrfs_set_bit_hook
,
3837 .clear_bit_hook
= btrfs_clear_bit_hook
,
3840 static struct address_space_operations btrfs_aops
= {
3841 .readpage
= btrfs_readpage
,
3842 .writepage
= btrfs_writepage
,
3843 .writepages
= btrfs_writepages
,
3844 .readpages
= btrfs_readpages
,
3845 .sync_page
= block_sync_page
,
3847 .direct_IO
= btrfs_direct_IO
,
3848 .invalidatepage
= btrfs_invalidatepage
,
3849 .releasepage
= btrfs_releasepage
,
3850 .set_page_dirty
= btrfs_set_page_dirty
,
3853 static struct address_space_operations btrfs_symlink_aops
= {
3854 .readpage
= btrfs_readpage
,
3855 .writepage
= btrfs_writepage
,
3856 .invalidatepage
= btrfs_invalidatepage
,
3857 .releasepage
= btrfs_releasepage
,
3860 static struct inode_operations btrfs_file_inode_operations
= {
3861 .truncate
= btrfs_truncate
,
3862 .getattr
= btrfs_getattr
,
3863 .setattr
= btrfs_setattr
,
3864 .setxattr
= btrfs_setxattr
,
3865 .getxattr
= btrfs_getxattr
,
3866 .listxattr
= btrfs_listxattr
,
3867 .removexattr
= btrfs_removexattr
,
3868 .permission
= btrfs_permission
,
3870 static struct inode_operations btrfs_special_inode_operations
= {
3871 .getattr
= btrfs_getattr
,
3872 .setattr
= btrfs_setattr
,
3873 .permission
= btrfs_permission
,
3874 .setxattr
= btrfs_setxattr
,
3875 .getxattr
= btrfs_getxattr
,
3876 .listxattr
= btrfs_listxattr
,
3877 .removexattr
= btrfs_removexattr
,
3879 static struct inode_operations btrfs_symlink_inode_operations
= {
3880 .readlink
= generic_readlink
,
3881 .follow_link
= page_follow_link_light
,
3882 .put_link
= page_put_link
,
3883 .permission
= btrfs_permission
,