scrub.c 67.7 KB
Newer Older
A
Arne Jansen 已提交
1
/*
2
 * Copyright (C) 2011, 2012 STRATO.  All rights reserved.
A
Arne Jansen 已提交
3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19
 *
 * 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/blkdev.h>
20
#include <linux/ratelimit.h>
A
Arne Jansen 已提交
21 22 23 24
#include "ctree.h"
#include "volumes.h"
#include "disk-io.h"
#include "ordered-data.h"
25
#include "transaction.h"
26
#include "backref.h"
27
#include "extent_io.h"
28
#include "check-integrity.h"
29
#include "rcu-string.h"
A
Arne Jansen 已提交
30 31 32 33 34 35 36 37 38 39 40 41 42 43

/*
 * This is only the first step towards a full-features scrub. It reads all
 * extent and super block and verifies the checksums. In case a bad checksum
 * is found or the extent cannot be read, good data will be written back if
 * any can be found.
 *
 * Future enhancements:
 *  - In case an unrepairable extent is encountered, track which files are
 *    affected and report them
 *  - track and record media errors, throw out bad devices
 *  - add a mode to also read unallocated space
 */

44
struct scrub_block;
45
struct scrub_ctx;
A
Arne Jansen 已提交
46 47

#define SCRUB_PAGES_PER_BIO	16	/* 64k per bio */
48
#define SCRUB_BIOS_PER_CTX	16	/* 1 MB per device in flight */
49 50 51 52 53 54

/*
 * the following value times PAGE_SIZE needs to be large enough to match the
 * largest node/leaf/sector size that shall be supported.
 * Values larger than BTRFS_STRIPE_LEN are not supported.
 */
55
#define SCRUB_MAX_PAGES_PER_BLOCK	16	/* 64k per node/leaf/sector */
A
Arne Jansen 已提交
56 57

struct scrub_page {
58 59
	struct scrub_block	*sblock;
	struct page		*page;
60
	struct btrfs_device	*dev;
A
Arne Jansen 已提交
61 62
	u64			flags;  /* extent flags */
	u64			generation;
63 64
	u64			logical;
	u64			physical;
65
	atomic_t		ref_count;
66 67 68 69 70
	struct {
		unsigned int	mirror_num:8;
		unsigned int	have_csum:1;
		unsigned int	io_error:1;
	};
A
Arne Jansen 已提交
71 72 73 74 75
	u8			csum[BTRFS_CSUM_SIZE];
};

struct scrub_bio {
	int			index;
76
	struct scrub_ctx	*sctx;
77
	struct btrfs_device	*dev;
A
Arne Jansen 已提交
78 79 80 81
	struct bio		*bio;
	int			err;
	u64			logical;
	u64			physical;
82 83
	struct scrub_page	*pagev[SCRUB_PAGES_PER_BIO];
	int			page_count;
A
Arne Jansen 已提交
84 85 86 87
	int			next_free;
	struct btrfs_work	work;
};

88
struct scrub_block {
89
	struct scrub_page	*pagev[SCRUB_MAX_PAGES_PER_BLOCK];
90 91 92
	int			page_count;
	atomic_t		outstanding_pages;
	atomic_t		ref_count; /* free mem on transition to zero */
93
	struct scrub_ctx	*sctx;
94 95 96 97
	struct {
		unsigned int	header_error:1;
		unsigned int	checksum_error:1;
		unsigned int	no_io_error_seen:1;
98
		unsigned int	generation_error:1; /* also sets header_error */
99 100 101
	};
};

102 103
struct scrub_ctx {
	struct scrub_bio	*bios[SCRUB_BIOS_PER_CTX];
104
	struct btrfs_root	*dev_root;
A
Arne Jansen 已提交
105 106
	int			first_free;
	int			curr;
107 108
	atomic_t		bios_in_flight;
	atomic_t		workers_pending;
A
Arne Jansen 已提交
109 110 111 112 113
	spinlock_t		list_lock;
	wait_queue_head_t	list_wait;
	u16			csum_size;
	struct list_head	csum_list;
	atomic_t		cancel_req;
A
Arne Jansen 已提交
114
	int			readonly;
115 116 117 118
	int			pages_per_bio; /* <= SCRUB_PAGES_PER_BIO */
	u32			sectorsize;
	u32			nodesize;
	u32			leafsize;
A
Arne Jansen 已提交
119 120 121 122 123 124 125
	/*
	 * statistics
	 */
	struct btrfs_scrub_progress stat;
	spinlock_t		stat_lock;
};

126
struct scrub_fixup_nodatasum {
127
	struct scrub_ctx	*sctx;
128
	struct btrfs_device	*dev;
129 130 131 132 133 134
	u64			logical;
	struct btrfs_root	*root;
	struct btrfs_work	work;
	int			mirror_num;
};

135 136 137 138 139 140 141 142 143 144 145 146 147
struct scrub_warning {
	struct btrfs_path	*path;
	u64			extent_item_size;
	char			*scratch_buf;
	char			*msg_buf;
	const char		*errstr;
	sector_t		sector;
	u64			logical;
	struct btrfs_device	*dev;
	int			msg_bufsize;
	int			scratch_bufsize;
};

148

149 150 151 152
static void scrub_pending_bio_inc(struct scrub_ctx *sctx);
static void scrub_pending_bio_dec(struct scrub_ctx *sctx);
static void scrub_pending_trans_workers_inc(struct scrub_ctx *sctx);
static void scrub_pending_trans_workers_dec(struct scrub_ctx *sctx);
153
static int scrub_handle_errored_block(struct scrub_block *sblock_to_check);
154
static int scrub_setup_recheck_block(struct scrub_ctx *sctx,
155
				     struct btrfs_fs_info *fs_info,
156 157
				     u64 length, u64 logical,
				     struct scrub_block *sblock);
158 159 160 161
static void scrub_recheck_block(struct btrfs_fs_info *fs_info,
				struct scrub_block *sblock, int is_metadata,
				int have_csum, u8 *csum, u64 generation,
				u16 csum_size);
162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178
static void scrub_recheck_block_checksum(struct btrfs_fs_info *fs_info,
					 struct scrub_block *sblock,
					 int is_metadata, int have_csum,
					 const u8 *csum, u64 generation,
					 u16 csum_size);
static void scrub_complete_bio_end_io(struct bio *bio, int err);
static int scrub_repair_block_from_good_copy(struct scrub_block *sblock_bad,
					     struct scrub_block *sblock_good,
					     int force_write);
static int scrub_repair_page_from_good_copy(struct scrub_block *sblock_bad,
					    struct scrub_block *sblock_good,
					    int page_num, int force_write);
static int scrub_checksum_data(struct scrub_block *sblock);
static int scrub_checksum_tree_block(struct scrub_block *sblock);
static int scrub_checksum_super(struct scrub_block *sblock);
static void scrub_block_get(struct scrub_block *sblock);
static void scrub_block_put(struct scrub_block *sblock);
179 180
static void scrub_page_get(struct scrub_page *spage);
static void scrub_page_put(struct scrub_page *spage);
181
static int scrub_add_page_to_bio(struct scrub_ctx *sctx,
182
				 struct scrub_page *spage);
183
static int scrub_pages(struct scrub_ctx *sctx, u64 logical, u64 len,
184 185
		       u64 physical, struct btrfs_device *dev, u64 flags,
		       u64 gen, int mirror_num, u8 *csum, int force);
S
Stefan Behrens 已提交
186
static void scrub_bio_end_io(struct bio *bio, int err);
187 188
static void scrub_bio_end_io_worker(struct btrfs_work *work);
static void scrub_block_complete(struct scrub_block *sblock);
S
Stefan Behrens 已提交
189 190


191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243
static void scrub_pending_bio_inc(struct scrub_ctx *sctx)
{
	atomic_inc(&sctx->bios_in_flight);
}

static void scrub_pending_bio_dec(struct scrub_ctx *sctx)
{
	atomic_dec(&sctx->bios_in_flight);
	wake_up(&sctx->list_wait);
}

/*
 * used for workers that require transaction commits (i.e., for the
 * NOCOW case)
 */
static void scrub_pending_trans_workers_inc(struct scrub_ctx *sctx)
{
	struct btrfs_fs_info *fs_info = sctx->dev_root->fs_info;

	/*
	 * increment scrubs_running to prevent cancel requests from
	 * completing as long as a worker is running. we must also
	 * increment scrubs_paused to prevent deadlocking on pause
	 * requests used for transactions commits (as the worker uses a
	 * transaction context). it is safe to regard the worker
	 * as paused for all matters practical. effectively, we only
	 * avoid cancellation requests from completing.
	 */
	mutex_lock(&fs_info->scrub_lock);
	atomic_inc(&fs_info->scrubs_running);
	atomic_inc(&fs_info->scrubs_paused);
	mutex_unlock(&fs_info->scrub_lock);
	atomic_inc(&sctx->workers_pending);
}

/* used for workers that require transaction commits */
static void scrub_pending_trans_workers_dec(struct scrub_ctx *sctx)
{
	struct btrfs_fs_info *fs_info = sctx->dev_root->fs_info;

	/*
	 * see scrub_pending_trans_workers_inc() why we're pretending
	 * to be paused in the scrub counters
	 */
	mutex_lock(&fs_info->scrub_lock);
	atomic_dec(&fs_info->scrubs_running);
	atomic_dec(&fs_info->scrubs_paused);
	mutex_unlock(&fs_info->scrub_lock);
	atomic_dec(&sctx->workers_pending);
	wake_up(&fs_info->scrub_pause_wait);
	wake_up(&sctx->list_wait);
}

244
static void scrub_free_csums(struct scrub_ctx *sctx)
A
Arne Jansen 已提交
245
{
246
	while (!list_empty(&sctx->csum_list)) {
A
Arne Jansen 已提交
247
		struct btrfs_ordered_sum *sum;
248
		sum = list_first_entry(&sctx->csum_list,
A
Arne Jansen 已提交
249 250 251 252 253 254
				       struct btrfs_ordered_sum, list);
		list_del(&sum->list);
		kfree(sum);
	}
}

255
static noinline_for_stack void scrub_free_ctx(struct scrub_ctx *sctx)
A
Arne Jansen 已提交
256 257 258
{
	int i;

259
	if (!sctx)
A
Arne Jansen 已提交
260 261
		return;

262
	/* this can happen when scrub is cancelled */
263 264
	if (sctx->curr != -1) {
		struct scrub_bio *sbio = sctx->bios[sctx->curr];
265 266 267 268 269 270 271 272 273

		for (i = 0; i < sbio->page_count; i++) {
			BUG_ON(!sbio->pagev[i]);
			BUG_ON(!sbio->pagev[i]->page);
			scrub_block_put(sbio->pagev[i]->sblock);
		}
		bio_put(sbio->bio);
	}

274 275
	for (i = 0; i < SCRUB_BIOS_PER_CTX; ++i) {
		struct scrub_bio *sbio = sctx->bios[i];
A
Arne Jansen 已提交
276 277 278 279 280 281

		if (!sbio)
			break;
		kfree(sbio);
	}

282 283
	scrub_free_csums(sctx);
	kfree(sctx);
A
Arne Jansen 已提交
284 285 286
}

static noinline_for_stack
287
struct scrub_ctx *scrub_setup_ctx(struct btrfs_device *dev)
A
Arne Jansen 已提交
288
{
289
	struct scrub_ctx *sctx;
A
Arne Jansen 已提交
290 291
	int		i;
	struct btrfs_fs_info *fs_info = dev->dev_root->fs_info;
292
	int pages_per_bio;
A
Arne Jansen 已提交
293

294 295
	pages_per_bio = min_t(int, SCRUB_PAGES_PER_BIO,
			      bio_get_nr_vecs(dev->bdev));
296 297
	sctx = kzalloc(sizeof(*sctx), GFP_NOFS);
	if (!sctx)
A
Arne Jansen 已提交
298
		goto nomem;
299 300
	sctx->pages_per_bio = pages_per_bio;
	sctx->curr = -1;
301
	sctx->dev_root = dev->dev_root;
302
	for (i = 0; i < SCRUB_BIOS_PER_CTX; ++i) {
A
Arne Jansen 已提交
303 304 305 306 307
		struct scrub_bio *sbio;

		sbio = kzalloc(sizeof(*sbio), GFP_NOFS);
		if (!sbio)
			goto nomem;
308
		sctx->bios[i] = sbio;
A
Arne Jansen 已提交
309 310

		sbio->index = i;
311
		sbio->sctx = sctx;
312 313
		sbio->page_count = 0;
		sbio->work.func = scrub_bio_end_io_worker;
A
Arne Jansen 已提交
314

315 316
		if (i != SCRUB_BIOS_PER_CTX - 1)
			sctx->bios[i]->next_free = i + 1;
317
		else
318 319 320 321 322 323
			sctx->bios[i]->next_free = -1;
	}
	sctx->first_free = 0;
	sctx->nodesize = dev->dev_root->nodesize;
	sctx->leafsize = dev->dev_root->leafsize;
	sctx->sectorsize = dev->dev_root->sectorsize;
324 325
	atomic_set(&sctx->bios_in_flight, 0);
	atomic_set(&sctx->workers_pending, 0);
326 327 328 329 330 331 332 333
	atomic_set(&sctx->cancel_req, 0);
	sctx->csum_size = btrfs_super_csum_size(fs_info->super_copy);
	INIT_LIST_HEAD(&sctx->csum_list);

	spin_lock_init(&sctx->list_lock);
	spin_lock_init(&sctx->stat_lock);
	init_waitqueue_head(&sctx->list_wait);
	return sctx;
A
Arne Jansen 已提交
334 335

nomem:
336
	scrub_free_ctx(sctx);
A
Arne Jansen 已提交
337 338 339
	return ERR_PTR(-ENOMEM);
}

340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376
static int scrub_print_warning_inode(u64 inum, u64 offset, u64 root, void *ctx)
{
	u64 isize;
	u32 nlink;
	int ret;
	int i;
	struct extent_buffer *eb;
	struct btrfs_inode_item *inode_item;
	struct scrub_warning *swarn = ctx;
	struct btrfs_fs_info *fs_info = swarn->dev->dev_root->fs_info;
	struct inode_fs_paths *ipath = NULL;
	struct btrfs_root *local_root;
	struct btrfs_key root_key;

	root_key.objectid = root;
	root_key.type = BTRFS_ROOT_ITEM_KEY;
	root_key.offset = (u64)-1;
	local_root = btrfs_read_fs_root_no_name(fs_info, &root_key);
	if (IS_ERR(local_root)) {
		ret = PTR_ERR(local_root);
		goto err;
	}

	ret = inode_item_info(inum, 0, local_root, swarn->path);
	if (ret) {
		btrfs_release_path(swarn->path);
		goto err;
	}

	eb = swarn->path->nodes[0];
	inode_item = btrfs_item_ptr(eb, swarn->path->slots[0],
					struct btrfs_inode_item);
	isize = btrfs_inode_size(eb, inode_item);
	nlink = btrfs_inode_nlink(eb, inode_item);
	btrfs_release_path(swarn->path);

	ipath = init_ipath(4096, local_root, swarn->path);
377 378 379 380 381
	if (IS_ERR(ipath)) {
		ret = PTR_ERR(ipath);
		ipath = NULL;
		goto err;
	}
382 383 384 385 386 387 388 389 390 391
	ret = paths_from_inode(inum, ipath);

	if (ret < 0)
		goto err;

	/*
	 * we deliberately ignore the bit ipath might have been too small to
	 * hold all of the paths here
	 */
	for (i = 0; i < ipath->fspath->elem_cnt; ++i)
392
		printk_in_rcu(KERN_WARNING "btrfs: %s at logical %llu on dev "
393 394
			"%s, sector %llu, root %llu, inode %llu, offset %llu, "
			"length %llu, links %u (path: %s)\n", swarn->errstr,
395
			swarn->logical, rcu_str_deref(swarn->dev->name),
396 397
			(unsigned long long)swarn->sector, root, inum, offset,
			min(isize - offset, (u64)PAGE_SIZE), nlink,
398
			(char *)(unsigned long)ipath->fspath->val[i]);
399 400 401 402 403

	free_ipath(ipath);
	return 0;

err:
404
	printk_in_rcu(KERN_WARNING "btrfs: %s at logical %llu on dev "
405 406
		"%s, sector %llu, root %llu, inode %llu, offset %llu: path "
		"resolving failed with ret=%d\n", swarn->errstr,
407
		swarn->logical, rcu_str_deref(swarn->dev->name),
408 409 410 411 412 413
		(unsigned long long)swarn->sector, root, inum, offset, ret);

	free_ipath(ipath);
	return 0;
}

414
static void scrub_print_warning(const char *errstr, struct scrub_block *sblock)
415
{
416 417
	struct btrfs_device *dev;
	struct btrfs_fs_info *fs_info;
418 419 420 421 422
	struct btrfs_path *path;
	struct btrfs_key found_key;
	struct extent_buffer *eb;
	struct btrfs_extent_item *ei;
	struct scrub_warning swarn;
423 424 425
	unsigned long ptr = 0;
	u64 extent_item_pos;
	u64 flags = 0;
426
	u64 ref_root;
427
	u32 item_size;
428 429
	u8 ref_level;
	const int bufsize = 4096;
430
	int ret;
431

432
	WARN_ON(sblock->page_count < 1);
433
	dev = sblock->pagev[0]->dev;
434 435
	fs_info = sblock->sctx->dev_root->fs_info;

436 437 438 439
	path = btrfs_alloc_path();

	swarn.scratch_buf = kmalloc(bufsize, GFP_NOFS);
	swarn.msg_buf = kmalloc(bufsize, GFP_NOFS);
440 441
	swarn.sector = (sblock->pagev[0]->physical) >> 9;
	swarn.logical = sblock->pagev[0]->logical;
442
	swarn.errstr = errstr;
443
	swarn.dev = NULL;
444 445 446 447 448 449
	swarn.msg_bufsize = bufsize;
	swarn.scratch_bufsize = bufsize;

	if (!path || !swarn.scratch_buf || !swarn.msg_buf)
		goto out;

450 451
	ret = extent_from_logical(fs_info, swarn.logical, path, &found_key,
				  &flags);
452 453 454
	if (ret < 0)
		goto out;

J
Jan Schmidt 已提交
455
	extent_item_pos = swarn.logical - found_key.objectid;
456 457 458 459 460
	swarn.extent_item_size = found_key.offset;

	eb = path->nodes[0];
	ei = btrfs_item_ptr(eb, path->slots[0], struct btrfs_extent_item);
	item_size = btrfs_item_size_nr(eb, path->slots[0]);
J
Jan Schmidt 已提交
461
	btrfs_release_path(path);
462

463
	if (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK) {
464 465 466
		do {
			ret = tree_backref_for_extent(&ptr, eb, ei, item_size,
							&ref_root, &ref_level);
467
			printk_in_rcu(KERN_WARNING
S
Stefan Behrens 已提交
468
				"btrfs: %s at logical %llu on dev %s, "
469
				"sector %llu: metadata %s (level %d) in tree "
470 471
				"%llu\n", errstr, swarn.logical,
				rcu_str_deref(dev->name),
472 473 474 475 476 477 478
				(unsigned long long)swarn.sector,
				ref_level ? "node" : "leaf",
				ret < 0 ? -1 : ref_level,
				ret < 0 ? -1 : ref_root);
		} while (ret != 1);
	} else {
		swarn.path = path;
479
		swarn.dev = dev;
480 481
		iterate_extent_inodes(fs_info, found_key.objectid,
					extent_item_pos, 1,
482 483 484 485 486 487 488 489 490
					scrub_print_warning_inode, &swarn);
	}

out:
	btrfs_free_path(path);
	kfree(swarn.scratch_buf);
	kfree(swarn.msg_buf);
}

491 492
static int scrub_fixup_readpage(u64 inum, u64 offset, u64 root, void *ctx)
{
493
	struct page *page = NULL;
494 495 496
	unsigned long index;
	struct scrub_fixup_nodatasum *fixup = ctx;
	int ret;
497
	int corrected = 0;
498
	struct btrfs_key key;
499
	struct inode *inode = NULL;
500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519
	u64 end = offset + PAGE_SIZE - 1;
	struct btrfs_root *local_root;

	key.objectid = root;
	key.type = BTRFS_ROOT_ITEM_KEY;
	key.offset = (u64)-1;
	local_root = btrfs_read_fs_root_no_name(fixup->root->fs_info, &key);
	if (IS_ERR(local_root))
		return PTR_ERR(local_root);

	key.type = BTRFS_INODE_ITEM_KEY;
	key.objectid = inum;
	key.offset = 0;
	inode = btrfs_iget(fixup->root->fs_info->sb, &key, local_root, NULL);
	if (IS_ERR(inode))
		return PTR_ERR(inode);

	index = offset >> PAGE_CACHE_SHIFT;

	page = find_or_create_page(inode->i_mapping, index, GFP_NOFS);
520 521 522 523 524 525
	if (!page) {
		ret = -ENOMEM;
		goto out;
	}

	if (PageUptodate(page)) {
526
		struct btrfs_fs_info *fs_info;
527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546
		if (PageDirty(page)) {
			/*
			 * we need to write the data to the defect sector. the
			 * data that was in that sector is not in memory,
			 * because the page was modified. we must not write the
			 * modified page to that sector.
			 *
			 * TODO: what could be done here: wait for the delalloc
			 *       runner to write out that page (might involve
			 *       COW) and see whether the sector is still
			 *       referenced afterwards.
			 *
			 * For the meantime, we'll treat this error
			 * incorrectable, although there is a chance that a
			 * later scrub will find the bad sector again and that
			 * there's no dirty page in memory, then.
			 */
			ret = -EIO;
			goto out;
		}
547 548
		fs_info = BTRFS_I(inode)->root->fs_info;
		ret = repair_io_failure(fs_info, offset, PAGE_SIZE,
549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585
					fixup->logical, page,
					fixup->mirror_num);
		unlock_page(page);
		corrected = !ret;
	} else {
		/*
		 * we need to get good data first. the general readpage path
		 * will call repair_io_failure for us, we just have to make
		 * sure we read the bad mirror.
		 */
		ret = set_extent_bits(&BTRFS_I(inode)->io_tree, offset, end,
					EXTENT_DAMAGED, GFP_NOFS);
		if (ret) {
			/* set_extent_bits should give proper error */
			WARN_ON(ret > 0);
			if (ret > 0)
				ret = -EFAULT;
			goto out;
		}

		ret = extent_read_full_page(&BTRFS_I(inode)->io_tree, page,
						btrfs_get_extent,
						fixup->mirror_num);
		wait_on_page_locked(page);

		corrected = !test_range_bit(&BTRFS_I(inode)->io_tree, offset,
						end, EXTENT_DAMAGED, 0, NULL);
		if (!corrected)
			clear_extent_bits(&BTRFS_I(inode)->io_tree, offset, end,
						EXTENT_DAMAGED, GFP_NOFS);
	}

out:
	if (page)
		put_page(page);
	if (inode)
		iput(inode);
586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604

	if (ret < 0)
		return ret;

	if (ret == 0 && corrected) {
		/*
		 * we only need to call readpage for one of the inodes belonging
		 * to this extent. so make iterate_extent_inodes stop
		 */
		return 1;
	}

	return -EIO;
}

static void scrub_fixup_nodatasum(struct btrfs_work *work)
{
	int ret;
	struct scrub_fixup_nodatasum *fixup;
605
	struct scrub_ctx *sctx;
606 607 608 609 610 611
	struct btrfs_trans_handle *trans = NULL;
	struct btrfs_fs_info *fs_info;
	struct btrfs_path *path;
	int uncorrectable = 0;

	fixup = container_of(work, struct scrub_fixup_nodatasum, work);
612
	sctx = fixup->sctx;
613 614 615 616
	fs_info = fixup->root->fs_info;

	path = btrfs_alloc_path();
	if (!path) {
617 618 619
		spin_lock(&sctx->stat_lock);
		++sctx->stat.malloc_errors;
		spin_unlock(&sctx->stat_lock);
620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647
		uncorrectable = 1;
		goto out;
	}

	trans = btrfs_join_transaction(fixup->root);
	if (IS_ERR(trans)) {
		uncorrectable = 1;
		goto out;
	}

	/*
	 * the idea is to trigger a regular read through the standard path. we
	 * read a page from the (failed) logical address by specifying the
	 * corresponding copynum of the failed sector. thus, that readpage is
	 * expected to fail.
	 * that is the point where on-the-fly error correction will kick in
	 * (once it's finished) and rewrite the failed sector if a good copy
	 * can be found.
	 */
	ret = iterate_inodes_from_logical(fixup->logical, fixup->root->fs_info,
						path, scrub_fixup_readpage,
						fixup);
	if (ret < 0) {
		uncorrectable = 1;
		goto out;
	}
	WARN_ON(ret != 1);

648 649 650
	spin_lock(&sctx->stat_lock);
	++sctx->stat.corrected_errors;
	spin_unlock(&sctx->stat_lock);
651 652 653 654 655

out:
	if (trans && !IS_ERR(trans))
		btrfs_end_transaction(trans, fixup->root);
	if (uncorrectable) {
656 657 658
		spin_lock(&sctx->stat_lock);
		++sctx->stat.uncorrectable_errors;
		spin_unlock(&sctx->stat_lock);
659 660

		printk_ratelimited_in_rcu(KERN_ERR
661
			"btrfs: unable to fixup (nodatasum) error at logical %llu on dev %s\n",
662
			(unsigned long long)fixup->logical,
663
			rcu_str_deref(fixup->dev->name));
664 665 666 667 668
	}

	btrfs_free_path(path);
	kfree(fixup);

669
	scrub_pending_trans_workers_dec(sctx);
670 671
}

A
Arne Jansen 已提交
672
/*
673 674 675 676 677 678
 * scrub_handle_errored_block gets called when either verification of the
 * pages failed or the bio failed to read, e.g. with EIO. In the latter
 * case, this function handles all pages in the bio, even though only one
 * may be bad.
 * The goal of this function is to repair the errored block by using the
 * contents of one of the mirrors.
A
Arne Jansen 已提交
679
 */
680
static int scrub_handle_errored_block(struct scrub_block *sblock_to_check)
A
Arne Jansen 已提交
681
{
682
	struct scrub_ctx *sctx = sblock_to_check->sctx;
683
	struct btrfs_device *dev;
684 685 686 687 688 689 690 691 692 693 694 695 696 697
	struct btrfs_fs_info *fs_info;
	u64 length;
	u64 logical;
	u64 generation;
	unsigned int failed_mirror_index;
	unsigned int is_metadata;
	unsigned int have_csum;
	u8 *csum;
	struct scrub_block *sblocks_for_recheck; /* holds one for each mirror */
	struct scrub_block *sblock_bad;
	int ret;
	int mirror_index;
	int page_num;
	int success;
698
	static DEFINE_RATELIMIT_STATE(_rs, DEFAULT_RATELIMIT_INTERVAL,
699 700 701
				      DEFAULT_RATELIMIT_BURST);

	BUG_ON(sblock_to_check->page_count < 1);
702
	fs_info = sctx->dev_root->fs_info;
703
	length = sblock_to_check->page_count * PAGE_SIZE;
704 705 706 707 708
	logical = sblock_to_check->pagev[0]->logical;
	generation = sblock_to_check->pagev[0]->generation;
	BUG_ON(sblock_to_check->pagev[0]->mirror_num < 1);
	failed_mirror_index = sblock_to_check->pagev[0]->mirror_num - 1;
	is_metadata = !(sblock_to_check->pagev[0]->flags &
709
			BTRFS_EXTENT_FLAG_DATA);
710 711 712
	have_csum = sblock_to_check->pagev[0]->have_csum;
	csum = sblock_to_check->pagev[0]->csum;
	dev = sblock_to_check->pagev[0]->dev;
713

714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746
	/*
	 * read all mirrors one after the other. This includes to
	 * re-read the extent or metadata block that failed (that was
	 * the cause that this fixup code is called) another time,
	 * page by page this time in order to know which pages
	 * caused I/O errors and which ones are good (for all mirrors).
	 * It is the goal to handle the situation when more than one
	 * mirror contains I/O errors, but the errors do not
	 * overlap, i.e. the data can be repaired by selecting the
	 * pages from those mirrors without I/O error on the
	 * particular pages. One example (with blocks >= 2 * PAGE_SIZE)
	 * would be that mirror #1 has an I/O error on the first page,
	 * the second page is good, and mirror #2 has an I/O error on
	 * the second page, but the first page is good.
	 * Then the first page of the first mirror can be repaired by
	 * taking the first page of the second mirror, and the
	 * second page of the second mirror can be repaired by
	 * copying the contents of the 2nd page of the 1st mirror.
	 * One more note: if the pages of one mirror contain I/O
	 * errors, the checksum cannot be verified. In order to get
	 * the best data for repairing, the first attempt is to find
	 * a mirror without I/O errors and with a validated checksum.
	 * Only if this is not possible, the pages are picked from
	 * mirrors with I/O errors without considering the checksum.
	 * If the latter is the case, at the end, the checksum of the
	 * repaired area is verified in order to correctly maintain
	 * the statistics.
	 */

	sblocks_for_recheck = kzalloc(BTRFS_MAX_MIRRORS *
				     sizeof(*sblocks_for_recheck),
				     GFP_NOFS);
	if (!sblocks_for_recheck) {
747 748 749 750 751
		spin_lock(&sctx->stat_lock);
		sctx->stat.malloc_errors++;
		sctx->stat.read_errors++;
		sctx->stat.uncorrectable_errors++;
		spin_unlock(&sctx->stat_lock);
752
		btrfs_dev_stat_inc_and_print(dev, BTRFS_DEV_STAT_READ_ERRS);
753
		goto out;
A
Arne Jansen 已提交
754 755
	}

756
	/* setup the context, map the logical blocks and alloc the pages */
757
	ret = scrub_setup_recheck_block(sctx, fs_info, length,
758 759
					logical, sblocks_for_recheck);
	if (ret) {
760 761 762 763
		spin_lock(&sctx->stat_lock);
		sctx->stat.read_errors++;
		sctx->stat.uncorrectable_errors++;
		spin_unlock(&sctx->stat_lock);
764
		btrfs_dev_stat_inc_and_print(dev, BTRFS_DEV_STAT_READ_ERRS);
765 766 767 768
		goto out;
	}
	BUG_ON(failed_mirror_index >= BTRFS_MAX_MIRRORS);
	sblock_bad = sblocks_for_recheck + failed_mirror_index;
769

770
	/* build and submit the bios for the failed mirror, check checksums */
771 772
	scrub_recheck_block(fs_info, sblock_bad, is_metadata, have_csum,
			    csum, generation, sctx->csum_size);
A
Arne Jansen 已提交
773

774 775 776 777 778 779 780 781 782 783
	if (!sblock_bad->header_error && !sblock_bad->checksum_error &&
	    sblock_bad->no_io_error_seen) {
		/*
		 * the error disappeared after reading page by page, or
		 * the area was part of a huge bio and other parts of the
		 * bio caused I/O errors, or the block layer merged several
		 * read requests into one and the error is caused by a
		 * different bio (usually one of the two latter cases is
		 * the cause)
		 */
784 785 786
		spin_lock(&sctx->stat_lock);
		sctx->stat.unverified_errors++;
		spin_unlock(&sctx->stat_lock);
A
Arne Jansen 已提交
787

788
		goto out;
A
Arne Jansen 已提交
789 790
	}

791
	if (!sblock_bad->no_io_error_seen) {
792 793 794
		spin_lock(&sctx->stat_lock);
		sctx->stat.read_errors++;
		spin_unlock(&sctx->stat_lock);
795 796
		if (__ratelimit(&_rs))
			scrub_print_warning("i/o error", sblock_to_check);
797
		btrfs_dev_stat_inc_and_print(dev, BTRFS_DEV_STAT_READ_ERRS);
798
	} else if (sblock_bad->checksum_error) {
799 800 801
		spin_lock(&sctx->stat_lock);
		sctx->stat.csum_errors++;
		spin_unlock(&sctx->stat_lock);
802 803
		if (__ratelimit(&_rs))
			scrub_print_warning("checksum error", sblock_to_check);
804
		btrfs_dev_stat_inc_and_print(dev,
805
					     BTRFS_DEV_STAT_CORRUPTION_ERRS);
806
	} else if (sblock_bad->header_error) {
807 808 809
		spin_lock(&sctx->stat_lock);
		sctx->stat.verify_errors++;
		spin_unlock(&sctx->stat_lock);
810 811 812
		if (__ratelimit(&_rs))
			scrub_print_warning("checksum/header error",
					    sblock_to_check);
813
		if (sblock_bad->generation_error)
814
			btrfs_dev_stat_inc_and_print(dev,
815 816
				BTRFS_DEV_STAT_GENERATION_ERRS);
		else
817
			btrfs_dev_stat_inc_and_print(dev,
818
				BTRFS_DEV_STAT_CORRUPTION_ERRS);
819
	}
A
Arne Jansen 已提交
820

821
	if (sctx->readonly)
822
		goto did_not_correct_error;
A
Arne Jansen 已提交
823

824 825
	if (!is_metadata && !have_csum) {
		struct scrub_fixup_nodatasum *fixup_nodatasum;
A
Arne Jansen 已提交
826

827 828 829 830 831 832 833 834 835 836
		/*
		 * !is_metadata and !have_csum, this means that the data
		 * might not be COW'ed, that it might be modified
		 * concurrently. The general strategy to work on the
		 * commit root does not help in the case when COW is not
		 * used.
		 */
		fixup_nodatasum = kzalloc(sizeof(*fixup_nodatasum), GFP_NOFS);
		if (!fixup_nodatasum)
			goto did_not_correct_error;
837
		fixup_nodatasum->sctx = sctx;
838
		fixup_nodatasum->dev = dev;
839 840 841
		fixup_nodatasum->logical = logical;
		fixup_nodatasum->root = fs_info->extent_root;
		fixup_nodatasum->mirror_num = failed_mirror_index + 1;
842
		scrub_pending_trans_workers_inc(sctx);
843 844 845 846
		fixup_nodatasum->work.func = scrub_fixup_nodatasum;
		btrfs_queue_worker(&fs_info->scrub_workers,
				   &fixup_nodatasum->work);
		goto out;
A
Arne Jansen 已提交
847 848
	}

849 850
	/*
	 * now build and submit the bios for the other mirrors, check
851 852
	 * checksums.
	 * First try to pick the mirror which is completely without I/O
853 854 855 856 857 858 859 860 861 862 863 864 865 866 867
	 * errors and also does not have a checksum error.
	 * If one is found, and if a checksum is present, the full block
	 * that is known to contain an error is rewritten. Afterwards
	 * the block is known to be corrected.
	 * If a mirror is found which is completely correct, and no
	 * checksum is present, only those pages are rewritten that had
	 * an I/O error in the block to be repaired, since it cannot be
	 * determined, which copy of the other pages is better (and it
	 * could happen otherwise that a correct page would be
	 * overwritten by a bad one).
	 */
	for (mirror_index = 0;
	     mirror_index < BTRFS_MAX_MIRRORS &&
	     sblocks_for_recheck[mirror_index].page_count > 0;
	     mirror_index++) {
868
		struct scrub_block *sblock_other;
869

870 871 872 873 874
		if (mirror_index == failed_mirror_index)
			continue;
		sblock_other = sblocks_for_recheck + mirror_index;

		/* build and submit the bios, check checksums */
875 876 877 878 879
		scrub_recheck_block(fs_info, sblock_other, is_metadata,
				    have_csum, csum, generation,
				    sctx->csum_size);

		if (!sblock_other->header_error &&
880 881 882 883 884 885 886 887 888 889 890
		    !sblock_other->checksum_error &&
		    sblock_other->no_io_error_seen) {
			int force_write = is_metadata || have_csum;

			ret = scrub_repair_block_from_good_copy(sblock_bad,
								sblock_other,
								force_write);
			if (0 == ret)
				goto corrected_error;
		}
	}
A
Arne Jansen 已提交
891 892

	/*
893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914
	 * in case of I/O errors in the area that is supposed to be
	 * repaired, continue by picking good copies of those pages.
	 * Select the good pages from mirrors to rewrite bad pages from
	 * the area to fix. Afterwards verify the checksum of the block
	 * that is supposed to be repaired. This verification step is
	 * only done for the purpose of statistic counting and for the
	 * final scrub report, whether errors remain.
	 * A perfect algorithm could make use of the checksum and try
	 * all possible combinations of pages from the different mirrors
	 * until the checksum verification succeeds. For example, when
	 * the 2nd page of mirror #1 faces I/O errors, and the 2nd page
	 * of mirror #2 is readable but the final checksum test fails,
	 * then the 2nd page of mirror #3 could be tried, whether now
	 * the final checksum succeedes. But this would be a rare
	 * exception and is therefore not implemented. At least it is
	 * avoided that the good copy is overwritten.
	 * A more useful improvement would be to pick the sectors
	 * without I/O error based on sector sizes (512 bytes on legacy
	 * disks) instead of on PAGE_SIZE. Then maybe 512 byte of one
	 * mirror could be repaired by taking 512 byte of a different
	 * mirror, even if other 512 byte sectors in the same PAGE_SIZE
	 * area are unreadable.
A
Arne Jansen 已提交
915 916
	 */

917 918 919 920 921 922
	/* can only fix I/O errors from here on */
	if (sblock_bad->no_io_error_seen)
		goto did_not_correct_error;

	success = 1;
	for (page_num = 0; page_num < sblock_bad->page_count; page_num++) {
923
		struct scrub_page *page_bad = sblock_bad->pagev[page_num];
924 925

		if (!page_bad->io_error)
A
Arne Jansen 已提交
926
			continue;
927 928 929 930 931 932 933

		for (mirror_index = 0;
		     mirror_index < BTRFS_MAX_MIRRORS &&
		     sblocks_for_recheck[mirror_index].page_count > 0;
		     mirror_index++) {
			struct scrub_block *sblock_other = sblocks_for_recheck +
							   mirror_index;
934 935
			struct scrub_page *page_other = sblock_other->pagev[
							page_num];
936 937 938 939 940 941 942 943 944

			if (!page_other->io_error) {
				ret = scrub_repair_page_from_good_copy(
					sblock_bad, sblock_other, page_num, 0);
				if (0 == ret) {
					page_bad->io_error = 0;
					break; /* succeeded for this page */
				}
			}
I
Ilya Dryomov 已提交
945
		}
A
Arne Jansen 已提交
946

947 948 949 950
		if (page_bad->io_error) {
			/* did not find a mirror to copy the page from */
			success = 0;
		}
A
Arne Jansen 已提交
951 952
	}

953 954 955 956 957 958 959 960 961 962 963
	if (success) {
		if (is_metadata || have_csum) {
			/*
			 * need to verify the checksum now that all
			 * sectors on disk are repaired (the write
			 * request for data to be repaired is on its way).
			 * Just be lazy and use scrub_recheck_block()
			 * which re-reads the data before the checksum
			 * is verified, but most likely the data comes out
			 * of the page cache.
			 */
964 965 966 967
			scrub_recheck_block(fs_info, sblock_bad,
					    is_metadata, have_csum, csum,
					    generation, sctx->csum_size);
			if (!sblock_bad->header_error &&
968 969 970 971 972 973 974
			    !sblock_bad->checksum_error &&
			    sblock_bad->no_io_error_seen)
				goto corrected_error;
			else
				goto did_not_correct_error;
		} else {
corrected_error:
975 976 977
			spin_lock(&sctx->stat_lock);
			sctx->stat.corrected_errors++;
			spin_unlock(&sctx->stat_lock);
978
			printk_ratelimited_in_rcu(KERN_ERR
979
				"btrfs: fixed up error at logical %llu on dev %s\n",
980
				(unsigned long long)logical,
981
				rcu_str_deref(dev->name));
A
Arne Jansen 已提交
982
		}
983 984
	} else {
did_not_correct_error:
985 986 987
		spin_lock(&sctx->stat_lock);
		sctx->stat.uncorrectable_errors++;
		spin_unlock(&sctx->stat_lock);
988
		printk_ratelimited_in_rcu(KERN_ERR
989
			"btrfs: unable to fixup (regular) error at logical %llu on dev %s\n",
990
			(unsigned long long)logical,
991
			rcu_str_deref(dev->name));
I
Ilya Dryomov 已提交
992
	}
A
Arne Jansen 已提交
993

994 995 996 997 998 999 1000 1001
out:
	if (sblocks_for_recheck) {
		for (mirror_index = 0; mirror_index < BTRFS_MAX_MIRRORS;
		     mirror_index++) {
			struct scrub_block *sblock = sblocks_for_recheck +
						     mirror_index;
			int page_index;

1002 1003 1004 1005 1006
			for (page_index = 0; page_index < sblock->page_count;
			     page_index++) {
				sblock->pagev[page_index]->sblock = NULL;
				scrub_page_put(sblock->pagev[page_index]);
			}
1007 1008 1009
		}
		kfree(sblocks_for_recheck);
	}
A
Arne Jansen 已提交
1010

1011 1012
	return 0;
}
A
Arne Jansen 已提交
1013

1014
static int scrub_setup_recheck_block(struct scrub_ctx *sctx,
1015
				     struct btrfs_fs_info *fs_info,
1016 1017 1018 1019 1020 1021 1022 1023
				     u64 length, u64 logical,
				     struct scrub_block *sblocks_for_recheck)
{
	int page_index;
	int mirror_index;
	int ret;

	/*
1024
	 * note: the two members ref_count and outstanding_pages
1025 1026 1027 1028 1029 1030 1031 1032 1033
	 * are not used (and not set) in the blocks that are used for
	 * the recheck procedure
	 */

	page_index = 0;
	while (length > 0) {
		u64 sublen = min_t(u64, length, PAGE_SIZE);
		u64 mapped_length = sublen;
		struct btrfs_bio *bbio = NULL;
A
Arne Jansen 已提交
1034

1035 1036 1037 1038
		/*
		 * with a length of PAGE_SIZE, each returned stripe
		 * represents one mirror
		 */
1039
		ret = btrfs_map_block(fs_info, WRITE, logical, &mapped_length,
1040 1041 1042 1043 1044
				      &bbio, 0);
		if (ret || !bbio || mapped_length < sublen) {
			kfree(bbio);
			return -EIO;
		}
A
Arne Jansen 已提交
1045

1046 1047 1048 1049 1050 1051 1052 1053 1054 1055
		BUG_ON(page_index >= SCRUB_PAGES_PER_BIO);
		for (mirror_index = 0; mirror_index < (int)bbio->num_stripes;
		     mirror_index++) {
			struct scrub_block *sblock;
			struct scrub_page *page;

			if (mirror_index >= BTRFS_MAX_MIRRORS)
				continue;

			sblock = sblocks_for_recheck + mirror_index;
1056 1057 1058 1059
			sblock->sctx = sctx;
			page = kzalloc(sizeof(*page), GFP_NOFS);
			if (!page) {
leave_nomem:
1060 1061 1062
				spin_lock(&sctx->stat_lock);
				sctx->stat.malloc_errors++;
				spin_unlock(&sctx->stat_lock);
1063
				kfree(bbio);
1064 1065
				return -ENOMEM;
			}
1066 1067 1068 1069 1070 1071 1072
			scrub_page_get(page);
			sblock->pagev[page_index] = page;
			page->logical = logical;
			page->physical = bbio->stripes[mirror_index].physical;
			/* for missing devices, dev->bdev is NULL */
			page->dev = bbio->stripes[mirror_index].dev;
			page->mirror_num = mirror_index + 1;
1073
			sblock->page_count++;
1074 1075 1076
			page->page = alloc_page(GFP_NOFS);
			if (!page->page)
				goto leave_nomem;
1077 1078 1079 1080 1081 1082 1083 1084
		}
		kfree(bbio);
		length -= sublen;
		logical += sublen;
		page_index++;
	}

	return 0;
I
Ilya Dryomov 已提交
1085 1086
}

1087 1088 1089 1090 1091 1092 1093
/*
 * this function will check the on disk data for checksum errors, header
 * errors and read I/O errors. If any I/O errors happen, the exact pages
 * which are errored are marked as being bad. The goal is to enable scrub
 * to take those pages that are not errored from all the mirrors so that
 * the pages that are errored in the just handled mirror can be repaired.
 */
1094 1095 1096 1097
static void scrub_recheck_block(struct btrfs_fs_info *fs_info,
				struct scrub_block *sblock, int is_metadata,
				int have_csum, u8 *csum, u64 generation,
				u16 csum_size)
I
Ilya Dryomov 已提交
1098
{
1099
	int page_num;
I
Ilya Dryomov 已提交
1100

1101 1102 1103
	sblock->no_io_error_seen = 1;
	sblock->header_error = 0;
	sblock->checksum_error = 0;
I
Ilya Dryomov 已提交
1104

1105 1106
	for (page_num = 0; page_num < sblock->page_count; page_num++) {
		struct bio *bio;
1107
		struct scrub_page *page = sblock->pagev[page_num];
1108 1109
		DECLARE_COMPLETION_ONSTACK(complete);

1110
		if (page->dev->bdev == NULL) {
1111 1112 1113 1114 1115
			page->io_error = 1;
			sblock->no_io_error_seen = 0;
			continue;
		}

1116
		WARN_ON(!page->page);
1117
		bio = bio_alloc(GFP_NOFS, 1);
1118 1119 1120 1121 1122
		if (!bio) {
			page->io_error = 1;
			sblock->no_io_error_seen = 0;
			continue;
		}
1123
		bio->bi_bdev = page->dev->bdev;
1124 1125 1126 1127
		bio->bi_sector = page->physical >> 9;
		bio->bi_end_io = scrub_complete_bio_end_io;
		bio->bi_private = &complete;

1128
		bio_add_page(bio, page->page, PAGE_SIZE, 0);
1129
		btrfsic_submit_bio(READ, bio);
I
Ilya Dryomov 已提交
1130

1131 1132
		/* this will also unplug the queue */
		wait_for_completion(&complete);
I
Ilya Dryomov 已提交
1133

1134 1135 1136 1137 1138
		page->io_error = !test_bit(BIO_UPTODATE, &bio->bi_flags);
		if (!test_bit(BIO_UPTODATE, &bio->bi_flags))
			sblock->no_io_error_seen = 0;
		bio_put(bio);
	}
I
Ilya Dryomov 已提交
1139

1140 1141 1142 1143 1144
	if (sblock->no_io_error_seen)
		scrub_recheck_block_checksum(fs_info, sblock, is_metadata,
					     have_csum, csum, generation,
					     csum_size);

1145
	return;
A
Arne Jansen 已提交
1146 1147
}

1148 1149 1150 1151 1152
static void scrub_recheck_block_checksum(struct btrfs_fs_info *fs_info,
					 struct scrub_block *sblock,
					 int is_metadata, int have_csum,
					 const u8 *csum, u64 generation,
					 u16 csum_size)
A
Arne Jansen 已提交
1153
{
1154 1155 1156 1157 1158 1159
	int page_num;
	u8 calculated_csum[BTRFS_CSUM_SIZE];
	u32 crc = ~(u32)0;
	struct btrfs_root *root = fs_info->extent_root;
	void *mapped_buffer;

1160
	WARN_ON(!sblock->pagev[0]->page);
1161 1162 1163
	if (is_metadata) {
		struct btrfs_header *h;

1164
		mapped_buffer = kmap_atomic(sblock->pagev[0]->page);
1165 1166
		h = (struct btrfs_header *)mapped_buffer;

1167
		if (sblock->pagev[0]->logical != le64_to_cpu(h->bytenr) ||
1168 1169
		    memcmp(h->fsid, fs_info->fsid, BTRFS_UUID_SIZE) ||
		    memcmp(h->chunk_tree_uuid, fs_info->chunk_tree_uuid,
1170
			   BTRFS_UUID_SIZE)) {
1171
			sblock->header_error = 1;
1172 1173 1174 1175
		} else if (generation != le64_to_cpu(h->generation)) {
			sblock->header_error = 1;
			sblock->generation_error = 1;
		}
1176 1177 1178 1179
		csum = h->csum;
	} else {
		if (!have_csum)
			return;
A
Arne Jansen 已提交
1180

1181
		mapped_buffer = kmap_atomic(sblock->pagev[0]->page);
1182
	}
A
Arne Jansen 已提交
1183

1184 1185 1186 1187 1188 1189 1190 1191 1192
	for (page_num = 0;;) {
		if (page_num == 0 && is_metadata)
			crc = btrfs_csum_data(root,
				((u8 *)mapped_buffer) + BTRFS_CSUM_SIZE,
				crc, PAGE_SIZE - BTRFS_CSUM_SIZE);
		else
			crc = btrfs_csum_data(root, mapped_buffer, crc,
					      PAGE_SIZE);

1193
		kunmap_atomic(mapped_buffer);
1194 1195 1196
		page_num++;
		if (page_num >= sblock->page_count)
			break;
1197
		WARN_ON(!sblock->pagev[page_num]->page);
1198

1199
		mapped_buffer = kmap_atomic(sblock->pagev[page_num]->page);
1200 1201 1202 1203 1204
	}

	btrfs_csum_final(crc, calculated_csum);
	if (memcmp(calculated_csum, csum, csum_size))
		sblock->checksum_error = 1;
A
Arne Jansen 已提交
1205 1206
}

1207
static void scrub_complete_bio_end_io(struct bio *bio, int err)
A
Arne Jansen 已提交
1208
{
1209 1210
	complete((struct completion *)bio->bi_private);
}
A
Arne Jansen 已提交
1211

1212 1213 1214 1215 1216 1217
static int scrub_repair_block_from_good_copy(struct scrub_block *sblock_bad,
					     struct scrub_block *sblock_good,
					     int force_write)
{
	int page_num;
	int ret = 0;
I
Ilya Dryomov 已提交
1218

1219 1220
	for (page_num = 0; page_num < sblock_bad->page_count; page_num++) {
		int ret_sub;
I
Ilya Dryomov 已提交
1221

1222 1223 1224 1225 1226 1227
		ret_sub = scrub_repair_page_from_good_copy(sblock_bad,
							   sblock_good,
							   page_num,
							   force_write);
		if (ret_sub)
			ret = ret_sub;
A
Arne Jansen 已提交
1228
	}
1229 1230 1231 1232 1233 1234 1235 1236

	return ret;
}

static int scrub_repair_page_from_good_copy(struct scrub_block *sblock_bad,
					    struct scrub_block *sblock_good,
					    int page_num, int force_write)
{
1237 1238
	struct scrub_page *page_bad = sblock_bad->pagev[page_num];
	struct scrub_page *page_good = sblock_good->pagev[page_num];
1239

1240 1241
	BUG_ON(page_bad->page == NULL);
	BUG_ON(page_good->page == NULL);
1242 1243 1244 1245 1246 1247 1248
	if (force_write || sblock_bad->header_error ||
	    sblock_bad->checksum_error || page_bad->io_error) {
		struct bio *bio;
		int ret;
		DECLARE_COMPLETION_ONSTACK(complete);

		bio = bio_alloc(GFP_NOFS, 1);
1249 1250
		if (!bio)
			return -EIO;
1251
		bio->bi_bdev = page_bad->dev->bdev;
1252 1253 1254 1255 1256 1257 1258 1259
		bio->bi_sector = page_bad->physical >> 9;
		bio->bi_end_io = scrub_complete_bio_end_io;
		bio->bi_private = &complete;

		ret = bio_add_page(bio, page_good->page, PAGE_SIZE, 0);
		if (PAGE_SIZE != ret) {
			bio_put(bio);
			return -EIO;
1260
		}
1261 1262 1263 1264
		btrfsic_submit_bio(WRITE, bio);

		/* this will also unplug the queue */
		wait_for_completion(&complete);
1265 1266 1267 1268 1269 1270
		if (!bio_flagged(bio, BIO_UPTODATE)) {
			btrfs_dev_stat_inc_and_print(page_bad->dev,
				BTRFS_DEV_STAT_WRITE_ERRS);
			bio_put(bio);
			return -EIO;
		}
1271
		bio_put(bio);
A
Arne Jansen 已提交
1272 1273
	}

1274 1275 1276 1277 1278 1279 1280 1281
	return 0;
}

static void scrub_checksum(struct scrub_block *sblock)
{
	u64 flags;
	int ret;

1282 1283
	WARN_ON(sblock->page_count < 1);
	flags = sblock->pagev[0]->flags;
1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294
	ret = 0;
	if (flags & BTRFS_EXTENT_FLAG_DATA)
		ret = scrub_checksum_data(sblock);
	else if (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK)
		ret = scrub_checksum_tree_block(sblock);
	else if (flags & BTRFS_EXTENT_FLAG_SUPER)
		(void)scrub_checksum_super(sblock);
	else
		WARN_ON(1);
	if (ret)
		scrub_handle_errored_block(sblock);
A
Arne Jansen 已提交
1295 1296
}

1297
static int scrub_checksum_data(struct scrub_block *sblock)
A
Arne Jansen 已提交
1298
{
1299
	struct scrub_ctx *sctx = sblock->sctx;
A
Arne Jansen 已提交
1300
	u8 csum[BTRFS_CSUM_SIZE];
1301 1302 1303
	u8 *on_disk_csum;
	struct page *page;
	void *buffer;
A
Arne Jansen 已提交
1304 1305
	u32 crc = ~(u32)0;
	int fail = 0;
1306
	struct btrfs_root *root = sctx->dev_root;
1307 1308
	u64 len;
	int index;
A
Arne Jansen 已提交
1309

1310
	BUG_ON(sblock->page_count < 1);
1311
	if (!sblock->pagev[0]->have_csum)
A
Arne Jansen 已提交
1312 1313
		return 0;

1314 1315
	on_disk_csum = sblock->pagev[0]->csum;
	page = sblock->pagev[0]->page;
1316
	buffer = kmap_atomic(page);
1317

1318
	len = sctx->sectorsize;
1319 1320 1321 1322 1323
	index = 0;
	for (;;) {
		u64 l = min_t(u64, len, PAGE_SIZE);

		crc = btrfs_csum_data(root, buffer, crc, l);
1324
		kunmap_atomic(buffer);
1325 1326 1327 1328 1329
		len -= l;
		if (len == 0)
			break;
		index++;
		BUG_ON(index >= sblock->page_count);
1330 1331
		BUG_ON(!sblock->pagev[index]->page);
		page = sblock->pagev[index]->page;
1332
		buffer = kmap_atomic(page);
1333 1334
	}

A
Arne Jansen 已提交
1335
	btrfs_csum_final(crc, csum);
1336
	if (memcmp(csum, on_disk_csum, sctx->csum_size))
A
Arne Jansen 已提交
1337 1338 1339 1340 1341
		fail = 1;

	return fail;
}

1342
static int scrub_checksum_tree_block(struct scrub_block *sblock)
A
Arne Jansen 已提交
1343
{
1344
	struct scrub_ctx *sctx = sblock->sctx;
A
Arne Jansen 已提交
1345
	struct btrfs_header *h;
1346
	struct btrfs_root *root = sctx->dev_root;
A
Arne Jansen 已提交
1347
	struct btrfs_fs_info *fs_info = root->fs_info;
1348 1349 1350 1351 1352 1353
	u8 calculated_csum[BTRFS_CSUM_SIZE];
	u8 on_disk_csum[BTRFS_CSUM_SIZE];
	struct page *page;
	void *mapped_buffer;
	u64 mapped_size;
	void *p;
A
Arne Jansen 已提交
1354 1355 1356
	u32 crc = ~(u32)0;
	int fail = 0;
	int crc_fail = 0;
1357 1358 1359 1360
	u64 len;
	int index;

	BUG_ON(sblock->page_count < 1);
1361
	page = sblock->pagev[0]->page;
1362
	mapped_buffer = kmap_atomic(page);
1363
	h = (struct btrfs_header *)mapped_buffer;
1364
	memcpy(on_disk_csum, h->csum, sctx->csum_size);
A
Arne Jansen 已提交
1365 1366 1367 1368 1369 1370 1371

	/*
	 * we don't use the getter functions here, as we
	 * a) don't have an extent buffer and
	 * b) the page is already kmapped
	 */

1372
	if (sblock->pagev[0]->logical != le64_to_cpu(h->bytenr))
A
Arne Jansen 已提交
1373 1374
		++fail;

1375
	if (sblock->pagev[0]->generation != le64_to_cpu(h->generation))
A
Arne Jansen 已提交
1376 1377 1378 1379 1380 1381 1382 1383 1384
		++fail;

	if (memcmp(h->fsid, fs_info->fsid, BTRFS_UUID_SIZE))
		++fail;

	if (memcmp(h->chunk_tree_uuid, fs_info->chunk_tree_uuid,
		   BTRFS_UUID_SIZE))
		++fail;

1385 1386
	BUG_ON(sctx->nodesize != sctx->leafsize);
	len = sctx->nodesize - BTRFS_CSUM_SIZE;
1387 1388 1389 1390 1391 1392 1393
	mapped_size = PAGE_SIZE - BTRFS_CSUM_SIZE;
	p = ((u8 *)mapped_buffer) + BTRFS_CSUM_SIZE;
	index = 0;
	for (;;) {
		u64 l = min_t(u64, len, mapped_size);

		crc = btrfs_csum_data(root, p, crc, l);
1394
		kunmap_atomic(mapped_buffer);
1395 1396 1397 1398 1399
		len -= l;
		if (len == 0)
			break;
		index++;
		BUG_ON(index >= sblock->page_count);
1400 1401
		BUG_ON(!sblock->pagev[index]->page);
		page = sblock->pagev[index]->page;
1402
		mapped_buffer = kmap_atomic(page);
1403 1404 1405 1406 1407
		mapped_size = PAGE_SIZE;
		p = mapped_buffer;
	}

	btrfs_csum_final(crc, calculated_csum);
1408
	if (memcmp(calculated_csum, on_disk_csum, sctx->csum_size))
A
Arne Jansen 已提交
1409 1410 1411 1412 1413
		++crc_fail;

	return fail || crc_fail;
}

1414
static int scrub_checksum_super(struct scrub_block *sblock)
A
Arne Jansen 已提交
1415 1416
{
	struct btrfs_super_block *s;
1417
	struct scrub_ctx *sctx = sblock->sctx;
1418
	struct btrfs_root *root = sctx->dev_root;
A
Arne Jansen 已提交
1419
	struct btrfs_fs_info *fs_info = root->fs_info;
1420 1421 1422 1423 1424 1425
	u8 calculated_csum[BTRFS_CSUM_SIZE];
	u8 on_disk_csum[BTRFS_CSUM_SIZE];
	struct page *page;
	void *mapped_buffer;
	u64 mapped_size;
	void *p;
A
Arne Jansen 已提交
1426
	u32 crc = ~(u32)0;
1427 1428
	int fail_gen = 0;
	int fail_cor = 0;
1429 1430
	u64 len;
	int index;
A
Arne Jansen 已提交
1431

1432
	BUG_ON(sblock->page_count < 1);
1433
	page = sblock->pagev[0]->page;
1434
	mapped_buffer = kmap_atomic(page);
1435
	s = (struct btrfs_super_block *)mapped_buffer;
1436
	memcpy(on_disk_csum, s->csum, sctx->csum_size);
A
Arne Jansen 已提交
1437

1438
	if (sblock->pagev[0]->logical != le64_to_cpu(s->bytenr))
1439
		++fail_cor;
A
Arne Jansen 已提交
1440

1441
	if (sblock->pagev[0]->generation != le64_to_cpu(s->generation))
1442
		++fail_gen;
A
Arne Jansen 已提交
1443 1444

	if (memcmp(s->fsid, fs_info->fsid, BTRFS_UUID_SIZE))
1445
		++fail_cor;
A
Arne Jansen 已提交
1446

1447 1448 1449 1450 1451 1452 1453 1454
	len = BTRFS_SUPER_INFO_SIZE - BTRFS_CSUM_SIZE;
	mapped_size = PAGE_SIZE - BTRFS_CSUM_SIZE;
	p = ((u8 *)mapped_buffer) + BTRFS_CSUM_SIZE;
	index = 0;
	for (;;) {
		u64 l = min_t(u64, len, mapped_size);

		crc = btrfs_csum_data(root, p, crc, l);
1455
		kunmap_atomic(mapped_buffer);
1456 1457 1458 1459 1460
		len -= l;
		if (len == 0)
			break;
		index++;
		BUG_ON(index >= sblock->page_count);
1461 1462
		BUG_ON(!sblock->pagev[index]->page);
		page = sblock->pagev[index]->page;
1463
		mapped_buffer = kmap_atomic(page);
1464 1465 1466 1467 1468
		mapped_size = PAGE_SIZE;
		p = mapped_buffer;
	}

	btrfs_csum_final(crc, calculated_csum);
1469
	if (memcmp(calculated_csum, on_disk_csum, sctx->csum_size))
1470
		++fail_cor;
A
Arne Jansen 已提交
1471

1472
	if (fail_cor + fail_gen) {
A
Arne Jansen 已提交
1473 1474 1475 1476 1477
		/*
		 * if we find an error in a super block, we just report it.
		 * They will get written with the next transaction commit
		 * anyway
		 */
1478 1479 1480
		spin_lock(&sctx->stat_lock);
		++sctx->stat.super_errors;
		spin_unlock(&sctx->stat_lock);
1481
		if (fail_cor)
1482
			btrfs_dev_stat_inc_and_print(sblock->pagev[0]->dev,
1483 1484
				BTRFS_DEV_STAT_CORRUPTION_ERRS);
		else
1485
			btrfs_dev_stat_inc_and_print(sblock->pagev[0]->dev,
1486
				BTRFS_DEV_STAT_GENERATION_ERRS);
A
Arne Jansen 已提交
1487 1488
	}

1489
	return fail_cor + fail_gen;
A
Arne Jansen 已提交
1490 1491
}

1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502
static void scrub_block_get(struct scrub_block *sblock)
{
	atomic_inc(&sblock->ref_count);
}

static void scrub_block_put(struct scrub_block *sblock)
{
	if (atomic_dec_and_test(&sblock->ref_count)) {
		int i;

		for (i = 0; i < sblock->page_count; i++)
1503
			scrub_page_put(sblock->pagev[i]);
1504 1505 1506 1507
		kfree(sblock);
	}
}

1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521
static void scrub_page_get(struct scrub_page *spage)
{
	atomic_inc(&spage->ref_count);
}

static void scrub_page_put(struct scrub_page *spage)
{
	if (atomic_dec_and_test(&spage->ref_count)) {
		if (spage->page)
			__free_page(spage->page);
		kfree(spage);
	}
}

1522
static void scrub_submit(struct scrub_ctx *sctx)
A
Arne Jansen 已提交
1523 1524 1525
{
	struct scrub_bio *sbio;

1526
	if (sctx->curr == -1)
S
Stefan Behrens 已提交
1527
		return;
A
Arne Jansen 已提交
1528

1529 1530
	sbio = sctx->bios[sctx->curr];
	sctx->curr = -1;
1531
	scrub_pending_bio_inc(sctx);
A
Arne Jansen 已提交
1532

1533
	btrfsic_submit_bio(READ, sbio->bio);
A
Arne Jansen 已提交
1534 1535
}

1536
static int scrub_add_page_to_bio(struct scrub_ctx *sctx,
1537
				 struct scrub_page *spage)
A
Arne Jansen 已提交
1538
{
1539
	struct scrub_block *sblock = spage->sblock;
A
Arne Jansen 已提交
1540
	struct scrub_bio *sbio;
1541
	int ret;
A
Arne Jansen 已提交
1542 1543 1544 1545 1546

again:
	/*
	 * grab a fresh bio or wait for one to become available
	 */
1547 1548 1549 1550 1551 1552 1553 1554
	while (sctx->curr == -1) {
		spin_lock(&sctx->list_lock);
		sctx->curr = sctx->first_free;
		if (sctx->curr != -1) {
			sctx->first_free = sctx->bios[sctx->curr]->next_free;
			sctx->bios[sctx->curr]->next_free = -1;
			sctx->bios[sctx->curr]->page_count = 0;
			spin_unlock(&sctx->list_lock);
A
Arne Jansen 已提交
1555
		} else {
1556 1557
			spin_unlock(&sctx->list_lock);
			wait_event(sctx->list_wait, sctx->first_free != -1);
A
Arne Jansen 已提交
1558 1559
		}
	}
1560
	sbio = sctx->bios[sctx->curr];
1561
	if (sbio->page_count == 0) {
1562 1563
		struct bio *bio;

1564 1565
		sbio->physical = spage->physical;
		sbio->logical = spage->logical;
1566
		sbio->dev = spage->dev;
1567 1568
		bio = sbio->bio;
		if (!bio) {
1569
			bio = bio_alloc(GFP_NOFS, sctx->pages_per_bio);
1570 1571 1572 1573
			if (!bio)
				return -ENOMEM;
			sbio->bio = bio;
		}
1574 1575 1576

		bio->bi_private = sbio;
		bio->bi_end_io = scrub_bio_end_io;
1577 1578
		bio->bi_bdev = sbio->dev->bdev;
		bio->bi_sector = sbio->physical >> 9;
1579
		sbio->err = 0;
1580 1581 1582
	} else if (sbio->physical + sbio->page_count * PAGE_SIZE !=
		   spage->physical ||
		   sbio->logical + sbio->page_count * PAGE_SIZE !=
1583 1584
		   spage->logical ||
		   sbio->dev != spage->dev) {
1585
		scrub_submit(sctx);
A
Arne Jansen 已提交
1586 1587
		goto again;
	}
1588

1589 1590 1591 1592 1593 1594 1595 1596
	sbio->pagev[sbio->page_count] = spage;
	ret = bio_add_page(sbio->bio, spage->page, PAGE_SIZE, 0);
	if (ret != PAGE_SIZE) {
		if (sbio->page_count < 1) {
			bio_put(sbio->bio);
			sbio->bio = NULL;
			return -EIO;
		}
1597
		scrub_submit(sctx);
1598 1599 1600
		goto again;
	}

1601 1602 1603
	scrub_block_get(sblock); /* one for the added page */
	atomic_inc(&sblock->outstanding_pages);
	sbio->page_count++;
1604 1605
	if (sbio->page_count == sctx->pages_per_bio)
		scrub_submit(sctx);
1606 1607 1608 1609

	return 0;
}

1610
static int scrub_pages(struct scrub_ctx *sctx, u64 logical, u64 len,
1611 1612
		       u64 physical, struct btrfs_device *dev, u64 flags,
		       u64 gen, int mirror_num, u8 *csum, int force)
1613 1614 1615 1616 1617 1618
{
	struct scrub_block *sblock;
	int index;

	sblock = kzalloc(sizeof(*sblock), GFP_NOFS);
	if (!sblock) {
1619 1620 1621
		spin_lock(&sctx->stat_lock);
		sctx->stat.malloc_errors++;
		spin_unlock(&sctx->stat_lock);
1622
		return -ENOMEM;
A
Arne Jansen 已提交
1623
	}
1624

1625 1626
	/* one ref inside this function, plus one for each page added to
	 * a bio later on */
1627
	atomic_set(&sblock->ref_count, 1);
1628
	sblock->sctx = sctx;
1629 1630 1631
	sblock->no_io_error_seen = 1;

	for (index = 0; len > 0; index++) {
1632
		struct scrub_page *spage;
1633 1634
		u64 l = min_t(u64, len, PAGE_SIZE);

1635 1636 1637
		spage = kzalloc(sizeof(*spage), GFP_NOFS);
		if (!spage) {
leave_nomem:
1638 1639 1640
			spin_lock(&sctx->stat_lock);
			sctx->stat.malloc_errors++;
			spin_unlock(&sctx->stat_lock);
1641
			scrub_block_put(sblock);
1642 1643
			return -ENOMEM;
		}
1644 1645 1646
		BUG_ON(index >= SCRUB_MAX_PAGES_PER_BLOCK);
		scrub_page_get(spage);
		sblock->pagev[index] = spage;
1647
		spage->sblock = sblock;
1648
		spage->dev = dev;
1649 1650 1651 1652 1653 1654 1655
		spage->flags = flags;
		spage->generation = gen;
		spage->logical = logical;
		spage->physical = physical;
		spage->mirror_num = mirror_num;
		if (csum) {
			spage->have_csum = 1;
1656
			memcpy(spage->csum, csum, sctx->csum_size);
1657 1658 1659 1660
		} else {
			spage->have_csum = 0;
		}
		sblock->page_count++;
1661 1662 1663
		spage->page = alloc_page(GFP_NOFS);
		if (!spage->page)
			goto leave_nomem;
1664 1665 1666 1667 1668
		len -= l;
		logical += l;
		physical += l;
	}

1669
	WARN_ON(sblock->page_count == 0);
1670
	for (index = 0; index < sblock->page_count; index++) {
1671
		struct scrub_page *spage = sblock->pagev[index];
1672 1673
		int ret;

1674
		ret = scrub_add_page_to_bio(sctx, spage);
1675 1676
		if (ret) {
			scrub_block_put(sblock);
1677
			return ret;
1678
		}
1679
	}
A
Arne Jansen 已提交
1680

1681
	if (force)
1682
		scrub_submit(sctx);
A
Arne Jansen 已提交
1683

1684 1685
	/* last one frees, either here or in bio completion for last page */
	scrub_block_put(sblock);
A
Arne Jansen 已提交
1686 1687 1688
	return 0;
}

1689 1690 1691
static void scrub_bio_end_io(struct bio *bio, int err)
{
	struct scrub_bio *sbio = bio->bi_private;
1692
	struct btrfs_fs_info *fs_info = sbio->dev->dev_root->fs_info;
1693 1694 1695 1696 1697 1698 1699 1700 1701 1702

	sbio->err = err;
	sbio->bio = bio;

	btrfs_queue_worker(&fs_info->scrub_workers, &sbio->work);
}

static void scrub_bio_end_io_worker(struct btrfs_work *work)
{
	struct scrub_bio *sbio = container_of(work, struct scrub_bio, work);
1703
	struct scrub_ctx *sctx = sbio->sctx;
1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727
	int i;

	BUG_ON(sbio->page_count > SCRUB_PAGES_PER_BIO);
	if (sbio->err) {
		for (i = 0; i < sbio->page_count; i++) {
			struct scrub_page *spage = sbio->pagev[i];

			spage->io_error = 1;
			spage->sblock->no_io_error_seen = 0;
		}
	}

	/* now complete the scrub_block items that have all pages completed */
	for (i = 0; i < sbio->page_count; i++) {
		struct scrub_page *spage = sbio->pagev[i];
		struct scrub_block *sblock = spage->sblock;

		if (atomic_dec_and_test(&sblock->outstanding_pages))
			scrub_block_complete(sblock);
		scrub_block_put(sblock);
	}

	bio_put(sbio->bio);
	sbio->bio = NULL;
1728 1729 1730 1731
	spin_lock(&sctx->list_lock);
	sbio->next_free = sctx->first_free;
	sctx->first_free = sbio->index;
	spin_unlock(&sctx->list_lock);
1732
	scrub_pending_bio_dec(sctx);
1733 1734 1735 1736 1737 1738 1739 1740 1741 1742
}

static void scrub_block_complete(struct scrub_block *sblock)
{
	if (!sblock->no_io_error_seen)
		scrub_handle_errored_block(sblock);
	else
		scrub_checksum(sblock);
}

1743
static int scrub_find_csum(struct scrub_ctx *sctx, u64 logical, u64 len,
A
Arne Jansen 已提交
1744 1745 1746 1747 1748 1749 1750
			   u8 *csum)
{
	struct btrfs_ordered_sum *sum = NULL;
	int ret = 0;
	unsigned long i;
	unsigned long num_sectors;

1751 1752
	while (!list_empty(&sctx->csum_list)) {
		sum = list_first_entry(&sctx->csum_list,
A
Arne Jansen 已提交
1753 1754 1755 1756 1757 1758
				       struct btrfs_ordered_sum, list);
		if (sum->bytenr > logical)
			return 0;
		if (sum->bytenr + sum->len > logical)
			break;

1759
		++sctx->stat.csum_discards;
A
Arne Jansen 已提交
1760 1761 1762 1763 1764 1765 1766
		list_del(&sum->list);
		kfree(sum);
		sum = NULL;
	}
	if (!sum)
		return 0;

1767
	num_sectors = sum->len / sctx->sectorsize;
A
Arne Jansen 已提交
1768 1769
	for (i = 0; i < num_sectors; ++i) {
		if (sum->sums[i].bytenr == logical) {
1770
			memcpy(csum, &sum->sums[i].sum, sctx->csum_size);
A
Arne Jansen 已提交
1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782
			ret = 1;
			break;
		}
	}
	if (ret && i == num_sectors - 1) {
		list_del(&sum->list);
		kfree(sum);
	}
	return ret;
}

/* scrub extent tries to collect up to 64 kB for each bio */
1783
static int scrub_extent(struct scrub_ctx *sctx, u64 logical, u64 len,
1784 1785
			u64 physical, struct btrfs_device *dev, u64 flags,
			u64 gen, int mirror_num)
A
Arne Jansen 已提交
1786 1787 1788
{
	int ret;
	u8 csum[BTRFS_CSUM_SIZE];
1789 1790 1791
	u32 blocksize;

	if (flags & BTRFS_EXTENT_FLAG_DATA) {
1792 1793 1794 1795 1796
		blocksize = sctx->sectorsize;
		spin_lock(&sctx->stat_lock);
		sctx->stat.data_extents_scrubbed++;
		sctx->stat.data_bytes_scrubbed += len;
		spin_unlock(&sctx->stat_lock);
1797
	} else if (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK) {
1798 1799 1800 1801 1802 1803
		BUG_ON(sctx->nodesize != sctx->leafsize);
		blocksize = sctx->nodesize;
		spin_lock(&sctx->stat_lock);
		sctx->stat.tree_extents_scrubbed++;
		sctx->stat.tree_bytes_scrubbed += len;
		spin_unlock(&sctx->stat_lock);
1804
	} else {
1805
		blocksize = sctx->sectorsize;
1806 1807
		BUG_ON(1);
	}
A
Arne Jansen 已提交
1808 1809

	while (len) {
1810
		u64 l = min_t(u64, len, blocksize);
A
Arne Jansen 已提交
1811 1812 1813 1814
		int have_csum = 0;

		if (flags & BTRFS_EXTENT_FLAG_DATA) {
			/* push csums to sbio */
1815
			have_csum = scrub_find_csum(sctx, logical, l, csum);
A
Arne Jansen 已提交
1816
			if (have_csum == 0)
1817
				++sctx->stat.no_csum;
A
Arne Jansen 已提交
1818
		}
1819
		ret = scrub_pages(sctx, logical, l, physical, dev, flags, gen,
1820
				  mirror_num, have_csum ? csum : NULL, 0);
A
Arne Jansen 已提交
1821 1822 1823 1824 1825 1826 1827 1828 1829
		if (ret)
			return ret;
		len -= l;
		logical += l;
		physical += l;
	}
	return 0;
}

1830
static noinline_for_stack int scrub_stripe(struct scrub_ctx *sctx,
1831 1832 1833
					   struct map_lookup *map,
					   struct btrfs_device *scrub_dev,
					   int num, u64 base, u64 length)
A
Arne Jansen 已提交
1834 1835
{
	struct btrfs_path *path;
1836
	struct btrfs_fs_info *fs_info = sctx->dev_root->fs_info;
A
Arne Jansen 已提交
1837 1838 1839
	struct btrfs_root *root = fs_info->extent_root;
	struct btrfs_root *csum_root = fs_info->csum_root;
	struct btrfs_extent_item *extent;
1840
	struct blk_plug plug;
A
Arne Jansen 已提交
1841 1842 1843 1844 1845 1846 1847 1848 1849 1850
	u64 flags;
	int ret;
	int slot;
	int i;
	u64 nstripes;
	struct extent_buffer *l;
	struct btrfs_key key;
	u64 physical;
	u64 logical;
	u64 generation;
1851
	int mirror_num;
A
Arne Jansen 已提交
1852 1853 1854 1855
	struct reada_control *reada1;
	struct reada_control *reada2;
	struct btrfs_key key_start;
	struct btrfs_key key_end;
A
Arne Jansen 已提交
1856 1857 1858 1859 1860 1861 1862 1863 1864
	u64 increment = map->stripe_len;
	u64 offset;

	nstripes = length;
	offset = 0;
	do_div(nstripes, map->stripe_len);
	if (map->type & BTRFS_BLOCK_GROUP_RAID0) {
		offset = map->stripe_len * num;
		increment = map->stripe_len * map->num_stripes;
1865
		mirror_num = 1;
A
Arne Jansen 已提交
1866 1867 1868 1869
	} else if (map->type & BTRFS_BLOCK_GROUP_RAID10) {
		int factor = map->num_stripes / map->sub_stripes;
		offset = map->stripe_len * (num / map->sub_stripes);
		increment = map->stripe_len * factor;
1870
		mirror_num = num % map->sub_stripes + 1;
A
Arne Jansen 已提交
1871 1872
	} else if (map->type & BTRFS_BLOCK_GROUP_RAID1) {
		increment = map->stripe_len;
1873
		mirror_num = num % map->num_stripes + 1;
A
Arne Jansen 已提交
1874 1875
	} else if (map->type & BTRFS_BLOCK_GROUP_DUP) {
		increment = map->stripe_len;
1876
		mirror_num = num % map->num_stripes + 1;
A
Arne Jansen 已提交
1877 1878
	} else {
		increment = map->stripe_len;
1879
		mirror_num = 1;
A
Arne Jansen 已提交
1880 1881 1882 1883 1884 1885
	}

	path = btrfs_alloc_path();
	if (!path)
		return -ENOMEM;

1886 1887 1888 1889 1890
	/*
	 * work on commit root. The related disk blocks are static as
	 * long as COW is applied. This means, it is save to rewrite
	 * them to repair disk errors without any race conditions
	 */
A
Arne Jansen 已提交
1891 1892 1893 1894
	path->search_commit_root = 1;
	path->skip_locking = 1;

	/*
A
Arne Jansen 已提交
1895 1896 1897
	 * trigger the readahead for extent tree csum tree and wait for
	 * completion. During readahead, the scrub is officially paused
	 * to not hold off transaction commits
A
Arne Jansen 已提交
1898 1899 1900
	 */
	logical = base + offset;

1901
	wait_event(sctx->list_wait,
1902
		   atomic_read(&sctx->bios_in_flight) == 0);
A
Arne Jansen 已提交
1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 1929 1930 1931 1932 1933
	atomic_inc(&fs_info->scrubs_paused);
	wake_up(&fs_info->scrub_pause_wait);

	/* FIXME it might be better to start readahead at commit root */
	key_start.objectid = logical;
	key_start.type = BTRFS_EXTENT_ITEM_KEY;
	key_start.offset = (u64)0;
	key_end.objectid = base + offset + nstripes * increment;
	key_end.type = BTRFS_EXTENT_ITEM_KEY;
	key_end.offset = (u64)0;
	reada1 = btrfs_reada_add(root, &key_start, &key_end);

	key_start.objectid = BTRFS_EXTENT_CSUM_OBJECTID;
	key_start.type = BTRFS_EXTENT_CSUM_KEY;
	key_start.offset = logical;
	key_end.objectid = BTRFS_EXTENT_CSUM_OBJECTID;
	key_end.type = BTRFS_EXTENT_CSUM_KEY;
	key_end.offset = base + offset + nstripes * increment;
	reada2 = btrfs_reada_add(csum_root, &key_start, &key_end);

	if (!IS_ERR(reada1))
		btrfs_reada_wait(reada1);
	if (!IS_ERR(reada2))
		btrfs_reada_wait(reada2);

	mutex_lock(&fs_info->scrub_lock);
	while (atomic_read(&fs_info->scrub_pause_req)) {
		mutex_unlock(&fs_info->scrub_lock);
		wait_event(fs_info->scrub_pause_wait,
		   atomic_read(&fs_info->scrub_pause_req) == 0);
		mutex_lock(&fs_info->scrub_lock);
A
Arne Jansen 已提交
1934
	}
A
Arne Jansen 已提交
1935 1936 1937
	atomic_dec(&fs_info->scrubs_paused);
	mutex_unlock(&fs_info->scrub_lock);
	wake_up(&fs_info->scrub_pause_wait);
A
Arne Jansen 已提交
1938 1939 1940 1941 1942

	/*
	 * collect all data csums for the stripe to avoid seeking during
	 * the scrub. This might currently (crc32) end up to be about 1MB
	 */
1943
	blk_start_plug(&plug);
A
Arne Jansen 已提交
1944 1945 1946 1947

	/*
	 * now find all extents for each stripe and scrub them
	 */
A
Arne Jansen 已提交
1948 1949
	logical = base + offset;
	physical = map->stripes[num].physical;
A
Arne Jansen 已提交
1950
	ret = 0;
A
Arne Jansen 已提交
1951
	for (i = 0; i < nstripes; ++i) {
A
Arne Jansen 已提交
1952 1953 1954 1955
		/*
		 * canceled?
		 */
		if (atomic_read(&fs_info->scrub_cancel_req) ||
1956
		    atomic_read(&sctx->cancel_req)) {
A
Arne Jansen 已提交
1957 1958 1959 1960 1961 1962 1963 1964
			ret = -ECANCELED;
			goto out;
		}
		/*
		 * check to see if we have to pause
		 */
		if (atomic_read(&fs_info->scrub_pause_req)) {
			/* push queued extents */
1965 1966
			scrub_submit(sctx);
			wait_event(sctx->list_wait,
1967
				   atomic_read(&sctx->bios_in_flight) == 0);
A
Arne Jansen 已提交
1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980 1981
			atomic_inc(&fs_info->scrubs_paused);
			wake_up(&fs_info->scrub_pause_wait);
			mutex_lock(&fs_info->scrub_lock);
			while (atomic_read(&fs_info->scrub_pause_req)) {
				mutex_unlock(&fs_info->scrub_lock);
				wait_event(fs_info->scrub_pause_wait,
				   atomic_read(&fs_info->scrub_pause_req) == 0);
				mutex_lock(&fs_info->scrub_lock);
			}
			atomic_dec(&fs_info->scrubs_paused);
			mutex_unlock(&fs_info->scrub_lock);
			wake_up(&fs_info->scrub_pause_wait);
		}

A
Arne Jansen 已提交
1982 1983
		ret = btrfs_lookup_csums_range(csum_root, logical,
					       logical + map->stripe_len - 1,
1984
					       &sctx->csum_list, 1);
A
Arne Jansen 已提交
1985 1986 1987
		if (ret)
			goto out;

A
Arne Jansen 已提交
1988 1989 1990 1991 1992 1993 1994
		key.objectid = logical;
		key.type = BTRFS_EXTENT_ITEM_KEY;
		key.offset = (u64)0;

		ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
		if (ret < 0)
			goto out;
1995
		if (ret > 0) {
A
Arne Jansen 已提交
1996 1997 1998 1999
			ret = btrfs_previous_item(root, path, 0,
						  BTRFS_EXTENT_ITEM_KEY);
			if (ret < 0)
				goto out;
2000 2001 2002 2003 2004 2005 2006 2007 2008
			if (ret > 0) {
				/* there's no smaller item, so stick with the
				 * larger one */
				btrfs_release_path(path);
				ret = btrfs_search_slot(NULL, root, &key,
							path, 0, 0);
				if (ret < 0)
					goto out;
			}
A
Arne Jansen 已提交
2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025 2026 2027 2028 2029 2030 2031 2032 2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059 2060 2061
		}

		while (1) {
			l = path->nodes[0];
			slot = path->slots[0];
			if (slot >= btrfs_header_nritems(l)) {
				ret = btrfs_next_leaf(root, path);
				if (ret == 0)
					continue;
				if (ret < 0)
					goto out;

				break;
			}
			btrfs_item_key_to_cpu(l, &key, slot);

			if (key.objectid + key.offset <= logical)
				goto next;

			if (key.objectid >= logical + map->stripe_len)
				break;

			if (btrfs_key_type(&key) != BTRFS_EXTENT_ITEM_KEY)
				goto next;

			extent = btrfs_item_ptr(l, slot,
						struct btrfs_extent_item);
			flags = btrfs_extent_flags(l, extent);
			generation = btrfs_extent_generation(l, extent);

			if (key.objectid < logical &&
			    (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK)) {
				printk(KERN_ERR
				       "btrfs scrub: tree block %llu spanning "
				       "stripes, ignored. logical=%llu\n",
				       (unsigned long long)key.objectid,
				       (unsigned long long)logical);
				goto next;
			}

			/*
			 * trim extent to this stripe
			 */
			if (key.objectid < logical) {
				key.offset -= logical - key.objectid;
				key.objectid = logical;
			}
			if (key.objectid + key.offset >
			    logical + map->stripe_len) {
				key.offset = logical + map->stripe_len -
					     key.objectid;
			}

2062
			ret = scrub_extent(sctx, key.objectid, key.offset,
A
Arne Jansen 已提交
2063
					   key.objectid - logical + physical,
2064 2065
					   scrub_dev, flags, generation,
					   mirror_num);
A
Arne Jansen 已提交
2066 2067 2068 2069 2070 2071
			if (ret)
				goto out;

next:
			path->slots[0]++;
		}
C
Chris Mason 已提交
2072
		btrfs_release_path(path);
A
Arne Jansen 已提交
2073 2074
		logical += increment;
		physical += map->stripe_len;
2075 2076 2077
		spin_lock(&sctx->stat_lock);
		sctx->stat.last_physical = physical;
		spin_unlock(&sctx->stat_lock);
A
Arne Jansen 已提交
2078 2079
	}
	/* push queued extents */
2080
	scrub_submit(sctx);
A
Arne Jansen 已提交
2081 2082

out:
2083
	blk_finish_plug(&plug);
A
Arne Jansen 已提交
2084 2085 2086 2087
	btrfs_free_path(path);
	return ret < 0 ? ret : 0;
}

2088
static noinline_for_stack int scrub_chunk(struct scrub_ctx *sctx,
2089 2090 2091 2092
					  struct btrfs_device *scrub_dev,
					  u64 chunk_tree, u64 chunk_objectid,
					  u64 chunk_offset, u64 length,
					  u64 dev_offset)
A
Arne Jansen 已提交
2093 2094
{
	struct btrfs_mapping_tree *map_tree =
2095
		&sctx->dev_root->fs_info->mapping_tree;
A
Arne Jansen 已提交
2096 2097 2098 2099 2100 2101 2102 2103 2104 2105 2106 2107 2108 2109 2110 2111 2112 2113 2114 2115
	struct map_lookup *map;
	struct extent_map *em;
	int i;
	int ret = -EINVAL;

	read_lock(&map_tree->map_tree.lock);
	em = lookup_extent_mapping(&map_tree->map_tree, chunk_offset, 1);
	read_unlock(&map_tree->map_tree.lock);

	if (!em)
		return -EINVAL;

	map = (struct map_lookup *)em->bdev;
	if (em->start != chunk_offset)
		goto out;

	if (em->len < length)
		goto out;

	for (i = 0; i < map->num_stripes; ++i) {
2116
		if (map->stripes[i].dev->bdev == scrub_dev->bdev &&
2117
		    map->stripes[i].physical == dev_offset) {
2118 2119
			ret = scrub_stripe(sctx, map, scrub_dev, i,
					   chunk_offset, length);
A
Arne Jansen 已提交
2120 2121 2122 2123 2124 2125 2126 2127 2128 2129 2130
			if (ret)
				goto out;
		}
	}
out:
	free_extent_map(em);

	return ret;
}

static noinline_for_stack
2131 2132
int scrub_enumerate_chunks(struct scrub_ctx *sctx,
			   struct btrfs_device *scrub_dev, u64 start, u64 end)
A
Arne Jansen 已提交
2133 2134 2135
{
	struct btrfs_dev_extent *dev_extent = NULL;
	struct btrfs_path *path;
2136
	struct btrfs_root *root = sctx->dev_root;
A
Arne Jansen 已提交
2137 2138 2139 2140 2141 2142 2143 2144 2145 2146 2147 2148 2149 2150 2151 2152 2153 2154 2155 2156
	struct btrfs_fs_info *fs_info = root->fs_info;
	u64 length;
	u64 chunk_tree;
	u64 chunk_objectid;
	u64 chunk_offset;
	int ret;
	int slot;
	struct extent_buffer *l;
	struct btrfs_key key;
	struct btrfs_key found_key;
	struct btrfs_block_group_cache *cache;

	path = btrfs_alloc_path();
	if (!path)
		return -ENOMEM;

	path->reada = 2;
	path->search_commit_root = 1;
	path->skip_locking = 1;

2157
	key.objectid = scrub_dev->devid;
A
Arne Jansen 已提交
2158 2159 2160 2161 2162 2163
	key.offset = 0ull;
	key.type = BTRFS_DEV_EXTENT_KEY;

	while (1) {
		ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
		if (ret < 0)
2164 2165 2166 2167 2168 2169 2170 2171 2172
			break;
		if (ret > 0) {
			if (path->slots[0] >=
			    btrfs_header_nritems(path->nodes[0])) {
				ret = btrfs_next_leaf(root, path);
				if (ret)
					break;
			}
		}
A
Arne Jansen 已提交
2173 2174 2175 2176 2177 2178

		l = path->nodes[0];
		slot = path->slots[0];

		btrfs_item_key_to_cpu(l, &found_key, slot);

2179
		if (found_key.objectid != scrub_dev->devid)
A
Arne Jansen 已提交
2180 2181
			break;

2182
		if (btrfs_key_type(&found_key) != BTRFS_DEV_EXTENT_KEY)
A
Arne Jansen 已提交
2183 2184 2185 2186 2187 2188 2189 2190 2191 2192 2193 2194 2195
			break;

		if (found_key.offset >= end)
			break;

		if (found_key.offset < key.offset)
			break;

		dev_extent = btrfs_item_ptr(l, slot, struct btrfs_dev_extent);
		length = btrfs_dev_extent_length(l, dev_extent);

		if (found_key.offset + length <= start) {
			key.offset = found_key.offset + length;
C
Chris Mason 已提交
2196
			btrfs_release_path(path);
A
Arne Jansen 已提交
2197 2198 2199 2200 2201 2202 2203 2204 2205 2206 2207 2208 2209 2210
			continue;
		}

		chunk_tree = btrfs_dev_extent_chunk_tree(l, dev_extent);
		chunk_objectid = btrfs_dev_extent_chunk_objectid(l, dev_extent);
		chunk_offset = btrfs_dev_extent_chunk_offset(l, dev_extent);

		/*
		 * get a reference on the corresponding block group to prevent
		 * the chunk from going away while we scrub it
		 */
		cache = btrfs_lookup_block_group(fs_info, chunk_offset);
		if (!cache) {
			ret = -ENOENT;
2211
			break;
A
Arne Jansen 已提交
2212
		}
2213
		ret = scrub_chunk(sctx, scrub_dev, chunk_tree, chunk_objectid,
2214
				  chunk_offset, length, found_key.offset);
A
Arne Jansen 已提交
2215 2216 2217 2218 2219
		btrfs_put_block_group(cache);
		if (ret)
			break;

		key.offset = found_key.offset + length;
C
Chris Mason 已提交
2220
		btrfs_release_path(path);
A
Arne Jansen 已提交
2221 2222 2223
	}

	btrfs_free_path(path);
2224 2225 2226 2227 2228 2229

	/*
	 * ret can still be 1 from search_slot or next_leaf,
	 * that's not an error
	 */
	return ret < 0 ? ret : 0;
A
Arne Jansen 已提交
2230 2231
}

2232 2233
static noinline_for_stack int scrub_supers(struct scrub_ctx *sctx,
					   struct btrfs_device *scrub_dev)
A
Arne Jansen 已提交
2234 2235 2236 2237 2238
{
	int	i;
	u64	bytenr;
	u64	gen;
	int	ret;
2239
	struct btrfs_root *root = sctx->dev_root;
A
Arne Jansen 已提交
2240

2241 2242 2243
	if (root->fs_info->fs_state & BTRFS_SUPER_FLAG_ERROR)
		return -EIO;

A
Arne Jansen 已提交
2244 2245 2246 2247
	gen = root->fs_info->last_trans_committed;

	for (i = 0; i < BTRFS_SUPER_MIRROR_MAX; i++) {
		bytenr = btrfs_sb_offset(i);
2248
		if (bytenr + BTRFS_SUPER_INFO_SIZE > scrub_dev->total_bytes)
A
Arne Jansen 已提交
2249 2250
			break;

2251
		ret = scrub_pages(sctx, bytenr, BTRFS_SUPER_INFO_SIZE, bytenr,
2252 2253
				  scrub_dev, BTRFS_EXTENT_FLAG_SUPER, gen, i,
				  NULL, 1);
A
Arne Jansen 已提交
2254 2255 2256
		if (ret)
			return ret;
	}
2257
	wait_event(sctx->list_wait, atomic_read(&sctx->bios_in_flight) == 0);
A
Arne Jansen 已提交
2258 2259 2260 2261 2262 2263 2264 2265 2266 2267

	return 0;
}

/*
 * get a reference count on fs_info->scrub_workers. start worker if necessary
 */
static noinline_for_stack int scrub_workers_get(struct btrfs_root *root)
{
	struct btrfs_fs_info *fs_info = root->fs_info;
2268
	int ret = 0;
A
Arne Jansen 已提交
2269 2270

	mutex_lock(&fs_info->scrub_lock);
A
Arne Jansen 已提交
2271 2272 2273 2274
	if (fs_info->scrub_workers_refcnt == 0) {
		btrfs_init_workers(&fs_info->scrub_workers, "scrub",
			   fs_info->thread_pool_size, &fs_info->generic_worker);
		fs_info->scrub_workers.idle_thresh = 4;
2275 2276 2277
		ret = btrfs_start_workers(&fs_info->scrub_workers);
		if (ret)
			goto out;
A
Arne Jansen 已提交
2278
	}
A
Arne Jansen 已提交
2279
	++fs_info->scrub_workers_refcnt;
2280
out:
A
Arne Jansen 已提交
2281 2282
	mutex_unlock(&fs_info->scrub_lock);

2283
	return ret;
A
Arne Jansen 已提交
2284 2285 2286 2287 2288 2289 2290 2291 2292 2293 2294 2295 2296 2297 2298
}

static noinline_for_stack void scrub_workers_put(struct btrfs_root *root)
{
	struct btrfs_fs_info *fs_info = root->fs_info;

	mutex_lock(&fs_info->scrub_lock);
	if (--fs_info->scrub_workers_refcnt == 0)
		btrfs_stop_workers(&fs_info->scrub_workers);
	WARN_ON(fs_info->scrub_workers_refcnt < 0);
	mutex_unlock(&fs_info->scrub_lock);
}


int btrfs_scrub_dev(struct btrfs_root *root, u64 devid, u64 start, u64 end,
A
Arne Jansen 已提交
2299
		    struct btrfs_scrub_progress *progress, int readonly)
A
Arne Jansen 已提交
2300
{
2301
	struct scrub_ctx *sctx;
A
Arne Jansen 已提交
2302 2303 2304 2305
	struct btrfs_fs_info *fs_info = root->fs_info;
	int ret;
	struct btrfs_device *dev;

2306
	if (btrfs_fs_closing(root->fs_info))
A
Arne Jansen 已提交
2307 2308 2309 2310 2311
		return -EINVAL;

	/*
	 * check some assumptions
	 */
2312 2313 2314 2315 2316 2317 2318 2319 2320 2321 2322 2323 2324 2325 2326 2327 2328 2329 2330 2331 2332 2333 2334 2335
	if (root->nodesize != root->leafsize) {
		printk(KERN_ERR
		       "btrfs_scrub: size assumption nodesize == leafsize (%d == %d) fails\n",
		       root->nodesize, root->leafsize);
		return -EINVAL;
	}

	if (root->nodesize > BTRFS_STRIPE_LEN) {
		/*
		 * in this case scrub is unable to calculate the checksum
		 * the way scrub is implemented. Do not handle this
		 * situation at all because it won't ever happen.
		 */
		printk(KERN_ERR
		       "btrfs_scrub: size assumption nodesize <= BTRFS_STRIPE_LEN (%d <= %d) fails\n",
		       root->nodesize, BTRFS_STRIPE_LEN);
		return -EINVAL;
	}

	if (root->sectorsize != PAGE_SIZE) {
		/* not supported for data w/o checksums */
		printk(KERN_ERR
		       "btrfs_scrub: size assumption sectorsize != PAGE_SIZE (%d != %lld) fails\n",
		       root->sectorsize, (unsigned long long)PAGE_SIZE);
A
Arne Jansen 已提交
2336 2337 2338
		return -EINVAL;
	}

2339 2340 2341 2342 2343 2344 2345 2346 2347 2348 2349 2350 2351 2352 2353 2354
	if (fs_info->chunk_root->nodesize >
	    PAGE_SIZE * SCRUB_MAX_PAGES_PER_BLOCK ||
	    fs_info->chunk_root->sectorsize >
	    PAGE_SIZE * SCRUB_MAX_PAGES_PER_BLOCK) {
		/*
		 * would exhaust the array bounds of pagev member in
		 * struct scrub_block
		 */
		pr_err("btrfs_scrub: size assumption nodesize and sectorsize <= SCRUB_MAX_PAGES_PER_BLOCK (%d <= %d && %d <= %d) fails\n",
		       fs_info->chunk_root->nodesize,
		       SCRUB_MAX_PAGES_PER_BLOCK,
		       fs_info->chunk_root->sectorsize,
		       SCRUB_MAX_PAGES_PER_BLOCK);
		return -EINVAL;
	}

A
Arne Jansen 已提交
2355 2356 2357 2358 2359 2360 2361 2362 2363 2364 2365 2366 2367 2368 2369 2370 2371 2372 2373 2374 2375 2376 2377 2378 2379 2380
	ret = scrub_workers_get(root);
	if (ret)
		return ret;

	mutex_lock(&root->fs_info->fs_devices->device_list_mutex);
	dev = btrfs_find_device(root, devid, NULL, NULL);
	if (!dev || dev->missing) {
		mutex_unlock(&root->fs_info->fs_devices->device_list_mutex);
		scrub_workers_put(root);
		return -ENODEV;
	}
	mutex_lock(&fs_info->scrub_lock);

	if (!dev->in_fs_metadata) {
		mutex_unlock(&fs_info->scrub_lock);
		mutex_unlock(&root->fs_info->fs_devices->device_list_mutex);
		scrub_workers_put(root);
		return -ENODEV;
	}

	if (dev->scrub_device) {
		mutex_unlock(&fs_info->scrub_lock);
		mutex_unlock(&root->fs_info->fs_devices->device_list_mutex);
		scrub_workers_put(root);
		return -EINPROGRESS;
	}
2381 2382
	sctx = scrub_setup_ctx(dev);
	if (IS_ERR(sctx)) {
A
Arne Jansen 已提交
2383 2384 2385
		mutex_unlock(&fs_info->scrub_lock);
		mutex_unlock(&root->fs_info->fs_devices->device_list_mutex);
		scrub_workers_put(root);
2386
		return PTR_ERR(sctx);
A
Arne Jansen 已提交
2387
	}
2388 2389
	sctx->readonly = readonly;
	dev->scrub_device = sctx;
A
Arne Jansen 已提交
2390 2391 2392 2393 2394 2395

	atomic_inc(&fs_info->scrubs_running);
	mutex_unlock(&fs_info->scrub_lock);
	mutex_unlock(&root->fs_info->fs_devices->device_list_mutex);

	down_read(&fs_info->scrub_super_lock);
2396
	ret = scrub_supers(sctx, dev);
A
Arne Jansen 已提交
2397 2398 2399
	up_read(&fs_info->scrub_super_lock);

	if (!ret)
2400
		ret = scrub_enumerate_chunks(sctx, dev, start, end);
A
Arne Jansen 已提交
2401

2402
	wait_event(sctx->list_wait, atomic_read(&sctx->bios_in_flight) == 0);
A
Arne Jansen 已提交
2403 2404 2405
	atomic_dec(&fs_info->scrubs_running);
	wake_up(&fs_info->scrub_pause_wait);

2406
	wait_event(sctx->list_wait, atomic_read(&sctx->workers_pending) == 0);
2407

A
Arne Jansen 已提交
2408
	if (progress)
2409
		memcpy(progress, &sctx->stat, sizeof(*progress));
A
Arne Jansen 已提交
2410 2411 2412 2413 2414

	mutex_lock(&fs_info->scrub_lock);
	dev->scrub_device = NULL;
	mutex_unlock(&fs_info->scrub_lock);

2415
	scrub_free_ctx(sctx);
A
Arne Jansen 已提交
2416 2417 2418 2419 2420
	scrub_workers_put(root);

	return ret;
}

2421
void btrfs_scrub_pause(struct btrfs_root *root)
A
Arne Jansen 已提交
2422 2423 2424 2425 2426 2427 2428 2429 2430 2431 2432 2433 2434 2435 2436 2437
{
	struct btrfs_fs_info *fs_info = root->fs_info;

	mutex_lock(&fs_info->scrub_lock);
	atomic_inc(&fs_info->scrub_pause_req);
	while (atomic_read(&fs_info->scrubs_paused) !=
	       atomic_read(&fs_info->scrubs_running)) {
		mutex_unlock(&fs_info->scrub_lock);
		wait_event(fs_info->scrub_pause_wait,
			   atomic_read(&fs_info->scrubs_paused) ==
			   atomic_read(&fs_info->scrubs_running));
		mutex_lock(&fs_info->scrub_lock);
	}
	mutex_unlock(&fs_info->scrub_lock);
}

2438
void btrfs_scrub_continue(struct btrfs_root *root)
A
Arne Jansen 已提交
2439 2440 2441 2442 2443 2444 2445
{
	struct btrfs_fs_info *fs_info = root->fs_info;

	atomic_dec(&fs_info->scrub_pause_req);
	wake_up(&fs_info->scrub_pause_wait);
}

2446
void btrfs_scrub_pause_super(struct btrfs_root *root)
A
Arne Jansen 已提交
2447 2448 2449 2450
{
	down_write(&root->fs_info->scrub_super_lock);
}

2451
void btrfs_scrub_continue_super(struct btrfs_root *root)
A
Arne Jansen 已提交
2452 2453 2454 2455
{
	up_write(&root->fs_info->scrub_super_lock);
}

2456
int __btrfs_scrub_cancel(struct btrfs_fs_info *fs_info)
A
Arne Jansen 已提交
2457 2458 2459 2460 2461 2462 2463 2464 2465 2466 2467 2468 2469 2470 2471 2472 2473 2474 2475 2476 2477
{

	mutex_lock(&fs_info->scrub_lock);
	if (!atomic_read(&fs_info->scrubs_running)) {
		mutex_unlock(&fs_info->scrub_lock);
		return -ENOTCONN;
	}

	atomic_inc(&fs_info->scrub_cancel_req);
	while (atomic_read(&fs_info->scrubs_running)) {
		mutex_unlock(&fs_info->scrub_lock);
		wait_event(fs_info->scrub_pause_wait,
			   atomic_read(&fs_info->scrubs_running) == 0);
		mutex_lock(&fs_info->scrub_lock);
	}
	atomic_dec(&fs_info->scrub_cancel_req);
	mutex_unlock(&fs_info->scrub_lock);

	return 0;
}

2478 2479 2480 2481 2482
int btrfs_scrub_cancel(struct btrfs_root *root)
{
	return __btrfs_scrub_cancel(root->fs_info);
}

A
Arne Jansen 已提交
2483 2484 2485
int btrfs_scrub_cancel_dev(struct btrfs_root *root, struct btrfs_device *dev)
{
	struct btrfs_fs_info *fs_info = root->fs_info;
2486
	struct scrub_ctx *sctx;
A
Arne Jansen 已提交
2487 2488

	mutex_lock(&fs_info->scrub_lock);
2489 2490
	sctx = dev->scrub_device;
	if (!sctx) {
A
Arne Jansen 已提交
2491 2492 2493
		mutex_unlock(&fs_info->scrub_lock);
		return -ENOTCONN;
	}
2494
	atomic_inc(&sctx->cancel_req);
A
Arne Jansen 已提交
2495 2496 2497 2498 2499 2500 2501 2502 2503 2504
	while (dev->scrub_device) {
		mutex_unlock(&fs_info->scrub_lock);
		wait_event(fs_info->scrub_pause_wait,
			   dev->scrub_device == NULL);
		mutex_lock(&fs_info->scrub_lock);
	}
	mutex_unlock(&fs_info->scrub_lock);

	return 0;
}
S
Stefan Behrens 已提交
2505

A
Arne Jansen 已提交
2506 2507 2508 2509 2510 2511 2512 2513 2514 2515 2516 2517 2518 2519 2520 2521 2522 2523 2524 2525 2526 2527 2528 2529 2530 2531
int btrfs_scrub_cancel_devid(struct btrfs_root *root, u64 devid)
{
	struct btrfs_fs_info *fs_info = root->fs_info;
	struct btrfs_device *dev;
	int ret;

	/*
	 * we have to hold the device_list_mutex here so the device
	 * does not go away in cancel_dev. FIXME: find a better solution
	 */
	mutex_lock(&fs_info->fs_devices->device_list_mutex);
	dev = btrfs_find_device(root, devid, NULL, NULL);
	if (!dev) {
		mutex_unlock(&fs_info->fs_devices->device_list_mutex);
		return -ENODEV;
	}
	ret = btrfs_scrub_cancel_dev(root, dev);
	mutex_unlock(&fs_info->fs_devices->device_list_mutex);

	return ret;
}

int btrfs_scrub_progress(struct btrfs_root *root, u64 devid,
			 struct btrfs_scrub_progress *progress)
{
	struct btrfs_device *dev;
2532
	struct scrub_ctx *sctx = NULL;
A
Arne Jansen 已提交
2533 2534 2535 2536

	mutex_lock(&root->fs_info->fs_devices->device_list_mutex);
	dev = btrfs_find_device(root, devid, NULL, NULL);
	if (dev)
2537 2538 2539
		sctx = dev->scrub_device;
	if (sctx)
		memcpy(progress, &sctx->stat, sizeof(*progress));
A
Arne Jansen 已提交
2540 2541
	mutex_unlock(&root->fs_info->fs_devices->device_list_mutex);

2542
	return dev ? (sctx ? 0 : -ENOTCONN) : -ENODEV;
A
Arne Jansen 已提交
2543
}