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"
37 #include "ordered-data.h"
39 #include "print-tree.h"
42 static int btrfs_copy_from_user(loff_t pos, int num_pages, int write_bytes,
43 struct page **prepared_pages,
44 const char __user * buf)
48 int offset = pos & (PAGE_CACHE_SIZE - 1);
50 for (i = 0; i < num_pages && write_bytes > 0; i++, offset = 0) {
51 size_t count = min_t(size_t,
52 PAGE_CACHE_SIZE - offset, write_bytes);
53 struct page *page = prepared_pages[i];
54 fault_in_pages_readable(buf, count);
56 /* Copy data from userspace to the current page */
58 page_fault = __copy_from_user(page_address(page) + offset,
60 /* Flush processor's dcache for this page */
61 flush_dcache_page(page);
69 return page_fault ? -EFAULT : 0;
72 static void btrfs_drop_pages(struct page **pages, size_t num_pages)
75 for (i = 0; i < num_pages; i++) {
78 unlock_page(pages[i]);
79 mark_page_accessed(pages[i]);
80 page_cache_release(pages[i]);
84 static int noinline insert_inline_extent(struct btrfs_trans_handle *trans,
85 struct btrfs_root *root, struct inode *inode,
86 u64 offset, size_t size,
87 struct page **pages, size_t page_offset,
91 struct btrfs_path *path;
92 struct extent_buffer *leaf;
95 struct btrfs_file_extent_item *ei;
103 path = btrfs_alloc_path();
107 btrfs_set_trans_block_group(trans, inode);
109 key.objectid = inode->i_ino;
111 btrfs_set_key_type(&key, BTRFS_EXTENT_DATA_KEY);
113 ret = btrfs_search_slot(trans, root, &key, path, 0, 1);
119 struct btrfs_key found_key;
121 if (path->slots[0] == 0)
125 leaf = path->nodes[0];
126 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
128 if (found_key.objectid != inode->i_ino)
131 if (found_key.type != BTRFS_EXTENT_DATA_KEY)
133 ei = btrfs_item_ptr(leaf, path->slots[0],
134 struct btrfs_file_extent_item);
136 if (btrfs_file_extent_type(leaf, ei) !=
137 BTRFS_FILE_EXTENT_INLINE) {
140 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
147 leaf = path->nodes[0];
148 ei = btrfs_item_ptr(leaf, path->slots[0],
149 struct btrfs_file_extent_item);
151 if (btrfs_file_extent_type(leaf, ei) !=
152 BTRFS_FILE_EXTENT_INLINE) {
154 btrfs_print_leaf(root, leaf);
155 printk("found wasn't inline offset %Lu inode %lu\n",
156 offset, inode->i_ino);
159 found_size = btrfs_file_extent_inline_len(leaf,
160 btrfs_item_nr(leaf, path->slots[0]));
161 found_end = key.offset + found_size;
163 if (found_end < offset + size) {
164 btrfs_release_path(root, path);
165 ret = btrfs_search_slot(trans, root, &key, path,
166 offset + size - found_end, 1);
169 ret = btrfs_extend_item(trans, root, path,
170 offset + size - found_end);
175 leaf = path->nodes[0];
176 ei = btrfs_item_ptr(leaf, path->slots[0],
177 struct btrfs_file_extent_item);
179 if (found_end < offset) {
180 ptr = btrfs_file_extent_inline_start(ei) + found_size;
181 memset_extent_buffer(leaf, 0, ptr, offset - found_end);
185 btrfs_release_path(root, path);
186 datasize = offset + size - key.offset;
187 datasize = btrfs_file_extent_calc_inline_size(datasize);
188 ret = btrfs_insert_empty_item(trans, root, path, &key,
192 printk("got bad ret %d\n", ret);
195 leaf = path->nodes[0];
196 ei = btrfs_item_ptr(leaf, path->slots[0],
197 struct btrfs_file_extent_item);
198 btrfs_set_file_extent_generation(leaf, ei, trans->transid);
199 btrfs_set_file_extent_type(leaf, ei, BTRFS_FILE_EXTENT_INLINE);
201 ptr = btrfs_file_extent_inline_start(ei) + offset - key.offset;
207 kaddr = kmap_atomic(page, KM_USER0);
208 cur_size = min_t(size_t, PAGE_CACHE_SIZE - page_offset, size);
209 write_extent_buffer(leaf, kaddr + page_offset, ptr, cur_size);
210 kunmap_atomic(kaddr, KM_USER0);
214 if (i >= num_pages) {
215 printk("i %d num_pages %d\n", i, num_pages);
219 btrfs_mark_buffer_dirty(leaf);
221 btrfs_free_path(path);
225 static int noinline dirty_and_release_pages(struct btrfs_trans_handle *trans,
226 struct btrfs_root *root,
235 struct inode *inode = fdentry(file)->d_inode;
236 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
240 u64 end_of_last_block;
241 u64 end_pos = pos + write_bytes;
243 loff_t isize = i_size_read(inode);
245 start_pos = pos & ~((u64)root->sectorsize - 1);
246 num_bytes = (write_bytes + pos - start_pos +
247 root->sectorsize - 1) & ~((u64)root->sectorsize - 1);
249 end_of_last_block = start_pos + num_bytes - 1;
251 lock_extent(io_tree, start_pos, end_of_last_block, GFP_NOFS);
252 mutex_lock(&root->fs_info->fs_mutex);
253 trans = btrfs_start_transaction(root, 1);
258 btrfs_set_trans_block_group(trans, inode);
259 inode->i_blocks += num_bytes >> 9;
262 if ((end_of_last_block & 4095) == 0) {
263 printk("strange end of last %Lu %zu %Lu\n", start_pos, write_bytes, end_of_last_block);
265 set_extent_uptodate(io_tree, start_pos, end_of_last_block, GFP_NOFS);
267 /* FIXME...EIEIO, ENOSPC and more */
269 /* insert any holes we need to create */
270 if (inode->i_size < start_pos) {
271 u64 last_pos_in_file;
273 u64 mask = root->sectorsize - 1;
274 last_pos_in_file = (isize + mask) & ~mask;
275 hole_size = (end_pos - last_pos_in_file + mask) & ~mask;
277 if (last_pos_in_file < start_pos) {
278 err = btrfs_drop_extents(trans, root, inode,
280 last_pos_in_file + hole_size,
286 err = btrfs_insert_file_extent(trans, root,
290 btrfs_drop_extent_cache(inode, last_pos_in_file,
291 last_pos_in_file + hole_size -1);
292 btrfs_check_file(root, inode);
299 * either allocate an extent for the new bytes or setup the key
300 * to show we are doing inline data in the extent
302 inline_size = end_pos;
303 if (isize >= BTRFS_MAX_INLINE_DATA_SIZE(root) ||
304 inline_size > 8192 ||
305 inline_size >= BTRFS_MAX_INLINE_DATA_SIZE(root)) {
307 u64 existing_delalloc = 0;
309 for (i = 0; i < num_pages; i++) {
310 struct page *p = pages[i];
314 last_end = (u64)(pages[num_pages -1]->index) <<
316 last_end += PAGE_CACHE_SIZE - 1;
317 if (start_pos < isize) {
318 u64 delalloc_start = start_pos;
319 existing_delalloc = count_range_bits(io_tree,
321 end_of_last_block, (u64)-1,
324 set_extent_delalloc(io_tree, start_pos, end_of_last_block,
326 spin_lock(&root->fs_info->delalloc_lock);
327 root->fs_info->delalloc_bytes += (end_of_last_block + 1 -
328 start_pos) - existing_delalloc;
329 spin_unlock(&root->fs_info->delalloc_lock);
330 btrfs_add_ordered_inode(inode);
333 /* step one, delete the existing extents in this range */
334 aligned_end = (pos + write_bytes + root->sectorsize - 1) &
335 ~((u64)root->sectorsize - 1);
336 err = btrfs_drop_extents(trans, root, inode, start_pos,
337 aligned_end, aligned_end, &hint_byte);
340 if (isize > inline_size)
341 inline_size = min_t(u64, isize, aligned_end);
342 inline_size -= start_pos;
343 err = insert_inline_extent(trans, root, inode, start_pos,
344 inline_size, pages, 0, num_pages);
345 btrfs_drop_extent_cache(inode, start_pos, aligned_end - 1);
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(io_tree, start_pos, end_of_last_block, GFP_NOFS);
360 int btrfs_drop_extent_cache(struct inode *inode, u64 start, u64 end)
362 struct extent_map *em;
363 struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree;
366 spin_lock(&em_tree->lock);
367 em = lookup_extent_mapping(em_tree, start, end);
369 spin_unlock(&em_tree->lock);
372 remove_extent_mapping(em_tree, em);
373 spin_unlock(&em_tree->lock);
377 /* once for the tree*/
383 int btrfs_check_file(struct btrfs_root *root, struct inode *inode)
387 struct btrfs_path *path;
388 struct btrfs_key found_key;
389 struct extent_buffer *leaf;
390 struct btrfs_file_extent_item *extent;
399 path = btrfs_alloc_path();
400 ret = btrfs_lookup_file_extent(NULL, root, path, inode->i_ino,
403 nritems = btrfs_header_nritems(path->nodes[0]);
404 if (path->slots[0] >= nritems) {
405 ret = btrfs_next_leaf(root, path);
408 nritems = btrfs_header_nritems(path->nodes[0]);
410 slot = path->slots[0];
411 leaf = path->nodes[0];
412 btrfs_item_key_to_cpu(leaf, &found_key, slot);
413 if (found_key.objectid != inode->i_ino)
415 if (found_key.type != BTRFS_EXTENT_DATA_KEY)
418 if (found_key.offset != last_offset) {
420 btrfs_print_leaf(root, leaf);
421 printk("inode %lu found offset %Lu expected %Lu\n",
422 inode->i_ino, found_key.offset, last_offset);
426 extent = btrfs_item_ptr(leaf, slot,
427 struct btrfs_file_extent_item);
428 found_type = btrfs_file_extent_type(leaf, extent);
429 if (found_type == BTRFS_FILE_EXTENT_REG) {
430 extent_end = found_key.offset +
431 btrfs_file_extent_num_bytes(leaf, extent);
432 } else if (found_type == BTRFS_FILE_EXTENT_INLINE) {
433 struct btrfs_item *item;
434 item = btrfs_item_nr(leaf, slot);
435 extent_end = found_key.offset +
436 btrfs_file_extent_inline_len(leaf, item);
437 extent_end = (extent_end + root->sectorsize - 1) &
438 ~((u64)root->sectorsize -1 );
440 last_offset = extent_end;
443 if (last_offset < inode->i_size) {
445 btrfs_print_leaf(root, leaf);
446 printk("inode %lu found offset %Lu size %Lu\n", inode->i_ino,
447 last_offset, inode->i_size);
452 btrfs_free_path(path);
458 * this is very complex, but the basic idea is to drop all extents
459 * in the range start - end. hint_block is filled in with a block number
460 * that would be a good hint to the block allocator for this file.
462 * If an extent intersects the range but is not entirely inside the range
463 * it is either truncated or split. Anything entirely inside the range
464 * is deleted from the tree.
466 int btrfs_drop_extents(struct btrfs_trans_handle *trans,
467 struct btrfs_root *root, struct inode *inode,
468 u64 start, u64 end, u64 inline_limit, u64 *hint_byte)
471 u64 search_start = start;
472 struct extent_buffer *leaf;
473 struct btrfs_file_extent_item *extent;
474 struct btrfs_path *path;
475 struct btrfs_key key;
476 struct btrfs_file_extent_item old;
486 btrfs_drop_extent_cache(inode, start, end - 1);
488 path = btrfs_alloc_path();
493 btrfs_release_path(root, path);
494 ret = btrfs_lookup_file_extent(trans, root, path, inode->i_ino,
499 if (path->slots[0] == 0) {
511 leaf = path->nodes[0];
512 slot = path->slots[0];
514 btrfs_item_key_to_cpu(leaf, &key, slot);
516 if (key.offset >= end || key.objectid != inode->i_ino) {
519 if (btrfs_key_type(&key) > BTRFS_EXTENT_DATA_KEY) {
523 search_start = key.offset;
526 if (btrfs_key_type(&key) == BTRFS_EXTENT_DATA_KEY) {
527 extent = btrfs_item_ptr(leaf, slot,
528 struct btrfs_file_extent_item);
529 found_type = btrfs_file_extent_type(leaf, extent);
530 if (found_type == BTRFS_FILE_EXTENT_REG) {
532 btrfs_file_extent_disk_bytenr(leaf,
535 *hint_byte = extent_end;
537 extent_end = key.offset +
538 btrfs_file_extent_num_bytes(leaf, extent);
540 } else if (found_type == BTRFS_FILE_EXTENT_INLINE) {
541 struct btrfs_item *item;
542 item = btrfs_item_nr(leaf, slot);
544 extent_end = key.offset +
545 btrfs_file_extent_inline_len(leaf, item);
548 extent_end = search_start;
551 /* we found nothing we can drop */
552 if ((!found_extent && !found_inline) ||
553 search_start >= extent_end) {
556 nritems = btrfs_header_nritems(leaf);
557 if (slot >= nritems - 1) {
558 nextret = btrfs_next_leaf(root, path);
569 u64 mask = root->sectorsize - 1;
570 search_start = (extent_end + mask) & ~mask;
572 search_start = extent_end;
573 if (end <= extent_end && start >= key.offset && found_inline) {
574 *hint_byte = EXTENT_MAP_INLINE;
577 if (end < extent_end && end >= key.offset) {
580 btrfs_file_extent_disk_bytenr(leaf, extent);
582 btrfs_file_extent_disk_num_bytes(leaf,
584 read_extent_buffer(leaf, &old,
585 (unsigned long)extent,
587 if (disk_bytenr != 0) {
588 ret = btrfs_inc_extent_ref(trans, root,
589 disk_bytenr, disk_num_bytes,
590 root->root_key.objectid,
597 if (found_inline && start <= key.offset &&
598 inline_limit < extent_end)
601 /* truncate existing extent */
602 if (start > key.offset) {
606 WARN_ON(start & (root->sectorsize - 1));
608 new_num = start - key.offset;
609 old_num = btrfs_file_extent_num_bytes(leaf,
612 btrfs_file_extent_disk_bytenr(leaf,
614 if (btrfs_file_extent_disk_bytenr(leaf,
617 (old_num - new_num) >> 9;
619 btrfs_set_file_extent_num_bytes(leaf, extent,
621 btrfs_mark_buffer_dirty(leaf);
622 } else if (key.offset < inline_limit &&
623 (end > extent_end) &&
624 (inline_limit < extent_end)) {
626 new_size = btrfs_file_extent_calc_inline_size(
627 inline_limit - key.offset);
628 btrfs_truncate_item(trans, root, path,
632 /* delete the entire extent */
635 u64 disk_num_bytes = 0;
636 u64 extent_num_bytes = 0;
640 root_gen = btrfs_header_generation(leaf);
641 root_owner = btrfs_header_owner(leaf);
644 btrfs_file_extent_disk_bytenr(leaf,
647 btrfs_file_extent_disk_num_bytes(leaf,
650 btrfs_file_extent_num_bytes(leaf, extent);
652 btrfs_file_extent_disk_bytenr(leaf,
655 ret = btrfs_del_item(trans, root, path);
656 /* TODO update progress marker and return */
658 btrfs_release_path(root, path);
660 if (found_extent && disk_bytenr != 0) {
661 inode->i_blocks -= extent_num_bytes >> 9;
662 ret = btrfs_free_extent(trans, root,
666 root_gen, inode->i_ino,
671 if (!bookend && search_start >= end) {
678 if (bookend && found_inline && start <= key.offset &&
679 inline_limit < extent_end && key.offset <= inline_limit) {
681 new_size = btrfs_file_extent_calc_inline_size(
682 extent_end - inline_limit);
683 btrfs_truncate_item(trans, root, path, new_size, 0);
685 /* create bookend, splitting the extent in two */
686 if (bookend && found_extent) {
687 struct btrfs_key ins;
688 ins.objectid = inode->i_ino;
690 btrfs_set_key_type(&ins, BTRFS_EXTENT_DATA_KEY);
691 btrfs_release_path(root, path);
692 ret = btrfs_insert_empty_item(trans, root, path, &ins,
695 leaf = path->nodes[0];
697 btrfs_print_leaf(root, leaf);
698 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);
701 extent = btrfs_item_ptr(leaf, path->slots[0],
702 struct btrfs_file_extent_item);
703 write_extent_buffer(leaf, &old,
704 (unsigned long)extent, sizeof(old));
706 btrfs_set_file_extent_offset(leaf, extent,
707 le64_to_cpu(old.offset) + end - key.offset);
708 WARN_ON(le64_to_cpu(old.num_bytes) <
710 btrfs_set_file_extent_num_bytes(leaf, extent,
712 btrfs_set_file_extent_type(leaf, extent,
713 BTRFS_FILE_EXTENT_REG);
715 btrfs_mark_buffer_dirty(path->nodes[0]);
716 if (le64_to_cpu(old.disk_bytenr) != 0) {
718 btrfs_file_extent_num_bytes(leaf,
726 btrfs_free_path(path);
731 * this gets pages into the page cache and locks them down
733 static int prepare_pages(struct btrfs_root *root, struct file *file,
734 struct page **pages, size_t num_pages,
735 loff_t pos, unsigned long first_index,
736 unsigned long last_index, size_t write_bytes)
739 unsigned long index = pos >> PAGE_CACHE_SHIFT;
740 struct inode *inode = fdentry(file)->d_inode;
744 start_pos = pos & ~((u64)root->sectorsize - 1);
746 memset(pages, 0, num_pages * sizeof(struct page *));
748 for (i = 0; i < num_pages; i++) {
749 pages[i] = grab_cache_page(inode->i_mapping, index + i);
754 #if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,18)
755 ClearPageDirty(pages[i]);
757 cancel_dirty_page(pages[i], PAGE_CACHE_SIZE);
759 wait_on_page_writeback(pages[i]);
760 set_page_extent_mapped(pages[i]);
761 WARN_ON(!PageLocked(pages[i]));
766 static ssize_t btrfs_file_write(struct file *file, const char __user *buf,
767 size_t count, loff_t *ppos)
771 ssize_t num_written = 0;
774 struct inode *inode = fdentry(file)->d_inode;
775 struct btrfs_root *root = BTRFS_I(inode)->root;
776 struct page **pages = NULL;
778 struct page *pinned[2];
779 unsigned long first_index;
780 unsigned long last_index;
782 nrptrs = min((count + PAGE_CACHE_SIZE - 1) / PAGE_CACHE_SIZE,
783 PAGE_CACHE_SIZE / (sizeof(struct page *)));
786 if (file->f_flags & O_DIRECT)
792 vfs_check_frozen(inode->i_sb, SB_FREEZE_WRITE);
793 current->backing_dev_info = inode->i_mapping->backing_dev_info;
794 err = generic_write_checks(file, &pos, &count, S_ISBLK(inode->i_mode));
799 err = remove_suid(fdentry(file));
802 file_update_time(file);
804 pages = kmalloc(nrptrs * sizeof(struct page *), GFP_KERNEL);
806 mutex_lock(&inode->i_mutex);
807 first_index = pos >> PAGE_CACHE_SHIFT;
808 last_index = (pos + count) >> PAGE_CACHE_SHIFT;
811 * there are lots of better ways to do this, but this code
812 * makes sure the first and last page in the file range are
813 * up to date and ready for cow
815 if ((pos & (PAGE_CACHE_SIZE - 1))) {
816 pinned[0] = grab_cache_page(inode->i_mapping, first_index);
817 if (!PageUptodate(pinned[0])) {
818 ret = btrfs_readpage(NULL, pinned[0]);
820 wait_on_page_locked(pinned[0]);
822 unlock_page(pinned[0]);
825 if ((pos + count) & (PAGE_CACHE_SIZE - 1)) {
826 pinned[1] = grab_cache_page(inode->i_mapping, last_index);
827 if (!PageUptodate(pinned[1])) {
828 ret = btrfs_readpage(NULL, pinned[1]);
830 wait_on_page_locked(pinned[1]);
832 unlock_page(pinned[1]);
837 size_t offset = pos & (PAGE_CACHE_SIZE - 1);
838 size_t write_bytes = min(count, nrptrs *
839 (size_t)PAGE_CACHE_SIZE -
841 size_t num_pages = (write_bytes + PAGE_CACHE_SIZE - 1) >>
844 WARN_ON(num_pages > nrptrs);
845 memset(pages, 0, sizeof(pages));
847 mutex_lock(&root->fs_info->fs_mutex);
848 ret = btrfs_check_free_space(root, write_bytes, 0);
849 mutex_unlock(&root->fs_info->fs_mutex);
853 ret = prepare_pages(root, file, pages, num_pages,
854 pos, first_index, last_index,
859 ret = btrfs_copy_from_user(pos, num_pages,
860 write_bytes, pages, buf);
862 btrfs_drop_pages(pages, num_pages);
866 ret = dirty_and_release_pages(NULL, root, file, pages,
867 num_pages, pos, write_bytes);
868 btrfs_drop_pages(pages, num_pages);
873 count -= write_bytes;
875 num_written += write_bytes;
877 balance_dirty_pages_ratelimited_nr(inode->i_mapping, num_pages);
878 if (num_pages < (root->leafsize >> PAGE_CACHE_SHIFT) + 1)
879 btrfs_btree_balance_dirty(root, 1);
880 btrfs_throttle(root);
884 mutex_unlock(&inode->i_mutex);
889 page_cache_release(pinned[0]);
891 page_cache_release(pinned[1]);
894 if (num_written > 0 && ((file->f_flags & O_SYNC) || IS_SYNC(inode))) {
895 err = sync_page_range(inode, inode->i_mapping,
896 start_pos, num_written);
900 current->backing_dev_info = NULL;
901 return num_written ? num_written : err;
904 static int btrfs_sync_file(struct file *file,
905 struct dentry *dentry, int datasync)
907 struct inode *inode = dentry->d_inode;
908 struct btrfs_root *root = BTRFS_I(inode)->root;
910 struct btrfs_trans_handle *trans;
913 * check the transaction that last modified this inode
914 * and see if its already been committed
916 mutex_lock(&root->fs_info->fs_mutex);
917 if (!BTRFS_I(inode)->last_trans)
919 mutex_lock(&root->fs_info->trans_mutex);
920 if (BTRFS_I(inode)->last_trans <=
921 root->fs_info->last_trans_committed) {
922 BTRFS_I(inode)->last_trans = 0;
923 mutex_unlock(&root->fs_info->trans_mutex);
926 mutex_unlock(&root->fs_info->trans_mutex);
929 * ok we haven't committed the transaction yet, lets do a commit
931 trans = btrfs_start_transaction(root, 1);
936 ret = btrfs_commit_transaction(trans, root);
938 mutex_unlock(&root->fs_info->fs_mutex);
939 return ret > 0 ? EIO : ret;
942 static struct vm_operations_struct btrfs_file_vm_ops = {
943 #if LINUX_VERSION_CODE < KERNEL_VERSION(2,6,23)
944 .nopage = filemap_nopage,
945 .populate = filemap_populate,
947 .fault = filemap_fault,
949 .page_mkwrite = btrfs_page_mkwrite,
952 static int btrfs_file_mmap(struct file *filp, struct vm_area_struct *vma)
954 vma->vm_ops = &btrfs_file_vm_ops;
959 struct file_operations btrfs_file_operations = {
960 .llseek = generic_file_llseek,
961 .read = do_sync_read,
962 .aio_read = generic_file_aio_read,
963 .splice_read = generic_file_splice_read,
964 #if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,18)
965 .sendfile = generic_file_sendfile,
967 .write = btrfs_file_write,
968 .mmap = btrfs_file_mmap,
969 .open = generic_file_open,
970 .fsync = btrfs_sync_file,
971 .unlocked_ioctl = btrfs_ioctl,
973 .compat_ioctl = btrfs_ioctl,