Commit | Line | Data |
---|---|---|
a2de733c | 1 | /* |
b6bfebc1 | 2 | * Copyright (C) 2011, 2012 STRATO. All rights reserved. |
a2de733c AJ |
3 | * |
4 | * This program is free software; you can redistribute it and/or | |
5 | * modify it under the terms of the GNU General Public | |
6 | * License v2 as published by the Free Software Foundation. | |
7 | * | |
8 | * This program is distributed in the hope that it will be useful, | |
9 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
10 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
11 | * General Public License for more details. | |
12 | * | |
13 | * You should have received a copy of the GNU General Public | |
14 | * License along with this program; if not, write to the | |
15 | * Free Software Foundation, Inc., 59 Temple Place - Suite 330, | |
16 | * Boston, MA 021110-1307, USA. | |
17 | */ | |
18 | ||
a2de733c | 19 | #include <linux/blkdev.h> |
558540c1 | 20 | #include <linux/ratelimit.h> |
a2de733c AJ |
21 | #include "ctree.h" |
22 | #include "volumes.h" | |
23 | #include "disk-io.h" | |
24 | #include "ordered-data.h" | |
0ef8e451 | 25 | #include "transaction.h" |
558540c1 | 26 | #include "backref.h" |
5da6fcbc | 27 | #include "extent_io.h" |
ff023aac | 28 | #include "dev-replace.h" |
21adbd5c | 29 | #include "check-integrity.h" |
606686ee | 30 | #include "rcu-string.h" |
53b381b3 | 31 | #include "raid56.h" |
a2de733c AJ |
32 | |
33 | /* | |
34 | * This is only the first step towards a full-features scrub. It reads all | |
35 | * extent and super block and verifies the checksums. In case a bad checksum | |
36 | * is found or the extent cannot be read, good data will be written back if | |
37 | * any can be found. | |
38 | * | |
39 | * Future enhancements: | |
a2de733c AJ |
40 | * - In case an unrepairable extent is encountered, track which files are |
41 | * affected and report them | |
a2de733c | 42 | * - track and record media errors, throw out bad devices |
a2de733c | 43 | * - add a mode to also read unallocated space |
a2de733c AJ |
44 | */ |
45 | ||
b5d67f64 | 46 | struct scrub_block; |
d9d181c1 | 47 | struct scrub_ctx; |
a2de733c | 48 | |
ff023aac SB |
49 | /* |
50 | * the following three values only influence the performance. | |
51 | * The last one configures the number of parallel and outstanding I/O | |
52 | * operations. The first two values configure an upper limit for the number | |
53 | * of (dynamically allocated) pages that are added to a bio. | |
54 | */ | |
55 | #define SCRUB_PAGES_PER_RD_BIO 32 /* 128k per bio */ | |
56 | #define SCRUB_PAGES_PER_WR_BIO 32 /* 128k per bio */ | |
57 | #define SCRUB_BIOS_PER_SCTX 64 /* 8MB per device in flight */ | |
7a9e9987 SB |
58 | |
59 | /* | |
60 | * the following value times PAGE_SIZE needs to be large enough to match the | |
61 | * largest node/leaf/sector size that shall be supported. | |
62 | * Values larger than BTRFS_STRIPE_LEN are not supported. | |
63 | */ | |
b5d67f64 | 64 | #define SCRUB_MAX_PAGES_PER_BLOCK 16 /* 64k per node/leaf/sector */ |
a2de733c AJ |
65 | |
66 | struct scrub_page { | |
b5d67f64 SB |
67 | struct scrub_block *sblock; |
68 | struct page *page; | |
442a4f63 | 69 | struct btrfs_device *dev; |
a2de733c AJ |
70 | u64 flags; /* extent flags */ |
71 | u64 generation; | |
b5d67f64 SB |
72 | u64 logical; |
73 | u64 physical; | |
ff023aac | 74 | u64 physical_for_dev_replace; |
7a9e9987 | 75 | atomic_t ref_count; |
b5d67f64 SB |
76 | struct { |
77 | unsigned int mirror_num:8; | |
78 | unsigned int have_csum:1; | |
79 | unsigned int io_error:1; | |
80 | }; | |
a2de733c AJ |
81 | u8 csum[BTRFS_CSUM_SIZE]; |
82 | }; | |
83 | ||
84 | struct scrub_bio { | |
85 | int index; | |
d9d181c1 | 86 | struct scrub_ctx *sctx; |
a36cf8b8 | 87 | struct btrfs_device *dev; |
a2de733c AJ |
88 | struct bio *bio; |
89 | int err; | |
90 | u64 logical; | |
91 | u64 physical; | |
ff023aac SB |
92 | #if SCRUB_PAGES_PER_WR_BIO >= SCRUB_PAGES_PER_RD_BIO |
93 | struct scrub_page *pagev[SCRUB_PAGES_PER_WR_BIO]; | |
94 | #else | |
95 | struct scrub_page *pagev[SCRUB_PAGES_PER_RD_BIO]; | |
96 | #endif | |
b5d67f64 | 97 | int page_count; |
a2de733c AJ |
98 | int next_free; |
99 | struct btrfs_work work; | |
100 | }; | |
101 | ||
b5d67f64 | 102 | struct scrub_block { |
7a9e9987 | 103 | struct scrub_page *pagev[SCRUB_MAX_PAGES_PER_BLOCK]; |
b5d67f64 SB |
104 | int page_count; |
105 | atomic_t outstanding_pages; | |
106 | atomic_t ref_count; /* free mem on transition to zero */ | |
d9d181c1 | 107 | struct scrub_ctx *sctx; |
b5d67f64 SB |
108 | struct { |
109 | unsigned int header_error:1; | |
110 | unsigned int checksum_error:1; | |
111 | unsigned int no_io_error_seen:1; | |
442a4f63 | 112 | unsigned int generation_error:1; /* also sets header_error */ |
b5d67f64 SB |
113 | }; |
114 | }; | |
115 | ||
ff023aac SB |
116 | struct scrub_wr_ctx { |
117 | struct scrub_bio *wr_curr_bio; | |
118 | struct btrfs_device *tgtdev; | |
119 | int pages_per_wr_bio; /* <= SCRUB_PAGES_PER_WR_BIO */ | |
120 | atomic_t flush_all_writes; | |
121 | struct mutex wr_lock; | |
122 | }; | |
123 | ||
d9d181c1 | 124 | struct scrub_ctx { |
ff023aac | 125 | struct scrub_bio *bios[SCRUB_BIOS_PER_SCTX]; |
a36cf8b8 | 126 | struct btrfs_root *dev_root; |
a2de733c AJ |
127 | int first_free; |
128 | int curr; | |
b6bfebc1 SB |
129 | atomic_t bios_in_flight; |
130 | atomic_t workers_pending; | |
a2de733c AJ |
131 | spinlock_t list_lock; |
132 | wait_queue_head_t list_wait; | |
133 | u16 csum_size; | |
134 | struct list_head csum_list; | |
135 | atomic_t cancel_req; | |
8628764e | 136 | int readonly; |
ff023aac | 137 | int pages_per_rd_bio; |
b5d67f64 SB |
138 | u32 sectorsize; |
139 | u32 nodesize; | |
140 | u32 leafsize; | |
63a212ab SB |
141 | |
142 | int is_dev_replace; | |
ff023aac | 143 | struct scrub_wr_ctx wr_ctx; |
63a212ab | 144 | |
a2de733c AJ |
145 | /* |
146 | * statistics | |
147 | */ | |
148 | struct btrfs_scrub_progress stat; | |
149 | spinlock_t stat_lock; | |
150 | }; | |
151 | ||
0ef8e451 | 152 | struct scrub_fixup_nodatasum { |
d9d181c1 | 153 | struct scrub_ctx *sctx; |
a36cf8b8 | 154 | struct btrfs_device *dev; |
0ef8e451 JS |
155 | u64 logical; |
156 | struct btrfs_root *root; | |
157 | struct btrfs_work work; | |
158 | int mirror_num; | |
159 | }; | |
160 | ||
652f25a2 JB |
161 | struct scrub_nocow_inode { |
162 | u64 inum; | |
163 | u64 offset; | |
164 | u64 root; | |
165 | struct list_head list; | |
166 | }; | |
167 | ||
ff023aac SB |
168 | struct scrub_copy_nocow_ctx { |
169 | struct scrub_ctx *sctx; | |
170 | u64 logical; | |
171 | u64 len; | |
172 | int mirror_num; | |
173 | u64 physical_for_dev_replace; | |
652f25a2 | 174 | struct list_head inodes; |
ff023aac SB |
175 | struct btrfs_work work; |
176 | }; | |
177 | ||
558540c1 JS |
178 | struct scrub_warning { |
179 | struct btrfs_path *path; | |
180 | u64 extent_item_size; | |
181 | char *scratch_buf; | |
182 | char *msg_buf; | |
183 | const char *errstr; | |
184 | sector_t sector; | |
185 | u64 logical; | |
186 | struct btrfs_device *dev; | |
187 | int msg_bufsize; | |
188 | int scratch_bufsize; | |
189 | }; | |
190 | ||
b5d67f64 | 191 | |
b6bfebc1 SB |
192 | static void scrub_pending_bio_inc(struct scrub_ctx *sctx); |
193 | static void scrub_pending_bio_dec(struct scrub_ctx *sctx); | |
194 | static void scrub_pending_trans_workers_inc(struct scrub_ctx *sctx); | |
195 | static void scrub_pending_trans_workers_dec(struct scrub_ctx *sctx); | |
b5d67f64 | 196 | static int scrub_handle_errored_block(struct scrub_block *sblock_to_check); |
d9d181c1 | 197 | static int scrub_setup_recheck_block(struct scrub_ctx *sctx, |
3ec706c8 | 198 | struct btrfs_fs_info *fs_info, |
ff023aac | 199 | struct scrub_block *original_sblock, |
b5d67f64 | 200 | u64 length, u64 logical, |
ff023aac | 201 | struct scrub_block *sblocks_for_recheck); |
34f5c8e9 SB |
202 | static void scrub_recheck_block(struct btrfs_fs_info *fs_info, |
203 | struct scrub_block *sblock, int is_metadata, | |
204 | int have_csum, u8 *csum, u64 generation, | |
205 | u16 csum_size); | |
b5d67f64 SB |
206 | static void scrub_recheck_block_checksum(struct btrfs_fs_info *fs_info, |
207 | struct scrub_block *sblock, | |
208 | int is_metadata, int have_csum, | |
209 | const u8 *csum, u64 generation, | |
210 | u16 csum_size); | |
211 | static void scrub_complete_bio_end_io(struct bio *bio, int err); | |
212 | static int scrub_repair_block_from_good_copy(struct scrub_block *sblock_bad, | |
213 | struct scrub_block *sblock_good, | |
214 | int force_write); | |
215 | static int scrub_repair_page_from_good_copy(struct scrub_block *sblock_bad, | |
216 | struct scrub_block *sblock_good, | |
217 | int page_num, int force_write); | |
ff023aac SB |
218 | static void scrub_write_block_to_dev_replace(struct scrub_block *sblock); |
219 | static int scrub_write_page_to_dev_replace(struct scrub_block *sblock, | |
220 | int page_num); | |
b5d67f64 SB |
221 | static int scrub_checksum_data(struct scrub_block *sblock); |
222 | static int scrub_checksum_tree_block(struct scrub_block *sblock); | |
223 | static int scrub_checksum_super(struct scrub_block *sblock); | |
224 | static void scrub_block_get(struct scrub_block *sblock); | |
225 | static void scrub_block_put(struct scrub_block *sblock); | |
7a9e9987 SB |
226 | static void scrub_page_get(struct scrub_page *spage); |
227 | static void scrub_page_put(struct scrub_page *spage); | |
ff023aac SB |
228 | static int scrub_add_page_to_rd_bio(struct scrub_ctx *sctx, |
229 | struct scrub_page *spage); | |
d9d181c1 | 230 | static int scrub_pages(struct scrub_ctx *sctx, u64 logical, u64 len, |
a36cf8b8 | 231 | u64 physical, struct btrfs_device *dev, u64 flags, |
ff023aac SB |
232 | u64 gen, int mirror_num, u8 *csum, int force, |
233 | u64 physical_for_dev_replace); | |
1623edeb | 234 | static void scrub_bio_end_io(struct bio *bio, int err); |
b5d67f64 SB |
235 | static void scrub_bio_end_io_worker(struct btrfs_work *work); |
236 | static void scrub_block_complete(struct scrub_block *sblock); | |
ff023aac SB |
237 | static void scrub_remap_extent(struct btrfs_fs_info *fs_info, |
238 | u64 extent_logical, u64 extent_len, | |
239 | u64 *extent_physical, | |
240 | struct btrfs_device **extent_dev, | |
241 | int *extent_mirror_num); | |
242 | static int scrub_setup_wr_ctx(struct scrub_ctx *sctx, | |
243 | struct scrub_wr_ctx *wr_ctx, | |
244 | struct btrfs_fs_info *fs_info, | |
245 | struct btrfs_device *dev, | |
246 | int is_dev_replace); | |
247 | static void scrub_free_wr_ctx(struct scrub_wr_ctx *wr_ctx); | |
248 | static int scrub_add_page_to_wr_bio(struct scrub_ctx *sctx, | |
249 | struct scrub_page *spage); | |
250 | static void scrub_wr_submit(struct scrub_ctx *sctx); | |
251 | static void scrub_wr_bio_end_io(struct bio *bio, int err); | |
252 | static void scrub_wr_bio_end_io_worker(struct btrfs_work *work); | |
253 | static int write_page_nocow(struct scrub_ctx *sctx, | |
254 | u64 physical_for_dev_replace, struct page *page); | |
255 | static int copy_nocow_pages_for_inode(u64 inum, u64 offset, u64 root, | |
652f25a2 | 256 | struct scrub_copy_nocow_ctx *ctx); |
ff023aac SB |
257 | static int copy_nocow_pages(struct scrub_ctx *sctx, u64 logical, u64 len, |
258 | int mirror_num, u64 physical_for_dev_replace); | |
259 | static void copy_nocow_pages_worker(struct btrfs_work *work); | |
1623edeb SB |
260 | |
261 | ||
b6bfebc1 SB |
262 | static void scrub_pending_bio_inc(struct scrub_ctx *sctx) |
263 | { | |
264 | atomic_inc(&sctx->bios_in_flight); | |
265 | } | |
266 | ||
267 | static void scrub_pending_bio_dec(struct scrub_ctx *sctx) | |
268 | { | |
269 | atomic_dec(&sctx->bios_in_flight); | |
270 | wake_up(&sctx->list_wait); | |
271 | } | |
272 | ||
273 | /* | |
274 | * used for workers that require transaction commits (i.e., for the | |
275 | * NOCOW case) | |
276 | */ | |
277 | static void scrub_pending_trans_workers_inc(struct scrub_ctx *sctx) | |
278 | { | |
279 | struct btrfs_fs_info *fs_info = sctx->dev_root->fs_info; | |
280 | ||
281 | /* | |
282 | * increment scrubs_running to prevent cancel requests from | |
283 | * completing as long as a worker is running. we must also | |
284 | * increment scrubs_paused to prevent deadlocking on pause | |
285 | * requests used for transactions commits (as the worker uses a | |
286 | * transaction context). it is safe to regard the worker | |
287 | * as paused for all matters practical. effectively, we only | |
288 | * avoid cancellation requests from completing. | |
289 | */ | |
290 | mutex_lock(&fs_info->scrub_lock); | |
291 | atomic_inc(&fs_info->scrubs_running); | |
292 | atomic_inc(&fs_info->scrubs_paused); | |
293 | mutex_unlock(&fs_info->scrub_lock); | |
294 | atomic_inc(&sctx->workers_pending); | |
295 | } | |
296 | ||
297 | /* used for workers that require transaction commits */ | |
298 | static void scrub_pending_trans_workers_dec(struct scrub_ctx *sctx) | |
299 | { | |
300 | struct btrfs_fs_info *fs_info = sctx->dev_root->fs_info; | |
301 | ||
302 | /* | |
303 | * see scrub_pending_trans_workers_inc() why we're pretending | |
304 | * to be paused in the scrub counters | |
305 | */ | |
306 | mutex_lock(&fs_info->scrub_lock); | |
307 | atomic_dec(&fs_info->scrubs_running); | |
308 | atomic_dec(&fs_info->scrubs_paused); | |
309 | mutex_unlock(&fs_info->scrub_lock); | |
310 | atomic_dec(&sctx->workers_pending); | |
311 | wake_up(&fs_info->scrub_pause_wait); | |
312 | wake_up(&sctx->list_wait); | |
313 | } | |
314 | ||
d9d181c1 | 315 | static void scrub_free_csums(struct scrub_ctx *sctx) |
a2de733c | 316 | { |
d9d181c1 | 317 | while (!list_empty(&sctx->csum_list)) { |
a2de733c | 318 | struct btrfs_ordered_sum *sum; |
d9d181c1 | 319 | sum = list_first_entry(&sctx->csum_list, |
a2de733c AJ |
320 | struct btrfs_ordered_sum, list); |
321 | list_del(&sum->list); | |
322 | kfree(sum); | |
323 | } | |
324 | } | |
325 | ||
d9d181c1 | 326 | static noinline_for_stack void scrub_free_ctx(struct scrub_ctx *sctx) |
a2de733c AJ |
327 | { |
328 | int i; | |
a2de733c | 329 | |
d9d181c1 | 330 | if (!sctx) |
a2de733c AJ |
331 | return; |
332 | ||
ff023aac SB |
333 | scrub_free_wr_ctx(&sctx->wr_ctx); |
334 | ||
b5d67f64 | 335 | /* this can happen when scrub is cancelled */ |
d9d181c1 SB |
336 | if (sctx->curr != -1) { |
337 | struct scrub_bio *sbio = sctx->bios[sctx->curr]; | |
b5d67f64 SB |
338 | |
339 | for (i = 0; i < sbio->page_count; i++) { | |
ff023aac | 340 | WARN_ON(!sbio->pagev[i]->page); |
b5d67f64 SB |
341 | scrub_block_put(sbio->pagev[i]->sblock); |
342 | } | |
343 | bio_put(sbio->bio); | |
344 | } | |
345 | ||
ff023aac | 346 | for (i = 0; i < SCRUB_BIOS_PER_SCTX; ++i) { |
d9d181c1 | 347 | struct scrub_bio *sbio = sctx->bios[i]; |
a2de733c AJ |
348 | |
349 | if (!sbio) | |
350 | break; | |
a2de733c AJ |
351 | kfree(sbio); |
352 | } | |
353 | ||
d9d181c1 SB |
354 | scrub_free_csums(sctx); |
355 | kfree(sctx); | |
a2de733c AJ |
356 | } |
357 | ||
358 | static noinline_for_stack | |
63a212ab | 359 | struct scrub_ctx *scrub_setup_ctx(struct btrfs_device *dev, int is_dev_replace) |
a2de733c | 360 | { |
d9d181c1 | 361 | struct scrub_ctx *sctx; |
a2de733c | 362 | int i; |
a2de733c | 363 | struct btrfs_fs_info *fs_info = dev->dev_root->fs_info; |
ff023aac SB |
364 | int pages_per_rd_bio; |
365 | int ret; | |
a2de733c | 366 | |
ff023aac SB |
367 | /* |
368 | * the setting of pages_per_rd_bio is correct for scrub but might | |
369 | * be wrong for the dev_replace code where we might read from | |
370 | * different devices in the initial huge bios. However, that | |
371 | * code is able to correctly handle the case when adding a page | |
372 | * to a bio fails. | |
373 | */ | |
374 | if (dev->bdev) | |
375 | pages_per_rd_bio = min_t(int, SCRUB_PAGES_PER_RD_BIO, | |
376 | bio_get_nr_vecs(dev->bdev)); | |
377 | else | |
378 | pages_per_rd_bio = SCRUB_PAGES_PER_RD_BIO; | |
d9d181c1 SB |
379 | sctx = kzalloc(sizeof(*sctx), GFP_NOFS); |
380 | if (!sctx) | |
a2de733c | 381 | goto nomem; |
63a212ab | 382 | sctx->is_dev_replace = is_dev_replace; |
ff023aac | 383 | sctx->pages_per_rd_bio = pages_per_rd_bio; |
d9d181c1 | 384 | sctx->curr = -1; |
a36cf8b8 | 385 | sctx->dev_root = dev->dev_root; |
ff023aac | 386 | for (i = 0; i < SCRUB_BIOS_PER_SCTX; ++i) { |
a2de733c AJ |
387 | struct scrub_bio *sbio; |
388 | ||
389 | sbio = kzalloc(sizeof(*sbio), GFP_NOFS); | |
390 | if (!sbio) | |
391 | goto nomem; | |
d9d181c1 | 392 | sctx->bios[i] = sbio; |
a2de733c | 393 | |
a2de733c | 394 | sbio->index = i; |
d9d181c1 | 395 | sbio->sctx = sctx; |
b5d67f64 SB |
396 | sbio->page_count = 0; |
397 | sbio->work.func = scrub_bio_end_io_worker; | |
a2de733c | 398 | |
ff023aac | 399 | if (i != SCRUB_BIOS_PER_SCTX - 1) |
d9d181c1 | 400 | sctx->bios[i]->next_free = i + 1; |
0ef8e451 | 401 | else |
d9d181c1 SB |
402 | sctx->bios[i]->next_free = -1; |
403 | } | |
404 | sctx->first_free = 0; | |
405 | sctx->nodesize = dev->dev_root->nodesize; | |
406 | sctx->leafsize = dev->dev_root->leafsize; | |
407 | sctx->sectorsize = dev->dev_root->sectorsize; | |
b6bfebc1 SB |
408 | atomic_set(&sctx->bios_in_flight, 0); |
409 | atomic_set(&sctx->workers_pending, 0); | |
d9d181c1 SB |
410 | atomic_set(&sctx->cancel_req, 0); |
411 | sctx->csum_size = btrfs_super_csum_size(fs_info->super_copy); | |
412 | INIT_LIST_HEAD(&sctx->csum_list); | |
413 | ||
414 | spin_lock_init(&sctx->list_lock); | |
415 | spin_lock_init(&sctx->stat_lock); | |
416 | init_waitqueue_head(&sctx->list_wait); | |
ff023aac SB |
417 | |
418 | ret = scrub_setup_wr_ctx(sctx, &sctx->wr_ctx, fs_info, | |
419 | fs_info->dev_replace.tgtdev, is_dev_replace); | |
420 | if (ret) { | |
421 | scrub_free_ctx(sctx); | |
422 | return ERR_PTR(ret); | |
423 | } | |
d9d181c1 | 424 | return sctx; |
a2de733c AJ |
425 | |
426 | nomem: | |
d9d181c1 | 427 | scrub_free_ctx(sctx); |
a2de733c AJ |
428 | return ERR_PTR(-ENOMEM); |
429 | } | |
430 | ||
ff023aac SB |
431 | static int scrub_print_warning_inode(u64 inum, u64 offset, u64 root, |
432 | void *warn_ctx) | |
558540c1 JS |
433 | { |
434 | u64 isize; | |
435 | u32 nlink; | |
436 | int ret; | |
437 | int i; | |
438 | struct extent_buffer *eb; | |
439 | struct btrfs_inode_item *inode_item; | |
ff023aac | 440 | struct scrub_warning *swarn = warn_ctx; |
558540c1 JS |
441 | struct btrfs_fs_info *fs_info = swarn->dev->dev_root->fs_info; |
442 | struct inode_fs_paths *ipath = NULL; | |
443 | struct btrfs_root *local_root; | |
444 | struct btrfs_key root_key; | |
445 | ||
446 | root_key.objectid = root; | |
447 | root_key.type = BTRFS_ROOT_ITEM_KEY; | |
448 | root_key.offset = (u64)-1; | |
449 | local_root = btrfs_read_fs_root_no_name(fs_info, &root_key); | |
450 | if (IS_ERR(local_root)) { | |
451 | ret = PTR_ERR(local_root); | |
452 | goto err; | |
453 | } | |
454 | ||
455 | ret = inode_item_info(inum, 0, local_root, swarn->path); | |
456 | if (ret) { | |
457 | btrfs_release_path(swarn->path); | |
458 | goto err; | |
459 | } | |
460 | ||
461 | eb = swarn->path->nodes[0]; | |
462 | inode_item = btrfs_item_ptr(eb, swarn->path->slots[0], | |
463 | struct btrfs_inode_item); | |
464 | isize = btrfs_inode_size(eb, inode_item); | |
465 | nlink = btrfs_inode_nlink(eb, inode_item); | |
466 | btrfs_release_path(swarn->path); | |
467 | ||
468 | ipath = init_ipath(4096, local_root, swarn->path); | |
26bdef54 DC |
469 | if (IS_ERR(ipath)) { |
470 | ret = PTR_ERR(ipath); | |
471 | ipath = NULL; | |
472 | goto err; | |
473 | } | |
558540c1 JS |
474 | ret = paths_from_inode(inum, ipath); |
475 | ||
476 | if (ret < 0) | |
477 | goto err; | |
478 | ||
479 | /* | |
480 | * we deliberately ignore the bit ipath might have been too small to | |
481 | * hold all of the paths here | |
482 | */ | |
483 | for (i = 0; i < ipath->fspath->elem_cnt; ++i) | |
606686ee | 484 | printk_in_rcu(KERN_WARNING "btrfs: %s at logical %llu on dev " |
558540c1 JS |
485 | "%s, sector %llu, root %llu, inode %llu, offset %llu, " |
486 | "length %llu, links %u (path: %s)\n", swarn->errstr, | |
606686ee | 487 | swarn->logical, rcu_str_deref(swarn->dev->name), |
558540c1 JS |
488 | (unsigned long long)swarn->sector, root, inum, offset, |
489 | min(isize - offset, (u64)PAGE_SIZE), nlink, | |
745c4d8e | 490 | (char *)(unsigned long)ipath->fspath->val[i]); |
558540c1 JS |
491 | |
492 | free_ipath(ipath); | |
493 | return 0; | |
494 | ||
495 | err: | |
606686ee | 496 | printk_in_rcu(KERN_WARNING "btrfs: %s at logical %llu on dev " |
558540c1 JS |
497 | "%s, sector %llu, root %llu, inode %llu, offset %llu: path " |
498 | "resolving failed with ret=%d\n", swarn->errstr, | |
606686ee | 499 | swarn->logical, rcu_str_deref(swarn->dev->name), |
558540c1 JS |
500 | (unsigned long long)swarn->sector, root, inum, offset, ret); |
501 | ||
502 | free_ipath(ipath); | |
503 | return 0; | |
504 | } | |
505 | ||
b5d67f64 | 506 | static void scrub_print_warning(const char *errstr, struct scrub_block *sblock) |
558540c1 | 507 | { |
a36cf8b8 SB |
508 | struct btrfs_device *dev; |
509 | struct btrfs_fs_info *fs_info; | |
558540c1 JS |
510 | struct btrfs_path *path; |
511 | struct btrfs_key found_key; | |
512 | struct extent_buffer *eb; | |
513 | struct btrfs_extent_item *ei; | |
514 | struct scrub_warning swarn; | |
69917e43 LB |
515 | unsigned long ptr = 0; |
516 | u64 extent_item_pos; | |
517 | u64 flags = 0; | |
558540c1 | 518 | u64 ref_root; |
69917e43 | 519 | u32 item_size; |
558540c1 | 520 | u8 ref_level; |
558540c1 | 521 | const int bufsize = 4096; |
69917e43 | 522 | int ret; |
558540c1 | 523 | |
a36cf8b8 | 524 | WARN_ON(sblock->page_count < 1); |
7a9e9987 | 525 | dev = sblock->pagev[0]->dev; |
a36cf8b8 SB |
526 | fs_info = sblock->sctx->dev_root->fs_info; |
527 | ||
558540c1 JS |
528 | path = btrfs_alloc_path(); |
529 | ||
530 | swarn.scratch_buf = kmalloc(bufsize, GFP_NOFS); | |
531 | swarn.msg_buf = kmalloc(bufsize, GFP_NOFS); | |
7a9e9987 SB |
532 | swarn.sector = (sblock->pagev[0]->physical) >> 9; |
533 | swarn.logical = sblock->pagev[0]->logical; | |
558540c1 | 534 | swarn.errstr = errstr; |
a36cf8b8 | 535 | swarn.dev = NULL; |
558540c1 JS |
536 | swarn.msg_bufsize = bufsize; |
537 | swarn.scratch_bufsize = bufsize; | |
538 | ||
539 | if (!path || !swarn.scratch_buf || !swarn.msg_buf) | |
540 | goto out; | |
541 | ||
69917e43 LB |
542 | ret = extent_from_logical(fs_info, swarn.logical, path, &found_key, |
543 | &flags); | |
558540c1 JS |
544 | if (ret < 0) |
545 | goto out; | |
546 | ||
4692cf58 | 547 | extent_item_pos = swarn.logical - found_key.objectid; |
558540c1 JS |
548 | swarn.extent_item_size = found_key.offset; |
549 | ||
550 | eb = path->nodes[0]; | |
551 | ei = btrfs_item_ptr(eb, path->slots[0], struct btrfs_extent_item); | |
552 | item_size = btrfs_item_size_nr(eb, path->slots[0]); | |
553 | ||
69917e43 | 554 | if (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK) { |
558540c1 JS |
555 | do { |
556 | ret = tree_backref_for_extent(&ptr, eb, ei, item_size, | |
557 | &ref_root, &ref_level); | |
606686ee | 558 | printk_in_rcu(KERN_WARNING |
1623edeb | 559 | "btrfs: %s at logical %llu on dev %s, " |
558540c1 | 560 | "sector %llu: metadata %s (level %d) in tree " |
606686ee JB |
561 | "%llu\n", errstr, swarn.logical, |
562 | rcu_str_deref(dev->name), | |
558540c1 JS |
563 | (unsigned long long)swarn.sector, |
564 | ref_level ? "node" : "leaf", | |
565 | ret < 0 ? -1 : ref_level, | |
566 | ret < 0 ? -1 : ref_root); | |
567 | } while (ret != 1); | |
d8fe29e9 | 568 | btrfs_release_path(path); |
558540c1 | 569 | } else { |
d8fe29e9 | 570 | btrfs_release_path(path); |
558540c1 | 571 | swarn.path = path; |
a36cf8b8 | 572 | swarn.dev = dev; |
7a3ae2f8 JS |
573 | iterate_extent_inodes(fs_info, found_key.objectid, |
574 | extent_item_pos, 1, | |
558540c1 JS |
575 | scrub_print_warning_inode, &swarn); |
576 | } | |
577 | ||
578 | out: | |
579 | btrfs_free_path(path); | |
580 | kfree(swarn.scratch_buf); | |
581 | kfree(swarn.msg_buf); | |
582 | } | |
583 | ||
ff023aac | 584 | static int scrub_fixup_readpage(u64 inum, u64 offset, u64 root, void *fixup_ctx) |
0ef8e451 | 585 | { |
5da6fcbc | 586 | struct page *page = NULL; |
0ef8e451 | 587 | unsigned long index; |
ff023aac | 588 | struct scrub_fixup_nodatasum *fixup = fixup_ctx; |
0ef8e451 | 589 | int ret; |
5da6fcbc | 590 | int corrected = 0; |
0ef8e451 | 591 | struct btrfs_key key; |
5da6fcbc | 592 | struct inode *inode = NULL; |
6f1c3605 | 593 | struct btrfs_fs_info *fs_info; |
0ef8e451 JS |
594 | u64 end = offset + PAGE_SIZE - 1; |
595 | struct btrfs_root *local_root; | |
6f1c3605 | 596 | int srcu_index; |
0ef8e451 JS |
597 | |
598 | key.objectid = root; | |
599 | key.type = BTRFS_ROOT_ITEM_KEY; | |
600 | key.offset = (u64)-1; | |
6f1c3605 LB |
601 | |
602 | fs_info = fixup->root->fs_info; | |
603 | srcu_index = srcu_read_lock(&fs_info->subvol_srcu); | |
604 | ||
605 | local_root = btrfs_read_fs_root_no_name(fs_info, &key); | |
606 | if (IS_ERR(local_root)) { | |
607 | srcu_read_unlock(&fs_info->subvol_srcu, srcu_index); | |
0ef8e451 | 608 | return PTR_ERR(local_root); |
6f1c3605 | 609 | } |
0ef8e451 JS |
610 | |
611 | key.type = BTRFS_INODE_ITEM_KEY; | |
612 | key.objectid = inum; | |
613 | key.offset = 0; | |
6f1c3605 LB |
614 | inode = btrfs_iget(fs_info->sb, &key, local_root, NULL); |
615 | srcu_read_unlock(&fs_info->subvol_srcu, srcu_index); | |
0ef8e451 JS |
616 | if (IS_ERR(inode)) |
617 | return PTR_ERR(inode); | |
618 | ||
0ef8e451 JS |
619 | index = offset >> PAGE_CACHE_SHIFT; |
620 | ||
621 | page = find_or_create_page(inode->i_mapping, index, GFP_NOFS); | |
5da6fcbc JS |
622 | if (!page) { |
623 | ret = -ENOMEM; | |
624 | goto out; | |
625 | } | |
626 | ||
627 | if (PageUptodate(page)) { | |
5da6fcbc JS |
628 | if (PageDirty(page)) { |
629 | /* | |
630 | * we need to write the data to the defect sector. the | |
631 | * data that was in that sector is not in memory, | |
632 | * because the page was modified. we must not write the | |
633 | * modified page to that sector. | |
634 | * | |
635 | * TODO: what could be done here: wait for the delalloc | |
636 | * runner to write out that page (might involve | |
637 | * COW) and see whether the sector is still | |
638 | * referenced afterwards. | |
639 | * | |
640 | * For the meantime, we'll treat this error | |
641 | * incorrectable, although there is a chance that a | |
642 | * later scrub will find the bad sector again and that | |
643 | * there's no dirty page in memory, then. | |
644 | */ | |
645 | ret = -EIO; | |
646 | goto out; | |
647 | } | |
3ec706c8 SB |
648 | fs_info = BTRFS_I(inode)->root->fs_info; |
649 | ret = repair_io_failure(fs_info, offset, PAGE_SIZE, | |
5da6fcbc JS |
650 | fixup->logical, page, |
651 | fixup->mirror_num); | |
652 | unlock_page(page); | |
653 | corrected = !ret; | |
654 | } else { | |
655 | /* | |
656 | * we need to get good data first. the general readpage path | |
657 | * will call repair_io_failure for us, we just have to make | |
658 | * sure we read the bad mirror. | |
659 | */ | |
660 | ret = set_extent_bits(&BTRFS_I(inode)->io_tree, offset, end, | |
661 | EXTENT_DAMAGED, GFP_NOFS); | |
662 | if (ret) { | |
663 | /* set_extent_bits should give proper error */ | |
664 | WARN_ON(ret > 0); | |
665 | if (ret > 0) | |
666 | ret = -EFAULT; | |
667 | goto out; | |
668 | } | |
669 | ||
670 | ret = extent_read_full_page(&BTRFS_I(inode)->io_tree, page, | |
671 | btrfs_get_extent, | |
672 | fixup->mirror_num); | |
673 | wait_on_page_locked(page); | |
674 | ||
675 | corrected = !test_range_bit(&BTRFS_I(inode)->io_tree, offset, | |
676 | end, EXTENT_DAMAGED, 0, NULL); | |
677 | if (!corrected) | |
678 | clear_extent_bits(&BTRFS_I(inode)->io_tree, offset, end, | |
679 | EXTENT_DAMAGED, GFP_NOFS); | |
680 | } | |
681 | ||
682 | out: | |
683 | if (page) | |
684 | put_page(page); | |
685 | if (inode) | |
686 | iput(inode); | |
0ef8e451 JS |
687 | |
688 | if (ret < 0) | |
689 | return ret; | |
690 | ||
691 | if (ret == 0 && corrected) { | |
692 | /* | |
693 | * we only need to call readpage for one of the inodes belonging | |
694 | * to this extent. so make iterate_extent_inodes stop | |
695 | */ | |
696 | return 1; | |
697 | } | |
698 | ||
699 | return -EIO; | |
700 | } | |
701 | ||
702 | static void scrub_fixup_nodatasum(struct btrfs_work *work) | |
703 | { | |
704 | int ret; | |
705 | struct scrub_fixup_nodatasum *fixup; | |
d9d181c1 | 706 | struct scrub_ctx *sctx; |
0ef8e451 JS |
707 | struct btrfs_trans_handle *trans = NULL; |
708 | struct btrfs_fs_info *fs_info; | |
709 | struct btrfs_path *path; | |
710 | int uncorrectable = 0; | |
711 | ||
712 | fixup = container_of(work, struct scrub_fixup_nodatasum, work); | |
d9d181c1 | 713 | sctx = fixup->sctx; |
0ef8e451 JS |
714 | fs_info = fixup->root->fs_info; |
715 | ||
716 | path = btrfs_alloc_path(); | |
717 | if (!path) { | |
d9d181c1 SB |
718 | spin_lock(&sctx->stat_lock); |
719 | ++sctx->stat.malloc_errors; | |
720 | spin_unlock(&sctx->stat_lock); | |
0ef8e451 JS |
721 | uncorrectable = 1; |
722 | goto out; | |
723 | } | |
724 | ||
725 | trans = btrfs_join_transaction(fixup->root); | |
726 | if (IS_ERR(trans)) { | |
727 | uncorrectable = 1; | |
728 | goto out; | |
729 | } | |
730 | ||
731 | /* | |
732 | * the idea is to trigger a regular read through the standard path. we | |
733 | * read a page from the (failed) logical address by specifying the | |
734 | * corresponding copynum of the failed sector. thus, that readpage is | |
735 | * expected to fail. | |
736 | * that is the point where on-the-fly error correction will kick in | |
737 | * (once it's finished) and rewrite the failed sector if a good copy | |
738 | * can be found. | |
739 | */ | |
740 | ret = iterate_inodes_from_logical(fixup->logical, fixup->root->fs_info, | |
741 | path, scrub_fixup_readpage, | |
742 | fixup); | |
743 | if (ret < 0) { | |
744 | uncorrectable = 1; | |
745 | goto out; | |
746 | } | |
747 | WARN_ON(ret != 1); | |
748 | ||
d9d181c1 SB |
749 | spin_lock(&sctx->stat_lock); |
750 | ++sctx->stat.corrected_errors; | |
751 | spin_unlock(&sctx->stat_lock); | |
0ef8e451 JS |
752 | |
753 | out: | |
754 | if (trans && !IS_ERR(trans)) | |
755 | btrfs_end_transaction(trans, fixup->root); | |
756 | if (uncorrectable) { | |
d9d181c1 SB |
757 | spin_lock(&sctx->stat_lock); |
758 | ++sctx->stat.uncorrectable_errors; | |
759 | spin_unlock(&sctx->stat_lock); | |
ff023aac SB |
760 | btrfs_dev_replace_stats_inc( |
761 | &sctx->dev_root->fs_info->dev_replace. | |
762 | num_uncorrectable_read_errors); | |
606686ee | 763 | printk_ratelimited_in_rcu(KERN_ERR |
b5d67f64 | 764 | "btrfs: unable to fixup (nodatasum) error at logical %llu on dev %s\n", |
c1c9ff7c | 765 | fixup->logical, rcu_str_deref(fixup->dev->name)); |
0ef8e451 JS |
766 | } |
767 | ||
768 | btrfs_free_path(path); | |
769 | kfree(fixup); | |
770 | ||
b6bfebc1 | 771 | scrub_pending_trans_workers_dec(sctx); |
0ef8e451 JS |
772 | } |
773 | ||
a2de733c | 774 | /* |
b5d67f64 SB |
775 | * scrub_handle_errored_block gets called when either verification of the |
776 | * pages failed or the bio failed to read, e.g. with EIO. In the latter | |
777 | * case, this function handles all pages in the bio, even though only one | |
778 | * may be bad. | |
779 | * The goal of this function is to repair the errored block by using the | |
780 | * contents of one of the mirrors. | |
a2de733c | 781 | */ |
b5d67f64 | 782 | static int scrub_handle_errored_block(struct scrub_block *sblock_to_check) |
a2de733c | 783 | { |
d9d181c1 | 784 | struct scrub_ctx *sctx = sblock_to_check->sctx; |
a36cf8b8 | 785 | struct btrfs_device *dev; |
b5d67f64 SB |
786 | struct btrfs_fs_info *fs_info; |
787 | u64 length; | |
788 | u64 logical; | |
789 | u64 generation; | |
790 | unsigned int failed_mirror_index; | |
791 | unsigned int is_metadata; | |
792 | unsigned int have_csum; | |
793 | u8 *csum; | |
794 | struct scrub_block *sblocks_for_recheck; /* holds one for each mirror */ | |
795 | struct scrub_block *sblock_bad; | |
796 | int ret; | |
797 | int mirror_index; | |
798 | int page_num; | |
799 | int success; | |
558540c1 | 800 | static DEFINE_RATELIMIT_STATE(_rs, DEFAULT_RATELIMIT_INTERVAL, |
b5d67f64 SB |
801 | DEFAULT_RATELIMIT_BURST); |
802 | ||
803 | BUG_ON(sblock_to_check->page_count < 1); | |
a36cf8b8 | 804 | fs_info = sctx->dev_root->fs_info; |
4ded4f63 SB |
805 | if (sblock_to_check->pagev[0]->flags & BTRFS_EXTENT_FLAG_SUPER) { |
806 | /* | |
807 | * if we find an error in a super block, we just report it. | |
808 | * They will get written with the next transaction commit | |
809 | * anyway | |
810 | */ | |
811 | spin_lock(&sctx->stat_lock); | |
812 | ++sctx->stat.super_errors; | |
813 | spin_unlock(&sctx->stat_lock); | |
814 | return 0; | |
815 | } | |
b5d67f64 | 816 | length = sblock_to_check->page_count * PAGE_SIZE; |
7a9e9987 SB |
817 | logical = sblock_to_check->pagev[0]->logical; |
818 | generation = sblock_to_check->pagev[0]->generation; | |
819 | BUG_ON(sblock_to_check->pagev[0]->mirror_num < 1); | |
820 | failed_mirror_index = sblock_to_check->pagev[0]->mirror_num - 1; | |
821 | is_metadata = !(sblock_to_check->pagev[0]->flags & | |
b5d67f64 | 822 | BTRFS_EXTENT_FLAG_DATA); |
7a9e9987 SB |
823 | have_csum = sblock_to_check->pagev[0]->have_csum; |
824 | csum = sblock_to_check->pagev[0]->csum; | |
825 | dev = sblock_to_check->pagev[0]->dev; | |
13db62b7 | 826 | |
ff023aac SB |
827 | if (sctx->is_dev_replace && !is_metadata && !have_csum) { |
828 | sblocks_for_recheck = NULL; | |
829 | goto nodatasum_case; | |
830 | } | |
831 | ||
b5d67f64 SB |
832 | /* |
833 | * read all mirrors one after the other. This includes to | |
834 | * re-read the extent or metadata block that failed (that was | |
835 | * the cause that this fixup code is called) another time, | |
836 | * page by page this time in order to know which pages | |
837 | * caused I/O errors and which ones are good (for all mirrors). | |
838 | * It is the goal to handle the situation when more than one | |
839 | * mirror contains I/O errors, but the errors do not | |
840 | * overlap, i.e. the data can be repaired by selecting the | |
841 | * pages from those mirrors without I/O error on the | |
842 | * particular pages. One example (with blocks >= 2 * PAGE_SIZE) | |
843 | * would be that mirror #1 has an I/O error on the first page, | |
844 | * the second page is good, and mirror #2 has an I/O error on | |
845 | * the second page, but the first page is good. | |
846 | * Then the first page of the first mirror can be repaired by | |
847 | * taking the first page of the second mirror, and the | |
848 | * second page of the second mirror can be repaired by | |
849 | * copying the contents of the 2nd page of the 1st mirror. | |
850 | * One more note: if the pages of one mirror contain I/O | |
851 | * errors, the checksum cannot be verified. In order to get | |
852 | * the best data for repairing, the first attempt is to find | |
853 | * a mirror without I/O errors and with a validated checksum. | |
854 | * Only if this is not possible, the pages are picked from | |
855 | * mirrors with I/O errors without considering the checksum. | |
856 | * If the latter is the case, at the end, the checksum of the | |
857 | * repaired area is verified in order to correctly maintain | |
858 | * the statistics. | |
859 | */ | |
860 | ||
861 | sblocks_for_recheck = kzalloc(BTRFS_MAX_MIRRORS * | |
862 | sizeof(*sblocks_for_recheck), | |
863 | GFP_NOFS); | |
864 | if (!sblocks_for_recheck) { | |
d9d181c1 SB |
865 | spin_lock(&sctx->stat_lock); |
866 | sctx->stat.malloc_errors++; | |
867 | sctx->stat.read_errors++; | |
868 | sctx->stat.uncorrectable_errors++; | |
869 | spin_unlock(&sctx->stat_lock); | |
a36cf8b8 | 870 | btrfs_dev_stat_inc_and_print(dev, BTRFS_DEV_STAT_READ_ERRS); |
b5d67f64 | 871 | goto out; |
a2de733c AJ |
872 | } |
873 | ||
b5d67f64 | 874 | /* setup the context, map the logical blocks and alloc the pages */ |
ff023aac | 875 | ret = scrub_setup_recheck_block(sctx, fs_info, sblock_to_check, length, |
b5d67f64 SB |
876 | logical, sblocks_for_recheck); |
877 | if (ret) { | |
d9d181c1 SB |
878 | spin_lock(&sctx->stat_lock); |
879 | sctx->stat.read_errors++; | |
880 | sctx->stat.uncorrectable_errors++; | |
881 | spin_unlock(&sctx->stat_lock); | |
a36cf8b8 | 882 | btrfs_dev_stat_inc_and_print(dev, BTRFS_DEV_STAT_READ_ERRS); |
b5d67f64 SB |
883 | goto out; |
884 | } | |
885 | BUG_ON(failed_mirror_index >= BTRFS_MAX_MIRRORS); | |
886 | sblock_bad = sblocks_for_recheck + failed_mirror_index; | |
13db62b7 | 887 | |
b5d67f64 | 888 | /* build and submit the bios for the failed mirror, check checksums */ |
34f5c8e9 SB |
889 | scrub_recheck_block(fs_info, sblock_bad, is_metadata, have_csum, |
890 | csum, generation, sctx->csum_size); | |
a2de733c | 891 | |
b5d67f64 SB |
892 | if (!sblock_bad->header_error && !sblock_bad->checksum_error && |
893 | sblock_bad->no_io_error_seen) { | |
894 | /* | |
895 | * the error disappeared after reading page by page, or | |
896 | * the area was part of a huge bio and other parts of the | |
897 | * bio caused I/O errors, or the block layer merged several | |
898 | * read requests into one and the error is caused by a | |
899 | * different bio (usually one of the two latter cases is | |
900 | * the cause) | |
901 | */ | |
d9d181c1 SB |
902 | spin_lock(&sctx->stat_lock); |
903 | sctx->stat.unverified_errors++; | |
904 | spin_unlock(&sctx->stat_lock); | |
a2de733c | 905 | |
ff023aac SB |
906 | if (sctx->is_dev_replace) |
907 | scrub_write_block_to_dev_replace(sblock_bad); | |
b5d67f64 | 908 | goto out; |
a2de733c | 909 | } |
a2de733c | 910 | |
b5d67f64 | 911 | if (!sblock_bad->no_io_error_seen) { |
d9d181c1 SB |
912 | spin_lock(&sctx->stat_lock); |
913 | sctx->stat.read_errors++; | |
914 | spin_unlock(&sctx->stat_lock); | |
b5d67f64 SB |
915 | if (__ratelimit(&_rs)) |
916 | scrub_print_warning("i/o error", sblock_to_check); | |
a36cf8b8 | 917 | btrfs_dev_stat_inc_and_print(dev, BTRFS_DEV_STAT_READ_ERRS); |
b5d67f64 | 918 | } else if (sblock_bad->checksum_error) { |
d9d181c1 SB |
919 | spin_lock(&sctx->stat_lock); |
920 | sctx->stat.csum_errors++; | |
921 | spin_unlock(&sctx->stat_lock); | |
b5d67f64 SB |
922 | if (__ratelimit(&_rs)) |
923 | scrub_print_warning("checksum error", sblock_to_check); | |
a36cf8b8 | 924 | btrfs_dev_stat_inc_and_print(dev, |
442a4f63 | 925 | BTRFS_DEV_STAT_CORRUPTION_ERRS); |
b5d67f64 | 926 | } else if (sblock_bad->header_error) { |
d9d181c1 SB |
927 | spin_lock(&sctx->stat_lock); |
928 | sctx->stat.verify_errors++; | |
929 | spin_unlock(&sctx->stat_lock); | |
b5d67f64 SB |
930 | if (__ratelimit(&_rs)) |
931 | scrub_print_warning("checksum/header error", | |
932 | sblock_to_check); | |
442a4f63 | 933 | if (sblock_bad->generation_error) |
a36cf8b8 | 934 | btrfs_dev_stat_inc_and_print(dev, |
442a4f63 SB |
935 | BTRFS_DEV_STAT_GENERATION_ERRS); |
936 | else | |
a36cf8b8 | 937 | btrfs_dev_stat_inc_and_print(dev, |
442a4f63 | 938 | BTRFS_DEV_STAT_CORRUPTION_ERRS); |
b5d67f64 | 939 | } |
a2de733c | 940 | |
ff023aac | 941 | if (sctx->readonly && !sctx->is_dev_replace) |
b5d67f64 | 942 | goto did_not_correct_error; |
a2de733c | 943 | |
b5d67f64 SB |
944 | if (!is_metadata && !have_csum) { |
945 | struct scrub_fixup_nodatasum *fixup_nodatasum; | |
a2de733c | 946 | |
ff023aac SB |
947 | nodatasum_case: |
948 | WARN_ON(sctx->is_dev_replace); | |
949 | ||
b5d67f64 SB |
950 | /* |
951 | * !is_metadata and !have_csum, this means that the data | |
952 | * might not be COW'ed, that it might be modified | |
953 | * concurrently. The general strategy to work on the | |
954 | * commit root does not help in the case when COW is not | |
955 | * used. | |
956 | */ | |
957 | fixup_nodatasum = kzalloc(sizeof(*fixup_nodatasum), GFP_NOFS); | |
958 | if (!fixup_nodatasum) | |
959 | goto did_not_correct_error; | |
d9d181c1 | 960 | fixup_nodatasum->sctx = sctx; |
a36cf8b8 | 961 | fixup_nodatasum->dev = dev; |
b5d67f64 SB |
962 | fixup_nodatasum->logical = logical; |
963 | fixup_nodatasum->root = fs_info->extent_root; | |
964 | fixup_nodatasum->mirror_num = failed_mirror_index + 1; | |
b6bfebc1 | 965 | scrub_pending_trans_workers_inc(sctx); |
b5d67f64 SB |
966 | fixup_nodatasum->work.func = scrub_fixup_nodatasum; |
967 | btrfs_queue_worker(&fs_info->scrub_workers, | |
968 | &fixup_nodatasum->work); | |
969 | goto out; | |
a2de733c AJ |
970 | } |
971 | ||
b5d67f64 SB |
972 | /* |
973 | * now build and submit the bios for the other mirrors, check | |
cb2ced73 SB |
974 | * checksums. |
975 | * First try to pick the mirror which is completely without I/O | |
b5d67f64 SB |
976 | * errors and also does not have a checksum error. |
977 | * If one is found, and if a checksum is present, the full block | |
978 | * that is known to contain an error is rewritten. Afterwards | |
979 | * the block is known to be corrected. | |
980 | * If a mirror is found which is completely correct, and no | |
981 | * checksum is present, only those pages are rewritten that had | |
982 | * an I/O error in the block to be repaired, since it cannot be | |
983 | * determined, which copy of the other pages is better (and it | |
984 | * could happen otherwise that a correct page would be | |
985 | * overwritten by a bad one). | |
986 | */ | |
987 | for (mirror_index = 0; | |
988 | mirror_index < BTRFS_MAX_MIRRORS && | |
989 | sblocks_for_recheck[mirror_index].page_count > 0; | |
990 | mirror_index++) { | |
cb2ced73 | 991 | struct scrub_block *sblock_other; |
b5d67f64 | 992 | |
cb2ced73 SB |
993 | if (mirror_index == failed_mirror_index) |
994 | continue; | |
995 | sblock_other = sblocks_for_recheck + mirror_index; | |
996 | ||
997 | /* build and submit the bios, check checksums */ | |
34f5c8e9 SB |
998 | scrub_recheck_block(fs_info, sblock_other, is_metadata, |
999 | have_csum, csum, generation, | |
1000 | sctx->csum_size); | |
1001 | ||
1002 | if (!sblock_other->header_error && | |
b5d67f64 SB |
1003 | !sblock_other->checksum_error && |
1004 | sblock_other->no_io_error_seen) { | |
ff023aac SB |
1005 | if (sctx->is_dev_replace) { |
1006 | scrub_write_block_to_dev_replace(sblock_other); | |
1007 | } else { | |
1008 | int force_write = is_metadata || have_csum; | |
1009 | ||
1010 | ret = scrub_repair_block_from_good_copy( | |
1011 | sblock_bad, sblock_other, | |
1012 | force_write); | |
1013 | } | |
b5d67f64 SB |
1014 | if (0 == ret) |
1015 | goto corrected_error; | |
1016 | } | |
1017 | } | |
a2de733c AJ |
1018 | |
1019 | /* | |
ff023aac SB |
1020 | * for dev_replace, pick good pages and write to the target device. |
1021 | */ | |
1022 | if (sctx->is_dev_replace) { | |
1023 | success = 1; | |
1024 | for (page_num = 0; page_num < sblock_bad->page_count; | |
1025 | page_num++) { | |
1026 | int sub_success; | |
1027 | ||
1028 | sub_success = 0; | |
1029 | for (mirror_index = 0; | |
1030 | mirror_index < BTRFS_MAX_MIRRORS && | |
1031 | sblocks_for_recheck[mirror_index].page_count > 0; | |
1032 | mirror_index++) { | |
1033 | struct scrub_block *sblock_other = | |
1034 | sblocks_for_recheck + mirror_index; | |
1035 | struct scrub_page *page_other = | |
1036 | sblock_other->pagev[page_num]; | |
1037 | ||
1038 | if (!page_other->io_error) { | |
1039 | ret = scrub_write_page_to_dev_replace( | |
1040 | sblock_other, page_num); | |
1041 | if (ret == 0) { | |
1042 | /* succeeded for this page */ | |
1043 | sub_success = 1; | |
1044 | break; | |
1045 | } else { | |
1046 | btrfs_dev_replace_stats_inc( | |
1047 | &sctx->dev_root-> | |
1048 | fs_info->dev_replace. | |
1049 | num_write_errors); | |
1050 | } | |
1051 | } | |
1052 | } | |
1053 | ||
1054 | if (!sub_success) { | |
1055 | /* | |
1056 | * did not find a mirror to fetch the page | |
1057 | * from. scrub_write_page_to_dev_replace() | |
1058 | * handles this case (page->io_error), by | |
1059 | * filling the block with zeros before | |
1060 | * submitting the write request | |
1061 | */ | |
1062 | success = 0; | |
1063 | ret = scrub_write_page_to_dev_replace( | |
1064 | sblock_bad, page_num); | |
1065 | if (ret) | |
1066 | btrfs_dev_replace_stats_inc( | |
1067 | &sctx->dev_root->fs_info-> | |
1068 | dev_replace.num_write_errors); | |
1069 | } | |
1070 | } | |
1071 | ||
1072 | goto out; | |
1073 | } | |
1074 | ||
1075 | /* | |
1076 | * for regular scrub, repair those pages that are errored. | |
1077 | * In case of I/O errors in the area that is supposed to be | |
b5d67f64 SB |
1078 | * repaired, continue by picking good copies of those pages. |
1079 | * Select the good pages from mirrors to rewrite bad pages from | |
1080 | * the area to fix. Afterwards verify the checksum of the block | |
1081 | * that is supposed to be repaired. This verification step is | |
1082 | * only done for the purpose of statistic counting and for the | |
1083 | * final scrub report, whether errors remain. | |
1084 | * A perfect algorithm could make use of the checksum and try | |
1085 | * all possible combinations of pages from the different mirrors | |
1086 | * until the checksum verification succeeds. For example, when | |
1087 | * the 2nd page of mirror #1 faces I/O errors, and the 2nd page | |
1088 | * of mirror #2 is readable but the final checksum test fails, | |
1089 | * then the 2nd page of mirror #3 could be tried, whether now | |
1090 | * the final checksum succeedes. But this would be a rare | |
1091 | * exception and is therefore not implemented. At least it is | |
1092 | * avoided that the good copy is overwritten. | |
1093 | * A more useful improvement would be to pick the sectors | |
1094 | * without I/O error based on sector sizes (512 bytes on legacy | |
1095 | * disks) instead of on PAGE_SIZE. Then maybe 512 byte of one | |
1096 | * mirror could be repaired by taking 512 byte of a different | |
1097 | * mirror, even if other 512 byte sectors in the same PAGE_SIZE | |
1098 | * area are unreadable. | |
a2de733c | 1099 | */ |
a2de733c | 1100 | |
b5d67f64 SB |
1101 | /* can only fix I/O errors from here on */ |
1102 | if (sblock_bad->no_io_error_seen) | |
1103 | goto did_not_correct_error; | |
1104 | ||
1105 | success = 1; | |
1106 | for (page_num = 0; page_num < sblock_bad->page_count; page_num++) { | |
7a9e9987 | 1107 | struct scrub_page *page_bad = sblock_bad->pagev[page_num]; |
b5d67f64 SB |
1108 | |
1109 | if (!page_bad->io_error) | |
a2de733c | 1110 | continue; |
b5d67f64 SB |
1111 | |
1112 | for (mirror_index = 0; | |
1113 | mirror_index < BTRFS_MAX_MIRRORS && | |
1114 | sblocks_for_recheck[mirror_index].page_count > 0; | |
1115 | mirror_index++) { | |
1116 | struct scrub_block *sblock_other = sblocks_for_recheck + | |
1117 | mirror_index; | |
7a9e9987 SB |
1118 | struct scrub_page *page_other = sblock_other->pagev[ |
1119 | page_num]; | |
b5d67f64 SB |
1120 | |
1121 | if (!page_other->io_error) { | |
1122 | ret = scrub_repair_page_from_good_copy( | |
1123 | sblock_bad, sblock_other, page_num, 0); | |
1124 | if (0 == ret) { | |
1125 | page_bad->io_error = 0; | |
1126 | break; /* succeeded for this page */ | |
1127 | } | |
1128 | } | |
96e36920 | 1129 | } |
a2de733c | 1130 | |
b5d67f64 SB |
1131 | if (page_bad->io_error) { |
1132 | /* did not find a mirror to copy the page from */ | |
1133 | success = 0; | |
1134 | } | |
a2de733c | 1135 | } |
a2de733c | 1136 | |
b5d67f64 SB |
1137 | if (success) { |
1138 | if (is_metadata || have_csum) { | |
1139 | /* | |
1140 | * need to verify the checksum now that all | |
1141 | * sectors on disk are repaired (the write | |
1142 | * request for data to be repaired is on its way). | |
1143 | * Just be lazy and use scrub_recheck_block() | |
1144 | * which re-reads the data before the checksum | |
1145 | * is verified, but most likely the data comes out | |
1146 | * of the page cache. | |
1147 | */ | |
34f5c8e9 SB |
1148 | scrub_recheck_block(fs_info, sblock_bad, |
1149 | is_metadata, have_csum, csum, | |
1150 | generation, sctx->csum_size); | |
1151 | if (!sblock_bad->header_error && | |
b5d67f64 SB |
1152 | !sblock_bad->checksum_error && |
1153 | sblock_bad->no_io_error_seen) | |
1154 | goto corrected_error; | |
1155 | else | |
1156 | goto did_not_correct_error; | |
1157 | } else { | |
1158 | corrected_error: | |
d9d181c1 SB |
1159 | spin_lock(&sctx->stat_lock); |
1160 | sctx->stat.corrected_errors++; | |
1161 | spin_unlock(&sctx->stat_lock); | |
606686ee | 1162 | printk_ratelimited_in_rcu(KERN_ERR |
b5d67f64 | 1163 | "btrfs: fixed up error at logical %llu on dev %s\n", |
c1c9ff7c | 1164 | logical, rcu_str_deref(dev->name)); |
8628764e | 1165 | } |
b5d67f64 SB |
1166 | } else { |
1167 | did_not_correct_error: | |
d9d181c1 SB |
1168 | spin_lock(&sctx->stat_lock); |
1169 | sctx->stat.uncorrectable_errors++; | |
1170 | spin_unlock(&sctx->stat_lock); | |
606686ee | 1171 | printk_ratelimited_in_rcu(KERN_ERR |
b5d67f64 | 1172 | "btrfs: unable to fixup (regular) error at logical %llu on dev %s\n", |
c1c9ff7c | 1173 | logical, rcu_str_deref(dev->name)); |
96e36920 | 1174 | } |
a2de733c | 1175 | |
b5d67f64 SB |
1176 | out: |
1177 | if (sblocks_for_recheck) { | |
1178 | for (mirror_index = 0; mirror_index < BTRFS_MAX_MIRRORS; | |
1179 | mirror_index++) { | |
1180 | struct scrub_block *sblock = sblocks_for_recheck + | |
1181 | mirror_index; | |
1182 | int page_index; | |
1183 | ||
7a9e9987 SB |
1184 | for (page_index = 0; page_index < sblock->page_count; |
1185 | page_index++) { | |
1186 | sblock->pagev[page_index]->sblock = NULL; | |
1187 | scrub_page_put(sblock->pagev[page_index]); | |
1188 | } | |
b5d67f64 SB |
1189 | } |
1190 | kfree(sblocks_for_recheck); | |
1191 | } | |
a2de733c | 1192 | |
b5d67f64 SB |
1193 | return 0; |
1194 | } | |
a2de733c | 1195 | |
d9d181c1 | 1196 | static int scrub_setup_recheck_block(struct scrub_ctx *sctx, |
3ec706c8 | 1197 | struct btrfs_fs_info *fs_info, |
ff023aac | 1198 | struct scrub_block *original_sblock, |
b5d67f64 SB |
1199 | u64 length, u64 logical, |
1200 | struct scrub_block *sblocks_for_recheck) | |
1201 | { | |
1202 | int page_index; | |
1203 | int mirror_index; | |
1204 | int ret; | |
1205 | ||
1206 | /* | |
7a9e9987 | 1207 | * note: the two members ref_count and outstanding_pages |
b5d67f64 SB |
1208 | * are not used (and not set) in the blocks that are used for |
1209 | * the recheck procedure | |
1210 | */ | |
1211 | ||
1212 | page_index = 0; | |
1213 | while (length > 0) { | |
1214 | u64 sublen = min_t(u64, length, PAGE_SIZE); | |
1215 | u64 mapped_length = sublen; | |
1216 | struct btrfs_bio *bbio = NULL; | |
a2de733c | 1217 | |
b5d67f64 SB |
1218 | /* |
1219 | * with a length of PAGE_SIZE, each returned stripe | |
1220 | * represents one mirror | |
1221 | */ | |
29a8d9a0 SB |
1222 | ret = btrfs_map_block(fs_info, REQ_GET_READ_MIRRORS, logical, |
1223 | &mapped_length, &bbio, 0); | |
b5d67f64 SB |
1224 | if (ret || !bbio || mapped_length < sublen) { |
1225 | kfree(bbio); | |
1226 | return -EIO; | |
1227 | } | |
a2de733c | 1228 | |
ff023aac | 1229 | BUG_ON(page_index >= SCRUB_PAGES_PER_RD_BIO); |
b5d67f64 SB |
1230 | for (mirror_index = 0; mirror_index < (int)bbio->num_stripes; |
1231 | mirror_index++) { | |
1232 | struct scrub_block *sblock; | |
1233 | struct scrub_page *page; | |
1234 | ||
1235 | if (mirror_index >= BTRFS_MAX_MIRRORS) | |
1236 | continue; | |
1237 | ||
1238 | sblock = sblocks_for_recheck + mirror_index; | |
7a9e9987 SB |
1239 | sblock->sctx = sctx; |
1240 | page = kzalloc(sizeof(*page), GFP_NOFS); | |
1241 | if (!page) { | |
1242 | leave_nomem: | |
d9d181c1 SB |
1243 | spin_lock(&sctx->stat_lock); |
1244 | sctx->stat.malloc_errors++; | |
1245 | spin_unlock(&sctx->stat_lock); | |
cf93dcce | 1246 | kfree(bbio); |
b5d67f64 SB |
1247 | return -ENOMEM; |
1248 | } | |
7a9e9987 SB |
1249 | scrub_page_get(page); |
1250 | sblock->pagev[page_index] = page; | |
1251 | page->logical = logical; | |
1252 | page->physical = bbio->stripes[mirror_index].physical; | |
ff023aac SB |
1253 | BUG_ON(page_index >= original_sblock->page_count); |
1254 | page->physical_for_dev_replace = | |
1255 | original_sblock->pagev[page_index]-> | |
1256 | physical_for_dev_replace; | |
7a9e9987 SB |
1257 | /* for missing devices, dev->bdev is NULL */ |
1258 | page->dev = bbio->stripes[mirror_index].dev; | |
1259 | page->mirror_num = mirror_index + 1; | |
b5d67f64 | 1260 | sblock->page_count++; |
7a9e9987 SB |
1261 | page->page = alloc_page(GFP_NOFS); |
1262 | if (!page->page) | |
1263 | goto leave_nomem; | |
b5d67f64 SB |
1264 | } |
1265 | kfree(bbio); | |
1266 | length -= sublen; | |
1267 | logical += sublen; | |
1268 | page_index++; | |
1269 | } | |
1270 | ||
1271 | return 0; | |
96e36920 ID |
1272 | } |
1273 | ||
b5d67f64 SB |
1274 | /* |
1275 | * this function will check the on disk data for checksum errors, header | |
1276 | * errors and read I/O errors. If any I/O errors happen, the exact pages | |
1277 | * which are errored are marked as being bad. The goal is to enable scrub | |
1278 | * to take those pages that are not errored from all the mirrors so that | |
1279 | * the pages that are errored in the just handled mirror can be repaired. | |
1280 | */ | |
34f5c8e9 SB |
1281 | static void scrub_recheck_block(struct btrfs_fs_info *fs_info, |
1282 | struct scrub_block *sblock, int is_metadata, | |
1283 | int have_csum, u8 *csum, u64 generation, | |
1284 | u16 csum_size) | |
96e36920 | 1285 | { |
b5d67f64 | 1286 | int page_num; |
96e36920 | 1287 | |
b5d67f64 SB |
1288 | sblock->no_io_error_seen = 1; |
1289 | sblock->header_error = 0; | |
1290 | sblock->checksum_error = 0; | |
96e36920 | 1291 | |
b5d67f64 SB |
1292 | for (page_num = 0; page_num < sblock->page_count; page_num++) { |
1293 | struct bio *bio; | |
7a9e9987 | 1294 | struct scrub_page *page = sblock->pagev[page_num]; |
b5d67f64 SB |
1295 | DECLARE_COMPLETION_ONSTACK(complete); |
1296 | ||
442a4f63 | 1297 | if (page->dev->bdev == NULL) { |
ea9947b4 SB |
1298 | page->io_error = 1; |
1299 | sblock->no_io_error_seen = 0; | |
1300 | continue; | |
1301 | } | |
1302 | ||
7a9e9987 | 1303 | WARN_ON(!page->page); |
9be3395b | 1304 | bio = btrfs_io_bio_alloc(GFP_NOFS, 1); |
34f5c8e9 SB |
1305 | if (!bio) { |
1306 | page->io_error = 1; | |
1307 | sblock->no_io_error_seen = 0; | |
1308 | continue; | |
1309 | } | |
442a4f63 | 1310 | bio->bi_bdev = page->dev->bdev; |
b5d67f64 SB |
1311 | bio->bi_sector = page->physical >> 9; |
1312 | bio->bi_end_io = scrub_complete_bio_end_io; | |
1313 | bio->bi_private = &complete; | |
1314 | ||
34f5c8e9 | 1315 | bio_add_page(bio, page->page, PAGE_SIZE, 0); |
b5d67f64 | 1316 | btrfsic_submit_bio(READ, bio); |
96e36920 | 1317 | |
b5d67f64 SB |
1318 | /* this will also unplug the queue */ |
1319 | wait_for_completion(&complete); | |
96e36920 | 1320 | |
b5d67f64 SB |
1321 | page->io_error = !test_bit(BIO_UPTODATE, &bio->bi_flags); |
1322 | if (!test_bit(BIO_UPTODATE, &bio->bi_flags)) | |
1323 | sblock->no_io_error_seen = 0; | |
1324 | bio_put(bio); | |
1325 | } | |
96e36920 | 1326 | |
b5d67f64 SB |
1327 | if (sblock->no_io_error_seen) |
1328 | scrub_recheck_block_checksum(fs_info, sblock, is_metadata, | |
1329 | have_csum, csum, generation, | |
1330 | csum_size); | |
1331 | ||
34f5c8e9 | 1332 | return; |
a2de733c AJ |
1333 | } |
1334 | ||
b5d67f64 SB |
1335 | static void scrub_recheck_block_checksum(struct btrfs_fs_info *fs_info, |
1336 | struct scrub_block *sblock, | |
1337 | int is_metadata, int have_csum, | |
1338 | const u8 *csum, u64 generation, | |
1339 | u16 csum_size) | |
a2de733c | 1340 | { |
b5d67f64 SB |
1341 | int page_num; |
1342 | u8 calculated_csum[BTRFS_CSUM_SIZE]; | |
1343 | u32 crc = ~(u32)0; | |
b5d67f64 SB |
1344 | void *mapped_buffer; |
1345 | ||
7a9e9987 | 1346 | WARN_ON(!sblock->pagev[0]->page); |
b5d67f64 SB |
1347 | if (is_metadata) { |
1348 | struct btrfs_header *h; | |
1349 | ||
7a9e9987 | 1350 | mapped_buffer = kmap_atomic(sblock->pagev[0]->page); |
b5d67f64 SB |
1351 | h = (struct btrfs_header *)mapped_buffer; |
1352 | ||
3cae210f | 1353 | if (sblock->pagev[0]->logical != btrfs_stack_header_bytenr(h) || |
b5d67f64 SB |
1354 | memcmp(h->fsid, fs_info->fsid, BTRFS_UUID_SIZE) || |
1355 | memcmp(h->chunk_tree_uuid, fs_info->chunk_tree_uuid, | |
442a4f63 | 1356 | BTRFS_UUID_SIZE)) { |
b5d67f64 | 1357 | sblock->header_error = 1; |
3cae210f | 1358 | } else if (generation != btrfs_stack_header_generation(h)) { |
442a4f63 SB |
1359 | sblock->header_error = 1; |
1360 | sblock->generation_error = 1; | |
1361 | } | |
b5d67f64 SB |
1362 | csum = h->csum; |
1363 | } else { | |
1364 | if (!have_csum) | |
1365 | return; | |
a2de733c | 1366 | |
7a9e9987 | 1367 | mapped_buffer = kmap_atomic(sblock->pagev[0]->page); |
b5d67f64 | 1368 | } |
a2de733c | 1369 | |
b5d67f64 SB |
1370 | for (page_num = 0;;) { |
1371 | if (page_num == 0 && is_metadata) | |
b0496686 | 1372 | crc = btrfs_csum_data( |
b5d67f64 SB |
1373 | ((u8 *)mapped_buffer) + BTRFS_CSUM_SIZE, |
1374 | crc, PAGE_SIZE - BTRFS_CSUM_SIZE); | |
1375 | else | |
b0496686 | 1376 | crc = btrfs_csum_data(mapped_buffer, crc, PAGE_SIZE); |
b5d67f64 | 1377 | |
9613bebb | 1378 | kunmap_atomic(mapped_buffer); |
b5d67f64 SB |
1379 | page_num++; |
1380 | if (page_num >= sblock->page_count) | |
1381 | break; | |
7a9e9987 | 1382 | WARN_ON(!sblock->pagev[page_num]->page); |
b5d67f64 | 1383 | |
7a9e9987 | 1384 | mapped_buffer = kmap_atomic(sblock->pagev[page_num]->page); |
b5d67f64 SB |
1385 | } |
1386 | ||
1387 | btrfs_csum_final(crc, calculated_csum); | |
1388 | if (memcmp(calculated_csum, csum, csum_size)) | |
1389 | sblock->checksum_error = 1; | |
a2de733c AJ |
1390 | } |
1391 | ||
b5d67f64 | 1392 | static void scrub_complete_bio_end_io(struct bio *bio, int err) |
a2de733c | 1393 | { |
b5d67f64 SB |
1394 | complete((struct completion *)bio->bi_private); |
1395 | } | |
a2de733c | 1396 | |
b5d67f64 SB |
1397 | static int scrub_repair_block_from_good_copy(struct scrub_block *sblock_bad, |
1398 | struct scrub_block *sblock_good, | |
1399 | int force_write) | |
1400 | { | |
1401 | int page_num; | |
1402 | int ret = 0; | |
96e36920 | 1403 | |
b5d67f64 SB |
1404 | for (page_num = 0; page_num < sblock_bad->page_count; page_num++) { |
1405 | int ret_sub; | |
96e36920 | 1406 | |
b5d67f64 SB |
1407 | ret_sub = scrub_repair_page_from_good_copy(sblock_bad, |
1408 | sblock_good, | |
1409 | page_num, | |
1410 | force_write); | |
1411 | if (ret_sub) | |
1412 | ret = ret_sub; | |
a2de733c | 1413 | } |
b5d67f64 SB |
1414 | |
1415 | return ret; | |
1416 | } | |
1417 | ||
1418 | static int scrub_repair_page_from_good_copy(struct scrub_block *sblock_bad, | |
1419 | struct scrub_block *sblock_good, | |
1420 | int page_num, int force_write) | |
1421 | { | |
7a9e9987 SB |
1422 | struct scrub_page *page_bad = sblock_bad->pagev[page_num]; |
1423 | struct scrub_page *page_good = sblock_good->pagev[page_num]; | |
b5d67f64 | 1424 | |
7a9e9987 SB |
1425 | BUG_ON(page_bad->page == NULL); |
1426 | BUG_ON(page_good->page == NULL); | |
b5d67f64 SB |
1427 | if (force_write || sblock_bad->header_error || |
1428 | sblock_bad->checksum_error || page_bad->io_error) { | |
1429 | struct bio *bio; | |
1430 | int ret; | |
1431 | DECLARE_COMPLETION_ONSTACK(complete); | |
1432 | ||
ff023aac SB |
1433 | if (!page_bad->dev->bdev) { |
1434 | printk_ratelimited(KERN_WARNING | |
1435 | "btrfs: scrub_repair_page_from_good_copy(bdev == NULL) is unexpected!\n"); | |
1436 | return -EIO; | |
1437 | } | |
1438 | ||
9be3395b | 1439 | bio = btrfs_io_bio_alloc(GFP_NOFS, 1); |
e627ee7b TI |
1440 | if (!bio) |
1441 | return -EIO; | |
442a4f63 | 1442 | bio->bi_bdev = page_bad->dev->bdev; |
b5d67f64 SB |
1443 | bio->bi_sector = page_bad->physical >> 9; |
1444 | bio->bi_end_io = scrub_complete_bio_end_io; | |
1445 | bio->bi_private = &complete; | |
1446 | ||
1447 | ret = bio_add_page(bio, page_good->page, PAGE_SIZE, 0); | |
1448 | if (PAGE_SIZE != ret) { | |
1449 | bio_put(bio); | |
1450 | return -EIO; | |
13db62b7 | 1451 | } |
b5d67f64 SB |
1452 | btrfsic_submit_bio(WRITE, bio); |
1453 | ||
1454 | /* this will also unplug the queue */ | |
1455 | wait_for_completion(&complete); | |
442a4f63 SB |
1456 | if (!bio_flagged(bio, BIO_UPTODATE)) { |
1457 | btrfs_dev_stat_inc_and_print(page_bad->dev, | |
1458 | BTRFS_DEV_STAT_WRITE_ERRS); | |
ff023aac SB |
1459 | btrfs_dev_replace_stats_inc( |
1460 | &sblock_bad->sctx->dev_root->fs_info-> | |
1461 | dev_replace.num_write_errors); | |
442a4f63 SB |
1462 | bio_put(bio); |
1463 | return -EIO; | |
1464 | } | |
b5d67f64 | 1465 | bio_put(bio); |
a2de733c AJ |
1466 | } |
1467 | ||
b5d67f64 SB |
1468 | return 0; |
1469 | } | |
1470 | ||
ff023aac SB |
1471 | static void scrub_write_block_to_dev_replace(struct scrub_block *sblock) |
1472 | { | |
1473 | int page_num; | |
1474 | ||
1475 | for (page_num = 0; page_num < sblock->page_count; page_num++) { | |
1476 | int ret; | |
1477 | ||
1478 | ret = scrub_write_page_to_dev_replace(sblock, page_num); | |
1479 | if (ret) | |
1480 | btrfs_dev_replace_stats_inc( | |
1481 | &sblock->sctx->dev_root->fs_info->dev_replace. | |
1482 | num_write_errors); | |
1483 | } | |
1484 | } | |
1485 | ||
1486 | static int scrub_write_page_to_dev_replace(struct scrub_block *sblock, | |
1487 | int page_num) | |
1488 | { | |
1489 | struct scrub_page *spage = sblock->pagev[page_num]; | |
1490 | ||
1491 | BUG_ON(spage->page == NULL); | |
1492 | if (spage->io_error) { | |
1493 | void *mapped_buffer = kmap_atomic(spage->page); | |
1494 | ||
1495 | memset(mapped_buffer, 0, PAGE_CACHE_SIZE); | |
1496 | flush_dcache_page(spage->page); | |
1497 | kunmap_atomic(mapped_buffer); | |
1498 | } | |
1499 | return scrub_add_page_to_wr_bio(sblock->sctx, spage); | |
1500 | } | |
1501 | ||
1502 | static int scrub_add_page_to_wr_bio(struct scrub_ctx *sctx, | |
1503 | struct scrub_page *spage) | |
1504 | { | |
1505 | struct scrub_wr_ctx *wr_ctx = &sctx->wr_ctx; | |
1506 | struct scrub_bio *sbio; | |
1507 | int ret; | |
1508 | ||
1509 | mutex_lock(&wr_ctx->wr_lock); | |
1510 | again: | |
1511 | if (!wr_ctx->wr_curr_bio) { | |
1512 | wr_ctx->wr_curr_bio = kzalloc(sizeof(*wr_ctx->wr_curr_bio), | |
1513 | GFP_NOFS); | |
1514 | if (!wr_ctx->wr_curr_bio) { | |
1515 | mutex_unlock(&wr_ctx->wr_lock); | |
1516 | return -ENOMEM; | |
1517 | } | |
1518 | wr_ctx->wr_curr_bio->sctx = sctx; | |
1519 | wr_ctx->wr_curr_bio->page_count = 0; | |
1520 | } | |
1521 | sbio = wr_ctx->wr_curr_bio; | |
1522 | if (sbio->page_count == 0) { | |
1523 | struct bio *bio; | |
1524 | ||
1525 | sbio->physical = spage->physical_for_dev_replace; | |
1526 | sbio->logical = spage->logical; | |
1527 | sbio->dev = wr_ctx->tgtdev; | |
1528 | bio = sbio->bio; | |
1529 | if (!bio) { | |
9be3395b | 1530 | bio = btrfs_io_bio_alloc(GFP_NOFS, wr_ctx->pages_per_wr_bio); |
ff023aac SB |
1531 | if (!bio) { |
1532 | mutex_unlock(&wr_ctx->wr_lock); | |
1533 | return -ENOMEM; | |
1534 | } | |
1535 | sbio->bio = bio; | |
1536 | } | |
1537 | ||
1538 | bio->bi_private = sbio; | |
1539 | bio->bi_end_io = scrub_wr_bio_end_io; | |
1540 | bio->bi_bdev = sbio->dev->bdev; | |
1541 | bio->bi_sector = sbio->physical >> 9; | |
1542 | sbio->err = 0; | |
1543 | } else if (sbio->physical + sbio->page_count * PAGE_SIZE != | |
1544 | spage->physical_for_dev_replace || | |
1545 | sbio->logical + sbio->page_count * PAGE_SIZE != | |
1546 | spage->logical) { | |
1547 | scrub_wr_submit(sctx); | |
1548 | goto again; | |
1549 | } | |
1550 | ||
1551 | ret = bio_add_page(sbio->bio, spage->page, PAGE_SIZE, 0); | |
1552 | if (ret != PAGE_SIZE) { | |
1553 | if (sbio->page_count < 1) { | |
1554 | bio_put(sbio->bio); | |
1555 | sbio->bio = NULL; | |
1556 | mutex_unlock(&wr_ctx->wr_lock); | |
1557 | return -EIO; | |
1558 | } | |
1559 | scrub_wr_submit(sctx); | |
1560 | goto again; | |
1561 | } | |
1562 | ||
1563 | sbio->pagev[sbio->page_count] = spage; | |
1564 | scrub_page_get(spage); | |
1565 | sbio->page_count++; | |
1566 | if (sbio->page_count == wr_ctx->pages_per_wr_bio) | |
1567 | scrub_wr_submit(sctx); | |
1568 | mutex_unlock(&wr_ctx->wr_lock); | |
1569 | ||
1570 | return 0; | |
1571 | } | |
1572 | ||
1573 | static void scrub_wr_submit(struct scrub_ctx *sctx) | |
1574 | { | |
1575 | struct scrub_wr_ctx *wr_ctx = &sctx->wr_ctx; | |
1576 | struct scrub_bio *sbio; | |
1577 | ||
1578 | if (!wr_ctx->wr_curr_bio) | |
1579 | return; | |
1580 | ||
1581 | sbio = wr_ctx->wr_curr_bio; | |
1582 | wr_ctx->wr_curr_bio = NULL; | |
1583 | WARN_ON(!sbio->bio->bi_bdev); | |
1584 | scrub_pending_bio_inc(sctx); | |
1585 | /* process all writes in a single worker thread. Then the block layer | |
1586 | * orders the requests before sending them to the driver which | |
1587 | * doubled the write performance on spinning disks when measured | |
1588 | * with Linux 3.5 */ | |
1589 | btrfsic_submit_bio(WRITE, sbio->bio); | |
1590 | } | |
1591 | ||
1592 | static void scrub_wr_bio_end_io(struct bio *bio, int err) | |
1593 | { | |
1594 | struct scrub_bio *sbio = bio->bi_private; | |
1595 | struct btrfs_fs_info *fs_info = sbio->dev->dev_root->fs_info; | |
1596 | ||
1597 | sbio->err = err; | |
1598 | sbio->bio = bio; | |
1599 | ||
1600 | sbio->work.func = scrub_wr_bio_end_io_worker; | |
1601 | btrfs_queue_worker(&fs_info->scrub_wr_completion_workers, &sbio->work); | |
1602 | } | |
1603 | ||
1604 | static void scrub_wr_bio_end_io_worker(struct btrfs_work *work) | |
1605 | { | |
1606 | struct scrub_bio *sbio = container_of(work, struct scrub_bio, work); | |
1607 | struct scrub_ctx *sctx = sbio->sctx; | |
1608 | int i; | |
1609 | ||
1610 | WARN_ON(sbio->page_count > SCRUB_PAGES_PER_WR_BIO); | |
1611 | if (sbio->err) { | |
1612 | struct btrfs_dev_replace *dev_replace = | |
1613 | &sbio->sctx->dev_root->fs_info->dev_replace; | |
1614 | ||
1615 | for (i = 0; i < sbio->page_count; i++) { | |
1616 | struct scrub_page *spage = sbio->pagev[i]; | |
1617 | ||
1618 | spage->io_error = 1; | |
1619 | btrfs_dev_replace_stats_inc(&dev_replace-> | |
1620 | num_write_errors); | |
1621 | } | |
1622 | } | |
1623 | ||
1624 | for (i = 0; i < sbio->page_count; i++) | |
1625 | scrub_page_put(sbio->pagev[i]); | |
1626 | ||
1627 | bio_put(sbio->bio); | |
1628 | kfree(sbio); | |
1629 | scrub_pending_bio_dec(sctx); | |
1630 | } | |
1631 | ||
1632 | static int scrub_checksum(struct scrub_block *sblock) | |
b5d67f64 SB |
1633 | { |
1634 | u64 flags; | |
1635 | int ret; | |
1636 | ||
7a9e9987 SB |
1637 | WARN_ON(sblock->page_count < 1); |
1638 | flags = sblock->pagev[0]->flags; | |
b5d67f64 SB |
1639 | ret = 0; |
1640 | if (flags & BTRFS_EXTENT_FLAG_DATA) | |
1641 | ret = scrub_checksum_data(sblock); | |
1642 | else if (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK) | |
1643 | ret = scrub_checksum_tree_block(sblock); | |
1644 | else if (flags & BTRFS_EXTENT_FLAG_SUPER) | |
1645 | (void)scrub_checksum_super(sblock); | |
1646 | else | |
1647 | WARN_ON(1); | |
1648 | if (ret) | |
1649 | scrub_handle_errored_block(sblock); | |
ff023aac SB |
1650 | |
1651 | return ret; | |
a2de733c AJ |
1652 | } |
1653 | ||
b5d67f64 | 1654 | static int scrub_checksum_data(struct scrub_block *sblock) |
a2de733c | 1655 | { |
d9d181c1 | 1656 | struct scrub_ctx *sctx = sblock->sctx; |
a2de733c | 1657 | u8 csum[BTRFS_CSUM_SIZE]; |
b5d67f64 SB |
1658 | u8 *on_disk_csum; |
1659 | struct page *page; | |
1660 | void *buffer; | |
a2de733c AJ |
1661 | u32 crc = ~(u32)0; |
1662 | int fail = 0; | |
b5d67f64 SB |
1663 | u64 len; |
1664 | int index; | |
a2de733c | 1665 | |
b5d67f64 | 1666 | BUG_ON(sblock->page_count < 1); |
7a9e9987 | 1667 | if (!sblock->pagev[0]->have_csum) |
a2de733c AJ |
1668 | return 0; |
1669 | ||
7a9e9987 SB |
1670 | on_disk_csum = sblock->pagev[0]->csum; |
1671 | page = sblock->pagev[0]->page; | |
9613bebb | 1672 | buffer = kmap_atomic(page); |
b5d67f64 | 1673 | |
d9d181c1 | 1674 | len = sctx->sectorsize; |
b5d67f64 SB |
1675 | index = 0; |
1676 | for (;;) { | |
1677 | u64 l = min_t(u64, len, PAGE_SIZE); | |
1678 | ||
b0496686 | 1679 | crc = btrfs_csum_data(buffer, crc, l); |
9613bebb | 1680 | kunmap_atomic(buffer); |
b5d67f64 SB |
1681 | len -= l; |
1682 | if (len == 0) | |
1683 | break; | |
1684 | index++; | |
1685 | BUG_ON(index >= sblock->page_count); | |
7a9e9987 SB |
1686 | BUG_ON(!sblock->pagev[index]->page); |
1687 | page = sblock->pagev[index]->page; | |
9613bebb | 1688 | buffer = kmap_atomic(page); |
b5d67f64 SB |
1689 | } |
1690 | ||
a2de733c | 1691 | btrfs_csum_final(crc, csum); |
d9d181c1 | 1692 | if (memcmp(csum, on_disk_csum, sctx->csum_size)) |
a2de733c AJ |
1693 | fail = 1; |
1694 | ||
a2de733c AJ |
1695 | return fail; |
1696 | } | |
1697 | ||
b5d67f64 | 1698 | static int scrub_checksum_tree_block(struct scrub_block *sblock) |
a2de733c | 1699 | { |
d9d181c1 | 1700 | struct scrub_ctx *sctx = sblock->sctx; |
a2de733c | 1701 | struct btrfs_header *h; |
a36cf8b8 | 1702 | struct btrfs_root *root = sctx->dev_root; |
a2de733c | 1703 | struct btrfs_fs_info *fs_info = root->fs_info; |
b5d67f64 SB |
1704 | u8 calculated_csum[BTRFS_CSUM_SIZE]; |
1705 | u8 on_disk_csum[BTRFS_CSUM_SIZE]; | |
1706 | struct page *page; | |
1707 | void *mapped_buffer; | |
1708 | u64 mapped_size; | |
1709 | void *p; | |
a2de733c AJ |
1710 | u32 crc = ~(u32)0; |
1711 | int fail = 0; | |
1712 | int crc_fail = 0; | |
b5d67f64 SB |
1713 | u64 len; |
1714 | int index; | |
1715 | ||
1716 | BUG_ON(sblock->page_count < 1); | |
7a9e9987 | 1717 | page = sblock->pagev[0]->page; |
9613bebb | 1718 | mapped_buffer = kmap_atomic(page); |
b5d67f64 | 1719 | h = (struct btrfs_header *)mapped_buffer; |
d9d181c1 | 1720 | memcpy(on_disk_csum, h->csum, sctx->csum_size); |
a2de733c AJ |
1721 | |
1722 | /* | |
1723 | * we don't use the getter functions here, as we | |
1724 | * a) don't have an extent buffer and | |
1725 | * b) the page is already kmapped | |
1726 | */ | |
a2de733c | 1727 | |
3cae210f | 1728 | if (sblock->pagev[0]->logical != btrfs_stack_header_bytenr(h)) |
a2de733c AJ |
1729 | ++fail; |
1730 | ||
3cae210f | 1731 | if (sblock->pagev[0]->generation != btrfs_stack_header_generation(h)) |
a2de733c AJ |
1732 | ++fail; |
1733 | ||
1734 | if (memcmp(h->fsid, fs_info->fsid, BTRFS_UUID_SIZE)) | |
1735 | ++fail; | |
1736 | ||
1737 | if (memcmp(h->chunk_tree_uuid, fs_info->chunk_tree_uuid, | |
1738 | BTRFS_UUID_SIZE)) | |
1739 | ++fail; | |
1740 | ||
ff023aac | 1741 | WARN_ON(sctx->nodesize != sctx->leafsize); |
d9d181c1 | 1742 | len = sctx->nodesize - BTRFS_CSUM_SIZE; |
b5d67f64 SB |
1743 | mapped_size = PAGE_SIZE - BTRFS_CSUM_SIZE; |
1744 | p = ((u8 *)mapped_buffer) + BTRFS_CSUM_SIZE; | |
1745 | index = 0; | |
1746 | for (;;) { | |
1747 | u64 l = min_t(u64, len, mapped_size); | |
1748 | ||
b0496686 | 1749 | crc = btrfs_csum_data(p, crc, l); |
9613bebb | 1750 | kunmap_atomic(mapped_buffer); |
b5d67f64 SB |
1751 | len -= l; |
1752 | if (len == 0) | |
1753 | break; | |
1754 | index++; | |
1755 | BUG_ON(index >= sblock->page_count); | |
7a9e9987 SB |
1756 | BUG_ON(!sblock->pagev[index]->page); |
1757 | page = sblock->pagev[index]->page; | |
9613bebb | 1758 | mapped_buffer = kmap_atomic(page); |
b5d67f64 SB |
1759 | mapped_size = PAGE_SIZE; |
1760 | p = mapped_buffer; | |
1761 | } | |
1762 | ||
1763 | btrfs_csum_final(crc, calculated_csum); | |
d9d181c1 | 1764 | if (memcmp(calculated_csum, on_disk_csum, sctx->csum_size)) |
a2de733c AJ |
1765 | ++crc_fail; |
1766 | ||
a2de733c AJ |
1767 | return fail || crc_fail; |
1768 | } | |
1769 | ||
b5d67f64 | 1770 | static int scrub_checksum_super(struct scrub_block *sblock) |
a2de733c AJ |
1771 | { |
1772 | struct btrfs_super_block *s; | |
d9d181c1 | 1773 | struct scrub_ctx *sctx = sblock->sctx; |
a36cf8b8 | 1774 | struct btrfs_root *root = sctx->dev_root; |
a2de733c | 1775 | struct btrfs_fs_info *fs_info = root->fs_info; |
b5d67f64 SB |
1776 | u8 calculated_csum[BTRFS_CSUM_SIZE]; |
1777 | u8 on_disk_csum[BTRFS_CSUM_SIZE]; | |
1778 | struct page *page; | |
1779 | void *mapped_buffer; | |
1780 | u64 mapped_size; | |
1781 | void *p; | |
a2de733c | 1782 | u32 crc = ~(u32)0; |
442a4f63 SB |
1783 | int fail_gen = 0; |
1784 | int fail_cor = 0; | |
b5d67f64 SB |
1785 | u64 len; |
1786 | int index; | |
a2de733c | 1787 | |
b5d67f64 | 1788 | BUG_ON(sblock->page_count < 1); |
7a9e9987 | 1789 | page = sblock->pagev[0]->page; |
9613bebb | 1790 | mapped_buffer = kmap_atomic(page); |
b5d67f64 | 1791 | s = (struct btrfs_super_block *)mapped_buffer; |
d9d181c1 | 1792 | memcpy(on_disk_csum, s->csum, sctx->csum_size); |
a2de733c | 1793 | |
3cae210f | 1794 | if (sblock->pagev[0]->logical != btrfs_super_bytenr(s)) |
442a4f63 | 1795 | ++fail_cor; |
a2de733c | 1796 | |
3cae210f | 1797 | if (sblock->pagev[0]->generation != btrfs_super_generation(s)) |
442a4f63 | 1798 | ++fail_gen; |
a2de733c AJ |
1799 | |
1800 | if (memcmp(s->fsid, fs_info->fsid, BTRFS_UUID_SIZE)) | |
442a4f63 | 1801 | ++fail_cor; |
a2de733c | 1802 | |
b5d67f64 SB |
1803 | len = BTRFS_SUPER_INFO_SIZE - BTRFS_CSUM_SIZE; |
1804 | mapped_size = PAGE_SIZE - BTRFS_CSUM_SIZE; | |
1805 | p = ((u8 *)mapped_buffer) + BTRFS_CSUM_SIZE; | |
1806 | index = 0; | |
1807 | for (;;) { | |
1808 | u64 l = min_t(u64, len, mapped_size); | |
1809 | ||
b0496686 | 1810 | crc = btrfs_csum_data(p, crc, l); |
9613bebb | 1811 | kunmap_atomic(mapped_buffer); |
b5d67f64 SB |
1812 | len -= l; |
1813 | if (len == 0) | |
1814 | break; | |
1815 | index++; | |
1816 | BUG_ON(index >= sblock->page_count); | |
7a9e9987 SB |
1817 | BUG_ON(!sblock->pagev[index]->page); |
1818 | page = sblock->pagev[index]->page; | |
9613bebb | 1819 | mapped_buffer = kmap_atomic(page); |
b5d67f64 SB |
1820 | mapped_size = PAGE_SIZE; |
1821 | p = mapped_buffer; | |
1822 | } | |
1823 | ||
1824 | btrfs_csum_final(crc, calculated_csum); | |
d9d181c1 | 1825 | if (memcmp(calculated_csum, on_disk_csum, sctx->csum_size)) |
442a4f63 | 1826 | ++fail_cor; |
a2de733c | 1827 | |
442a4f63 | 1828 | if (fail_cor + fail_gen) { |
a2de733c AJ |
1829 | /* |
1830 | * if we find an error in a super block, we just report it. | |
1831 | * They will get written with the next transaction commit | |
1832 | * anyway | |
1833 | */ | |
d9d181c1 SB |
1834 | spin_lock(&sctx->stat_lock); |
1835 | ++sctx->stat.super_errors; | |
1836 | spin_unlock(&sctx->stat_lock); | |
442a4f63 | 1837 | if (fail_cor) |
7a9e9987 | 1838 | btrfs_dev_stat_inc_and_print(sblock->pagev[0]->dev, |
442a4f63 SB |
1839 | BTRFS_DEV_STAT_CORRUPTION_ERRS); |
1840 | else | |
7a9e9987 | 1841 | btrfs_dev_stat_inc_and_print(sblock->pagev[0]->dev, |
442a4f63 | 1842 | BTRFS_DEV_STAT_GENERATION_ERRS); |
a2de733c AJ |
1843 | } |
1844 | ||
442a4f63 | 1845 | return fail_cor + fail_gen; |
a2de733c AJ |
1846 | } |
1847 | ||
b5d67f64 SB |
1848 | static void scrub_block_get(struct scrub_block *sblock) |
1849 | { | |
1850 | atomic_inc(&sblock->ref_count); | |
1851 | } | |
1852 | ||
1853 | static void scrub_block_put(struct scrub_block *sblock) | |
1854 | { | |
1855 | if (atomic_dec_and_test(&sblock->ref_count)) { | |
1856 | int i; | |
1857 | ||
1858 | for (i = 0; i < sblock->page_count; i++) | |
7a9e9987 | 1859 | scrub_page_put(sblock->pagev[i]); |
b5d67f64 SB |
1860 | kfree(sblock); |
1861 | } | |
1862 | } | |
1863 | ||
7a9e9987 SB |
1864 | static void scrub_page_get(struct scrub_page *spage) |
1865 | { | |
1866 | atomic_inc(&spage->ref_count); | |
1867 | } | |
1868 | ||
1869 | static void scrub_page_put(struct scrub_page *spage) | |
1870 | { | |
1871 | if (atomic_dec_and_test(&spage->ref_count)) { | |
1872 | if (spage->page) | |
1873 | __free_page(spage->page); | |
1874 | kfree(spage); | |
1875 | } | |
1876 | } | |
1877 | ||
d9d181c1 | 1878 | static void scrub_submit(struct scrub_ctx *sctx) |
a2de733c AJ |
1879 | { |
1880 | struct scrub_bio *sbio; | |
1881 | ||
d9d181c1 | 1882 | if (sctx->curr == -1) |
1623edeb | 1883 | return; |
a2de733c | 1884 | |
d9d181c1 SB |
1885 | sbio = sctx->bios[sctx->curr]; |
1886 | sctx->curr = -1; | |
b6bfebc1 | 1887 | scrub_pending_bio_inc(sctx); |
a2de733c | 1888 | |
ff023aac SB |
1889 | if (!sbio->bio->bi_bdev) { |
1890 | /* | |
1891 | * this case should not happen. If btrfs_map_block() is | |
1892 | * wrong, it could happen for dev-replace operations on | |
1893 | * missing devices when no mirrors are available, but in | |
1894 | * this case it should already fail the mount. | |
1895 | * This case is handled correctly (but _very_ slowly). | |
1896 | */ | |
1897 | printk_ratelimited(KERN_WARNING | |
1898 | "btrfs: scrub_submit(bio bdev == NULL) is unexpected!\n"); | |
1899 | bio_endio(sbio->bio, -EIO); | |
1900 | } else { | |
1901 | btrfsic_submit_bio(READ, sbio->bio); | |
1902 | } | |
a2de733c AJ |
1903 | } |
1904 | ||
ff023aac SB |
1905 | static int scrub_add_page_to_rd_bio(struct scrub_ctx *sctx, |
1906 | struct scrub_page *spage) | |
a2de733c | 1907 | { |
b5d67f64 | 1908 | struct scrub_block *sblock = spage->sblock; |
a2de733c | 1909 | struct scrub_bio *sbio; |
69f4cb52 | 1910 | int ret; |
a2de733c AJ |
1911 | |
1912 | again: | |
1913 | /* | |
1914 | * grab a fresh bio or wait for one to become available | |
1915 | */ | |
d9d181c1 SB |
1916 | while (sctx->curr == -1) { |
1917 | spin_lock(&sctx->list_lock); | |
1918 | sctx->curr = sctx->first_free; | |
1919 | if (sctx->curr != -1) { | |
1920 | sctx->first_free = sctx->bios[sctx->curr]->next_free; | |
1921 | sctx->bios[sctx->curr]->next_free = -1; | |
1922 | sctx->bios[sctx->curr]->page_count = 0; | |
1923 | spin_unlock(&sctx->list_lock); | |
a2de733c | 1924 | } else { |
d9d181c1 SB |
1925 | spin_unlock(&sctx->list_lock); |
1926 | wait_event(sctx->list_wait, sctx->first_free != -1); | |
a2de733c AJ |
1927 | } |
1928 | } | |
d9d181c1 | 1929 | sbio = sctx->bios[sctx->curr]; |
b5d67f64 | 1930 | if (sbio->page_count == 0) { |
69f4cb52 AJ |
1931 | struct bio *bio; |
1932 | ||
b5d67f64 SB |
1933 | sbio->physical = spage->physical; |
1934 | sbio->logical = spage->logical; | |
a36cf8b8 | 1935 | sbio->dev = spage->dev; |
b5d67f64 SB |
1936 | bio = sbio->bio; |
1937 | if (!bio) { | |
9be3395b | 1938 | bio = btrfs_io_bio_alloc(GFP_NOFS, sctx->pages_per_rd_bio); |
b5d67f64 SB |
1939 | if (!bio) |
1940 | return -ENOMEM; | |
1941 | sbio->bio = bio; | |
1942 | } | |
69f4cb52 AJ |
1943 | |
1944 | bio->bi_private = sbio; | |
1945 | bio->bi_end_io = scrub_bio_end_io; | |
a36cf8b8 SB |
1946 | bio->bi_bdev = sbio->dev->bdev; |
1947 | bio->bi_sector = sbio->physical >> 9; | |
69f4cb52 | 1948 | sbio->err = 0; |
b5d67f64 SB |
1949 | } else if (sbio->physical + sbio->page_count * PAGE_SIZE != |
1950 | spage->physical || | |
1951 | sbio->logical + sbio->page_count * PAGE_SIZE != | |
a36cf8b8 SB |
1952 | spage->logical || |
1953 | sbio->dev != spage->dev) { | |
d9d181c1 | 1954 | scrub_submit(sctx); |
a2de733c AJ |
1955 | goto again; |
1956 | } | |
69f4cb52 | 1957 | |
b5d67f64 SB |
1958 | sbio->pagev[sbio->page_count] = spage; |
1959 | ret = bio_add_page(sbio->bio, spage->page, PAGE_SIZE, 0); | |
1960 | if (ret != PAGE_SIZE) { | |
1961 | if (sbio->page_count < 1) { | |
1962 | bio_put(sbio->bio); | |
1963 | sbio->bio = NULL; | |
1964 | return -EIO; | |
1965 | } | |
d9d181c1 | 1966 | scrub_submit(sctx); |
69f4cb52 AJ |
1967 | goto again; |
1968 | } | |
1969 | ||
ff023aac | 1970 | scrub_block_get(sblock); /* one for the page added to the bio */ |
b5d67f64 SB |
1971 | atomic_inc(&sblock->outstanding_pages); |
1972 | sbio->page_count++; | |
ff023aac | 1973 | if (sbio->page_count == sctx->pages_per_rd_bio) |
d9d181c1 | 1974 | scrub_submit(sctx); |
b5d67f64 SB |
1975 | |
1976 | return 0; | |
1977 | } | |
1978 | ||
d9d181c1 | 1979 | static int scrub_pages(struct scrub_ctx *sctx, u64 logical, u64 len, |
a36cf8b8 | 1980 | u64 physical, struct btrfs_device *dev, u64 flags, |
ff023aac SB |
1981 | u64 gen, int mirror_num, u8 *csum, int force, |
1982 | u64 physical_for_dev_replace) | |
b5d67f64 SB |
1983 | { |
1984 | struct scrub_block *sblock; | |
1985 | int index; | |
1986 | ||
1987 | sblock = kzalloc(sizeof(*sblock), GFP_NOFS); | |
1988 | if (!sblock) { | |
d9d181c1 SB |
1989 | spin_lock(&sctx->stat_lock); |
1990 | sctx->stat.malloc_errors++; | |
1991 | spin_unlock(&sctx->stat_lock); | |
b5d67f64 | 1992 | return -ENOMEM; |
a2de733c | 1993 | } |
b5d67f64 | 1994 | |
7a9e9987 SB |
1995 | /* one ref inside this function, plus one for each page added to |
1996 | * a bio later on */ | |
b5d67f64 | 1997 | atomic_set(&sblock->ref_count, 1); |
d9d181c1 | 1998 | sblock->sctx = sctx; |
b5d67f64 SB |
1999 | sblock->no_io_error_seen = 1; |
2000 | ||
2001 | for (index = 0; len > 0; index++) { | |
7a9e9987 | 2002 | struct scrub_page *spage; |
b5d67f64 SB |
2003 | u64 l = min_t(u64, len, PAGE_SIZE); |
2004 | ||
7a9e9987 SB |
2005 | spage = kzalloc(sizeof(*spage), GFP_NOFS); |
2006 | if (!spage) { | |
2007 | leave_nomem: | |
d9d181c1 SB |
2008 | spin_lock(&sctx->stat_lock); |
2009 | sctx->stat.malloc_errors++; | |
2010 | spin_unlock(&sctx->stat_lock); | |
7a9e9987 | 2011 | scrub_block_put(sblock); |
b5d67f64 SB |
2012 | return -ENOMEM; |
2013 | } | |
7a9e9987 SB |
2014 | BUG_ON(index >= SCRUB_MAX_PAGES_PER_BLOCK); |
2015 | scrub_page_get(spage); | |
2016 | sblock->pagev[index] = spage; | |
b5d67f64 | 2017 | spage->sblock = sblock; |
a36cf8b8 | 2018 | spage->dev = dev; |
b5d67f64 SB |
2019 | spage->flags = flags; |
2020 | spage->generation = gen; | |
2021 | spage->logical = logical; | |
2022 | spage->physical = physical; | |
ff023aac | 2023 | spage->physical_for_dev_replace = physical_for_dev_replace; |
b5d67f64 SB |
2024 | spage->mirror_num = mirror_num; |
2025 | if (csum) { | |
2026 | spage->have_csum = 1; | |
d9d181c1 | 2027 | memcpy(spage->csum, csum, sctx->csum_size); |
b5d67f64 SB |
2028 | } else { |
2029 | spage->have_csum = 0; | |
2030 | } | |
2031 | sblock->page_count++; | |
7a9e9987 SB |
2032 | spage->page = alloc_page(GFP_NOFS); |
2033 | if (!spage->page) | |
2034 | goto leave_nomem; | |
b5d67f64 SB |
2035 | len -= l; |
2036 | logical += l; | |
2037 | physical += l; | |
ff023aac | 2038 | physical_for_dev_replace += l; |
b5d67f64 SB |
2039 | } |
2040 | ||
7a9e9987 | 2041 | WARN_ON(sblock->page_count == 0); |
b5d67f64 | 2042 | for (index = 0; index < sblock->page_count; index++) { |
7a9e9987 | 2043 | struct scrub_page *spage = sblock->pagev[index]; |
1bc87793 AJ |
2044 | int ret; |
2045 | ||
ff023aac | 2046 | ret = scrub_add_page_to_rd_bio(sctx, spage); |
b5d67f64 SB |
2047 | if (ret) { |
2048 | scrub_block_put(sblock); | |
1bc87793 | 2049 | return ret; |
b5d67f64 | 2050 | } |
1bc87793 | 2051 | } |
a2de733c | 2052 | |
b5d67f64 | 2053 | if (force) |
d9d181c1 | 2054 | scrub_submit(sctx); |
a2de733c | 2055 | |
b5d67f64 SB |
2056 | /* last one frees, either here or in bio completion for last page */ |
2057 | scrub_block_put(sblock); | |
a2de733c AJ |
2058 | return 0; |
2059 | } | |
2060 | ||
b5d67f64 SB |
2061 | static void scrub_bio_end_io(struct bio *bio, int err) |
2062 | { | |
2063 | struct scrub_bio *sbio = bio->bi_private; | |
a36cf8b8 | 2064 | struct btrfs_fs_info *fs_info = sbio->dev->dev_root->fs_info; |
b5d67f64 SB |
2065 | |
2066 | sbio->err = err; | |
2067 | sbio->bio = bio; | |
2068 | ||
2069 | btrfs_queue_worker(&fs_info->scrub_workers, &sbio->work); | |
2070 | } | |
2071 | ||
2072 | static void scrub_bio_end_io_worker(struct btrfs_work *work) | |
2073 | { | |
2074 | struct scrub_bio *sbio = container_of(work, struct scrub_bio, work); | |
d9d181c1 | 2075 | struct scrub_ctx *sctx = sbio->sctx; |
b5d67f64 SB |
2076 | int i; |
2077 | ||
ff023aac | 2078 | BUG_ON(sbio->page_count > SCRUB_PAGES_PER_RD_BIO); |
b5d67f64 SB |
2079 | if (sbio->err) { |
2080 | for (i = 0; i < sbio->page_count; i++) { | |
2081 | struct scrub_page *spage = sbio->pagev[i]; | |
2082 | ||
2083 | spage->io_error = 1; | |
2084 | spage->sblock->no_io_error_seen = 0; | |
2085 | } | |
2086 | } | |
2087 | ||
2088 | /* now complete the scrub_block items that have all pages completed */ | |
2089 | for (i = 0; i < sbio->page_count; i++) { | |
2090 | struct scrub_page *spage = sbio->pagev[i]; | |
2091 | struct scrub_block *sblock = spage->sblock; | |
2092 | ||
2093 | if (atomic_dec_and_test(&sblock->outstanding_pages)) | |
2094 | scrub_block_complete(sblock); | |
2095 | scrub_block_put(sblock); | |
2096 | } | |
2097 | ||
b5d67f64 SB |
2098 | bio_put(sbio->bio); |
2099 | sbio->bio = NULL; | |
d9d181c1 SB |
2100 | spin_lock(&sctx->list_lock); |
2101 | sbio->next_free = sctx->first_free; | |
2102 | sctx->first_free = sbio->index; | |
2103 | spin_unlock(&sctx->list_lock); | |
ff023aac SB |
2104 | |
2105 | if (sctx->is_dev_replace && | |
2106 | atomic_read(&sctx->wr_ctx.flush_all_writes)) { | |
2107 | mutex_lock(&sctx->wr_ctx.wr_lock); | |
2108 | scrub_wr_submit(sctx); | |
2109 | mutex_unlock(&sctx->wr_ctx.wr_lock); | |
2110 | } | |
2111 | ||
b6bfebc1 | 2112 | scrub_pending_bio_dec(sctx); |
b5d67f64 SB |
2113 | } |
2114 | ||
2115 | static void scrub_block_complete(struct scrub_block *sblock) | |
2116 | { | |
ff023aac | 2117 | if (!sblock->no_io_error_seen) { |
b5d67f64 | 2118 | scrub_handle_errored_block(sblock); |
ff023aac SB |
2119 | } else { |
2120 | /* | |
2121 | * if has checksum error, write via repair mechanism in | |
2122 | * dev replace case, otherwise write here in dev replace | |
2123 | * case. | |
2124 | */ | |
2125 | if (!scrub_checksum(sblock) && sblock->sctx->is_dev_replace) | |
2126 | scrub_write_block_to_dev_replace(sblock); | |
2127 | } | |
b5d67f64 SB |
2128 | } |
2129 | ||
d9d181c1 | 2130 | static int scrub_find_csum(struct scrub_ctx *sctx, u64 logical, u64 len, |
a2de733c AJ |
2131 | u8 *csum) |
2132 | { | |
2133 | struct btrfs_ordered_sum *sum = NULL; | |
f51a4a18 | 2134 | unsigned long index; |
a2de733c | 2135 | unsigned long num_sectors; |
a2de733c | 2136 | |
d9d181c1 SB |
2137 | while (!list_empty(&sctx->csum_list)) { |
2138 | sum = list_first_entry(&sctx->csum_list, | |
a2de733c AJ |
2139 | struct btrfs_ordered_sum, list); |
2140 | if (sum->bytenr > logical) | |
2141 | return 0; | |
2142 | if (sum->bytenr + sum->len > logical) | |
2143 | break; | |
2144 | ||
d9d181c1 | 2145 | ++sctx->stat.csum_discards; |
a2de733c AJ |
2146 | list_del(&sum->list); |
2147 | kfree(sum); | |
2148 | sum = NULL; | |
2149 | } | |
2150 | if (!sum) | |
2151 | return 0; | |
2152 | ||
f51a4a18 | 2153 | index = ((u32)(logical - sum->bytenr)) / sctx->sectorsize; |
d9d181c1 | 2154 | num_sectors = sum->len / sctx->sectorsize; |
f51a4a18 MX |
2155 | memcpy(csum, sum->sums + index, sctx->csum_size); |
2156 | if (index == num_sectors - 1) { | |
a2de733c AJ |
2157 | list_del(&sum->list); |
2158 | kfree(sum); | |
2159 | } | |
f51a4a18 | 2160 | return 1; |
a2de733c AJ |
2161 | } |
2162 | ||
2163 | /* scrub extent tries to collect up to 64 kB for each bio */ | |
d9d181c1 | 2164 | static int scrub_extent(struct scrub_ctx *sctx, u64 logical, u64 len, |
a36cf8b8 | 2165 | u64 physical, struct btrfs_device *dev, u64 flags, |
ff023aac | 2166 | u64 gen, int mirror_num, u64 physical_for_dev_replace) |
a2de733c AJ |
2167 | { |
2168 | int ret; | |
2169 | u8 csum[BTRFS_CSUM_SIZE]; | |
b5d67f64 SB |
2170 | u32 blocksize; |
2171 | ||
2172 | if (flags & BTRFS_EXTENT_FLAG_DATA) { | |
d9d181c1 SB |
2173 | blocksize = sctx->sectorsize; |
2174 | spin_lock(&sctx->stat_lock); | |
2175 | sctx->stat.data_extents_scrubbed++; | |
2176 | sctx->stat.data_bytes_scrubbed += len; | |
2177 | spin_unlock(&sctx->stat_lock); | |
b5d67f64 | 2178 | } else if (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK) { |
ff023aac | 2179 | WARN_ON(sctx->nodesize != sctx->leafsize); |
d9d181c1 SB |
2180 | blocksize = sctx->nodesize; |
2181 | spin_lock(&sctx->stat_lock); | |
2182 | sctx->stat.tree_extents_scrubbed++; | |
2183 | sctx->stat.tree_bytes_scrubbed += len; | |
2184 | spin_unlock(&sctx->stat_lock); | |
b5d67f64 | 2185 | } else { |
d9d181c1 | 2186 | blocksize = sctx->sectorsize; |
ff023aac | 2187 | WARN_ON(1); |
b5d67f64 | 2188 | } |
a2de733c AJ |
2189 | |
2190 | while (len) { | |
b5d67f64 | 2191 | u64 l = min_t(u64, len, blocksize); |
a2de733c AJ |
2192 | int have_csum = 0; |
2193 | ||
2194 | if (flags & BTRFS_EXTENT_FLAG_DATA) { | |
2195 | /* push csums to sbio */ | |
d9d181c1 | 2196 | have_csum = scrub_find_csum(sctx, logical, l, csum); |
a2de733c | 2197 | if (have_csum == 0) |
d9d181c1 | 2198 | ++sctx->stat.no_csum; |
ff023aac SB |
2199 | if (sctx->is_dev_replace && !have_csum) { |
2200 | ret = copy_nocow_pages(sctx, logical, l, | |
2201 | mirror_num, | |
2202 | physical_for_dev_replace); | |
2203 | goto behind_scrub_pages; | |
2204 | } | |
a2de733c | 2205 | } |
a36cf8b8 | 2206 | ret = scrub_pages(sctx, logical, l, physical, dev, flags, gen, |
ff023aac SB |
2207 | mirror_num, have_csum ? csum : NULL, 0, |
2208 | physical_for_dev_replace); | |
2209 | behind_scrub_pages: | |
a2de733c AJ |
2210 | if (ret) |
2211 | return ret; | |
2212 | len -= l; | |
2213 | logical += l; | |
2214 | physical += l; | |
ff023aac | 2215 | physical_for_dev_replace += l; |
a2de733c AJ |
2216 | } |
2217 | return 0; | |
2218 | } | |
2219 | ||
d9d181c1 | 2220 | static noinline_for_stack int scrub_stripe(struct scrub_ctx *sctx, |
a36cf8b8 SB |
2221 | struct map_lookup *map, |
2222 | struct btrfs_device *scrub_dev, | |
ff023aac SB |
2223 | int num, u64 base, u64 length, |
2224 | int is_dev_replace) | |
a2de733c AJ |
2225 | { |
2226 | struct btrfs_path *path; | |
a36cf8b8 | 2227 | struct btrfs_fs_info *fs_info = sctx->dev_root->fs_info; |
a2de733c AJ |
2228 | struct btrfs_root *root = fs_info->extent_root; |
2229 | struct btrfs_root *csum_root = fs_info->csum_root; | |
2230 | struct btrfs_extent_item *extent; | |
e7786c3a | 2231 | struct blk_plug plug; |
a2de733c AJ |
2232 | u64 flags; |
2233 | int ret; | |
2234 | int slot; | |
a2de733c | 2235 | u64 nstripes; |
a2de733c AJ |
2236 | struct extent_buffer *l; |
2237 | struct btrfs_key key; | |
2238 | u64 physical; | |
2239 | u64 logical; | |
625f1c8d | 2240 | u64 logic_end; |
a2de733c | 2241 | u64 generation; |
e12fa9cd | 2242 | int mirror_num; |
7a26285e AJ |
2243 | struct reada_control *reada1; |
2244 | struct reada_control *reada2; | |
2245 | struct btrfs_key key_start; | |
2246 | struct btrfs_key key_end; | |
a2de733c AJ |
2247 | u64 increment = map->stripe_len; |
2248 | u64 offset; | |
ff023aac SB |
2249 | u64 extent_logical; |
2250 | u64 extent_physical; | |
2251 | u64 extent_len; | |
2252 | struct btrfs_device *extent_dev; | |
2253 | int extent_mirror_num; | |
625f1c8d | 2254 | int stop_loop; |
a2de733c | 2255 | |
53b381b3 DW |
2256 | if (map->type & (BTRFS_BLOCK_GROUP_RAID5 | |
2257 | BTRFS_BLOCK_GROUP_RAID6)) { | |
2258 | if (num >= nr_data_stripes(map)) { | |
2259 | return 0; | |
2260 | } | |
2261 | } | |
2262 | ||
a2de733c AJ |
2263 | nstripes = length; |
2264 | offset = 0; | |
2265 | do_div(nstripes, map->stripe_len); | |
2266 | if (map->type & BTRFS_BLOCK_GROUP_RAID0) { | |
2267 | offset = map->stripe_len * num; | |
2268 | increment = map->stripe_len * map->num_stripes; | |
193ea74b | 2269 | mirror_num = 1; |
a2de733c AJ |
2270 | } else if (map->type & BTRFS_BLOCK_GROUP_RAID10) { |
2271 | int factor = map->num_stripes / map->sub_stripes; | |
2272 | offset = map->stripe_len * (num / map->sub_stripes); | |
2273 | increment = map->stripe_len * factor; | |
193ea74b | 2274 | mirror_num = num % map->sub_stripes + 1; |
a2de733c AJ |
2275 | } else if (map->type & BTRFS_BLOCK_GROUP_RAID1) { |
2276 | increment = map->stripe_len; | |
193ea74b | 2277 | mirror_num = num % map->num_stripes + 1; |
a2de733c AJ |
2278 | } else if (map->type & BTRFS_BLOCK_GROUP_DUP) { |
2279 | increment = map->stripe_len; | |
193ea74b | 2280 | mirror_num = num % map->num_stripes + 1; |
a2de733c AJ |
2281 | } else { |
2282 | increment = map->stripe_len; | |
193ea74b | 2283 | mirror_num = 1; |
a2de733c AJ |
2284 | } |
2285 | ||
2286 | path = btrfs_alloc_path(); | |
2287 | if (!path) | |
2288 | return -ENOMEM; | |
2289 | ||
b5d67f64 SB |
2290 | /* |
2291 | * work on commit root. The related disk blocks are static as | |
2292 | * long as COW is applied. This means, it is save to rewrite | |
2293 | * them to repair disk errors without any race conditions | |
2294 | */ | |
a2de733c AJ |
2295 | path->search_commit_root = 1; |
2296 | path->skip_locking = 1; | |
2297 | ||
2298 | /* | |
7a26285e AJ |
2299 | * trigger the readahead for extent tree csum tree and wait for |
2300 | * completion. During readahead, the scrub is officially paused | |
2301 | * to not hold off transaction commits | |
a2de733c AJ |
2302 | */ |
2303 | logical = base + offset; | |
a2de733c | 2304 | |
d9d181c1 | 2305 | wait_event(sctx->list_wait, |
b6bfebc1 | 2306 | atomic_read(&sctx->bios_in_flight) == 0); |
7a26285e AJ |
2307 | atomic_inc(&fs_info->scrubs_paused); |
2308 | wake_up(&fs_info->scrub_pause_wait); | |
2309 | ||
2310 | /* FIXME it might be better to start readahead at commit root */ | |
2311 | key_start.objectid = logical; | |
2312 | key_start.type = BTRFS_EXTENT_ITEM_KEY; | |
2313 | key_start.offset = (u64)0; | |
2314 | key_end.objectid = base + offset + nstripes * increment; | |
3173a18f JB |
2315 | key_end.type = BTRFS_METADATA_ITEM_KEY; |
2316 | key_end.offset = (u64)-1; | |
7a26285e AJ |
2317 | reada1 = btrfs_reada_add(root, &key_start, &key_end); |
2318 | ||
2319 | key_start.objectid = BTRFS_EXTENT_CSUM_OBJECTID; | |
2320 | key_start.type = BTRFS_EXTENT_CSUM_KEY; | |
2321 | key_start.offset = logical; | |
2322 | key_end.objectid = BTRFS_EXTENT_CSUM_OBJECTID; | |
2323 | key_end.type = BTRFS_EXTENT_CSUM_KEY; | |
2324 | key_end.offset = base + offset + nstripes * increment; | |
2325 | reada2 = btrfs_reada_add(csum_root, &key_start, &key_end); | |
2326 | ||
2327 | if (!IS_ERR(reada1)) | |
2328 | btrfs_reada_wait(reada1); | |
2329 | if (!IS_ERR(reada2)) | |
2330 | btrfs_reada_wait(reada2); | |
2331 | ||
2332 | mutex_lock(&fs_info->scrub_lock); | |
2333 | while (atomic_read(&fs_info->scrub_pause_req)) { | |
2334 | mutex_unlock(&fs_info->scrub_lock); | |
2335 | wait_event(fs_info->scrub_pause_wait, | |
2336 | atomic_read(&fs_info->scrub_pause_req) == 0); | |
2337 | mutex_lock(&fs_info->scrub_lock); | |
a2de733c | 2338 | } |
7a26285e AJ |
2339 | atomic_dec(&fs_info->scrubs_paused); |
2340 | mutex_unlock(&fs_info->scrub_lock); | |
2341 | wake_up(&fs_info->scrub_pause_wait); | |
a2de733c AJ |
2342 | |
2343 | /* | |
2344 | * collect all data csums for the stripe to avoid seeking during | |
2345 | * the scrub. This might currently (crc32) end up to be about 1MB | |
2346 | */ | |
e7786c3a | 2347 | blk_start_plug(&plug); |
a2de733c | 2348 | |
a2de733c AJ |
2349 | /* |
2350 | * now find all extents for each stripe and scrub them | |
2351 | */ | |
7a26285e AJ |
2352 | logical = base + offset; |
2353 | physical = map->stripes[num].physical; | |
625f1c8d | 2354 | logic_end = logical + increment * nstripes; |
a2de733c | 2355 | ret = 0; |
625f1c8d | 2356 | while (logical < logic_end) { |
a2de733c AJ |
2357 | /* |
2358 | * canceled? | |
2359 | */ | |
2360 | if (atomic_read(&fs_info->scrub_cancel_req) || | |
d9d181c1 | 2361 | atomic_read(&sctx->cancel_req)) { |
a2de733c AJ |
2362 | ret = -ECANCELED; |
2363 | goto out; | |
2364 | } | |
2365 | /* | |
2366 | * check to see if we have to pause | |
2367 | */ | |
2368 | if (atomic_read(&fs_info->scrub_pause_req)) { | |
2369 | /* push queued extents */ | |
ff023aac | 2370 | atomic_set(&sctx->wr_ctx.flush_all_writes, 1); |
d9d181c1 | 2371 | scrub_submit(sctx); |
ff023aac SB |
2372 | mutex_lock(&sctx->wr_ctx.wr_lock); |
2373 | scrub_wr_submit(sctx); | |
2374 | mutex_unlock(&sctx->wr_ctx.wr_lock); | |
d9d181c1 | 2375 | wait_event(sctx->list_wait, |
b6bfebc1 | 2376 | atomic_read(&sctx->bios_in_flight) == 0); |
ff023aac | 2377 | atomic_set(&sctx->wr_ctx.flush_all_writes, 0); |
a2de733c AJ |
2378 | atomic_inc(&fs_info->scrubs_paused); |
2379 | wake_up(&fs_info->scrub_pause_wait); | |
2380 | mutex_lock(&fs_info->scrub_lock); | |
2381 | while (atomic_read(&fs_info->scrub_pause_req)) { | |
2382 | mutex_unlock(&fs_info->scrub_lock); | |
2383 | wait_event(fs_info->scrub_pause_wait, | |
2384 | atomic_read(&fs_info->scrub_pause_req) == 0); | |
2385 | mutex_lock(&fs_info->scrub_lock); | |
2386 | } | |
2387 | atomic_dec(&fs_info->scrubs_paused); | |
2388 | mutex_unlock(&fs_info->scrub_lock); | |
2389 | wake_up(&fs_info->scrub_pause_wait); | |
a2de733c AJ |
2390 | } |
2391 | ||
2392 | key.objectid = logical; | |
2393 | key.type = BTRFS_EXTENT_ITEM_KEY; | |
625f1c8d | 2394 | key.offset = (u64)-1; |
a2de733c AJ |
2395 | |
2396 | ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); | |
2397 | if (ret < 0) | |
2398 | goto out; | |
3173a18f | 2399 | |
8c51032f | 2400 | if (ret > 0) { |
a2de733c AJ |
2401 | ret = btrfs_previous_item(root, path, 0, |
2402 | BTRFS_EXTENT_ITEM_KEY); | |
2403 | if (ret < 0) | |
2404 | goto out; | |
8c51032f AJ |
2405 | if (ret > 0) { |
2406 | /* there's no smaller item, so stick with the | |
2407 | * larger one */ | |
2408 | btrfs_release_path(path); | |
2409 | ret = btrfs_search_slot(NULL, root, &key, | |
2410 | path, 0, 0); | |
2411 | if (ret < 0) | |
2412 | goto out; | |
2413 | } | |
a2de733c AJ |
2414 | } |
2415 | ||
625f1c8d | 2416 | stop_loop = 0; |
a2de733c | 2417 | while (1) { |
3173a18f JB |
2418 | u64 bytes; |
2419 | ||
a2de733c AJ |
2420 | l = path->nodes[0]; |
2421 | slot = path->slots[0]; | |
2422 | if (slot >= btrfs_header_nritems(l)) { | |
2423 | ret = btrfs_next_leaf(root, path); | |
2424 | if (ret == 0) | |
2425 | continue; | |
2426 | if (ret < 0) | |
2427 | goto out; | |
2428 | ||
625f1c8d | 2429 | stop_loop = 1; |
a2de733c AJ |
2430 | break; |
2431 | } | |
2432 | btrfs_item_key_to_cpu(l, &key, slot); | |
2433 | ||
3173a18f JB |
2434 | if (key.type == BTRFS_METADATA_ITEM_KEY) |
2435 | bytes = root->leafsize; | |
2436 | else | |
2437 | bytes = key.offset; | |
2438 | ||
2439 | if (key.objectid + bytes <= logical) | |
a2de733c AJ |
2440 | goto next; |
2441 | ||
625f1c8d LB |
2442 | if (key.type != BTRFS_EXTENT_ITEM_KEY && |
2443 | key.type != BTRFS_METADATA_ITEM_KEY) | |
2444 | goto next; | |
a2de733c | 2445 | |
625f1c8d LB |
2446 | if (key.objectid >= logical + map->stripe_len) { |
2447 | /* out of this device extent */ | |
2448 | if (key.objectid >= logic_end) | |
2449 | stop_loop = 1; | |
2450 | break; | |
2451 | } | |
a2de733c AJ |
2452 | |
2453 | extent = btrfs_item_ptr(l, slot, | |
2454 | struct btrfs_extent_item); | |
2455 | flags = btrfs_extent_flags(l, extent); | |
2456 | generation = btrfs_extent_generation(l, extent); | |
2457 | ||
2458 | if (key.objectid < logical && | |
2459 | (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK)) { | |
2460 | printk(KERN_ERR | |
2461 | "btrfs scrub: tree block %llu spanning " | |
2462 | "stripes, ignored. logical=%llu\n", | |
c1c9ff7c | 2463 | key.objectid, logical); |
a2de733c AJ |
2464 | goto next; |
2465 | } | |
2466 | ||
625f1c8d LB |
2467 | again: |
2468 | extent_logical = key.objectid; | |
2469 | extent_len = bytes; | |
2470 | ||
a2de733c AJ |
2471 | /* |
2472 | * trim extent to this stripe | |
2473 | */ | |
625f1c8d LB |
2474 | if (extent_logical < logical) { |
2475 | extent_len -= logical - extent_logical; | |
2476 | extent_logical = logical; | |
a2de733c | 2477 | } |
625f1c8d | 2478 | if (extent_logical + extent_len > |
a2de733c | 2479 | logical + map->stripe_len) { |
625f1c8d LB |
2480 | extent_len = logical + map->stripe_len - |
2481 | extent_logical; | |
a2de733c AJ |
2482 | } |
2483 | ||
625f1c8d | 2484 | extent_physical = extent_logical - logical + physical; |
ff023aac SB |
2485 | extent_dev = scrub_dev; |
2486 | extent_mirror_num = mirror_num; | |
2487 | if (is_dev_replace) | |
2488 | scrub_remap_extent(fs_info, extent_logical, | |
2489 | extent_len, &extent_physical, | |
2490 | &extent_dev, | |
2491 | &extent_mirror_num); | |
625f1c8d LB |
2492 | |
2493 | ret = btrfs_lookup_csums_range(csum_root, logical, | |
2494 | logical + map->stripe_len - 1, | |
2495 | &sctx->csum_list, 1); | |
2496 | if (ret) | |
2497 | goto out; | |
2498 | ||
ff023aac SB |
2499 | ret = scrub_extent(sctx, extent_logical, extent_len, |
2500 | extent_physical, extent_dev, flags, | |
2501 | generation, extent_mirror_num, | |
115930cb | 2502 | extent_logical - logical + physical); |
a2de733c AJ |
2503 | if (ret) |
2504 | goto out; | |
2505 | ||
d88d46c6 | 2506 | scrub_free_csums(sctx); |
625f1c8d LB |
2507 | if (extent_logical + extent_len < |
2508 | key.objectid + bytes) { | |
2509 | logical += increment; | |
2510 | physical += map->stripe_len; | |
2511 | ||
2512 | if (logical < key.objectid + bytes) { | |
2513 | cond_resched(); | |
2514 | goto again; | |
2515 | } | |
2516 | ||
2517 | if (logical >= logic_end) { | |
2518 | stop_loop = 1; | |
2519 | break; | |
2520 | } | |
2521 | } | |
a2de733c AJ |
2522 | next: |
2523 | path->slots[0]++; | |
2524 | } | |
71267333 | 2525 | btrfs_release_path(path); |
a2de733c AJ |
2526 | logical += increment; |
2527 | physical += map->stripe_len; | |
d9d181c1 | 2528 | spin_lock(&sctx->stat_lock); |
625f1c8d LB |
2529 | if (stop_loop) |
2530 | sctx->stat.last_physical = map->stripes[num].physical + | |
2531 | length; | |
2532 | else | |
2533 | sctx->stat.last_physical = physical; | |
d9d181c1 | 2534 | spin_unlock(&sctx->stat_lock); |
625f1c8d LB |
2535 | if (stop_loop) |
2536 | break; | |
a2de733c | 2537 | } |
ff023aac | 2538 | out: |
a2de733c | 2539 | /* push queued extents */ |
d9d181c1 | 2540 | scrub_submit(sctx); |
ff023aac SB |
2541 | mutex_lock(&sctx->wr_ctx.wr_lock); |
2542 | scrub_wr_submit(sctx); | |
2543 | mutex_unlock(&sctx->wr_ctx.wr_lock); | |
a2de733c | 2544 | |
e7786c3a | 2545 | blk_finish_plug(&plug); |
a2de733c AJ |
2546 | btrfs_free_path(path); |
2547 | return ret < 0 ? ret : 0; | |
2548 | } | |
2549 | ||
d9d181c1 | 2550 | static noinline_for_stack int scrub_chunk(struct scrub_ctx *sctx, |
a36cf8b8 SB |
2551 | struct btrfs_device *scrub_dev, |
2552 | u64 chunk_tree, u64 chunk_objectid, | |
2553 | u64 chunk_offset, u64 length, | |
ff023aac | 2554 | u64 dev_offset, int is_dev_replace) |
a2de733c AJ |
2555 | { |
2556 | struct btrfs_mapping_tree *map_tree = | |
a36cf8b8 | 2557 | &sctx->dev_root->fs_info->mapping_tree; |
a2de733c AJ |
2558 | struct map_lookup *map; |
2559 | struct extent_map *em; | |
2560 | int i; | |
ff023aac | 2561 | int ret = 0; |
a2de733c AJ |
2562 | |
2563 | read_lock(&map_tree->map_tree.lock); | |
2564 | em = lookup_extent_mapping(&map_tree->map_tree, chunk_offset, 1); | |
2565 | read_unlock(&map_tree->map_tree.lock); | |
2566 | ||
2567 | if (!em) | |
2568 | return -EINVAL; | |
2569 | ||
2570 | map = (struct map_lookup *)em->bdev; | |
2571 | if (em->start != chunk_offset) | |
2572 | goto out; | |
2573 | ||
2574 | if (em->len < length) | |
2575 | goto out; | |
2576 | ||
2577 | for (i = 0; i < map->num_stripes; ++i) { | |
a36cf8b8 | 2578 | if (map->stripes[i].dev->bdev == scrub_dev->bdev && |
859acaf1 | 2579 | map->stripes[i].physical == dev_offset) { |
a36cf8b8 | 2580 | ret = scrub_stripe(sctx, map, scrub_dev, i, |
ff023aac SB |
2581 | chunk_offset, length, |
2582 | is_dev_replace); | |
a2de733c AJ |
2583 | if (ret) |
2584 | goto out; | |
2585 | } | |
2586 | } | |
2587 | out: | |
2588 | free_extent_map(em); | |
2589 | ||
2590 | return ret; | |
2591 | } | |
2592 | ||
2593 | static noinline_for_stack | |
a36cf8b8 | 2594 | int scrub_enumerate_chunks(struct scrub_ctx *sctx, |
ff023aac SB |
2595 | struct btrfs_device *scrub_dev, u64 start, u64 end, |
2596 | int is_dev_replace) | |
a2de733c AJ |
2597 | { |
2598 | struct btrfs_dev_extent *dev_extent = NULL; | |
2599 | struct btrfs_path *path; | |
a36cf8b8 | 2600 | struct btrfs_root *root = sctx->dev_root; |
a2de733c AJ |
2601 | struct btrfs_fs_info *fs_info = root->fs_info; |
2602 | u64 length; | |
2603 | u64 chunk_tree; | |
2604 | u64 chunk_objectid; | |
2605 | u64 chunk_offset; | |
2606 | int ret; | |
2607 | int slot; | |
2608 | struct extent_buffer *l; | |
2609 | struct btrfs_key key; | |
2610 | struct btrfs_key found_key; | |
2611 | struct btrfs_block_group_cache *cache; | |
ff023aac | 2612 | struct btrfs_dev_replace *dev_replace = &fs_info->dev_replace; |
a2de733c AJ |
2613 | |
2614 | path = btrfs_alloc_path(); | |
2615 | if (!path) | |
2616 | return -ENOMEM; | |
2617 | ||
2618 | path->reada = 2; | |
2619 | path->search_commit_root = 1; | |
2620 | path->skip_locking = 1; | |
2621 | ||
a36cf8b8 | 2622 | key.objectid = scrub_dev->devid; |
a2de733c AJ |
2623 | key.offset = 0ull; |
2624 | key.type = BTRFS_DEV_EXTENT_KEY; | |
2625 | ||
a2de733c AJ |
2626 | while (1) { |
2627 | ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); | |
2628 | if (ret < 0) | |
8c51032f AJ |
2629 | break; |
2630 | if (ret > 0) { | |
2631 | if (path->slots[0] >= | |
2632 | btrfs_header_nritems(path->nodes[0])) { | |
2633 | ret = btrfs_next_leaf(root, path); | |
2634 | if (ret) | |
2635 | break; | |
2636 | } | |
2637 | } | |
a2de733c AJ |
2638 | |
2639 | l = path->nodes[0]; | |
2640 | slot = path->slots[0]; | |
2641 | ||
2642 | btrfs_item_key_to_cpu(l, &found_key, slot); | |
2643 | ||
a36cf8b8 | 2644 | if (found_key.objectid != scrub_dev->devid) |
a2de733c AJ |
2645 | break; |
2646 | ||
8c51032f | 2647 | if (btrfs_key_type(&found_key) != BTRFS_DEV_EXTENT_KEY) |
a2de733c AJ |
2648 | break; |
2649 | ||
2650 | if (found_key.offset >= end) | |
2651 | break; | |
2652 | ||
2653 | if (found_key.offset < key.offset) | |
2654 | break; | |
2655 | ||
2656 | dev_extent = btrfs_item_ptr(l, slot, struct btrfs_dev_extent); | |
2657 | length = btrfs_dev_extent_length(l, dev_extent); | |
2658 | ||
2659 | if (found_key.offset + length <= start) { | |
2660 | key.offset = found_key.offset + length; | |
71267333 | 2661 | btrfs_release_path(path); |
a2de733c AJ |
2662 | continue; |
2663 | } | |
2664 | ||
2665 | chunk_tree = btrfs_dev_extent_chunk_tree(l, dev_extent); | |
2666 | chunk_objectid = btrfs_dev_extent_chunk_objectid(l, dev_extent); | |
2667 | chunk_offset = btrfs_dev_extent_chunk_offset(l, dev_extent); | |
2668 | ||
2669 | /* | |
2670 | * get a reference on the corresponding block group to prevent | |
2671 | * the chunk from going away while we scrub it | |
2672 | */ | |
2673 | cache = btrfs_lookup_block_group(fs_info, chunk_offset); | |
2674 | if (!cache) { | |
2675 | ret = -ENOENT; | |
8c51032f | 2676 | break; |
a2de733c | 2677 | } |
ff023aac SB |
2678 | dev_replace->cursor_right = found_key.offset + length; |
2679 | dev_replace->cursor_left = found_key.offset; | |
2680 | dev_replace->item_needs_writeback = 1; | |
a36cf8b8 | 2681 | ret = scrub_chunk(sctx, scrub_dev, chunk_tree, chunk_objectid, |
ff023aac SB |
2682 | chunk_offset, length, found_key.offset, |
2683 | is_dev_replace); | |
2684 | ||
2685 | /* | |
2686 | * flush, submit all pending read and write bios, afterwards | |
2687 | * wait for them. | |
2688 | * Note that in the dev replace case, a read request causes | |
2689 | * write requests that are submitted in the read completion | |
2690 | * worker. Therefore in the current situation, it is required | |
2691 | * that all write requests are flushed, so that all read and | |
2692 | * write requests are really completed when bios_in_flight | |
2693 | * changes to 0. | |
2694 | */ | |
2695 | atomic_set(&sctx->wr_ctx.flush_all_writes, 1); | |
2696 | scrub_submit(sctx); | |
2697 | mutex_lock(&sctx->wr_ctx.wr_lock); | |
2698 | scrub_wr_submit(sctx); | |
2699 | mutex_unlock(&sctx->wr_ctx.wr_lock); | |
2700 | ||
2701 | wait_event(sctx->list_wait, | |
2702 | atomic_read(&sctx->bios_in_flight) == 0); | |
2703 | atomic_set(&sctx->wr_ctx.flush_all_writes, 0); | |
2704 | atomic_inc(&fs_info->scrubs_paused); | |
2705 | wake_up(&fs_info->scrub_pause_wait); | |
2706 | wait_event(sctx->list_wait, | |
2707 | atomic_read(&sctx->workers_pending) == 0); | |
2708 | ||
2709 | mutex_lock(&fs_info->scrub_lock); | |
2710 | while (atomic_read(&fs_info->scrub_pause_req)) { | |
2711 | mutex_unlock(&fs_info->scrub_lock); | |
2712 | wait_event(fs_info->scrub_pause_wait, | |
2713 | atomic_read(&fs_info->scrub_pause_req) == 0); | |
2714 | mutex_lock(&fs_info->scrub_lock); | |
2715 | } | |
2716 | atomic_dec(&fs_info->scrubs_paused); | |
2717 | mutex_unlock(&fs_info->scrub_lock); | |
2718 | wake_up(&fs_info->scrub_pause_wait); | |
2719 | ||
a2de733c AJ |
2720 | btrfs_put_block_group(cache); |
2721 | if (ret) | |
2722 | break; | |
af1be4f8 SB |
2723 | if (is_dev_replace && |
2724 | atomic64_read(&dev_replace->num_write_errors) > 0) { | |
ff023aac SB |
2725 | ret = -EIO; |
2726 | break; | |
2727 | } | |
2728 | if (sctx->stat.malloc_errors > 0) { | |
2729 | ret = -ENOMEM; | |
2730 | break; | |
2731 | } | |
a2de733c | 2732 | |
539f358a ID |
2733 | dev_replace->cursor_left = dev_replace->cursor_right; |
2734 | dev_replace->item_needs_writeback = 1; | |
2735 | ||
a2de733c | 2736 | key.offset = found_key.offset + length; |
71267333 | 2737 | btrfs_release_path(path); |
a2de733c AJ |
2738 | } |
2739 | ||
a2de733c | 2740 | btrfs_free_path(path); |
8c51032f AJ |
2741 | |
2742 | /* | |
2743 | * ret can still be 1 from search_slot or next_leaf, | |
2744 | * that's not an error | |
2745 | */ | |
2746 | return ret < 0 ? ret : 0; | |
a2de733c AJ |
2747 | } |
2748 | ||
a36cf8b8 SB |
2749 | static noinline_for_stack int scrub_supers(struct scrub_ctx *sctx, |
2750 | struct btrfs_device *scrub_dev) | |
a2de733c AJ |
2751 | { |
2752 | int i; | |
2753 | u64 bytenr; | |
2754 | u64 gen; | |
2755 | int ret; | |
a36cf8b8 | 2756 | struct btrfs_root *root = sctx->dev_root; |
a2de733c | 2757 | |
87533c47 | 2758 | if (test_bit(BTRFS_FS_STATE_ERROR, &root->fs_info->fs_state)) |
79787eaa JM |
2759 | return -EIO; |
2760 | ||
a2de733c AJ |
2761 | gen = root->fs_info->last_trans_committed; |
2762 | ||
2763 | for (i = 0; i < BTRFS_SUPER_MIRROR_MAX; i++) { | |
2764 | bytenr = btrfs_sb_offset(i); | |
a36cf8b8 | 2765 | if (bytenr + BTRFS_SUPER_INFO_SIZE > scrub_dev->total_bytes) |
a2de733c AJ |
2766 | break; |
2767 | ||
d9d181c1 | 2768 | ret = scrub_pages(sctx, bytenr, BTRFS_SUPER_INFO_SIZE, bytenr, |
a36cf8b8 | 2769 | scrub_dev, BTRFS_EXTENT_FLAG_SUPER, gen, i, |
ff023aac | 2770 | NULL, 1, bytenr); |
a2de733c AJ |
2771 | if (ret) |
2772 | return ret; | |
2773 | } | |
b6bfebc1 | 2774 | wait_event(sctx->list_wait, atomic_read(&sctx->bios_in_flight) == 0); |
a2de733c AJ |
2775 | |
2776 | return 0; | |
2777 | } | |
2778 | ||
2779 | /* | |
2780 | * get a reference count on fs_info->scrub_workers. start worker if necessary | |
2781 | */ | |
ff023aac SB |
2782 | static noinline_for_stack int scrub_workers_get(struct btrfs_fs_info *fs_info, |
2783 | int is_dev_replace) | |
a2de733c | 2784 | { |
0dc3b84a | 2785 | int ret = 0; |
a2de733c AJ |
2786 | |
2787 | mutex_lock(&fs_info->scrub_lock); | |
632dd772 | 2788 | if (fs_info->scrub_workers_refcnt == 0) { |
ff023aac SB |
2789 | if (is_dev_replace) |
2790 | btrfs_init_workers(&fs_info->scrub_workers, "scrub", 1, | |
2791 | &fs_info->generic_worker); | |
2792 | else | |
2793 | btrfs_init_workers(&fs_info->scrub_workers, "scrub", | |
2794 | fs_info->thread_pool_size, | |
2795 | &fs_info->generic_worker); | |
632dd772 | 2796 | fs_info->scrub_workers.idle_thresh = 4; |
0dc3b84a JB |
2797 | ret = btrfs_start_workers(&fs_info->scrub_workers); |
2798 | if (ret) | |
2799 | goto out; | |
ff023aac SB |
2800 | btrfs_init_workers(&fs_info->scrub_wr_completion_workers, |
2801 | "scrubwrc", | |
2802 | fs_info->thread_pool_size, | |
2803 | &fs_info->generic_worker); | |
2804 | fs_info->scrub_wr_completion_workers.idle_thresh = 2; | |
2805 | ret = btrfs_start_workers( | |
2806 | &fs_info->scrub_wr_completion_workers); | |
2807 | if (ret) | |
2808 | goto out; | |
2809 | btrfs_init_workers(&fs_info->scrub_nocow_workers, "scrubnc", 1, | |
2810 | &fs_info->generic_worker); | |
2811 | ret = btrfs_start_workers(&fs_info->scrub_nocow_workers); | |
2812 | if (ret) | |
2813 | goto out; | |
632dd772 | 2814 | } |
a2de733c | 2815 | ++fs_info->scrub_workers_refcnt; |
0dc3b84a | 2816 | out: |
a2de733c AJ |
2817 | mutex_unlock(&fs_info->scrub_lock); |
2818 | ||
0dc3b84a | 2819 | return ret; |
a2de733c AJ |
2820 | } |
2821 | ||
aa1b8cd4 | 2822 | static noinline_for_stack void scrub_workers_put(struct btrfs_fs_info *fs_info) |
a2de733c | 2823 | { |
a2de733c | 2824 | mutex_lock(&fs_info->scrub_lock); |
ff023aac | 2825 | if (--fs_info->scrub_workers_refcnt == 0) { |
a2de733c | 2826 | btrfs_stop_workers(&fs_info->scrub_workers); |
ff023aac SB |
2827 | btrfs_stop_workers(&fs_info->scrub_wr_completion_workers); |
2828 | btrfs_stop_workers(&fs_info->scrub_nocow_workers); | |
2829 | } | |
a2de733c AJ |
2830 | WARN_ON(fs_info->scrub_workers_refcnt < 0); |
2831 | mutex_unlock(&fs_info->scrub_lock); | |
2832 | } | |
2833 | ||
aa1b8cd4 SB |
2834 | int btrfs_scrub_dev(struct btrfs_fs_info *fs_info, u64 devid, u64 start, |
2835 | u64 end, struct btrfs_scrub_progress *progress, | |
63a212ab | 2836 | int readonly, int is_dev_replace) |
a2de733c | 2837 | { |
d9d181c1 | 2838 | struct scrub_ctx *sctx; |
a2de733c AJ |
2839 | int ret; |
2840 | struct btrfs_device *dev; | |
2841 | ||
aa1b8cd4 | 2842 | if (btrfs_fs_closing(fs_info)) |
a2de733c AJ |
2843 | return -EINVAL; |
2844 | ||
2845 | /* | |
2846 | * check some assumptions | |
2847 | */ | |
aa1b8cd4 | 2848 | if (fs_info->chunk_root->nodesize != fs_info->chunk_root->leafsize) { |
b5d67f64 SB |
2849 | printk(KERN_ERR |
2850 | "btrfs_scrub: size assumption nodesize == leafsize (%d == %d) fails\n", | |
aa1b8cd4 SB |
2851 | fs_info->chunk_root->nodesize, |
2852 | fs_info->chunk_root->leafsize); | |
b5d67f64 SB |
2853 | return -EINVAL; |
2854 | } | |
2855 | ||
aa1b8cd4 | 2856 | if (fs_info->chunk_root->nodesize > BTRFS_STRIPE_LEN) { |
b5d67f64 SB |
2857 | /* |
2858 | * in this case scrub is unable to calculate the checksum | |
2859 | * the way scrub is implemented. Do not handle this | |
2860 | * situation at all because it won't ever happen. | |
2861 | */ | |
2862 | printk(KERN_ERR | |
2863 | "btrfs_scrub: size assumption nodesize <= BTRFS_STRIPE_LEN (%d <= %d) fails\n", | |
aa1b8cd4 | 2864 | fs_info->chunk_root->nodesize, BTRFS_STRIPE_LEN); |
b5d67f64 SB |
2865 | return -EINVAL; |
2866 | } | |
2867 | ||
aa1b8cd4 | 2868 | if (fs_info->chunk_root->sectorsize != PAGE_SIZE) { |
b5d67f64 SB |
2869 | /* not supported for data w/o checksums */ |
2870 | printk(KERN_ERR | |
27f9f023 GU |
2871 | "btrfs_scrub: size assumption sectorsize != PAGE_SIZE (%d != %lu) fails\n", |
2872 | fs_info->chunk_root->sectorsize, PAGE_SIZE); | |
a2de733c AJ |
2873 | return -EINVAL; |
2874 | } | |
2875 | ||
7a9e9987 SB |
2876 | if (fs_info->chunk_root->nodesize > |
2877 | PAGE_SIZE * SCRUB_MAX_PAGES_PER_BLOCK || | |
2878 | fs_info->chunk_root->sectorsize > | |
2879 | PAGE_SIZE * SCRUB_MAX_PAGES_PER_BLOCK) { | |
2880 | /* | |
2881 | * would exhaust the array bounds of pagev member in | |
2882 | * struct scrub_block | |
2883 | */ | |
2884 | pr_err("btrfs_scrub: size assumption nodesize and sectorsize <= SCRUB_MAX_PAGES_PER_BLOCK (%d <= %d && %d <= %d) fails\n", | |
2885 | fs_info->chunk_root->nodesize, | |
2886 | SCRUB_MAX_PAGES_PER_BLOCK, | |
2887 | fs_info->chunk_root->sectorsize, | |
2888 | SCRUB_MAX_PAGES_PER_BLOCK); | |
2889 | return -EINVAL; | |
2890 | } | |
2891 | ||
ff023aac | 2892 | ret = scrub_workers_get(fs_info, is_dev_replace); |
a2de733c AJ |
2893 | if (ret) |
2894 | return ret; | |
2895 | ||
aa1b8cd4 SB |
2896 | mutex_lock(&fs_info->fs_devices->device_list_mutex); |
2897 | dev = btrfs_find_device(fs_info, devid, NULL, NULL); | |
63a212ab | 2898 | if (!dev || (dev->missing && !is_dev_replace)) { |
aa1b8cd4 SB |
2899 | mutex_unlock(&fs_info->fs_devices->device_list_mutex); |
2900 | scrub_workers_put(fs_info); | |
a2de733c AJ |
2901 | return -ENODEV; |
2902 | } | |
2903 | mutex_lock(&fs_info->scrub_lock); | |
2904 | ||
63a212ab | 2905 | if (!dev->in_fs_metadata || dev->is_tgtdev_for_dev_replace) { |
a2de733c | 2906 | mutex_unlock(&fs_info->scrub_lock); |
aa1b8cd4 SB |
2907 | mutex_unlock(&fs_info->fs_devices->device_list_mutex); |
2908 | scrub_workers_put(fs_info); | |
2909 | return -EIO; | |
a2de733c AJ |
2910 | } |
2911 | ||
8dabb742 SB |
2912 | btrfs_dev_replace_lock(&fs_info->dev_replace); |
2913 | if (dev->scrub_device || | |
2914 | (!is_dev_replace && | |
2915 | btrfs_dev_replace_is_ongoing(&fs_info->dev_replace))) { | |
2916 | btrfs_dev_replace_unlock(&fs_info->dev_replace); | |
a2de733c | 2917 | mutex_unlock(&fs_info->scrub_lock); |
aa1b8cd4 SB |
2918 | mutex_unlock(&fs_info->fs_devices->device_list_mutex); |
2919 | scrub_workers_put(fs_info); | |
a2de733c AJ |
2920 | return -EINPROGRESS; |
2921 | } | |
8dabb742 | 2922 | btrfs_dev_replace_unlock(&fs_info->dev_replace); |
63a212ab | 2923 | sctx = scrub_setup_ctx(dev, is_dev_replace); |
d9d181c1 | 2924 | if (IS_ERR(sctx)) { |
a2de733c | 2925 | mutex_unlock(&fs_info->scrub_lock); |
aa1b8cd4 SB |
2926 | mutex_unlock(&fs_info->fs_devices->device_list_mutex); |
2927 | scrub_workers_put(fs_info); | |
d9d181c1 | 2928 | return PTR_ERR(sctx); |
a2de733c | 2929 | } |
d9d181c1 SB |
2930 | sctx->readonly = readonly; |
2931 | dev->scrub_device = sctx; | |
a2de733c AJ |
2932 | |
2933 | atomic_inc(&fs_info->scrubs_running); | |
2934 | mutex_unlock(&fs_info->scrub_lock); | |
aa1b8cd4 | 2935 | mutex_unlock(&fs_info->fs_devices->device_list_mutex); |
a2de733c | 2936 | |
ff023aac SB |
2937 | if (!is_dev_replace) { |
2938 | down_read(&fs_info->scrub_super_lock); | |
2939 | ret = scrub_supers(sctx, dev); | |
2940 | up_read(&fs_info->scrub_super_lock); | |
2941 | } | |
a2de733c AJ |
2942 | |
2943 | if (!ret) | |
ff023aac SB |
2944 | ret = scrub_enumerate_chunks(sctx, dev, start, end, |
2945 | is_dev_replace); | |
a2de733c | 2946 | |
b6bfebc1 | 2947 | wait_event(sctx->list_wait, atomic_read(&sctx->bios_in_flight) == 0); |
a2de733c AJ |
2948 | atomic_dec(&fs_info->scrubs_running); |
2949 | wake_up(&fs_info->scrub_pause_wait); | |
2950 | ||
b6bfebc1 | 2951 | wait_event(sctx->list_wait, atomic_read(&sctx->workers_pending) == 0); |
0ef8e451 | 2952 | |
a2de733c | 2953 | if (progress) |
d9d181c1 | 2954 | memcpy(progress, &sctx->stat, sizeof(*progress)); |
a2de733c AJ |
2955 | |
2956 | mutex_lock(&fs_info->scrub_lock); | |
2957 | dev->scrub_device = NULL; | |
2958 | mutex_unlock(&fs_info->scrub_lock); | |
2959 | ||
d9d181c1 | 2960 | scrub_free_ctx(sctx); |
aa1b8cd4 | 2961 | scrub_workers_put(fs_info); |
a2de733c AJ |
2962 | |
2963 | return ret; | |
2964 | } | |
2965 | ||
143bede5 | 2966 | void btrfs_scrub_pause(struct btrfs_root *root) |
a2de733c AJ |
2967 | { |
2968 | struct btrfs_fs_info *fs_info = root->fs_info; | |
2969 | ||
2970 | mutex_lock(&fs_info->scrub_lock); | |
2971 | atomic_inc(&fs_info->scrub_pause_req); | |
2972 | while (atomic_read(&fs_info->scrubs_paused) != | |
2973 | atomic_read(&fs_info->scrubs_running)) { | |
2974 | mutex_unlock(&fs_info->scrub_lock); | |
2975 | wait_event(fs_info->scrub_pause_wait, | |
2976 | atomic_read(&fs_info->scrubs_paused) == | |
2977 | atomic_read(&fs_info->scrubs_running)); | |
2978 | mutex_lock(&fs_info->scrub_lock); | |
2979 | } | |
2980 | mutex_unlock(&fs_info->scrub_lock); | |
a2de733c AJ |
2981 | } |
2982 | ||
143bede5 | 2983 | void btrfs_scrub_continue(struct btrfs_root *root) |
a2de733c AJ |
2984 | { |
2985 | struct btrfs_fs_info *fs_info = root->fs_info; | |
2986 | ||
2987 | atomic_dec(&fs_info->scrub_pause_req); | |
2988 | wake_up(&fs_info->scrub_pause_wait); | |
a2de733c AJ |
2989 | } |
2990 | ||
143bede5 | 2991 | void btrfs_scrub_pause_super(struct btrfs_root *root) |
a2de733c AJ |
2992 | { |
2993 | down_write(&root->fs_info->scrub_super_lock); | |
a2de733c AJ |
2994 | } |
2995 | ||
143bede5 | 2996 | void btrfs_scrub_continue_super(struct btrfs_root *root) |
a2de733c AJ |
2997 | { |
2998 | up_write(&root->fs_info->scrub_super_lock); | |
a2de733c AJ |
2999 | } |
3000 | ||
aa1b8cd4 | 3001 | int btrfs_scrub_cancel(struct btrfs_fs_info *fs_info) |
a2de733c | 3002 | { |
a2de733c AJ |
3003 | mutex_lock(&fs_info->scrub_lock); |
3004 | if (!atomic_read(&fs_info->scrubs_running)) { | |
3005 | mutex_unlock(&fs_info->scrub_lock); | |
3006 | return -ENOTCONN; | |
3007 | } | |
3008 | ||
3009 | atomic_inc(&fs_info->scrub_cancel_req); | |
3010 | while (atomic_read(&fs_info->scrubs_running)) { | |
3011 | mutex_unlock(&fs_info->scrub_lock); | |
3012 | wait_event(fs_info->scrub_pause_wait, | |
3013 | atomic_read(&fs_info->scrubs_running) == 0); | |
3014 | mutex_lock(&fs_info->scrub_lock); | |
3015 | } | |
3016 | atomic_dec(&fs_info->scrub_cancel_req); | |
3017 | mutex_unlock(&fs_info->scrub_lock); | |
3018 | ||
3019 | return 0; | |
3020 | } | |
3021 | ||
aa1b8cd4 SB |
3022 | int btrfs_scrub_cancel_dev(struct btrfs_fs_info *fs_info, |
3023 | struct btrfs_device *dev) | |
49b25e05 | 3024 | { |
d9d181c1 | 3025 | struct scrub_ctx *sctx; |
a2de733c AJ |
3026 | |
3027 | mutex_lock(&fs_info->scrub_lock); | |
d9d181c1 SB |
3028 | sctx = dev->scrub_device; |
3029 | if (!sctx) { | |
a2de733c AJ |
3030 | mutex_unlock(&fs_info->scrub_lock); |
3031 | return -ENOTCONN; | |
3032 | } | |
d9d181c1 | 3033 | atomic_inc(&sctx->cancel_req); |
a2de733c AJ |
3034 | while (dev->scrub_device) { |
3035 | mutex_unlock(&fs_info->scrub_lock); | |
3036 | wait_event(fs_info->scrub_pause_wait, | |
3037 | dev->scrub_device == NULL); | |
3038 | mutex_lock(&fs_info->scrub_lock); | |
3039 | } | |
3040 | mutex_unlock(&fs_info->scrub_lock); | |
3041 | ||
3042 | return 0; | |
3043 | } | |
1623edeb | 3044 | |
a2de733c AJ |
3045 | int btrfs_scrub_progress(struct btrfs_root *root, u64 devid, |
3046 | struct btrfs_scrub_progress *progress) | |
3047 | { | |
3048 | struct btrfs_device *dev; | |
d9d181c1 | 3049 | struct scrub_ctx *sctx = NULL; |
a2de733c AJ |
3050 | |
3051 | mutex_lock(&root->fs_info->fs_devices->device_list_mutex); | |
aa1b8cd4 | 3052 | dev = btrfs_find_device(root->fs_info, devid, NULL, NULL); |
a2de733c | 3053 | if (dev) |
d9d181c1 SB |
3054 | sctx = dev->scrub_device; |
3055 | if (sctx) | |
3056 | memcpy(progress, &sctx->stat, sizeof(*progress)); | |
a2de733c AJ |
3057 | mutex_unlock(&root->fs_info->fs_devices->device_list_mutex); |
3058 | ||
d9d181c1 | 3059 | return dev ? (sctx ? 0 : -ENOTCONN) : -ENODEV; |
a2de733c | 3060 | } |
ff023aac SB |
3061 | |
3062 | static void scrub_remap_extent(struct btrfs_fs_info *fs_info, | |
3063 | u64 extent_logical, u64 extent_len, | |
3064 | u64 *extent_physical, | |
3065 | struct btrfs_device **extent_dev, | |
3066 | int *extent_mirror_num) | |
3067 | { | |
3068 | u64 mapped_length; | |
3069 | struct btrfs_bio *bbio = NULL; | |
3070 | int ret; | |
3071 | ||
3072 | mapped_length = extent_len; | |
3073 | ret = btrfs_map_block(fs_info, READ, extent_logical, | |
3074 | &mapped_length, &bbio, 0); | |
3075 | if (ret || !bbio || mapped_length < extent_len || | |
3076 | !bbio->stripes[0].dev->bdev) { | |
3077 | kfree(bbio); | |
3078 | return; | |
3079 | } | |
3080 | ||
3081 | *extent_physical = bbio->stripes[0].physical; | |
3082 | *extent_mirror_num = bbio->mirror_num; | |
3083 | *extent_dev = bbio->stripes[0].dev; | |
3084 | kfree(bbio); | |
3085 | } | |
3086 | ||
3087 | static int scrub_setup_wr_ctx(struct scrub_ctx *sctx, | |
3088 | struct scrub_wr_ctx *wr_ctx, | |
3089 | struct btrfs_fs_info *fs_info, | |
3090 | struct btrfs_device *dev, | |
3091 | int is_dev_replace) | |
3092 | { | |
3093 | WARN_ON(wr_ctx->wr_curr_bio != NULL); | |
3094 | ||
3095 | mutex_init(&wr_ctx->wr_lock); | |
3096 | wr_ctx->wr_curr_bio = NULL; | |
3097 | if (!is_dev_replace) | |
3098 | return 0; | |
3099 | ||
3100 | WARN_ON(!dev->bdev); | |
3101 | wr_ctx->pages_per_wr_bio = min_t(int, SCRUB_PAGES_PER_WR_BIO, | |
3102 | bio_get_nr_vecs(dev->bdev)); | |
3103 | wr_ctx->tgtdev = dev; | |
3104 | atomic_set(&wr_ctx->flush_all_writes, 0); | |
3105 | return 0; | |
3106 | } | |
3107 | ||
3108 | static void scrub_free_wr_ctx(struct scrub_wr_ctx *wr_ctx) | |
3109 | { | |
3110 | mutex_lock(&wr_ctx->wr_lock); | |
3111 | kfree(wr_ctx->wr_curr_bio); | |
3112 | wr_ctx->wr_curr_bio = NULL; | |
3113 | mutex_unlock(&wr_ctx->wr_lock); | |
3114 | } | |
3115 | ||
3116 | static int copy_nocow_pages(struct scrub_ctx *sctx, u64 logical, u64 len, | |
3117 | int mirror_num, u64 physical_for_dev_replace) | |
3118 | { | |
3119 | struct scrub_copy_nocow_ctx *nocow_ctx; | |
3120 | struct btrfs_fs_info *fs_info = sctx->dev_root->fs_info; | |
3121 | ||
3122 | nocow_ctx = kzalloc(sizeof(*nocow_ctx), GFP_NOFS); | |
3123 | if (!nocow_ctx) { | |
3124 | spin_lock(&sctx->stat_lock); | |
3125 | sctx->stat.malloc_errors++; | |
3126 | spin_unlock(&sctx->stat_lock); | |
3127 | return -ENOMEM; | |
3128 | } | |
3129 | ||
3130 | scrub_pending_trans_workers_inc(sctx); | |
3131 | ||
3132 | nocow_ctx->sctx = sctx; | |
3133 | nocow_ctx->logical = logical; | |
3134 | nocow_ctx->len = len; | |
3135 | nocow_ctx->mirror_num = mirror_num; | |
3136 | nocow_ctx->physical_for_dev_replace = physical_for_dev_replace; | |
3137 | nocow_ctx->work.func = copy_nocow_pages_worker; | |
652f25a2 | 3138 | INIT_LIST_HEAD(&nocow_ctx->inodes); |
ff023aac SB |
3139 | btrfs_queue_worker(&fs_info->scrub_nocow_workers, |
3140 | &nocow_ctx->work); | |
3141 | ||
3142 | return 0; | |
3143 | } | |
3144 | ||
652f25a2 JB |
3145 | static int record_inode_for_nocow(u64 inum, u64 offset, u64 root, void *ctx) |
3146 | { | |
3147 | struct scrub_copy_nocow_ctx *nocow_ctx = ctx; | |
3148 | struct scrub_nocow_inode *nocow_inode; | |
3149 | ||
3150 | nocow_inode = kzalloc(sizeof(*nocow_inode), GFP_NOFS); | |
3151 | if (!nocow_inode) | |
3152 | return -ENOMEM; | |
3153 | nocow_inode->inum = inum; | |
3154 | nocow_inode->offset = offset; | |
3155 | nocow_inode->root = root; | |
3156 | list_add_tail(&nocow_inode->list, &nocow_ctx->inodes); | |
3157 | return 0; | |
3158 | } | |
3159 | ||
3160 | #define COPY_COMPLETE 1 | |
3161 | ||
ff023aac SB |
3162 | static void copy_nocow_pages_worker(struct btrfs_work *work) |
3163 | { | |
3164 | struct scrub_copy_nocow_ctx *nocow_ctx = | |
3165 | container_of(work, struct scrub_copy_nocow_ctx, work); | |
3166 | struct scrub_ctx *sctx = nocow_ctx->sctx; | |
3167 | u64 logical = nocow_ctx->logical; | |
3168 | u64 len = nocow_ctx->len; | |
3169 | int mirror_num = nocow_ctx->mirror_num; | |
3170 | u64 physical_for_dev_replace = nocow_ctx->physical_for_dev_replace; | |
3171 | int ret; | |
3172 | struct btrfs_trans_handle *trans = NULL; | |
3173 | struct btrfs_fs_info *fs_info; | |
3174 | struct btrfs_path *path; | |
3175 | struct btrfs_root *root; | |
3176 | int not_written = 0; | |
3177 | ||
3178 | fs_info = sctx->dev_root->fs_info; | |
3179 | root = fs_info->extent_root; | |
3180 | ||
3181 | path = btrfs_alloc_path(); | |
3182 | if (!path) { | |
3183 | spin_lock(&sctx->stat_lock); | |
3184 | sctx->stat.malloc_errors++; | |
3185 | spin_unlock(&sctx->stat_lock); | |
3186 | not_written = 1; | |
3187 | goto out; | |
3188 | } | |
3189 | ||
3190 | trans = btrfs_join_transaction(root); | |
3191 | if (IS_ERR(trans)) { | |
3192 | not_written = 1; | |
3193 | goto out; | |
3194 | } | |
3195 | ||
3196 | ret = iterate_inodes_from_logical(logical, fs_info, path, | |
652f25a2 | 3197 | record_inode_for_nocow, nocow_ctx); |
ff023aac | 3198 | if (ret != 0 && ret != -ENOENT) { |
118a0a25 GU |
3199 | pr_warn("iterate_inodes_from_logical() failed: log %llu, phys %llu, len %llu, mir %u, ret %d\n", |
3200 | logical, physical_for_dev_replace, len, mirror_num, | |
3201 | ret); | |
ff023aac SB |
3202 | not_written = 1; |
3203 | goto out; | |
3204 | } | |
3205 | ||
652f25a2 JB |
3206 | btrfs_end_transaction(trans, root); |
3207 | trans = NULL; | |
3208 | while (!list_empty(&nocow_ctx->inodes)) { | |
3209 | struct scrub_nocow_inode *entry; | |
3210 | entry = list_first_entry(&nocow_ctx->inodes, | |
3211 | struct scrub_nocow_inode, | |
3212 | list); | |
3213 | list_del_init(&entry->list); | |
3214 | ret = copy_nocow_pages_for_inode(entry->inum, entry->offset, | |
3215 | entry->root, nocow_ctx); | |
3216 | kfree(entry); | |
3217 | if (ret == COPY_COMPLETE) { | |
3218 | ret = 0; | |
3219 | break; | |
3220 | } else if (ret) { | |
3221 | break; | |
3222 | } | |
3223 | } | |
ff023aac | 3224 | out: |
652f25a2 JB |
3225 | while (!list_empty(&nocow_ctx->inodes)) { |
3226 | struct scrub_nocow_inode *entry; | |
3227 | entry = list_first_entry(&nocow_ctx->inodes, | |
3228 | struct scrub_nocow_inode, | |
3229 | list); | |
3230 | list_del_init(&entry->list); | |
3231 | kfree(entry); | |
3232 | } | |
ff023aac SB |
3233 | if (trans && !IS_ERR(trans)) |
3234 | btrfs_end_transaction(trans, root); | |
3235 | if (not_written) | |
3236 | btrfs_dev_replace_stats_inc(&fs_info->dev_replace. | |
3237 | num_uncorrectable_read_errors); | |
3238 | ||
3239 | btrfs_free_path(path); | |
3240 | kfree(nocow_ctx); | |
3241 | ||
3242 | scrub_pending_trans_workers_dec(sctx); | |
3243 | } | |
3244 | ||
652f25a2 JB |
3245 | static int copy_nocow_pages_for_inode(u64 inum, u64 offset, u64 root, |
3246 | struct scrub_copy_nocow_ctx *nocow_ctx) | |
ff023aac | 3247 | { |
826aa0a8 | 3248 | struct btrfs_fs_info *fs_info = nocow_ctx->sctx->dev_root->fs_info; |
ff023aac | 3249 | struct btrfs_key key; |
826aa0a8 MX |
3250 | struct inode *inode; |
3251 | struct page *page; | |
ff023aac | 3252 | struct btrfs_root *local_root; |
652f25a2 JB |
3253 | struct btrfs_ordered_extent *ordered; |
3254 | struct extent_map *em; | |
3255 | struct extent_state *cached_state = NULL; | |
3256 | struct extent_io_tree *io_tree; | |
ff023aac | 3257 | u64 physical_for_dev_replace; |
652f25a2 JB |
3258 | u64 len = nocow_ctx->len; |
3259 | u64 lockstart = offset, lockend = offset + len - 1; | |
826aa0a8 | 3260 | unsigned long index; |
6f1c3605 | 3261 | int srcu_index; |
652f25a2 JB |
3262 | int ret = 0; |
3263 | int err = 0; | |
ff023aac SB |
3264 | |
3265 | key.objectid = root; | |
3266 | key.type = BTRFS_ROOT_ITEM_KEY; | |
3267 | key.offset = (u64)-1; | |
6f1c3605 LB |
3268 | |
3269 | srcu_index = srcu_read_lock(&fs_info->subvol_srcu); | |
3270 | ||
ff023aac | 3271 | local_root = btrfs_read_fs_root_no_name(fs_info, &key); |
6f1c3605 LB |
3272 | if (IS_ERR(local_root)) { |
3273 | srcu_read_unlock(&fs_info->subvol_srcu, srcu_index); | |
ff023aac | 3274 | return PTR_ERR(local_root); |
6f1c3605 | 3275 | } |
ff023aac SB |
3276 | |
3277 | key.type = BTRFS_INODE_ITEM_KEY; | |
3278 | key.objectid = inum; | |
3279 | key.offset = 0; | |
3280 | inode = btrfs_iget(fs_info->sb, &key, local_root, NULL); | |
6f1c3605 | 3281 | srcu_read_unlock(&fs_info->subvol_srcu, srcu_index); |
ff023aac SB |
3282 | if (IS_ERR(inode)) |
3283 | return PTR_ERR(inode); | |
3284 | ||
edd1400b MX |
3285 | /* Avoid truncate/dio/punch hole.. */ |
3286 | mutex_lock(&inode->i_mutex); | |
3287 | inode_dio_wait(inode); | |
3288 | ||
ff023aac | 3289 | physical_for_dev_replace = nocow_ctx->physical_for_dev_replace; |
652f25a2 JB |
3290 | io_tree = &BTRFS_I(inode)->io_tree; |
3291 | ||
3292 | lock_extent_bits(io_tree, lockstart, lockend, 0, &cached_state); | |
3293 | ordered = btrfs_lookup_ordered_range(inode, lockstart, len); | |
3294 | if (ordered) { | |
3295 | btrfs_put_ordered_extent(ordered); | |
3296 | goto out_unlock; | |
3297 | } | |
3298 | ||
3299 | em = btrfs_get_extent(inode, NULL, 0, lockstart, len, 0); | |
3300 | if (IS_ERR(em)) { | |
3301 | ret = PTR_ERR(em); | |
3302 | goto out_unlock; | |
3303 | } | |
3304 | ||
3305 | /* | |
3306 | * This extent does not actually cover the logical extent anymore, | |
3307 | * move on to the next inode. | |
3308 | */ | |
3309 | if (em->block_start > nocow_ctx->logical || | |
3310 | em->block_start + em->block_len < nocow_ctx->logical + len) { | |
3311 | free_extent_map(em); | |
3312 | goto out_unlock; | |
3313 | } | |
3314 | free_extent_map(em); | |
3315 | ||
ff023aac | 3316 | while (len >= PAGE_CACHE_SIZE) { |
ff023aac | 3317 | index = offset >> PAGE_CACHE_SHIFT; |
edd1400b | 3318 | again: |
ff023aac SB |
3319 | page = find_or_create_page(inode->i_mapping, index, GFP_NOFS); |
3320 | if (!page) { | |
3321 | pr_err("find_or_create_page() failed\n"); | |
3322 | ret = -ENOMEM; | |
826aa0a8 | 3323 | goto out; |
ff023aac SB |
3324 | } |
3325 | ||
3326 | if (PageUptodate(page)) { | |
3327 | if (PageDirty(page)) | |
3328 | goto next_page; | |
3329 | } else { | |
3330 | ClearPageError(page); | |
652f25a2 JB |
3331 | err = extent_read_full_page_nolock(io_tree, page, |
3332 | btrfs_get_extent, | |
3333 | nocow_ctx->mirror_num); | |
826aa0a8 MX |
3334 | if (err) { |
3335 | ret = err; | |
ff023aac SB |
3336 | goto next_page; |
3337 | } | |
edd1400b | 3338 | |
26b25891 | 3339 | lock_page(page); |
edd1400b MX |
3340 | /* |
3341 | * If the page has been remove from the page cache, | |
3342 | * the data on it is meaningless, because it may be | |
3343 | * old one, the new data may be written into the new | |
3344 | * page in the page cache. | |
3345 | */ | |
3346 | if (page->mapping != inode->i_mapping) { | |
652f25a2 | 3347 | unlock_page(page); |
edd1400b MX |
3348 | page_cache_release(page); |
3349 | goto again; | |
3350 | } | |
ff023aac SB |
3351 | if (!PageUptodate(page)) { |
3352 | ret = -EIO; | |
3353 | goto next_page; | |
3354 | } | |
3355 | } | |
826aa0a8 MX |
3356 | err = write_page_nocow(nocow_ctx->sctx, |
3357 | physical_for_dev_replace, page); | |
3358 | if (err) | |
3359 | ret = err; | |
ff023aac | 3360 | next_page: |
826aa0a8 MX |
3361 | unlock_page(page); |
3362 | page_cache_release(page); | |
3363 | ||
3364 | if (ret) | |
3365 | break; | |
3366 | ||
ff023aac SB |
3367 | offset += PAGE_CACHE_SIZE; |
3368 | physical_for_dev_replace += PAGE_CACHE_SIZE; | |
3369 | len -= PAGE_CACHE_SIZE; | |
3370 | } | |
652f25a2 JB |
3371 | ret = COPY_COMPLETE; |
3372 | out_unlock: | |
3373 | unlock_extent_cached(io_tree, lockstart, lockend, &cached_state, | |
3374 | GFP_NOFS); | |
826aa0a8 | 3375 | out: |
edd1400b | 3376 | mutex_unlock(&inode->i_mutex); |
826aa0a8 | 3377 | iput(inode); |
ff023aac SB |
3378 | return ret; |
3379 | } | |
3380 | ||
3381 | static int write_page_nocow(struct scrub_ctx *sctx, | |
3382 | u64 physical_for_dev_replace, struct page *page) | |
3383 | { | |
3384 | struct bio *bio; | |
3385 | struct btrfs_device *dev; | |
3386 | int ret; | |
3387 | DECLARE_COMPLETION_ONSTACK(compl); | |
3388 | ||
3389 | dev = sctx->wr_ctx.tgtdev; | |
3390 | if (!dev) | |
3391 | return -EIO; | |
3392 | if (!dev->bdev) { | |
3393 | printk_ratelimited(KERN_WARNING | |
3394 | "btrfs: scrub write_page_nocow(bdev == NULL) is unexpected!\n"); | |
3395 | return -EIO; | |
3396 | } | |
9be3395b | 3397 | bio = btrfs_io_bio_alloc(GFP_NOFS, 1); |
ff023aac SB |
3398 | if (!bio) { |
3399 | spin_lock(&sctx->stat_lock); | |
3400 | sctx->stat.malloc_errors++; | |
3401 | spin_unlock(&sctx->stat_lock); | |
3402 | return -ENOMEM; | |
3403 | } | |
3404 | bio->bi_private = &compl; | |
3405 | bio->bi_end_io = scrub_complete_bio_end_io; | |
3406 | bio->bi_size = 0; | |
3407 | bio->bi_sector = physical_for_dev_replace >> 9; | |
3408 | bio->bi_bdev = dev->bdev; | |
3409 | ret = bio_add_page(bio, page, PAGE_CACHE_SIZE, 0); | |
3410 | if (ret != PAGE_CACHE_SIZE) { | |
3411 | leave_with_eio: | |
3412 | bio_put(bio); | |
3413 | btrfs_dev_stat_inc_and_print(dev, BTRFS_DEV_STAT_WRITE_ERRS); | |
3414 | return -EIO; | |
3415 | } | |
3416 | btrfsic_submit_bio(WRITE_SYNC, bio); | |
3417 | wait_for_completion(&compl); | |
3418 | ||
3419 | if (!test_bit(BIO_UPTODATE, &bio->bi_flags)) | |
3420 | goto leave_with_eio; | |
3421 | ||
3422 | bio_put(bio); | |
3423 | return 0; | |
3424 | } |