disk-io.c 30.3 KB
Newer Older
C
Chris Mason 已提交
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18
/*
 * 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.
 */

C
Chris Mason 已提交
19
#include <linux/fs.h>
20
#include <linux/blkdev.h>
21
#include <linux/crc32c.h>
C
Chris Mason 已提交
22
#include <linux/scatterlist.h>
C
Chris Mason 已提交
23
#include <linux/swap.h>
24
#include <linux/radix-tree.h>
C
Chris Mason 已提交
25
#include <linux/writeback.h>
26
#include <linux/buffer_head.h> // for block_sync_page
27 28
#include "ctree.h"
#include "disk-io.h"
29
#include "transaction.h"
30
#include "btrfs_inode.h"
31
#include "volumes.h"
32
#include "print-tree.h"
33

34 35
#if 0
static int check_tree_block(struct btrfs_root *root, struct extent_buffer *buf)
36
{
37 38 39 40
	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));
C
Chris Mason 已提交
41
		return 1;
42
	}
43
	return 0;
44
}
45
#endif
46

47
static struct extent_io_ops btree_extent_io_ops;
48

49
struct extent_buffer *btrfs_find_tree_block(struct btrfs_root *root,
50
					    u64 bytenr, u32 blocksize)
51
{
52
	struct inode *btree_inode = root->fs_info->btree_inode;
53
	struct extent_buffer *eb;
54
	eb = find_extent_buffer(&BTRFS_I(btree_inode)->io_tree,
55
				bytenr, blocksize, GFP_NOFS);
56
	return eb;
57
}
58

59
struct extent_buffer *btrfs_find_create_tree_block(struct btrfs_root *root,
60
						 u64 bytenr, u32 blocksize)
61 62
{
	struct inode *btree_inode = root->fs_info->btree_inode;
63
	struct extent_buffer *eb;
64

65
	eb = alloc_extent_buffer(&BTRFS_I(btree_inode)->io_tree,
66
				 bytenr, blocksize, NULL, GFP_NOFS);
67
	return eb;
68 69
}

70
struct extent_map *btree_get_extent(struct inode *inode, struct page *page,
71
				    size_t page_offset, u64 start, u64 len,
72
				    int create)
73
{
74 75 76 77 78
	struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree;
	struct extent_map *em;
	int ret;

again:
79 80 81
	spin_lock(&em_tree->lock);
	em = lookup_extent_mapping(em_tree, start, len);
	spin_unlock(&em_tree->lock);
82 83
	if (em) {
		goto out;
84
	}
85 86 87 88 89 90
	em = alloc_extent_map(GFP_NOFS);
	if (!em) {
		em = ERR_PTR(-ENOMEM);
		goto out;
	}
	em->start = 0;
91
	em->len = i_size_read(inode);
92 93
	em->block_start = 0;
	em->bdev = inode->i_sb->s_bdev;
94 95

	spin_lock(&em_tree->lock);
96
	ret = add_extent_mapping(em_tree, em);
97 98
	spin_unlock(&em_tree->lock);

99 100 101 102 103 104 105 106 107
	if (ret == -EEXIST) {
		free_extent_map(em);
		em = NULL;
		goto again;
	} else if (ret) {
		em = ERR_PTR(ret);
	}
out:
	return em;
108 109
}

110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153
u32 btrfs_csum_data(struct btrfs_root *root, char *data, u32 seed, size_t len)
{
	return crc32c(seed, data, len);
}

void btrfs_csum_final(u32 crc, char *result)
{
	*(__le32 *)result = ~cpu_to_le32(crc);
}

static int csum_tree_block(struct btrfs_root *root, struct extent_buffer *buf,
			   int verify)
{
	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) {
154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170
		int from_this_trans = 0;

		if (root->fs_info->running_transaction &&
		    btrfs_header_generation(buf) ==
		    root->fs_info->running_transaction->transid)
			from_this_trans = 1;

		/* FIXME, this is not good */
		if (from_this_trans == 0 &&
		    memcmp_extent_buffer(buf, result, 0, BTRFS_CRC32_SIZE)) {
			u32 val;
			u32 found = 0;
			memcpy(&found, result, BTRFS_CRC32_SIZE);

			read_extent_buffer(buf, &val, 0, BTRFS_CRC32_SIZE);
			printk("btrfs: %s checksum verify failed on %llu "
			       "wanted %X found %X from_this_trans %d\n",
171
			       root->fs_info->sb->s_id,
172
			       buf->start, val, found, from_this_trans);
173 174 175 176 177 178 179 180 181 182 183
			return 1;
		}
	} else {
		write_extent_buffer(buf, result, 0, BTRFS_CRC32_SIZE);
	}
	return 0;
}


int csum_dirty_buffer(struct btrfs_root *root, struct page *page)
{
184
	struct extent_io_tree *tree;
185
	u64 start = (u64)page->index << PAGE_CACHE_SHIFT;
186 187 188 189
	u64 found_start;
	int found_level;
	unsigned long len;
	struct extent_buffer *eb;
190
	tree = &BTRFS_I(page->mapping->host)->io_tree;
191 192 193 194 195 196 197 198 199 200

	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);
201 202
	read_extent_buffer_pages(tree, eb, start + PAGE_CACHE_SIZE, 1,
				 btree_get_extent);
203
	btrfs_clear_buffer_defrag(eb);
204 205 206 207
	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);
208 209 210 211 212 213 214 215 216 217 218 219 220
		WARN_ON(1);
		goto err;
	}
	if (eb->first_page != page) {
		printk("bad first page %lu %lu\n", eb->first_page->index,
		       page->index);
		WARN_ON(1);
		goto err;
	}
	if (!PageUptodate(page)) {
		printk("csum not up to date page %lu\n", page->index);
		WARN_ON(1);
		goto err;
221 222 223
	}
	found_level = btrfs_header_level(eb);
	csum_tree_block(root, eb, 0);
224
err:
225 226 227 228 229
	free_extent_buffer(eb);
out:
	return 0;
}

230
static int btree_writepage_io_hook(struct page *page, u64 start, u64 end)
231
{
232 233 234
	struct btrfs_root *root = BTRFS_I(page->mapping->host)->root;

	csum_dirty_buffer(root, page);
235 236 237
	return 0;
}

238 239 240 241 242 243 244 245 246 247 248 249 250
static int btree_submit_bio_hook(struct inode *inode, int rw, struct bio *bio)
{
	struct btrfs_root *root = BTRFS_I(inode)->root;
	u64 offset;
	offset = bio->bi_sector << 9;
	if (offset == BTRFS_SUPER_INFO_OFFSET) {
		bio->bi_bdev = root->fs_info->sb->s_bdev;
		submit_bio(rw, bio);
		return 0;
	}
	return btrfs_map_bio(BTRFS_I(inode)->root, rw, bio);
}

251 252
static int btree_writepage(struct page *page, struct writeback_control *wbc)
{
253 254
	struct extent_io_tree *tree;
	tree = &BTRFS_I(page->mapping->host)->io_tree;
255 256
	return extent_write_full_page(tree, page, btree_get_extent, wbc);
}
257 258 259 260

static int btree_writepages(struct address_space *mapping,
			    struct writeback_control *wbc)
{
261 262
	struct extent_io_tree *tree;
	tree = &BTRFS_I(mapping->host)->io_tree;
263
	if (wbc->sync_mode == WB_SYNC_NONE) {
264 265 266
		u64 num_dirty;
		u64 start = 0;
		unsigned long thresh = 96 * 1024 * 1024;
267 268 269 270

		if (wbc->for_kupdate)
			return 0;

271 272 273 274 275
		if (current_is_pdflush()) {
			thresh = 96 * 1024 * 1024;
		} else {
			thresh = 8 * 1024 * 1024;
		}
276 277
		num_dirty = count_range_bits(tree, &start, (u64)-1,
					     thresh, EXTENT_DIRTY);
278 279 280 281
		if (num_dirty < thresh) {
			return 0;
		}
	}
282 283 284
	return extent_writepages(tree, mapping, btree_get_extent, wbc);
}

285 286
int btree_readpage(struct file *file, struct page *page)
{
287 288
	struct extent_io_tree *tree;
	tree = &BTRFS_I(page->mapping->host)->io_tree;
289 290
	return extent_read_full_page(tree, page, btree_get_extent);
}
C
Chris Mason 已提交
291

292
static int btree_releasepage(struct page *page, gfp_t gfp_flags)
293
{
294 295
	struct extent_io_tree *tree;
	struct extent_map_tree *map;
296
	int ret;
297

298 299
	tree = &BTRFS_I(page->mapping->host)->io_tree;
	map = &BTRFS_I(page->mapping->host)->extent_tree;
300
	ret = try_release_extent_mapping(map, tree, page, gfp_flags);
301 302 303 304 305
	if (ret == 1) {
		ClearPagePrivate(page);
		set_page_private(page, 0);
		page_cache_release(page);
	}
306 307 308
	return ret;
}

309
static void btree_invalidatepage(struct page *page, unsigned long offset)
310
{
311 312
	struct extent_io_tree *tree;
	tree = &BTRFS_I(page->mapping->host)->io_tree;
313 314
	extent_invalidatepage(tree, page, offset);
	btree_releasepage(page, GFP_NOFS);
315 316
}

317
#if 0
318
static int btree_writepage(struct page *page, struct writeback_control *wbc)
319
{
C
Chris Mason 已提交
320
	struct buffer_head *bh;
321
	struct btrfs_root *root = BTRFS_I(page->mapping->host)->root;
C
Chris Mason 已提交
322 323 324 325 326 327 328 329 330 331 332 333
	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);
334
	return block_write_full_page(page, btree_get_block, wbc);
335
}
336
#endif
337

338 339 340
static struct address_space_operations btree_aops = {
	.readpage	= btree_readpage,
	.writepage	= btree_writepage,
341
	.writepages	= btree_writepages,
342 343
	.releasepage	= btree_releasepage,
	.invalidatepage = btree_invalidatepage,
344 345 346
	.sync_page	= block_sync_page,
};

347
int readahead_tree_block(struct btrfs_root *root, u64 bytenr, u32 blocksize)
C
Chris Mason 已提交
348
{
349 350
	struct extent_buffer *buf = NULL;
	struct inode *btree_inode = root->fs_info->btree_inode;
351
	int ret = 0;
C
Chris Mason 已提交
352

353
	buf = btrfs_find_create_tree_block(root, bytenr, blocksize);
354
	if (!buf)
C
Chris Mason 已提交
355
		return 0;
356
	read_extent_buffer_pages(&BTRFS_I(btree_inode)->io_tree,
357
				 buf, 0, 0, btree_get_extent);
358
	free_extent_buffer(buf);
359
	return ret;
C
Chris Mason 已提交
360 361
}

362 363 364 365 366 367
static int close_all_devices(struct btrfs_fs_info *fs_info)
{
	struct list_head *list;
	struct list_head *next;
	struct btrfs_device *device;

368 369
	list = &fs_info->fs_devices->devices;
	list_for_each(next, list) {
370
		device = list_entry(next, struct btrfs_device, dev_list);
371 372 373
		if (device->bdev && device->bdev != fs_info->sb->s_bdev)
			close_bdev_excl(device->bdev);
		device->bdev = NULL;
374 375 376 377
	}
	return 0;
}

378 379
struct extent_buffer *read_tree_block(struct btrfs_root *root, u64 bytenr,
				      u32 blocksize)
380
{
381 382
	struct extent_buffer *buf = NULL;
	struct inode *btree_inode = root->fs_info->btree_inode;
383
	struct extent_io_tree *io_tree;
384
	u64 end;
385 386
	int ret;

387
	io_tree = &BTRFS_I(btree_inode)->io_tree;
388

389
	buf = btrfs_find_create_tree_block(root, bytenr, blocksize);
390 391
	if (!buf)
		return NULL;
392 393
	read_extent_buffer_pages(&BTRFS_I(btree_inode)->io_tree, buf, 0, 1,
				 btree_get_extent);
394 395

	if (buf->flags & EXTENT_CSUM)
396
		return buf;
397 398

	end = buf->start + PAGE_CACHE_SIZE - 1;
399
	if (test_range_bit(io_tree, buf->start, end, EXTENT_CSUM, 1)) {
400 401 402
		buf->flags |= EXTENT_CSUM;
		return buf;
	}
403

404
	lock_extent(io_tree, buf->start, end, GFP_NOFS);
405

406
	if (test_range_bit(io_tree, buf->start, end, EXTENT_CSUM, 1)) {
407 408 409 410
		buf->flags |= EXTENT_CSUM;
		goto out_unlock;
	}

411
	ret = csum_tree_block(root, buf, 1);
412
	set_extent_bits(io_tree, buf->start, end, EXTENT_CSUM, GFP_NOFS);
413
	buf->flags |= EXTENT_CSUM;
414 415

out_unlock:
416
	unlock_extent(io_tree, buf->start, end, GFP_NOFS);
417
	return buf;
418 419
}

420
int clean_tree_block(struct btrfs_trans_handle *trans, struct btrfs_root *root,
421
		     struct extent_buffer *buf)
422
{
423
	struct inode *btree_inode = root->fs_info->btree_inode;
424 425
	if (btrfs_header_generation(buf) ==
	    root->fs_info->running_transaction->transid)
426
		clear_extent_buffer_dirty(&BTRFS_I(btree_inode)->io_tree,
427
					  buf);
428 429 430 431 432 433 434
	return 0;
}

int wait_on_tree_block_writeback(struct btrfs_root *root,
				 struct extent_buffer *buf)
{
	struct inode *btree_inode = root->fs_info->btree_inode;
435
	wait_on_extent_buffer_writeback(&BTRFS_I(btree_inode)->io_tree,
436 437 438 439
					buf);
	return 0;
}

440
static int __setup_root(u32 nodesize, u32 leafsize, u32 sectorsize,
441
			u32 stripesize, struct btrfs_root *root,
442
			struct btrfs_fs_info *fs_info,
C
Chris Mason 已提交
443
			u64 objectid)
444
{
C
Chris Mason 已提交
445
	root->node = NULL;
446
	root->inode = NULL;
447
	root->commit_root = NULL;
448 449 450
	root->sectorsize = sectorsize;
	root->nodesize = nodesize;
	root->leafsize = leafsize;
451
	root->stripesize = stripesize;
C
Chris Mason 已提交
452
	root->ref_cows = 0;
453 454
	root->track_dirty = 0;

455
	root->fs_info = fs_info;
456 457
	root->objectid = objectid;
	root->last_trans = 0;
C
Chris Mason 已提交
458 459
	root->highest_inode = 0;
	root->last_inode_alloc = 0;
460
	root->name = NULL;
461
	root->in_sysfs = 0;
462 463

	INIT_LIST_HEAD(&root->dirty_list);
464 465
	memset(&root->root_key, 0, sizeof(root->root_key));
	memset(&root->root_item, 0, sizeof(root->root_item));
466
	memset(&root->defrag_progress, 0, sizeof(root->defrag_progress));
467 468
	memset(&root->root_kobj, 0, sizeof(root->root_kobj));
	init_completion(&root->kobj_unregister);
469 470
	root->defrag_running = 0;
	root->defrag_level = 0;
471
	root->root_key.objectid = objectid;
472 473 474
	return 0;
}

475
static int find_and_setup_root(struct btrfs_root *tree_root,
476 477
			       struct btrfs_fs_info *fs_info,
			       u64 objectid,
C
Chris Mason 已提交
478
			       struct btrfs_root *root)
479 480
{
	int ret;
481
	u32 blocksize;
482

483
	__setup_root(tree_root->nodesize, tree_root->leafsize,
484 485
		     tree_root->sectorsize, tree_root->stripesize,
		     root, fs_info, objectid);
486 487 488 489
	ret = btrfs_find_last_root(tree_root, objectid,
				   &root->root_item, &root->root_key);
	BUG_ON(ret);

490 491 492
	blocksize = btrfs_level_size(root, btrfs_root_level(&root->root_item));
	root->node = read_tree_block(root, btrfs_root_bytenr(&root->root_item),
				     blocksize);
493
	BUG_ON(!root->node);
494 495 496
	return 0;
}

497 498
struct btrfs_root *btrfs_read_fs_root_no_radix(struct btrfs_fs_info *fs_info,
					       struct btrfs_key *location)
499 500 501 502
{
	struct btrfs_root *root;
	struct btrfs_root *tree_root = fs_info->tree_root;
	struct btrfs_path *path;
503
	struct extent_buffer *l;
C
Chris Mason 已提交
504
	u64 highest_inode;
505
	u32 blocksize;
506 507
	int ret = 0;

508
	root = kzalloc(sizeof(*root), GFP_NOFS);
C
Chris Mason 已提交
509
	if (!root)
510 511
		return ERR_PTR(-ENOMEM);
	if (location->offset == (u64)-1) {
512
		ret = find_and_setup_root(tree_root, fs_info,
513 514 515 516 517 518 519 520
					  location->objectid, root);
		if (ret) {
			kfree(root);
			return ERR_PTR(ret);
		}
		goto insert;
	}

521
	__setup_root(tree_root->nodesize, tree_root->leafsize,
522 523
		     tree_root->sectorsize, tree_root->stripesize,
		     root, fs_info, location->objectid);
524 525 526 527 528 529 530 531 532

	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;
	}
533 534 535
	l = path->nodes[0];
	read_extent_buffer(l, &root->root_item,
	       btrfs_item_ptr_offset(l, path->slots[0]),
536
	       sizeof(root->root_item));
537
	memcpy(&root->root_key, location, sizeof(*location));
538 539 540 541 542 543 544 545
	ret = 0;
out:
	btrfs_release_path(root, path);
	btrfs_free_path(path);
	if (ret) {
		kfree(root);
		return ERR_PTR(ret);
	}
546 547 548
	blocksize = btrfs_level_size(root, btrfs_root_level(&root->root_item));
	root->node = read_tree_block(root, btrfs_root_bytenr(&root->root_item),
				     blocksize);
549 550 551
	BUG_ON(!root->node);
insert:
	root->ref_cows = 1;
552 553 554 555 556 557 558 559
	ret = btrfs_find_highest_inode(root, &highest_inode);
	if (ret == 0) {
		root->highest_inode = highest_inode;
		root->last_inode_alloc = highest_inode;
	}
	return root;
}

C
Chris Mason 已提交
560 561 562 563 564 565 566 567 568 569 570 571 572 573 574
struct btrfs_root *btrfs_lookup_fs_root(struct btrfs_fs_info *fs_info,
					u64 root_objectid)
{
	struct btrfs_root *root;

	if (root_objectid == BTRFS_ROOT_TREE_OBJECTID)
		return fs_info->tree_root;
	if (root_objectid == BTRFS_EXTENT_TREE_OBJECTID)
		return fs_info->extent_root;

	root = radix_tree_lookup(&fs_info->fs_roots_radix,
				 (unsigned long)root_objectid);
	return root;
}

575 576
struct btrfs_root *btrfs_read_fs_root_no_name(struct btrfs_fs_info *fs_info,
					      struct btrfs_key *location)
577 578 579 580
{
	struct btrfs_root *root;
	int ret;

581 582 583 584 585
	if (location->objectid == BTRFS_ROOT_TREE_OBJECTID)
		return fs_info->tree_root;
	if (location->objectid == BTRFS_EXTENT_TREE_OBJECTID)
		return fs_info->extent_root;

586 587 588 589 590 591 592 593
	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;
C
Chris Mason 已提交
594 595
	ret = radix_tree_insert(&fs_info->fs_roots_radix,
				(unsigned long)root->root_key.objectid,
596 597
				root);
	if (ret) {
598
		free_extent_buffer(root->node);
599 600 601
		kfree(root);
		return ERR_PTR(ret);
	}
602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618
	ret = btrfs_find_dead_roots(fs_info->tree_root,
				    root->root_key.objectid, root);
	BUG_ON(ret);

	return 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;

	root = btrfs_read_fs_root_no_name(fs_info, location);
	if (!root)
		return NULL;
619

620 621 622
	if (root->in_sysfs)
		return root;

623 624
	ret = btrfs_set_root_name(root, name, namelen);
	if (ret) {
625
		free_extent_buffer(root->node);
626 627 628 629 630 631
		kfree(root);
		return ERR_PTR(ret);
	}

	ret = btrfs_sysfs_add_root(root);
	if (ret) {
632
		free_extent_buffer(root->node);
633 634 635 636
		kfree(root->name);
		kfree(root);
		return ERR_PTR(ret);
	}
637
	root->in_sysfs = 1;
638 639
	return root;
}
640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657
#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
658 659
struct btrfs_root *open_ctree(struct super_block *sb,
			      struct btrfs_fs_devices *fs_devices)
660
{
661 662 663 664
	u32 sectorsize;
	u32 nodesize;
	u32 leafsize;
	u32 blocksize;
665
	u32 stripesize;
C
Chris Mason 已提交
666 667 668 669 670 671
	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);
672 673 674 675
	struct btrfs_root *chunk_root = kmalloc(sizeof(struct btrfs_root),
						GFP_NOFS);
	struct btrfs_root *dev_root = kmalloc(sizeof(struct btrfs_root),
					      GFP_NOFS);
676
	int ret;
C
Chris Mason 已提交
677
	int err = -EIO;
C
Chris Mason 已提交
678
	struct btrfs_super_block *disk_super;
679

C
Chris Mason 已提交
680 681 682 683
	if (!extent_root || !tree_root || !fs_info) {
		err = -ENOMEM;
		goto fail;
	}
684
	INIT_RADIX_TREE(&fs_info->fs_roots_radix, GFP_NOFS);
C
Chris Mason 已提交
685
	INIT_LIST_HEAD(&fs_info->trans_list);
686
	INIT_LIST_HEAD(&fs_info->dead_roots);
687 688
	INIT_LIST_HEAD(&fs_info->hashers);
	spin_lock_init(&fs_info->hash_lock);
689
	spin_lock_init(&fs_info->delalloc_lock);
690
	spin_lock_init(&fs_info->new_trans_lock);
691

692 693
	memset(&fs_info->super_kobj, 0, sizeof(fs_info->super_kobj));
	init_completion(&fs_info->kobj_unregister);
C
Chris Mason 已提交
694
	sb_set_blocksize(sb, 4096);
695
	fs_info->running_transaction = NULL;
696
	fs_info->last_trans_committed = 0;
697 698
	fs_info->tree_root = tree_root;
	fs_info->extent_root = extent_root;
699 700
	fs_info->chunk_root = chunk_root;
	fs_info->dev_root = dev_root;
701
	fs_info->fs_devices = fs_devices;
702
	INIT_LIST_HEAD(&fs_info->dirty_cowonly_roots);
703
	INIT_LIST_HEAD(&fs_info->space_info);
704
	btrfs_mapping_init(&fs_info->mapping_tree);
C
Chris Mason 已提交
705
	fs_info->sb = sb;
706
	fs_info->throttles = 0;
707
	fs_info->mount_opt = 0;
708
	fs_info->max_extent = (u64)-1;
709
	fs_info->max_inline = 8192 * 1024;
710
	fs_info->delalloc_bytes = 0;
711 712
	fs_info->btree_inode = new_inode(sb);
	fs_info->btree_inode->i_ino = 1;
C
Chris Mason 已提交
713
	fs_info->btree_inode->i_nlink = 1;
714 715
	fs_info->btree_inode->i_size = sb->s_bdev->bd_inode->i_size;
	fs_info->btree_inode->i_mapping->a_ops = &btree_aops;
716
	extent_io_tree_init(&BTRFS_I(fs_info->btree_inode)->io_tree,
717 718
			     fs_info->btree_inode->i_mapping,
			     GFP_NOFS);
719 720 721 722
	extent_map_tree_init(&BTRFS_I(fs_info->btree_inode)->extent_tree,
			     GFP_NOFS);

	BTRFS_I(fs_info->btree_inode)->io_tree.ops = &btree_extent_io_ops;
723

724
	extent_io_tree_init(&fs_info->free_space_cache,
725
			     fs_info->btree_inode->i_mapping, GFP_NOFS);
726
	extent_io_tree_init(&fs_info->block_group_cache,
727
			     fs_info->btree_inode->i_mapping, GFP_NOFS);
728
	extent_io_tree_init(&fs_info->pinned_extents,
729
			     fs_info->btree_inode->i_mapping, GFP_NOFS);
730
	extent_io_tree_init(&fs_info->pending_del,
731
			     fs_info->btree_inode->i_mapping, GFP_NOFS);
732
	extent_io_tree_init(&fs_info->extent_ins,
733
			     fs_info->btree_inode->i_mapping, GFP_NOFS);
734
	fs_info->do_barriers = 1;
735
	fs_info->closing = 0;
736
	fs_info->total_pinned = 0;
737
	fs_info->last_alloc = 0;
738
	fs_info->last_data_alloc = 0;
739

740 741 742
#if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,18)
	INIT_WORK(&fs_info->trans_work, btrfs_transaction_cleaner, fs_info);
#else
C
Chris Mason 已提交
743
	INIT_DELAYED_WORK(&fs_info->trans_work, btrfs_transaction_cleaner);
744
#endif
745 746 747
	BTRFS_I(fs_info->btree_inode)->root = tree_root;
	memset(&BTRFS_I(fs_info->btree_inode)->location, 0,
	       sizeof(struct btrfs_key));
C
Chris Mason 已提交
748
	insert_inode_hash(fs_info->btree_inode);
749
	mapping_set_gfp_mask(fs_info->btree_inode->i_mapping, GFP_NOFS);
C
Chris Mason 已提交
750

C
Chris Mason 已提交
751
	mutex_init(&fs_info->trans_mutex);
C
Chris Mason 已提交
752
	mutex_init(&fs_info->fs_mutex);
753

754 755 756 757 758 759 760 761
#if 0
	ret = add_hasher(fs_info, "crc32c");
	if (ret) {
		printk("btrfs: failed hash setup, modprobe cryptomgr?\n");
		err = -ENOMEM;
		goto fail_iput;
	}
#endif
762
	__setup_root(4096, 4096, 4096, 4096, tree_root,
C
Chris Mason 已提交
763
		     fs_info, BTRFS_ROOT_TREE_OBJECTID);
764

C
Chris Mason 已提交
765
	fs_info->sb_buffer = read_tree_block(tree_root,
766
					     BTRFS_SUPER_INFO_OFFSET,
767
					     4096);
768

769
	if (!fs_info->sb_buffer)
C
Chris Mason 已提交
770 771
		goto fail_iput;

772 773 774 775 776 777
	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);
778

779
	disk_super = &fs_info->super_copy;
780
	if (!btrfs_super_root(disk_super))
C
Chris Mason 已提交
781
		goto fail_sb_buffer;
782

783 784 785 786 787 788
	if (btrfs_super_num_devices(disk_super) != fs_devices->num_devices) {
		printk("Btrfs: wanted %llu devices, but found %llu\n",
		       (unsigned long long)btrfs_super_num_devices(disk_super),
		       (unsigned long long)fs_devices->num_devices);
		goto fail_sb_buffer;
	}
789 790 791
	nodesize = btrfs_super_nodesize(disk_super);
	leafsize = btrfs_super_leafsize(disk_super);
	sectorsize = btrfs_super_sectorsize(disk_super);
792
	stripesize = btrfs_super_stripesize(disk_super);
793 794 795
	tree_root->nodesize = nodesize;
	tree_root->leafsize = leafsize;
	tree_root->sectorsize = sectorsize;
796
	tree_root->stripesize = stripesize;
797
	sb_set_blocksize(sb, sectorsize);
798

799
	i_size_write(fs_info->btree_inode,
800
		     btrfs_super_total_bytes(disk_super));
801

C
Chris Mason 已提交
802 803 804 805 806
	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;
	}
807

808
	mutex_lock(&fs_info->fs_mutex);
809

810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826
	ret = btrfs_read_sys_array(tree_root);
	BUG_ON(ret);

	blocksize = btrfs_level_size(tree_root,
				     btrfs_super_chunk_root_level(disk_super));

	__setup_root(nodesize, leafsize, sectorsize, stripesize,
		     chunk_root, fs_info, BTRFS_CHUNK_TREE_OBJECTID);

	chunk_root->node = read_tree_block(chunk_root,
					   btrfs_super_chunk_root(disk_super),
					   blocksize);
	BUG_ON(!chunk_root->node);

	ret = btrfs_read_chunk_tree(chunk_root);
	BUG_ON(ret);

827 828
	blocksize = btrfs_level_size(tree_root,
				     btrfs_super_root_level(disk_super));
829

830

C
Chris Mason 已提交
831
	tree_root->node = read_tree_block(tree_root,
832 833
					  btrfs_super_root(disk_super),
					  blocksize);
C
Chris Mason 已提交
834 835
	if (!tree_root->node)
		goto fail_sb_buffer;
836

837 838

	ret = find_and_setup_root(tree_root, fs_info,
C
Chris Mason 已提交
839
				  BTRFS_EXTENT_TREE_OBJECTID, extent_root);
840
	if (ret)
C
Chris Mason 已提交
841
		goto fail_tree_root;
842 843 844 845 846 847 848 849
	extent_root->track_dirty = 1;

	ret = find_and_setup_root(tree_root, fs_info,
				  BTRFS_DEV_TREE_OBJECTID, dev_root);
	dev_root->track_dirty = 1;

	if (ret)
		goto fail_extent_root;
850

C
Chris Mason 已提交
851 852
	btrfs_read_block_groups(extent_root);

853
	fs_info->generation = btrfs_super_generation(disk_super) + 1;
C
Chris Mason 已提交
854
	mutex_unlock(&fs_info->fs_mutex);
855
	return tree_root;
C
Chris Mason 已提交
856

857 858
fail_extent_root:
	free_extent_buffer(extent_root->node);
C
Chris Mason 已提交
859
fail_tree_root:
860
	mutex_unlock(&fs_info->fs_mutex);
861
	free_extent_buffer(tree_root->node);
C
Chris Mason 已提交
862
fail_sb_buffer:
863
	free_extent_buffer(fs_info->sb_buffer);
C
Chris Mason 已提交
864 865 866
fail_iput:
	iput(fs_info->btree_inode);
fail:
867
	close_all_devices(fs_info);
C
Chris Mason 已提交
868 869 870 871
	kfree(extent_root);
	kfree(tree_root);
	kfree(fs_info);
	return ERR_PTR(err);
872 873
}

874
int write_ctree_super(struct btrfs_trans_handle *trans, struct btrfs_root
C
Chris Mason 已提交
875
		      *root)
876
{
877
	int ret;
878 879
	struct extent_buffer *super = root->fs_info->sb_buffer;
	struct inode *btree_inode = root->fs_info->btree_inode;
880
	struct super_block *sb = root->fs_info->sb;
881

882 883
	if (!btrfs_test_opt(root, NOBARRIER))
		blkdev_issue_flush(sb->s_bdev, NULL);
884
	set_extent_buffer_dirty(&BTRFS_I(btree_inode)->io_tree, super);
885 886
	ret = sync_page_range_nolock(btree_inode, btree_inode->i_mapping,
				     super->start, super->len);
887 888
	if (!btrfs_test_opt(root, NOBARRIER))
		blkdev_issue_flush(sb->s_bdev, NULL);
889
	return ret;
C
Chris Mason 已提交
890 891
}

892
int btrfs_free_fs_root(struct btrfs_fs_info *fs_info, struct btrfs_root *root)
C
Chris Mason 已提交
893 894 895
{
	radix_tree_delete(&fs_info->fs_roots_radix,
			  (unsigned long)root->root_key.objectid);
896 897
	if (root->in_sysfs)
		btrfs_sysfs_del_root(root);
C
Chris Mason 已提交
898 899 900
	if (root->inode)
		iput(root->inode);
	if (root->node)
901
		free_extent_buffer(root->node);
C
Chris Mason 已提交
902
	if (root->commit_root)
903
		free_extent_buffer(root->commit_root);
904 905
	if (root->name)
		kfree(root->name);
C
Chris Mason 已提交
906 907 908 909
	kfree(root);
	return 0;
}

C
Chris Mason 已提交
910
static int del_fs_roots(struct btrfs_fs_info *fs_info)
911 912 913 914 915 916 917 918 919 920 921
{
	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;
C
Chris Mason 已提交
922
		for (i = 0; i < ret; i++)
923
			btrfs_free_fs_root(fs_info, gang[i]);
924 925 926
	}
	return 0;
}
927

C
Chris Mason 已提交
928
int close_ctree(struct btrfs_root *root)
C
Chris Mason 已提交
929
{
930
	int ret;
931
	struct btrfs_trans_handle *trans;
932
	struct btrfs_fs_info *fs_info = root->fs_info;
933

934
	fs_info->closing = 1;
C
Chris Mason 已提交
935
	btrfs_transaction_flush_work(root);
936
	mutex_lock(&fs_info->fs_mutex);
937
	btrfs_defrag_dirty_roots(root->fs_info);
C
Chris Mason 已提交
938
	trans = btrfs_start_transaction(root, 1);
939
	ret = btrfs_commit_transaction(trans, root);
C
Chris Mason 已提交
940 941 942 943
	/* 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);
944
	BUG_ON(ret);
C
Chris Mason 已提交
945
	write_ctree_super(NULL, root);
946 947
	mutex_unlock(&fs_info->fs_mutex);

C
Chris Mason 已提交
948 949 950 951
	if (fs_info->delalloc_bytes) {
		printk("btrfs: at unmount delalloc count %Lu\n",
		       fs_info->delalloc_bytes);
	}
952
	if (fs_info->extent_root->node)
953
		free_extent_buffer(fs_info->extent_root->node);
954

955
	if (fs_info->tree_root->node)
956
		free_extent_buffer(fs_info->tree_root->node);
957

958 959 960 961 962 963
	if (root->fs_info->chunk_root->node);
		free_extent_buffer(root->fs_info->chunk_root->node);

	if (root->fs_info->dev_root->node);
		free_extent_buffer(root->fs_info->dev_root->node);

964
	free_extent_buffer(fs_info->sb_buffer);
965

C
Chris Mason 已提交
966
	btrfs_free_block_groups(root->fs_info);
967
	del_fs_roots(fs_info);
968 969 970

	filemap_write_and_wait(fs_info->btree_inode->i_mapping);

971 972 973 974 975 976
	extent_io_tree_empty_lru(&fs_info->free_space_cache);
	extent_io_tree_empty_lru(&fs_info->block_group_cache);
	extent_io_tree_empty_lru(&fs_info->pinned_extents);
	extent_io_tree_empty_lru(&fs_info->pending_del);
	extent_io_tree_empty_lru(&fs_info->extent_ins);
	extent_io_tree_empty_lru(&BTRFS_I(fs_info->btree_inode)->io_tree);
977

978
	truncate_inode_pages(fs_info->btree_inode->i_mapping, 0);
979

980
	iput(fs_info->btree_inode);
981 982 983 984 985 986 987 988 989 990
#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
991 992 993
	close_all_devices(fs_info);
	btrfs_mapping_tree_free(&fs_info->mapping_tree);

994 995
	kfree(fs_info->extent_root);
	kfree(fs_info->tree_root);
996 997
	kfree(fs_info->chunk_root);
	kfree(fs_info->dev_root);
998 999 1000
	return 0;
}

1001 1002
int btrfs_buffer_uptodate(struct extent_buffer *buf)
{
1003
	struct inode *btree_inode = buf->first_page->mapping->host;
1004
	return extent_buffer_uptodate(&BTRFS_I(btree_inode)->io_tree, buf);
1005 1006 1007
}

int btrfs_set_buffer_uptodate(struct extent_buffer *buf)
C
Chris Mason 已提交
1008
{
1009
	struct inode *btree_inode = buf->first_page->mapping->host;
1010
	return set_extent_buffer_uptodate(&BTRFS_I(btree_inode)->io_tree,
1011 1012
					  buf);
}
1013

1014 1015
void btrfs_mark_buffer_dirty(struct extent_buffer *buf)
{
1016
	struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root;
1017 1018
	u64 transid = btrfs_header_generation(buf);
	struct inode *btree_inode = root->fs_info->btree_inode;
1019

C
Chris Mason 已提交
1020 1021
	if (transid != root->fs_info->generation) {
		printk(KERN_CRIT "transid mismatch buffer %llu, found %Lu running %Lu\n",
1022
			(unsigned long long)buf->start,
C
Chris Mason 已提交
1023 1024 1025
			transid, root->fs_info->generation);
		WARN_ON(1);
	}
1026
	set_extent_buffer_dirty(&BTRFS_I(btree_inode)->io_tree, buf);
1027 1028
}

1029 1030
void btrfs_throttle(struct btrfs_root *root)
{
1031 1032 1033
	struct backing_dev_info *bdi;

	bdi = root->fs_info->sb->s_bdev->bd_inode->i_mapping->backing_dev_info;
1034 1035
	if (root->fs_info->throttles && bdi_write_congested(bdi)) {
#if LINUX_VERSION_CODE > KERNEL_VERSION(2,6,18)
1036
		congestion_wait(WRITE, HZ/20);
1037 1038 1039 1040
#else
		blk_congestion_wait(WRITE, HZ/20);
#endif
	}
1041 1042
}

1043
void btrfs_btree_balance_dirty(struct btrfs_root *root, unsigned long nr)
C
Chris Mason 已提交
1044
{
1045
	balance_dirty_pages_ratelimited_nr(
C
Chris Mason 已提交
1046
				   root->fs_info->btree_inode->i_mapping, 1);
C
Chris Mason 已提交
1047
}
1048 1049 1050

void btrfs_set_buffer_defrag(struct extent_buffer *buf)
{
1051
	struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root;
1052
	struct inode *btree_inode = root->fs_info->btree_inode;
1053
	set_extent_bits(&BTRFS_I(btree_inode)->io_tree, buf->start,
1054 1055 1056 1057 1058
			buf->start + buf->len - 1, EXTENT_DEFRAG, GFP_NOFS);
}

void btrfs_set_buffer_defrag_done(struct extent_buffer *buf)
{
1059
	struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root;
1060
	struct inode *btree_inode = root->fs_info->btree_inode;
1061
	set_extent_bits(&BTRFS_I(btree_inode)->io_tree, buf->start,
1062 1063 1064 1065 1066 1067
			buf->start + buf->len - 1, EXTENT_DEFRAG_DONE,
			GFP_NOFS);
}

int btrfs_buffer_defrag(struct extent_buffer *buf)
{
1068
	struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root;
1069
	struct inode *btree_inode = root->fs_info->btree_inode;
1070
	return test_range_bit(&BTRFS_I(btree_inode)->io_tree,
1071 1072 1073 1074 1075
		     buf->start, buf->start + buf->len - 1, EXTENT_DEFRAG, 0);
}

int btrfs_buffer_defrag_done(struct extent_buffer *buf)
{
1076
	struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root;
1077
	struct inode *btree_inode = root->fs_info->btree_inode;
1078
	return test_range_bit(&BTRFS_I(btree_inode)->io_tree,
1079 1080 1081 1082 1083 1084
		     buf->start, buf->start + buf->len - 1,
		     EXTENT_DEFRAG_DONE, 0);
}

int btrfs_clear_buffer_defrag_done(struct extent_buffer *buf)
{
1085
	struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root;
1086
	struct inode *btree_inode = root->fs_info->btree_inode;
1087
	return clear_extent_bits(&BTRFS_I(btree_inode)->io_tree,
1088 1089 1090 1091 1092 1093
		     buf->start, buf->start + buf->len - 1,
		     EXTENT_DEFRAG_DONE, GFP_NOFS);
}

int btrfs_clear_buffer_defrag(struct extent_buffer *buf)
{
1094
	struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root;
1095
	struct inode *btree_inode = root->fs_info->btree_inode;
1096
	return clear_extent_bits(&BTRFS_I(btree_inode)->io_tree,
1097 1098 1099 1100 1101 1102
		     buf->start, buf->start + buf->len - 1,
		     EXTENT_DEFRAG, GFP_NOFS);
}

int btrfs_read_buffer(struct extent_buffer *buf)
{
1103
	struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root;
1104
	struct inode *btree_inode = root->fs_info->btree_inode;
1105
	return read_extent_buffer_pages(&BTRFS_I(btree_inode)->io_tree,
1106
					buf, 0, 1, btree_get_extent);
1107
}
1108

1109
static struct extent_io_ops btree_extent_io_ops = {
1110
	.writepage_io_hook = btree_writepage_io_hook,
1111
	.submit_bio_hook = btree_submit_bio_hook,
1112 1113
	/* note we're sharing with inode.c for the merge bio hook */
	.merge_bio_hook = btrfs_merge_bio_hook,
1114
};