]>
Commit | Line | Data |
---|---|---|
c1d7c514 | 1 | // SPDX-License-Identifier: GPL-2.0 |
0b86a832 CM |
2 | /* |
3 | * Copyright (C) 2007 Oracle. All rights reserved. | |
0b86a832 | 4 | */ |
c1d7c514 | 5 | |
0b86a832 CM |
6 | #include <linux/sched.h> |
7 | #include <linux/bio.h> | |
5a0e3ad6 | 8 | #include <linux/slab.h> |
8a4b83cc | 9 | #include <linux/buffer_head.h> |
f2d8d74d | 10 | #include <linux/blkdev.h> |
442a4f63 | 11 | #include <linux/ratelimit.h> |
59641015 | 12 | #include <linux/kthread.h> |
53b381b3 | 13 | #include <linux/raid/pq.h> |
803b2f54 | 14 | #include <linux/semaphore.h> |
8da4b8c4 | 15 | #include <linux/uuid.h> |
f8e10cd3 | 16 | #include <linux/list_sort.h> |
0b86a832 CM |
17 | #include "ctree.h" |
18 | #include "extent_map.h" | |
19 | #include "disk-io.h" | |
20 | #include "transaction.h" | |
21 | #include "print-tree.h" | |
22 | #include "volumes.h" | |
53b381b3 | 23 | #include "raid56.h" |
8b712842 | 24 | #include "async-thread.h" |
21adbd5c | 25 | #include "check-integrity.h" |
606686ee | 26 | #include "rcu-string.h" |
3fed40cc | 27 | #include "math.h" |
8dabb742 | 28 | #include "dev-replace.h" |
99994cde | 29 | #include "sysfs.h" |
0b86a832 | 30 | |
af902047 ZL |
31 | const struct btrfs_raid_attr btrfs_raid_array[BTRFS_NR_RAID_TYPES] = { |
32 | [BTRFS_RAID_RAID10] = { | |
33 | .sub_stripes = 2, | |
34 | .dev_stripes = 1, | |
35 | .devs_max = 0, /* 0 == as many as possible */ | |
36 | .devs_min = 4, | |
8789f4fe | 37 | .tolerated_failures = 1, |
af902047 ZL |
38 | .devs_increment = 2, |
39 | .ncopies = 2, | |
ed23467b | 40 | .raid_name = "raid10", |
41a6e891 | 41 | .bg_flag = BTRFS_BLOCK_GROUP_RAID10, |
f9fbcaa2 | 42 | .mindev_error = BTRFS_ERROR_DEV_RAID10_MIN_NOT_MET, |
af902047 ZL |
43 | }, |
44 | [BTRFS_RAID_RAID1] = { | |
45 | .sub_stripes = 1, | |
46 | .dev_stripes = 1, | |
47 | .devs_max = 2, | |
48 | .devs_min = 2, | |
8789f4fe | 49 | .tolerated_failures = 1, |
af902047 ZL |
50 | .devs_increment = 2, |
51 | .ncopies = 2, | |
ed23467b | 52 | .raid_name = "raid1", |
41a6e891 | 53 | .bg_flag = BTRFS_BLOCK_GROUP_RAID1, |
f9fbcaa2 | 54 | .mindev_error = BTRFS_ERROR_DEV_RAID1_MIN_NOT_MET, |
af902047 ZL |
55 | }, |
56 | [BTRFS_RAID_DUP] = { | |
57 | .sub_stripes = 1, | |
58 | .dev_stripes = 2, | |
59 | .devs_max = 1, | |
60 | .devs_min = 1, | |
8789f4fe | 61 | .tolerated_failures = 0, |
af902047 ZL |
62 | .devs_increment = 1, |
63 | .ncopies = 2, | |
ed23467b | 64 | .raid_name = "dup", |
41a6e891 | 65 | .bg_flag = BTRFS_BLOCK_GROUP_DUP, |
f9fbcaa2 | 66 | .mindev_error = 0, |
af902047 ZL |
67 | }, |
68 | [BTRFS_RAID_RAID0] = { | |
69 | .sub_stripes = 1, | |
70 | .dev_stripes = 1, | |
71 | .devs_max = 0, | |
72 | .devs_min = 2, | |
8789f4fe | 73 | .tolerated_failures = 0, |
af902047 ZL |
74 | .devs_increment = 1, |
75 | .ncopies = 1, | |
ed23467b | 76 | .raid_name = "raid0", |
41a6e891 | 77 | .bg_flag = BTRFS_BLOCK_GROUP_RAID0, |
f9fbcaa2 | 78 | .mindev_error = 0, |
af902047 ZL |
79 | }, |
80 | [BTRFS_RAID_SINGLE] = { | |
81 | .sub_stripes = 1, | |
82 | .dev_stripes = 1, | |
83 | .devs_max = 1, | |
84 | .devs_min = 1, | |
8789f4fe | 85 | .tolerated_failures = 0, |
af902047 ZL |
86 | .devs_increment = 1, |
87 | .ncopies = 1, | |
ed23467b | 88 | .raid_name = "single", |
41a6e891 | 89 | .bg_flag = 0, |
f9fbcaa2 | 90 | .mindev_error = 0, |
af902047 ZL |
91 | }, |
92 | [BTRFS_RAID_RAID5] = { | |
93 | .sub_stripes = 1, | |
94 | .dev_stripes = 1, | |
95 | .devs_max = 0, | |
96 | .devs_min = 2, | |
8789f4fe | 97 | .tolerated_failures = 1, |
af902047 ZL |
98 | .devs_increment = 1, |
99 | .ncopies = 2, | |
ed23467b | 100 | .raid_name = "raid5", |
41a6e891 | 101 | .bg_flag = BTRFS_BLOCK_GROUP_RAID5, |
f9fbcaa2 | 102 | .mindev_error = BTRFS_ERROR_DEV_RAID5_MIN_NOT_MET, |
af902047 ZL |
103 | }, |
104 | [BTRFS_RAID_RAID6] = { | |
105 | .sub_stripes = 1, | |
106 | .dev_stripes = 1, | |
107 | .devs_max = 0, | |
108 | .devs_min = 3, | |
8789f4fe | 109 | .tolerated_failures = 2, |
af902047 ZL |
110 | .devs_increment = 1, |
111 | .ncopies = 3, | |
ed23467b | 112 | .raid_name = "raid6", |
41a6e891 | 113 | .bg_flag = BTRFS_BLOCK_GROUP_RAID6, |
f9fbcaa2 | 114 | .mindev_error = BTRFS_ERROR_DEV_RAID6_MIN_NOT_MET, |
af902047 ZL |
115 | }, |
116 | }; | |
117 | ||
ed23467b AJ |
118 | const char *get_raid_name(enum btrfs_raid_types type) |
119 | { | |
120 | if (type >= BTRFS_NR_RAID_TYPES) | |
121 | return NULL; | |
122 | ||
123 | return btrfs_raid_array[type].raid_name; | |
124 | } | |
125 | ||
2b82032c | 126 | static int init_first_rw_device(struct btrfs_trans_handle *trans, |
e4a4dce7 | 127 | struct btrfs_fs_info *fs_info); |
2ff7e61e | 128 | static int btrfs_relocate_sys_chunks(struct btrfs_fs_info *fs_info); |
733f4fbb | 129 | static void __btrfs_reset_dev_stats(struct btrfs_device *dev); |
48a3b636 | 130 | static void btrfs_dev_stat_print_on_error(struct btrfs_device *dev); |
733f4fbb | 131 | static void btrfs_dev_stat_print_on_load(struct btrfs_device *device); |
5ab56090 LB |
132 | static int __btrfs_map_block(struct btrfs_fs_info *fs_info, |
133 | enum btrfs_map_op op, | |
134 | u64 logical, u64 *length, | |
135 | struct btrfs_bio **bbio_ret, | |
136 | int mirror_num, int need_raid_map); | |
2b82032c | 137 | |
9c6b1c4d DS |
138 | /* |
139 | * Device locking | |
140 | * ============== | |
141 | * | |
142 | * There are several mutexes that protect manipulation of devices and low-level | |
143 | * structures like chunks but not block groups, extents or files | |
144 | * | |
145 | * uuid_mutex (global lock) | |
146 | * ------------------------ | |
147 | * protects the fs_uuids list that tracks all per-fs fs_devices, resulting from | |
148 | * the SCAN_DEV ioctl registration or from mount either implicitly (the first | |
149 | * device) or requested by the device= mount option | |
150 | * | |
151 | * the mutex can be very coarse and can cover long-running operations | |
152 | * | |
153 | * protects: updates to fs_devices counters like missing devices, rw devices, | |
154 | * seeding, structure cloning, openning/closing devices at mount/umount time | |
155 | * | |
156 | * global::fs_devs - add, remove, updates to the global list | |
157 | * | |
158 | * does not protect: manipulation of the fs_devices::devices list! | |
159 | * | |
160 | * btrfs_device::name - renames (write side), read is RCU | |
161 | * | |
162 | * fs_devices::device_list_mutex (per-fs, with RCU) | |
163 | * ------------------------------------------------ | |
164 | * protects updates to fs_devices::devices, ie. adding and deleting | |
165 | * | |
166 | * simple list traversal with read-only actions can be done with RCU protection | |
167 | * | |
168 | * may be used to exclude some operations from running concurrently without any | |
169 | * modifications to the list (see write_all_supers) | |
170 | * | |
9c6b1c4d DS |
171 | * balance_mutex |
172 | * ------------- | |
173 | * protects balance structures (status, state) and context accessed from | |
174 | * several places (internally, ioctl) | |
175 | * | |
176 | * chunk_mutex | |
177 | * ----------- | |
178 | * protects chunks, adding or removing during allocation, trim or when a new | |
179 | * device is added/removed | |
180 | * | |
181 | * cleaner_mutex | |
182 | * ------------- | |
183 | * a big lock that is held by the cleaner thread and prevents running subvolume | |
184 | * cleaning together with relocation or delayed iputs | |
185 | * | |
186 | * | |
187 | * Lock nesting | |
188 | * ============ | |
189 | * | |
190 | * uuid_mutex | |
191 | * volume_mutex | |
192 | * device_list_mutex | |
193 | * chunk_mutex | |
194 | * balance_mutex | |
89595e80 AJ |
195 | * |
196 | * | |
197 | * Exclusive operations, BTRFS_FS_EXCL_OP | |
198 | * ====================================== | |
199 | * | |
200 | * Maintains the exclusivity of the following operations that apply to the | |
201 | * whole filesystem and cannot run in parallel. | |
202 | * | |
203 | * - Balance (*) | |
204 | * - Device add | |
205 | * - Device remove | |
206 | * - Device replace (*) | |
207 | * - Resize | |
208 | * | |
209 | * The device operations (as above) can be in one of the following states: | |
210 | * | |
211 | * - Running state | |
212 | * - Paused state | |
213 | * - Completed state | |
214 | * | |
215 | * Only device operations marked with (*) can go into the Paused state for the | |
216 | * following reasons: | |
217 | * | |
218 | * - ioctl (only Balance can be Paused through ioctl) | |
219 | * - filesystem remounted as read-only | |
220 | * - filesystem unmounted and mounted as read-only | |
221 | * - system power-cycle and filesystem mounted as read-only | |
222 | * - filesystem or device errors leading to forced read-only | |
223 | * | |
224 | * BTRFS_FS_EXCL_OP flag is set and cleared using atomic operations. | |
225 | * During the course of Paused state, the BTRFS_FS_EXCL_OP remains set. | |
226 | * A device operation in Paused or Running state can be canceled or resumed | |
227 | * either by ioctl (Balance only) or when remounted as read-write. | |
228 | * BTRFS_FS_EXCL_OP flag is cleared when the device operation is canceled or | |
229 | * completed. | |
9c6b1c4d DS |
230 | */ |
231 | ||
67a2c45e | 232 | DEFINE_MUTEX(uuid_mutex); |
8a4b83cc | 233 | static LIST_HEAD(fs_uuids); |
c73eccf7 AJ |
234 | struct list_head *btrfs_get_fs_uuids(void) |
235 | { | |
236 | return &fs_uuids; | |
237 | } | |
8a4b83cc | 238 | |
2dfeca9b DS |
239 | /* |
240 | * alloc_fs_devices - allocate struct btrfs_fs_devices | |
241 | * @fsid: if not NULL, copy the uuid to fs_devices::fsid | |
242 | * | |
243 | * Return a pointer to a new struct btrfs_fs_devices on success, or ERR_PTR(). | |
244 | * The returned struct is not linked onto any lists and can be destroyed with | |
245 | * kfree() right away. | |
246 | */ | |
247 | static struct btrfs_fs_devices *alloc_fs_devices(const u8 *fsid) | |
2208a378 ID |
248 | { |
249 | struct btrfs_fs_devices *fs_devs; | |
250 | ||
78f2c9e6 | 251 | fs_devs = kzalloc(sizeof(*fs_devs), GFP_KERNEL); |
2208a378 ID |
252 | if (!fs_devs) |
253 | return ERR_PTR(-ENOMEM); | |
254 | ||
255 | mutex_init(&fs_devs->device_list_mutex); | |
256 | ||
257 | INIT_LIST_HEAD(&fs_devs->devices); | |
935e5cc9 | 258 | INIT_LIST_HEAD(&fs_devs->resized_devices); |
2208a378 | 259 | INIT_LIST_HEAD(&fs_devs->alloc_list); |
c4babc5e | 260 | INIT_LIST_HEAD(&fs_devs->fs_list); |
2208a378 ID |
261 | if (fsid) |
262 | memcpy(fs_devs->fsid, fsid, BTRFS_FSID_SIZE); | |
2208a378 ID |
263 | |
264 | return fs_devs; | |
265 | } | |
266 | ||
a425f9d4 | 267 | void btrfs_free_device(struct btrfs_device *device) |
48dae9cf DS |
268 | { |
269 | rcu_string_free(device->name); | |
270 | bio_put(device->flush_bio); | |
271 | kfree(device); | |
272 | } | |
273 | ||
e4404d6e YZ |
274 | static void free_fs_devices(struct btrfs_fs_devices *fs_devices) |
275 | { | |
276 | struct btrfs_device *device; | |
277 | WARN_ON(fs_devices->opened); | |
278 | while (!list_empty(&fs_devices->devices)) { | |
279 | device = list_entry(fs_devices->devices.next, | |
280 | struct btrfs_device, dev_list); | |
281 | list_del(&device->dev_list); | |
a425f9d4 | 282 | btrfs_free_device(device); |
e4404d6e YZ |
283 | } |
284 | kfree(fs_devices); | |
285 | } | |
286 | ||
b8b8ff59 LC |
287 | static void btrfs_kobject_uevent(struct block_device *bdev, |
288 | enum kobject_action action) | |
289 | { | |
290 | int ret; | |
291 | ||
292 | ret = kobject_uevent(&disk_to_dev(bdev->bd_disk)->kobj, action); | |
293 | if (ret) | |
efe120a0 | 294 | pr_warn("BTRFS: Sending event '%d' to kobject: '%s' (%p): failed\n", |
b8b8ff59 LC |
295 | action, |
296 | kobject_name(&disk_to_dev(bdev->bd_disk)->kobj), | |
297 | &disk_to_dev(bdev->bd_disk)->kobj); | |
298 | } | |
299 | ||
ffc5a379 | 300 | void __exit btrfs_cleanup_fs_uuids(void) |
8a4b83cc CM |
301 | { |
302 | struct btrfs_fs_devices *fs_devices; | |
8a4b83cc | 303 | |
2b82032c YZ |
304 | while (!list_empty(&fs_uuids)) { |
305 | fs_devices = list_entry(fs_uuids.next, | |
c4babc5e AJ |
306 | struct btrfs_fs_devices, fs_list); |
307 | list_del(&fs_devices->fs_list); | |
e4404d6e | 308 | free_fs_devices(fs_devices); |
8a4b83cc | 309 | } |
8a4b83cc CM |
310 | } |
311 | ||
48dae9cf DS |
312 | /* |
313 | * Returns a pointer to a new btrfs_device on success; ERR_PTR() on error. | |
314 | * Returned struct is not linked onto any lists and must be destroyed using | |
a425f9d4 | 315 | * btrfs_free_device. |
48dae9cf | 316 | */ |
12bd2fc0 ID |
317 | static struct btrfs_device *__alloc_device(void) |
318 | { | |
319 | struct btrfs_device *dev; | |
320 | ||
78f2c9e6 | 321 | dev = kzalloc(sizeof(*dev), GFP_KERNEL); |
12bd2fc0 ID |
322 | if (!dev) |
323 | return ERR_PTR(-ENOMEM); | |
324 | ||
e0ae9994 DS |
325 | /* |
326 | * Preallocate a bio that's always going to be used for flushing device | |
327 | * barriers and matches the device lifespan | |
328 | */ | |
329 | dev->flush_bio = bio_alloc_bioset(GFP_KERNEL, 0, NULL); | |
330 | if (!dev->flush_bio) { | |
331 | kfree(dev); | |
332 | return ERR_PTR(-ENOMEM); | |
333 | } | |
e0ae9994 | 334 | |
12bd2fc0 ID |
335 | INIT_LIST_HEAD(&dev->dev_list); |
336 | INIT_LIST_HEAD(&dev->dev_alloc_list); | |
935e5cc9 | 337 | INIT_LIST_HEAD(&dev->resized_list); |
12bd2fc0 ID |
338 | |
339 | spin_lock_init(&dev->io_lock); | |
340 | ||
12bd2fc0 | 341 | atomic_set(&dev->reada_in_flight, 0); |
addc3fa7 | 342 | atomic_set(&dev->dev_stats_ccnt, 0); |
546bed63 | 343 | btrfs_device_data_ordered_init(dev); |
9bcaaea7 | 344 | INIT_RADIX_TREE(&dev->reada_zones, GFP_NOFS & ~__GFP_DIRECT_RECLAIM); |
d0164adc | 345 | INIT_RADIX_TREE(&dev->reada_extents, GFP_NOFS & ~__GFP_DIRECT_RECLAIM); |
12bd2fc0 ID |
346 | |
347 | return dev; | |
348 | } | |
349 | ||
35c70103 DS |
350 | /* |
351 | * Find a device specified by @devid or @uuid in the list of @fs_devices, or | |
352 | * return NULL. | |
353 | * | |
354 | * If devid and uuid are both specified, the match must be exact, otherwise | |
355 | * only devid is used. | |
356 | */ | |
357 | static struct btrfs_device *find_device(struct btrfs_fs_devices *fs_devices, | |
358 | u64 devid, const u8 *uuid) | |
8a4b83cc CM |
359 | { |
360 | struct btrfs_device *dev; | |
8a4b83cc | 361 | |
636d2c9d | 362 | list_for_each_entry(dev, &fs_devices->devices, dev_list) { |
a443755f | 363 | if (dev->devid == devid && |
8f18cf13 | 364 | (!uuid || !memcmp(dev->uuid, uuid, BTRFS_UUID_SIZE))) { |
8a4b83cc | 365 | return dev; |
a443755f | 366 | } |
8a4b83cc CM |
367 | } |
368 | return NULL; | |
369 | } | |
370 | ||
a1b32a59 | 371 | static noinline struct btrfs_fs_devices *find_fsid(u8 *fsid) |
8a4b83cc | 372 | { |
8a4b83cc CM |
373 | struct btrfs_fs_devices *fs_devices; |
374 | ||
c4babc5e | 375 | list_for_each_entry(fs_devices, &fs_uuids, fs_list) { |
8a4b83cc CM |
376 | if (memcmp(fsid, fs_devices->fsid, BTRFS_FSID_SIZE) == 0) |
377 | return fs_devices; | |
378 | } | |
379 | return NULL; | |
380 | } | |
381 | ||
beaf8ab3 SB |
382 | static int |
383 | btrfs_get_bdev_and_sb(const char *device_path, fmode_t flags, void *holder, | |
384 | int flush, struct block_device **bdev, | |
385 | struct buffer_head **bh) | |
386 | { | |
387 | int ret; | |
388 | ||
389 | *bdev = blkdev_get_by_path(device_path, flags, holder); | |
390 | ||
391 | if (IS_ERR(*bdev)) { | |
392 | ret = PTR_ERR(*bdev); | |
beaf8ab3 SB |
393 | goto error; |
394 | } | |
395 | ||
396 | if (flush) | |
397 | filemap_write_and_wait((*bdev)->bd_inode->i_mapping); | |
9f6d2510 | 398 | ret = set_blocksize(*bdev, BTRFS_BDEV_BLOCKSIZE); |
beaf8ab3 SB |
399 | if (ret) { |
400 | blkdev_put(*bdev, flags); | |
401 | goto error; | |
402 | } | |
403 | invalidate_bdev(*bdev); | |
404 | *bh = btrfs_read_dev_super(*bdev); | |
92fc03fb AJ |
405 | if (IS_ERR(*bh)) { |
406 | ret = PTR_ERR(*bh); | |
beaf8ab3 SB |
407 | blkdev_put(*bdev, flags); |
408 | goto error; | |
409 | } | |
410 | ||
411 | return 0; | |
412 | ||
413 | error: | |
414 | *bdev = NULL; | |
415 | *bh = NULL; | |
416 | return ret; | |
417 | } | |
418 | ||
ffbd517d CM |
419 | static void requeue_list(struct btrfs_pending_bios *pending_bios, |
420 | struct bio *head, struct bio *tail) | |
421 | { | |
422 | ||
423 | struct bio *old_head; | |
424 | ||
425 | old_head = pending_bios->head; | |
426 | pending_bios->head = head; | |
427 | if (pending_bios->tail) | |
428 | tail->bi_next = old_head; | |
429 | else | |
430 | pending_bios->tail = tail; | |
431 | } | |
432 | ||
8b712842 CM |
433 | /* |
434 | * we try to collect pending bios for a device so we don't get a large | |
435 | * number of procs sending bios down to the same device. This greatly | |
436 | * improves the schedulers ability to collect and merge the bios. | |
437 | * | |
438 | * But, it also turns into a long list of bios to process and that is sure | |
439 | * to eventually make the worker thread block. The solution here is to | |
440 | * make some progress and then put this work struct back at the end of | |
441 | * the list if the block device is congested. This way, multiple devices | |
442 | * can make progress from a single worker thread. | |
443 | */ | |
143bede5 | 444 | static noinline void run_scheduled_bios(struct btrfs_device *device) |
8b712842 | 445 | { |
0b246afa | 446 | struct btrfs_fs_info *fs_info = device->fs_info; |
8b712842 CM |
447 | struct bio *pending; |
448 | struct backing_dev_info *bdi; | |
ffbd517d | 449 | struct btrfs_pending_bios *pending_bios; |
8b712842 CM |
450 | struct bio *tail; |
451 | struct bio *cur; | |
452 | int again = 0; | |
ffbd517d | 453 | unsigned long num_run; |
d644d8a1 | 454 | unsigned long batch_run = 0; |
b765ead5 | 455 | unsigned long last_waited = 0; |
d84275c9 | 456 | int force_reg = 0; |
0e588859 | 457 | int sync_pending = 0; |
211588ad CM |
458 | struct blk_plug plug; |
459 | ||
460 | /* | |
461 | * this function runs all the bios we've collected for | |
462 | * a particular device. We don't want to wander off to | |
463 | * another device without first sending all of these down. | |
464 | * So, setup a plug here and finish it off before we return | |
465 | */ | |
466 | blk_start_plug(&plug); | |
8b712842 | 467 | |
efa7c9f9 | 468 | bdi = device->bdev->bd_bdi; |
b64a2851 | 469 | |
8b712842 CM |
470 | loop: |
471 | spin_lock(&device->io_lock); | |
472 | ||
a6837051 | 473 | loop_lock: |
d84275c9 | 474 | num_run = 0; |
ffbd517d | 475 | |
8b712842 CM |
476 | /* take all the bios off the list at once and process them |
477 | * later on (without the lock held). But, remember the | |
478 | * tail and other pointers so the bios can be properly reinserted | |
479 | * into the list if we hit congestion | |
480 | */ | |
d84275c9 | 481 | if (!force_reg && device->pending_sync_bios.head) { |
ffbd517d | 482 | pending_bios = &device->pending_sync_bios; |
d84275c9 CM |
483 | force_reg = 1; |
484 | } else { | |
ffbd517d | 485 | pending_bios = &device->pending_bios; |
d84275c9 CM |
486 | force_reg = 0; |
487 | } | |
ffbd517d CM |
488 | |
489 | pending = pending_bios->head; | |
490 | tail = pending_bios->tail; | |
8b712842 | 491 | WARN_ON(pending && !tail); |
8b712842 CM |
492 | |
493 | /* | |
494 | * if pending was null this time around, no bios need processing | |
495 | * at all and we can stop. Otherwise it'll loop back up again | |
496 | * and do an additional check so no bios are missed. | |
497 | * | |
498 | * device->running_pending is used to synchronize with the | |
499 | * schedule_bio code. | |
500 | */ | |
ffbd517d CM |
501 | if (device->pending_sync_bios.head == NULL && |
502 | device->pending_bios.head == NULL) { | |
8b712842 CM |
503 | again = 0; |
504 | device->running_pending = 0; | |
ffbd517d CM |
505 | } else { |
506 | again = 1; | |
507 | device->running_pending = 1; | |
8b712842 | 508 | } |
ffbd517d CM |
509 | |
510 | pending_bios->head = NULL; | |
511 | pending_bios->tail = NULL; | |
512 | ||
8b712842 CM |
513 | spin_unlock(&device->io_lock); |
514 | ||
d397712b | 515 | while (pending) { |
ffbd517d CM |
516 | |
517 | rmb(); | |
d84275c9 CM |
518 | /* we want to work on both lists, but do more bios on the |
519 | * sync list than the regular list | |
520 | */ | |
521 | if ((num_run > 32 && | |
522 | pending_bios != &device->pending_sync_bios && | |
523 | device->pending_sync_bios.head) || | |
524 | (num_run > 64 && pending_bios == &device->pending_sync_bios && | |
525 | device->pending_bios.head)) { | |
ffbd517d CM |
526 | spin_lock(&device->io_lock); |
527 | requeue_list(pending_bios, pending, tail); | |
528 | goto loop_lock; | |
529 | } | |
530 | ||
8b712842 CM |
531 | cur = pending; |
532 | pending = pending->bi_next; | |
533 | cur->bi_next = NULL; | |
b64a2851 | 534 | |
dac56212 | 535 | BUG_ON(atomic_read(&cur->__bi_cnt) == 0); |
d644d8a1 | 536 | |
2ab1ba68 CM |
537 | /* |
538 | * if we're doing the sync list, record that our | |
539 | * plug has some sync requests on it | |
540 | * | |
541 | * If we're doing the regular list and there are | |
542 | * sync requests sitting around, unplug before | |
543 | * we add more | |
544 | */ | |
545 | if (pending_bios == &device->pending_sync_bios) { | |
546 | sync_pending = 1; | |
547 | } else if (sync_pending) { | |
548 | blk_finish_plug(&plug); | |
549 | blk_start_plug(&plug); | |
550 | sync_pending = 0; | |
551 | } | |
552 | ||
4e49ea4a | 553 | btrfsic_submit_bio(cur); |
5ff7ba3a CM |
554 | num_run++; |
555 | batch_run++; | |
853d8ec4 DS |
556 | |
557 | cond_resched(); | |
8b712842 CM |
558 | |
559 | /* | |
560 | * we made progress, there is more work to do and the bdi | |
561 | * is now congested. Back off and let other work structs | |
562 | * run instead | |
563 | */ | |
57fd5a5f | 564 | if (pending && bdi_write_congested(bdi) && batch_run > 8 && |
5f2cc086 | 565 | fs_info->fs_devices->open_devices > 1) { |
b765ead5 | 566 | struct io_context *ioc; |
8b712842 | 567 | |
b765ead5 CM |
568 | ioc = current->io_context; |
569 | ||
570 | /* | |
571 | * the main goal here is that we don't want to | |
572 | * block if we're going to be able to submit | |
573 | * more requests without blocking. | |
574 | * | |
575 | * This code does two great things, it pokes into | |
576 | * the elevator code from a filesystem _and_ | |
577 | * it makes assumptions about how batching works. | |
578 | */ | |
579 | if (ioc && ioc->nr_batch_requests > 0 && | |
580 | time_before(jiffies, ioc->last_waited + HZ/50UL) && | |
581 | (last_waited == 0 || | |
582 | ioc->last_waited == last_waited)) { | |
583 | /* | |
584 | * we want to go through our batch of | |
585 | * requests and stop. So, we copy out | |
586 | * the ioc->last_waited time and test | |
587 | * against it before looping | |
588 | */ | |
589 | last_waited = ioc->last_waited; | |
853d8ec4 | 590 | cond_resched(); |
b765ead5 CM |
591 | continue; |
592 | } | |
8b712842 | 593 | spin_lock(&device->io_lock); |
ffbd517d | 594 | requeue_list(pending_bios, pending, tail); |
a6837051 | 595 | device->running_pending = 1; |
8b712842 CM |
596 | |
597 | spin_unlock(&device->io_lock); | |
a8c93d4e QW |
598 | btrfs_queue_work(fs_info->submit_workers, |
599 | &device->work); | |
8b712842 CM |
600 | goto done; |
601 | } | |
602 | } | |
ffbd517d | 603 | |
51684082 CM |
604 | cond_resched(); |
605 | if (again) | |
606 | goto loop; | |
607 | ||
608 | spin_lock(&device->io_lock); | |
609 | if (device->pending_bios.head || device->pending_sync_bios.head) | |
610 | goto loop_lock; | |
611 | spin_unlock(&device->io_lock); | |
612 | ||
8b712842 | 613 | done: |
211588ad | 614 | blk_finish_plug(&plug); |
8b712842 CM |
615 | } |
616 | ||
b2950863 | 617 | static void pending_bios_fn(struct btrfs_work *work) |
8b712842 CM |
618 | { |
619 | struct btrfs_device *device; | |
620 | ||
621 | device = container_of(work, struct btrfs_device, work); | |
622 | run_scheduled_bios(device); | |
623 | } | |
624 | ||
d8367db3 AJ |
625 | /* |
626 | * Search and remove all stale (devices which are not mounted) devices. | |
627 | * When both inputs are NULL, it will search and release all stale devices. | |
628 | * path: Optional. When provided will it release all unmounted devices | |
629 | * matching this path only. | |
630 | * skip_dev: Optional. Will skip this device when searching for the stale | |
631 | * devices. | |
632 | */ | |
633 | static void btrfs_free_stale_devices(const char *path, | |
fa6d2ae5 | 634 | struct btrfs_device *skip_device) |
4fde46f0 | 635 | { |
fa6d2ae5 AJ |
636 | struct btrfs_fs_devices *fs_devices, *tmp_fs_devices; |
637 | struct btrfs_device *device, *tmp_device; | |
4fde46f0 | 638 | |
fa6d2ae5 | 639 | list_for_each_entry_safe(fs_devices, tmp_fs_devices, &fs_uuids, fs_list) { |
7bcb8164 AJ |
640 | mutex_lock(&fs_devices->device_list_mutex); |
641 | if (fs_devices->opened) { | |
642 | mutex_unlock(&fs_devices->device_list_mutex); | |
4fde46f0 | 643 | continue; |
7bcb8164 | 644 | } |
4fde46f0 | 645 | |
fa6d2ae5 AJ |
646 | list_for_each_entry_safe(device, tmp_device, |
647 | &fs_devices->devices, dev_list) { | |
522f1b45 | 648 | int not_found = 0; |
4fde46f0 | 649 | |
fa6d2ae5 | 650 | if (skip_device && skip_device == device) |
d8367db3 | 651 | continue; |
fa6d2ae5 | 652 | if (path && !device->name) |
4fde46f0 AJ |
653 | continue; |
654 | ||
4fde46f0 | 655 | rcu_read_lock(); |
d8367db3 | 656 | if (path) |
fa6d2ae5 | 657 | not_found = strcmp(rcu_str_deref(device->name), |
d8367db3 | 658 | path); |
4fde46f0 | 659 | rcu_read_unlock(); |
38cf665d AJ |
660 | if (not_found) |
661 | continue; | |
4fde46f0 | 662 | |
4fde46f0 | 663 | /* delete the stale device */ |
7bcb8164 AJ |
664 | fs_devices->num_devices--; |
665 | list_del(&device->dev_list); | |
666 | btrfs_free_device(device); | |
667 | ||
668 | if (fs_devices->num_devices == 0) | |
fd649f10 | 669 | break; |
7bcb8164 AJ |
670 | } |
671 | mutex_unlock(&fs_devices->device_list_mutex); | |
672 | if (fs_devices->num_devices == 0) { | |
673 | btrfs_sysfs_remove_fsid(fs_devices); | |
674 | list_del(&fs_devices->fs_list); | |
675 | free_fs_devices(fs_devices); | |
4fde46f0 AJ |
676 | } |
677 | } | |
678 | } | |
679 | ||
0fb08bcc AJ |
680 | static int btrfs_open_one_device(struct btrfs_fs_devices *fs_devices, |
681 | struct btrfs_device *device, fmode_t flags, | |
682 | void *holder) | |
683 | { | |
684 | struct request_queue *q; | |
685 | struct block_device *bdev; | |
686 | struct buffer_head *bh; | |
687 | struct btrfs_super_block *disk_super; | |
688 | u64 devid; | |
689 | int ret; | |
690 | ||
691 | if (device->bdev) | |
692 | return -EINVAL; | |
693 | if (!device->name) | |
694 | return -EINVAL; | |
695 | ||
696 | ret = btrfs_get_bdev_and_sb(device->name->str, flags, holder, 1, | |
697 | &bdev, &bh); | |
698 | if (ret) | |
699 | return ret; | |
700 | ||
701 | disk_super = (struct btrfs_super_block *)bh->b_data; | |
702 | devid = btrfs_stack_device_id(&disk_super->dev_item); | |
703 | if (devid != device->devid) | |
704 | goto error_brelse; | |
705 | ||
706 | if (memcmp(device->uuid, disk_super->dev_item.uuid, BTRFS_UUID_SIZE)) | |
707 | goto error_brelse; | |
708 | ||
709 | device->generation = btrfs_super_generation(disk_super); | |
710 | ||
711 | if (btrfs_super_flags(disk_super) & BTRFS_SUPER_FLAG_SEEDING) { | |
ebbede42 | 712 | clear_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state); |
0fb08bcc AJ |
713 | fs_devices->seeding = 1; |
714 | } else { | |
ebbede42 AJ |
715 | if (bdev_read_only(bdev)) |
716 | clear_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state); | |
717 | else | |
718 | set_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state); | |
0fb08bcc AJ |
719 | } |
720 | ||
721 | q = bdev_get_queue(bdev); | |
0fb08bcc AJ |
722 | if (!blk_queue_nonrot(q)) |
723 | fs_devices->rotating = 1; | |
724 | ||
725 | device->bdev = bdev; | |
e12c9621 | 726 | clear_bit(BTRFS_DEV_STATE_IN_FS_METADATA, &device->dev_state); |
0fb08bcc AJ |
727 | device->mode = flags; |
728 | ||
729 | fs_devices->open_devices++; | |
ebbede42 AJ |
730 | if (test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state) && |
731 | device->devid != BTRFS_DEV_REPLACE_DEVID) { | |
0fb08bcc | 732 | fs_devices->rw_devices++; |
b1b8e386 | 733 | list_add_tail(&device->dev_alloc_list, &fs_devices->alloc_list); |
0fb08bcc AJ |
734 | } |
735 | brelse(bh); | |
736 | ||
737 | return 0; | |
738 | ||
739 | error_brelse: | |
740 | brelse(bh); | |
741 | blkdev_put(bdev, flags); | |
742 | ||
743 | return -EINVAL; | |
744 | } | |
745 | ||
60999ca4 DS |
746 | /* |
747 | * Add new device to list of registered devices | |
748 | * | |
749 | * Returns: | |
e124ece5 AJ |
750 | * device pointer which was just added or updated when successful |
751 | * error pointer when failed | |
60999ca4 | 752 | */ |
e124ece5 | 753 | static noinline struct btrfs_device *device_list_add(const char *path, |
4306a974 AJ |
754 | struct btrfs_super_block *disk_super, |
755 | bool *new_device_added) | |
8a4b83cc CM |
756 | { |
757 | struct btrfs_device *device; | |
758 | struct btrfs_fs_devices *fs_devices; | |
606686ee | 759 | struct rcu_string *name; |
8a4b83cc | 760 | u64 found_transid = btrfs_super_generation(disk_super); |
3acbcbfc | 761 | u64 devid = btrfs_stack_device_id(&disk_super->dev_item); |
8a4b83cc CM |
762 | |
763 | fs_devices = find_fsid(disk_super->fsid); | |
764 | if (!fs_devices) { | |
2208a378 ID |
765 | fs_devices = alloc_fs_devices(disk_super->fsid); |
766 | if (IS_ERR(fs_devices)) | |
e124ece5 | 767 | return ERR_CAST(fs_devices); |
2208a378 | 768 | |
9c6d173e | 769 | mutex_lock(&fs_devices->device_list_mutex); |
c4babc5e | 770 | list_add(&fs_devices->fs_list, &fs_uuids); |
2208a378 | 771 | |
8a4b83cc CM |
772 | device = NULL; |
773 | } else { | |
9c6d173e | 774 | mutex_lock(&fs_devices->device_list_mutex); |
35c70103 DS |
775 | device = find_device(fs_devices, devid, |
776 | disk_super->dev_item.uuid); | |
8a4b83cc | 777 | } |
443f24fe | 778 | |
8a4b83cc | 779 | if (!device) { |
9c6d173e AJ |
780 | if (fs_devices->opened) { |
781 | mutex_unlock(&fs_devices->device_list_mutex); | |
e124ece5 | 782 | return ERR_PTR(-EBUSY); |
9c6d173e | 783 | } |
2b82032c | 784 | |
12bd2fc0 ID |
785 | device = btrfs_alloc_device(NULL, &devid, |
786 | disk_super->dev_item.uuid); | |
787 | if (IS_ERR(device)) { | |
9c6d173e | 788 | mutex_unlock(&fs_devices->device_list_mutex); |
8a4b83cc | 789 | /* we can safely leave the fs_devices entry around */ |
e124ece5 | 790 | return device; |
8a4b83cc | 791 | } |
606686ee JB |
792 | |
793 | name = rcu_string_strdup(path, GFP_NOFS); | |
794 | if (!name) { | |
a425f9d4 | 795 | btrfs_free_device(device); |
9c6d173e | 796 | mutex_unlock(&fs_devices->device_list_mutex); |
e124ece5 | 797 | return ERR_PTR(-ENOMEM); |
8a4b83cc | 798 | } |
606686ee | 799 | rcu_assign_pointer(device->name, name); |
90519d66 | 800 | |
1f78160c | 801 | list_add_rcu(&device->dev_list, &fs_devices->devices); |
f7171750 | 802 | fs_devices->num_devices++; |
e5e9a520 | 803 | |
2b82032c | 804 | device->fs_devices = fs_devices; |
4306a974 | 805 | *new_device_added = true; |
327f18cc AJ |
806 | |
807 | if (disk_super->label[0]) | |
808 | pr_info("BTRFS: device label %s devid %llu transid %llu %s\n", | |
809 | disk_super->label, devid, found_transid, path); | |
810 | else | |
811 | pr_info("BTRFS: device fsid %pU devid %llu transid %llu %s\n", | |
812 | disk_super->fsid, devid, found_transid, path); | |
813 | ||
606686ee | 814 | } else if (!device->name || strcmp(device->name->str, path)) { |
b96de000 AJ |
815 | /* |
816 | * When FS is already mounted. | |
817 | * 1. If you are here and if the device->name is NULL that | |
818 | * means this device was missing at time of FS mount. | |
819 | * 2. If you are here and if the device->name is different | |
820 | * from 'path' that means either | |
821 | * a. The same device disappeared and reappeared with | |
822 | * different name. or | |
823 | * b. The missing-disk-which-was-replaced, has | |
824 | * reappeared now. | |
825 | * | |
826 | * We must allow 1 and 2a above. But 2b would be a spurious | |
827 | * and unintentional. | |
828 | * | |
829 | * Further in case of 1 and 2a above, the disk at 'path' | |
830 | * would have missed some transaction when it was away and | |
831 | * in case of 2a the stale bdev has to be updated as well. | |
832 | * 2b must not be allowed at all time. | |
833 | */ | |
834 | ||
835 | /* | |
0f23ae74 CM |
836 | * For now, we do allow update to btrfs_fs_device through the |
837 | * btrfs dev scan cli after FS has been mounted. We're still | |
838 | * tracking a problem where systems fail mount by subvolume id | |
839 | * when we reject replacement on a mounted FS. | |
b96de000 | 840 | */ |
0f23ae74 | 841 | if (!fs_devices->opened && found_transid < device->generation) { |
77bdae4d AJ |
842 | /* |
843 | * That is if the FS is _not_ mounted and if you | |
844 | * are here, that means there is more than one | |
845 | * disk with same uuid and devid.We keep the one | |
846 | * with larger generation number or the last-in if | |
847 | * generation are equal. | |
848 | */ | |
9c6d173e | 849 | mutex_unlock(&fs_devices->device_list_mutex); |
e124ece5 | 850 | return ERR_PTR(-EEXIST); |
77bdae4d | 851 | } |
b96de000 | 852 | |
606686ee | 853 | name = rcu_string_strdup(path, GFP_NOFS); |
9c6d173e AJ |
854 | if (!name) { |
855 | mutex_unlock(&fs_devices->device_list_mutex); | |
e124ece5 | 856 | return ERR_PTR(-ENOMEM); |
9c6d173e | 857 | } |
606686ee JB |
858 | rcu_string_free(device->name); |
859 | rcu_assign_pointer(device->name, name); | |
e6e674bd | 860 | if (test_bit(BTRFS_DEV_STATE_MISSING, &device->dev_state)) { |
cd02dca5 | 861 | fs_devices->missing_devices--; |
e6e674bd | 862 | clear_bit(BTRFS_DEV_STATE_MISSING, &device->dev_state); |
cd02dca5 | 863 | } |
8a4b83cc CM |
864 | } |
865 | ||
77bdae4d AJ |
866 | /* |
867 | * Unmount does not free the btrfs_device struct but would zero | |
868 | * generation along with most of the other members. So just update | |
869 | * it back. We need it to pick the disk with largest generation | |
870 | * (as above). | |
871 | */ | |
872 | if (!fs_devices->opened) | |
873 | device->generation = found_transid; | |
874 | ||
f2788d2f AJ |
875 | fs_devices->total_devices = btrfs_super_num_devices(disk_super); |
876 | ||
9c6d173e | 877 | mutex_unlock(&fs_devices->device_list_mutex); |
e124ece5 | 878 | return device; |
8a4b83cc CM |
879 | } |
880 | ||
e4404d6e YZ |
881 | static struct btrfs_fs_devices *clone_fs_devices(struct btrfs_fs_devices *orig) |
882 | { | |
883 | struct btrfs_fs_devices *fs_devices; | |
884 | struct btrfs_device *device; | |
885 | struct btrfs_device *orig_dev; | |
886 | ||
2208a378 ID |
887 | fs_devices = alloc_fs_devices(orig->fsid); |
888 | if (IS_ERR(fs_devices)) | |
889 | return fs_devices; | |
e4404d6e | 890 | |
adbbb863 | 891 | mutex_lock(&orig->device_list_mutex); |
02db0844 | 892 | fs_devices->total_devices = orig->total_devices; |
e4404d6e | 893 | |
46224705 | 894 | /* We have held the volume lock, it is safe to get the devices. */ |
e4404d6e | 895 | list_for_each_entry(orig_dev, &orig->devices, dev_list) { |
606686ee JB |
896 | struct rcu_string *name; |
897 | ||
12bd2fc0 ID |
898 | device = btrfs_alloc_device(NULL, &orig_dev->devid, |
899 | orig_dev->uuid); | |
900 | if (IS_ERR(device)) | |
e4404d6e YZ |
901 | goto error; |
902 | ||
606686ee JB |
903 | /* |
904 | * This is ok to do without rcu read locked because we hold the | |
905 | * uuid mutex so nothing we touch in here is going to disappear. | |
906 | */ | |
e755f780 | 907 | if (orig_dev->name) { |
78f2c9e6 DS |
908 | name = rcu_string_strdup(orig_dev->name->str, |
909 | GFP_KERNEL); | |
e755f780 | 910 | if (!name) { |
a425f9d4 | 911 | btrfs_free_device(device); |
e755f780 AJ |
912 | goto error; |
913 | } | |
914 | rcu_assign_pointer(device->name, name); | |
fd2696f3 | 915 | } |
e4404d6e | 916 | |
e4404d6e YZ |
917 | list_add(&device->dev_list, &fs_devices->devices); |
918 | device->fs_devices = fs_devices; | |
919 | fs_devices->num_devices++; | |
920 | } | |
adbbb863 | 921 | mutex_unlock(&orig->device_list_mutex); |
e4404d6e YZ |
922 | return fs_devices; |
923 | error: | |
adbbb863 | 924 | mutex_unlock(&orig->device_list_mutex); |
e4404d6e YZ |
925 | free_fs_devices(fs_devices); |
926 | return ERR_PTR(-ENOMEM); | |
927 | } | |
928 | ||
9b99b115 AJ |
929 | /* |
930 | * After we have read the system tree and know devids belonging to | |
931 | * this filesystem, remove the device which does not belong there. | |
932 | */ | |
933 | void btrfs_free_extra_devids(struct btrfs_fs_devices *fs_devices, int step) | |
dfe25020 | 934 | { |
c6e30871 | 935 | struct btrfs_device *device, *next; |
443f24fe | 936 | struct btrfs_device *latest_dev = NULL; |
a6b0d5c8 | 937 | |
dfe25020 CM |
938 | mutex_lock(&uuid_mutex); |
939 | again: | |
46224705 | 940 | /* This is the initialized path, it is safe to release the devices. */ |
c6e30871 | 941 | list_for_each_entry_safe(device, next, &fs_devices->devices, dev_list) { |
e12c9621 AJ |
942 | if (test_bit(BTRFS_DEV_STATE_IN_FS_METADATA, |
943 | &device->dev_state)) { | |
401e29c1 AJ |
944 | if (!test_bit(BTRFS_DEV_STATE_REPLACE_TGT, |
945 | &device->dev_state) && | |
946 | (!latest_dev || | |
947 | device->generation > latest_dev->generation)) { | |
443f24fe | 948 | latest_dev = device; |
a6b0d5c8 | 949 | } |
2b82032c | 950 | continue; |
a6b0d5c8 | 951 | } |
2b82032c | 952 | |
8dabb742 SB |
953 | if (device->devid == BTRFS_DEV_REPLACE_DEVID) { |
954 | /* | |
955 | * In the first step, keep the device which has | |
956 | * the correct fsid and the devid that is used | |
957 | * for the dev_replace procedure. | |
958 | * In the second step, the dev_replace state is | |
959 | * read from the device tree and it is known | |
960 | * whether the procedure is really active or | |
961 | * not, which means whether this device is | |
962 | * used or whether it should be removed. | |
963 | */ | |
401e29c1 AJ |
964 | if (step == 0 || test_bit(BTRFS_DEV_STATE_REPLACE_TGT, |
965 | &device->dev_state)) { | |
8dabb742 SB |
966 | continue; |
967 | } | |
968 | } | |
2b82032c | 969 | if (device->bdev) { |
d4d77629 | 970 | blkdev_put(device->bdev, device->mode); |
2b82032c YZ |
971 | device->bdev = NULL; |
972 | fs_devices->open_devices--; | |
973 | } | |
ebbede42 | 974 | if (test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state)) { |
2b82032c | 975 | list_del_init(&device->dev_alloc_list); |
ebbede42 | 976 | clear_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state); |
401e29c1 AJ |
977 | if (!test_bit(BTRFS_DEV_STATE_REPLACE_TGT, |
978 | &device->dev_state)) | |
8dabb742 | 979 | fs_devices->rw_devices--; |
2b82032c | 980 | } |
e4404d6e YZ |
981 | list_del_init(&device->dev_list); |
982 | fs_devices->num_devices--; | |
a425f9d4 | 983 | btrfs_free_device(device); |
dfe25020 | 984 | } |
2b82032c YZ |
985 | |
986 | if (fs_devices->seed) { | |
987 | fs_devices = fs_devices->seed; | |
2b82032c YZ |
988 | goto again; |
989 | } | |
990 | ||
443f24fe | 991 | fs_devices->latest_bdev = latest_dev->bdev; |
a6b0d5c8 | 992 | |
dfe25020 | 993 | mutex_unlock(&uuid_mutex); |
dfe25020 | 994 | } |
a0af469b | 995 | |
f06c5965 | 996 | static void free_device_rcu(struct rcu_head *head) |
1f78160c XG |
997 | { |
998 | struct btrfs_device *device; | |
999 | ||
9f5316c1 | 1000 | device = container_of(head, struct btrfs_device, rcu); |
a425f9d4 | 1001 | btrfs_free_device(device); |
1f78160c XG |
1002 | } |
1003 | ||
14238819 AJ |
1004 | static void btrfs_close_bdev(struct btrfs_device *device) |
1005 | { | |
08ffcae8 DS |
1006 | if (!device->bdev) |
1007 | return; | |
1008 | ||
ebbede42 | 1009 | if (test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state)) { |
14238819 AJ |
1010 | sync_blockdev(device->bdev); |
1011 | invalidate_bdev(device->bdev); | |
1012 | } | |
1013 | ||
08ffcae8 | 1014 | blkdev_put(device->bdev, device->mode); |
14238819 AJ |
1015 | } |
1016 | ||
959b1c04 | 1017 | static void btrfs_close_one_device(struct btrfs_device *device) |
f448341a AJ |
1018 | { |
1019 | struct btrfs_fs_devices *fs_devices = device->fs_devices; | |
1020 | struct btrfs_device *new_device; | |
1021 | struct rcu_string *name; | |
1022 | ||
1023 | if (device->bdev) | |
1024 | fs_devices->open_devices--; | |
1025 | ||
ebbede42 | 1026 | if (test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state) && |
f448341a AJ |
1027 | device->devid != BTRFS_DEV_REPLACE_DEVID) { |
1028 | list_del_init(&device->dev_alloc_list); | |
1029 | fs_devices->rw_devices--; | |
1030 | } | |
1031 | ||
e6e674bd | 1032 | if (test_bit(BTRFS_DEV_STATE_MISSING, &device->dev_state)) |
f448341a AJ |
1033 | fs_devices->missing_devices--; |
1034 | ||
959b1c04 NB |
1035 | btrfs_close_bdev(device); |
1036 | ||
f448341a AJ |
1037 | new_device = btrfs_alloc_device(NULL, &device->devid, |
1038 | device->uuid); | |
1039 | BUG_ON(IS_ERR(new_device)); /* -ENOMEM */ | |
1040 | ||
1041 | /* Safe because we are under uuid_mutex */ | |
1042 | if (device->name) { | |
1043 | name = rcu_string_strdup(device->name->str, GFP_NOFS); | |
1044 | BUG_ON(!name); /* -ENOMEM */ | |
1045 | rcu_assign_pointer(new_device->name, name); | |
1046 | } | |
1047 | ||
1048 | list_replace_rcu(&device->dev_list, &new_device->dev_list); | |
1049 | new_device->fs_devices = device->fs_devices; | |
959b1c04 NB |
1050 | |
1051 | call_rcu(&device->rcu, free_device_rcu); | |
f448341a AJ |
1052 | } |
1053 | ||
0226e0eb | 1054 | static int close_fs_devices(struct btrfs_fs_devices *fs_devices) |
8a4b83cc | 1055 | { |
2037a093 | 1056 | struct btrfs_device *device, *tmp; |
e4404d6e | 1057 | |
2b82032c YZ |
1058 | if (--fs_devices->opened > 0) |
1059 | return 0; | |
8a4b83cc | 1060 | |
c9513edb | 1061 | mutex_lock(&fs_devices->device_list_mutex); |
2037a093 | 1062 | list_for_each_entry_safe(device, tmp, &fs_devices->devices, dev_list) { |
959b1c04 | 1063 | btrfs_close_one_device(device); |
8a4b83cc | 1064 | } |
c9513edb XG |
1065 | mutex_unlock(&fs_devices->device_list_mutex); |
1066 | ||
e4404d6e YZ |
1067 | WARN_ON(fs_devices->open_devices); |
1068 | WARN_ON(fs_devices->rw_devices); | |
2b82032c YZ |
1069 | fs_devices->opened = 0; |
1070 | fs_devices->seeding = 0; | |
2b82032c | 1071 | |
8a4b83cc CM |
1072 | return 0; |
1073 | } | |
1074 | ||
2b82032c YZ |
1075 | int btrfs_close_devices(struct btrfs_fs_devices *fs_devices) |
1076 | { | |
e4404d6e | 1077 | struct btrfs_fs_devices *seed_devices = NULL; |
2b82032c YZ |
1078 | int ret; |
1079 | ||
1080 | mutex_lock(&uuid_mutex); | |
0226e0eb | 1081 | ret = close_fs_devices(fs_devices); |
e4404d6e YZ |
1082 | if (!fs_devices->opened) { |
1083 | seed_devices = fs_devices->seed; | |
1084 | fs_devices->seed = NULL; | |
1085 | } | |
2b82032c | 1086 | mutex_unlock(&uuid_mutex); |
e4404d6e YZ |
1087 | |
1088 | while (seed_devices) { | |
1089 | fs_devices = seed_devices; | |
1090 | seed_devices = fs_devices->seed; | |
0226e0eb | 1091 | close_fs_devices(fs_devices); |
e4404d6e YZ |
1092 | free_fs_devices(fs_devices); |
1093 | } | |
2b82032c YZ |
1094 | return ret; |
1095 | } | |
1096 | ||
897fb573 | 1097 | static int open_fs_devices(struct btrfs_fs_devices *fs_devices, |
e4404d6e | 1098 | fmode_t flags, void *holder) |
8a4b83cc | 1099 | { |
8a4b83cc | 1100 | struct btrfs_device *device; |
443f24fe | 1101 | struct btrfs_device *latest_dev = NULL; |
a0af469b | 1102 | int ret = 0; |
8a4b83cc | 1103 | |
d4d77629 TH |
1104 | flags |= FMODE_EXCL; |
1105 | ||
f117e290 | 1106 | list_for_each_entry(device, &fs_devices->devices, dev_list) { |
f63e0cca | 1107 | /* Just open everything we can; ignore failures here */ |
0fb08bcc | 1108 | if (btrfs_open_one_device(fs_devices, device, flags, holder)) |
beaf8ab3 | 1109 | continue; |
a0af469b | 1110 | |
9f050db4 AJ |
1111 | if (!latest_dev || |
1112 | device->generation > latest_dev->generation) | |
1113 | latest_dev = device; | |
8a4b83cc | 1114 | } |
a0af469b | 1115 | if (fs_devices->open_devices == 0) { |
20bcd649 | 1116 | ret = -EINVAL; |
a0af469b CM |
1117 | goto out; |
1118 | } | |
2b82032c | 1119 | fs_devices->opened = 1; |
443f24fe | 1120 | fs_devices->latest_bdev = latest_dev->bdev; |
2b82032c | 1121 | fs_devices->total_rw_bytes = 0; |
a0af469b | 1122 | out: |
2b82032c YZ |
1123 | return ret; |
1124 | } | |
1125 | ||
f8e10cd3 AJ |
1126 | static int devid_cmp(void *priv, struct list_head *a, struct list_head *b) |
1127 | { | |
1128 | struct btrfs_device *dev1, *dev2; | |
1129 | ||
1130 | dev1 = list_entry(a, struct btrfs_device, dev_list); | |
1131 | dev2 = list_entry(b, struct btrfs_device, dev_list); | |
1132 | ||
1133 | if (dev1->devid < dev2->devid) | |
1134 | return -1; | |
1135 | else if (dev1->devid > dev2->devid) | |
1136 | return 1; | |
1137 | return 0; | |
1138 | } | |
1139 | ||
2b82032c | 1140 | int btrfs_open_devices(struct btrfs_fs_devices *fs_devices, |
97288f2c | 1141 | fmode_t flags, void *holder) |
2b82032c YZ |
1142 | { |
1143 | int ret; | |
1144 | ||
f5194e34 DS |
1145 | lockdep_assert_held(&uuid_mutex); |
1146 | ||
542c5908 | 1147 | mutex_lock(&fs_devices->device_list_mutex); |
2b82032c | 1148 | if (fs_devices->opened) { |
e4404d6e YZ |
1149 | fs_devices->opened++; |
1150 | ret = 0; | |
2b82032c | 1151 | } else { |
f8e10cd3 | 1152 | list_sort(NULL, &fs_devices->devices, devid_cmp); |
897fb573 | 1153 | ret = open_fs_devices(fs_devices, flags, holder); |
2b82032c | 1154 | } |
542c5908 AJ |
1155 | mutex_unlock(&fs_devices->device_list_mutex); |
1156 | ||
8a4b83cc CM |
1157 | return ret; |
1158 | } | |
1159 | ||
c9162bdf | 1160 | static void btrfs_release_disk_super(struct page *page) |
6cf86a00 AJ |
1161 | { |
1162 | kunmap(page); | |
1163 | put_page(page); | |
1164 | } | |
1165 | ||
c9162bdf OS |
1166 | static int btrfs_read_disk_super(struct block_device *bdev, u64 bytenr, |
1167 | struct page **page, | |
1168 | struct btrfs_super_block **disk_super) | |
6cf86a00 AJ |
1169 | { |
1170 | void *p; | |
1171 | pgoff_t index; | |
1172 | ||
1173 | /* make sure our super fits in the device */ | |
1174 | if (bytenr + PAGE_SIZE >= i_size_read(bdev->bd_inode)) | |
1175 | return 1; | |
1176 | ||
1177 | /* make sure our super fits in the page */ | |
1178 | if (sizeof(**disk_super) > PAGE_SIZE) | |
1179 | return 1; | |
1180 | ||
1181 | /* make sure our super doesn't straddle pages on disk */ | |
1182 | index = bytenr >> PAGE_SHIFT; | |
1183 | if ((bytenr + sizeof(**disk_super) - 1) >> PAGE_SHIFT != index) | |
1184 | return 1; | |
1185 | ||
1186 | /* pull in the page with our super */ | |
1187 | *page = read_cache_page_gfp(bdev->bd_inode->i_mapping, | |
1188 | index, GFP_KERNEL); | |
1189 | ||
1190 | if (IS_ERR_OR_NULL(*page)) | |
1191 | return 1; | |
1192 | ||
1193 | p = kmap(*page); | |
1194 | ||
1195 | /* align our pointer to the offset of the super block */ | |
1196 | *disk_super = p + (bytenr & ~PAGE_MASK); | |
1197 | ||
1198 | if (btrfs_super_bytenr(*disk_super) != bytenr || | |
1199 | btrfs_super_magic(*disk_super) != BTRFS_MAGIC) { | |
1200 | btrfs_release_disk_super(*page); | |
1201 | return 1; | |
1202 | } | |
1203 | ||
1204 | if ((*disk_super)->label[0] && | |
1205 | (*disk_super)->label[BTRFS_LABEL_SIZE - 1]) | |
1206 | (*disk_super)->label[BTRFS_LABEL_SIZE - 1] = '\0'; | |
1207 | ||
1208 | return 0; | |
1209 | } | |
1210 | ||
6f60cbd3 DS |
1211 | /* |
1212 | * Look for a btrfs signature on a device. This may be called out of the mount path | |
1213 | * and we are not allowed to call set_blocksize during the scan. The superblock | |
1214 | * is read via pagecache | |
1215 | */ | |
36350e95 GJ |
1216 | struct btrfs_device *btrfs_scan_one_device(const char *path, fmode_t flags, |
1217 | void *holder) | |
8a4b83cc CM |
1218 | { |
1219 | struct btrfs_super_block *disk_super; | |
4306a974 | 1220 | bool new_device_added = false; |
36350e95 | 1221 | struct btrfs_device *device = NULL; |
8a4b83cc | 1222 | struct block_device *bdev; |
6f60cbd3 | 1223 | struct page *page; |
6f60cbd3 | 1224 | u64 bytenr; |
8a4b83cc | 1225 | |
899f9307 DS |
1226 | lockdep_assert_held(&uuid_mutex); |
1227 | ||
6f60cbd3 DS |
1228 | /* |
1229 | * we would like to check all the supers, but that would make | |
1230 | * a btrfs mount succeed after a mkfs from a different FS. | |
1231 | * So, we need to add a special mount option to scan for | |
1232 | * later supers, using BTRFS_SUPER_MIRROR_MAX instead | |
1233 | */ | |
1234 | bytenr = btrfs_sb_offset(0); | |
d4d77629 | 1235 | flags |= FMODE_EXCL; |
6f60cbd3 DS |
1236 | |
1237 | bdev = blkdev_get_by_path(path, flags, holder); | |
b6ed73bc | 1238 | if (IS_ERR(bdev)) |
36350e95 | 1239 | return ERR_CAST(bdev); |
6f60cbd3 | 1240 | |
05a5c55d | 1241 | if (btrfs_read_disk_super(bdev, bytenr, &page, &disk_super)) { |
36350e95 | 1242 | device = ERR_PTR(-EINVAL); |
6f60cbd3 | 1243 | goto error_bdev_put; |
05a5c55d | 1244 | } |
6f60cbd3 | 1245 | |
4306a974 | 1246 | device = device_list_add(path, disk_super, &new_device_added); |
36350e95 | 1247 | if (!IS_ERR(device)) { |
4306a974 AJ |
1248 | if (new_device_added) |
1249 | btrfs_free_stale_devices(path, device); | |
1250 | } | |
6f60cbd3 | 1251 | |
6cf86a00 | 1252 | btrfs_release_disk_super(page); |
6f60cbd3 DS |
1253 | |
1254 | error_bdev_put: | |
d4d77629 | 1255 | blkdev_put(bdev, flags); |
b6ed73bc | 1256 | |
36350e95 | 1257 | return device; |
8a4b83cc | 1258 | } |
0b86a832 | 1259 | |
499f377f | 1260 | static int contains_pending_extent(struct btrfs_transaction *transaction, |
6df9a95e JB |
1261 | struct btrfs_device *device, |
1262 | u64 *start, u64 len) | |
1263 | { | |
fb456252 | 1264 | struct btrfs_fs_info *fs_info = device->fs_info; |
6df9a95e | 1265 | struct extent_map *em; |
499f377f | 1266 | struct list_head *search_list = &fs_info->pinned_chunks; |
6df9a95e | 1267 | int ret = 0; |
1b984508 | 1268 | u64 physical_start = *start; |
6df9a95e | 1269 | |
499f377f JM |
1270 | if (transaction) |
1271 | search_list = &transaction->pending_chunks; | |
04216820 FM |
1272 | again: |
1273 | list_for_each_entry(em, search_list, list) { | |
6df9a95e JB |
1274 | struct map_lookup *map; |
1275 | int i; | |
1276 | ||
95617d69 | 1277 | map = em->map_lookup; |
6df9a95e | 1278 | for (i = 0; i < map->num_stripes; i++) { |
c152b63e FM |
1279 | u64 end; |
1280 | ||
6df9a95e JB |
1281 | if (map->stripes[i].dev != device) |
1282 | continue; | |
1b984508 | 1283 | if (map->stripes[i].physical >= physical_start + len || |
6df9a95e | 1284 | map->stripes[i].physical + em->orig_block_len <= |
1b984508 | 1285 | physical_start) |
6df9a95e | 1286 | continue; |
c152b63e FM |
1287 | /* |
1288 | * Make sure that while processing the pinned list we do | |
1289 | * not override our *start with a lower value, because | |
1290 | * we can have pinned chunks that fall within this | |
1291 | * device hole and that have lower physical addresses | |
1292 | * than the pending chunks we processed before. If we | |
1293 | * do not take this special care we can end up getting | |
1294 | * 2 pending chunks that start at the same physical | |
1295 | * device offsets because the end offset of a pinned | |
1296 | * chunk can be equal to the start offset of some | |
1297 | * pending chunk. | |
1298 | */ | |
1299 | end = map->stripes[i].physical + em->orig_block_len; | |
1300 | if (end > *start) { | |
1301 | *start = end; | |
1302 | ret = 1; | |
1303 | } | |
6df9a95e JB |
1304 | } |
1305 | } | |
499f377f JM |
1306 | if (search_list != &fs_info->pinned_chunks) { |
1307 | search_list = &fs_info->pinned_chunks; | |
04216820 FM |
1308 | goto again; |
1309 | } | |
6df9a95e JB |
1310 | |
1311 | return ret; | |
1312 | } | |
1313 | ||
1314 | ||
0b86a832 | 1315 | /* |
499f377f JM |
1316 | * find_free_dev_extent_start - find free space in the specified device |
1317 | * @device: the device which we search the free space in | |
1318 | * @num_bytes: the size of the free space that we need | |
1319 | * @search_start: the position from which to begin the search | |
1320 | * @start: store the start of the free space. | |
1321 | * @len: the size of the free space. that we find, or the size | |
1322 | * of the max free space if we don't find suitable free space | |
7bfc837d | 1323 | * |
0b86a832 CM |
1324 | * this uses a pretty simple search, the expectation is that it is |
1325 | * called very infrequently and that a given device has a small number | |
1326 | * of extents | |
7bfc837d MX |
1327 | * |
1328 | * @start is used to store the start of the free space if we find. But if we | |
1329 | * don't find suitable free space, it will be used to store the start position | |
1330 | * of the max free space. | |
1331 | * | |
1332 | * @len is used to store the size of the free space that we find. | |
1333 | * But if we don't find suitable free space, it is used to store the size of | |
1334 | * the max free space. | |
0b86a832 | 1335 | */ |
499f377f JM |
1336 | int find_free_dev_extent_start(struct btrfs_transaction *transaction, |
1337 | struct btrfs_device *device, u64 num_bytes, | |
1338 | u64 search_start, u64 *start, u64 *len) | |
0b86a832 | 1339 | { |
0b246afa JM |
1340 | struct btrfs_fs_info *fs_info = device->fs_info; |
1341 | struct btrfs_root *root = fs_info->dev_root; | |
0b86a832 | 1342 | struct btrfs_key key; |
7bfc837d | 1343 | struct btrfs_dev_extent *dev_extent; |
2b82032c | 1344 | struct btrfs_path *path; |
7bfc837d MX |
1345 | u64 hole_size; |
1346 | u64 max_hole_start; | |
1347 | u64 max_hole_size; | |
1348 | u64 extent_end; | |
0b86a832 CM |
1349 | u64 search_end = device->total_bytes; |
1350 | int ret; | |
7bfc837d | 1351 | int slot; |
0b86a832 | 1352 | struct extent_buffer *l; |
8cdc7c5b FM |
1353 | |
1354 | /* | |
1355 | * We don't want to overwrite the superblock on the drive nor any area | |
1356 | * used by the boot loader (grub for example), so we make sure to start | |
1357 | * at an offset of at least 1MB. | |
1358 | */ | |
0d0c71b3 | 1359 | search_start = max_t(u64, search_start, SZ_1M); |
0b86a832 | 1360 | |
6df9a95e JB |
1361 | path = btrfs_alloc_path(); |
1362 | if (!path) | |
1363 | return -ENOMEM; | |
f2ab7618 | 1364 | |
7bfc837d MX |
1365 | max_hole_start = search_start; |
1366 | max_hole_size = 0; | |
1367 | ||
f2ab7618 | 1368 | again: |
401e29c1 AJ |
1369 | if (search_start >= search_end || |
1370 | test_bit(BTRFS_DEV_STATE_REPLACE_TGT, &device->dev_state)) { | |
7bfc837d | 1371 | ret = -ENOSPC; |
6df9a95e | 1372 | goto out; |
7bfc837d MX |
1373 | } |
1374 | ||
e4058b54 | 1375 | path->reada = READA_FORWARD; |
6df9a95e JB |
1376 | path->search_commit_root = 1; |
1377 | path->skip_locking = 1; | |
7bfc837d | 1378 | |
0b86a832 CM |
1379 | key.objectid = device->devid; |
1380 | key.offset = search_start; | |
1381 | key.type = BTRFS_DEV_EXTENT_KEY; | |
7bfc837d | 1382 | |
125ccb0a | 1383 | ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); |
0b86a832 | 1384 | if (ret < 0) |
7bfc837d | 1385 | goto out; |
1fcbac58 YZ |
1386 | if (ret > 0) { |
1387 | ret = btrfs_previous_item(root, path, key.objectid, key.type); | |
1388 | if (ret < 0) | |
7bfc837d | 1389 | goto out; |
1fcbac58 | 1390 | } |
7bfc837d | 1391 | |
0b86a832 CM |
1392 | while (1) { |
1393 | l = path->nodes[0]; | |
1394 | slot = path->slots[0]; | |
1395 | if (slot >= btrfs_header_nritems(l)) { | |
1396 | ret = btrfs_next_leaf(root, path); | |
1397 | if (ret == 0) | |
1398 | continue; | |
1399 | if (ret < 0) | |
7bfc837d MX |
1400 | goto out; |
1401 | ||
1402 | break; | |
0b86a832 CM |
1403 | } |
1404 | btrfs_item_key_to_cpu(l, &key, slot); | |
1405 | ||
1406 | if (key.objectid < device->devid) | |
1407 | goto next; | |
1408 | ||
1409 | if (key.objectid > device->devid) | |
7bfc837d | 1410 | break; |
0b86a832 | 1411 | |
962a298f | 1412 | if (key.type != BTRFS_DEV_EXTENT_KEY) |
7bfc837d | 1413 | goto next; |
9779b72f | 1414 | |
7bfc837d MX |
1415 | if (key.offset > search_start) { |
1416 | hole_size = key.offset - search_start; | |
9779b72f | 1417 | |
6df9a95e JB |
1418 | /* |
1419 | * Have to check before we set max_hole_start, otherwise | |
1420 | * we could end up sending back this offset anyway. | |
1421 | */ | |
499f377f | 1422 | if (contains_pending_extent(transaction, device, |
6df9a95e | 1423 | &search_start, |
1b984508 FL |
1424 | hole_size)) { |
1425 | if (key.offset >= search_start) { | |
1426 | hole_size = key.offset - search_start; | |
1427 | } else { | |
1428 | WARN_ON_ONCE(1); | |
1429 | hole_size = 0; | |
1430 | } | |
1431 | } | |
6df9a95e | 1432 | |
7bfc837d MX |
1433 | if (hole_size > max_hole_size) { |
1434 | max_hole_start = search_start; | |
1435 | max_hole_size = hole_size; | |
1436 | } | |
9779b72f | 1437 | |
7bfc837d MX |
1438 | /* |
1439 | * If this free space is greater than which we need, | |
1440 | * it must be the max free space that we have found | |
1441 | * until now, so max_hole_start must point to the start | |
1442 | * of this free space and the length of this free space | |
1443 | * is stored in max_hole_size. Thus, we return | |
1444 | * max_hole_start and max_hole_size and go back to the | |
1445 | * caller. | |
1446 | */ | |
1447 | if (hole_size >= num_bytes) { | |
1448 | ret = 0; | |
1449 | goto out; | |
0b86a832 CM |
1450 | } |
1451 | } | |
0b86a832 | 1452 | |
0b86a832 | 1453 | dev_extent = btrfs_item_ptr(l, slot, struct btrfs_dev_extent); |
7bfc837d MX |
1454 | extent_end = key.offset + btrfs_dev_extent_length(l, |
1455 | dev_extent); | |
1456 | if (extent_end > search_start) | |
1457 | search_start = extent_end; | |
0b86a832 CM |
1458 | next: |
1459 | path->slots[0]++; | |
1460 | cond_resched(); | |
1461 | } | |
0b86a832 | 1462 | |
38c01b96 | 1463 | /* |
1464 | * At this point, search_start should be the end of | |
1465 | * allocated dev extents, and when shrinking the device, | |
1466 | * search_end may be smaller than search_start. | |
1467 | */ | |
f2ab7618 | 1468 | if (search_end > search_start) { |
38c01b96 | 1469 | hole_size = search_end - search_start; |
1470 | ||
499f377f | 1471 | if (contains_pending_extent(transaction, device, &search_start, |
f2ab7618 ZL |
1472 | hole_size)) { |
1473 | btrfs_release_path(path); | |
1474 | goto again; | |
1475 | } | |
0b86a832 | 1476 | |
f2ab7618 ZL |
1477 | if (hole_size > max_hole_size) { |
1478 | max_hole_start = search_start; | |
1479 | max_hole_size = hole_size; | |
1480 | } | |
6df9a95e JB |
1481 | } |
1482 | ||
7bfc837d | 1483 | /* See above. */ |
f2ab7618 | 1484 | if (max_hole_size < num_bytes) |
7bfc837d MX |
1485 | ret = -ENOSPC; |
1486 | else | |
1487 | ret = 0; | |
1488 | ||
1489 | out: | |
2b82032c | 1490 | btrfs_free_path(path); |
7bfc837d | 1491 | *start = max_hole_start; |
b2117a39 | 1492 | if (len) |
7bfc837d | 1493 | *len = max_hole_size; |
0b86a832 CM |
1494 | return ret; |
1495 | } | |
1496 | ||
499f377f JM |
1497 | int find_free_dev_extent(struct btrfs_trans_handle *trans, |
1498 | struct btrfs_device *device, u64 num_bytes, | |
1499 | u64 *start, u64 *len) | |
1500 | { | |
499f377f | 1501 | /* FIXME use last free of some kind */ |
499f377f | 1502 | return find_free_dev_extent_start(trans->transaction, device, |
8cdc7c5b | 1503 | num_bytes, 0, start, len); |
499f377f JM |
1504 | } |
1505 | ||
b2950863 | 1506 | static int btrfs_free_dev_extent(struct btrfs_trans_handle *trans, |
8f18cf13 | 1507 | struct btrfs_device *device, |
2196d6e8 | 1508 | u64 start, u64 *dev_extent_len) |
8f18cf13 | 1509 | { |
0b246afa JM |
1510 | struct btrfs_fs_info *fs_info = device->fs_info; |
1511 | struct btrfs_root *root = fs_info->dev_root; | |
8f18cf13 CM |
1512 | int ret; |
1513 | struct btrfs_path *path; | |
8f18cf13 | 1514 | struct btrfs_key key; |
a061fc8d CM |
1515 | struct btrfs_key found_key; |
1516 | struct extent_buffer *leaf = NULL; | |
1517 | struct btrfs_dev_extent *extent = NULL; | |
8f18cf13 CM |
1518 | |
1519 | path = btrfs_alloc_path(); | |
1520 | if (!path) | |
1521 | return -ENOMEM; | |
1522 | ||
1523 | key.objectid = device->devid; | |
1524 | key.offset = start; | |
1525 | key.type = BTRFS_DEV_EXTENT_KEY; | |
924cd8fb | 1526 | again: |
8f18cf13 | 1527 | ret = btrfs_search_slot(trans, root, &key, path, -1, 1); |
a061fc8d CM |
1528 | if (ret > 0) { |
1529 | ret = btrfs_previous_item(root, path, key.objectid, | |
1530 | BTRFS_DEV_EXTENT_KEY); | |
b0b802d7 TI |
1531 | if (ret) |
1532 | goto out; | |
a061fc8d CM |
1533 | leaf = path->nodes[0]; |
1534 | btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); | |
1535 | extent = btrfs_item_ptr(leaf, path->slots[0], | |
1536 | struct btrfs_dev_extent); | |
1537 | BUG_ON(found_key.offset > start || found_key.offset + | |
1538 | btrfs_dev_extent_length(leaf, extent) < start); | |
924cd8fb MX |
1539 | key = found_key; |
1540 | btrfs_release_path(path); | |
1541 | goto again; | |
a061fc8d CM |
1542 | } else if (ret == 0) { |
1543 | leaf = path->nodes[0]; | |
1544 | extent = btrfs_item_ptr(leaf, path->slots[0], | |
1545 | struct btrfs_dev_extent); | |
79787eaa | 1546 | } else { |
0b246afa | 1547 | btrfs_handle_fs_error(fs_info, ret, "Slot search failed"); |
79787eaa | 1548 | goto out; |
a061fc8d | 1549 | } |
8f18cf13 | 1550 | |
2196d6e8 MX |
1551 | *dev_extent_len = btrfs_dev_extent_length(leaf, extent); |
1552 | ||
8f18cf13 | 1553 | ret = btrfs_del_item(trans, root, path); |
79787eaa | 1554 | if (ret) { |
0b246afa JM |
1555 | btrfs_handle_fs_error(fs_info, ret, |
1556 | "Failed to remove dev extent item"); | |
13212b54 | 1557 | } else { |
3204d33c | 1558 | set_bit(BTRFS_TRANS_HAVE_FREE_BGS, &trans->transaction->flags); |
79787eaa | 1559 | } |
b0b802d7 | 1560 | out: |
8f18cf13 CM |
1561 | btrfs_free_path(path); |
1562 | return ret; | |
1563 | } | |
1564 | ||
48a3b636 ES |
1565 | static int btrfs_alloc_dev_extent(struct btrfs_trans_handle *trans, |
1566 | struct btrfs_device *device, | |
48a3b636 | 1567 | u64 chunk_offset, u64 start, u64 num_bytes) |
0b86a832 CM |
1568 | { |
1569 | int ret; | |
1570 | struct btrfs_path *path; | |
0b246afa JM |
1571 | struct btrfs_fs_info *fs_info = device->fs_info; |
1572 | struct btrfs_root *root = fs_info->dev_root; | |
0b86a832 CM |
1573 | struct btrfs_dev_extent *extent; |
1574 | struct extent_buffer *leaf; | |
1575 | struct btrfs_key key; | |
1576 | ||
e12c9621 | 1577 | WARN_ON(!test_bit(BTRFS_DEV_STATE_IN_FS_METADATA, &device->dev_state)); |
401e29c1 | 1578 | WARN_ON(test_bit(BTRFS_DEV_STATE_REPLACE_TGT, &device->dev_state)); |
0b86a832 CM |
1579 | path = btrfs_alloc_path(); |
1580 | if (!path) | |
1581 | return -ENOMEM; | |
1582 | ||
0b86a832 | 1583 | key.objectid = device->devid; |
2b82032c | 1584 | key.offset = start; |
0b86a832 CM |
1585 | key.type = BTRFS_DEV_EXTENT_KEY; |
1586 | ret = btrfs_insert_empty_item(trans, root, path, &key, | |
1587 | sizeof(*extent)); | |
2cdcecbc MF |
1588 | if (ret) |
1589 | goto out; | |
0b86a832 CM |
1590 | |
1591 | leaf = path->nodes[0]; | |
1592 | extent = btrfs_item_ptr(leaf, path->slots[0], | |
1593 | struct btrfs_dev_extent); | |
b5d9071c NB |
1594 | btrfs_set_dev_extent_chunk_tree(leaf, extent, |
1595 | BTRFS_CHUNK_TREE_OBJECTID); | |
0ca00afb NB |
1596 | btrfs_set_dev_extent_chunk_objectid(leaf, extent, |
1597 | BTRFS_FIRST_CHUNK_TREE_OBJECTID); | |
e17cade2 CM |
1598 | btrfs_set_dev_extent_chunk_offset(leaf, extent, chunk_offset); |
1599 | ||
0b86a832 CM |
1600 | btrfs_set_dev_extent_length(leaf, extent, num_bytes); |
1601 | btrfs_mark_buffer_dirty(leaf); | |
2cdcecbc | 1602 | out: |
0b86a832 CM |
1603 | btrfs_free_path(path); |
1604 | return ret; | |
1605 | } | |
1606 | ||
6df9a95e | 1607 | static u64 find_next_chunk(struct btrfs_fs_info *fs_info) |
0b86a832 | 1608 | { |
6df9a95e JB |
1609 | struct extent_map_tree *em_tree; |
1610 | struct extent_map *em; | |
1611 | struct rb_node *n; | |
1612 | u64 ret = 0; | |
0b86a832 | 1613 | |
6df9a95e JB |
1614 | em_tree = &fs_info->mapping_tree.map_tree; |
1615 | read_lock(&em_tree->lock); | |
1616 | n = rb_last(&em_tree->map); | |
1617 | if (n) { | |
1618 | em = rb_entry(n, struct extent_map, rb_node); | |
1619 | ret = em->start + em->len; | |
0b86a832 | 1620 | } |
6df9a95e JB |
1621 | read_unlock(&em_tree->lock); |
1622 | ||
0b86a832 CM |
1623 | return ret; |
1624 | } | |
1625 | ||
53f10659 ID |
1626 | static noinline int find_next_devid(struct btrfs_fs_info *fs_info, |
1627 | u64 *devid_ret) | |
0b86a832 CM |
1628 | { |
1629 | int ret; | |
1630 | struct btrfs_key key; | |
1631 | struct btrfs_key found_key; | |
2b82032c YZ |
1632 | struct btrfs_path *path; |
1633 | ||
2b82032c YZ |
1634 | path = btrfs_alloc_path(); |
1635 | if (!path) | |
1636 | return -ENOMEM; | |
0b86a832 CM |
1637 | |
1638 | key.objectid = BTRFS_DEV_ITEMS_OBJECTID; | |
1639 | key.type = BTRFS_DEV_ITEM_KEY; | |
1640 | key.offset = (u64)-1; | |
1641 | ||
53f10659 | 1642 | ret = btrfs_search_slot(NULL, fs_info->chunk_root, &key, path, 0, 0); |
0b86a832 CM |
1643 | if (ret < 0) |
1644 | goto error; | |
1645 | ||
79787eaa | 1646 | BUG_ON(ret == 0); /* Corruption */ |
0b86a832 | 1647 | |
53f10659 ID |
1648 | ret = btrfs_previous_item(fs_info->chunk_root, path, |
1649 | BTRFS_DEV_ITEMS_OBJECTID, | |
0b86a832 CM |
1650 | BTRFS_DEV_ITEM_KEY); |
1651 | if (ret) { | |
53f10659 | 1652 | *devid_ret = 1; |
0b86a832 CM |
1653 | } else { |
1654 | btrfs_item_key_to_cpu(path->nodes[0], &found_key, | |
1655 | path->slots[0]); | |
53f10659 | 1656 | *devid_ret = found_key.offset + 1; |
0b86a832 CM |
1657 | } |
1658 | ret = 0; | |
1659 | error: | |
2b82032c | 1660 | btrfs_free_path(path); |
0b86a832 CM |
1661 | return ret; |
1662 | } | |
1663 | ||
1664 | /* | |
1665 | * the device information is stored in the chunk root | |
1666 | * the btrfs_device struct should be fully filled in | |
1667 | */ | |
c74a0b02 | 1668 | static int btrfs_add_dev_item(struct btrfs_trans_handle *trans, |
48a3b636 | 1669 | struct btrfs_device *device) |
0b86a832 CM |
1670 | { |
1671 | int ret; | |
1672 | struct btrfs_path *path; | |
1673 | struct btrfs_dev_item *dev_item; | |
1674 | struct extent_buffer *leaf; | |
1675 | struct btrfs_key key; | |
1676 | unsigned long ptr; | |
0b86a832 | 1677 | |
0b86a832 CM |
1678 | path = btrfs_alloc_path(); |
1679 | if (!path) | |
1680 | return -ENOMEM; | |
1681 | ||
0b86a832 CM |
1682 | key.objectid = BTRFS_DEV_ITEMS_OBJECTID; |
1683 | key.type = BTRFS_DEV_ITEM_KEY; | |
2b82032c | 1684 | key.offset = device->devid; |
0b86a832 | 1685 | |
8e87e856 NB |
1686 | ret = btrfs_insert_empty_item(trans, trans->fs_info->chunk_root, path, |
1687 | &key, sizeof(*dev_item)); | |
0b86a832 CM |
1688 | if (ret) |
1689 | goto out; | |
1690 | ||
1691 | leaf = path->nodes[0]; | |
1692 | dev_item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_dev_item); | |
1693 | ||
1694 | btrfs_set_device_id(leaf, dev_item, device->devid); | |
2b82032c | 1695 | btrfs_set_device_generation(leaf, dev_item, 0); |
0b86a832 CM |
1696 | btrfs_set_device_type(leaf, dev_item, device->type); |
1697 | btrfs_set_device_io_align(leaf, dev_item, device->io_align); | |
1698 | btrfs_set_device_io_width(leaf, dev_item, device->io_width); | |
1699 | btrfs_set_device_sector_size(leaf, dev_item, device->sector_size); | |
7cc8e58d MX |
1700 | btrfs_set_device_total_bytes(leaf, dev_item, |
1701 | btrfs_device_get_disk_total_bytes(device)); | |
1702 | btrfs_set_device_bytes_used(leaf, dev_item, | |
1703 | btrfs_device_get_bytes_used(device)); | |
e17cade2 CM |
1704 | btrfs_set_device_group(leaf, dev_item, 0); |
1705 | btrfs_set_device_seek_speed(leaf, dev_item, 0); | |
1706 | btrfs_set_device_bandwidth(leaf, dev_item, 0); | |
c3027eb5 | 1707 | btrfs_set_device_start_offset(leaf, dev_item, 0); |
0b86a832 | 1708 | |
410ba3a2 | 1709 | ptr = btrfs_device_uuid(dev_item); |
e17cade2 | 1710 | write_extent_buffer(leaf, device->uuid, ptr, BTRFS_UUID_SIZE); |
1473b24e | 1711 | ptr = btrfs_device_fsid(dev_item); |
8e87e856 | 1712 | write_extent_buffer(leaf, trans->fs_info->fsid, ptr, BTRFS_FSID_SIZE); |
0b86a832 | 1713 | btrfs_mark_buffer_dirty(leaf); |
0b86a832 | 1714 | |
2b82032c | 1715 | ret = 0; |
0b86a832 CM |
1716 | out: |
1717 | btrfs_free_path(path); | |
1718 | return ret; | |
1719 | } | |
8f18cf13 | 1720 | |
5a1972bd QW |
1721 | /* |
1722 | * Function to update ctime/mtime for a given device path. | |
1723 | * Mainly used for ctime/mtime based probe like libblkid. | |
1724 | */ | |
da353f6b | 1725 | static void update_dev_time(const char *path_name) |
5a1972bd QW |
1726 | { |
1727 | struct file *filp; | |
1728 | ||
1729 | filp = filp_open(path_name, O_RDWR, 0); | |
98af592f | 1730 | if (IS_ERR(filp)) |
5a1972bd QW |
1731 | return; |
1732 | file_update_time(filp); | |
1733 | filp_close(filp, NULL); | |
5a1972bd QW |
1734 | } |
1735 | ||
5b4aacef | 1736 | static int btrfs_rm_dev_item(struct btrfs_fs_info *fs_info, |
a061fc8d CM |
1737 | struct btrfs_device *device) |
1738 | { | |
5b4aacef | 1739 | struct btrfs_root *root = fs_info->chunk_root; |
a061fc8d CM |
1740 | int ret; |
1741 | struct btrfs_path *path; | |
a061fc8d | 1742 | struct btrfs_key key; |
a061fc8d CM |
1743 | struct btrfs_trans_handle *trans; |
1744 | ||
a061fc8d CM |
1745 | path = btrfs_alloc_path(); |
1746 | if (!path) | |
1747 | return -ENOMEM; | |
1748 | ||
a22285a6 | 1749 | trans = btrfs_start_transaction(root, 0); |
98d5dc13 TI |
1750 | if (IS_ERR(trans)) { |
1751 | btrfs_free_path(path); | |
1752 | return PTR_ERR(trans); | |
1753 | } | |
a061fc8d CM |
1754 | key.objectid = BTRFS_DEV_ITEMS_OBJECTID; |
1755 | key.type = BTRFS_DEV_ITEM_KEY; | |
1756 | key.offset = device->devid; | |
1757 | ||
1758 | ret = btrfs_search_slot(trans, root, &key, path, -1, 1); | |
5e9f2ad5 NB |
1759 | if (ret) { |
1760 | if (ret > 0) | |
1761 | ret = -ENOENT; | |
1762 | btrfs_abort_transaction(trans, ret); | |
1763 | btrfs_end_transaction(trans); | |
a061fc8d CM |
1764 | goto out; |
1765 | } | |
1766 | ||
1767 | ret = btrfs_del_item(trans, root, path); | |
5e9f2ad5 NB |
1768 | if (ret) { |
1769 | btrfs_abort_transaction(trans, ret); | |
1770 | btrfs_end_transaction(trans); | |
1771 | } | |
1772 | ||
a061fc8d CM |
1773 | out: |
1774 | btrfs_free_path(path); | |
5e9f2ad5 NB |
1775 | if (!ret) |
1776 | ret = btrfs_commit_transaction(trans); | |
a061fc8d CM |
1777 | return ret; |
1778 | } | |
1779 | ||
3cc31a0d DS |
1780 | /* |
1781 | * Verify that @num_devices satisfies the RAID profile constraints in the whole | |
1782 | * filesystem. It's up to the caller to adjust that number regarding eg. device | |
1783 | * replace. | |
1784 | */ | |
1785 | static int btrfs_check_raid_min_devices(struct btrfs_fs_info *fs_info, | |
1786 | u64 num_devices) | |
a061fc8d | 1787 | { |
a061fc8d | 1788 | u64 all_avail; |
de98ced9 | 1789 | unsigned seq; |
418775a2 | 1790 | int i; |
a061fc8d | 1791 | |
de98ced9 | 1792 | do { |
bd45ffbc | 1793 | seq = read_seqbegin(&fs_info->profiles_lock); |
de98ced9 | 1794 | |
bd45ffbc AJ |
1795 | all_avail = fs_info->avail_data_alloc_bits | |
1796 | fs_info->avail_system_alloc_bits | | |
1797 | fs_info->avail_metadata_alloc_bits; | |
1798 | } while (read_seqretry(&fs_info->profiles_lock, seq)); | |
a061fc8d | 1799 | |
418775a2 | 1800 | for (i = 0; i < BTRFS_NR_RAID_TYPES; i++) { |
41a6e891 | 1801 | if (!(all_avail & btrfs_raid_array[i].bg_flag)) |
418775a2 | 1802 | continue; |
a061fc8d | 1803 | |
418775a2 | 1804 | if (num_devices < btrfs_raid_array[i].devs_min) { |
f9fbcaa2 | 1805 | int ret = btrfs_raid_array[i].mindev_error; |
bd45ffbc | 1806 | |
418775a2 DS |
1807 | if (ret) |
1808 | return ret; | |
1809 | } | |
53b381b3 DW |
1810 | } |
1811 | ||
bd45ffbc | 1812 | return 0; |
f1fa7f26 AJ |
1813 | } |
1814 | ||
c9162bdf OS |
1815 | static struct btrfs_device * btrfs_find_next_active_device( |
1816 | struct btrfs_fs_devices *fs_devs, struct btrfs_device *device) | |
a061fc8d | 1817 | { |
2b82032c | 1818 | struct btrfs_device *next_device; |
88acff64 AJ |
1819 | |
1820 | list_for_each_entry(next_device, &fs_devs->devices, dev_list) { | |
1821 | if (next_device != device && | |
e6e674bd AJ |
1822 | !test_bit(BTRFS_DEV_STATE_MISSING, &next_device->dev_state) |
1823 | && next_device->bdev) | |
88acff64 AJ |
1824 | return next_device; |
1825 | } | |
1826 | ||
1827 | return NULL; | |
1828 | } | |
1829 | ||
1830 | /* | |
1831 | * Helper function to check if the given device is part of s_bdev / latest_bdev | |
1832 | * and replace it with the provided or the next active device, in the context | |
1833 | * where this function called, there should be always be another device (or | |
1834 | * this_dev) which is active. | |
1835 | */ | |
d6507cf1 NB |
1836 | void btrfs_assign_next_active_device(struct btrfs_device *device, |
1837 | struct btrfs_device *this_dev) | |
88acff64 | 1838 | { |
d6507cf1 | 1839 | struct btrfs_fs_info *fs_info = device->fs_info; |
88acff64 AJ |
1840 | struct btrfs_device *next_device; |
1841 | ||
1842 | if (this_dev) | |
1843 | next_device = this_dev; | |
1844 | else | |
1845 | next_device = btrfs_find_next_active_device(fs_info->fs_devices, | |
1846 | device); | |
1847 | ASSERT(next_device); | |
1848 | ||
1849 | if (fs_info->sb->s_bdev && | |
1850 | (fs_info->sb->s_bdev == device->bdev)) | |
1851 | fs_info->sb->s_bdev = next_device->bdev; | |
1852 | ||
1853 | if (fs_info->fs_devices->latest_bdev == device->bdev) | |
1854 | fs_info->fs_devices->latest_bdev = next_device->bdev; | |
1855 | } | |
1856 | ||
da353f6b DS |
1857 | int btrfs_rm_device(struct btrfs_fs_info *fs_info, const char *device_path, |
1858 | u64 devid) | |
f1fa7f26 AJ |
1859 | { |
1860 | struct btrfs_device *device; | |
1f78160c | 1861 | struct btrfs_fs_devices *cur_devices; |
b5185197 | 1862 | struct btrfs_fs_devices *fs_devices = fs_info->fs_devices; |
2b82032c | 1863 | u64 num_devices; |
a061fc8d CM |
1864 | int ret = 0; |
1865 | ||
a061fc8d CM |
1866 | mutex_lock(&uuid_mutex); |
1867 | ||
b5185197 | 1868 | num_devices = fs_devices->num_devices; |
7e79cb86 | 1869 | btrfs_dev_replace_read_lock(&fs_info->dev_replace); |
0b246afa | 1870 | if (btrfs_dev_replace_is_ongoing(&fs_info->dev_replace)) { |
16220c46 | 1871 | ASSERT(num_devices > 1); |
8dabb742 SB |
1872 | num_devices--; |
1873 | } | |
7e79cb86 | 1874 | btrfs_dev_replace_read_unlock(&fs_info->dev_replace); |
8dabb742 | 1875 | |
0b246afa | 1876 | ret = btrfs_check_raid_min_devices(fs_info, num_devices - 1); |
f1fa7f26 | 1877 | if (ret) |
a061fc8d | 1878 | goto out; |
a061fc8d | 1879 | |
2ff7e61e JM |
1880 | ret = btrfs_find_device_by_devspec(fs_info, devid, device_path, |
1881 | &device); | |
24fc572f | 1882 | if (ret) |
53b381b3 | 1883 | goto out; |
dfe25020 | 1884 | |
401e29c1 | 1885 | if (test_bit(BTRFS_DEV_STATE_REPLACE_TGT, &device->dev_state)) { |
183860f6 | 1886 | ret = BTRFS_ERROR_DEV_TGT_REPLACE; |
24fc572f | 1887 | goto out; |
63a212ab SB |
1888 | } |
1889 | ||
ebbede42 AJ |
1890 | if (test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state) && |
1891 | fs_info->fs_devices->rw_devices == 1) { | |
183860f6 | 1892 | ret = BTRFS_ERROR_DEV_ONLY_WRITABLE; |
24fc572f | 1893 | goto out; |
2b82032c YZ |
1894 | } |
1895 | ||
ebbede42 | 1896 | if (test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state)) { |
34441361 | 1897 | mutex_lock(&fs_info->chunk_mutex); |
2b82032c | 1898 | list_del_init(&device->dev_alloc_list); |
c3929c36 | 1899 | device->fs_devices->rw_devices--; |
34441361 | 1900 | mutex_unlock(&fs_info->chunk_mutex); |
dfe25020 | 1901 | } |
a061fc8d | 1902 | |
d7901554 | 1903 | mutex_unlock(&uuid_mutex); |
a061fc8d | 1904 | ret = btrfs_shrink_device(device, 0); |
d7901554 | 1905 | mutex_lock(&uuid_mutex); |
a061fc8d | 1906 | if (ret) |
9b3517e9 | 1907 | goto error_undo; |
a061fc8d | 1908 | |
63a212ab SB |
1909 | /* |
1910 | * TODO: the superblock still includes this device in its num_devices | |
1911 | * counter although write_all_supers() is not locked out. This | |
1912 | * could give a filesystem state which requires a degraded mount. | |
1913 | */ | |
0b246afa | 1914 | ret = btrfs_rm_dev_item(fs_info, device); |
a061fc8d | 1915 | if (ret) |
9b3517e9 | 1916 | goto error_undo; |
a061fc8d | 1917 | |
e12c9621 | 1918 | clear_bit(BTRFS_DEV_STATE_IN_FS_METADATA, &device->dev_state); |
0b246afa | 1919 | btrfs_scrub_cancel_dev(fs_info, device); |
e5e9a520 CM |
1920 | |
1921 | /* | |
1922 | * the device list mutex makes sure that we don't change | |
1923 | * the device list while someone else is writing out all | |
d7306801 FDBM |
1924 | * the device supers. Whoever is writing all supers, should |
1925 | * lock the device list mutex before getting the number of | |
1926 | * devices in the super block (super_copy). Conversely, | |
1927 | * whoever updates the number of devices in the super block | |
1928 | * (super_copy) should hold the device list mutex. | |
e5e9a520 | 1929 | */ |
1f78160c | 1930 | |
41a52a0f AJ |
1931 | /* |
1932 | * In normal cases the cur_devices == fs_devices. But in case | |
1933 | * of deleting a seed device, the cur_devices should point to | |
1934 | * its own fs_devices listed under the fs_devices->seed. | |
1935 | */ | |
1f78160c | 1936 | cur_devices = device->fs_devices; |
b5185197 | 1937 | mutex_lock(&fs_devices->device_list_mutex); |
1f78160c | 1938 | list_del_rcu(&device->dev_list); |
e5e9a520 | 1939 | |
41a52a0f AJ |
1940 | cur_devices->num_devices--; |
1941 | cur_devices->total_devices--; | |
b4993e64 AJ |
1942 | /* Update total_devices of the parent fs_devices if it's seed */ |
1943 | if (cur_devices != fs_devices) | |
1944 | fs_devices->total_devices--; | |
2b82032c | 1945 | |
e6e674bd | 1946 | if (test_bit(BTRFS_DEV_STATE_MISSING, &device->dev_state)) |
41a52a0f | 1947 | cur_devices->missing_devices--; |
cd02dca5 | 1948 | |
d6507cf1 | 1949 | btrfs_assign_next_active_device(device, NULL); |
2b82032c | 1950 | |
0bfaa9c5 | 1951 | if (device->bdev) { |
41a52a0f | 1952 | cur_devices->open_devices--; |
0bfaa9c5 | 1953 | /* remove sysfs entry */ |
b5185197 | 1954 | btrfs_sysfs_rm_device_link(fs_devices, device); |
0bfaa9c5 | 1955 | } |
99994cde | 1956 | |
0b246afa JM |
1957 | num_devices = btrfs_super_num_devices(fs_info->super_copy) - 1; |
1958 | btrfs_set_super_num_devices(fs_info->super_copy, num_devices); | |
b5185197 | 1959 | mutex_unlock(&fs_devices->device_list_mutex); |
2b82032c | 1960 | |
cea67ab9 JM |
1961 | /* |
1962 | * at this point, the device is zero sized and detached from | |
1963 | * the devices list. All that's left is to zero out the old | |
1964 | * supers and free the device. | |
1965 | */ | |
ebbede42 | 1966 | if (test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state)) |
cea67ab9 JM |
1967 | btrfs_scratch_superblocks(device->bdev, device->name->str); |
1968 | ||
1969 | btrfs_close_bdev(device); | |
f06c5965 | 1970 | call_rcu(&device->rcu, free_device_rcu); |
cea67ab9 | 1971 | |
1f78160c | 1972 | if (cur_devices->open_devices == 0) { |
e4404d6e | 1973 | while (fs_devices) { |
8321cf25 RS |
1974 | if (fs_devices->seed == cur_devices) { |
1975 | fs_devices->seed = cur_devices->seed; | |
e4404d6e | 1976 | break; |
8321cf25 | 1977 | } |
e4404d6e | 1978 | fs_devices = fs_devices->seed; |
2b82032c | 1979 | } |
1f78160c | 1980 | cur_devices->seed = NULL; |
0226e0eb | 1981 | close_fs_devices(cur_devices); |
1f78160c | 1982 | free_fs_devices(cur_devices); |
2b82032c YZ |
1983 | } |
1984 | ||
a061fc8d CM |
1985 | out: |
1986 | mutex_unlock(&uuid_mutex); | |
a061fc8d | 1987 | return ret; |
24fc572f | 1988 | |
9b3517e9 | 1989 | error_undo: |
ebbede42 | 1990 | if (test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state)) { |
34441361 | 1991 | mutex_lock(&fs_info->chunk_mutex); |
9b3517e9 | 1992 | list_add(&device->dev_alloc_list, |
b5185197 | 1993 | &fs_devices->alloc_list); |
c3929c36 | 1994 | device->fs_devices->rw_devices++; |
34441361 | 1995 | mutex_unlock(&fs_info->chunk_mutex); |
9b3517e9 | 1996 | } |
24fc572f | 1997 | goto out; |
a061fc8d CM |
1998 | } |
1999 | ||
68a9db5f | 2000 | void btrfs_rm_dev_replace_remove_srcdev(struct btrfs_device *srcdev) |
e93c89c1 | 2001 | { |
d51908ce AJ |
2002 | struct btrfs_fs_devices *fs_devices; |
2003 | ||
68a9db5f | 2004 | lockdep_assert_held(&srcdev->fs_info->fs_devices->device_list_mutex); |
1357272f | 2005 | |
25e8e911 AJ |
2006 | /* |
2007 | * in case of fs with no seed, srcdev->fs_devices will point | |
2008 | * to fs_devices of fs_info. However when the dev being replaced is | |
2009 | * a seed dev it will point to the seed's local fs_devices. In short | |
2010 | * srcdev will have its correct fs_devices in both the cases. | |
2011 | */ | |
2012 | fs_devices = srcdev->fs_devices; | |
d51908ce | 2013 | |
e93c89c1 | 2014 | list_del_rcu(&srcdev->dev_list); |
619c47f3 | 2015 | list_del(&srcdev->dev_alloc_list); |
d51908ce | 2016 | fs_devices->num_devices--; |
e6e674bd | 2017 | if (test_bit(BTRFS_DEV_STATE_MISSING, &srcdev->dev_state)) |
d51908ce | 2018 | fs_devices->missing_devices--; |
e93c89c1 | 2019 | |
ebbede42 | 2020 | if (test_bit(BTRFS_DEV_STATE_WRITEABLE, &srcdev->dev_state)) |
82372bc8 | 2021 | fs_devices->rw_devices--; |
1357272f | 2022 | |
82372bc8 | 2023 | if (srcdev->bdev) |
d51908ce | 2024 | fs_devices->open_devices--; |
084b6e7c QW |
2025 | } |
2026 | ||
2027 | void btrfs_rm_dev_replace_free_srcdev(struct btrfs_fs_info *fs_info, | |
2028 | struct btrfs_device *srcdev) | |
2029 | { | |
2030 | struct btrfs_fs_devices *fs_devices = srcdev->fs_devices; | |
e93c89c1 | 2031 | |
ebbede42 | 2032 | if (test_bit(BTRFS_DEV_STATE_WRITEABLE, &srcdev->dev_state)) { |
48b3b9d4 AJ |
2033 | /* zero out the old super if it is writable */ |
2034 | btrfs_scratch_superblocks(srcdev->bdev, srcdev->name->str); | |
2035 | } | |
14238819 AJ |
2036 | |
2037 | btrfs_close_bdev(srcdev); | |
f06c5965 | 2038 | call_rcu(&srcdev->rcu, free_device_rcu); |
94d5f0c2 | 2039 | |
94d5f0c2 AJ |
2040 | /* if this is no devs we rather delete the fs_devices */ |
2041 | if (!fs_devices->num_devices) { | |
2042 | struct btrfs_fs_devices *tmp_fs_devices; | |
2043 | ||
6dd38f81 AJ |
2044 | /* |
2045 | * On a mounted FS, num_devices can't be zero unless it's a | |
2046 | * seed. In case of a seed device being replaced, the replace | |
2047 | * target added to the sprout FS, so there will be no more | |
2048 | * device left under the seed FS. | |
2049 | */ | |
2050 | ASSERT(fs_devices->seeding); | |
2051 | ||
94d5f0c2 AJ |
2052 | tmp_fs_devices = fs_info->fs_devices; |
2053 | while (tmp_fs_devices) { | |
2054 | if (tmp_fs_devices->seed == fs_devices) { | |
2055 | tmp_fs_devices->seed = fs_devices->seed; | |
2056 | break; | |
2057 | } | |
2058 | tmp_fs_devices = tmp_fs_devices->seed; | |
2059 | } | |
2060 | fs_devices->seed = NULL; | |
0226e0eb | 2061 | close_fs_devices(fs_devices); |
8bef8401 | 2062 | free_fs_devices(fs_devices); |
94d5f0c2 | 2063 | } |
e93c89c1 SB |
2064 | } |
2065 | ||
4f5ad7bd | 2066 | void btrfs_destroy_dev_replace_tgtdev(struct btrfs_device *tgtdev) |
e93c89c1 | 2067 | { |
4f5ad7bd | 2068 | struct btrfs_fs_devices *fs_devices = tgtdev->fs_info->fs_devices; |
d9a071f0 | 2069 | |
e93c89c1 | 2070 | WARN_ON(!tgtdev); |
d9a071f0 | 2071 | mutex_lock(&fs_devices->device_list_mutex); |
d2ff1b20 | 2072 | |
d9a071f0 | 2073 | btrfs_sysfs_rm_device_link(fs_devices, tgtdev); |
d2ff1b20 | 2074 | |
779bf3fe | 2075 | if (tgtdev->bdev) |
d9a071f0 | 2076 | fs_devices->open_devices--; |
779bf3fe | 2077 | |
d9a071f0 | 2078 | fs_devices->num_devices--; |
e93c89c1 | 2079 | |
d6507cf1 | 2080 | btrfs_assign_next_active_device(tgtdev, NULL); |
e93c89c1 | 2081 | |
e93c89c1 | 2082 | list_del_rcu(&tgtdev->dev_list); |
e93c89c1 | 2083 | |
d9a071f0 | 2084 | mutex_unlock(&fs_devices->device_list_mutex); |
779bf3fe AJ |
2085 | |
2086 | /* | |
2087 | * The update_dev_time() with in btrfs_scratch_superblocks() | |
2088 | * may lead to a call to btrfs_show_devname() which will try | |
2089 | * to hold device_list_mutex. And here this device | |
2090 | * is already out of device list, so we don't have to hold | |
2091 | * the device_list_mutex lock. | |
2092 | */ | |
2093 | btrfs_scratch_superblocks(tgtdev->bdev, tgtdev->name->str); | |
14238819 AJ |
2094 | |
2095 | btrfs_close_bdev(tgtdev); | |
f06c5965 | 2096 | call_rcu(&tgtdev->rcu, free_device_rcu); |
e93c89c1 SB |
2097 | } |
2098 | ||
2ff7e61e | 2099 | static int btrfs_find_device_by_path(struct btrfs_fs_info *fs_info, |
da353f6b | 2100 | const char *device_path, |
48a3b636 | 2101 | struct btrfs_device **device) |
7ba15b7d SB |
2102 | { |
2103 | int ret = 0; | |
2104 | struct btrfs_super_block *disk_super; | |
2105 | u64 devid; | |
2106 | u8 *dev_uuid; | |
2107 | struct block_device *bdev; | |
2108 | struct buffer_head *bh; | |
2109 | ||
2110 | *device = NULL; | |
2111 | ret = btrfs_get_bdev_and_sb(device_path, FMODE_READ, | |
0b246afa | 2112 | fs_info->bdev_holder, 0, &bdev, &bh); |
7ba15b7d SB |
2113 | if (ret) |
2114 | return ret; | |
2115 | disk_super = (struct btrfs_super_block *)bh->b_data; | |
2116 | devid = btrfs_stack_device_id(&disk_super->dev_item); | |
2117 | dev_uuid = disk_super->dev_item.uuid; | |
0b246afa | 2118 | *device = btrfs_find_device(fs_info, devid, dev_uuid, disk_super->fsid); |
7ba15b7d SB |
2119 | brelse(bh); |
2120 | if (!*device) | |
2121 | ret = -ENOENT; | |
2122 | blkdev_put(bdev, FMODE_READ); | |
2123 | return ret; | |
2124 | } | |
2125 | ||
2ff7e61e | 2126 | int btrfs_find_device_missing_or_by_path(struct btrfs_fs_info *fs_info, |
da353f6b | 2127 | const char *device_path, |
7ba15b7d SB |
2128 | struct btrfs_device **device) |
2129 | { | |
2130 | *device = NULL; | |
2131 | if (strcmp(device_path, "missing") == 0) { | |
2132 | struct list_head *devices; | |
2133 | struct btrfs_device *tmp; | |
2134 | ||
0b246afa | 2135 | devices = &fs_info->fs_devices->devices; |
7ba15b7d | 2136 | list_for_each_entry(tmp, devices, dev_list) { |
e12c9621 AJ |
2137 | if (test_bit(BTRFS_DEV_STATE_IN_FS_METADATA, |
2138 | &tmp->dev_state) && !tmp->bdev) { | |
7ba15b7d SB |
2139 | *device = tmp; |
2140 | break; | |
2141 | } | |
2142 | } | |
2143 | ||
d74a6259 AJ |
2144 | if (!*device) |
2145 | return BTRFS_ERROR_DEV_MISSING_NOT_FOUND; | |
7ba15b7d SB |
2146 | |
2147 | return 0; | |
2148 | } else { | |
2ff7e61e | 2149 | return btrfs_find_device_by_path(fs_info, device_path, device); |
7ba15b7d SB |
2150 | } |
2151 | } | |
2152 | ||
5c5c0df0 DS |
2153 | /* |
2154 | * Lookup a device given by device id, or the path if the id is 0. | |
2155 | */ | |
2ff7e61e | 2156 | int btrfs_find_device_by_devspec(struct btrfs_fs_info *fs_info, u64 devid, |
da353f6b DS |
2157 | const char *devpath, |
2158 | struct btrfs_device **device) | |
24e0474b AJ |
2159 | { |
2160 | int ret; | |
2161 | ||
5c5c0df0 | 2162 | if (devid) { |
24e0474b | 2163 | ret = 0; |
0b246afa | 2164 | *device = btrfs_find_device(fs_info, devid, NULL, NULL); |
24e0474b AJ |
2165 | if (!*device) |
2166 | ret = -ENOENT; | |
2167 | } else { | |
5c5c0df0 | 2168 | if (!devpath || !devpath[0]) |
b3d1b153 AJ |
2169 | return -EINVAL; |
2170 | ||
2ff7e61e | 2171 | ret = btrfs_find_device_missing_or_by_path(fs_info, devpath, |
24e0474b AJ |
2172 | device); |
2173 | } | |
2174 | return ret; | |
2175 | } | |
2176 | ||
2b82032c YZ |
2177 | /* |
2178 | * does all the dirty work required for changing file system's UUID. | |
2179 | */ | |
2ff7e61e | 2180 | static int btrfs_prepare_sprout(struct btrfs_fs_info *fs_info) |
2b82032c | 2181 | { |
0b246afa | 2182 | struct btrfs_fs_devices *fs_devices = fs_info->fs_devices; |
2b82032c | 2183 | struct btrfs_fs_devices *old_devices; |
e4404d6e | 2184 | struct btrfs_fs_devices *seed_devices; |
0b246afa | 2185 | struct btrfs_super_block *disk_super = fs_info->super_copy; |
2b82032c YZ |
2186 | struct btrfs_device *device; |
2187 | u64 super_flags; | |
2188 | ||
a32bf9a3 | 2189 | lockdep_assert_held(&uuid_mutex); |
e4404d6e | 2190 | if (!fs_devices->seeding) |
2b82032c YZ |
2191 | return -EINVAL; |
2192 | ||
2dfeca9b | 2193 | seed_devices = alloc_fs_devices(NULL); |
2208a378 ID |
2194 | if (IS_ERR(seed_devices)) |
2195 | return PTR_ERR(seed_devices); | |
2b82032c | 2196 | |
e4404d6e YZ |
2197 | old_devices = clone_fs_devices(fs_devices); |
2198 | if (IS_ERR(old_devices)) { | |
2199 | kfree(seed_devices); | |
2200 | return PTR_ERR(old_devices); | |
2b82032c | 2201 | } |
e4404d6e | 2202 | |
c4babc5e | 2203 | list_add(&old_devices->fs_list, &fs_uuids); |
2b82032c | 2204 | |
e4404d6e YZ |
2205 | memcpy(seed_devices, fs_devices, sizeof(*seed_devices)); |
2206 | seed_devices->opened = 1; | |
2207 | INIT_LIST_HEAD(&seed_devices->devices); | |
2208 | INIT_LIST_HEAD(&seed_devices->alloc_list); | |
e5e9a520 | 2209 | mutex_init(&seed_devices->device_list_mutex); |
c9513edb | 2210 | |
321a4bf7 | 2211 | mutex_lock(&fs_devices->device_list_mutex); |
1f78160c XG |
2212 | list_splice_init_rcu(&fs_devices->devices, &seed_devices->devices, |
2213 | synchronize_rcu); | |
2196d6e8 MX |
2214 | list_for_each_entry(device, &seed_devices->devices, dev_list) |
2215 | device->fs_devices = seed_devices; | |
c9513edb | 2216 | |
34441361 | 2217 | mutex_lock(&fs_info->chunk_mutex); |
e4404d6e | 2218 | list_splice_init(&fs_devices->alloc_list, &seed_devices->alloc_list); |
34441361 | 2219 | mutex_unlock(&fs_info->chunk_mutex); |
e4404d6e | 2220 | |
2b82032c YZ |
2221 | fs_devices->seeding = 0; |
2222 | fs_devices->num_devices = 0; | |
2223 | fs_devices->open_devices = 0; | |
69611ac8 | 2224 | fs_devices->missing_devices = 0; |
69611ac8 | 2225 | fs_devices->rotating = 0; |
e4404d6e | 2226 | fs_devices->seed = seed_devices; |
2b82032c YZ |
2227 | |
2228 | generate_random_uuid(fs_devices->fsid); | |
0b246afa | 2229 | memcpy(fs_info->fsid, fs_devices->fsid, BTRFS_FSID_SIZE); |
2b82032c | 2230 | memcpy(disk_super->fsid, fs_devices->fsid, BTRFS_FSID_SIZE); |
321a4bf7 | 2231 | mutex_unlock(&fs_devices->device_list_mutex); |
f7171750 | 2232 | |
2b82032c YZ |
2233 | super_flags = btrfs_super_flags(disk_super) & |
2234 | ~BTRFS_SUPER_FLAG_SEEDING; | |
2235 | btrfs_set_super_flags(disk_super, super_flags); | |
2236 | ||
2237 | return 0; | |
2238 | } | |
2239 | ||
2240 | /* | |
01327610 | 2241 | * Store the expected generation for seed devices in device items. |
2b82032c YZ |
2242 | */ |
2243 | static int btrfs_finish_sprout(struct btrfs_trans_handle *trans, | |
5b4aacef | 2244 | struct btrfs_fs_info *fs_info) |
2b82032c | 2245 | { |
5b4aacef | 2246 | struct btrfs_root *root = fs_info->chunk_root; |
2b82032c YZ |
2247 | struct btrfs_path *path; |
2248 | struct extent_buffer *leaf; | |
2249 | struct btrfs_dev_item *dev_item; | |
2250 | struct btrfs_device *device; | |
2251 | struct btrfs_key key; | |
44880fdc | 2252 | u8 fs_uuid[BTRFS_FSID_SIZE]; |
2b82032c YZ |
2253 | u8 dev_uuid[BTRFS_UUID_SIZE]; |
2254 | u64 devid; | |
2255 | int ret; | |
2256 | ||
2257 | path = btrfs_alloc_path(); | |
2258 | if (!path) | |
2259 | return -ENOMEM; | |
2260 | ||
2b82032c YZ |
2261 | key.objectid = BTRFS_DEV_ITEMS_OBJECTID; |
2262 | key.offset = 0; | |
2263 | key.type = BTRFS_DEV_ITEM_KEY; | |
2264 | ||
2265 | while (1) { | |
2266 | ret = btrfs_search_slot(trans, root, &key, path, 0, 1); | |
2267 | if (ret < 0) | |
2268 | goto error; | |
2269 | ||
2270 | leaf = path->nodes[0]; | |
2271 | next_slot: | |
2272 | if (path->slots[0] >= btrfs_header_nritems(leaf)) { | |
2273 | ret = btrfs_next_leaf(root, path); | |
2274 | if (ret > 0) | |
2275 | break; | |
2276 | if (ret < 0) | |
2277 | goto error; | |
2278 | leaf = path->nodes[0]; | |
2279 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); | |
b3b4aa74 | 2280 | btrfs_release_path(path); |
2b82032c YZ |
2281 | continue; |
2282 | } | |
2283 | ||
2284 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); | |
2285 | if (key.objectid != BTRFS_DEV_ITEMS_OBJECTID || | |
2286 | key.type != BTRFS_DEV_ITEM_KEY) | |
2287 | break; | |
2288 | ||
2289 | dev_item = btrfs_item_ptr(leaf, path->slots[0], | |
2290 | struct btrfs_dev_item); | |
2291 | devid = btrfs_device_id(leaf, dev_item); | |
410ba3a2 | 2292 | read_extent_buffer(leaf, dev_uuid, btrfs_device_uuid(dev_item), |
2b82032c | 2293 | BTRFS_UUID_SIZE); |
1473b24e | 2294 | read_extent_buffer(leaf, fs_uuid, btrfs_device_fsid(dev_item), |
44880fdc | 2295 | BTRFS_FSID_SIZE); |
0b246afa | 2296 | device = btrfs_find_device(fs_info, devid, dev_uuid, fs_uuid); |
79787eaa | 2297 | BUG_ON(!device); /* Logic error */ |
2b82032c YZ |
2298 | |
2299 | if (device->fs_devices->seeding) { | |
2300 | btrfs_set_device_generation(leaf, dev_item, | |
2301 | device->generation); | |
2302 | btrfs_mark_buffer_dirty(leaf); | |
2303 | } | |
2304 | ||
2305 | path->slots[0]++; | |
2306 | goto next_slot; | |
2307 | } | |
2308 | ret = 0; | |
2309 | error: | |
2310 | btrfs_free_path(path); | |
2311 | return ret; | |
2312 | } | |
2313 | ||
da353f6b | 2314 | int btrfs_init_new_device(struct btrfs_fs_info *fs_info, const char *device_path) |
788f20eb | 2315 | { |
5112febb | 2316 | struct btrfs_root *root = fs_info->dev_root; |
d5e2003c | 2317 | struct request_queue *q; |
788f20eb CM |
2318 | struct btrfs_trans_handle *trans; |
2319 | struct btrfs_device *device; | |
2320 | struct block_device *bdev; | |
0b246afa | 2321 | struct super_block *sb = fs_info->sb; |
606686ee | 2322 | struct rcu_string *name; |
5da54bc1 | 2323 | struct btrfs_fs_devices *fs_devices = fs_info->fs_devices; |
39379faa NA |
2324 | u64 orig_super_total_bytes; |
2325 | u64 orig_super_num_devices; | |
2b82032c | 2326 | int seeding_dev = 0; |
788f20eb | 2327 | int ret = 0; |
7132a262 | 2328 | bool unlocked = false; |
788f20eb | 2329 | |
5da54bc1 | 2330 | if (sb_rdonly(sb) && !fs_devices->seeding) |
f8c5d0b4 | 2331 | return -EROFS; |
788f20eb | 2332 | |
a5d16333 | 2333 | bdev = blkdev_get_by_path(device_path, FMODE_WRITE | FMODE_EXCL, |
0b246afa | 2334 | fs_info->bdev_holder); |
7f59203a JB |
2335 | if (IS_ERR(bdev)) |
2336 | return PTR_ERR(bdev); | |
a2135011 | 2337 | |
5da54bc1 | 2338 | if (fs_devices->seeding) { |
2b82032c YZ |
2339 | seeding_dev = 1; |
2340 | down_write(&sb->s_umount); | |
2341 | mutex_lock(&uuid_mutex); | |
2342 | } | |
2343 | ||
8c8bee1d | 2344 | filemap_write_and_wait(bdev->bd_inode->i_mapping); |
a2135011 | 2345 | |
5da54bc1 | 2346 | mutex_lock(&fs_devices->device_list_mutex); |
694c51fb | 2347 | list_for_each_entry(device, &fs_devices->devices, dev_list) { |
788f20eb CM |
2348 | if (device->bdev == bdev) { |
2349 | ret = -EEXIST; | |
d25628bd | 2350 | mutex_unlock( |
5da54bc1 | 2351 | &fs_devices->device_list_mutex); |
2b82032c | 2352 | goto error; |
788f20eb CM |
2353 | } |
2354 | } | |
5da54bc1 | 2355 | mutex_unlock(&fs_devices->device_list_mutex); |
788f20eb | 2356 | |
0b246afa | 2357 | device = btrfs_alloc_device(fs_info, NULL, NULL); |
12bd2fc0 | 2358 | if (IS_ERR(device)) { |
788f20eb | 2359 | /* we can safely leave the fs_devices entry around */ |
12bd2fc0 | 2360 | ret = PTR_ERR(device); |
2b82032c | 2361 | goto error; |
788f20eb CM |
2362 | } |
2363 | ||
78f2c9e6 | 2364 | name = rcu_string_strdup(device_path, GFP_KERNEL); |
606686ee | 2365 | if (!name) { |
2b82032c | 2366 | ret = -ENOMEM; |
5c4cf6c9 | 2367 | goto error_free_device; |
788f20eb | 2368 | } |
606686ee | 2369 | rcu_assign_pointer(device->name, name); |
2b82032c | 2370 | |
a22285a6 | 2371 | trans = btrfs_start_transaction(root, 0); |
98d5dc13 | 2372 | if (IS_ERR(trans)) { |
98d5dc13 | 2373 | ret = PTR_ERR(trans); |
5c4cf6c9 | 2374 | goto error_free_device; |
98d5dc13 TI |
2375 | } |
2376 | ||
d5e2003c | 2377 | q = bdev_get_queue(bdev); |
ebbede42 | 2378 | set_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state); |
2b82032c | 2379 | device->generation = trans->transid; |
0b246afa JM |
2380 | device->io_width = fs_info->sectorsize; |
2381 | device->io_align = fs_info->sectorsize; | |
2382 | device->sector_size = fs_info->sectorsize; | |
7dfb8be1 NB |
2383 | device->total_bytes = round_down(i_size_read(bdev->bd_inode), |
2384 | fs_info->sectorsize); | |
2cc3c559 | 2385 | device->disk_total_bytes = device->total_bytes; |
935e5cc9 | 2386 | device->commit_total_bytes = device->total_bytes; |
fb456252 | 2387 | device->fs_info = fs_info; |
788f20eb | 2388 | device->bdev = bdev; |
e12c9621 | 2389 | set_bit(BTRFS_DEV_STATE_IN_FS_METADATA, &device->dev_state); |
401e29c1 | 2390 | clear_bit(BTRFS_DEV_STATE_REPLACE_TGT, &device->dev_state); |
fb01aa85 | 2391 | device->mode = FMODE_EXCL; |
27087f37 | 2392 | device->dev_stats_valid = 1; |
9f6d2510 | 2393 | set_blocksize(device->bdev, BTRFS_BDEV_BLOCKSIZE); |
788f20eb | 2394 | |
2b82032c | 2395 | if (seeding_dev) { |
1751e8a6 | 2396 | sb->s_flags &= ~SB_RDONLY; |
2ff7e61e | 2397 | ret = btrfs_prepare_sprout(fs_info); |
d31c32f6 AJ |
2398 | if (ret) { |
2399 | btrfs_abort_transaction(trans, ret); | |
2400 | goto error_trans; | |
2401 | } | |
2b82032c | 2402 | } |
788f20eb | 2403 | |
5da54bc1 | 2404 | device->fs_devices = fs_devices; |
e5e9a520 | 2405 | |
5da54bc1 | 2406 | mutex_lock(&fs_devices->device_list_mutex); |
34441361 | 2407 | mutex_lock(&fs_info->chunk_mutex); |
5da54bc1 AJ |
2408 | list_add_rcu(&device->dev_list, &fs_devices->devices); |
2409 | list_add(&device->dev_alloc_list, &fs_devices->alloc_list); | |
2410 | fs_devices->num_devices++; | |
2411 | fs_devices->open_devices++; | |
2412 | fs_devices->rw_devices++; | |
2413 | fs_devices->total_devices++; | |
2414 | fs_devices->total_rw_bytes += device->total_bytes; | |
325cd4ba | 2415 | |
a5ed45f8 | 2416 | atomic64_add(device->total_bytes, &fs_info->free_chunk_space); |
2bf64758 | 2417 | |
e884f4f0 | 2418 | if (!blk_queue_nonrot(q)) |
5da54bc1 | 2419 | fs_devices->rotating = 1; |
c289811c | 2420 | |
39379faa | 2421 | orig_super_total_bytes = btrfs_super_total_bytes(fs_info->super_copy); |
0b246afa | 2422 | btrfs_set_super_total_bytes(fs_info->super_copy, |
39379faa NA |
2423 | round_down(orig_super_total_bytes + device->total_bytes, |
2424 | fs_info->sectorsize)); | |
788f20eb | 2425 | |
39379faa NA |
2426 | orig_super_num_devices = btrfs_super_num_devices(fs_info->super_copy); |
2427 | btrfs_set_super_num_devices(fs_info->super_copy, | |
2428 | orig_super_num_devices + 1); | |
0d39376a AJ |
2429 | |
2430 | /* add sysfs device entry */ | |
5da54bc1 | 2431 | btrfs_sysfs_add_device_link(fs_devices, device); |
0d39376a | 2432 | |
2196d6e8 MX |
2433 | /* |
2434 | * we've got more storage, clear any full flags on the space | |
2435 | * infos | |
2436 | */ | |
0b246afa | 2437 | btrfs_clear_space_info_full(fs_info); |
2196d6e8 | 2438 | |
34441361 | 2439 | mutex_unlock(&fs_info->chunk_mutex); |
5da54bc1 | 2440 | mutex_unlock(&fs_devices->device_list_mutex); |
788f20eb | 2441 | |
2b82032c | 2442 | if (seeding_dev) { |
34441361 | 2443 | mutex_lock(&fs_info->chunk_mutex); |
e4a4dce7 | 2444 | ret = init_first_rw_device(trans, fs_info); |
34441361 | 2445 | mutex_unlock(&fs_info->chunk_mutex); |
005d6427 | 2446 | if (ret) { |
66642832 | 2447 | btrfs_abort_transaction(trans, ret); |
d31c32f6 | 2448 | goto error_sysfs; |
005d6427 | 2449 | } |
2196d6e8 MX |
2450 | } |
2451 | ||
8e87e856 | 2452 | ret = btrfs_add_dev_item(trans, device); |
2196d6e8 | 2453 | if (ret) { |
66642832 | 2454 | btrfs_abort_transaction(trans, ret); |
d31c32f6 | 2455 | goto error_sysfs; |
2196d6e8 MX |
2456 | } |
2457 | ||
2458 | if (seeding_dev) { | |
2459 | char fsid_buf[BTRFS_UUID_UNPARSED_SIZE]; | |
2460 | ||
0b246afa | 2461 | ret = btrfs_finish_sprout(trans, fs_info); |
005d6427 | 2462 | if (ret) { |
66642832 | 2463 | btrfs_abort_transaction(trans, ret); |
d31c32f6 | 2464 | goto error_sysfs; |
005d6427 | 2465 | } |
b2373f25 AJ |
2466 | |
2467 | /* Sprouting would change fsid of the mounted root, | |
2468 | * so rename the fsid on the sysfs | |
2469 | */ | |
2470 | snprintf(fsid_buf, BTRFS_UUID_UNPARSED_SIZE, "%pU", | |
0b246afa | 2471 | fs_info->fsid); |
5da54bc1 | 2472 | if (kobject_rename(&fs_devices->fsid_kobj, fsid_buf)) |
0b246afa JM |
2473 | btrfs_warn(fs_info, |
2474 | "sysfs: failed to create fsid for sprout"); | |
2b82032c YZ |
2475 | } |
2476 | ||
3a45bb20 | 2477 | ret = btrfs_commit_transaction(trans); |
a2135011 | 2478 | |
2b82032c YZ |
2479 | if (seeding_dev) { |
2480 | mutex_unlock(&uuid_mutex); | |
2481 | up_write(&sb->s_umount); | |
7132a262 | 2482 | unlocked = true; |
788f20eb | 2483 | |
79787eaa JM |
2484 | if (ret) /* transaction commit */ |
2485 | return ret; | |
2486 | ||
2ff7e61e | 2487 | ret = btrfs_relocate_sys_chunks(fs_info); |
79787eaa | 2488 | if (ret < 0) |
0b246afa | 2489 | btrfs_handle_fs_error(fs_info, ret, |
5d163e0e | 2490 | "Failed to relocate sys chunks after device initialization. This can be fixed using the \"btrfs balance\" command."); |
671415b7 MX |
2491 | trans = btrfs_attach_transaction(root); |
2492 | if (IS_ERR(trans)) { | |
2493 | if (PTR_ERR(trans) == -ENOENT) | |
2494 | return 0; | |
7132a262 AJ |
2495 | ret = PTR_ERR(trans); |
2496 | trans = NULL; | |
2497 | goto error_sysfs; | |
671415b7 | 2498 | } |
3a45bb20 | 2499 | ret = btrfs_commit_transaction(trans); |
2b82032c | 2500 | } |
c9e9f97b | 2501 | |
5a1972bd QW |
2502 | /* Update ctime/mtime for libblkid */ |
2503 | update_dev_time(device_path); | |
2b82032c | 2504 | return ret; |
79787eaa | 2505 | |
d31c32f6 | 2506 | error_sysfs: |
5da54bc1 | 2507 | btrfs_sysfs_rm_device_link(fs_devices, device); |
39379faa NA |
2508 | mutex_lock(&fs_info->fs_devices->device_list_mutex); |
2509 | mutex_lock(&fs_info->chunk_mutex); | |
2510 | list_del_rcu(&device->dev_list); | |
2511 | list_del(&device->dev_alloc_list); | |
2512 | fs_info->fs_devices->num_devices--; | |
2513 | fs_info->fs_devices->open_devices--; | |
2514 | fs_info->fs_devices->rw_devices--; | |
2515 | fs_info->fs_devices->total_devices--; | |
2516 | fs_info->fs_devices->total_rw_bytes -= device->total_bytes; | |
2517 | atomic64_sub(device->total_bytes, &fs_info->free_chunk_space); | |
2518 | btrfs_set_super_total_bytes(fs_info->super_copy, | |
2519 | orig_super_total_bytes); | |
2520 | btrfs_set_super_num_devices(fs_info->super_copy, | |
2521 | orig_super_num_devices); | |
2522 | mutex_unlock(&fs_info->chunk_mutex); | |
2523 | mutex_unlock(&fs_info->fs_devices->device_list_mutex); | |
79787eaa | 2524 | error_trans: |
0af2c4bf | 2525 | if (seeding_dev) |
1751e8a6 | 2526 | sb->s_flags |= SB_RDONLY; |
7132a262 AJ |
2527 | if (trans) |
2528 | btrfs_end_transaction(trans); | |
5c4cf6c9 | 2529 | error_free_device: |
a425f9d4 | 2530 | btrfs_free_device(device); |
2b82032c | 2531 | error: |
e525fd89 | 2532 | blkdev_put(bdev, FMODE_EXCL); |
7132a262 | 2533 | if (seeding_dev && !unlocked) { |
2b82032c YZ |
2534 | mutex_unlock(&uuid_mutex); |
2535 | up_write(&sb->s_umount); | |
2536 | } | |
c9e9f97b | 2537 | return ret; |
788f20eb CM |
2538 | } |
2539 | ||
d397712b CM |
2540 | static noinline int btrfs_update_device(struct btrfs_trans_handle *trans, |
2541 | struct btrfs_device *device) | |
0b86a832 CM |
2542 | { |
2543 | int ret; | |
2544 | struct btrfs_path *path; | |
0b246afa | 2545 | struct btrfs_root *root = device->fs_info->chunk_root; |
0b86a832 CM |
2546 | struct btrfs_dev_item *dev_item; |
2547 | struct extent_buffer *leaf; | |
2548 | struct btrfs_key key; | |
2549 | ||
0b86a832 CM |
2550 | path = btrfs_alloc_path(); |
2551 | if (!path) | |
2552 | return -ENOMEM; | |
2553 | ||
2554 | key.objectid = BTRFS_DEV_ITEMS_OBJECTID; | |
2555 | key.type = BTRFS_DEV_ITEM_KEY; | |
2556 | key.offset = device->devid; | |
2557 | ||
2558 | ret = btrfs_search_slot(trans, root, &key, path, 0, 1); | |
2559 | if (ret < 0) | |
2560 | goto out; | |
2561 | ||
2562 | if (ret > 0) { | |
2563 | ret = -ENOENT; | |
2564 | goto out; | |
2565 | } | |
2566 | ||
2567 | leaf = path->nodes[0]; | |
2568 | dev_item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_dev_item); | |
2569 | ||
2570 | btrfs_set_device_id(leaf, dev_item, device->devid); | |
2571 | btrfs_set_device_type(leaf, dev_item, device->type); | |
2572 | btrfs_set_device_io_align(leaf, dev_item, device->io_align); | |
2573 | btrfs_set_device_io_width(leaf, dev_item, device->io_width); | |
2574 | btrfs_set_device_sector_size(leaf, dev_item, device->sector_size); | |
7cc8e58d MX |
2575 | btrfs_set_device_total_bytes(leaf, dev_item, |
2576 | btrfs_device_get_disk_total_bytes(device)); | |
2577 | btrfs_set_device_bytes_used(leaf, dev_item, | |
2578 | btrfs_device_get_bytes_used(device)); | |
0b86a832 CM |
2579 | btrfs_mark_buffer_dirty(leaf); |
2580 | ||
2581 | out: | |
2582 | btrfs_free_path(path); | |
2583 | return ret; | |
2584 | } | |
2585 | ||
2196d6e8 | 2586 | int btrfs_grow_device(struct btrfs_trans_handle *trans, |
8f18cf13 CM |
2587 | struct btrfs_device *device, u64 new_size) |
2588 | { | |
0b246afa JM |
2589 | struct btrfs_fs_info *fs_info = device->fs_info; |
2590 | struct btrfs_super_block *super_copy = fs_info->super_copy; | |
935e5cc9 | 2591 | struct btrfs_fs_devices *fs_devices; |
2196d6e8 MX |
2592 | u64 old_total; |
2593 | u64 diff; | |
8f18cf13 | 2594 | |
ebbede42 | 2595 | if (!test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state)) |
2b82032c | 2596 | return -EACCES; |
2196d6e8 | 2597 | |
7dfb8be1 NB |
2598 | new_size = round_down(new_size, fs_info->sectorsize); |
2599 | ||
34441361 | 2600 | mutex_lock(&fs_info->chunk_mutex); |
2196d6e8 | 2601 | old_total = btrfs_super_total_bytes(super_copy); |
0e4324a4 | 2602 | diff = round_down(new_size - device->total_bytes, fs_info->sectorsize); |
2196d6e8 | 2603 | |
63a212ab | 2604 | if (new_size <= device->total_bytes || |
401e29c1 | 2605 | test_bit(BTRFS_DEV_STATE_REPLACE_TGT, &device->dev_state)) { |
34441361 | 2606 | mutex_unlock(&fs_info->chunk_mutex); |
2b82032c | 2607 | return -EINVAL; |
2196d6e8 | 2608 | } |
2b82032c | 2609 | |
0b246afa | 2610 | fs_devices = fs_info->fs_devices; |
2b82032c | 2611 | |
7dfb8be1 NB |
2612 | btrfs_set_super_total_bytes(super_copy, |
2613 | round_down(old_total + diff, fs_info->sectorsize)); | |
2b82032c YZ |
2614 | device->fs_devices->total_rw_bytes += diff; |
2615 | ||
7cc8e58d MX |
2616 | btrfs_device_set_total_bytes(device, new_size); |
2617 | btrfs_device_set_disk_total_bytes(device, new_size); | |
fb456252 | 2618 | btrfs_clear_space_info_full(device->fs_info); |
935e5cc9 MX |
2619 | if (list_empty(&device->resized_list)) |
2620 | list_add_tail(&device->resized_list, | |
2621 | &fs_devices->resized_devices); | |
34441361 | 2622 | mutex_unlock(&fs_info->chunk_mutex); |
4184ea7f | 2623 | |
8f18cf13 CM |
2624 | return btrfs_update_device(trans, device); |
2625 | } | |
2626 | ||
f4208794 | 2627 | static int btrfs_free_chunk(struct btrfs_trans_handle *trans, u64 chunk_offset) |
8f18cf13 | 2628 | { |
f4208794 | 2629 | struct btrfs_fs_info *fs_info = trans->fs_info; |
5b4aacef | 2630 | struct btrfs_root *root = fs_info->chunk_root; |
8f18cf13 CM |
2631 | int ret; |
2632 | struct btrfs_path *path; | |
2633 | struct btrfs_key key; | |
2634 | ||
8f18cf13 CM |
2635 | path = btrfs_alloc_path(); |
2636 | if (!path) | |
2637 | return -ENOMEM; | |
2638 | ||
408fbf19 | 2639 | key.objectid = BTRFS_FIRST_CHUNK_TREE_OBJECTID; |
8f18cf13 CM |
2640 | key.offset = chunk_offset; |
2641 | key.type = BTRFS_CHUNK_ITEM_KEY; | |
2642 | ||
2643 | ret = btrfs_search_slot(trans, root, &key, path, -1, 1); | |
79787eaa JM |
2644 | if (ret < 0) |
2645 | goto out; | |
2646 | else if (ret > 0) { /* Logic error or corruption */ | |
0b246afa JM |
2647 | btrfs_handle_fs_error(fs_info, -ENOENT, |
2648 | "Failed lookup while freeing chunk."); | |
79787eaa JM |
2649 | ret = -ENOENT; |
2650 | goto out; | |
2651 | } | |
8f18cf13 CM |
2652 | |
2653 | ret = btrfs_del_item(trans, root, path); | |
79787eaa | 2654 | if (ret < 0) |
0b246afa JM |
2655 | btrfs_handle_fs_error(fs_info, ret, |
2656 | "Failed to delete chunk item."); | |
79787eaa | 2657 | out: |
8f18cf13 | 2658 | btrfs_free_path(path); |
65a246c5 | 2659 | return ret; |
8f18cf13 CM |
2660 | } |
2661 | ||
408fbf19 | 2662 | static int btrfs_del_sys_chunk(struct btrfs_fs_info *fs_info, u64 chunk_offset) |
8f18cf13 | 2663 | { |
0b246afa | 2664 | struct btrfs_super_block *super_copy = fs_info->super_copy; |
8f18cf13 CM |
2665 | struct btrfs_disk_key *disk_key; |
2666 | struct btrfs_chunk *chunk; | |
2667 | u8 *ptr; | |
2668 | int ret = 0; | |
2669 | u32 num_stripes; | |
2670 | u32 array_size; | |
2671 | u32 len = 0; | |
2672 | u32 cur; | |
2673 | struct btrfs_key key; | |
2674 | ||
34441361 | 2675 | mutex_lock(&fs_info->chunk_mutex); |
8f18cf13 CM |
2676 | array_size = btrfs_super_sys_array_size(super_copy); |
2677 | ||
2678 | ptr = super_copy->sys_chunk_array; | |
2679 | cur = 0; | |
2680 | ||
2681 | while (cur < array_size) { | |
2682 | disk_key = (struct btrfs_disk_key *)ptr; | |
2683 | btrfs_disk_key_to_cpu(&key, disk_key); | |
2684 | ||
2685 | len = sizeof(*disk_key); | |
2686 | ||
2687 | if (key.type == BTRFS_CHUNK_ITEM_KEY) { | |
2688 | chunk = (struct btrfs_chunk *)(ptr + len); | |
2689 | num_stripes = btrfs_stack_chunk_num_stripes(chunk); | |
2690 | len += btrfs_chunk_item_size(num_stripes); | |
2691 | } else { | |
2692 | ret = -EIO; | |
2693 | break; | |
2694 | } | |
408fbf19 | 2695 | if (key.objectid == BTRFS_FIRST_CHUNK_TREE_OBJECTID && |
8f18cf13 CM |
2696 | key.offset == chunk_offset) { |
2697 | memmove(ptr, ptr + len, array_size - (cur + len)); | |
2698 | array_size -= len; | |
2699 | btrfs_set_super_sys_array_size(super_copy, array_size); | |
2700 | } else { | |
2701 | ptr += len; | |
2702 | cur += len; | |
2703 | } | |
2704 | } | |
34441361 | 2705 | mutex_unlock(&fs_info->chunk_mutex); |
8f18cf13 CM |
2706 | return ret; |
2707 | } | |
2708 | ||
592d92ee LB |
2709 | static struct extent_map *get_chunk_map(struct btrfs_fs_info *fs_info, |
2710 | u64 logical, u64 length) | |
2711 | { | |
2712 | struct extent_map_tree *em_tree; | |
2713 | struct extent_map *em; | |
2714 | ||
2715 | em_tree = &fs_info->mapping_tree.map_tree; | |
2716 | read_lock(&em_tree->lock); | |
2717 | em = lookup_extent_mapping(em_tree, logical, length); | |
2718 | read_unlock(&em_tree->lock); | |
2719 | ||
2720 | if (!em) { | |
2721 | btrfs_crit(fs_info, "unable to find logical %llu length %llu", | |
2722 | logical, length); | |
2723 | return ERR_PTR(-EINVAL); | |
2724 | } | |
2725 | ||
2726 | if (em->start > logical || em->start + em->len < logical) { | |
2727 | btrfs_crit(fs_info, | |
2728 | "found a bad mapping, wanted %llu-%llu, found %llu-%llu", | |
2729 | logical, length, em->start, em->start + em->len); | |
2730 | free_extent_map(em); | |
2731 | return ERR_PTR(-EINVAL); | |
2732 | } | |
2733 | ||
2734 | /* callers are responsible for dropping em's ref. */ | |
2735 | return em; | |
2736 | } | |
2737 | ||
97aff912 | 2738 | int btrfs_remove_chunk(struct btrfs_trans_handle *trans, u64 chunk_offset) |
8f18cf13 | 2739 | { |
97aff912 | 2740 | struct btrfs_fs_info *fs_info = trans->fs_info; |
8f18cf13 CM |
2741 | struct extent_map *em; |
2742 | struct map_lookup *map; | |
2196d6e8 | 2743 | u64 dev_extent_len = 0; |
47ab2a6c | 2744 | int i, ret = 0; |
0b246afa | 2745 | struct btrfs_fs_devices *fs_devices = fs_info->fs_devices; |
8f18cf13 | 2746 | |
592d92ee LB |
2747 | em = get_chunk_map(fs_info, chunk_offset, 1); |
2748 | if (IS_ERR(em)) { | |
47ab2a6c JB |
2749 | /* |
2750 | * This is a logic error, but we don't want to just rely on the | |
bb7ab3b9 | 2751 | * user having built with ASSERT enabled, so if ASSERT doesn't |
47ab2a6c JB |
2752 | * do anything we still error out. |
2753 | */ | |
2754 | ASSERT(0); | |
592d92ee | 2755 | return PTR_ERR(em); |
47ab2a6c | 2756 | } |
95617d69 | 2757 | map = em->map_lookup; |
34441361 | 2758 | mutex_lock(&fs_info->chunk_mutex); |
451a2c13 | 2759 | check_system_chunk(trans, map->type); |
34441361 | 2760 | mutex_unlock(&fs_info->chunk_mutex); |
8f18cf13 | 2761 | |
57ba4cb8 FM |
2762 | /* |
2763 | * Take the device list mutex to prevent races with the final phase of | |
2764 | * a device replace operation that replaces the device object associated | |
2765 | * with map stripes (dev-replace.c:btrfs_dev_replace_finishing()). | |
2766 | */ | |
2767 | mutex_lock(&fs_devices->device_list_mutex); | |
8f18cf13 | 2768 | for (i = 0; i < map->num_stripes; i++) { |
47ab2a6c | 2769 | struct btrfs_device *device = map->stripes[i].dev; |
2196d6e8 MX |
2770 | ret = btrfs_free_dev_extent(trans, device, |
2771 | map->stripes[i].physical, | |
2772 | &dev_extent_len); | |
47ab2a6c | 2773 | if (ret) { |
57ba4cb8 | 2774 | mutex_unlock(&fs_devices->device_list_mutex); |
66642832 | 2775 | btrfs_abort_transaction(trans, ret); |
47ab2a6c JB |
2776 | goto out; |
2777 | } | |
a061fc8d | 2778 | |
2196d6e8 | 2779 | if (device->bytes_used > 0) { |
34441361 | 2780 | mutex_lock(&fs_info->chunk_mutex); |
2196d6e8 MX |
2781 | btrfs_device_set_bytes_used(device, |
2782 | device->bytes_used - dev_extent_len); | |
a5ed45f8 | 2783 | atomic64_add(dev_extent_len, &fs_info->free_chunk_space); |
0b246afa | 2784 | btrfs_clear_space_info_full(fs_info); |
34441361 | 2785 | mutex_unlock(&fs_info->chunk_mutex); |
2196d6e8 | 2786 | } |
a061fc8d | 2787 | |
dfe25020 CM |
2788 | if (map->stripes[i].dev) { |
2789 | ret = btrfs_update_device(trans, map->stripes[i].dev); | |
47ab2a6c | 2790 | if (ret) { |
57ba4cb8 | 2791 | mutex_unlock(&fs_devices->device_list_mutex); |
66642832 | 2792 | btrfs_abort_transaction(trans, ret); |
47ab2a6c JB |
2793 | goto out; |
2794 | } | |
dfe25020 | 2795 | } |
8f18cf13 | 2796 | } |
57ba4cb8 FM |
2797 | mutex_unlock(&fs_devices->device_list_mutex); |
2798 | ||
f4208794 | 2799 | ret = btrfs_free_chunk(trans, chunk_offset); |
47ab2a6c | 2800 | if (ret) { |
66642832 | 2801 | btrfs_abort_transaction(trans, ret); |
47ab2a6c JB |
2802 | goto out; |
2803 | } | |
8f18cf13 | 2804 | |
6bccf3ab | 2805 | trace_btrfs_chunk_free(fs_info, map, chunk_offset, em->len); |
1abe9b8a | 2806 | |
8f18cf13 | 2807 | if (map->type & BTRFS_BLOCK_GROUP_SYSTEM) { |
408fbf19 | 2808 | ret = btrfs_del_sys_chunk(fs_info, chunk_offset); |
47ab2a6c | 2809 | if (ret) { |
66642832 | 2810 | btrfs_abort_transaction(trans, ret); |
47ab2a6c JB |
2811 | goto out; |
2812 | } | |
8f18cf13 CM |
2813 | } |
2814 | ||
5a98ec01 | 2815 | ret = btrfs_remove_block_group(trans, chunk_offset, em); |
47ab2a6c | 2816 | if (ret) { |
66642832 | 2817 | btrfs_abort_transaction(trans, ret); |
47ab2a6c JB |
2818 | goto out; |
2819 | } | |
2b82032c | 2820 | |
47ab2a6c | 2821 | out: |
2b82032c YZ |
2822 | /* once for us */ |
2823 | free_extent_map(em); | |
47ab2a6c JB |
2824 | return ret; |
2825 | } | |
2b82032c | 2826 | |
5b4aacef | 2827 | static int btrfs_relocate_chunk(struct btrfs_fs_info *fs_info, u64 chunk_offset) |
47ab2a6c | 2828 | { |
5b4aacef | 2829 | struct btrfs_root *root = fs_info->chunk_root; |
19c4d2f9 | 2830 | struct btrfs_trans_handle *trans; |
47ab2a6c | 2831 | int ret; |
2b82032c | 2832 | |
67c5e7d4 FM |
2833 | /* |
2834 | * Prevent races with automatic removal of unused block groups. | |
2835 | * After we relocate and before we remove the chunk with offset | |
2836 | * chunk_offset, automatic removal of the block group can kick in, | |
2837 | * resulting in a failure when calling btrfs_remove_chunk() below. | |
2838 | * | |
2839 | * Make sure to acquire this mutex before doing a tree search (dev | |
2840 | * or chunk trees) to find chunks. Otherwise the cleaner kthread might | |
2841 | * call btrfs_remove_chunk() (through btrfs_delete_unused_bgs()) after | |
2842 | * we release the path used to search the chunk/dev tree and before | |
2843 | * the current task acquires this mutex and calls us. | |
2844 | */ | |
a32bf9a3 | 2845 | lockdep_assert_held(&fs_info->delete_unused_bgs_mutex); |
67c5e7d4 | 2846 | |
0b246afa | 2847 | ret = btrfs_can_relocate(fs_info, chunk_offset); |
47ab2a6c JB |
2848 | if (ret) |
2849 | return -ENOSPC; | |
2850 | ||
2851 | /* step one, relocate all the extents inside this chunk */ | |
2ff7e61e | 2852 | btrfs_scrub_pause(fs_info); |
0b246afa | 2853 | ret = btrfs_relocate_block_group(fs_info, chunk_offset); |
2ff7e61e | 2854 | btrfs_scrub_continue(fs_info); |
47ab2a6c JB |
2855 | if (ret) |
2856 | return ret; | |
2857 | ||
75cb379d JM |
2858 | /* |
2859 | * We add the kobjects here (and after forcing data chunk creation) | |
2860 | * since relocation is the only place we'll create chunks of a new | |
2861 | * type at runtime. The only place where we'll remove the last | |
2862 | * chunk of a type is the call immediately below this one. Even | |
2863 | * so, we're protected against races with the cleaner thread since | |
2864 | * we're covered by the delete_unused_bgs_mutex. | |
2865 | */ | |
2866 | btrfs_add_raid_kobjects(fs_info); | |
2867 | ||
19c4d2f9 CM |
2868 | trans = btrfs_start_trans_remove_block_group(root->fs_info, |
2869 | chunk_offset); | |
2870 | if (IS_ERR(trans)) { | |
2871 | ret = PTR_ERR(trans); | |
2872 | btrfs_handle_fs_error(root->fs_info, ret, NULL); | |
2873 | return ret; | |
2874 | } | |
2875 | ||
47ab2a6c | 2876 | /* |
19c4d2f9 CM |
2877 | * step two, delete the device extents and the |
2878 | * chunk tree entries | |
47ab2a6c | 2879 | */ |
97aff912 | 2880 | ret = btrfs_remove_chunk(trans, chunk_offset); |
3a45bb20 | 2881 | btrfs_end_transaction(trans); |
19c4d2f9 | 2882 | return ret; |
2b82032c YZ |
2883 | } |
2884 | ||
2ff7e61e | 2885 | static int btrfs_relocate_sys_chunks(struct btrfs_fs_info *fs_info) |
2b82032c | 2886 | { |
0b246afa | 2887 | struct btrfs_root *chunk_root = fs_info->chunk_root; |
2b82032c YZ |
2888 | struct btrfs_path *path; |
2889 | struct extent_buffer *leaf; | |
2890 | struct btrfs_chunk *chunk; | |
2891 | struct btrfs_key key; | |
2892 | struct btrfs_key found_key; | |
2b82032c | 2893 | u64 chunk_type; |
ba1bf481 JB |
2894 | bool retried = false; |
2895 | int failed = 0; | |
2b82032c YZ |
2896 | int ret; |
2897 | ||
2898 | path = btrfs_alloc_path(); | |
2899 | if (!path) | |
2900 | return -ENOMEM; | |
2901 | ||
ba1bf481 | 2902 | again: |
2b82032c YZ |
2903 | key.objectid = BTRFS_FIRST_CHUNK_TREE_OBJECTID; |
2904 | key.offset = (u64)-1; | |
2905 | key.type = BTRFS_CHUNK_ITEM_KEY; | |
2906 | ||
2907 | while (1) { | |
0b246afa | 2908 | mutex_lock(&fs_info->delete_unused_bgs_mutex); |
2b82032c | 2909 | ret = btrfs_search_slot(NULL, chunk_root, &key, path, 0, 0); |
67c5e7d4 | 2910 | if (ret < 0) { |
0b246afa | 2911 | mutex_unlock(&fs_info->delete_unused_bgs_mutex); |
2b82032c | 2912 | goto error; |
67c5e7d4 | 2913 | } |
79787eaa | 2914 | BUG_ON(ret == 0); /* Corruption */ |
2b82032c YZ |
2915 | |
2916 | ret = btrfs_previous_item(chunk_root, path, key.objectid, | |
2917 | key.type); | |
67c5e7d4 | 2918 | if (ret) |
0b246afa | 2919 | mutex_unlock(&fs_info->delete_unused_bgs_mutex); |
2b82032c YZ |
2920 | if (ret < 0) |
2921 | goto error; | |
2922 | if (ret > 0) | |
2923 | break; | |
1a40e23b | 2924 | |
2b82032c YZ |
2925 | leaf = path->nodes[0]; |
2926 | btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); | |
1a40e23b | 2927 | |
2b82032c YZ |
2928 | chunk = btrfs_item_ptr(leaf, path->slots[0], |
2929 | struct btrfs_chunk); | |
2930 | chunk_type = btrfs_chunk_type(leaf, chunk); | |
b3b4aa74 | 2931 | btrfs_release_path(path); |
8f18cf13 | 2932 | |
2b82032c | 2933 | if (chunk_type & BTRFS_BLOCK_GROUP_SYSTEM) { |
0b246afa | 2934 | ret = btrfs_relocate_chunk(fs_info, found_key.offset); |
ba1bf481 JB |
2935 | if (ret == -ENOSPC) |
2936 | failed++; | |
14586651 HS |
2937 | else |
2938 | BUG_ON(ret); | |
2b82032c | 2939 | } |
0b246afa | 2940 | mutex_unlock(&fs_info->delete_unused_bgs_mutex); |
8f18cf13 | 2941 | |
2b82032c YZ |
2942 | if (found_key.offset == 0) |
2943 | break; | |
2944 | key.offset = found_key.offset - 1; | |
2945 | } | |
2946 | ret = 0; | |
ba1bf481 JB |
2947 | if (failed && !retried) { |
2948 | failed = 0; | |
2949 | retried = true; | |
2950 | goto again; | |
fae7f21c | 2951 | } else if (WARN_ON(failed && retried)) { |
ba1bf481 JB |
2952 | ret = -ENOSPC; |
2953 | } | |
2b82032c YZ |
2954 | error: |
2955 | btrfs_free_path(path); | |
2956 | return ret; | |
8f18cf13 CM |
2957 | } |
2958 | ||
a6f93c71 LB |
2959 | /* |
2960 | * return 1 : allocate a data chunk successfully, | |
2961 | * return <0: errors during allocating a data chunk, | |
2962 | * return 0 : no need to allocate a data chunk. | |
2963 | */ | |
2964 | static int btrfs_may_alloc_data_chunk(struct btrfs_fs_info *fs_info, | |
2965 | u64 chunk_offset) | |
2966 | { | |
2967 | struct btrfs_block_group_cache *cache; | |
2968 | u64 bytes_used; | |
2969 | u64 chunk_type; | |
2970 | ||
2971 | cache = btrfs_lookup_block_group(fs_info, chunk_offset); | |
2972 | ASSERT(cache); | |
2973 | chunk_type = cache->flags; | |
2974 | btrfs_put_block_group(cache); | |
2975 | ||
2976 | if (chunk_type & BTRFS_BLOCK_GROUP_DATA) { | |
2977 | spin_lock(&fs_info->data_sinfo->lock); | |
2978 | bytes_used = fs_info->data_sinfo->bytes_used; | |
2979 | spin_unlock(&fs_info->data_sinfo->lock); | |
2980 | ||
2981 | if (!bytes_used) { | |
2982 | struct btrfs_trans_handle *trans; | |
2983 | int ret; | |
2984 | ||
2985 | trans = btrfs_join_transaction(fs_info->tree_root); | |
2986 | if (IS_ERR(trans)) | |
2987 | return PTR_ERR(trans); | |
2988 | ||
43a7e99d | 2989 | ret = btrfs_force_chunk_alloc(trans, |
a6f93c71 LB |
2990 | BTRFS_BLOCK_GROUP_DATA); |
2991 | btrfs_end_transaction(trans); | |
2992 | if (ret < 0) | |
2993 | return ret; | |
2994 | ||
75cb379d JM |
2995 | btrfs_add_raid_kobjects(fs_info); |
2996 | ||
a6f93c71 LB |
2997 | return 1; |
2998 | } | |
2999 | } | |
3000 | return 0; | |
3001 | } | |
3002 | ||
6bccf3ab | 3003 | static int insert_balance_item(struct btrfs_fs_info *fs_info, |
0940ebf6 ID |
3004 | struct btrfs_balance_control *bctl) |
3005 | { | |
6bccf3ab | 3006 | struct btrfs_root *root = fs_info->tree_root; |
0940ebf6 ID |
3007 | struct btrfs_trans_handle *trans; |
3008 | struct btrfs_balance_item *item; | |
3009 | struct btrfs_disk_balance_args disk_bargs; | |
3010 | struct btrfs_path *path; | |
3011 | struct extent_buffer *leaf; | |
3012 | struct btrfs_key key; | |
3013 | int ret, err; | |
3014 | ||
3015 | path = btrfs_alloc_path(); | |
3016 | if (!path) | |
3017 | return -ENOMEM; | |
3018 | ||
3019 | trans = btrfs_start_transaction(root, 0); | |
3020 | if (IS_ERR(trans)) { | |
3021 | btrfs_free_path(path); | |
3022 | return PTR_ERR(trans); | |
3023 | } | |
3024 | ||
3025 | key.objectid = BTRFS_BALANCE_OBJECTID; | |
c479cb4f | 3026 | key.type = BTRFS_TEMPORARY_ITEM_KEY; |
0940ebf6 ID |
3027 | key.offset = 0; |
3028 | ||
3029 | ret = btrfs_insert_empty_item(trans, root, path, &key, | |
3030 | sizeof(*item)); | |
3031 | if (ret) | |
3032 | goto out; | |
3033 | ||
3034 | leaf = path->nodes[0]; | |
3035 | item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_balance_item); | |
3036 | ||
b159fa28 | 3037 | memzero_extent_buffer(leaf, (unsigned long)item, sizeof(*item)); |
0940ebf6 ID |
3038 | |
3039 | btrfs_cpu_balance_args_to_disk(&disk_bargs, &bctl->data); | |
3040 | btrfs_set_balance_data(leaf, item, &disk_bargs); | |
3041 | btrfs_cpu_balance_args_to_disk(&disk_bargs, &bctl->meta); | |
3042 | btrfs_set_balance_meta(leaf, item, &disk_bargs); | |
3043 | btrfs_cpu_balance_args_to_disk(&disk_bargs, &bctl->sys); | |
3044 | btrfs_set_balance_sys(leaf, item, &disk_bargs); | |
3045 | ||
3046 | btrfs_set_balance_flags(leaf, item, bctl->flags); | |
3047 | ||
3048 | btrfs_mark_buffer_dirty(leaf); | |
3049 | out: | |
3050 | btrfs_free_path(path); | |
3a45bb20 | 3051 | err = btrfs_commit_transaction(trans); |
0940ebf6 ID |
3052 | if (err && !ret) |
3053 | ret = err; | |
3054 | return ret; | |
3055 | } | |
3056 | ||
6bccf3ab | 3057 | static int del_balance_item(struct btrfs_fs_info *fs_info) |
0940ebf6 | 3058 | { |
6bccf3ab | 3059 | struct btrfs_root *root = fs_info->tree_root; |
0940ebf6 ID |
3060 | struct btrfs_trans_handle *trans; |
3061 | struct btrfs_path *path; | |
3062 | struct btrfs_key key; | |
3063 | int ret, err; | |
3064 | ||
3065 | path = btrfs_alloc_path(); | |
3066 | if (!path) | |
3067 | return -ENOMEM; | |
3068 | ||
3069 | trans = btrfs_start_transaction(root, 0); | |
3070 | if (IS_ERR(trans)) { | |
3071 | btrfs_free_path(path); | |
3072 | return PTR_ERR(trans); | |
3073 | } | |
3074 | ||
3075 | key.objectid = BTRFS_BALANCE_OBJECTID; | |
c479cb4f | 3076 | key.type = BTRFS_TEMPORARY_ITEM_KEY; |
0940ebf6 ID |
3077 | key.offset = 0; |
3078 | ||
3079 | ret = btrfs_search_slot(trans, root, &key, path, -1, 1); | |
3080 | if (ret < 0) | |
3081 | goto out; | |
3082 | if (ret > 0) { | |
3083 | ret = -ENOENT; | |
3084 | goto out; | |
3085 | } | |
3086 | ||
3087 | ret = btrfs_del_item(trans, root, path); | |
3088 | out: | |
3089 | btrfs_free_path(path); | |
3a45bb20 | 3090 | err = btrfs_commit_transaction(trans); |
0940ebf6 ID |
3091 | if (err && !ret) |
3092 | ret = err; | |
3093 | return ret; | |
3094 | } | |
3095 | ||
59641015 ID |
3096 | /* |
3097 | * This is a heuristic used to reduce the number of chunks balanced on | |
3098 | * resume after balance was interrupted. | |
3099 | */ | |
3100 | static void update_balance_args(struct btrfs_balance_control *bctl) | |
3101 | { | |
3102 | /* | |
3103 | * Turn on soft mode for chunk types that were being converted. | |
3104 | */ | |
3105 | if (bctl->data.flags & BTRFS_BALANCE_ARGS_CONVERT) | |
3106 | bctl->data.flags |= BTRFS_BALANCE_ARGS_SOFT; | |
3107 | if (bctl->sys.flags & BTRFS_BALANCE_ARGS_CONVERT) | |
3108 | bctl->sys.flags |= BTRFS_BALANCE_ARGS_SOFT; | |
3109 | if (bctl->meta.flags & BTRFS_BALANCE_ARGS_CONVERT) | |
3110 | bctl->meta.flags |= BTRFS_BALANCE_ARGS_SOFT; | |
3111 | ||
3112 | /* | |
3113 | * Turn on usage filter if is not already used. The idea is | |
3114 | * that chunks that we have already balanced should be | |
3115 | * reasonably full. Don't do it for chunks that are being | |
3116 | * converted - that will keep us from relocating unconverted | |
3117 | * (albeit full) chunks. | |
3118 | */ | |
3119 | if (!(bctl->data.flags & BTRFS_BALANCE_ARGS_USAGE) && | |
bc309467 | 3120 | !(bctl->data.flags & BTRFS_BALANCE_ARGS_USAGE_RANGE) && |
59641015 ID |
3121 | !(bctl->data.flags & BTRFS_BALANCE_ARGS_CONVERT)) { |
3122 | bctl->data.flags |= BTRFS_BALANCE_ARGS_USAGE; | |
3123 | bctl->data.usage = 90; | |
3124 | } | |
3125 | if (!(bctl->sys.flags & BTRFS_BALANCE_ARGS_USAGE) && | |
bc309467 | 3126 | !(bctl->sys.flags & BTRFS_BALANCE_ARGS_USAGE_RANGE) && |
59641015 ID |
3127 | !(bctl->sys.flags & BTRFS_BALANCE_ARGS_CONVERT)) { |
3128 | bctl->sys.flags |= BTRFS_BALANCE_ARGS_USAGE; | |
3129 | bctl->sys.usage = 90; | |
3130 | } | |
3131 | if (!(bctl->meta.flags & BTRFS_BALANCE_ARGS_USAGE) && | |
bc309467 | 3132 | !(bctl->meta.flags & BTRFS_BALANCE_ARGS_USAGE_RANGE) && |
59641015 ID |
3133 | !(bctl->meta.flags & BTRFS_BALANCE_ARGS_CONVERT)) { |
3134 | bctl->meta.flags |= BTRFS_BALANCE_ARGS_USAGE; | |
3135 | bctl->meta.usage = 90; | |
3136 | } | |
3137 | } | |
3138 | ||
149196a2 DS |
3139 | /* |
3140 | * Clear the balance status in fs_info and delete the balance item from disk. | |
3141 | */ | |
3142 | static void reset_balance_state(struct btrfs_fs_info *fs_info) | |
c9e9f97b ID |
3143 | { |
3144 | struct btrfs_balance_control *bctl = fs_info->balance_ctl; | |
149196a2 | 3145 | int ret; |
c9e9f97b ID |
3146 | |
3147 | BUG_ON(!fs_info->balance_ctl); | |
3148 | ||
3149 | spin_lock(&fs_info->balance_lock); | |
3150 | fs_info->balance_ctl = NULL; | |
3151 | spin_unlock(&fs_info->balance_lock); | |
3152 | ||
3153 | kfree(bctl); | |
149196a2 DS |
3154 | ret = del_balance_item(fs_info); |
3155 | if (ret) | |
3156 | btrfs_handle_fs_error(fs_info, ret, NULL); | |
c9e9f97b ID |
3157 | } |
3158 | ||
ed25e9b2 ID |
3159 | /* |
3160 | * Balance filters. Return 1 if chunk should be filtered out | |
3161 | * (should not be balanced). | |
3162 | */ | |
899c81ea | 3163 | static int chunk_profiles_filter(u64 chunk_type, |
ed25e9b2 ID |
3164 | struct btrfs_balance_args *bargs) |
3165 | { | |
899c81ea ID |
3166 | chunk_type = chunk_to_extended(chunk_type) & |
3167 | BTRFS_EXTENDED_PROFILE_MASK; | |
ed25e9b2 | 3168 | |
899c81ea | 3169 | if (bargs->profiles & chunk_type) |
ed25e9b2 ID |
3170 | return 0; |
3171 | ||
3172 | return 1; | |
3173 | } | |
3174 | ||
dba72cb3 | 3175 | static int chunk_usage_range_filter(struct btrfs_fs_info *fs_info, u64 chunk_offset, |
5ce5b3c0 | 3176 | struct btrfs_balance_args *bargs) |
bc309467 DS |
3177 | { |
3178 | struct btrfs_block_group_cache *cache; | |
3179 | u64 chunk_used; | |
3180 | u64 user_thresh_min; | |
3181 | u64 user_thresh_max; | |
3182 | int ret = 1; | |
3183 | ||
3184 | cache = btrfs_lookup_block_group(fs_info, chunk_offset); | |
3185 | chunk_used = btrfs_block_group_used(&cache->item); | |
3186 | ||
3187 | if (bargs->usage_min == 0) | |
3188 | user_thresh_min = 0; | |
3189 | else | |
3190 | user_thresh_min = div_factor_fine(cache->key.offset, | |
3191 | bargs->usage_min); | |
3192 | ||
3193 | if (bargs->usage_max == 0) | |
3194 | user_thresh_max = 1; | |
3195 | else if (bargs->usage_max > 100) | |
3196 | user_thresh_max = cache->key.offset; | |
3197 | else | |
3198 | user_thresh_max = div_factor_fine(cache->key.offset, | |
3199 | bargs->usage_max); | |
3200 | ||
3201 | if (user_thresh_min <= chunk_used && chunk_used < user_thresh_max) | |
3202 | ret = 0; | |
3203 | ||
3204 | btrfs_put_block_group(cache); | |
3205 | return ret; | |
3206 | } | |
3207 | ||
dba72cb3 | 3208 | static int chunk_usage_filter(struct btrfs_fs_info *fs_info, |
bc309467 | 3209 | u64 chunk_offset, struct btrfs_balance_args *bargs) |
5ce5b3c0 ID |
3210 | { |
3211 | struct btrfs_block_group_cache *cache; | |
3212 | u64 chunk_used, user_thresh; | |
3213 | int ret = 1; | |
3214 | ||
3215 | cache = btrfs_lookup_block_group(fs_info, chunk_offset); | |
3216 | chunk_used = btrfs_block_group_used(&cache->item); | |
3217 | ||
bc309467 | 3218 | if (bargs->usage_min == 0) |
3e39cea6 | 3219 | user_thresh = 1; |
a105bb88 ID |
3220 | else if (bargs->usage > 100) |
3221 | user_thresh = cache->key.offset; | |
3222 | else | |
3223 | user_thresh = div_factor_fine(cache->key.offset, | |
3224 | bargs->usage); | |
3225 | ||
5ce5b3c0 ID |
3226 | if (chunk_used < user_thresh) |
3227 | ret = 0; | |
3228 | ||
3229 | btrfs_put_block_group(cache); | |
3230 | return ret; | |
3231 | } | |
3232 | ||
409d404b ID |
3233 | static int chunk_devid_filter(struct extent_buffer *leaf, |
3234 | struct btrfs_chunk *chunk, | |
3235 | struct btrfs_balance_args *bargs) | |
3236 | { | |
3237 | struct btrfs_stripe *stripe; | |
3238 | int num_stripes = btrfs_chunk_num_stripes(leaf, chunk); | |
3239 | int i; | |
3240 | ||
3241 | for (i = 0; i < num_stripes; i++) { | |
3242 | stripe = btrfs_stripe_nr(chunk, i); | |
3243 | if (btrfs_stripe_devid(leaf, stripe) == bargs->devid) | |
3244 | return 0; | |
3245 | } | |
3246 | ||
3247 | return 1; | |
3248 | } | |
3249 | ||
94e60d5a ID |
3250 | /* [pstart, pend) */ |
3251 | static int chunk_drange_filter(struct extent_buffer *leaf, | |
3252 | struct btrfs_chunk *chunk, | |
94e60d5a ID |
3253 | struct btrfs_balance_args *bargs) |
3254 | { | |
3255 | struct btrfs_stripe *stripe; | |
3256 | int num_stripes = btrfs_chunk_num_stripes(leaf, chunk); | |
3257 | u64 stripe_offset; | |
3258 | u64 stripe_length; | |
3259 | int factor; | |
3260 | int i; | |
3261 | ||
3262 | if (!(bargs->flags & BTRFS_BALANCE_ARGS_DEVID)) | |
3263 | return 0; | |
3264 | ||
3265 | if (btrfs_chunk_type(leaf, chunk) & (BTRFS_BLOCK_GROUP_DUP | | |
53b381b3 DW |
3266 | BTRFS_BLOCK_GROUP_RAID1 | BTRFS_BLOCK_GROUP_RAID10)) { |
3267 | factor = num_stripes / 2; | |
3268 | } else if (btrfs_chunk_type(leaf, chunk) & BTRFS_BLOCK_GROUP_RAID5) { | |
3269 | factor = num_stripes - 1; | |
3270 | } else if (btrfs_chunk_type(leaf, chunk) & BTRFS_BLOCK_GROUP_RAID6) { | |
3271 | factor = num_stripes - 2; | |
3272 | } else { | |
3273 | factor = num_stripes; | |
3274 | } | |
94e60d5a ID |
3275 | |
3276 | for (i = 0; i < num_stripes; i++) { | |
3277 | stripe = btrfs_stripe_nr(chunk, i); | |
3278 | if (btrfs_stripe_devid(leaf, stripe) != bargs->devid) | |
3279 | continue; | |
3280 | ||
3281 | stripe_offset = btrfs_stripe_offset(leaf, stripe); | |
3282 | stripe_length = btrfs_chunk_length(leaf, chunk); | |
b8b93add | 3283 | stripe_length = div_u64(stripe_length, factor); |
94e60d5a ID |
3284 | |
3285 | if (stripe_offset < bargs->pend && | |
3286 | stripe_offset + stripe_length > bargs->pstart) | |
3287 | return 0; | |
3288 | } | |
3289 | ||
3290 | return 1; | |
3291 | } | |
3292 | ||
ea67176a ID |
3293 | /* [vstart, vend) */ |
3294 | static int chunk_vrange_filter(struct extent_buffer *leaf, | |
3295 | struct btrfs_chunk *chunk, | |
3296 | u64 chunk_offset, | |
3297 | struct btrfs_balance_args *bargs) | |
3298 | { | |
3299 | if (chunk_offset < bargs->vend && | |
3300 | chunk_offset + btrfs_chunk_length(leaf, chunk) > bargs->vstart) | |
3301 | /* at least part of the chunk is inside this vrange */ | |
3302 | return 0; | |
3303 | ||
3304 | return 1; | |
3305 | } | |
3306 | ||
dee32d0a GAP |
3307 | static int chunk_stripes_range_filter(struct extent_buffer *leaf, |
3308 | struct btrfs_chunk *chunk, | |
3309 | struct btrfs_balance_args *bargs) | |
3310 | { | |
3311 | int num_stripes = btrfs_chunk_num_stripes(leaf, chunk); | |
3312 | ||
3313 | if (bargs->stripes_min <= num_stripes | |
3314 | && num_stripes <= bargs->stripes_max) | |
3315 | return 0; | |
3316 | ||
3317 | return 1; | |
3318 | } | |
3319 | ||
899c81ea | 3320 | static int chunk_soft_convert_filter(u64 chunk_type, |
cfa4c961 ID |
3321 | struct btrfs_balance_args *bargs) |
3322 | { | |
3323 | if (!(bargs->flags & BTRFS_BALANCE_ARGS_CONVERT)) | |
3324 | return 0; | |
3325 | ||
899c81ea ID |
3326 | chunk_type = chunk_to_extended(chunk_type) & |
3327 | BTRFS_EXTENDED_PROFILE_MASK; | |
cfa4c961 | 3328 | |
899c81ea | 3329 | if (bargs->target == chunk_type) |
cfa4c961 ID |
3330 | return 1; |
3331 | ||
3332 | return 0; | |
3333 | } | |
3334 | ||
2ff7e61e | 3335 | static int should_balance_chunk(struct btrfs_fs_info *fs_info, |
f43ffb60 ID |
3336 | struct extent_buffer *leaf, |
3337 | struct btrfs_chunk *chunk, u64 chunk_offset) | |
3338 | { | |
0b246afa | 3339 | struct btrfs_balance_control *bctl = fs_info->balance_ctl; |
f43ffb60 ID |
3340 | struct btrfs_balance_args *bargs = NULL; |
3341 | u64 chunk_type = btrfs_chunk_type(leaf, chunk); | |
3342 | ||
3343 | /* type filter */ | |
3344 | if (!((chunk_type & BTRFS_BLOCK_GROUP_TYPE_MASK) & | |
3345 | (bctl->flags & BTRFS_BALANCE_TYPE_MASK))) { | |
3346 | return 0; | |
3347 | } | |
3348 | ||
3349 | if (chunk_type & BTRFS_BLOCK_GROUP_DATA) | |
3350 | bargs = &bctl->data; | |
3351 | else if (chunk_type & BTRFS_BLOCK_GROUP_SYSTEM) | |
3352 | bargs = &bctl->sys; | |
3353 | else if (chunk_type & BTRFS_BLOCK_GROUP_METADATA) | |
3354 | bargs = &bctl->meta; | |
3355 | ||
ed25e9b2 ID |
3356 | /* profiles filter */ |
3357 | if ((bargs->flags & BTRFS_BALANCE_ARGS_PROFILES) && | |
3358 | chunk_profiles_filter(chunk_type, bargs)) { | |
3359 | return 0; | |
5ce5b3c0 ID |
3360 | } |
3361 | ||
3362 | /* usage filter */ | |
3363 | if ((bargs->flags & BTRFS_BALANCE_ARGS_USAGE) && | |
0b246afa | 3364 | chunk_usage_filter(fs_info, chunk_offset, bargs)) { |
5ce5b3c0 | 3365 | return 0; |
bc309467 | 3366 | } else if ((bargs->flags & BTRFS_BALANCE_ARGS_USAGE_RANGE) && |
0b246afa | 3367 | chunk_usage_range_filter(fs_info, chunk_offset, bargs)) { |
bc309467 | 3368 | return 0; |
409d404b ID |
3369 | } |
3370 | ||
3371 | /* devid filter */ | |
3372 | if ((bargs->flags & BTRFS_BALANCE_ARGS_DEVID) && | |
3373 | chunk_devid_filter(leaf, chunk, bargs)) { | |
3374 | return 0; | |
94e60d5a ID |
3375 | } |
3376 | ||
3377 | /* drange filter, makes sense only with devid filter */ | |
3378 | if ((bargs->flags & BTRFS_BALANCE_ARGS_DRANGE) && | |
e4ff5fb5 | 3379 | chunk_drange_filter(leaf, chunk, bargs)) { |
94e60d5a | 3380 | return 0; |
ea67176a ID |
3381 | } |
3382 | ||
3383 | /* vrange filter */ | |
3384 | if ((bargs->flags & BTRFS_BALANCE_ARGS_VRANGE) && | |
3385 | chunk_vrange_filter(leaf, chunk, chunk_offset, bargs)) { | |
3386 | return 0; | |
ed25e9b2 ID |
3387 | } |
3388 | ||
dee32d0a GAP |
3389 | /* stripes filter */ |
3390 | if ((bargs->flags & BTRFS_BALANCE_ARGS_STRIPES_RANGE) && | |
3391 | chunk_stripes_range_filter(leaf, chunk, bargs)) { | |
3392 | return 0; | |
3393 | } | |
3394 | ||
cfa4c961 ID |
3395 | /* soft profile changing mode */ |
3396 | if ((bargs->flags & BTRFS_BALANCE_ARGS_SOFT) && | |
3397 | chunk_soft_convert_filter(chunk_type, bargs)) { | |
3398 | return 0; | |
3399 | } | |
3400 | ||
7d824b6f DS |
3401 | /* |
3402 | * limited by count, must be the last filter | |
3403 | */ | |
3404 | if ((bargs->flags & BTRFS_BALANCE_ARGS_LIMIT)) { | |
3405 | if (bargs->limit == 0) | |
3406 | return 0; | |
3407 | else | |
3408 | bargs->limit--; | |
12907fc7 DS |
3409 | } else if ((bargs->flags & BTRFS_BALANCE_ARGS_LIMIT_RANGE)) { |
3410 | /* | |
3411 | * Same logic as the 'limit' filter; the minimum cannot be | |
01327610 | 3412 | * determined here because we do not have the global information |
12907fc7 DS |
3413 | * about the count of all chunks that satisfy the filters. |
3414 | */ | |
3415 | if (bargs->limit_max == 0) | |
3416 | return 0; | |
3417 | else | |
3418 | bargs->limit_max--; | |
7d824b6f DS |
3419 | } |
3420 | ||
f43ffb60 ID |
3421 | return 1; |
3422 | } | |
3423 | ||
c9e9f97b | 3424 | static int __btrfs_balance(struct btrfs_fs_info *fs_info) |
ec44a35c | 3425 | { |
19a39dce | 3426 | struct btrfs_balance_control *bctl = fs_info->balance_ctl; |
c9e9f97b ID |
3427 | struct btrfs_root *chunk_root = fs_info->chunk_root; |
3428 | struct btrfs_root *dev_root = fs_info->dev_root; | |
3429 | struct list_head *devices; | |
ec44a35c CM |
3430 | struct btrfs_device *device; |
3431 | u64 old_size; | |
3432 | u64 size_to_free; | |
12907fc7 | 3433 | u64 chunk_type; |
f43ffb60 | 3434 | struct btrfs_chunk *chunk; |
5a488b9d | 3435 | struct btrfs_path *path = NULL; |
ec44a35c | 3436 | struct btrfs_key key; |
ec44a35c | 3437 | struct btrfs_key found_key; |
c9e9f97b | 3438 | struct btrfs_trans_handle *trans; |
f43ffb60 ID |
3439 | struct extent_buffer *leaf; |
3440 | int slot; | |
c9e9f97b ID |
3441 | int ret; |
3442 | int enospc_errors = 0; | |
19a39dce | 3443 | bool counting = true; |
12907fc7 | 3444 | /* The single value limit and min/max limits use the same bytes in the */ |
7d824b6f DS |
3445 | u64 limit_data = bctl->data.limit; |
3446 | u64 limit_meta = bctl->meta.limit; | |
3447 | u64 limit_sys = bctl->sys.limit; | |
12907fc7 DS |
3448 | u32 count_data = 0; |
3449 | u32 count_meta = 0; | |
3450 | u32 count_sys = 0; | |
2c9fe835 | 3451 | int chunk_reserved = 0; |
ec44a35c | 3452 | |
ec44a35c | 3453 | /* step one make some room on all the devices */ |
c9e9f97b | 3454 | devices = &fs_info->fs_devices->devices; |
c6e30871 | 3455 | list_for_each_entry(device, devices, dev_list) { |
7cc8e58d | 3456 | old_size = btrfs_device_get_total_bytes(device); |
ec44a35c | 3457 | size_to_free = div_factor(old_size, 1); |
ee22184b | 3458 | size_to_free = min_t(u64, size_to_free, SZ_1M); |
ebbede42 | 3459 | if (!test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state) || |
7cc8e58d MX |
3460 | btrfs_device_get_total_bytes(device) - |
3461 | btrfs_device_get_bytes_used(device) > size_to_free || | |
401e29c1 | 3462 | test_bit(BTRFS_DEV_STATE_REPLACE_TGT, &device->dev_state)) |
ec44a35c CM |
3463 | continue; |
3464 | ||
3465 | ret = btrfs_shrink_device(device, old_size - size_to_free); | |
ba1bf481 JB |
3466 | if (ret == -ENOSPC) |
3467 | break; | |
5a488b9d LB |
3468 | if (ret) { |
3469 | /* btrfs_shrink_device never returns ret > 0 */ | |
3470 | WARN_ON(ret > 0); | |
3471 | goto error; | |
3472 | } | |
ec44a35c | 3473 | |
a22285a6 | 3474 | trans = btrfs_start_transaction(dev_root, 0); |
5a488b9d LB |
3475 | if (IS_ERR(trans)) { |
3476 | ret = PTR_ERR(trans); | |
3477 | btrfs_info_in_rcu(fs_info, | |
3478 | "resize: unable to start transaction after shrinking device %s (error %d), old size %llu, new size %llu", | |
3479 | rcu_str_deref(device->name), ret, | |
3480 | old_size, old_size - size_to_free); | |
3481 | goto error; | |
3482 | } | |
ec44a35c CM |
3483 | |
3484 | ret = btrfs_grow_device(trans, device, old_size); | |
5a488b9d | 3485 | if (ret) { |
3a45bb20 | 3486 | btrfs_end_transaction(trans); |
5a488b9d LB |
3487 | /* btrfs_grow_device never returns ret > 0 */ |
3488 | WARN_ON(ret > 0); | |
3489 | btrfs_info_in_rcu(fs_info, | |
3490 | "resize: unable to grow device after shrinking device %s (error %d), old size %llu, new size %llu", | |
3491 | rcu_str_deref(device->name), ret, | |
3492 | old_size, old_size - size_to_free); | |
3493 | goto error; | |
3494 | } | |
ec44a35c | 3495 | |
3a45bb20 | 3496 | btrfs_end_transaction(trans); |
ec44a35c CM |
3497 | } |
3498 | ||
3499 | /* step two, relocate all the chunks */ | |
3500 | path = btrfs_alloc_path(); | |
17e9f796 MF |
3501 | if (!path) { |
3502 | ret = -ENOMEM; | |
3503 | goto error; | |
3504 | } | |
19a39dce ID |
3505 | |
3506 | /* zero out stat counters */ | |
3507 | spin_lock(&fs_info->balance_lock); | |
3508 | memset(&bctl->stat, 0, sizeof(bctl->stat)); | |
3509 | spin_unlock(&fs_info->balance_lock); | |
3510 | again: | |
7d824b6f | 3511 | if (!counting) { |
12907fc7 DS |
3512 | /* |
3513 | * The single value limit and min/max limits use the same bytes | |
3514 | * in the | |
3515 | */ | |
7d824b6f DS |
3516 | bctl->data.limit = limit_data; |
3517 | bctl->meta.limit = limit_meta; | |
3518 | bctl->sys.limit = limit_sys; | |
3519 | } | |
ec44a35c CM |
3520 | key.objectid = BTRFS_FIRST_CHUNK_TREE_OBJECTID; |
3521 | key.offset = (u64)-1; | |
3522 | key.type = BTRFS_CHUNK_ITEM_KEY; | |
3523 | ||
d397712b | 3524 | while (1) { |
19a39dce | 3525 | if ((!counting && atomic_read(&fs_info->balance_pause_req)) || |
a7e99c69 | 3526 | atomic_read(&fs_info->balance_cancel_req)) { |
837d5b6e ID |
3527 | ret = -ECANCELED; |
3528 | goto error; | |
3529 | } | |
3530 | ||
67c5e7d4 | 3531 | mutex_lock(&fs_info->delete_unused_bgs_mutex); |
ec44a35c | 3532 | ret = btrfs_search_slot(NULL, chunk_root, &key, path, 0, 0); |
67c5e7d4 FM |
3533 | if (ret < 0) { |
3534 | mutex_unlock(&fs_info->delete_unused_bgs_mutex); | |
ec44a35c | 3535 | goto error; |
67c5e7d4 | 3536 | } |
ec44a35c CM |
3537 | |
3538 | /* | |
3539 | * this shouldn't happen, it means the last relocate | |
3540 | * failed | |
3541 | */ | |
3542 | if (ret == 0) | |
c9e9f97b | 3543 | BUG(); /* FIXME break ? */ |
ec44a35c CM |
3544 | |
3545 | ret = btrfs_previous_item(chunk_root, path, 0, | |
3546 | BTRFS_CHUNK_ITEM_KEY); | |
c9e9f97b | 3547 | if (ret) { |
67c5e7d4 | 3548 | mutex_unlock(&fs_info->delete_unused_bgs_mutex); |
c9e9f97b | 3549 | ret = 0; |
ec44a35c | 3550 | break; |
c9e9f97b | 3551 | } |
7d9eb12c | 3552 | |
f43ffb60 ID |
3553 | leaf = path->nodes[0]; |
3554 | slot = path->slots[0]; | |
3555 | btrfs_item_key_to_cpu(leaf, &found_key, slot); | |
7d9eb12c | 3556 | |
67c5e7d4 FM |
3557 | if (found_key.objectid != key.objectid) { |
3558 | mutex_unlock(&fs_info->delete_unused_bgs_mutex); | |
ec44a35c | 3559 | break; |
67c5e7d4 | 3560 | } |
7d9eb12c | 3561 | |
f43ffb60 | 3562 | chunk = btrfs_item_ptr(leaf, slot, struct btrfs_chunk); |
12907fc7 | 3563 | chunk_type = btrfs_chunk_type(leaf, chunk); |
f43ffb60 | 3564 | |
19a39dce ID |
3565 | if (!counting) { |
3566 | spin_lock(&fs_info->balance_lock); | |
3567 | bctl->stat.considered++; | |
3568 | spin_unlock(&fs_info->balance_lock); | |
3569 | } | |
3570 | ||
2ff7e61e | 3571 | ret = should_balance_chunk(fs_info, leaf, chunk, |
f43ffb60 | 3572 | found_key.offset); |
2c9fe835 | 3573 | |
b3b4aa74 | 3574 | btrfs_release_path(path); |
67c5e7d4 FM |
3575 | if (!ret) { |
3576 | mutex_unlock(&fs_info->delete_unused_bgs_mutex); | |
f43ffb60 | 3577 | goto loop; |
67c5e7d4 | 3578 | } |
f43ffb60 | 3579 | |
19a39dce | 3580 | if (counting) { |
67c5e7d4 | 3581 | mutex_unlock(&fs_info->delete_unused_bgs_mutex); |
19a39dce ID |
3582 | spin_lock(&fs_info->balance_lock); |
3583 | bctl->stat.expected++; | |
3584 | spin_unlock(&fs_info->balance_lock); | |
12907fc7 DS |
3585 | |
3586 | if (chunk_type & BTRFS_BLOCK_GROUP_DATA) | |
3587 | count_data++; | |
3588 | else if (chunk_type & BTRFS_BLOCK_GROUP_SYSTEM) | |
3589 | count_sys++; | |
3590 | else if (chunk_type & BTRFS_BLOCK_GROUP_METADATA) | |
3591 | count_meta++; | |
3592 | ||
3593 | goto loop; | |
3594 | } | |
3595 | ||
3596 | /* | |
3597 | * Apply limit_min filter, no need to check if the LIMITS | |
3598 | * filter is used, limit_min is 0 by default | |
3599 | */ | |
3600 | if (((chunk_type & BTRFS_BLOCK_GROUP_DATA) && | |
3601 | count_data < bctl->data.limit_min) | |
3602 | || ((chunk_type & BTRFS_BLOCK_GROUP_METADATA) && | |
3603 | count_meta < bctl->meta.limit_min) | |
3604 | || ((chunk_type & BTRFS_BLOCK_GROUP_SYSTEM) && | |
3605 | count_sys < bctl->sys.limit_min)) { | |
3606 | mutex_unlock(&fs_info->delete_unused_bgs_mutex); | |
19a39dce ID |
3607 | goto loop; |
3608 | } | |
3609 | ||
a6f93c71 LB |
3610 | if (!chunk_reserved) { |
3611 | /* | |
3612 | * We may be relocating the only data chunk we have, | |
3613 | * which could potentially end up with losing data's | |
3614 | * raid profile, so lets allocate an empty one in | |
3615 | * advance. | |
3616 | */ | |
3617 | ret = btrfs_may_alloc_data_chunk(fs_info, | |
3618 | found_key.offset); | |
2c9fe835 ZL |
3619 | if (ret < 0) { |
3620 | mutex_unlock(&fs_info->delete_unused_bgs_mutex); | |
3621 | goto error; | |
a6f93c71 LB |
3622 | } else if (ret == 1) { |
3623 | chunk_reserved = 1; | |
2c9fe835 | 3624 | } |
2c9fe835 ZL |
3625 | } |
3626 | ||
5b4aacef | 3627 | ret = btrfs_relocate_chunk(fs_info, found_key.offset); |
67c5e7d4 | 3628 | mutex_unlock(&fs_info->delete_unused_bgs_mutex); |
508794eb JB |
3629 | if (ret && ret != -ENOSPC) |
3630 | goto error; | |
19a39dce | 3631 | if (ret == -ENOSPC) { |
c9e9f97b | 3632 | enospc_errors++; |
19a39dce ID |
3633 | } else { |
3634 | spin_lock(&fs_info->balance_lock); | |
3635 | bctl->stat.completed++; | |
3636 | spin_unlock(&fs_info->balance_lock); | |
3637 | } | |
f43ffb60 | 3638 | loop: |
795a3321 ID |
3639 | if (found_key.offset == 0) |
3640 | break; | |
ba1bf481 | 3641 | key.offset = found_key.offset - 1; |
ec44a35c | 3642 | } |
c9e9f97b | 3643 | |
19a39dce ID |
3644 | if (counting) { |
3645 | btrfs_release_path(path); | |
3646 | counting = false; | |
3647 | goto again; | |
3648 | } | |
ec44a35c CM |
3649 | error: |
3650 | btrfs_free_path(path); | |
c9e9f97b | 3651 | if (enospc_errors) { |
efe120a0 | 3652 | btrfs_info(fs_info, "%d enospc errors during balance", |
5d163e0e | 3653 | enospc_errors); |
c9e9f97b ID |
3654 | if (!ret) |
3655 | ret = -ENOSPC; | |
3656 | } | |
3657 | ||
ec44a35c CM |
3658 | return ret; |
3659 | } | |
3660 | ||
0c460c0d ID |
3661 | /** |
3662 | * alloc_profile_is_valid - see if a given profile is valid and reduced | |
3663 | * @flags: profile to validate | |
3664 | * @extended: if true @flags is treated as an extended profile | |
3665 | */ | |
3666 | static int alloc_profile_is_valid(u64 flags, int extended) | |
3667 | { | |
3668 | u64 mask = (extended ? BTRFS_EXTENDED_PROFILE_MASK : | |
3669 | BTRFS_BLOCK_GROUP_PROFILE_MASK); | |
3670 | ||
3671 | flags &= ~BTRFS_BLOCK_GROUP_TYPE_MASK; | |
3672 | ||
3673 | /* 1) check that all other bits are zeroed */ | |
3674 | if (flags & ~mask) | |
3675 | return 0; | |
3676 | ||
3677 | /* 2) see if profile is reduced */ | |
3678 | if (flags == 0) | |
3679 | return !extended; /* "0" is valid for usual profiles */ | |
3680 | ||
3681 | /* true if exactly one bit set */ | |
3682 | return (flags & (flags - 1)) == 0; | |
3683 | } | |
3684 | ||
837d5b6e ID |
3685 | static inline int balance_need_close(struct btrfs_fs_info *fs_info) |
3686 | { | |
a7e99c69 ID |
3687 | /* cancel requested || normal exit path */ |
3688 | return atomic_read(&fs_info->balance_cancel_req) || | |
3689 | (atomic_read(&fs_info->balance_pause_req) == 0 && | |
3690 | atomic_read(&fs_info->balance_cancel_req) == 0); | |
837d5b6e ID |
3691 | } |
3692 | ||
bdcd3c97 AM |
3693 | /* Non-zero return value signifies invalidity */ |
3694 | static inline int validate_convert_profile(struct btrfs_balance_args *bctl_arg, | |
3695 | u64 allowed) | |
3696 | { | |
3697 | return ((bctl_arg->flags & BTRFS_BALANCE_ARGS_CONVERT) && | |
3698 | (!alloc_profile_is_valid(bctl_arg->target, 1) || | |
3699 | (bctl_arg->target & ~allowed))); | |
3700 | } | |
3701 | ||
c9e9f97b | 3702 | /* |
dccdb07b | 3703 | * Should be called with balance mutexe held |
c9e9f97b | 3704 | */ |
6fcf6e2b DS |
3705 | int btrfs_balance(struct btrfs_fs_info *fs_info, |
3706 | struct btrfs_balance_control *bctl, | |
c9e9f97b ID |
3707 | struct btrfs_ioctl_balance_args *bargs) |
3708 | { | |
14506127 | 3709 | u64 meta_target, data_target; |
f43ffb60 | 3710 | u64 allowed; |
e4837f8f | 3711 | int mixed = 0; |
c9e9f97b | 3712 | int ret; |
8dabb742 | 3713 | u64 num_devices; |
de98ced9 | 3714 | unsigned seq; |
c9e9f97b | 3715 | |
837d5b6e | 3716 | if (btrfs_fs_closing(fs_info) || |
a7e99c69 ID |
3717 | atomic_read(&fs_info->balance_pause_req) || |
3718 | atomic_read(&fs_info->balance_cancel_req)) { | |
c9e9f97b ID |
3719 | ret = -EINVAL; |
3720 | goto out; | |
3721 | } | |
3722 | ||
e4837f8f ID |
3723 | allowed = btrfs_super_incompat_flags(fs_info->super_copy); |
3724 | if (allowed & BTRFS_FEATURE_INCOMPAT_MIXED_GROUPS) | |
3725 | mixed = 1; | |
3726 | ||
f43ffb60 ID |
3727 | /* |
3728 | * In case of mixed groups both data and meta should be picked, | |
3729 | * and identical options should be given for both of them. | |
3730 | */ | |
e4837f8f ID |
3731 | allowed = BTRFS_BALANCE_DATA | BTRFS_BALANCE_METADATA; |
3732 | if (mixed && (bctl->flags & allowed)) { | |
f43ffb60 ID |
3733 | if (!(bctl->flags & BTRFS_BALANCE_DATA) || |
3734 | !(bctl->flags & BTRFS_BALANCE_METADATA) || | |
3735 | memcmp(&bctl->data, &bctl->meta, sizeof(bctl->data))) { | |
5d163e0e | 3736 | btrfs_err(fs_info, |
6dac13f8 | 3737 | "balance: mixed groups data and metadata options must be the same"); |
f43ffb60 ID |
3738 | ret = -EINVAL; |
3739 | goto out; | |
3740 | } | |
3741 | } | |
3742 | ||
8dabb742 | 3743 | num_devices = fs_info->fs_devices->num_devices; |
7e79cb86 | 3744 | btrfs_dev_replace_read_lock(&fs_info->dev_replace); |
8dabb742 | 3745 | if (btrfs_dev_replace_is_ongoing(&fs_info->dev_replace)) { |
16220c46 | 3746 | ASSERT(num_devices > 1); |
8dabb742 SB |
3747 | num_devices--; |
3748 | } | |
7e79cb86 | 3749 | btrfs_dev_replace_read_unlock(&fs_info->dev_replace); |
88be159c AH |
3750 | allowed = BTRFS_AVAIL_ALLOC_BIT_SINGLE | BTRFS_BLOCK_GROUP_DUP; |
3751 | if (num_devices > 1) | |
e4d8ec0f | 3752 | allowed |= (BTRFS_BLOCK_GROUP_RAID0 | BTRFS_BLOCK_GROUP_RAID1); |
8250dabe AP |
3753 | if (num_devices > 2) |
3754 | allowed |= BTRFS_BLOCK_GROUP_RAID5; | |
3755 | if (num_devices > 3) | |
3756 | allowed |= (BTRFS_BLOCK_GROUP_RAID10 | | |
3757 | BTRFS_BLOCK_GROUP_RAID6); | |
bdcd3c97 | 3758 | if (validate_convert_profile(&bctl->data, allowed)) { |
6dac13f8 AJ |
3759 | int index = btrfs_bg_flags_to_raid_index(bctl->data.target); |
3760 | ||
5d163e0e | 3761 | btrfs_err(fs_info, |
6dac13f8 AJ |
3762 | "balance: invalid convert data profile %s", |
3763 | get_raid_name(index)); | |
e4d8ec0f ID |
3764 | ret = -EINVAL; |
3765 | goto out; | |
3766 | } | |
bdcd3c97 | 3767 | if (validate_convert_profile(&bctl->meta, allowed)) { |
6dac13f8 AJ |
3768 | int index = btrfs_bg_flags_to_raid_index(bctl->meta.target); |
3769 | ||
efe120a0 | 3770 | btrfs_err(fs_info, |
6dac13f8 AJ |
3771 | "balance: invalid convert metadata profile %s", |
3772 | get_raid_name(index)); | |
e4d8ec0f ID |
3773 | ret = -EINVAL; |
3774 | goto out; | |
3775 | } | |
bdcd3c97 | 3776 | if (validate_convert_profile(&bctl->sys, allowed)) { |
6dac13f8 AJ |
3777 | int index = btrfs_bg_flags_to_raid_index(bctl->sys.target); |
3778 | ||
efe120a0 | 3779 | btrfs_err(fs_info, |
6dac13f8 AJ |
3780 | "balance: invalid convert system profile %s", |
3781 | get_raid_name(index)); | |
e4d8ec0f ID |
3782 | ret = -EINVAL; |
3783 | goto out; | |
3784 | } | |
3785 | ||
e4d8ec0f ID |
3786 | /* allow to reduce meta or sys integrity only if force set */ |
3787 | allowed = BTRFS_BLOCK_GROUP_DUP | BTRFS_BLOCK_GROUP_RAID1 | | |
53b381b3 DW |
3788 | BTRFS_BLOCK_GROUP_RAID10 | |
3789 | BTRFS_BLOCK_GROUP_RAID5 | | |
3790 | BTRFS_BLOCK_GROUP_RAID6; | |
de98ced9 MX |
3791 | do { |
3792 | seq = read_seqbegin(&fs_info->profiles_lock); | |
3793 | ||
3794 | if (((bctl->sys.flags & BTRFS_BALANCE_ARGS_CONVERT) && | |
3795 | (fs_info->avail_system_alloc_bits & allowed) && | |
3796 | !(bctl->sys.target & allowed)) || | |
3797 | ((bctl->meta.flags & BTRFS_BALANCE_ARGS_CONVERT) && | |
3798 | (fs_info->avail_metadata_alloc_bits & allowed) && | |
3799 | !(bctl->meta.target & allowed))) { | |
3800 | if (bctl->flags & BTRFS_BALANCE_FORCE) { | |
5d163e0e | 3801 | btrfs_info(fs_info, |
6dac13f8 | 3802 | "balance: force reducing metadata integrity"); |
de98ced9 | 3803 | } else { |
5d163e0e | 3804 | btrfs_err(fs_info, |
6dac13f8 | 3805 | "balance: reduces metadata integrity, use --force if you want this"); |
de98ced9 MX |
3806 | ret = -EINVAL; |
3807 | goto out; | |
3808 | } | |
e4d8ec0f | 3809 | } |
de98ced9 | 3810 | } while (read_seqretry(&fs_info->profiles_lock, seq)); |
e4d8ec0f | 3811 | |
14506127 AB |
3812 | /* if we're not converting, the target field is uninitialized */ |
3813 | meta_target = (bctl->meta.flags & BTRFS_BALANCE_ARGS_CONVERT) ? | |
3814 | bctl->meta.target : fs_info->avail_metadata_alloc_bits; | |
3815 | data_target = (bctl->data.flags & BTRFS_BALANCE_ARGS_CONVERT) ? | |
3816 | bctl->data.target : fs_info->avail_data_alloc_bits; | |
3817 | if (btrfs_get_num_tolerated_disk_barrier_failures(meta_target) < | |
3818 | btrfs_get_num_tolerated_disk_barrier_failures(data_target)) { | |
6dac13f8 AJ |
3819 | int meta_index = btrfs_bg_flags_to_raid_index(meta_target); |
3820 | int data_index = btrfs_bg_flags_to_raid_index(data_target); | |
3821 | ||
ee592d07 | 3822 | btrfs_warn(fs_info, |
6dac13f8 AJ |
3823 | "balance: metadata profile %s has lower redundancy than data profile %s", |
3824 | get_raid_name(meta_index), get_raid_name(data_index)); | |
ee592d07 ST |
3825 | } |
3826 | ||
6bccf3ab | 3827 | ret = insert_balance_item(fs_info, bctl); |
59641015 | 3828 | if (ret && ret != -EEXIST) |
0940ebf6 ID |
3829 | goto out; |
3830 | ||
59641015 ID |
3831 | if (!(bctl->flags & BTRFS_BALANCE_RESUME)) { |
3832 | BUG_ON(ret == -EEXIST); | |
833aae18 DS |
3833 | BUG_ON(fs_info->balance_ctl); |
3834 | spin_lock(&fs_info->balance_lock); | |
3835 | fs_info->balance_ctl = bctl; | |
3836 | spin_unlock(&fs_info->balance_lock); | |
59641015 ID |
3837 | } else { |
3838 | BUG_ON(ret != -EEXIST); | |
3839 | spin_lock(&fs_info->balance_lock); | |
3840 | update_balance_args(bctl); | |
3841 | spin_unlock(&fs_info->balance_lock); | |
3842 | } | |
c9e9f97b | 3843 | |
3009a62f DS |
3844 | ASSERT(!test_bit(BTRFS_FS_BALANCE_RUNNING, &fs_info->flags)); |
3845 | set_bit(BTRFS_FS_BALANCE_RUNNING, &fs_info->flags); | |
c9e9f97b ID |
3846 | mutex_unlock(&fs_info->balance_mutex); |
3847 | ||
3848 | ret = __btrfs_balance(fs_info); | |
3849 | ||
3850 | mutex_lock(&fs_info->balance_mutex); | |
3009a62f | 3851 | clear_bit(BTRFS_FS_BALANCE_RUNNING, &fs_info->flags); |
c9e9f97b ID |
3852 | |
3853 | if (bargs) { | |
3854 | memset(bargs, 0, sizeof(*bargs)); | |
008ef096 | 3855 | btrfs_update_ioctl_balance_args(fs_info, bargs); |
c9e9f97b ID |
3856 | } |
3857 | ||
3a01aa7a ID |
3858 | if ((ret && ret != -ECANCELED && ret != -ENOSPC) || |
3859 | balance_need_close(fs_info)) { | |
149196a2 | 3860 | reset_balance_state(fs_info); |
a17c95df | 3861 | clear_bit(BTRFS_FS_EXCL_OP, &fs_info->flags); |
3a01aa7a ID |
3862 | } |
3863 | ||
837d5b6e | 3864 | wake_up(&fs_info->balance_wait_q); |
c9e9f97b ID |
3865 | |
3866 | return ret; | |
3867 | out: | |
59641015 | 3868 | if (bctl->flags & BTRFS_BALANCE_RESUME) |
149196a2 | 3869 | reset_balance_state(fs_info); |
a17c95df | 3870 | else |
59641015 | 3871 | kfree(bctl); |
a17c95df DS |
3872 | clear_bit(BTRFS_FS_EXCL_OP, &fs_info->flags); |
3873 | ||
59641015 ID |
3874 | return ret; |
3875 | } | |
3876 | ||
3877 | static int balance_kthread(void *data) | |
3878 | { | |
2b6ba629 | 3879 | struct btrfs_fs_info *fs_info = data; |
9555c6c1 | 3880 | int ret = 0; |
59641015 | 3881 | |
59641015 | 3882 | mutex_lock(&fs_info->balance_mutex); |
2b6ba629 | 3883 | if (fs_info->balance_ctl) { |
6dac13f8 | 3884 | btrfs_info(fs_info, "balance: resuming"); |
6fcf6e2b | 3885 | ret = btrfs_balance(fs_info, fs_info->balance_ctl, NULL); |
9555c6c1 | 3886 | } |
59641015 | 3887 | mutex_unlock(&fs_info->balance_mutex); |
2b6ba629 | 3888 | |
59641015 ID |
3889 | return ret; |
3890 | } | |
3891 | ||
2b6ba629 ID |
3892 | int btrfs_resume_balance_async(struct btrfs_fs_info *fs_info) |
3893 | { | |
3894 | struct task_struct *tsk; | |
3895 | ||
1354e1a1 | 3896 | mutex_lock(&fs_info->balance_mutex); |
2b6ba629 | 3897 | if (!fs_info->balance_ctl) { |
1354e1a1 | 3898 | mutex_unlock(&fs_info->balance_mutex); |
2b6ba629 ID |
3899 | return 0; |
3900 | } | |
1354e1a1 | 3901 | mutex_unlock(&fs_info->balance_mutex); |
2b6ba629 | 3902 | |
3cdde224 | 3903 | if (btrfs_test_opt(fs_info, SKIP_BALANCE)) { |
6dac13f8 | 3904 | btrfs_info(fs_info, "balance: resume skipped"); |
2b6ba629 ID |
3905 | return 0; |
3906 | } | |
3907 | ||
02ee654d AJ |
3908 | /* |
3909 | * A ro->rw remount sequence should continue with the paused balance | |
3910 | * regardless of who pauses it, system or the user as of now, so set | |
3911 | * the resume flag. | |
3912 | */ | |
3913 | spin_lock(&fs_info->balance_lock); | |
3914 | fs_info->balance_ctl->flags |= BTRFS_BALANCE_RESUME; | |
3915 | spin_unlock(&fs_info->balance_lock); | |
3916 | ||
2b6ba629 | 3917 | tsk = kthread_run(balance_kthread, fs_info, "btrfs-balance"); |
cd633972 | 3918 | return PTR_ERR_OR_ZERO(tsk); |
2b6ba629 ID |
3919 | } |
3920 | ||
68310a5e | 3921 | int btrfs_recover_balance(struct btrfs_fs_info *fs_info) |
59641015 | 3922 | { |
59641015 ID |
3923 | struct btrfs_balance_control *bctl; |
3924 | struct btrfs_balance_item *item; | |
3925 | struct btrfs_disk_balance_args disk_bargs; | |
3926 | struct btrfs_path *path; | |
3927 | struct extent_buffer *leaf; | |
3928 | struct btrfs_key key; | |
3929 | int ret; | |
3930 | ||
3931 | path = btrfs_alloc_path(); | |
3932 | if (!path) | |
3933 | return -ENOMEM; | |
3934 | ||
59641015 | 3935 | key.objectid = BTRFS_BALANCE_OBJECTID; |
c479cb4f | 3936 | key.type = BTRFS_TEMPORARY_ITEM_KEY; |
59641015 ID |
3937 | key.offset = 0; |
3938 | ||
68310a5e | 3939 | ret = btrfs_search_slot(NULL, fs_info->tree_root, &key, path, 0, 0); |
59641015 | 3940 | if (ret < 0) |
68310a5e | 3941 | goto out; |
59641015 ID |
3942 | if (ret > 0) { /* ret = -ENOENT; */ |
3943 | ret = 0; | |
68310a5e ID |
3944 | goto out; |
3945 | } | |
3946 | ||
3947 | bctl = kzalloc(sizeof(*bctl), GFP_NOFS); | |
3948 | if (!bctl) { | |
3949 | ret = -ENOMEM; | |
3950 | goto out; | |
59641015 ID |
3951 | } |
3952 | ||
3953 | leaf = path->nodes[0]; | |
3954 | item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_balance_item); | |
3955 | ||
68310a5e ID |
3956 | bctl->flags = btrfs_balance_flags(leaf, item); |
3957 | bctl->flags |= BTRFS_BALANCE_RESUME; | |
59641015 ID |
3958 | |
3959 | btrfs_balance_data(leaf, item, &disk_bargs); | |
3960 | btrfs_disk_balance_args_to_cpu(&bctl->data, &disk_bargs); | |
3961 | btrfs_balance_meta(leaf, item, &disk_bargs); | |
3962 | btrfs_disk_balance_args_to_cpu(&bctl->meta, &disk_bargs); | |
3963 | btrfs_balance_sys(leaf, item, &disk_bargs); | |
3964 | btrfs_disk_balance_args_to_cpu(&bctl->sys, &disk_bargs); | |
3965 | ||
eee95e3f DS |
3966 | /* |
3967 | * This should never happen, as the paused balance state is recovered | |
3968 | * during mount without any chance of other exclusive ops to collide. | |
3969 | * | |
3970 | * This gives the exclusive op status to balance and keeps in paused | |
3971 | * state until user intervention (cancel or umount). If the ownership | |
3972 | * cannot be assigned, show a message but do not fail. The balance | |
3973 | * is in a paused state and must have fs_info::balance_ctl properly | |
3974 | * set up. | |
3975 | */ | |
3976 | if (test_and_set_bit(BTRFS_FS_EXCL_OP, &fs_info->flags)) | |
3977 | btrfs_warn(fs_info, | |
6dac13f8 | 3978 | "balance: cannot set exclusive op status, resume manually"); |
ed0fb78f | 3979 | |
68310a5e | 3980 | mutex_lock(&fs_info->balance_mutex); |
833aae18 DS |
3981 | BUG_ON(fs_info->balance_ctl); |
3982 | spin_lock(&fs_info->balance_lock); | |
3983 | fs_info->balance_ctl = bctl; | |
3984 | spin_unlock(&fs_info->balance_lock); | |
68310a5e | 3985 | mutex_unlock(&fs_info->balance_mutex); |
59641015 ID |
3986 | out: |
3987 | btrfs_free_path(path); | |
ec44a35c CM |
3988 | return ret; |
3989 | } | |
3990 | ||
837d5b6e ID |
3991 | int btrfs_pause_balance(struct btrfs_fs_info *fs_info) |
3992 | { | |
3993 | int ret = 0; | |
3994 | ||
3995 | mutex_lock(&fs_info->balance_mutex); | |
3996 | if (!fs_info->balance_ctl) { | |
3997 | mutex_unlock(&fs_info->balance_mutex); | |
3998 | return -ENOTCONN; | |
3999 | } | |
4000 | ||
3009a62f | 4001 | if (test_bit(BTRFS_FS_BALANCE_RUNNING, &fs_info->flags)) { |
837d5b6e ID |
4002 | atomic_inc(&fs_info->balance_pause_req); |
4003 | mutex_unlock(&fs_info->balance_mutex); | |
4004 | ||
4005 | wait_event(fs_info->balance_wait_q, | |
3009a62f | 4006 | !test_bit(BTRFS_FS_BALANCE_RUNNING, &fs_info->flags)); |
837d5b6e ID |
4007 | |
4008 | mutex_lock(&fs_info->balance_mutex); | |
4009 | /* we are good with balance_ctl ripped off from under us */ | |
3009a62f | 4010 | BUG_ON(test_bit(BTRFS_FS_BALANCE_RUNNING, &fs_info->flags)); |
837d5b6e ID |
4011 | atomic_dec(&fs_info->balance_pause_req); |
4012 | } else { | |
4013 | ret = -ENOTCONN; | |
4014 | } | |
4015 | ||
4016 | mutex_unlock(&fs_info->balance_mutex); | |
4017 | return ret; | |
4018 | } | |
4019 | ||
a7e99c69 ID |
4020 | int btrfs_cancel_balance(struct btrfs_fs_info *fs_info) |
4021 | { | |
4022 | mutex_lock(&fs_info->balance_mutex); | |
4023 | if (!fs_info->balance_ctl) { | |
4024 | mutex_unlock(&fs_info->balance_mutex); | |
4025 | return -ENOTCONN; | |
4026 | } | |
4027 | ||
cf7d20f4 DS |
4028 | /* |
4029 | * A paused balance with the item stored on disk can be resumed at | |
4030 | * mount time if the mount is read-write. Otherwise it's still paused | |
4031 | * and we must not allow cancelling as it deletes the item. | |
4032 | */ | |
4033 | if (sb_rdonly(fs_info->sb)) { | |
4034 | mutex_unlock(&fs_info->balance_mutex); | |
4035 | return -EROFS; | |
4036 | } | |
4037 | ||
a7e99c69 ID |
4038 | atomic_inc(&fs_info->balance_cancel_req); |
4039 | /* | |
4040 | * if we are running just wait and return, balance item is | |
4041 | * deleted in btrfs_balance in this case | |
4042 | */ | |
3009a62f | 4043 | if (test_bit(BTRFS_FS_BALANCE_RUNNING, &fs_info->flags)) { |
a7e99c69 ID |
4044 | mutex_unlock(&fs_info->balance_mutex); |
4045 | wait_event(fs_info->balance_wait_q, | |
3009a62f | 4046 | !test_bit(BTRFS_FS_BALANCE_RUNNING, &fs_info->flags)); |
a7e99c69 ID |
4047 | mutex_lock(&fs_info->balance_mutex); |
4048 | } else { | |
a7e99c69 | 4049 | mutex_unlock(&fs_info->balance_mutex); |
dccdb07b DS |
4050 | /* |
4051 | * Lock released to allow other waiters to continue, we'll | |
4052 | * reexamine the status again. | |
4053 | */ | |
a7e99c69 ID |
4054 | mutex_lock(&fs_info->balance_mutex); |
4055 | ||
a17c95df | 4056 | if (fs_info->balance_ctl) { |
149196a2 | 4057 | reset_balance_state(fs_info); |
a17c95df | 4058 | clear_bit(BTRFS_FS_EXCL_OP, &fs_info->flags); |
6dac13f8 | 4059 | btrfs_info(fs_info, "balance: canceled"); |
a17c95df | 4060 | } |
a7e99c69 ID |
4061 | } |
4062 | ||
3009a62f DS |
4063 | BUG_ON(fs_info->balance_ctl || |
4064 | test_bit(BTRFS_FS_BALANCE_RUNNING, &fs_info->flags)); | |
a7e99c69 ID |
4065 | atomic_dec(&fs_info->balance_cancel_req); |
4066 | mutex_unlock(&fs_info->balance_mutex); | |
4067 | return 0; | |
4068 | } | |
4069 | ||
803b2f54 SB |
4070 | static int btrfs_uuid_scan_kthread(void *data) |
4071 | { | |
4072 | struct btrfs_fs_info *fs_info = data; | |
4073 | struct btrfs_root *root = fs_info->tree_root; | |
4074 | struct btrfs_key key; | |
803b2f54 SB |
4075 | struct btrfs_path *path = NULL; |
4076 | int ret = 0; | |
4077 | struct extent_buffer *eb; | |
4078 | int slot; | |
4079 | struct btrfs_root_item root_item; | |
4080 | u32 item_size; | |
f45388f3 | 4081 | struct btrfs_trans_handle *trans = NULL; |
803b2f54 SB |
4082 | |
4083 | path = btrfs_alloc_path(); | |
4084 | if (!path) { | |
4085 | ret = -ENOMEM; | |
4086 | goto out; | |
4087 | } | |
4088 | ||
4089 | key.objectid = 0; | |
4090 | key.type = BTRFS_ROOT_ITEM_KEY; | |
4091 | key.offset = 0; | |
4092 | ||
803b2f54 | 4093 | while (1) { |
7c829b72 AJ |
4094 | ret = btrfs_search_forward(root, &key, path, |
4095 | BTRFS_OLDEST_GENERATION); | |
803b2f54 SB |
4096 | if (ret) { |
4097 | if (ret > 0) | |
4098 | ret = 0; | |
4099 | break; | |
4100 | } | |
4101 | ||
4102 | if (key.type != BTRFS_ROOT_ITEM_KEY || | |
4103 | (key.objectid < BTRFS_FIRST_FREE_OBJECTID && | |
4104 | key.objectid != BTRFS_FS_TREE_OBJECTID) || | |
4105 | key.objectid > BTRFS_LAST_FREE_OBJECTID) | |
4106 | goto skip; | |
4107 | ||
4108 | eb = path->nodes[0]; | |
4109 | slot = path->slots[0]; | |
4110 | item_size = btrfs_item_size_nr(eb, slot); | |
4111 | if (item_size < sizeof(root_item)) | |
4112 | goto skip; | |
4113 | ||
803b2f54 SB |
4114 | read_extent_buffer(eb, &root_item, |
4115 | btrfs_item_ptr_offset(eb, slot), | |
4116 | (int)sizeof(root_item)); | |
4117 | if (btrfs_root_refs(&root_item) == 0) | |
4118 | goto skip; | |
f45388f3 FDBM |
4119 | |
4120 | if (!btrfs_is_empty_uuid(root_item.uuid) || | |
4121 | !btrfs_is_empty_uuid(root_item.received_uuid)) { | |
4122 | if (trans) | |
4123 | goto update_tree; | |
4124 | ||
4125 | btrfs_release_path(path); | |
803b2f54 SB |
4126 | /* |
4127 | * 1 - subvol uuid item | |
4128 | * 1 - received_subvol uuid item | |
4129 | */ | |
4130 | trans = btrfs_start_transaction(fs_info->uuid_root, 2); | |
4131 | if (IS_ERR(trans)) { | |
4132 | ret = PTR_ERR(trans); | |
4133 | break; | |
4134 | } | |
f45388f3 FDBM |
4135 | continue; |
4136 | } else { | |
4137 | goto skip; | |
4138 | } | |
4139 | update_tree: | |
4140 | if (!btrfs_is_empty_uuid(root_item.uuid)) { | |
cdb345a8 | 4141 | ret = btrfs_uuid_tree_add(trans, root_item.uuid, |
803b2f54 SB |
4142 | BTRFS_UUID_KEY_SUBVOL, |
4143 | key.objectid); | |
4144 | if (ret < 0) { | |
efe120a0 | 4145 | btrfs_warn(fs_info, "uuid_tree_add failed %d", |
803b2f54 | 4146 | ret); |
803b2f54 SB |
4147 | break; |
4148 | } | |
4149 | } | |
4150 | ||
4151 | if (!btrfs_is_empty_uuid(root_item.received_uuid)) { | |
cdb345a8 | 4152 | ret = btrfs_uuid_tree_add(trans, |
803b2f54 SB |
4153 | root_item.received_uuid, |
4154 | BTRFS_UUID_KEY_RECEIVED_SUBVOL, | |
4155 | key.objectid); | |
4156 | if (ret < 0) { | |
efe120a0 | 4157 | btrfs_warn(fs_info, "uuid_tree_add failed %d", |
803b2f54 | 4158 | ret); |
803b2f54 SB |
4159 | break; |
4160 | } | |
4161 | } | |
4162 | ||
f45388f3 | 4163 | skip: |
803b2f54 | 4164 | if (trans) { |
3a45bb20 | 4165 | ret = btrfs_end_transaction(trans); |
f45388f3 | 4166 | trans = NULL; |
803b2f54 SB |
4167 | if (ret) |
4168 | break; | |
4169 | } | |
4170 | ||
803b2f54 SB |
4171 | btrfs_release_path(path); |
4172 | if (key.offset < (u64)-1) { | |
4173 | key.offset++; | |
4174 | } else if (key.type < BTRFS_ROOT_ITEM_KEY) { | |
4175 | key.offset = 0; | |
4176 | key.type = BTRFS_ROOT_ITEM_KEY; | |
4177 | } else if (key.objectid < (u64)-1) { | |
4178 | key.offset = 0; | |
4179 | key.type = BTRFS_ROOT_ITEM_KEY; | |
4180 | key.objectid++; | |
4181 | } else { | |
4182 | break; | |
4183 | } | |
4184 | cond_resched(); | |
4185 | } | |
4186 | ||
4187 | out: | |
4188 | btrfs_free_path(path); | |
f45388f3 | 4189 | if (trans && !IS_ERR(trans)) |
3a45bb20 | 4190 | btrfs_end_transaction(trans); |
803b2f54 | 4191 | if (ret) |
efe120a0 | 4192 | btrfs_warn(fs_info, "btrfs_uuid_scan_kthread failed %d", ret); |
70f80175 | 4193 | else |
afcdd129 | 4194 | set_bit(BTRFS_FS_UPDATE_UUID_TREE_GEN, &fs_info->flags); |
803b2f54 SB |
4195 | up(&fs_info->uuid_tree_rescan_sem); |
4196 | return 0; | |
4197 | } | |
4198 | ||
70f80175 SB |
4199 | /* |
4200 | * Callback for btrfs_uuid_tree_iterate(). | |
4201 | * returns: | |
4202 | * 0 check succeeded, the entry is not outdated. | |
bb7ab3b9 | 4203 | * < 0 if an error occurred. |
70f80175 SB |
4204 | * > 0 if the check failed, which means the caller shall remove the entry. |
4205 | */ | |
4206 | static int btrfs_check_uuid_tree_entry(struct btrfs_fs_info *fs_info, | |
4207 | u8 *uuid, u8 type, u64 subid) | |
4208 | { | |
4209 | struct btrfs_key key; | |
4210 | int ret = 0; | |
4211 | struct btrfs_root *subvol_root; | |
4212 | ||
4213 | if (type != BTRFS_UUID_KEY_SUBVOL && | |
4214 | type != BTRFS_UUID_KEY_RECEIVED_SUBVOL) | |
4215 | goto out; | |
4216 | ||
4217 | key.objectid = subid; | |
4218 | key.type = BTRFS_ROOT_ITEM_KEY; | |
4219 | key.offset = (u64)-1; | |
4220 | subvol_root = btrfs_read_fs_root_no_name(fs_info, &key); | |
4221 | if (IS_ERR(subvol_root)) { | |
4222 | ret = PTR_ERR(subvol_root); | |
4223 | if (ret == -ENOENT) | |
4224 | ret = 1; | |
4225 | goto out; | |
4226 | } | |
4227 | ||
4228 | switch (type) { | |
4229 | case BTRFS_UUID_KEY_SUBVOL: | |
4230 | if (memcmp(uuid, subvol_root->root_item.uuid, BTRFS_UUID_SIZE)) | |
4231 | ret = 1; | |
4232 | break; | |
4233 | case BTRFS_UUID_KEY_RECEIVED_SUBVOL: | |
4234 | if (memcmp(uuid, subvol_root->root_item.received_uuid, | |
4235 | BTRFS_UUID_SIZE)) | |
4236 | ret = 1; | |
4237 | break; | |
4238 | } | |
4239 | ||
4240 | out: | |
4241 | return ret; | |
4242 | } | |
4243 | ||
4244 | static int btrfs_uuid_rescan_kthread(void *data) | |
4245 | { | |
4246 | struct btrfs_fs_info *fs_info = (struct btrfs_fs_info *)data; | |
4247 | int ret; | |
4248 | ||
4249 | /* | |
4250 | * 1st step is to iterate through the existing UUID tree and | |
4251 | * to delete all entries that contain outdated data. | |
4252 | * 2nd step is to add all missing entries to the UUID tree. | |
4253 | */ | |
4254 | ret = btrfs_uuid_tree_iterate(fs_info, btrfs_check_uuid_tree_entry); | |
4255 | if (ret < 0) { | |
efe120a0 | 4256 | btrfs_warn(fs_info, "iterating uuid_tree failed %d", ret); |
70f80175 SB |
4257 | up(&fs_info->uuid_tree_rescan_sem); |
4258 | return ret; | |
4259 | } | |
4260 | return btrfs_uuid_scan_kthread(data); | |
4261 | } | |
4262 | ||
f7a81ea4 SB |
4263 | int btrfs_create_uuid_tree(struct btrfs_fs_info *fs_info) |
4264 | { | |
4265 | struct btrfs_trans_handle *trans; | |
4266 | struct btrfs_root *tree_root = fs_info->tree_root; | |
4267 | struct btrfs_root *uuid_root; | |
803b2f54 SB |
4268 | struct task_struct *task; |
4269 | int ret; | |
f7a81ea4 SB |
4270 | |
4271 | /* | |
4272 | * 1 - root node | |
4273 | * 1 - root item | |
4274 | */ | |
4275 | trans = btrfs_start_transaction(tree_root, 2); | |
4276 | if (IS_ERR(trans)) | |
4277 | return PTR_ERR(trans); | |
4278 | ||
4279 | uuid_root = btrfs_create_tree(trans, fs_info, | |
4280 | BTRFS_UUID_TREE_OBJECTID); | |
4281 | if (IS_ERR(uuid_root)) { | |
6d13f549 | 4282 | ret = PTR_ERR(uuid_root); |
66642832 | 4283 | btrfs_abort_transaction(trans, ret); |
3a45bb20 | 4284 | btrfs_end_transaction(trans); |
6d13f549 | 4285 | return ret; |
f7a81ea4 SB |
4286 | } |
4287 | ||
4288 | fs_info->uuid_root = uuid_root; | |
4289 | ||
3a45bb20 | 4290 | ret = btrfs_commit_transaction(trans); |
803b2f54 SB |
4291 | if (ret) |
4292 | return ret; | |
4293 | ||
4294 | down(&fs_info->uuid_tree_rescan_sem); | |
4295 | task = kthread_run(btrfs_uuid_scan_kthread, fs_info, "btrfs-uuid"); | |
4296 | if (IS_ERR(task)) { | |
70f80175 | 4297 | /* fs_info->update_uuid_tree_gen remains 0 in all error case */ |
efe120a0 | 4298 | btrfs_warn(fs_info, "failed to start uuid_scan task"); |
803b2f54 SB |
4299 | up(&fs_info->uuid_tree_rescan_sem); |
4300 | return PTR_ERR(task); | |
4301 | } | |
4302 | ||
4303 | return 0; | |
f7a81ea4 | 4304 | } |
803b2f54 | 4305 | |
70f80175 SB |
4306 | int btrfs_check_uuid_tree(struct btrfs_fs_info *fs_info) |
4307 | { | |
4308 | struct task_struct *task; | |
4309 | ||
4310 | down(&fs_info->uuid_tree_rescan_sem); | |
4311 | task = kthread_run(btrfs_uuid_rescan_kthread, fs_info, "btrfs-uuid"); | |
4312 | if (IS_ERR(task)) { | |
4313 | /* fs_info->update_uuid_tree_gen remains 0 in all error case */ | |
efe120a0 | 4314 | btrfs_warn(fs_info, "failed to start uuid_rescan task"); |
70f80175 SB |
4315 | up(&fs_info->uuid_tree_rescan_sem); |
4316 | return PTR_ERR(task); | |
4317 | } | |
4318 | ||
4319 | return 0; | |
4320 | } | |
4321 | ||
8f18cf13 CM |
4322 | /* |
4323 | * shrinking a device means finding all of the device extents past | |
4324 | * the new size, and then following the back refs to the chunks. | |
4325 | * The chunk relocation code actually frees the device extent | |
4326 | */ | |
4327 | int btrfs_shrink_device(struct btrfs_device *device, u64 new_size) | |
4328 | { | |
0b246afa JM |
4329 | struct btrfs_fs_info *fs_info = device->fs_info; |
4330 | struct btrfs_root *root = fs_info->dev_root; | |
8f18cf13 | 4331 | struct btrfs_trans_handle *trans; |
8f18cf13 CM |
4332 | struct btrfs_dev_extent *dev_extent = NULL; |
4333 | struct btrfs_path *path; | |
4334 | u64 length; | |
8f18cf13 CM |
4335 | u64 chunk_offset; |
4336 | int ret; | |
4337 | int slot; | |
ba1bf481 JB |
4338 | int failed = 0; |
4339 | bool retried = false; | |
53e489bc | 4340 | bool checked_pending_chunks = false; |
8f18cf13 CM |
4341 | struct extent_buffer *l; |
4342 | struct btrfs_key key; | |
0b246afa | 4343 | struct btrfs_super_block *super_copy = fs_info->super_copy; |
8f18cf13 | 4344 | u64 old_total = btrfs_super_total_bytes(super_copy); |
7cc8e58d | 4345 | u64 old_size = btrfs_device_get_total_bytes(device); |
7dfb8be1 NB |
4346 | u64 diff; |
4347 | ||
4348 | new_size = round_down(new_size, fs_info->sectorsize); | |
0e4324a4 | 4349 | diff = round_down(old_size - new_size, fs_info->sectorsize); |
8f18cf13 | 4350 | |
401e29c1 | 4351 | if (test_bit(BTRFS_DEV_STATE_REPLACE_TGT, &device->dev_state)) |
63a212ab SB |
4352 | return -EINVAL; |
4353 | ||
8f18cf13 CM |
4354 | path = btrfs_alloc_path(); |
4355 | if (!path) | |
4356 | return -ENOMEM; | |
4357 | ||
0338dff6 | 4358 | path->reada = READA_BACK; |
8f18cf13 | 4359 | |
34441361 | 4360 | mutex_lock(&fs_info->chunk_mutex); |
7d9eb12c | 4361 | |
7cc8e58d | 4362 | btrfs_device_set_total_bytes(device, new_size); |
ebbede42 | 4363 | if (test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state)) { |
2b82032c | 4364 | device->fs_devices->total_rw_bytes -= diff; |
a5ed45f8 | 4365 | atomic64_sub(diff, &fs_info->free_chunk_space); |
2bf64758 | 4366 | } |
34441361 | 4367 | mutex_unlock(&fs_info->chunk_mutex); |
8f18cf13 | 4368 | |
ba1bf481 | 4369 | again: |
8f18cf13 CM |
4370 | key.objectid = device->devid; |
4371 | key.offset = (u64)-1; | |
4372 | key.type = BTRFS_DEV_EXTENT_KEY; | |
4373 | ||
213e64da | 4374 | do { |
0b246afa | 4375 | mutex_lock(&fs_info->delete_unused_bgs_mutex); |
8f18cf13 | 4376 | ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); |
67c5e7d4 | 4377 | if (ret < 0) { |
0b246afa | 4378 | mutex_unlock(&fs_info->delete_unused_bgs_mutex); |
8f18cf13 | 4379 | goto done; |
67c5e7d4 | 4380 | } |
8f18cf13 CM |
4381 | |
4382 | ret = btrfs_previous_item(root, path, 0, key.type); | |
67c5e7d4 | 4383 | if (ret) |
0b246afa | 4384 | mutex_unlock(&fs_info->delete_unused_bgs_mutex); |
8f18cf13 CM |
4385 | if (ret < 0) |
4386 | goto done; | |
4387 | if (ret) { | |
4388 | ret = 0; | |
b3b4aa74 | 4389 | btrfs_release_path(path); |
bf1fb512 | 4390 | break; |
8f18cf13 CM |
4391 | } |
4392 | ||
4393 | l = path->nodes[0]; | |
4394 | slot = path->slots[0]; | |
4395 | btrfs_item_key_to_cpu(l, &key, path->slots[0]); | |
4396 | ||
ba1bf481 | 4397 | if (key.objectid != device->devid) { |
0b246afa | 4398 | mutex_unlock(&fs_info->delete_unused_bgs_mutex); |
b3b4aa74 | 4399 | btrfs_release_path(path); |
bf1fb512 | 4400 | break; |
ba1bf481 | 4401 | } |
8f18cf13 CM |
4402 | |
4403 | dev_extent = btrfs_item_ptr(l, slot, struct btrfs_dev_extent); | |
4404 | length = btrfs_dev_extent_length(l, dev_extent); | |
4405 | ||
ba1bf481 | 4406 | if (key.offset + length <= new_size) { |
0b246afa | 4407 | mutex_unlock(&fs_info->delete_unused_bgs_mutex); |
b3b4aa74 | 4408 | btrfs_release_path(path); |
d6397bae | 4409 | break; |
ba1bf481 | 4410 | } |
8f18cf13 | 4411 | |
8f18cf13 | 4412 | chunk_offset = btrfs_dev_extent_chunk_offset(l, dev_extent); |
b3b4aa74 | 4413 | btrfs_release_path(path); |
8f18cf13 | 4414 | |
a6f93c71 LB |
4415 | /* |
4416 | * We may be relocating the only data chunk we have, | |
4417 | * which could potentially end up with losing data's | |
4418 | * raid profile, so lets allocate an empty one in | |
4419 | * advance. | |
4420 | */ | |
4421 | ret = btrfs_may_alloc_data_chunk(fs_info, chunk_offset); | |
4422 | if (ret < 0) { | |
4423 | mutex_unlock(&fs_info->delete_unused_bgs_mutex); | |
4424 | goto done; | |
4425 | } | |
4426 | ||
0b246afa JM |
4427 | ret = btrfs_relocate_chunk(fs_info, chunk_offset); |
4428 | mutex_unlock(&fs_info->delete_unused_bgs_mutex); | |
ba1bf481 | 4429 | if (ret && ret != -ENOSPC) |
8f18cf13 | 4430 | goto done; |
ba1bf481 JB |
4431 | if (ret == -ENOSPC) |
4432 | failed++; | |
213e64da | 4433 | } while (key.offset-- > 0); |
ba1bf481 JB |
4434 | |
4435 | if (failed && !retried) { | |
4436 | failed = 0; | |
4437 | retried = true; | |
4438 | goto again; | |
4439 | } else if (failed && retried) { | |
4440 | ret = -ENOSPC; | |
ba1bf481 | 4441 | goto done; |
8f18cf13 CM |
4442 | } |
4443 | ||
d6397bae | 4444 | /* Shrinking succeeded, else we would be at "done". */ |
a22285a6 | 4445 | trans = btrfs_start_transaction(root, 0); |
98d5dc13 TI |
4446 | if (IS_ERR(trans)) { |
4447 | ret = PTR_ERR(trans); | |
4448 | goto done; | |
4449 | } | |
4450 | ||
34441361 | 4451 | mutex_lock(&fs_info->chunk_mutex); |
53e489bc FM |
4452 | |
4453 | /* | |
4454 | * We checked in the above loop all device extents that were already in | |
4455 | * the device tree. However before we have updated the device's | |
4456 | * total_bytes to the new size, we might have had chunk allocations that | |
4457 | * have not complete yet (new block groups attached to transaction | |
4458 | * handles), and therefore their device extents were not yet in the | |
4459 | * device tree and we missed them in the loop above. So if we have any | |
4460 | * pending chunk using a device extent that overlaps the device range | |
4461 | * that we can not use anymore, commit the current transaction and | |
4462 | * repeat the search on the device tree - this way we guarantee we will | |
4463 | * not have chunks using device extents that end beyond 'new_size'. | |
4464 | */ | |
4465 | if (!checked_pending_chunks) { | |
4466 | u64 start = new_size; | |
4467 | u64 len = old_size - new_size; | |
4468 | ||
499f377f JM |
4469 | if (contains_pending_extent(trans->transaction, device, |
4470 | &start, len)) { | |
34441361 | 4471 | mutex_unlock(&fs_info->chunk_mutex); |
53e489bc FM |
4472 | checked_pending_chunks = true; |
4473 | failed = 0; | |
4474 | retried = false; | |
3a45bb20 | 4475 | ret = btrfs_commit_transaction(trans); |
53e489bc FM |
4476 | if (ret) |
4477 | goto done; | |
4478 | goto again; | |
4479 | } | |
4480 | } | |
4481 | ||
7cc8e58d | 4482 | btrfs_device_set_disk_total_bytes(device, new_size); |
935e5cc9 MX |
4483 | if (list_empty(&device->resized_list)) |
4484 | list_add_tail(&device->resized_list, | |
0b246afa | 4485 | &fs_info->fs_devices->resized_devices); |
d6397bae | 4486 | |
d6397bae | 4487 | WARN_ON(diff > old_total); |
7dfb8be1 NB |
4488 | btrfs_set_super_total_bytes(super_copy, |
4489 | round_down(old_total - diff, fs_info->sectorsize)); | |
34441361 | 4490 | mutex_unlock(&fs_info->chunk_mutex); |
2196d6e8 MX |
4491 | |
4492 | /* Now btrfs_update_device() will change the on-disk size. */ | |
4493 | ret = btrfs_update_device(trans, device); | |
801660b0 AJ |
4494 | if (ret < 0) { |
4495 | btrfs_abort_transaction(trans, ret); | |
4496 | btrfs_end_transaction(trans); | |
4497 | } else { | |
4498 | ret = btrfs_commit_transaction(trans); | |
4499 | } | |
8f18cf13 CM |
4500 | done: |
4501 | btrfs_free_path(path); | |
53e489bc | 4502 | if (ret) { |
34441361 | 4503 | mutex_lock(&fs_info->chunk_mutex); |
53e489bc | 4504 | btrfs_device_set_total_bytes(device, old_size); |
ebbede42 | 4505 | if (test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state)) |
53e489bc | 4506 | device->fs_devices->total_rw_bytes += diff; |
a5ed45f8 | 4507 | atomic64_add(diff, &fs_info->free_chunk_space); |
34441361 | 4508 | mutex_unlock(&fs_info->chunk_mutex); |
53e489bc | 4509 | } |
8f18cf13 CM |
4510 | return ret; |
4511 | } | |
4512 | ||
2ff7e61e | 4513 | static int btrfs_add_system_chunk(struct btrfs_fs_info *fs_info, |
0b86a832 CM |
4514 | struct btrfs_key *key, |
4515 | struct btrfs_chunk *chunk, int item_size) | |
4516 | { | |
0b246afa | 4517 | struct btrfs_super_block *super_copy = fs_info->super_copy; |
0b86a832 CM |
4518 | struct btrfs_disk_key disk_key; |
4519 | u32 array_size; | |
4520 | u8 *ptr; | |
4521 | ||
34441361 | 4522 | mutex_lock(&fs_info->chunk_mutex); |
0b86a832 | 4523 | array_size = btrfs_super_sys_array_size(super_copy); |
5f43f86e | 4524 | if (array_size + item_size + sizeof(disk_key) |
fe48a5c0 | 4525 | > BTRFS_SYSTEM_CHUNK_ARRAY_SIZE) { |
34441361 | 4526 | mutex_unlock(&fs_info->chunk_mutex); |
0b86a832 | 4527 | return -EFBIG; |
fe48a5c0 | 4528 | } |
0b86a832 CM |
4529 | |
4530 | ptr = super_copy->sys_chunk_array + array_size; | |
4531 | btrfs_cpu_key_to_disk(&disk_key, key); | |
4532 | memcpy(ptr, &disk_key, sizeof(disk_key)); | |
4533 | ptr += sizeof(disk_key); | |
4534 | memcpy(ptr, chunk, item_size); | |
4535 | item_size += sizeof(disk_key); | |
4536 | btrfs_set_super_sys_array_size(super_copy, array_size + item_size); | |
34441361 | 4537 | mutex_unlock(&fs_info->chunk_mutex); |
fe48a5c0 | 4538 | |
0b86a832 CM |
4539 | return 0; |
4540 | } | |
4541 | ||
73c5de00 AJ |
4542 | /* |
4543 | * sort the devices in descending order by max_avail, total_avail | |
4544 | */ | |
4545 | static int btrfs_cmp_device_info(const void *a, const void *b) | |
9b3f68b9 | 4546 | { |
73c5de00 AJ |
4547 | const struct btrfs_device_info *di_a = a; |
4548 | const struct btrfs_device_info *di_b = b; | |
9b3f68b9 | 4549 | |
73c5de00 | 4550 | if (di_a->max_avail > di_b->max_avail) |
b2117a39 | 4551 | return -1; |
73c5de00 | 4552 | if (di_a->max_avail < di_b->max_avail) |
b2117a39 | 4553 | return 1; |
73c5de00 AJ |
4554 | if (di_a->total_avail > di_b->total_avail) |
4555 | return -1; | |
4556 | if (di_a->total_avail < di_b->total_avail) | |
4557 | return 1; | |
4558 | return 0; | |
b2117a39 | 4559 | } |
0b86a832 | 4560 | |
53b381b3 DW |
4561 | static void check_raid56_incompat_flag(struct btrfs_fs_info *info, u64 type) |
4562 | { | |
ffe2d203 | 4563 | if (!(type & BTRFS_BLOCK_GROUP_RAID56_MASK)) |
53b381b3 DW |
4564 | return; |
4565 | ||
ceda0864 | 4566 | btrfs_set_fs_incompat(info, RAID56); |
53b381b3 DW |
4567 | } |
4568 | ||
062d4d1f | 4569 | #define BTRFS_MAX_DEVS(info) ((BTRFS_MAX_ITEM_SIZE(info) \ |
23f8f9b7 GH |
4570 | - sizeof(struct btrfs_chunk)) \ |
4571 | / sizeof(struct btrfs_stripe) + 1) | |
4572 | ||
4573 | #define BTRFS_MAX_DEVS_SYS_CHUNK ((BTRFS_SYSTEM_CHUNK_ARRAY_SIZE \ | |
4574 | - 2 * sizeof(struct btrfs_disk_key) \ | |
4575 | - 2 * sizeof(struct btrfs_chunk)) \ | |
4576 | / sizeof(struct btrfs_stripe) + 1) | |
4577 | ||
73c5de00 | 4578 | static int __btrfs_alloc_chunk(struct btrfs_trans_handle *trans, |
72b468c8 | 4579 | u64 start, u64 type) |
b2117a39 | 4580 | { |
2ff7e61e | 4581 | struct btrfs_fs_info *info = trans->fs_info; |
73c5de00 | 4582 | struct btrfs_fs_devices *fs_devices = info->fs_devices; |
ebcc9301 | 4583 | struct btrfs_device *device; |
73c5de00 AJ |
4584 | struct map_lookup *map = NULL; |
4585 | struct extent_map_tree *em_tree; | |
4586 | struct extent_map *em; | |
4587 | struct btrfs_device_info *devices_info = NULL; | |
4588 | u64 total_avail; | |
4589 | int num_stripes; /* total number of stripes to allocate */ | |
53b381b3 DW |
4590 | int data_stripes; /* number of stripes that count for |
4591 | block group size */ | |
73c5de00 AJ |
4592 | int sub_stripes; /* sub_stripes info for map */ |
4593 | int dev_stripes; /* stripes per dev */ | |
4594 | int devs_max; /* max devs to use */ | |
4595 | int devs_min; /* min devs needed */ | |
4596 | int devs_increment; /* ndevs has to be a multiple of this */ | |
4597 | int ncopies; /* how many copies to data has */ | |
4598 | int ret; | |
4599 | u64 max_stripe_size; | |
4600 | u64 max_chunk_size; | |
4601 | u64 stripe_size; | |
4602 | u64 num_bytes; | |
4603 | int ndevs; | |
4604 | int i; | |
4605 | int j; | |
31e50229 | 4606 | int index; |
593060d7 | 4607 | |
0c460c0d | 4608 | BUG_ON(!alloc_profile_is_valid(type, 0)); |
9b3f68b9 | 4609 | |
4117f207 QW |
4610 | if (list_empty(&fs_devices->alloc_list)) { |
4611 | if (btrfs_test_opt(info, ENOSPC_DEBUG)) | |
4612 | btrfs_debug(info, "%s: no writable device", __func__); | |
73c5de00 | 4613 | return -ENOSPC; |
4117f207 | 4614 | } |
b2117a39 | 4615 | |
3e72ee88 | 4616 | index = btrfs_bg_flags_to_raid_index(type); |
73c5de00 | 4617 | |
31e50229 LB |
4618 | sub_stripes = btrfs_raid_array[index].sub_stripes; |
4619 | dev_stripes = btrfs_raid_array[index].dev_stripes; | |
4620 | devs_max = btrfs_raid_array[index].devs_max; | |
4621 | devs_min = btrfs_raid_array[index].devs_min; | |
4622 | devs_increment = btrfs_raid_array[index].devs_increment; | |
4623 | ncopies = btrfs_raid_array[index].ncopies; | |
b2117a39 | 4624 | |
9b3f68b9 | 4625 | if (type & BTRFS_BLOCK_GROUP_DATA) { |
ee22184b | 4626 | max_stripe_size = SZ_1G; |
fce466ea | 4627 | max_chunk_size = BTRFS_MAX_DATA_CHUNK_SIZE; |
23f8f9b7 | 4628 | if (!devs_max) |
062d4d1f | 4629 | devs_max = BTRFS_MAX_DEVS(info); |
9b3f68b9 | 4630 | } else if (type & BTRFS_BLOCK_GROUP_METADATA) { |
1100373f | 4631 | /* for larger filesystems, use larger metadata chunks */ |
ee22184b BL |
4632 | if (fs_devices->total_rw_bytes > 50ULL * SZ_1G) |
4633 | max_stripe_size = SZ_1G; | |
1100373f | 4634 | else |
ee22184b | 4635 | max_stripe_size = SZ_256M; |
73c5de00 | 4636 | max_chunk_size = max_stripe_size; |
23f8f9b7 | 4637 | if (!devs_max) |
062d4d1f | 4638 | devs_max = BTRFS_MAX_DEVS(info); |
a40a90a0 | 4639 | } else if (type & BTRFS_BLOCK_GROUP_SYSTEM) { |
ee22184b | 4640 | max_stripe_size = SZ_32M; |
73c5de00 | 4641 | max_chunk_size = 2 * max_stripe_size; |
23f8f9b7 GH |
4642 | if (!devs_max) |
4643 | devs_max = BTRFS_MAX_DEVS_SYS_CHUNK; | |
73c5de00 | 4644 | } else { |
351fd353 | 4645 | btrfs_err(info, "invalid chunk type 0x%llx requested", |
73c5de00 AJ |
4646 | type); |
4647 | BUG_ON(1); | |
9b3f68b9 CM |
4648 | } |
4649 | ||
2b82032c YZ |
4650 | /* we don't want a chunk larger than 10% of writeable space */ |
4651 | max_chunk_size = min(div_factor(fs_devices->total_rw_bytes, 1), | |
4652 | max_chunk_size); | |
9b3f68b9 | 4653 | |
31e818fe | 4654 | devices_info = kcalloc(fs_devices->rw_devices, sizeof(*devices_info), |
73c5de00 AJ |
4655 | GFP_NOFS); |
4656 | if (!devices_info) | |
4657 | return -ENOMEM; | |
0cad8a11 | 4658 | |
9f680ce0 | 4659 | /* |
73c5de00 AJ |
4660 | * in the first pass through the devices list, we gather information |
4661 | * about the available holes on each device. | |
9f680ce0 | 4662 | */ |
73c5de00 | 4663 | ndevs = 0; |
ebcc9301 | 4664 | list_for_each_entry(device, &fs_devices->alloc_list, dev_alloc_list) { |
73c5de00 AJ |
4665 | u64 max_avail; |
4666 | u64 dev_offset; | |
b2117a39 | 4667 | |
ebbede42 | 4668 | if (!test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state)) { |
31b1a2bd | 4669 | WARN(1, KERN_ERR |
efe120a0 | 4670 | "BTRFS: read-only device in alloc_list\n"); |
73c5de00 AJ |
4671 | continue; |
4672 | } | |
b2117a39 | 4673 | |
e12c9621 AJ |
4674 | if (!test_bit(BTRFS_DEV_STATE_IN_FS_METADATA, |
4675 | &device->dev_state) || | |
401e29c1 | 4676 | test_bit(BTRFS_DEV_STATE_REPLACE_TGT, &device->dev_state)) |
73c5de00 | 4677 | continue; |
b2117a39 | 4678 | |
73c5de00 AJ |
4679 | if (device->total_bytes > device->bytes_used) |
4680 | total_avail = device->total_bytes - device->bytes_used; | |
4681 | else | |
4682 | total_avail = 0; | |
38c01b96 | 4683 | |
4684 | /* If there is no space on this device, skip it. */ | |
4685 | if (total_avail == 0) | |
4686 | continue; | |
b2117a39 | 4687 | |
6df9a95e | 4688 | ret = find_free_dev_extent(trans, device, |
73c5de00 AJ |
4689 | max_stripe_size * dev_stripes, |
4690 | &dev_offset, &max_avail); | |
4691 | if (ret && ret != -ENOSPC) | |
4692 | goto error; | |
b2117a39 | 4693 | |
73c5de00 AJ |
4694 | if (ret == 0) |
4695 | max_avail = max_stripe_size * dev_stripes; | |
b2117a39 | 4696 | |
4117f207 QW |
4697 | if (max_avail < BTRFS_STRIPE_LEN * dev_stripes) { |
4698 | if (btrfs_test_opt(info, ENOSPC_DEBUG)) | |
4699 | btrfs_debug(info, | |
4700 | "%s: devid %llu has no free space, have=%llu want=%u", | |
4701 | __func__, device->devid, max_avail, | |
4702 | BTRFS_STRIPE_LEN * dev_stripes); | |
73c5de00 | 4703 | continue; |
4117f207 | 4704 | } |
b2117a39 | 4705 | |
063d006f ES |
4706 | if (ndevs == fs_devices->rw_devices) { |
4707 | WARN(1, "%s: found more than %llu devices\n", | |
4708 | __func__, fs_devices->rw_devices); | |
4709 | break; | |
4710 | } | |
73c5de00 AJ |
4711 | devices_info[ndevs].dev_offset = dev_offset; |
4712 | devices_info[ndevs].max_avail = max_avail; | |
4713 | devices_info[ndevs].total_avail = total_avail; | |
4714 | devices_info[ndevs].dev = device; | |
4715 | ++ndevs; | |
4716 | } | |
b2117a39 | 4717 | |
73c5de00 AJ |
4718 | /* |
4719 | * now sort the devices by hole size / available space | |
4720 | */ | |
4721 | sort(devices_info, ndevs, sizeof(struct btrfs_device_info), | |
4722 | btrfs_cmp_device_info, NULL); | |
b2117a39 | 4723 | |
73c5de00 | 4724 | /* round down to number of usable stripes */ |
e5600fd6 | 4725 | ndevs = round_down(ndevs, devs_increment); |
b2117a39 | 4726 | |
ba89b802 | 4727 | if (ndevs < devs_min) { |
73c5de00 | 4728 | ret = -ENOSPC; |
4117f207 QW |
4729 | if (btrfs_test_opt(info, ENOSPC_DEBUG)) { |
4730 | btrfs_debug(info, | |
4731 | "%s: not enough devices with free space: have=%d minimum required=%d", | |
ba89b802 | 4732 | __func__, ndevs, devs_min); |
4117f207 | 4733 | } |
73c5de00 | 4734 | goto error; |
b2117a39 | 4735 | } |
9f680ce0 | 4736 | |
f148ef4d NB |
4737 | ndevs = min(ndevs, devs_max); |
4738 | ||
73c5de00 | 4739 | /* |
92e222df HK |
4740 | * The primary goal is to maximize the number of stripes, so use as |
4741 | * many devices as possible, even if the stripes are not maximum sized. | |
4742 | * | |
4743 | * The DUP profile stores more than one stripe per device, the | |
4744 | * max_avail is the total size so we have to adjust. | |
73c5de00 | 4745 | */ |
92e222df | 4746 | stripe_size = div_u64(devices_info[ndevs - 1].max_avail, dev_stripes); |
73c5de00 | 4747 | num_stripes = ndevs * dev_stripes; |
b2117a39 | 4748 | |
53b381b3 DW |
4749 | /* |
4750 | * this will have to be fixed for RAID1 and RAID10 over | |
4751 | * more drives | |
4752 | */ | |
4753 | data_stripes = num_stripes / ncopies; | |
4754 | ||
500ceed8 | 4755 | if (type & BTRFS_BLOCK_GROUP_RAID5) |
53b381b3 | 4756 | data_stripes = num_stripes - 1; |
500ceed8 NB |
4757 | |
4758 | if (type & BTRFS_BLOCK_GROUP_RAID6) | |
53b381b3 | 4759 | data_stripes = num_stripes - 2; |
86db2578 CM |
4760 | |
4761 | /* | |
4762 | * Use the number of data stripes to figure out how big this chunk | |
4763 | * is really going to be in terms of logical address space, | |
4764 | * and compare that answer with the max chunk size | |
4765 | */ | |
4766 | if (stripe_size * data_stripes > max_chunk_size) { | |
b8b93add | 4767 | stripe_size = div_u64(max_chunk_size, data_stripes); |
86db2578 CM |
4768 | |
4769 | /* bump the answer up to a 16MB boundary */ | |
793ff2c8 | 4770 | stripe_size = round_up(stripe_size, SZ_16M); |
86db2578 | 4771 | |
793ff2c8 QW |
4772 | /* |
4773 | * But don't go higher than the limits we found while searching | |
4774 | * for free extents | |
86db2578 | 4775 | */ |
793ff2c8 QW |
4776 | stripe_size = min(devices_info[ndevs - 1].max_avail, |
4777 | stripe_size); | |
86db2578 CM |
4778 | } |
4779 | ||
37db63a4 | 4780 | /* align to BTRFS_STRIPE_LEN */ |
500ceed8 | 4781 | stripe_size = round_down(stripe_size, BTRFS_STRIPE_LEN); |
b2117a39 MX |
4782 | |
4783 | map = kmalloc(map_lookup_size(num_stripes), GFP_NOFS); | |
4784 | if (!map) { | |
4785 | ret = -ENOMEM; | |
4786 | goto error; | |
4787 | } | |
4788 | map->num_stripes = num_stripes; | |
9b3f68b9 | 4789 | |
73c5de00 AJ |
4790 | for (i = 0; i < ndevs; ++i) { |
4791 | for (j = 0; j < dev_stripes; ++j) { | |
4792 | int s = i * dev_stripes + j; | |
4793 | map->stripes[s].dev = devices_info[i].dev; | |
4794 | map->stripes[s].physical = devices_info[i].dev_offset + | |
4795 | j * stripe_size; | |
6324fbf3 | 4796 | } |
6324fbf3 | 4797 | } |
500ceed8 NB |
4798 | map->stripe_len = BTRFS_STRIPE_LEN; |
4799 | map->io_align = BTRFS_STRIPE_LEN; | |
4800 | map->io_width = BTRFS_STRIPE_LEN; | |
2b82032c | 4801 | map->type = type; |
2b82032c | 4802 | map->sub_stripes = sub_stripes; |
0b86a832 | 4803 | |
53b381b3 | 4804 | num_bytes = stripe_size * data_stripes; |
0b86a832 | 4805 | |
6bccf3ab | 4806 | trace_btrfs_chunk_alloc(info, map, start, num_bytes); |
1abe9b8a | 4807 | |
172ddd60 | 4808 | em = alloc_extent_map(); |
2b82032c | 4809 | if (!em) { |
298a8f9c | 4810 | kfree(map); |
b2117a39 MX |
4811 | ret = -ENOMEM; |
4812 | goto error; | |
593060d7 | 4813 | } |
298a8f9c | 4814 | set_bit(EXTENT_FLAG_FS_MAPPING, &em->flags); |
95617d69 | 4815 | em->map_lookup = map; |
2b82032c | 4816 | em->start = start; |
73c5de00 | 4817 | em->len = num_bytes; |
2b82032c YZ |
4818 | em->block_start = 0; |
4819 | em->block_len = em->len; | |
6df9a95e | 4820 | em->orig_block_len = stripe_size; |
593060d7 | 4821 | |
0b246afa | 4822 | em_tree = &info->mapping_tree.map_tree; |
890871be | 4823 | write_lock(&em_tree->lock); |
09a2a8f9 | 4824 | ret = add_extent_mapping(em_tree, em, 0); |
0f5d42b2 | 4825 | if (ret) { |
1efb72a3 | 4826 | write_unlock(&em_tree->lock); |
0f5d42b2 | 4827 | free_extent_map(em); |
1dd4602f | 4828 | goto error; |
0f5d42b2 | 4829 | } |
0b86a832 | 4830 | |
1efb72a3 NB |
4831 | list_add_tail(&em->list, &trans->transaction->pending_chunks); |
4832 | refcount_inc(&em->refs); | |
4833 | write_unlock(&em_tree->lock); | |
4834 | ||
e7e02096 | 4835 | ret = btrfs_make_block_group(trans, 0, type, start, num_bytes); |
6df9a95e JB |
4836 | if (ret) |
4837 | goto error_del_extent; | |
2b82032c | 4838 | |
7cc8e58d MX |
4839 | for (i = 0; i < map->num_stripes; i++) { |
4840 | num_bytes = map->stripes[i].dev->bytes_used + stripe_size; | |
4841 | btrfs_device_set_bytes_used(map->stripes[i].dev, num_bytes); | |
4842 | } | |
43530c46 | 4843 | |
a5ed45f8 | 4844 | atomic64_sub(stripe_size * map->num_stripes, &info->free_chunk_space); |
1c116187 | 4845 | |
0f5d42b2 | 4846 | free_extent_map(em); |
0b246afa | 4847 | check_raid56_incompat_flag(info, type); |
53b381b3 | 4848 | |
b2117a39 | 4849 | kfree(devices_info); |
2b82032c | 4850 | return 0; |
b2117a39 | 4851 | |
6df9a95e | 4852 | error_del_extent: |
0f5d42b2 JB |
4853 | write_lock(&em_tree->lock); |
4854 | remove_extent_mapping(em_tree, em); | |
4855 | write_unlock(&em_tree->lock); | |
4856 | ||
4857 | /* One for our allocation */ | |
4858 | free_extent_map(em); | |
4859 | /* One for the tree reference */ | |
4860 | free_extent_map(em); | |
495e64f4 FM |
4861 | /* One for the pending_chunks list reference */ |
4862 | free_extent_map(em); | |
b2117a39 | 4863 | error: |
b2117a39 MX |
4864 | kfree(devices_info); |
4865 | return ret; | |
2b82032c YZ |
4866 | } |
4867 | ||
6df9a95e | 4868 | int btrfs_finish_chunk_alloc(struct btrfs_trans_handle *trans, |
97aff912 | 4869 | u64 chunk_offset, u64 chunk_size) |
2b82032c | 4870 | { |
97aff912 | 4871 | struct btrfs_fs_info *fs_info = trans->fs_info; |
6bccf3ab JM |
4872 | struct btrfs_root *extent_root = fs_info->extent_root; |
4873 | struct btrfs_root *chunk_root = fs_info->chunk_root; | |
2b82032c | 4874 | struct btrfs_key key; |
2b82032c YZ |
4875 | struct btrfs_device *device; |
4876 | struct btrfs_chunk *chunk; | |
4877 | struct btrfs_stripe *stripe; | |
6df9a95e JB |
4878 | struct extent_map *em; |
4879 | struct map_lookup *map; | |
4880 | size_t item_size; | |
4881 | u64 dev_offset; | |
4882 | u64 stripe_size; | |
4883 | int i = 0; | |
140e639f | 4884 | int ret = 0; |
2b82032c | 4885 | |
592d92ee LB |
4886 | em = get_chunk_map(fs_info, chunk_offset, chunk_size); |
4887 | if (IS_ERR(em)) | |
4888 | return PTR_ERR(em); | |
6df9a95e | 4889 | |
95617d69 | 4890 | map = em->map_lookup; |
6df9a95e JB |
4891 | item_size = btrfs_chunk_item_size(map->num_stripes); |
4892 | stripe_size = em->orig_block_len; | |
4893 | ||
2b82032c | 4894 | chunk = kzalloc(item_size, GFP_NOFS); |
6df9a95e JB |
4895 | if (!chunk) { |
4896 | ret = -ENOMEM; | |
4897 | goto out; | |
4898 | } | |
4899 | ||
50460e37 FM |
4900 | /* |
4901 | * Take the device list mutex to prevent races with the final phase of | |
4902 | * a device replace operation that replaces the device object associated | |
4903 | * with the map's stripes, because the device object's id can change | |
4904 | * at any time during that final phase of the device replace operation | |
4905 | * (dev-replace.c:btrfs_dev_replace_finishing()). | |
4906 | */ | |
0b246afa | 4907 | mutex_lock(&fs_info->fs_devices->device_list_mutex); |
6df9a95e JB |
4908 | for (i = 0; i < map->num_stripes; i++) { |
4909 | device = map->stripes[i].dev; | |
4910 | dev_offset = map->stripes[i].physical; | |
2b82032c | 4911 | |
0b86a832 | 4912 | ret = btrfs_update_device(trans, device); |
3acd3953 | 4913 | if (ret) |
50460e37 | 4914 | break; |
b5d9071c NB |
4915 | ret = btrfs_alloc_dev_extent(trans, device, chunk_offset, |
4916 | dev_offset, stripe_size); | |
6df9a95e | 4917 | if (ret) |
50460e37 FM |
4918 | break; |
4919 | } | |
4920 | if (ret) { | |
0b246afa | 4921 | mutex_unlock(&fs_info->fs_devices->device_list_mutex); |
50460e37 | 4922 | goto out; |
2b82032c YZ |
4923 | } |
4924 | ||
2b82032c | 4925 | stripe = &chunk->stripe; |
6df9a95e JB |
4926 | for (i = 0; i < map->num_stripes; i++) { |
4927 | device = map->stripes[i].dev; | |
4928 | dev_offset = map->stripes[i].physical; | |
0b86a832 | 4929 | |
e17cade2 CM |
4930 | btrfs_set_stack_stripe_devid(stripe, device->devid); |
4931 | btrfs_set_stack_stripe_offset(stripe, dev_offset); | |
4932 | memcpy(stripe->dev_uuid, device->uuid, BTRFS_UUID_SIZE); | |
2b82032c | 4933 | stripe++; |
0b86a832 | 4934 | } |
0b246afa | 4935 | mutex_unlock(&fs_info->fs_devices->device_list_mutex); |
0b86a832 | 4936 | |
2b82032c | 4937 | btrfs_set_stack_chunk_length(chunk, chunk_size); |
0b86a832 | 4938 | btrfs_set_stack_chunk_owner(chunk, extent_root->root_key.objectid); |
2b82032c YZ |
4939 | btrfs_set_stack_chunk_stripe_len(chunk, map->stripe_len); |
4940 | btrfs_set_stack_chunk_type(chunk, map->type); | |
4941 | btrfs_set_stack_chunk_num_stripes(chunk, map->num_stripes); | |
4942 | btrfs_set_stack_chunk_io_align(chunk, map->stripe_len); | |
4943 | btrfs_set_stack_chunk_io_width(chunk, map->stripe_len); | |
0b246afa | 4944 | btrfs_set_stack_chunk_sector_size(chunk, fs_info->sectorsize); |
2b82032c | 4945 | btrfs_set_stack_chunk_sub_stripes(chunk, map->sub_stripes); |
0b86a832 | 4946 | |
2b82032c YZ |
4947 | key.objectid = BTRFS_FIRST_CHUNK_TREE_OBJECTID; |
4948 | key.type = BTRFS_CHUNK_ITEM_KEY; | |
4949 | key.offset = chunk_offset; | |
0b86a832 | 4950 | |
2b82032c | 4951 | ret = btrfs_insert_item(trans, chunk_root, &key, chunk, item_size); |
4ed1d16e MF |
4952 | if (ret == 0 && map->type & BTRFS_BLOCK_GROUP_SYSTEM) { |
4953 | /* | |
4954 | * TODO: Cleanup of inserted chunk root in case of | |
4955 | * failure. | |
4956 | */ | |
2ff7e61e | 4957 | ret = btrfs_add_system_chunk(fs_info, &key, chunk, item_size); |
8f18cf13 | 4958 | } |
1abe9b8a | 4959 | |
6df9a95e | 4960 | out: |
0b86a832 | 4961 | kfree(chunk); |
6df9a95e | 4962 | free_extent_map(em); |
4ed1d16e | 4963 | return ret; |
2b82032c | 4964 | } |
0b86a832 | 4965 | |
2b82032c YZ |
4966 | /* |
4967 | * Chunk allocation falls into two parts. The first part does works | |
4968 | * that make the new allocated chunk useable, but not do any operation | |
4969 | * that modifies the chunk tree. The second part does the works that | |
4970 | * require modifying the chunk tree. This division is important for the | |
4971 | * bootstrap process of adding storage to a seed btrfs. | |
4972 | */ | |
c216b203 | 4973 | int btrfs_alloc_chunk(struct btrfs_trans_handle *trans, u64 type) |
2b82032c YZ |
4974 | { |
4975 | u64 chunk_offset; | |
2b82032c | 4976 | |
c216b203 NB |
4977 | lockdep_assert_held(&trans->fs_info->chunk_mutex); |
4978 | chunk_offset = find_next_chunk(trans->fs_info); | |
72b468c8 | 4979 | return __btrfs_alloc_chunk(trans, chunk_offset, type); |
2b82032c YZ |
4980 | } |
4981 | ||
d397712b | 4982 | static noinline int init_first_rw_device(struct btrfs_trans_handle *trans, |
e4a4dce7 | 4983 | struct btrfs_fs_info *fs_info) |
2b82032c YZ |
4984 | { |
4985 | u64 chunk_offset; | |
4986 | u64 sys_chunk_offset; | |
2b82032c | 4987 | u64 alloc_profile; |
2b82032c YZ |
4988 | int ret; |
4989 | ||
6df9a95e | 4990 | chunk_offset = find_next_chunk(fs_info); |
1b86826d | 4991 | alloc_profile = btrfs_metadata_alloc_profile(fs_info); |
72b468c8 | 4992 | ret = __btrfs_alloc_chunk(trans, chunk_offset, alloc_profile); |
79787eaa JM |
4993 | if (ret) |
4994 | return ret; | |
2b82032c | 4995 | |
0b246afa | 4996 | sys_chunk_offset = find_next_chunk(fs_info); |
1b86826d | 4997 | alloc_profile = btrfs_system_alloc_profile(fs_info); |
72b468c8 | 4998 | ret = __btrfs_alloc_chunk(trans, sys_chunk_offset, alloc_profile); |
79787eaa | 4999 | return ret; |
2b82032c YZ |
5000 | } |
5001 | ||
d20983b4 MX |
5002 | static inline int btrfs_chunk_max_errors(struct map_lookup *map) |
5003 | { | |
5004 | int max_errors; | |
5005 | ||
5006 | if (map->type & (BTRFS_BLOCK_GROUP_RAID1 | | |
5007 | BTRFS_BLOCK_GROUP_RAID10 | | |
5008 | BTRFS_BLOCK_GROUP_RAID5 | | |
5009 | BTRFS_BLOCK_GROUP_DUP)) { | |
5010 | max_errors = 1; | |
5011 | } else if (map->type & BTRFS_BLOCK_GROUP_RAID6) { | |
5012 | max_errors = 2; | |
5013 | } else { | |
5014 | max_errors = 0; | |
005d6427 | 5015 | } |
2b82032c | 5016 | |
d20983b4 | 5017 | return max_errors; |
2b82032c YZ |
5018 | } |
5019 | ||
2ff7e61e | 5020 | int btrfs_chunk_readonly(struct btrfs_fs_info *fs_info, u64 chunk_offset) |
2b82032c YZ |
5021 | { |
5022 | struct extent_map *em; | |
5023 | struct map_lookup *map; | |
2b82032c | 5024 | int readonly = 0; |
d20983b4 | 5025 | int miss_ndevs = 0; |
2b82032c YZ |
5026 | int i; |
5027 | ||
592d92ee LB |
5028 | em = get_chunk_map(fs_info, chunk_offset, 1); |
5029 | if (IS_ERR(em)) | |
2b82032c YZ |
5030 | return 1; |
5031 | ||
95617d69 | 5032 | map = em->map_lookup; |
2b82032c | 5033 | for (i = 0; i < map->num_stripes; i++) { |
e6e674bd AJ |
5034 | if (test_bit(BTRFS_DEV_STATE_MISSING, |
5035 | &map->stripes[i].dev->dev_state)) { | |
d20983b4 MX |
5036 | miss_ndevs++; |
5037 | continue; | |
5038 | } | |
ebbede42 AJ |
5039 | if (!test_bit(BTRFS_DEV_STATE_WRITEABLE, |
5040 | &map->stripes[i].dev->dev_state)) { | |
2b82032c | 5041 | readonly = 1; |
d20983b4 | 5042 | goto end; |
2b82032c YZ |
5043 | } |
5044 | } | |
d20983b4 MX |
5045 | |
5046 | /* | |
5047 | * If the number of missing devices is larger than max errors, | |
5048 | * we can not write the data into that chunk successfully, so | |
5049 | * set it readonly. | |
5050 | */ | |
5051 | if (miss_ndevs > btrfs_chunk_max_errors(map)) | |
5052 | readonly = 1; | |
5053 | end: | |
0b86a832 | 5054 | free_extent_map(em); |
2b82032c | 5055 | return readonly; |
0b86a832 CM |
5056 | } |
5057 | ||
5058 | void btrfs_mapping_init(struct btrfs_mapping_tree *tree) | |
5059 | { | |
a8067e02 | 5060 | extent_map_tree_init(&tree->map_tree); |
0b86a832 CM |
5061 | } |
5062 | ||
5063 | void btrfs_mapping_tree_free(struct btrfs_mapping_tree *tree) | |
5064 | { | |
5065 | struct extent_map *em; | |
5066 | ||
d397712b | 5067 | while (1) { |
890871be | 5068 | write_lock(&tree->map_tree.lock); |
0b86a832 CM |
5069 | em = lookup_extent_mapping(&tree->map_tree, 0, (u64)-1); |
5070 | if (em) | |
5071 | remove_extent_mapping(&tree->map_tree, em); | |
890871be | 5072 | write_unlock(&tree->map_tree.lock); |
0b86a832 CM |
5073 | if (!em) |
5074 | break; | |
0b86a832 CM |
5075 | /* once for us */ |
5076 | free_extent_map(em); | |
5077 | /* once for the tree */ | |
5078 | free_extent_map(em); | |
5079 | } | |
5080 | } | |
5081 | ||
5d964051 | 5082 | int btrfs_num_copies(struct btrfs_fs_info *fs_info, u64 logical, u64 len) |
f188591e CM |
5083 | { |
5084 | struct extent_map *em; | |
5085 | struct map_lookup *map; | |
f188591e CM |
5086 | int ret; |
5087 | ||
592d92ee LB |
5088 | em = get_chunk_map(fs_info, logical, len); |
5089 | if (IS_ERR(em)) | |
5090 | /* | |
5091 | * We could return errors for these cases, but that could get | |
5092 | * ugly and we'd probably do the same thing which is just not do | |
5093 | * anything else and exit, so return 1 so the callers don't try | |
5094 | * to use other copies. | |
5095 | */ | |
fb7669b5 | 5096 | return 1; |
fb7669b5 | 5097 | |
95617d69 | 5098 | map = em->map_lookup; |
f188591e CM |
5099 | if (map->type & (BTRFS_BLOCK_GROUP_DUP | BTRFS_BLOCK_GROUP_RAID1)) |
5100 | ret = map->num_stripes; | |
321aecc6 CM |
5101 | else if (map->type & BTRFS_BLOCK_GROUP_RAID10) |
5102 | ret = map->sub_stripes; | |
53b381b3 DW |
5103 | else if (map->type & BTRFS_BLOCK_GROUP_RAID5) |
5104 | ret = 2; | |
5105 | else if (map->type & BTRFS_BLOCK_GROUP_RAID6) | |
8810f751 LB |
5106 | /* |
5107 | * There could be two corrupted data stripes, we need | |
5108 | * to loop retry in order to rebuild the correct data. | |
e7e02096 | 5109 | * |
8810f751 LB |
5110 | * Fail a stripe at a time on every retry except the |
5111 | * stripe under reconstruction. | |
5112 | */ | |
5113 | ret = map->num_stripes; | |
f188591e CM |
5114 | else |
5115 | ret = 1; | |
5116 | free_extent_map(em); | |
ad6d620e | 5117 | |
7e79cb86 | 5118 | btrfs_dev_replace_read_lock(&fs_info->dev_replace); |
6fad823f LB |
5119 | if (btrfs_dev_replace_is_ongoing(&fs_info->dev_replace) && |
5120 | fs_info->dev_replace.tgtdev) | |
ad6d620e | 5121 | ret++; |
7e79cb86 | 5122 | btrfs_dev_replace_read_unlock(&fs_info->dev_replace); |
ad6d620e | 5123 | |
f188591e CM |
5124 | return ret; |
5125 | } | |
5126 | ||
2ff7e61e | 5127 | unsigned long btrfs_full_stripe_len(struct btrfs_fs_info *fs_info, |
53b381b3 DW |
5128 | u64 logical) |
5129 | { | |
5130 | struct extent_map *em; | |
5131 | struct map_lookup *map; | |
0b246afa | 5132 | unsigned long len = fs_info->sectorsize; |
53b381b3 | 5133 | |
592d92ee | 5134 | em = get_chunk_map(fs_info, logical, len); |
53b381b3 | 5135 | |
69f03f13 NB |
5136 | if (!WARN_ON(IS_ERR(em))) { |
5137 | map = em->map_lookup; | |
5138 | if (map->type & BTRFS_BLOCK_GROUP_RAID56_MASK) | |
5139 | len = map->stripe_len * nr_data_stripes(map); | |
5140 | free_extent_map(em); | |
5141 | } | |
53b381b3 DW |
5142 | return len; |
5143 | } | |
5144 | ||
e4ff5fb5 | 5145 | int btrfs_is_parity_mirror(struct btrfs_fs_info *fs_info, u64 logical, u64 len) |
53b381b3 DW |
5146 | { |
5147 | struct extent_map *em; | |
5148 | struct map_lookup *map; | |
53b381b3 DW |
5149 | int ret = 0; |
5150 | ||
592d92ee | 5151 | em = get_chunk_map(fs_info, logical, len); |
53b381b3 | 5152 | |
69f03f13 NB |
5153 | if(!WARN_ON(IS_ERR(em))) { |
5154 | map = em->map_lookup; | |
5155 | if (map->type & BTRFS_BLOCK_GROUP_RAID56_MASK) | |
5156 | ret = 1; | |
5157 | free_extent_map(em); | |
5158 | } | |
53b381b3 DW |
5159 | return ret; |
5160 | } | |
5161 | ||
30d9861f | 5162 | static int find_live_mirror(struct btrfs_fs_info *fs_info, |
99f92a7c | 5163 | struct map_lookup *map, int first, |
8ba0ae78 | 5164 | int dev_replace_is_ongoing) |
dfe25020 CM |
5165 | { |
5166 | int i; | |
99f92a7c | 5167 | int num_stripes; |
8ba0ae78 | 5168 | int preferred_mirror; |
30d9861f SB |
5169 | int tolerance; |
5170 | struct btrfs_device *srcdev; | |
5171 | ||
99f92a7c AJ |
5172 | ASSERT((map->type & |
5173 | (BTRFS_BLOCK_GROUP_RAID1 | BTRFS_BLOCK_GROUP_RAID10))); | |
5174 | ||
5175 | if (map->type & BTRFS_BLOCK_GROUP_RAID10) | |
5176 | num_stripes = map->sub_stripes; | |
5177 | else | |
5178 | num_stripes = map->num_stripes; | |
5179 | ||
8ba0ae78 AJ |
5180 | preferred_mirror = first + current->pid % num_stripes; |
5181 | ||
30d9861f SB |
5182 | if (dev_replace_is_ongoing && |
5183 | fs_info->dev_replace.cont_reading_from_srcdev_mode == | |
5184 | BTRFS_DEV_REPLACE_ITEM_CONT_READING_FROM_SRCDEV_MODE_AVOID) | |
5185 | srcdev = fs_info->dev_replace.srcdev; | |
5186 | else | |
5187 | srcdev = NULL; | |
5188 | ||
5189 | /* | |
5190 | * try to avoid the drive that is the source drive for a | |
5191 | * dev-replace procedure, only choose it if no other non-missing | |
5192 | * mirror is available | |
5193 | */ | |
5194 | for (tolerance = 0; tolerance < 2; tolerance++) { | |
8ba0ae78 AJ |
5195 | if (map->stripes[preferred_mirror].dev->bdev && |
5196 | (tolerance || map->stripes[preferred_mirror].dev != srcdev)) | |
5197 | return preferred_mirror; | |
99f92a7c | 5198 | for (i = first; i < first + num_stripes; i++) { |
30d9861f SB |
5199 | if (map->stripes[i].dev->bdev && |
5200 | (tolerance || map->stripes[i].dev != srcdev)) | |
5201 | return i; | |
5202 | } | |
dfe25020 | 5203 | } |
30d9861f | 5204 | |
dfe25020 CM |
5205 | /* we couldn't find one that doesn't fail. Just return something |
5206 | * and the io error handling code will clean up eventually | |
5207 | */ | |
8ba0ae78 | 5208 | return preferred_mirror; |
dfe25020 CM |
5209 | } |
5210 | ||
53b381b3 DW |
5211 | static inline int parity_smaller(u64 a, u64 b) |
5212 | { | |
5213 | return a > b; | |
5214 | } | |
5215 | ||
5216 | /* Bubble-sort the stripe set to put the parity/syndrome stripes last */ | |
8e5cfb55 | 5217 | static void sort_parity_stripes(struct btrfs_bio *bbio, int num_stripes) |
53b381b3 DW |
5218 | { |
5219 | struct btrfs_bio_stripe s; | |
5220 | int i; | |
5221 | u64 l; | |
5222 | int again = 1; | |
5223 | ||
5224 | while (again) { | |
5225 | again = 0; | |
cc7539ed | 5226 | for (i = 0; i < num_stripes - 1; i++) { |
8e5cfb55 ZL |
5227 | if (parity_smaller(bbio->raid_map[i], |
5228 | bbio->raid_map[i+1])) { | |
53b381b3 | 5229 | s = bbio->stripes[i]; |
8e5cfb55 | 5230 | l = bbio->raid_map[i]; |
53b381b3 | 5231 | bbio->stripes[i] = bbio->stripes[i+1]; |
8e5cfb55 | 5232 | bbio->raid_map[i] = bbio->raid_map[i+1]; |
53b381b3 | 5233 | bbio->stripes[i+1] = s; |
8e5cfb55 | 5234 | bbio->raid_map[i+1] = l; |
2c8cdd6e | 5235 | |
53b381b3 DW |
5236 | again = 1; |
5237 | } | |
5238 | } | |
5239 | } | |
5240 | } | |
5241 | ||
6e9606d2 ZL |
5242 | static struct btrfs_bio *alloc_btrfs_bio(int total_stripes, int real_stripes) |
5243 | { | |
5244 | struct btrfs_bio *bbio = kzalloc( | |
e57cf21e | 5245 | /* the size of the btrfs_bio */ |
6e9606d2 | 5246 | sizeof(struct btrfs_bio) + |
e57cf21e | 5247 | /* plus the variable array for the stripes */ |
6e9606d2 | 5248 | sizeof(struct btrfs_bio_stripe) * (total_stripes) + |
e57cf21e | 5249 | /* plus the variable array for the tgt dev */ |
6e9606d2 | 5250 | sizeof(int) * (real_stripes) + |
e57cf21e CM |
5251 | /* |
5252 | * plus the raid_map, which includes both the tgt dev | |
5253 | * and the stripes | |
5254 | */ | |
5255 | sizeof(u64) * (total_stripes), | |
277fb5fc | 5256 | GFP_NOFS|__GFP_NOFAIL); |
6e9606d2 ZL |
5257 | |
5258 | atomic_set(&bbio->error, 0); | |
140475ae | 5259 | refcount_set(&bbio->refs, 1); |
6e9606d2 ZL |
5260 | |
5261 | return bbio; | |
5262 | } | |
5263 | ||
5264 | void btrfs_get_bbio(struct btrfs_bio *bbio) | |
5265 | { | |
140475ae ER |
5266 | WARN_ON(!refcount_read(&bbio->refs)); |
5267 | refcount_inc(&bbio->refs); | |
6e9606d2 ZL |
5268 | } |
5269 | ||
5270 | void btrfs_put_bbio(struct btrfs_bio *bbio) | |
5271 | { | |
5272 | if (!bbio) | |
5273 | return; | |
140475ae | 5274 | if (refcount_dec_and_test(&bbio->refs)) |
6e9606d2 ZL |
5275 | kfree(bbio); |
5276 | } | |
5277 | ||
0b3d4cd3 LB |
5278 | /* can REQ_OP_DISCARD be sent with other REQ like REQ_OP_WRITE? */ |
5279 | /* | |
5280 | * Please note that, discard won't be sent to target device of device | |
5281 | * replace. | |
5282 | */ | |
5283 | static int __btrfs_map_block_for_discard(struct btrfs_fs_info *fs_info, | |
5284 | u64 logical, u64 length, | |
5285 | struct btrfs_bio **bbio_ret) | |
5286 | { | |
5287 | struct extent_map *em; | |
5288 | struct map_lookup *map; | |
5289 | struct btrfs_bio *bbio; | |
5290 | u64 offset; | |
5291 | u64 stripe_nr; | |
5292 | u64 stripe_nr_end; | |
5293 | u64 stripe_end_offset; | |
5294 | u64 stripe_cnt; | |
5295 | u64 stripe_len; | |
5296 | u64 stripe_offset; | |
5297 | u64 num_stripes; | |
5298 | u32 stripe_index; | |
5299 | u32 factor = 0; | |
5300 | u32 sub_stripes = 0; | |
5301 | u64 stripes_per_dev = 0; | |
5302 | u32 remaining_stripes = 0; | |
5303 | u32 last_stripe = 0; | |
5304 | int ret = 0; | |
5305 | int i; | |
5306 | ||
5307 | /* discard always return a bbio */ | |
5308 | ASSERT(bbio_ret); | |
5309 | ||
5310 | em = get_chunk_map(fs_info, logical, length); | |
5311 | if (IS_ERR(em)) | |
5312 | return PTR_ERR(em); | |
5313 | ||
5314 | map = em->map_lookup; | |
5315 | /* we don't discard raid56 yet */ | |
5316 | if (map->type & BTRFS_BLOCK_GROUP_RAID56_MASK) { | |
5317 | ret = -EOPNOTSUPP; | |
5318 | goto out; | |
5319 | } | |
5320 | ||
5321 | offset = logical - em->start; | |
5322 | length = min_t(u64, em->len - offset, length); | |
5323 | ||
5324 | stripe_len = map->stripe_len; | |
5325 | /* | |
5326 | * stripe_nr counts the total number of stripes we have to stride | |
5327 | * to get to this block | |
5328 | */ | |
5329 | stripe_nr = div64_u64(offset, stripe_len); | |
5330 | ||
5331 | /* stripe_offset is the offset of this block in its stripe */ | |
5332 | stripe_offset = offset - stripe_nr * stripe_len; | |
5333 | ||
5334 | stripe_nr_end = round_up(offset + length, map->stripe_len); | |
42c61ab6 | 5335 | stripe_nr_end = div64_u64(stripe_nr_end, map->stripe_len); |
0b3d4cd3 LB |
5336 | stripe_cnt = stripe_nr_end - stripe_nr; |
5337 | stripe_end_offset = stripe_nr_end * map->stripe_len - | |
5338 | (offset + length); | |
5339 | /* | |
5340 | * after this, stripe_nr is the number of stripes on this | |
5341 | * device we have to walk to find the data, and stripe_index is | |
5342 | * the number of our device in the stripe array | |
5343 | */ | |
5344 | num_stripes = 1; | |
5345 | stripe_index = 0; | |
5346 | if (map->type & (BTRFS_BLOCK_GROUP_RAID0 | | |
5347 | BTRFS_BLOCK_GROUP_RAID10)) { | |
5348 | if (map->type & BTRFS_BLOCK_GROUP_RAID0) | |
5349 | sub_stripes = 1; | |
5350 | else | |
5351 | sub_stripes = map->sub_stripes; | |
5352 | ||
5353 | factor = map->num_stripes / sub_stripes; | |
5354 | num_stripes = min_t(u64, map->num_stripes, | |
5355 | sub_stripes * stripe_cnt); | |
5356 | stripe_nr = div_u64_rem(stripe_nr, factor, &stripe_index); | |
5357 | stripe_index *= sub_stripes; | |
5358 | stripes_per_dev = div_u64_rem(stripe_cnt, factor, | |
5359 | &remaining_stripes); | |
5360 | div_u64_rem(stripe_nr_end - 1, factor, &last_stripe); | |
5361 | last_stripe *= sub_stripes; | |
5362 | } else if (map->type & (BTRFS_BLOCK_GROUP_RAID1 | | |
5363 | BTRFS_BLOCK_GROUP_DUP)) { | |
5364 | num_stripes = map->num_stripes; | |
5365 | } else { | |
5366 | stripe_nr = div_u64_rem(stripe_nr, map->num_stripes, | |
5367 | &stripe_index); | |
5368 | } | |
5369 | ||
5370 | bbio = alloc_btrfs_bio(num_stripes, 0); | |
5371 | if (!bbio) { | |
5372 | ret = -ENOMEM; | |
5373 | goto out; | |
5374 | } | |
5375 | ||
5376 | for (i = 0; i < num_stripes; i++) { | |
5377 | bbio->stripes[i].physical = | |
5378 | map->stripes[stripe_index].physical + | |
5379 | stripe_offset + stripe_nr * map->stripe_len; | |
5380 | bbio->stripes[i].dev = map->stripes[stripe_index].dev; | |
5381 | ||
5382 | if (map->type & (BTRFS_BLOCK_GROUP_RAID0 | | |
5383 | BTRFS_BLOCK_GROUP_RAID10)) { | |
5384 | bbio->stripes[i].length = stripes_per_dev * | |
5385 | map->stripe_len; | |
5386 | ||
5387 | if (i / sub_stripes < remaining_stripes) | |
5388 | bbio->stripes[i].length += | |
5389 | map->stripe_len; | |
5390 | ||
5391 | /* | |
5392 | * Special for the first stripe and | |
5393 | * the last stripe: | |
5394 | * | |
5395 | * |-------|...|-------| | |
5396 | * |----------| | |
5397 | * off end_off | |
5398 | */ | |
5399 | if (i < sub_stripes) | |
5400 | bbio->stripes[i].length -= | |
5401 | stripe_offset; | |
5402 | ||
5403 | if (stripe_index >= last_stripe && | |
5404 | stripe_index <= (last_stripe + | |
5405 | sub_stripes - 1)) | |
5406 | bbio->stripes[i].length -= | |
5407 | stripe_end_offset; | |
5408 | ||
5409 | if (i == sub_stripes - 1) | |
5410 | stripe_offset = 0; | |
5411 | } else { | |
5412 | bbio->stripes[i].length = length; | |
5413 | } | |
5414 | ||
5415 | stripe_index++; | |
5416 | if (stripe_index == map->num_stripes) { | |
5417 | stripe_index = 0; | |
5418 | stripe_nr++; | |
5419 | } | |
5420 | } | |
5421 | ||
5422 | *bbio_ret = bbio; | |
5423 | bbio->map_type = map->type; | |
5424 | bbio->num_stripes = num_stripes; | |
5425 | out: | |
5426 | free_extent_map(em); | |
5427 | return ret; | |
5428 | } | |
5429 | ||
5ab56090 LB |
5430 | /* |
5431 | * In dev-replace case, for repair case (that's the only case where the mirror | |
5432 | * is selected explicitly when calling btrfs_map_block), blocks left of the | |
5433 | * left cursor can also be read from the target drive. | |
5434 | * | |
5435 | * For REQ_GET_READ_MIRRORS, the target drive is added as the last one to the | |
5436 | * array of stripes. | |
5437 | * For READ, it also needs to be supported using the same mirror number. | |
5438 | * | |
5439 | * If the requested block is not left of the left cursor, EIO is returned. This | |
5440 | * can happen because btrfs_num_copies() returns one more in the dev-replace | |
5441 | * case. | |
5442 | */ | |
5443 | static int get_extra_mirror_from_replace(struct btrfs_fs_info *fs_info, | |
5444 | u64 logical, u64 length, | |
5445 | u64 srcdev_devid, int *mirror_num, | |
5446 | u64 *physical) | |
5447 | { | |
5448 | struct btrfs_bio *bbio = NULL; | |
5449 | int num_stripes; | |
5450 | int index_srcdev = 0; | |
5451 | int found = 0; | |
5452 | u64 physical_of_found = 0; | |
5453 | int i; | |
5454 | int ret = 0; | |
5455 | ||
5456 | ret = __btrfs_map_block(fs_info, BTRFS_MAP_GET_READ_MIRRORS, | |
5457 | logical, &length, &bbio, 0, 0); | |
5458 | if (ret) { | |
5459 | ASSERT(bbio == NULL); | |
5460 | return ret; | |
5461 | } | |
5462 | ||
5463 | num_stripes = bbio->num_stripes; | |
5464 | if (*mirror_num > num_stripes) { | |
5465 | /* | |
5466 | * BTRFS_MAP_GET_READ_MIRRORS does not contain this mirror, | |
5467 | * that means that the requested area is not left of the left | |
5468 | * cursor | |
5469 | */ | |
5470 | btrfs_put_bbio(bbio); | |
5471 | return -EIO; | |
5472 | } | |
5473 | ||
5474 | /* | |
5475 | * process the rest of the function using the mirror_num of the source | |
5476 | * drive. Therefore look it up first. At the end, patch the device | |
5477 | * pointer to the one of the target drive. | |
5478 | */ | |
5479 | for (i = 0; i < num_stripes; i++) { | |
5480 | if (bbio->stripes[i].dev->devid != srcdev_devid) | |
5481 | continue; | |
5482 | ||
5483 | /* | |
5484 | * In case of DUP, in order to keep it simple, only add the | |
5485 | * mirror with the lowest physical address | |
5486 | */ | |
5487 | if (found && | |
5488 | physical_of_found <= bbio->stripes[i].physical) | |
5489 | continue; | |
5490 | ||
5491 | index_srcdev = i; | |
5492 | found = 1; | |
5493 | physical_of_found = bbio->stripes[i].physical; | |
5494 | } | |
5495 | ||
5496 | btrfs_put_bbio(bbio); | |
5497 | ||
5498 | ASSERT(found); | |
5499 | if (!found) | |
5500 | return -EIO; | |
5501 | ||
5502 | *mirror_num = index_srcdev + 1; | |
5503 | *physical = physical_of_found; | |
5504 | return ret; | |
5505 | } | |
5506 | ||
73c0f228 LB |
5507 | static void handle_ops_on_dev_replace(enum btrfs_map_op op, |
5508 | struct btrfs_bio **bbio_ret, | |
5509 | struct btrfs_dev_replace *dev_replace, | |
5510 | int *num_stripes_ret, int *max_errors_ret) | |
5511 | { | |
5512 | struct btrfs_bio *bbio = *bbio_ret; | |
5513 | u64 srcdev_devid = dev_replace->srcdev->devid; | |
5514 | int tgtdev_indexes = 0; | |
5515 | int num_stripes = *num_stripes_ret; | |
5516 | int max_errors = *max_errors_ret; | |
5517 | int i; | |
5518 | ||
5519 | if (op == BTRFS_MAP_WRITE) { | |
5520 | int index_where_to_add; | |
5521 | ||
5522 | /* | |
5523 | * duplicate the write operations while the dev replace | |
5524 | * procedure is running. Since the copying of the old disk to | |
5525 | * the new disk takes place at run time while the filesystem is | |
5526 | * mounted writable, the regular write operations to the old | |
5527 | * disk have to be duplicated to go to the new disk as well. | |
5528 | * | |
5529 | * Note that device->missing is handled by the caller, and that | |
5530 | * the write to the old disk is already set up in the stripes | |
5531 | * array. | |
5532 | */ | |
5533 | index_where_to_add = num_stripes; | |
5534 | for (i = 0; i < num_stripes; i++) { | |
5535 | if (bbio->stripes[i].dev->devid == srcdev_devid) { | |
5536 | /* write to new disk, too */ | |
5537 | struct btrfs_bio_stripe *new = | |
5538 | bbio->stripes + index_where_to_add; | |
5539 | struct btrfs_bio_stripe *old = | |
5540 | bbio->stripes + i; | |
5541 | ||
5542 | new->physical = old->physical; | |
5543 | new->length = old->length; | |
5544 | new->dev = dev_replace->tgtdev; | |
5545 | bbio->tgtdev_map[i] = index_where_to_add; | |
5546 | index_where_to_add++; | |
5547 | max_errors++; | |
5548 | tgtdev_indexes++; | |
5549 | } | |
5550 | } | |
5551 | num_stripes = index_where_to_add; | |
5552 | } else if (op == BTRFS_MAP_GET_READ_MIRRORS) { | |
5553 | int index_srcdev = 0; | |
5554 | int found = 0; | |
5555 | u64 physical_of_found = 0; | |
5556 | ||
5557 | /* | |
5558 | * During the dev-replace procedure, the target drive can also | |
5559 | * be used to read data in case it is needed to repair a corrupt | |
5560 | * block elsewhere. This is possible if the requested area is | |
5561 | * left of the left cursor. In this area, the target drive is a | |
5562 | * full copy of the source drive. | |
5563 | */ | |
5564 | for (i = 0; i < num_stripes; i++) { | |
5565 | if (bbio->stripes[i].dev->devid == srcdev_devid) { | |
5566 | /* | |
5567 | * In case of DUP, in order to keep it simple, | |
5568 | * only add the mirror with the lowest physical | |
5569 | * address | |
5570 | */ | |
5571 | if (found && | |
5572 | physical_of_found <= | |
5573 | bbio->stripes[i].physical) | |
5574 | continue; | |
5575 | index_srcdev = i; | |
5576 | found = 1; | |
5577 | physical_of_found = bbio->stripes[i].physical; | |
5578 | } | |
5579 | } | |
5580 | if (found) { | |
5581 | struct btrfs_bio_stripe *tgtdev_stripe = | |
5582 | bbio->stripes + num_stripes; | |
5583 | ||
5584 | tgtdev_stripe->physical = physical_of_found; | |
5585 | tgtdev_stripe->length = | |
5586 | bbio->stripes[index_srcdev].length; | |
5587 | tgtdev_stripe->dev = dev_replace->tgtdev; | |
5588 | bbio->tgtdev_map[index_srcdev] = num_stripes; | |
5589 | ||
5590 | tgtdev_indexes++; | |
5591 | num_stripes++; | |
5592 | } | |
5593 | } | |
5594 | ||
5595 | *num_stripes_ret = num_stripes; | |
5596 | *max_errors_ret = max_errors; | |
5597 | bbio->num_tgtdevs = tgtdev_indexes; | |
5598 | *bbio_ret = bbio; | |
5599 | } | |
5600 | ||
2b19a1fe LB |
5601 | static bool need_full_stripe(enum btrfs_map_op op) |
5602 | { | |
5603 | return (op == BTRFS_MAP_WRITE || op == BTRFS_MAP_GET_READ_MIRRORS); | |
5604 | } | |
5605 | ||
cf8cddd3 CH |
5606 | static int __btrfs_map_block(struct btrfs_fs_info *fs_info, |
5607 | enum btrfs_map_op op, | |
f2d8d74d | 5608 | u64 logical, u64 *length, |
a1d3c478 | 5609 | struct btrfs_bio **bbio_ret, |
8e5cfb55 | 5610 | int mirror_num, int need_raid_map) |
0b86a832 CM |
5611 | { |
5612 | struct extent_map *em; | |
5613 | struct map_lookup *map; | |
0b86a832 | 5614 | u64 offset; |
593060d7 CM |
5615 | u64 stripe_offset; |
5616 | u64 stripe_nr; | |
53b381b3 | 5617 | u64 stripe_len; |
9d644a62 | 5618 | u32 stripe_index; |
cea9e445 | 5619 | int i; |
de11cc12 | 5620 | int ret = 0; |
f2d8d74d | 5621 | int num_stripes; |
a236aed1 | 5622 | int max_errors = 0; |
2c8cdd6e | 5623 | int tgtdev_indexes = 0; |
a1d3c478 | 5624 | struct btrfs_bio *bbio = NULL; |
472262f3 SB |
5625 | struct btrfs_dev_replace *dev_replace = &fs_info->dev_replace; |
5626 | int dev_replace_is_ongoing = 0; | |
5627 | int num_alloc_stripes; | |
ad6d620e SB |
5628 | int patch_the_first_stripe_for_dev_replace = 0; |
5629 | u64 physical_to_patch_in_first_stripe = 0; | |
53b381b3 | 5630 | u64 raid56_full_stripe_start = (u64)-1; |
0b86a832 | 5631 | |
0b3d4cd3 LB |
5632 | if (op == BTRFS_MAP_DISCARD) |
5633 | return __btrfs_map_block_for_discard(fs_info, logical, | |
5634 | *length, bbio_ret); | |
5635 | ||
592d92ee LB |
5636 | em = get_chunk_map(fs_info, logical, *length); |
5637 | if (IS_ERR(em)) | |
5638 | return PTR_ERR(em); | |
0b86a832 | 5639 | |
95617d69 | 5640 | map = em->map_lookup; |
0b86a832 | 5641 | offset = logical - em->start; |
593060d7 | 5642 | |
53b381b3 | 5643 | stripe_len = map->stripe_len; |
593060d7 CM |
5644 | stripe_nr = offset; |
5645 | /* | |
5646 | * stripe_nr counts the total number of stripes we have to stride | |
5647 | * to get to this block | |
5648 | */ | |
47c5713f | 5649 | stripe_nr = div64_u64(stripe_nr, stripe_len); |
593060d7 | 5650 | |
53b381b3 | 5651 | stripe_offset = stripe_nr * stripe_len; |
e042d1ec | 5652 | if (offset < stripe_offset) { |
5d163e0e JM |
5653 | btrfs_crit(fs_info, |
5654 | "stripe math has gone wrong, stripe_offset=%llu, offset=%llu, start=%llu, logical=%llu, stripe_len=%llu", | |
e042d1ec JB |
5655 | stripe_offset, offset, em->start, logical, |
5656 | stripe_len); | |
5657 | free_extent_map(em); | |
5658 | return -EINVAL; | |
5659 | } | |
593060d7 CM |
5660 | |
5661 | /* stripe_offset is the offset of this block in its stripe*/ | |
5662 | stripe_offset = offset - stripe_offset; | |
5663 | ||
53b381b3 | 5664 | /* if we're here for raid56, we need to know the stripe aligned start */ |
ffe2d203 | 5665 | if (map->type & BTRFS_BLOCK_GROUP_RAID56_MASK) { |
53b381b3 DW |
5666 | unsigned long full_stripe_len = stripe_len * nr_data_stripes(map); |
5667 | raid56_full_stripe_start = offset; | |
5668 | ||
5669 | /* allow a write of a full stripe, but make sure we don't | |
5670 | * allow straddling of stripes | |
5671 | */ | |
47c5713f DS |
5672 | raid56_full_stripe_start = div64_u64(raid56_full_stripe_start, |
5673 | full_stripe_len); | |
53b381b3 DW |
5674 | raid56_full_stripe_start *= full_stripe_len; |
5675 | } | |
5676 | ||
0b3d4cd3 | 5677 | if (map->type & BTRFS_BLOCK_GROUP_PROFILE_MASK) { |
53b381b3 DW |
5678 | u64 max_len; |
5679 | /* For writes to RAID[56], allow a full stripeset across all disks. | |
5680 | For other RAID types and for RAID[56] reads, just allow a single | |
5681 | stripe (on a single disk). */ | |
ffe2d203 | 5682 | if ((map->type & BTRFS_BLOCK_GROUP_RAID56_MASK) && |
cf8cddd3 | 5683 | (op == BTRFS_MAP_WRITE)) { |
53b381b3 DW |
5684 | max_len = stripe_len * nr_data_stripes(map) - |
5685 | (offset - raid56_full_stripe_start); | |
5686 | } else { | |
5687 | /* we limit the length of each bio to what fits in a stripe */ | |
5688 | max_len = stripe_len - stripe_offset; | |
5689 | } | |
5690 | *length = min_t(u64, em->len - offset, max_len); | |
cea9e445 CM |
5691 | } else { |
5692 | *length = em->len - offset; | |
5693 | } | |
f2d8d74d | 5694 | |
53b381b3 DW |
5695 | /* This is for when we're called from btrfs_merge_bio_hook() and all |
5696 | it cares about is the length */ | |
a1d3c478 | 5697 | if (!bbio_ret) |
cea9e445 CM |
5698 | goto out; |
5699 | ||
7e79cb86 | 5700 | btrfs_dev_replace_read_lock(dev_replace); |
472262f3 SB |
5701 | dev_replace_is_ongoing = btrfs_dev_replace_is_ongoing(dev_replace); |
5702 | if (!dev_replace_is_ongoing) | |
7e79cb86 | 5703 | btrfs_dev_replace_read_unlock(dev_replace); |
73beece9 LB |
5704 | else |
5705 | btrfs_dev_replace_set_lock_blocking(dev_replace); | |
472262f3 | 5706 | |
ad6d620e | 5707 | if (dev_replace_is_ongoing && mirror_num == map->num_stripes + 1 && |
2b19a1fe | 5708 | !need_full_stripe(op) && dev_replace->tgtdev != NULL) { |
5ab56090 LB |
5709 | ret = get_extra_mirror_from_replace(fs_info, logical, *length, |
5710 | dev_replace->srcdev->devid, | |
5711 | &mirror_num, | |
5712 | &physical_to_patch_in_first_stripe); | |
5713 | if (ret) | |
ad6d620e | 5714 | goto out; |
5ab56090 LB |
5715 | else |
5716 | patch_the_first_stripe_for_dev_replace = 1; | |
ad6d620e SB |
5717 | } else if (mirror_num > map->num_stripes) { |
5718 | mirror_num = 0; | |
5719 | } | |
5720 | ||
f2d8d74d | 5721 | num_stripes = 1; |
cea9e445 | 5722 | stripe_index = 0; |
fce3bb9a | 5723 | if (map->type & BTRFS_BLOCK_GROUP_RAID0) { |
47c5713f DS |
5724 | stripe_nr = div_u64_rem(stripe_nr, map->num_stripes, |
5725 | &stripe_index); | |
de483734 | 5726 | if (!need_full_stripe(op)) |
28e1cc7d | 5727 | mirror_num = 1; |
fce3bb9a | 5728 | } else if (map->type & BTRFS_BLOCK_GROUP_RAID1) { |
de483734 | 5729 | if (need_full_stripe(op)) |
f2d8d74d | 5730 | num_stripes = map->num_stripes; |
2fff734f | 5731 | else if (mirror_num) |
f188591e | 5732 | stripe_index = mirror_num - 1; |
dfe25020 | 5733 | else { |
30d9861f | 5734 | stripe_index = find_live_mirror(fs_info, map, 0, |
30d9861f | 5735 | dev_replace_is_ongoing); |
a1d3c478 | 5736 | mirror_num = stripe_index + 1; |
dfe25020 | 5737 | } |
2fff734f | 5738 | |
611f0e00 | 5739 | } else if (map->type & BTRFS_BLOCK_GROUP_DUP) { |
de483734 | 5740 | if (need_full_stripe(op)) { |
f2d8d74d | 5741 | num_stripes = map->num_stripes; |
a1d3c478 | 5742 | } else if (mirror_num) { |
f188591e | 5743 | stripe_index = mirror_num - 1; |
a1d3c478 JS |
5744 | } else { |
5745 | mirror_num = 1; | |
5746 | } | |
2fff734f | 5747 | |
321aecc6 | 5748 | } else if (map->type & BTRFS_BLOCK_GROUP_RAID10) { |
9d644a62 | 5749 | u32 factor = map->num_stripes / map->sub_stripes; |
321aecc6 | 5750 | |
47c5713f | 5751 | stripe_nr = div_u64_rem(stripe_nr, factor, &stripe_index); |
321aecc6 CM |
5752 | stripe_index *= map->sub_stripes; |
5753 | ||
de483734 | 5754 | if (need_full_stripe(op)) |
f2d8d74d | 5755 | num_stripes = map->sub_stripes; |
321aecc6 CM |
5756 | else if (mirror_num) |
5757 | stripe_index += mirror_num - 1; | |
dfe25020 | 5758 | else { |
3e74317a | 5759 | int old_stripe_index = stripe_index; |
30d9861f SB |
5760 | stripe_index = find_live_mirror(fs_info, map, |
5761 | stripe_index, | |
30d9861f | 5762 | dev_replace_is_ongoing); |
3e74317a | 5763 | mirror_num = stripe_index - old_stripe_index + 1; |
dfe25020 | 5764 | } |
53b381b3 | 5765 | |
ffe2d203 | 5766 | } else if (map->type & BTRFS_BLOCK_GROUP_RAID56_MASK) { |
de483734 | 5767 | if (need_raid_map && (need_full_stripe(op) || mirror_num > 1)) { |
53b381b3 | 5768 | /* push stripe_nr back to the start of the full stripe */ |
42c61ab6 | 5769 | stripe_nr = div64_u64(raid56_full_stripe_start, |
b8b93add | 5770 | stripe_len * nr_data_stripes(map)); |
53b381b3 DW |
5771 | |
5772 | /* RAID[56] write or recovery. Return all stripes */ | |
5773 | num_stripes = map->num_stripes; | |
5774 | max_errors = nr_parity_stripes(map); | |
5775 | ||
53b381b3 DW |
5776 | *length = map->stripe_len; |
5777 | stripe_index = 0; | |
5778 | stripe_offset = 0; | |
5779 | } else { | |
5780 | /* | |
5781 | * Mirror #0 or #1 means the original data block. | |
5782 | * Mirror #2 is RAID5 parity block. | |
5783 | * Mirror #3 is RAID6 Q block. | |
5784 | */ | |
47c5713f DS |
5785 | stripe_nr = div_u64_rem(stripe_nr, |
5786 | nr_data_stripes(map), &stripe_index); | |
53b381b3 DW |
5787 | if (mirror_num > 1) |
5788 | stripe_index = nr_data_stripes(map) + | |
5789 | mirror_num - 2; | |
5790 | ||
5791 | /* We distribute the parity blocks across stripes */ | |
47c5713f DS |
5792 | div_u64_rem(stripe_nr + stripe_index, map->num_stripes, |
5793 | &stripe_index); | |
de483734 | 5794 | if (!need_full_stripe(op) && mirror_num <= 1) |
28e1cc7d | 5795 | mirror_num = 1; |
53b381b3 | 5796 | } |
8790d502 CM |
5797 | } else { |
5798 | /* | |
47c5713f DS |
5799 | * after this, stripe_nr is the number of stripes on this |
5800 | * device we have to walk to find the data, and stripe_index is | |
5801 | * the number of our device in the stripe array | |
8790d502 | 5802 | */ |
47c5713f DS |
5803 | stripe_nr = div_u64_rem(stripe_nr, map->num_stripes, |
5804 | &stripe_index); | |
a1d3c478 | 5805 | mirror_num = stripe_index + 1; |
8790d502 | 5806 | } |
e042d1ec | 5807 | if (stripe_index >= map->num_stripes) { |
5d163e0e JM |
5808 | btrfs_crit(fs_info, |
5809 | "stripe index math went horribly wrong, got stripe_index=%u, num_stripes=%u", | |
e042d1ec JB |
5810 | stripe_index, map->num_stripes); |
5811 | ret = -EINVAL; | |
5812 | goto out; | |
5813 | } | |
cea9e445 | 5814 | |
472262f3 | 5815 | num_alloc_stripes = num_stripes; |
6fad823f | 5816 | if (dev_replace_is_ongoing && dev_replace->tgtdev != NULL) { |
0b3d4cd3 | 5817 | if (op == BTRFS_MAP_WRITE) |
ad6d620e | 5818 | num_alloc_stripes <<= 1; |
cf8cddd3 | 5819 | if (op == BTRFS_MAP_GET_READ_MIRRORS) |
ad6d620e | 5820 | num_alloc_stripes++; |
2c8cdd6e | 5821 | tgtdev_indexes = num_stripes; |
ad6d620e | 5822 | } |
2c8cdd6e | 5823 | |
6e9606d2 | 5824 | bbio = alloc_btrfs_bio(num_alloc_stripes, tgtdev_indexes); |
de11cc12 LZ |
5825 | if (!bbio) { |
5826 | ret = -ENOMEM; | |
5827 | goto out; | |
5828 | } | |
6fad823f | 5829 | if (dev_replace_is_ongoing && dev_replace->tgtdev != NULL) |
2c8cdd6e | 5830 | bbio->tgtdev_map = (int *)(bbio->stripes + num_alloc_stripes); |
de11cc12 | 5831 | |
8e5cfb55 | 5832 | /* build raid_map */ |
2b19a1fe LB |
5833 | if (map->type & BTRFS_BLOCK_GROUP_RAID56_MASK && need_raid_map && |
5834 | (need_full_stripe(op) || mirror_num > 1)) { | |
8e5cfb55 | 5835 | u64 tmp; |
9d644a62 | 5836 | unsigned rot; |
8e5cfb55 ZL |
5837 | |
5838 | bbio->raid_map = (u64 *)((void *)bbio->stripes + | |
5839 | sizeof(struct btrfs_bio_stripe) * | |
5840 | num_alloc_stripes + | |
5841 | sizeof(int) * tgtdev_indexes); | |
5842 | ||
5843 | /* Work out the disk rotation on this stripe-set */ | |
47c5713f | 5844 | div_u64_rem(stripe_nr, num_stripes, &rot); |
8e5cfb55 ZL |
5845 | |
5846 | /* Fill in the logical address of each stripe */ | |
5847 | tmp = stripe_nr * nr_data_stripes(map); | |
5848 | for (i = 0; i < nr_data_stripes(map); i++) | |
5849 | bbio->raid_map[(i+rot) % num_stripes] = | |
5850 | em->start + (tmp + i) * map->stripe_len; | |
5851 | ||
5852 | bbio->raid_map[(i+rot) % map->num_stripes] = RAID5_P_STRIPE; | |
5853 | if (map->type & BTRFS_BLOCK_GROUP_RAID6) | |
5854 | bbio->raid_map[(i+rot+1) % num_stripes] = | |
5855 | RAID6_Q_STRIPE; | |
5856 | } | |
5857 | ||
b89203f7 | 5858 | |
0b3d4cd3 LB |
5859 | for (i = 0; i < num_stripes; i++) { |
5860 | bbio->stripes[i].physical = | |
5861 | map->stripes[stripe_index].physical + | |
5862 | stripe_offset + | |
5863 | stripe_nr * map->stripe_len; | |
5864 | bbio->stripes[i].dev = | |
5865 | map->stripes[stripe_index].dev; | |
5866 | stripe_index++; | |
593060d7 | 5867 | } |
de11cc12 | 5868 | |
2b19a1fe | 5869 | if (need_full_stripe(op)) |
d20983b4 | 5870 | max_errors = btrfs_chunk_max_errors(map); |
de11cc12 | 5871 | |
8e5cfb55 ZL |
5872 | if (bbio->raid_map) |
5873 | sort_parity_stripes(bbio, num_stripes); | |
cc7539ed | 5874 | |
73c0f228 | 5875 | if (dev_replace_is_ongoing && dev_replace->tgtdev != NULL && |
2b19a1fe | 5876 | need_full_stripe(op)) { |
73c0f228 LB |
5877 | handle_ops_on_dev_replace(op, &bbio, dev_replace, &num_stripes, |
5878 | &max_errors); | |
472262f3 SB |
5879 | } |
5880 | ||
de11cc12 | 5881 | *bbio_ret = bbio; |
10f11900 | 5882 | bbio->map_type = map->type; |
de11cc12 LZ |
5883 | bbio->num_stripes = num_stripes; |
5884 | bbio->max_errors = max_errors; | |
5885 | bbio->mirror_num = mirror_num; | |
ad6d620e SB |
5886 | |
5887 | /* | |
5888 | * this is the case that REQ_READ && dev_replace_is_ongoing && | |
5889 | * mirror_num == num_stripes + 1 && dev_replace target drive is | |
5890 | * available as a mirror | |
5891 | */ | |
5892 | if (patch_the_first_stripe_for_dev_replace && num_stripes > 0) { | |
5893 | WARN_ON(num_stripes > 1); | |
5894 | bbio->stripes[0].dev = dev_replace->tgtdev; | |
5895 | bbio->stripes[0].physical = physical_to_patch_in_first_stripe; | |
5896 | bbio->mirror_num = map->num_stripes + 1; | |
5897 | } | |
cea9e445 | 5898 | out: |
73beece9 LB |
5899 | if (dev_replace_is_ongoing) { |
5900 | btrfs_dev_replace_clear_lock_blocking(dev_replace); | |
7e79cb86 | 5901 | btrfs_dev_replace_read_unlock(dev_replace); |
73beece9 | 5902 | } |
0b86a832 | 5903 | free_extent_map(em); |
de11cc12 | 5904 | return ret; |
0b86a832 CM |
5905 | } |
5906 | ||
cf8cddd3 | 5907 | int btrfs_map_block(struct btrfs_fs_info *fs_info, enum btrfs_map_op op, |
f2d8d74d | 5908 | u64 logical, u64 *length, |
a1d3c478 | 5909 | struct btrfs_bio **bbio_ret, int mirror_num) |
f2d8d74d | 5910 | { |
b3d3fa51 | 5911 | return __btrfs_map_block(fs_info, op, logical, length, bbio_ret, |
8e5cfb55 | 5912 | mirror_num, 0); |
f2d8d74d CM |
5913 | } |
5914 | ||
af8e2d1d | 5915 | /* For Scrub/replace */ |
cf8cddd3 | 5916 | int btrfs_map_sblock(struct btrfs_fs_info *fs_info, enum btrfs_map_op op, |
af8e2d1d | 5917 | u64 logical, u64 *length, |
825ad4c9 | 5918 | struct btrfs_bio **bbio_ret) |
af8e2d1d | 5919 | { |
825ad4c9 | 5920 | return __btrfs_map_block(fs_info, op, logical, length, bbio_ret, 0, 1); |
af8e2d1d MX |
5921 | } |
5922 | ||
63a9c7b9 NB |
5923 | int btrfs_rmap_block(struct btrfs_fs_info *fs_info, u64 chunk_start, |
5924 | u64 physical, u64 **logical, int *naddrs, int *stripe_len) | |
a512bbf8 | 5925 | { |
a512bbf8 YZ |
5926 | struct extent_map *em; |
5927 | struct map_lookup *map; | |
5928 | u64 *buf; | |
5929 | u64 bytenr; | |
5930 | u64 length; | |
5931 | u64 stripe_nr; | |
53b381b3 | 5932 | u64 rmap_len; |
a512bbf8 YZ |
5933 | int i, j, nr = 0; |
5934 | ||
592d92ee LB |
5935 | em = get_chunk_map(fs_info, chunk_start, 1); |
5936 | if (IS_ERR(em)) | |
835d974f | 5937 | return -EIO; |
835d974f | 5938 | |
95617d69 | 5939 | map = em->map_lookup; |
a512bbf8 | 5940 | length = em->len; |
53b381b3 DW |
5941 | rmap_len = map->stripe_len; |
5942 | ||
a512bbf8 | 5943 | if (map->type & BTRFS_BLOCK_GROUP_RAID10) |
b8b93add | 5944 | length = div_u64(length, map->num_stripes / map->sub_stripes); |
a512bbf8 | 5945 | else if (map->type & BTRFS_BLOCK_GROUP_RAID0) |
b8b93add | 5946 | length = div_u64(length, map->num_stripes); |
ffe2d203 | 5947 | else if (map->type & BTRFS_BLOCK_GROUP_RAID56_MASK) { |
b8b93add | 5948 | length = div_u64(length, nr_data_stripes(map)); |
53b381b3 DW |
5949 | rmap_len = map->stripe_len * nr_data_stripes(map); |
5950 | } | |
a512bbf8 | 5951 | |
31e818fe | 5952 | buf = kcalloc(map->num_stripes, sizeof(u64), GFP_NOFS); |
79787eaa | 5953 | BUG_ON(!buf); /* -ENOMEM */ |
a512bbf8 YZ |
5954 | |
5955 | for (i = 0; i < map->num_stripes; i++) { | |
a512bbf8 YZ |
5956 | if (map->stripes[i].physical > physical || |
5957 | map->stripes[i].physical + length <= physical) | |
5958 | continue; | |
5959 | ||
5960 | stripe_nr = physical - map->stripes[i].physical; | |
42c61ab6 | 5961 | stripe_nr = div64_u64(stripe_nr, map->stripe_len); |
a512bbf8 YZ |
5962 | |
5963 | if (map->type & BTRFS_BLOCK_GROUP_RAID10) { | |
5964 | stripe_nr = stripe_nr * map->num_stripes + i; | |
b8b93add | 5965 | stripe_nr = div_u64(stripe_nr, map->sub_stripes); |
a512bbf8 YZ |
5966 | } else if (map->type & BTRFS_BLOCK_GROUP_RAID0) { |
5967 | stripe_nr = stripe_nr * map->num_stripes + i; | |
53b381b3 DW |
5968 | } /* else if RAID[56], multiply by nr_data_stripes(). |
5969 | * Alternatively, just use rmap_len below instead of | |
5970 | * map->stripe_len */ | |
5971 | ||
5972 | bytenr = chunk_start + stripe_nr * rmap_len; | |
934d375b | 5973 | WARN_ON(nr >= map->num_stripes); |
a512bbf8 YZ |
5974 | for (j = 0; j < nr; j++) { |
5975 | if (buf[j] == bytenr) | |
5976 | break; | |
5977 | } | |
934d375b CM |
5978 | if (j == nr) { |
5979 | WARN_ON(nr >= map->num_stripes); | |
a512bbf8 | 5980 | buf[nr++] = bytenr; |
934d375b | 5981 | } |
a512bbf8 YZ |
5982 | } |
5983 | ||
a512bbf8 YZ |
5984 | *logical = buf; |
5985 | *naddrs = nr; | |
53b381b3 | 5986 | *stripe_len = rmap_len; |
a512bbf8 YZ |
5987 | |
5988 | free_extent_map(em); | |
5989 | return 0; | |
f2d8d74d CM |
5990 | } |
5991 | ||
4246a0b6 | 5992 | static inline void btrfs_end_bbio(struct btrfs_bio *bbio, struct bio *bio) |
8408c716 | 5993 | { |
326e1dbb MS |
5994 | bio->bi_private = bbio->private; |
5995 | bio->bi_end_io = bbio->end_io; | |
4246a0b6 | 5996 | bio_endio(bio); |
326e1dbb | 5997 | |
6e9606d2 | 5998 | btrfs_put_bbio(bbio); |
8408c716 MX |
5999 | } |
6000 | ||
4246a0b6 | 6001 | static void btrfs_end_bio(struct bio *bio) |
8790d502 | 6002 | { |
9be3395b | 6003 | struct btrfs_bio *bbio = bio->bi_private; |
7d2b4daa | 6004 | int is_orig_bio = 0; |
8790d502 | 6005 | |
4e4cbee9 | 6006 | if (bio->bi_status) { |
a1d3c478 | 6007 | atomic_inc(&bbio->error); |
4e4cbee9 CH |
6008 | if (bio->bi_status == BLK_STS_IOERR || |
6009 | bio->bi_status == BLK_STS_TARGET) { | |
442a4f63 | 6010 | unsigned int stripe_index = |
9be3395b | 6011 | btrfs_io_bio(bio)->stripe_index; |
65f53338 | 6012 | struct btrfs_device *dev; |
442a4f63 SB |
6013 | |
6014 | BUG_ON(stripe_index >= bbio->num_stripes); | |
6015 | dev = bbio->stripes[stripe_index].dev; | |
597a60fa | 6016 | if (dev->bdev) { |
37226b21 | 6017 | if (bio_op(bio) == REQ_OP_WRITE) |
1cb34c8e | 6018 | btrfs_dev_stat_inc_and_print(dev, |
597a60fa SB |
6019 | BTRFS_DEV_STAT_WRITE_ERRS); |
6020 | else | |
1cb34c8e | 6021 | btrfs_dev_stat_inc_and_print(dev, |
597a60fa | 6022 | BTRFS_DEV_STAT_READ_ERRS); |
70fd7614 | 6023 | if (bio->bi_opf & REQ_PREFLUSH) |
1cb34c8e | 6024 | btrfs_dev_stat_inc_and_print(dev, |
597a60fa | 6025 | BTRFS_DEV_STAT_FLUSH_ERRS); |
597a60fa | 6026 | } |
442a4f63 SB |
6027 | } |
6028 | } | |
8790d502 | 6029 | |
a1d3c478 | 6030 | if (bio == bbio->orig_bio) |
7d2b4daa CM |
6031 | is_orig_bio = 1; |
6032 | ||
c404e0dc MX |
6033 | btrfs_bio_counter_dec(bbio->fs_info); |
6034 | ||
a1d3c478 | 6035 | if (atomic_dec_and_test(&bbio->stripes_pending)) { |
7d2b4daa CM |
6036 | if (!is_orig_bio) { |
6037 | bio_put(bio); | |
a1d3c478 | 6038 | bio = bbio->orig_bio; |
7d2b4daa | 6039 | } |
c7b22bb1 | 6040 | |
9be3395b | 6041 | btrfs_io_bio(bio)->mirror_num = bbio->mirror_num; |
a236aed1 | 6042 | /* only send an error to the higher layers if it is |
53b381b3 | 6043 | * beyond the tolerance of the btrfs bio |
a236aed1 | 6044 | */ |
a1d3c478 | 6045 | if (atomic_read(&bbio->error) > bbio->max_errors) { |
4e4cbee9 | 6046 | bio->bi_status = BLK_STS_IOERR; |
5dbc8fca | 6047 | } else { |
1259ab75 CM |
6048 | /* |
6049 | * this bio is actually up to date, we didn't | |
6050 | * go over the max number of errors | |
6051 | */ | |
2dbe0c77 | 6052 | bio->bi_status = BLK_STS_OK; |
1259ab75 | 6053 | } |
c55f1396 | 6054 | |
4246a0b6 | 6055 | btrfs_end_bbio(bbio, bio); |
7d2b4daa | 6056 | } else if (!is_orig_bio) { |
8790d502 CM |
6057 | bio_put(bio); |
6058 | } | |
8790d502 CM |
6059 | } |
6060 | ||
8b712842 CM |
6061 | /* |
6062 | * see run_scheduled_bios for a description of why bios are collected for | |
6063 | * async submit. | |
6064 | * | |
6065 | * This will add one bio to the pending list for a device and make sure | |
6066 | * the work struct is scheduled. | |
6067 | */ | |
2ff7e61e | 6068 | static noinline void btrfs_schedule_bio(struct btrfs_device *device, |
4e49ea4a | 6069 | struct bio *bio) |
8b712842 | 6070 | { |
0b246afa | 6071 | struct btrfs_fs_info *fs_info = device->fs_info; |
8b712842 | 6072 | int should_queue = 1; |
ffbd517d | 6073 | struct btrfs_pending_bios *pending_bios; |
8b712842 | 6074 | |
e6e674bd AJ |
6075 | if (test_bit(BTRFS_DEV_STATE_MISSING, &device->dev_state) || |
6076 | !device->bdev) { | |
4246a0b6 | 6077 | bio_io_error(bio); |
53b381b3 DW |
6078 | return; |
6079 | } | |
6080 | ||
8b712842 | 6081 | /* don't bother with additional async steps for reads, right now */ |
37226b21 | 6082 | if (bio_op(bio) == REQ_OP_READ) { |
4e49ea4a | 6083 | btrfsic_submit_bio(bio); |
143bede5 | 6084 | return; |
8b712842 CM |
6085 | } |
6086 | ||
492bb6de | 6087 | WARN_ON(bio->bi_next); |
8b712842 | 6088 | bio->bi_next = NULL; |
8b712842 CM |
6089 | |
6090 | spin_lock(&device->io_lock); | |
67f055c7 | 6091 | if (op_is_sync(bio->bi_opf)) |
ffbd517d CM |
6092 | pending_bios = &device->pending_sync_bios; |
6093 | else | |
6094 | pending_bios = &device->pending_bios; | |
8b712842 | 6095 | |
ffbd517d CM |
6096 | if (pending_bios->tail) |
6097 | pending_bios->tail->bi_next = bio; | |
8b712842 | 6098 | |
ffbd517d CM |
6099 | pending_bios->tail = bio; |
6100 | if (!pending_bios->head) | |
6101 | pending_bios->head = bio; | |
8b712842 CM |
6102 | if (device->running_pending) |
6103 | should_queue = 0; | |
6104 | ||
6105 | spin_unlock(&device->io_lock); | |
6106 | ||
6107 | if (should_queue) | |
0b246afa | 6108 | btrfs_queue_work(fs_info->submit_workers, &device->work); |
8b712842 CM |
6109 | } |
6110 | ||
2ff7e61e JM |
6111 | static void submit_stripe_bio(struct btrfs_bio *bbio, struct bio *bio, |
6112 | u64 physical, int dev_nr, int async) | |
de1ee92a JB |
6113 | { |
6114 | struct btrfs_device *dev = bbio->stripes[dev_nr].dev; | |
2ff7e61e | 6115 | struct btrfs_fs_info *fs_info = bbio->fs_info; |
de1ee92a JB |
6116 | |
6117 | bio->bi_private = bbio; | |
9be3395b | 6118 | btrfs_io_bio(bio)->stripe_index = dev_nr; |
de1ee92a | 6119 | bio->bi_end_io = btrfs_end_bio; |
4f024f37 | 6120 | bio->bi_iter.bi_sector = physical >> 9; |
672d5990 MT |
6121 | btrfs_debug_in_rcu(fs_info, |
6122 | "btrfs_map_bio: rw %d 0x%x, sector=%llu, dev=%lu (%s id %llu), size=%u", | |
6123 | bio_op(bio), bio->bi_opf, (u64)bio->bi_iter.bi_sector, | |
6124 | (u_long)dev->bdev->bd_dev, rcu_str_deref(dev->name), dev->devid, | |
6125 | bio->bi_iter.bi_size); | |
74d46992 | 6126 | bio_set_dev(bio, dev->bdev); |
c404e0dc | 6127 | |
2ff7e61e | 6128 | btrfs_bio_counter_inc_noblocked(fs_info); |
c404e0dc | 6129 | |
de1ee92a | 6130 | if (async) |
2ff7e61e | 6131 | btrfs_schedule_bio(dev, bio); |
de1ee92a | 6132 | else |
4e49ea4a | 6133 | btrfsic_submit_bio(bio); |
de1ee92a JB |
6134 | } |
6135 | ||
de1ee92a JB |
6136 | static void bbio_error(struct btrfs_bio *bbio, struct bio *bio, u64 logical) |
6137 | { | |
6138 | atomic_inc(&bbio->error); | |
6139 | if (atomic_dec_and_test(&bbio->stripes_pending)) { | |
01327610 | 6140 | /* Should be the original bio. */ |
8408c716 MX |
6141 | WARN_ON(bio != bbio->orig_bio); |
6142 | ||
9be3395b | 6143 | btrfs_io_bio(bio)->mirror_num = bbio->mirror_num; |
4f024f37 | 6144 | bio->bi_iter.bi_sector = logical >> 9; |
102ed2c5 AJ |
6145 | if (atomic_read(&bbio->error) > bbio->max_errors) |
6146 | bio->bi_status = BLK_STS_IOERR; | |
6147 | else | |
6148 | bio->bi_status = BLK_STS_OK; | |
4246a0b6 | 6149 | btrfs_end_bbio(bbio, bio); |
de1ee92a JB |
6150 | } |
6151 | } | |
6152 | ||
58efbc9f OS |
6153 | blk_status_t btrfs_map_bio(struct btrfs_fs_info *fs_info, struct bio *bio, |
6154 | int mirror_num, int async_submit) | |
0b86a832 | 6155 | { |
0b86a832 | 6156 | struct btrfs_device *dev; |
8790d502 | 6157 | struct bio *first_bio = bio; |
4f024f37 | 6158 | u64 logical = (u64)bio->bi_iter.bi_sector << 9; |
0b86a832 CM |
6159 | u64 length = 0; |
6160 | u64 map_length; | |
0b86a832 | 6161 | int ret; |
08da757d ZL |
6162 | int dev_nr; |
6163 | int total_devs; | |
a1d3c478 | 6164 | struct btrfs_bio *bbio = NULL; |
0b86a832 | 6165 | |
4f024f37 | 6166 | length = bio->bi_iter.bi_size; |
0b86a832 | 6167 | map_length = length; |
cea9e445 | 6168 | |
0b246afa | 6169 | btrfs_bio_counter_inc_blocked(fs_info); |
bd7d63c2 | 6170 | ret = __btrfs_map_block(fs_info, btrfs_op(bio), logical, |
37226b21 | 6171 | &map_length, &bbio, mirror_num, 1); |
c404e0dc | 6172 | if (ret) { |
0b246afa | 6173 | btrfs_bio_counter_dec(fs_info); |
58efbc9f | 6174 | return errno_to_blk_status(ret); |
c404e0dc | 6175 | } |
cea9e445 | 6176 | |
a1d3c478 | 6177 | total_devs = bbio->num_stripes; |
53b381b3 DW |
6178 | bbio->orig_bio = first_bio; |
6179 | bbio->private = first_bio->bi_private; | |
6180 | bbio->end_io = first_bio->bi_end_io; | |
0b246afa | 6181 | bbio->fs_info = fs_info; |
53b381b3 DW |
6182 | atomic_set(&bbio->stripes_pending, bbio->num_stripes); |
6183 | ||
ad1ba2a0 | 6184 | if ((bbio->map_type & BTRFS_BLOCK_GROUP_RAID56_MASK) && |
37226b21 | 6185 | ((bio_op(bio) == REQ_OP_WRITE) || (mirror_num > 1))) { |
53b381b3 DW |
6186 | /* In this case, map_length has been set to the length of |
6187 | a single stripe; not the whole write */ | |
37226b21 | 6188 | if (bio_op(bio) == REQ_OP_WRITE) { |
2ff7e61e JM |
6189 | ret = raid56_parity_write(fs_info, bio, bbio, |
6190 | map_length); | |
53b381b3 | 6191 | } else { |
2ff7e61e JM |
6192 | ret = raid56_parity_recover(fs_info, bio, bbio, |
6193 | map_length, mirror_num, 1); | |
53b381b3 | 6194 | } |
4245215d | 6195 | |
0b246afa | 6196 | btrfs_bio_counter_dec(fs_info); |
58efbc9f | 6197 | return errno_to_blk_status(ret); |
53b381b3 DW |
6198 | } |
6199 | ||
cea9e445 | 6200 | if (map_length < length) { |
0b246afa | 6201 | btrfs_crit(fs_info, |
5d163e0e JM |
6202 | "mapping failed logical %llu bio len %llu len %llu", |
6203 | logical, length, map_length); | |
cea9e445 CM |
6204 | BUG(); |
6205 | } | |
a1d3c478 | 6206 | |
08da757d | 6207 | for (dev_nr = 0; dev_nr < total_devs; dev_nr++) { |
de1ee92a | 6208 | dev = bbio->stripes[dev_nr].dev; |
37226b21 | 6209 | if (!dev || !dev->bdev || |
ebbede42 AJ |
6210 | (bio_op(first_bio) == REQ_OP_WRITE && |
6211 | !test_bit(BTRFS_DEV_STATE_WRITEABLE, &dev->dev_state))) { | |
de1ee92a | 6212 | bbio_error(bbio, first_bio, logical); |
de1ee92a JB |
6213 | continue; |
6214 | } | |
6215 | ||
3aa8e074 | 6216 | if (dev_nr < total_devs - 1) |
8b6c1d56 | 6217 | bio = btrfs_bio_clone(first_bio); |
3aa8e074 | 6218 | else |
a1d3c478 | 6219 | bio = first_bio; |
de1ee92a | 6220 | |
2ff7e61e JM |
6221 | submit_stripe_bio(bbio, bio, bbio->stripes[dev_nr].physical, |
6222 | dev_nr, async_submit); | |
8790d502 | 6223 | } |
0b246afa | 6224 | btrfs_bio_counter_dec(fs_info); |
58efbc9f | 6225 | return BLK_STS_OK; |
0b86a832 CM |
6226 | } |
6227 | ||
aa1b8cd4 | 6228 | struct btrfs_device *btrfs_find_device(struct btrfs_fs_info *fs_info, u64 devid, |
2b82032c | 6229 | u8 *uuid, u8 *fsid) |
0b86a832 | 6230 | { |
2b82032c YZ |
6231 | struct btrfs_device *device; |
6232 | struct btrfs_fs_devices *cur_devices; | |
6233 | ||
aa1b8cd4 | 6234 | cur_devices = fs_info->fs_devices; |
2b82032c YZ |
6235 | while (cur_devices) { |
6236 | if (!fsid || | |
44880fdc | 6237 | !memcmp(cur_devices->fsid, fsid, BTRFS_FSID_SIZE)) { |
35c70103 | 6238 | device = find_device(cur_devices, devid, uuid); |
2b82032c YZ |
6239 | if (device) |
6240 | return device; | |
6241 | } | |
6242 | cur_devices = cur_devices->seed; | |
6243 | } | |
6244 | return NULL; | |
0b86a832 CM |
6245 | } |
6246 | ||
2ff7e61e | 6247 | static struct btrfs_device *add_missing_dev(struct btrfs_fs_devices *fs_devices, |
dfe25020 CM |
6248 | u64 devid, u8 *dev_uuid) |
6249 | { | |
6250 | struct btrfs_device *device; | |
dfe25020 | 6251 | |
12bd2fc0 ID |
6252 | device = btrfs_alloc_device(NULL, &devid, dev_uuid); |
6253 | if (IS_ERR(device)) | |
adfb69af | 6254 | return device; |
12bd2fc0 ID |
6255 | |
6256 | list_add(&device->dev_list, &fs_devices->devices); | |
e4404d6e | 6257 | device->fs_devices = fs_devices; |
dfe25020 | 6258 | fs_devices->num_devices++; |
12bd2fc0 | 6259 | |
e6e674bd | 6260 | set_bit(BTRFS_DEV_STATE_MISSING, &device->dev_state); |
cd02dca5 | 6261 | fs_devices->missing_devices++; |
12bd2fc0 | 6262 | |
dfe25020 CM |
6263 | return device; |
6264 | } | |
6265 | ||
12bd2fc0 ID |
6266 | /** |
6267 | * btrfs_alloc_device - allocate struct btrfs_device | |
6268 | * @fs_info: used only for generating a new devid, can be NULL if | |
6269 | * devid is provided (i.e. @devid != NULL). | |
6270 | * @devid: a pointer to devid for this device. If NULL a new devid | |
6271 | * is generated. | |
6272 | * @uuid: a pointer to UUID for this device. If NULL a new UUID | |
6273 | * is generated. | |
6274 | * | |
6275 | * Return: a pointer to a new &struct btrfs_device on success; ERR_PTR() | |
48dae9cf | 6276 | * on error. Returned struct is not linked onto any lists and must be |
a425f9d4 | 6277 | * destroyed with btrfs_free_device. |
12bd2fc0 ID |
6278 | */ |
6279 | struct btrfs_device *btrfs_alloc_device(struct btrfs_fs_info *fs_info, | |
6280 | const u64 *devid, | |
6281 | const u8 *uuid) | |
6282 | { | |
6283 | struct btrfs_device *dev; | |
6284 | u64 tmp; | |
6285 | ||
fae7f21c | 6286 | if (WARN_ON(!devid && !fs_info)) |
12bd2fc0 | 6287 | return ERR_PTR(-EINVAL); |
12bd2fc0 ID |
6288 | |
6289 | dev = __alloc_device(); | |
6290 | if (IS_ERR(dev)) | |
6291 | return dev; | |
6292 | ||
6293 | if (devid) | |
6294 | tmp = *devid; | |
6295 | else { | |
6296 | int ret; | |
6297 | ||
6298 | ret = find_next_devid(fs_info, &tmp); | |
6299 | if (ret) { | |
a425f9d4 | 6300 | btrfs_free_device(dev); |
12bd2fc0 ID |
6301 | return ERR_PTR(ret); |
6302 | } | |
6303 | } | |
6304 | dev->devid = tmp; | |
6305 | ||
6306 | if (uuid) | |
6307 | memcpy(dev->uuid, uuid, BTRFS_UUID_SIZE); | |
6308 | else | |
6309 | generate_random_uuid(dev->uuid); | |
6310 | ||
9e0af237 LB |
6311 | btrfs_init_work(&dev->work, btrfs_submit_helper, |
6312 | pending_bios_fn, NULL, NULL); | |
12bd2fc0 ID |
6313 | |
6314 | return dev; | |
6315 | } | |
6316 | ||
e06cd3dd | 6317 | /* Return -EIO if any error, otherwise return 0. */ |
2ff7e61e | 6318 | static int btrfs_check_chunk_valid(struct btrfs_fs_info *fs_info, |
e06cd3dd LB |
6319 | struct extent_buffer *leaf, |
6320 | struct btrfs_chunk *chunk, u64 logical) | |
0b86a832 | 6321 | { |
0b86a832 | 6322 | u64 length; |
f04b772b | 6323 | u64 stripe_len; |
e06cd3dd LB |
6324 | u16 num_stripes; |
6325 | u16 sub_stripes; | |
6326 | u64 type; | |
315409b0 GJ |
6327 | u64 features; |
6328 | bool mixed = false; | |
0b86a832 | 6329 | |
e17cade2 | 6330 | length = btrfs_chunk_length(leaf, chunk); |
f04b772b QW |
6331 | stripe_len = btrfs_chunk_stripe_len(leaf, chunk); |
6332 | num_stripes = btrfs_chunk_num_stripes(leaf, chunk); | |
e06cd3dd LB |
6333 | sub_stripes = btrfs_chunk_sub_stripes(leaf, chunk); |
6334 | type = btrfs_chunk_type(leaf, chunk); | |
6335 | ||
f04b772b | 6336 | if (!num_stripes) { |
0b246afa | 6337 | btrfs_err(fs_info, "invalid chunk num_stripes: %u", |
f04b772b QW |
6338 | num_stripes); |
6339 | return -EIO; | |
6340 | } | |
0b246afa JM |
6341 | if (!IS_ALIGNED(logical, fs_info->sectorsize)) { |
6342 | btrfs_err(fs_info, "invalid chunk logical %llu", logical); | |
f04b772b QW |
6343 | return -EIO; |
6344 | } | |
0b246afa JM |
6345 | if (btrfs_chunk_sector_size(leaf, chunk) != fs_info->sectorsize) { |
6346 | btrfs_err(fs_info, "invalid chunk sectorsize %u", | |
e06cd3dd LB |
6347 | btrfs_chunk_sector_size(leaf, chunk)); |
6348 | return -EIO; | |
6349 | } | |
0b246afa JM |
6350 | if (!length || !IS_ALIGNED(length, fs_info->sectorsize)) { |
6351 | btrfs_err(fs_info, "invalid chunk length %llu", length); | |
f04b772b QW |
6352 | return -EIO; |
6353 | } | |
3d8da678 | 6354 | if (!is_power_of_2(stripe_len) || stripe_len != BTRFS_STRIPE_LEN) { |
0b246afa | 6355 | btrfs_err(fs_info, "invalid chunk stripe length: %llu", |
f04b772b QW |
6356 | stripe_len); |
6357 | return -EIO; | |
6358 | } | |
6359 | if (~(BTRFS_BLOCK_GROUP_TYPE_MASK | BTRFS_BLOCK_GROUP_PROFILE_MASK) & | |
e06cd3dd | 6360 | type) { |
0b246afa | 6361 | btrfs_err(fs_info, "unrecognized chunk type: %llu", |
f04b772b QW |
6362 | ~(BTRFS_BLOCK_GROUP_TYPE_MASK | |
6363 | BTRFS_BLOCK_GROUP_PROFILE_MASK) & | |
6364 | btrfs_chunk_type(leaf, chunk)); | |
6365 | return -EIO; | |
6366 | } | |
315409b0 GJ |
6367 | |
6368 | if ((type & BTRFS_BLOCK_GROUP_TYPE_MASK) == 0) { | |
6369 | btrfs_err(fs_info, "missing chunk type flag: 0x%llx", type); | |
6370 | return -EIO; | |
6371 | } | |
6372 | ||
6373 | if ((type & BTRFS_BLOCK_GROUP_SYSTEM) && | |
6374 | (type & (BTRFS_BLOCK_GROUP_METADATA | BTRFS_BLOCK_GROUP_DATA))) { | |
6375 | btrfs_err(fs_info, | |
6376 | "system chunk with data or metadata type: 0x%llx", type); | |
6377 | return -EIO; | |
6378 | } | |
6379 | ||
6380 | features = btrfs_super_incompat_flags(fs_info->super_copy); | |
6381 | if (features & BTRFS_FEATURE_INCOMPAT_MIXED_GROUPS) | |
6382 | mixed = true; | |
6383 | ||
6384 | if (!mixed) { | |
6385 | if ((type & BTRFS_BLOCK_GROUP_METADATA) && | |
6386 | (type & BTRFS_BLOCK_GROUP_DATA)) { | |
6387 | btrfs_err(fs_info, | |
6388 | "mixed chunk type in non-mixed mode: 0x%llx", type); | |
6389 | return -EIO; | |
6390 | } | |
6391 | } | |
6392 | ||
e06cd3dd LB |
6393 | if ((type & BTRFS_BLOCK_GROUP_RAID10 && sub_stripes != 2) || |
6394 | (type & BTRFS_BLOCK_GROUP_RAID1 && num_stripes < 1) || | |
6395 | (type & BTRFS_BLOCK_GROUP_RAID5 && num_stripes < 2) || | |
6396 | (type & BTRFS_BLOCK_GROUP_RAID6 && num_stripes < 3) || | |
6397 | (type & BTRFS_BLOCK_GROUP_DUP && num_stripes > 2) || | |
6398 | ((type & BTRFS_BLOCK_GROUP_PROFILE_MASK) == 0 && | |
6399 | num_stripes != 1)) { | |
0b246afa | 6400 | btrfs_err(fs_info, |
e06cd3dd LB |
6401 | "invalid num_stripes:sub_stripes %u:%u for profile %llu", |
6402 | num_stripes, sub_stripes, | |
6403 | type & BTRFS_BLOCK_GROUP_PROFILE_MASK); | |
6404 | return -EIO; | |
6405 | } | |
6406 | ||
6407 | return 0; | |
6408 | } | |
6409 | ||
5a2b8e60 | 6410 | static void btrfs_report_missing_device(struct btrfs_fs_info *fs_info, |
2b902dfc | 6411 | u64 devid, u8 *uuid, bool error) |
5a2b8e60 | 6412 | { |
2b902dfc AJ |
6413 | if (error) |
6414 | btrfs_err_rl(fs_info, "devid %llu uuid %pU is missing", | |
6415 | devid, uuid); | |
6416 | else | |
6417 | btrfs_warn_rl(fs_info, "devid %llu uuid %pU is missing", | |
6418 | devid, uuid); | |
5a2b8e60 AJ |
6419 | } |
6420 | ||
2ff7e61e | 6421 | static int read_one_chunk(struct btrfs_fs_info *fs_info, struct btrfs_key *key, |
e06cd3dd LB |
6422 | struct extent_buffer *leaf, |
6423 | struct btrfs_chunk *chunk) | |
6424 | { | |
0b246afa | 6425 | struct btrfs_mapping_tree *map_tree = &fs_info->mapping_tree; |
e06cd3dd LB |
6426 | struct map_lookup *map; |
6427 | struct extent_map *em; | |
6428 | u64 logical; | |
6429 | u64 length; | |
e06cd3dd LB |
6430 | u64 devid; |
6431 | u8 uuid[BTRFS_UUID_SIZE]; | |
6432 | int num_stripes; | |
6433 | int ret; | |
6434 | int i; | |
6435 | ||
6436 | logical = key->offset; | |
6437 | length = btrfs_chunk_length(leaf, chunk); | |
e06cd3dd LB |
6438 | num_stripes = btrfs_chunk_num_stripes(leaf, chunk); |
6439 | ||
2ff7e61e | 6440 | ret = btrfs_check_chunk_valid(fs_info, leaf, chunk, logical); |
e06cd3dd LB |
6441 | if (ret) |
6442 | return ret; | |
a061fc8d | 6443 | |
890871be | 6444 | read_lock(&map_tree->map_tree.lock); |
0b86a832 | 6445 | em = lookup_extent_mapping(&map_tree->map_tree, logical, 1); |
890871be | 6446 | read_unlock(&map_tree->map_tree.lock); |
0b86a832 CM |
6447 | |
6448 | /* already mapped? */ | |
6449 | if (em && em->start <= logical && em->start + em->len > logical) { | |
6450 | free_extent_map(em); | |
0b86a832 CM |
6451 | return 0; |
6452 | } else if (em) { | |
6453 | free_extent_map(em); | |
6454 | } | |
0b86a832 | 6455 | |
172ddd60 | 6456 | em = alloc_extent_map(); |
0b86a832 CM |
6457 | if (!em) |
6458 | return -ENOMEM; | |
593060d7 | 6459 | map = kmalloc(map_lookup_size(num_stripes), GFP_NOFS); |
0b86a832 CM |
6460 | if (!map) { |
6461 | free_extent_map(em); | |
6462 | return -ENOMEM; | |
6463 | } | |
6464 | ||
298a8f9c | 6465 | set_bit(EXTENT_FLAG_FS_MAPPING, &em->flags); |
95617d69 | 6466 | em->map_lookup = map; |
0b86a832 CM |
6467 | em->start = logical; |
6468 | em->len = length; | |
70c8a91c | 6469 | em->orig_start = 0; |
0b86a832 | 6470 | em->block_start = 0; |
c8b97818 | 6471 | em->block_len = em->len; |
0b86a832 | 6472 | |
593060d7 CM |
6473 | map->num_stripes = num_stripes; |
6474 | map->io_width = btrfs_chunk_io_width(leaf, chunk); | |
6475 | map->io_align = btrfs_chunk_io_align(leaf, chunk); | |
593060d7 CM |
6476 | map->stripe_len = btrfs_chunk_stripe_len(leaf, chunk); |
6477 | map->type = btrfs_chunk_type(leaf, chunk); | |
321aecc6 | 6478 | map->sub_stripes = btrfs_chunk_sub_stripes(leaf, chunk); |
cf90d884 | 6479 | map->verified_stripes = 0; |
593060d7 CM |
6480 | for (i = 0; i < num_stripes; i++) { |
6481 | map->stripes[i].physical = | |
6482 | btrfs_stripe_offset_nr(leaf, chunk, i); | |
6483 | devid = btrfs_stripe_devid_nr(leaf, chunk, i); | |
a443755f CM |
6484 | read_extent_buffer(leaf, uuid, (unsigned long) |
6485 | btrfs_stripe_dev_uuid_nr(chunk, i), | |
6486 | BTRFS_UUID_SIZE); | |
0b246afa | 6487 | map->stripes[i].dev = btrfs_find_device(fs_info, devid, |
aa1b8cd4 | 6488 | uuid, NULL); |
3cdde224 | 6489 | if (!map->stripes[i].dev && |
0b246afa | 6490 | !btrfs_test_opt(fs_info, DEGRADED)) { |
593060d7 | 6491 | free_extent_map(em); |
2b902dfc | 6492 | btrfs_report_missing_device(fs_info, devid, uuid, true); |
45dbdbc9 | 6493 | return -ENOENT; |
593060d7 | 6494 | } |
dfe25020 CM |
6495 | if (!map->stripes[i].dev) { |
6496 | map->stripes[i].dev = | |
2ff7e61e JM |
6497 | add_missing_dev(fs_info->fs_devices, devid, |
6498 | uuid); | |
adfb69af | 6499 | if (IS_ERR(map->stripes[i].dev)) { |
dfe25020 | 6500 | free_extent_map(em); |
adfb69af AJ |
6501 | btrfs_err(fs_info, |
6502 | "failed to init missing dev %llu: %ld", | |
6503 | devid, PTR_ERR(map->stripes[i].dev)); | |
6504 | return PTR_ERR(map->stripes[i].dev); | |
dfe25020 | 6505 | } |
2b902dfc | 6506 | btrfs_report_missing_device(fs_info, devid, uuid, false); |
dfe25020 | 6507 | } |
e12c9621 AJ |
6508 | set_bit(BTRFS_DEV_STATE_IN_FS_METADATA, |
6509 | &(map->stripes[i].dev->dev_state)); | |
6510 | ||
0b86a832 CM |
6511 | } |
6512 | ||
890871be | 6513 | write_lock(&map_tree->map_tree.lock); |
09a2a8f9 | 6514 | ret = add_extent_mapping(&map_tree->map_tree, em, 0); |
890871be | 6515 | write_unlock(&map_tree->map_tree.lock); |
64f64f43 QW |
6516 | if (ret < 0) { |
6517 | btrfs_err(fs_info, | |
6518 | "failed to add chunk map, start=%llu len=%llu: %d", | |
6519 | em->start, em->len, ret); | |
6520 | } | |
0b86a832 CM |
6521 | free_extent_map(em); |
6522 | ||
64f64f43 | 6523 | return ret; |
0b86a832 CM |
6524 | } |
6525 | ||
143bede5 | 6526 | static void fill_device_from_item(struct extent_buffer *leaf, |
0b86a832 CM |
6527 | struct btrfs_dev_item *dev_item, |
6528 | struct btrfs_device *device) | |
6529 | { | |
6530 | unsigned long ptr; | |
0b86a832 CM |
6531 | |
6532 | device->devid = btrfs_device_id(leaf, dev_item); | |
d6397bae CB |
6533 | device->disk_total_bytes = btrfs_device_total_bytes(leaf, dev_item); |
6534 | device->total_bytes = device->disk_total_bytes; | |
935e5cc9 | 6535 | device->commit_total_bytes = device->disk_total_bytes; |
0b86a832 | 6536 | device->bytes_used = btrfs_device_bytes_used(leaf, dev_item); |
ce7213c7 | 6537 | device->commit_bytes_used = device->bytes_used; |
0b86a832 CM |
6538 | device->type = btrfs_device_type(leaf, dev_item); |
6539 | device->io_align = btrfs_device_io_align(leaf, dev_item); | |
6540 | device->io_width = btrfs_device_io_width(leaf, dev_item); | |
6541 | device->sector_size = btrfs_device_sector_size(leaf, dev_item); | |
8dabb742 | 6542 | WARN_ON(device->devid == BTRFS_DEV_REPLACE_DEVID); |
401e29c1 | 6543 | clear_bit(BTRFS_DEV_STATE_REPLACE_TGT, &device->dev_state); |
0b86a832 | 6544 | |
410ba3a2 | 6545 | ptr = btrfs_device_uuid(dev_item); |
e17cade2 | 6546 | read_extent_buffer(leaf, device->uuid, ptr, BTRFS_UUID_SIZE); |
0b86a832 CM |
6547 | } |
6548 | ||
2ff7e61e | 6549 | static struct btrfs_fs_devices *open_seed_devices(struct btrfs_fs_info *fs_info, |
5f375835 | 6550 | u8 *fsid) |
2b82032c YZ |
6551 | { |
6552 | struct btrfs_fs_devices *fs_devices; | |
6553 | int ret; | |
6554 | ||
a32bf9a3 | 6555 | lockdep_assert_held(&uuid_mutex); |
2dfeca9b | 6556 | ASSERT(fsid); |
2b82032c | 6557 | |
0b246afa | 6558 | fs_devices = fs_info->fs_devices->seed; |
2b82032c | 6559 | while (fs_devices) { |
44880fdc | 6560 | if (!memcmp(fs_devices->fsid, fsid, BTRFS_FSID_SIZE)) |
5f375835 MX |
6561 | return fs_devices; |
6562 | ||
2b82032c YZ |
6563 | fs_devices = fs_devices->seed; |
6564 | } | |
6565 | ||
6566 | fs_devices = find_fsid(fsid); | |
6567 | if (!fs_devices) { | |
0b246afa | 6568 | if (!btrfs_test_opt(fs_info, DEGRADED)) |
5f375835 MX |
6569 | return ERR_PTR(-ENOENT); |
6570 | ||
6571 | fs_devices = alloc_fs_devices(fsid); | |
6572 | if (IS_ERR(fs_devices)) | |
6573 | return fs_devices; | |
6574 | ||
6575 | fs_devices->seeding = 1; | |
6576 | fs_devices->opened = 1; | |
6577 | return fs_devices; | |
2b82032c | 6578 | } |
e4404d6e YZ |
6579 | |
6580 | fs_devices = clone_fs_devices(fs_devices); | |
5f375835 MX |
6581 | if (IS_ERR(fs_devices)) |
6582 | return fs_devices; | |
2b82032c | 6583 | |
897fb573 | 6584 | ret = open_fs_devices(fs_devices, FMODE_READ, fs_info->bdev_holder); |
48d28232 JL |
6585 | if (ret) { |
6586 | free_fs_devices(fs_devices); | |
5f375835 | 6587 | fs_devices = ERR_PTR(ret); |
2b82032c | 6588 | goto out; |
48d28232 | 6589 | } |
2b82032c YZ |
6590 | |
6591 | if (!fs_devices->seeding) { | |
0226e0eb | 6592 | close_fs_devices(fs_devices); |
e4404d6e | 6593 | free_fs_devices(fs_devices); |
5f375835 | 6594 | fs_devices = ERR_PTR(-EINVAL); |
2b82032c YZ |
6595 | goto out; |
6596 | } | |
6597 | ||
0b246afa JM |
6598 | fs_devices->seed = fs_info->fs_devices->seed; |
6599 | fs_info->fs_devices->seed = fs_devices; | |
2b82032c | 6600 | out: |
5f375835 | 6601 | return fs_devices; |
2b82032c YZ |
6602 | } |
6603 | ||
2ff7e61e | 6604 | static int read_one_dev(struct btrfs_fs_info *fs_info, |
0b86a832 CM |
6605 | struct extent_buffer *leaf, |
6606 | struct btrfs_dev_item *dev_item) | |
6607 | { | |
0b246afa | 6608 | struct btrfs_fs_devices *fs_devices = fs_info->fs_devices; |
0b86a832 CM |
6609 | struct btrfs_device *device; |
6610 | u64 devid; | |
6611 | int ret; | |
44880fdc | 6612 | u8 fs_uuid[BTRFS_FSID_SIZE]; |
a443755f CM |
6613 | u8 dev_uuid[BTRFS_UUID_SIZE]; |
6614 | ||
0b86a832 | 6615 | devid = btrfs_device_id(leaf, dev_item); |
410ba3a2 | 6616 | read_extent_buffer(leaf, dev_uuid, btrfs_device_uuid(dev_item), |
a443755f | 6617 | BTRFS_UUID_SIZE); |
1473b24e | 6618 | read_extent_buffer(leaf, fs_uuid, btrfs_device_fsid(dev_item), |
44880fdc | 6619 | BTRFS_FSID_SIZE); |
2b82032c | 6620 | |
44880fdc | 6621 | if (memcmp(fs_uuid, fs_info->fsid, BTRFS_FSID_SIZE)) { |
2ff7e61e | 6622 | fs_devices = open_seed_devices(fs_info, fs_uuid); |
5f375835 MX |
6623 | if (IS_ERR(fs_devices)) |
6624 | return PTR_ERR(fs_devices); | |
2b82032c YZ |
6625 | } |
6626 | ||
0b246afa | 6627 | device = btrfs_find_device(fs_info, devid, dev_uuid, fs_uuid); |
5f375835 | 6628 | if (!device) { |
c5502451 | 6629 | if (!btrfs_test_opt(fs_info, DEGRADED)) { |
2b902dfc AJ |
6630 | btrfs_report_missing_device(fs_info, devid, |
6631 | dev_uuid, true); | |
45dbdbc9 | 6632 | return -ENOENT; |
c5502451 | 6633 | } |
2b82032c | 6634 | |
2ff7e61e | 6635 | device = add_missing_dev(fs_devices, devid, dev_uuid); |
adfb69af AJ |
6636 | if (IS_ERR(device)) { |
6637 | btrfs_err(fs_info, | |
6638 | "failed to add missing dev %llu: %ld", | |
6639 | devid, PTR_ERR(device)); | |
6640 | return PTR_ERR(device); | |
6641 | } | |
2b902dfc | 6642 | btrfs_report_missing_device(fs_info, devid, dev_uuid, false); |
5f375835 | 6643 | } else { |
c5502451 | 6644 | if (!device->bdev) { |
2b902dfc AJ |
6645 | if (!btrfs_test_opt(fs_info, DEGRADED)) { |
6646 | btrfs_report_missing_device(fs_info, | |
6647 | devid, dev_uuid, true); | |
45dbdbc9 | 6648 | return -ENOENT; |
2b902dfc AJ |
6649 | } |
6650 | btrfs_report_missing_device(fs_info, devid, | |
6651 | dev_uuid, false); | |
c5502451 | 6652 | } |
5f375835 | 6653 | |
e6e674bd AJ |
6654 | if (!device->bdev && |
6655 | !test_bit(BTRFS_DEV_STATE_MISSING, &device->dev_state)) { | |
cd02dca5 CM |
6656 | /* |
6657 | * this happens when a device that was properly setup | |
6658 | * in the device info lists suddenly goes bad. | |
6659 | * device->bdev is NULL, and so we have to set | |
6660 | * device->missing to one here | |
6661 | */ | |
5f375835 | 6662 | device->fs_devices->missing_devices++; |
e6e674bd | 6663 | set_bit(BTRFS_DEV_STATE_MISSING, &device->dev_state); |
2b82032c | 6664 | } |
5f375835 MX |
6665 | |
6666 | /* Move the device to its own fs_devices */ | |
6667 | if (device->fs_devices != fs_devices) { | |
e6e674bd AJ |
6668 | ASSERT(test_bit(BTRFS_DEV_STATE_MISSING, |
6669 | &device->dev_state)); | |
5f375835 MX |
6670 | |
6671 | list_move(&device->dev_list, &fs_devices->devices); | |
6672 | device->fs_devices->num_devices--; | |
6673 | fs_devices->num_devices++; | |
6674 | ||
6675 | device->fs_devices->missing_devices--; | |
6676 | fs_devices->missing_devices++; | |
6677 | ||
6678 | device->fs_devices = fs_devices; | |
6679 | } | |
2b82032c YZ |
6680 | } |
6681 | ||
0b246afa | 6682 | if (device->fs_devices != fs_info->fs_devices) { |
ebbede42 | 6683 | BUG_ON(test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state)); |
2b82032c YZ |
6684 | if (device->generation != |
6685 | btrfs_device_generation(leaf, dev_item)) | |
6686 | return -EINVAL; | |
6324fbf3 | 6687 | } |
0b86a832 CM |
6688 | |
6689 | fill_device_from_item(leaf, dev_item, device); | |
e12c9621 | 6690 | set_bit(BTRFS_DEV_STATE_IN_FS_METADATA, &device->dev_state); |
ebbede42 | 6691 | if (test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state) && |
401e29c1 | 6692 | !test_bit(BTRFS_DEV_STATE_REPLACE_TGT, &device->dev_state)) { |
2b82032c | 6693 | device->fs_devices->total_rw_bytes += device->total_bytes; |
a5ed45f8 NB |
6694 | atomic64_add(device->total_bytes - device->bytes_used, |
6695 | &fs_info->free_chunk_space); | |
2bf64758 | 6696 | } |
0b86a832 | 6697 | ret = 0; |
0b86a832 CM |
6698 | return ret; |
6699 | } | |
6700 | ||
6bccf3ab | 6701 | int btrfs_read_sys_array(struct btrfs_fs_info *fs_info) |
0b86a832 | 6702 | { |
6bccf3ab | 6703 | struct btrfs_root *root = fs_info->tree_root; |
ab8d0fc4 | 6704 | struct btrfs_super_block *super_copy = fs_info->super_copy; |
a061fc8d | 6705 | struct extent_buffer *sb; |
0b86a832 | 6706 | struct btrfs_disk_key *disk_key; |
0b86a832 | 6707 | struct btrfs_chunk *chunk; |
1ffb22cf DS |
6708 | u8 *array_ptr; |
6709 | unsigned long sb_array_offset; | |
84eed90f | 6710 | int ret = 0; |
0b86a832 CM |
6711 | u32 num_stripes; |
6712 | u32 array_size; | |
6713 | u32 len = 0; | |
1ffb22cf | 6714 | u32 cur_offset; |
e06cd3dd | 6715 | u64 type; |
84eed90f | 6716 | struct btrfs_key key; |
0b86a832 | 6717 | |
0b246afa | 6718 | ASSERT(BTRFS_SUPER_INFO_SIZE <= fs_info->nodesize); |
a83fffb7 DS |
6719 | /* |
6720 | * This will create extent buffer of nodesize, superblock size is | |
6721 | * fixed to BTRFS_SUPER_INFO_SIZE. If nodesize > sb size, this will | |
6722 | * overallocate but we can keep it as-is, only the first page is used. | |
6723 | */ | |
2ff7e61e | 6724 | sb = btrfs_find_create_tree_block(fs_info, BTRFS_SUPER_INFO_OFFSET); |
c871b0f2 LB |
6725 | if (IS_ERR(sb)) |
6726 | return PTR_ERR(sb); | |
4db8c528 | 6727 | set_extent_buffer_uptodate(sb); |
85d4e461 | 6728 | btrfs_set_buffer_lockdep_class(root->root_key.objectid, sb, 0); |
8a334426 | 6729 | /* |
01327610 | 6730 | * The sb extent buffer is artificial and just used to read the system array. |
4db8c528 | 6731 | * set_extent_buffer_uptodate() call does not properly mark all it's |
8a334426 DS |
6732 | * pages up-to-date when the page is larger: extent does not cover the |
6733 | * whole page and consequently check_page_uptodate does not find all | |
6734 | * the page's extents up-to-date (the hole beyond sb), | |
6735 | * write_extent_buffer then triggers a WARN_ON. | |
6736 | * | |
6737 | * Regular short extents go through mark_extent_buffer_dirty/writeback cycle, | |
6738 | * but sb spans only this function. Add an explicit SetPageUptodate call | |
6739 | * to silence the warning eg. on PowerPC 64. | |
6740 | */ | |
09cbfeaf | 6741 | if (PAGE_SIZE > BTRFS_SUPER_INFO_SIZE) |
727011e0 | 6742 | SetPageUptodate(sb->pages[0]); |
4008c04a | 6743 | |
a061fc8d | 6744 | write_extent_buffer(sb, super_copy, 0, BTRFS_SUPER_INFO_SIZE); |
0b86a832 CM |
6745 | array_size = btrfs_super_sys_array_size(super_copy); |
6746 | ||
1ffb22cf DS |
6747 | array_ptr = super_copy->sys_chunk_array; |
6748 | sb_array_offset = offsetof(struct btrfs_super_block, sys_chunk_array); | |
6749 | cur_offset = 0; | |
0b86a832 | 6750 | |
1ffb22cf DS |
6751 | while (cur_offset < array_size) { |
6752 | disk_key = (struct btrfs_disk_key *)array_ptr; | |
e3540eab DS |
6753 | len = sizeof(*disk_key); |
6754 | if (cur_offset + len > array_size) | |
6755 | goto out_short_read; | |
6756 | ||
0b86a832 CM |
6757 | btrfs_disk_key_to_cpu(&key, disk_key); |
6758 | ||
1ffb22cf DS |
6759 | array_ptr += len; |
6760 | sb_array_offset += len; | |
6761 | cur_offset += len; | |
0b86a832 | 6762 | |
0d81ba5d | 6763 | if (key.type == BTRFS_CHUNK_ITEM_KEY) { |
1ffb22cf | 6764 | chunk = (struct btrfs_chunk *)sb_array_offset; |
e3540eab DS |
6765 | /* |
6766 | * At least one btrfs_chunk with one stripe must be | |
6767 | * present, exact stripe count check comes afterwards | |
6768 | */ | |
6769 | len = btrfs_chunk_item_size(1); | |
6770 | if (cur_offset + len > array_size) | |
6771 | goto out_short_read; | |
6772 | ||
6773 | num_stripes = btrfs_chunk_num_stripes(sb, chunk); | |
f5cdedd7 | 6774 | if (!num_stripes) { |
ab8d0fc4 JM |
6775 | btrfs_err(fs_info, |
6776 | "invalid number of stripes %u in sys_array at offset %u", | |
f5cdedd7 DS |
6777 | num_stripes, cur_offset); |
6778 | ret = -EIO; | |
6779 | break; | |
6780 | } | |
6781 | ||
e06cd3dd LB |
6782 | type = btrfs_chunk_type(sb, chunk); |
6783 | if ((type & BTRFS_BLOCK_GROUP_SYSTEM) == 0) { | |
ab8d0fc4 | 6784 | btrfs_err(fs_info, |
e06cd3dd LB |
6785 | "invalid chunk type %llu in sys_array at offset %u", |
6786 | type, cur_offset); | |
6787 | ret = -EIO; | |
6788 | break; | |
6789 | } | |
6790 | ||
e3540eab DS |
6791 | len = btrfs_chunk_item_size(num_stripes); |
6792 | if (cur_offset + len > array_size) | |
6793 | goto out_short_read; | |
6794 | ||
2ff7e61e | 6795 | ret = read_one_chunk(fs_info, &key, sb, chunk); |
84eed90f CM |
6796 | if (ret) |
6797 | break; | |
0b86a832 | 6798 | } else { |
ab8d0fc4 JM |
6799 | btrfs_err(fs_info, |
6800 | "unexpected item type %u in sys_array at offset %u", | |
6801 | (u32)key.type, cur_offset); | |
84eed90f CM |
6802 | ret = -EIO; |
6803 | break; | |
0b86a832 | 6804 | } |
1ffb22cf DS |
6805 | array_ptr += len; |
6806 | sb_array_offset += len; | |
6807 | cur_offset += len; | |
0b86a832 | 6808 | } |
d865177a | 6809 | clear_extent_buffer_uptodate(sb); |
1c8b5b6e | 6810 | free_extent_buffer_stale(sb); |
84eed90f | 6811 | return ret; |
e3540eab DS |
6812 | |
6813 | out_short_read: | |
ab8d0fc4 | 6814 | btrfs_err(fs_info, "sys_array too short to read %u bytes at offset %u", |
e3540eab | 6815 | len, cur_offset); |
d865177a | 6816 | clear_extent_buffer_uptodate(sb); |
1c8b5b6e | 6817 | free_extent_buffer_stale(sb); |
e3540eab | 6818 | return -EIO; |
0b86a832 CM |
6819 | } |
6820 | ||
21634a19 QW |
6821 | /* |
6822 | * Check if all chunks in the fs are OK for read-write degraded mount | |
6823 | * | |
6528b99d AJ |
6824 | * If the @failing_dev is specified, it's accounted as missing. |
6825 | * | |
21634a19 QW |
6826 | * Return true if all chunks meet the minimal RW mount requirements. |
6827 | * Return false if any chunk doesn't meet the minimal RW mount requirements. | |
6828 | */ | |
6528b99d AJ |
6829 | bool btrfs_check_rw_degradable(struct btrfs_fs_info *fs_info, |
6830 | struct btrfs_device *failing_dev) | |
21634a19 QW |
6831 | { |
6832 | struct btrfs_mapping_tree *map_tree = &fs_info->mapping_tree; | |
6833 | struct extent_map *em; | |
6834 | u64 next_start = 0; | |
6835 | bool ret = true; | |
6836 | ||
6837 | read_lock(&map_tree->map_tree.lock); | |
6838 | em = lookup_extent_mapping(&map_tree->map_tree, 0, (u64)-1); | |
6839 | read_unlock(&map_tree->map_tree.lock); | |
6840 | /* No chunk at all? Return false anyway */ | |
6841 | if (!em) { | |
6842 | ret = false; | |
6843 | goto out; | |
6844 | } | |
6845 | while (em) { | |
6846 | struct map_lookup *map; | |
6847 | int missing = 0; | |
6848 | int max_tolerated; | |
6849 | int i; | |
6850 | ||
6851 | map = em->map_lookup; | |
6852 | max_tolerated = | |
6853 | btrfs_get_num_tolerated_disk_barrier_failures( | |
6854 | map->type); | |
6855 | for (i = 0; i < map->num_stripes; i++) { | |
6856 | struct btrfs_device *dev = map->stripes[i].dev; | |
6857 | ||
e6e674bd AJ |
6858 | if (!dev || !dev->bdev || |
6859 | test_bit(BTRFS_DEV_STATE_MISSING, &dev->dev_state) || | |
21634a19 QW |
6860 | dev->last_flush_error) |
6861 | missing++; | |
6528b99d AJ |
6862 | else if (failing_dev && failing_dev == dev) |
6863 | missing++; | |
21634a19 QW |
6864 | } |
6865 | if (missing > max_tolerated) { | |
6528b99d AJ |
6866 | if (!failing_dev) |
6867 | btrfs_warn(fs_info, | |
21634a19 QW |
6868 | "chunk %llu missing %d devices, max tolerance is %d for writeable mount", |
6869 | em->start, missing, max_tolerated); | |
6870 | free_extent_map(em); | |
6871 | ret = false; | |
6872 | goto out; | |
6873 | } | |
6874 | next_start = extent_map_end(em); | |
6875 | free_extent_map(em); | |
6876 | ||
6877 | read_lock(&map_tree->map_tree.lock); | |
6878 | em = lookup_extent_mapping(&map_tree->map_tree, next_start, | |
6879 | (u64)(-1) - next_start); | |
6880 | read_unlock(&map_tree->map_tree.lock); | |
6881 | } | |
6882 | out: | |
6883 | return ret; | |
6884 | } | |
6885 | ||
5b4aacef | 6886 | int btrfs_read_chunk_tree(struct btrfs_fs_info *fs_info) |
0b86a832 | 6887 | { |
5b4aacef | 6888 | struct btrfs_root *root = fs_info->chunk_root; |
0b86a832 CM |
6889 | struct btrfs_path *path; |
6890 | struct extent_buffer *leaf; | |
6891 | struct btrfs_key key; | |
6892 | struct btrfs_key found_key; | |
6893 | int ret; | |
6894 | int slot; | |
99e3ecfc | 6895 | u64 total_dev = 0; |
0b86a832 | 6896 | |
0b86a832 CM |
6897 | path = btrfs_alloc_path(); |
6898 | if (!path) | |
6899 | return -ENOMEM; | |
6900 | ||
3dd0f7a3 AJ |
6901 | /* |
6902 | * uuid_mutex is needed only if we are mounting a sprout FS | |
6903 | * otherwise we don't need it. | |
6904 | */ | |
b367e47f | 6905 | mutex_lock(&uuid_mutex); |
34441361 | 6906 | mutex_lock(&fs_info->chunk_mutex); |
b367e47f | 6907 | |
395927a9 FDBM |
6908 | /* |
6909 | * Read all device items, and then all the chunk items. All | |
6910 | * device items are found before any chunk item (their object id | |
6911 | * is smaller than the lowest possible object id for a chunk | |
6912 | * item - BTRFS_FIRST_CHUNK_TREE_OBJECTID). | |
0b86a832 CM |
6913 | */ |
6914 | key.objectid = BTRFS_DEV_ITEMS_OBJECTID; | |
6915 | key.offset = 0; | |
6916 | key.type = 0; | |
0b86a832 | 6917 | ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); |
ab59381e ZL |
6918 | if (ret < 0) |
6919 | goto error; | |
d397712b | 6920 | while (1) { |
0b86a832 CM |
6921 | leaf = path->nodes[0]; |
6922 | slot = path->slots[0]; | |
6923 | if (slot >= btrfs_header_nritems(leaf)) { | |
6924 | ret = btrfs_next_leaf(root, path); | |
6925 | if (ret == 0) | |
6926 | continue; | |
6927 | if (ret < 0) | |
6928 | goto error; | |
6929 | break; | |
6930 | } | |
6931 | btrfs_item_key_to_cpu(leaf, &found_key, slot); | |
395927a9 FDBM |
6932 | if (found_key.type == BTRFS_DEV_ITEM_KEY) { |
6933 | struct btrfs_dev_item *dev_item; | |
6934 | dev_item = btrfs_item_ptr(leaf, slot, | |
0b86a832 | 6935 | struct btrfs_dev_item); |
2ff7e61e | 6936 | ret = read_one_dev(fs_info, leaf, dev_item); |
395927a9 FDBM |
6937 | if (ret) |
6938 | goto error; | |
99e3ecfc | 6939 | total_dev++; |
0b86a832 CM |
6940 | } else if (found_key.type == BTRFS_CHUNK_ITEM_KEY) { |
6941 | struct btrfs_chunk *chunk; | |
6942 | chunk = btrfs_item_ptr(leaf, slot, struct btrfs_chunk); | |
2ff7e61e | 6943 | ret = read_one_chunk(fs_info, &found_key, leaf, chunk); |
2b82032c YZ |
6944 | if (ret) |
6945 | goto error; | |
0b86a832 CM |
6946 | } |
6947 | path->slots[0]++; | |
6948 | } | |
99e3ecfc LB |
6949 | |
6950 | /* | |
6951 | * After loading chunk tree, we've got all device information, | |
6952 | * do another round of validation checks. | |
6953 | */ | |
0b246afa JM |
6954 | if (total_dev != fs_info->fs_devices->total_devices) { |
6955 | btrfs_err(fs_info, | |
99e3ecfc | 6956 | "super_num_devices %llu mismatch with num_devices %llu found here", |
0b246afa | 6957 | btrfs_super_num_devices(fs_info->super_copy), |
99e3ecfc LB |
6958 | total_dev); |
6959 | ret = -EINVAL; | |
6960 | goto error; | |
6961 | } | |
0b246afa JM |
6962 | if (btrfs_super_total_bytes(fs_info->super_copy) < |
6963 | fs_info->fs_devices->total_rw_bytes) { | |
6964 | btrfs_err(fs_info, | |
99e3ecfc | 6965 | "super_total_bytes %llu mismatch with fs_devices total_rw_bytes %llu", |
0b246afa JM |
6966 | btrfs_super_total_bytes(fs_info->super_copy), |
6967 | fs_info->fs_devices->total_rw_bytes); | |
99e3ecfc LB |
6968 | ret = -EINVAL; |
6969 | goto error; | |
6970 | } | |
0b86a832 CM |
6971 | ret = 0; |
6972 | error: | |
34441361 | 6973 | mutex_unlock(&fs_info->chunk_mutex); |
b367e47f LZ |
6974 | mutex_unlock(&uuid_mutex); |
6975 | ||
2b82032c | 6976 | btrfs_free_path(path); |
0b86a832 CM |
6977 | return ret; |
6978 | } | |
442a4f63 | 6979 | |
cb517eab MX |
6980 | void btrfs_init_devices_late(struct btrfs_fs_info *fs_info) |
6981 | { | |
6982 | struct btrfs_fs_devices *fs_devices = fs_info->fs_devices; | |
6983 | struct btrfs_device *device; | |
6984 | ||
29cc83f6 LB |
6985 | while (fs_devices) { |
6986 | mutex_lock(&fs_devices->device_list_mutex); | |
6987 | list_for_each_entry(device, &fs_devices->devices, dev_list) | |
fb456252 | 6988 | device->fs_info = fs_info; |
29cc83f6 LB |
6989 | mutex_unlock(&fs_devices->device_list_mutex); |
6990 | ||
6991 | fs_devices = fs_devices->seed; | |
6992 | } | |
cb517eab MX |
6993 | } |
6994 | ||
733f4fbb SB |
6995 | static void __btrfs_reset_dev_stats(struct btrfs_device *dev) |
6996 | { | |
6997 | int i; | |
6998 | ||
6999 | for (i = 0; i < BTRFS_DEV_STAT_VALUES_MAX; i++) | |
7000 | btrfs_dev_stat_reset(dev, i); | |
7001 | } | |
7002 | ||
7003 | int btrfs_init_dev_stats(struct btrfs_fs_info *fs_info) | |
7004 | { | |
7005 | struct btrfs_key key; | |
7006 | struct btrfs_key found_key; | |
7007 | struct btrfs_root *dev_root = fs_info->dev_root; | |
7008 | struct btrfs_fs_devices *fs_devices = fs_info->fs_devices; | |
7009 | struct extent_buffer *eb; | |
7010 | int slot; | |
7011 | int ret = 0; | |
7012 | struct btrfs_device *device; | |
7013 | struct btrfs_path *path = NULL; | |
7014 | int i; | |
7015 | ||
7016 | path = btrfs_alloc_path(); | |
7017 | if (!path) { | |
7018 | ret = -ENOMEM; | |
7019 | goto out; | |
7020 | } | |
7021 | ||
7022 | mutex_lock(&fs_devices->device_list_mutex); | |
7023 | list_for_each_entry(device, &fs_devices->devices, dev_list) { | |
7024 | int item_size; | |
7025 | struct btrfs_dev_stats_item *ptr; | |
7026 | ||
242e2956 DS |
7027 | key.objectid = BTRFS_DEV_STATS_OBJECTID; |
7028 | key.type = BTRFS_PERSISTENT_ITEM_KEY; | |
733f4fbb SB |
7029 | key.offset = device->devid; |
7030 | ret = btrfs_search_slot(NULL, dev_root, &key, path, 0, 0); | |
7031 | if (ret) { | |
733f4fbb SB |
7032 | __btrfs_reset_dev_stats(device); |
7033 | device->dev_stats_valid = 1; | |
7034 | btrfs_release_path(path); | |
7035 | continue; | |
7036 | } | |
7037 | slot = path->slots[0]; | |
7038 | eb = path->nodes[0]; | |
7039 | btrfs_item_key_to_cpu(eb, &found_key, slot); | |
7040 | item_size = btrfs_item_size_nr(eb, slot); | |
7041 | ||
7042 | ptr = btrfs_item_ptr(eb, slot, | |
7043 | struct btrfs_dev_stats_item); | |
7044 | ||
7045 | for (i = 0; i < BTRFS_DEV_STAT_VALUES_MAX; i++) { | |
7046 | if (item_size >= (1 + i) * sizeof(__le64)) | |
7047 | btrfs_dev_stat_set(device, i, | |
7048 | btrfs_dev_stats_value(eb, ptr, i)); | |
7049 | else | |
7050 | btrfs_dev_stat_reset(device, i); | |
7051 | } | |
7052 | ||
7053 | device->dev_stats_valid = 1; | |
7054 | btrfs_dev_stat_print_on_load(device); | |
7055 | btrfs_release_path(path); | |
7056 | } | |
7057 | mutex_unlock(&fs_devices->device_list_mutex); | |
7058 | ||
7059 | out: | |
7060 | btrfs_free_path(path); | |
7061 | return ret < 0 ? ret : 0; | |
7062 | } | |
7063 | ||
7064 | static int update_dev_stat_item(struct btrfs_trans_handle *trans, | |
733f4fbb SB |
7065 | struct btrfs_device *device) |
7066 | { | |
5495f195 | 7067 | struct btrfs_fs_info *fs_info = trans->fs_info; |
6bccf3ab | 7068 | struct btrfs_root *dev_root = fs_info->dev_root; |
733f4fbb SB |
7069 | struct btrfs_path *path; |
7070 | struct btrfs_key key; | |
7071 | struct extent_buffer *eb; | |
7072 | struct btrfs_dev_stats_item *ptr; | |
7073 | int ret; | |
7074 | int i; | |
7075 | ||
242e2956 DS |
7076 | key.objectid = BTRFS_DEV_STATS_OBJECTID; |
7077 | key.type = BTRFS_PERSISTENT_ITEM_KEY; | |
733f4fbb SB |
7078 | key.offset = device->devid; |
7079 | ||
7080 | path = btrfs_alloc_path(); | |
fa252992 DS |
7081 | if (!path) |
7082 | return -ENOMEM; | |
733f4fbb SB |
7083 | ret = btrfs_search_slot(trans, dev_root, &key, path, -1, 1); |
7084 | if (ret < 0) { | |
0b246afa | 7085 | btrfs_warn_in_rcu(fs_info, |
ecaeb14b | 7086 | "error %d while searching for dev_stats item for device %s", |
606686ee | 7087 | ret, rcu_str_deref(device->name)); |
733f4fbb SB |
7088 | goto out; |
7089 | } | |
7090 | ||
7091 | if (ret == 0 && | |
7092 | btrfs_item_size_nr(path->nodes[0], path->slots[0]) < sizeof(*ptr)) { | |
7093 | /* need to delete old one and insert a new one */ | |
7094 | ret = btrfs_del_item(trans, dev_root, path); | |
7095 | if (ret != 0) { | |
0b246afa | 7096 | btrfs_warn_in_rcu(fs_info, |
ecaeb14b | 7097 | "delete too small dev_stats item for device %s failed %d", |
606686ee | 7098 | rcu_str_deref(device->name), ret); |
733f4fbb SB |
7099 | goto out; |
7100 | } | |
7101 | ret = 1; | |
7102 | } | |
7103 | ||
7104 | if (ret == 1) { | |
7105 | /* need to insert a new item */ | |
7106 | btrfs_release_path(path); | |
7107 | ret = btrfs_insert_empty_item(trans, dev_root, path, | |
7108 | &key, sizeof(*ptr)); | |
7109 | if (ret < 0) { | |
0b246afa | 7110 | btrfs_warn_in_rcu(fs_info, |
ecaeb14b DS |
7111 | "insert dev_stats item for device %s failed %d", |
7112 | rcu_str_deref(device->name), ret); | |
733f4fbb SB |
7113 | goto out; |
7114 | } | |
7115 | } | |
7116 | ||
7117 | eb = path->nodes[0]; | |
7118 | ptr = btrfs_item_ptr(eb, path->slots[0], struct btrfs_dev_stats_item); | |
7119 | for (i = 0; i < BTRFS_DEV_STAT_VALUES_MAX; i++) | |
7120 | btrfs_set_dev_stats_value(eb, ptr, i, | |
7121 | btrfs_dev_stat_read(device, i)); | |
7122 | btrfs_mark_buffer_dirty(eb); | |
7123 | ||
7124 | out: | |
7125 | btrfs_free_path(path); | |
7126 | return ret; | |
7127 | } | |
7128 | ||
7129 | /* | |
7130 | * called from commit_transaction. Writes all changed device stats to disk. | |
7131 | */ | |
7132 | int btrfs_run_dev_stats(struct btrfs_trans_handle *trans, | |
7133 | struct btrfs_fs_info *fs_info) | |
7134 | { | |
733f4fbb SB |
7135 | struct btrfs_fs_devices *fs_devices = fs_info->fs_devices; |
7136 | struct btrfs_device *device; | |
addc3fa7 | 7137 | int stats_cnt; |
733f4fbb SB |
7138 | int ret = 0; |
7139 | ||
7140 | mutex_lock(&fs_devices->device_list_mutex); | |
7141 | list_for_each_entry(device, &fs_devices->devices, dev_list) { | |
9deae968 NB |
7142 | stats_cnt = atomic_read(&device->dev_stats_ccnt); |
7143 | if (!device->dev_stats_valid || stats_cnt == 0) | |
733f4fbb SB |
7144 | continue; |
7145 | ||
9deae968 NB |
7146 | |
7147 | /* | |
7148 | * There is a LOAD-LOAD control dependency between the value of | |
7149 | * dev_stats_ccnt and updating the on-disk values which requires | |
7150 | * reading the in-memory counters. Such control dependencies | |
7151 | * require explicit read memory barriers. | |
7152 | * | |
7153 | * This memory barriers pairs with smp_mb__before_atomic in | |
7154 | * btrfs_dev_stat_inc/btrfs_dev_stat_set and with the full | |
7155 | * barrier implied by atomic_xchg in | |
7156 | * btrfs_dev_stats_read_and_reset | |
7157 | */ | |
7158 | smp_rmb(); | |
7159 | ||
5495f195 | 7160 | ret = update_dev_stat_item(trans, device); |
733f4fbb | 7161 | if (!ret) |
addc3fa7 | 7162 | atomic_sub(stats_cnt, &device->dev_stats_ccnt); |
733f4fbb SB |
7163 | } |
7164 | mutex_unlock(&fs_devices->device_list_mutex); | |
7165 | ||
7166 | return ret; | |
7167 | } | |
7168 | ||
442a4f63 SB |
7169 | void btrfs_dev_stat_inc_and_print(struct btrfs_device *dev, int index) |
7170 | { | |
7171 | btrfs_dev_stat_inc(dev, index); | |
7172 | btrfs_dev_stat_print_on_error(dev); | |
7173 | } | |
7174 | ||
48a3b636 | 7175 | static void btrfs_dev_stat_print_on_error(struct btrfs_device *dev) |
442a4f63 | 7176 | { |
733f4fbb SB |
7177 | if (!dev->dev_stats_valid) |
7178 | return; | |
fb456252 | 7179 | btrfs_err_rl_in_rcu(dev->fs_info, |
b14af3b4 | 7180 | "bdev %s errs: wr %u, rd %u, flush %u, corrupt %u, gen %u", |
606686ee | 7181 | rcu_str_deref(dev->name), |
442a4f63 SB |
7182 | btrfs_dev_stat_read(dev, BTRFS_DEV_STAT_WRITE_ERRS), |
7183 | btrfs_dev_stat_read(dev, BTRFS_DEV_STAT_READ_ERRS), | |
7184 | btrfs_dev_stat_read(dev, BTRFS_DEV_STAT_FLUSH_ERRS), | |
efe120a0 FH |
7185 | btrfs_dev_stat_read(dev, BTRFS_DEV_STAT_CORRUPTION_ERRS), |
7186 | btrfs_dev_stat_read(dev, BTRFS_DEV_STAT_GENERATION_ERRS)); | |
442a4f63 | 7187 | } |
c11d2c23 | 7188 | |
733f4fbb SB |
7189 | static void btrfs_dev_stat_print_on_load(struct btrfs_device *dev) |
7190 | { | |
a98cdb85 SB |
7191 | int i; |
7192 | ||
7193 | for (i = 0; i < BTRFS_DEV_STAT_VALUES_MAX; i++) | |
7194 | if (btrfs_dev_stat_read(dev, i) != 0) | |
7195 | break; | |
7196 | if (i == BTRFS_DEV_STAT_VALUES_MAX) | |
7197 | return; /* all values == 0, suppress message */ | |
7198 | ||
fb456252 | 7199 | btrfs_info_in_rcu(dev->fs_info, |
ecaeb14b | 7200 | "bdev %s errs: wr %u, rd %u, flush %u, corrupt %u, gen %u", |
606686ee | 7201 | rcu_str_deref(dev->name), |
733f4fbb SB |
7202 | btrfs_dev_stat_read(dev, BTRFS_DEV_STAT_WRITE_ERRS), |
7203 | btrfs_dev_stat_read(dev, BTRFS_DEV_STAT_READ_ERRS), | |
7204 | btrfs_dev_stat_read(dev, BTRFS_DEV_STAT_FLUSH_ERRS), | |
7205 | btrfs_dev_stat_read(dev, BTRFS_DEV_STAT_CORRUPTION_ERRS), | |
7206 | btrfs_dev_stat_read(dev, BTRFS_DEV_STAT_GENERATION_ERRS)); | |
7207 | } | |
7208 | ||
2ff7e61e | 7209 | int btrfs_get_dev_stats(struct btrfs_fs_info *fs_info, |
b27f7c0c | 7210 | struct btrfs_ioctl_get_dev_stats *stats) |
c11d2c23 SB |
7211 | { |
7212 | struct btrfs_device *dev; | |
0b246afa | 7213 | struct btrfs_fs_devices *fs_devices = fs_info->fs_devices; |
c11d2c23 SB |
7214 | int i; |
7215 | ||
7216 | mutex_lock(&fs_devices->device_list_mutex); | |
0b246afa | 7217 | dev = btrfs_find_device(fs_info, stats->devid, NULL, NULL); |
c11d2c23 SB |
7218 | mutex_unlock(&fs_devices->device_list_mutex); |
7219 | ||
7220 | if (!dev) { | |
0b246afa | 7221 | btrfs_warn(fs_info, "get dev_stats failed, device not found"); |
c11d2c23 | 7222 | return -ENODEV; |
733f4fbb | 7223 | } else if (!dev->dev_stats_valid) { |
0b246afa | 7224 | btrfs_warn(fs_info, "get dev_stats failed, not yet valid"); |
733f4fbb | 7225 | return -ENODEV; |
b27f7c0c | 7226 | } else if (stats->flags & BTRFS_DEV_STATS_RESET) { |
c11d2c23 SB |
7227 | for (i = 0; i < BTRFS_DEV_STAT_VALUES_MAX; i++) { |
7228 | if (stats->nr_items > i) | |
7229 | stats->values[i] = | |
7230 | btrfs_dev_stat_read_and_reset(dev, i); | |
7231 | else | |
7232 | btrfs_dev_stat_reset(dev, i); | |
7233 | } | |
7234 | } else { | |
7235 | for (i = 0; i < BTRFS_DEV_STAT_VALUES_MAX; i++) | |
7236 | if (stats->nr_items > i) | |
7237 | stats->values[i] = btrfs_dev_stat_read(dev, i); | |
7238 | } | |
7239 | if (stats->nr_items > BTRFS_DEV_STAT_VALUES_MAX) | |
7240 | stats->nr_items = BTRFS_DEV_STAT_VALUES_MAX; | |
7241 | return 0; | |
7242 | } | |
a8a6dab7 | 7243 | |
da353f6b | 7244 | void btrfs_scratch_superblocks(struct block_device *bdev, const char *device_path) |
a8a6dab7 SB |
7245 | { |
7246 | struct buffer_head *bh; | |
7247 | struct btrfs_super_block *disk_super; | |
12b1c263 | 7248 | int copy_num; |
a8a6dab7 | 7249 | |
12b1c263 AJ |
7250 | if (!bdev) |
7251 | return; | |
a8a6dab7 | 7252 | |
12b1c263 AJ |
7253 | for (copy_num = 0; copy_num < BTRFS_SUPER_MIRROR_MAX; |
7254 | copy_num++) { | |
a8a6dab7 | 7255 | |
12b1c263 AJ |
7256 | if (btrfs_read_dev_one_super(bdev, copy_num, &bh)) |
7257 | continue; | |
7258 | ||
7259 | disk_super = (struct btrfs_super_block *)bh->b_data; | |
7260 | ||
7261 | memset(&disk_super->magic, 0, sizeof(disk_super->magic)); | |
7262 | set_buffer_dirty(bh); | |
7263 | sync_dirty_buffer(bh); | |
7264 | brelse(bh); | |
7265 | } | |
7266 | ||
7267 | /* Notify udev that device has changed */ | |
7268 | btrfs_kobject_uevent(bdev, KOBJ_CHANGE); | |
7269 | ||
7270 | /* Update ctime/mtime for device path for libblkid */ | |
7271 | update_dev_time(device_path); | |
a8a6dab7 | 7272 | } |
935e5cc9 MX |
7273 | |
7274 | /* | |
7275 | * Update the size of all devices, which is used for writing out the | |
7276 | * super blocks. | |
7277 | */ | |
7278 | void btrfs_update_commit_device_size(struct btrfs_fs_info *fs_info) | |
7279 | { | |
7280 | struct btrfs_fs_devices *fs_devices = fs_info->fs_devices; | |
7281 | struct btrfs_device *curr, *next; | |
7282 | ||
7283 | if (list_empty(&fs_devices->resized_devices)) | |
7284 | return; | |
7285 | ||
7286 | mutex_lock(&fs_devices->device_list_mutex); | |
34441361 | 7287 | mutex_lock(&fs_info->chunk_mutex); |
935e5cc9 MX |
7288 | list_for_each_entry_safe(curr, next, &fs_devices->resized_devices, |
7289 | resized_list) { | |
7290 | list_del_init(&curr->resized_list); | |
7291 | curr->commit_total_bytes = curr->disk_total_bytes; | |
7292 | } | |
34441361 | 7293 | mutex_unlock(&fs_info->chunk_mutex); |
935e5cc9 MX |
7294 | mutex_unlock(&fs_devices->device_list_mutex); |
7295 | } | |
ce7213c7 MX |
7296 | |
7297 | /* Must be invoked during the transaction commit */ | |
e9b919b1 | 7298 | void btrfs_update_commit_device_bytes_used(struct btrfs_transaction *trans) |
ce7213c7 | 7299 | { |
e9b919b1 | 7300 | struct btrfs_fs_info *fs_info = trans->fs_info; |
ce7213c7 MX |
7301 | struct extent_map *em; |
7302 | struct map_lookup *map; | |
7303 | struct btrfs_device *dev; | |
7304 | int i; | |
7305 | ||
e9b919b1 | 7306 | if (list_empty(&trans->pending_chunks)) |
ce7213c7 MX |
7307 | return; |
7308 | ||
7309 | /* In order to kick the device replace finish process */ | |
34441361 | 7310 | mutex_lock(&fs_info->chunk_mutex); |
e9b919b1 | 7311 | list_for_each_entry(em, &trans->pending_chunks, list) { |
95617d69 | 7312 | map = em->map_lookup; |
ce7213c7 MX |
7313 | |
7314 | for (i = 0; i < map->num_stripes; i++) { | |
7315 | dev = map->stripes[i].dev; | |
7316 | dev->commit_bytes_used = dev->bytes_used; | |
7317 | } | |
7318 | } | |
34441361 | 7319 | mutex_unlock(&fs_info->chunk_mutex); |
ce7213c7 | 7320 | } |
5a13f430 AJ |
7321 | |
7322 | void btrfs_set_fs_info_ptr(struct btrfs_fs_info *fs_info) | |
7323 | { | |
7324 | struct btrfs_fs_devices *fs_devices = fs_info->fs_devices; | |
7325 | while (fs_devices) { | |
7326 | fs_devices->fs_info = fs_info; | |
7327 | fs_devices = fs_devices->seed; | |
7328 | } | |
7329 | } | |
7330 | ||
7331 | void btrfs_reset_fs_info_ptr(struct btrfs_fs_info *fs_info) | |
7332 | { | |
7333 | struct btrfs_fs_devices *fs_devices = fs_info->fs_devices; | |
7334 | while (fs_devices) { | |
7335 | fs_devices->fs_info = NULL; | |
7336 | fs_devices = fs_devices->seed; | |
7337 | } | |
7338 | } | |
46df06b8 DS |
7339 | |
7340 | /* | |
7341 | * Multiplicity factor for simple profiles: DUP, RAID1-like and RAID10. | |
7342 | */ | |
7343 | int btrfs_bg_type_to_factor(u64 flags) | |
7344 | { | |
7345 | if (flags & (BTRFS_BLOCK_GROUP_DUP | BTRFS_BLOCK_GROUP_RAID1 | | |
7346 | BTRFS_BLOCK_GROUP_RAID10)) | |
7347 | return 2; | |
7348 | return 1; | |
7349 | } | |
cf90d884 QW |
7350 | |
7351 | ||
7352 | static u64 calc_stripe_length(u64 type, u64 chunk_len, int num_stripes) | |
7353 | { | |
7354 | int index = btrfs_bg_flags_to_raid_index(type); | |
7355 | int ncopies = btrfs_raid_array[index].ncopies; | |
7356 | int data_stripes; | |
7357 | ||
7358 | switch (type & BTRFS_BLOCK_GROUP_PROFILE_MASK) { | |
7359 | case BTRFS_BLOCK_GROUP_RAID5: | |
7360 | data_stripes = num_stripes - 1; | |
7361 | break; | |
7362 | case BTRFS_BLOCK_GROUP_RAID6: | |
7363 | data_stripes = num_stripes - 2; | |
7364 | break; | |
7365 | default: | |
7366 | data_stripes = num_stripes / ncopies; | |
7367 | break; | |
7368 | } | |
7369 | return div_u64(chunk_len, data_stripes); | |
7370 | } | |
7371 | ||
7372 | static int verify_one_dev_extent(struct btrfs_fs_info *fs_info, | |
7373 | u64 chunk_offset, u64 devid, | |
7374 | u64 physical_offset, u64 physical_len) | |
7375 | { | |
7376 | struct extent_map_tree *em_tree = &fs_info->mapping_tree.map_tree; | |
7377 | struct extent_map *em; | |
7378 | struct map_lookup *map; | |
7379 | u64 stripe_len; | |
7380 | bool found = false; | |
7381 | int ret = 0; | |
7382 | int i; | |
7383 | ||
7384 | read_lock(&em_tree->lock); | |
7385 | em = lookup_extent_mapping(em_tree, chunk_offset, 1); | |
7386 | read_unlock(&em_tree->lock); | |
7387 | ||
7388 | if (!em) { | |
7389 | btrfs_err(fs_info, | |
7390 | "dev extent physical offset %llu on devid %llu doesn't have corresponding chunk", | |
7391 | physical_offset, devid); | |
7392 | ret = -EUCLEAN; | |
7393 | goto out; | |
7394 | } | |
7395 | ||
7396 | map = em->map_lookup; | |
7397 | stripe_len = calc_stripe_length(map->type, em->len, map->num_stripes); | |
7398 | if (physical_len != stripe_len) { | |
7399 | btrfs_err(fs_info, | |
7400 | "dev extent physical offset %llu on devid %llu length doesn't match chunk %llu, have %llu expect %llu", | |
7401 | physical_offset, devid, em->start, physical_len, | |
7402 | stripe_len); | |
7403 | ret = -EUCLEAN; | |
7404 | goto out; | |
7405 | } | |
7406 | ||
7407 | for (i = 0; i < map->num_stripes; i++) { | |
7408 | if (map->stripes[i].dev->devid == devid && | |
7409 | map->stripes[i].physical == physical_offset) { | |
7410 | found = true; | |
7411 | if (map->verified_stripes >= map->num_stripes) { | |
7412 | btrfs_err(fs_info, | |
7413 | "too many dev extents for chunk %llu found", | |
7414 | em->start); | |
7415 | ret = -EUCLEAN; | |
7416 | goto out; | |
7417 | } | |
7418 | map->verified_stripes++; | |
7419 | break; | |
7420 | } | |
7421 | } | |
7422 | if (!found) { | |
7423 | btrfs_err(fs_info, | |
7424 | "dev extent physical offset %llu devid %llu has no corresponding chunk", | |
7425 | physical_offset, devid); | |
7426 | ret = -EUCLEAN; | |
7427 | } | |
7428 | out: | |
7429 | free_extent_map(em); | |
7430 | return ret; | |
7431 | } | |
7432 | ||
7433 | static int verify_chunk_dev_extent_mapping(struct btrfs_fs_info *fs_info) | |
7434 | { | |
7435 | struct extent_map_tree *em_tree = &fs_info->mapping_tree.map_tree; | |
7436 | struct extent_map *em; | |
7437 | struct rb_node *node; | |
7438 | int ret = 0; | |
7439 | ||
7440 | read_lock(&em_tree->lock); | |
7441 | for (node = rb_first(&em_tree->map); node; node = rb_next(node)) { | |
7442 | em = rb_entry(node, struct extent_map, rb_node); | |
7443 | if (em->map_lookup->num_stripes != | |
7444 | em->map_lookup->verified_stripes) { | |
7445 | btrfs_err(fs_info, | |
7446 | "chunk %llu has missing dev extent, have %d expect %d", | |
7447 | em->start, em->map_lookup->verified_stripes, | |
7448 | em->map_lookup->num_stripes); | |
7449 | ret = -EUCLEAN; | |
7450 | goto out; | |
7451 | } | |
7452 | } | |
7453 | out: | |
7454 | read_unlock(&em_tree->lock); | |
7455 | return ret; | |
7456 | } | |
7457 | ||
7458 | /* | |
7459 | * Ensure that all dev extents are mapped to correct chunk, otherwise | |
7460 | * later chunk allocation/free would cause unexpected behavior. | |
7461 | * | |
7462 | * NOTE: This will iterate through the whole device tree, which should be of | |
7463 | * the same size level as the chunk tree. This slightly increases mount time. | |
7464 | */ | |
7465 | int btrfs_verify_dev_extents(struct btrfs_fs_info *fs_info) | |
7466 | { | |
7467 | struct btrfs_path *path; | |
7468 | struct btrfs_root *root = fs_info->dev_root; | |
7469 | struct btrfs_key key; | |
7470 | int ret = 0; | |
7471 | ||
7472 | key.objectid = 1; | |
7473 | key.type = BTRFS_DEV_EXTENT_KEY; | |
7474 | key.offset = 0; | |
7475 | ||
7476 | path = btrfs_alloc_path(); | |
7477 | if (!path) | |
7478 | return -ENOMEM; | |
7479 | ||
7480 | path->reada = READA_FORWARD; | |
7481 | ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); | |
7482 | if (ret < 0) | |
7483 | goto out; | |
7484 | ||
7485 | if (path->slots[0] >= btrfs_header_nritems(path->nodes[0])) { | |
7486 | ret = btrfs_next_item(root, path); | |
7487 | if (ret < 0) | |
7488 | goto out; | |
7489 | /* No dev extents at all? Not good */ | |
7490 | if (ret > 0) { | |
7491 | ret = -EUCLEAN; | |
7492 | goto out; | |
7493 | } | |
7494 | } | |
7495 | while (1) { | |
7496 | struct extent_buffer *leaf = path->nodes[0]; | |
7497 | struct btrfs_dev_extent *dext; | |
7498 | int slot = path->slots[0]; | |
7499 | u64 chunk_offset; | |
7500 | u64 physical_offset; | |
7501 | u64 physical_len; | |
7502 | u64 devid; | |
7503 | ||
7504 | btrfs_item_key_to_cpu(leaf, &key, slot); | |
7505 | if (key.type != BTRFS_DEV_EXTENT_KEY) | |
7506 | break; | |
7507 | devid = key.objectid; | |
7508 | physical_offset = key.offset; | |
7509 | ||
7510 | dext = btrfs_item_ptr(leaf, slot, struct btrfs_dev_extent); | |
7511 | chunk_offset = btrfs_dev_extent_chunk_offset(leaf, dext); | |
7512 | physical_len = btrfs_dev_extent_length(leaf, dext); | |
7513 | ||
7514 | ret = verify_one_dev_extent(fs_info, chunk_offset, devid, | |
7515 | physical_offset, physical_len); | |
7516 | if (ret < 0) | |
7517 | goto out; | |
7518 | ret = btrfs_next_item(root, path); | |
7519 | if (ret < 0) | |
7520 | goto out; | |
7521 | if (ret > 0) { | |
7522 | ret = 0; | |
7523 | break; | |
7524 | } | |
7525 | } | |
7526 | ||
7527 | /* Ensure all chunks have corresponding dev extents */ | |
7528 | ret = verify_chunk_dev_extent_mapping(fs_info); | |
7529 | out: | |
7530 | btrfs_free_path(path); | |
7531 | return ret; | |
7532 | } |