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.
20 #include <linux/pagemap.h>
21 #include <linux/highmem.h>
22 #include <linux/time.h>
23 #include <linux/init.h>
24 #include <linux/string.h>
25 #include <linux/smp_lock.h>
26 #include <linux/backing-dev.h>
27 #include <linux/mpage.h>
28 #include <linux/swap.h>
29 #include <linux/writeback.h>
30 #include <linux/statfs.h>
31 #include <linux/compat.h>
32 #include <linux/version.h>
35 #include "transaction.h"
36 #include "btrfs_inode.h"
38 #include "print-tree.h"
41 static int btrfs_copy_from_user(loff_t pos
, int num_pages
, int write_bytes
,
42 struct page
**prepared_pages
,
43 const char __user
* buf
)
47 int offset
= pos
& (PAGE_CACHE_SIZE
- 1);
49 for (i
= 0; i
< num_pages
&& write_bytes
> 0; i
++, offset
= 0) {
50 size_t count
= min_t(size_t,
51 PAGE_CACHE_SIZE
- offset
, write_bytes
);
52 struct page
*page
= prepared_pages
[i
];
53 fault_in_pages_readable(buf
, count
);
55 /* Copy data from userspace to the current page */
57 page_fault
= __copy_from_user(page_address(page
) + offset
,
59 /* Flush processor's dcache for this page */
60 flush_dcache_page(page
);
68 return page_fault
? -EFAULT
: 0;
71 static void btrfs_drop_pages(struct page
**pages
, size_t num_pages
)
74 for (i
= 0; i
< num_pages
; i
++) {
77 unlock_page(pages
[i
]);
78 mark_page_accessed(pages
[i
]);
79 page_cache_release(pages
[i
]);
83 static int noinline
insert_inline_extent(struct btrfs_trans_handle
*trans
,
84 struct btrfs_root
*root
, struct inode
*inode
,
85 u64 offset
, size_t size
,
86 struct page
**pages
, size_t page_offset
,
90 struct btrfs_path
*path
;
91 struct extent_buffer
*leaf
;
94 struct btrfs_file_extent_item
*ei
;
102 path
= btrfs_alloc_path();
106 btrfs_set_trans_block_group(trans
, inode
);
108 key
.objectid
= inode
->i_ino
;
110 btrfs_set_key_type(&key
, BTRFS_EXTENT_DATA_KEY
);
112 ret
= btrfs_search_slot(trans
, root
, &key
, path
, 0, 1);
118 struct btrfs_key found_key
;
120 if (path
->slots
[0] == 0)
124 leaf
= path
->nodes
[0];
125 btrfs_item_key_to_cpu(leaf
, &found_key
, path
->slots
[0]);
127 if (found_key
.objectid
!= inode
->i_ino
)
130 if (found_key
.type
!= BTRFS_EXTENT_DATA_KEY
)
132 ei
= btrfs_item_ptr(leaf
, path
->slots
[0],
133 struct btrfs_file_extent_item
);
135 if (btrfs_file_extent_type(leaf
, ei
) !=
136 BTRFS_FILE_EXTENT_INLINE
) {
139 btrfs_item_key_to_cpu(leaf
, &key
, path
->slots
[0]);
146 leaf
= path
->nodes
[0];
147 ei
= btrfs_item_ptr(leaf
, path
->slots
[0],
148 struct btrfs_file_extent_item
);
150 if (btrfs_file_extent_type(leaf
, ei
) !=
151 BTRFS_FILE_EXTENT_INLINE
) {
153 btrfs_print_leaf(root
, leaf
);
154 printk("found wasn't inline offset %Lu inode %lu\n",
155 offset
, inode
->i_ino
);
158 found_size
= btrfs_file_extent_inline_len(leaf
,
159 btrfs_item_nr(leaf
, path
->slots
[0]));
160 found_end
= key
.offset
+ found_size
;
162 if (found_end
< offset
+ size
) {
163 btrfs_release_path(root
, path
);
164 ret
= btrfs_search_slot(trans
, root
, &key
, path
,
165 offset
+ size
- found_end
, 1);
168 ret
= btrfs_extend_item(trans
, root
, path
,
169 offset
+ size
- found_end
);
174 leaf
= path
->nodes
[0];
175 ei
= btrfs_item_ptr(leaf
, path
->slots
[0],
176 struct btrfs_file_extent_item
);
178 if (found_end
< offset
) {
179 ptr
= btrfs_file_extent_inline_start(ei
) + found_size
;
180 memset_extent_buffer(leaf
, 0, ptr
, offset
- found_end
);
184 btrfs_release_path(root
, path
);
185 datasize
= offset
+ size
- key
.offset
;
186 datasize
= btrfs_file_extent_calc_inline_size(datasize
);
187 ret
= btrfs_insert_empty_item(trans
, root
, path
, &key
,
191 printk("got bad ret %d\n", ret
);
194 leaf
= path
->nodes
[0];
195 ei
= btrfs_item_ptr(leaf
, path
->slots
[0],
196 struct btrfs_file_extent_item
);
197 btrfs_set_file_extent_generation(leaf
, ei
, trans
->transid
);
198 btrfs_set_file_extent_type(leaf
, ei
, BTRFS_FILE_EXTENT_INLINE
);
200 ptr
= btrfs_file_extent_inline_start(ei
) + offset
- key
.offset
;
206 kaddr
= kmap_atomic(page
, KM_USER0
);
207 cur_size
= min_t(size_t, PAGE_CACHE_SIZE
- page_offset
, size
);
208 write_extent_buffer(leaf
, kaddr
+ page_offset
, ptr
, cur_size
);
209 kunmap_atomic(kaddr
, KM_USER0
);
213 if (i
>= num_pages
) {
214 printk("i %d num_pages %d\n", i
, num_pages
);
218 btrfs_mark_buffer_dirty(leaf
);
220 btrfs_free_path(path
);
224 static int noinline
dirty_and_release_pages(struct btrfs_trans_handle
*trans
,
225 struct btrfs_root
*root
,
234 struct inode
*inode
= fdentry(file
)->d_inode
;
235 struct extent_map
*em
;
236 struct extent_map_tree
*em_tree
= &BTRFS_I(inode
)->extent_tree
;
240 u64 end_of_last_block
;
241 u64 end_pos
= pos
+ write_bytes
;
243 loff_t isize
= i_size_read(inode
);
244 em
= alloc_extent_map(GFP_NOFS
);
248 em
->bdev
= inode
->i_sb
->s_bdev
;
250 start_pos
= pos
& ~((u64
)root
->sectorsize
- 1);
251 num_bytes
= (write_bytes
+ pos
- start_pos
+
252 root
->sectorsize
- 1) & ~((u64
)root
->sectorsize
- 1);
254 end_of_last_block
= start_pos
+ num_bytes
- 1;
256 lock_extent(em_tree
, start_pos
, end_of_last_block
, GFP_NOFS
);
257 mutex_lock(&root
->fs_info
->fs_mutex
);
258 trans
= btrfs_start_transaction(root
, 1);
263 btrfs_set_trans_block_group(trans
, inode
);
264 inode
->i_blocks
+= num_bytes
>> 9;
267 if ((end_of_last_block
& 4095) == 0) {
268 printk("strange end of last %Lu %zu %Lu\n", start_pos
, write_bytes
, end_of_last_block
);
270 set_extent_uptodate(em_tree
, start_pos
, end_of_last_block
, GFP_NOFS
);
272 /* FIXME...EIEIO, ENOSPC and more */
274 /* insert any holes we need to create */
275 if (inode
->i_size
< start_pos
) {
276 u64 last_pos_in_file
;
278 u64 mask
= root
->sectorsize
- 1;
279 last_pos_in_file
= (isize
+ mask
) & ~mask
;
280 hole_size
= (start_pos
- last_pos_in_file
+ mask
) & ~mask
;
282 if (last_pos_in_file
< start_pos
) {
283 err
= btrfs_drop_extents(trans
, root
, inode
,
285 last_pos_in_file
+ hole_size
,
291 err
= btrfs_insert_file_extent(trans
, root
,
301 * either allocate an extent for the new bytes or setup the key
302 * to show we are doing inline data in the extent
304 inline_size
= end_pos
;
305 if (isize
>= BTRFS_MAX_INLINE_DATA_SIZE(root
) ||
306 inline_size
> 8192 ||
307 inline_size
>= BTRFS_MAX_INLINE_DATA_SIZE(root
)) {
309 u64 existing_delalloc
= 0;
311 for (i
= 0; i
< num_pages
; i
++) {
312 struct page
*p
= pages
[i
];
316 last_end
= (u64
)(pages
[num_pages
-1]->index
) <<
318 last_end
+= PAGE_CACHE_SIZE
- 1;
319 if (start_pos
< isize
) {
320 u64 delalloc_start
= start_pos
;
321 existing_delalloc
= count_range_bits(em_tree
,
323 end_of_last_block
, (u64
)-1,
326 set_extent_delalloc(em_tree
, start_pos
, end_of_last_block
,
328 spin_lock(&root
->fs_info
->delalloc_lock
);
329 root
->fs_info
->delalloc_bytes
+= (end_of_last_block
+ 1 -
330 start_pos
) - existing_delalloc
;
331 spin_unlock(&root
->fs_info
->delalloc_lock
);
334 /* step one, delete the existing extents in this range */
335 aligned_end
= (pos
+ write_bytes
+ root
->sectorsize
- 1) &
336 ~((u64
)root
->sectorsize
- 1);
337 err
= btrfs_drop_extents(trans
, root
, inode
, start_pos
,
338 aligned_end
, aligned_end
, &hint_byte
);
341 if (isize
> inline_size
)
342 inline_size
= min_t(u64
, isize
, aligned_end
);
343 inline_size
-= start_pos
;
344 err
= insert_inline_extent(trans
, root
, inode
, start_pos
,
345 inline_size
, pages
, 0, num_pages
);
348 if (end_pos
> isize
) {
349 i_size_write(inode
, end_pos
);
350 btrfs_update_inode(trans
, root
, inode
);
353 err
= btrfs_end_transaction(trans
, root
);
355 mutex_unlock(&root
->fs_info
->fs_mutex
);
356 unlock_extent(em_tree
, start_pos
, end_of_last_block
, GFP_NOFS
);
361 int btrfs_drop_extent_cache(struct inode
*inode
, u64 start
, u64 end
)
363 struct extent_map
*em
;
364 struct extent_map_tree
*em_tree
= &BTRFS_I(inode
)->extent_tree
;
367 em
= lookup_extent_mapping(em_tree
, start
, end
);
370 remove_extent_mapping(em_tree
, em
);
373 /* once for the tree*/
380 * this is very complex, but the basic idea is to drop all extents
381 * in the range start - end. hint_block is filled in with a block number
382 * that would be a good hint to the block allocator for this file.
384 * If an extent intersects the range but is not entirely inside the range
385 * it is either truncated or split. Anything entirely inside the range
386 * is deleted from the tree.
388 int btrfs_drop_extents(struct btrfs_trans_handle
*trans
,
389 struct btrfs_root
*root
, struct inode
*inode
,
390 u64 start
, u64 end
, u64 inline_limit
, u64
*hint_byte
)
393 u64 search_start
= start
;
394 struct extent_buffer
*leaf
;
395 struct btrfs_file_extent_item
*extent
;
396 struct btrfs_path
*path
;
397 struct btrfs_key key
;
398 struct btrfs_file_extent_item old
;
408 btrfs_drop_extent_cache(inode
, start
, end
- 1);
410 path
= btrfs_alloc_path();
415 btrfs_release_path(root
, path
);
416 ret
= btrfs_lookup_file_extent(trans
, root
, path
, inode
->i_ino
,
421 if (path
->slots
[0] == 0) {
433 leaf
= path
->nodes
[0];
434 slot
= path
->slots
[0];
436 btrfs_item_key_to_cpu(leaf
, &key
, slot
);
437 if (key
.offset
>= end
|| key
.objectid
!= inode
->i_ino
) {
440 if (btrfs_key_type(&key
) > BTRFS_EXTENT_DATA_KEY
) {
444 search_start
= key
.offset
;
447 if (btrfs_key_type(&key
) == BTRFS_EXTENT_DATA_KEY
) {
448 extent
= btrfs_item_ptr(leaf
, slot
,
449 struct btrfs_file_extent_item
);
450 found_type
= btrfs_file_extent_type(leaf
, extent
);
451 if (found_type
== BTRFS_FILE_EXTENT_REG
) {
453 btrfs_file_extent_disk_bytenr(leaf
,
456 *hint_byte
= extent_end
;
458 extent_end
= key
.offset
+
459 btrfs_file_extent_num_bytes(leaf
, extent
);
461 } else if (found_type
== BTRFS_FILE_EXTENT_INLINE
) {
462 struct btrfs_item
*item
;
463 item
= btrfs_item_nr(leaf
, slot
);
465 extent_end
= key
.offset
+
466 btrfs_file_extent_inline_len(leaf
, item
);
469 extent_end
= search_start
;
472 /* we found nothing we can drop */
473 if ((!found_extent
&& !found_inline
) ||
474 search_start
>= extent_end
) {
477 nritems
= btrfs_header_nritems(leaf
);
478 if (slot
>= nritems
- 1) {
479 nextret
= btrfs_next_leaf(root
, path
);
490 u64 mask
= root
->sectorsize
- 1;
491 search_start
= (extent_end
+ mask
) & ~mask
;
493 search_start
= extent_end
;
494 if (end
<= extent_end
&& start
>= key
.offset
&& found_inline
) {
495 *hint_byte
= EXTENT_MAP_INLINE
;
498 if (end
< extent_end
&& end
>= key
.offset
) {
501 btrfs_file_extent_disk_bytenr(leaf
, extent
);
503 btrfs_file_extent_disk_num_bytes(leaf
,
505 read_extent_buffer(leaf
, &old
,
506 (unsigned long)extent
,
508 if (disk_bytenr
!= 0) {
509 ret
= btrfs_inc_extent_ref(trans
, root
,
510 disk_bytenr
, disk_num_bytes
,
511 root
->root_key
.objectid
,
518 if (found_inline
&& start
<= key
.offset
&&
519 inline_limit
< extent_end
)
522 /* truncate existing extent */
523 if (start
> key
.offset
) {
527 WARN_ON(start
& (root
->sectorsize
- 1));
529 new_num
= start
- key
.offset
;
530 old_num
= btrfs_file_extent_num_bytes(leaf
,
533 btrfs_file_extent_disk_bytenr(leaf
,
535 if (btrfs_file_extent_disk_bytenr(leaf
,
538 (old_num
- new_num
) >> 9;
540 btrfs_set_file_extent_num_bytes(leaf
, extent
,
542 btrfs_mark_buffer_dirty(leaf
);
543 } else if (key
.offset
< inline_limit
&&
544 (end
> extent_end
) &&
545 (inline_limit
< extent_end
)) {
547 new_size
= btrfs_file_extent_calc_inline_size(
548 inline_limit
- key
.offset
);
549 btrfs_truncate_item(trans
, root
, path
,
553 /* delete the entire extent */
556 u64 disk_num_bytes
= 0;
557 u64 extent_num_bytes
= 0;
561 root_gen
= btrfs_header_generation(leaf
);
562 root_owner
= btrfs_header_owner(leaf
);
565 btrfs_file_extent_disk_bytenr(leaf
,
568 btrfs_file_extent_disk_num_bytes(leaf
,
571 btrfs_file_extent_num_bytes(leaf
, extent
);
573 btrfs_file_extent_disk_bytenr(leaf
,
576 ret
= btrfs_del_item(trans
, root
, path
);
577 /* TODO update progress marker and return */
579 btrfs_release_path(root
, path
);
581 if (found_extent
&& disk_bytenr
!= 0) {
582 inode
->i_blocks
-= extent_num_bytes
>> 9;
583 ret
= btrfs_free_extent(trans
, root
,
587 root_gen
, inode
->i_ino
,
592 if (!bookend
&& search_start
>= end
) {
599 if (bookend
&& found_inline
&& start
<= key
.offset
&&
600 inline_limit
< extent_end
&& key
.offset
<= inline_limit
) {
602 new_size
= btrfs_file_extent_calc_inline_size(
603 extent_end
- inline_limit
);
604 btrfs_truncate_item(trans
, root
, path
, new_size
, 0);
606 /* create bookend, splitting the extent in two */
607 if (bookend
&& found_extent
) {
608 struct btrfs_key ins
;
609 ins
.objectid
= inode
->i_ino
;
611 btrfs_set_key_type(&ins
, BTRFS_EXTENT_DATA_KEY
);
612 btrfs_release_path(root
, path
);
613 ret
= btrfs_insert_empty_item(trans
, root
, path
, &ins
,
616 leaf
= path
->nodes
[0];
618 btrfs_print_leaf(root
, leaf
);
619 printk("got %d on inserting %Lu %u %Lu start %Lu end %Lu found %Lu %Lu keep was %d\n", ret
, ins
.objectid
, ins
.type
, ins
.offset
, start
, end
, key
.offset
, extent_end
, keep
);
622 extent
= btrfs_item_ptr(leaf
, path
->slots
[0],
623 struct btrfs_file_extent_item
);
624 write_extent_buffer(leaf
, &old
,
625 (unsigned long)extent
, sizeof(old
));
627 btrfs_set_file_extent_offset(leaf
, extent
,
628 le64_to_cpu(old
.offset
) + end
- key
.offset
);
629 WARN_ON(le64_to_cpu(old
.num_bytes
) <
631 btrfs_set_file_extent_num_bytes(leaf
, extent
,
633 btrfs_set_file_extent_type(leaf
, extent
,
634 BTRFS_FILE_EXTENT_REG
);
636 btrfs_mark_buffer_dirty(path
->nodes
[0]);
637 if (le64_to_cpu(old
.disk_bytenr
) != 0) {
639 btrfs_file_extent_num_bytes(leaf
,
647 btrfs_free_path(path
);
652 * this gets pages into the page cache and locks them down
654 static int prepare_pages(struct btrfs_root
*root
, struct file
*file
,
655 struct page
**pages
, size_t num_pages
,
656 loff_t pos
, unsigned long first_index
,
657 unsigned long last_index
, size_t write_bytes
)
660 unsigned long index
= pos
>> PAGE_CACHE_SHIFT
;
661 struct inode
*inode
= fdentry(file
)->d_inode
;
665 start_pos
= pos
& ~((u64
)root
->sectorsize
- 1);
667 memset(pages
, 0, num_pages
* sizeof(struct page
*));
669 for (i
= 0; i
< num_pages
; i
++) {
670 pages
[i
] = grab_cache_page(inode
->i_mapping
, index
+ i
);
675 #if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,18)
676 ClearPageDirty(pages
[i
]);
678 cancel_dirty_page(pages
[i
], PAGE_CACHE_SIZE
);
680 wait_on_page_writeback(pages
[i
]);
681 set_page_extent_mapped(pages
[i
]);
682 WARN_ON(!PageLocked(pages
[i
]));
687 static ssize_t
btrfs_file_write(struct file
*file
, const char __user
*buf
,
688 size_t count
, loff_t
*ppos
)
692 ssize_t num_written
= 0;
695 struct inode
*inode
= fdentry(file
)->d_inode
;
696 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
697 struct page
**pages
= NULL
;
699 struct page
*pinned
[2];
700 unsigned long first_index
;
701 unsigned long last_index
;
703 nrptrs
= min((count
+ PAGE_CACHE_SIZE
- 1) / PAGE_CACHE_SIZE
,
704 PAGE_CACHE_SIZE
/ (sizeof(struct page
*)));
707 if (file
->f_flags
& O_DIRECT
)
713 vfs_check_frozen(inode
->i_sb
, SB_FREEZE_WRITE
);
714 current
->backing_dev_info
= inode
->i_mapping
->backing_dev_info
;
715 err
= generic_write_checks(file
, &pos
, &count
, S_ISBLK(inode
->i_mode
));
720 err
= remove_suid(fdentry(file
));
723 file_update_time(file
);
725 pages
= kmalloc(nrptrs
* sizeof(struct page
*), GFP_KERNEL
);
727 down_read(&BTRFS_I(inode
)->root
->snap_sem
);
729 mutex_lock(&inode
->i_mutex
);
730 first_index
= pos
>> PAGE_CACHE_SHIFT
;
731 last_index
= (pos
+ count
) >> PAGE_CACHE_SHIFT
;
734 * there are lots of better ways to do this, but this code
735 * makes sure the first and last page in the file range are
736 * up to date and ready for cow
738 if ((pos
& (PAGE_CACHE_SIZE
- 1))) {
739 pinned
[0] = grab_cache_page(inode
->i_mapping
, first_index
);
740 if (!PageUptodate(pinned
[0])) {
741 ret
= btrfs_readpage(NULL
, pinned
[0]);
743 wait_on_page_locked(pinned
[0]);
745 unlock_page(pinned
[0]);
748 if ((pos
+ count
) & (PAGE_CACHE_SIZE
- 1)) {
749 pinned
[1] = grab_cache_page(inode
->i_mapping
, last_index
);
750 if (!PageUptodate(pinned
[1])) {
751 ret
= btrfs_readpage(NULL
, pinned
[1]);
753 wait_on_page_locked(pinned
[1]);
755 unlock_page(pinned
[1]);
760 size_t offset
= pos
& (PAGE_CACHE_SIZE
- 1);
761 size_t write_bytes
= min(count
, nrptrs
*
762 (size_t)PAGE_CACHE_SIZE
-
764 size_t num_pages
= (write_bytes
+ PAGE_CACHE_SIZE
- 1) >>
767 WARN_ON(num_pages
> nrptrs
);
768 memset(pages
, 0, sizeof(pages
));
770 mutex_lock(&root
->fs_info
->fs_mutex
);
771 ret
= btrfs_check_free_space(root
, write_bytes
, 0);
772 mutex_unlock(&root
->fs_info
->fs_mutex
);
776 ret
= prepare_pages(root
, file
, pages
, num_pages
,
777 pos
, first_index
, last_index
,
782 ret
= btrfs_copy_from_user(pos
, num_pages
,
783 write_bytes
, pages
, buf
);
785 btrfs_drop_pages(pages
, num_pages
);
789 ret
= dirty_and_release_pages(NULL
, root
, file
, pages
,
790 num_pages
, pos
, write_bytes
);
791 btrfs_drop_pages(pages
, num_pages
);
796 count
-= write_bytes
;
798 num_written
+= write_bytes
;
800 balance_dirty_pages_ratelimited_nr(inode
->i_mapping
, num_pages
);
801 if (num_pages
< (root
->leafsize
>> PAGE_CACHE_SHIFT
) + 1)
802 btrfs_btree_balance_dirty(root
, 1);
806 mutex_unlock(&inode
->i_mutex
);
807 up_read(&BTRFS_I(inode
)->root
->snap_sem
);
812 page_cache_release(pinned
[0]);
814 page_cache_release(pinned
[1]);
817 if (num_written
> 0 && ((file
->f_flags
& O_SYNC
) || IS_SYNC(inode
))) {
818 err
= sync_page_range(inode
, inode
->i_mapping
,
819 start_pos
, num_written
);
823 current
->backing_dev_info
= NULL
;
824 return num_written
? num_written
: err
;
827 static int btrfs_sync_file(struct file
*file
,
828 struct dentry
*dentry
, int datasync
)
830 struct inode
*inode
= dentry
->d_inode
;
831 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
833 struct btrfs_trans_handle
*trans
;
836 * check the transaction that last modified this inode
837 * and see if its already been committed
839 mutex_lock(&root
->fs_info
->fs_mutex
);
840 if (!BTRFS_I(inode
)->last_trans
)
842 mutex_lock(&root
->fs_info
->trans_mutex
);
843 if (BTRFS_I(inode
)->last_trans
<=
844 root
->fs_info
->last_trans_committed
) {
845 BTRFS_I(inode
)->last_trans
= 0;
846 mutex_unlock(&root
->fs_info
->trans_mutex
);
849 mutex_unlock(&root
->fs_info
->trans_mutex
);
852 * ok we haven't committed the transaction yet, lets do a commit
854 trans
= btrfs_start_transaction(root
, 1);
859 ret
= btrfs_commit_transaction(trans
, root
);
861 mutex_unlock(&root
->fs_info
->fs_mutex
);
862 return ret
> 0 ? EIO
: ret
;
865 static struct vm_operations_struct btrfs_file_vm_ops
= {
866 #if LINUX_VERSION_CODE < KERNEL_VERSION(2,6,23)
867 .nopage
= filemap_nopage
,
868 .populate
= filemap_populate
,
870 .fault
= filemap_fault
,
872 .page_mkwrite
= btrfs_page_mkwrite
,
875 static int btrfs_file_mmap(struct file
*filp
, struct vm_area_struct
*vma
)
877 vma
->vm_ops
= &btrfs_file_vm_ops
;
882 struct file_operations btrfs_file_operations
= {
883 .llseek
= generic_file_llseek
,
884 .read
= do_sync_read
,
885 .aio_read
= generic_file_aio_read
,
886 .splice_read
= generic_file_splice_read
,
887 #if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,18)
888 .sendfile
= generic_file_sendfile
,
890 .write
= btrfs_file_write
,
891 .mmap
= btrfs_file_mmap
,
892 .open
= generic_file_open
,
893 .fsync
= btrfs_sync_file
,
894 .unlocked_ioctl
= btrfs_ioctl
,
896 .compat_ioctl
= btrfs_ioctl
,