-#define _XOPEN_SOURCE 500
-#include <stdio.h>
-#include <stdlib.h>
-#include <sys/types.h>
-#include <sys/stat.h>
-#include <fcntl.h>
-#include <unistd.h>
-#include "kerncompat.h"
-#include "radix-tree.h"
+/*
+ * Copyright (C) 2007 Oracle. All rights reserved.
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public
+ * License v2 as published by the Free Software Foundation.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public
+ * License along with this program; if not, write to the
+ * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
+ * Boston, MA 021110-1307, USA.
+ */
+
+#include <linux/fs.h>
+#include <linux/blkdev.h>
+#include <linux/crc32c.h>
+#include <linux/scatterlist.h>
+#include <linux/swap.h>
+#include <linux/radix-tree.h>
+#include <linux/writeback.h>
+#include <linux/buffer_head.h> // for block_sync_page
#include "ctree.h"
#include "disk-io.h"
+#include "transaction.h"
+#include "btrfs_inode.h"
+#include "print-tree.h"
-static int allocated_blocks = 0;
-int cache_max = 10000;
-
-static int check_tree_block(struct btrfs_root *root, struct btrfs_buffer *buf)
+#if 0
+static int check_tree_block(struct btrfs_root *root, struct extent_buffer *buf)
{
- if (buf->blocknr != btrfs_header_blocknr(&buf->node.header))
- BUG();
- if (root->node && btrfs_header_parentid(&buf->node.header) !=
- btrfs_header_parentid(&root->node->node.header))
- BUG();
+ if (extent_buffer_blocknr(buf) != btrfs_header_blocknr(buf)) {
+ printk(KERN_CRIT "buf blocknr(buf) is %llu, header is %llu\n",
+ (unsigned long long)extent_buffer_blocknr(buf),
+ (unsigned long long)btrfs_header_blocknr(buf));
+ return 1;
+ }
return 0;
}
+#endif
+
+static struct extent_map_ops btree_extent_map_ops;
-static int free_some_buffers(struct btrfs_root *root)
+struct extent_buffer *btrfs_find_tree_block(struct btrfs_root *root,
+ u64 bytenr, u32 blocksize)
{
- struct list_head *node, *next;
- struct btrfs_buffer *b;
- if (root->cache_size < cache_max)
- return 0;
- list_for_each_safe(node, next, &root->cache) {
- b = list_entry(node, struct btrfs_buffer, cache);
- if (b->count == 1) {
- BUG_ON(!list_empty(&b->dirty));
- list_del_init(&b->cache);
- btrfs_block_release(root, b);
- if (root->cache_size < cache_max)
- break;
- }
- }
- return 0;
+ struct inode *btree_inode = root->fs_info->btree_inode;
+ struct extent_buffer *eb;
+ eb = find_extent_buffer(&BTRFS_I(btree_inode)->extent_tree,
+ bytenr, blocksize, GFP_NOFS);
+ return eb;
}
-struct btrfs_buffer *alloc_tree_block(struct btrfs_root *root, u64 blocknr)
+struct extent_buffer *btrfs_find_create_tree_block(struct btrfs_root *root,
+ u64 bytenr, u32 blocksize)
{
- struct btrfs_buffer *buf;
- int ret;
+ struct inode *btree_inode = root->fs_info->btree_inode;
+ struct extent_buffer *eb;
- buf = malloc(sizeof(struct btrfs_buffer) + root->blocksize);
- if (!buf)
- return buf;
- allocated_blocks++;
- buf->blocknr = blocknr;
- buf->count = 2;
- INIT_LIST_HEAD(&buf->dirty);
- free_some_buffers(root);
- radix_tree_preload(GFP_KERNEL);
- ret = radix_tree_insert(&root->cache_radix, blocknr, buf);
- radix_tree_preload_end();
- list_add_tail(&buf->cache, &root->cache);
- root->cache_size++;
- if (ret) {
- free(buf);
- return NULL;
- }
- return buf;
+ eb = alloc_extent_buffer(&BTRFS_I(btree_inode)->extent_tree,
+ bytenr, blocksize, NULL, GFP_NOFS);
+ return eb;
}
-struct btrfs_buffer *find_tree_block(struct btrfs_root *root, u64 blocknr)
+struct extent_map *btree_get_extent(struct inode *inode, struct page *page,
+ size_t page_offset, u64 start, u64 end,
+ int create)
{
- struct btrfs_buffer *buf;
- buf = radix_tree_lookup(&root->cache_radix, blocknr);
- if (buf) {
- buf->count++;
- } else {
- buf = alloc_tree_block(root, blocknr);
- if (!buf) {
- BUG();
- return NULL;
- }
+ struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree;
+ struct extent_map *em;
+ int ret;
+
+again:
+ em = lookup_extent_mapping(em_tree, start, end);
+ if (em) {
+ goto out;
}
- return buf;
+ em = alloc_extent_map(GFP_NOFS);
+ if (!em) {
+ em = ERR_PTR(-ENOMEM);
+ goto out;
+ }
+ em->start = 0;
+ em->end = (i_size_read(inode) & ~((u64)PAGE_CACHE_SIZE -1)) - 1;
+ em->block_start = 0;
+ em->block_end = em->end;
+ em->bdev = inode->i_sb->s_bdev;
+ ret = add_extent_mapping(em_tree, em);
+ if (ret == -EEXIST) {
+ free_extent_map(em);
+ em = NULL;
+ goto again;
+ } else if (ret) {
+ em = ERR_PTR(ret);
+ }
+out:
+ return em;
}
-struct btrfs_buffer *read_tree_block(struct btrfs_root *root, u64 blocknr)
+u32 btrfs_csum_data(struct btrfs_root *root, char *data, u32 seed, size_t len)
{
- loff_t offset = blocknr * root->blocksize;
- struct btrfs_buffer *buf;
- int ret;
+ return crc32c(seed, data, len);
+}
- buf = radix_tree_lookup(&root->cache_radix, blocknr);
- if (buf) {
- buf->count++;
- } else {
- buf = alloc_tree_block(root, blocknr);
- if (!buf)
- return NULL;
- ret = pread(root->fp, &buf->node, root->blocksize, offset);
- if (ret != root->blocksize) {
- free(buf);
- return NULL;
- }
- }
- if (check_tree_block(root, buf))
- BUG();
- return buf;
+void btrfs_csum_final(u32 crc, char *result)
+{
+ *(__le32 *)result = ~cpu_to_le32(crc);
}
-int dirty_tree_block(struct btrfs_root *root, struct btrfs_buffer *buf)
+static int csum_tree_block(struct btrfs_root *root, struct extent_buffer *buf,
+ int verify)
{
- if (!list_empty(&buf->dirty))
- return 0;
- list_add_tail(&buf->dirty, &root->trans);
- buf->count++;
+ char result[BTRFS_CRC32_SIZE];
+ unsigned long len;
+ unsigned long cur_len;
+ unsigned long offset = BTRFS_CSUM_SIZE;
+ char *map_token = NULL;
+ char *kaddr;
+ unsigned long map_start;
+ unsigned long map_len;
+ int err;
+ u32 crc = ~(u32)0;
+
+ len = buf->len - offset;
+ while(len > 0) {
+ err = map_private_extent_buffer(buf, offset, 32,
+ &map_token, &kaddr,
+ &map_start, &map_len, KM_USER0);
+ if (err) {
+ printk("failed to map extent buffer! %lu\n",
+ offset);
+ return 1;
+ }
+ cur_len = min(len, map_len - (offset - map_start));
+ crc = btrfs_csum_data(root, kaddr + offset - map_start,
+ crc, cur_len);
+ len -= cur_len;
+ offset += cur_len;
+ unmap_extent_buffer(buf, map_token, KM_USER0);
+ }
+ btrfs_csum_final(crc, result);
+
+ if (verify) {
+ if (memcmp_extent_buffer(buf, result, 0, BTRFS_CRC32_SIZE)) {
+ printk("btrfs: %s checksum verify failed on %llu\n",
+ root->fs_info->sb->s_id,
+ buf->start);
+ return 1;
+ }
+ } else {
+ write_extent_buffer(buf, result, 0, BTRFS_CRC32_SIZE);
+ }
return 0;
}
-int clean_tree_block(struct btrfs_root *root, struct btrfs_buffer *buf)
+
+int csum_dirty_buffer(struct btrfs_root *root, struct page *page)
{
- if (!list_empty(&buf->dirty)) {
- list_del_init(&buf->dirty);
- btrfs_block_release(root, buf);
+ struct extent_map_tree *tree;
+ u64 start = (u64)page->index << PAGE_CACHE_SHIFT;
+ u64 found_start;
+ int found_level;
+ unsigned long len;
+ struct extent_buffer *eb;
+ tree = &BTRFS_I(page->mapping->host)->extent_tree;
+
+ if (page->private == EXTENT_PAGE_PRIVATE)
+ goto out;
+ if (!page->private)
+ goto out;
+ len = page->private >> 2;
+ if (len == 0) {
+ WARN_ON(1);
+ }
+ eb = alloc_extent_buffer(tree, start, len, page, GFP_NOFS);
+ read_extent_buffer_pages(tree, eb, start + PAGE_CACHE_SIZE, 1);
+ found_start = btrfs_header_bytenr(eb);
+ if (found_start != start) {
+ printk("warning: eb start incorrect %Lu buffer %Lu len %lu\n",
+ start, found_start, len);
}
+ found_level = btrfs_header_level(eb);
+ csum_tree_block(root, eb, 0);
+ free_extent_buffer(eb);
+out:
return 0;
}
-int write_tree_block(struct btrfs_root *root, struct btrfs_buffer *buf)
+static int btree_writepage_io_hook(struct page *page, u64 start, u64 end)
{
- u64 blocknr = buf->blocknr;
- loff_t offset = blocknr * root->blocksize;
- int ret;
+ struct btrfs_root *root = BTRFS_I(page->mapping->host)->root;
- if (buf->blocknr != btrfs_header_blocknr(&buf->node.header))
- BUG();
- ret = pwrite(root->fp, &buf->node, root->blocksize, offset);
- if (ret != root->blocksize)
- return ret;
+ csum_dirty_buffer(root, page);
return 0;
}
-static int __commit_transaction(struct btrfs_root *root)
+static int btree_writepage(struct page *page, struct writeback_control *wbc)
{
- struct btrfs_buffer *b;
- int ret = 0;
- int wret;
- while(!list_empty(&root->trans)) {
- b = list_entry(root->trans.next, struct btrfs_buffer, dirty);
- list_del_init(&b->dirty);
- wret = write_tree_block(root, b);
- if (wret)
- ret = wret;
- btrfs_block_release(root, b);
+ struct extent_map_tree *tree;
+ tree = &BTRFS_I(page->mapping->host)->extent_tree;
+ return extent_write_full_page(tree, page, btree_get_extent, wbc);
+}
+
+static int btree_writepages(struct address_space *mapping,
+ struct writeback_control *wbc)
+{
+ struct extent_map_tree *tree;
+ tree = &BTRFS_I(mapping->host)->extent_tree;
+ if (wbc->sync_mode == WB_SYNC_NONE) {
+ u64 num_dirty;
+ u64 start = 0;
+ unsigned long thresh = 96 * 1024 * 1024;
+
+ if (wbc->for_kupdate)
+ return 0;
+
+ if (current_is_pdflush()) {
+ thresh = 96 * 1024 * 1024;
+ } else {
+ thresh = 8 * 1024 * 1024;
+ }
+ num_dirty = count_range_bits(tree, &start, thresh, EXTENT_DIRTY);
+ if (num_dirty < thresh) {
+ return 0;
+ }
}
- return ret;
+ return extent_writepages(tree, mapping, btree_get_extent, wbc);
}
-static int commit_extent_and_tree_roots(struct btrfs_root *tree_root,
- struct btrfs_root *extent_root)
+int btree_readpage(struct file *file, struct page *page)
{
+ struct extent_map_tree *tree;
+ tree = &BTRFS_I(page->mapping->host)->extent_tree;
+ return extent_read_full_page(tree, page, btree_get_extent);
+}
+
+static int btree_releasepage(struct page *page, gfp_t unused_gfp_flags)
+{
+ struct extent_map_tree *tree;
int ret;
- u64 old_extent_block;
- while(1) {
- old_extent_block = btrfs_root_blocknr(&extent_root->root_item);
- if (old_extent_block == extent_root->node->blocknr)
- break;
- btrfs_set_root_blocknr(&extent_root->root_item,
- extent_root->node->blocknr);
- ret = btrfs_update_root(tree_root,
- &extent_root->root_key,
- &extent_root->root_item);
- BUG_ON(ret);
+ tree = &BTRFS_I(page->mapping->host)->extent_tree;
+ ret = try_release_extent_mapping(tree, page);
+ if (ret == 1) {
+ ClearPagePrivate(page);
+ set_page_private(page, 0);
+ page_cache_release(page);
}
- __commit_transaction(extent_root);
- __commit_transaction(tree_root);
- return 0;
+ return ret;
}
-int btrfs_commit_transaction(struct btrfs_root *root,
- struct btrfs_super_block *s)
+static void btree_invalidatepage(struct page *page, unsigned long offset)
{
- int ret = 0;
- struct btrfs_buffer *snap = root->commit_root;
- struct btrfs_key snap_key;
+ struct extent_map_tree *tree;
+ tree = &BTRFS_I(page->mapping->host)->extent_tree;
+ extent_invalidatepage(tree, page, offset);
+ btree_releasepage(page, GFP_NOFS);
+}
- ret = __commit_transaction(root);
- BUG_ON(ret);
+#if 0
+static int btree_writepage(struct page *page, struct writeback_control *wbc)
+{
+ struct buffer_head *bh;
+ struct btrfs_root *root = BTRFS_I(page->mapping->host)->root;
+ struct buffer_head *head;
+ if (!page_has_buffers(page)) {
+ create_empty_buffers(page, root->fs_info->sb->s_blocksize,
+ (1 << BH_Dirty)|(1 << BH_Uptodate));
+ }
+ head = page_buffers(page);
+ bh = head;
+ do {
+ if (buffer_dirty(bh))
+ csum_tree_block(root, bh, 0);
+ bh = bh->b_this_page;
+ } while (bh != head);
+ return block_write_full_page(page, btree_get_block, wbc);
+}
+#endif
+
+static struct address_space_operations btree_aops = {
+ .readpage = btree_readpage,
+ .writepage = btree_writepage,
+ .writepages = btree_writepages,
+ .releasepage = btree_releasepage,
+ .invalidatepage = btree_invalidatepage,
+ .sync_page = block_sync_page,
+};
+
+int readahead_tree_block(struct btrfs_root *root, u64 bytenr, u32 blocksize)
+{
+ struct extent_buffer *buf = NULL;
+ struct inode *btree_inode = root->fs_info->btree_inode;
+ int ret = 0;
- if (root->commit_root == root->node)
+ buf = btrfs_find_create_tree_block(root, bytenr, blocksize);
+ if (!buf)
return 0;
+ read_extent_buffer_pages(&BTRFS_I(btree_inode)->extent_tree,
+ buf, 0, 0);
+ free_extent_buffer(buf);
+ return ret;
+}
- memcpy(&snap_key, &root->root_key, sizeof(snap_key));
- root->root_key.offset++;
-
- btrfs_set_root_blocknr(&root->root_item, root->node->blocknr);
- ret = btrfs_insert_root(root->tree_root, &root->root_key,
- &root->root_item);
- BUG_ON(ret);
-
- ret = commit_extent_and_tree_roots(root->tree_root, root->extent_root);
- BUG_ON(ret);
+struct extent_buffer *read_tree_block(struct btrfs_root *root, u64 bytenr,
+ u32 blocksize)
+{
+ struct extent_buffer *buf = NULL;
+ struct inode *btree_inode = root->fs_info->btree_inode;
+ struct extent_map_tree *extent_tree;
+ int ret;
- write_ctree_super(root, s);
- btrfs_finish_extent_commit(root->extent_root);
- btrfs_finish_extent_commit(root->tree_root);
+ extent_tree = &BTRFS_I(btree_inode)->extent_tree;
- root->commit_root = root->node;
- root->node->count++;
- ret = btrfs_drop_snapshot(root, snap);
- BUG_ON(ret);
+ buf = btrfs_find_create_tree_block(root, bytenr, blocksize);
+ if (!buf)
+ return NULL;
+ read_extent_buffer_pages(&BTRFS_I(btree_inode)->extent_tree,
+ buf, 0, 1);
+ if (buf->flags & EXTENT_CSUM) {
+ return buf;
+ }
+ if (test_range_bit(extent_tree, buf->start, buf->start + buf->len - 1,
+ EXTENT_CSUM, 1)) {
+ buf->flags |= EXTENT_CSUM;
+ return buf;
+ }
+ ret = csum_tree_block(root, buf, 1);
+ set_extent_bits(extent_tree, buf->start,
+ buf->start + buf->len - 1,
+ EXTENT_CSUM, GFP_NOFS);
+ buf->flags |= EXTENT_CSUM;
+ return buf;
+}
- ret = btrfs_del_root(root->tree_root, &snap_key);
- BUG_ON(ret);
+int clean_tree_block(struct btrfs_trans_handle *trans, struct btrfs_root *root,
+ struct extent_buffer *buf)
+{
+ struct inode *btree_inode = root->fs_info->btree_inode;
+ clear_extent_buffer_dirty(&BTRFS_I(btree_inode)->extent_tree, buf);
+ return 0;
+}
- return ret;
+int wait_on_tree_block_writeback(struct btrfs_root *root,
+ struct extent_buffer *buf)
+{
+ struct inode *btree_inode = root->fs_info->btree_inode;
+ wait_on_extent_buffer_writeback(&BTRFS_I(btree_inode)->extent_tree,
+ buf);
+ return 0;
}
-static int __setup_root(struct btrfs_super_block *super,
- struct btrfs_root *root, u64 objectid, int fp)
+static int __setup_root(u32 nodesize, u32 leafsize, u32 sectorsize,
+ u32 stripesize, struct btrfs_root *root,
+ struct btrfs_fs_info *fs_info,
+ u64 objectid)
{
- INIT_LIST_HEAD(&root->trans);
- INIT_LIST_HEAD(&root->cache);
- root->cache_size = 0;
- root->fp = fp;
root->node = NULL;
+ root->inode = NULL;
root->commit_root = NULL;
- root->blocksize = btrfs_super_blocksize(super);
+ root->sectorsize = sectorsize;
+ root->nodesize = nodesize;
+ root->leafsize = leafsize;
+ root->stripesize = stripesize;
root->ref_cows = 0;
- memset(&root->current_insert, 0, sizeof(root->current_insert));
- memset(&root->last_insert, 0, sizeof(root->last_insert));
+ root->fs_info = fs_info;
+ root->objectid = objectid;
+ root->last_trans = 0;
+ root->highest_inode = 0;
+ root->last_inode_alloc = 0;
+ root->name = NULL;
memset(&root->root_key, 0, sizeof(root->root_key));
memset(&root->root_item, 0, sizeof(root->root_item));
+ memset(&root->defrag_progress, 0, sizeof(root->defrag_progress));
+ memset(&root->root_kobj, 0, sizeof(root->root_kobj));
+ init_completion(&root->kobj_unregister);
+ init_rwsem(&root->snap_sem);
+ root->defrag_running = 0;
+ root->defrag_level = 0;
+ root->root_key.objectid = objectid;
return 0;
}
-static int find_and_setup_root(struct btrfs_super_block *super,
- struct btrfs_root *tree_root, u64 objectid,
- struct btrfs_root *root, int fp)
+static int find_and_setup_root(struct btrfs_root *tree_root,
+ struct btrfs_fs_info *fs_info,
+ u64 objectid,
+ struct btrfs_root *root)
{
int ret;
+ u32 blocksize;
- __setup_root(super, root, objectid, fp);
+ __setup_root(tree_root->nodesize, tree_root->leafsize,
+ tree_root->sectorsize, tree_root->stripesize,
+ root, fs_info, objectid);
ret = btrfs_find_last_root(tree_root, objectid,
&root->root_item, &root->root_key);
BUG_ON(ret);
- root->node = read_tree_block(root,
- btrfs_root_blocknr(&root->root_item));
+ blocksize = btrfs_level_size(root, btrfs_root_level(&root->root_item));
+ root->node = read_tree_block(root, btrfs_root_bytenr(&root->root_item),
+ blocksize);
BUG_ON(!root->node);
return 0;
}
-struct btrfs_root *open_ctree(char *filename, struct btrfs_super_block *super)
+struct btrfs_root *btrfs_read_fs_root_no_radix(struct btrfs_fs_info *fs_info,
+ struct btrfs_key *location)
{
- struct btrfs_root *root = malloc(sizeof(struct btrfs_root));
- struct btrfs_root *extent_root = malloc(sizeof(struct btrfs_root));
- struct btrfs_root *tree_root = malloc(sizeof(struct btrfs_root));
- int fp;
- int ret;
+ struct btrfs_root *root;
+ struct btrfs_root *tree_root = fs_info->tree_root;
+ struct btrfs_path *path;
+ struct extent_buffer *l;
+ u64 highest_inode;
+ u32 blocksize;
+ int ret = 0;
- root->extent_root = extent_root;
- root->tree_root = tree_root;
+ root = kzalloc(sizeof(*root), GFP_NOFS);
+ if (!root)
+ return ERR_PTR(-ENOMEM);
+ if (location->offset == (u64)-1) {
+ ret = find_and_setup_root(tree_root, fs_info,
+ location->objectid, root);
+ if (ret) {
+ kfree(root);
+ return ERR_PTR(ret);
+ }
+ goto insert;
+ }
- extent_root->extent_root = extent_root;
- extent_root->tree_root = tree_root;
+ __setup_root(tree_root->nodesize, tree_root->leafsize,
+ tree_root->sectorsize, tree_root->stripesize,
+ root, fs_info, location->objectid);
+
+ path = btrfs_alloc_path();
+ BUG_ON(!path);
+ ret = btrfs_search_slot(NULL, tree_root, location, path, 0, 0);
+ if (ret != 0) {
+ if (ret > 0)
+ ret = -ENOENT;
+ goto out;
+ }
+ l = path->nodes[0];
+ read_extent_buffer(l, &root->root_item,
+ btrfs_item_ptr_offset(l, path->slots[0]),
+ sizeof(root->root_item));
+ memcpy(&root->root_key, location, sizeof(*location));
+ ret = 0;
+out:
+ btrfs_release_path(root, path);
+ btrfs_free_path(path);
+ if (ret) {
+ kfree(root);
+ return ERR_PTR(ret);
+ }
+ blocksize = btrfs_level_size(root, btrfs_root_level(&root->root_item));
+ root->node = read_tree_block(root, btrfs_root_bytenr(&root->root_item),
+ blocksize);
+ BUG_ON(!root->node);
+insert:
+ root->ref_cows = 1;
+ ret = btrfs_find_highest_inode(root, &highest_inode);
+ if (ret == 0) {
+ root->highest_inode = highest_inode;
+ root->last_inode_alloc = highest_inode;
+ }
+ return root;
+}
- tree_root->extent_root = extent_root;
- tree_root->tree_root = tree_root;
+struct btrfs_root *btrfs_read_fs_root(struct btrfs_fs_info *fs_info,
+ struct btrfs_key *location,
+ const char *name, int namelen)
+{
+ struct btrfs_root *root;
+ int ret;
- fp = open(filename, O_CREAT | O_RDWR, 0600);
- if (fp < 0) {
- free(root);
- return NULL;
- }
- INIT_RADIX_TREE(&root->cache_radix, GFP_KERNEL);
- INIT_RADIX_TREE(&root->pinned_radix, GFP_KERNEL);
- INIT_RADIX_TREE(&extent_root->pinned_radix, GFP_KERNEL);
- INIT_RADIX_TREE(&extent_root->cache_radix, GFP_KERNEL);
- INIT_RADIX_TREE(&tree_root->pinned_radix, GFP_KERNEL);
- INIT_RADIX_TREE(&tree_root->cache_radix, GFP_KERNEL);
-
- ret = pread(fp, super, sizeof(struct btrfs_super_block),
- BTRFS_SUPER_INFO_OFFSET);
- if (ret == 0 || btrfs_super_root(super) == 0) {
- printf("making new FS!\n");
- ret = mkfs(fp, 0, 1024);
- if (ret)
- return NULL;
- ret = pread(fp, super, sizeof(struct btrfs_super_block),
- BTRFS_SUPER_INFO_OFFSET);
- if (ret != sizeof(struct btrfs_super_block))
- return NULL;
+ root = radix_tree_lookup(&fs_info->fs_roots_radix,
+ (unsigned long)location->objectid);
+ if (root)
+ return root;
+
+ root = btrfs_read_fs_root_no_radix(fs_info, location);
+ if (IS_ERR(root))
+ return root;
+ ret = radix_tree_insert(&fs_info->fs_roots_radix,
+ (unsigned long)root->root_key.objectid,
+ root);
+ if (ret) {
+ free_extent_buffer(root->node);
+ kfree(root);
+ return ERR_PTR(ret);
}
- BUG_ON(ret < 0);
- __setup_root(super, tree_root, BTRFS_ROOT_TREE_OBJECTID, fp);
- tree_root->node = read_tree_block(tree_root, btrfs_super_root(super));
- BUG_ON(!tree_root->node);
+ ret = btrfs_set_root_name(root, name, namelen);
+ if (ret) {
+ free_extent_buffer(root->node);
+ kfree(root);
+ return ERR_PTR(ret);
+ }
- ret = find_and_setup_root(super, tree_root, BTRFS_EXTENT_TREE_OBJECTID,
- extent_root, fp);
- BUG_ON(ret);
+ ret = btrfs_sysfs_add_root(root);
+ if (ret) {
+ free_extent_buffer(root->node);
+ kfree(root->name);
+ kfree(root);
+ return ERR_PTR(ret);
+ }
- ret = find_and_setup_root(super, tree_root, BTRFS_FS_TREE_OBJECTID,
- root, fp);
+ ret = btrfs_find_dead_roots(fs_info->tree_root,
+ root->root_key.objectid, root);
BUG_ON(ret);
- root->commit_root = root->node;
- root->node->count++;
- root->ref_cows = 1;
return root;
}
-
-int write_ctree_super(struct btrfs_root *root, struct btrfs_super_block *s)
+#if 0
+static int add_hasher(struct btrfs_fs_info *info, char *type) {
+ struct btrfs_hasher *hasher;
+
+ hasher = kmalloc(sizeof(*hasher), GFP_NOFS);
+ if (!hasher)
+ return -ENOMEM;
+ hasher->hash_tfm = crypto_alloc_hash(type, 0, CRYPTO_ALG_ASYNC);
+ if (!hasher->hash_tfm) {
+ kfree(hasher);
+ return -EINVAL;
+ }
+ spin_lock(&info->hash_lock);
+ list_add(&hasher->list, &info->hashers);
+ spin_unlock(&info->hash_lock);
+ return 0;
+}
+#endif
+struct btrfs_root *open_ctree(struct super_block *sb)
{
+ u32 sectorsize;
+ u32 nodesize;
+ u32 leafsize;
+ u32 blocksize;
+ u32 stripesize;
+ struct btrfs_root *extent_root = kmalloc(sizeof(struct btrfs_root),
+ GFP_NOFS);
+ struct btrfs_root *tree_root = kmalloc(sizeof(struct btrfs_root),
+ GFP_NOFS);
+ struct btrfs_fs_info *fs_info = kmalloc(sizeof(*fs_info),
+ GFP_NOFS);
int ret;
- btrfs_set_super_root(s, root->tree_root->node->blocknr);
- ret = pwrite(root->fp, s, sizeof(*s),
- BTRFS_SUPER_INFO_OFFSET);
- if (ret != sizeof(*s)) {
- fprintf(stderr, "failed to write new super block err %d\n", ret);
- return ret;
+ int err = -EIO;
+ struct btrfs_super_block *disk_super;
+
+ if (!extent_root || !tree_root || !fs_info) {
+ err = -ENOMEM;
+ goto fail;
}
+ INIT_RADIX_TREE(&fs_info->fs_roots_radix, GFP_NOFS);
+ INIT_LIST_HEAD(&fs_info->trans_list);
+ INIT_LIST_HEAD(&fs_info->dead_roots);
+ INIT_LIST_HEAD(&fs_info->hashers);
+ spin_lock_init(&fs_info->hash_lock);
+
+ memset(&fs_info->super_kobj, 0, sizeof(fs_info->super_kobj));
+ init_completion(&fs_info->kobj_unregister);
+ sb_set_blocksize(sb, 4096);
+ fs_info->running_transaction = NULL;
+ fs_info->last_trans_committed = 0;
+ fs_info->tree_root = tree_root;
+ fs_info->extent_root = extent_root;
+ fs_info->sb = sb;
+ fs_info->mount_opt = 0;
+ fs_info->max_extent = (u64)-1;
+ fs_info->btree_inode = new_inode(sb);
+ fs_info->btree_inode->i_ino = 1;
+ fs_info->btree_inode->i_nlink = 1;
+ fs_info->btree_inode->i_size = sb->s_bdev->bd_inode->i_size;
+ fs_info->btree_inode->i_mapping->a_ops = &btree_aops;
+ extent_map_tree_init(&BTRFS_I(fs_info->btree_inode)->extent_tree,
+ fs_info->btree_inode->i_mapping,
+ GFP_NOFS);
+ BTRFS_I(fs_info->btree_inode)->extent_tree.ops = &btree_extent_map_ops;
+
+ extent_map_tree_init(&fs_info->free_space_cache,
+ fs_info->btree_inode->i_mapping, GFP_NOFS);
+ extent_map_tree_init(&fs_info->block_group_cache,
+ fs_info->btree_inode->i_mapping, GFP_NOFS);
+ extent_map_tree_init(&fs_info->pinned_extents,
+ fs_info->btree_inode->i_mapping, GFP_NOFS);
+ extent_map_tree_init(&fs_info->pending_del,
+ fs_info->btree_inode->i_mapping, GFP_NOFS);
+ extent_map_tree_init(&fs_info->extent_ins,
+ fs_info->btree_inode->i_mapping, GFP_NOFS);
+ fs_info->do_barriers = 1;
+ fs_info->closing = 0;
+ fs_info->total_pinned = 0;
+#if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,18)
+ INIT_WORK(&fs_info->trans_work, btrfs_transaction_cleaner, fs_info);
+#else
+ INIT_DELAYED_WORK(&fs_info->trans_work, btrfs_transaction_cleaner);
+#endif
+ BTRFS_I(fs_info->btree_inode)->root = tree_root;
+ memset(&BTRFS_I(fs_info->btree_inode)->location, 0,
+ sizeof(struct btrfs_key));
+ insert_inode_hash(fs_info->btree_inode);
+ mapping_set_gfp_mask(fs_info->btree_inode->i_mapping, GFP_NOFS);
+
+ mutex_init(&fs_info->trans_mutex);
+ mutex_init(&fs_info->fs_mutex);
+
+#if 0
+ ret = add_hasher(fs_info, "crc32c");
+ if (ret) {
+ printk("btrfs: failed hash setup, modprobe cryptomgr?\n");
+ err = -ENOMEM;
+ goto fail_iput;
+ }
+#endif
+ __setup_root(512, 512, 512, 512, tree_root,
+ fs_info, BTRFS_ROOT_TREE_OBJECTID);
+
+ fs_info->sb_buffer = read_tree_block(tree_root,
+ BTRFS_SUPER_INFO_OFFSET,
+ 512);
+
+ if (!fs_info->sb_buffer)
+ goto fail_iput;
+
+ read_extent_buffer(fs_info->sb_buffer, &fs_info->super_copy, 0,
+ sizeof(fs_info->super_copy));
+
+ read_extent_buffer(fs_info->sb_buffer, fs_info->fsid,
+ (unsigned long)btrfs_super_fsid(fs_info->sb_buffer),
+ BTRFS_FSID_SIZE);
+ disk_super = &fs_info->super_copy;
+ if (!btrfs_super_root(disk_super))
+ goto fail_sb_buffer;
+
+ nodesize = btrfs_super_nodesize(disk_super);
+ leafsize = btrfs_super_leafsize(disk_super);
+ sectorsize = btrfs_super_sectorsize(disk_super);
+ stripesize = btrfs_super_stripesize(disk_super);
+ tree_root->nodesize = nodesize;
+ tree_root->leafsize = leafsize;
+ tree_root->sectorsize = sectorsize;
+ tree_root->stripesize = stripesize;
+ sb_set_blocksize(sb, sectorsize);
+
+ i_size_write(fs_info->btree_inode,
+ btrfs_super_total_bytes(disk_super));
+
+ if (strncmp((char *)(&disk_super->magic), BTRFS_MAGIC,
+ sizeof(disk_super->magic))) {
+ printk("btrfs: valid FS not found on %s\n", sb->s_id);
+ goto fail_sb_buffer;
+ }
+
+ blocksize = btrfs_level_size(tree_root,
+ btrfs_super_root_level(disk_super));
+
+ tree_root->node = read_tree_block(tree_root,
+ btrfs_super_root(disk_super),
+ blocksize);
+ if (!tree_root->node)
+ goto fail_sb_buffer;
+
+ mutex_lock(&fs_info->fs_mutex);
+
+ ret = find_and_setup_root(tree_root, fs_info,
+ BTRFS_EXTENT_TREE_OBJECTID, extent_root);
+ if (ret) {
+ mutex_unlock(&fs_info->fs_mutex);
+ goto fail_tree_root;
+ }
+
+ btrfs_read_block_groups(extent_root);
+
+ fs_info->generation = btrfs_super_generation(disk_super) + 1;
+ mutex_unlock(&fs_info->fs_mutex);
+ return tree_root;
+
+fail_tree_root:
+ free_extent_buffer(tree_root->node);
+fail_sb_buffer:
+ free_extent_buffer(fs_info->sb_buffer);
+fail_iput:
+ iput(fs_info->btree_inode);
+fail:
+ kfree(extent_root);
+ kfree(tree_root);
+ kfree(fs_info);
+ return ERR_PTR(err);
+}
+
+int write_ctree_super(struct btrfs_trans_handle *trans, struct btrfs_root
+ *root)
+{
+ int ret;
+ struct extent_buffer *super = root->fs_info->sb_buffer;
+ struct inode *btree_inode = root->fs_info->btree_inode;
+
+ set_extent_buffer_dirty(&BTRFS_I(btree_inode)->extent_tree, super);
+ ret = sync_page_range_nolock(btree_inode, btree_inode->i_mapping,
+ super->start, super->len);
+ return ret;
+}
+
+int btrfs_free_fs_root(struct btrfs_fs_info *fs_info, struct btrfs_root *root)
+{
+ radix_tree_delete(&fs_info->fs_roots_radix,
+ (unsigned long)root->root_key.objectid);
+ btrfs_sysfs_del_root(root);
+ if (root->inode)
+ iput(root->inode);
+ if (root->node)
+ free_extent_buffer(root->node);
+ if (root->commit_root)
+ free_extent_buffer(root->commit_root);
+ if (root->name)
+ kfree(root->name);
+ kfree(root);
return 0;
}
-static int drop_cache(struct btrfs_root *root)
+static int del_fs_roots(struct btrfs_fs_info *fs_info)
{
- while(!list_empty(&root->cache)) {
- struct btrfs_buffer *b = list_entry(root->cache.next,
- struct btrfs_buffer, cache);
- list_del_init(&b->cache);
- btrfs_block_release(root, b);
+ int ret;
+ struct btrfs_root *gang[8];
+ int i;
+
+ while(1) {
+ ret = radix_tree_gang_lookup(&fs_info->fs_roots_radix,
+ (void **)gang, 0,
+ ARRAY_SIZE(gang));
+ if (!ret)
+ break;
+ for (i = 0; i < ret; i++)
+ btrfs_free_fs_root(fs_info, gang[i]);
}
return 0;
}
-int close_ctree(struct btrfs_root *root, struct btrfs_super_block *s)
+
+int close_ctree(struct btrfs_root *root)
{
int ret;
- btrfs_commit_transaction(root, s);
- ret = commit_extent_and_tree_roots(root->tree_root, root->extent_root);
+ struct btrfs_trans_handle *trans;
+ struct btrfs_fs_info *fs_info = root->fs_info;
+
+ fs_info->closing = 1;
+ btrfs_transaction_flush_work(root);
+ mutex_lock(&fs_info->fs_mutex);
+ btrfs_defrag_dirty_roots(root->fs_info);
+ trans = btrfs_start_transaction(root, 1);
+ ret = btrfs_commit_transaction(trans, root);
+ /* run commit again to drop the original snapshot */
+ trans = btrfs_start_transaction(root, 1);
+ btrfs_commit_transaction(trans, root);
+ ret = btrfs_write_and_wait_transaction(NULL, root);
BUG_ON(ret);
- write_ctree_super(root, s);
- drop_cache(root->extent_root);
- drop_cache(root->tree_root);
- drop_cache(root);
- BUG_ON(!list_empty(&root->trans));
- BUG_ON(!list_empty(&root->extent_root->trans));
- BUG_ON(!list_empty(&root->tree_root->trans));
-
- close(root->fp);
- if (root->node)
- btrfs_block_release(root, root->node);
- if (root->extent_root->node)
- btrfs_block_release(root->extent_root, root->extent_root->node);
- if (root->tree_root->node)
- btrfs_block_release(root->tree_root, root->tree_root->node);
- btrfs_block_release(root, root->commit_root);
- free(root);
- printf("on close %d blocks are allocated\n", allocated_blocks);
+ write_ctree_super(NULL, root);
+ mutex_unlock(&fs_info->fs_mutex);
+
+ if (fs_info->extent_root->node)
+ free_extent_buffer(fs_info->extent_root->node);
+
+ if (fs_info->tree_root->node)
+ free_extent_buffer(fs_info->tree_root->node);
+
+ free_extent_buffer(fs_info->sb_buffer);
+
+ btrfs_free_block_groups(root->fs_info);
+ del_fs_roots(fs_info);
+
+ filemap_write_and_wait(fs_info->btree_inode->i_mapping);
+
+ extent_map_tree_empty_lru(&fs_info->free_space_cache);
+ extent_map_tree_empty_lru(&fs_info->block_group_cache);
+ extent_map_tree_empty_lru(&fs_info->pinned_extents);
+ extent_map_tree_empty_lru(&fs_info->pending_del);
+ extent_map_tree_empty_lru(&fs_info->extent_ins);
+ extent_map_tree_empty_lru(&BTRFS_I(fs_info->btree_inode)->extent_tree);
+
+ truncate_inode_pages(fs_info->btree_inode->i_mapping, 0);
+
+ iput(fs_info->btree_inode);
+#if 0
+ while(!list_empty(&fs_info->hashers)) {
+ struct btrfs_hasher *hasher;
+ hasher = list_entry(fs_info->hashers.next, struct btrfs_hasher,
+ hashers);
+ list_del(&hasher->hashers);
+ crypto_free_hash(&fs_info->hash_tfm);
+ kfree(hasher);
+ }
+#endif
+ kfree(fs_info->extent_root);
+ kfree(fs_info->tree_root);
return 0;
}
-void btrfs_block_release(struct btrfs_root *root, struct btrfs_buffer *buf)
-{
- buf->count--;
- if (buf->count < 0)
- BUG();
- if (buf->count == 0) {
- BUG_ON(!list_empty(&buf->cache));
- BUG_ON(!list_empty(&buf->dirty));
- if (!radix_tree_lookup(&root->cache_radix, buf->blocknr))
- BUG();
- radix_tree_delete(&root->cache_radix, buf->blocknr);
- memset(buf, 0, sizeof(*buf));
- free(buf);
- BUG_ON(allocated_blocks == 0);
- allocated_blocks--;
- BUG_ON(root->cache_size == 0);
- root->cache_size--;
+int btrfs_buffer_uptodate(struct extent_buffer *buf)
+{
+ struct inode *btree_inode = buf->first_page->mapping->host;
+ return extent_buffer_uptodate(&BTRFS_I(btree_inode)->extent_tree, buf);
+}
+
+int btrfs_set_buffer_uptodate(struct extent_buffer *buf)
+{
+ struct inode *btree_inode = buf->first_page->mapping->host;
+ return set_extent_buffer_uptodate(&BTRFS_I(btree_inode)->extent_tree,
+ buf);
+}
+
+void btrfs_mark_buffer_dirty(struct extent_buffer *buf)
+{
+ struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root;
+ u64 transid = btrfs_header_generation(buf);
+ struct inode *btree_inode = root->fs_info->btree_inode;
+
+ if (transid != root->fs_info->generation) {
+ printk(KERN_CRIT "transid mismatch buffer %llu, found %Lu running %Lu\n",
+ (unsigned long long)buf->start,
+ transid, root->fs_info->generation);
+ WARN_ON(1);
}
+ set_extent_buffer_dirty(&BTRFS_I(btree_inode)->extent_tree, buf);
+}
+
+void btrfs_btree_balance_dirty(struct btrfs_root *root, unsigned long nr)
+{
+ balance_dirty_pages_ratelimited_nr(
+ root->fs_info->btree_inode->i_mapping, 1);
+}
+
+void btrfs_set_buffer_defrag(struct extent_buffer *buf)
+{
+ struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root;
+ struct inode *btree_inode = root->fs_info->btree_inode;
+ set_extent_bits(&BTRFS_I(btree_inode)->extent_tree, buf->start,
+ buf->start + buf->len - 1, EXTENT_DEFRAG, GFP_NOFS);
+}
+
+void btrfs_set_buffer_defrag_done(struct extent_buffer *buf)
+{
+ struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root;
+ struct inode *btree_inode = root->fs_info->btree_inode;
+ set_extent_bits(&BTRFS_I(btree_inode)->extent_tree, buf->start,
+ buf->start + buf->len - 1, EXTENT_DEFRAG_DONE,
+ GFP_NOFS);
+}
+
+int btrfs_buffer_defrag(struct extent_buffer *buf)
+{
+ struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root;
+ struct inode *btree_inode = root->fs_info->btree_inode;
+ return test_range_bit(&BTRFS_I(btree_inode)->extent_tree,
+ buf->start, buf->start + buf->len - 1, EXTENT_DEFRAG, 0);
+}
+
+int btrfs_buffer_defrag_done(struct extent_buffer *buf)
+{
+ struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root;
+ struct inode *btree_inode = root->fs_info->btree_inode;
+ return test_range_bit(&BTRFS_I(btree_inode)->extent_tree,
+ buf->start, buf->start + buf->len - 1,
+ EXTENT_DEFRAG_DONE, 0);
+}
+
+int btrfs_clear_buffer_defrag_done(struct extent_buffer *buf)
+{
+ struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root;
+ struct inode *btree_inode = root->fs_info->btree_inode;
+ return clear_extent_bits(&BTRFS_I(btree_inode)->extent_tree,
+ buf->start, buf->start + buf->len - 1,
+ EXTENT_DEFRAG_DONE, GFP_NOFS);
+}
+
+int btrfs_clear_buffer_defrag(struct extent_buffer *buf)
+{
+ struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root;
+ struct inode *btree_inode = root->fs_info->btree_inode;
+ return clear_extent_bits(&BTRFS_I(btree_inode)->extent_tree,
+ buf->start, buf->start + buf->len - 1,
+ EXTENT_DEFRAG, GFP_NOFS);
+}
+
+int btrfs_read_buffer(struct extent_buffer *buf)
+{
+ struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root;
+ struct inode *btree_inode = root->fs_info->btree_inode;
+ return read_extent_buffer_pages(&BTRFS_I(btree_inode)->extent_tree,
+ buf, 0, 1);
}
+static struct extent_map_ops btree_extent_map_ops = {
+ .writepage_io_hook = btree_writepage_io_hook,
+};
projects / linux-2.6-block.git / blobdiff