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.
19 #define _XOPEN_SOURCE 500
21 #include <sys/ioctl.h>
22 #include <sys/mount.h>
26 #include <sys/types.h>
30 #include <uuid/uuid.h>
31 #include "radix-tree.h"
33 #include "kerncompat.h"
36 #include "transaction.h"
39 #define BLKGETSIZE64 0
40 static inline int ioctl(int fd, int define, u64 *size) { return 0; }
43 static int __make_root_dir(struct btrfs_trans_handle *trans,
44 struct btrfs_root *root, u64 objectid)
48 struct btrfs_key inode_map;
49 struct btrfs_inode_item inode_item;
54 inode_map.objectid = objectid;
55 btrfs_set_key_type(&inode_map, BTRFS_INODE_ITEM_KEY);
58 memset(&inode_item, 0, sizeof(inode_item));
59 btrfs_set_inode_generation(&inode_item, root->fs_info->generation);
60 btrfs_set_inode_size(&inode_item, 6);
61 btrfs_set_inode_nlink(&inode_item, 1);
62 btrfs_set_inode_nblocks(&inode_item, 1);
63 btrfs_set_inode_mode(&inode_item, S_IFDIR | 0555);
65 if (root->fs_info->tree_root == root)
66 btrfs_set_super_root_dir(root->fs_info->disk_super, objectid);
68 ret = btrfs_insert_inode(trans, root, objectid, &inode_item);
71 ret = btrfs_insert_dir_item(trans, root, buf, 1, objectid,
72 &inode_map, BTRFS_FT_DIR);
75 ret = btrfs_insert_dir_item(trans, root, buf, 2, objectid,
76 &inode_map, BTRFS_FT_DIR);
79 btrfs_set_root_dirid(&root->root_item, objectid);
85 static int make_block_groups(struct btrfs_trans_handle *trans,
86 struct btrfs_root *root)
93 struct btrfs_block_group_cache *cache;
95 root = root->fs_info->extent_root;
97 /* first we bootstrap the things into cache */
98 group_size = BTRFS_BLOCK_GROUP_SIZE;
99 cache = malloc(sizeof(*cache));
100 cache->key.objectid = 0;
101 cache->key.offset = group_size;
102 btrfs_set_key_type(&cache->key, BTRFS_BLOCK_GROUP_ITEM_KEY);
104 memset(&cache->item, 0, sizeof(cache->item));
105 btrfs_set_block_group_used(&cache->item,
106 btrfs_super_bytes_used(root->fs_info->disk_super));
107 ret = radix_tree_insert(&root->fs_info->block_group_radix,
108 group_size - 1, (void *)cache);
111 total_bytes = btrfs_super_total_bytes(root->fs_info->disk_super);
112 cur_start = group_size;
113 while(cur_start < total_bytes) {
114 cache = malloc(sizeof(*cache));
115 cache->key.objectid = cur_start;
116 cache->key.offset = group_size;
117 btrfs_set_key_type(&cache->key, BTRFS_BLOCK_GROUP_ITEM_KEY);
118 memset(&cache->item, 0, sizeof(cache->item));
120 cache->item.flags |= BTRFS_BLOCK_GROUP_DATA;
122 ret = radix_tree_insert(&root->fs_info->block_group_radix,
123 cur_start + group_size - 1,
126 cur_start += group_size;
129 /* then insert all the items */
131 while(cur_start < total_bytes) {
132 cache = radix_tree_lookup(&root->fs_info->block_group_radix,
133 cur_start + group_size - 1);
135 ret = btrfs_insert_block_group(trans, root, &cache->key,
138 cur_start += group_size;
143 static int make_root_dir(int fd) {
144 struct btrfs_root *root;
145 struct btrfs_super_block super;
146 struct btrfs_trans_handle *trans;
148 struct btrfs_key location;
150 root = open_ctree_fd(fd, &super);
153 fprintf(stderr, "ctree init failed\n");
156 trans = btrfs_start_transaction(root, 1);
157 ret = make_block_groups(trans, root);
158 ret = __make_root_dir(trans, root->fs_info->tree_root,
159 BTRFS_ROOT_TREE_DIR_OBJECTID);
162 ret = __make_root_dir(trans, root, BTRFS_FIRST_FREE_OBJECTID);
165 memcpy(&location, &root->fs_info->fs_root->root_key, sizeof(location));
166 location.offset = (u64)-1;
167 ret = btrfs_insert_dir_item(trans, root->fs_info->tree_root,
169 btrfs_super_root_dir(root->fs_info->disk_super),
170 &location, BTRFS_FT_DIR);
173 btrfs_commit_transaction(trans, root, root->fs_info->disk_super);
174 ret = close_ctree(root, &super);
179 int mkfs(int fd, char *pathname, u64 num_bytes, u32 nodesize, u32 leafsize,
182 struct btrfs_super_block super;
183 struct btrfs_leaf *empty_leaf;
184 struct btrfs_root_item root_item;
185 struct btrfs_item item;
186 struct btrfs_extent_item extent_item;
187 struct btrfs_inode_item *inode_item;
191 u32 start_block = BTRFS_SUPER_INFO_OFFSET;
192 u32 first_free = BTRFS_SUPER_INFO_OFFSET + sectorsize;
194 btrfs_set_super_generation(&super, 1);
195 btrfs_set_super_bytenr(&super, start_block);
196 btrfs_set_super_root_level(&super, 0);
197 btrfs_set_super_root(&super, first_free);
198 strcpy((char *)(&super.magic), BTRFS_MAGIC);
200 printf("blocksize is %d\n", leafsize);
201 btrfs_set_super_sectorsize(&super, sectorsize);
202 btrfs_set_super_leafsize(&super, leafsize);
203 btrfs_set_super_nodesize(&super, nodesize);
205 num_bytes = (num_bytes / sectorsize) * sectorsize;
206 btrfs_set_super_total_bytes(&super, num_bytes);
207 btrfs_set_super_bytes_used(&super, start_block + 3 * leafsize +
209 uuid_generate(super.fsid);
211 block = malloc(sectorsize);
212 memset(block, 0, sectorsize);
213 BUG_ON(sizeof(super) > sectorsize);
214 memcpy(block, &super, sizeof(super));
215 ret = pwrite(fd, block, sectorsize, BTRFS_SUPER_INFO_OFFSET);
216 BUG_ON(ret != sectorsize);
218 /* create the tree of root objects */
219 empty_leaf = malloc(leafsize);
220 memset(empty_leaf, 0, leafsize);
221 btrfs_set_header_bytenr(&empty_leaf->header, first_free);
222 btrfs_set_header_nritems(&empty_leaf->header, 2);
223 btrfs_set_header_generation(&empty_leaf->header, 0);
224 btrfs_set_header_owner(&empty_leaf->header, BTRFS_ROOT_TREE_OBJECTID);
225 memcpy(empty_leaf->header.fsid, super.fsid,
226 sizeof(empty_leaf->header.fsid));
228 /* create the items for the root tree */
229 inode_item = &root_item.inode;
230 memset(inode_item, 0, sizeof(*inode_item));
231 btrfs_set_inode_generation(inode_item, 1);
232 btrfs_set_inode_size(inode_item, 3);
233 btrfs_set_inode_nlink(inode_item, 1);
234 btrfs_set_inode_nblocks(inode_item, 1);
235 btrfs_set_inode_mode(inode_item, S_IFDIR | 0755);
237 // memset(&root_item, 0, sizeof(root_item));
238 btrfs_set_root_dirid(&root_item, 0);
239 btrfs_set_root_refs(&root_item, 1);
240 btrfs_set_disk_key_offset(&item.key, 0);
241 btrfs_set_item_size(&item, sizeof(root_item));
242 btrfs_set_disk_key_type(&item.key, BTRFS_ROOT_ITEM_KEY);
244 itemoff = __BTRFS_LEAF_DATA_SIZE(leafsize) - sizeof(root_item);
245 btrfs_set_root_bytenr(&root_item, first_free + leafsize);
247 btrfs_set_item_offset(&item, itemoff);
248 btrfs_set_disk_key_objectid(&item.key, BTRFS_EXTENT_TREE_OBJECTID);
249 memcpy(empty_leaf->items, &item, sizeof(item));
250 memcpy(btrfs_leaf_data(empty_leaf) + itemoff,
251 &root_item, sizeof(root_item));
253 btrfs_set_root_bytenr(&root_item, first_free + leafsize * 2);
254 btrfs_set_root_bytes_used(&root_item, 1);
255 itemoff = itemoff - sizeof(root_item);
256 btrfs_set_item_offset(&item, itemoff);
257 btrfs_set_disk_key_objectid(&item.key, BTRFS_FS_TREE_OBJECTID);
258 memcpy(empty_leaf->items + 1, &item, sizeof(item));
259 memcpy(btrfs_leaf_data(empty_leaf) + itemoff,
260 &root_item, sizeof(root_item));
261 ret = pwrite(fd, empty_leaf, leafsize, first_free);
263 /* create the items for the extent tree */
264 btrfs_set_header_bytenr(&empty_leaf->header, first_free + leafsize);
265 btrfs_set_header_nritems(&empty_leaf->header, 4);
267 /* item1, reserve blocks 0-16 */
268 btrfs_set_disk_key_objectid(&item.key, 0);
269 btrfs_set_disk_key_offset(&item.key, first_free);
270 btrfs_set_disk_key_type(&item.key, 0);
271 btrfs_set_disk_key_type(&item.key, BTRFS_EXTENT_ITEM_KEY);
272 itemoff = __BTRFS_LEAF_DATA_SIZE(leafsize) -
273 sizeof(struct btrfs_extent_item);
274 btrfs_set_item_offset(&item, itemoff);
275 btrfs_set_item_size(&item, sizeof(struct btrfs_extent_item));
276 btrfs_set_extent_refs(&extent_item, 1);
277 btrfs_set_extent_owner(&extent_item, BTRFS_ROOT_TREE_OBJECTID);
278 memcpy(empty_leaf->items, &item, sizeof(item));
279 memcpy(btrfs_leaf_data(empty_leaf) + btrfs_item_offset(&item),
280 &extent_item, btrfs_item_size(&item));
282 /* item2, give block 17 to the root */
283 btrfs_set_disk_key_objectid(&item.key, first_free);
284 btrfs_set_disk_key_offset(&item.key, leafsize);
285 itemoff = itemoff - sizeof(struct btrfs_extent_item);
286 btrfs_set_item_offset(&item, itemoff);
287 memcpy(empty_leaf->items + 1, &item, sizeof(item));
288 memcpy(btrfs_leaf_data(empty_leaf) + btrfs_item_offset(&item),
289 &extent_item, btrfs_item_size(&item));
291 /* item3, give block 18 to the extent root */
292 btrfs_set_disk_key_objectid(&item.key, first_free + leafsize);
293 btrfs_set_disk_key_offset(&item.key, leafsize);
294 itemoff = itemoff - sizeof(struct btrfs_extent_item);
295 btrfs_set_item_offset(&item, itemoff);
296 memcpy(empty_leaf->items + 2, &item, sizeof(item));
297 memcpy(btrfs_leaf_data(empty_leaf) + btrfs_item_offset(&item),
298 &extent_item, btrfs_item_size(&item));
300 /* item4, give block 19 to the FS root */
301 btrfs_set_disk_key_objectid(&item.key, first_free + leafsize * 2);
302 btrfs_set_disk_key_offset(&item.key, leafsize);
303 itemoff = itemoff - sizeof(struct btrfs_extent_item);
304 btrfs_set_item_offset(&item, itemoff);
305 memcpy(empty_leaf->items + 3, &item, sizeof(item));
306 memcpy(btrfs_leaf_data(empty_leaf) + btrfs_item_offset(&item),
307 &extent_item, btrfs_item_size(&item));
308 ret = pwrite(fd, empty_leaf, leafsize, first_free + leafsize);
312 /* finally create the FS root */
313 btrfs_set_header_bytenr(&empty_leaf->header, first_free + leafsize * 2);
314 btrfs_set_header_nritems(&empty_leaf->header, 0);
315 ret = pwrite(fd, empty_leaf, leafsize, first_free + leafsize * 2);
321 u64 device_size(int fd, struct stat *st)
324 if (S_ISREG(st->st_mode)) {
327 if (!S_ISBLK(st->st_mode)) {
330 if (ioctl(fd, BLKGETSIZE64, &size) >= 0) {
336 static void print_usage(void)
338 fprintf(stderr, "usage: mkfs.btrfs [ -l leafsize ] [ -n nodesize] dev [ blocks ]\n");
342 int main(int ac, char **av)
350 u32 leafsize = 8 * 1024;
351 u32 sectorsize = 4096;
352 u32 nodesize = 8 * 1024;
353 char *buf = malloc(sectorsize);
360 c = getopt(ac, av, "l:n:");
365 leafsize = atol(optarg);
368 nodesize = atol(optarg);
374 if (leafsize < sectorsize || (leafsize & (sectorsize - 1))) {
375 fprintf(stderr, "Illegal leafsize %u\n", leafsize);
378 if (nodesize < sectorsize || (nodesize & (sectorsize - 1))) {
379 fprintf(stderr, "Illegal nodesize %u\n", nodesize);
386 block_count = atol(av[optind + 1]);
388 fprintf(stderr, "error finding block count\n");
395 fd = open(file, O_RDWR);
397 fprintf(stderr, "unable to open %s\n", file);
400 ret = fstat(fd, &st);
402 fprintf(stderr, "unable to stat %s\n", file);
405 if (block_count == 0) {
406 block_count = device_size(fd, &st);
407 if (block_count == 0) {
408 fprintf(stderr, "unable to find %s size\n", file);
411 block_count /= sectorsize;
413 if (block_count < 256) {
414 fprintf(stderr, "device %s is too small\n", file);
417 block_count = block_count * sectorsize;
418 memset(buf, 0, sectorsize);
419 for(i = 0; i < 64; i++) {
420 ret = write(fd, buf, sectorsize);
421 if (ret != sectorsize) {
422 fprintf(stderr, "unable to zero fill device\n");
426 realpath_name = realpath(file, NULL);
427 ret = mkfs(fd, realpath_name, block_count, nodesize, leafsize,
430 fprintf(stderr, "error during mkfs %d\n", ret);
433 ret = make_root_dir(fd);
435 fprintf(stderr, "failed to setup the root directory\n");
438 printf("fs created on %s nodesize %u leafsize %u sectorsize %u bytes %llu\n",
439 file, nodesize, leafsize, sectorsize,
440 (unsigned long long)block_count);