2 * Copyright (C) 2007 Oracle. All rights reserved.
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.
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.
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.
18 #define _XOPEN_SOURCE 600
22 #include <sys/types.h>
24 #include <uuid/uuid.h>
29 #include "transaction.h"
30 #include "print-tree.h"
34 struct btrfs_device
*dev
;
39 struct cache_extent ce
;
46 struct stripe stripes
[];
49 #define map_lookup_size(n) (sizeof(struct map_lookup) + \
50 (sizeof(struct stripe) * (n)))
52 static LIST_HEAD(fs_uuids
);
54 static struct btrfs_device
*__find_device(struct list_head
*head
, u64 devid
)
56 struct btrfs_device
*dev
;
57 struct list_head
*cur
;
59 list_for_each(cur
, head
) {
60 dev
= list_entry(cur
, struct btrfs_device
, dev_list
);
61 if (dev
->devid
== devid
)
67 static struct btrfs_fs_devices
*find_fsid(u8
*fsid
)
69 struct list_head
*cur
;
70 struct btrfs_fs_devices
*fs_devices
;
72 list_for_each(cur
, &fs_uuids
) {
73 fs_devices
= list_entry(cur
, struct btrfs_fs_devices
, list
);
74 if (memcmp(fsid
, fs_devices
->fsid
, BTRFS_FSID_SIZE
) == 0)
80 static int device_list_add(const char *path
,
81 struct btrfs_super_block
*disk_super
,
82 u64 devid
, struct btrfs_fs_devices
**fs_devices_ret
)
84 struct btrfs_device
*device
;
85 struct btrfs_fs_devices
*fs_devices
;
86 u64 found_transid
= btrfs_super_generation(disk_super
);
88 fs_devices
= find_fsid(disk_super
->fsid
);
90 fs_devices
= kmalloc(sizeof(*fs_devices
), GFP_NOFS
);
93 INIT_LIST_HEAD(&fs_devices
->devices
);
94 list_add(&fs_devices
->list
, &fs_uuids
);
95 memcpy(fs_devices
->fsid
, disk_super
->fsid
, BTRFS_FSID_SIZE
);
96 fs_devices
->latest_devid
= devid
;
97 fs_devices
->latest_trans
= found_transid
;
98 fs_devices
->lowest_devid
= (u64
)-1;
101 device
= __find_device(&fs_devices
->devices
, devid
);
104 device
= kzalloc(sizeof(*device
), GFP_NOFS
);
106 /* we can safely leave the fs_devices entry around */
109 device
->devid
= devid
;
110 device
->name
= kstrdup(path
, GFP_NOFS
);
115 list_add(&device
->dev_list
, &fs_devices
->devices
);
118 if (found_transid
> fs_devices
->latest_trans
) {
119 fs_devices
->latest_devid
= devid
;
120 fs_devices
->latest_trans
= found_transid
;
122 if (fs_devices
->lowest_devid
> devid
) {
123 fs_devices
->lowest_devid
= devid
;
124 printk("lowest devid now %Lu\n", devid
);
126 *fs_devices_ret
= fs_devices
;
130 int btrfs_close_devices(struct btrfs_fs_devices
*fs_devices
)
132 struct list_head
*head
= &fs_devices
->devices
;
133 struct list_head
*cur
;
134 struct btrfs_device
*device
;
136 list_for_each(cur
, head
) {
137 device
= list_entry(cur
, struct btrfs_device
, dev_list
);
143 int btrfs_open_devices(struct btrfs_fs_devices
*fs_devices
, int flags
)
146 struct list_head
*head
= &fs_devices
->devices
;
147 struct list_head
*cur
;
148 struct btrfs_device
*device
;
151 list_for_each(cur
, head
) {
152 device
= list_entry(cur
, struct btrfs_device
, dev_list
);
153 fd
= open(device
->name
, flags
);
154 printk("opening %s devid %Lu fd %d\n", device
->name
, device
->devid
, fd
);
159 if (device
->devid
== fs_devices
->latest_devid
)
160 fs_devices
->latest_bdev
= fd
;
161 if (device
->devid
== fs_devices
->lowest_devid
)
162 fs_devices
->lowest_bdev
= fd
;
167 btrfs_close_devices(fs_devices
);
171 int btrfs_scan_one_device(int fd
, const char *path
,
172 struct btrfs_fs_devices
**fs_devices_ret
,
173 u64
*total_devs
, u64 super_offset
)
175 struct btrfs_super_block
*disk_super
;
185 ret
= pread(fd
, buf
, 4096, super_offset
);
190 disk_super
= (struct btrfs_super_block
*)buf
;
191 if (strncmp((char *)(&disk_super
->magic
), BTRFS_MAGIC
,
192 sizeof(disk_super
->magic
))) {
196 devid
= le64_to_cpu(disk_super
->dev_item
.devid
);
197 *total_devs
= btrfs_super_num_devices(disk_super
);
198 printk("found device %Lu on %s\n", devid
, path
);
199 ret
= device_list_add(path
, disk_super
, devid
, fs_devices_ret
);
208 * this uses a pretty simple search, the expectation is that it is
209 * called very infrequently and that a given device has a small number
212 static int find_free_dev_extent(struct btrfs_trans_handle
*trans
,
213 struct btrfs_device
*device
,
214 struct btrfs_path
*path
,
215 u64 num_bytes
, u64
*start
)
217 struct btrfs_key key
;
218 struct btrfs_root
*root
= device
->dev_root
;
219 struct btrfs_dev_extent
*dev_extent
= NULL
;
222 u64 search_start
= 0;
223 u64 search_end
= device
->total_bytes
;
227 struct extent_buffer
*l
;
232 /* FIXME use last free of some kind */
234 key
.objectid
= device
->devid
;
235 key
.offset
= search_start
;
236 key
.type
= BTRFS_DEV_EXTENT_KEY
;
237 ret
= btrfs_search_slot(trans
, root
, &key
, path
, 0, 0);
240 ret
= btrfs_previous_item(root
, path
, 0, key
.type
);
244 btrfs_item_key_to_cpu(l
, &key
, path
->slots
[0]);
247 slot
= path
->slots
[0];
248 if (slot
>= btrfs_header_nritems(l
)) {
249 ret
= btrfs_next_leaf(root
, path
);
256 if (search_start
>= search_end
) {
260 *start
= search_start
;
264 *start
= last_byte
> search_start
?
265 last_byte
: search_start
;
266 if (search_end
<= *start
) {
272 btrfs_item_key_to_cpu(l
, &key
, slot
);
274 if (key
.objectid
< device
->devid
)
277 if (key
.objectid
> device
->devid
)
280 if (key
.offset
>= search_start
&& key
.offset
> last_byte
&&
282 if (last_byte
< search_start
)
283 last_byte
= search_start
;
284 hole_size
= key
.offset
- last_byte
;
285 if (key
.offset
> last_byte
&&
286 hole_size
>= num_bytes
) {
291 if (btrfs_key_type(&key
) != BTRFS_DEV_EXTENT_KEY
) {
296 dev_extent
= btrfs_item_ptr(l
, slot
, struct btrfs_dev_extent
);
297 last_byte
= key
.offset
+ btrfs_dev_extent_length(l
, dev_extent
);
303 /* we have to make sure we didn't find an extent that has already
304 * been allocated by the map tree or the original allocation
306 btrfs_release_path(root
, path
);
307 BUG_ON(*start
< search_start
);
309 if (*start
+ num_bytes
> search_end
) {
313 /* check for pending inserts here */
317 btrfs_release_path(root
, path
);
321 int btrfs_alloc_dev_extent(struct btrfs_trans_handle
*trans
,
322 struct btrfs_device
*device
,
323 u64 owner
, u64 num_bytes
, u64
*start
)
326 struct btrfs_path
*path
;
327 struct btrfs_root
*root
= device
->dev_root
;
328 struct btrfs_dev_extent
*extent
;
329 struct extent_buffer
*leaf
;
330 struct btrfs_key key
;
332 path
= btrfs_alloc_path();
336 ret
= find_free_dev_extent(trans
, device
, path
, num_bytes
, start
);
341 key
.objectid
= device
->devid
;
343 key
.type
= BTRFS_DEV_EXTENT_KEY
;
344 ret
= btrfs_insert_empty_item(trans
, root
, path
, &key
,
348 leaf
= path
->nodes
[0];
349 extent
= btrfs_item_ptr(leaf
, path
->slots
[0],
350 struct btrfs_dev_extent
);
351 btrfs_set_dev_extent_owner(leaf
, extent
, owner
);
352 btrfs_set_dev_extent_length(leaf
, extent
, num_bytes
);
353 btrfs_mark_buffer_dirty(leaf
);
355 btrfs_free_path(path
);
359 static int find_next_chunk(struct btrfs_root
*root
, u64
*objectid
)
361 struct btrfs_path
*path
;
363 struct btrfs_key key
;
364 struct btrfs_key found_key
;
366 path
= btrfs_alloc_path();
369 key
.objectid
= (u64
)-1;
370 key
.offset
= (u64
)-1;
371 key
.type
= BTRFS_CHUNK_ITEM_KEY
;
373 ret
= btrfs_search_slot(NULL
, root
, &key
, path
, 0, 0);
379 ret
= btrfs_previous_item(root
, path
, 0, BTRFS_CHUNK_ITEM_KEY
);
383 btrfs_item_key_to_cpu(path
->nodes
[0], &found_key
,
385 *objectid
= found_key
.objectid
+ found_key
.offset
;
389 btrfs_free_path(path
);
393 static int find_next_devid(struct btrfs_root
*root
, struct btrfs_path
*path
,
397 struct btrfs_key key
;
398 struct btrfs_key found_key
;
400 key
.objectid
= BTRFS_DEV_ITEMS_OBJECTID
;
401 key
.type
= BTRFS_DEV_ITEM_KEY
;
402 key
.offset
= (u64
)-1;
404 ret
= btrfs_search_slot(NULL
, root
, &key
, path
, 0, 0);
410 ret
= btrfs_previous_item(root
, path
, BTRFS_DEV_ITEMS_OBJECTID
,
415 btrfs_item_key_to_cpu(path
->nodes
[0], &found_key
,
417 *objectid
= found_key
.offset
+ 1;
421 btrfs_release_path(root
, path
);
426 * the device information is stored in the chunk root
427 * the btrfs_device struct should be fully filled in
429 int btrfs_add_device(struct btrfs_trans_handle
*trans
,
430 struct btrfs_root
*root
,
431 struct btrfs_device
*device
)
434 struct btrfs_path
*path
;
435 struct btrfs_dev_item
*dev_item
;
436 struct extent_buffer
*leaf
;
437 struct btrfs_key key
;
441 root
= root
->fs_info
->chunk_root
;
443 path
= btrfs_alloc_path();
447 ret
= find_next_devid(root
, path
, &free_devid
);
451 key
.objectid
= BTRFS_DEV_ITEMS_OBJECTID
;
452 key
.type
= BTRFS_DEV_ITEM_KEY
;
453 key
.offset
= free_devid
;
455 ret
= btrfs_insert_empty_item(trans
, root
, path
, &key
,
460 leaf
= path
->nodes
[0];
461 dev_item
= btrfs_item_ptr(leaf
, path
->slots
[0], struct btrfs_dev_item
);
463 device
->devid
= free_devid
;
464 btrfs_set_device_id(leaf
, dev_item
, device
->devid
);
465 btrfs_set_device_type(leaf
, dev_item
, device
->type
);
466 btrfs_set_device_io_align(leaf
, dev_item
, device
->io_align
);
467 btrfs_set_device_io_width(leaf
, dev_item
, device
->io_width
);
468 btrfs_set_device_sector_size(leaf
, dev_item
, device
->sector_size
);
469 btrfs_set_device_total_bytes(leaf
, dev_item
, device
->total_bytes
);
470 btrfs_set_device_bytes_used(leaf
, dev_item
, device
->bytes_used
);
472 ptr
= (unsigned long)btrfs_device_uuid(dev_item
);
473 write_extent_buffer(leaf
, device
->uuid
, ptr
, BTRFS_DEV_UUID_SIZE
);
474 btrfs_mark_buffer_dirty(leaf
);
478 btrfs_free_path(path
);
482 int btrfs_update_device(struct btrfs_trans_handle
*trans
,
483 struct btrfs_device
*device
)
486 struct btrfs_path
*path
;
487 struct btrfs_root
*root
;
488 struct btrfs_dev_item
*dev_item
;
489 struct extent_buffer
*leaf
;
490 struct btrfs_key key
;
492 root
= device
->dev_root
->fs_info
->chunk_root
;
494 path
= btrfs_alloc_path();
498 key
.objectid
= BTRFS_DEV_ITEMS_OBJECTID
;
499 key
.type
= BTRFS_DEV_ITEM_KEY
;
500 key
.offset
= device
->devid
;
502 ret
= btrfs_search_slot(trans
, root
, &key
, path
, 0, 1);
511 leaf
= path
->nodes
[0];
512 dev_item
= btrfs_item_ptr(leaf
, path
->slots
[0], struct btrfs_dev_item
);
514 btrfs_set_device_id(leaf
, dev_item
, device
->devid
);
515 btrfs_set_device_type(leaf
, dev_item
, device
->type
);
516 btrfs_set_device_io_align(leaf
, dev_item
, device
->io_align
);
517 btrfs_set_device_io_width(leaf
, dev_item
, device
->io_width
);
518 btrfs_set_device_sector_size(leaf
, dev_item
, device
->sector_size
);
519 btrfs_set_device_total_bytes(leaf
, dev_item
, device
->total_bytes
);
520 btrfs_set_device_bytes_used(leaf
, dev_item
, device
->bytes_used
);
521 btrfs_mark_buffer_dirty(leaf
);
524 btrfs_free_path(path
);
528 int btrfs_add_system_chunk(struct btrfs_trans_handle
*trans
,
529 struct btrfs_root
*root
,
530 struct btrfs_key
*key
,
531 struct btrfs_chunk
*chunk
, int item_size
)
533 struct btrfs_super_block
*super_copy
= &root
->fs_info
->super_copy
;
534 struct btrfs_disk_key disk_key
;
538 array_size
= btrfs_super_sys_array_size(super_copy
);
539 if (array_size
+ item_size
> BTRFS_SYSTEM_CHUNK_ARRAY_SIZE
)
542 ptr
= super_copy
->sys_chunk_array
+ array_size
;
543 btrfs_cpu_key_to_disk(&disk_key
, key
);
544 memcpy(ptr
, &disk_key
, sizeof(disk_key
));
545 ptr
+= sizeof(disk_key
);
546 memcpy(ptr
, chunk
, item_size
);
547 item_size
+= sizeof(disk_key
);
548 btrfs_set_super_sys_array_size(super_copy
, array_size
+ item_size
);
552 int btrfs_alloc_chunk(struct btrfs_trans_handle
*trans
,
553 struct btrfs_root
*extent_root
, u64
*start
,
554 u64
*num_bytes
, u64 type
)
557 struct btrfs_fs_info
*info
= extent_root
->fs_info
;
558 struct btrfs_root
*chunk_root
= extent_root
->fs_info
->chunk_root
;
559 struct btrfs_stripe
*stripes
;
560 struct btrfs_device
*device
= NULL
;
561 struct btrfs_chunk
*chunk
;
562 struct list_head private_devs
;
563 struct list_head
*dev_list
= &extent_root
->fs_info
->fs_devices
->devices
;
564 struct list_head
*cur
;
565 struct map_lookup
*map
;
567 u64 calc_size
= 8 * 1024 * 1024;
574 int stripe_len
= 64 * 1024;
575 struct btrfs_key key
;
577 if (list_empty(dev_list
))
580 if (type
& BTRFS_BLOCK_GROUP_RAID0
)
581 num_stripes
= btrfs_super_num_devices(&info
->super_copy
);
582 if (type
& BTRFS_BLOCK_GROUP_DATA
)
583 stripe_len
= 64 * 1024;
584 if (type
& (BTRFS_BLOCK_GROUP_METADATA
| BTRFS_BLOCK_GROUP_SYSTEM
))
585 stripe_len
= 32 * 1024;
587 INIT_LIST_HEAD(&private_devs
);
588 cur
= dev_list
->next
;
590 /* build a private list of devices we will allocate from */
591 while(index
< num_stripes
) {
592 device
= list_entry(cur
, struct btrfs_device
, dev_list
);
593 avail
= device
->total_bytes
- device
->bytes_used
;
595 if (avail
> max_avail
)
597 if (avail
>= calc_size
) {
598 list_move_tail(&device
->dev_list
, &private_devs
);
604 if (index
< num_stripes
) {
605 list_splice(&private_devs
, dev_list
);
606 if (!looped
&& max_avail
> 0) {
608 calc_size
= max_avail
;
614 ret
= find_next_chunk(chunk_root
, &key
.objectid
);
618 chunk
= kmalloc(btrfs_chunk_item_size(num_stripes
), GFP_NOFS
);
622 map
= kmalloc(map_lookup_size(num_stripes
), GFP_NOFS
);
628 stripes
= &chunk
->stripe
;
630 *num_bytes
= calc_size
* num_stripes
;
632 while(index
< num_stripes
) {
633 BUG_ON(list_empty(&private_devs
));
634 cur
= private_devs
.next
;
635 device
= list_entry(cur
, struct btrfs_device
, dev_list
);
636 list_move_tail(&device
->dev_list
, dev_list
);
638 ret
= btrfs_alloc_dev_extent(trans
, device
,
640 calc_size
, &dev_offset
);
642 printk("alloc chunk size %Lu from dev %Lu\n", calc_size
, device
->devid
);
643 device
->bytes_used
+= calc_size
;
644 ret
= btrfs_update_device(trans
, device
);
647 map
->stripes
[index
].dev
= device
;
648 map
->stripes
[index
].physical
= dev_offset
;
649 btrfs_set_stack_stripe_devid(stripes
+ index
, device
->devid
);
650 btrfs_set_stack_stripe_offset(stripes
+ index
, dev_offset
);
651 physical
= dev_offset
;
654 BUG_ON(!list_empty(&private_devs
));
656 /* key.objectid was set above */
657 key
.offset
= *num_bytes
;
658 key
.type
= BTRFS_CHUNK_ITEM_KEY
;
659 btrfs_set_stack_chunk_owner(chunk
, extent_root
->root_key
.objectid
);
660 btrfs_set_stack_chunk_stripe_len(chunk
, stripe_len
);
661 btrfs_set_stack_chunk_type(chunk
, type
);
662 btrfs_set_stack_chunk_num_stripes(chunk
, num_stripes
);
663 btrfs_set_stack_chunk_io_align(chunk
, stripe_len
);
664 btrfs_set_stack_chunk_io_width(chunk
, stripe_len
);
665 btrfs_set_stack_chunk_sector_size(chunk
, extent_root
->sectorsize
);
666 map
->sector_size
= extent_root
->sectorsize
;
667 map
->stripe_len
= stripe_len
;
668 map
->io_align
= stripe_len
;
669 map
->io_width
= stripe_len
;
671 map
->num_stripes
= num_stripes
;
673 ret
= btrfs_insert_item(trans
, chunk_root
, &key
, chunk
,
674 btrfs_chunk_item_size(num_stripes
));
676 *start
= key
.objectid
;
678 map
->ce
.start
= key
.objectid
;
679 map
->ce
.size
= key
.offset
;
681 ret
= insert_existing_cache_extent(
682 &extent_root
->fs_info
->mapping_tree
.cache_tree
,
690 void btrfs_mapping_init(struct btrfs_mapping_tree
*tree
)
692 cache_tree_init(&tree
->cache_tree
);
695 int btrfs_map_block(struct btrfs_mapping_tree
*map_tree
,
696 u64 logical
, u64
*phys
, u64
*length
,
697 struct btrfs_device
**dev
)
699 struct cache_extent
*ce
;
700 struct map_lookup
*map
;
706 ce
= find_first_cache_extent(&map_tree
->cache_tree
, logical
);
708 BUG_ON(ce
->start
> logical
|| ce
->start
+ ce
->size
< logical
);
709 map
= container_of(ce
, struct map_lookup
, ce
);
710 offset
= logical
- ce
->start
;
714 * stripe_nr counts the total number of stripes we have to stride
715 * to get to this block
717 stripe_nr
= stripe_nr
/ map
->stripe_len
;
719 stripe_offset
= stripe_nr
* map
->stripe_len
;
720 BUG_ON(offset
< stripe_offset
);
722 /* stripe_offset is the offset of this block in its stripe*/
723 stripe_offset
= offset
- stripe_offset
;
726 * after this do_div call, stripe_nr is the number of stripes
727 * on this device we have to walk to find the data, and
728 * stripe_index is the number of our device in the stripe array
730 stripe_index
= stripe_nr
% map
->num_stripes
;
731 stripe_nr
= stripe_nr
/ map
->num_stripes
;
733 BUG_ON(stripe_index
>= map
->num_stripes
);
735 *phys
= map
->stripes
[stripe_index
].physical
+ stripe_offset
+
736 stripe_nr
* map
->stripe_len
;
738 if (map
->type
& BTRFS_BLOCK_GROUP_RAID0
) {
739 /* we limit the length of each bio to what fits in a stripe */
740 *length
= min_t(u64
, ce
->size
- offset
,
741 map
->stripe_len
- stripe_offset
);
743 *length
= ce
->size
- offset
;
745 *dev
= map
->stripes
[stripe_index
].dev
;
749 struct btrfs_device
*btrfs_find_device(struct btrfs_root
*root
, u64 devid
)
751 struct list_head
*head
= &root
->fs_info
->fs_devices
->devices
;
753 return __find_device(head
, devid
);
756 static int read_one_chunk(struct btrfs_root
*root
, struct btrfs_key
*key
,
757 struct extent_buffer
*leaf
,
758 struct btrfs_chunk
*chunk
)
760 struct btrfs_mapping_tree
*map_tree
= &root
->fs_info
->mapping_tree
;
761 struct map_lookup
*map
;
762 struct cache_extent
*ce
;
770 logical
= key
->objectid
;
771 length
= key
->offset
;
772 ce
= find_first_cache_extent(&map_tree
->cache_tree
, logical
);
774 /* already mapped? */
775 if (ce
&& ce
->start
<= logical
&& ce
->start
+ ce
->size
> logical
) {
779 num_stripes
= btrfs_chunk_num_stripes(leaf
, chunk
);
780 map
= kmalloc(map_lookup_size(num_stripes
), GFP_NOFS
);
784 map
->ce
.start
= logical
;
785 map
->ce
.size
= length
;
787 map
->num_stripes
= num_stripes
;
788 map
->io_width
= btrfs_chunk_io_width(leaf
, chunk
);
789 map
->io_align
= btrfs_chunk_io_align(leaf
, chunk
);
790 map
->sector_size
= btrfs_chunk_sector_size(leaf
, chunk
);
791 map
->stripe_len
= btrfs_chunk_stripe_len(leaf
, chunk
);
792 map
->type
= btrfs_chunk_type(leaf
, chunk
);
793 for (i
= 0; i
< num_stripes
; i
++) {
794 map
->stripes
[i
].physical
=
795 btrfs_stripe_offset_nr(leaf
, chunk
, i
);
796 devid
= btrfs_stripe_devid_nr(leaf
, chunk
, i
);
797 map
->stripes
[i
].dev
= btrfs_find_device(root
, devid
);
798 if (!map
->stripes
[i
].dev
) {
804 ret
= insert_existing_cache_extent(&map_tree
->cache_tree
, &map
->ce
);
810 static int fill_device_from_item(struct extent_buffer
*leaf
,
811 struct btrfs_dev_item
*dev_item
,
812 struct btrfs_device
*device
)
816 device
->devid
= btrfs_device_id(leaf
, dev_item
);
817 device
->total_bytes
= btrfs_device_total_bytes(leaf
, dev_item
);
818 device
->bytes_used
= btrfs_device_bytes_used(leaf
, dev_item
);
819 device
->type
= btrfs_device_type(leaf
, dev_item
);
820 device
->io_align
= btrfs_device_io_align(leaf
, dev_item
);
821 device
->io_width
= btrfs_device_io_width(leaf
, dev_item
);
822 device
->sector_size
= btrfs_device_sector_size(leaf
, dev_item
);
824 ptr
= (unsigned long)btrfs_device_uuid(dev_item
);
825 read_extent_buffer(leaf
, device
->uuid
, ptr
, BTRFS_DEV_UUID_SIZE
);
830 static int read_one_dev(struct btrfs_root
*root
,
831 struct extent_buffer
*leaf
,
832 struct btrfs_dev_item
*dev_item
)
834 struct btrfs_device
*device
;
838 devid
= btrfs_device_id(leaf
, dev_item
);
839 device
= btrfs_find_device(root
, devid
);
841 printk("warning devid %Lu not found already\n", devid
);
842 device
= kmalloc(sizeof(*device
), GFP_NOFS
);
845 list_add(&device
->dev_list
,
846 &root
->fs_info
->fs_devices
->devices
);
849 fill_device_from_item(leaf
, dev_item
, device
);
850 device
->dev_root
= root
->fs_info
->dev_root
;
854 int btrfs_read_super_device(struct btrfs_root
*root
, struct extent_buffer
*buf
)
856 struct btrfs_dev_item
*dev_item
;
858 dev_item
= (struct btrfs_dev_item
*)offsetof(struct btrfs_super_block
,
860 return read_one_dev(root
, buf
, dev_item
);
863 int btrfs_read_sys_array(struct btrfs_root
*root
)
865 struct btrfs_super_block
*super_copy
= &root
->fs_info
->super_copy
;
866 struct extent_buffer
*sb
= root
->fs_info
->sb_buffer
;
867 struct btrfs_disk_key
*disk_key
;
868 struct btrfs_chunk
*chunk
;
869 struct btrfs_key key
;
874 unsigned long sb_ptr
;
878 array_size
= btrfs_super_sys_array_size(super_copy
);
881 * we do this loop twice, once for the device items and
882 * once for all of the chunks. This way there are device
883 * structs filled in for every chunk
885 ptr
= super_copy
->sys_chunk_array
;
886 sb_ptr
= offsetof(struct btrfs_super_block
, sys_chunk_array
);
889 while (cur
< array_size
) {
890 disk_key
= (struct btrfs_disk_key
*)ptr
;
891 btrfs_disk_key_to_cpu(&key
, disk_key
);
893 len
= sizeof(*disk_key
);
898 if (key
.type
== BTRFS_CHUNK_ITEM_KEY
) {
899 chunk
= (struct btrfs_chunk
*)sb_ptr
;
900 ret
= read_one_chunk(root
, &key
, sb
, chunk
);
902 num_stripes
= btrfs_chunk_num_stripes(sb
, chunk
);
903 len
= btrfs_chunk_item_size(num_stripes
);
914 int btrfs_read_chunk_tree(struct btrfs_root
*root
)
916 struct btrfs_path
*path
;
917 struct extent_buffer
*leaf
;
918 struct btrfs_key key
;
919 struct btrfs_key found_key
;
923 root
= root
->fs_info
->chunk_root
;
925 path
= btrfs_alloc_path();
929 /* first we search for all of the device items, and then we
930 * read in all of the chunk items. This way we can create chunk
931 * mappings that reference all of the devices that are afound
933 key
.objectid
= BTRFS_DEV_ITEMS_OBJECTID
;
937 ret
= btrfs_search_slot(NULL
, root
, &key
, path
, 0, 0);
939 leaf
= path
->nodes
[0];
940 slot
= path
->slots
[0];
941 if (slot
>= btrfs_header_nritems(leaf
)) {
942 ret
= btrfs_next_leaf(root
, path
);
949 btrfs_item_key_to_cpu(leaf
, &found_key
, slot
);
950 if (key
.objectid
== BTRFS_DEV_ITEMS_OBJECTID
) {
951 if (found_key
.objectid
!= BTRFS_DEV_ITEMS_OBJECTID
)
953 if (found_key
.type
== BTRFS_DEV_ITEM_KEY
) {
954 struct btrfs_dev_item
*dev_item
;
955 dev_item
= btrfs_item_ptr(leaf
, slot
,
956 struct btrfs_dev_item
);
957 ret
= read_one_dev(root
, leaf
, dev_item
);
960 } else if (found_key
.type
== BTRFS_CHUNK_ITEM_KEY
) {
961 struct btrfs_chunk
*chunk
;
962 chunk
= btrfs_item_ptr(leaf
, slot
, struct btrfs_chunk
);
963 ret
= read_one_chunk(root
, &found_key
, leaf
, chunk
);
967 if (key
.objectid
== BTRFS_DEV_ITEMS_OBJECTID
) {
969 btrfs_release_path(root
, path
);
973 btrfs_free_path(path
);