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/blkdev.h>
21 #include <linux/crc32c.h>
22 #include <linux/scatterlist.h>
23 #include <linux/swap.h>
24 #include <linux/radix-tree.h>
25 #include <linux/writeback.h>
26 #include <linux/buffer_head.h> // for block_sync_page
29 #include "transaction.h"
30 #include "btrfs_inode.h"
31 #include "print-tree.h"
34 static int check_tree_block(struct btrfs_root *root, struct extent_buffer *buf)
36 if (extent_buffer_blocknr(buf) != btrfs_header_blocknr(buf)) {
37 printk(KERN_CRIT "buf blocknr(buf) is %llu, header is %llu\n",
38 (unsigned long long)extent_buffer_blocknr(buf),
39 (unsigned long long)btrfs_header_blocknr(buf));
46 static struct extent_map_ops btree_extent_map_ops;
48 struct extent_buffer *btrfs_find_tree_block(struct btrfs_root *root,
49 u64 bytenr, u32 blocksize)
51 struct inode *btree_inode = root->fs_info->btree_inode;
52 struct extent_buffer *eb;
53 eb = find_extent_buffer(&BTRFS_I(btree_inode)->extent_tree,
54 bytenr, blocksize, GFP_NOFS);
58 struct extent_buffer *btrfs_find_create_tree_block(struct btrfs_root *root,
59 u64 bytenr, u32 blocksize)
61 struct inode *btree_inode = root->fs_info->btree_inode;
62 struct extent_buffer *eb;
64 eb = alloc_extent_buffer(&BTRFS_I(btree_inode)->extent_tree,
65 bytenr, blocksize, NULL, GFP_NOFS);
69 struct extent_map *btree_get_extent(struct inode *inode, struct page *page,
70 size_t page_offset, u64 start, u64 end,
73 struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree;
74 struct extent_map *em;
78 em = lookup_extent_mapping(em_tree, start, end);
82 em = alloc_extent_map(GFP_NOFS);
84 em = ERR_PTR(-ENOMEM);
88 em->end = (i_size_read(inode) & ~((u64)PAGE_CACHE_SIZE -1)) - 1;
90 em->block_end = em->end;
91 em->bdev = inode->i_sb->s_bdev;
92 ret = add_extent_mapping(em_tree, em);
104 u32 btrfs_csum_data(struct btrfs_root *root, char *data, u32 seed, size_t len)
106 return crc32c(seed, data, len);
109 void btrfs_csum_final(u32 crc, char *result)
111 *(__le32 *)result = ~cpu_to_le32(crc);
114 static int csum_tree_block(struct btrfs_root *root, struct extent_buffer *buf,
117 char result[BTRFS_CRC32_SIZE];
119 unsigned long cur_len;
120 unsigned long offset = BTRFS_CSUM_SIZE;
121 char *map_token = NULL;
123 unsigned long map_start;
124 unsigned long map_len;
128 len = buf->len - offset;
130 err = map_private_extent_buffer(buf, offset, 32,
132 &map_start, &map_len, KM_USER0);
134 printk("failed to map extent buffer! %lu\n",
138 cur_len = min(len, map_len - (offset - map_start));
139 crc = btrfs_csum_data(root, kaddr + offset - map_start,
143 unmap_extent_buffer(buf, map_token, KM_USER0);
145 btrfs_csum_final(crc, result);
148 if (memcmp_extent_buffer(buf, result, 0, BTRFS_CRC32_SIZE)) {
149 printk("btrfs: %s checksum verify failed on %llu\n",
150 root->fs_info->sb->s_id,
155 write_extent_buffer(buf, result, 0, BTRFS_CRC32_SIZE);
161 int csum_dirty_buffer(struct btrfs_root *root, struct page *page)
163 struct extent_map_tree *tree;
164 u64 start = (u64)page->index << PAGE_CACHE_SHIFT;
168 struct extent_buffer *eb;
169 tree = &BTRFS_I(page->mapping->host)->extent_tree;
171 if (page->private == EXTENT_PAGE_PRIVATE)
175 len = page->private >> 2;
179 eb = alloc_extent_buffer(tree, start, len, page, GFP_NOFS);
180 read_extent_buffer_pages(tree, eb, start + PAGE_CACHE_SIZE, 1);
181 found_start = btrfs_header_bytenr(eb);
182 if (found_start != start) {
183 printk("warning: eb start incorrect %Lu buffer %Lu len %lu\n",
184 start, found_start, len);
186 found_level = btrfs_header_level(eb);
187 csum_tree_block(root, eb, 0);
188 free_extent_buffer(eb);
193 static int btree_writepage_io_hook(struct page *page, u64 start, u64 end)
195 struct btrfs_root *root = BTRFS_I(page->mapping->host)->root;
197 csum_dirty_buffer(root, page);
201 static int btree_writepage(struct page *page, struct writeback_control *wbc)
203 struct extent_map_tree *tree;
204 tree = &BTRFS_I(page->mapping->host)->extent_tree;
205 return extent_write_full_page(tree, page, btree_get_extent, wbc);
208 static int btree_writepages(struct address_space *mapping,
209 struct writeback_control *wbc)
211 struct extent_map_tree *tree;
212 tree = &BTRFS_I(mapping->host)->extent_tree;
213 if (wbc->sync_mode == WB_SYNC_NONE && current_is_pdflush()) {
216 unsigned long thresh = 96 * 1024 * 1024;
217 num_dirty = count_range_bits(tree, &start, thresh, EXTENT_DIRTY);
218 if (num_dirty < thresh) {
222 return extent_writepages(tree, mapping, btree_get_extent, wbc);
225 int btree_readpage(struct file *file, struct page *page)
227 struct extent_map_tree *tree;
228 tree = &BTRFS_I(page->mapping->host)->extent_tree;
229 return extent_read_full_page(tree, page, btree_get_extent);
232 static int btree_releasepage(struct page *page, gfp_t unused_gfp_flags)
234 struct extent_map_tree *tree;
237 tree = &BTRFS_I(page->mapping->host)->extent_tree;
238 ret = try_release_extent_mapping(tree, page);
240 ClearPagePrivate(page);
241 set_page_private(page, 0);
242 page_cache_release(page);
247 static void btree_invalidatepage(struct page *page, unsigned long offset)
249 struct extent_map_tree *tree;
250 tree = &BTRFS_I(page->mapping->host)->extent_tree;
251 extent_invalidatepage(tree, page, offset);
252 btree_releasepage(page, GFP_NOFS);
256 static int btree_writepage(struct page *page, struct writeback_control *wbc)
258 struct buffer_head *bh;
259 struct btrfs_root *root = BTRFS_I(page->mapping->host)->root;
260 struct buffer_head *head;
261 if (!page_has_buffers(page)) {
262 create_empty_buffers(page, root->fs_info->sb->s_blocksize,
263 (1 << BH_Dirty)|(1 << BH_Uptodate));
265 head = page_buffers(page);
268 if (buffer_dirty(bh))
269 csum_tree_block(root, bh, 0);
270 bh = bh->b_this_page;
271 } while (bh != head);
272 return block_write_full_page(page, btree_get_block, wbc);
276 static struct address_space_operations btree_aops = {
277 .readpage = btree_readpage,
278 .writepage = btree_writepage,
279 .writepages = btree_writepages,
280 .releasepage = btree_releasepage,
281 .invalidatepage = btree_invalidatepage,
282 .sync_page = block_sync_page,
285 int readahead_tree_block(struct btrfs_root *root, u64 bytenr, u32 blocksize)
287 struct extent_buffer *buf = NULL;
288 struct inode *btree_inode = root->fs_info->btree_inode;
291 buf = btrfs_find_create_tree_block(root, bytenr, blocksize);
294 read_extent_buffer_pages(&BTRFS_I(btree_inode)->extent_tree,
296 free_extent_buffer(buf);
300 struct extent_buffer *read_tree_block(struct btrfs_root *root, u64 bytenr,
303 struct extent_buffer *buf = NULL;
304 struct inode *btree_inode = root->fs_info->btree_inode;
305 struct extent_map_tree *extent_tree;
308 extent_tree = &BTRFS_I(btree_inode)->extent_tree;
310 buf = btrfs_find_create_tree_block(root, bytenr, blocksize);
313 read_extent_buffer_pages(&BTRFS_I(btree_inode)->extent_tree,
315 if (buf->flags & EXTENT_CSUM) {
318 if (test_range_bit(extent_tree, buf->start, buf->start + buf->len - 1,
320 buf->flags |= EXTENT_CSUM;
323 ret = csum_tree_block(root, buf, 1);
324 set_extent_bits(extent_tree, buf->start,
325 buf->start + buf->len - 1,
326 EXTENT_CSUM, GFP_NOFS);
327 buf->flags |= EXTENT_CSUM;
331 int clean_tree_block(struct btrfs_trans_handle *trans, struct btrfs_root *root,
332 struct extent_buffer *buf)
334 struct inode *btree_inode = root->fs_info->btree_inode;
335 clear_extent_buffer_dirty(&BTRFS_I(btree_inode)->extent_tree, buf);
339 int wait_on_tree_block_writeback(struct btrfs_root *root,
340 struct extent_buffer *buf)
342 struct inode *btree_inode = root->fs_info->btree_inode;
343 wait_on_extent_buffer_writeback(&BTRFS_I(btree_inode)->extent_tree,
348 static int __setup_root(u32 nodesize, u32 leafsize, u32 sectorsize,
349 struct btrfs_root *root,
350 struct btrfs_fs_info *fs_info,
355 root->commit_root = NULL;
356 root->sectorsize = sectorsize;
357 root->nodesize = nodesize;
358 root->leafsize = leafsize;
360 root->fs_info = fs_info;
361 root->objectid = objectid;
362 root->last_trans = 0;
363 root->highest_inode = 0;
364 root->last_inode_alloc = 0;
366 memset(&root->root_key, 0, sizeof(root->root_key));
367 memset(&root->root_item, 0, sizeof(root->root_item));
368 memset(&root->defrag_progress, 0, sizeof(root->defrag_progress));
369 memset(&root->root_kobj, 0, sizeof(root->root_kobj));
370 init_completion(&root->kobj_unregister);
371 init_rwsem(&root->snap_sem);
372 root->defrag_running = 0;
373 root->defrag_level = 0;
374 root->root_key.objectid = objectid;
378 static int find_and_setup_root(struct btrfs_root *tree_root,
379 struct btrfs_fs_info *fs_info,
381 struct btrfs_root *root)
386 __setup_root(tree_root->nodesize, tree_root->leafsize,
387 tree_root->sectorsize, root, fs_info, objectid);
388 ret = btrfs_find_last_root(tree_root, objectid,
389 &root->root_item, &root->root_key);
392 blocksize = btrfs_level_size(root, btrfs_root_level(&root->root_item));
393 root->node = read_tree_block(root, btrfs_root_bytenr(&root->root_item),
399 struct btrfs_root *btrfs_read_fs_root_no_radix(struct btrfs_fs_info *fs_info,
400 struct btrfs_key *location)
402 struct btrfs_root *root;
403 struct btrfs_root *tree_root = fs_info->tree_root;
404 struct btrfs_path *path;
405 struct extent_buffer *l;
410 root = kzalloc(sizeof(*root), GFP_NOFS);
412 return ERR_PTR(-ENOMEM);
413 if (location->offset == (u64)-1) {
414 ret = find_and_setup_root(tree_root, fs_info,
415 location->objectid, root);
423 __setup_root(tree_root->nodesize, tree_root->leafsize,
424 tree_root->sectorsize, root, fs_info,
427 path = btrfs_alloc_path();
429 ret = btrfs_search_slot(NULL, tree_root, location, path, 0, 0);
436 read_extent_buffer(l, &root->root_item,
437 btrfs_item_ptr_offset(l, path->slots[0]),
438 sizeof(root->root_item));
439 memcpy(&root->root_key, location, sizeof(*location));
442 btrfs_release_path(root, path);
443 btrfs_free_path(path);
448 blocksize = btrfs_level_size(root, btrfs_root_level(&root->root_item));
449 root->node = read_tree_block(root, btrfs_root_bytenr(&root->root_item),
454 ret = btrfs_find_highest_inode(root, &highest_inode);
456 root->highest_inode = highest_inode;
457 root->last_inode_alloc = highest_inode;
462 struct btrfs_root *btrfs_read_fs_root(struct btrfs_fs_info *fs_info,
463 struct btrfs_key *location,
464 const char *name, int namelen)
466 struct btrfs_root *root;
469 root = radix_tree_lookup(&fs_info->fs_roots_radix,
470 (unsigned long)location->objectid);
474 root = btrfs_read_fs_root_no_radix(fs_info, location);
477 ret = radix_tree_insert(&fs_info->fs_roots_radix,
478 (unsigned long)root->root_key.objectid,
481 free_extent_buffer(root->node);
486 ret = btrfs_set_root_name(root, name, namelen);
488 free_extent_buffer(root->node);
493 ret = btrfs_sysfs_add_root(root);
495 free_extent_buffer(root->node);
501 ret = btrfs_find_dead_roots(fs_info->tree_root,
502 root->root_key.objectid, root);
508 static int add_hasher(struct btrfs_fs_info *info, char *type) {
509 struct btrfs_hasher *hasher;
511 hasher = kmalloc(sizeof(*hasher), GFP_NOFS);
514 hasher->hash_tfm = crypto_alloc_hash(type, 0, CRYPTO_ALG_ASYNC);
515 if (!hasher->hash_tfm) {
519 spin_lock(&info->hash_lock);
520 list_add(&hasher->list, &info->hashers);
521 spin_unlock(&info->hash_lock);
525 struct btrfs_root *open_ctree(struct super_block *sb)
531 struct btrfs_root *extent_root = kmalloc(sizeof(struct btrfs_root),
533 struct btrfs_root *tree_root = kmalloc(sizeof(struct btrfs_root),
535 struct btrfs_fs_info *fs_info = kmalloc(sizeof(*fs_info),
539 struct btrfs_super_block *disk_super;
541 if (!extent_root || !tree_root || !fs_info) {
545 INIT_RADIX_TREE(&fs_info->fs_roots_radix, GFP_NOFS);
546 INIT_LIST_HEAD(&fs_info->trans_list);
547 INIT_LIST_HEAD(&fs_info->dead_roots);
548 INIT_LIST_HEAD(&fs_info->hashers);
549 spin_lock_init(&fs_info->hash_lock);
551 memset(&fs_info->super_kobj, 0, sizeof(fs_info->super_kobj));
552 init_completion(&fs_info->kobj_unregister);
553 sb_set_blocksize(sb, 4096);
554 fs_info->running_transaction = NULL;
555 fs_info->last_trans_committed = 0;
556 fs_info->tree_root = tree_root;
557 fs_info->extent_root = extent_root;
559 fs_info->btree_inode = new_inode(sb);
560 fs_info->btree_inode->i_ino = 1;
561 fs_info->btree_inode->i_nlink = 1;
562 fs_info->btree_inode->i_size = sb->s_bdev->bd_inode->i_size;
563 fs_info->btree_inode->i_mapping->a_ops = &btree_aops;
564 extent_map_tree_init(&BTRFS_I(fs_info->btree_inode)->extent_tree,
565 fs_info->btree_inode->i_mapping,
567 BTRFS_I(fs_info->btree_inode)->extent_tree.ops = &btree_extent_map_ops;
569 extent_map_tree_init(&fs_info->free_space_cache,
570 fs_info->btree_inode->i_mapping, GFP_NOFS);
571 extent_map_tree_init(&fs_info->block_group_cache,
572 fs_info->btree_inode->i_mapping, GFP_NOFS);
573 extent_map_tree_init(&fs_info->pinned_extents,
574 fs_info->btree_inode->i_mapping, GFP_NOFS);
575 extent_map_tree_init(&fs_info->pending_del,
576 fs_info->btree_inode->i_mapping, GFP_NOFS);
577 extent_map_tree_init(&fs_info->extent_ins,
578 fs_info->btree_inode->i_mapping, GFP_NOFS);
579 fs_info->do_barriers = 1;
580 fs_info->closing = 0;
581 fs_info->total_pinned = 0;
583 INIT_DELAYED_WORK(&fs_info->trans_work, btrfs_transaction_cleaner);
584 BTRFS_I(fs_info->btree_inode)->root = tree_root;
585 memset(&BTRFS_I(fs_info->btree_inode)->location, 0,
586 sizeof(struct btrfs_key));
587 insert_inode_hash(fs_info->btree_inode);
588 mapping_set_gfp_mask(fs_info->btree_inode->i_mapping, GFP_NOFS);
590 mutex_init(&fs_info->trans_mutex);
591 mutex_init(&fs_info->fs_mutex);
594 ret = add_hasher(fs_info, "crc32c");
596 printk("btrfs: failed hash setup, modprobe cryptomgr?\n");
601 __setup_root(512, 512, 512, tree_root,
602 fs_info, BTRFS_ROOT_TREE_OBJECTID);
604 fs_info->sb_buffer = read_tree_block(tree_root,
605 BTRFS_SUPER_INFO_OFFSET,
608 if (!fs_info->sb_buffer)
611 read_extent_buffer(fs_info->sb_buffer, &fs_info->super_copy, 0,
612 sizeof(fs_info->super_copy));
614 read_extent_buffer(fs_info->sb_buffer, fs_info->fsid,
615 (unsigned long)btrfs_super_fsid(fs_info->sb_buffer),
617 disk_super = &fs_info->super_copy;
618 if (!btrfs_super_root(disk_super))
621 nodesize = btrfs_super_nodesize(disk_super);
622 leafsize = btrfs_super_leafsize(disk_super);
623 sectorsize = btrfs_super_sectorsize(disk_super);
624 tree_root->nodesize = nodesize;
625 tree_root->leafsize = leafsize;
626 tree_root->sectorsize = sectorsize;
627 sb_set_blocksize(sb, sectorsize);
629 i_size_write(fs_info->btree_inode,
630 btrfs_super_total_bytes(disk_super));
632 if (strncmp((char *)(&disk_super->magic), BTRFS_MAGIC,
633 sizeof(disk_super->magic))) {
634 printk("btrfs: valid FS not found on %s\n", sb->s_id);
638 blocksize = btrfs_level_size(tree_root,
639 btrfs_super_root_level(disk_super));
641 tree_root->node = read_tree_block(tree_root,
642 btrfs_super_root(disk_super),
644 if (!tree_root->node)
647 mutex_lock(&fs_info->fs_mutex);
649 ret = find_and_setup_root(tree_root, fs_info,
650 BTRFS_EXTENT_TREE_OBJECTID, extent_root);
652 mutex_unlock(&fs_info->fs_mutex);
656 btrfs_read_block_groups(extent_root);
658 fs_info->generation = btrfs_super_generation(disk_super) + 1;
659 mutex_unlock(&fs_info->fs_mutex);
663 free_extent_buffer(tree_root->node);
665 free_extent_buffer(fs_info->sb_buffer);
667 iput(fs_info->btree_inode);
675 int write_ctree_super(struct btrfs_trans_handle *trans, struct btrfs_root
679 struct extent_buffer *super = root->fs_info->sb_buffer;
680 struct inode *btree_inode = root->fs_info->btree_inode;
682 set_extent_buffer_dirty(&BTRFS_I(btree_inode)->extent_tree, super);
683 ret = sync_page_range_nolock(btree_inode, btree_inode->i_mapping,
684 super->start, super->len);
688 int btrfs_free_fs_root(struct btrfs_fs_info *fs_info, struct btrfs_root *root)
690 radix_tree_delete(&fs_info->fs_roots_radix,
691 (unsigned long)root->root_key.objectid);
692 btrfs_sysfs_del_root(root);
696 free_extent_buffer(root->node);
697 if (root->commit_root)
698 free_extent_buffer(root->commit_root);
705 static int del_fs_roots(struct btrfs_fs_info *fs_info)
708 struct btrfs_root *gang[8];
712 ret = radix_tree_gang_lookup(&fs_info->fs_roots_radix,
717 for (i = 0; i < ret; i++)
718 btrfs_free_fs_root(fs_info, gang[i]);
723 int close_ctree(struct btrfs_root *root)
726 struct btrfs_trans_handle *trans;
727 struct btrfs_fs_info *fs_info = root->fs_info;
729 fs_info->closing = 1;
730 btrfs_transaction_flush_work(root);
731 mutex_lock(&fs_info->fs_mutex);
732 btrfs_defrag_dirty_roots(root->fs_info);
733 trans = btrfs_start_transaction(root, 1);
734 ret = btrfs_commit_transaction(trans, root);
735 /* run commit again to drop the original snapshot */
736 trans = btrfs_start_transaction(root, 1);
737 btrfs_commit_transaction(trans, root);
738 ret = btrfs_write_and_wait_transaction(NULL, root);
740 write_ctree_super(NULL, root);
741 mutex_unlock(&fs_info->fs_mutex);
743 if (fs_info->extent_root->node)
744 free_extent_buffer(fs_info->extent_root->node);
746 if (fs_info->tree_root->node)
747 free_extent_buffer(fs_info->tree_root->node);
749 free_extent_buffer(fs_info->sb_buffer);
751 btrfs_free_block_groups(root->fs_info);
752 del_fs_roots(fs_info);
753 extent_map_tree_empty_lru(&BTRFS_I(fs_info->btree_inode)->extent_tree);
754 truncate_inode_pages(fs_info->btree_inode->i_mapping, 0);
755 iput(fs_info->btree_inode);
757 while(!list_empty(&fs_info->hashers)) {
758 struct btrfs_hasher *hasher;
759 hasher = list_entry(fs_info->hashers.next, struct btrfs_hasher,
761 list_del(&hasher->hashers);
762 crypto_free_hash(&fs_info->hash_tfm);
766 kfree(fs_info->extent_root);
767 kfree(fs_info->tree_root);
771 int btrfs_buffer_uptodate(struct extent_buffer *buf)
773 struct inode *btree_inode = buf->first_page->mapping->host;
774 return extent_buffer_uptodate(&BTRFS_I(btree_inode)->extent_tree, buf);
777 int btrfs_set_buffer_uptodate(struct extent_buffer *buf)
779 struct inode *btree_inode = buf->first_page->mapping->host;
780 return set_extent_buffer_uptodate(&BTRFS_I(btree_inode)->extent_tree,
784 void btrfs_mark_buffer_dirty(struct extent_buffer *buf)
786 struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root;
787 u64 transid = btrfs_header_generation(buf);
788 struct inode *btree_inode = root->fs_info->btree_inode;
790 if (transid != root->fs_info->generation) {
791 printk(KERN_CRIT "transid mismatch buffer %llu, found %Lu running %Lu\n",
792 (unsigned long long)buf->start,
793 transid, root->fs_info->generation);
796 set_extent_buffer_dirty(&BTRFS_I(btree_inode)->extent_tree, buf);
799 void btrfs_btree_balance_dirty(struct btrfs_root *root, unsigned long nr)
801 balance_dirty_pages_ratelimited_nr(
802 root->fs_info->btree_inode->i_mapping, 1);
805 void btrfs_set_buffer_defrag(struct extent_buffer *buf)
807 struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root;
808 struct inode *btree_inode = root->fs_info->btree_inode;
809 set_extent_bits(&BTRFS_I(btree_inode)->extent_tree, buf->start,
810 buf->start + buf->len - 1, EXTENT_DEFRAG, GFP_NOFS);
813 void btrfs_set_buffer_defrag_done(struct extent_buffer *buf)
815 struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root;
816 struct inode *btree_inode = root->fs_info->btree_inode;
817 set_extent_bits(&BTRFS_I(btree_inode)->extent_tree, buf->start,
818 buf->start + buf->len - 1, EXTENT_DEFRAG_DONE,
822 int btrfs_buffer_defrag(struct extent_buffer *buf)
824 struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root;
825 struct inode *btree_inode = root->fs_info->btree_inode;
826 return test_range_bit(&BTRFS_I(btree_inode)->extent_tree,
827 buf->start, buf->start + buf->len - 1, EXTENT_DEFRAG, 0);
830 int btrfs_buffer_defrag_done(struct extent_buffer *buf)
832 struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root;
833 struct inode *btree_inode = root->fs_info->btree_inode;
834 return test_range_bit(&BTRFS_I(btree_inode)->extent_tree,
835 buf->start, buf->start + buf->len - 1,
836 EXTENT_DEFRAG_DONE, 0);
839 int btrfs_clear_buffer_defrag_done(struct extent_buffer *buf)
841 struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root;
842 struct inode *btree_inode = root->fs_info->btree_inode;
843 return clear_extent_bits(&BTRFS_I(btree_inode)->extent_tree,
844 buf->start, buf->start + buf->len - 1,
845 EXTENT_DEFRAG_DONE, GFP_NOFS);
848 int btrfs_clear_buffer_defrag(struct extent_buffer *buf)
850 struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root;
851 struct inode *btree_inode = root->fs_info->btree_inode;
852 return clear_extent_bits(&BTRFS_I(btree_inode)->extent_tree,
853 buf->start, buf->start + buf->len - 1,
854 EXTENT_DEFRAG, GFP_NOFS);
857 int btrfs_read_buffer(struct extent_buffer *buf)
859 struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root;
860 struct inode *btree_inode = root->fs_info->btree_inode;
861 return read_extent_buffer_pages(&BTRFS_I(btree_inode)->extent_tree,
865 static struct extent_map_ops btree_extent_map_ops = {
866 .writepage_io_hook = btree_writepage_io_hook,