disk-io.c 40.6 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
#include <linux/workqueue.h>
28 29
#include "ctree.h"
#include "disk-io.h"
30
#include "transaction.h"
31
#include "btrfs_inode.h"
32
#include "volumes.h"
33
#include "print-tree.h"
34

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

48
static struct extent_io_ops btree_extent_io_ops;
49 50 51 52 53 54 55 56
static struct workqueue_struct *end_io_workqueue;

struct end_io_wq {
	struct bio *bio;
	bio_end_io_t *end_io;
	void *private;
	struct btrfs_fs_info *info;
	int error;
57
	int metadata;
58 59
	struct list_head list;
};
60

61
struct extent_map *btree_get_extent(struct inode *inode, struct page *page,
62
				    size_t page_offset, u64 start, u64 len,
63
				    int create)
64
{
65 66 67 68 69
	struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree;
	struct extent_map *em;
	int ret;

again:
70 71 72
	spin_lock(&em_tree->lock);
	em = lookup_extent_mapping(em_tree, start, len);
	spin_unlock(&em_tree->lock);
73 74
	if (em) {
		goto out;
75
	}
76 77 78 79 80 81
	em = alloc_extent_map(GFP_NOFS);
	if (!em) {
		em = ERR_PTR(-ENOMEM);
		goto out;
	}
	em->start = 0;
82
	em->len = i_size_read(inode);
83 84
	em->block_start = 0;
	em->bdev = inode->i_sb->s_bdev;
85 86

	spin_lock(&em_tree->lock);
87
	ret = add_extent_mapping(em_tree, em);
88 89
	spin_unlock(&em_tree->lock);

90 91 92 93 94 95 96 97 98
	if (ret == -EEXIST) {
		free_extent_map(em);
		em = NULL;
		goto again;
	} else if (ret) {
		em = ERR_PTR(ret);
	}
out:
	return em;
99 100
}

101 102 103 104 105 106 107 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
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) {
145 146 147 148 149 150 151 152
		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 */
153
		if (memcmp_extent_buffer(buf, result, 0, BTRFS_CRC32_SIZE)) {
154 155 156 157 158 159
			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 "
160 161
			       "wanted %X found %X from_this_trans %d "
			       "level %d\n",
162
			       root->fs_info->sb->s_id,
163 164
			       buf->start, val, found, from_this_trans,
			       btrfs_header_level(buf));
165 166 167 168 169 170 171 172
			return 1;
		}
	} else {
		write_extent_buffer(buf, result, 0, BTRFS_CRC32_SIZE);
	}
	return 0;
}

173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206
static int btree_read_extent_buffer_pages(struct btrfs_root *root,
					  struct extent_buffer *eb,
					  u64 start)
{
	struct extent_io_tree *io_tree;
	int ret;
	int num_copies = 0;
	int mirror_num = 0;

	io_tree = &BTRFS_I(root->fs_info->btree_inode)->io_tree;
	while (1) {
		ret = read_extent_buffer_pages(io_tree, eb, start, 1,
					       btree_get_extent, mirror_num);
		if (!ret) {
			if (mirror_num)
printk("good read %Lu mirror %d total %d\n", eb->start, mirror_num, num_copies);
			return ret;
		}
		num_copies = btrfs_num_copies(&root->fs_info->mapping_tree,
					      eb->start, eb->len);
printk("failed to read %Lu mirror %d total %d\n", eb->start, mirror_num, num_copies);
		if (num_copies == 1) {
printk("reading %Lu failed only one copy\n", eb->start);
			return ret;
		}
		mirror_num++;
		if (mirror_num > num_copies) {
printk("bailing at mirror %d of %d\n", mirror_num, num_copies);
			return ret;
		}
	}
printk("read extent buffer page last\n");
	return -EIO;
}
207 208 209

int csum_dirty_buffer(struct btrfs_root *root, struct page *page)
{
210
	struct extent_io_tree *tree;
211
	u64 start = (u64)page->index << PAGE_CACHE_SHIFT;
212 213 214 215
	u64 found_start;
	int found_level;
	unsigned long len;
	struct extent_buffer *eb;
216 217
	int ret;

218
	tree = &BTRFS_I(page->mapping->host)->io_tree;
219 220 221 222 223 224 225 226 227 228

	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);
229 230
	ret = btree_read_extent_buffer_pages(root, eb, start + PAGE_CACHE_SIZE);
	BUG_ON(ret);
231
	btrfs_clear_buffer_defrag(eb);
232 233 234 235
	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);
236 237 238 239 240 241 242 243 244 245 246 247 248
		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;
249 250
	}
	found_level = btrfs_header_level(eb);
251 252 253
	spin_lock(&root->fs_info->hash_lock);
	btrfs_set_header_flag(eb, BTRFS_HEADER_FLAG_WRITTEN);
	spin_unlock(&root->fs_info->hash_lock);
254
	csum_tree_block(root, eb, 0);
255
err:
256 257 258 259 260
	free_extent_buffer(eb);
out:
	return 0;
}

261
static int btree_writepage_io_hook(struct page *page, u64 start, u64 end)
262
{
263 264 265
	struct btrfs_root *root = BTRFS_I(page->mapping->host)->root;

	csum_dirty_buffer(root, page);
266 267 268
	return 0;
}

269 270 271 272 273 274 275 276 277
int btree_readpage_end_io_hook(struct page *page, u64 start, u64 end,
			       struct extent_state *state)
{
	struct extent_io_tree *tree;
	u64 found_start;
	int found_level;
	unsigned long len;
	struct extent_buffer *eb;
	struct btrfs_root *root = BTRFS_I(page->mapping->host)->root;
278
	int ret = 0;
279 280 281 282 283 284 285 286 287 288 289

	tree = &BTRFS_I(page->mapping->host)->io_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);
290

291 292 293
	btrfs_clear_buffer_defrag(eb);
	found_start = btrfs_header_bytenr(eb);
	if (found_start != start) {
294 295
printk("bad start on %Lu found %Lu\n", eb->start, found_start);
		ret = -EIO;
296 297 298 299 300 301
		goto err;
	}
	if (eb->first_page != page) {
		printk("bad first page %lu %lu\n", eb->first_page->index,
		       page->index);
		WARN_ON(1);
302
		ret = -EIO;
303 304 305 306 307
		goto err;
	}
	found_level = btrfs_header_level(eb);

	ret = csum_tree_block(root, eb, 1);
308 309
	if (ret)
		ret = -EIO;
310 311 312 313 314 315 316

	end = min_t(u64, eb->len, PAGE_CACHE_SIZE);
	end = eb->start + end - 1;
	release_extent_buffer_tail_pages(eb);
err:
	free_extent_buffer(eb);
out:
317
	return ret;
318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347
}

#if LINUX_VERSION_CODE > KERNEL_VERSION(2,6,23)
static void end_workqueue_bio(struct bio *bio, int err)
#else
static int end_workqueue_bio(struct bio *bio,
				   unsigned int bytes_done, int err)
#endif
{
	struct end_io_wq *end_io_wq = bio->bi_private;
	struct btrfs_fs_info *fs_info;
	unsigned long flags;

#if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,23)
	if (bio->bi_size)
		return 1;
#endif

	fs_info = end_io_wq->info;
	spin_lock_irqsave(&fs_info->end_io_work_lock, flags);
	end_io_wq->error = err;
	list_add_tail(&end_io_wq->list, &fs_info->end_io_work_list);
	spin_unlock_irqrestore(&fs_info->end_io_work_lock, flags);
	queue_work(end_io_workqueue, &fs_info->end_io_work);

#if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,23)
	return 0;
#endif
}

348 349
int btrfs_bio_wq_end_io(struct btrfs_fs_info *info, struct bio *bio,
			int metadata)
350
{
351 352 353 354 355 356 357
	struct end_io_wq *end_io_wq;
	end_io_wq = kmalloc(sizeof(*end_io_wq), GFP_NOFS);
	if (!end_io_wq)
		return -ENOMEM;

	end_io_wq->private = bio->bi_private;
	end_io_wq->end_io = bio->bi_end_io;
358
	end_io_wq->info = info;
359 360
	end_io_wq->error = 0;
	end_io_wq->bio = bio;
361
	end_io_wq->metadata = metadata;
362 363 364

	bio->bi_private = end_io_wq;
	bio->bi_end_io = end_workqueue_bio;
365 366 367
	return 0;
}

368 369
static int btree_submit_bio_hook(struct inode *inode, int rw, struct bio *bio,
				 int mirror_num)
370 371 372 373 374 375 376 377
{
	struct btrfs_root *root = BTRFS_I(inode)->root;
	u64 offset;
	int ret;

	offset = bio->bi_sector << 9;

	if (rw & (1 << BIO_RW)) {
378
		return btrfs_map_bio(BTRFS_I(inode)->root, rw, bio, mirror_num);
379 380 381 382
	}

	ret = btrfs_bio_wq_end_io(root->fs_info, bio, 1);
	BUG_ON(ret);
383

384
	if (offset == BTRFS_SUPER_INFO_OFFSET) {
385
		bio->bi_bdev = root->fs_info->fs_devices->latest_bdev;
386 387 388
		submit_bio(rw, bio);
		return 0;
	}
389
	return btrfs_map_bio(BTRFS_I(inode)->root, rw, bio, mirror_num);
390 391
}

392 393
static int btree_writepage(struct page *page, struct writeback_control *wbc)
{
394 395
	struct extent_io_tree *tree;
	tree = &BTRFS_I(page->mapping->host)->io_tree;
396 397
	return extent_write_full_page(tree, page, btree_get_extent, wbc);
}
398 399 400 401

static int btree_writepages(struct address_space *mapping,
			    struct writeback_control *wbc)
{
402 403
	struct extent_io_tree *tree;
	tree = &BTRFS_I(mapping->host)->io_tree;
404
	if (wbc->sync_mode == WB_SYNC_NONE) {
405 406 407
		u64 num_dirty;
		u64 start = 0;
		unsigned long thresh = 96 * 1024 * 1024;
408 409 410 411

		if (wbc->for_kupdate)
			return 0;

412 413 414 415 416
		if (current_is_pdflush()) {
			thresh = 96 * 1024 * 1024;
		} else {
			thresh = 8 * 1024 * 1024;
		}
417 418
		num_dirty = count_range_bits(tree, &start, (u64)-1,
					     thresh, EXTENT_DIRTY);
419 420 421 422
		if (num_dirty < thresh) {
			return 0;
		}
	}
423 424 425
	return extent_writepages(tree, mapping, btree_get_extent, wbc);
}

426 427
int btree_readpage(struct file *file, struct page *page)
{
428 429
	struct extent_io_tree *tree;
	tree = &BTRFS_I(page->mapping->host)->io_tree;
430 431
	return extent_read_full_page(tree, page, btree_get_extent);
}
C
Chris Mason 已提交
432

433
static int btree_releasepage(struct page *page, gfp_t gfp_flags)
434
{
435 436
	struct extent_io_tree *tree;
	struct extent_map_tree *map;
437
	int ret;
438

439 440 441 442 443 444
	if (page_count(page) > 3) {
		/* once for page->private, once for the caller, once
		 * once for the page cache
		 */
		return 0;
	}
445 446
	tree = &BTRFS_I(page->mapping->host)->io_tree;
	map = &BTRFS_I(page->mapping->host)->extent_tree;
447
	ret = try_release_extent_mapping(map, tree, page, gfp_flags);
448
	if (ret == 1) {
449
		invalidate_extent_lru(tree, page_offset(page), PAGE_CACHE_SIZE);
450 451 452 453
		ClearPagePrivate(page);
		set_page_private(page, 0);
		page_cache_release(page);
	}
454 455 456
	return ret;
}

457
static void btree_invalidatepage(struct page *page, unsigned long offset)
458
{
459 460
	struct extent_io_tree *tree;
	tree = &BTRFS_I(page->mapping->host)->io_tree;
461 462
	extent_invalidatepage(tree, page, offset);
	btree_releasepage(page, GFP_NOFS);
463 464
}

465
#if 0
466
static int btree_writepage(struct page *page, struct writeback_control *wbc)
467
{
C
Chris Mason 已提交
468
	struct buffer_head *bh;
469
	struct btrfs_root *root = BTRFS_I(page->mapping->host)->root;
C
Chris Mason 已提交
470 471 472 473 474 475 476 477 478 479 480 481
	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);
482
	return block_write_full_page(page, btree_get_block, wbc);
483
}
484
#endif
485

486 487 488
static struct address_space_operations btree_aops = {
	.readpage	= btree_readpage,
	.writepage	= btree_writepage,
489
	.writepages	= btree_writepages,
490 491
	.releasepage	= btree_releasepage,
	.invalidatepage = btree_invalidatepage,
492 493 494
	.sync_page	= block_sync_page,
};

495
int readahead_tree_block(struct btrfs_root *root, u64 bytenr, u32 blocksize)
C
Chris Mason 已提交
496
{
497 498
	struct extent_buffer *buf = NULL;
	struct inode *btree_inode = root->fs_info->btree_inode;
499
	int ret = 0;
C
Chris Mason 已提交
500

501
	buf = btrfs_find_create_tree_block(root, bytenr, blocksize);
502
	if (!buf)
C
Chris Mason 已提交
503
		return 0;
504
	read_extent_buffer_pages(&BTRFS_I(btree_inode)->io_tree,
505
				 buf, 0, 0, btree_get_extent, 0);
506
	free_extent_buffer(buf);
507
	return ret;
C
Chris Mason 已提交
508 509
}

510 511 512 513 514 515
static int close_all_devices(struct btrfs_fs_info *fs_info)
{
	struct list_head *list;
	struct list_head *next;
	struct btrfs_device *device;

516 517
	list = &fs_info->fs_devices->devices;
	list_for_each(next, list) {
518
		device = list_entry(next, struct btrfs_device, dev_list);
519 520 521
		if (device->bdev && device->bdev != fs_info->sb->s_bdev)
			close_bdev_excl(device->bdev);
		device->bdev = NULL;
522 523 524 525
	}
	return 0;
}

526 527
int btrfs_verify_block_csum(struct btrfs_root *root,
			    struct extent_buffer *buf)
528
{
529
	return btrfs_buffer_uptodate(buf);
530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567
}

struct extent_buffer *btrfs_find_tree_block(struct btrfs_root *root,
					    u64 bytenr, u32 blocksize)
{
	struct inode *btree_inode = root->fs_info->btree_inode;
	struct extent_buffer *eb;
	eb = find_extent_buffer(&BTRFS_I(btree_inode)->io_tree,
				bytenr, blocksize, GFP_NOFS);
	return eb;
}

struct extent_buffer *btrfs_find_create_tree_block(struct btrfs_root *root,
						 u64 bytenr, u32 blocksize)
{
	struct inode *btree_inode = root->fs_info->btree_inode;
	struct extent_buffer *eb;

	eb = alloc_extent_buffer(&BTRFS_I(btree_inode)->io_tree,
				 bytenr, blocksize, NULL, GFP_NOFS);
	return eb;
}


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_io_tree *io_tree;
	int ret;

	io_tree = &BTRFS_I(btree_inode)->io_tree;

	buf = btrfs_find_create_tree_block(root, bytenr, blocksize);
	if (!buf)
		return NULL;

568
	ret = btree_read_extent_buffer_pages(root, buf, 0);
569 570 571 572

	if (ret == 0) {
		buf->flags |= EXTENT_UPTODATE;
	}
573
	return buf;
574

575 576
}

577
int clean_tree_block(struct btrfs_trans_handle *trans, struct btrfs_root *root,
578
		     struct extent_buffer *buf)
579
{
580
	struct inode *btree_inode = root->fs_info->btree_inode;
581 582
	if (btrfs_header_generation(buf) ==
	    root->fs_info->running_transaction->transid)
583
		clear_extent_buffer_dirty(&BTRFS_I(btree_inode)->io_tree,
584
					  buf);
585 586 587 588 589 590 591
	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;
592
	wait_on_extent_buffer_writeback(&BTRFS_I(btree_inode)->io_tree,
593 594 595 596
					buf);
	return 0;
}

597
static int __setup_root(u32 nodesize, u32 leafsize, u32 sectorsize,
598
			u32 stripesize, struct btrfs_root *root,
599
			struct btrfs_fs_info *fs_info,
C
Chris Mason 已提交
600
			u64 objectid)
601
{
C
Chris Mason 已提交
602
	root->node = NULL;
603
	root->inode = NULL;
604
	root->commit_root = NULL;
605 606 607
	root->sectorsize = sectorsize;
	root->nodesize = nodesize;
	root->leafsize = leafsize;
608
	root->stripesize = stripesize;
C
Chris Mason 已提交
609
	root->ref_cows = 0;
610 611
	root->track_dirty = 0;

612
	root->fs_info = fs_info;
613 614
	root->objectid = objectid;
	root->last_trans = 0;
C
Chris Mason 已提交
615 616
	root->highest_inode = 0;
	root->last_inode_alloc = 0;
617
	root->name = NULL;
618
	root->in_sysfs = 0;
619 620

	INIT_LIST_HEAD(&root->dirty_list);
621 622
	memset(&root->root_key, 0, sizeof(root->root_key));
	memset(&root->root_item, 0, sizeof(root->root_item));
623
	memset(&root->defrag_progress, 0, sizeof(root->defrag_progress));
624 625
	memset(&root->root_kobj, 0, sizeof(root->root_kobj));
	init_completion(&root->kobj_unregister);
626 627
	root->defrag_running = 0;
	root->defrag_level = 0;
628
	root->root_key.objectid = objectid;
629 630 631
	return 0;
}

632
static int find_and_setup_root(struct btrfs_root *tree_root,
633 634
			       struct btrfs_fs_info *fs_info,
			       u64 objectid,
C
Chris Mason 已提交
635
			       struct btrfs_root *root)
636 637
{
	int ret;
638
	u32 blocksize;
639

640
	__setup_root(tree_root->nodesize, tree_root->leafsize,
641 642
		     tree_root->sectorsize, tree_root->stripesize,
		     root, fs_info, objectid);
643 644 645 646
	ret = btrfs_find_last_root(tree_root, objectid,
				   &root->root_item, &root->root_key);
	BUG_ON(ret);

647 648 649
	blocksize = btrfs_level_size(root, btrfs_root_level(&root->root_item));
	root->node = read_tree_block(root, btrfs_root_bytenr(&root->root_item),
				     blocksize);
650
	BUG_ON(!root->node);
651 652 653
	return 0;
}

654 655
struct btrfs_root *btrfs_read_fs_root_no_radix(struct btrfs_fs_info *fs_info,
					       struct btrfs_key *location)
656 657 658 659
{
	struct btrfs_root *root;
	struct btrfs_root *tree_root = fs_info->tree_root;
	struct btrfs_path *path;
660
	struct extent_buffer *l;
C
Chris Mason 已提交
661
	u64 highest_inode;
662
	u32 blocksize;
663 664
	int ret = 0;

665
	root = kzalloc(sizeof(*root), GFP_NOFS);
C
Chris Mason 已提交
666
	if (!root)
667 668
		return ERR_PTR(-ENOMEM);
	if (location->offset == (u64)-1) {
669
		ret = find_and_setup_root(tree_root, fs_info,
670 671 672 673 674 675 676 677
					  location->objectid, root);
		if (ret) {
			kfree(root);
			return ERR_PTR(ret);
		}
		goto insert;
	}

678
	__setup_root(tree_root->nodesize, tree_root->leafsize,
679 680
		     tree_root->sectorsize, tree_root->stripesize,
		     root, fs_info, location->objectid);
681 682 683 684 685 686 687 688 689

	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;
	}
690 691 692
	l = path->nodes[0];
	read_extent_buffer(l, &root->root_item,
	       btrfs_item_ptr_offset(l, path->slots[0]),
693
	       sizeof(root->root_item));
694
	memcpy(&root->root_key, location, sizeof(*location));
695 696 697 698 699 700 701 702
	ret = 0;
out:
	btrfs_release_path(root, path);
	btrfs_free_path(path);
	if (ret) {
		kfree(root);
		return ERR_PTR(ret);
	}
703 704 705
	blocksize = btrfs_level_size(root, btrfs_root_level(&root->root_item));
	root->node = read_tree_block(root, btrfs_root_bytenr(&root->root_item),
				     blocksize);
706 707 708
	BUG_ON(!root->node);
insert:
	root->ref_cows = 1;
709 710 711 712 713 714 715 716
	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 已提交
717 718 719 720 721 722 723 724 725 726 727 728 729 730 731
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;
}

732 733
struct btrfs_root *btrfs_read_fs_root_no_name(struct btrfs_fs_info *fs_info,
					      struct btrfs_key *location)
734 735 736 737
{
	struct btrfs_root *root;
	int ret;

738 739 740 741 742
	if (location->objectid == BTRFS_ROOT_TREE_OBJECTID)
		return fs_info->tree_root;
	if (location->objectid == BTRFS_EXTENT_TREE_OBJECTID)
		return fs_info->extent_root;

743 744 745 746 747 748 749 750
	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 已提交
751 752
	ret = radix_tree_insert(&fs_info->fs_roots_radix,
				(unsigned long)root->root_key.objectid,
753 754
				root);
	if (ret) {
755
		free_extent_buffer(root->node);
756 757 758
		kfree(root);
		return ERR_PTR(ret);
	}
759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775
	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;
776

777 778 779
	if (root->in_sysfs)
		return root;

780 781
	ret = btrfs_set_root_name(root, name, namelen);
	if (ret) {
782
		free_extent_buffer(root->node);
783 784 785 786 787 788
		kfree(root);
		return ERR_PTR(ret);
	}

	ret = btrfs_sysfs_add_root(root);
	if (ret) {
789
		free_extent_buffer(root->node);
790 791 792 793
		kfree(root->name);
		kfree(root);
		return ERR_PTR(ret);
	}
794
	root->in_sysfs = 1;
795 796
	return root;
}
797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814
#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
C
Chris Mason 已提交
815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853

static int btrfs_congested_fn(void *congested_data, int bdi_bits)
{
	struct btrfs_fs_info *info = (struct btrfs_fs_info *)congested_data;
	int ret = 0;
	struct list_head *cur;
	struct btrfs_device *device;
	struct backing_dev_info *bdi;

	list_for_each(cur, &info->fs_devices->devices) {
		device = list_entry(cur, struct btrfs_device, dev_list);
		bdi = blk_get_backing_dev_info(device->bdev);
		if (bdi && bdi_congested(bdi, bdi_bits)) {
			ret = 1;
			break;
		}
	}
	return ret;
}

void btrfs_unplug_io_fn(struct backing_dev_info *bdi, struct page *page)
{
	struct list_head *cur;
	struct btrfs_device *device;
	struct btrfs_fs_info *info;

	info = (struct btrfs_fs_info *)bdi->unplug_io_data;
	list_for_each(cur, &info->fs_devices->devices) {
		device = list_entry(cur, struct btrfs_device, dev_list);
		bdi = blk_get_backing_dev_info(device->bdev);
		if (bdi->unplug_io_fn) {
			bdi->unplug_io_fn(bdi, page);
		}
	}
}

static int setup_bdi(struct btrfs_fs_info *info, struct backing_dev_info *bdi)
{
	bdi_init(bdi);
854
	bdi->ra_pages	= default_backing_dev_info.ra_pages * 4;
C
Chris Mason 已提交
855 856 857 858 859 860 861 862 863
	bdi->state		= 0;
	bdi->capabilities	= default_backing_dev_info.capabilities;
	bdi->unplug_io_fn	= btrfs_unplug_io_fn;
	bdi->unplug_io_data	= info;
	bdi->congested_fn	= btrfs_congested_fn;
	bdi->congested_data	= info;
	return 0;
}

864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936
static int bio_ready_for_csum(struct bio *bio)
{
	u64 length = 0;
	u64 buf_len = 0;
	u64 start = 0;
	struct page *page;
	struct extent_io_tree *io_tree = NULL;
	struct btrfs_fs_info *info = NULL;
	struct bio_vec *bvec;
	int i;
	int ret;

	bio_for_each_segment(bvec, bio, i) {
		page = bvec->bv_page;
		if (page->private == EXTENT_PAGE_PRIVATE) {
			length += bvec->bv_len;
			continue;
		}
		if (!page->private) {
			length += bvec->bv_len;
			continue;
		}
		length = bvec->bv_len;
		buf_len = page->private >> 2;
		start = page_offset(page) + bvec->bv_offset;
		io_tree = &BTRFS_I(page->mapping->host)->io_tree;
		info = BTRFS_I(page->mapping->host)->root->fs_info;
	}
	/* are we fully contained in this bio? */
	if (buf_len <= length)
		return 1;

	ret = extent_range_uptodate(io_tree, start + length,
				    start + buf_len - 1);
	if (ret == 1)
		return ret;
	return ret;
}

#if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,18)
void btrfs_end_io_csum(void *p)
#else
void btrfs_end_io_csum(struct work_struct *work)
#endif
{
#if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,18)
	struct btrfs_fs_info *fs_info = p;
#else
	struct btrfs_fs_info *fs_info = container_of(work,
						     struct btrfs_fs_info,
						     end_io_work);
#endif
	unsigned long flags;
	struct end_io_wq *end_io_wq;
	struct bio *bio;
	struct list_head *next;
	int error;
	int was_empty;

	while(1) {
		spin_lock_irqsave(&fs_info->end_io_work_lock, flags);
		if (list_empty(&fs_info->end_io_work_list)) {
			spin_unlock_irqrestore(&fs_info->end_io_work_lock,
					       flags);
			return;
		}
		next = fs_info->end_io_work_list.next;
		list_del(next);
		spin_unlock_irqrestore(&fs_info->end_io_work_lock, flags);

		end_io_wq = list_entry(next, struct end_io_wq, list);

		bio = end_io_wq->bio;
937
		if (end_io_wq->metadata && !bio_ready_for_csum(bio)) {
938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956
			spin_lock_irqsave(&fs_info->end_io_work_lock, flags);
			was_empty = list_empty(&fs_info->end_io_work_list);
			list_add_tail(&end_io_wq->list,
				      &fs_info->end_io_work_list);
			spin_unlock_irqrestore(&fs_info->end_io_work_lock,
					       flags);
			if (was_empty)
				return;
			continue;
		}
		error = end_io_wq->error;
		bio->bi_private = end_io_wq->private;
		bio->bi_end_io = end_io_wq->end_io;
		kfree(end_io_wq);
		bio_endio(bio, error);
	}
}


957 958
struct btrfs_root *open_ctree(struct super_block *sb,
			      struct btrfs_fs_devices *fs_devices)
959
{
960 961 962 963
	u32 sectorsize;
	u32 nodesize;
	u32 leafsize;
	u32 blocksize;
964
	u32 stripesize;
C
Chris Mason 已提交
965 966 967 968
	struct btrfs_root *extent_root = kmalloc(sizeof(struct btrfs_root),
						 GFP_NOFS);
	struct btrfs_root *tree_root = kmalloc(sizeof(struct btrfs_root),
					       GFP_NOFS);
969
	struct btrfs_fs_info *fs_info = kzalloc(sizeof(*fs_info),
C
Chris Mason 已提交
970
						GFP_NOFS);
971 972 973 974
	struct btrfs_root *chunk_root = kmalloc(sizeof(struct btrfs_root),
						GFP_NOFS);
	struct btrfs_root *dev_root = kmalloc(sizeof(struct btrfs_root),
					      GFP_NOFS);
975
	int ret;
976
	int err = -EINVAL;
C
Chris Mason 已提交
977
	struct btrfs_super_block *disk_super;
978

C
Chris Mason 已提交
979 980 981 982
	if (!extent_root || !tree_root || !fs_info) {
		err = -ENOMEM;
		goto fail;
	}
983 984 985
	end_io_workqueue = create_workqueue("btrfs-end-io");
	BUG_ON(!end_io_workqueue);

986
	INIT_RADIX_TREE(&fs_info->fs_roots_radix, GFP_NOFS);
C
Chris Mason 已提交
987
	INIT_LIST_HEAD(&fs_info->trans_list);
988
	INIT_LIST_HEAD(&fs_info->dead_roots);
989
	INIT_LIST_HEAD(&fs_info->hashers);
990
	INIT_LIST_HEAD(&fs_info->end_io_work_list);
991
	spin_lock_init(&fs_info->hash_lock);
992
	spin_lock_init(&fs_info->end_io_work_lock);
993
	spin_lock_init(&fs_info->delalloc_lock);
994
	spin_lock_init(&fs_info->new_trans_lock);
995

996
	init_completion(&fs_info->kobj_unregister);
997
	sb_set_blocksize(sb, BTRFS_SUPER_INFO_SIZE);
998 999
	fs_info->tree_root = tree_root;
	fs_info->extent_root = extent_root;
1000 1001
	fs_info->chunk_root = chunk_root;
	fs_info->dev_root = dev_root;
1002
	fs_info->fs_devices = fs_devices;
1003
	INIT_LIST_HEAD(&fs_info->dirty_cowonly_roots);
1004
	INIT_LIST_HEAD(&fs_info->space_info);
1005
	btrfs_mapping_init(&fs_info->mapping_tree);
C
Chris Mason 已提交
1006
	fs_info->sb = sb;
1007
	fs_info->max_extent = (u64)-1;
1008
	fs_info->max_inline = 8192 * 1024;
C
Chris Mason 已提交
1009
	setup_bdi(fs_info, &fs_info->bdi);
1010 1011
	fs_info->btree_inode = new_inode(sb);
	fs_info->btree_inode->i_ino = 1;
C
Chris Mason 已提交
1012
	fs_info->btree_inode->i_nlink = 1;
1013 1014
	fs_info->btree_inode->i_size = sb->s_bdev->bd_inode->i_size;
	fs_info->btree_inode->i_mapping->a_ops = &btree_aops;
C
Chris Mason 已提交
1015 1016
	fs_info->btree_inode->i_mapping->backing_dev_info = &fs_info->bdi;

1017
	extent_io_tree_init(&BTRFS_I(fs_info->btree_inode)->io_tree,
1018 1019
			     fs_info->btree_inode->i_mapping,
			     GFP_NOFS);
1020 1021 1022 1023
	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;
1024

1025
	extent_io_tree_init(&fs_info->free_space_cache,
1026
			     fs_info->btree_inode->i_mapping, GFP_NOFS);
1027
	extent_io_tree_init(&fs_info->block_group_cache,
1028
			     fs_info->btree_inode->i_mapping, GFP_NOFS);
1029
	extent_io_tree_init(&fs_info->pinned_extents,
1030
			     fs_info->btree_inode->i_mapping, GFP_NOFS);
1031
	extent_io_tree_init(&fs_info->pending_del,
1032
			     fs_info->btree_inode->i_mapping, GFP_NOFS);
1033
	extent_io_tree_init(&fs_info->extent_ins,
1034
			     fs_info->btree_inode->i_mapping, GFP_NOFS);
1035
	fs_info->do_barriers = 1;
1036

1037
	INIT_WORK(&fs_info->end_io_work, btrfs_end_io_csum);
1038 1039 1040
#if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,18)
	INIT_WORK(&fs_info->trans_work, btrfs_transaction_cleaner, fs_info);
#else
C
Chris Mason 已提交
1041
	INIT_DELAYED_WORK(&fs_info->trans_work, btrfs_transaction_cleaner);
1042
#endif
1043 1044 1045
	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 已提交
1046
	insert_inode_hash(fs_info->btree_inode);
1047
	mapping_set_gfp_mask(fs_info->btree_inode->i_mapping, GFP_NOFS);
C
Chris Mason 已提交
1048

C
Chris Mason 已提交
1049
	mutex_init(&fs_info->trans_mutex);
C
Chris Mason 已提交
1050
	mutex_init(&fs_info->fs_mutex);
1051

1052 1053 1054 1055 1056 1057 1058 1059
#if 0
	ret = add_hasher(fs_info, "crc32c");
	if (ret) {
		printk("btrfs: failed hash setup, modprobe cryptomgr?\n");
		err = -ENOMEM;
		goto fail_iput;
	}
#endif
1060
	__setup_root(4096, 4096, 4096, 4096, tree_root,
C
Chris Mason 已提交
1061
		     fs_info, BTRFS_ROOT_TREE_OBJECTID);
1062

C
Chris Mason 已提交
1063
	fs_info->sb_buffer = read_tree_block(tree_root,
1064
					     BTRFS_SUPER_INFO_OFFSET,
1065
					     4096);
1066

1067
	if (!fs_info->sb_buffer)
C
Chris Mason 已提交
1068 1069
		goto fail_iput;

1070 1071 1072 1073 1074 1075
	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);
1076

1077
	disk_super = &fs_info->super_copy;
1078
	if (!btrfs_super_root(disk_super))
C
Chris Mason 已提交
1079
		goto fail_sb_buffer;
1080

1081 1082 1083 1084 1085 1086
	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;
	}
1087 1088 1089
	nodesize = btrfs_super_nodesize(disk_super);
	leafsize = btrfs_super_leafsize(disk_super);
	sectorsize = btrfs_super_sectorsize(disk_super);
1090
	stripesize = btrfs_super_stripesize(disk_super);
1091 1092 1093
	tree_root->nodesize = nodesize;
	tree_root->leafsize = leafsize;
	tree_root->sectorsize = sectorsize;
1094
	tree_root->stripesize = stripesize;
1095
	sb_set_blocksize(sb, sectorsize);
1096

1097
	i_size_write(fs_info->btree_inode,
1098
		     btrfs_super_total_bytes(disk_super));
1099

C
Chris Mason 已提交
1100 1101 1102 1103 1104
	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;
	}
1105

1106
	mutex_lock(&fs_info->fs_mutex);
1107

1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124
	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);

1125 1126
	blocksize = btrfs_level_size(tree_root,
				     btrfs_super_root_level(disk_super));
1127

1128

C
Chris Mason 已提交
1129
	tree_root->node = read_tree_block(tree_root,
1130 1131
					  btrfs_super_root(disk_super),
					  blocksize);
C
Chris Mason 已提交
1132 1133
	if (!tree_root->node)
		goto fail_sb_buffer;
1134

1135 1136

	ret = find_and_setup_root(tree_root, fs_info,
C
Chris Mason 已提交
1137
				  BTRFS_EXTENT_TREE_OBJECTID, extent_root);
1138
	if (ret)
C
Chris Mason 已提交
1139
		goto fail_tree_root;
1140 1141 1142 1143 1144 1145 1146 1147
	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;
1148

C
Chris Mason 已提交
1149 1150
	btrfs_read_block_groups(extent_root);

1151
	fs_info->generation = btrfs_super_generation(disk_super) + 1;
C
Chris Mason 已提交
1152 1153 1154 1155
	fs_info->data_alloc_profile = (u64)-1;
	fs_info->metadata_alloc_profile = (u64)-1;
	fs_info->system_alloc_profile = fs_info->metadata_alloc_profile;

C
Chris Mason 已提交
1156
	mutex_unlock(&fs_info->fs_mutex);
1157
	return tree_root;
C
Chris Mason 已提交
1158

1159 1160
fail_extent_root:
	free_extent_buffer(extent_root->node);
C
Chris Mason 已提交
1161
fail_tree_root:
1162
	mutex_unlock(&fs_info->fs_mutex);
1163
	free_extent_buffer(tree_root->node);
C
Chris Mason 已提交
1164
fail_sb_buffer:
1165
	free_extent_buffer(fs_info->sb_buffer);
1166
	extent_io_tree_empty_lru(&BTRFS_I(fs_info->btree_inode)->io_tree);
C
Chris Mason 已提交
1167 1168 1169
fail_iput:
	iput(fs_info->btree_inode);
fail:
1170
	close_all_devices(fs_info);
C
Chris Mason 已提交
1171 1172
	kfree(extent_root);
	kfree(tree_root);
1173
	bdi_destroy(&fs_info->bdi);
C
Chris Mason 已提交
1174 1175
	kfree(fs_info);
	return ERR_PTR(err);
1176 1177
}

1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285
static void btrfs_end_buffer_write_sync(struct buffer_head *bh, int uptodate)
{
	char b[BDEVNAME_SIZE];

	if (uptodate) {
		set_buffer_uptodate(bh);
	} else {
		if (!buffer_eopnotsupp(bh) && printk_ratelimit()) {
			printk(KERN_WARNING "lost page write due to "
					"I/O error on %s\n",
				       bdevname(bh->b_bdev, b));
		}
		set_buffer_write_io_error(bh);
		clear_buffer_uptodate(bh);
	}
	unlock_buffer(bh);
	put_bh(bh);
}

int write_all_supers(struct btrfs_root *root)
{
	struct list_head *cur;
	struct list_head *head = &root->fs_info->fs_devices->devices;
	struct btrfs_device *dev;
	struct extent_buffer *sb;
	struct btrfs_dev_item *dev_item;
	struct buffer_head *bh;
	int ret;
	int do_barriers;

	do_barriers = !btrfs_test_opt(root, NOBARRIER);

	sb = root->fs_info->sb_buffer;
	dev_item = (struct btrfs_dev_item *)offsetof(struct btrfs_super_block,
						      dev_item);
	list_for_each(cur, head) {
		dev = list_entry(cur, struct btrfs_device, dev_list);
		btrfs_set_device_type(sb, dev_item, dev->type);
		btrfs_set_device_id(sb, dev_item, dev->devid);
		btrfs_set_device_total_bytes(sb, dev_item, dev->total_bytes);
		btrfs_set_device_bytes_used(sb, dev_item, dev->bytes_used);
		btrfs_set_device_io_align(sb, dev_item, dev->io_align);
		btrfs_set_device_io_width(sb, dev_item, dev->io_width);
		btrfs_set_device_sector_size(sb, dev_item, dev->sector_size);
		write_extent_buffer(sb, dev->uuid,
				    (unsigned long)btrfs_device_uuid(dev_item),
				    BTRFS_DEV_UUID_SIZE);

		btrfs_set_header_flag(sb, BTRFS_HEADER_FLAG_WRITTEN);
		csum_tree_block(root, sb, 0);

		bh = __getblk(dev->bdev, BTRFS_SUPER_INFO_OFFSET /
			      root->fs_info->sb->s_blocksize,
			      BTRFS_SUPER_INFO_SIZE);

		read_extent_buffer(sb, bh->b_data, 0, BTRFS_SUPER_INFO_SIZE);
		dev->pending_io = bh;

		get_bh(bh);
		set_buffer_uptodate(bh);
		lock_buffer(bh);
		bh->b_end_io = btrfs_end_buffer_write_sync;

		if (do_barriers && dev->barriers) {
			ret = submit_bh(WRITE_BARRIER, bh);
			if (ret == -EOPNOTSUPP) {
				printk("btrfs: disabling barriers on dev %s\n",
				       dev->name);
				set_buffer_uptodate(bh);
				dev->barriers = 0;
				get_bh(bh);
				lock_buffer(bh);
				ret = submit_bh(WRITE, bh);
			}
		} else {
			ret = submit_bh(WRITE, bh);
		}
		BUG_ON(ret);
	}

	list_for_each(cur, head) {
		dev = list_entry(cur, struct btrfs_device, dev_list);
		BUG_ON(!dev->pending_io);
		bh = dev->pending_io;
		wait_on_buffer(bh);
		if (!buffer_uptodate(dev->pending_io)) {
			if (do_barriers && dev->barriers) {
				printk("btrfs: disabling barriers on dev %s\n",
				       dev->name);
				set_buffer_uptodate(bh);
				get_bh(bh);
				lock_buffer(bh);
				dev->barriers = 0;
				ret = submit_bh(WRITE, bh);
				BUG_ON(ret);
				wait_on_buffer(bh);
				BUG_ON(!buffer_uptodate(bh));
			} else {
				BUG();
			}

		}
		dev->pending_io = NULL;
		brelse(bh);
	}
	return 0;
}

1286
int write_ctree_super(struct btrfs_trans_handle *trans, struct btrfs_root
C
Chris Mason 已提交
1287
		      *root)
1288
{
1289
	int ret;
1290

1291 1292
	ret = write_all_supers(root);
#if 0
1293 1294
	if (!btrfs_test_opt(root, NOBARRIER))
		blkdev_issue_flush(sb->s_bdev, NULL);
1295
	set_extent_buffer_dirty(&BTRFS_I(btree_inode)->io_tree, super);
1296 1297
	ret = sync_page_range_nolock(btree_inode, btree_inode->i_mapping,
				     super->start, super->len);
1298 1299
	if (!btrfs_test_opt(root, NOBARRIER))
		blkdev_issue_flush(sb->s_bdev, NULL);
1300
#endif
1301
	return ret;
C
Chris Mason 已提交
1302 1303
}

1304
int btrfs_free_fs_root(struct btrfs_fs_info *fs_info, struct btrfs_root *root)
C
Chris Mason 已提交
1305 1306 1307
{
	radix_tree_delete(&fs_info->fs_roots_radix,
			  (unsigned long)root->root_key.objectid);
1308 1309
	if (root->in_sysfs)
		btrfs_sysfs_del_root(root);
C
Chris Mason 已提交
1310 1311 1312
	if (root->inode)
		iput(root->inode);
	if (root->node)
1313
		free_extent_buffer(root->node);
C
Chris Mason 已提交
1314
	if (root->commit_root)
1315
		free_extent_buffer(root->commit_root);
1316 1317
	if (root->name)
		kfree(root->name);
C
Chris Mason 已提交
1318 1319 1320 1321
	kfree(root);
	return 0;
}

C
Chris Mason 已提交
1322
static int del_fs_roots(struct btrfs_fs_info *fs_info)
1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333
{
	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 已提交
1334
		for (i = 0; i < ret; i++)
1335
			btrfs_free_fs_root(fs_info, gang[i]);
1336 1337 1338
	}
	return 0;
}
1339

C
Chris Mason 已提交
1340
int close_ctree(struct btrfs_root *root)
C
Chris Mason 已提交
1341
{
1342
	int ret;
1343
	struct btrfs_trans_handle *trans;
1344
	struct btrfs_fs_info *fs_info = root->fs_info;
1345

1346
	fs_info->closing = 1;
C
Chris Mason 已提交
1347
	btrfs_transaction_flush_work(root);
1348
	mutex_lock(&fs_info->fs_mutex);
1349
	btrfs_defrag_dirty_roots(root->fs_info);
C
Chris Mason 已提交
1350
	trans = btrfs_start_transaction(root, 1);
1351
	ret = btrfs_commit_transaction(trans, root);
C
Chris Mason 已提交
1352 1353 1354 1355
	/* 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);
1356
	BUG_ON(ret);
C
Chris Mason 已提交
1357
	write_ctree_super(NULL, root);
1358 1359
	mutex_unlock(&fs_info->fs_mutex);

C
Chris Mason 已提交
1360 1361 1362 1363
	if (fs_info->delalloc_bytes) {
		printk("btrfs: at unmount delalloc count %Lu\n",
		       fs_info->delalloc_bytes);
	}
1364
	if (fs_info->extent_root->node)
1365
		free_extent_buffer(fs_info->extent_root->node);
1366

1367
	if (fs_info->tree_root->node)
1368
		free_extent_buffer(fs_info->tree_root->node);
1369

1370 1371 1372 1373 1374 1375
	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);

1376
	free_extent_buffer(fs_info->sb_buffer);
1377

C
Chris Mason 已提交
1378
	btrfs_free_block_groups(root->fs_info);
1379
	del_fs_roots(fs_info);
1380 1381 1382

	filemap_write_and_wait(fs_info->btree_inode->i_mapping);

1383 1384 1385 1386 1387 1388
	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);
1389

1390
	truncate_inode_pages(fs_info->btree_inode->i_mapping, 0);
1391 1392
	flush_workqueue(end_io_workqueue);
	destroy_workqueue(end_io_workqueue);
1393

1394
	iput(fs_info->btree_inode);
1395 1396 1397 1398 1399 1400 1401 1402 1403 1404
#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
1405 1406
	close_all_devices(fs_info);
	btrfs_mapping_tree_free(&fs_info->mapping_tree);
C
Chris Mason 已提交
1407
	bdi_destroy(&fs_info->bdi);
1408

1409 1410
	kfree(fs_info->extent_root);
	kfree(fs_info->tree_root);
1411 1412
	kfree(fs_info->chunk_root);
	kfree(fs_info->dev_root);
1413 1414 1415
	return 0;
}

1416 1417
int btrfs_buffer_uptodate(struct extent_buffer *buf)
{
1418
	struct inode *btree_inode = buf->first_page->mapping->host;
1419
	return extent_buffer_uptodate(&BTRFS_I(btree_inode)->io_tree, buf);
1420 1421 1422
}

int btrfs_set_buffer_uptodate(struct extent_buffer *buf)
C
Chris Mason 已提交
1423
{
1424
	struct inode *btree_inode = buf->first_page->mapping->host;
1425
	return set_extent_buffer_uptodate(&BTRFS_I(btree_inode)->io_tree,
1426 1427
					  buf);
}
1428

1429 1430
void btrfs_mark_buffer_dirty(struct extent_buffer *buf)
{
1431
	struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root;
1432 1433
	u64 transid = btrfs_header_generation(buf);
	struct inode *btree_inode = root->fs_info->btree_inode;
1434

C
Chris Mason 已提交
1435 1436
	if (transid != root->fs_info->generation) {
		printk(KERN_CRIT "transid mismatch buffer %llu, found %Lu running %Lu\n",
1437
			(unsigned long long)buf->start,
C
Chris Mason 已提交
1438 1439 1440
			transid, root->fs_info->generation);
		WARN_ON(1);
	}
1441
	set_extent_buffer_dirty(&BTRFS_I(btree_inode)->io_tree, buf);
1442 1443
}

1444 1445
void btrfs_throttle(struct btrfs_root *root)
{
1446 1447 1448
	struct backing_dev_info *bdi;

	bdi = root->fs_info->sb->s_bdev->bd_inode->i_mapping->backing_dev_info;
1449 1450
	if (root->fs_info->throttles && bdi_write_congested(bdi)) {
#if LINUX_VERSION_CODE > KERNEL_VERSION(2,6,18)
1451
		congestion_wait(WRITE, HZ/20);
1452 1453 1454 1455
#else
		blk_congestion_wait(WRITE, HZ/20);
#endif
	}
1456 1457
}

1458
void btrfs_btree_balance_dirty(struct btrfs_root *root, unsigned long nr)
C
Chris Mason 已提交
1459
{
1460
	balance_dirty_pages_ratelimited_nr(
C
Chris Mason 已提交
1461
				   root->fs_info->btree_inode->i_mapping, 1);
C
Chris Mason 已提交
1462
}
1463 1464 1465

void btrfs_set_buffer_defrag(struct extent_buffer *buf)
{
1466
	struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root;
1467
	struct inode *btree_inode = root->fs_info->btree_inode;
1468
	set_extent_bits(&BTRFS_I(btree_inode)->io_tree, buf->start,
1469 1470 1471 1472 1473
			buf->start + buf->len - 1, EXTENT_DEFRAG, GFP_NOFS);
}

void btrfs_set_buffer_defrag_done(struct extent_buffer *buf)
{
1474
	struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root;
1475
	struct inode *btree_inode = root->fs_info->btree_inode;
1476
	set_extent_bits(&BTRFS_I(btree_inode)->io_tree, buf->start,
1477 1478 1479 1480 1481 1482
			buf->start + buf->len - 1, EXTENT_DEFRAG_DONE,
			GFP_NOFS);
}

int btrfs_buffer_defrag(struct extent_buffer *buf)
{
1483
	struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root;
1484
	struct inode *btree_inode = root->fs_info->btree_inode;
1485
	return test_range_bit(&BTRFS_I(btree_inode)->io_tree,
1486 1487 1488 1489 1490
		     buf->start, buf->start + buf->len - 1, EXTENT_DEFRAG, 0);
}

int btrfs_buffer_defrag_done(struct extent_buffer *buf)
{
1491
	struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root;
1492
	struct inode *btree_inode = root->fs_info->btree_inode;
1493
	return test_range_bit(&BTRFS_I(btree_inode)->io_tree,
1494 1495 1496 1497 1498 1499
		     buf->start, buf->start + buf->len - 1,
		     EXTENT_DEFRAG_DONE, 0);
}

int btrfs_clear_buffer_defrag_done(struct extent_buffer *buf)
{
1500
	struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root;
1501
	struct inode *btree_inode = root->fs_info->btree_inode;
1502
	return clear_extent_bits(&BTRFS_I(btree_inode)->io_tree,
1503 1504 1505 1506 1507 1508
		     buf->start, buf->start + buf->len - 1,
		     EXTENT_DEFRAG_DONE, GFP_NOFS);
}

int btrfs_clear_buffer_defrag(struct extent_buffer *buf)
{
1509
	struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root;
1510
	struct inode *btree_inode = root->fs_info->btree_inode;
1511
	return clear_extent_bits(&BTRFS_I(btree_inode)->io_tree,
1512 1513 1514 1515 1516 1517
		     buf->start, buf->start + buf->len - 1,
		     EXTENT_DEFRAG, GFP_NOFS);
}

int btrfs_read_buffer(struct extent_buffer *buf)
{
1518
	struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root;
1519
	int ret;
1520
	ret = btree_read_extent_buffer_pages(root, buf, 0);
1521 1522 1523 1524
	if (ret == 0) {
		buf->flags |= EXTENT_UPTODATE;
	}
	return ret;
1525
}
1526

1527
static struct extent_io_ops btree_extent_io_ops = {
1528
	.writepage_io_hook = btree_writepage_io_hook,
1529
	.readpage_end_io_hook = btree_readpage_end_io_hook,
1530
	.submit_bio_hook = btree_submit_bio_hook,
1531 1532
	/* note we're sharing with inode.c for the merge bio hook */
	.merge_bio_hook = btrfs_merge_bio_hook,
1533
};