[net-next-2.6.git] / fs / hfsplus / btree.c

/*
 *  linux/fs/hfsplus/btree.c
 *
 * Copyright (C) 2001
 * Brad Boyer (flar@allandria.com)
 * (C) 2003 Ardis Technologies <roman@ardistech.com>
 *
 * Handle opening/closing btree
 */

#include <linux/slab.h>
#include <linux/pagemap.h>
#include <linux/log2.h>

#include "hfsplus_fs.h"
#include "hfsplus_raw.h"


/* Get a reference to a B*Tree and do some initial checks */
struct hfs_btree *hfs_btree_open(struct super_block *sb, u32 id)
{
	struct hfs_btree *tree;
	struct hfs_btree_header_rec *head;
	struct address_space *mapping;
	struct inode *inode;
	struct page *page;
	unsigned int size;

	tree = kzalloc(sizeof(*tree), GFP_KERNEL);
	if (!tree)
		return NULL;

	mutex_init(&tree->tree_lock);
	spin_lock_init(&tree->hash_lock);
	tree->sb = sb;
	tree->cnid = id;
	inode = hfsplus_iget(sb, id);
	if (IS_ERR(inode))
		goto free_tree;
	tree->inode = inode;

	if (!HFSPLUS_I(tree->inode)->first_blocks) {
		printk(KERN_ERR
		       "hfs: invalid btree extent records (0 size).\n");
		goto free_inode;
	}

	mapping = tree->inode->i_mapping;
	page = read_mapping_page(mapping, 0, NULL);
	if (IS_ERR(page))
		goto free_inode;

	/* Load the header */
	head = (struct hfs_btree_header_rec *)(kmap(page) + sizeof(struct hfs_bnode_desc));
	tree->root = be32_to_cpu(head->root);
	tree->leaf_count = be32_to_cpu(head->leaf_count);
	tree->leaf_head = be32_to_cpu(head->leaf_head);
	tree->leaf_tail = be32_to_cpu(head->leaf_tail);
	tree->node_count = be32_to_cpu(head->node_count);
	tree->free_nodes = be32_to_cpu(head->free_nodes);
	tree->attributes = be32_to_cpu(head->attributes);
	tree->node_size = be16_to_cpu(head->node_size);
	tree->max_key_len = be16_to_cpu(head->max_key_len);
	tree->depth = be16_to_cpu(head->depth);

	/* Set the correct compare function */
	if (id == HFSPLUS_EXT_CNID) {
		tree->keycmp = hfsplus_ext_cmp_key;
	} else if (id == HFSPLUS_CAT_CNID) {
		if (test_bit(HFSPLUS_SB_HFSX, &HFSPLUS_SB(sb)->flags) &&
		    (head->key_type == HFSPLUS_KEY_BINARY))
			tree->keycmp = hfsplus_cat_bin_cmp_key;
		else {
			tree->keycmp = hfsplus_cat_case_cmp_key;
			set_bit(HFSPLUS_SB_CASEFOLD, &HFSPLUS_SB(sb)->flags);
		}
	} else {
		printk(KERN_ERR "hfs: unknown B*Tree requested\n");
		goto fail_page;
	}

	size = tree->node_size;
	if (!is_power_of_2(size))
		goto fail_page;
	if (!tree->node_count)
		goto fail_page;
	tree->node_size_shift = ffs(size) - 1;

	tree->pages_per_bnode = (tree->node_size + PAGE_CACHE_SIZE - 1) >> PAGE_CACHE_SHIFT;

	kunmap(page);
	page_cache_release(page);
	return tree;

 fail_page:
	tree->inode->i_mapping->a_ops = &hfsplus_aops;
	page_cache_release(page);
 free_inode:
	iput(tree->inode);
 free_tree:
	kfree(tree);
	return NULL;
}

/* Release resources used by a btree */
void hfs_btree_close(struct hfs_btree *tree)
{
	struct hfs_bnode *node;
	int i;

	if (!tree)
		return;

	for (i = 0; i < NODE_HASH_SIZE; i++) {
		while ((node = tree->node_hash[i])) {
			tree->node_hash[i] = node->next_hash;
			if (atomic_read(&node->refcnt))
				printk(KERN_CRIT "hfs: node %d:%d still has %d user(s)!\n",
					node->tree->cnid, node->this, atomic_read(&node->refcnt));
			hfs_bnode_free(node);
			tree->node_hash_cnt--;
		}
	}
	iput(tree->inode);
	kfree(tree);
}

void hfs_btree_write(struct hfs_btree *tree)
{
	struct hfs_btree_header_rec *head;
	struct hfs_bnode *node;
	struct page *page;

	node = hfs_bnode_find(tree, 0);
	if (IS_ERR(node))
		/* panic? */
		return;
	/* Load the header */
	page = node->page[0];
	head = (struct hfs_btree_header_rec *)(kmap(page) + sizeof(struct hfs_bnode_desc));

	head->root = cpu_to_be32(tree->root);
	head->leaf_count = cpu_to_be32(tree->leaf_count);
	head->leaf_head = cpu_to_be32(tree->leaf_head);
	head->leaf_tail = cpu_to_be32(tree->leaf_tail);
	head->node_count = cpu_to_be32(tree->node_count);
	head->free_nodes = cpu_to_be32(tree->free_nodes);
	head->attributes = cpu_to_be32(tree->attributes);
	head->depth = cpu_to_be16(tree->depth);

	kunmap(page);
	set_page_dirty(page);
	hfs_bnode_put(node);
}

static struct hfs_bnode *hfs_bmap_new_bmap(struct hfs_bnode *prev, u32 idx)
{
	struct hfs_btree *tree = prev->tree;
	struct hfs_bnode *node;
	struct hfs_bnode_desc desc;
	__be32 cnid;

	node = hfs_bnode_create(tree, idx);
	if (IS_ERR(node))
		return node;

	tree->free_nodes--;
	prev->next = idx;
	cnid = cpu_to_be32(idx);
	hfs_bnode_write(prev, &cnid, offsetof(struct hfs_bnode_desc, next), 4);

	node->type = HFS_NODE_MAP;
	node->num_recs = 1;
	hfs_bnode_clear(node, 0, tree->node_size);
	desc.next = 0;
	desc.prev = 0;
	desc.type = HFS_NODE_MAP;
	desc.height = 0;
	desc.num_recs = cpu_to_be16(1);
	desc.reserved = 0;
	hfs_bnode_write(node, &desc, 0, sizeof(desc));
	hfs_bnode_write_u16(node, 14, 0x8000);
	hfs_bnode_write_u16(node, tree->node_size - 2, 14);
	hfs_bnode_write_u16(node, tree->node_size - 4, tree->node_size - 6);

	return node;
}

struct hfs_bnode *hfs_bmap_alloc(struct hfs_btree *tree)
{
	struct hfs_bnode *node, *next_node;
	struct page **pagep;
	u32 nidx, idx;
	unsigned off;
	u16 off16;
	u16 len;
	u8 *data, byte, m;
	int i;

	while (!tree->free_nodes) {
		struct inode *inode = tree->inode;
		struct hfsplus_inode_info *hip = HFSPLUS_I(inode);
		u32 count;
		int res;

		res = hfsplus_file_extend(inode);
		if (res)
			return ERR_PTR(res);
		hip->phys_size = inode->i_size =
			(loff_t)hip->alloc_blocks <<
				HFSPLUS_SB(tree->sb)->alloc_blksz_shift;
		hip->fs_blocks =
			hip->alloc_blocks << HFSPLUS_SB(tree->sb)->fs_shift;
		inode_set_bytes(inode, inode->i_size);
		count = inode->i_size >> tree->node_size_shift;
		tree->free_nodes = count - tree->node_count;
		tree->node_count = count;
	}

	nidx = 0;
	node = hfs_bnode_find(tree, nidx);
	if (IS_ERR(node))
		return node;
	len = hfs_brec_lenoff(node, 2, &off16);
	off = off16;

	off += node->page_offset;
	pagep = node->page + (off >> PAGE_CACHE_SHIFT);
	data = kmap(*pagep);
	off &= ~PAGE_CACHE_MASK;
	idx = 0;

	for (;;) {
		while (len) {
			byte = data[off];
			if (byte != 0xff) {
				for (m = 0x80, i = 0; i < 8; m >>= 1, i++) {
					if (!(byte & m)) {
						idx += i;
						data[off] |= m;
						set_page_dirty(*pagep);
						kunmap(*pagep);
						tree->free_nodes--;
						mark_inode_dirty(tree->inode);
						hfs_bnode_put(node);
						return hfs_bnode_create(tree, idx);
					}
				}
			}
			if (++off >= PAGE_CACHE_SIZE) {
				kunmap(*pagep);
				data = kmap(*++pagep);
				off = 0;
			}
			idx += 8;
			len--;
		}
		kunmap(*pagep);
		nidx = node->next;
		if (!nidx) {
			printk(KERN_DEBUG "hfs: create new bmap node...\n");
			next_node = hfs_bmap_new_bmap(node, idx);
		} else
			next_node = hfs_bnode_find(tree, nidx);
		hfs_bnode_put(node);
		if (IS_ERR(next_node))
			return next_node;
		node = next_node;

		len = hfs_brec_lenoff(node, 0, &off16);
		off = off16;
		off += node->page_offset;
		pagep = node->page + (off >> PAGE_CACHE_SHIFT);
		data = kmap(*pagep);
		off &= ~PAGE_CACHE_MASK;
	}
}

void hfs_bmap_free(struct hfs_bnode *node)
{
	struct hfs_btree *tree;
	struct page *page;
	u16 off, len;
	u32 nidx;
	u8 *data, byte, m;

	dprint(DBG_BNODE_MOD, "btree_free_node: %u\n", node->this);
	BUG_ON(!node->this);
	tree = node->tree;
	nidx = node->this;
	node = hfs_bnode_find(tree, 0);
	if (IS_ERR(node))
		return;
	len = hfs_brec_lenoff(node, 2, &off);
	while (nidx >= len * 8) {
		u32 i;

		nidx -= len * 8;
		i = node->next;
		hfs_bnode_put(node);
		if (!i) {
			/* panic */;
			printk(KERN_CRIT "hfs: unable to free bnode %u. bmap not found!\n", node->this);
			return;
		}
		node = hfs_bnode_find(tree, i);
		if (IS_ERR(node))
			return;
		if (node->type != HFS_NODE_MAP) {
			/* panic */;
			printk(KERN_CRIT "hfs: invalid bmap found! (%u,%d)\n", node->this, node->type);
			hfs_bnode_put(node);
			return;
		}
		len = hfs_brec_lenoff(node, 0, &off);
	}
	off += node->page_offset + nidx / 8;
	page = node->page[off >> PAGE_CACHE_SHIFT];
	data = kmap(page);
	off &= ~PAGE_CACHE_MASK;
	m = 1 << (~nidx & 7);
	byte = data[off];
	if (!(byte & m)) {
		printk(KERN_CRIT "hfs: trying to free free bnode %u(%d)\n", node->this, node->type);
		kunmap(page);
		hfs_bnode_put(node);
		return;
	}
	data[off] = byte & ~m;
	set_page_dirty(page);
	kunmap(page);
	hfs_bnode_put(node);
	tree->free_nodes++;
	mark_inode_dirty(tree->inode);
}
Commit	Line	Data
1da177e4 LT	1	/*
	2	* linux/fs/hfsplus/btree.c
	3	*
	4	* Copyright (C) 2001
	5	* Brad Boyer (flar@allandria.com)
	6	* (C) 2003 Ardis Technologies <roman@ardistech.com>
	7	*
	8	* Handle opening/closing btree
	9	*/
	10
	11	#include <linux/slab.h>
	12	#include <linux/pagemap.h>
e1b5c1d3	13	#include <linux/log2.h>
1da177e4 LT	14
	15	#include "hfsplus_fs.h"
	16	#include "hfsplus_raw.h"
	17
	18
	19	/* Get a reference to a BTree and do some initial checks /
	20	struct hfs_btree hfs_btree_open(struct super_block sb, u32 id)
	21	{
	22	struct hfs_btree *tree;
	23	struct hfs_btree_header_rec *head;
	24	struct address_space *mapping;
63525391	25	struct inode *inode;
1da177e4 LT	26	struct page *page;
	27	unsigned int size;
	28
f8314dc6	29	tree = kzalloc(sizeof(*tree), GFP_KERNEL);
1da177e4 LT	30	if (!tree)
1da177e4 LT	31	return NULL;
1da177e4	32
467c3d9c	33	mutex_init(&tree->tree_lock);
1da177e4	34	spin_lock_init(&tree->hash_lock);
1da177e4 LT	35	tree->sb = sb;
1da177e4 LT	36	tree->cnid = id;
63525391 DH	37	inode = hfsplus_iget(sb, id);
63525391 DH	38	if (IS_ERR(inode))
1da177e4	39	goto free_tree;
63525391	40	tree->inode = inode;
1da177e4	41
ee527162 JM	42	if (!HFSPLUS_I(tree->inode)->first_blocks) {
	43	printk(KERN_ERR
	44	"hfs: invalid btree extent records (0 size).\n");
	45	goto free_inode;
	46	}
	47
1da177e4	48	mapping = tree->inode->i_mapping;
090d2b18	49	page = read_mapping_page(mapping, 0, NULL);
1da177e4	50	if (IS_ERR(page))
ee527162	51	goto free_inode;
1da177e4 LT	52
	53	/* Load the header */
	54	head = (struct hfs_btree_header_rec *)(kmap(page) + sizeof(struct hfs_bnode_desc));
	55	tree->root = be32_to_cpu(head->root);
	56	tree->leaf_count = be32_to_cpu(head->leaf_count);
	57	tree->leaf_head = be32_to_cpu(head->leaf_head);
	58	tree->leaf_tail = be32_to_cpu(head->leaf_tail);
	59	tree->node_count = be32_to_cpu(head->node_count);
	60	tree->free_nodes = be32_to_cpu(head->free_nodes);
	61	tree->attributes = be32_to_cpu(head->attributes);
	62	tree->node_size = be16_to_cpu(head->node_size);
	63	tree->max_key_len = be16_to_cpu(head->max_key_len);
	64	tree->depth = be16_to_cpu(head->depth);
	65
2179d372 DE	66	/* Set the correct compare function */
	67	if (id == HFSPLUS_EXT_CNID) {
	68	tree->keycmp = hfsplus_ext_cmp_key;
	69	} else if (id == HFSPLUS_CAT_CNID) {
84adede3	70	if (test_bit(HFSPLUS_SB_HFSX, &HFSPLUS_SB(sb)->flags) &&
2179d372 DE	71	(head->key_type == HFSPLUS_KEY_BINARY))
2179d372 DE	72	tree->keycmp = hfsplus_cat_bin_cmp_key;
d45bce8f	73	else {
2179d372	74	tree->keycmp = hfsplus_cat_case_cmp_key;
84adede3	75	set_bit(HFSPLUS_SB_CASEFOLD, &HFSPLUS_SB(sb)->flags);
d45bce8f	76	}
2179d372 DE	77	} else {
	78	printk(KERN_ERR "hfs: unknown B*Tree requested\n");
	79	goto fail_page;
	80	}
	81
1da177e4	82	size = tree->node_size;
e1b5c1d3	83	if (!is_power_of_2(size))
1da177e4 LT	84	goto fail_page;
	85	if (!tree->node_count)
	86	goto fail_page;
	87	tree->node_size_shift = ffs(size) - 1;
	88
	89	tree->pages_per_bnode = (tree->node_size + PAGE_CACHE_SIZE - 1) >> PAGE_CACHE_SHIFT;
	90
	91	kunmap(page);
	92	page_cache_release(page);
	93	return tree;
	94
	95	fail_page:
	96	tree->inode->i_mapping->a_ops = &hfsplus_aops;
	97	page_cache_release(page);
ee527162	98	free_inode:
1da177e4	99	iput(tree->inode);
ee527162	100	free_tree:
1da177e4 LT	101	kfree(tree);
	102	return NULL;
	103	}
	104
	105	/* Release resources used by a btree */
	106	void hfs_btree_close(struct hfs_btree *tree)
	107	{
	108	struct hfs_bnode *node;
	109	int i;
	110
	111	if (!tree)
	112	return;
	113
	114	for (i = 0; i < NODE_HASH_SIZE; i++) {
	115	while ((node = tree->node_hash[i])) {
	116	tree->node_hash[i] = node->next_hash;
	117	if (atomic_read(&node->refcnt))
634725a9	118	printk(KERN_CRIT "hfs: node %d:%d still has %d user(s)!\n",
1da177e4 LT	119	node->tree->cnid, node->this, atomic_read(&node->refcnt));
	120	hfs_bnode_free(node);
	121	tree->node_hash_cnt--;
	122	}
	123	}
	124	iput(tree->inode);
	125	kfree(tree);
	126	}
	127
	128	void hfs_btree_write(struct hfs_btree *tree)
	129	{
	130	struct hfs_btree_header_rec *head;
	131	struct hfs_bnode *node;
	132	struct page *page;
	133
	134	node = hfs_bnode_find(tree, 0);
	135	if (IS_ERR(node))
	136	/* panic? */
	137	return;
	138	/* Load the header */
	139	page = node->page[0];
	140	head = (struct hfs_btree_header_rec *)(kmap(page) + sizeof(struct hfs_bnode_desc));
	141
	142	head->root = cpu_to_be32(tree->root);
	143	head->leaf_count = cpu_to_be32(tree->leaf_count);
	144	head->leaf_head = cpu_to_be32(tree->leaf_head);
	145	head->leaf_tail = cpu_to_be32(tree->leaf_tail);
	146	head->node_count = cpu_to_be32(tree->node_count);
	147	head->free_nodes = cpu_to_be32(tree->free_nodes);
	148	head->attributes = cpu_to_be32(tree->attributes);
	149	head->depth = cpu_to_be16(tree->depth);
	150
	151	kunmap(page);
	152	set_page_dirty(page);
	153	hfs_bnode_put(node);
	154	}
	155
	156	static struct hfs_bnode hfs_bmap_new_bmap(struct hfs_bnode prev, u32 idx)
	157	{
	158	struct hfs_btree *tree = prev->tree;
	159	struct hfs_bnode *node;
	160	struct hfs_bnode_desc desc;
	161	__be32 cnid;
	162
	163	node = hfs_bnode_create(tree, idx);
	164	if (IS_ERR(node))
	165	return node;
	166
	167	tree->free_nodes--;
	168	prev->next = idx;
	169	cnid = cpu_to_be32(idx);
	170	hfs_bnode_write(prev, &cnid, offsetof(struct hfs_bnode_desc, next), 4);
	171
	172	node->type = HFS_NODE_MAP;
	173	node->num_recs = 1;
	174	hfs_bnode_clear(node, 0, tree->node_size);
	175	desc.next = 0;
	176	desc.prev = 0;
	177	desc.type = HFS_NODE_MAP;
	178	desc.height = 0;
	179	desc.num_recs = cpu_to_be16(1);
	180	desc.reserved = 0;
	181	hfs_bnode_write(node, &desc, 0, sizeof(desc));
	182	hfs_bnode_write_u16(node, 14, 0x8000);
183	hfs_bnode_write_u16(node, tree->node_size - 2, 14);
184	hfs_bnode_write_u16(node, tree->node_size - 4, tree->node_size - 6);
185
186	return node;
187	}
188
189	struct hfs_bnode hfs_bmap_alloc(struct hfs_btree tree)
190	{
191	struct hfs_bnode node, next_node;
192	struct page **pagep;
193	u32 nidx, idx;
487798df AM	194	unsigned off;
	195	u16 off16;
	196	u16 len;
1da177e4 LT	197	u8 *data, byte, m;
	198	int i;
	199
	200	while (!tree->free_nodes) {
	201	struct inode *inode = tree->inode;
6af502de	202	struct hfsplus_inode_info *hip = HFSPLUS_I(inode);
1da177e4 LT	203	u32 count;
	204	int res;
	205
	206	res = hfsplus_file_extend(inode);
	207	if (res)
	208	return ERR_PTR(res);
6af502de CH	209	hip->phys_size = inode->i_size =
6af502de CH	210	(loff_t)hip->alloc_blocks <<
dd73a01a	211	HFSPLUS_SB(tree->sb)->alloc_blksz_shift;
6af502de CH	212	hip->fs_blocks =
6af502de CH	213	hip->alloc_blocks << HFSPLUS_SB(tree->sb)->fs_shift;
1da177e4 LT	214	inode_set_bytes(inode, inode->i_size);
	215	count = inode->i_size >> tree->node_size_shift;
	216	tree->free_nodes = count - tree->node_count;
	217	tree->node_count = count;
	218	}
	219
	220	nidx = 0;
	221	node = hfs_bnode_find(tree, nidx);
	222	if (IS_ERR(node))
	223	return node;
487798df AM	224	len = hfs_brec_lenoff(node, 2, &off16);
487798df AM	225	off = off16;
1da177e4 LT	226
	227	off += node->page_offset;
	228	pagep = node->page + (off >> PAGE_CACHE_SHIFT);
	229	data = kmap(*pagep);
	230	off &= ~PAGE_CACHE_MASK;
	231	idx = 0;
	232
	233	for (;;) {
	234	while (len) {
	235	byte = data[off];
	236	if (byte != 0xff) {
	237	for (m = 0x80, i = 0; i < 8; m >>= 1, i++) {
	238	if (!(byte & m)) {
	239	idx += i;
	240	data[off] \|= m;
	241	set_page_dirty(*pagep);
	242	kunmap(*pagep);
	243	tree->free_nodes--;
	244	mark_inode_dirty(tree->inode);
	245	hfs_bnode_put(node);
1da177e4 LT	246	return hfs_bnode_create(tree, idx);
	247	}
	248	}
	249	}
	250	if (++off >= PAGE_CACHE_SIZE) {
	251	kunmap(*pagep);
	252	data = kmap(*++pagep);
	253	off = 0;
	254	}
	255	idx += 8;
	256	len--;
	257	}
	258	kunmap(*pagep);
	259	nidx = node->next;
	260	if (!nidx) {
634725a9	261	printk(KERN_DEBUG "hfs: create new bmap node...\n");
1da177e4 LT	262	next_node = hfs_bmap_new_bmap(node, idx);
	263	} else
	264	next_node = hfs_bnode_find(tree, nidx);
	265	hfs_bnode_put(node);
	266	if (IS_ERR(next_node))
	267	return next_node;
	268	node = next_node;
	269
487798df AM	270	len = hfs_brec_lenoff(node, 0, &off16);
487798df AM	271	off = off16;
1da177e4 LT	272	off += node->page_offset;
	273	pagep = node->page + (off >> PAGE_CACHE_SHIFT);
	274	data = kmap(*pagep);
	275	off &= ~PAGE_CACHE_MASK;
	276	}
	277	}
	278
	279	void hfs_bmap_free(struct hfs_bnode *node)
	280	{
	281	struct hfs_btree *tree;
	282	struct page *page;
	283	u16 off, len;
	284	u32 nidx;
	285	u8 *data, byte, m;
	286
	287	dprint(DBG_BNODE_MOD, "btree_free_node: %u\n", node->this);
0bf3ba53	288	BUG_ON(!node->this);
1da177e4 LT	289	tree = node->tree;
	290	nidx = node->this;
	291	node = hfs_bnode_find(tree, 0);
	292	if (IS_ERR(node))
	293	return;
	294	len = hfs_brec_lenoff(node, 2, &off);
	295	while (nidx >= len * 8) {
	296	u32 i;
	297
	298	nidx -= len * 8;
	299	i = node->next;
	300	hfs_bnode_put(node);
	301	if (!i) {
	302	/* panic */;
634725a9	303	printk(KERN_CRIT "hfs: unable to free bnode %u. bmap not found!\n", node->this);
1da177e4 LT	304	return;
	305	}
	306	node = hfs_bnode_find(tree, i);
	307	if (IS_ERR(node))
	308	return;
	309	if (node->type != HFS_NODE_MAP) {
	310	/* panic */;
634725a9	311	printk(KERN_CRIT "hfs: invalid bmap found! (%u,%d)\n", node->this, node->type);
1da177e4 LT	312	hfs_bnode_put(node);
	313	return;
	314	}
	315	len = hfs_brec_lenoff(node, 0, &off);
	316	}
	317	off += node->page_offset + nidx / 8;
	318	page = node->page[off >> PAGE_CACHE_SHIFT];
	319	data = kmap(page);
	320	off &= ~PAGE_CACHE_MASK;
	321	m = 1 << (~nidx & 7);
	322	byte = data[off];
	323	if (!(byte & m)) {
634725a9	324	printk(KERN_CRIT "hfs: trying to free free bnode %u(%d)\n", node->this, node->type);
1da177e4 LT	325	kunmap(page);
	326	hfs_bnode_put(node);
	327	return;
	328	}
	329	data[off] = byte & ~m;
	330	set_page_dirty(page);
	331	kunmap(page);
	332	hfs_bnode_put(node);
	333	tree->free_nodes++;
	334	mark_inode_dirty(tree->inode);
	335	}