[linux-2.6-block.git] / fs / btrfs / disk-io.c

#define _XOPEN_SOURCE 500
#include <stdio.h>
#include <stdlib.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <fcntl.h>
#include <unistd.h>
#include "kerncompat.h"
#include "radix-tree.h"
#include "ctree.h"
#include "disk-io.h"
#include "transaction.h"

static int allocated_blocks = 0;
int cache_max = 10000;

static int check_tree_block(struct btrfs_root *root, struct btrfs_buffer *buf)
{
	if (buf->blocknr != btrfs_header_blocknr(&buf->node.header))
		BUG();
	if (root->node && btrfs_header_parentid(&buf->node.header) !=
	    btrfs_header_parentid(&root->node->node.header))
		BUG();
	return 0;
}

static int free_some_buffers(struct btrfs_root *root)
{
	struct list_head *node, *next;
	struct btrfs_buffer *b;
	if (root->fs_info->cache_size < cache_max)
		return 0;
	list_for_each_safe(node, next, &root->fs_info->cache) {
		b = list_entry(node, struct btrfs_buffer, cache);
		if (b->count == 1) {
			BUG_ON(!list_empty(&b->dirty));
			list_del_init(&b->cache);
			btrfs_block_release(root, b);
			if (root->fs_info->cache_size < cache_max)
				break;
		}
	}
	return 0;
}

struct btrfs_buffer *alloc_tree_block(struct btrfs_root *root, u64 blocknr)
{
	struct btrfs_buffer *buf;
	int ret;

	buf = malloc(sizeof(struct btrfs_buffer) + root->blocksize);
	if (!buf)
		return buf;
	allocated_blocks++;
	buf->blocknr = blocknr;
	buf->count = 2;
	INIT_LIST_HEAD(&buf->dirty);
	free_some_buffers(root);
	radix_tree_preload(GFP_KERNEL);
	ret = radix_tree_insert(&root->fs_info->cache_radix, blocknr, buf);
	radix_tree_preload_end();
	list_add_tail(&buf->cache, &root->fs_info->cache);
	root->fs_info->cache_size++;
	if (ret) {
		free(buf);
		return NULL;
	}
	return buf;
}

struct btrfs_buffer *find_tree_block(struct btrfs_root *root, u64 blocknr)
{
	struct btrfs_buffer *buf;
	buf = radix_tree_lookup(&root->fs_info->cache_radix, blocknr);
	if (buf) {
		buf->count++;
	} else {
		buf = alloc_tree_block(root, blocknr);
		if (!buf) {
			BUG();
			return NULL;
		}
	}
	return buf;
}

struct btrfs_buffer *read_tree_block(struct btrfs_root *root, u64 blocknr)
{
	loff_t offset = blocknr * root->blocksize;
	struct btrfs_buffer *buf;
	int ret;

	buf = radix_tree_lookup(&root->fs_info->cache_radix, blocknr);
	if (buf) {
		buf->count++;
	} else {
		buf = alloc_tree_block(root, blocknr);
		if (!buf)
			return NULL;
		ret = pread(root->fs_info->fp, &buf->node, root->blocksize,
			    offset);
		if (ret != root->blocksize) {
			free(buf);
			return NULL;
		}
	}
	if (check_tree_block(root, buf))
		BUG();
	return buf;
}

int dirty_tree_block(struct btrfs_trans_handle *trans, struct btrfs_root *root,
		     struct btrfs_buffer *buf)
{
	if (!list_empty(&buf->dirty))
		return 0;
	list_add_tail(&buf->dirty, &root->fs_info->trans);
	buf->count++;
	return 0;
}

int clean_tree_block(struct btrfs_trans_handle *trans, struct btrfs_root *root,
		     struct btrfs_buffer *buf)
{
	if (!list_empty(&buf->dirty)) {
		list_del_init(&buf->dirty);
		btrfs_block_release(root, buf);
	}
	return 0;
}

int write_tree_block(struct btrfs_trans_handle *trans, struct btrfs_root *root,
		     struct btrfs_buffer *buf)
{
	u64 blocknr = buf->blocknr;
	loff_t offset = blocknr * root->blocksize;
	int ret;

	if (buf->blocknr != btrfs_header_blocknr(&buf->node.header))
		BUG();
	ret = pwrite(root->fs_info->fp, &buf->node, root->blocksize, offset);
	if (ret != root->blocksize)
		return ret;
	return 0;
}

static int __commit_transaction(struct btrfs_trans_handle *trans, struct
				btrfs_root *root)
{
	struct btrfs_buffer *b;
	int ret = 0;
	int wret;
	while(!list_empty(&root->fs_info->trans)) {
		b = list_entry(root->fs_info->trans.next, struct btrfs_buffer,
			       dirty);
		list_del_init(&b->dirty);
		wret = write_tree_block(trans, root, b);
		if (wret)
			ret = wret;
		btrfs_block_release(root, b);
	}
	return ret;
}

static int commit_tree_roots(struct btrfs_trans_handle *trans,
			     struct btrfs_fs_info *fs_info)
{
	int ret;
	u64 old_extent_block;
	struct btrfs_root *tree_root = fs_info->tree_root;
	struct btrfs_root *extent_root = fs_info->extent_root;
	struct btrfs_root *inode_root = fs_info->inode_root;

	btrfs_set_root_blocknr(&inode_root->root_item,
			       inode_root->node->blocknr);
	ret = btrfs_update_root(trans, tree_root,
				&inode_root->root_key,
				&inode_root->root_item);
	BUG_ON(ret);
	while(1) {
		old_extent_block = btrfs_root_blocknr(&extent_root->root_item);
		if (old_extent_block == extent_root->node->blocknr)
			break;
		btrfs_set_root_blocknr(&extent_root->root_item,
				       extent_root->node->blocknr);
		ret = btrfs_update_root(trans, tree_root,
					&extent_root->root_key,
					&extent_root->root_item);
		BUG_ON(ret);
	}
	return 0;
}

int btrfs_commit_transaction(struct btrfs_trans_handle *trans, struct
			     btrfs_root *root, struct btrfs_super_block *s)
{
	int ret = 0;
	struct btrfs_buffer *snap = root->commit_root;
	struct btrfs_key snap_key;

	if (root->commit_root == root->node)
		return 0;

	memcpy(&snap_key, &root->root_key, sizeof(snap_key));
	root->root_key.offset++;

	btrfs_set_root_blocknr(&root->root_item, root->node->blocknr);
	ret = btrfs_insert_root(trans, root->fs_info->tree_root,
				&root->root_key, &root->root_item);
	BUG_ON(ret);

	ret = commit_tree_roots(trans, root->fs_info);
	BUG_ON(ret);

	ret = __commit_transaction(trans, root);
	BUG_ON(ret);

	write_ctree_super(trans, root, s);
	btrfs_finish_extent_commit(trans, root->fs_info->extent_root);
	btrfs_finish_extent_commit(trans, root->fs_info->tree_root);

	root->commit_root = root->node;
	root->node->count++;
	ret = btrfs_drop_snapshot(trans, root, snap);
	BUG_ON(ret);

	ret = btrfs_del_root(trans, root->fs_info->tree_root, &snap_key);
	BUG_ON(ret);
	root->fs_info->generation = root->root_key.offset + 1;

	return ret;
}

static int __setup_root(struct btrfs_super_block *super,
			struct btrfs_root *root,
			struct btrfs_fs_info *fs_info,
			u64 objectid, int fp)
{
	root->node = NULL;
	root->commit_root = NULL;
	root->blocksize = btrfs_super_blocksize(super);
	root->ref_cows = 0;
	root->fs_info = fs_info;
	memset(&root->root_key, 0, sizeof(root->root_key));
	memset(&root->root_item, 0, sizeof(root->root_item));
	return 0;
}

static int find_and_setup_root(struct btrfs_super_block *super,
			       struct btrfs_root *tree_root,
			       struct btrfs_fs_info *fs_info,
			       u64 objectid,
			       struct btrfs_root *root, int fp)
{
	int ret;

	__setup_root(super, root, fs_info, objectid, fp);
	ret = btrfs_find_last_root(tree_root, objectid,
				   &root->root_item, &root->root_key);
	BUG_ON(ret);

	root->node = read_tree_block(root,
				     btrfs_root_blocknr(&root->root_item));
	BUG_ON(!root->node);
	return 0;
}

struct btrfs_root *open_ctree(char *filename, struct btrfs_super_block *super)
{
	int fp;

	fp = open(filename, O_CREAT | O_RDWR, 0600);
	if (fp < 0) {
		return NULL;
	}
	return open_ctree_fd(fp, super);
}

struct btrfs_root *open_ctree_fd(int fp, struct btrfs_super_block *super)
{
	struct btrfs_root *root = malloc(sizeof(struct btrfs_root));
	struct btrfs_root *extent_root = malloc(sizeof(struct btrfs_root));
	struct btrfs_root *tree_root = malloc(sizeof(struct btrfs_root));
	struct btrfs_root *inode_root = malloc(sizeof(struct btrfs_root));
	struct btrfs_fs_info *fs_info = malloc(sizeof(*fs_info));
	int ret;

	INIT_RADIX_TREE(&fs_info->cache_radix, GFP_KERNEL);
	INIT_RADIX_TREE(&fs_info->pinned_radix, GFP_KERNEL);
	INIT_LIST_HEAD(&fs_info->trans);
	INIT_LIST_HEAD(&fs_info->cache);
	fs_info->cache_size = 0;
	fs_info->fp = fp;
	fs_info->running_transaction = NULL;
	fs_info->fs_root = root;
	fs_info->tree_root = tree_root;
	fs_info->extent_root = extent_root;
	fs_info->inode_root = inode_root;
	fs_info->last_inode_alloc = 0;
	fs_info->last_inode_alloc_dirid = 0;
	fs_info->disk_super = super;
	memset(&fs_info->current_insert, 0, sizeof(fs_info->current_insert));
	memset(&fs_info->last_insert, 0, sizeof(fs_info->last_insert));

	ret = pread(fp, super, sizeof(struct btrfs_super_block),
		     BTRFS_SUPER_INFO_OFFSET);
	if (ret == 0 || btrfs_super_root(super) == 0) {
		BUG();
		return NULL;
	}
	BUG_ON(ret < 0);

	__setup_root(super, tree_root, fs_info, BTRFS_ROOT_TREE_OBJECTID, fp);
	tree_root->node = read_tree_block(tree_root, btrfs_super_root(super));
	BUG_ON(!tree_root->node);

	ret = find_and_setup_root(super, tree_root, fs_info,
				  BTRFS_EXTENT_TREE_OBJECTID, extent_root, fp);
	BUG_ON(ret);

	ret = find_and_setup_root(super, tree_root, fs_info,
				  BTRFS_INODE_MAP_OBJECTID, inode_root, fp);
	BUG_ON(ret);

	ret = find_and_setup_root(super, tree_root, fs_info,
				  BTRFS_FS_TREE_OBJECTID, root, fp);
	BUG_ON(ret);

	root->commit_root = root->node;
	root->node->count++;
	root->ref_cows = 1;
	root->fs_info->generation = root->root_key.offset + 1;
	return root;
}

int write_ctree_super(struct btrfs_trans_handle *trans, struct btrfs_root
		      *root, struct btrfs_super_block *s)
{
	int ret;
	btrfs_set_super_root(s, root->fs_info->tree_root->node->blocknr);
	ret = pwrite(root->fs_info->fp, s, sizeof(*s),
		     BTRFS_SUPER_INFO_OFFSET);
	if (ret != sizeof(*s)) {
		fprintf(stderr, "failed to write new super block err %d\n", ret);
		return ret;
	}
	return 0;
}

static int drop_cache(struct btrfs_root *root)
{
	while(!list_empty(&root->fs_info->cache)) {
		struct btrfs_buffer *b = list_entry(root->fs_info->cache.next,
						    struct btrfs_buffer,
						    cache);
		list_del_init(&b->cache);
		btrfs_block_release(root, b);
	}
	return 0;
}
int close_ctree(struct btrfs_root *root, struct btrfs_super_block *s)
{
	int ret;
	struct btrfs_trans_handle *trans;

	trans = root->fs_info->running_transaction;
	btrfs_commit_transaction(trans, root, s);
	ret = commit_tree_roots(trans, root->fs_info);
	BUG_ON(ret);
	ret = __commit_transaction(trans, root);
	BUG_ON(ret);
	write_ctree_super(trans, root, s);
	drop_cache(root);
	BUG_ON(!list_empty(&root->fs_info->trans));

	close(root->fs_info->fp);
	if (root->node)
		btrfs_block_release(root, root->node);
	if (root->fs_info->extent_root->node)
		btrfs_block_release(root->fs_info->extent_root,
				    root->fs_info->extent_root->node);
	if (root->fs_info->inode_root->node)
		btrfs_block_release(root->fs_info->inode_root,
				    root->fs_info->inode_root->node);
	if (root->fs_info->tree_root->node)
		btrfs_block_release(root->fs_info->tree_root,
				    root->fs_info->tree_root->node);
	btrfs_block_release(root, root->commit_root);
	free(root);
	printf("on close %d blocks are allocated\n", allocated_blocks);
	return 0;
}

void btrfs_block_release(struct btrfs_root *root, struct btrfs_buffer *buf)
{
	buf->count--;
	if (buf->count < 0)
		BUG();
	if (buf->count == 0) {
		BUG_ON(!list_empty(&buf->cache));
		BUG_ON(!list_empty(&buf->dirty));
		if (!radix_tree_lookup(&root->fs_info->cache_radix,
				       buf->blocknr))
			BUG();
		radix_tree_delete(&root->fs_info->cache_radix, buf->blocknr);
		memset(buf, 0, sizeof(*buf));
		free(buf);
		BUG_ON(allocated_blocks == 0);
		allocated_blocks--;
		BUG_ON(root->fs_info->cache_size == 0);
		root->fs_info->cache_size--;
	}
}
Commit	Line	Data
eb60ceac CM	1	#define _XOPEN_SOURCE 500
	2	#include <stdio.h>
	3	#include <stdlib.h>
	4	#include <sys/types.h>
	5	#include <sys/stat.h>
	6	#include <fcntl.h>
	7	#include <unistd.h>
	8	#include "kerncompat.h"
	9	#include "radix-tree.h"
	10	#include "ctree.h"
	11	#include "disk-io.h"
e089f05c	12	#include "transaction.h"
eb60ceac CM	13
eb60ceac CM	14	static int allocated_blocks = 0;
ed2ff2cb	15	int cache_max = 10000;
eb60ceac	16
234b63a0	17	static int check_tree_block(struct btrfs_root root, struct btrfs_buffer buf)
eb60ceac	18	{
7518a238	19	if (buf->blocknr != btrfs_header_blocknr(&buf->node.header))
9a8dd150	20	BUG();
7518a238 CM	21	if (root->node && btrfs_header_parentid(&buf->node.header) !=
7518a238 CM	22	btrfs_header_parentid(&root->node->node.header))
9a8dd150 CM	23	BUG();
9a8dd150 CM	24	return 0;
eb60ceac CM	25	}
eb60ceac CM	26
234b63a0	27	static int free_some_buffers(struct btrfs_root *root)
ed2ff2cb CM	28	{
ed2ff2cb CM	29	struct list_head node, next;
234b63a0	30	struct btrfs_buffer *b;
9f5fae2f	31	if (root->fs_info->cache_size < cache_max)
ed2ff2cb	32	return 0;
9f5fae2f	33	list_for_each_safe(node, next, &root->fs_info->cache) {
234b63a0	34	b = list_entry(node, struct btrfs_buffer, cache);
ed2ff2cb CM	35	if (b->count == 1) {
	36	BUG_ON(!list_empty(&b->dirty));
	37	list_del_init(&b->cache);
234b63a0	38	btrfs_block_release(root, b);
9f5fae2f	39	if (root->fs_info->cache_size < cache_max)
77ce6846	40	break;
ed2ff2cb CM	41	}
	42	}
	43	return 0;
	44	}
	45
234b63a0	46	struct btrfs_buffer alloc_tree_block(struct btrfs_root root, u64 blocknr)
eb60ceac	47	{
234b63a0	48	struct btrfs_buffer *buf;
eb60ceac	49	int ret;
123abc88 CM	50
123abc88 CM	51	buf = malloc(sizeof(struct btrfs_buffer) + root->blocksize);
eb60ceac CM	52	if (!buf)
	53	return buf;
	54	allocated_blocks++;
	55	buf->blocknr = blocknr;
ed2ff2cb CM	56	buf->count = 2;
	57	INIT_LIST_HEAD(&buf->dirty);
	58	free_some_buffers(root);
eb60ceac	59	radix_tree_preload(GFP_KERNEL);
9f5fae2f	60	ret = radix_tree_insert(&root->fs_info->cache_radix, blocknr, buf);
eb60ceac	61	radix_tree_preload_end();
9f5fae2f CM	62	list_add_tail(&buf->cache, &root->fs_info->cache);
9f5fae2f CM	63	root->fs_info->cache_size++;
eb60ceac CM	64	if (ret) {
	65	free(buf);
	66	return NULL;
	67	}
	68	return buf;
	69	}
	70
234b63a0	71	struct btrfs_buffer find_tree_block(struct btrfs_root root, u64 blocknr)
eb60ceac	72	{
234b63a0	73	struct btrfs_buffer *buf;
9f5fae2f	74	buf = radix_tree_lookup(&root->fs_info->cache_radix, blocknr);
9a8dd150 CM	75	if (buf) {
	76	buf->count++;
	77	} else {
	78	buf = alloc_tree_block(root, blocknr);
	79	if (!buf) {
	80	BUG();
	81	return NULL;
	82	}
eb60ceac	83	}
eb60ceac CM	84	return buf;
	85	}
	86
234b63a0	87	struct btrfs_buffer read_tree_block(struct btrfs_root root, u64 blocknr)
eb60ceac	88	{
123abc88	89	loff_t offset = blocknr * root->blocksize;
234b63a0	90	struct btrfs_buffer *buf;
eb60ceac CM	91	int ret;
eb60ceac CM	92
9f5fae2f	93	buf = radix_tree_lookup(&root->fs_info->cache_radix, blocknr);
eb60ceac CM	94	if (buf) {
eb60ceac CM	95	buf->count++;
9a8dd150 CM	96	} else {
	97	buf = alloc_tree_block(root, blocknr);
	98	if (!buf)
	99	return NULL;
9f5fae2f CM	100	ret = pread(root->fs_info->fp, &buf->node, root->blocksize,
9f5fae2f CM	101	offset);
123abc88	102	if (ret != root->blocksize) {
9a8dd150 CM	103	free(buf);
	104	return NULL;
	105	}
eb60ceac	106	}
9a8dd150	107	if (check_tree_block(root, buf))
cfaa7295	108	BUG();
eb60ceac CM	109	return buf;
	110	}
	111
e089f05c CM	112	int dirty_tree_block(struct btrfs_trans_handle trans, struct btrfs_root root,
e089f05c CM	113	struct btrfs_buffer *buf)
ed2ff2cb CM	114	{
	115	if (!list_empty(&buf->dirty))
	116	return 0;
9f5fae2f	117	list_add_tail(&buf->dirty, &root->fs_info->trans);
ed2ff2cb CM	118	buf->count++;
	119	return 0;
	120	}
	121
e089f05c CM	122	int clean_tree_block(struct btrfs_trans_handle trans, struct btrfs_root root,
e089f05c CM	123	struct btrfs_buffer *buf)
ed2ff2cb CM	124	{
	125	if (!list_empty(&buf->dirty)) {
	126	list_del_init(&buf->dirty);
234b63a0	127	btrfs_block_release(root, buf);
ed2ff2cb CM	128	}
	129	return 0;
	130	}
	131
e089f05c CM	132	int write_tree_block(struct btrfs_trans_handle trans, struct btrfs_root root,
e089f05c CM	133	struct btrfs_buffer *buf)
eb60ceac CM	134	{
eb60ceac CM	135	u64 blocknr = buf->blocknr;
123abc88	136	loff_t offset = blocknr * root->blocksize;
eb60ceac CM	137	int ret;
eb60ceac CM	138
7518a238	139	if (buf->blocknr != btrfs_header_blocknr(&buf->node.header))
eb60ceac	140	BUG();
9f5fae2f	141	ret = pwrite(root->fs_info->fp, &buf->node, root->blocksize, offset);
123abc88	142	if (ret != root->blocksize)
eb60ceac	143	return ret;
eb60ceac CM	144	return 0;
	145	}
	146
e089f05c CM	147	static int __commit_transaction(struct btrfs_trans_handle *trans, struct
e089f05c CM	148	btrfs_root *root)
ed2ff2cb	149	{
234b63a0	150	struct btrfs_buffer *b;
ed2ff2cb CM	151	int ret = 0;
ed2ff2cb CM	152	int wret;
9f5fae2f CM	153	while(!list_empty(&root->fs_info->trans)) {
	154	b = list_entry(root->fs_info->trans.next, struct btrfs_buffer,
	155	dirty);
ed2ff2cb	156	list_del_init(&b->dirty);
e089f05c	157	wret = write_tree_block(trans, root, b);
ed2ff2cb CM	158	if (wret)
ed2ff2cb CM	159	ret = wret;
234b63a0	160	btrfs_block_release(root, b);
ed2ff2cb CM	161	}
	162	return ret;
	163	}
	164
9f5fae2f CM	165	static int commit_tree_roots(struct btrfs_trans_handle *trans,
9f5fae2f CM	166	struct btrfs_fs_info *fs_info)
3768f368 CM	167	{
	168	int ret;
	169	u64 old_extent_block;
9f5fae2f CM	170	struct btrfs_root *tree_root = fs_info->tree_root;
	171	struct btrfs_root *extent_root = fs_info->extent_root;
	172	struct btrfs_root *inode_root = fs_info->inode_root;
	173
	174	btrfs_set_root_blocknr(&inode_root->root_item,
	175	inode_root->node->blocknr);
	176	ret = btrfs_update_root(trans, tree_root,
	177	&inode_root->root_key,
	178	&inode_root->root_item);
	179	BUG_ON(ret);
3768f368 CM	180	while(1) {
	181	old_extent_block = btrfs_root_blocknr(&extent_root->root_item);
	182	if (old_extent_block == extent_root->node->blocknr)
	183	break;
	184	btrfs_set_root_blocknr(&extent_root->root_item,
	185	extent_root->node->blocknr);
e089f05c	186	ret = btrfs_update_root(trans, tree_root,
3768f368 CM	187	&extent_root->root_key,
	188	&extent_root->root_item);
	189	BUG_ON(ret);
	190	}
3768f368 CM	191	return 0;
	192	}
	193
e089f05c CM	194	int btrfs_commit_transaction(struct btrfs_trans_handle *trans, struct
e089f05c CM	195	btrfs_root root, struct btrfs_super_block s)
ed2ff2cb	196	{
a28ec197	197	int ret = 0;
3768f368 CM	198	struct btrfs_buffer *snap = root->commit_root;
3768f368 CM	199	struct btrfs_key snap_key;
a28ec197	200
3768f368 CM	201	if (root->commit_root == root->node)
	202	return 0;
	203
	204	memcpy(&snap_key, &root->root_key, sizeof(snap_key));
	205	root->root_key.offset++;
	206
	207	btrfs_set_root_blocknr(&root->root_item, root->node->blocknr);
9f5fae2f CM	208	ret = btrfs_insert_root(trans, root->fs_info->tree_root,
	209	&root->root_key, &root->root_item);
	210	BUG_ON(ret);
	211
	212	ret = commit_tree_roots(trans, root->fs_info);
3768f368 CM	213	BUG_ON(ret);
3768f368 CM	214
9f5fae2f	215	ret = __commit_transaction(trans, root);
3768f368 CM	216	BUG_ON(ret);
3768f368 CM	217
e089f05c	218	write_ctree_super(trans, root, s);
9f5fae2f CM	219	btrfs_finish_extent_commit(trans, root->fs_info->extent_root);
9f5fae2f CM	220	btrfs_finish_extent_commit(trans, root->fs_info->tree_root);
3768f368 CM	221
	222	root->commit_root = root->node;
	223	root->node->count++;
e089f05c	224	ret = btrfs_drop_snapshot(trans, root, snap);
3768f368 CM	225	BUG_ON(ret);
3768f368 CM	226
9f5fae2f	227	ret = btrfs_del_root(trans, root->fs_info->tree_root, &snap_key);
3768f368	228	BUG_ON(ret);
293ffd5f	229	root->fs_info->generation = root->root_key.offset + 1;
3768f368	230
ed2ff2cb CM	231	return ret;
	232	}
	233
123abc88	234	static int __setup_root(struct btrfs_super_block *super,
9f5fae2f CM	235	struct btrfs_root *root,
	236	struct btrfs_fs_info *fs_info,
	237	u64 objectid, int fp)
d97e63b6	238	{
cfaa7295	239	root->node = NULL;
a28ec197	240	root->commit_root = NULL;
123abc88 CM	241	root->blocksize = btrfs_super_blocksize(super);
123abc88 CM	242	root->ref_cows = 0;
9f5fae2f	243	root->fs_info = fs_info;
3768f368 CM	244	memset(&root->root_key, 0, sizeof(root->root_key));
	245	memset(&root->root_item, 0, sizeof(root->root_item));
	246	return 0;
	247	}
	248
123abc88	249	static int find_and_setup_root(struct btrfs_super_block *super,
9f5fae2f CM	250	struct btrfs_root *tree_root,
	251	struct btrfs_fs_info *fs_info,
	252	u64 objectid,
123abc88	253	struct btrfs_root *root, int fp)
3768f368 CM	254	{
	255	int ret;
	256
9f5fae2f	257	__setup_root(super, root, fs_info, objectid, fp);
3768f368 CM	258	ret = btrfs_find_last_root(tree_root, objectid,
	259	&root->root_item, &root->root_key);
	260	BUG_ON(ret);
	261
	262	root->node = read_tree_block(root,
	263	btrfs_root_blocknr(&root->root_item));
3768f368	264	BUG_ON(!root->node);
d97e63b6 CM	265	return 0;
	266	}
	267
234b63a0	268	struct btrfs_root open_ctree(char filename, struct btrfs_super_block *super)
2e635a27 CM	269	{
	270	int fp;
	271
	272	fp = open(filename, O_CREAT \| O_RDWR, 0600);
	273	if (fp < 0) {
	274	return NULL;
	275	}
	276	return open_ctree_fd(fp, super);
	277	}
	278
	279	struct btrfs_root open_ctree_fd(int fp, struct btrfs_super_block super)
eb60ceac	280	{
234b63a0 CM	281	struct btrfs_root *root = malloc(sizeof(struct btrfs_root));
234b63a0 CM	282	struct btrfs_root *extent_root = malloc(sizeof(struct btrfs_root));
3768f368	283	struct btrfs_root *tree_root = malloc(sizeof(struct btrfs_root));
9f5fae2f CM	284	struct btrfs_root *inode_root = malloc(sizeof(struct btrfs_root));
9f5fae2f CM	285	struct btrfs_fs_info fs_info = malloc(sizeof(fs_info));
eb60ceac CM	286	int ret;
eb60ceac CM	287
9f5fae2f CM	288	INIT_RADIX_TREE(&fs_info->cache_radix, GFP_KERNEL);
	289	INIT_RADIX_TREE(&fs_info->pinned_radix, GFP_KERNEL);
	290	INIT_LIST_HEAD(&fs_info->trans);
	291	INIT_LIST_HEAD(&fs_info->cache);
	292	fs_info->cache_size = 0;
	293	fs_info->fp = fp;
	294	fs_info->running_transaction = NULL;
	295	fs_info->fs_root = root;
	296	fs_info->tree_root = tree_root;
	297	fs_info->extent_root = extent_root;
	298	fs_info->inode_root = inode_root;
	299	fs_info->last_inode_alloc = 0;
	300	fs_info->last_inode_alloc_dirid = 0;
1261ec42	301	fs_info->disk_super = super;
9f5fae2f CM	302	memset(&fs_info->current_insert, 0, sizeof(fs_info->current_insert));
9f5fae2f CM	303	memset(&fs_info->last_insert, 0, sizeof(fs_info->last_insert));
3768f368	304
234b63a0	305	ret = pread(fp, super, sizeof(struct btrfs_super_block),
123abc88	306	BTRFS_SUPER_INFO_OFFSET);
3768f368	307	if (ret == 0 \|\| btrfs_super_root(super) == 0) {
1261ec42 CM	308	BUG();
1261ec42 CM	309	return NULL;
d97e63b6 CM	310	}
d97e63b6 CM	311	BUG_ON(ret < 0);
3768f368	312
9f5fae2f	313	__setup_root(super, tree_root, fs_info, BTRFS_ROOT_TREE_OBJECTID, fp);
3768f368 CM	314	tree_root->node = read_tree_block(tree_root, btrfs_super_root(super));
	315	BUG_ON(!tree_root->node);
	316
9f5fae2f CM	317	ret = find_and_setup_root(super, tree_root, fs_info,
9f5fae2f CM	318	BTRFS_EXTENT_TREE_OBJECTID, extent_root, fp);
3768f368 CM	319	BUG_ON(ret);
3768f368 CM	320
9f5fae2f CM	321	ret = find_and_setup_root(super, tree_root, fs_info,
	322	BTRFS_INODE_MAP_OBJECTID, inode_root, fp);
	323	BUG_ON(ret);
	324
	325	ret = find_and_setup_root(super, tree_root, fs_info,
	326	BTRFS_FS_TREE_OBJECTID, root, fp);
3768f368 CM	327	BUG_ON(ret);
3768f368 CM	328
a28ec197 CM	329	root->commit_root = root->node;
a28ec197 CM	330	root->node->count++;
3768f368	331	root->ref_cows = 1;
293ffd5f	332	root->fs_info->generation = root->root_key.offset + 1;
eb60ceac CM	333	return root;
	334	}
	335
e089f05c CM	336	int write_ctree_super(struct btrfs_trans_handle *trans, struct btrfs_root
e089f05c CM	337	root, struct btrfs_super_block s)
eb60ceac CM	338	{
eb60ceac CM	339	int ret;
9f5fae2f CM	340	btrfs_set_super_root(s, root->fs_info->tree_root->node->blocknr);
9f5fae2f CM	341	ret = pwrite(root->fs_info->fp, s, sizeof(*s),
123abc88	342	BTRFS_SUPER_INFO_OFFSET);
cfaa7295 CM	343	if (ret != sizeof(*s)) {
cfaa7295 CM	344	fprintf(stderr, "failed to write new super block err %d\n", ret);
eb60ceac	345	return ret;
cfaa7295 CM	346	}
	347	return 0;
	348	}
	349
234b63a0	350	static int drop_cache(struct btrfs_root *root)
ed2ff2cb	351	{
9f5fae2f CM	352	while(!list_empty(&root->fs_info->cache)) {
	353	struct btrfs_buffer *b = list_entry(root->fs_info->cache.next,
	354	struct btrfs_buffer,
	355	cache);
ed2ff2cb	356	list_del_init(&b->cache);
234b63a0	357	btrfs_block_release(root, b);
ed2ff2cb CM	358	}
	359	return 0;
	360	}
234b63a0	361	int close_ctree(struct btrfs_root root, struct btrfs_super_block s)
cfaa7295	362	{
3768f368	363	int ret;
e089f05c CM	364	struct btrfs_trans_handle *trans;
e089f05c CM	365
9f5fae2f	366	trans = root->fs_info->running_transaction;
e089f05c	367	btrfs_commit_transaction(trans, root, s);
9f5fae2f CM	368	ret = commit_tree_roots(trans, root->fs_info);
	369	BUG_ON(ret);
	370	ret = __commit_transaction(trans, root);
3768f368	371	BUG_ON(ret);
e089f05c	372	write_ctree_super(trans, root, s);
ed2ff2cb	373	drop_cache(root);
9f5fae2f	374	BUG_ON(!list_empty(&root->fs_info->trans));
ed2ff2cb	375
9f5fae2f	376	close(root->fs_info->fp);
cfaa7295	377	if (root->node)
234b63a0	378	btrfs_block_release(root, root->node);
9f5fae2f CM	379	if (root->fs_info->extent_root->node)
	380	btrfs_block_release(root->fs_info->extent_root,
	381	root->fs_info->extent_root->node);
	382	if (root->fs_info->inode_root->node)
	383	btrfs_block_release(root->fs_info->inode_root,
	384	root->fs_info->inode_root->node);
	385	if (root->fs_info->tree_root->node)
	386	btrfs_block_release(root->fs_info->tree_root,
	387	root->fs_info->tree_root->node);
234b63a0	388	btrfs_block_release(root, root->commit_root);
cfaa7295 CM	389	free(root);
cfaa7295 CM	390	printf("on close %d blocks are allocated\n", allocated_blocks);
eb60ceac CM	391	return 0;
	392	}
	393
234b63a0	394	void btrfs_block_release(struct btrfs_root root, struct btrfs_buffer buf)
eb60ceac CM	395	{
eb60ceac CM	396	buf->count--;
cfaa7295 CM	397	if (buf->count < 0)
cfaa7295 CM	398	BUG();
eb60ceac	399	if (buf->count == 0) {
02217ed2 CM	400	BUG_ON(!list_empty(&buf->cache));
02217ed2 CM	401	BUG_ON(!list_empty(&buf->dirty));
9f5fae2f CM	402	if (!radix_tree_lookup(&root->fs_info->cache_radix,
9f5fae2f CM	403	buf->blocknr))
eb60ceac	404	BUG();
9f5fae2f	405	radix_tree_delete(&root->fs_info->cache_radix, buf->blocknr);
eb60ceac CM	406	memset(buf, 0, sizeof(*buf));
	407	free(buf);
	408	BUG_ON(allocated_blocks == 0);
	409	allocated_blocks--;
9f5fae2f CM	410	BUG_ON(root->fs_info->cache_size == 0);
9f5fae2f CM	411	root->fs_info->cache_size--;
eb60ceac CM	412	}
	413	}
	414