scrub.c 114.5 KB
Newer Older
1
// SPDX-License-Identifier: GPL-2.0
A
Arne Jansen 已提交
2
/*
3
 * Copyright (C) 2011, 2012 STRATO.  All rights reserved.
A
Arne Jansen 已提交
4 5 6
 */

#include <linux/blkdev.h>
7
#include <linux/ratelimit.h>
8
#include <linux/sched/mm.h>
9
#include <crypto/hash.h>
A
Arne Jansen 已提交
10
#include "ctree.h"
11
#include "discard.h"
A
Arne Jansen 已提交
12 13 14
#include "volumes.h"
#include "disk-io.h"
#include "ordered-data.h"
15
#include "transaction.h"
16
#include "backref.h"
17
#include "extent_io.h"
18
#include "dev-replace.h"
19
#include "check-integrity.h"
20
#include "rcu-string.h"
D
David Woodhouse 已提交
21
#include "raid56.h"
22
#include "block-group.h"
23
#include "zoned.h"
A
Arne Jansen 已提交
24 25 26 27 28 29 30 31 32 33 34 35 36 37

/*
 * 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
 */

38
struct scrub_block;
39
struct scrub_ctx;
A
Arne Jansen 已提交
40

41
/*
42 43
 * The following three values only influence the performance.
 *
44
 * The last one configures the number of parallel and outstanding I/O
45
 * operations. The first one configures an upper limit for the number
46 47
 * of (dynamically allocated) pages that are added to a bio.
 */
48 49
#define SCRUB_SECTORS_PER_BIO	32	/* 128KiB per bio for 4KiB pages */
#define SCRUB_BIOS_PER_SCTX	64	/* 8MiB per device in flight for 4KiB pages */
50 51

/*
52
 * The following value times PAGE_SIZE needs to be large enough to match the
53 54
 * largest node/leaf/sector size that shall be supported.
 */
55
#define SCRUB_MAX_SECTORS_PER_BLOCK	(BTRFS_MAX_METADATA_BLOCKSIZE / SZ_4K)
A
Arne Jansen 已提交
56

57
struct scrub_recover {
58
	refcount_t		refs;
59
	struct btrfs_io_context	*bioc;
60 61 62
	u64			map_length;
};

63
struct scrub_sector {
64 65
	struct scrub_block	*sblock;
	struct page		*page;
66
	struct btrfs_device	*dev;
67
	struct list_head	list;
A
Arne Jansen 已提交
68 69
	u64			flags;  /* extent flags */
	u64			generation;
70 71
	u64			logical;
	u64			physical;
72
	u64			physical_for_dev_replace;
73
	atomic_t		refs;
74
	u8			mirror_num;
75 76
	unsigned int		have_csum:1;
	unsigned int		io_error:1;
A
Arne Jansen 已提交
77
	u8			csum[BTRFS_CSUM_SIZE];
78 79

	struct scrub_recover	*recover;
A
Arne Jansen 已提交
80 81 82 83
};

struct scrub_bio {
	int			index;
84
	struct scrub_ctx	*sctx;
85
	struct btrfs_device	*dev;
A
Arne Jansen 已提交
86
	struct bio		*bio;
87
	blk_status_t		status;
A
Arne Jansen 已提交
88 89
	u64			logical;
	u64			physical;
90 91
	struct scrub_sector	*sectors[SCRUB_SECTORS_PER_BIO];
	int			sector_count;
A
Arne Jansen 已提交
92
	int			next_free;
93
	struct work_struct	work;
A
Arne Jansen 已提交
94 95
};

96
struct scrub_block {
97
	struct scrub_sector	*sectors[SCRUB_MAX_SECTORS_PER_BLOCK];
98
	int			sector_count;
99
	atomic_t		outstanding_sectors;
100
	refcount_t		refs; /* free mem on transition to zero */
101
	struct scrub_ctx	*sctx;
102
	struct scrub_parity	*sparity;
103 104 105 106
	struct {
		unsigned int	header_error:1;
		unsigned int	checksum_error:1;
		unsigned int	no_io_error_seen:1;
107
		unsigned int	generation_error:1; /* also sets header_error */
108 109 110 111

		/* The following is for the data used to check parity */
		/* It is for the data with checksum */
		unsigned int	data_corrected:1;
112
	};
113
	struct work_struct	work;
114 115
};

116 117 118 119 120 121 122 123 124 125 126 127
/* Used for the chunks with parity stripe such RAID5/6 */
struct scrub_parity {
	struct scrub_ctx	*sctx;

	struct btrfs_device	*scrub_dev;

	u64			logic_start;

	u64			logic_end;

	int			nsectors;

128
	u32			stripe_len;
129

130
	refcount_t		refs;
131

132
	struct list_head	sectors_list;
133 134

	/* Work of parity check and repair */
135
	struct work_struct	work;
136 137 138 139 140 141 142 143 144 145

	/* Mark the parity blocks which have data */
	unsigned long		*dbitmap;

	/*
	 * Mark the parity blocks which have data, but errors happen when
	 * read data or check data
	 */
	unsigned long		*ebitmap;

146
	unsigned long		bitmap[];
147 148
};

149
struct scrub_ctx {
150
	struct scrub_bio	*bios[SCRUB_BIOS_PER_SCTX];
151
	struct btrfs_fs_info	*fs_info;
A
Arne Jansen 已提交
152 153
	int			first_free;
	int			curr;
154 155
	atomic_t		bios_in_flight;
	atomic_t		workers_pending;
A
Arne Jansen 已提交
156 157 158 159
	spinlock_t		list_lock;
	wait_queue_head_t	list_wait;
	struct list_head	csum_list;
	atomic_t		cancel_req;
A
Arne Jansen 已提交
160
	int			readonly;
161
	int			sectors_per_bio;
162

163 164 165 166
	/* State of IO submission throttling affecting the associated device */
	ktime_t			throttle_deadline;
	u64			throttle_sent;

167
	int			is_dev_replace;
168
	u64			write_pointer;
169 170 171 172

	struct scrub_bio        *wr_curr_bio;
	struct mutex            wr_lock;
	struct btrfs_device     *wr_tgtdev;
173
	bool                    flush_all_writes;
174

A
Arne Jansen 已提交
175 176 177 178 179
	/*
	 * statistics
	 */
	struct btrfs_scrub_progress stat;
	spinlock_t		stat_lock;
180 181 182 183 184 185 186 187

	/*
	 * Use a ref counter to avoid use-after-free issues. Scrub workers
	 * decrement bios_in_flight and workers_pending and then do a wakeup
	 * on the list_wait wait queue. We must ensure the main scrub task
	 * doesn't free the scrub context before or while the workers are
	 * doing the wakeup() call.
	 */
188
	refcount_t              refs;
A
Arne Jansen 已提交
189 190
};

191 192 193 194
struct scrub_warning {
	struct btrfs_path	*path;
	u64			extent_item_size;
	const char		*errstr;
D
David Sterba 已提交
195
	u64			physical;
196 197 198 199
	u64			logical;
	struct btrfs_device	*dev;
};

200 201 202 203 204 205 206
struct full_stripe_lock {
	struct rb_node node;
	u64 logical;
	u64 refs;
	struct mutex mutex;
};

207
static int scrub_setup_recheck_block(struct scrub_block *original_sblock,
208
				     struct scrub_block *sblocks_for_recheck);
209
static void scrub_recheck_block(struct btrfs_fs_info *fs_info,
210 211
				struct scrub_block *sblock,
				int retry_failed_mirror);
212
static void scrub_recheck_block_checksum(struct scrub_block *sblock);
213
static int scrub_repair_block_from_good_copy(struct scrub_block *sblock_bad,
214
					     struct scrub_block *sblock_good);
215
static int scrub_repair_sector_from_good_copy(struct scrub_block *sblock_bad,
216
					    struct scrub_block *sblock_good,
217
					    int sector_num, int force_write);
218
static void scrub_write_block_to_dev_replace(struct scrub_block *sblock);
219 220
static int scrub_write_sector_to_dev_replace(struct scrub_block *sblock,
					     int sector_num);
221 222 223 224
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_put(struct scrub_block *sblock);
225 226
static void scrub_sector_get(struct scrub_sector *sector);
static void scrub_sector_put(struct scrub_sector *sector);
227 228
static void scrub_parity_get(struct scrub_parity *sparity);
static void scrub_parity_put(struct scrub_parity *sparity);
229 230 231 232
static int scrub_sectors(struct scrub_ctx *sctx, u64 logical, u32 len,
			 u64 physical, struct btrfs_device *dev, u64 flags,
			 u64 gen, int mirror_num, u8 *csum,
			 u64 physical_for_dev_replace);
233
static void scrub_bio_end_io(struct bio *bio);
234
static void scrub_bio_end_io_worker(struct work_struct *work);
235
static void scrub_block_complete(struct scrub_block *sblock);
236
static void scrub_remap_extent(struct btrfs_fs_info *fs_info,
237
			       u64 extent_logical, u32 extent_len,
238 239 240
			       u64 *extent_physical,
			       struct btrfs_device **extent_dev,
			       int *extent_mirror_num);
241 242
static int scrub_add_sector_to_wr_bio(struct scrub_ctx *sctx,
				      struct scrub_sector *sector);
243
static void scrub_wr_submit(struct scrub_ctx *sctx);
244
static void scrub_wr_bio_end_io(struct bio *bio);
245
static void scrub_wr_bio_end_io_worker(struct work_struct *work);
246
static void scrub_put_ctx(struct scrub_ctx *sctx);
S
Stefan Behrens 已提交
247

248
static inline int scrub_is_page_on_raid56(struct scrub_sector *sector)
249
{
250 251
	return sector->recover &&
	       (sector->recover->bioc->map_type & BTRFS_BLOCK_GROUP_RAID56_MASK);
252
}
S
Stefan Behrens 已提交
253

254 255
static void scrub_pending_bio_inc(struct scrub_ctx *sctx)
{
256
	refcount_inc(&sctx->refs);
257 258 259 260 261 262 263
	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);
264
	scrub_put_ctx(sctx);
265 266
}

267
static void __scrub_blocked_if_needed(struct btrfs_fs_info *fs_info)
268 269 270 271 272 273 274 275 276
{
	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);
	}
}

277
static void scrub_pause_on(struct btrfs_fs_info *fs_info)
278 279 280
{
	atomic_inc(&fs_info->scrubs_paused);
	wake_up(&fs_info->scrub_pause_wait);
281
}
282

283 284
static void scrub_pause_off(struct btrfs_fs_info *fs_info)
{
285 286 287 288 289 290 291 292
	mutex_lock(&fs_info->scrub_lock);
	__scrub_blocked_if_needed(fs_info);
	atomic_dec(&fs_info->scrubs_paused);
	mutex_unlock(&fs_info->scrub_lock);

	wake_up(&fs_info->scrub_pause_wait);
}

293 294 295 296 297 298
static void scrub_blocked_if_needed(struct btrfs_fs_info *fs_info)
{
	scrub_pause_on(fs_info);
	scrub_pause_off(fs_info);
}

299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317
/*
 * Insert new full stripe lock into full stripe locks tree
 *
 * Return pointer to existing or newly inserted full_stripe_lock structure if
 * everything works well.
 * Return ERR_PTR(-ENOMEM) if we failed to allocate memory
 *
 * NOTE: caller must hold full_stripe_locks_root->lock before calling this
 * function
 */
static struct full_stripe_lock *insert_full_stripe_lock(
		struct btrfs_full_stripe_locks_tree *locks_root,
		u64 fstripe_logical)
{
	struct rb_node **p;
	struct rb_node *parent = NULL;
	struct full_stripe_lock *entry;
	struct full_stripe_lock *ret;

318
	lockdep_assert_held(&locks_root->lock);
319 320 321 322 323 324 325 326 327 328 329 330 331 332 333

	p = &locks_root->root.rb_node;
	while (*p) {
		parent = *p;
		entry = rb_entry(parent, struct full_stripe_lock, node);
		if (fstripe_logical < entry->logical) {
			p = &(*p)->rb_left;
		} else if (fstripe_logical > entry->logical) {
			p = &(*p)->rb_right;
		} else {
			entry->refs++;
			return entry;
		}
	}

334 335 336
	/*
	 * Insert new lock.
	 */
337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361
	ret = kmalloc(sizeof(*ret), GFP_KERNEL);
	if (!ret)
		return ERR_PTR(-ENOMEM);
	ret->logical = fstripe_logical;
	ret->refs = 1;
	mutex_init(&ret->mutex);

	rb_link_node(&ret->node, parent, p);
	rb_insert_color(&ret->node, &locks_root->root);
	return ret;
}

/*
 * Search for a full stripe lock of a block group
 *
 * Return pointer to existing full stripe lock if found
 * Return NULL if not found
 */
static struct full_stripe_lock *search_full_stripe_lock(
		struct btrfs_full_stripe_locks_tree *locks_root,
		u64 fstripe_logical)
{
	struct rb_node *node;
	struct full_stripe_lock *entry;

362
	lockdep_assert_held(&locks_root->lock);
363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381

	node = locks_root->root.rb_node;
	while (node) {
		entry = rb_entry(node, struct full_stripe_lock, node);
		if (fstripe_logical < entry->logical)
			node = node->rb_left;
		else if (fstripe_logical > entry->logical)
			node = node->rb_right;
		else
			return entry;
	}
	return NULL;
}

/*
 * Helper to get full stripe logical from a normal bytenr.
 *
 * Caller must ensure @cache is a RAID56 block group.
 */
382
static u64 get_full_stripe_logical(struct btrfs_block_group *cache, u64 bytenr)
383 384 385 386 387 388 389 390 391 392 393 394 395
{
	u64 ret;

	/*
	 * Due to chunk item size limit, full stripe length should not be
	 * larger than U32_MAX. Just a sanity check here.
	 */
	WARN_ON_ONCE(cache->full_stripe_len >= U32_MAX);

	/*
	 * round_down() can only handle power of 2, while RAID56 full
	 * stripe length can be 64KiB * n, so we need to manually round down.
	 */
396 397
	ret = div64_u64(bytenr - cache->start, cache->full_stripe_len) *
			cache->full_stripe_len + cache->start;
398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414
	return ret;
}

/*
 * Lock a full stripe to avoid concurrency of recovery and read
 *
 * It's only used for profiles with parities (RAID5/6), for other profiles it
 * does nothing.
 *
 * Return 0 if we locked full stripe covering @bytenr, with a mutex held.
 * So caller must call unlock_full_stripe() at the same context.
 *
 * Return <0 if encounters error.
 */
static int lock_full_stripe(struct btrfs_fs_info *fs_info, u64 bytenr,
			    bool *locked_ret)
{
415
	struct btrfs_block_group *bg_cache;
416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461
	struct btrfs_full_stripe_locks_tree *locks_root;
	struct full_stripe_lock *existing;
	u64 fstripe_start;
	int ret = 0;

	*locked_ret = false;
	bg_cache = btrfs_lookup_block_group(fs_info, bytenr);
	if (!bg_cache) {
		ASSERT(0);
		return -ENOENT;
	}

	/* Profiles not based on parity don't need full stripe lock */
	if (!(bg_cache->flags & BTRFS_BLOCK_GROUP_RAID56_MASK))
		goto out;
	locks_root = &bg_cache->full_stripe_locks_root;

	fstripe_start = get_full_stripe_logical(bg_cache, bytenr);

	/* Now insert the full stripe lock */
	mutex_lock(&locks_root->lock);
	existing = insert_full_stripe_lock(locks_root, fstripe_start);
	mutex_unlock(&locks_root->lock);
	if (IS_ERR(existing)) {
		ret = PTR_ERR(existing);
		goto out;
	}
	mutex_lock(&existing->mutex);
	*locked_ret = true;
out:
	btrfs_put_block_group(bg_cache);
	return ret;
}

/*
 * Unlock a full stripe.
 *
 * NOTE: Caller must ensure it's the same context calling corresponding
 * lock_full_stripe().
 *
 * Return 0 if we unlock full stripe without problem.
 * Return <0 for error
 */
static int unlock_full_stripe(struct btrfs_fs_info *fs_info, u64 bytenr,
			      bool locked)
{
462
	struct btrfs_block_group *bg_cache;
463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515
	struct btrfs_full_stripe_locks_tree *locks_root;
	struct full_stripe_lock *fstripe_lock;
	u64 fstripe_start;
	bool freeit = false;
	int ret = 0;

	/* If we didn't acquire full stripe lock, no need to continue */
	if (!locked)
		return 0;

	bg_cache = btrfs_lookup_block_group(fs_info, bytenr);
	if (!bg_cache) {
		ASSERT(0);
		return -ENOENT;
	}
	if (!(bg_cache->flags & BTRFS_BLOCK_GROUP_RAID56_MASK))
		goto out;

	locks_root = &bg_cache->full_stripe_locks_root;
	fstripe_start = get_full_stripe_logical(bg_cache, bytenr);

	mutex_lock(&locks_root->lock);
	fstripe_lock = search_full_stripe_lock(locks_root, fstripe_start);
	/* Unpaired unlock_full_stripe() detected */
	if (!fstripe_lock) {
		WARN_ON(1);
		ret = -ENOENT;
		mutex_unlock(&locks_root->lock);
		goto out;
	}

	if (fstripe_lock->refs == 0) {
		WARN_ON(1);
		btrfs_warn(fs_info, "full stripe lock at %llu refcount underflow",
			fstripe_lock->logical);
	} else {
		fstripe_lock->refs--;
	}

	if (fstripe_lock->refs == 0) {
		rb_erase(&fstripe_lock->node, &locks_root->root);
		freeit = true;
	}
	mutex_unlock(&locks_root->lock);

	mutex_unlock(&fstripe_lock->mutex);
	if (freeit)
		kfree(fstripe_lock);
out:
	btrfs_put_block_group(bg_cache);
	return ret;
}

516
static void scrub_free_csums(struct scrub_ctx *sctx)
A
Arne Jansen 已提交
517
{
518
	while (!list_empty(&sctx->csum_list)) {
A
Arne Jansen 已提交
519
		struct btrfs_ordered_sum *sum;
520
		sum = list_first_entry(&sctx->csum_list,
A
Arne Jansen 已提交
521 522 523 524 525 526
				       struct btrfs_ordered_sum, list);
		list_del(&sum->list);
		kfree(sum);
	}
}

527
static noinline_for_stack void scrub_free_ctx(struct scrub_ctx *sctx)
A
Arne Jansen 已提交
528 529 530
{
	int i;

531
	if (!sctx)
A
Arne Jansen 已提交
532 533
		return;

534
	/* this can happen when scrub is cancelled */
535 536
	if (sctx->curr != -1) {
		struct scrub_bio *sbio = sctx->bios[sctx->curr];
537

538 539 540
		for (i = 0; i < sbio->sector_count; i++) {
			WARN_ON(!sbio->sectors[i]->page);
			scrub_block_put(sbio->sectors[i]->sblock);
541 542 543 544
		}
		bio_put(sbio->bio);
	}

545
	for (i = 0; i < SCRUB_BIOS_PER_SCTX; ++i) {
546
		struct scrub_bio *sbio = sctx->bios[i];
A
Arne Jansen 已提交
547 548 549 550 551 552

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

553
	kfree(sctx->wr_curr_bio);
554 555
	scrub_free_csums(sctx);
	kfree(sctx);
A
Arne Jansen 已提交
556 557
}

558 559
static void scrub_put_ctx(struct scrub_ctx *sctx)
{
560
	if (refcount_dec_and_test(&sctx->refs))
561 562 563
		scrub_free_ctx(sctx);
}

564 565
static noinline_for_stack struct scrub_ctx *scrub_setup_ctx(
		struct btrfs_fs_info *fs_info, int is_dev_replace)
A
Arne Jansen 已提交
566
{
567
	struct scrub_ctx *sctx;
A
Arne Jansen 已提交
568 569
	int		i;

570
	sctx = kzalloc(sizeof(*sctx), GFP_KERNEL);
571
	if (!sctx)
A
Arne Jansen 已提交
572
		goto nomem;
573
	refcount_set(&sctx->refs, 1);
574
	sctx->is_dev_replace = is_dev_replace;
575
	sctx->sectors_per_bio = SCRUB_SECTORS_PER_BIO;
576
	sctx->curr = -1;
577
	sctx->fs_info = fs_info;
578
	INIT_LIST_HEAD(&sctx->csum_list);
579
	for (i = 0; i < SCRUB_BIOS_PER_SCTX; ++i) {
A
Arne Jansen 已提交
580 581
		struct scrub_bio *sbio;

582
		sbio = kzalloc(sizeof(*sbio), GFP_KERNEL);
A
Arne Jansen 已提交
583 584
		if (!sbio)
			goto nomem;
585
		sctx->bios[i] = sbio;
A
Arne Jansen 已提交
586 587

		sbio->index = i;
588
		sbio->sctx = sctx;
589
		sbio->sector_count = 0;
590
		INIT_WORK(&sbio->work, scrub_bio_end_io_worker);
A
Arne Jansen 已提交
591

592
		if (i != SCRUB_BIOS_PER_SCTX - 1)
593
			sctx->bios[i]->next_free = i + 1;
594
		else
595 596 597
			sctx->bios[i]->next_free = -1;
	}
	sctx->first_free = 0;
598 599
	atomic_set(&sctx->bios_in_flight, 0);
	atomic_set(&sctx->workers_pending, 0);
600 601 602 603 604
	atomic_set(&sctx->cancel_req, 0);

	spin_lock_init(&sctx->list_lock);
	spin_lock_init(&sctx->stat_lock);
	init_waitqueue_head(&sctx->list_wait);
605
	sctx->throttle_deadline = 0;
606

607 608 609
	WARN_ON(sctx->wr_curr_bio != NULL);
	mutex_init(&sctx->wr_lock);
	sctx->wr_curr_bio = NULL;
610
	if (is_dev_replace) {
611 612
		WARN_ON(!fs_info->dev_replace.tgtdev);
		sctx->wr_tgtdev = fs_info->dev_replace.tgtdev;
613
		sctx->flush_all_writes = false;
614
	}
615

616
	return sctx;
A
Arne Jansen 已提交
617 618

nomem:
619
	scrub_free_ctx(sctx);
A
Arne Jansen 已提交
620 621 622
	return ERR_PTR(-ENOMEM);
}

623 624
static int scrub_print_warning_inode(u64 inum, u64 offset, u64 root,
				     void *warn_ctx)
625 626 627 628
{
	u32 nlink;
	int ret;
	int i;
629
	unsigned nofs_flag;
630 631
	struct extent_buffer *eb;
	struct btrfs_inode_item *inode_item;
632
	struct scrub_warning *swarn = warn_ctx;
633
	struct btrfs_fs_info *fs_info = swarn->dev->fs_info;
634 635
	struct inode_fs_paths *ipath = NULL;
	struct btrfs_root *local_root;
636
	struct btrfs_key key;
637

D
David Sterba 已提交
638
	local_root = btrfs_get_fs_root(fs_info, root, true);
639 640 641 642 643
	if (IS_ERR(local_root)) {
		ret = PTR_ERR(local_root);
		goto err;
	}

644 645 646
	/*
	 * this makes the path point to (inum INODE_ITEM ioff)
	 */
647 648 649 650 651
	key.objectid = inum;
	key.type = BTRFS_INODE_ITEM_KEY;
	key.offset = 0;

	ret = btrfs_search_slot(NULL, local_root, &key, swarn->path, 0, 0);
652
	if (ret) {
653
		btrfs_put_root(local_root);
654 655 656 657 658 659 660 661 662 663
		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);
	nlink = btrfs_inode_nlink(eb, inode_item);
	btrfs_release_path(swarn->path);

664 665 666 667 668 669
	/*
	 * init_path might indirectly call vmalloc, or use GFP_KERNEL. Scrub
	 * uses GFP_NOFS in this context, so we keep it consistent but it does
	 * not seem to be strictly necessary.
	 */
	nofs_flag = memalloc_nofs_save();
670
	ipath = init_ipath(4096, local_root, swarn->path);
671
	memalloc_nofs_restore(nofs_flag);
672
	if (IS_ERR(ipath)) {
673
		btrfs_put_root(local_root);
674 675 676 677
		ret = PTR_ERR(ipath);
		ipath = NULL;
		goto err;
	}
678 679 680 681 682 683 684 685 686 687
	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)
J
Jeff Mahoney 已提交
688
		btrfs_warn_in_rcu(fs_info,
689
"%s at logical %llu on dev %s, physical %llu, root %llu, inode %llu, offset %llu, length %u, links %u (path: %s)",
J
Jeff Mahoney 已提交
690 691
				  swarn->errstr, swarn->logical,
				  rcu_str_deref(swarn->dev->name),
D
David Sterba 已提交
692
				  swarn->physical,
J
Jeff Mahoney 已提交
693
				  root, inum, offset,
694
				  fs_info->sectorsize, nlink,
J
Jeff Mahoney 已提交
695
				  (char *)(unsigned long)ipath->fspath->val[i]);
696

697
	btrfs_put_root(local_root);
698 699 700 701
	free_ipath(ipath);
	return 0;

err:
J
Jeff Mahoney 已提交
702
	btrfs_warn_in_rcu(fs_info,
D
David Sterba 已提交
703
			  "%s at logical %llu on dev %s, physical %llu, root %llu, inode %llu, offset %llu: path resolving failed with ret=%d",
J
Jeff Mahoney 已提交
704 705
			  swarn->errstr, swarn->logical,
			  rcu_str_deref(swarn->dev->name),
D
David Sterba 已提交
706
			  swarn->physical,
J
Jeff Mahoney 已提交
707
			  root, inum, offset, ret);
708 709 710 711 712

	free_ipath(ipath);
	return 0;
}

713
static void scrub_print_warning(const char *errstr, struct scrub_block *sblock)
714
{
715 716
	struct btrfs_device *dev;
	struct btrfs_fs_info *fs_info;
717 718 719 720 721
	struct btrfs_path *path;
	struct btrfs_key found_key;
	struct extent_buffer *eb;
	struct btrfs_extent_item *ei;
	struct scrub_warning swarn;
722 723 724
	unsigned long ptr = 0;
	u64 extent_item_pos;
	u64 flags = 0;
725
	u64 ref_root;
726
	u32 item_size;
727
	u8 ref_level = 0;
728
	int ret;
729

730 731
	WARN_ON(sblock->sector_count < 1);
	dev = sblock->sectors[0]->dev;
732
	fs_info = sblock->sctx->fs_info;
733

734
	path = btrfs_alloc_path();
735 736
	if (!path)
		return;
737

738 739
	swarn.physical = sblock->sectors[0]->physical;
	swarn.logical = sblock->sectors[0]->logical;
740
	swarn.errstr = errstr;
741
	swarn.dev = NULL;
742

743 744
	ret = extent_from_logical(fs_info, swarn.logical, path, &found_key,
				  &flags);
745 746 747
	if (ret < 0)
		goto out;

J
Jan Schmidt 已提交
748
	extent_item_pos = swarn.logical - found_key.objectid;
749 750 751 752
	swarn.extent_item_size = found_key.offset;

	eb = path->nodes[0];
	ei = btrfs_item_ptr(eb, path->slots[0], struct btrfs_extent_item);
753
	item_size = btrfs_item_size(eb, path->slots[0]);
754

755
	if (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK) {
756
		do {
757 758 759
			ret = tree_backref_for_extent(&ptr, eb, &found_key, ei,
						      item_size, &ref_root,
						      &ref_level);
760
			btrfs_warn_in_rcu(fs_info,
D
David Sterba 已提交
761
"%s at logical %llu on dev %s, physical %llu: metadata %s (level %d) in tree %llu",
J
Jeff Mahoney 已提交
762
				errstr, swarn.logical,
763
				rcu_str_deref(dev->name),
D
David Sterba 已提交
764
				swarn.physical,
765 766 767 768
				ref_level ? "node" : "leaf",
				ret < 0 ? -1 : ref_level,
				ret < 0 ? -1 : ref_root);
		} while (ret != 1);
769
		btrfs_release_path(path);
770
	} else {
771
		btrfs_release_path(path);
772
		swarn.path = path;
773
		swarn.dev = dev;
774 775
		iterate_extent_inodes(fs_info, found_key.objectid,
					extent_item_pos, 1,
776
					scrub_print_warning_inode, &swarn, false);
777 778 779 780 781 782
	}

out:
	btrfs_free_path(path);
}

783 784
static inline void scrub_get_recover(struct scrub_recover *recover)
{
785
	refcount_inc(&recover->refs);
786 787
}

788 789
static inline void scrub_put_recover(struct btrfs_fs_info *fs_info,
				     struct scrub_recover *recover)
790
{
791
	if (refcount_dec_and_test(&recover->refs)) {
792
		btrfs_bio_counter_dec(fs_info);
793
		btrfs_put_bioc(recover->bioc);
794 795 796 797
		kfree(recover);
	}
}

A
Arne Jansen 已提交
798
/*
799
 * scrub_handle_errored_block gets called when either verification of the
800 801
 * sectors failed or the bio failed to read, e.g. with EIO. In the latter
 * case, this function handles all sectors in the bio, even though only one
802 803 804
 * 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 已提交
805
 */
806
static int scrub_handle_errored_block(struct scrub_block *sblock_to_check)
A
Arne Jansen 已提交
807
{
808
	struct scrub_ctx *sctx = sblock_to_check->sctx;
809
	struct btrfs_device *dev;
810 811 812 813 814 815 816 817 818
	struct btrfs_fs_info *fs_info;
	u64 logical;
	unsigned int failed_mirror_index;
	unsigned int is_metadata;
	unsigned int have_csum;
	struct scrub_block *sblocks_for_recheck; /* holds one for each mirror */
	struct scrub_block *sblock_bad;
	int ret;
	int mirror_index;
819
	int sector_num;
820
	int success;
821
	bool full_stripe_locked;
822
	unsigned int nofs_flag;
823
	static DEFINE_RATELIMIT_STATE(rs, DEFAULT_RATELIMIT_INTERVAL,
824 825
				      DEFAULT_RATELIMIT_BURST);

826
	BUG_ON(sblock_to_check->sector_count < 1);
827
	fs_info = sctx->fs_info;
828
	if (sblock_to_check->sectors[0]->flags & BTRFS_EXTENT_FLAG_SUPER) {
829 830 831 832 833 834 835 836 837 838
		/*
		 * if we find an error in a super block, we just report it.
		 * They will get written with the next transaction commit
		 * anyway
		 */
		spin_lock(&sctx->stat_lock);
		++sctx->stat.super_errors;
		spin_unlock(&sctx->stat_lock);
		return 0;
	}
839 840 841 842
	logical = sblock_to_check->sectors[0]->logical;
	BUG_ON(sblock_to_check->sectors[0]->mirror_num < 1);
	failed_mirror_index = sblock_to_check->sectors[0]->mirror_num - 1;
	is_metadata = !(sblock_to_check->sectors[0]->flags &
843
			BTRFS_EXTENT_FLAG_DATA);
844 845
	have_csum = sblock_to_check->sectors[0]->have_csum;
	dev = sblock_to_check->sectors[0]->dev;
846

847 848
	if (!sctx->is_dev_replace && btrfs_repair_one_zone(fs_info, logical))
		return 0;
849

850 851 852 853 854 855
	/*
	 * We must use GFP_NOFS because the scrub task might be waiting for a
	 * worker task executing this function and in turn a transaction commit
	 * might be waiting the scrub task to pause (which needs to wait for all
	 * the worker tasks to complete before pausing).
	 * We do allocations in the workers through insert_full_stripe_lock()
856
	 * and scrub_add_sector_to_wr_bio(), which happens down the call chain of
857 858 859
	 * this function.
	 */
	nofs_flag = memalloc_nofs_save();
860 861 862 863 864 865 866 867 868
	/*
	 * For RAID5/6, race can happen for a different device scrub thread.
	 * For data corruption, Parity and Data threads will both try
	 * to recovery the data.
	 * Race can lead to doubly added csum error, or even unrecoverable
	 * error.
	 */
	ret = lock_full_stripe(fs_info, logical, &full_stripe_locked);
	if (ret < 0) {
869
		memalloc_nofs_restore(nofs_flag);
870 871 872 873 874 875 876 877 878
		spin_lock(&sctx->stat_lock);
		if (ret == -ENOMEM)
			sctx->stat.malloc_errors++;
		sctx->stat.read_errors++;
		sctx->stat.uncorrectable_errors++;
		spin_unlock(&sctx->stat_lock);
		return ret;
	}

879 880 881 882
	/*
	 * 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,
883
	 * sector by sector this time in order to know which sectors
884 885 886 887
	 * 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
888 889 890 891 892 893 894 895 896 897
	 * sectors from those mirrors without I/O error on the
	 * particular sectors. One example (with blocks >= 2 * sectorsize)
	 * would be that mirror #1 has an I/O error on the first sector,
	 * the second sector is good, and mirror #2 has an I/O error on
	 * the second sector, but the first sector is good.
	 * Then the first sector of the first mirror can be repaired by
	 * taking the first sector of the second mirror, and the
	 * second sector of the second mirror can be repaired by
	 * copying the contents of the 2nd sector of the 1st mirror.
	 * One more note: if the sectors of one mirror contain I/O
898 899 900
	 * 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.
901
	 * Only if this is not possible, the sectors are picked from
902 903 904 905 906 907
	 * 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.
	 */

908
	sblocks_for_recheck = kcalloc(BTRFS_MAX_MIRRORS,
909
				      sizeof(*sblocks_for_recheck), GFP_KERNEL);
910
	if (!sblocks_for_recheck) {
911 912 913 914 915
		spin_lock(&sctx->stat_lock);
		sctx->stat.malloc_errors++;
		sctx->stat.read_errors++;
		sctx->stat.uncorrectable_errors++;
		spin_unlock(&sctx->stat_lock);
916
		btrfs_dev_stat_inc_and_print(dev, BTRFS_DEV_STAT_READ_ERRS);
917
		goto out;
A
Arne Jansen 已提交
918 919
	}

920
	/* Setup the context, map the logical blocks and alloc the sectors */
921
	ret = scrub_setup_recheck_block(sblock_to_check, sblocks_for_recheck);
922
	if (ret) {
923 924 925 926
		spin_lock(&sctx->stat_lock);
		sctx->stat.read_errors++;
		sctx->stat.uncorrectable_errors++;
		spin_unlock(&sctx->stat_lock);
927
		btrfs_dev_stat_inc_and_print(dev, BTRFS_DEV_STAT_READ_ERRS);
928 929 930 931
		goto out;
	}
	BUG_ON(failed_mirror_index >= BTRFS_MAX_MIRRORS);
	sblock_bad = sblocks_for_recheck + failed_mirror_index;
932

933
	/* build and submit the bios for the failed mirror, check checksums */
934
	scrub_recheck_block(fs_info, sblock_bad, 1);
A
Arne Jansen 已提交
935

936 937 938
	if (!sblock_bad->header_error && !sblock_bad->checksum_error &&
	    sblock_bad->no_io_error_seen) {
		/*
939
		 * The error disappeared after reading sector by sector, or
940 941 942 943 944 945
		 * 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)
		 */
946 947
		spin_lock(&sctx->stat_lock);
		sctx->stat.unverified_errors++;
948
		sblock_to_check->data_corrected = 1;
949
		spin_unlock(&sctx->stat_lock);
A
Arne Jansen 已提交
950

951 952
		if (sctx->is_dev_replace)
			scrub_write_block_to_dev_replace(sblock_bad);
953
		goto out;
A
Arne Jansen 已提交
954 955
	}

956
	if (!sblock_bad->no_io_error_seen) {
957 958 959
		spin_lock(&sctx->stat_lock);
		sctx->stat.read_errors++;
		spin_unlock(&sctx->stat_lock);
960
		if (__ratelimit(&rs))
961
			scrub_print_warning("i/o error", sblock_to_check);
962
		btrfs_dev_stat_inc_and_print(dev, BTRFS_DEV_STAT_READ_ERRS);
963
	} else if (sblock_bad->checksum_error) {
964 965 966
		spin_lock(&sctx->stat_lock);
		sctx->stat.csum_errors++;
		spin_unlock(&sctx->stat_lock);
967
		if (__ratelimit(&rs))
968
			scrub_print_warning("checksum error", sblock_to_check);
969
		btrfs_dev_stat_inc_and_print(dev,
970
					     BTRFS_DEV_STAT_CORRUPTION_ERRS);
971
	} else if (sblock_bad->header_error) {
972 973 974
		spin_lock(&sctx->stat_lock);
		sctx->stat.verify_errors++;
		spin_unlock(&sctx->stat_lock);
975
		if (__ratelimit(&rs))
976 977
			scrub_print_warning("checksum/header error",
					    sblock_to_check);
978
		if (sblock_bad->generation_error)
979
			btrfs_dev_stat_inc_and_print(dev,
980 981
				BTRFS_DEV_STAT_GENERATION_ERRS);
		else
982
			btrfs_dev_stat_inc_and_print(dev,
983
				BTRFS_DEV_STAT_CORRUPTION_ERRS);
984
	}
A
Arne Jansen 已提交
985

986 987 988 989
	if (sctx->readonly) {
		ASSERT(!sctx->is_dev_replace);
		goto out;
	}
A
Arne Jansen 已提交
990

991 992
	/*
	 * now build and submit the bios for the other mirrors, check
993 994
	 * checksums.
	 * First try to pick the mirror which is completely without I/O
995 996 997 998 999
	 * 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
1000
	 * checksum is present, only those sectors are rewritten that had
1001
	 * an I/O error in the block to be repaired, since it cannot be
1002 1003
	 * determined, which copy of the other sectors is better (and it
	 * could happen otherwise that a correct sector would be
1004 1005
	 * overwritten by a bad one).
	 */
1006
	for (mirror_index = 0; ;mirror_index++) {
1007
		struct scrub_block *sblock_other;
1008

1009 1010
		if (mirror_index == failed_mirror_index)
			continue;
1011 1012

		/* raid56's mirror can be more than BTRFS_MAX_MIRRORS */
1013
		if (!scrub_is_page_on_raid56(sblock_bad->sectors[0])) {
1014 1015
			if (mirror_index >= BTRFS_MAX_MIRRORS)
				break;
1016
			if (!sblocks_for_recheck[mirror_index].sector_count)
1017 1018 1019 1020
				break;

			sblock_other = sblocks_for_recheck + mirror_index;
		} else {
1021
			struct scrub_recover *r = sblock_bad->sectors[0]->recover;
1022
			int max_allowed = r->bioc->num_stripes - r->bioc->num_tgtdevs;
1023 1024 1025

			if (mirror_index >= max_allowed)
				break;
1026
			if (!sblocks_for_recheck[1].sector_count)
1027 1028 1029 1030
				break;

			ASSERT(failed_mirror_index == 0);
			sblock_other = sblocks_for_recheck + 1;
1031
			sblock_other->sectors[0]->mirror_num = 1 + mirror_index;
1032
		}
1033 1034

		/* build and submit the bios, check checksums */
1035
		scrub_recheck_block(fs_info, sblock_other, 0);
1036 1037

		if (!sblock_other->header_error &&
1038 1039
		    !sblock_other->checksum_error &&
		    sblock_other->no_io_error_seen) {
1040 1041
			if (sctx->is_dev_replace) {
				scrub_write_block_to_dev_replace(sblock_other);
1042
				goto corrected_error;
1043 1044
			} else {
				ret = scrub_repair_block_from_good_copy(
1045 1046 1047
						sblock_bad, sblock_other);
				if (!ret)
					goto corrected_error;
1048
			}
1049 1050
		}
	}
A
Arne Jansen 已提交
1051

1052 1053
	if (sblock_bad->no_io_error_seen && !sctx->is_dev_replace)
		goto did_not_correct_error;
1054 1055 1056

	/*
	 * In case of I/O errors in the area that is supposed to be
1057 1058
	 * repaired, continue by picking good copies of those sectors.
	 * Select the good sectors from mirrors to rewrite bad sectors from
1059 1060 1061 1062 1063
	 * 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
1064
	 * all possible combinations of sectors from the different mirrors
1065
	 * until the checksum verification succeeds. For example, when
1066
	 * the 2nd sector of mirror #1 faces I/O errors, and the 2nd sector
1067
	 * of mirror #2 is readable but the final checksum test fails,
1068
	 * then the 2nd sector of mirror #3 could be tried, whether now
1069
	 * the final checksum succeeds. But this would be a rare
1070 1071 1072 1073
	 * 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
1074
	 * disks) instead of on sectorsize. Then maybe 512 byte of one
1075
	 * mirror could be repaired by taking 512 byte of a different
1076
	 * mirror, even if other 512 byte sectors in the same sectorsize
1077
	 * area are unreadable.
A
Arne Jansen 已提交
1078
	 */
1079
	success = 1;
1080 1081
	for (sector_num = 0; sector_num < sblock_bad->sector_count;
	     sector_num++) {
1082
		struct scrub_sector *sector_bad = sblock_bad->sectors[sector_num];
1083
		struct scrub_block *sblock_other = NULL;
1084

1085 1086
		/* Skip no-io-error sectors in scrub */
		if (!sector_bad->io_error && !sctx->is_dev_replace)
A
Arne Jansen 已提交
1087
			continue;
1088

1089
		if (scrub_is_page_on_raid56(sblock_bad->sectors[0])) {
1090 1091 1092 1093 1094 1095 1096 1097
			/*
			 * In case of dev replace, if raid56 rebuild process
			 * didn't work out correct data, then copy the content
			 * in sblock_bad to make sure target device is identical
			 * to source device, instead of writing garbage data in
			 * sblock_for_recheck array to target device.
			 */
			sblock_other = NULL;
1098 1099
		} else if (sector_bad->io_error) {
			/* Try to find no-io-error sector in mirrors */
1100 1101
			for (mirror_index = 0;
			     mirror_index < BTRFS_MAX_MIRRORS &&
1102
			     sblocks_for_recheck[mirror_index].sector_count > 0;
1103 1104
			     mirror_index++) {
				if (!sblocks_for_recheck[mirror_index].
1105
				    sectors[sector_num]->io_error) {
1106 1107 1108
					sblock_other = sblocks_for_recheck +
						       mirror_index;
					break;
1109 1110
				}
			}
1111 1112
			if (!sblock_other)
				success = 0;
I
Ilya Dryomov 已提交
1113
		}
A
Arne Jansen 已提交
1114

1115 1116
		if (sctx->is_dev_replace) {
			/*
1117 1118 1119 1120
			 * Did not find a mirror to fetch the sector from.
			 * scrub_write_sector_to_dev_replace() handles this
			 * case (sector->io_error), by filling the block with
			 * zeros before submitting the write request
1121 1122 1123 1124
			 */
			if (!sblock_other)
				sblock_other = sblock_bad;

1125 1126
			if (scrub_write_sector_to_dev_replace(sblock_other,
							      sector_num) != 0) {
1127
				atomic64_inc(
1128
					&fs_info->dev_replace.num_write_errors);
1129 1130 1131
				success = 0;
			}
		} else if (sblock_other) {
1132 1133 1134
			ret = scrub_repair_sector_from_good_copy(sblock_bad,
								 sblock_other,
								 sector_num, 0);
1135
			if (0 == ret)
1136
				sector_bad->io_error = 0;
1137 1138
			else
				success = 0;
1139
		}
A
Arne Jansen 已提交
1140 1141
	}

1142
	if (success && !sctx->is_dev_replace) {
1143 1144 1145 1146 1147 1148 1149 1150 1151 1152
		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.
			 */
1153
			scrub_recheck_block(fs_info, sblock_bad, 1);
1154
			if (!sblock_bad->header_error &&
1155 1156 1157 1158 1159 1160 1161
			    !sblock_bad->checksum_error &&
			    sblock_bad->no_io_error_seen)
				goto corrected_error;
			else
				goto did_not_correct_error;
		} else {
corrected_error:
1162 1163
			spin_lock(&sctx->stat_lock);
			sctx->stat.corrected_errors++;
1164
			sblock_to_check->data_corrected = 1;
1165
			spin_unlock(&sctx->stat_lock);
1166 1167
			btrfs_err_rl_in_rcu(fs_info,
				"fixed up error at logical %llu on dev %s",
1168
				logical, rcu_str_deref(dev->name));
A
Arne Jansen 已提交
1169
		}
1170 1171
	} else {
did_not_correct_error:
1172 1173 1174
		spin_lock(&sctx->stat_lock);
		sctx->stat.uncorrectable_errors++;
		spin_unlock(&sctx->stat_lock);
1175 1176
		btrfs_err_rl_in_rcu(fs_info,
			"unable to fixup (regular) error at logical %llu on dev %s",
1177
			logical, rcu_str_deref(dev->name));
I
Ilya Dryomov 已提交
1178
	}
A
Arne Jansen 已提交
1179

1180 1181 1182 1183 1184 1185
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;
1186
			struct scrub_recover *recover;
1187
			int i;
1188

1189 1190 1191
			for (i = 0; i < sblock->sector_count; i++) {
				sblock->sectors[i]->sblock = NULL;
				recover = sblock->sectors[i]->recover;
1192
				if (recover) {
1193
					scrub_put_recover(fs_info, recover);
1194
					sblock->sectors[i]->recover = NULL;
1195
				}
1196
				scrub_sector_put(sblock->sectors[i]);
1197
			}
1198 1199 1200
		}
		kfree(sblocks_for_recheck);
	}
A
Arne Jansen 已提交
1201

1202
	ret = unlock_full_stripe(fs_info, logical, full_stripe_locked);
1203
	memalloc_nofs_restore(nofs_flag);
1204 1205
	if (ret < 0)
		return ret;
1206 1207
	return 0;
}
A
Arne Jansen 已提交
1208

1209
static inline int scrub_nr_raid_mirrors(struct btrfs_io_context *bioc)
1210
{
1211
	if (bioc->map_type & BTRFS_BLOCK_GROUP_RAID5)
Z
Zhao Lei 已提交
1212
		return 2;
1213
	else if (bioc->map_type & BTRFS_BLOCK_GROUP_RAID6)
Z
Zhao Lei 已提交
1214 1215
		return 3;
	else
1216
		return (int)bioc->num_stripes;
1217 1218
}

Z
Zhao Lei 已提交
1219 1220
static inline void scrub_stripe_index_and_offset(u64 logical, u64 map_type,
						 u64 *raid_map,
1221 1222 1223 1224 1225 1226 1227
						 u64 mapped_length,
						 int nstripes, int mirror,
						 int *stripe_index,
						 u64 *stripe_offset)
{
	int i;

1228
	if (map_type & BTRFS_BLOCK_GROUP_RAID56_MASK) {
1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248
		/* RAID5/6 */
		for (i = 0; i < nstripes; i++) {
			if (raid_map[i] == RAID6_Q_STRIPE ||
			    raid_map[i] == RAID5_P_STRIPE)
				continue;

			if (logical >= raid_map[i] &&
			    logical < raid_map[i] + mapped_length)
				break;
		}

		*stripe_index = i;
		*stripe_offset = logical - raid_map[i];
	} else {
		/* The other RAID type */
		*stripe_index = mirror;
		*stripe_offset = 0;
	}
}

1249
static int scrub_setup_recheck_block(struct scrub_block *original_sblock,
1250 1251
				     struct scrub_block *sblocks_for_recheck)
{
1252
	struct scrub_ctx *sctx = original_sblock->sctx;
1253
	struct btrfs_fs_info *fs_info = sctx->fs_info;
1254 1255 1256 1257 1258
	u64 length = original_sblock->sector_count << fs_info->sectorsize_bits;
	u64 logical = original_sblock->sectors[0]->logical;
	u64 generation = original_sblock->sectors[0]->generation;
	u64 flags = original_sblock->sectors[0]->flags;
	u64 have_csum = original_sblock->sectors[0]->have_csum;
1259
	struct scrub_recover *recover;
1260
	struct btrfs_io_context *bioc;
1261 1262 1263 1264
	u64 sublen;
	u64 mapped_length;
	u64 stripe_offset;
	int stripe_index;
1265
	int sector_index = 0;
1266
	int mirror_index;
1267
	int nmirrors;
1268 1269 1270
	int ret;

	/*
1271 1272
	 * Note: the two members refs and outstanding_sectors are not used (and
	 * not set) in the blocks that are used for the recheck procedure.
1273 1274 1275
	 */

	while (length > 0) {
1276
		sublen = min_t(u64, length, fs_info->sectorsize);
1277
		mapped_length = sublen;
1278
		bioc = NULL;
A
Arne Jansen 已提交
1279

1280
		/*
1281 1282
		 * With a length of sectorsize, each returned stripe represents
		 * one mirror
1283
		 */
1284
		btrfs_bio_counter_inc_blocked(fs_info);
1285
		ret = btrfs_map_sblock(fs_info, BTRFS_MAP_GET_READ_MIRRORS,
1286 1287 1288
				       logical, &mapped_length, &bioc);
		if (ret || !bioc || mapped_length < sublen) {
			btrfs_put_bioc(bioc);
1289
			btrfs_bio_counter_dec(fs_info);
1290 1291
			return -EIO;
		}
A
Arne Jansen 已提交
1292

1293 1294
		recover = kzalloc(sizeof(struct scrub_recover), GFP_NOFS);
		if (!recover) {
1295
			btrfs_put_bioc(bioc);
1296
			btrfs_bio_counter_dec(fs_info);
1297 1298 1299
			return -ENOMEM;
		}

1300
		refcount_set(&recover->refs, 1);
1301
		recover->bioc = bioc;
1302 1303
		recover->map_length = mapped_length;

1304
		ASSERT(sector_index < SCRUB_MAX_SECTORS_PER_BLOCK);
1305

1306
		nmirrors = min(scrub_nr_raid_mirrors(bioc), BTRFS_MAX_MIRRORS);
Z
Zhao Lei 已提交
1307

1308
		for (mirror_index = 0; mirror_index < nmirrors;
1309 1310
		     mirror_index++) {
			struct scrub_block *sblock;
1311
			struct scrub_sector *sector;
1312 1313

			sblock = sblocks_for_recheck + mirror_index;
1314
			sblock->sctx = sctx;
1315

1316 1317
			sector = kzalloc(sizeof(*sector), GFP_NOFS);
			if (!sector) {
1318
leave_nomem:
1319 1320 1321
				spin_lock(&sctx->stat_lock);
				sctx->stat.malloc_errors++;
				spin_unlock(&sctx->stat_lock);
1322
				scrub_put_recover(fs_info, recover);
1323 1324
				return -ENOMEM;
			}
1325 1326 1327 1328 1329 1330 1331
			scrub_sector_get(sector);
			sblock->sectors[sector_index] = sector;
			sector->sblock = sblock;
			sector->flags = flags;
			sector->generation = generation;
			sector->logical = logical;
			sector->have_csum = have_csum;
1332
			if (have_csum)
1333
				memcpy(sector->csum,
1334
				       original_sblock->sectors[0]->csum,
1335
				       sctx->fs_info->csum_size);
1336

Z
Zhao Lei 已提交
1337
			scrub_stripe_index_and_offset(logical,
1338 1339
						      bioc->map_type,
						      bioc->raid_map,
1340
						      mapped_length,
1341 1342
						      bioc->num_stripes -
						      bioc->num_tgtdevs,
1343 1344 1345
						      mirror_index,
						      &stripe_index,
						      &stripe_offset);
1346
			sector->physical = bioc->stripes[stripe_index].physical +
1347
					 stripe_offset;
1348
			sector->dev = bioc->stripes[stripe_index].dev;
1349

1350
			BUG_ON(sector_index >= original_sblock->sector_count);
1351
			sector->physical_for_dev_replace =
1352
				original_sblock->sectors[sector_index]->
1353
				physical_for_dev_replace;
1354 1355
			/* For missing devices, dev->bdev is NULL */
			sector->mirror_num = mirror_index + 1;
1356
			sblock->sector_count++;
1357 1358
			sector->page = alloc_page(GFP_NOFS);
			if (!sector->page)
1359
				goto leave_nomem;
1360 1361

			scrub_get_recover(recover);
1362
			sector->recover = recover;
1363
		}
1364
		scrub_put_recover(fs_info, recover);
1365 1366
		length -= sublen;
		logical += sublen;
1367
		sector_index++;
1368 1369 1370
	}

	return 0;
I
Ilya Dryomov 已提交
1371 1372
}

1373
static void scrub_bio_wait_endio(struct bio *bio)
1374
{
1375
	complete(bio->bi_private);
1376 1377 1378 1379
}

static int scrub_submit_raid56_bio_wait(struct btrfs_fs_info *fs_info,
					struct bio *bio,
1380
					struct scrub_sector *sector)
1381
{
1382
	DECLARE_COMPLETION_ONSTACK(done);
1383
	int ret;
1384
	int mirror_num;
1385

1386
	bio->bi_iter.bi_sector = sector->logical >> 9;
1387 1388 1389
	bio->bi_private = &done;
	bio->bi_end_io = scrub_bio_wait_endio;

1390 1391 1392
	mirror_num = sector->sblock->sectors[0]->mirror_num;
	ret = raid56_parity_recover(bio, sector->recover->bioc,
				    sector->recover->map_length,
1393
				    mirror_num, 0);
1394 1395 1396
	if (ret)
		return ret;

1397 1398
	wait_for_completion_io(&done);
	return blk_status_to_errno(bio->bi_status);
1399 1400
}

L
Liu Bo 已提交
1401 1402 1403
static void scrub_recheck_block_on_raid56(struct btrfs_fs_info *fs_info,
					  struct scrub_block *sblock)
{
1404
	struct scrub_sector *first_sector = sblock->sectors[0];
L
Liu Bo 已提交
1405
	struct bio *bio;
1406
	int i;
L
Liu Bo 已提交
1407

1408 1409 1410
	/* All sectors in sblock belong to the same stripe on the same device. */
	ASSERT(first_sector->dev);
	if (!first_sector->dev->bdev)
L
Liu Bo 已提交
1411 1412
		goto out;

1413
	bio = bio_alloc(first_sector->dev->bdev, BIO_MAX_VECS, REQ_OP_READ, GFP_NOFS);
L
Liu Bo 已提交
1414

1415
	for (i = 0; i < sblock->sector_count; i++) {
1416
		struct scrub_sector *sector = sblock->sectors[i];
L
Liu Bo 已提交
1417

1418 1419
		WARN_ON(!sector->page);
		bio_add_page(bio, sector->page, PAGE_SIZE, 0);
L
Liu Bo 已提交
1420 1421
	}

1422
	if (scrub_submit_raid56_bio_wait(fs_info, bio, first_sector)) {
L
Liu Bo 已提交
1423 1424 1425 1426 1427 1428 1429 1430 1431 1432
		bio_put(bio);
		goto out;
	}

	bio_put(bio);

	scrub_recheck_block_checksum(sblock);

	return;
out:
1433 1434
	for (i = 0; i < sblock->sector_count; i++)
		sblock->sectors[i]->io_error = 1;
L
Liu Bo 已提交
1435 1436 1437 1438

	sblock->no_io_error_seen = 0;
}

1439
/*
1440 1441 1442 1443 1444
 * 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 sectors which are
 * errored are marked as being bad. The goal is to enable scrub to take those
 * sectors that are not errored from all the mirrors so that the sectors that
 * are errored in the just handled mirror can be repaired.
1445
 */
1446
static void scrub_recheck_block(struct btrfs_fs_info *fs_info,
1447 1448
				struct scrub_block *sblock,
				int retry_failed_mirror)
I
Ilya Dryomov 已提交
1449
{
1450
	int i;
I
Ilya Dryomov 已提交
1451

1452
	sblock->no_io_error_seen = 1;
I
Ilya Dryomov 已提交
1453

L
Liu Bo 已提交
1454
	/* short cut for raid56 */
1455
	if (!retry_failed_mirror && scrub_is_page_on_raid56(sblock->sectors[0]))
L
Liu Bo 已提交
1456 1457
		return scrub_recheck_block_on_raid56(fs_info, sblock);

1458
	for (i = 0; i < sblock->sector_count; i++) {
1459
		struct scrub_sector *sector = sblock->sectors[i];
1460 1461
		struct bio bio;
		struct bio_vec bvec;
1462

1463 1464
		if (sector->dev->bdev == NULL) {
			sector->io_error = 1;
1465 1466 1467 1468
			sblock->no_io_error_seen = 0;
			continue;
		}

1469
		WARN_ON(!sector->page);
1470 1471 1472
		bio_init(&bio, sector->dev->bdev, &bvec, 1, REQ_OP_READ);
		bio_add_page(&bio, sector->page, fs_info->sectorsize, 0);
		bio.bi_iter.bi_sector = sector->physical >> 9;
1473

1474 1475
		btrfsic_check_bio(&bio);
		if (submit_bio_wait(&bio)) {
1476
			sector->io_error = 1;
L
Liu Bo 已提交
1477
			sblock->no_io_error_seen = 0;
1478
		}
1479

1480
		bio_uninit(&bio);
1481
	}
I
Ilya Dryomov 已提交
1482

1483
	if (sblock->no_io_error_seen)
1484
		scrub_recheck_block_checksum(sblock);
A
Arne Jansen 已提交
1485 1486
}

1487
static inline int scrub_check_fsid(u8 fsid[], struct scrub_sector *sector)
M
Miao Xie 已提交
1488
{
1489
	struct btrfs_fs_devices *fs_devices = sector->dev->fs_devices;
M
Miao Xie 已提交
1490 1491
	int ret;

1492
	ret = memcmp(fsid, fs_devices->fsid, BTRFS_FSID_SIZE);
M
Miao Xie 已提交
1493 1494 1495
	return !ret;
}

1496
static void scrub_recheck_block_checksum(struct scrub_block *sblock)
A
Arne Jansen 已提交
1497
{
1498 1499 1500
	sblock->header_error = 0;
	sblock->checksum_error = 0;
	sblock->generation_error = 0;
1501

1502
	if (sblock->sectors[0]->flags & BTRFS_EXTENT_FLAG_DATA)
1503 1504 1505
		scrub_checksum_data(sblock);
	else
		scrub_checksum_tree_block(sblock);
A
Arne Jansen 已提交
1506 1507
}

1508
static int scrub_repair_block_from_good_copy(struct scrub_block *sblock_bad,
1509
					     struct scrub_block *sblock_good)
1510
{
1511
	int i;
1512
	int ret = 0;
I
Ilya Dryomov 已提交
1513

1514
	for (i = 0; i < sblock_bad->sector_count; i++) {
1515
		int ret_sub;
I
Ilya Dryomov 已提交
1516

1517 1518
		ret_sub = scrub_repair_sector_from_good_copy(sblock_bad,
							     sblock_good, i, 1);
1519 1520
		if (ret_sub)
			ret = ret_sub;
A
Arne Jansen 已提交
1521
	}
1522 1523 1524 1525

	return ret;
}

1526 1527 1528
static int scrub_repair_sector_from_good_copy(struct scrub_block *sblock_bad,
					      struct scrub_block *sblock_good,
					      int sector_num, int force_write)
1529
{
1530 1531
	struct scrub_sector *sector_bad = sblock_bad->sectors[sector_num];
	struct scrub_sector *sector_good = sblock_good->sectors[sector_num];
1532
	struct btrfs_fs_info *fs_info = sblock_bad->sctx->fs_info;
1533
	const u32 sectorsize = fs_info->sectorsize;
1534

1535 1536
	BUG_ON(sector_bad->page == NULL);
	BUG_ON(sector_good->page == NULL);
1537
	if (force_write || sblock_bad->header_error ||
1538
	    sblock_bad->checksum_error || sector_bad->io_error) {
1539 1540
		struct bio bio;
		struct bio_vec bvec;
1541 1542
		int ret;

1543
		if (!sector_bad->dev->bdev) {
1544
			btrfs_warn_rl(fs_info,
J
Jeff Mahoney 已提交
1545
				"scrub_repair_page_from_good_copy(bdev == NULL) is unexpected");
1546 1547 1548
			return -EIO;
		}

1549 1550 1551
		bio_init(&bio, sector_bad->dev->bdev, &bvec, 1, REQ_OP_WRITE);
		bio.bi_iter.bi_sector = sector_bad->physical >> 9;
		__bio_add_page(&bio, sector_good->page, sectorsize, 0);
1552

1553 1554 1555
		btrfsic_check_bio(&bio);
		ret = submit_bio_wait(&bio);
		bio_uninit(&bio);
1556

1557
		if (ret) {
1558
			btrfs_dev_stat_inc_and_print(sector_bad->dev,
1559
				BTRFS_DEV_STAT_WRITE_ERRS);
1560
			atomic64_inc(&fs_info->dev_replace.num_write_errors);
1561 1562
			return -EIO;
		}
A
Arne Jansen 已提交
1563 1564
	}

1565 1566 1567
	return 0;
}

1568 1569
static void scrub_write_block_to_dev_replace(struct scrub_block *sblock)
{
1570
	struct btrfs_fs_info *fs_info = sblock->sctx->fs_info;
1571
	int i;
1572

1573 1574 1575 1576 1577 1578 1579
	/*
	 * This block is used for the check of the parity on the source device,
	 * so the data needn't be written into the destination device.
	 */
	if (sblock->sparity)
		return;

1580
	for (i = 0; i < sblock->sector_count; i++) {
1581 1582
		int ret;

1583
		ret = scrub_write_sector_to_dev_replace(sblock, i);
1584
		if (ret)
1585
			atomic64_inc(&fs_info->dev_replace.num_write_errors);
1586 1587 1588
	}
}

1589
static int scrub_write_sector_to_dev_replace(struct scrub_block *sblock, int sector_num)
1590
{
1591
	struct scrub_sector *sector = sblock->sectors[sector_num];
1592

1593 1594 1595
	BUG_ON(sector->page == NULL);
	if (sector->io_error)
		clear_page(page_address(sector->page));
1596

1597
	return scrub_add_sector_to_wr_bio(sblock->sctx, sector);
1598 1599
}

1600 1601 1602 1603 1604 1605 1606 1607
static int fill_writer_pointer_gap(struct scrub_ctx *sctx, u64 physical)
{
	int ret = 0;
	u64 length;

	if (!btrfs_is_zoned(sctx->fs_info))
		return 0;

1608 1609 1610
	if (!btrfs_dev_is_sequential(sctx->wr_tgtdev, physical))
		return 0;

1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621
	if (sctx->write_pointer < physical) {
		length = physical - sctx->write_pointer;

		ret = btrfs_zoned_issue_zeroout(sctx->wr_tgtdev,
						sctx->write_pointer, length);
		if (!ret)
			sctx->write_pointer = physical;
	}
	return ret;
}

1622 1623
static int scrub_add_sector_to_wr_bio(struct scrub_ctx *sctx,
				      struct scrub_sector *sector)
1624 1625 1626
{
	struct scrub_bio *sbio;
	int ret;
1627
	const u32 sectorsize = sctx->fs_info->sectorsize;
1628

1629
	mutex_lock(&sctx->wr_lock);
1630
again:
1631 1632
	if (!sctx->wr_curr_bio) {
		sctx->wr_curr_bio = kzalloc(sizeof(*sctx->wr_curr_bio),
1633
					      GFP_KERNEL);
1634 1635
		if (!sctx->wr_curr_bio) {
			mutex_unlock(&sctx->wr_lock);
1636 1637
			return -ENOMEM;
		}
1638
		sctx->wr_curr_bio->sctx = sctx;
1639
		sctx->wr_curr_bio->sector_count = 0;
1640
	}
1641
	sbio = sctx->wr_curr_bio;
1642
	if (sbio->sector_count == 0) {
1643
		ret = fill_writer_pointer_gap(sctx, sector->physical_for_dev_replace);
1644 1645 1646 1647 1648
		if (ret) {
			mutex_unlock(&sctx->wr_lock);
			return ret;
		}

1649 1650
		sbio->physical = sector->physical_for_dev_replace;
		sbio->logical = sector->logical;
1651
		sbio->dev = sctx->wr_tgtdev;
1652 1653 1654
		if (!sbio->bio) {
			sbio->bio = bio_alloc(sbio->dev->bdev, sctx->sectors_per_bio,
					      REQ_OP_WRITE, GFP_NOFS);
1655
		}
1656 1657 1658
		sbio->bio->bi_private = sbio;
		sbio->bio->bi_end_io = scrub_wr_bio_end_io;
		sbio->bio->bi_iter.bi_sector = sbio->physical >> 9;
1659
		sbio->status = 0;
1660
	} else if (sbio->physical + sbio->sector_count * sectorsize !=
1661
		   sector->physical_for_dev_replace ||
1662
		   sbio->logical + sbio->sector_count * sectorsize !=
1663
		   sector->logical) {
1664 1665 1666 1667
		scrub_wr_submit(sctx);
		goto again;
	}

1668
	ret = bio_add_page(sbio->bio, sector->page, sectorsize, 0);
1669
	if (ret != sectorsize) {
1670
		if (sbio->sector_count < 1) {
1671 1672
			bio_put(sbio->bio);
			sbio->bio = NULL;
1673
			mutex_unlock(&sctx->wr_lock);
1674 1675 1676 1677 1678 1679
			return -EIO;
		}
		scrub_wr_submit(sctx);
		goto again;
	}

1680
	sbio->sectors[sbio->sector_count] = sector;
1681
	scrub_sector_get(sector);
1682 1683
	sbio->sector_count++;
	if (sbio->sector_count == sctx->sectors_per_bio)
1684
		scrub_wr_submit(sctx);
1685
	mutex_unlock(&sctx->wr_lock);
1686 1687 1688 1689 1690 1691 1692 1693

	return 0;
}

static void scrub_wr_submit(struct scrub_ctx *sctx)
{
	struct scrub_bio *sbio;

1694
	if (!sctx->wr_curr_bio)
1695 1696
		return;

1697 1698
	sbio = sctx->wr_curr_bio;
	sctx->wr_curr_bio = NULL;
1699 1700 1701 1702 1703
	scrub_pending_bio_inc(sctx);
	/* process all writes in a single worker thread. Then the block layer
	 * orders the requests before sending them to the driver which
	 * doubled the write performance on spinning disks when measured
	 * with Linux 3.5 */
1704 1705
	btrfsic_check_bio(sbio->bio);
	submit_bio(sbio->bio);
1706 1707

	if (btrfs_is_zoned(sctx->fs_info))
1708
		sctx->write_pointer = sbio->physical + sbio->sector_count *
1709
			sctx->fs_info->sectorsize;
1710 1711
}

1712
static void scrub_wr_bio_end_io(struct bio *bio)
1713 1714
{
	struct scrub_bio *sbio = bio->bi_private;
1715
	struct btrfs_fs_info *fs_info = sbio->dev->fs_info;
1716

1717
	sbio->status = bio->bi_status;
1718 1719
	sbio->bio = bio;

1720 1721
	INIT_WORK(&sbio->work, scrub_wr_bio_end_io_worker);
	queue_work(fs_info->scrub_wr_completion_workers, &sbio->work);
1722 1723
}

1724
static void scrub_wr_bio_end_io_worker(struct work_struct *work)
1725 1726 1727 1728 1729
{
	struct scrub_bio *sbio = container_of(work, struct scrub_bio, work);
	struct scrub_ctx *sctx = sbio->sctx;
	int i;

1730
	ASSERT(sbio->sector_count <= SCRUB_SECTORS_PER_BIO);
1731
	if (sbio->status) {
1732
		struct btrfs_dev_replace *dev_replace =
1733
			&sbio->sctx->fs_info->dev_replace;
1734

1735 1736
		for (i = 0; i < sbio->sector_count; i++) {
			struct scrub_sector *sector = sbio->sectors[i];
1737

1738
			sector->io_error = 1;
1739
			atomic64_inc(&dev_replace->num_write_errors);
1740 1741 1742
		}
	}

1743 1744
	for (i = 0; i < sbio->sector_count; i++)
		scrub_sector_put(sbio->sectors[i]);
1745 1746 1747 1748 1749 1750 1751

	bio_put(sbio->bio);
	kfree(sbio);
	scrub_pending_bio_dec(sctx);
}

static int scrub_checksum(struct scrub_block *sblock)
1752 1753 1754 1755
{
	u64 flags;
	int ret;

1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767
	/*
	 * No need to initialize these stats currently,
	 * because this function only use return value
	 * instead of these stats value.
	 *
	 * Todo:
	 * always use stats
	 */
	sblock->header_error = 0;
	sblock->generation_error = 0;
	sblock->checksum_error = 0;

1768 1769
	WARN_ON(sblock->sector_count < 1);
	flags = sblock->sectors[0]->flags;
1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780
	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);
1781 1782

	return ret;
A
Arne Jansen 已提交
1783 1784
}

1785
static int scrub_checksum_data(struct scrub_block *sblock)
A
Arne Jansen 已提交
1786
{
1787
	struct scrub_ctx *sctx = sblock->sctx;
1788 1789
	struct btrfs_fs_info *fs_info = sctx->fs_info;
	SHASH_DESC_ON_STACK(shash, fs_info->csum_shash);
A
Arne Jansen 已提交
1790
	u8 csum[BTRFS_CSUM_SIZE];
1791
	struct scrub_sector *sector;
1792
	char *kaddr;
A
Arne Jansen 已提交
1793

1794
	BUG_ON(sblock->sector_count < 1);
1795 1796
	sector = sblock->sectors[0];
	if (!sector->have_csum)
A
Arne Jansen 已提交
1797 1798
		return 0;

1799
	kaddr = page_address(sector->page);
1800

1801 1802
	shash->tfm = fs_info->csum_shash;
	crypto_shash_init(shash);
1803

1804
	/*
1805
	 * In scrub_sectors() and scrub_sectors_for_parity() we ensure each sector
1806 1807 1808
	 * only contains one sector of data.
	 */
	crypto_shash_digest(shash, kaddr, fs_info->sectorsize, csum);
A
Arne Jansen 已提交
1809

1810
	if (memcmp(csum, sector->csum, fs_info->csum_size))
1811
		sblock->checksum_error = 1;
1812
	return sblock->checksum_error;
A
Arne Jansen 已提交
1813 1814
}

1815
static int scrub_checksum_tree_block(struct scrub_block *sblock)
A
Arne Jansen 已提交
1816
{
1817
	struct scrub_ctx *sctx = sblock->sctx;
A
Arne Jansen 已提交
1818
	struct btrfs_header *h;
1819
	struct btrfs_fs_info *fs_info = sctx->fs_info;
1820
	SHASH_DESC_ON_STACK(shash, fs_info->csum_shash);
1821 1822
	u8 calculated_csum[BTRFS_CSUM_SIZE];
	u8 on_disk_csum[BTRFS_CSUM_SIZE];
1823 1824 1825 1826 1827 1828 1829
	/*
	 * This is done in sectorsize steps even for metadata as there's a
	 * constraint for nodesize to be aligned to sectorsize. This will need
	 * to change so we don't misuse data and metadata units like that.
	 */
	const u32 sectorsize = sctx->fs_info->sectorsize;
	const int num_sectors = fs_info->nodesize >> fs_info->sectorsize_bits;
1830
	int i;
1831
	struct scrub_sector *sector;
1832
	char *kaddr;
1833

1834
	BUG_ON(sblock->sector_count < 1);
1835

1836
	/* Each member in sectors is just one sector */
1837
	ASSERT(sblock->sector_count == num_sectors);
1838

1839 1840
	sector = sblock->sectors[0];
	kaddr = page_address(sector->page);
1841
	h = (struct btrfs_header *)kaddr;
1842
	memcpy(on_disk_csum, h->csum, sctx->fs_info->csum_size);
A
Arne Jansen 已提交
1843 1844 1845 1846 1847 1848

	/*
	 * we don't use the getter functions here, as we
	 * a) don't have an extent buffer and
	 * b) the page is already kmapped
	 */
1849
	if (sector->logical != btrfs_stack_header_bytenr(h))
1850
		sblock->header_error = 1;
A
Arne Jansen 已提交
1851

1852
	if (sector->generation != btrfs_stack_header_generation(h)) {
1853 1854 1855
		sblock->header_error = 1;
		sblock->generation_error = 1;
	}
A
Arne Jansen 已提交
1856

1857
	if (!scrub_check_fsid(h->fsid, sector))
1858
		sblock->header_error = 1;
A
Arne Jansen 已提交
1859 1860 1861

	if (memcmp(h->chunk_tree_uuid, fs_info->chunk_tree_uuid,
		   BTRFS_UUID_SIZE))
1862
		sblock->header_error = 1;
A
Arne Jansen 已提交
1863

1864 1865 1866
	shash->tfm = fs_info->csum_shash;
	crypto_shash_init(shash);
	crypto_shash_update(shash, kaddr + BTRFS_CSUM_SIZE,
1867
			    sectorsize - BTRFS_CSUM_SIZE);
1868

1869
	for (i = 1; i < num_sectors; i++) {
1870
		kaddr = page_address(sblock->sectors[i]->page);
1871
		crypto_shash_update(shash, kaddr, sectorsize);
1872 1873
	}

1874
	crypto_shash_final(shash, calculated_csum);
1875
	if (memcmp(calculated_csum, on_disk_csum, sctx->fs_info->csum_size))
1876
		sblock->checksum_error = 1;
A
Arne Jansen 已提交
1877

1878
	return sblock->header_error || sblock->checksum_error;
A
Arne Jansen 已提交
1879 1880
}

1881
static int scrub_checksum_super(struct scrub_block *sblock)
A
Arne Jansen 已提交
1882 1883
{
	struct btrfs_super_block *s;
1884
	struct scrub_ctx *sctx = sblock->sctx;
1885 1886
	struct btrfs_fs_info *fs_info = sctx->fs_info;
	SHASH_DESC_ON_STACK(shash, fs_info->csum_shash);
1887
	u8 calculated_csum[BTRFS_CSUM_SIZE];
1888
	struct scrub_sector *sector;
1889
	char *kaddr;
1890 1891
	int fail_gen = 0;
	int fail_cor = 0;
1892

1893
	BUG_ON(sblock->sector_count < 1);
1894 1895
	sector = sblock->sectors[0];
	kaddr = page_address(sector->page);
1896
	s = (struct btrfs_super_block *)kaddr;
A
Arne Jansen 已提交
1897

1898
	if (sector->logical != btrfs_super_bytenr(s))
1899
		++fail_cor;
A
Arne Jansen 已提交
1900

1901
	if (sector->generation != btrfs_super_generation(s))
1902
		++fail_gen;
A
Arne Jansen 已提交
1903

1904
	if (!scrub_check_fsid(s->fsid, sector))
1905
		++fail_cor;
A
Arne Jansen 已提交
1906

1907 1908 1909 1910
	shash->tfm = fs_info->csum_shash;
	crypto_shash_init(shash);
	crypto_shash_digest(shash, kaddr + BTRFS_CSUM_SIZE,
			BTRFS_SUPER_INFO_SIZE - BTRFS_CSUM_SIZE, calculated_csum);
1911

1912
	if (memcmp(calculated_csum, s->csum, sctx->fs_info->csum_size))
1913
		++fail_cor;
A
Arne Jansen 已提交
1914

1915
	if (fail_cor + fail_gen) {
A
Arne Jansen 已提交
1916 1917 1918 1919 1920
		/*
		 * if we find an error in a super block, we just report it.
		 * They will get written with the next transaction commit
		 * anyway
		 */
1921 1922 1923
		spin_lock(&sctx->stat_lock);
		++sctx->stat.super_errors;
		spin_unlock(&sctx->stat_lock);
1924
		if (fail_cor)
1925
			btrfs_dev_stat_inc_and_print(sector->dev,
1926 1927
				BTRFS_DEV_STAT_CORRUPTION_ERRS);
		else
1928
			btrfs_dev_stat_inc_and_print(sector->dev,
1929
				BTRFS_DEV_STAT_GENERATION_ERRS);
A
Arne Jansen 已提交
1930 1931
	}

1932
	return fail_cor + fail_gen;
A
Arne Jansen 已提交
1933 1934
}

1935 1936
static void scrub_block_get(struct scrub_block *sblock)
{
1937
	refcount_inc(&sblock->refs);
1938 1939 1940 1941
}

static void scrub_block_put(struct scrub_block *sblock)
{
1942
	if (refcount_dec_and_test(&sblock->refs)) {
1943 1944
		int i;

1945 1946 1947
		if (sblock->sparity)
			scrub_parity_put(sblock->sparity);

1948
		for (i = 0; i < sblock->sector_count; i++)
1949
			scrub_sector_put(sblock->sectors[i]);
1950 1951 1952 1953
		kfree(sblock);
	}
}

1954
static void scrub_sector_get(struct scrub_sector *sector)
1955
{
1956
	atomic_inc(&sector->refs);
1957 1958
}

1959
static void scrub_sector_put(struct scrub_sector *sector)
1960
{
1961 1962 1963 1964
	if (atomic_dec_and_test(&sector->refs)) {
		if (sector->page)
			__free_page(sector->page);
		kfree(sector);
1965 1966 1967
	}
}

1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025 2026
/*
 * Throttling of IO submission, bandwidth-limit based, the timeslice is 1
 * second.  Limit can be set via /sys/fs/UUID/devinfo/devid/scrub_speed_max.
 */
static void scrub_throttle(struct scrub_ctx *sctx)
{
	const int time_slice = 1000;
	struct scrub_bio *sbio;
	struct btrfs_device *device;
	s64 delta;
	ktime_t now;
	u32 div;
	u64 bwlimit;

	sbio = sctx->bios[sctx->curr];
	device = sbio->dev;
	bwlimit = READ_ONCE(device->scrub_speed_max);
	if (bwlimit == 0)
		return;

	/*
	 * Slice is divided into intervals when the IO is submitted, adjust by
	 * bwlimit and maximum of 64 intervals.
	 */
	div = max_t(u32, 1, (u32)(bwlimit / (16 * 1024 * 1024)));
	div = min_t(u32, 64, div);

	/* Start new epoch, set deadline */
	now = ktime_get();
	if (sctx->throttle_deadline == 0) {
		sctx->throttle_deadline = ktime_add_ms(now, time_slice / div);
		sctx->throttle_sent = 0;
	}

	/* Still in the time to send? */
	if (ktime_before(now, sctx->throttle_deadline)) {
		/* If current bio is within the limit, send it */
		sctx->throttle_sent += sbio->bio->bi_iter.bi_size;
		if (sctx->throttle_sent <= div_u64(bwlimit, div))
			return;

		/* We're over the limit, sleep until the rest of the slice */
		delta = ktime_ms_delta(sctx->throttle_deadline, now);
	} else {
		/* New request after deadline, start new epoch */
		delta = 0;
	}

	if (delta) {
		long timeout;

		timeout = div_u64(delta * HZ, 1000);
		schedule_timeout_interruptible(timeout);
	}

	/* Next call will start the deadline period */
	sctx->throttle_deadline = 0;
}

2027
static void scrub_submit(struct scrub_ctx *sctx)
A
Arne Jansen 已提交
2028 2029 2030
{
	struct scrub_bio *sbio;

2031
	if (sctx->curr == -1)
S
Stefan Behrens 已提交
2032
		return;
A
Arne Jansen 已提交
2033

2034 2035
	scrub_throttle(sctx);

2036 2037
	sbio = sctx->bios[sctx->curr];
	sctx->curr = -1;
2038
	scrub_pending_bio_inc(sctx);
2039 2040
	btrfsic_check_bio(sbio->bio);
	submit_bio(sbio->bio);
A
Arne Jansen 已提交
2041 2042
}

2043 2044
static int scrub_add_sector_to_rd_bio(struct scrub_ctx *sctx,
				      struct scrub_sector *sector)
A
Arne Jansen 已提交
2045
{
2046
	struct scrub_block *sblock = sector->sblock;
A
Arne Jansen 已提交
2047
	struct scrub_bio *sbio;
2048
	const u32 sectorsize = sctx->fs_info->sectorsize;
2049
	int ret;
A
Arne Jansen 已提交
2050 2051 2052 2053 2054

again:
	/*
	 * grab a fresh bio or wait for one to become available
	 */
2055 2056 2057 2058 2059 2060
	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;
2061
			sctx->bios[sctx->curr]->sector_count = 0;
2062
			spin_unlock(&sctx->list_lock);
A
Arne Jansen 已提交
2063
		} else {
2064 2065
			spin_unlock(&sctx->list_lock);
			wait_event(sctx->list_wait, sctx->first_free != -1);
A
Arne Jansen 已提交
2066 2067
		}
	}
2068
	sbio = sctx->bios[sctx->curr];
2069
	if (sbio->sector_count == 0) {
2070 2071 2072
		sbio->physical = sector->physical;
		sbio->logical = sector->logical;
		sbio->dev = sector->dev;
2073 2074 2075
		if (!sbio->bio) {
			sbio->bio = bio_alloc(sbio->dev->bdev, sctx->sectors_per_bio,
					      REQ_OP_READ, GFP_NOFS);
2076
		}
2077 2078 2079
		sbio->bio->bi_private = sbio;
		sbio->bio->bi_end_io = scrub_bio_end_io;
		sbio->bio->bi_iter.bi_sector = sbio->physical >> 9;
2080
		sbio->status = 0;
2081
	} else if (sbio->physical + sbio->sector_count * sectorsize !=
2082
		   sector->physical ||
2083
		   sbio->logical + sbio->sector_count * sectorsize !=
2084 2085
		   sector->logical ||
		   sbio->dev != sector->dev) {
2086
		scrub_submit(sctx);
A
Arne Jansen 已提交
2087 2088
		goto again;
	}
2089

2090
	sbio->sectors[sbio->sector_count] = sector;
2091
	ret = bio_add_page(sbio->bio, sector->page, sectorsize, 0);
2092
	if (ret != sectorsize) {
2093
		if (sbio->sector_count < 1) {
2094 2095 2096 2097
			bio_put(sbio->bio);
			sbio->bio = NULL;
			return -EIO;
		}
2098
		scrub_submit(sctx);
2099 2100 2101
		goto again;
	}

2102
	scrub_block_get(sblock); /* one for the page added to the bio */
2103
	atomic_inc(&sblock->outstanding_sectors);
2104 2105
	sbio->sector_count++;
	if (sbio->sector_count == sctx->sectors_per_bio)
2106
		scrub_submit(sctx);
2107 2108 2109 2110

	return 0;
}

2111
static void scrub_missing_raid56_end_io(struct bio *bio)
2112 2113
{
	struct scrub_block *sblock = bio->bi_private;
2114
	struct btrfs_fs_info *fs_info = sblock->sctx->fs_info;
2115

2116
	if (bio->bi_status)
2117 2118
		sblock->no_io_error_seen = 0;

2119 2120
	bio_put(bio);

2121
	queue_work(fs_info->scrub_workers, &sblock->work);
2122 2123
}

2124
static void scrub_missing_raid56_worker(struct work_struct *work)
2125 2126 2127
{
	struct scrub_block *sblock = container_of(work, struct scrub_block, work);
	struct scrub_ctx *sctx = sblock->sctx;
2128
	struct btrfs_fs_info *fs_info = sctx->fs_info;
2129 2130 2131
	u64 logical;
	struct btrfs_device *dev;

2132 2133
	logical = sblock->sectors[0]->logical;
	dev = sblock->sectors[0]->dev;
2134

2135
	if (sblock->no_io_error_seen)
2136
		scrub_recheck_block_checksum(sblock);
2137 2138 2139 2140 2141

	if (!sblock->no_io_error_seen) {
		spin_lock(&sctx->stat_lock);
		sctx->stat.read_errors++;
		spin_unlock(&sctx->stat_lock);
2142
		btrfs_err_rl_in_rcu(fs_info,
2143
			"IO error rebuilding logical %llu for dev %s",
2144 2145 2146 2147 2148
			logical, rcu_str_deref(dev->name));
	} else if (sblock->header_error || sblock->checksum_error) {
		spin_lock(&sctx->stat_lock);
		sctx->stat.uncorrectable_errors++;
		spin_unlock(&sctx->stat_lock);
2149
		btrfs_err_rl_in_rcu(fs_info,
2150
			"failed to rebuild valid logical %llu for dev %s",
2151 2152 2153 2154 2155
			logical, rcu_str_deref(dev->name));
	} else {
		scrub_write_block_to_dev_replace(sblock);
	}

2156
	if (sctx->is_dev_replace && sctx->flush_all_writes) {
2157
		mutex_lock(&sctx->wr_lock);
2158
		scrub_wr_submit(sctx);
2159
		mutex_unlock(&sctx->wr_lock);
2160 2161
	}

2162
	scrub_block_put(sblock);
2163 2164 2165 2166 2167 2168
	scrub_pending_bio_dec(sctx);
}

static void scrub_missing_raid56_pages(struct scrub_block *sblock)
{
	struct scrub_ctx *sctx = sblock->sctx;
2169
	struct btrfs_fs_info *fs_info = sctx->fs_info;
2170 2171
	u64 length = sblock->sector_count << fs_info->sectorsize_bits;
	u64 logical = sblock->sectors[0]->logical;
2172
	struct btrfs_io_context *bioc = NULL;
2173 2174 2175 2176 2177
	struct bio *bio;
	struct btrfs_raid_bio *rbio;
	int ret;
	int i;

2178
	btrfs_bio_counter_inc_blocked(fs_info);
2179
	ret = btrfs_map_sblock(fs_info, BTRFS_MAP_GET_READ_MIRRORS, logical,
2180 2181 2182
			       &length, &bioc);
	if (ret || !bioc || !bioc->raid_map)
		goto bioc_out;
2183 2184

	if (WARN_ON(!sctx->is_dev_replace ||
2185
		    !(bioc->map_type & BTRFS_BLOCK_GROUP_RAID56_MASK))) {
2186 2187 2188 2189 2190 2191
		/*
		 * We shouldn't be scrubbing a missing device. Even for dev
		 * replace, we should only get here for RAID 5/6. We either
		 * managed to mount something with no mirrors remaining or
		 * there's a bug in scrub_remap_extent()/btrfs_map_block().
		 */
2192
		goto bioc_out;
2193 2194
	}

2195
	bio = bio_alloc(NULL, BIO_MAX_VECS, REQ_OP_READ, GFP_NOFS);
2196 2197 2198 2199
	bio->bi_iter.bi_sector = logical >> 9;
	bio->bi_private = sblock;
	bio->bi_end_io = scrub_missing_raid56_end_io;

2200
	rbio = raid56_alloc_missing_rbio(bio, bioc, length);
2201 2202 2203
	if (!rbio)
		goto rbio_out;

2204
	for (i = 0; i < sblock->sector_count; i++) {
2205
		struct scrub_sector *sector = sblock->sectors[i];
2206

2207 2208 2209 2210 2211
		/*
		 * For now, our scrub is still one page per sector, so pgoff
		 * is always 0.
		 */
		raid56_add_scrub_pages(rbio, sector->page, 0, sector->logical);
2212 2213
	}

2214
	INIT_WORK(&sblock->work, scrub_missing_raid56_worker);
2215 2216 2217 2218 2219 2220 2221
	scrub_block_get(sblock);
	scrub_pending_bio_inc(sctx);
	raid56_submit_missing_rbio(rbio);
	return;

rbio_out:
	bio_put(bio);
2222
bioc_out:
2223
	btrfs_bio_counter_dec(fs_info);
2224
	btrfs_put_bioc(bioc);
2225 2226 2227 2228 2229
	spin_lock(&sctx->stat_lock);
	sctx->stat.malloc_errors++;
	spin_unlock(&sctx->stat_lock);
}

2230
static int scrub_sectors(struct scrub_ctx *sctx, u64 logical, u32 len,
2231
		       u64 physical, struct btrfs_device *dev, u64 flags,
2232
		       u64 gen, int mirror_num, u8 *csum,
2233
		       u64 physical_for_dev_replace)
2234 2235
{
	struct scrub_block *sblock;
2236
	const u32 sectorsize = sctx->fs_info->sectorsize;
2237 2238
	int index;

2239
	sblock = kzalloc(sizeof(*sblock), GFP_KERNEL);
2240
	if (!sblock) {
2241 2242 2243
		spin_lock(&sctx->stat_lock);
		sctx->stat.malloc_errors++;
		spin_unlock(&sctx->stat_lock);
2244
		return -ENOMEM;
A
Arne Jansen 已提交
2245
	}
2246

2247 2248
	/* one ref inside this function, plus one for each page added to
	 * a bio later on */
2249
	refcount_set(&sblock->refs, 1);
2250
	sblock->sctx = sctx;
2251 2252 2253
	sblock->no_io_error_seen = 1;

	for (index = 0; len > 0; index++) {
2254
		struct scrub_sector *sector;
2255 2256 2257 2258 2259 2260
		/*
		 * Here we will allocate one page for one sector to scrub.
		 * This is fine if PAGE_SIZE == sectorsize, but will cost
		 * more memory for PAGE_SIZE > sectorsize case.
		 */
		u32 l = min(sectorsize, len);
2261

2262 2263
		sector = kzalloc(sizeof(*sector), GFP_KERNEL);
		if (!sector) {
2264
leave_nomem:
2265 2266 2267
			spin_lock(&sctx->stat_lock);
			sctx->stat.malloc_errors++;
			spin_unlock(&sctx->stat_lock);
2268
			scrub_block_put(sblock);
2269 2270
			return -ENOMEM;
		}
2271
		ASSERT(index < SCRUB_MAX_SECTORS_PER_BLOCK);
2272 2273 2274 2275 2276 2277 2278 2279 2280 2281
		scrub_sector_get(sector);
		sblock->sectors[index] = sector;
		sector->sblock = sblock;
		sector->dev = dev;
		sector->flags = flags;
		sector->generation = gen;
		sector->logical = logical;
		sector->physical = physical;
		sector->physical_for_dev_replace = physical_for_dev_replace;
		sector->mirror_num = mirror_num;
2282
		if (csum) {
2283 2284
			sector->have_csum = 1;
			memcpy(sector->csum, csum, sctx->fs_info->csum_size);
2285
		} else {
2286
			sector->have_csum = 0;
2287
		}
2288
		sblock->sector_count++;
2289 2290
		sector->page = alloc_page(GFP_KERNEL);
		if (!sector->page)
2291
			goto leave_nomem;
2292 2293 2294
		len -= l;
		logical += l;
		physical += l;
2295
		physical_for_dev_replace += l;
2296 2297
	}

2298
	WARN_ON(sblock->sector_count == 0);
2299
	if (test_bit(BTRFS_DEV_STATE_MISSING, &dev->dev_state)) {
2300 2301 2302 2303 2304 2305
		/*
		 * This case should only be hit for RAID 5/6 device replace. See
		 * the comment in scrub_missing_raid56_pages() for details.
		 */
		scrub_missing_raid56_pages(sblock);
	} else {
2306
		for (index = 0; index < sblock->sector_count; index++) {
2307
			struct scrub_sector *sector = sblock->sectors[index];
2308
			int ret;
2309

2310
			ret = scrub_add_sector_to_rd_bio(sctx, sector);
2311 2312 2313 2314
			if (ret) {
				scrub_block_put(sblock);
				return ret;
			}
2315
		}
A
Arne Jansen 已提交
2316

2317
		if (flags & BTRFS_EXTENT_FLAG_SUPER)
2318 2319
			scrub_submit(sctx);
	}
A
Arne Jansen 已提交
2320

2321 2322
	/* last one frees, either here or in bio completion for last page */
	scrub_block_put(sblock);
A
Arne Jansen 已提交
2323 2324 2325
	return 0;
}

2326
static void scrub_bio_end_io(struct bio *bio)
2327 2328
{
	struct scrub_bio *sbio = bio->bi_private;
2329
	struct btrfs_fs_info *fs_info = sbio->dev->fs_info;
2330

2331
	sbio->status = bio->bi_status;
2332 2333
	sbio->bio = bio;

2334
	queue_work(fs_info->scrub_workers, &sbio->work);
2335 2336
}

2337
static void scrub_bio_end_io_worker(struct work_struct *work)
2338 2339
{
	struct scrub_bio *sbio = container_of(work, struct scrub_bio, work);
2340
	struct scrub_ctx *sctx = sbio->sctx;
2341 2342
	int i;

2343
	ASSERT(sbio->sector_count <= SCRUB_SECTORS_PER_BIO);
2344
	if (sbio->status) {
2345 2346
		for (i = 0; i < sbio->sector_count; i++) {
			struct scrub_sector *sector = sbio->sectors[i];
2347

2348 2349
			sector->io_error = 1;
			sector->sblock->no_io_error_seen = 0;
2350 2351 2352
		}
	}

2353
	/* Now complete the scrub_block items that have all pages completed */
2354 2355
	for (i = 0; i < sbio->sector_count; i++) {
		struct scrub_sector *sector = sbio->sectors[i];
2356
		struct scrub_block *sblock = sector->sblock;
2357

2358
		if (atomic_dec_and_test(&sblock->outstanding_sectors))
2359 2360 2361 2362 2363 2364
			scrub_block_complete(sblock);
		scrub_block_put(sblock);
	}

	bio_put(sbio->bio);
	sbio->bio = NULL;
2365 2366 2367 2368
	spin_lock(&sctx->list_lock);
	sbio->next_free = sctx->first_free;
	sctx->first_free = sbio->index;
	spin_unlock(&sctx->list_lock);
2369

2370
	if (sctx->is_dev_replace && sctx->flush_all_writes) {
2371
		mutex_lock(&sctx->wr_lock);
2372
		scrub_wr_submit(sctx);
2373
		mutex_unlock(&sctx->wr_lock);
2374 2375
	}

2376
	scrub_pending_bio_dec(sctx);
2377 2378
}

2379 2380
static inline void __scrub_mark_bitmap(struct scrub_parity *sparity,
				       unsigned long *bitmap,
2381
				       u64 start, u32 len)
2382
{
2383
	u64 offset;
2384
	u32 nsectors;
2385
	u32 sectorsize_bits = sparity->sctx->fs_info->sectorsize_bits;
2386 2387 2388 2389 2390 2391 2392

	if (len >= sparity->stripe_len) {
		bitmap_set(bitmap, 0, sparity->nsectors);
		return;
	}

	start -= sparity->logic_start;
2393
	start = div64_u64_rem(start, sparity->stripe_len, &offset);
2394
	offset = offset >> sectorsize_bits;
2395
	nsectors = len >> sectorsize_bits;
2396 2397 2398 2399 2400 2401 2402 2403 2404 2405 2406

	if (offset + nsectors <= sparity->nsectors) {
		bitmap_set(bitmap, offset, nsectors);
		return;
	}

	bitmap_set(bitmap, offset, sparity->nsectors - offset);
	bitmap_set(bitmap, 0, nsectors - (sparity->nsectors - offset));
}

static inline void scrub_parity_mark_sectors_error(struct scrub_parity *sparity,
2407
						   u64 start, u32 len)
2408 2409 2410 2411 2412
{
	__scrub_mark_bitmap(sparity, sparity->ebitmap, start, len);
}

static inline void scrub_parity_mark_sectors_data(struct scrub_parity *sparity,
2413
						  u64 start, u32 len)
2414 2415 2416 2417
{
	__scrub_mark_bitmap(sparity, sparity->dbitmap, start, len);
}

2418 2419
static void scrub_block_complete(struct scrub_block *sblock)
{
2420 2421
	int corrupted = 0;

2422
	if (!sblock->no_io_error_seen) {
2423
		corrupted = 1;
2424
		scrub_handle_errored_block(sblock);
2425 2426 2427 2428 2429 2430
	} else {
		/*
		 * if has checksum error, write via repair mechanism in
		 * dev replace case, otherwise write here in dev replace
		 * case.
		 */
2431 2432
		corrupted = scrub_checksum(sblock);
		if (!corrupted && sblock->sctx->is_dev_replace)
2433 2434
			scrub_write_block_to_dev_replace(sblock);
	}
2435 2436

	if (sblock->sparity && corrupted && !sblock->data_corrected) {
2437 2438
		u64 start = sblock->sectors[0]->logical;
		u64 end = sblock->sectors[sblock->sector_count - 1]->logical +
2439
			  sblock->sctx->fs_info->sectorsize;
2440

2441
		ASSERT(end - start <= U32_MAX);
2442 2443 2444
		scrub_parity_mark_sectors_error(sblock->sparity,
						start, end - start);
	}
2445 2446
}

2447 2448 2449 2450 2451 2452 2453 2454 2455 2456 2457 2458
static void drop_csum_range(struct scrub_ctx *sctx, struct btrfs_ordered_sum *sum)
{
	sctx->stat.csum_discards += sum->len >> sctx->fs_info->sectorsize_bits;
	list_del(&sum->list);
	kfree(sum);
}

/*
 * Find the desired csum for range [logical, logical + sectorsize), and store
 * the csum into @csum.
 *
 * The search source is sctx->csum_list, which is a pre-populated list
D
David Sterba 已提交
2459
 * storing bytenr ordered csum ranges.  We're responsible to cleanup any range
2460 2461 2462 2463 2464
 * that is before @logical.
 *
 * Return 0 if there is no csum for the range.
 * Return 1 if there is csum for the range and copied to @csum.
 */
2465
static int scrub_find_csum(struct scrub_ctx *sctx, u64 logical, u8 *csum)
A
Arne Jansen 已提交
2466
{
2467
	bool found = false;
A
Arne Jansen 已提交
2468

2469
	while (!list_empty(&sctx->csum_list)) {
2470 2471 2472 2473
		struct btrfs_ordered_sum *sum = NULL;
		unsigned long index;
		unsigned long num_sectors;

2474
		sum = list_first_entry(&sctx->csum_list,
A
Arne Jansen 已提交
2475
				       struct btrfs_ordered_sum, list);
2476
		/* The current csum range is beyond our range, no csum found */
A
Arne Jansen 已提交
2477 2478 2479
		if (sum->bytenr > logical)
			break;

2480 2481 2482 2483 2484 2485 2486 2487 2488 2489
		/*
		 * The current sum is before our bytenr, since scrub is always
		 * done in bytenr order, the csum will never be used anymore,
		 * clean it up so that later calls won't bother with the range,
		 * and continue search the next range.
		 */
		if (sum->bytenr + sum->len <= logical) {
			drop_csum_range(sctx, sum);
			continue;
		}
A
Arne Jansen 已提交
2490

2491 2492 2493 2494
		/* Now the csum range covers our bytenr, copy the csum */
		found = true;
		index = (logical - sum->bytenr) >> sctx->fs_info->sectorsize_bits;
		num_sectors = sum->len >> sctx->fs_info->sectorsize_bits;
2495

2496 2497 2498 2499 2500 2501 2502
		memcpy(csum, sum->sums + index * sctx->fs_info->csum_size,
		       sctx->fs_info->csum_size);

		/* Cleanup the range if we're at the end of the csum range */
		if (index == num_sectors - 1)
			drop_csum_range(sctx, sum);
		break;
A
Arne Jansen 已提交
2503
	}
2504 2505
	if (!found)
		return 0;
2506
	return 1;
A
Arne Jansen 已提交
2507 2508 2509
}

/* scrub extent tries to collect up to 64 kB for each bio */
L
Liu Bo 已提交
2510
static int scrub_extent(struct scrub_ctx *sctx, struct map_lookup *map,
2511
			u64 logical, u32 len,
2512
			u64 physical, struct btrfs_device *dev, u64 flags,
2513
			u64 gen, int mirror_num, u64 physical_for_dev_replace)
A
Arne Jansen 已提交
2514 2515 2516
{
	int ret;
	u8 csum[BTRFS_CSUM_SIZE];
2517 2518 2519
	u32 blocksize;

	if (flags & BTRFS_EXTENT_FLAG_DATA) {
L
Liu Bo 已提交
2520 2521 2522 2523
		if (map->type & BTRFS_BLOCK_GROUP_RAID56_MASK)
			blocksize = map->stripe_len;
		else
			blocksize = sctx->fs_info->sectorsize;
2524 2525 2526 2527
		spin_lock(&sctx->stat_lock);
		sctx->stat.data_extents_scrubbed++;
		sctx->stat.data_bytes_scrubbed += len;
		spin_unlock(&sctx->stat_lock);
2528
	} else if (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK) {
L
Liu Bo 已提交
2529 2530 2531 2532
		if (map->type & BTRFS_BLOCK_GROUP_RAID56_MASK)
			blocksize = map->stripe_len;
		else
			blocksize = sctx->fs_info->nodesize;
2533 2534 2535 2536
		spin_lock(&sctx->stat_lock);
		sctx->stat.tree_extents_scrubbed++;
		sctx->stat.tree_bytes_scrubbed += len;
		spin_unlock(&sctx->stat_lock);
2537
	} else {
2538
		blocksize = sctx->fs_info->sectorsize;
2539
		WARN_ON(1);
2540
	}
A
Arne Jansen 已提交
2541 2542

	while (len) {
2543
		u32 l = min(len, blocksize);
A
Arne Jansen 已提交
2544 2545 2546 2547
		int have_csum = 0;

		if (flags & BTRFS_EXTENT_FLAG_DATA) {
			/* push csums to sbio */
2548
			have_csum = scrub_find_csum(sctx, logical, csum);
A
Arne Jansen 已提交
2549
			if (have_csum == 0)
2550
				++sctx->stat.no_csum;
A
Arne Jansen 已提交
2551
		}
2552
		ret = scrub_sectors(sctx, logical, l, physical, dev, flags, gen,
2553
				  mirror_num, have_csum ? csum : NULL,
2554
				  physical_for_dev_replace);
A
Arne Jansen 已提交
2555 2556 2557 2558 2559
		if (ret)
			return ret;
		len -= l;
		logical += l;
		physical += l;
2560
		physical_for_dev_replace += l;
A
Arne Jansen 已提交
2561 2562 2563 2564
	}
	return 0;
}

2565
static int scrub_sectors_for_parity(struct scrub_parity *sparity,
2566
				  u64 logical, u32 len,
2567 2568 2569 2570 2571
				  u64 physical, struct btrfs_device *dev,
				  u64 flags, u64 gen, int mirror_num, u8 *csum)
{
	struct scrub_ctx *sctx = sparity->sctx;
	struct scrub_block *sblock;
2572
	const u32 sectorsize = sctx->fs_info->sectorsize;
2573 2574
	int index;

2575 2576
	ASSERT(IS_ALIGNED(len, sectorsize));

2577
	sblock = kzalloc(sizeof(*sblock), GFP_KERNEL);
2578 2579 2580 2581 2582 2583 2584 2585 2586
	if (!sblock) {
		spin_lock(&sctx->stat_lock);
		sctx->stat.malloc_errors++;
		spin_unlock(&sctx->stat_lock);
		return -ENOMEM;
	}

	/* one ref inside this function, plus one for each page added to
	 * a bio later on */
2587
	refcount_set(&sblock->refs, 1);
2588 2589 2590 2591 2592 2593
	sblock->sctx = sctx;
	sblock->no_io_error_seen = 1;
	sblock->sparity = sparity;
	scrub_parity_get(sparity);

	for (index = 0; len > 0; index++) {
2594
		struct scrub_sector *sector;
2595

2596 2597
		sector = kzalloc(sizeof(*sector), GFP_KERNEL);
		if (!sector) {
2598 2599 2600 2601 2602 2603 2604
leave_nomem:
			spin_lock(&sctx->stat_lock);
			sctx->stat.malloc_errors++;
			spin_unlock(&sctx->stat_lock);
			scrub_block_put(sblock);
			return -ENOMEM;
		}
2605
		ASSERT(index < SCRUB_MAX_SECTORS_PER_BLOCK);
2606
		/* For scrub block */
2607 2608
		scrub_sector_get(sector);
		sblock->sectors[index] = sector;
2609
		/* For scrub parity */
2610 2611 2612 2613 2614 2615 2616 2617 2618
		scrub_sector_get(sector);
		list_add_tail(&sector->list, &sparity->sectors_list);
		sector->sblock = sblock;
		sector->dev = dev;
		sector->flags = flags;
		sector->generation = gen;
		sector->logical = logical;
		sector->physical = physical;
		sector->mirror_num = mirror_num;
2619
		if (csum) {
2620 2621
			sector->have_csum = 1;
			memcpy(sector->csum, csum, sctx->fs_info->csum_size);
2622
		} else {
2623
			sector->have_csum = 0;
2624
		}
2625
		sblock->sector_count++;
2626 2627
		sector->page = alloc_page(GFP_KERNEL);
		if (!sector->page)
2628
			goto leave_nomem;
2629 2630 2631 2632 2633 2634


		/* Iterate over the stripe range in sectorsize steps */
		len -= sectorsize;
		logical += sectorsize;
		physical += sectorsize;
2635 2636
	}

2637 2638
	WARN_ON(sblock->sector_count == 0);
	for (index = 0; index < sblock->sector_count; index++) {
2639
		struct scrub_sector *sector = sblock->sectors[index];
2640 2641
		int ret;

2642
		ret = scrub_add_sector_to_rd_bio(sctx, sector);
2643 2644 2645 2646 2647 2648
		if (ret) {
			scrub_block_put(sblock);
			return ret;
		}
	}

2649
	/* Last one frees, either here or in bio completion for last sector */
2650 2651 2652 2653 2654
	scrub_block_put(sblock);
	return 0;
}

static int scrub_extent_for_parity(struct scrub_parity *sparity,
2655
				   u64 logical, u32 len,
2656 2657 2658 2659 2660 2661 2662 2663
				   u64 physical, struct btrfs_device *dev,
				   u64 flags, u64 gen, int mirror_num)
{
	struct scrub_ctx *sctx = sparity->sctx;
	int ret;
	u8 csum[BTRFS_CSUM_SIZE];
	u32 blocksize;

2664
	if (test_bit(BTRFS_DEV_STATE_MISSING, &dev->dev_state)) {
2665 2666 2667 2668
		scrub_parity_mark_sectors_error(sparity, logical, len);
		return 0;
	}

2669
	if (flags & BTRFS_EXTENT_FLAG_DATA) {
L
Liu Bo 已提交
2670
		blocksize = sparity->stripe_len;
2671
	} else if (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK) {
L
Liu Bo 已提交
2672
		blocksize = sparity->stripe_len;
2673
	} else {
2674
		blocksize = sctx->fs_info->sectorsize;
2675 2676 2677 2678
		WARN_ON(1);
	}

	while (len) {
2679
		u32 l = min(len, blocksize);
2680 2681 2682 2683
		int have_csum = 0;

		if (flags & BTRFS_EXTENT_FLAG_DATA) {
			/* push csums to sbio */
2684
			have_csum = scrub_find_csum(sctx, logical, csum);
2685 2686 2687
			if (have_csum == 0)
				goto skip;
		}
2688
		ret = scrub_sectors_for_parity(sparity, logical, l, physical, dev,
2689 2690 2691 2692
					     flags, gen, mirror_num,
					     have_csum ? csum : NULL);
		if (ret)
			return ret;
2693
skip:
2694 2695 2696 2697 2698 2699 2700
		len -= l;
		logical += l;
		physical += l;
	}
	return 0;
}

2701 2702 2703 2704 2705 2706 2707 2708
/*
 * Given a physical address, this will calculate it's
 * logical offset. if this is a parity stripe, it will return
 * the most left data stripe's logical offset.
 *
 * return 0 if it is a data stripe, 1 means parity stripe.
 */
static int get_raid56_logic_offset(u64 physical, int num,
2709 2710
				   struct map_lookup *map, u64 *offset,
				   u64 *stripe_start)
2711 2712 2713 2714 2715
{
	int i;
	int j = 0;
	u64 stripe_nr;
	u64 last_offset;
2716 2717
	u32 stripe_index;
	u32 rot;
2718
	const int data_stripes = nr_data_stripes(map);
2719

2720
	last_offset = (physical - map->stripes[num].physical) * data_stripes;
2721 2722 2723
	if (stripe_start)
		*stripe_start = last_offset;

2724
	*offset = last_offset;
2725
	for (i = 0; i < data_stripes; i++) {
2726 2727
		*offset = last_offset + i * map->stripe_len;

2728
		stripe_nr = div64_u64(*offset, map->stripe_len);
2729
		stripe_nr = div_u64(stripe_nr, data_stripes);
2730 2731

		/* Work out the disk rotation on this stripe-set */
2732
		stripe_nr = div_u64_rem(stripe_nr, map->num_stripes, &rot);
2733 2734
		/* calculate which stripe this data locates */
		rot += i;
2735
		stripe_index = rot % map->num_stripes;
2736 2737 2738 2739 2740 2741 2742 2743 2744
		if (stripe_index == num)
			return 0;
		if (stripe_index < num)
			j++;
	}
	*offset = last_offset + j * map->stripe_len;
	return 1;
}

2745 2746 2747
static void scrub_free_parity(struct scrub_parity *sparity)
{
	struct scrub_ctx *sctx = sparity->sctx;
2748
	struct scrub_sector *curr, *next;
2749 2750 2751 2752 2753 2754 2755 2756 2757 2758
	int nbits;

	nbits = bitmap_weight(sparity->ebitmap, sparity->nsectors);
	if (nbits) {
		spin_lock(&sctx->stat_lock);
		sctx->stat.read_errors += nbits;
		sctx->stat.uncorrectable_errors += nbits;
		spin_unlock(&sctx->stat_lock);
	}

2759
	list_for_each_entry_safe(curr, next, &sparity->sectors_list, list) {
2760
		list_del_init(&curr->list);
2761
		scrub_sector_put(curr);
2762 2763 2764 2765 2766
	}

	kfree(sparity);
}

2767
static void scrub_parity_bio_endio_worker(struct work_struct *work)
2768 2769 2770 2771 2772 2773 2774 2775 2776
{
	struct scrub_parity *sparity = container_of(work, struct scrub_parity,
						    work);
	struct scrub_ctx *sctx = sparity->sctx;

	scrub_free_parity(sparity);
	scrub_pending_bio_dec(sctx);
}

2777
static void scrub_parity_bio_endio(struct bio *bio)
2778
{
Y
Yu Zhe 已提交
2779
	struct scrub_parity *sparity = bio->bi_private;
2780
	struct btrfs_fs_info *fs_info = sparity->sctx->fs_info;
2781

2782
	if (bio->bi_status)
2783 2784 2785 2786
		bitmap_or(sparity->ebitmap, sparity->ebitmap, sparity->dbitmap,
			  sparity->nsectors);

	bio_put(bio);
2787

2788 2789
	INIT_WORK(&sparity->work, scrub_parity_bio_endio_worker);
	queue_work(fs_info->scrub_parity_workers, &sparity->work);
2790 2791 2792 2793 2794
}

static void scrub_parity_check_and_repair(struct scrub_parity *sparity)
{
	struct scrub_ctx *sctx = sparity->sctx;
2795
	struct btrfs_fs_info *fs_info = sctx->fs_info;
2796 2797
	struct bio *bio;
	struct btrfs_raid_bio *rbio;
2798
	struct btrfs_io_context *bioc = NULL;
2799 2800 2801 2802 2803 2804 2805
	u64 length;
	int ret;

	if (!bitmap_andnot(sparity->dbitmap, sparity->dbitmap, sparity->ebitmap,
			   sparity->nsectors))
		goto out;

2806
	length = sparity->logic_end - sparity->logic_start;
2807 2808

	btrfs_bio_counter_inc_blocked(fs_info);
2809
	ret = btrfs_map_sblock(fs_info, BTRFS_MAP_WRITE, sparity->logic_start,
2810 2811 2812
			       &length, &bioc);
	if (ret || !bioc || !bioc->raid_map)
		goto bioc_out;
2813

2814
	bio = bio_alloc(NULL, BIO_MAX_VECS, REQ_OP_READ, GFP_NOFS);
2815 2816 2817 2818
	bio->bi_iter.bi_sector = sparity->logic_start >> 9;
	bio->bi_private = sparity;
	bio->bi_end_io = scrub_parity_bio_endio;

2819 2820
	rbio = raid56_parity_alloc_scrub_rbio(bio, bioc, length,
					      sparity->scrub_dev,
2821 2822 2823 2824 2825 2826 2827 2828 2829 2830 2831
					      sparity->dbitmap,
					      sparity->nsectors);
	if (!rbio)
		goto rbio_out;

	scrub_pending_bio_inc(sctx);
	raid56_parity_submit_scrub_rbio(rbio);
	return;

rbio_out:
	bio_put(bio);
2832
bioc_out:
2833
	btrfs_bio_counter_dec(fs_info);
2834
	btrfs_put_bioc(bioc);
2835 2836 2837 2838 2839 2840 2841 2842 2843 2844 2845
	bitmap_or(sparity->ebitmap, sparity->ebitmap, sparity->dbitmap,
		  sparity->nsectors);
	spin_lock(&sctx->stat_lock);
	sctx->stat.malloc_errors++;
	spin_unlock(&sctx->stat_lock);
out:
	scrub_free_parity(sparity);
}

static inline int scrub_calc_parity_bitmap_len(int nsectors)
{
2846
	return DIV_ROUND_UP(nsectors, BITS_PER_LONG) * sizeof(long);
2847 2848 2849 2850
}

static void scrub_parity_get(struct scrub_parity *sparity)
{
2851
	refcount_inc(&sparity->refs);
2852 2853 2854 2855
}

static void scrub_parity_put(struct scrub_parity *sparity)
{
2856
	if (!refcount_dec_and_test(&sparity->refs))
2857 2858 2859 2860 2861 2862 2863 2864 2865 2866 2867
		return;

	scrub_parity_check_and_repair(sparity);
}

static noinline_for_stack int scrub_raid56_parity(struct scrub_ctx *sctx,
						  struct map_lookup *map,
						  struct btrfs_device *sdev,
						  u64 logic_start,
						  u64 logic_end)
{
2868
	struct btrfs_fs_info *fs_info = sctx->fs_info;
2869
	struct btrfs_root *root = btrfs_extent_root(fs_info, logic_start);
2870
	struct btrfs_root *csum_root;
2871
	struct btrfs_extent_item *extent;
2872
	struct btrfs_io_context *bioc = NULL;
2873
	struct btrfs_path *path;
2874 2875 2876 2877 2878 2879 2880 2881
	u64 flags;
	int ret;
	int slot;
	struct extent_buffer *l;
	struct btrfs_key key;
	u64 generation;
	u64 extent_logical;
	u64 extent_physical;
2882 2883
	/* Check the comment in scrub_stripe() for why u32 is enough here */
	u32 extent_len;
2884
	u64 mapped_length;
2885 2886 2887 2888 2889 2890 2891
	struct btrfs_device *extent_dev;
	struct scrub_parity *sparity;
	int nsectors;
	int bitmap_len;
	int extent_mirror_num;
	int stop_loop = 0;

2892 2893 2894 2895 2896 2897 2898 2899 2900 2901
	path = btrfs_alloc_path();
	if (!path) {
		spin_lock(&sctx->stat_lock);
		sctx->stat.malloc_errors++;
		spin_unlock(&sctx->stat_lock);
		return -ENOMEM;
	}
	path->search_commit_root = 1;
	path->skip_locking = 1;

2902
	ASSERT(map->stripe_len <= U32_MAX);
2903
	nsectors = map->stripe_len >> fs_info->sectorsize_bits;
2904 2905 2906 2907 2908 2909 2910
	bitmap_len = scrub_calc_parity_bitmap_len(nsectors);
	sparity = kzalloc(sizeof(struct scrub_parity) + 2 * bitmap_len,
			  GFP_NOFS);
	if (!sparity) {
		spin_lock(&sctx->stat_lock);
		sctx->stat.malloc_errors++;
		spin_unlock(&sctx->stat_lock);
2911
		btrfs_free_path(path);
2912 2913 2914
		return -ENOMEM;
	}

2915
	ASSERT(map->stripe_len <= U32_MAX);
2916 2917 2918 2919 2920 2921
	sparity->stripe_len = map->stripe_len;
	sparity->nsectors = nsectors;
	sparity->sctx = sctx;
	sparity->scrub_dev = sdev;
	sparity->logic_start = logic_start;
	sparity->logic_end = logic_end;
2922
	refcount_set(&sparity->refs, 1);
2923
	INIT_LIST_HEAD(&sparity->sectors_list);
2924 2925 2926 2927 2928 2929 2930 2931 2932 2933 2934 2935 2936 2937 2938 2939 2940 2941 2942 2943 2944 2945 2946 2947 2948 2949 2950 2951 2952 2953 2954 2955 2956 2957 2958 2959 2960 2961 2962 2963 2964 2965 2966 2967 2968 2969 2970
	sparity->dbitmap = sparity->bitmap;
	sparity->ebitmap = (void *)sparity->bitmap + bitmap_len;

	ret = 0;
	while (logic_start < logic_end) {
		if (btrfs_fs_incompat(fs_info, SKINNY_METADATA))
			key.type = BTRFS_METADATA_ITEM_KEY;
		else
			key.type = BTRFS_EXTENT_ITEM_KEY;
		key.objectid = logic_start;
		key.offset = (u64)-1;

		ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
		if (ret < 0)
			goto out;

		if (ret > 0) {
			ret = btrfs_previous_extent_item(root, path, 0);
			if (ret < 0)
				goto out;
			if (ret > 0) {
				btrfs_release_path(path);
				ret = btrfs_search_slot(NULL, root, &key,
							path, 0, 0);
				if (ret < 0)
					goto out;
			}
		}

		stop_loop = 0;
		while (1) {
			u64 bytes;

			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;

				stop_loop = 1;
				break;
			}
			btrfs_item_key_to_cpu(l, &key, slot);

2971 2972 2973 2974
			if (key.type != BTRFS_EXTENT_ITEM_KEY &&
			    key.type != BTRFS_METADATA_ITEM_KEY)
				goto next;

2975
			if (key.type == BTRFS_METADATA_ITEM_KEY)
2976
				bytes = fs_info->nodesize;
2977 2978 2979 2980 2981 2982
			else
				bytes = key.offset;

			if (key.objectid + bytes <= logic_start)
				goto next;

2983
			if (key.objectid >= logic_end) {
2984 2985 2986 2987 2988 2989 2990 2991 2992 2993 2994 2995
				stop_loop = 1;
				break;
			}

			while (key.objectid >= logic_start + map->stripe_len)
				logic_start += map->stripe_len;

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

2996 2997 2998 2999
			if ((flags & BTRFS_EXTENT_FLAG_TREE_BLOCK) &&
			    (key.objectid < logic_start ||
			     key.objectid + bytes >
			     logic_start + map->stripe_len)) {
J
Jeff Mahoney 已提交
3000 3001
				btrfs_err(fs_info,
					  "scrub: tree block %llu spanning stripes, ignored. logical=%llu",
3002
					  key.objectid, logic_start);
3003 3004 3005
				spin_lock(&sctx->stat_lock);
				sctx->stat.uncorrectable_errors++;
				spin_unlock(&sctx->stat_lock);
3006 3007 3008 3009
				goto next;
			}
again:
			extent_logical = key.objectid;
3010
			ASSERT(bytes <= U32_MAX);
3011 3012 3013 3014 3015 3016 3017 3018 3019 3020 3021 3022 3023 3024 3025
			extent_len = bytes;

			if (extent_logical < logic_start) {
				extent_len -= logic_start - extent_logical;
				extent_logical = logic_start;
			}

			if (extent_logical + extent_len >
			    logic_start + map->stripe_len)
				extent_len = logic_start + map->stripe_len -
					     extent_logical;

			scrub_parity_mark_sectors_data(sparity, extent_logical,
						       extent_len);

3026
			mapped_length = extent_len;
3027
			bioc = NULL;
3028
			ret = btrfs_map_block(fs_info, BTRFS_MAP_READ,
3029
					extent_logical, &mapped_length, &bioc,
3030
					0);
3031
			if (!ret) {
3032
				if (!bioc || mapped_length < extent_len)
3033 3034 3035
					ret = -EIO;
			}
			if (ret) {
3036
				btrfs_put_bioc(bioc);
3037 3038
				goto out;
			}
3039 3040 3041 3042
			extent_physical = bioc->stripes[0].physical;
			extent_mirror_num = bioc->mirror_num;
			extent_dev = bioc->stripes[0].dev;
			btrfs_put_bioc(bioc);
3043

3044
			csum_root = btrfs_csum_root(fs_info, extent_logical);
3045 3046 3047 3048 3049 3050 3051 3052 3053 3054 3055 3056 3057
			ret = btrfs_lookup_csums_range(csum_root,
						extent_logical,
						extent_logical + extent_len - 1,
						&sctx->csum_list, 1);
			if (ret)
				goto out;

			ret = scrub_extent_for_parity(sparity, extent_logical,
						      extent_len,
						      extent_physical,
						      extent_dev, flags,
						      generation,
						      extent_mirror_num);
3058 3059 3060

			scrub_free_csums(sctx);

3061 3062 3063 3064 3065 3066 3067 3068 3069 3070 3071 3072 3073 3074 3075 3076 3077 3078 3079 3080 3081 3082 3083 3084 3085 3086 3087 3088 3089
			if (ret)
				goto out;

			if (extent_logical + extent_len <
			    key.objectid + bytes) {
				logic_start += map->stripe_len;

				if (logic_start >= logic_end) {
					stop_loop = 1;
					break;
				}

				if (logic_start < key.objectid + bytes) {
					cond_resched();
					goto again;
				}
			}
next:
			path->slots[0]++;
		}

		btrfs_release_path(path);

		if (stop_loop)
			break;

		logic_start += map->stripe_len;
	}
out:
3090 3091
	if (ret < 0) {
		ASSERT(logic_end - logic_start <= U32_MAX);
3092
		scrub_parity_mark_sectors_error(sparity, logic_start,
3093
						logic_end - logic_start);
3094
	}
3095 3096
	scrub_parity_put(sparity);
	scrub_submit(sctx);
3097
	mutex_lock(&sctx->wr_lock);
3098
	scrub_wr_submit(sctx);
3099
	mutex_unlock(&sctx->wr_lock);
3100

3101
	btrfs_free_path(path);
3102 3103 3104
	return ret < 0 ? ret : 0;
}

3105 3106 3107 3108 3109 3110 3111 3112 3113 3114 3115 3116 3117 3118
static void sync_replace_for_zoned(struct scrub_ctx *sctx)
{
	if (!btrfs_is_zoned(sctx->fs_info))
		return;

	sctx->flush_all_writes = true;
	scrub_submit(sctx);
	mutex_lock(&sctx->wr_lock);
	scrub_wr_submit(sctx);
	mutex_unlock(&sctx->wr_lock);

	wait_event(sctx->list_wait, atomic_read(&sctx->bios_in_flight) == 0);
}

3119 3120 3121 3122 3123 3124 3125 3126 3127 3128 3129 3130 3131 3132 3133 3134 3135 3136 3137 3138 3139 3140 3141 3142 3143 3144
static int sync_write_pointer_for_zoned(struct scrub_ctx *sctx, u64 logical,
					u64 physical, u64 physical_end)
{
	struct btrfs_fs_info *fs_info = sctx->fs_info;
	int ret = 0;

	if (!btrfs_is_zoned(fs_info))
		return 0;

	wait_event(sctx->list_wait, atomic_read(&sctx->bios_in_flight) == 0);

	mutex_lock(&sctx->wr_lock);
	if (sctx->write_pointer < physical_end) {
		ret = btrfs_sync_zone_write_pointer(sctx->wr_tgtdev, logical,
						    physical,
						    sctx->write_pointer);
		if (ret)
			btrfs_err(fs_info,
				  "zoned: failed to recover write pointer");
	}
	mutex_unlock(&sctx->wr_lock);
	btrfs_dev_clear_zone_empty(sctx->wr_tgtdev, physical);

	return ret;
}

3145
static noinline_for_stack int scrub_stripe(struct scrub_ctx *sctx,
3146
					   struct btrfs_block_group *bg,
3147 3148
					   struct map_lookup *map,
					   struct btrfs_device *scrub_dev,
3149
					   int stripe_index, u64 dev_extent_len)
A
Arne Jansen 已提交
3150
{
3151
	struct btrfs_path *path;
3152
	struct btrfs_fs_info *fs_info = sctx->fs_info;
3153
	struct btrfs_root *root;
3154
	struct btrfs_root *csum_root;
A
Arne Jansen 已提交
3155
	struct btrfs_extent_item *extent;
3156
	struct blk_plug plug;
3157
	const u64 chunk_logical = bg->start;
A
Arne Jansen 已提交
3158 3159 3160 3161 3162 3163 3164
	u64 flags;
	int ret;
	int slot;
	u64 nstripes;
	struct extent_buffer *l;
	u64 physical;
	u64 logical;
L
Liu Bo 已提交
3165
	u64 logic_end;
3166
	u64 physical_end;
A
Arne Jansen 已提交
3167
	u64 generation;
3168
	int mirror_num;
3169
	struct btrfs_key key;
3170
	u64 increment;
A
Arne Jansen 已提交
3171
	u64 offset;
3172 3173
	u64 extent_logical;
	u64 extent_physical;
3174 3175 3176 3177 3178
	/*
	 * Unlike chunk length, extent length should never go beyond
	 * BTRFS_MAX_EXTENT_SIZE, thus u32 is enough here.
	 */
	u32 extent_len;
3179 3180
	u64 stripe_logical;
	u64 stripe_end;
3181 3182
	struct btrfs_device *extent_dev;
	int extent_mirror_num;
3183
	int stop_loop = 0;
D
David Woodhouse 已提交
3184

3185
	physical = map->stripes[stripe_index].physical;
A
Arne Jansen 已提交
3186
	offset = 0;
3187
	nstripes = div64_u64(dev_extent_len, map->stripe_len);
3188 3189
	mirror_num = 1;
	increment = map->stripe_len;
A
Arne Jansen 已提交
3190
	if (map->type & BTRFS_BLOCK_GROUP_RAID0) {
3191
		offset = map->stripe_len * stripe_index;
A
Arne Jansen 已提交
3192 3193 3194
		increment = map->stripe_len * map->num_stripes;
	} else if (map->type & BTRFS_BLOCK_GROUP_RAID10) {
		int factor = map->num_stripes / map->sub_stripes;
3195
		offset = map->stripe_len * (stripe_index / map->sub_stripes);
A
Arne Jansen 已提交
3196
		increment = map->stripe_len * factor;
3197
		mirror_num = stripe_index % map->sub_stripes + 1;
3198
	} else if (map->type & BTRFS_BLOCK_GROUP_RAID1_MASK) {
3199
		mirror_num = stripe_index % map->num_stripes + 1;
A
Arne Jansen 已提交
3200
	} else if (map->type & BTRFS_BLOCK_GROUP_DUP) {
3201
		mirror_num = stripe_index % map->num_stripes + 1;
3202
	} else if (map->type & BTRFS_BLOCK_GROUP_RAID56_MASK) {
3203 3204
		get_raid56_logic_offset(physical, stripe_index, map, &offset,
					NULL);
3205
		increment = map->stripe_len * nr_data_stripes(map);
A
Arne Jansen 已提交
3206 3207 3208 3209 3210 3211
	}

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

3212 3213 3214 3215 3216
	/*
	 * 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 已提交
3217 3218
	path->search_commit_root = 1;
	path->skip_locking = 1;
3219
	path->reada = READA_FORWARD;
A
Arne Jansen 已提交
3220

3221
	logical = chunk_logical + offset;
3222
	physical_end = physical + nstripes * map->stripe_len;
3223
	if (map->type & BTRFS_BLOCK_GROUP_RAID56_MASK) {
3224
		get_raid56_logic_offset(physical_end, stripe_index,
3225
					map, &logic_end, NULL);
3226
		logic_end += chunk_logical;
3227 3228 3229
	} else {
		logic_end = logical + increment * nstripes;
	}
3230
	wait_event(sctx->list_wait,
3231
		   atomic_read(&sctx->bios_in_flight) == 0);
3232
	scrub_blocked_if_needed(fs_info);
A
Arne Jansen 已提交
3233

3234
	root = btrfs_extent_root(fs_info, logical);
3235 3236
	csum_root = btrfs_csum_root(fs_info, logical);

A
Arne Jansen 已提交
3237 3238 3239 3240
	/*
	 * collect all data csums for the stripe to avoid seeking during
	 * the scrub. This might currently (crc32) end up to be about 1MB
	 */
3241
	blk_start_plug(&plug);
A
Arne Jansen 已提交
3242

3243 3244 3245 3246 3247 3248 3249 3250
	if (sctx->is_dev_replace &&
	    btrfs_dev_is_sequential(sctx->wr_tgtdev, physical)) {
		mutex_lock(&sctx->wr_lock);
		sctx->write_pointer = physical;
		mutex_unlock(&sctx->wr_lock);
		sctx->flush_all_writes = true;
	}

A
Arne Jansen 已提交
3251 3252 3253 3254
	/*
	 * now find all extents for each stripe and scrub them
	 */
	ret = 0;
3255
	while (physical < physical_end) {
A
Arne Jansen 已提交
3256 3257 3258 3259
		/*
		 * canceled?
		 */
		if (atomic_read(&fs_info->scrub_cancel_req) ||
3260
		    atomic_read(&sctx->cancel_req)) {
A
Arne Jansen 已提交
3261 3262 3263 3264 3265 3266 3267 3268
			ret = -ECANCELED;
			goto out;
		}
		/*
		 * check to see if we have to pause
		 */
		if (atomic_read(&fs_info->scrub_pause_req)) {
			/* push queued extents */
3269
			sctx->flush_all_writes = true;
3270
			scrub_submit(sctx);
3271
			mutex_lock(&sctx->wr_lock);
3272
			scrub_wr_submit(sctx);
3273
			mutex_unlock(&sctx->wr_lock);
3274
			wait_event(sctx->list_wait,
3275
				   atomic_read(&sctx->bios_in_flight) == 0);
3276
			sctx->flush_all_writes = false;
3277
			scrub_blocked_if_needed(fs_info);
A
Arne Jansen 已提交
3278 3279
		}

3280
		if (map->type & BTRFS_BLOCK_GROUP_RAID56_MASK) {
3281 3282
			ret = get_raid56_logic_offset(physical, stripe_index,
						      map, &logical,
3283
						      &stripe_logical);
3284
			logical += chunk_logical;
3285
			if (ret) {
3286
				/* it is parity strip */
3287
				stripe_logical += chunk_logical;
3288
				stripe_end = stripe_logical + increment;
3289
				ret = scrub_raid56_parity(sctx, map, scrub_dev,
3290
							  stripe_logical,
3291 3292 3293 3294 3295 3296 3297
							  stripe_end);
				if (ret)
					goto out;
				goto skip;
			}
		}

3298 3299 3300 3301
		if (btrfs_fs_incompat(fs_info, SKINNY_METADATA))
			key.type = BTRFS_METADATA_ITEM_KEY;
		else
			key.type = BTRFS_EXTENT_ITEM_KEY;
A
Arne Jansen 已提交
3302
		key.objectid = logical;
L
Liu Bo 已提交
3303
		key.offset = (u64)-1;
A
Arne Jansen 已提交
3304 3305 3306 3307

		ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
		if (ret < 0)
			goto out;
3308

3309
		if (ret > 0) {
3310
			ret = btrfs_previous_extent_item(root, path, 0);
A
Arne Jansen 已提交
3311 3312
			if (ret < 0)
				goto out;
3313 3314 3315 3316 3317 3318 3319 3320 3321
			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 已提交
3322 3323
		}

L
Liu Bo 已提交
3324
		stop_loop = 0;
A
Arne Jansen 已提交
3325
		while (1) {
3326 3327
			u64 bytes;

A
Arne Jansen 已提交
3328 3329 3330 3331 3332 3333 3334 3335 3336
			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;

L
Liu Bo 已提交
3337
				stop_loop = 1;
A
Arne Jansen 已提交
3338 3339 3340 3341
				break;
			}
			btrfs_item_key_to_cpu(l, &key, slot);

3342 3343 3344 3345
			if (key.type != BTRFS_EXTENT_ITEM_KEY &&
			    key.type != BTRFS_METADATA_ITEM_KEY)
				goto next;

3346
			if (key.type == BTRFS_METADATA_ITEM_KEY)
3347
				bytes = fs_info->nodesize;
3348 3349 3350 3351
			else
				bytes = key.offset;

			if (key.objectid + bytes <= logical)
A
Arne Jansen 已提交
3352 3353
				goto next;

L
Liu Bo 已提交
3354 3355 3356 3357 3358 3359
			if (key.objectid >= logical + map->stripe_len) {
				/* out of this device extent */
				if (key.objectid >= logic_end)
					stop_loop = 1;
				break;
			}
A
Arne Jansen 已提交
3360

3361 3362 3363 3364 3365 3366
			/*
			 * If our block group was removed in the meanwhile, just
			 * stop scrubbing since there is no point in continuing.
			 * Continuing would prevent reusing its device extents
			 * for new block groups for a long time.
			 */
3367 3368 3369
			spin_lock(&bg->lock);
			if (bg->removed) {
				spin_unlock(&bg->lock);
3370 3371 3372
				ret = 0;
				goto out;
			}
3373
			spin_unlock(&bg->lock);
3374

A
Arne Jansen 已提交
3375 3376 3377 3378 3379
			extent = btrfs_item_ptr(l, slot,
						struct btrfs_extent_item);
			flags = btrfs_extent_flags(l, extent);
			generation = btrfs_extent_generation(l, extent);

3380 3381 3382 3383
			if ((flags & BTRFS_EXTENT_FLAG_TREE_BLOCK) &&
			    (key.objectid < logical ||
			     key.objectid + bytes >
			     logical + map->stripe_len)) {
3384
				btrfs_err(fs_info,
J
Jeff Mahoney 已提交
3385
					   "scrub: tree block %llu spanning stripes, ignored. logical=%llu",
3386
				       key.objectid, logical);
3387 3388 3389
				spin_lock(&sctx->stat_lock);
				sctx->stat.uncorrectable_errors++;
				spin_unlock(&sctx->stat_lock);
A
Arne Jansen 已提交
3390 3391 3392
				goto next;
			}

L
Liu Bo 已提交
3393 3394
again:
			extent_logical = key.objectid;
3395
			ASSERT(bytes <= U32_MAX);
L
Liu Bo 已提交
3396 3397
			extent_len = bytes;

A
Arne Jansen 已提交
3398 3399 3400
			/*
			 * trim extent to this stripe
			 */
L
Liu Bo 已提交
3401 3402 3403
			if (extent_logical < logical) {
				extent_len -= logical - extent_logical;
				extent_logical = logical;
A
Arne Jansen 已提交
3404
			}
L
Liu Bo 已提交
3405
			if (extent_logical + extent_len >
A
Arne Jansen 已提交
3406
			    logical + map->stripe_len) {
L
Liu Bo 已提交
3407 3408
				extent_len = logical + map->stripe_len -
					     extent_logical;
A
Arne Jansen 已提交
3409 3410
			}

L
Liu Bo 已提交
3411
			extent_physical = extent_logical - logical + physical;
3412 3413
			extent_dev = scrub_dev;
			extent_mirror_num = mirror_num;
3414
			if (sctx->is_dev_replace)
3415 3416 3417 3418
				scrub_remap_extent(fs_info, extent_logical,
						   extent_len, &extent_physical,
						   &extent_dev,
						   &extent_mirror_num);
L
Liu Bo 已提交
3419

3420 3421 3422 3423 3424 3425 3426 3427
			if (flags & BTRFS_EXTENT_FLAG_DATA) {
				ret = btrfs_lookup_csums_range(csum_root,
						extent_logical,
						extent_logical + extent_len - 1,
						&sctx->csum_list, 1);
				if (ret)
					goto out;
			}
L
Liu Bo 已提交
3428

L
Liu Bo 已提交
3429
			ret = scrub_extent(sctx, map, extent_logical, extent_len,
3430 3431
					   extent_physical, extent_dev, flags,
					   generation, extent_mirror_num,
3432
					   extent_logical - logical + physical);
3433 3434 3435

			scrub_free_csums(sctx);

A
Arne Jansen 已提交
3436 3437 3438
			if (ret)
				goto out;

3439 3440 3441
			if (sctx->is_dev_replace)
				sync_replace_for_zoned(sctx);

L
Liu Bo 已提交
3442 3443
			if (extent_logical + extent_len <
			    key.objectid + bytes) {
3444
				if (map->type & BTRFS_BLOCK_GROUP_RAID56_MASK) {
3445 3446 3447 3448
					/*
					 * loop until we find next data stripe
					 * or we have finished all stripes.
					 */
3449 3450 3451
loop:
					physical += map->stripe_len;
					ret = get_raid56_logic_offset(physical,
3452 3453 3454
							stripe_index, map,
							&logical, &stripe_logical);
					logical += chunk_logical;
3455 3456

					if (ret && physical < physical_end) {
3457
						stripe_logical += chunk_logical;
3458
						stripe_end = stripe_logical +
3459
								increment;
3460
						ret = scrub_raid56_parity(sctx,
3461
							map, scrub_dev,
3462 3463 3464 3465 3466 3467
							stripe_logical,
							stripe_end);
						if (ret)
							goto out;
						goto loop;
					}
3468 3469 3470 3471
				} else {
					physical += map->stripe_len;
					logical += increment;
				}
L
Liu Bo 已提交
3472 3473 3474 3475 3476
				if (logical < key.objectid + bytes) {
					cond_resched();
					goto again;
				}

3477
				if (physical >= physical_end) {
L
Liu Bo 已提交
3478 3479 3480 3481
					stop_loop = 1;
					break;
				}
			}
A
Arne Jansen 已提交
3482 3483 3484
next:
			path->slots[0]++;
		}
C
Chris Mason 已提交
3485
		btrfs_release_path(path);
3486
skip:
A
Arne Jansen 已提交
3487 3488
		logical += increment;
		physical += map->stripe_len;
3489
		spin_lock(&sctx->stat_lock);
L
Liu Bo 已提交
3490
		if (stop_loop)
3491 3492
			sctx->stat.last_physical = map->stripes[stripe_index].physical +
						   dev_extent_len;
L
Liu Bo 已提交
3493 3494
		else
			sctx->stat.last_physical = physical;
3495
		spin_unlock(&sctx->stat_lock);
L
Liu Bo 已提交
3496 3497
		if (stop_loop)
			break;
A
Arne Jansen 已提交
3498
	}
3499
out:
A
Arne Jansen 已提交
3500
	/* push queued extents */
3501
	scrub_submit(sctx);
3502
	mutex_lock(&sctx->wr_lock);
3503
	scrub_wr_submit(sctx);
3504
	mutex_unlock(&sctx->wr_lock);
A
Arne Jansen 已提交
3505

3506
	blk_finish_plug(&plug);
A
Arne Jansen 已提交
3507
	btrfs_free_path(path);
3508 3509 3510 3511

	if (sctx->is_dev_replace && ret >= 0) {
		int ret2;

3512 3513 3514 3515
		ret2 = sync_write_pointer_for_zoned(sctx,
				chunk_logical + offset,
				map->stripes[stripe_index].physical,
				physical_end);
3516 3517 3518 3519
		if (ret2)
			ret = ret2;
	}

A
Arne Jansen 已提交
3520 3521 3522
	return ret < 0 ? ret : 0;
}

3523
static noinline_for_stack int scrub_chunk(struct scrub_ctx *sctx,
3524
					  struct btrfs_block_group *bg,
3525
					  struct btrfs_device *scrub_dev,
3526
					  u64 dev_offset,
3527
					  u64 dev_extent_len)
A
Arne Jansen 已提交
3528
{
3529
	struct btrfs_fs_info *fs_info = sctx->fs_info;
3530
	struct extent_map_tree *map_tree = &fs_info->mapping_tree;
A
Arne Jansen 已提交
3531 3532 3533
	struct map_lookup *map;
	struct extent_map *em;
	int i;
3534
	int ret = 0;
A
Arne Jansen 已提交
3535

3536
	read_lock(&map_tree->lock);
3537
	em = lookup_extent_mapping(map_tree, bg->start, bg->length);
3538
	read_unlock(&map_tree->lock);
A
Arne Jansen 已提交
3539

3540 3541 3542 3543 3544
	if (!em) {
		/*
		 * Might have been an unused block group deleted by the cleaner
		 * kthread or relocation.
		 */
3545 3546
		spin_lock(&bg->lock);
		if (!bg->removed)
3547
			ret = -EINVAL;
3548
		spin_unlock(&bg->lock);
3549 3550 3551

		return ret;
	}
3552
	if (em->start != bg->start)
A
Arne Jansen 已提交
3553
		goto out;
3554
	if (em->len < dev_extent_len)
A
Arne Jansen 已提交
3555 3556
		goto out;

3557
	map = em->map_lookup;
A
Arne Jansen 已提交
3558
	for (i = 0; i < map->num_stripes; ++i) {
3559
		if (map->stripes[i].dev->bdev == scrub_dev->bdev &&
3560
		    map->stripes[i].physical == dev_offset) {
3561 3562
			ret = scrub_stripe(sctx, bg, map, scrub_dev, i,
					   dev_extent_len);
A
Arne Jansen 已提交
3563 3564 3565 3566 3567 3568 3569 3570 3571 3572
			if (ret)
				goto out;
		}
	}
out:
	free_extent_map(em);

	return ret;
}

3573 3574 3575 3576 3577 3578 3579 3580 3581 3582 3583 3584 3585 3586 3587 3588 3589 3590 3591
static int finish_extent_writes_for_zoned(struct btrfs_root *root,
					  struct btrfs_block_group *cache)
{
	struct btrfs_fs_info *fs_info = cache->fs_info;
	struct btrfs_trans_handle *trans;

	if (!btrfs_is_zoned(fs_info))
		return 0;

	btrfs_wait_block_group_reservations(cache);
	btrfs_wait_nocow_writers(cache);
	btrfs_wait_ordered_roots(fs_info, U64_MAX, cache->start, cache->length);

	trans = btrfs_join_transaction(root);
	if (IS_ERR(trans))
		return PTR_ERR(trans);
	return btrfs_commit_transaction(trans);
}

A
Arne Jansen 已提交
3592
static noinline_for_stack
3593
int scrub_enumerate_chunks(struct scrub_ctx *sctx,
3594
			   struct btrfs_device *scrub_dev, u64 start, u64 end)
A
Arne Jansen 已提交
3595 3596 3597
{
	struct btrfs_dev_extent *dev_extent = NULL;
	struct btrfs_path *path;
3598 3599
	struct btrfs_fs_info *fs_info = sctx->fs_info;
	struct btrfs_root *root = fs_info->dev_root;
A
Arne Jansen 已提交
3600
	u64 chunk_offset;
3601
	int ret = 0;
3602
	int ro_set;
A
Arne Jansen 已提交
3603 3604 3605 3606
	int slot;
	struct extent_buffer *l;
	struct btrfs_key key;
	struct btrfs_key found_key;
3607
	struct btrfs_block_group *cache;
3608
	struct btrfs_dev_replace *dev_replace = &fs_info->dev_replace;
A
Arne Jansen 已提交
3609 3610 3611 3612 3613

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

3614
	path->reada = READA_FORWARD;
A
Arne Jansen 已提交
3615 3616 3617
	path->search_commit_root = 1;
	path->skip_locking = 1;

3618
	key.objectid = scrub_dev->devid;
A
Arne Jansen 已提交
3619 3620 3621 3622
	key.offset = 0ull;
	key.type = BTRFS_DEV_EXTENT_KEY;

	while (1) {
3623 3624
		u64 dev_extent_len;

A
Arne Jansen 已提交
3625 3626
		ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
		if (ret < 0)
3627 3628 3629 3630 3631
			break;
		if (ret > 0) {
			if (path->slots[0] >=
			    btrfs_header_nritems(path->nodes[0])) {
				ret = btrfs_next_leaf(root, path);
3632 3633 3634 3635
				if (ret < 0)
					break;
				if (ret > 0) {
					ret = 0;
3636
					break;
3637 3638 3639
				}
			} else {
				ret = 0;
3640 3641
			}
		}
A
Arne Jansen 已提交
3642 3643 3644 3645 3646 3647

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

		btrfs_item_key_to_cpu(l, &found_key, slot);

3648
		if (found_key.objectid != scrub_dev->devid)
A
Arne Jansen 已提交
3649 3650
			break;

3651
		if (found_key.type != BTRFS_DEV_EXTENT_KEY)
A
Arne Jansen 已提交
3652 3653 3654 3655 3656 3657 3658 3659 3660
			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);
3661
		dev_extent_len = btrfs_dev_extent_length(l, dev_extent);
A
Arne Jansen 已提交
3662

3663
		if (found_key.offset + dev_extent_len <= start)
3664
			goto skip;
A
Arne Jansen 已提交
3665 3666 3667 3668 3669 3670 3671 3672

		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);
3673 3674 3675 3676 3677 3678

		/* some chunks are removed but not committed to disk yet,
		 * continue scrubbing */
		if (!cache)
			goto skip;

3679 3680 3681 3682 3683 3684 3685 3686 3687 3688 3689 3690 3691 3692 3693 3694 3695 3696 3697 3698 3699 3700 3701 3702 3703
		ASSERT(cache->start <= chunk_offset);
		/*
		 * We are using the commit root to search for device extents, so
		 * that means we could have found a device extent item from a
		 * block group that was deleted in the current transaction. The
		 * logical start offset of the deleted block group, stored at
		 * @chunk_offset, might be part of the logical address range of
		 * a new block group (which uses different physical extents).
		 * In this case btrfs_lookup_block_group() has returned the new
		 * block group, and its start address is less than @chunk_offset.
		 *
		 * We skip such new block groups, because it's pointless to
		 * process them, as we won't find their extents because we search
		 * for them using the commit root of the extent tree. For a device
		 * replace it's also fine to skip it, we won't miss copying them
		 * to the target device because we have the write duplication
		 * setup through the regular write path (by btrfs_map_block()),
		 * and we have committed a transaction when we started the device
		 * replace, right after setting up the device replace state.
		 */
		if (cache->start < chunk_offset) {
			btrfs_put_block_group(cache);
			goto skip;
		}

3704 3705 3706 3707
		if (sctx->is_dev_replace && btrfs_is_zoned(fs_info)) {
			spin_lock(&cache->lock);
			if (!cache->to_copy) {
				spin_unlock(&cache->lock);
3708 3709
				btrfs_put_block_group(cache);
				goto skip;
3710 3711 3712 3713
			}
			spin_unlock(&cache->lock);
		}

3714 3715 3716 3717 3718 3719 3720 3721 3722 3723 3724 3725 3726 3727
		/*
		 * Make sure that while we are scrubbing the corresponding block
		 * group doesn't get its logical address and its device extents
		 * reused for another block group, which can possibly be of a
		 * different type and different profile. We do this to prevent
		 * false error detections and crashes due to bogus attempts to
		 * repair extents.
		 */
		spin_lock(&cache->lock);
		if (cache->removed) {
			spin_unlock(&cache->lock);
			btrfs_put_block_group(cache);
			goto skip;
		}
3728
		btrfs_freeze_block_group(cache);
3729 3730
		spin_unlock(&cache->lock);

3731 3732 3733 3734 3735 3736 3737 3738 3739
		/*
		 * we need call btrfs_inc_block_group_ro() with scrubs_paused,
		 * to avoid deadlock caused by:
		 * btrfs_inc_block_group_ro()
		 * -> btrfs_wait_for_commit()
		 * -> btrfs_commit_transaction()
		 * -> btrfs_scrub_pause()
		 */
		scrub_pause_on(fs_info);
3740 3741 3742 3743 3744 3745 3746 3747 3748 3749 3750 3751 3752 3753 3754 3755 3756 3757

		/*
		 * Don't do chunk preallocation for scrub.
		 *
		 * This is especially important for SYSTEM bgs, or we can hit
		 * -EFBIG from btrfs_finish_chunk_alloc() like:
		 * 1. The only SYSTEM bg is marked RO.
		 *    Since SYSTEM bg is small, that's pretty common.
		 * 2. New SYSTEM bg will be allocated
		 *    Due to regular version will allocate new chunk.
		 * 3. New SYSTEM bg is empty and will get cleaned up
		 *    Before cleanup really happens, it's marked RO again.
		 * 4. Empty SYSTEM bg get scrubbed
		 *    We go back to 2.
		 *
		 * This can easily boost the amount of SYSTEM chunks if cleaner
		 * thread can't be triggered fast enough, and use up all space
		 * of btrfs_super_block::sys_chunk_array
3758 3759 3760 3761 3762 3763 3764 3765 3766 3767 3768 3769
		 *
		 * While for dev replace, we need to try our best to mark block
		 * group RO, to prevent race between:
		 * - Write duplication
		 *   Contains latest data
		 * - Scrub copy
		 *   Contains data from commit tree
		 *
		 * If target block group is not marked RO, nocow writes can
		 * be overwritten by scrub copy, causing data corruption.
		 * So for dev-replace, it's not allowed to continue if a block
		 * group is not RO.
3770
		 */
3771
		ret = btrfs_inc_block_group_ro(cache, sctx->is_dev_replace);
3772 3773 3774 3775 3776 3777 3778 3779 3780 3781
		if (!ret && sctx->is_dev_replace) {
			ret = finish_extent_writes_for_zoned(root, cache);
			if (ret) {
				btrfs_dec_block_group_ro(cache);
				scrub_pause_off(fs_info);
				btrfs_put_block_group(cache);
				break;
			}
		}

3782 3783
		if (ret == 0) {
			ro_set = 1;
3784
		} else if (ret == -ENOSPC && !sctx->is_dev_replace) {
3785 3786 3787
			/*
			 * btrfs_inc_block_group_ro return -ENOSPC when it
			 * failed in creating new chunk for metadata.
3788
			 * It is not a problem for scrub, because
3789 3790 3791 3792
			 * metadata are always cowed, and our scrub paused
			 * commit_transactions.
			 */
			ro_set = 0;
3793 3794 3795 3796 3797 3798 3799
		} else if (ret == -ETXTBSY) {
			btrfs_warn(fs_info,
		   "skipping scrub of block group %llu due to active swapfile",
				   cache->start);
			scrub_pause_off(fs_info);
			ret = 0;
			goto skip_unfreeze;
3800
		} else {
J
Jeff Mahoney 已提交
3801
			btrfs_warn(fs_info,
3802
				   "failed setting block group ro: %d", ret);
3803
			btrfs_unfreeze_block_group(cache);
3804
			btrfs_put_block_group(cache);
3805
			scrub_pause_off(fs_info);
3806 3807 3808
			break;
		}

3809 3810 3811 3812 3813 3814 3815 3816 3817 3818 3819 3820
		/*
		 * Now the target block is marked RO, wait for nocow writes to
		 * finish before dev-replace.
		 * COW is fine, as COW never overwrites extents in commit tree.
		 */
		if (sctx->is_dev_replace) {
			btrfs_wait_nocow_writers(cache);
			btrfs_wait_ordered_roots(fs_info, U64_MAX, cache->start,
					cache->length);
		}

		scrub_pause_off(fs_info);
3821
		down_write(&dev_replace->rwsem);
3822
		dev_replace->cursor_right = found_key.offset + dev_extent_len;
3823 3824
		dev_replace->cursor_left = found_key.offset;
		dev_replace->item_needs_writeback = 1;
3825 3826
		up_write(&dev_replace->rwsem);

3827 3828
		ret = scrub_chunk(sctx, cache, scrub_dev, found_key.offset,
				  dev_extent_len);
3829 3830 3831 3832 3833 3834 3835 3836 3837 3838 3839

		/*
		 * flush, submit all pending read and write bios, afterwards
		 * wait for them.
		 * Note that in the dev replace case, a read request causes
		 * write requests that are submitted in the read completion
		 * worker. Therefore in the current situation, it is required
		 * that all write requests are flushed, so that all read and
		 * write requests are really completed when bios_in_flight
		 * changes to 0.
		 */
3840
		sctx->flush_all_writes = true;
3841
		scrub_submit(sctx);
3842
		mutex_lock(&sctx->wr_lock);
3843
		scrub_wr_submit(sctx);
3844
		mutex_unlock(&sctx->wr_lock);
3845 3846 3847

		wait_event(sctx->list_wait,
			   atomic_read(&sctx->bios_in_flight) == 0);
3848 3849

		scrub_pause_on(fs_info);
3850 3851 3852 3853 3854 3855

		/*
		 * must be called before we decrease @scrub_paused.
		 * make sure we don't block transaction commit while
		 * we are waiting pending workers finished.
		 */
3856 3857
		wait_event(sctx->list_wait,
			   atomic_read(&sctx->workers_pending) == 0);
3858
		sctx->flush_all_writes = false;
3859

3860
		scrub_pause_off(fs_info);
3861

3862 3863 3864 3865 3866
		if (sctx->is_dev_replace &&
		    !btrfs_finish_block_group_to_copy(dev_replace->srcdev,
						      cache, found_key.offset))
			ro_set = 0;

3867
		down_write(&dev_replace->rwsem);
3868 3869
		dev_replace->cursor_left = dev_replace->cursor_right;
		dev_replace->item_needs_writeback = 1;
3870
		up_write(&dev_replace->rwsem);
3871

3872
		if (ro_set)
3873
			btrfs_dec_block_group_ro(cache);
3874

3875 3876 3877 3878 3879 3880 3881 3882 3883
		/*
		 * We might have prevented the cleaner kthread from deleting
		 * this block group if it was already unused because we raced
		 * and set it to RO mode first. So add it back to the unused
		 * list, otherwise it might not ever be deleted unless a manual
		 * balance is triggered or it becomes used and unused again.
		 */
		spin_lock(&cache->lock);
		if (!cache->removed && !cache->ro && cache->reserved == 0 &&
3884
		    cache->used == 0) {
3885
			spin_unlock(&cache->lock);
3886 3887 3888 3889 3890
			if (btrfs_test_opt(fs_info, DISCARD_ASYNC))
				btrfs_discard_queue_work(&fs_info->discard_ctl,
							 cache);
			else
				btrfs_mark_bg_unused(cache);
3891 3892 3893
		} else {
			spin_unlock(&cache->lock);
		}
3894
skip_unfreeze:
3895
		btrfs_unfreeze_block_group(cache);
A
Arne Jansen 已提交
3896 3897 3898
		btrfs_put_block_group(cache);
		if (ret)
			break;
3899
		if (sctx->is_dev_replace &&
3900
		    atomic64_read(&dev_replace->num_write_errors) > 0) {
3901 3902 3903 3904 3905 3906 3907
			ret = -EIO;
			break;
		}
		if (sctx->stat.malloc_errors > 0) {
			ret = -ENOMEM;
			break;
		}
3908
skip:
3909
		key.offset = found_key.offset + dev_extent_len;
C
Chris Mason 已提交
3910
		btrfs_release_path(path);
A
Arne Jansen 已提交
3911 3912 3913
	}

	btrfs_free_path(path);
3914

3915
	return ret;
A
Arne Jansen 已提交
3916 3917
}

3918 3919
static noinline_for_stack int scrub_supers(struct scrub_ctx *sctx,
					   struct btrfs_device *scrub_dev)
A
Arne Jansen 已提交
3920 3921 3922 3923 3924
{
	int	i;
	u64	bytenr;
	u64	gen;
	int	ret;
3925
	struct btrfs_fs_info *fs_info = sctx->fs_info;
A
Arne Jansen 已提交
3926

J
Josef Bacik 已提交
3927
	if (BTRFS_FS_ERROR(fs_info))
3928
		return -EROFS;
3929

3930
	/* Seed devices of a new filesystem has their own generation. */
3931
	if (scrub_dev->fs_devices != fs_info->fs_devices)
3932 3933
		gen = scrub_dev->generation;
	else
3934
		gen = fs_info->last_trans_committed;
A
Arne Jansen 已提交
3935 3936 3937

	for (i = 0; i < BTRFS_SUPER_MIRROR_MAX; i++) {
		bytenr = btrfs_sb_offset(i);
3938 3939
		if (bytenr + BTRFS_SUPER_INFO_SIZE >
		    scrub_dev->commit_total_bytes)
A
Arne Jansen 已提交
3940
			break;
3941 3942
		if (!btrfs_check_super_location(scrub_dev, bytenr))
			continue;
A
Arne Jansen 已提交
3943

3944 3945 3946
		ret = scrub_sectors(sctx, bytenr, BTRFS_SUPER_INFO_SIZE, bytenr,
				    scrub_dev, BTRFS_EXTENT_FLAG_SUPER, gen, i,
				    NULL, bytenr);
A
Arne Jansen 已提交
3947 3948 3949
		if (ret)
			return ret;
	}
3950
	wait_event(sctx->list_wait, atomic_read(&sctx->bios_in_flight) == 0);
A
Arne Jansen 已提交
3951 3952 3953 3954

	return 0;
}

3955 3956 3957 3958
static void scrub_workers_put(struct btrfs_fs_info *fs_info)
{
	if (refcount_dec_and_mutex_lock(&fs_info->scrub_workers_refcnt,
					&fs_info->scrub_lock)) {
3959 3960 3961 3962 3963
		struct workqueue_struct *scrub_workers = fs_info->scrub_workers;
		struct workqueue_struct *scrub_wr_comp =
						fs_info->scrub_wr_completion_workers;
		struct workqueue_struct *scrub_parity =
						fs_info->scrub_parity_workers;
3964 3965 3966 3967 3968 3969

		fs_info->scrub_workers = NULL;
		fs_info->scrub_wr_completion_workers = NULL;
		fs_info->scrub_parity_workers = NULL;
		mutex_unlock(&fs_info->scrub_lock);

3970 3971 3972 3973 3974 3975
		if (scrub_workers)
			destroy_workqueue(scrub_workers);
		if (scrub_wr_comp)
			destroy_workqueue(scrub_wr_comp);
		if (scrub_parity)
			destroy_workqueue(scrub_parity);
3976 3977 3978
	}
}

A
Arne Jansen 已提交
3979 3980 3981
/*
 * get a reference count on fs_info->scrub_workers. start worker if necessary
 */
3982 3983
static noinline_for_stack int scrub_workers_get(struct btrfs_fs_info *fs_info,
						int is_dev_replace)
A
Arne Jansen 已提交
3984
{
3985 3986 3987
	struct workqueue_struct *scrub_workers = NULL;
	struct workqueue_struct *scrub_wr_comp = NULL;
	struct workqueue_struct *scrub_parity = NULL;
3988
	unsigned int flags = WQ_FREEZABLE | WQ_UNBOUND;
3989
	int max_active = fs_info->thread_pool_size;
3990
	int ret = -ENOMEM;
A
Arne Jansen 已提交
3991

3992 3993
	if (refcount_inc_not_zero(&fs_info->scrub_workers_refcnt))
		return 0;
3994

3995 3996
	scrub_workers = alloc_workqueue("btrfs-scrub", flags,
					is_dev_replace ? 1 : max_active);
3997 3998
	if (!scrub_workers)
		goto fail_scrub_workers;
3999

4000
	scrub_wr_comp = alloc_workqueue("btrfs-scrubwrc", flags, max_active);
4001 4002
	if (!scrub_wr_comp)
		goto fail_scrub_wr_completion_workers;
4003

4004
	scrub_parity = alloc_workqueue("btrfs-scrubparity", flags, max_active);
4005 4006 4007 4008 4009 4010 4011 4012 4013 4014 4015
	if (!scrub_parity)
		goto fail_scrub_parity_workers;

	mutex_lock(&fs_info->scrub_lock);
	if (refcount_read(&fs_info->scrub_workers_refcnt) == 0) {
		ASSERT(fs_info->scrub_workers == NULL &&
		       fs_info->scrub_wr_completion_workers == NULL &&
		       fs_info->scrub_parity_workers == NULL);
		fs_info->scrub_workers = scrub_workers;
		fs_info->scrub_wr_completion_workers = scrub_wr_comp;
		fs_info->scrub_parity_workers = scrub_parity;
4016
		refcount_set(&fs_info->scrub_workers_refcnt, 1);
4017 4018
		mutex_unlock(&fs_info->scrub_lock);
		return 0;
A
Arne Jansen 已提交
4019
	}
4020 4021 4022
	/* Other thread raced in and created the workers for us */
	refcount_inc(&fs_info->scrub_workers_refcnt);
	mutex_unlock(&fs_info->scrub_lock);
4023

4024
	ret = 0;
4025
	destroy_workqueue(scrub_parity);
4026
fail_scrub_parity_workers:
4027
	destroy_workqueue(scrub_wr_comp);
4028
fail_scrub_wr_completion_workers:
4029
	destroy_workqueue(scrub_workers);
4030
fail_scrub_workers:
4031
	return ret;
A
Arne Jansen 已提交
4032 4033
}

4034 4035
int btrfs_scrub_dev(struct btrfs_fs_info *fs_info, u64 devid, u64 start,
		    u64 end, struct btrfs_scrub_progress *progress,
4036
		    int readonly, int is_dev_replace)
A
Arne Jansen 已提交
4037
{
4038
	struct btrfs_dev_lookup_args args = { .devid = devid };
4039
	struct scrub_ctx *sctx;
A
Arne Jansen 已提交
4040 4041
	int ret;
	struct btrfs_device *dev;
4042
	unsigned int nofs_flag;
A
Arne Jansen 已提交
4043

4044
	if (btrfs_fs_closing(fs_info))
4045
		return -EAGAIN;
A
Arne Jansen 已提交
4046

4047
	if (fs_info->nodesize > BTRFS_STRIPE_LEN) {
4048 4049 4050 4051 4052
		/*
		 * 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.
		 */
4053 4054
		btrfs_err(fs_info,
			   "scrub: size assumption nodesize <= BTRFS_STRIPE_LEN (%d <= %d) fails",
4055 4056
		       fs_info->nodesize,
		       BTRFS_STRIPE_LEN);
4057 4058 4059
		return -EINVAL;
	}

4060
	if (fs_info->nodesize >
4061 4062
	    SCRUB_MAX_SECTORS_PER_BLOCK << fs_info->sectorsize_bits ||
	    fs_info->sectorsize > PAGE_SIZE * SCRUB_MAX_SECTORS_PER_BLOCK) {
4063
		/*
4064
		 * Would exhaust the array bounds of sectorv member in
4065 4066
		 * struct scrub_block
		 */
J
Jeff Mahoney 已提交
4067
		btrfs_err(fs_info,
4068 4069 4070
"scrub: nodesize and sectorsize <= SCRUB_MAX_SECTORS_PER_BLOCK (%d <= %d && %d <= %d) fails",
		       fs_info->nodesize, SCRUB_MAX_SECTORS_PER_BLOCK,
		       fs_info->sectorsize, SCRUB_MAX_SECTORS_PER_BLOCK);
4071 4072 4073
		return -EINVAL;
	}

4074 4075 4076 4077
	/* Allocate outside of device_list_mutex */
	sctx = scrub_setup_ctx(fs_info, is_dev_replace);
	if (IS_ERR(sctx))
		return PTR_ERR(sctx);
A
Arne Jansen 已提交
4078

4079 4080 4081 4082
	ret = scrub_workers_get(fs_info, is_dev_replace);
	if (ret)
		goto out_free_ctx;

4083
	mutex_lock(&fs_info->fs_devices->device_list_mutex);
4084
	dev = btrfs_find_device(fs_info->fs_devices, &args);
4085 4086
	if (!dev || (test_bit(BTRFS_DEV_STATE_MISSING, &dev->dev_state) &&
		     !is_dev_replace)) {
4087
		mutex_unlock(&fs_info->fs_devices->device_list_mutex);
4088
		ret = -ENODEV;
4089
		goto out;
A
Arne Jansen 已提交
4090 4091
	}

4092 4093
	if (!is_dev_replace && !readonly &&
	    !test_bit(BTRFS_DEV_STATE_WRITEABLE, &dev->dev_state)) {
4094
		mutex_unlock(&fs_info->fs_devices->device_list_mutex);
4095 4096 4097
		btrfs_err_in_rcu(fs_info,
			"scrub on devid %llu: filesystem on %s is not writable",
				 devid, rcu_str_deref(dev->name));
4098
		ret = -EROFS;
4099
		goto out;
4100 4101
	}

4102
	mutex_lock(&fs_info->scrub_lock);
4103
	if (!test_bit(BTRFS_DEV_STATE_IN_FS_METADATA, &dev->dev_state) ||
4104
	    test_bit(BTRFS_DEV_STATE_REPLACE_TGT, &dev->dev_state)) {
A
Arne Jansen 已提交
4105
		mutex_unlock(&fs_info->scrub_lock);
4106
		mutex_unlock(&fs_info->fs_devices->device_list_mutex);
4107
		ret = -EIO;
4108
		goto out;
A
Arne Jansen 已提交
4109 4110
	}

4111
	down_read(&fs_info->dev_replace.rwsem);
4112
	if (dev->scrub_ctx ||
4113 4114
	    (!is_dev_replace &&
	     btrfs_dev_replace_is_ongoing(&fs_info->dev_replace))) {
4115
		up_read(&fs_info->dev_replace.rwsem);
A
Arne Jansen 已提交
4116
		mutex_unlock(&fs_info->scrub_lock);
4117
		mutex_unlock(&fs_info->fs_devices->device_list_mutex);
4118
		ret = -EINPROGRESS;
4119
		goto out;
A
Arne Jansen 已提交
4120
	}
4121
	up_read(&fs_info->dev_replace.rwsem);
4122

4123
	sctx->readonly = readonly;
4124
	dev->scrub_ctx = sctx;
4125
	mutex_unlock(&fs_info->fs_devices->device_list_mutex);
A
Arne Jansen 已提交
4126

4127 4128 4129 4130
	/*
	 * checking @scrub_pause_req here, we can avoid
	 * race between committing transaction and scrubbing.
	 */
4131
	__scrub_blocked_if_needed(fs_info);
A
Arne Jansen 已提交
4132 4133 4134
	atomic_inc(&fs_info->scrubs_running);
	mutex_unlock(&fs_info->scrub_lock);

4135 4136 4137
	/*
	 * In order to avoid deadlock with reclaim when there is a transaction
	 * trying to pause scrub, make sure we use GFP_NOFS for all the
4138
	 * allocations done at btrfs_scrub_sectors() and scrub_sectors_for_parity()
4139 4140 4141 4142 4143 4144
	 * invoked by our callees. The pausing request is done when the
	 * transaction commit starts, and it blocks the transaction until scrub
	 * is paused (done at specific points at scrub_stripe() or right above
	 * before incrementing fs_info->scrubs_running).
	 */
	nofs_flag = memalloc_nofs_save();
4145
	if (!is_dev_replace) {
4146
		btrfs_info(fs_info, "scrub: started on devid %llu", devid);
4147 4148 4149 4150
		/*
		 * by holding device list mutex, we can
		 * kick off writing super in log tree sync.
		 */
4151
		mutex_lock(&fs_info->fs_devices->device_list_mutex);
4152
		ret = scrub_supers(sctx, dev);
4153
		mutex_unlock(&fs_info->fs_devices->device_list_mutex);
4154
	}
A
Arne Jansen 已提交
4155 4156

	if (!ret)
4157
		ret = scrub_enumerate_chunks(sctx, dev, start, end);
4158
	memalloc_nofs_restore(nofs_flag);
A
Arne Jansen 已提交
4159

4160
	wait_event(sctx->list_wait, atomic_read(&sctx->bios_in_flight) == 0);
A
Arne Jansen 已提交
4161 4162 4163
	atomic_dec(&fs_info->scrubs_running);
	wake_up(&fs_info->scrub_pause_wait);

4164
	wait_event(sctx->list_wait, atomic_read(&sctx->workers_pending) == 0);
4165

A
Arne Jansen 已提交
4166
	if (progress)
4167
		memcpy(progress, &sctx->stat, sizeof(*progress));
A
Arne Jansen 已提交
4168

4169 4170 4171 4172
	if (!is_dev_replace)
		btrfs_info(fs_info, "scrub: %s on devid %llu with status: %d",
			ret ? "not finished" : "finished", devid, ret);

A
Arne Jansen 已提交
4173
	mutex_lock(&fs_info->scrub_lock);
4174
	dev->scrub_ctx = NULL;
A
Arne Jansen 已提交
4175 4176
	mutex_unlock(&fs_info->scrub_lock);

4177
	scrub_workers_put(fs_info);
4178
	scrub_put_ctx(sctx);
A
Arne Jansen 已提交
4179

4180
	return ret;
4181 4182
out:
	scrub_workers_put(fs_info);
4183 4184 4185
out_free_ctx:
	scrub_free_ctx(sctx);

A
Arne Jansen 已提交
4186 4187 4188
	return ret;
}

4189
void btrfs_scrub_pause(struct btrfs_fs_info *fs_info)
A
Arne Jansen 已提交
4190 4191 4192 4193 4194 4195 4196 4197 4198 4199 4200 4201 4202 4203
{
	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);
}

4204
void btrfs_scrub_continue(struct btrfs_fs_info *fs_info)
A
Arne Jansen 已提交
4205 4206 4207 4208 4209
{
	atomic_dec(&fs_info->scrub_pause_req);
	wake_up(&fs_info->scrub_pause_wait);
}

4210
int btrfs_scrub_cancel(struct btrfs_fs_info *fs_info)
A
Arne Jansen 已提交
4211 4212 4213 4214 4215 4216 4217 4218 4219 4220 4221 4222 4223 4224 4225 4226 4227 4228 4229 4230
{
	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;
}

4231
int btrfs_scrub_cancel_dev(struct btrfs_device *dev)
4232
{
4233
	struct btrfs_fs_info *fs_info = dev->fs_info;
4234
	struct scrub_ctx *sctx;
A
Arne Jansen 已提交
4235 4236

	mutex_lock(&fs_info->scrub_lock);
4237
	sctx = dev->scrub_ctx;
4238
	if (!sctx) {
A
Arne Jansen 已提交
4239 4240 4241
		mutex_unlock(&fs_info->scrub_lock);
		return -ENOTCONN;
	}
4242
	atomic_inc(&sctx->cancel_req);
4243
	while (dev->scrub_ctx) {
A
Arne Jansen 已提交
4244 4245
		mutex_unlock(&fs_info->scrub_lock);
		wait_event(fs_info->scrub_pause_wait,
4246
			   dev->scrub_ctx == NULL);
A
Arne Jansen 已提交
4247 4248 4249 4250 4251 4252
		mutex_lock(&fs_info->scrub_lock);
	}
	mutex_unlock(&fs_info->scrub_lock);

	return 0;
}
S
Stefan Behrens 已提交
4253

4254
int btrfs_scrub_progress(struct btrfs_fs_info *fs_info, u64 devid,
A
Arne Jansen 已提交
4255 4256
			 struct btrfs_scrub_progress *progress)
{
4257
	struct btrfs_dev_lookup_args args = { .devid = devid };
A
Arne Jansen 已提交
4258
	struct btrfs_device *dev;
4259
	struct scrub_ctx *sctx = NULL;
A
Arne Jansen 已提交
4260

4261
	mutex_lock(&fs_info->fs_devices->device_list_mutex);
4262
	dev = btrfs_find_device(fs_info->fs_devices, &args);
A
Arne Jansen 已提交
4263
	if (dev)
4264
		sctx = dev->scrub_ctx;
4265 4266
	if (sctx)
		memcpy(progress, &sctx->stat, sizeof(*progress));
4267
	mutex_unlock(&fs_info->fs_devices->device_list_mutex);
A
Arne Jansen 已提交
4268

4269
	return dev ? (sctx ? 0 : -ENOTCONN) : -ENODEV;
A
Arne Jansen 已提交
4270
}
4271 4272

static void scrub_remap_extent(struct btrfs_fs_info *fs_info,
4273
			       u64 extent_logical, u32 extent_len,
4274 4275 4276 4277 4278
			       u64 *extent_physical,
			       struct btrfs_device **extent_dev,
			       int *extent_mirror_num)
{
	u64 mapped_length;
4279
	struct btrfs_io_context *bioc = NULL;
4280 4281 4282
	int ret;

	mapped_length = extent_len;
4283
	ret = btrfs_map_block(fs_info, BTRFS_MAP_READ, extent_logical,
4284 4285 4286 4287
			      &mapped_length, &bioc, 0);
	if (ret || !bioc || mapped_length < extent_len ||
	    !bioc->stripes[0].dev->bdev) {
		btrfs_put_bioc(bioc);
4288 4289 4290
		return;
	}

4291 4292 4293 4294
	*extent_physical = bioc->stripes[0].physical;
	*extent_mirror_num = bioc->mirror_num;
	*extent_dev = bioc->stripes[0].dev;
	btrfs_put_bioc(bioc);
4295
}