]>
Commit | Line | Data |
---|---|---|
0b86a832 CM |
1 | /* |
2 | * Copyright (C) 2007 Oracle. All rights reserved. | |
3 | * | |
4 | * This program is free software; you can redistribute it and/or | |
5 | * modify it under the terms of the GNU General Public | |
6 | * License v2 as published by the Free Software Foundation. | |
7 | * | |
8 | * This program is distributed in the hope that it will be useful, | |
9 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
10 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
11 | * General Public License for more details. | |
12 | * | |
13 | * You should have received a copy of the GNU General Public | |
14 | * License along with this program; if not, write to the | |
15 | * Free Software Foundation, Inc., 59 Temple Place - Suite 330, | |
16 | * Boston, MA 021110-1307, USA. | |
17 | */ | |
18 | #include <linux/sched.h> | |
19 | #include <linux/bio.h> | |
5a0e3ad6 | 20 | #include <linux/slab.h> |
8a4b83cc | 21 | #include <linux/buffer_head.h> |
f2d8d74d | 22 | #include <linux/blkdev.h> |
788f20eb | 23 | #include <linux/random.h> |
b765ead5 | 24 | #include <linux/iocontext.h> |
6f88a440 | 25 | #include <linux/capability.h> |
593060d7 | 26 | #include <asm/div64.h> |
4b4e25f2 | 27 | #include "compat.h" |
0b86a832 CM |
28 | #include "ctree.h" |
29 | #include "extent_map.h" | |
30 | #include "disk-io.h" | |
31 | #include "transaction.h" | |
32 | #include "print-tree.h" | |
33 | #include "volumes.h" | |
8b712842 | 34 | #include "async-thread.h" |
0b86a832 | 35 | |
2b82032c YZ |
36 | static int init_first_rw_device(struct btrfs_trans_handle *trans, |
37 | struct btrfs_root *root, | |
38 | struct btrfs_device *device); | |
39 | static int btrfs_relocate_sys_chunks(struct btrfs_root *root); | |
40 | ||
8a4b83cc CM |
41 | static DEFINE_MUTEX(uuid_mutex); |
42 | static LIST_HEAD(fs_uuids); | |
43 | ||
7d9eb12c CM |
44 | static void lock_chunks(struct btrfs_root *root) |
45 | { | |
7d9eb12c CM |
46 | mutex_lock(&root->fs_info->chunk_mutex); |
47 | } | |
48 | ||
49 | static void unlock_chunks(struct btrfs_root *root) | |
50 | { | |
7d9eb12c CM |
51 | mutex_unlock(&root->fs_info->chunk_mutex); |
52 | } | |
53 | ||
e4404d6e YZ |
54 | static void free_fs_devices(struct btrfs_fs_devices *fs_devices) |
55 | { | |
56 | struct btrfs_device *device; | |
57 | WARN_ON(fs_devices->opened); | |
58 | while (!list_empty(&fs_devices->devices)) { | |
59 | device = list_entry(fs_devices->devices.next, | |
60 | struct btrfs_device, dev_list); | |
61 | list_del(&device->dev_list); | |
62 | kfree(device->name); | |
63 | kfree(device); | |
64 | } | |
65 | kfree(fs_devices); | |
66 | } | |
67 | ||
8a4b83cc CM |
68 | int btrfs_cleanup_fs_uuids(void) |
69 | { | |
70 | struct btrfs_fs_devices *fs_devices; | |
8a4b83cc | 71 | |
2b82032c YZ |
72 | while (!list_empty(&fs_uuids)) { |
73 | fs_devices = list_entry(fs_uuids.next, | |
74 | struct btrfs_fs_devices, list); | |
75 | list_del(&fs_devices->list); | |
e4404d6e | 76 | free_fs_devices(fs_devices); |
8a4b83cc CM |
77 | } |
78 | return 0; | |
79 | } | |
80 | ||
a1b32a59 CM |
81 | static noinline struct btrfs_device *__find_device(struct list_head *head, |
82 | u64 devid, u8 *uuid) | |
8a4b83cc CM |
83 | { |
84 | struct btrfs_device *dev; | |
8a4b83cc | 85 | |
c6e30871 | 86 | list_for_each_entry(dev, head, dev_list) { |
a443755f | 87 | if (dev->devid == devid && |
8f18cf13 | 88 | (!uuid || !memcmp(dev->uuid, uuid, BTRFS_UUID_SIZE))) { |
8a4b83cc | 89 | return dev; |
a443755f | 90 | } |
8a4b83cc CM |
91 | } |
92 | return NULL; | |
93 | } | |
94 | ||
a1b32a59 | 95 | static noinline struct btrfs_fs_devices *find_fsid(u8 *fsid) |
8a4b83cc | 96 | { |
8a4b83cc CM |
97 | struct btrfs_fs_devices *fs_devices; |
98 | ||
c6e30871 | 99 | list_for_each_entry(fs_devices, &fs_uuids, list) { |
8a4b83cc CM |
100 | if (memcmp(fsid, fs_devices->fsid, BTRFS_FSID_SIZE) == 0) |
101 | return fs_devices; | |
102 | } | |
103 | return NULL; | |
104 | } | |
105 | ||
ffbd517d CM |
106 | static void requeue_list(struct btrfs_pending_bios *pending_bios, |
107 | struct bio *head, struct bio *tail) | |
108 | { | |
109 | ||
110 | struct bio *old_head; | |
111 | ||
112 | old_head = pending_bios->head; | |
113 | pending_bios->head = head; | |
114 | if (pending_bios->tail) | |
115 | tail->bi_next = old_head; | |
116 | else | |
117 | pending_bios->tail = tail; | |
118 | } | |
119 | ||
8b712842 CM |
120 | /* |
121 | * we try to collect pending bios for a device so we don't get a large | |
122 | * number of procs sending bios down to the same device. This greatly | |
123 | * improves the schedulers ability to collect and merge the bios. | |
124 | * | |
125 | * But, it also turns into a long list of bios to process and that is sure | |
126 | * to eventually make the worker thread block. The solution here is to | |
127 | * make some progress and then put this work struct back at the end of | |
128 | * the list if the block device is congested. This way, multiple devices | |
129 | * can make progress from a single worker thread. | |
130 | */ | |
d397712b | 131 | static noinline int run_scheduled_bios(struct btrfs_device *device) |
8b712842 CM |
132 | { |
133 | struct bio *pending; | |
134 | struct backing_dev_info *bdi; | |
b64a2851 | 135 | struct btrfs_fs_info *fs_info; |
ffbd517d | 136 | struct btrfs_pending_bios *pending_bios; |
8b712842 CM |
137 | struct bio *tail; |
138 | struct bio *cur; | |
139 | int again = 0; | |
ffbd517d | 140 | unsigned long num_run; |
d644d8a1 | 141 | unsigned long batch_run = 0; |
b64a2851 | 142 | unsigned long limit; |
b765ead5 | 143 | unsigned long last_waited = 0; |
d84275c9 | 144 | int force_reg = 0; |
211588ad CM |
145 | struct blk_plug plug; |
146 | ||
147 | /* | |
148 | * this function runs all the bios we've collected for | |
149 | * a particular device. We don't want to wander off to | |
150 | * another device without first sending all of these down. | |
151 | * So, setup a plug here and finish it off before we return | |
152 | */ | |
153 | blk_start_plug(&plug); | |
8b712842 | 154 | |
bedf762b | 155 | bdi = blk_get_backing_dev_info(device->bdev); |
b64a2851 CM |
156 | fs_info = device->dev_root->fs_info; |
157 | limit = btrfs_async_submit_limit(fs_info); | |
158 | limit = limit * 2 / 3; | |
159 | ||
8b712842 CM |
160 | loop: |
161 | spin_lock(&device->io_lock); | |
162 | ||
a6837051 | 163 | loop_lock: |
d84275c9 | 164 | num_run = 0; |
ffbd517d | 165 | |
8b712842 CM |
166 | /* take all the bios off the list at once and process them |
167 | * later on (without the lock held). But, remember the | |
168 | * tail and other pointers so the bios can be properly reinserted | |
169 | * into the list if we hit congestion | |
170 | */ | |
d84275c9 | 171 | if (!force_reg && device->pending_sync_bios.head) { |
ffbd517d | 172 | pending_bios = &device->pending_sync_bios; |
d84275c9 CM |
173 | force_reg = 1; |
174 | } else { | |
ffbd517d | 175 | pending_bios = &device->pending_bios; |
d84275c9 CM |
176 | force_reg = 0; |
177 | } | |
ffbd517d CM |
178 | |
179 | pending = pending_bios->head; | |
180 | tail = pending_bios->tail; | |
8b712842 | 181 | WARN_ON(pending && !tail); |
8b712842 CM |
182 | |
183 | /* | |
184 | * if pending was null this time around, no bios need processing | |
185 | * at all and we can stop. Otherwise it'll loop back up again | |
186 | * and do an additional check so no bios are missed. | |
187 | * | |
188 | * device->running_pending is used to synchronize with the | |
189 | * schedule_bio code. | |
190 | */ | |
ffbd517d CM |
191 | if (device->pending_sync_bios.head == NULL && |
192 | device->pending_bios.head == NULL) { | |
8b712842 CM |
193 | again = 0; |
194 | device->running_pending = 0; | |
ffbd517d CM |
195 | } else { |
196 | again = 1; | |
197 | device->running_pending = 1; | |
8b712842 | 198 | } |
ffbd517d CM |
199 | |
200 | pending_bios->head = NULL; | |
201 | pending_bios->tail = NULL; | |
202 | ||
8b712842 CM |
203 | spin_unlock(&device->io_lock); |
204 | ||
d397712b | 205 | while (pending) { |
ffbd517d CM |
206 | |
207 | rmb(); | |
d84275c9 CM |
208 | /* we want to work on both lists, but do more bios on the |
209 | * sync list than the regular list | |
210 | */ | |
211 | if ((num_run > 32 && | |
212 | pending_bios != &device->pending_sync_bios && | |
213 | device->pending_sync_bios.head) || | |
214 | (num_run > 64 && pending_bios == &device->pending_sync_bios && | |
215 | device->pending_bios.head)) { | |
ffbd517d CM |
216 | spin_lock(&device->io_lock); |
217 | requeue_list(pending_bios, pending, tail); | |
218 | goto loop_lock; | |
219 | } | |
220 | ||
8b712842 CM |
221 | cur = pending; |
222 | pending = pending->bi_next; | |
223 | cur->bi_next = NULL; | |
b64a2851 CM |
224 | atomic_dec(&fs_info->nr_async_bios); |
225 | ||
226 | if (atomic_read(&fs_info->nr_async_bios) < limit && | |
227 | waitqueue_active(&fs_info->async_submit_wait)) | |
228 | wake_up(&fs_info->async_submit_wait); | |
492bb6de CM |
229 | |
230 | BUG_ON(atomic_read(&cur->bi_cnt) == 0); | |
d644d8a1 | 231 | |
5ff7ba3a CM |
232 | submit_bio(cur->bi_rw, cur); |
233 | num_run++; | |
234 | batch_run++; | |
7eaceacc | 235 | if (need_resched()) |
ffbd517d | 236 | cond_resched(); |
8b712842 CM |
237 | |
238 | /* | |
239 | * we made progress, there is more work to do and the bdi | |
240 | * is now congested. Back off and let other work structs | |
241 | * run instead | |
242 | */ | |
57fd5a5f | 243 | if (pending && bdi_write_congested(bdi) && batch_run > 8 && |
5f2cc086 | 244 | fs_info->fs_devices->open_devices > 1) { |
b765ead5 | 245 | struct io_context *ioc; |
8b712842 | 246 | |
b765ead5 CM |
247 | ioc = current->io_context; |
248 | ||
249 | /* | |
250 | * the main goal here is that we don't want to | |
251 | * block if we're going to be able to submit | |
252 | * more requests without blocking. | |
253 | * | |
254 | * This code does two great things, it pokes into | |
255 | * the elevator code from a filesystem _and_ | |
256 | * it makes assumptions about how batching works. | |
257 | */ | |
258 | if (ioc && ioc->nr_batch_requests > 0 && | |
259 | time_before(jiffies, ioc->last_waited + HZ/50UL) && | |
260 | (last_waited == 0 || | |
261 | ioc->last_waited == last_waited)) { | |
262 | /* | |
263 | * we want to go through our batch of | |
264 | * requests and stop. So, we copy out | |
265 | * the ioc->last_waited time and test | |
266 | * against it before looping | |
267 | */ | |
268 | last_waited = ioc->last_waited; | |
7eaceacc | 269 | if (need_resched()) |
ffbd517d | 270 | cond_resched(); |
b765ead5 CM |
271 | continue; |
272 | } | |
8b712842 | 273 | spin_lock(&device->io_lock); |
ffbd517d | 274 | requeue_list(pending_bios, pending, tail); |
a6837051 | 275 | device->running_pending = 1; |
8b712842 CM |
276 | |
277 | spin_unlock(&device->io_lock); | |
278 | btrfs_requeue_work(&device->work); | |
279 | goto done; | |
280 | } | |
281 | } | |
ffbd517d | 282 | |
51684082 CM |
283 | cond_resched(); |
284 | if (again) | |
285 | goto loop; | |
286 | ||
287 | spin_lock(&device->io_lock); | |
288 | if (device->pending_bios.head || device->pending_sync_bios.head) | |
289 | goto loop_lock; | |
290 | spin_unlock(&device->io_lock); | |
291 | ||
8b712842 | 292 | done: |
211588ad | 293 | blk_finish_plug(&plug); |
8b712842 CM |
294 | return 0; |
295 | } | |
296 | ||
b2950863 | 297 | static void pending_bios_fn(struct btrfs_work *work) |
8b712842 CM |
298 | { |
299 | struct btrfs_device *device; | |
300 | ||
301 | device = container_of(work, struct btrfs_device, work); | |
302 | run_scheduled_bios(device); | |
303 | } | |
304 | ||
a1b32a59 | 305 | static noinline int device_list_add(const char *path, |
8a4b83cc CM |
306 | struct btrfs_super_block *disk_super, |
307 | u64 devid, struct btrfs_fs_devices **fs_devices_ret) | |
308 | { | |
309 | struct btrfs_device *device; | |
310 | struct btrfs_fs_devices *fs_devices; | |
311 | u64 found_transid = btrfs_super_generation(disk_super); | |
3a0524dc | 312 | char *name; |
8a4b83cc CM |
313 | |
314 | fs_devices = find_fsid(disk_super->fsid); | |
315 | if (!fs_devices) { | |
515dc322 | 316 | fs_devices = kzalloc(sizeof(*fs_devices), GFP_NOFS); |
8a4b83cc CM |
317 | if (!fs_devices) |
318 | return -ENOMEM; | |
319 | INIT_LIST_HEAD(&fs_devices->devices); | |
b3075717 | 320 | INIT_LIST_HEAD(&fs_devices->alloc_list); |
8a4b83cc CM |
321 | list_add(&fs_devices->list, &fs_uuids); |
322 | memcpy(fs_devices->fsid, disk_super->fsid, BTRFS_FSID_SIZE); | |
323 | fs_devices->latest_devid = devid; | |
324 | fs_devices->latest_trans = found_transid; | |
e5e9a520 | 325 | mutex_init(&fs_devices->device_list_mutex); |
8a4b83cc CM |
326 | device = NULL; |
327 | } else { | |
a443755f CM |
328 | device = __find_device(&fs_devices->devices, devid, |
329 | disk_super->dev_item.uuid); | |
8a4b83cc CM |
330 | } |
331 | if (!device) { | |
2b82032c YZ |
332 | if (fs_devices->opened) |
333 | return -EBUSY; | |
334 | ||
8a4b83cc CM |
335 | device = kzalloc(sizeof(*device), GFP_NOFS); |
336 | if (!device) { | |
337 | /* we can safely leave the fs_devices entry around */ | |
338 | return -ENOMEM; | |
339 | } | |
340 | device->devid = devid; | |
8b712842 | 341 | device->work.func = pending_bios_fn; |
a443755f CM |
342 | memcpy(device->uuid, disk_super->dev_item.uuid, |
343 | BTRFS_UUID_SIZE); | |
b248a415 | 344 | spin_lock_init(&device->io_lock); |
8a4b83cc CM |
345 | device->name = kstrdup(path, GFP_NOFS); |
346 | if (!device->name) { | |
347 | kfree(device); | |
348 | return -ENOMEM; | |
349 | } | |
2b82032c | 350 | INIT_LIST_HEAD(&device->dev_alloc_list); |
e5e9a520 CM |
351 | |
352 | mutex_lock(&fs_devices->device_list_mutex); | |
1f78160c | 353 | list_add_rcu(&device->dev_list, &fs_devices->devices); |
e5e9a520 CM |
354 | mutex_unlock(&fs_devices->device_list_mutex); |
355 | ||
2b82032c | 356 | device->fs_devices = fs_devices; |
8a4b83cc | 357 | fs_devices->num_devices++; |
cd02dca5 | 358 | } else if (!device->name || strcmp(device->name, path)) { |
3a0524dc TH |
359 | name = kstrdup(path, GFP_NOFS); |
360 | if (!name) | |
361 | return -ENOMEM; | |
362 | kfree(device->name); | |
363 | device->name = name; | |
cd02dca5 CM |
364 | if (device->missing) { |
365 | fs_devices->missing_devices--; | |
366 | device->missing = 0; | |
367 | } | |
8a4b83cc CM |
368 | } |
369 | ||
370 | if (found_transid > fs_devices->latest_trans) { | |
371 | fs_devices->latest_devid = devid; | |
372 | fs_devices->latest_trans = found_transid; | |
373 | } | |
8a4b83cc CM |
374 | *fs_devices_ret = fs_devices; |
375 | return 0; | |
376 | } | |
377 | ||
e4404d6e YZ |
378 | static struct btrfs_fs_devices *clone_fs_devices(struct btrfs_fs_devices *orig) |
379 | { | |
380 | struct btrfs_fs_devices *fs_devices; | |
381 | struct btrfs_device *device; | |
382 | struct btrfs_device *orig_dev; | |
383 | ||
384 | fs_devices = kzalloc(sizeof(*fs_devices), GFP_NOFS); | |
385 | if (!fs_devices) | |
386 | return ERR_PTR(-ENOMEM); | |
387 | ||
388 | INIT_LIST_HEAD(&fs_devices->devices); | |
389 | INIT_LIST_HEAD(&fs_devices->alloc_list); | |
390 | INIT_LIST_HEAD(&fs_devices->list); | |
e5e9a520 | 391 | mutex_init(&fs_devices->device_list_mutex); |
e4404d6e YZ |
392 | fs_devices->latest_devid = orig->latest_devid; |
393 | fs_devices->latest_trans = orig->latest_trans; | |
394 | memcpy(fs_devices->fsid, orig->fsid, sizeof(fs_devices->fsid)); | |
395 | ||
46224705 | 396 | /* We have held the volume lock, it is safe to get the devices. */ |
e4404d6e YZ |
397 | list_for_each_entry(orig_dev, &orig->devices, dev_list) { |
398 | device = kzalloc(sizeof(*device), GFP_NOFS); | |
399 | if (!device) | |
400 | goto error; | |
401 | ||
402 | device->name = kstrdup(orig_dev->name, GFP_NOFS); | |
fd2696f3 JL |
403 | if (!device->name) { |
404 | kfree(device); | |
e4404d6e | 405 | goto error; |
fd2696f3 | 406 | } |
e4404d6e YZ |
407 | |
408 | device->devid = orig_dev->devid; | |
409 | device->work.func = pending_bios_fn; | |
410 | memcpy(device->uuid, orig_dev->uuid, sizeof(device->uuid)); | |
e4404d6e YZ |
411 | spin_lock_init(&device->io_lock); |
412 | INIT_LIST_HEAD(&device->dev_list); | |
413 | INIT_LIST_HEAD(&device->dev_alloc_list); | |
414 | ||
415 | list_add(&device->dev_list, &fs_devices->devices); | |
416 | device->fs_devices = fs_devices; | |
417 | fs_devices->num_devices++; | |
418 | } | |
419 | return fs_devices; | |
420 | error: | |
421 | free_fs_devices(fs_devices); | |
422 | return ERR_PTR(-ENOMEM); | |
423 | } | |
424 | ||
dfe25020 CM |
425 | int btrfs_close_extra_devices(struct btrfs_fs_devices *fs_devices) |
426 | { | |
c6e30871 | 427 | struct btrfs_device *device, *next; |
dfe25020 CM |
428 | |
429 | mutex_lock(&uuid_mutex); | |
430 | again: | |
46224705 | 431 | /* This is the initialized path, it is safe to release the devices. */ |
c6e30871 | 432 | list_for_each_entry_safe(device, next, &fs_devices->devices, dev_list) { |
2b82032c YZ |
433 | if (device->in_fs_metadata) |
434 | continue; | |
435 | ||
436 | if (device->bdev) { | |
d4d77629 | 437 | blkdev_put(device->bdev, device->mode); |
2b82032c YZ |
438 | device->bdev = NULL; |
439 | fs_devices->open_devices--; | |
440 | } | |
441 | if (device->writeable) { | |
442 | list_del_init(&device->dev_alloc_list); | |
443 | device->writeable = 0; | |
444 | fs_devices->rw_devices--; | |
445 | } | |
e4404d6e YZ |
446 | list_del_init(&device->dev_list); |
447 | fs_devices->num_devices--; | |
448 | kfree(device->name); | |
449 | kfree(device); | |
dfe25020 | 450 | } |
2b82032c YZ |
451 | |
452 | if (fs_devices->seed) { | |
453 | fs_devices = fs_devices->seed; | |
2b82032c YZ |
454 | goto again; |
455 | } | |
456 | ||
dfe25020 CM |
457 | mutex_unlock(&uuid_mutex); |
458 | return 0; | |
459 | } | |
a0af469b | 460 | |
1f78160c XG |
461 | static void __free_device(struct work_struct *work) |
462 | { | |
463 | struct btrfs_device *device; | |
464 | ||
465 | device = container_of(work, struct btrfs_device, rcu_work); | |
466 | ||
467 | if (device->bdev) | |
468 | blkdev_put(device->bdev, device->mode); | |
469 | ||
470 | kfree(device->name); | |
471 | kfree(device); | |
472 | } | |
473 | ||
474 | static void free_device(struct rcu_head *head) | |
475 | { | |
476 | struct btrfs_device *device; | |
477 | ||
478 | device = container_of(head, struct btrfs_device, rcu); | |
479 | ||
480 | INIT_WORK(&device->rcu_work, __free_device); | |
481 | schedule_work(&device->rcu_work); | |
482 | } | |
483 | ||
2b82032c | 484 | static int __btrfs_close_devices(struct btrfs_fs_devices *fs_devices) |
8a4b83cc | 485 | { |
8a4b83cc | 486 | struct btrfs_device *device; |
e4404d6e | 487 | |
2b82032c YZ |
488 | if (--fs_devices->opened > 0) |
489 | return 0; | |
8a4b83cc | 490 | |
c9513edb | 491 | mutex_lock(&fs_devices->device_list_mutex); |
c6e30871 | 492 | list_for_each_entry(device, &fs_devices->devices, dev_list) { |
1f78160c XG |
493 | struct btrfs_device *new_device; |
494 | ||
495 | if (device->bdev) | |
a0af469b | 496 | fs_devices->open_devices--; |
1f78160c | 497 | |
2b82032c YZ |
498 | if (device->writeable) { |
499 | list_del_init(&device->dev_alloc_list); | |
500 | fs_devices->rw_devices--; | |
501 | } | |
502 | ||
1f78160c XG |
503 | new_device = kmalloc(sizeof(*new_device), GFP_NOFS); |
504 | BUG_ON(!new_device); | |
505 | memcpy(new_device, device, sizeof(*new_device)); | |
506 | new_device->name = kstrdup(device->name, GFP_NOFS); | |
5f3f302a | 507 | BUG_ON(device->name && !new_device->name); |
1f78160c XG |
508 | new_device->bdev = NULL; |
509 | new_device->writeable = 0; | |
510 | new_device->in_fs_metadata = 0; | |
511 | list_replace_rcu(&device->dev_list, &new_device->dev_list); | |
512 | ||
513 | call_rcu(&device->rcu, free_device); | |
8a4b83cc | 514 | } |
c9513edb XG |
515 | mutex_unlock(&fs_devices->device_list_mutex); |
516 | ||
e4404d6e YZ |
517 | WARN_ON(fs_devices->open_devices); |
518 | WARN_ON(fs_devices->rw_devices); | |
2b82032c YZ |
519 | fs_devices->opened = 0; |
520 | fs_devices->seeding = 0; | |
2b82032c | 521 | |
8a4b83cc CM |
522 | return 0; |
523 | } | |
524 | ||
2b82032c YZ |
525 | int btrfs_close_devices(struct btrfs_fs_devices *fs_devices) |
526 | { | |
e4404d6e | 527 | struct btrfs_fs_devices *seed_devices = NULL; |
2b82032c YZ |
528 | int ret; |
529 | ||
530 | mutex_lock(&uuid_mutex); | |
531 | ret = __btrfs_close_devices(fs_devices); | |
e4404d6e YZ |
532 | if (!fs_devices->opened) { |
533 | seed_devices = fs_devices->seed; | |
534 | fs_devices->seed = NULL; | |
535 | } | |
2b82032c | 536 | mutex_unlock(&uuid_mutex); |
e4404d6e YZ |
537 | |
538 | while (seed_devices) { | |
539 | fs_devices = seed_devices; | |
540 | seed_devices = fs_devices->seed; | |
541 | __btrfs_close_devices(fs_devices); | |
542 | free_fs_devices(fs_devices); | |
543 | } | |
2b82032c YZ |
544 | return ret; |
545 | } | |
546 | ||
e4404d6e YZ |
547 | static int __btrfs_open_devices(struct btrfs_fs_devices *fs_devices, |
548 | fmode_t flags, void *holder) | |
8a4b83cc CM |
549 | { |
550 | struct block_device *bdev; | |
551 | struct list_head *head = &fs_devices->devices; | |
8a4b83cc | 552 | struct btrfs_device *device; |
a0af469b CM |
553 | struct block_device *latest_bdev = NULL; |
554 | struct buffer_head *bh; | |
555 | struct btrfs_super_block *disk_super; | |
556 | u64 latest_devid = 0; | |
557 | u64 latest_transid = 0; | |
a0af469b | 558 | u64 devid; |
2b82032c | 559 | int seeding = 1; |
a0af469b | 560 | int ret = 0; |
8a4b83cc | 561 | |
d4d77629 TH |
562 | flags |= FMODE_EXCL; |
563 | ||
c6e30871 | 564 | list_for_each_entry(device, head, dev_list) { |
c1c4d91c CM |
565 | if (device->bdev) |
566 | continue; | |
dfe25020 CM |
567 | if (!device->name) |
568 | continue; | |
569 | ||
d4d77629 | 570 | bdev = blkdev_get_by_path(device->name, flags, holder); |
8a4b83cc | 571 | if (IS_ERR(bdev)) { |
d397712b | 572 | printk(KERN_INFO "open %s failed\n", device->name); |
a0af469b | 573 | goto error; |
8a4b83cc | 574 | } |
a061fc8d | 575 | set_blocksize(bdev, 4096); |
a0af469b | 576 | |
a512bbf8 | 577 | bh = btrfs_read_dev_super(bdev); |
20b45077 DY |
578 | if (!bh) { |
579 | ret = -EINVAL; | |
a0af469b | 580 | goto error_close; |
20b45077 | 581 | } |
a0af469b CM |
582 | |
583 | disk_super = (struct btrfs_super_block *)bh->b_data; | |
a343832f | 584 | devid = btrfs_stack_device_id(&disk_super->dev_item); |
a0af469b CM |
585 | if (devid != device->devid) |
586 | goto error_brelse; | |
587 | ||
2b82032c YZ |
588 | if (memcmp(device->uuid, disk_super->dev_item.uuid, |
589 | BTRFS_UUID_SIZE)) | |
590 | goto error_brelse; | |
591 | ||
592 | device->generation = btrfs_super_generation(disk_super); | |
593 | if (!latest_transid || device->generation > latest_transid) { | |
a0af469b | 594 | latest_devid = devid; |
2b82032c | 595 | latest_transid = device->generation; |
a0af469b CM |
596 | latest_bdev = bdev; |
597 | } | |
598 | ||
2b82032c YZ |
599 | if (btrfs_super_flags(disk_super) & BTRFS_SUPER_FLAG_SEEDING) { |
600 | device->writeable = 0; | |
601 | } else { | |
602 | device->writeable = !bdev_read_only(bdev); | |
603 | seeding = 0; | |
604 | } | |
605 | ||
8a4b83cc | 606 | device->bdev = bdev; |
dfe25020 | 607 | device->in_fs_metadata = 0; |
15916de8 CM |
608 | device->mode = flags; |
609 | ||
c289811c CM |
610 | if (!blk_queue_nonrot(bdev_get_queue(bdev))) |
611 | fs_devices->rotating = 1; | |
612 | ||
a0af469b | 613 | fs_devices->open_devices++; |
2b82032c YZ |
614 | if (device->writeable) { |
615 | fs_devices->rw_devices++; | |
616 | list_add(&device->dev_alloc_list, | |
617 | &fs_devices->alloc_list); | |
618 | } | |
4f6c9328 | 619 | brelse(bh); |
a0af469b | 620 | continue; |
a061fc8d | 621 | |
a0af469b CM |
622 | error_brelse: |
623 | brelse(bh); | |
624 | error_close: | |
d4d77629 | 625 | blkdev_put(bdev, flags); |
a0af469b CM |
626 | error: |
627 | continue; | |
8a4b83cc | 628 | } |
a0af469b CM |
629 | if (fs_devices->open_devices == 0) { |
630 | ret = -EIO; | |
631 | goto out; | |
632 | } | |
2b82032c YZ |
633 | fs_devices->seeding = seeding; |
634 | fs_devices->opened = 1; | |
a0af469b CM |
635 | fs_devices->latest_bdev = latest_bdev; |
636 | fs_devices->latest_devid = latest_devid; | |
637 | fs_devices->latest_trans = latest_transid; | |
2b82032c | 638 | fs_devices->total_rw_bytes = 0; |
a0af469b | 639 | out: |
2b82032c YZ |
640 | return ret; |
641 | } | |
642 | ||
643 | int btrfs_open_devices(struct btrfs_fs_devices *fs_devices, | |
97288f2c | 644 | fmode_t flags, void *holder) |
2b82032c YZ |
645 | { |
646 | int ret; | |
647 | ||
648 | mutex_lock(&uuid_mutex); | |
649 | if (fs_devices->opened) { | |
e4404d6e YZ |
650 | fs_devices->opened++; |
651 | ret = 0; | |
2b82032c | 652 | } else { |
15916de8 | 653 | ret = __btrfs_open_devices(fs_devices, flags, holder); |
2b82032c | 654 | } |
8a4b83cc | 655 | mutex_unlock(&uuid_mutex); |
8a4b83cc CM |
656 | return ret; |
657 | } | |
658 | ||
97288f2c | 659 | int btrfs_scan_one_device(const char *path, fmode_t flags, void *holder, |
8a4b83cc CM |
660 | struct btrfs_fs_devices **fs_devices_ret) |
661 | { | |
662 | struct btrfs_super_block *disk_super; | |
663 | struct block_device *bdev; | |
664 | struct buffer_head *bh; | |
665 | int ret; | |
666 | u64 devid; | |
f2984462 | 667 | u64 transid; |
8a4b83cc CM |
668 | |
669 | mutex_lock(&uuid_mutex); | |
670 | ||
d4d77629 TH |
671 | flags |= FMODE_EXCL; |
672 | bdev = blkdev_get_by_path(path, flags, holder); | |
8a4b83cc CM |
673 | |
674 | if (IS_ERR(bdev)) { | |
8a4b83cc CM |
675 | ret = PTR_ERR(bdev); |
676 | goto error; | |
677 | } | |
678 | ||
679 | ret = set_blocksize(bdev, 4096); | |
680 | if (ret) | |
681 | goto error_close; | |
a512bbf8 | 682 | bh = btrfs_read_dev_super(bdev); |
8a4b83cc | 683 | if (!bh) { |
20b45077 | 684 | ret = -EINVAL; |
8a4b83cc CM |
685 | goto error_close; |
686 | } | |
687 | disk_super = (struct btrfs_super_block *)bh->b_data; | |
a343832f | 688 | devid = btrfs_stack_device_id(&disk_super->dev_item); |
f2984462 | 689 | transid = btrfs_super_generation(disk_super); |
7ae9c09d | 690 | if (disk_super->label[0]) |
d397712b | 691 | printk(KERN_INFO "device label %s ", disk_super->label); |
22b63a29 ID |
692 | else |
693 | printk(KERN_INFO "device fsid %pU ", disk_super->fsid); | |
119e10cf | 694 | printk(KERN_CONT "devid %llu transid %llu %s\n", |
d397712b | 695 | (unsigned long long)devid, (unsigned long long)transid, path); |
8a4b83cc CM |
696 | ret = device_list_add(path, disk_super, devid, fs_devices_ret); |
697 | ||
8a4b83cc CM |
698 | brelse(bh); |
699 | error_close: | |
d4d77629 | 700 | blkdev_put(bdev, flags); |
8a4b83cc CM |
701 | error: |
702 | mutex_unlock(&uuid_mutex); | |
703 | return ret; | |
704 | } | |
0b86a832 | 705 | |
6d07bcec MX |
706 | /* helper to account the used device space in the range */ |
707 | int btrfs_account_dev_extents_size(struct btrfs_device *device, u64 start, | |
708 | u64 end, u64 *length) | |
709 | { | |
710 | struct btrfs_key key; | |
711 | struct btrfs_root *root = device->dev_root; | |
712 | struct btrfs_dev_extent *dev_extent; | |
713 | struct btrfs_path *path; | |
714 | u64 extent_end; | |
715 | int ret; | |
716 | int slot; | |
717 | struct extent_buffer *l; | |
718 | ||
719 | *length = 0; | |
720 | ||
721 | if (start >= device->total_bytes) | |
722 | return 0; | |
723 | ||
724 | path = btrfs_alloc_path(); | |
725 | if (!path) | |
726 | return -ENOMEM; | |
727 | path->reada = 2; | |
728 | ||
729 | key.objectid = device->devid; | |
730 | key.offset = start; | |
731 | key.type = BTRFS_DEV_EXTENT_KEY; | |
732 | ||
733 | ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); | |
734 | if (ret < 0) | |
735 | goto out; | |
736 | if (ret > 0) { | |
737 | ret = btrfs_previous_item(root, path, key.objectid, key.type); | |
738 | if (ret < 0) | |
739 | goto out; | |
740 | } | |
741 | ||
742 | while (1) { | |
743 | l = path->nodes[0]; | |
744 | slot = path->slots[0]; | |
745 | if (slot >= btrfs_header_nritems(l)) { | |
746 | ret = btrfs_next_leaf(root, path); | |
747 | if (ret == 0) | |
748 | continue; | |
749 | if (ret < 0) | |
750 | goto out; | |
751 | ||
752 | break; | |
753 | } | |
754 | btrfs_item_key_to_cpu(l, &key, slot); | |
755 | ||
756 | if (key.objectid < device->devid) | |
757 | goto next; | |
758 | ||
759 | if (key.objectid > device->devid) | |
760 | break; | |
761 | ||
762 | if (btrfs_key_type(&key) != BTRFS_DEV_EXTENT_KEY) | |
763 | goto next; | |
764 | ||
765 | dev_extent = btrfs_item_ptr(l, slot, struct btrfs_dev_extent); | |
766 | extent_end = key.offset + btrfs_dev_extent_length(l, | |
767 | dev_extent); | |
768 | if (key.offset <= start && extent_end > end) { | |
769 | *length = end - start + 1; | |
770 | break; | |
771 | } else if (key.offset <= start && extent_end > start) | |
772 | *length += extent_end - start; | |
773 | else if (key.offset > start && extent_end <= end) | |
774 | *length += extent_end - key.offset; | |
775 | else if (key.offset > start && key.offset <= end) { | |
776 | *length += end - key.offset + 1; | |
777 | break; | |
778 | } else if (key.offset > end) | |
779 | break; | |
780 | ||
781 | next: | |
782 | path->slots[0]++; | |
783 | } | |
784 | ret = 0; | |
785 | out: | |
786 | btrfs_free_path(path); | |
787 | return ret; | |
788 | } | |
789 | ||
0b86a832 | 790 | /* |
7bfc837d MX |
791 | * find_free_dev_extent - find free space in the specified device |
792 | * @trans: transaction handler | |
793 | * @device: the device which we search the free space in | |
794 | * @num_bytes: the size of the free space that we need | |
795 | * @start: store the start of the free space. | |
796 | * @len: the size of the free space. that we find, or the size of the max | |
797 | * free space if we don't find suitable free space | |
798 | * | |
0b86a832 CM |
799 | * this uses a pretty simple search, the expectation is that it is |
800 | * called very infrequently and that a given device has a small number | |
801 | * of extents | |
7bfc837d MX |
802 | * |
803 | * @start is used to store the start of the free space if we find. But if we | |
804 | * don't find suitable free space, it will be used to store the start position | |
805 | * of the max free space. | |
806 | * | |
807 | * @len is used to store the size of the free space that we find. | |
808 | * But if we don't find suitable free space, it is used to store the size of | |
809 | * the max free space. | |
0b86a832 | 810 | */ |
ba1bf481 JB |
811 | int find_free_dev_extent(struct btrfs_trans_handle *trans, |
812 | struct btrfs_device *device, u64 num_bytes, | |
7bfc837d | 813 | u64 *start, u64 *len) |
0b86a832 CM |
814 | { |
815 | struct btrfs_key key; | |
816 | struct btrfs_root *root = device->dev_root; | |
7bfc837d | 817 | struct btrfs_dev_extent *dev_extent; |
2b82032c | 818 | struct btrfs_path *path; |
7bfc837d MX |
819 | u64 hole_size; |
820 | u64 max_hole_start; | |
821 | u64 max_hole_size; | |
822 | u64 extent_end; | |
823 | u64 search_start; | |
0b86a832 CM |
824 | u64 search_end = device->total_bytes; |
825 | int ret; | |
7bfc837d | 826 | int slot; |
0b86a832 CM |
827 | struct extent_buffer *l; |
828 | ||
0b86a832 CM |
829 | /* FIXME use last free of some kind */ |
830 | ||
8a4b83cc CM |
831 | /* we don't want to overwrite the superblock on the drive, |
832 | * so we make sure to start at an offset of at least 1MB | |
833 | */ | |
a9c9bf68 | 834 | search_start = max(root->fs_info->alloc_start, 1024ull * 1024); |
8f18cf13 | 835 | |
7bfc837d MX |
836 | max_hole_start = search_start; |
837 | max_hole_size = 0; | |
838 | ||
839 | if (search_start >= search_end) { | |
840 | ret = -ENOSPC; | |
841 | goto error; | |
842 | } | |
843 | ||
844 | path = btrfs_alloc_path(); | |
845 | if (!path) { | |
846 | ret = -ENOMEM; | |
847 | goto error; | |
848 | } | |
849 | path->reada = 2; | |
850 | ||
0b86a832 CM |
851 | key.objectid = device->devid; |
852 | key.offset = search_start; | |
853 | key.type = BTRFS_DEV_EXTENT_KEY; | |
7bfc837d | 854 | |
0b86a832 CM |
855 | ret = btrfs_search_slot(trans, root, &key, path, 0, 0); |
856 | if (ret < 0) | |
7bfc837d | 857 | goto out; |
1fcbac58 YZ |
858 | if (ret > 0) { |
859 | ret = btrfs_previous_item(root, path, key.objectid, key.type); | |
860 | if (ret < 0) | |
7bfc837d | 861 | goto out; |
1fcbac58 | 862 | } |
7bfc837d | 863 | |
0b86a832 CM |
864 | while (1) { |
865 | l = path->nodes[0]; | |
866 | slot = path->slots[0]; | |
867 | if (slot >= btrfs_header_nritems(l)) { | |
868 | ret = btrfs_next_leaf(root, path); | |
869 | if (ret == 0) | |
870 | continue; | |
871 | if (ret < 0) | |
7bfc837d MX |
872 | goto out; |
873 | ||
874 | break; | |
0b86a832 CM |
875 | } |
876 | btrfs_item_key_to_cpu(l, &key, slot); | |
877 | ||
878 | if (key.objectid < device->devid) | |
879 | goto next; | |
880 | ||
881 | if (key.objectid > device->devid) | |
7bfc837d | 882 | break; |
0b86a832 | 883 | |
7bfc837d MX |
884 | if (btrfs_key_type(&key) != BTRFS_DEV_EXTENT_KEY) |
885 | goto next; | |
9779b72f | 886 | |
7bfc837d MX |
887 | if (key.offset > search_start) { |
888 | hole_size = key.offset - search_start; | |
9779b72f | 889 | |
7bfc837d MX |
890 | if (hole_size > max_hole_size) { |
891 | max_hole_start = search_start; | |
892 | max_hole_size = hole_size; | |
893 | } | |
9779b72f | 894 | |
7bfc837d MX |
895 | /* |
896 | * If this free space is greater than which we need, | |
897 | * it must be the max free space that we have found | |
898 | * until now, so max_hole_start must point to the start | |
899 | * of this free space and the length of this free space | |
900 | * is stored in max_hole_size. Thus, we return | |
901 | * max_hole_start and max_hole_size and go back to the | |
902 | * caller. | |
903 | */ | |
904 | if (hole_size >= num_bytes) { | |
905 | ret = 0; | |
906 | goto out; | |
0b86a832 CM |
907 | } |
908 | } | |
0b86a832 | 909 | |
0b86a832 | 910 | dev_extent = btrfs_item_ptr(l, slot, struct btrfs_dev_extent); |
7bfc837d MX |
911 | extent_end = key.offset + btrfs_dev_extent_length(l, |
912 | dev_extent); | |
913 | if (extent_end > search_start) | |
914 | search_start = extent_end; | |
0b86a832 CM |
915 | next: |
916 | path->slots[0]++; | |
917 | cond_resched(); | |
918 | } | |
0b86a832 | 919 | |
7bfc837d MX |
920 | hole_size = search_end- search_start; |
921 | if (hole_size > max_hole_size) { | |
922 | max_hole_start = search_start; | |
923 | max_hole_size = hole_size; | |
0b86a832 | 924 | } |
0b86a832 | 925 | |
7bfc837d MX |
926 | /* See above. */ |
927 | if (hole_size < num_bytes) | |
928 | ret = -ENOSPC; | |
929 | else | |
930 | ret = 0; | |
931 | ||
932 | out: | |
2b82032c | 933 | btrfs_free_path(path); |
7bfc837d MX |
934 | error: |
935 | *start = max_hole_start; | |
b2117a39 | 936 | if (len) |
7bfc837d | 937 | *len = max_hole_size; |
0b86a832 CM |
938 | return ret; |
939 | } | |
940 | ||
b2950863 | 941 | static int btrfs_free_dev_extent(struct btrfs_trans_handle *trans, |
8f18cf13 CM |
942 | struct btrfs_device *device, |
943 | u64 start) | |
944 | { | |
945 | int ret; | |
946 | struct btrfs_path *path; | |
947 | struct btrfs_root *root = device->dev_root; | |
948 | struct btrfs_key key; | |
a061fc8d CM |
949 | struct btrfs_key found_key; |
950 | struct extent_buffer *leaf = NULL; | |
951 | struct btrfs_dev_extent *extent = NULL; | |
8f18cf13 CM |
952 | |
953 | path = btrfs_alloc_path(); | |
954 | if (!path) | |
955 | return -ENOMEM; | |
956 | ||
957 | key.objectid = device->devid; | |
958 | key.offset = start; | |
959 | key.type = BTRFS_DEV_EXTENT_KEY; | |
960 | ||
961 | ret = btrfs_search_slot(trans, root, &key, path, -1, 1); | |
a061fc8d CM |
962 | if (ret > 0) { |
963 | ret = btrfs_previous_item(root, path, key.objectid, | |
964 | BTRFS_DEV_EXTENT_KEY); | |
b0b802d7 TI |
965 | if (ret) |
966 | goto out; | |
a061fc8d CM |
967 | leaf = path->nodes[0]; |
968 | btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); | |
969 | extent = btrfs_item_ptr(leaf, path->slots[0], | |
970 | struct btrfs_dev_extent); | |
971 | BUG_ON(found_key.offset > start || found_key.offset + | |
972 | btrfs_dev_extent_length(leaf, extent) < start); | |
a061fc8d CM |
973 | } else if (ret == 0) { |
974 | leaf = path->nodes[0]; | |
975 | extent = btrfs_item_ptr(leaf, path->slots[0], | |
976 | struct btrfs_dev_extent); | |
977 | } | |
8f18cf13 CM |
978 | BUG_ON(ret); |
979 | ||
dfe25020 CM |
980 | if (device->bytes_used > 0) |
981 | device->bytes_used -= btrfs_dev_extent_length(leaf, extent); | |
8f18cf13 | 982 | ret = btrfs_del_item(trans, root, path); |
8f18cf13 | 983 | |
b0b802d7 | 984 | out: |
8f18cf13 CM |
985 | btrfs_free_path(path); |
986 | return ret; | |
987 | } | |
988 | ||
2b82032c | 989 | int btrfs_alloc_dev_extent(struct btrfs_trans_handle *trans, |
0b86a832 | 990 | struct btrfs_device *device, |
e17cade2 | 991 | u64 chunk_tree, u64 chunk_objectid, |
2b82032c | 992 | u64 chunk_offset, u64 start, u64 num_bytes) |
0b86a832 CM |
993 | { |
994 | int ret; | |
995 | struct btrfs_path *path; | |
996 | struct btrfs_root *root = device->dev_root; | |
997 | struct btrfs_dev_extent *extent; | |
998 | struct extent_buffer *leaf; | |
999 | struct btrfs_key key; | |
1000 | ||
dfe25020 | 1001 | WARN_ON(!device->in_fs_metadata); |
0b86a832 CM |
1002 | path = btrfs_alloc_path(); |
1003 | if (!path) | |
1004 | return -ENOMEM; | |
1005 | ||
0b86a832 | 1006 | key.objectid = device->devid; |
2b82032c | 1007 | key.offset = start; |
0b86a832 CM |
1008 | key.type = BTRFS_DEV_EXTENT_KEY; |
1009 | ret = btrfs_insert_empty_item(trans, root, path, &key, | |
1010 | sizeof(*extent)); | |
1011 | BUG_ON(ret); | |
1012 | ||
1013 | leaf = path->nodes[0]; | |
1014 | extent = btrfs_item_ptr(leaf, path->slots[0], | |
1015 | struct btrfs_dev_extent); | |
e17cade2 CM |
1016 | btrfs_set_dev_extent_chunk_tree(leaf, extent, chunk_tree); |
1017 | btrfs_set_dev_extent_chunk_objectid(leaf, extent, chunk_objectid); | |
1018 | btrfs_set_dev_extent_chunk_offset(leaf, extent, chunk_offset); | |
1019 | ||
1020 | write_extent_buffer(leaf, root->fs_info->chunk_tree_uuid, | |
1021 | (unsigned long)btrfs_dev_extent_chunk_tree_uuid(extent), | |
1022 | BTRFS_UUID_SIZE); | |
1023 | ||
0b86a832 CM |
1024 | btrfs_set_dev_extent_length(leaf, extent, num_bytes); |
1025 | btrfs_mark_buffer_dirty(leaf); | |
0b86a832 CM |
1026 | btrfs_free_path(path); |
1027 | return ret; | |
1028 | } | |
1029 | ||
a1b32a59 CM |
1030 | static noinline int find_next_chunk(struct btrfs_root *root, |
1031 | u64 objectid, u64 *offset) | |
0b86a832 CM |
1032 | { |
1033 | struct btrfs_path *path; | |
1034 | int ret; | |
1035 | struct btrfs_key key; | |
e17cade2 | 1036 | struct btrfs_chunk *chunk; |
0b86a832 CM |
1037 | struct btrfs_key found_key; |
1038 | ||
1039 | path = btrfs_alloc_path(); | |
1040 | BUG_ON(!path); | |
1041 | ||
e17cade2 | 1042 | key.objectid = objectid; |
0b86a832 CM |
1043 | key.offset = (u64)-1; |
1044 | key.type = BTRFS_CHUNK_ITEM_KEY; | |
1045 | ||
1046 | ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); | |
1047 | if (ret < 0) | |
1048 | goto error; | |
1049 | ||
1050 | BUG_ON(ret == 0); | |
1051 | ||
1052 | ret = btrfs_previous_item(root, path, 0, BTRFS_CHUNK_ITEM_KEY); | |
1053 | if (ret) { | |
e17cade2 | 1054 | *offset = 0; |
0b86a832 CM |
1055 | } else { |
1056 | btrfs_item_key_to_cpu(path->nodes[0], &found_key, | |
1057 | path->slots[0]); | |
e17cade2 CM |
1058 | if (found_key.objectid != objectid) |
1059 | *offset = 0; | |
1060 | else { | |
1061 | chunk = btrfs_item_ptr(path->nodes[0], path->slots[0], | |
1062 | struct btrfs_chunk); | |
1063 | *offset = found_key.offset + | |
1064 | btrfs_chunk_length(path->nodes[0], chunk); | |
1065 | } | |
0b86a832 CM |
1066 | } |
1067 | ret = 0; | |
1068 | error: | |
1069 | btrfs_free_path(path); | |
1070 | return ret; | |
1071 | } | |
1072 | ||
2b82032c | 1073 | static noinline int find_next_devid(struct btrfs_root *root, u64 *objectid) |
0b86a832 CM |
1074 | { |
1075 | int ret; | |
1076 | struct btrfs_key key; | |
1077 | struct btrfs_key found_key; | |
2b82032c YZ |
1078 | struct btrfs_path *path; |
1079 | ||
1080 | root = root->fs_info->chunk_root; | |
1081 | ||
1082 | path = btrfs_alloc_path(); | |
1083 | if (!path) | |
1084 | return -ENOMEM; | |
0b86a832 CM |
1085 | |
1086 | key.objectid = BTRFS_DEV_ITEMS_OBJECTID; | |
1087 | key.type = BTRFS_DEV_ITEM_KEY; | |
1088 | key.offset = (u64)-1; | |
1089 | ||
1090 | ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); | |
1091 | if (ret < 0) | |
1092 | goto error; | |
1093 | ||
1094 | BUG_ON(ret == 0); | |
1095 | ||
1096 | ret = btrfs_previous_item(root, path, BTRFS_DEV_ITEMS_OBJECTID, | |
1097 | BTRFS_DEV_ITEM_KEY); | |
1098 | if (ret) { | |
1099 | *objectid = 1; | |
1100 | } else { | |
1101 | btrfs_item_key_to_cpu(path->nodes[0], &found_key, | |
1102 | path->slots[0]); | |
1103 | *objectid = found_key.offset + 1; | |
1104 | } | |
1105 | ret = 0; | |
1106 | error: | |
2b82032c | 1107 | btrfs_free_path(path); |
0b86a832 CM |
1108 | return ret; |
1109 | } | |
1110 | ||
1111 | /* | |
1112 | * the device information is stored in the chunk root | |
1113 | * the btrfs_device struct should be fully filled in | |
1114 | */ | |
1115 | int btrfs_add_device(struct btrfs_trans_handle *trans, | |
1116 | struct btrfs_root *root, | |
1117 | struct btrfs_device *device) | |
1118 | { | |
1119 | int ret; | |
1120 | struct btrfs_path *path; | |
1121 | struct btrfs_dev_item *dev_item; | |
1122 | struct extent_buffer *leaf; | |
1123 | struct btrfs_key key; | |
1124 | unsigned long ptr; | |
0b86a832 CM |
1125 | |
1126 | root = root->fs_info->chunk_root; | |
1127 | ||
1128 | path = btrfs_alloc_path(); | |
1129 | if (!path) | |
1130 | return -ENOMEM; | |
1131 | ||
0b86a832 CM |
1132 | key.objectid = BTRFS_DEV_ITEMS_OBJECTID; |
1133 | key.type = BTRFS_DEV_ITEM_KEY; | |
2b82032c | 1134 | key.offset = device->devid; |
0b86a832 CM |
1135 | |
1136 | ret = btrfs_insert_empty_item(trans, root, path, &key, | |
0d81ba5d | 1137 | sizeof(*dev_item)); |
0b86a832 CM |
1138 | if (ret) |
1139 | goto out; | |
1140 | ||
1141 | leaf = path->nodes[0]; | |
1142 | dev_item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_dev_item); | |
1143 | ||
1144 | btrfs_set_device_id(leaf, dev_item, device->devid); | |
2b82032c | 1145 | btrfs_set_device_generation(leaf, dev_item, 0); |
0b86a832 CM |
1146 | btrfs_set_device_type(leaf, dev_item, device->type); |
1147 | btrfs_set_device_io_align(leaf, dev_item, device->io_align); | |
1148 | btrfs_set_device_io_width(leaf, dev_item, device->io_width); | |
1149 | btrfs_set_device_sector_size(leaf, dev_item, device->sector_size); | |
0b86a832 CM |
1150 | btrfs_set_device_total_bytes(leaf, dev_item, device->total_bytes); |
1151 | btrfs_set_device_bytes_used(leaf, dev_item, device->bytes_used); | |
e17cade2 CM |
1152 | btrfs_set_device_group(leaf, dev_item, 0); |
1153 | btrfs_set_device_seek_speed(leaf, dev_item, 0); | |
1154 | btrfs_set_device_bandwidth(leaf, dev_item, 0); | |
c3027eb5 | 1155 | btrfs_set_device_start_offset(leaf, dev_item, 0); |
0b86a832 | 1156 | |
0b86a832 | 1157 | ptr = (unsigned long)btrfs_device_uuid(dev_item); |
e17cade2 | 1158 | write_extent_buffer(leaf, device->uuid, ptr, BTRFS_UUID_SIZE); |
2b82032c YZ |
1159 | ptr = (unsigned long)btrfs_device_fsid(dev_item); |
1160 | write_extent_buffer(leaf, root->fs_info->fsid, ptr, BTRFS_UUID_SIZE); | |
0b86a832 | 1161 | btrfs_mark_buffer_dirty(leaf); |
0b86a832 | 1162 | |
2b82032c | 1163 | ret = 0; |
0b86a832 CM |
1164 | out: |
1165 | btrfs_free_path(path); | |
1166 | return ret; | |
1167 | } | |
8f18cf13 | 1168 | |
a061fc8d CM |
1169 | static int btrfs_rm_dev_item(struct btrfs_root *root, |
1170 | struct btrfs_device *device) | |
1171 | { | |
1172 | int ret; | |
1173 | struct btrfs_path *path; | |
a061fc8d | 1174 | struct btrfs_key key; |
a061fc8d CM |
1175 | struct btrfs_trans_handle *trans; |
1176 | ||
1177 | root = root->fs_info->chunk_root; | |
1178 | ||
1179 | path = btrfs_alloc_path(); | |
1180 | if (!path) | |
1181 | return -ENOMEM; | |
1182 | ||
a22285a6 | 1183 | trans = btrfs_start_transaction(root, 0); |
98d5dc13 TI |
1184 | if (IS_ERR(trans)) { |
1185 | btrfs_free_path(path); | |
1186 | return PTR_ERR(trans); | |
1187 | } | |
a061fc8d CM |
1188 | key.objectid = BTRFS_DEV_ITEMS_OBJECTID; |
1189 | key.type = BTRFS_DEV_ITEM_KEY; | |
1190 | key.offset = device->devid; | |
7d9eb12c | 1191 | lock_chunks(root); |
a061fc8d CM |
1192 | |
1193 | ret = btrfs_search_slot(trans, root, &key, path, -1, 1); | |
1194 | if (ret < 0) | |
1195 | goto out; | |
1196 | ||
1197 | if (ret > 0) { | |
1198 | ret = -ENOENT; | |
1199 | goto out; | |
1200 | } | |
1201 | ||
1202 | ret = btrfs_del_item(trans, root, path); | |
1203 | if (ret) | |
1204 | goto out; | |
a061fc8d CM |
1205 | out: |
1206 | btrfs_free_path(path); | |
7d9eb12c | 1207 | unlock_chunks(root); |
a061fc8d CM |
1208 | btrfs_commit_transaction(trans, root); |
1209 | return ret; | |
1210 | } | |
1211 | ||
1212 | int btrfs_rm_device(struct btrfs_root *root, char *device_path) | |
1213 | { | |
1214 | struct btrfs_device *device; | |
2b82032c | 1215 | struct btrfs_device *next_device; |
a061fc8d | 1216 | struct block_device *bdev; |
dfe25020 | 1217 | struct buffer_head *bh = NULL; |
a061fc8d | 1218 | struct btrfs_super_block *disk_super; |
1f78160c | 1219 | struct btrfs_fs_devices *cur_devices; |
a061fc8d CM |
1220 | u64 all_avail; |
1221 | u64 devid; | |
2b82032c YZ |
1222 | u64 num_devices; |
1223 | u8 *dev_uuid; | |
a061fc8d | 1224 | int ret = 0; |
1f78160c | 1225 | bool clear_super = false; |
a061fc8d | 1226 | |
a061fc8d | 1227 | mutex_lock(&uuid_mutex); |
7d9eb12c | 1228 | mutex_lock(&root->fs_info->volume_mutex); |
a061fc8d CM |
1229 | |
1230 | all_avail = root->fs_info->avail_data_alloc_bits | | |
1231 | root->fs_info->avail_system_alloc_bits | | |
1232 | root->fs_info->avail_metadata_alloc_bits; | |
1233 | ||
1234 | if ((all_avail & BTRFS_BLOCK_GROUP_RAID10) && | |
035fe03a | 1235 | root->fs_info->fs_devices->num_devices <= 4) { |
d397712b CM |
1236 | printk(KERN_ERR "btrfs: unable to go below four devices " |
1237 | "on raid10\n"); | |
a061fc8d CM |
1238 | ret = -EINVAL; |
1239 | goto out; | |
1240 | } | |
1241 | ||
1242 | if ((all_avail & BTRFS_BLOCK_GROUP_RAID1) && | |
035fe03a | 1243 | root->fs_info->fs_devices->num_devices <= 2) { |
d397712b CM |
1244 | printk(KERN_ERR "btrfs: unable to go below two " |
1245 | "devices on raid1\n"); | |
a061fc8d CM |
1246 | ret = -EINVAL; |
1247 | goto out; | |
1248 | } | |
1249 | ||
dfe25020 | 1250 | if (strcmp(device_path, "missing") == 0) { |
dfe25020 CM |
1251 | struct list_head *devices; |
1252 | struct btrfs_device *tmp; | |
a061fc8d | 1253 | |
dfe25020 CM |
1254 | device = NULL; |
1255 | devices = &root->fs_info->fs_devices->devices; | |
46224705 XG |
1256 | /* |
1257 | * It is safe to read the devices since the volume_mutex | |
1258 | * is held. | |
1259 | */ | |
c6e30871 | 1260 | list_for_each_entry(tmp, devices, dev_list) { |
dfe25020 CM |
1261 | if (tmp->in_fs_metadata && !tmp->bdev) { |
1262 | device = tmp; | |
1263 | break; | |
1264 | } | |
1265 | } | |
1266 | bdev = NULL; | |
1267 | bh = NULL; | |
1268 | disk_super = NULL; | |
1269 | if (!device) { | |
d397712b CM |
1270 | printk(KERN_ERR "btrfs: no missing devices found to " |
1271 | "remove\n"); | |
dfe25020 CM |
1272 | goto out; |
1273 | } | |
dfe25020 | 1274 | } else { |
d4d77629 TH |
1275 | bdev = blkdev_get_by_path(device_path, FMODE_READ | FMODE_EXCL, |
1276 | root->fs_info->bdev_holder); | |
dfe25020 CM |
1277 | if (IS_ERR(bdev)) { |
1278 | ret = PTR_ERR(bdev); | |
1279 | goto out; | |
1280 | } | |
a061fc8d | 1281 | |
2b82032c | 1282 | set_blocksize(bdev, 4096); |
a512bbf8 | 1283 | bh = btrfs_read_dev_super(bdev); |
dfe25020 | 1284 | if (!bh) { |
20b45077 | 1285 | ret = -EINVAL; |
dfe25020 CM |
1286 | goto error_close; |
1287 | } | |
1288 | disk_super = (struct btrfs_super_block *)bh->b_data; | |
a343832f | 1289 | devid = btrfs_stack_device_id(&disk_super->dev_item); |
2b82032c YZ |
1290 | dev_uuid = disk_super->dev_item.uuid; |
1291 | device = btrfs_find_device(root, devid, dev_uuid, | |
1292 | disk_super->fsid); | |
dfe25020 CM |
1293 | if (!device) { |
1294 | ret = -ENOENT; | |
1295 | goto error_brelse; | |
1296 | } | |
2b82032c | 1297 | } |
dfe25020 | 1298 | |
2b82032c | 1299 | if (device->writeable && root->fs_info->fs_devices->rw_devices == 1) { |
d397712b CM |
1300 | printk(KERN_ERR "btrfs: unable to remove the only writeable " |
1301 | "device\n"); | |
2b82032c YZ |
1302 | ret = -EINVAL; |
1303 | goto error_brelse; | |
1304 | } | |
1305 | ||
1306 | if (device->writeable) { | |
0c1daee0 | 1307 | lock_chunks(root); |
2b82032c | 1308 | list_del_init(&device->dev_alloc_list); |
0c1daee0 | 1309 | unlock_chunks(root); |
2b82032c | 1310 | root->fs_info->fs_devices->rw_devices--; |
1f78160c | 1311 | clear_super = true; |
dfe25020 | 1312 | } |
a061fc8d CM |
1313 | |
1314 | ret = btrfs_shrink_device(device, 0); | |
1315 | if (ret) | |
9b3517e9 | 1316 | goto error_undo; |
a061fc8d | 1317 | |
a061fc8d CM |
1318 | ret = btrfs_rm_dev_item(root->fs_info->chunk_root, device); |
1319 | if (ret) | |
9b3517e9 | 1320 | goto error_undo; |
a061fc8d | 1321 | |
2b82032c | 1322 | device->in_fs_metadata = 0; |
a2de733c | 1323 | btrfs_scrub_cancel_dev(root, device); |
e5e9a520 CM |
1324 | |
1325 | /* | |
1326 | * the device list mutex makes sure that we don't change | |
1327 | * the device list while someone else is writing out all | |
1328 | * the device supers. | |
1329 | */ | |
1f78160c XG |
1330 | |
1331 | cur_devices = device->fs_devices; | |
e5e9a520 | 1332 | mutex_lock(&root->fs_info->fs_devices->device_list_mutex); |
1f78160c | 1333 | list_del_rcu(&device->dev_list); |
e5e9a520 | 1334 | |
e4404d6e | 1335 | device->fs_devices->num_devices--; |
2b82032c | 1336 | |
cd02dca5 CM |
1337 | if (device->missing) |
1338 | root->fs_info->fs_devices->missing_devices--; | |
1339 | ||
2b82032c YZ |
1340 | next_device = list_entry(root->fs_info->fs_devices->devices.next, |
1341 | struct btrfs_device, dev_list); | |
1342 | if (device->bdev == root->fs_info->sb->s_bdev) | |
1343 | root->fs_info->sb->s_bdev = next_device->bdev; | |
1344 | if (device->bdev == root->fs_info->fs_devices->latest_bdev) | |
1345 | root->fs_info->fs_devices->latest_bdev = next_device->bdev; | |
1346 | ||
1f78160c | 1347 | if (device->bdev) |
e4404d6e | 1348 | device->fs_devices->open_devices--; |
1f78160c XG |
1349 | |
1350 | call_rcu(&device->rcu, free_device); | |
1351 | mutex_unlock(&root->fs_info->fs_devices->device_list_mutex); | |
e4404d6e | 1352 | |
2b82032c YZ |
1353 | num_devices = btrfs_super_num_devices(&root->fs_info->super_copy) - 1; |
1354 | btrfs_set_super_num_devices(&root->fs_info->super_copy, num_devices); | |
1355 | ||
1f78160c | 1356 | if (cur_devices->open_devices == 0) { |
e4404d6e YZ |
1357 | struct btrfs_fs_devices *fs_devices; |
1358 | fs_devices = root->fs_info->fs_devices; | |
1359 | while (fs_devices) { | |
1f78160c | 1360 | if (fs_devices->seed == cur_devices) |
e4404d6e YZ |
1361 | break; |
1362 | fs_devices = fs_devices->seed; | |
2b82032c | 1363 | } |
1f78160c XG |
1364 | fs_devices->seed = cur_devices->seed; |
1365 | cur_devices->seed = NULL; | |
0c1daee0 | 1366 | lock_chunks(root); |
1f78160c | 1367 | __btrfs_close_devices(cur_devices); |
0c1daee0 | 1368 | unlock_chunks(root); |
1f78160c | 1369 | free_fs_devices(cur_devices); |
2b82032c YZ |
1370 | } |
1371 | ||
1372 | /* | |
1373 | * at this point, the device is zero sized. We want to | |
1374 | * remove it from the devices list and zero out the old super | |
1375 | */ | |
1f78160c | 1376 | if (clear_super) { |
dfe25020 CM |
1377 | /* make sure this device isn't detected as part of |
1378 | * the FS anymore | |
1379 | */ | |
1380 | memset(&disk_super->magic, 0, sizeof(disk_super->magic)); | |
1381 | set_buffer_dirty(bh); | |
1382 | sync_dirty_buffer(bh); | |
dfe25020 | 1383 | } |
a061fc8d | 1384 | |
a061fc8d | 1385 | ret = 0; |
a061fc8d CM |
1386 | |
1387 | error_brelse: | |
1388 | brelse(bh); | |
1389 | error_close: | |
dfe25020 | 1390 | if (bdev) |
e525fd89 | 1391 | blkdev_put(bdev, FMODE_READ | FMODE_EXCL); |
a061fc8d | 1392 | out: |
7d9eb12c | 1393 | mutex_unlock(&root->fs_info->volume_mutex); |
a061fc8d | 1394 | mutex_unlock(&uuid_mutex); |
a061fc8d | 1395 | return ret; |
9b3517e9 ID |
1396 | error_undo: |
1397 | if (device->writeable) { | |
0c1daee0 | 1398 | lock_chunks(root); |
9b3517e9 ID |
1399 | list_add(&device->dev_alloc_list, |
1400 | &root->fs_info->fs_devices->alloc_list); | |
0c1daee0 | 1401 | unlock_chunks(root); |
9b3517e9 ID |
1402 | root->fs_info->fs_devices->rw_devices++; |
1403 | } | |
1404 | goto error_brelse; | |
a061fc8d CM |
1405 | } |
1406 | ||
2b82032c YZ |
1407 | /* |
1408 | * does all the dirty work required for changing file system's UUID. | |
1409 | */ | |
1410 | static int btrfs_prepare_sprout(struct btrfs_trans_handle *trans, | |
1411 | struct btrfs_root *root) | |
1412 | { | |
1413 | struct btrfs_fs_devices *fs_devices = root->fs_info->fs_devices; | |
1414 | struct btrfs_fs_devices *old_devices; | |
e4404d6e | 1415 | struct btrfs_fs_devices *seed_devices; |
2b82032c YZ |
1416 | struct btrfs_super_block *disk_super = &root->fs_info->super_copy; |
1417 | struct btrfs_device *device; | |
1418 | u64 super_flags; | |
1419 | ||
1420 | BUG_ON(!mutex_is_locked(&uuid_mutex)); | |
e4404d6e | 1421 | if (!fs_devices->seeding) |
2b82032c YZ |
1422 | return -EINVAL; |
1423 | ||
e4404d6e YZ |
1424 | seed_devices = kzalloc(sizeof(*fs_devices), GFP_NOFS); |
1425 | if (!seed_devices) | |
2b82032c YZ |
1426 | return -ENOMEM; |
1427 | ||
e4404d6e YZ |
1428 | old_devices = clone_fs_devices(fs_devices); |
1429 | if (IS_ERR(old_devices)) { | |
1430 | kfree(seed_devices); | |
1431 | return PTR_ERR(old_devices); | |
2b82032c | 1432 | } |
e4404d6e | 1433 | |
2b82032c YZ |
1434 | list_add(&old_devices->list, &fs_uuids); |
1435 | ||
e4404d6e YZ |
1436 | memcpy(seed_devices, fs_devices, sizeof(*seed_devices)); |
1437 | seed_devices->opened = 1; | |
1438 | INIT_LIST_HEAD(&seed_devices->devices); | |
1439 | INIT_LIST_HEAD(&seed_devices->alloc_list); | |
e5e9a520 | 1440 | mutex_init(&seed_devices->device_list_mutex); |
c9513edb XG |
1441 | |
1442 | mutex_lock(&root->fs_info->fs_devices->device_list_mutex); | |
1f78160c XG |
1443 | list_splice_init_rcu(&fs_devices->devices, &seed_devices->devices, |
1444 | synchronize_rcu); | |
c9513edb XG |
1445 | mutex_unlock(&root->fs_info->fs_devices->device_list_mutex); |
1446 | ||
e4404d6e YZ |
1447 | list_splice_init(&fs_devices->alloc_list, &seed_devices->alloc_list); |
1448 | list_for_each_entry(device, &seed_devices->devices, dev_list) { | |
1449 | device->fs_devices = seed_devices; | |
1450 | } | |
1451 | ||
2b82032c YZ |
1452 | fs_devices->seeding = 0; |
1453 | fs_devices->num_devices = 0; | |
1454 | fs_devices->open_devices = 0; | |
e4404d6e | 1455 | fs_devices->seed = seed_devices; |
2b82032c YZ |
1456 | |
1457 | generate_random_uuid(fs_devices->fsid); | |
1458 | memcpy(root->fs_info->fsid, fs_devices->fsid, BTRFS_FSID_SIZE); | |
1459 | memcpy(disk_super->fsid, fs_devices->fsid, BTRFS_FSID_SIZE); | |
1460 | super_flags = btrfs_super_flags(disk_super) & | |
1461 | ~BTRFS_SUPER_FLAG_SEEDING; | |
1462 | btrfs_set_super_flags(disk_super, super_flags); | |
1463 | ||
1464 | return 0; | |
1465 | } | |
1466 | ||
1467 | /* | |
1468 | * strore the expected generation for seed devices in device items. | |
1469 | */ | |
1470 | static int btrfs_finish_sprout(struct btrfs_trans_handle *trans, | |
1471 | struct btrfs_root *root) | |
1472 | { | |
1473 | struct btrfs_path *path; | |
1474 | struct extent_buffer *leaf; | |
1475 | struct btrfs_dev_item *dev_item; | |
1476 | struct btrfs_device *device; | |
1477 | struct btrfs_key key; | |
1478 | u8 fs_uuid[BTRFS_UUID_SIZE]; | |
1479 | u8 dev_uuid[BTRFS_UUID_SIZE]; | |
1480 | u64 devid; | |
1481 | int ret; | |
1482 | ||
1483 | path = btrfs_alloc_path(); | |
1484 | if (!path) | |
1485 | return -ENOMEM; | |
1486 | ||
1487 | root = root->fs_info->chunk_root; | |
1488 | key.objectid = BTRFS_DEV_ITEMS_OBJECTID; | |
1489 | key.offset = 0; | |
1490 | key.type = BTRFS_DEV_ITEM_KEY; | |
1491 | ||
1492 | while (1) { | |
1493 | ret = btrfs_search_slot(trans, root, &key, path, 0, 1); | |
1494 | if (ret < 0) | |
1495 | goto error; | |
1496 | ||
1497 | leaf = path->nodes[0]; | |
1498 | next_slot: | |
1499 | if (path->slots[0] >= btrfs_header_nritems(leaf)) { | |
1500 | ret = btrfs_next_leaf(root, path); | |
1501 | if (ret > 0) | |
1502 | break; | |
1503 | if (ret < 0) | |
1504 | goto error; | |
1505 | leaf = path->nodes[0]; | |
1506 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); | |
b3b4aa74 | 1507 | btrfs_release_path(path); |
2b82032c YZ |
1508 | continue; |
1509 | } | |
1510 | ||
1511 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); | |
1512 | if (key.objectid != BTRFS_DEV_ITEMS_OBJECTID || | |
1513 | key.type != BTRFS_DEV_ITEM_KEY) | |
1514 | break; | |
1515 | ||
1516 | dev_item = btrfs_item_ptr(leaf, path->slots[0], | |
1517 | struct btrfs_dev_item); | |
1518 | devid = btrfs_device_id(leaf, dev_item); | |
1519 | read_extent_buffer(leaf, dev_uuid, | |
1520 | (unsigned long)btrfs_device_uuid(dev_item), | |
1521 | BTRFS_UUID_SIZE); | |
1522 | read_extent_buffer(leaf, fs_uuid, | |
1523 | (unsigned long)btrfs_device_fsid(dev_item), | |
1524 | BTRFS_UUID_SIZE); | |
1525 | device = btrfs_find_device(root, devid, dev_uuid, fs_uuid); | |
1526 | BUG_ON(!device); | |
1527 | ||
1528 | if (device->fs_devices->seeding) { | |
1529 | btrfs_set_device_generation(leaf, dev_item, | |
1530 | device->generation); | |
1531 | btrfs_mark_buffer_dirty(leaf); | |
1532 | } | |
1533 | ||
1534 | path->slots[0]++; | |
1535 | goto next_slot; | |
1536 | } | |
1537 | ret = 0; | |
1538 | error: | |
1539 | btrfs_free_path(path); | |
1540 | return ret; | |
1541 | } | |
1542 | ||
788f20eb CM |
1543 | int btrfs_init_new_device(struct btrfs_root *root, char *device_path) |
1544 | { | |
1545 | struct btrfs_trans_handle *trans; | |
1546 | struct btrfs_device *device; | |
1547 | struct block_device *bdev; | |
788f20eb | 1548 | struct list_head *devices; |
2b82032c | 1549 | struct super_block *sb = root->fs_info->sb; |
788f20eb | 1550 | u64 total_bytes; |
2b82032c | 1551 | int seeding_dev = 0; |
788f20eb CM |
1552 | int ret = 0; |
1553 | ||
2b82032c YZ |
1554 | if ((sb->s_flags & MS_RDONLY) && !root->fs_info->fs_devices->seeding) |
1555 | return -EINVAL; | |
788f20eb | 1556 | |
d4d77629 TH |
1557 | bdev = blkdev_get_by_path(device_path, FMODE_EXCL, |
1558 | root->fs_info->bdev_holder); | |
7f59203a JB |
1559 | if (IS_ERR(bdev)) |
1560 | return PTR_ERR(bdev); | |
a2135011 | 1561 | |
2b82032c YZ |
1562 | if (root->fs_info->fs_devices->seeding) { |
1563 | seeding_dev = 1; | |
1564 | down_write(&sb->s_umount); | |
1565 | mutex_lock(&uuid_mutex); | |
1566 | } | |
1567 | ||
8c8bee1d | 1568 | filemap_write_and_wait(bdev->bd_inode->i_mapping); |
7d9eb12c | 1569 | mutex_lock(&root->fs_info->volume_mutex); |
a2135011 | 1570 | |
788f20eb | 1571 | devices = &root->fs_info->fs_devices->devices; |
e5e9a520 CM |
1572 | /* |
1573 | * we have the volume lock, so we don't need the extra | |
1574 | * device list mutex while reading the list here. | |
1575 | */ | |
c6e30871 | 1576 | list_for_each_entry(device, devices, dev_list) { |
788f20eb CM |
1577 | if (device->bdev == bdev) { |
1578 | ret = -EEXIST; | |
2b82032c | 1579 | goto error; |
788f20eb CM |
1580 | } |
1581 | } | |
1582 | ||
1583 | device = kzalloc(sizeof(*device), GFP_NOFS); | |
1584 | if (!device) { | |
1585 | /* we can safely leave the fs_devices entry around */ | |
1586 | ret = -ENOMEM; | |
2b82032c | 1587 | goto error; |
788f20eb CM |
1588 | } |
1589 | ||
788f20eb CM |
1590 | device->name = kstrdup(device_path, GFP_NOFS); |
1591 | if (!device->name) { | |
1592 | kfree(device); | |
2b82032c YZ |
1593 | ret = -ENOMEM; |
1594 | goto error; | |
788f20eb | 1595 | } |
2b82032c YZ |
1596 | |
1597 | ret = find_next_devid(root, &device->devid); | |
1598 | if (ret) { | |
67100f25 | 1599 | kfree(device->name); |
2b82032c YZ |
1600 | kfree(device); |
1601 | goto error; | |
1602 | } | |
1603 | ||
a22285a6 | 1604 | trans = btrfs_start_transaction(root, 0); |
98d5dc13 | 1605 | if (IS_ERR(trans)) { |
67100f25 | 1606 | kfree(device->name); |
98d5dc13 TI |
1607 | kfree(device); |
1608 | ret = PTR_ERR(trans); | |
1609 | goto error; | |
1610 | } | |
1611 | ||
2b82032c YZ |
1612 | lock_chunks(root); |
1613 | ||
2b82032c YZ |
1614 | device->writeable = 1; |
1615 | device->work.func = pending_bios_fn; | |
1616 | generate_random_uuid(device->uuid); | |
1617 | spin_lock_init(&device->io_lock); | |
1618 | device->generation = trans->transid; | |
788f20eb CM |
1619 | device->io_width = root->sectorsize; |
1620 | device->io_align = root->sectorsize; | |
1621 | device->sector_size = root->sectorsize; | |
1622 | device->total_bytes = i_size_read(bdev->bd_inode); | |
2cc3c559 | 1623 | device->disk_total_bytes = device->total_bytes; |
788f20eb CM |
1624 | device->dev_root = root->fs_info->dev_root; |
1625 | device->bdev = bdev; | |
dfe25020 | 1626 | device->in_fs_metadata = 1; |
fb01aa85 | 1627 | device->mode = FMODE_EXCL; |
2b82032c | 1628 | set_blocksize(device->bdev, 4096); |
788f20eb | 1629 | |
2b82032c YZ |
1630 | if (seeding_dev) { |
1631 | sb->s_flags &= ~MS_RDONLY; | |
1632 | ret = btrfs_prepare_sprout(trans, root); | |
1633 | BUG_ON(ret); | |
1634 | } | |
788f20eb | 1635 | |
2b82032c | 1636 | device->fs_devices = root->fs_info->fs_devices; |
e5e9a520 CM |
1637 | |
1638 | /* | |
1639 | * we don't want write_supers to jump in here with our device | |
1640 | * half setup | |
1641 | */ | |
1642 | mutex_lock(&root->fs_info->fs_devices->device_list_mutex); | |
1f78160c | 1643 | list_add_rcu(&device->dev_list, &root->fs_info->fs_devices->devices); |
2b82032c YZ |
1644 | list_add(&device->dev_alloc_list, |
1645 | &root->fs_info->fs_devices->alloc_list); | |
1646 | root->fs_info->fs_devices->num_devices++; | |
1647 | root->fs_info->fs_devices->open_devices++; | |
1648 | root->fs_info->fs_devices->rw_devices++; | |
1649 | root->fs_info->fs_devices->total_rw_bytes += device->total_bytes; | |
325cd4ba | 1650 | |
c289811c CM |
1651 | if (!blk_queue_nonrot(bdev_get_queue(bdev))) |
1652 | root->fs_info->fs_devices->rotating = 1; | |
1653 | ||
788f20eb CM |
1654 | total_bytes = btrfs_super_total_bytes(&root->fs_info->super_copy); |
1655 | btrfs_set_super_total_bytes(&root->fs_info->super_copy, | |
1656 | total_bytes + device->total_bytes); | |
1657 | ||
1658 | total_bytes = btrfs_super_num_devices(&root->fs_info->super_copy); | |
1659 | btrfs_set_super_num_devices(&root->fs_info->super_copy, | |
1660 | total_bytes + 1); | |
e5e9a520 | 1661 | mutex_unlock(&root->fs_info->fs_devices->device_list_mutex); |
788f20eb | 1662 | |
2b82032c YZ |
1663 | if (seeding_dev) { |
1664 | ret = init_first_rw_device(trans, root, device); | |
1665 | BUG_ON(ret); | |
1666 | ret = btrfs_finish_sprout(trans, root); | |
1667 | BUG_ON(ret); | |
1668 | } else { | |
1669 | ret = btrfs_add_device(trans, root, device); | |
1670 | } | |
1671 | ||
913d952e CM |
1672 | /* |
1673 | * we've got more storage, clear any full flags on the space | |
1674 | * infos | |
1675 | */ | |
1676 | btrfs_clear_space_info_full(root->fs_info); | |
1677 | ||
7d9eb12c | 1678 | unlock_chunks(root); |
2b82032c | 1679 | btrfs_commit_transaction(trans, root); |
a2135011 | 1680 | |
2b82032c YZ |
1681 | if (seeding_dev) { |
1682 | mutex_unlock(&uuid_mutex); | |
1683 | up_write(&sb->s_umount); | |
788f20eb | 1684 | |
2b82032c YZ |
1685 | ret = btrfs_relocate_sys_chunks(root); |
1686 | BUG_ON(ret); | |
1687 | } | |
1688 | out: | |
1689 | mutex_unlock(&root->fs_info->volume_mutex); | |
1690 | return ret; | |
1691 | error: | |
e525fd89 | 1692 | blkdev_put(bdev, FMODE_EXCL); |
2b82032c YZ |
1693 | if (seeding_dev) { |
1694 | mutex_unlock(&uuid_mutex); | |
1695 | up_write(&sb->s_umount); | |
1696 | } | |
788f20eb CM |
1697 | goto out; |
1698 | } | |
1699 | ||
d397712b CM |
1700 | static noinline int btrfs_update_device(struct btrfs_trans_handle *trans, |
1701 | struct btrfs_device *device) | |
0b86a832 CM |
1702 | { |
1703 | int ret; | |
1704 | struct btrfs_path *path; | |
1705 | struct btrfs_root *root; | |
1706 | struct btrfs_dev_item *dev_item; | |
1707 | struct extent_buffer *leaf; | |
1708 | struct btrfs_key key; | |
1709 | ||
1710 | root = device->dev_root->fs_info->chunk_root; | |
1711 | ||
1712 | path = btrfs_alloc_path(); | |
1713 | if (!path) | |
1714 | return -ENOMEM; | |
1715 | ||
1716 | key.objectid = BTRFS_DEV_ITEMS_OBJECTID; | |
1717 | key.type = BTRFS_DEV_ITEM_KEY; | |
1718 | key.offset = device->devid; | |
1719 | ||
1720 | ret = btrfs_search_slot(trans, root, &key, path, 0, 1); | |
1721 | if (ret < 0) | |
1722 | goto out; | |
1723 | ||
1724 | if (ret > 0) { | |
1725 | ret = -ENOENT; | |
1726 | goto out; | |
1727 | } | |
1728 | ||
1729 | leaf = path->nodes[0]; | |
1730 | dev_item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_dev_item); | |
1731 | ||
1732 | btrfs_set_device_id(leaf, dev_item, device->devid); | |
1733 | btrfs_set_device_type(leaf, dev_item, device->type); | |
1734 | btrfs_set_device_io_align(leaf, dev_item, device->io_align); | |
1735 | btrfs_set_device_io_width(leaf, dev_item, device->io_width); | |
1736 | btrfs_set_device_sector_size(leaf, dev_item, device->sector_size); | |
d6397bae | 1737 | btrfs_set_device_total_bytes(leaf, dev_item, device->disk_total_bytes); |
0b86a832 CM |
1738 | btrfs_set_device_bytes_used(leaf, dev_item, device->bytes_used); |
1739 | btrfs_mark_buffer_dirty(leaf); | |
1740 | ||
1741 | out: | |
1742 | btrfs_free_path(path); | |
1743 | return ret; | |
1744 | } | |
1745 | ||
7d9eb12c | 1746 | static int __btrfs_grow_device(struct btrfs_trans_handle *trans, |
8f18cf13 CM |
1747 | struct btrfs_device *device, u64 new_size) |
1748 | { | |
1749 | struct btrfs_super_block *super_copy = | |
1750 | &device->dev_root->fs_info->super_copy; | |
1751 | u64 old_total = btrfs_super_total_bytes(super_copy); | |
1752 | u64 diff = new_size - device->total_bytes; | |
1753 | ||
2b82032c YZ |
1754 | if (!device->writeable) |
1755 | return -EACCES; | |
1756 | if (new_size <= device->total_bytes) | |
1757 | return -EINVAL; | |
1758 | ||
8f18cf13 | 1759 | btrfs_set_super_total_bytes(super_copy, old_total + diff); |
2b82032c YZ |
1760 | device->fs_devices->total_rw_bytes += diff; |
1761 | ||
1762 | device->total_bytes = new_size; | |
9779b72f | 1763 | device->disk_total_bytes = new_size; |
4184ea7f CM |
1764 | btrfs_clear_space_info_full(device->dev_root->fs_info); |
1765 | ||
8f18cf13 CM |
1766 | return btrfs_update_device(trans, device); |
1767 | } | |
1768 | ||
7d9eb12c CM |
1769 | int btrfs_grow_device(struct btrfs_trans_handle *trans, |
1770 | struct btrfs_device *device, u64 new_size) | |
1771 | { | |
1772 | int ret; | |
1773 | lock_chunks(device->dev_root); | |
1774 | ret = __btrfs_grow_device(trans, device, new_size); | |
1775 | unlock_chunks(device->dev_root); | |
1776 | return ret; | |
1777 | } | |
1778 | ||
8f18cf13 CM |
1779 | static int btrfs_free_chunk(struct btrfs_trans_handle *trans, |
1780 | struct btrfs_root *root, | |
1781 | u64 chunk_tree, u64 chunk_objectid, | |
1782 | u64 chunk_offset) | |
1783 | { | |
1784 | int ret; | |
1785 | struct btrfs_path *path; | |
1786 | struct btrfs_key key; | |
1787 | ||
1788 | root = root->fs_info->chunk_root; | |
1789 | path = btrfs_alloc_path(); | |
1790 | if (!path) | |
1791 | return -ENOMEM; | |
1792 | ||
1793 | key.objectid = chunk_objectid; | |
1794 | key.offset = chunk_offset; | |
1795 | key.type = BTRFS_CHUNK_ITEM_KEY; | |
1796 | ||
1797 | ret = btrfs_search_slot(trans, root, &key, path, -1, 1); | |
1798 | BUG_ON(ret); | |
1799 | ||
1800 | ret = btrfs_del_item(trans, root, path); | |
8f18cf13 CM |
1801 | |
1802 | btrfs_free_path(path); | |
65a246c5 | 1803 | return ret; |
8f18cf13 CM |
1804 | } |
1805 | ||
b2950863 | 1806 | static int btrfs_del_sys_chunk(struct btrfs_root *root, u64 chunk_objectid, u64 |
8f18cf13 CM |
1807 | chunk_offset) |
1808 | { | |
1809 | struct btrfs_super_block *super_copy = &root->fs_info->super_copy; | |
1810 | struct btrfs_disk_key *disk_key; | |
1811 | struct btrfs_chunk *chunk; | |
1812 | u8 *ptr; | |
1813 | int ret = 0; | |
1814 | u32 num_stripes; | |
1815 | u32 array_size; | |
1816 | u32 len = 0; | |
1817 | u32 cur; | |
1818 | struct btrfs_key key; | |
1819 | ||
1820 | array_size = btrfs_super_sys_array_size(super_copy); | |
1821 | ||
1822 | ptr = super_copy->sys_chunk_array; | |
1823 | cur = 0; | |
1824 | ||
1825 | while (cur < array_size) { | |
1826 | disk_key = (struct btrfs_disk_key *)ptr; | |
1827 | btrfs_disk_key_to_cpu(&key, disk_key); | |
1828 | ||
1829 | len = sizeof(*disk_key); | |
1830 | ||
1831 | if (key.type == BTRFS_CHUNK_ITEM_KEY) { | |
1832 | chunk = (struct btrfs_chunk *)(ptr + len); | |
1833 | num_stripes = btrfs_stack_chunk_num_stripes(chunk); | |
1834 | len += btrfs_chunk_item_size(num_stripes); | |
1835 | } else { | |
1836 | ret = -EIO; | |
1837 | break; | |
1838 | } | |
1839 | if (key.objectid == chunk_objectid && | |
1840 | key.offset == chunk_offset) { | |
1841 | memmove(ptr, ptr + len, array_size - (cur + len)); | |
1842 | array_size -= len; | |
1843 | btrfs_set_super_sys_array_size(super_copy, array_size); | |
1844 | } else { | |
1845 | ptr += len; | |
1846 | cur += len; | |
1847 | } | |
1848 | } | |
1849 | return ret; | |
1850 | } | |
1851 | ||
b2950863 | 1852 | static int btrfs_relocate_chunk(struct btrfs_root *root, |
8f18cf13 CM |
1853 | u64 chunk_tree, u64 chunk_objectid, |
1854 | u64 chunk_offset) | |
1855 | { | |
1856 | struct extent_map_tree *em_tree; | |
1857 | struct btrfs_root *extent_root; | |
1858 | struct btrfs_trans_handle *trans; | |
1859 | struct extent_map *em; | |
1860 | struct map_lookup *map; | |
1861 | int ret; | |
1862 | int i; | |
1863 | ||
1864 | root = root->fs_info->chunk_root; | |
1865 | extent_root = root->fs_info->extent_root; | |
1866 | em_tree = &root->fs_info->mapping_tree.map_tree; | |
1867 | ||
ba1bf481 JB |
1868 | ret = btrfs_can_relocate(extent_root, chunk_offset); |
1869 | if (ret) | |
1870 | return -ENOSPC; | |
1871 | ||
8f18cf13 | 1872 | /* step one, relocate all the extents inside this chunk */ |
1a40e23b | 1873 | ret = btrfs_relocate_block_group(extent_root, chunk_offset); |
a22285a6 YZ |
1874 | if (ret) |
1875 | return ret; | |
8f18cf13 | 1876 | |
a22285a6 | 1877 | trans = btrfs_start_transaction(root, 0); |
98d5dc13 | 1878 | BUG_ON(IS_ERR(trans)); |
8f18cf13 | 1879 | |
7d9eb12c CM |
1880 | lock_chunks(root); |
1881 | ||
8f18cf13 CM |
1882 | /* |
1883 | * step two, delete the device extents and the | |
1884 | * chunk tree entries | |
1885 | */ | |
890871be | 1886 | read_lock(&em_tree->lock); |
8f18cf13 | 1887 | em = lookup_extent_mapping(em_tree, chunk_offset, 1); |
890871be | 1888 | read_unlock(&em_tree->lock); |
8f18cf13 | 1889 | |
a061fc8d CM |
1890 | BUG_ON(em->start > chunk_offset || |
1891 | em->start + em->len < chunk_offset); | |
8f18cf13 CM |
1892 | map = (struct map_lookup *)em->bdev; |
1893 | ||
1894 | for (i = 0; i < map->num_stripes; i++) { | |
1895 | ret = btrfs_free_dev_extent(trans, map->stripes[i].dev, | |
1896 | map->stripes[i].physical); | |
1897 | BUG_ON(ret); | |
a061fc8d | 1898 | |
dfe25020 CM |
1899 | if (map->stripes[i].dev) { |
1900 | ret = btrfs_update_device(trans, map->stripes[i].dev); | |
1901 | BUG_ON(ret); | |
1902 | } | |
8f18cf13 CM |
1903 | } |
1904 | ret = btrfs_free_chunk(trans, root, chunk_tree, chunk_objectid, | |
1905 | chunk_offset); | |
1906 | ||
1907 | BUG_ON(ret); | |
1908 | ||
1abe9b8a | 1909 | trace_btrfs_chunk_free(root, map, chunk_offset, em->len); |
1910 | ||
8f18cf13 CM |
1911 | if (map->type & BTRFS_BLOCK_GROUP_SYSTEM) { |
1912 | ret = btrfs_del_sys_chunk(root, chunk_objectid, chunk_offset); | |
1913 | BUG_ON(ret); | |
8f18cf13 CM |
1914 | } |
1915 | ||
2b82032c YZ |
1916 | ret = btrfs_remove_block_group(trans, extent_root, chunk_offset); |
1917 | BUG_ON(ret); | |
1918 | ||
890871be | 1919 | write_lock(&em_tree->lock); |
2b82032c | 1920 | remove_extent_mapping(em_tree, em); |
890871be | 1921 | write_unlock(&em_tree->lock); |
2b82032c YZ |
1922 | |
1923 | kfree(map); | |
1924 | em->bdev = NULL; | |
1925 | ||
1926 | /* once for the tree */ | |
1927 | free_extent_map(em); | |
1928 | /* once for us */ | |
1929 | free_extent_map(em); | |
1930 | ||
1931 | unlock_chunks(root); | |
1932 | btrfs_end_transaction(trans, root); | |
1933 | return 0; | |
1934 | } | |
1935 | ||
1936 | static int btrfs_relocate_sys_chunks(struct btrfs_root *root) | |
1937 | { | |
1938 | struct btrfs_root *chunk_root = root->fs_info->chunk_root; | |
1939 | struct btrfs_path *path; | |
1940 | struct extent_buffer *leaf; | |
1941 | struct btrfs_chunk *chunk; | |
1942 | struct btrfs_key key; | |
1943 | struct btrfs_key found_key; | |
1944 | u64 chunk_tree = chunk_root->root_key.objectid; | |
1945 | u64 chunk_type; | |
ba1bf481 JB |
1946 | bool retried = false; |
1947 | int failed = 0; | |
2b82032c YZ |
1948 | int ret; |
1949 | ||
1950 | path = btrfs_alloc_path(); | |
1951 | if (!path) | |
1952 | return -ENOMEM; | |
1953 | ||
ba1bf481 | 1954 | again: |
2b82032c YZ |
1955 | key.objectid = BTRFS_FIRST_CHUNK_TREE_OBJECTID; |
1956 | key.offset = (u64)-1; | |
1957 | key.type = BTRFS_CHUNK_ITEM_KEY; | |
1958 | ||
1959 | while (1) { | |
1960 | ret = btrfs_search_slot(NULL, chunk_root, &key, path, 0, 0); | |
1961 | if (ret < 0) | |
1962 | goto error; | |
1963 | BUG_ON(ret == 0); | |
1964 | ||
1965 | ret = btrfs_previous_item(chunk_root, path, key.objectid, | |
1966 | key.type); | |
1967 | if (ret < 0) | |
1968 | goto error; | |
1969 | if (ret > 0) | |
1970 | break; | |
1a40e23b | 1971 | |
2b82032c YZ |
1972 | leaf = path->nodes[0]; |
1973 | btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); | |
1a40e23b | 1974 | |
2b82032c YZ |
1975 | chunk = btrfs_item_ptr(leaf, path->slots[0], |
1976 | struct btrfs_chunk); | |
1977 | chunk_type = btrfs_chunk_type(leaf, chunk); | |
b3b4aa74 | 1978 | btrfs_release_path(path); |
8f18cf13 | 1979 | |
2b82032c YZ |
1980 | if (chunk_type & BTRFS_BLOCK_GROUP_SYSTEM) { |
1981 | ret = btrfs_relocate_chunk(chunk_root, chunk_tree, | |
1982 | found_key.objectid, | |
1983 | found_key.offset); | |
ba1bf481 JB |
1984 | if (ret == -ENOSPC) |
1985 | failed++; | |
1986 | else if (ret) | |
1987 | BUG(); | |
2b82032c | 1988 | } |
8f18cf13 | 1989 | |
2b82032c YZ |
1990 | if (found_key.offset == 0) |
1991 | break; | |
1992 | key.offset = found_key.offset - 1; | |
1993 | } | |
1994 | ret = 0; | |
ba1bf481 JB |
1995 | if (failed && !retried) { |
1996 | failed = 0; | |
1997 | retried = true; | |
1998 | goto again; | |
1999 | } else if (failed && retried) { | |
2000 | WARN_ON(1); | |
2001 | ret = -ENOSPC; | |
2002 | } | |
2b82032c YZ |
2003 | error: |
2004 | btrfs_free_path(path); | |
2005 | return ret; | |
8f18cf13 CM |
2006 | } |
2007 | ||
ec44a35c CM |
2008 | static u64 div_factor(u64 num, int factor) |
2009 | { | |
2010 | if (factor == 10) | |
2011 | return num; | |
2012 | num *= factor; | |
2013 | do_div(num, 10); | |
2014 | return num; | |
2015 | } | |
2016 | ||
ec44a35c CM |
2017 | int btrfs_balance(struct btrfs_root *dev_root) |
2018 | { | |
2019 | int ret; | |
ec44a35c CM |
2020 | struct list_head *devices = &dev_root->fs_info->fs_devices->devices; |
2021 | struct btrfs_device *device; | |
2022 | u64 old_size; | |
2023 | u64 size_to_free; | |
2024 | struct btrfs_path *path; | |
2025 | struct btrfs_key key; | |
ec44a35c CM |
2026 | struct btrfs_root *chunk_root = dev_root->fs_info->chunk_root; |
2027 | struct btrfs_trans_handle *trans; | |
2028 | struct btrfs_key found_key; | |
2029 | ||
2b82032c YZ |
2030 | if (dev_root->fs_info->sb->s_flags & MS_RDONLY) |
2031 | return -EROFS; | |
ec44a35c | 2032 | |
6f88a440 BH |
2033 | if (!capable(CAP_SYS_ADMIN)) |
2034 | return -EPERM; | |
2035 | ||
7d9eb12c | 2036 | mutex_lock(&dev_root->fs_info->volume_mutex); |
ec44a35c CM |
2037 | dev_root = dev_root->fs_info->dev_root; |
2038 | ||
ec44a35c | 2039 | /* step one make some room on all the devices */ |
c6e30871 | 2040 | list_for_each_entry(device, devices, dev_list) { |
ec44a35c CM |
2041 | old_size = device->total_bytes; |
2042 | size_to_free = div_factor(old_size, 1); | |
2043 | size_to_free = min(size_to_free, (u64)1 * 1024 * 1024); | |
2b82032c YZ |
2044 | if (!device->writeable || |
2045 | device->total_bytes - device->bytes_used > size_to_free) | |
ec44a35c CM |
2046 | continue; |
2047 | ||
2048 | ret = btrfs_shrink_device(device, old_size - size_to_free); | |
ba1bf481 JB |
2049 | if (ret == -ENOSPC) |
2050 | break; | |
ec44a35c CM |
2051 | BUG_ON(ret); |
2052 | ||
a22285a6 | 2053 | trans = btrfs_start_transaction(dev_root, 0); |
98d5dc13 | 2054 | BUG_ON(IS_ERR(trans)); |
ec44a35c CM |
2055 | |
2056 | ret = btrfs_grow_device(trans, device, old_size); | |
2057 | BUG_ON(ret); | |
2058 | ||
2059 | btrfs_end_transaction(trans, dev_root); | |
2060 | } | |
2061 | ||
2062 | /* step two, relocate all the chunks */ | |
2063 | path = btrfs_alloc_path(); | |
17e9f796 MF |
2064 | if (!path) { |
2065 | ret = -ENOMEM; | |
2066 | goto error; | |
2067 | } | |
ec44a35c CM |
2068 | key.objectid = BTRFS_FIRST_CHUNK_TREE_OBJECTID; |
2069 | key.offset = (u64)-1; | |
2070 | key.type = BTRFS_CHUNK_ITEM_KEY; | |
2071 | ||
d397712b | 2072 | while (1) { |
ec44a35c CM |
2073 | ret = btrfs_search_slot(NULL, chunk_root, &key, path, 0, 0); |
2074 | if (ret < 0) | |
2075 | goto error; | |
2076 | ||
2077 | /* | |
2078 | * this shouldn't happen, it means the last relocate | |
2079 | * failed | |
2080 | */ | |
2081 | if (ret == 0) | |
2082 | break; | |
2083 | ||
2084 | ret = btrfs_previous_item(chunk_root, path, 0, | |
2085 | BTRFS_CHUNK_ITEM_KEY); | |
7d9eb12c | 2086 | if (ret) |
ec44a35c | 2087 | break; |
7d9eb12c | 2088 | |
ec44a35c CM |
2089 | btrfs_item_key_to_cpu(path->nodes[0], &found_key, |
2090 | path->slots[0]); | |
2091 | if (found_key.objectid != key.objectid) | |
2092 | break; | |
7d9eb12c | 2093 | |
ec44a35c | 2094 | /* chunk zero is special */ |
ba1bf481 | 2095 | if (found_key.offset == 0) |
ec44a35c CM |
2096 | break; |
2097 | ||
b3b4aa74 | 2098 | btrfs_release_path(path); |
ec44a35c CM |
2099 | ret = btrfs_relocate_chunk(chunk_root, |
2100 | chunk_root->root_key.objectid, | |
2101 | found_key.objectid, | |
2102 | found_key.offset); | |
508794eb JB |
2103 | if (ret && ret != -ENOSPC) |
2104 | goto error; | |
ba1bf481 | 2105 | key.offset = found_key.offset - 1; |
ec44a35c CM |
2106 | } |
2107 | ret = 0; | |
2108 | error: | |
2109 | btrfs_free_path(path); | |
7d9eb12c | 2110 | mutex_unlock(&dev_root->fs_info->volume_mutex); |
ec44a35c CM |
2111 | return ret; |
2112 | } | |
2113 | ||
8f18cf13 CM |
2114 | /* |
2115 | * shrinking a device means finding all of the device extents past | |
2116 | * the new size, and then following the back refs to the chunks. | |
2117 | * The chunk relocation code actually frees the device extent | |
2118 | */ | |
2119 | int btrfs_shrink_device(struct btrfs_device *device, u64 new_size) | |
2120 | { | |
2121 | struct btrfs_trans_handle *trans; | |
2122 | struct btrfs_root *root = device->dev_root; | |
2123 | struct btrfs_dev_extent *dev_extent = NULL; | |
2124 | struct btrfs_path *path; | |
2125 | u64 length; | |
2126 | u64 chunk_tree; | |
2127 | u64 chunk_objectid; | |
2128 | u64 chunk_offset; | |
2129 | int ret; | |
2130 | int slot; | |
ba1bf481 JB |
2131 | int failed = 0; |
2132 | bool retried = false; | |
8f18cf13 CM |
2133 | struct extent_buffer *l; |
2134 | struct btrfs_key key; | |
2135 | struct btrfs_super_block *super_copy = &root->fs_info->super_copy; | |
2136 | u64 old_total = btrfs_super_total_bytes(super_copy); | |
ba1bf481 | 2137 | u64 old_size = device->total_bytes; |
8f18cf13 CM |
2138 | u64 diff = device->total_bytes - new_size; |
2139 | ||
2b82032c YZ |
2140 | if (new_size >= device->total_bytes) |
2141 | return -EINVAL; | |
8f18cf13 CM |
2142 | |
2143 | path = btrfs_alloc_path(); | |
2144 | if (!path) | |
2145 | return -ENOMEM; | |
2146 | ||
8f18cf13 CM |
2147 | path->reada = 2; |
2148 | ||
7d9eb12c CM |
2149 | lock_chunks(root); |
2150 | ||
8f18cf13 | 2151 | device->total_bytes = new_size; |
2b82032c YZ |
2152 | if (device->writeable) |
2153 | device->fs_devices->total_rw_bytes -= diff; | |
7d9eb12c | 2154 | unlock_chunks(root); |
8f18cf13 | 2155 | |
ba1bf481 | 2156 | again: |
8f18cf13 CM |
2157 | key.objectid = device->devid; |
2158 | key.offset = (u64)-1; | |
2159 | key.type = BTRFS_DEV_EXTENT_KEY; | |
2160 | ||
2161 | while (1) { | |
2162 | ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); | |
2163 | if (ret < 0) | |
2164 | goto done; | |
2165 | ||
2166 | ret = btrfs_previous_item(root, path, 0, key.type); | |
2167 | if (ret < 0) | |
2168 | goto done; | |
2169 | if (ret) { | |
2170 | ret = 0; | |
b3b4aa74 | 2171 | btrfs_release_path(path); |
bf1fb512 | 2172 | break; |
8f18cf13 CM |
2173 | } |
2174 | ||
2175 | l = path->nodes[0]; | |
2176 | slot = path->slots[0]; | |
2177 | btrfs_item_key_to_cpu(l, &key, path->slots[0]); | |
2178 | ||
ba1bf481 | 2179 | if (key.objectid != device->devid) { |
b3b4aa74 | 2180 | btrfs_release_path(path); |
bf1fb512 | 2181 | break; |
ba1bf481 | 2182 | } |
8f18cf13 CM |
2183 | |
2184 | dev_extent = btrfs_item_ptr(l, slot, struct btrfs_dev_extent); | |
2185 | length = btrfs_dev_extent_length(l, dev_extent); | |
2186 | ||
ba1bf481 | 2187 | if (key.offset + length <= new_size) { |
b3b4aa74 | 2188 | btrfs_release_path(path); |
d6397bae | 2189 | break; |
ba1bf481 | 2190 | } |
8f18cf13 CM |
2191 | |
2192 | chunk_tree = btrfs_dev_extent_chunk_tree(l, dev_extent); | |
2193 | chunk_objectid = btrfs_dev_extent_chunk_objectid(l, dev_extent); | |
2194 | chunk_offset = btrfs_dev_extent_chunk_offset(l, dev_extent); | |
b3b4aa74 | 2195 | btrfs_release_path(path); |
8f18cf13 CM |
2196 | |
2197 | ret = btrfs_relocate_chunk(root, chunk_tree, chunk_objectid, | |
2198 | chunk_offset); | |
ba1bf481 | 2199 | if (ret && ret != -ENOSPC) |
8f18cf13 | 2200 | goto done; |
ba1bf481 JB |
2201 | if (ret == -ENOSPC) |
2202 | failed++; | |
2203 | key.offset -= 1; | |
2204 | } | |
2205 | ||
2206 | if (failed && !retried) { | |
2207 | failed = 0; | |
2208 | retried = true; | |
2209 | goto again; | |
2210 | } else if (failed && retried) { | |
2211 | ret = -ENOSPC; | |
2212 | lock_chunks(root); | |
2213 | ||
2214 | device->total_bytes = old_size; | |
2215 | if (device->writeable) | |
2216 | device->fs_devices->total_rw_bytes += diff; | |
2217 | unlock_chunks(root); | |
2218 | goto done; | |
8f18cf13 CM |
2219 | } |
2220 | ||
d6397bae | 2221 | /* Shrinking succeeded, else we would be at "done". */ |
a22285a6 | 2222 | trans = btrfs_start_transaction(root, 0); |
98d5dc13 TI |
2223 | if (IS_ERR(trans)) { |
2224 | ret = PTR_ERR(trans); | |
2225 | goto done; | |
2226 | } | |
2227 | ||
d6397bae CB |
2228 | lock_chunks(root); |
2229 | ||
2230 | device->disk_total_bytes = new_size; | |
2231 | /* Now btrfs_update_device() will change the on-disk size. */ | |
2232 | ret = btrfs_update_device(trans, device); | |
2233 | if (ret) { | |
2234 | unlock_chunks(root); | |
2235 | btrfs_end_transaction(trans, root); | |
2236 | goto done; | |
2237 | } | |
2238 | WARN_ON(diff > old_total); | |
2239 | btrfs_set_super_total_bytes(super_copy, old_total - diff); | |
2240 | unlock_chunks(root); | |
2241 | btrfs_end_transaction(trans, root); | |
8f18cf13 CM |
2242 | done: |
2243 | btrfs_free_path(path); | |
2244 | return ret; | |
2245 | } | |
2246 | ||
b2950863 | 2247 | static int btrfs_add_system_chunk(struct btrfs_trans_handle *trans, |
0b86a832 CM |
2248 | struct btrfs_root *root, |
2249 | struct btrfs_key *key, | |
2250 | struct btrfs_chunk *chunk, int item_size) | |
2251 | { | |
2252 | struct btrfs_super_block *super_copy = &root->fs_info->super_copy; | |
2253 | struct btrfs_disk_key disk_key; | |
2254 | u32 array_size; | |
2255 | u8 *ptr; | |
2256 | ||
2257 | array_size = btrfs_super_sys_array_size(super_copy); | |
2258 | if (array_size + item_size > BTRFS_SYSTEM_CHUNK_ARRAY_SIZE) | |
2259 | return -EFBIG; | |
2260 | ||
2261 | ptr = super_copy->sys_chunk_array + array_size; | |
2262 | btrfs_cpu_key_to_disk(&disk_key, key); | |
2263 | memcpy(ptr, &disk_key, sizeof(disk_key)); | |
2264 | ptr += sizeof(disk_key); | |
2265 | memcpy(ptr, chunk, item_size); | |
2266 | item_size += sizeof(disk_key); | |
2267 | btrfs_set_super_sys_array_size(super_copy, array_size + item_size); | |
2268 | return 0; | |
2269 | } | |
2270 | ||
73c5de00 AJ |
2271 | /* |
2272 | * sort the devices in descending order by max_avail, total_avail | |
2273 | */ | |
2274 | static int btrfs_cmp_device_info(const void *a, const void *b) | |
9b3f68b9 | 2275 | { |
73c5de00 AJ |
2276 | const struct btrfs_device_info *di_a = a; |
2277 | const struct btrfs_device_info *di_b = b; | |
9b3f68b9 | 2278 | |
73c5de00 | 2279 | if (di_a->max_avail > di_b->max_avail) |
b2117a39 | 2280 | return -1; |
73c5de00 | 2281 | if (di_a->max_avail < di_b->max_avail) |
b2117a39 | 2282 | return 1; |
73c5de00 AJ |
2283 | if (di_a->total_avail > di_b->total_avail) |
2284 | return -1; | |
2285 | if (di_a->total_avail < di_b->total_avail) | |
2286 | return 1; | |
2287 | return 0; | |
b2117a39 | 2288 | } |
0b86a832 | 2289 | |
73c5de00 AJ |
2290 | static int __btrfs_alloc_chunk(struct btrfs_trans_handle *trans, |
2291 | struct btrfs_root *extent_root, | |
2292 | struct map_lookup **map_ret, | |
2293 | u64 *num_bytes_out, u64 *stripe_size_out, | |
2294 | u64 start, u64 type) | |
b2117a39 | 2295 | { |
73c5de00 AJ |
2296 | struct btrfs_fs_info *info = extent_root->fs_info; |
2297 | struct btrfs_fs_devices *fs_devices = info->fs_devices; | |
2298 | struct list_head *cur; | |
2299 | struct map_lookup *map = NULL; | |
2300 | struct extent_map_tree *em_tree; | |
2301 | struct extent_map *em; | |
2302 | struct btrfs_device_info *devices_info = NULL; | |
2303 | u64 total_avail; | |
2304 | int num_stripes; /* total number of stripes to allocate */ | |
2305 | int sub_stripes; /* sub_stripes info for map */ | |
2306 | int dev_stripes; /* stripes per dev */ | |
2307 | int devs_max; /* max devs to use */ | |
2308 | int devs_min; /* min devs needed */ | |
2309 | int devs_increment; /* ndevs has to be a multiple of this */ | |
2310 | int ncopies; /* how many copies to data has */ | |
2311 | int ret; | |
2312 | u64 max_stripe_size; | |
2313 | u64 max_chunk_size; | |
2314 | u64 stripe_size; | |
2315 | u64 num_bytes; | |
2316 | int ndevs; | |
2317 | int i; | |
2318 | int j; | |
593060d7 | 2319 | |
73c5de00 AJ |
2320 | if ((type & BTRFS_BLOCK_GROUP_RAID1) && |
2321 | (type & BTRFS_BLOCK_GROUP_DUP)) { | |
2322 | WARN_ON(1); | |
2323 | type &= ~BTRFS_BLOCK_GROUP_DUP; | |
321aecc6 | 2324 | } |
9b3f68b9 | 2325 | |
73c5de00 AJ |
2326 | if (list_empty(&fs_devices->alloc_list)) |
2327 | return -ENOSPC; | |
b2117a39 | 2328 | |
73c5de00 AJ |
2329 | sub_stripes = 1; |
2330 | dev_stripes = 1; | |
2331 | devs_increment = 1; | |
2332 | ncopies = 1; | |
2333 | devs_max = 0; /* 0 == as many as possible */ | |
2334 | devs_min = 1; | |
2335 | ||
2336 | /* | |
2337 | * define the properties of each RAID type. | |
2338 | * FIXME: move this to a global table and use it in all RAID | |
2339 | * calculation code | |
2340 | */ | |
2341 | if (type & (BTRFS_BLOCK_GROUP_DUP)) { | |
2342 | dev_stripes = 2; | |
b2117a39 | 2343 | ncopies = 2; |
73c5de00 AJ |
2344 | devs_max = 1; |
2345 | } else if (type & (BTRFS_BLOCK_GROUP_RAID0)) { | |
2346 | devs_min = 2; | |
2347 | } else if (type & (BTRFS_BLOCK_GROUP_RAID1)) { | |
2348 | devs_increment = 2; | |
b2117a39 | 2349 | ncopies = 2; |
73c5de00 AJ |
2350 | devs_max = 2; |
2351 | devs_min = 2; | |
2352 | } else if (type & (BTRFS_BLOCK_GROUP_RAID10)) { | |
2353 | sub_stripes = 2; | |
2354 | devs_increment = 2; | |
2355 | ncopies = 2; | |
2356 | devs_min = 4; | |
2357 | } else { | |
2358 | devs_max = 1; | |
2359 | } | |
b2117a39 | 2360 | |
9b3f68b9 | 2361 | if (type & BTRFS_BLOCK_GROUP_DATA) { |
73c5de00 AJ |
2362 | max_stripe_size = 1024 * 1024 * 1024; |
2363 | max_chunk_size = 10 * max_stripe_size; | |
9b3f68b9 | 2364 | } else if (type & BTRFS_BLOCK_GROUP_METADATA) { |
73c5de00 AJ |
2365 | max_stripe_size = 256 * 1024 * 1024; |
2366 | max_chunk_size = max_stripe_size; | |
a40a90a0 | 2367 | } else if (type & BTRFS_BLOCK_GROUP_SYSTEM) { |
73c5de00 AJ |
2368 | max_stripe_size = 8 * 1024 * 1024; |
2369 | max_chunk_size = 2 * max_stripe_size; | |
2370 | } else { | |
2371 | printk(KERN_ERR "btrfs: invalid chunk type 0x%llx requested\n", | |
2372 | type); | |
2373 | BUG_ON(1); | |
9b3f68b9 CM |
2374 | } |
2375 | ||
2b82032c YZ |
2376 | /* we don't want a chunk larger than 10% of writeable space */ |
2377 | max_chunk_size = min(div_factor(fs_devices->total_rw_bytes, 1), | |
2378 | max_chunk_size); | |
9b3f68b9 | 2379 | |
73c5de00 AJ |
2380 | devices_info = kzalloc(sizeof(*devices_info) * fs_devices->rw_devices, |
2381 | GFP_NOFS); | |
2382 | if (!devices_info) | |
2383 | return -ENOMEM; | |
0cad8a11 | 2384 | |
73c5de00 | 2385 | cur = fs_devices->alloc_list.next; |
9b3f68b9 | 2386 | |
9f680ce0 | 2387 | /* |
73c5de00 AJ |
2388 | * in the first pass through the devices list, we gather information |
2389 | * about the available holes on each device. | |
9f680ce0 | 2390 | */ |
73c5de00 AJ |
2391 | ndevs = 0; |
2392 | while (cur != &fs_devices->alloc_list) { | |
2393 | struct btrfs_device *device; | |
2394 | u64 max_avail; | |
2395 | u64 dev_offset; | |
b2117a39 | 2396 | |
73c5de00 | 2397 | device = list_entry(cur, struct btrfs_device, dev_alloc_list); |
9f680ce0 | 2398 | |
73c5de00 | 2399 | cur = cur->next; |
b2117a39 | 2400 | |
73c5de00 AJ |
2401 | if (!device->writeable) { |
2402 | printk(KERN_ERR | |
2403 | "btrfs: read-only device in alloc_list\n"); | |
2404 | WARN_ON(1); | |
2405 | continue; | |
2406 | } | |
b2117a39 | 2407 | |
73c5de00 AJ |
2408 | if (!device->in_fs_metadata) |
2409 | continue; | |
b2117a39 | 2410 | |
73c5de00 AJ |
2411 | if (device->total_bytes > device->bytes_used) |
2412 | total_avail = device->total_bytes - device->bytes_used; | |
2413 | else | |
2414 | total_avail = 0; | |
2415 | /* avail is off by max(alloc_start, 1MB), but that is the same | |
2416 | * for all devices, so it doesn't hurt the sorting later on | |
b2117a39 | 2417 | */ |
b2117a39 | 2418 | |
73c5de00 AJ |
2419 | ret = find_free_dev_extent(trans, device, |
2420 | max_stripe_size * dev_stripes, | |
2421 | &dev_offset, &max_avail); | |
2422 | if (ret && ret != -ENOSPC) | |
2423 | goto error; | |
b2117a39 | 2424 | |
73c5de00 AJ |
2425 | if (ret == 0) |
2426 | max_avail = max_stripe_size * dev_stripes; | |
b2117a39 | 2427 | |
73c5de00 AJ |
2428 | if (max_avail < BTRFS_STRIPE_LEN * dev_stripes) |
2429 | continue; | |
b2117a39 | 2430 | |
73c5de00 AJ |
2431 | devices_info[ndevs].dev_offset = dev_offset; |
2432 | devices_info[ndevs].max_avail = max_avail; | |
2433 | devices_info[ndevs].total_avail = total_avail; | |
2434 | devices_info[ndevs].dev = device; | |
2435 | ++ndevs; | |
2436 | } | |
b2117a39 | 2437 | |
73c5de00 AJ |
2438 | /* |
2439 | * now sort the devices by hole size / available space | |
2440 | */ | |
2441 | sort(devices_info, ndevs, sizeof(struct btrfs_device_info), | |
2442 | btrfs_cmp_device_info, NULL); | |
b2117a39 | 2443 | |
73c5de00 AJ |
2444 | /* round down to number of usable stripes */ |
2445 | ndevs -= ndevs % devs_increment; | |
b2117a39 | 2446 | |
73c5de00 AJ |
2447 | if (ndevs < devs_increment * sub_stripes || ndevs < devs_min) { |
2448 | ret = -ENOSPC; | |
2449 | goto error; | |
b2117a39 | 2450 | } |
9f680ce0 | 2451 | |
73c5de00 AJ |
2452 | if (devs_max && ndevs > devs_max) |
2453 | ndevs = devs_max; | |
2454 | /* | |
2455 | * the primary goal is to maximize the number of stripes, so use as many | |
2456 | * devices as possible, even if the stripes are not maximum sized. | |
2457 | */ | |
2458 | stripe_size = devices_info[ndevs-1].max_avail; | |
2459 | num_stripes = ndevs * dev_stripes; | |
b2117a39 | 2460 | |
73c5de00 AJ |
2461 | if (stripe_size * num_stripes > max_chunk_size * ncopies) { |
2462 | stripe_size = max_chunk_size * ncopies; | |
2463 | do_div(stripe_size, num_stripes); | |
b2117a39 | 2464 | } |
b2117a39 | 2465 | |
73c5de00 AJ |
2466 | do_div(stripe_size, dev_stripes); |
2467 | do_div(stripe_size, BTRFS_STRIPE_LEN); | |
2468 | stripe_size *= BTRFS_STRIPE_LEN; | |
b2117a39 MX |
2469 | |
2470 | map = kmalloc(map_lookup_size(num_stripes), GFP_NOFS); | |
2471 | if (!map) { | |
2472 | ret = -ENOMEM; | |
2473 | goto error; | |
2474 | } | |
2475 | map->num_stripes = num_stripes; | |
9b3f68b9 | 2476 | |
73c5de00 AJ |
2477 | for (i = 0; i < ndevs; ++i) { |
2478 | for (j = 0; j < dev_stripes; ++j) { | |
2479 | int s = i * dev_stripes + j; | |
2480 | map->stripes[s].dev = devices_info[i].dev; | |
2481 | map->stripes[s].physical = devices_info[i].dev_offset + | |
2482 | j * stripe_size; | |
6324fbf3 | 2483 | } |
6324fbf3 | 2484 | } |
2b82032c | 2485 | map->sector_size = extent_root->sectorsize; |
b2117a39 MX |
2486 | map->stripe_len = BTRFS_STRIPE_LEN; |
2487 | map->io_align = BTRFS_STRIPE_LEN; | |
2488 | map->io_width = BTRFS_STRIPE_LEN; | |
2b82032c | 2489 | map->type = type; |
2b82032c | 2490 | map->sub_stripes = sub_stripes; |
0b86a832 | 2491 | |
2b82032c | 2492 | *map_ret = map; |
73c5de00 | 2493 | num_bytes = stripe_size * (num_stripes / ncopies); |
0b86a832 | 2494 | |
73c5de00 AJ |
2495 | *stripe_size_out = stripe_size; |
2496 | *num_bytes_out = num_bytes; | |
0b86a832 | 2497 | |
73c5de00 | 2498 | trace_btrfs_chunk_alloc(info->chunk_root, map, start, num_bytes); |
1abe9b8a | 2499 | |
172ddd60 | 2500 | em = alloc_extent_map(); |
2b82032c | 2501 | if (!em) { |
b2117a39 MX |
2502 | ret = -ENOMEM; |
2503 | goto error; | |
593060d7 | 2504 | } |
2b82032c YZ |
2505 | em->bdev = (struct block_device *)map; |
2506 | em->start = start; | |
73c5de00 | 2507 | em->len = num_bytes; |
2b82032c YZ |
2508 | em->block_start = 0; |
2509 | em->block_len = em->len; | |
593060d7 | 2510 | |
2b82032c | 2511 | em_tree = &extent_root->fs_info->mapping_tree.map_tree; |
890871be | 2512 | write_lock(&em_tree->lock); |
2b82032c | 2513 | ret = add_extent_mapping(em_tree, em); |
890871be | 2514 | write_unlock(&em_tree->lock); |
2b82032c YZ |
2515 | BUG_ON(ret); |
2516 | free_extent_map(em); | |
0b86a832 | 2517 | |
2b82032c YZ |
2518 | ret = btrfs_make_block_group(trans, extent_root, 0, type, |
2519 | BTRFS_FIRST_CHUNK_TREE_OBJECTID, | |
73c5de00 | 2520 | start, num_bytes); |
2b82032c | 2521 | BUG_ON(ret); |
611f0e00 | 2522 | |
73c5de00 AJ |
2523 | for (i = 0; i < map->num_stripes; ++i) { |
2524 | struct btrfs_device *device; | |
2525 | u64 dev_offset; | |
2526 | ||
2527 | device = map->stripes[i].dev; | |
2528 | dev_offset = map->stripes[i].physical; | |
0b86a832 CM |
2529 | |
2530 | ret = btrfs_alloc_dev_extent(trans, device, | |
2b82032c YZ |
2531 | info->chunk_root->root_key.objectid, |
2532 | BTRFS_FIRST_CHUNK_TREE_OBJECTID, | |
73c5de00 | 2533 | start, dev_offset, stripe_size); |
0b86a832 | 2534 | BUG_ON(ret); |
2b82032c YZ |
2535 | } |
2536 | ||
b2117a39 | 2537 | kfree(devices_info); |
2b82032c | 2538 | return 0; |
b2117a39 MX |
2539 | |
2540 | error: | |
2541 | kfree(map); | |
2542 | kfree(devices_info); | |
2543 | return ret; | |
2b82032c YZ |
2544 | } |
2545 | ||
2546 | static int __finish_chunk_alloc(struct btrfs_trans_handle *trans, | |
2547 | struct btrfs_root *extent_root, | |
2548 | struct map_lookup *map, u64 chunk_offset, | |
2549 | u64 chunk_size, u64 stripe_size) | |
2550 | { | |
2551 | u64 dev_offset; | |
2552 | struct btrfs_key key; | |
2553 | struct btrfs_root *chunk_root = extent_root->fs_info->chunk_root; | |
2554 | struct btrfs_device *device; | |
2555 | struct btrfs_chunk *chunk; | |
2556 | struct btrfs_stripe *stripe; | |
2557 | size_t item_size = btrfs_chunk_item_size(map->num_stripes); | |
2558 | int index = 0; | |
2559 | int ret; | |
2560 | ||
2561 | chunk = kzalloc(item_size, GFP_NOFS); | |
2562 | if (!chunk) | |
2563 | return -ENOMEM; | |
2564 | ||
2565 | index = 0; | |
2566 | while (index < map->num_stripes) { | |
2567 | device = map->stripes[index].dev; | |
2568 | device->bytes_used += stripe_size; | |
0b86a832 CM |
2569 | ret = btrfs_update_device(trans, device); |
2570 | BUG_ON(ret); | |
2b82032c YZ |
2571 | index++; |
2572 | } | |
2573 | ||
2574 | index = 0; | |
2575 | stripe = &chunk->stripe; | |
2576 | while (index < map->num_stripes) { | |
2577 | device = map->stripes[index].dev; | |
2578 | dev_offset = map->stripes[index].physical; | |
0b86a832 | 2579 | |
e17cade2 CM |
2580 | btrfs_set_stack_stripe_devid(stripe, device->devid); |
2581 | btrfs_set_stack_stripe_offset(stripe, dev_offset); | |
2582 | memcpy(stripe->dev_uuid, device->uuid, BTRFS_UUID_SIZE); | |
2b82032c | 2583 | stripe++; |
0b86a832 CM |
2584 | index++; |
2585 | } | |
2586 | ||
2b82032c | 2587 | btrfs_set_stack_chunk_length(chunk, chunk_size); |
0b86a832 | 2588 | btrfs_set_stack_chunk_owner(chunk, extent_root->root_key.objectid); |
2b82032c YZ |
2589 | btrfs_set_stack_chunk_stripe_len(chunk, map->stripe_len); |
2590 | btrfs_set_stack_chunk_type(chunk, map->type); | |
2591 | btrfs_set_stack_chunk_num_stripes(chunk, map->num_stripes); | |
2592 | btrfs_set_stack_chunk_io_align(chunk, map->stripe_len); | |
2593 | btrfs_set_stack_chunk_io_width(chunk, map->stripe_len); | |
0b86a832 | 2594 | btrfs_set_stack_chunk_sector_size(chunk, extent_root->sectorsize); |
2b82032c | 2595 | btrfs_set_stack_chunk_sub_stripes(chunk, map->sub_stripes); |
0b86a832 | 2596 | |
2b82032c YZ |
2597 | key.objectid = BTRFS_FIRST_CHUNK_TREE_OBJECTID; |
2598 | key.type = BTRFS_CHUNK_ITEM_KEY; | |
2599 | key.offset = chunk_offset; | |
0b86a832 | 2600 | |
2b82032c YZ |
2601 | ret = btrfs_insert_item(trans, chunk_root, &key, chunk, item_size); |
2602 | BUG_ON(ret); | |
0b86a832 | 2603 | |
2b82032c YZ |
2604 | if (map->type & BTRFS_BLOCK_GROUP_SYSTEM) { |
2605 | ret = btrfs_add_system_chunk(trans, chunk_root, &key, chunk, | |
2606 | item_size); | |
8f18cf13 CM |
2607 | BUG_ON(ret); |
2608 | } | |
1abe9b8a | 2609 | |
0b86a832 | 2610 | kfree(chunk); |
2b82032c YZ |
2611 | return 0; |
2612 | } | |
0b86a832 | 2613 | |
2b82032c YZ |
2614 | /* |
2615 | * Chunk allocation falls into two parts. The first part does works | |
2616 | * that make the new allocated chunk useable, but not do any operation | |
2617 | * that modifies the chunk tree. The second part does the works that | |
2618 | * require modifying the chunk tree. This division is important for the | |
2619 | * bootstrap process of adding storage to a seed btrfs. | |
2620 | */ | |
2621 | int btrfs_alloc_chunk(struct btrfs_trans_handle *trans, | |
2622 | struct btrfs_root *extent_root, u64 type) | |
2623 | { | |
2624 | u64 chunk_offset; | |
2625 | u64 chunk_size; | |
2626 | u64 stripe_size; | |
2627 | struct map_lookup *map; | |
2628 | struct btrfs_root *chunk_root = extent_root->fs_info->chunk_root; | |
2629 | int ret; | |
2630 | ||
2631 | ret = find_next_chunk(chunk_root, BTRFS_FIRST_CHUNK_TREE_OBJECTID, | |
2632 | &chunk_offset); | |
2633 | if (ret) | |
2634 | return ret; | |
2635 | ||
2636 | ret = __btrfs_alloc_chunk(trans, extent_root, &map, &chunk_size, | |
2637 | &stripe_size, chunk_offset, type); | |
2638 | if (ret) | |
2639 | return ret; | |
2640 | ||
2641 | ret = __finish_chunk_alloc(trans, extent_root, map, chunk_offset, | |
2642 | chunk_size, stripe_size); | |
2643 | BUG_ON(ret); | |
2644 | return 0; | |
2645 | } | |
2646 | ||
d397712b | 2647 | static noinline int init_first_rw_device(struct btrfs_trans_handle *trans, |
2b82032c YZ |
2648 | struct btrfs_root *root, |
2649 | struct btrfs_device *device) | |
2650 | { | |
2651 | u64 chunk_offset; | |
2652 | u64 sys_chunk_offset; | |
2653 | u64 chunk_size; | |
2654 | u64 sys_chunk_size; | |
2655 | u64 stripe_size; | |
2656 | u64 sys_stripe_size; | |
2657 | u64 alloc_profile; | |
2658 | struct map_lookup *map; | |
2659 | struct map_lookup *sys_map; | |
2660 | struct btrfs_fs_info *fs_info = root->fs_info; | |
2661 | struct btrfs_root *extent_root = fs_info->extent_root; | |
2662 | int ret; | |
2663 | ||
2664 | ret = find_next_chunk(fs_info->chunk_root, | |
2665 | BTRFS_FIRST_CHUNK_TREE_OBJECTID, &chunk_offset); | |
2666 | BUG_ON(ret); | |
2667 | ||
2668 | alloc_profile = BTRFS_BLOCK_GROUP_METADATA | | |
2669 | (fs_info->metadata_alloc_profile & | |
2670 | fs_info->avail_metadata_alloc_bits); | |
2671 | alloc_profile = btrfs_reduce_alloc_profile(root, alloc_profile); | |
2672 | ||
2673 | ret = __btrfs_alloc_chunk(trans, extent_root, &map, &chunk_size, | |
2674 | &stripe_size, chunk_offset, alloc_profile); | |
2675 | BUG_ON(ret); | |
2676 | ||
2677 | sys_chunk_offset = chunk_offset + chunk_size; | |
2678 | ||
2679 | alloc_profile = BTRFS_BLOCK_GROUP_SYSTEM | | |
2680 | (fs_info->system_alloc_profile & | |
2681 | fs_info->avail_system_alloc_bits); | |
2682 | alloc_profile = btrfs_reduce_alloc_profile(root, alloc_profile); | |
2683 | ||
2684 | ret = __btrfs_alloc_chunk(trans, extent_root, &sys_map, | |
2685 | &sys_chunk_size, &sys_stripe_size, | |
2686 | sys_chunk_offset, alloc_profile); | |
2687 | BUG_ON(ret); | |
2688 | ||
2689 | ret = btrfs_add_device(trans, fs_info->chunk_root, device); | |
2690 | BUG_ON(ret); | |
2691 | ||
2692 | /* | |
2693 | * Modifying chunk tree needs allocating new blocks from both | |
2694 | * system block group and metadata block group. So we only can | |
2695 | * do operations require modifying the chunk tree after both | |
2696 | * block groups were created. | |
2697 | */ | |
2698 | ret = __finish_chunk_alloc(trans, extent_root, map, chunk_offset, | |
2699 | chunk_size, stripe_size); | |
2700 | BUG_ON(ret); | |
2701 | ||
2702 | ret = __finish_chunk_alloc(trans, extent_root, sys_map, | |
2703 | sys_chunk_offset, sys_chunk_size, | |
2704 | sys_stripe_size); | |
b248a415 | 2705 | BUG_ON(ret); |
2b82032c YZ |
2706 | return 0; |
2707 | } | |
2708 | ||
2709 | int btrfs_chunk_readonly(struct btrfs_root *root, u64 chunk_offset) | |
2710 | { | |
2711 | struct extent_map *em; | |
2712 | struct map_lookup *map; | |
2713 | struct btrfs_mapping_tree *map_tree = &root->fs_info->mapping_tree; | |
2714 | int readonly = 0; | |
2715 | int i; | |
2716 | ||
890871be | 2717 | read_lock(&map_tree->map_tree.lock); |
2b82032c | 2718 | em = lookup_extent_mapping(&map_tree->map_tree, chunk_offset, 1); |
890871be | 2719 | read_unlock(&map_tree->map_tree.lock); |
2b82032c YZ |
2720 | if (!em) |
2721 | return 1; | |
2722 | ||
f48b9075 JB |
2723 | if (btrfs_test_opt(root, DEGRADED)) { |
2724 | free_extent_map(em); | |
2725 | return 0; | |
2726 | } | |
2727 | ||
2b82032c YZ |
2728 | map = (struct map_lookup *)em->bdev; |
2729 | for (i = 0; i < map->num_stripes; i++) { | |
2730 | if (!map->stripes[i].dev->writeable) { | |
2731 | readonly = 1; | |
2732 | break; | |
2733 | } | |
2734 | } | |
0b86a832 | 2735 | free_extent_map(em); |
2b82032c | 2736 | return readonly; |
0b86a832 CM |
2737 | } |
2738 | ||
2739 | void btrfs_mapping_init(struct btrfs_mapping_tree *tree) | |
2740 | { | |
a8067e02 | 2741 | extent_map_tree_init(&tree->map_tree); |
0b86a832 CM |
2742 | } |
2743 | ||
2744 | void btrfs_mapping_tree_free(struct btrfs_mapping_tree *tree) | |
2745 | { | |
2746 | struct extent_map *em; | |
2747 | ||
d397712b | 2748 | while (1) { |
890871be | 2749 | write_lock(&tree->map_tree.lock); |
0b86a832 CM |
2750 | em = lookup_extent_mapping(&tree->map_tree, 0, (u64)-1); |
2751 | if (em) | |
2752 | remove_extent_mapping(&tree->map_tree, em); | |
890871be | 2753 | write_unlock(&tree->map_tree.lock); |
0b86a832 CM |
2754 | if (!em) |
2755 | break; | |
2756 | kfree(em->bdev); | |
2757 | /* once for us */ | |
2758 | free_extent_map(em); | |
2759 | /* once for the tree */ | |
2760 | free_extent_map(em); | |
2761 | } | |
2762 | } | |
2763 | ||
f188591e CM |
2764 | int btrfs_num_copies(struct btrfs_mapping_tree *map_tree, u64 logical, u64 len) |
2765 | { | |
2766 | struct extent_map *em; | |
2767 | struct map_lookup *map; | |
2768 | struct extent_map_tree *em_tree = &map_tree->map_tree; | |
2769 | int ret; | |
2770 | ||
890871be | 2771 | read_lock(&em_tree->lock); |
f188591e | 2772 | em = lookup_extent_mapping(em_tree, logical, len); |
890871be | 2773 | read_unlock(&em_tree->lock); |
f188591e CM |
2774 | BUG_ON(!em); |
2775 | ||
2776 | BUG_ON(em->start > logical || em->start + em->len < logical); | |
2777 | map = (struct map_lookup *)em->bdev; | |
2778 | if (map->type & (BTRFS_BLOCK_GROUP_DUP | BTRFS_BLOCK_GROUP_RAID1)) | |
2779 | ret = map->num_stripes; | |
321aecc6 CM |
2780 | else if (map->type & BTRFS_BLOCK_GROUP_RAID10) |
2781 | ret = map->sub_stripes; | |
f188591e CM |
2782 | else |
2783 | ret = 1; | |
2784 | free_extent_map(em); | |
f188591e CM |
2785 | return ret; |
2786 | } | |
2787 | ||
dfe25020 CM |
2788 | static int find_live_mirror(struct map_lookup *map, int first, int num, |
2789 | int optimal) | |
2790 | { | |
2791 | int i; | |
2792 | if (map->stripes[optimal].dev->bdev) | |
2793 | return optimal; | |
2794 | for (i = first; i < first + num; i++) { | |
2795 | if (map->stripes[i].dev->bdev) | |
2796 | return i; | |
2797 | } | |
2798 | /* we couldn't find one that doesn't fail. Just return something | |
2799 | * and the io error handling code will clean up eventually | |
2800 | */ | |
2801 | return optimal; | |
2802 | } | |
2803 | ||
f2d8d74d CM |
2804 | static int __btrfs_map_block(struct btrfs_mapping_tree *map_tree, int rw, |
2805 | u64 logical, u64 *length, | |
2806 | struct btrfs_multi_bio **multi_ret, | |
7eaceacc | 2807 | int mirror_num) |
0b86a832 CM |
2808 | { |
2809 | struct extent_map *em; | |
2810 | struct map_lookup *map; | |
2811 | struct extent_map_tree *em_tree = &map_tree->map_tree; | |
2812 | u64 offset; | |
593060d7 | 2813 | u64 stripe_offset; |
fce3bb9a | 2814 | u64 stripe_end_offset; |
593060d7 | 2815 | u64 stripe_nr; |
fce3bb9a LD |
2816 | u64 stripe_nr_orig; |
2817 | u64 stripe_nr_end; | |
cea9e445 | 2818 | int stripes_allocated = 8; |
321aecc6 | 2819 | int stripes_required = 1; |
593060d7 | 2820 | int stripe_index; |
cea9e445 | 2821 | int i; |
f2d8d74d | 2822 | int num_stripes; |
a236aed1 | 2823 | int max_errors = 0; |
cea9e445 | 2824 | struct btrfs_multi_bio *multi = NULL; |
0b86a832 | 2825 | |
fce3bb9a | 2826 | if (multi_ret && !(rw & (REQ_WRITE | REQ_DISCARD))) |
cea9e445 | 2827 | stripes_allocated = 1; |
cea9e445 CM |
2828 | again: |
2829 | if (multi_ret) { | |
2830 | multi = kzalloc(btrfs_multi_bio_size(stripes_allocated), | |
2831 | GFP_NOFS); | |
2832 | if (!multi) | |
2833 | return -ENOMEM; | |
a236aed1 CM |
2834 | |
2835 | atomic_set(&multi->error, 0); | |
cea9e445 | 2836 | } |
0b86a832 | 2837 | |
890871be | 2838 | read_lock(&em_tree->lock); |
0b86a832 | 2839 | em = lookup_extent_mapping(em_tree, logical, *length); |
890871be | 2840 | read_unlock(&em_tree->lock); |
f2d8d74d | 2841 | |
3b951516 | 2842 | if (!em) { |
d397712b CM |
2843 | printk(KERN_CRIT "unable to find logical %llu len %llu\n", |
2844 | (unsigned long long)logical, | |
2845 | (unsigned long long)*length); | |
f2d8d74d | 2846 | BUG(); |
3b951516 | 2847 | } |
0b86a832 CM |
2848 | |
2849 | BUG_ON(em->start > logical || em->start + em->len < logical); | |
2850 | map = (struct map_lookup *)em->bdev; | |
2851 | offset = logical - em->start; | |
593060d7 | 2852 | |
f188591e CM |
2853 | if (mirror_num > map->num_stripes) |
2854 | mirror_num = 0; | |
2855 | ||
cea9e445 | 2856 | /* if our multi bio struct is too small, back off and try again */ |
7b6d91da | 2857 | if (rw & REQ_WRITE) { |
321aecc6 CM |
2858 | if (map->type & (BTRFS_BLOCK_GROUP_RAID1 | |
2859 | BTRFS_BLOCK_GROUP_DUP)) { | |
2860 | stripes_required = map->num_stripes; | |
a236aed1 | 2861 | max_errors = 1; |
321aecc6 CM |
2862 | } else if (map->type & BTRFS_BLOCK_GROUP_RAID10) { |
2863 | stripes_required = map->sub_stripes; | |
a236aed1 | 2864 | max_errors = 1; |
321aecc6 CM |
2865 | } |
2866 | } | |
fce3bb9a LD |
2867 | if (rw & REQ_DISCARD) { |
2868 | if (map->type & (BTRFS_BLOCK_GROUP_RAID0 | | |
2869 | BTRFS_BLOCK_GROUP_RAID1 | | |
2870 | BTRFS_BLOCK_GROUP_DUP | | |
2871 | BTRFS_BLOCK_GROUP_RAID10)) { | |
2872 | stripes_required = map->num_stripes; | |
2873 | } | |
2874 | } | |
2875 | if (multi_ret && (rw & (REQ_WRITE | REQ_DISCARD)) && | |
321aecc6 | 2876 | stripes_allocated < stripes_required) { |
cea9e445 | 2877 | stripes_allocated = map->num_stripes; |
cea9e445 CM |
2878 | free_extent_map(em); |
2879 | kfree(multi); | |
2880 | goto again; | |
2881 | } | |
593060d7 CM |
2882 | stripe_nr = offset; |
2883 | /* | |
2884 | * stripe_nr counts the total number of stripes we have to stride | |
2885 | * to get to this block | |
2886 | */ | |
2887 | do_div(stripe_nr, map->stripe_len); | |
2888 | ||
2889 | stripe_offset = stripe_nr * map->stripe_len; | |
2890 | BUG_ON(offset < stripe_offset); | |
2891 | ||
2892 | /* stripe_offset is the offset of this block in its stripe*/ | |
2893 | stripe_offset = offset - stripe_offset; | |
2894 | ||
fce3bb9a LD |
2895 | if (rw & REQ_DISCARD) |
2896 | *length = min_t(u64, em->len - offset, *length); | |
2897 | else if (map->type & (BTRFS_BLOCK_GROUP_RAID0 | | |
2898 | BTRFS_BLOCK_GROUP_RAID1 | | |
2899 | BTRFS_BLOCK_GROUP_RAID10 | | |
2900 | BTRFS_BLOCK_GROUP_DUP)) { | |
cea9e445 CM |
2901 | /* we limit the length of each bio to what fits in a stripe */ |
2902 | *length = min_t(u64, em->len - offset, | |
fce3bb9a | 2903 | map->stripe_len - stripe_offset); |
cea9e445 CM |
2904 | } else { |
2905 | *length = em->len - offset; | |
2906 | } | |
f2d8d74d | 2907 | |
7eaceacc | 2908 | if (!multi_ret) |
cea9e445 CM |
2909 | goto out; |
2910 | ||
f2d8d74d | 2911 | num_stripes = 1; |
cea9e445 | 2912 | stripe_index = 0; |
fce3bb9a LD |
2913 | stripe_nr_orig = stripe_nr; |
2914 | stripe_nr_end = (offset + *length + map->stripe_len - 1) & | |
2915 | (~(map->stripe_len - 1)); | |
2916 | do_div(stripe_nr_end, map->stripe_len); | |
2917 | stripe_end_offset = stripe_nr_end * map->stripe_len - | |
2918 | (offset + *length); | |
2919 | if (map->type & BTRFS_BLOCK_GROUP_RAID0) { | |
2920 | if (rw & REQ_DISCARD) | |
2921 | num_stripes = min_t(u64, map->num_stripes, | |
2922 | stripe_nr_end - stripe_nr_orig); | |
2923 | stripe_index = do_div(stripe_nr, map->num_stripes); | |
2924 | } else if (map->type & BTRFS_BLOCK_GROUP_RAID1) { | |
212a17ab | 2925 | if (rw & (REQ_WRITE | REQ_DISCARD)) |
f2d8d74d | 2926 | num_stripes = map->num_stripes; |
2fff734f | 2927 | else if (mirror_num) |
f188591e | 2928 | stripe_index = mirror_num - 1; |
dfe25020 CM |
2929 | else { |
2930 | stripe_index = find_live_mirror(map, 0, | |
2931 | map->num_stripes, | |
2932 | current->pid % map->num_stripes); | |
2933 | } | |
2fff734f | 2934 | |
611f0e00 | 2935 | } else if (map->type & BTRFS_BLOCK_GROUP_DUP) { |
fce3bb9a | 2936 | if (rw & (REQ_WRITE | REQ_DISCARD)) |
f2d8d74d | 2937 | num_stripes = map->num_stripes; |
f188591e CM |
2938 | else if (mirror_num) |
2939 | stripe_index = mirror_num - 1; | |
2fff734f | 2940 | |
321aecc6 CM |
2941 | } else if (map->type & BTRFS_BLOCK_GROUP_RAID10) { |
2942 | int factor = map->num_stripes / map->sub_stripes; | |
321aecc6 CM |
2943 | |
2944 | stripe_index = do_div(stripe_nr, factor); | |
2945 | stripe_index *= map->sub_stripes; | |
2946 | ||
7eaceacc | 2947 | if (rw & REQ_WRITE) |
f2d8d74d | 2948 | num_stripes = map->sub_stripes; |
fce3bb9a LD |
2949 | else if (rw & REQ_DISCARD) |
2950 | num_stripes = min_t(u64, map->sub_stripes * | |
2951 | (stripe_nr_end - stripe_nr_orig), | |
2952 | map->num_stripes); | |
321aecc6 CM |
2953 | else if (mirror_num) |
2954 | stripe_index += mirror_num - 1; | |
dfe25020 CM |
2955 | else { |
2956 | stripe_index = find_live_mirror(map, stripe_index, | |
2957 | map->sub_stripes, stripe_index + | |
2958 | current->pid % map->sub_stripes); | |
2959 | } | |
8790d502 CM |
2960 | } else { |
2961 | /* | |
2962 | * after this do_div call, stripe_nr is the number of stripes | |
2963 | * on this device we have to walk to find the data, and | |
2964 | * stripe_index is the number of our device in the stripe array | |
2965 | */ | |
2966 | stripe_index = do_div(stripe_nr, map->num_stripes); | |
2967 | } | |
593060d7 | 2968 | BUG_ON(stripe_index >= map->num_stripes); |
cea9e445 | 2969 | |
fce3bb9a LD |
2970 | if (rw & REQ_DISCARD) { |
2971 | for (i = 0; i < num_stripes; i++) { | |
f2d8d74d CM |
2972 | multi->stripes[i].physical = |
2973 | map->stripes[stripe_index].physical + | |
2974 | stripe_offset + stripe_nr * map->stripe_len; | |
2975 | multi->stripes[i].dev = map->stripes[stripe_index].dev; | |
fce3bb9a LD |
2976 | |
2977 | if (map->type & BTRFS_BLOCK_GROUP_RAID0) { | |
2978 | u64 stripes; | |
d9d04879 | 2979 | u32 last_stripe = 0; |
fce3bb9a LD |
2980 | int j; |
2981 | ||
d9d04879 CM |
2982 | div_u64_rem(stripe_nr_end - 1, |
2983 | map->num_stripes, | |
2984 | &last_stripe); | |
2985 | ||
fce3bb9a | 2986 | for (j = 0; j < map->num_stripes; j++) { |
d9d04879 CM |
2987 | u32 test; |
2988 | ||
2989 | div_u64_rem(stripe_nr_end - 1 - j, | |
2990 | map->num_stripes, &test); | |
2991 | if (test == stripe_index) | |
fce3bb9a LD |
2992 | break; |
2993 | } | |
2994 | stripes = stripe_nr_end - 1 - j; | |
2995 | do_div(stripes, map->num_stripes); | |
2996 | multi->stripes[i].length = map->stripe_len * | |
2997 | (stripes - stripe_nr + 1); | |
2998 | ||
2999 | if (i == 0) { | |
3000 | multi->stripes[i].length -= | |
3001 | stripe_offset; | |
3002 | stripe_offset = 0; | |
3003 | } | |
3004 | if (stripe_index == last_stripe) | |
3005 | multi->stripes[i].length -= | |
3006 | stripe_end_offset; | |
3007 | } else if (map->type & BTRFS_BLOCK_GROUP_RAID10) { | |
3008 | u64 stripes; | |
3009 | int j; | |
3010 | int factor = map->num_stripes / | |
3011 | map->sub_stripes; | |
d9d04879 CM |
3012 | u32 last_stripe = 0; |
3013 | ||
3014 | div_u64_rem(stripe_nr_end - 1, | |
3015 | factor, &last_stripe); | |
fce3bb9a LD |
3016 | last_stripe *= map->sub_stripes; |
3017 | ||
3018 | for (j = 0; j < factor; j++) { | |
d9d04879 CM |
3019 | u32 test; |
3020 | ||
3021 | div_u64_rem(stripe_nr_end - 1 - j, | |
3022 | factor, &test); | |
3023 | ||
3024 | if (test == | |
fce3bb9a LD |
3025 | stripe_index / map->sub_stripes) |
3026 | break; | |
3027 | } | |
3028 | stripes = stripe_nr_end - 1 - j; | |
3029 | do_div(stripes, factor); | |
3030 | multi->stripes[i].length = map->stripe_len * | |
3031 | (stripes - stripe_nr + 1); | |
3032 | ||
3033 | if (i < map->sub_stripes) { | |
3034 | multi->stripes[i].length -= | |
3035 | stripe_offset; | |
3036 | if (i == map->sub_stripes - 1) | |
3037 | stripe_offset = 0; | |
3038 | } | |
3039 | if (stripe_index >= last_stripe && | |
3040 | stripe_index <= (last_stripe + | |
3041 | map->sub_stripes - 1)) { | |
3042 | multi->stripes[i].length -= | |
3043 | stripe_end_offset; | |
3044 | } | |
3045 | } else | |
3046 | multi->stripes[i].length = *length; | |
3047 | ||
3048 | stripe_index++; | |
3049 | if (stripe_index == map->num_stripes) { | |
3050 | /* This could only happen for RAID0/10 */ | |
3051 | stripe_index = 0; | |
3052 | stripe_nr++; | |
3053 | } | |
3054 | } | |
3055 | } else { | |
3056 | for (i = 0; i < num_stripes; i++) { | |
212a17ab LT |
3057 | multi->stripes[i].physical = |
3058 | map->stripes[stripe_index].physical + | |
3059 | stripe_offset + | |
3060 | stripe_nr * map->stripe_len; | |
3061 | multi->stripes[i].dev = | |
3062 | map->stripes[stripe_index].dev; | |
fce3bb9a | 3063 | stripe_index++; |
f2d8d74d | 3064 | } |
593060d7 | 3065 | } |
f2d8d74d CM |
3066 | if (multi_ret) { |
3067 | *multi_ret = multi; | |
3068 | multi->num_stripes = num_stripes; | |
a236aed1 | 3069 | multi->max_errors = max_errors; |
f2d8d74d | 3070 | } |
cea9e445 | 3071 | out: |
0b86a832 | 3072 | free_extent_map(em); |
0b86a832 CM |
3073 | return 0; |
3074 | } | |
3075 | ||
f2d8d74d CM |
3076 | int btrfs_map_block(struct btrfs_mapping_tree *map_tree, int rw, |
3077 | u64 logical, u64 *length, | |
3078 | struct btrfs_multi_bio **multi_ret, int mirror_num) | |
3079 | { | |
3080 | return __btrfs_map_block(map_tree, rw, logical, length, multi_ret, | |
7eaceacc | 3081 | mirror_num); |
f2d8d74d CM |
3082 | } |
3083 | ||
a512bbf8 YZ |
3084 | int btrfs_rmap_block(struct btrfs_mapping_tree *map_tree, |
3085 | u64 chunk_start, u64 physical, u64 devid, | |
3086 | u64 **logical, int *naddrs, int *stripe_len) | |
3087 | { | |
3088 | struct extent_map_tree *em_tree = &map_tree->map_tree; | |
3089 | struct extent_map *em; | |
3090 | struct map_lookup *map; | |
3091 | u64 *buf; | |
3092 | u64 bytenr; | |
3093 | u64 length; | |
3094 | u64 stripe_nr; | |
3095 | int i, j, nr = 0; | |
3096 | ||
890871be | 3097 | read_lock(&em_tree->lock); |
a512bbf8 | 3098 | em = lookup_extent_mapping(em_tree, chunk_start, 1); |
890871be | 3099 | read_unlock(&em_tree->lock); |
a512bbf8 YZ |
3100 | |
3101 | BUG_ON(!em || em->start != chunk_start); | |
3102 | map = (struct map_lookup *)em->bdev; | |
3103 | ||
3104 | length = em->len; | |
3105 | if (map->type & BTRFS_BLOCK_GROUP_RAID10) | |
3106 | do_div(length, map->num_stripes / map->sub_stripes); | |
3107 | else if (map->type & BTRFS_BLOCK_GROUP_RAID0) | |
3108 | do_div(length, map->num_stripes); | |
3109 | ||
3110 | buf = kzalloc(sizeof(u64) * map->num_stripes, GFP_NOFS); | |
3111 | BUG_ON(!buf); | |
3112 | ||
3113 | for (i = 0; i < map->num_stripes; i++) { | |
3114 | if (devid && map->stripes[i].dev->devid != devid) | |
3115 | continue; | |
3116 | if (map->stripes[i].physical > physical || | |
3117 | map->stripes[i].physical + length <= physical) | |
3118 | continue; | |
3119 | ||
3120 | stripe_nr = physical - map->stripes[i].physical; | |
3121 | do_div(stripe_nr, map->stripe_len); | |
3122 | ||
3123 | if (map->type & BTRFS_BLOCK_GROUP_RAID10) { | |
3124 | stripe_nr = stripe_nr * map->num_stripes + i; | |
3125 | do_div(stripe_nr, map->sub_stripes); | |
3126 | } else if (map->type & BTRFS_BLOCK_GROUP_RAID0) { | |
3127 | stripe_nr = stripe_nr * map->num_stripes + i; | |
3128 | } | |
3129 | bytenr = chunk_start + stripe_nr * map->stripe_len; | |
934d375b | 3130 | WARN_ON(nr >= map->num_stripes); |
a512bbf8 YZ |
3131 | for (j = 0; j < nr; j++) { |
3132 | if (buf[j] == bytenr) | |
3133 | break; | |
3134 | } | |
934d375b CM |
3135 | if (j == nr) { |
3136 | WARN_ON(nr >= map->num_stripes); | |
a512bbf8 | 3137 | buf[nr++] = bytenr; |
934d375b | 3138 | } |
a512bbf8 YZ |
3139 | } |
3140 | ||
a512bbf8 YZ |
3141 | *logical = buf; |
3142 | *naddrs = nr; | |
3143 | *stripe_len = map->stripe_len; | |
3144 | ||
3145 | free_extent_map(em); | |
3146 | return 0; | |
f2d8d74d CM |
3147 | } |
3148 | ||
8790d502 | 3149 | static void end_bio_multi_stripe(struct bio *bio, int err) |
8790d502 | 3150 | { |
cea9e445 | 3151 | struct btrfs_multi_bio *multi = bio->bi_private; |
7d2b4daa | 3152 | int is_orig_bio = 0; |
8790d502 | 3153 | |
8790d502 | 3154 | if (err) |
a236aed1 | 3155 | atomic_inc(&multi->error); |
8790d502 | 3156 | |
7d2b4daa CM |
3157 | if (bio == multi->orig_bio) |
3158 | is_orig_bio = 1; | |
3159 | ||
cea9e445 | 3160 | if (atomic_dec_and_test(&multi->stripes_pending)) { |
7d2b4daa CM |
3161 | if (!is_orig_bio) { |
3162 | bio_put(bio); | |
3163 | bio = multi->orig_bio; | |
3164 | } | |
8790d502 CM |
3165 | bio->bi_private = multi->private; |
3166 | bio->bi_end_io = multi->end_io; | |
a236aed1 CM |
3167 | /* only send an error to the higher layers if it is |
3168 | * beyond the tolerance of the multi-bio | |
3169 | */ | |
1259ab75 | 3170 | if (atomic_read(&multi->error) > multi->max_errors) { |
a236aed1 | 3171 | err = -EIO; |
1259ab75 CM |
3172 | } else if (err) { |
3173 | /* | |
3174 | * this bio is actually up to date, we didn't | |
3175 | * go over the max number of errors | |
3176 | */ | |
3177 | set_bit(BIO_UPTODATE, &bio->bi_flags); | |
a236aed1 | 3178 | err = 0; |
1259ab75 | 3179 | } |
8790d502 CM |
3180 | kfree(multi); |
3181 | ||
3182 | bio_endio(bio, err); | |
7d2b4daa | 3183 | } else if (!is_orig_bio) { |
8790d502 CM |
3184 | bio_put(bio); |
3185 | } | |
8790d502 CM |
3186 | } |
3187 | ||
8b712842 CM |
3188 | struct async_sched { |
3189 | struct bio *bio; | |
3190 | int rw; | |
3191 | struct btrfs_fs_info *info; | |
3192 | struct btrfs_work work; | |
3193 | }; | |
3194 | ||
3195 | /* | |
3196 | * see run_scheduled_bios for a description of why bios are collected for | |
3197 | * async submit. | |
3198 | * | |
3199 | * This will add one bio to the pending list for a device and make sure | |
3200 | * the work struct is scheduled. | |
3201 | */ | |
d397712b | 3202 | static noinline int schedule_bio(struct btrfs_root *root, |
a1b32a59 CM |
3203 | struct btrfs_device *device, |
3204 | int rw, struct bio *bio) | |
8b712842 CM |
3205 | { |
3206 | int should_queue = 1; | |
ffbd517d | 3207 | struct btrfs_pending_bios *pending_bios; |
8b712842 CM |
3208 | |
3209 | /* don't bother with additional async steps for reads, right now */ | |
7b6d91da | 3210 | if (!(rw & REQ_WRITE)) { |
492bb6de | 3211 | bio_get(bio); |
8b712842 | 3212 | submit_bio(rw, bio); |
492bb6de | 3213 | bio_put(bio); |
8b712842 CM |
3214 | return 0; |
3215 | } | |
3216 | ||
3217 | /* | |
0986fe9e | 3218 | * nr_async_bios allows us to reliably return congestion to the |
8b712842 CM |
3219 | * higher layers. Otherwise, the async bio makes it appear we have |
3220 | * made progress against dirty pages when we've really just put it | |
3221 | * on a queue for later | |
3222 | */ | |
0986fe9e | 3223 | atomic_inc(&root->fs_info->nr_async_bios); |
492bb6de | 3224 | WARN_ON(bio->bi_next); |
8b712842 CM |
3225 | bio->bi_next = NULL; |
3226 | bio->bi_rw |= rw; | |
3227 | ||
3228 | spin_lock(&device->io_lock); | |
7b6d91da | 3229 | if (bio->bi_rw & REQ_SYNC) |
ffbd517d CM |
3230 | pending_bios = &device->pending_sync_bios; |
3231 | else | |
3232 | pending_bios = &device->pending_bios; | |
8b712842 | 3233 | |
ffbd517d CM |
3234 | if (pending_bios->tail) |
3235 | pending_bios->tail->bi_next = bio; | |
8b712842 | 3236 | |
ffbd517d CM |
3237 | pending_bios->tail = bio; |
3238 | if (!pending_bios->head) | |
3239 | pending_bios->head = bio; | |
8b712842 CM |
3240 | if (device->running_pending) |
3241 | should_queue = 0; | |
3242 | ||
3243 | spin_unlock(&device->io_lock); | |
3244 | ||
3245 | if (should_queue) | |
1cc127b5 CM |
3246 | btrfs_queue_worker(&root->fs_info->submit_workers, |
3247 | &device->work); | |
8b712842 CM |
3248 | return 0; |
3249 | } | |
3250 | ||
f188591e | 3251 | int btrfs_map_bio(struct btrfs_root *root, int rw, struct bio *bio, |
8b712842 | 3252 | int mirror_num, int async_submit) |
0b86a832 CM |
3253 | { |
3254 | struct btrfs_mapping_tree *map_tree; | |
3255 | struct btrfs_device *dev; | |
8790d502 | 3256 | struct bio *first_bio = bio; |
a62b9401 | 3257 | u64 logical = (u64)bio->bi_sector << 9; |
0b86a832 CM |
3258 | u64 length = 0; |
3259 | u64 map_length; | |
cea9e445 | 3260 | struct btrfs_multi_bio *multi = NULL; |
0b86a832 | 3261 | int ret; |
8790d502 CM |
3262 | int dev_nr = 0; |
3263 | int total_devs = 1; | |
0b86a832 | 3264 | |
f2d8d74d | 3265 | length = bio->bi_size; |
0b86a832 CM |
3266 | map_tree = &root->fs_info->mapping_tree; |
3267 | map_length = length; | |
cea9e445 | 3268 | |
f188591e CM |
3269 | ret = btrfs_map_block(map_tree, rw, logical, &map_length, &multi, |
3270 | mirror_num); | |
cea9e445 CM |
3271 | BUG_ON(ret); |
3272 | ||
3273 | total_devs = multi->num_stripes; | |
3274 | if (map_length < length) { | |
d397712b CM |
3275 | printk(KERN_CRIT "mapping failed logical %llu bio len %llu " |
3276 | "len %llu\n", (unsigned long long)logical, | |
3277 | (unsigned long long)length, | |
3278 | (unsigned long long)map_length); | |
cea9e445 CM |
3279 | BUG(); |
3280 | } | |
3281 | multi->end_io = first_bio->bi_end_io; | |
3282 | multi->private = first_bio->bi_private; | |
7d2b4daa | 3283 | multi->orig_bio = first_bio; |
cea9e445 CM |
3284 | atomic_set(&multi->stripes_pending, multi->num_stripes); |
3285 | ||
d397712b | 3286 | while (dev_nr < total_devs) { |
8790d502 | 3287 | if (total_devs > 1) { |
8790d502 CM |
3288 | if (dev_nr < total_devs - 1) { |
3289 | bio = bio_clone(first_bio, GFP_NOFS); | |
3290 | BUG_ON(!bio); | |
3291 | } else { | |
3292 | bio = first_bio; | |
3293 | } | |
3294 | bio->bi_private = multi; | |
3295 | bio->bi_end_io = end_bio_multi_stripe; | |
3296 | } | |
cea9e445 CM |
3297 | bio->bi_sector = multi->stripes[dev_nr].physical >> 9; |
3298 | dev = multi->stripes[dev_nr].dev; | |
18e503d6 | 3299 | if (dev && dev->bdev && (rw != WRITE || dev->writeable)) { |
dfe25020 | 3300 | bio->bi_bdev = dev->bdev; |
8b712842 CM |
3301 | if (async_submit) |
3302 | schedule_bio(root, dev, rw, bio); | |
3303 | else | |
3304 | submit_bio(rw, bio); | |
dfe25020 CM |
3305 | } else { |
3306 | bio->bi_bdev = root->fs_info->fs_devices->latest_bdev; | |
3307 | bio->bi_sector = logical >> 9; | |
dfe25020 | 3308 | bio_endio(bio, -EIO); |
dfe25020 | 3309 | } |
8790d502 CM |
3310 | dev_nr++; |
3311 | } | |
cea9e445 CM |
3312 | if (total_devs == 1) |
3313 | kfree(multi); | |
0b86a832 CM |
3314 | return 0; |
3315 | } | |
3316 | ||
a443755f | 3317 | struct btrfs_device *btrfs_find_device(struct btrfs_root *root, u64 devid, |
2b82032c | 3318 | u8 *uuid, u8 *fsid) |
0b86a832 | 3319 | { |
2b82032c YZ |
3320 | struct btrfs_device *device; |
3321 | struct btrfs_fs_devices *cur_devices; | |
3322 | ||
3323 | cur_devices = root->fs_info->fs_devices; | |
3324 | while (cur_devices) { | |
3325 | if (!fsid || | |
3326 | !memcmp(cur_devices->fsid, fsid, BTRFS_UUID_SIZE)) { | |
3327 | device = __find_device(&cur_devices->devices, | |
3328 | devid, uuid); | |
3329 | if (device) | |
3330 | return device; | |
3331 | } | |
3332 | cur_devices = cur_devices->seed; | |
3333 | } | |
3334 | return NULL; | |
0b86a832 CM |
3335 | } |
3336 | ||
dfe25020 CM |
3337 | static struct btrfs_device *add_missing_dev(struct btrfs_root *root, |
3338 | u64 devid, u8 *dev_uuid) | |
3339 | { | |
3340 | struct btrfs_device *device; | |
3341 | struct btrfs_fs_devices *fs_devices = root->fs_info->fs_devices; | |
3342 | ||
3343 | device = kzalloc(sizeof(*device), GFP_NOFS); | |
7cbd8a83 | 3344 | if (!device) |
3345 | return NULL; | |
dfe25020 CM |
3346 | list_add(&device->dev_list, |
3347 | &fs_devices->devices); | |
dfe25020 CM |
3348 | device->dev_root = root->fs_info->dev_root; |
3349 | device->devid = devid; | |
8b712842 | 3350 | device->work.func = pending_bios_fn; |
e4404d6e | 3351 | device->fs_devices = fs_devices; |
cd02dca5 | 3352 | device->missing = 1; |
dfe25020 | 3353 | fs_devices->num_devices++; |
cd02dca5 | 3354 | fs_devices->missing_devices++; |
dfe25020 | 3355 | spin_lock_init(&device->io_lock); |
d20f7043 | 3356 | INIT_LIST_HEAD(&device->dev_alloc_list); |
dfe25020 CM |
3357 | memcpy(device->uuid, dev_uuid, BTRFS_UUID_SIZE); |
3358 | return device; | |
3359 | } | |
3360 | ||
0b86a832 CM |
3361 | static int read_one_chunk(struct btrfs_root *root, struct btrfs_key *key, |
3362 | struct extent_buffer *leaf, | |
3363 | struct btrfs_chunk *chunk) | |
3364 | { | |
3365 | struct btrfs_mapping_tree *map_tree = &root->fs_info->mapping_tree; | |
3366 | struct map_lookup *map; | |
3367 | struct extent_map *em; | |
3368 | u64 logical; | |
3369 | u64 length; | |
3370 | u64 devid; | |
a443755f | 3371 | u8 uuid[BTRFS_UUID_SIZE]; |
593060d7 | 3372 | int num_stripes; |
0b86a832 | 3373 | int ret; |
593060d7 | 3374 | int i; |
0b86a832 | 3375 | |
e17cade2 CM |
3376 | logical = key->offset; |
3377 | length = btrfs_chunk_length(leaf, chunk); | |
a061fc8d | 3378 | |
890871be | 3379 | read_lock(&map_tree->map_tree.lock); |
0b86a832 | 3380 | em = lookup_extent_mapping(&map_tree->map_tree, logical, 1); |
890871be | 3381 | read_unlock(&map_tree->map_tree.lock); |
0b86a832 CM |
3382 | |
3383 | /* already mapped? */ | |
3384 | if (em && em->start <= logical && em->start + em->len > logical) { | |
3385 | free_extent_map(em); | |
0b86a832 CM |
3386 | return 0; |
3387 | } else if (em) { | |
3388 | free_extent_map(em); | |
3389 | } | |
0b86a832 | 3390 | |
172ddd60 | 3391 | em = alloc_extent_map(); |
0b86a832 CM |
3392 | if (!em) |
3393 | return -ENOMEM; | |
593060d7 CM |
3394 | num_stripes = btrfs_chunk_num_stripes(leaf, chunk); |
3395 | map = kmalloc(map_lookup_size(num_stripes), GFP_NOFS); | |
0b86a832 CM |
3396 | if (!map) { |
3397 | free_extent_map(em); | |
3398 | return -ENOMEM; | |
3399 | } | |
3400 | ||
3401 | em->bdev = (struct block_device *)map; | |
3402 | em->start = logical; | |
3403 | em->len = length; | |
3404 | em->block_start = 0; | |
c8b97818 | 3405 | em->block_len = em->len; |
0b86a832 | 3406 | |
593060d7 CM |
3407 | map->num_stripes = num_stripes; |
3408 | map->io_width = btrfs_chunk_io_width(leaf, chunk); | |
3409 | map->io_align = btrfs_chunk_io_align(leaf, chunk); | |
3410 | map->sector_size = btrfs_chunk_sector_size(leaf, chunk); | |
3411 | map->stripe_len = btrfs_chunk_stripe_len(leaf, chunk); | |
3412 | map->type = btrfs_chunk_type(leaf, chunk); | |
321aecc6 | 3413 | map->sub_stripes = btrfs_chunk_sub_stripes(leaf, chunk); |
593060d7 CM |
3414 | for (i = 0; i < num_stripes; i++) { |
3415 | map->stripes[i].physical = | |
3416 | btrfs_stripe_offset_nr(leaf, chunk, i); | |
3417 | devid = btrfs_stripe_devid_nr(leaf, chunk, i); | |
a443755f CM |
3418 | read_extent_buffer(leaf, uuid, (unsigned long) |
3419 | btrfs_stripe_dev_uuid_nr(chunk, i), | |
3420 | BTRFS_UUID_SIZE); | |
2b82032c YZ |
3421 | map->stripes[i].dev = btrfs_find_device(root, devid, uuid, |
3422 | NULL); | |
dfe25020 | 3423 | if (!map->stripes[i].dev && !btrfs_test_opt(root, DEGRADED)) { |
593060d7 CM |
3424 | kfree(map); |
3425 | free_extent_map(em); | |
3426 | return -EIO; | |
3427 | } | |
dfe25020 CM |
3428 | if (!map->stripes[i].dev) { |
3429 | map->stripes[i].dev = | |
3430 | add_missing_dev(root, devid, uuid); | |
3431 | if (!map->stripes[i].dev) { | |
3432 | kfree(map); | |
3433 | free_extent_map(em); | |
3434 | return -EIO; | |
3435 | } | |
3436 | } | |
3437 | map->stripes[i].dev->in_fs_metadata = 1; | |
0b86a832 CM |
3438 | } |
3439 | ||
890871be | 3440 | write_lock(&map_tree->map_tree.lock); |
0b86a832 | 3441 | ret = add_extent_mapping(&map_tree->map_tree, em); |
890871be | 3442 | write_unlock(&map_tree->map_tree.lock); |
b248a415 | 3443 | BUG_ON(ret); |
0b86a832 CM |
3444 | free_extent_map(em); |
3445 | ||
3446 | return 0; | |
3447 | } | |
3448 | ||
3449 | static int fill_device_from_item(struct extent_buffer *leaf, | |
3450 | struct btrfs_dev_item *dev_item, | |
3451 | struct btrfs_device *device) | |
3452 | { | |
3453 | unsigned long ptr; | |
0b86a832 CM |
3454 | |
3455 | device->devid = btrfs_device_id(leaf, dev_item); | |
d6397bae CB |
3456 | device->disk_total_bytes = btrfs_device_total_bytes(leaf, dev_item); |
3457 | device->total_bytes = device->disk_total_bytes; | |
0b86a832 CM |
3458 | device->bytes_used = btrfs_device_bytes_used(leaf, dev_item); |
3459 | device->type = btrfs_device_type(leaf, dev_item); | |
3460 | device->io_align = btrfs_device_io_align(leaf, dev_item); | |
3461 | device->io_width = btrfs_device_io_width(leaf, dev_item); | |
3462 | device->sector_size = btrfs_device_sector_size(leaf, dev_item); | |
0b86a832 CM |
3463 | |
3464 | ptr = (unsigned long)btrfs_device_uuid(dev_item); | |
e17cade2 | 3465 | read_extent_buffer(leaf, device->uuid, ptr, BTRFS_UUID_SIZE); |
0b86a832 | 3466 | |
0b86a832 CM |
3467 | return 0; |
3468 | } | |
3469 | ||
2b82032c YZ |
3470 | static int open_seed_devices(struct btrfs_root *root, u8 *fsid) |
3471 | { | |
3472 | struct btrfs_fs_devices *fs_devices; | |
3473 | int ret; | |
3474 | ||
3475 | mutex_lock(&uuid_mutex); | |
3476 | ||
3477 | fs_devices = root->fs_info->fs_devices->seed; | |
3478 | while (fs_devices) { | |
3479 | if (!memcmp(fs_devices->fsid, fsid, BTRFS_UUID_SIZE)) { | |
3480 | ret = 0; | |
3481 | goto out; | |
3482 | } | |
3483 | fs_devices = fs_devices->seed; | |
3484 | } | |
3485 | ||
3486 | fs_devices = find_fsid(fsid); | |
3487 | if (!fs_devices) { | |
3488 | ret = -ENOENT; | |
3489 | goto out; | |
3490 | } | |
e4404d6e YZ |
3491 | |
3492 | fs_devices = clone_fs_devices(fs_devices); | |
3493 | if (IS_ERR(fs_devices)) { | |
3494 | ret = PTR_ERR(fs_devices); | |
2b82032c YZ |
3495 | goto out; |
3496 | } | |
3497 | ||
97288f2c | 3498 | ret = __btrfs_open_devices(fs_devices, FMODE_READ, |
15916de8 | 3499 | root->fs_info->bdev_holder); |
2b82032c YZ |
3500 | if (ret) |
3501 | goto out; | |
3502 | ||
3503 | if (!fs_devices->seeding) { | |
3504 | __btrfs_close_devices(fs_devices); | |
e4404d6e | 3505 | free_fs_devices(fs_devices); |
2b82032c YZ |
3506 | ret = -EINVAL; |
3507 | goto out; | |
3508 | } | |
3509 | ||
3510 | fs_devices->seed = root->fs_info->fs_devices->seed; | |
3511 | root->fs_info->fs_devices->seed = fs_devices; | |
2b82032c YZ |
3512 | out: |
3513 | mutex_unlock(&uuid_mutex); | |
3514 | return ret; | |
3515 | } | |
3516 | ||
0d81ba5d | 3517 | static int read_one_dev(struct btrfs_root *root, |
0b86a832 CM |
3518 | struct extent_buffer *leaf, |
3519 | struct btrfs_dev_item *dev_item) | |
3520 | { | |
3521 | struct btrfs_device *device; | |
3522 | u64 devid; | |
3523 | int ret; | |
2b82032c | 3524 | u8 fs_uuid[BTRFS_UUID_SIZE]; |
a443755f CM |
3525 | u8 dev_uuid[BTRFS_UUID_SIZE]; |
3526 | ||
0b86a832 | 3527 | devid = btrfs_device_id(leaf, dev_item); |
a443755f CM |
3528 | read_extent_buffer(leaf, dev_uuid, |
3529 | (unsigned long)btrfs_device_uuid(dev_item), | |
3530 | BTRFS_UUID_SIZE); | |
2b82032c YZ |
3531 | read_extent_buffer(leaf, fs_uuid, |
3532 | (unsigned long)btrfs_device_fsid(dev_item), | |
3533 | BTRFS_UUID_SIZE); | |
3534 | ||
3535 | if (memcmp(fs_uuid, root->fs_info->fsid, BTRFS_UUID_SIZE)) { | |
3536 | ret = open_seed_devices(root, fs_uuid); | |
e4404d6e | 3537 | if (ret && !btrfs_test_opt(root, DEGRADED)) |
2b82032c | 3538 | return ret; |
2b82032c YZ |
3539 | } |
3540 | ||
3541 | device = btrfs_find_device(root, devid, dev_uuid, fs_uuid); | |
3542 | if (!device || !device->bdev) { | |
e4404d6e | 3543 | if (!btrfs_test_opt(root, DEGRADED)) |
2b82032c YZ |
3544 | return -EIO; |
3545 | ||
3546 | if (!device) { | |
d397712b CM |
3547 | printk(KERN_WARNING "warning devid %llu missing\n", |
3548 | (unsigned long long)devid); | |
2b82032c YZ |
3549 | device = add_missing_dev(root, devid, dev_uuid); |
3550 | if (!device) | |
3551 | return -ENOMEM; | |
cd02dca5 CM |
3552 | } else if (!device->missing) { |
3553 | /* | |
3554 | * this happens when a device that was properly setup | |
3555 | * in the device info lists suddenly goes bad. | |
3556 | * device->bdev is NULL, and so we have to set | |
3557 | * device->missing to one here | |
3558 | */ | |
3559 | root->fs_info->fs_devices->missing_devices++; | |
3560 | device->missing = 1; | |
2b82032c YZ |
3561 | } |
3562 | } | |
3563 | ||
3564 | if (device->fs_devices != root->fs_info->fs_devices) { | |
3565 | BUG_ON(device->writeable); | |
3566 | if (device->generation != | |
3567 | btrfs_device_generation(leaf, dev_item)) | |
3568 | return -EINVAL; | |
6324fbf3 | 3569 | } |
0b86a832 CM |
3570 | |
3571 | fill_device_from_item(leaf, dev_item, device); | |
3572 | device->dev_root = root->fs_info->dev_root; | |
dfe25020 | 3573 | device->in_fs_metadata = 1; |
2b82032c YZ |
3574 | if (device->writeable) |
3575 | device->fs_devices->total_rw_bytes += device->total_bytes; | |
0b86a832 | 3576 | ret = 0; |
0b86a832 CM |
3577 | return ret; |
3578 | } | |
3579 | ||
e4404d6e | 3580 | int btrfs_read_sys_array(struct btrfs_root *root) |
0b86a832 CM |
3581 | { |
3582 | struct btrfs_super_block *super_copy = &root->fs_info->super_copy; | |
a061fc8d | 3583 | struct extent_buffer *sb; |
0b86a832 | 3584 | struct btrfs_disk_key *disk_key; |
0b86a832 | 3585 | struct btrfs_chunk *chunk; |
84eed90f CM |
3586 | u8 *ptr; |
3587 | unsigned long sb_ptr; | |
3588 | int ret = 0; | |
0b86a832 CM |
3589 | u32 num_stripes; |
3590 | u32 array_size; | |
3591 | u32 len = 0; | |
0b86a832 | 3592 | u32 cur; |
84eed90f | 3593 | struct btrfs_key key; |
0b86a832 | 3594 | |
e4404d6e | 3595 | sb = btrfs_find_create_tree_block(root, BTRFS_SUPER_INFO_OFFSET, |
a061fc8d CM |
3596 | BTRFS_SUPER_INFO_SIZE); |
3597 | if (!sb) | |
3598 | return -ENOMEM; | |
3599 | btrfs_set_buffer_uptodate(sb); | |
4008c04a CM |
3600 | btrfs_set_buffer_lockdep_class(sb, 0); |
3601 | ||
a061fc8d | 3602 | write_extent_buffer(sb, super_copy, 0, BTRFS_SUPER_INFO_SIZE); |
0b86a832 CM |
3603 | array_size = btrfs_super_sys_array_size(super_copy); |
3604 | ||
0b86a832 CM |
3605 | ptr = super_copy->sys_chunk_array; |
3606 | sb_ptr = offsetof(struct btrfs_super_block, sys_chunk_array); | |
3607 | cur = 0; | |
3608 | ||
3609 | while (cur < array_size) { | |
3610 | disk_key = (struct btrfs_disk_key *)ptr; | |
3611 | btrfs_disk_key_to_cpu(&key, disk_key); | |
3612 | ||
a061fc8d | 3613 | len = sizeof(*disk_key); ptr += len; |
0b86a832 CM |
3614 | sb_ptr += len; |
3615 | cur += len; | |
3616 | ||
0d81ba5d | 3617 | if (key.type == BTRFS_CHUNK_ITEM_KEY) { |
0b86a832 | 3618 | chunk = (struct btrfs_chunk *)sb_ptr; |
0d81ba5d | 3619 | ret = read_one_chunk(root, &key, sb, chunk); |
84eed90f CM |
3620 | if (ret) |
3621 | break; | |
0b86a832 CM |
3622 | num_stripes = btrfs_chunk_num_stripes(sb, chunk); |
3623 | len = btrfs_chunk_item_size(num_stripes); | |
3624 | } else { | |
84eed90f CM |
3625 | ret = -EIO; |
3626 | break; | |
0b86a832 CM |
3627 | } |
3628 | ptr += len; | |
3629 | sb_ptr += len; | |
3630 | cur += len; | |
3631 | } | |
a061fc8d | 3632 | free_extent_buffer(sb); |
84eed90f | 3633 | return ret; |
0b86a832 CM |
3634 | } |
3635 | ||
3636 | int btrfs_read_chunk_tree(struct btrfs_root *root) | |
3637 | { | |
3638 | struct btrfs_path *path; | |
3639 | struct extent_buffer *leaf; | |
3640 | struct btrfs_key key; | |
3641 | struct btrfs_key found_key; | |
3642 | int ret; | |
3643 | int slot; | |
3644 | ||
3645 | root = root->fs_info->chunk_root; | |
3646 | ||
3647 | path = btrfs_alloc_path(); | |
3648 | if (!path) | |
3649 | return -ENOMEM; | |
3650 | ||
3651 | /* first we search for all of the device items, and then we | |
3652 | * read in all of the chunk items. This way we can create chunk | |
3653 | * mappings that reference all of the devices that are afound | |
3654 | */ | |
3655 | key.objectid = BTRFS_DEV_ITEMS_OBJECTID; | |
3656 | key.offset = 0; | |
3657 | key.type = 0; | |
3658 | again: | |
3659 | ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); | |
ab59381e ZL |
3660 | if (ret < 0) |
3661 | goto error; | |
d397712b | 3662 | while (1) { |
0b86a832 CM |
3663 | leaf = path->nodes[0]; |
3664 | slot = path->slots[0]; | |
3665 | if (slot >= btrfs_header_nritems(leaf)) { | |
3666 | ret = btrfs_next_leaf(root, path); | |
3667 | if (ret == 0) | |
3668 | continue; | |
3669 | if (ret < 0) | |
3670 | goto error; | |
3671 | break; | |
3672 | } | |
3673 | btrfs_item_key_to_cpu(leaf, &found_key, slot); | |
3674 | if (key.objectid == BTRFS_DEV_ITEMS_OBJECTID) { | |
3675 | if (found_key.objectid != BTRFS_DEV_ITEMS_OBJECTID) | |
3676 | break; | |
3677 | if (found_key.type == BTRFS_DEV_ITEM_KEY) { | |
3678 | struct btrfs_dev_item *dev_item; | |
3679 | dev_item = btrfs_item_ptr(leaf, slot, | |
3680 | struct btrfs_dev_item); | |
0d81ba5d | 3681 | ret = read_one_dev(root, leaf, dev_item); |
2b82032c YZ |
3682 | if (ret) |
3683 | goto error; | |
0b86a832 CM |
3684 | } |
3685 | } else if (found_key.type == BTRFS_CHUNK_ITEM_KEY) { | |
3686 | struct btrfs_chunk *chunk; | |
3687 | chunk = btrfs_item_ptr(leaf, slot, struct btrfs_chunk); | |
3688 | ret = read_one_chunk(root, &found_key, leaf, chunk); | |
2b82032c YZ |
3689 | if (ret) |
3690 | goto error; | |
0b86a832 CM |
3691 | } |
3692 | path->slots[0]++; | |
3693 | } | |
3694 | if (key.objectid == BTRFS_DEV_ITEMS_OBJECTID) { | |
3695 | key.objectid = 0; | |
b3b4aa74 | 3696 | btrfs_release_path(path); |
0b86a832 CM |
3697 | goto again; |
3698 | } | |
0b86a832 CM |
3699 | ret = 0; |
3700 | error: | |
2b82032c | 3701 | btrfs_free_path(path); |
0b86a832 CM |
3702 | return ret; |
3703 | } |