[linux-block.git] / fs / hfsplus / bnode.c

// SPDX-License-Identifier: GPL-2.0
/*
 *  linux/fs/hfsplus/bnode.c
 *
 * Copyright (C) 2001
 * Brad Boyer (flar@allandria.com)
 * (C) 2003 Ardis Technologies <roman@ardistech.com>
 *
 * Handle basic btree node operations
 */

#include <linux/string.h>
#include <linux/slab.h>
#include <linux/pagemap.h>
#include <linux/fs.h>
#include <linux/swap.h>

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

/* Copy a specified range of bytes from the raw data of a node */
void hfs_bnode_read(struct hfs_bnode *node, void *buf, int off, int len)
{
	struct page **pagep;
	int l;

	off += node->page_offset;
	pagep = node->page + (off >> PAGE_SHIFT);
	off &= ~PAGE_MASK;

	l = min_t(int, len, PAGE_SIZE - off);
	memcpy(buf, kmap(*pagep) + off, l);
	kunmap(*pagep);

	while ((len -= l) != 0) {
		buf += l;
		l = min_t(int, len, PAGE_SIZE);
		memcpy(buf, kmap(*++pagep), l);
		kunmap(*pagep);
	}
}

u16 hfs_bnode_read_u16(struct hfs_bnode *node, int off)
{
	__be16 data;
	/* TODO: optimize later... */
	hfs_bnode_read(node, &data, off, 2);
	return be16_to_cpu(data);
}

u8 hfs_bnode_read_u8(struct hfs_bnode *node, int off)
{
	u8 data;
	/* TODO: optimize later... */
	hfs_bnode_read(node, &data, off, 1);
	return data;
}

void hfs_bnode_read_key(struct hfs_bnode *node, void *key, int off)
{
	struct hfs_btree *tree;
	int key_len;

	tree = node->tree;
	if (node->type == HFS_NODE_LEAF ||
	    tree->attributes & HFS_TREE_VARIDXKEYS ||
	    node->tree->cnid == HFSPLUS_ATTR_CNID)
		key_len = hfs_bnode_read_u16(node, off) + 2;
	else
		key_len = tree->max_key_len + 2;

	hfs_bnode_read(node, key, off, key_len);
}

void hfs_bnode_write(struct hfs_bnode *node, void *buf, int off, int len)
{
	struct page **pagep;
	int l;

	off += node->page_offset;
	pagep = node->page + (off >> PAGE_SHIFT);
	off &= ~PAGE_MASK;

	l = min_t(int, len, PAGE_SIZE - off);
	memcpy(kmap(*pagep) + off, buf, l);
	set_page_dirty(*pagep);
	kunmap(*pagep);

	while ((len -= l) != 0) {
		buf += l;
		l = min_t(int, len, PAGE_SIZE);
		memcpy(kmap(*++pagep), buf, l);
		set_page_dirty(*pagep);
		kunmap(*pagep);
	}
}

void hfs_bnode_write_u16(struct hfs_bnode *node, int off, u16 data)
{
	__be16 v = cpu_to_be16(data);
	/* TODO: optimize later... */
	hfs_bnode_write(node, &v, off, 2);
}

void hfs_bnode_clear(struct hfs_bnode *node, int off, int len)
{
	struct page **pagep;
	int l;

	off += node->page_offset;
	pagep = node->page + (off >> PAGE_SHIFT);
	off &= ~PAGE_MASK;

	l = min_t(int, len, PAGE_SIZE - off);
	memset(kmap(*pagep) + off, 0, l);
	set_page_dirty(*pagep);
	kunmap(*pagep);

	while ((len -= l) != 0) {
		l = min_t(int, len, PAGE_SIZE);
		memset(kmap(*++pagep), 0, l);
		set_page_dirty(*pagep);
		kunmap(*pagep);
	}
}

void hfs_bnode_copy(struct hfs_bnode *dst_node, int dst,
		    struct hfs_bnode *src_node, int src, int len)
{
	struct page **src_page, **dst_page;
	int l;

	hfs_dbg(BNODE_MOD, "copybytes: %u,%u,%u\n", dst, src, len);
	if (!len)
		return;
	src += src_node->page_offset;
	dst += dst_node->page_offset;
	src_page = src_node->page + (src >> PAGE_SHIFT);
	src &= ~PAGE_MASK;
	dst_page = dst_node->page + (dst >> PAGE_SHIFT);
	dst &= ~PAGE_MASK;

	if (src == dst) {
		l = min_t(int, len, PAGE_SIZE - src);
		memcpy(kmap(*dst_page) + src, kmap(*src_page) + src, l);
		kunmap(*src_page);
		set_page_dirty(*dst_page);
		kunmap(*dst_page);

		while ((len -= l) != 0) {
			l = min_t(int, len, PAGE_SIZE);
			memcpy(kmap(*++dst_page), kmap(*++src_page), l);
			kunmap(*src_page);
			set_page_dirty(*dst_page);
			kunmap(*dst_page);
		}
	} else {
		void *src_ptr, *dst_ptr;

		do {
			src_ptr = kmap(*src_page) + src;
			dst_ptr = kmap(*dst_page) + dst;
			if (PAGE_SIZE - src < PAGE_SIZE - dst) {
				l = PAGE_SIZE - src;
				src = 0;
				dst += l;
			} else {
				l = PAGE_SIZE - dst;
				src += l;
				dst = 0;
			}
			l = min(len, l);
			memcpy(dst_ptr, src_ptr, l);
			kunmap(*src_page);
			set_page_dirty(*dst_page);
			kunmap(*dst_page);
			if (!dst)
				dst_page++;
			else
				src_page++;
		} while ((len -= l));
	}
}

void hfs_bnode_move(struct hfs_bnode *node, int dst, int src, int len)
{
	struct page **src_page, **dst_page;
	int l;

	hfs_dbg(BNODE_MOD, "movebytes: %u,%u,%u\n", dst, src, len);
	if (!len)
		return;
	src += node->page_offset;
	dst += node->page_offset;
	if (dst > src) {
		src += len - 1;
		src_page = node->page + (src >> PAGE_SHIFT);
		src = (src & ~PAGE_MASK) + 1;
		dst += len - 1;
		dst_page = node->page + (dst >> PAGE_SHIFT);
		dst = (dst & ~PAGE_MASK) + 1;

		if (src == dst) {
			while (src < len) {
				memmove(kmap(*dst_page), kmap(*src_page), src);
				kunmap(*src_page);
				set_page_dirty(*dst_page);
				kunmap(*dst_page);
				len -= src;
				src = PAGE_SIZE;
				src_page--;
				dst_page--;
			}
			src -= len;
			memmove(kmap(*dst_page) + src,
				kmap(*src_page) + src, len);
			kunmap(*src_page);
			set_page_dirty(*dst_page);
			kunmap(*dst_page);
		} else {
			void *src_ptr, *dst_ptr;

			do {
				src_ptr = kmap(*src_page) + src;
				dst_ptr = kmap(*dst_page) + dst;
				if (src < dst) {
					l = src;
					src = PAGE_SIZE;
					dst -= l;
				} else {
					l = dst;
					src -= l;
					dst = PAGE_SIZE;
				}
				l = min(len, l);
				memmove(dst_ptr - l, src_ptr - l, l);
				kunmap(*src_page);
				set_page_dirty(*dst_page);
				kunmap(*dst_page);
				if (dst == PAGE_SIZE)
					dst_page--;
				else
					src_page--;
			} while ((len -= l));
		}
	} else {
		src_page = node->page + (src >> PAGE_SHIFT);
		src &= ~PAGE_MASK;
		dst_page = node->page + (dst >> PAGE_SHIFT);
		dst &= ~PAGE_MASK;

		if (src == dst) {
			l = min_t(int, len, PAGE_SIZE - src);
			memmove(kmap(*dst_page) + src,
				kmap(*src_page) + src, l);
			kunmap(*src_page);
			set_page_dirty(*dst_page);
			kunmap(*dst_page);

			while ((len -= l) != 0) {
				l = min_t(int, len, PAGE_SIZE);
				memmove(kmap(*++dst_page),
					kmap(*++src_page), l);
				kunmap(*src_page);
				set_page_dirty(*dst_page);
				kunmap(*dst_page);
			}
		} else {
			void *src_ptr, *dst_ptr;

			do {
				src_ptr = kmap(*src_page) + src;
				dst_ptr = kmap(*dst_page) + dst;
				if (PAGE_SIZE - src <
						PAGE_SIZE - dst) {
					l = PAGE_SIZE - src;
					src = 0;
					dst += l;
				} else {
					l = PAGE_SIZE - dst;
					src += l;
					dst = 0;
				}
				l = min(len, l);
				memmove(dst_ptr, src_ptr, l);
				kunmap(*src_page);
				set_page_dirty(*dst_page);
				kunmap(*dst_page);
				if (!dst)
					dst_page++;
				else
					src_page++;
			} while ((len -= l));
		}
	}
}

void hfs_bnode_dump(struct hfs_bnode *node)
{
	struct hfs_bnode_desc desc;
	__be32 cnid;
	int i, off, key_off;

	hfs_dbg(BNODE_MOD, "bnode: %d\n", node->this);
	hfs_bnode_read(node, &desc, 0, sizeof(desc));
	hfs_dbg(BNODE_MOD, "%d, %d, %d, %d, %d\n",
		be32_to_cpu(desc.next), be32_to_cpu(desc.prev),
		desc.type, desc.height, be16_to_cpu(desc.num_recs));

	off = node->tree->node_size - 2;
	for (i = be16_to_cpu(desc.num_recs); i >= 0; off -= 2, i--) {
		key_off = hfs_bnode_read_u16(node, off);
		hfs_dbg(BNODE_MOD, " %d", key_off);
		if (i && node->type == HFS_NODE_INDEX) {
			int tmp;

			if (node->tree->attributes & HFS_TREE_VARIDXKEYS ||
					node->tree->cnid == HFSPLUS_ATTR_CNID)
				tmp = hfs_bnode_read_u16(node, key_off) + 2;
			else
				tmp = node->tree->max_key_len + 2;
			hfs_dbg_cont(BNODE_MOD, " (%d", tmp);
			hfs_bnode_read(node, &cnid, key_off + tmp, 4);
			hfs_dbg_cont(BNODE_MOD, ",%d)", be32_to_cpu(cnid));
		} else if (i && node->type == HFS_NODE_LEAF) {
			int tmp;

			tmp = hfs_bnode_read_u16(node, key_off);
			hfs_dbg_cont(BNODE_MOD, " (%d)", tmp);
		}
	}
	hfs_dbg_cont(BNODE_MOD, "\n");
}

void hfs_bnode_unlink(struct hfs_bnode *node)
{
	struct hfs_btree *tree;
	struct hfs_bnode *tmp;
	__be32 cnid;

	tree = node->tree;
	if (node->prev) {
		tmp = hfs_bnode_find(tree, node->prev);
		if (IS_ERR(tmp))
			return;
		tmp->next = node->next;
		cnid = cpu_to_be32(tmp->next);
		hfs_bnode_write(tmp, &cnid,
			offsetof(struct hfs_bnode_desc, next), 4);
		hfs_bnode_put(tmp);
	} else if (node->type == HFS_NODE_LEAF)
		tree->leaf_head = node->next;

	if (node->next) {
		tmp = hfs_bnode_find(tree, node->next);
		if (IS_ERR(tmp))
			return;
		tmp->prev = node->prev;
		cnid = cpu_to_be32(tmp->prev);
		hfs_bnode_write(tmp, &cnid,
			offsetof(struct hfs_bnode_desc, prev), 4);
		hfs_bnode_put(tmp);
	} else if (node->type == HFS_NODE_LEAF)
		tree->leaf_tail = node->prev;

	/* move down? */
	if (!node->prev && !node->next)
		hfs_dbg(BNODE_MOD, "hfs_btree_del_level\n");
	if (!node->parent) {
		tree->root = 0;
		tree->depth = 0;
	}
	set_bit(HFS_BNODE_DELETED, &node->flags);
}

static inline int hfs_bnode_hash(u32 num)
{
	num = (num >> 16) + num;
	num += num >> 8;
	return num & (NODE_HASH_SIZE - 1);
}

struct hfs_bnode *hfs_bnode_findhash(struct hfs_btree *tree, u32 cnid)
{
	struct hfs_bnode *node;

	if (cnid >= tree->node_count) {
		pr_err("request for non-existent node %d in B*Tree\n",
		       cnid);
		return NULL;
	}

	for (node = tree->node_hash[hfs_bnode_hash(cnid)];
			node; node = node->next_hash)
		if (node->this == cnid)
			return node;
	return NULL;
}

static struct hfs_bnode *__hfs_bnode_create(struct hfs_btree *tree, u32 cnid)
{
	struct hfs_bnode *node, *node2;
	struct address_space *mapping;
	struct page *page;
	int size, block, i, hash;
	loff_t off;

	if (cnid >= tree->node_count) {
		pr_err("request for non-existent node %d in B*Tree\n",
		       cnid);
		return NULL;
	}

	size = sizeof(struct hfs_bnode) + tree->pages_per_bnode *
		sizeof(struct page *);
	node = kzalloc(size, GFP_KERNEL);
	if (!node)
		return NULL;
	node->tree = tree;
	node->this = cnid;
	set_bit(HFS_BNODE_NEW, &node->flags);
	atomic_set(&node->refcnt, 1);
	hfs_dbg(BNODE_REFS, "new_node(%d:%d): 1\n",
		node->tree->cnid, node->this);
	init_waitqueue_head(&node->lock_wq);
	spin_lock(&tree->hash_lock);
	node2 = hfs_bnode_findhash(tree, cnid);
	if (!node2) {
		hash = hfs_bnode_hash(cnid);
		node->next_hash = tree->node_hash[hash];
		tree->node_hash[hash] = node;
		tree->node_hash_cnt++;
	} else {
		spin_unlock(&tree->hash_lock);
		kfree(node);
		wait_event(node2->lock_wq,
			!test_bit(HFS_BNODE_NEW, &node2->flags));
		return node2;
	}
	spin_unlock(&tree->hash_lock);

	mapping = tree->inode->i_mapping;
	off = (loff_t)cnid << tree->node_size_shift;
	block = off >> PAGE_SHIFT;
	node->page_offset = off & ~PAGE_MASK;
	for (i = 0; i < tree->pages_per_bnode; block++, i++) {
		page = read_mapping_page(mapping, block, NULL);
		if (IS_ERR(page))
			goto fail;
		if (PageError(page)) {
			put_page(page);
			goto fail;
		}
		node->page[i] = page;
	}

	return node;
fail:
	set_bit(HFS_BNODE_ERROR, &node->flags);
	return node;
}

void hfs_bnode_unhash(struct hfs_bnode *node)
{
	struct hfs_bnode **p;

	hfs_dbg(BNODE_REFS, "remove_node(%d:%d): %d\n",
		node->tree->cnid, node->this, atomic_read(&node->refcnt));
	for (p = &node->tree->node_hash[hfs_bnode_hash(node->this)];
	     *p && *p != node; p = &(*p)->next_hash)
		;
	BUG_ON(!*p);
	*p = node->next_hash;
	node->tree->node_hash_cnt--;
}

/* Load a particular node out of a tree */
struct hfs_bnode *hfs_bnode_find(struct hfs_btree *tree, u32 num)
{
	struct hfs_bnode *node;
	struct hfs_bnode_desc *desc;
	int i, rec_off, off, next_off;
	int entry_size, key_size;

	spin_lock(&tree->hash_lock);
	node = hfs_bnode_findhash(tree, num);
	if (node) {
		hfs_bnode_get(node);
		spin_unlock(&tree->hash_lock);
		wait_event(node->lock_wq,
			!test_bit(HFS_BNODE_NEW, &node->flags));
		if (test_bit(HFS_BNODE_ERROR, &node->flags))
			goto node_error;
		return node;
	}
	spin_unlock(&tree->hash_lock);
	node = __hfs_bnode_create(tree, num);
	if (!node)
		return ERR_PTR(-ENOMEM);
	if (test_bit(HFS_BNODE_ERROR, &node->flags))
		goto node_error;
	if (!test_bit(HFS_BNODE_NEW, &node->flags))
		return node;

	desc = (struct hfs_bnode_desc *)(kmap(node->page[0]) +
			node->page_offset);
	node->prev = be32_to_cpu(desc->prev);
	node->next = be32_to_cpu(desc->next);
	node->num_recs = be16_to_cpu(desc->num_recs);
	node->type = desc->type;
	node->height = desc->height;
	kunmap(node->page[0]);

	switch (node->type) {
	case HFS_NODE_HEADER:
	case HFS_NODE_MAP:
		if (node->height != 0)
			goto node_error;
		break;
	case HFS_NODE_LEAF:
		if (node->height != 1)
			goto node_error;
		break;
	case HFS_NODE_INDEX:
		if (node->height <= 1 || node->height > tree->depth)
			goto node_error;
		break;
	default:
		goto node_error;
	}

	rec_off = tree->node_size - 2;
	off = hfs_bnode_read_u16(node, rec_off);
	if (off != sizeof(struct hfs_bnode_desc))
		goto node_error;
	for (i = 1; i <= node->num_recs; off = next_off, i++) {
		rec_off -= 2;
		next_off = hfs_bnode_read_u16(node, rec_off);
		if (next_off <= off ||
		    next_off > tree->node_size ||
		    next_off & 1)
			goto node_error;
		entry_size = next_off - off;
		if (node->type != HFS_NODE_INDEX &&
		    node->type != HFS_NODE_LEAF)
			continue;
		key_size = hfs_bnode_read_u16(node, off) + 2;
		if (key_size >= entry_size || key_size & 1)
			goto node_error;
	}
	clear_bit(HFS_BNODE_NEW, &node->flags);
	wake_up(&node->lock_wq);
	return node;

node_error:
	set_bit(HFS_BNODE_ERROR, &node->flags);
	clear_bit(HFS_BNODE_NEW, &node->flags);
	wake_up(&node->lock_wq);
	hfs_bnode_put(node);
	return ERR_PTR(-EIO);
}

void hfs_bnode_free(struct hfs_bnode *node)
{
	int i;

	for (i = 0; i < node->tree->pages_per_bnode; i++)
		if (node->page[i])
			put_page(node->page[i]);
	kfree(node);
}

struct hfs_bnode *hfs_bnode_create(struct hfs_btree *tree, u32 num)
{
	struct hfs_bnode *node;
	struct page **pagep;
	int i;

	spin_lock(&tree->hash_lock);
	node = hfs_bnode_findhash(tree, num);
	spin_unlock(&tree->hash_lock);
	if (node) {
		pr_crit("new node %u already hashed?\n", num);
		WARN_ON(1);
		return node;
	}
	node = __hfs_bnode_create(tree, num);
	if (!node)
		return ERR_PTR(-ENOMEM);
	if (test_bit(HFS_BNODE_ERROR, &node->flags)) {
		hfs_bnode_put(node);
		return ERR_PTR(-EIO);
	}

	pagep = node->page;
	memset(kmap(*pagep) + node->page_offset, 0,
	       min_t(int, PAGE_SIZE, tree->node_size));
	set_page_dirty(*pagep);
	kunmap(*pagep);
	for (i = 1; i < tree->pages_per_bnode; i++) {
		memset(kmap(*++pagep), 0, PAGE_SIZE);
		set_page_dirty(*pagep);
		kunmap(*pagep);
	}
	clear_bit(HFS_BNODE_NEW, &node->flags);
	wake_up(&node->lock_wq);

	return node;
}

void hfs_bnode_get(struct hfs_bnode *node)
{
	if (node) {
		atomic_inc(&node->refcnt);
		hfs_dbg(BNODE_REFS, "get_node(%d:%d): %d\n",
			node->tree->cnid, node->this,
			atomic_read(&node->refcnt));
	}
}

/* Dispose of resources used by a node */
void hfs_bnode_put(struct hfs_bnode *node)
{
	if (node) {
		struct hfs_btree *tree = node->tree;
		int i;

		hfs_dbg(BNODE_REFS, "put_node(%d:%d): %d\n",
			node->tree->cnid, node->this,
			atomic_read(&node->refcnt));
		BUG_ON(!atomic_read(&node->refcnt));
		if (!atomic_dec_and_lock(&node->refcnt, &tree->hash_lock))
			return;
		for (i = 0; i < tree->pages_per_bnode; i++) {
			if (!node->page[i])
				continue;
			mark_page_accessed(node->page[i]);
		}

		if (test_bit(HFS_BNODE_DELETED, &node->flags)) {
			hfs_bnode_unhash(node);
			spin_unlock(&tree->hash_lock);
			if (hfs_bnode_need_zeroout(tree))
				hfs_bnode_clear(node, 0, tree->node_size);
			hfs_bmap_free(node);
			hfs_bnode_free(node);
			return;
		}
		spin_unlock(&tree->hash_lock);
	}
}

/*
 * Unused nodes have to be zeroed if this is the catalog tree and
 * a corresponding flag in the volume header is set.
 */
bool hfs_bnode_need_zeroout(struct hfs_btree *tree)
{
	struct super_block *sb = tree->inode->i_sb;
	struct hfsplus_sb_info *sbi = HFSPLUS_SB(sb);
	const u32 volume_attr = be32_to_cpu(sbi->s_vhdr->attributes);

	return tree->cnid == HFSPLUS_CAT_CNID &&
		volume_attr & HFSPLUS_VOL_UNUSED_NODE_FIX;
}
Commit	Line	Data
b2441318	1	// SPDX-License-Identifier: GPL-2.0
1da177e4 LT	2	/*
	3	* linux/fs/hfsplus/bnode.c
	4	*
	5	* Copyright (C) 2001
	6	* Brad Boyer (flar@allandria.com)
	7	* (C) 2003 Ardis Technologies <roman@ardistech.com>
	8	*
	9	* Handle basic btree node operations
	10	*/
	11
	12	#include <linux/string.h>
	13	#include <linux/slab.h>
	14	#include <linux/pagemap.h>
	15	#include <linux/fs.h>
	16	#include <linux/swap.h>
1da177e4 LT	17
	18	#include "hfsplus_fs.h"
	19	#include "hfsplus_raw.h"
	20
1da177e4 LT	21	/* Copy a specified range of bytes from the raw data of a node */
	22	void hfs_bnode_read(struct hfs_bnode node, void buf, int off, int len)
	23	{
	24	struct page **pagep;
	25	int l;
	26
	27	off += node->page_offset;
09cbfeaf KS	28	pagep = node->page + (off >> PAGE_SHIFT);
09cbfeaf KS	29	off &= ~PAGE_MASK;
1da177e4	30
09cbfeaf	31	l = min_t(int, len, PAGE_SIZE - off);
1da177e4 LT	32	memcpy(buf, kmap(*pagep) + off, l);
	33	kunmap(*pagep);
	34
	35	while ((len -= l) != 0) {
	36	buf += l;
09cbfeaf	37	l = min_t(int, len, PAGE_SIZE);
1da177e4 LT	38	memcpy(buf, kmap(*++pagep), l);
	39	kunmap(*pagep);
	40	}
	41	}
	42
	43	u16 hfs_bnode_read_u16(struct hfs_bnode *node, int off)
	44	{
	45	__be16 data;
21f2296a	46	/* TODO: optimize later... */
1da177e4 LT	47	hfs_bnode_read(node, &data, off, 2);
	48	return be16_to_cpu(data);
	49	}
	50
	51	u8 hfs_bnode_read_u8(struct hfs_bnode *node, int off)
	52	{
	53	u8 data;
21f2296a	54	/* TODO: optimize later... */
1da177e4 LT	55	hfs_bnode_read(node, &data, off, 1);
	56	return data;
	57	}
	58
	59	void hfs_bnode_read_key(struct hfs_bnode node, void key, int off)
	60	{
	61	struct hfs_btree *tree;
	62	int key_len;
	63
	64	tree = node->tree;
	65	if (node->type == HFS_NODE_LEAF \|\|
324ef39a VD	66	tree->attributes & HFS_TREE_VARIDXKEYS \|\|
324ef39a VD	67	node->tree->cnid == HFSPLUS_ATTR_CNID)
1da177e4 LT	68	key_len = hfs_bnode_read_u16(node, off) + 2;
	69	else
	70	key_len = tree->max_key_len + 2;
	71
	72	hfs_bnode_read(node, key, off, key_len);
	73	}
	74
	75	void hfs_bnode_write(struct hfs_bnode node, void buf, int off, int len)
	76	{
	77	struct page **pagep;
	78	int l;
	79
	80	off += node->page_offset;
09cbfeaf KS	81	pagep = node->page + (off >> PAGE_SHIFT);
09cbfeaf KS	82	off &= ~PAGE_MASK;
1da177e4	83
09cbfeaf	84	l = min_t(int, len, PAGE_SIZE - off);
1da177e4 LT	85	memcpy(kmap(*pagep) + off, buf, l);
	86	set_page_dirty(*pagep);
	87	kunmap(*pagep);
	88
	89	while ((len -= l) != 0) {
	90	buf += l;
09cbfeaf	91	l = min_t(int, len, PAGE_SIZE);
1da177e4 LT	92	memcpy(kmap(*++pagep), buf, l);
	93	set_page_dirty(*pagep);
	94	kunmap(*pagep);
	95	}
	96	}
	97
	98	void hfs_bnode_write_u16(struct hfs_bnode *node, int off, u16 data)
	99	{
	100	__be16 v = cpu_to_be16(data);
21f2296a	101	/* TODO: optimize later... */
1da177e4 LT	102	hfs_bnode_write(node, &v, off, 2);
	103	}
	104
	105	void hfs_bnode_clear(struct hfs_bnode *node, int off, int len)
	106	{
	107	struct page **pagep;
	108	int l;
	109
	110	off += node->page_offset;
09cbfeaf KS	111	pagep = node->page + (off >> PAGE_SHIFT);
09cbfeaf KS	112	off &= ~PAGE_MASK;
1da177e4	113
09cbfeaf	114	l = min_t(int, len, PAGE_SIZE - off);
1da177e4 LT	115	memset(kmap(*pagep) + off, 0, l);
	116	set_page_dirty(*pagep);
	117	kunmap(*pagep);
	118
	119	while ((len -= l) != 0) {
09cbfeaf	120	l = min_t(int, len, PAGE_SIZE);
1da177e4 LT	121	memset(kmap(*++pagep), 0, l);
	122	set_page_dirty(*pagep);
	123	kunmap(*pagep);
	124	}
	125	}
	126
	127	void hfs_bnode_copy(struct hfs_bnode *dst_node, int dst,
	128	struct hfs_bnode *src_node, int src, int len)
	129	{
1da177e4 LT	130	struct page src_page, dst_page;
	131	int l;
	132
c2b3e1f7	133	hfs_dbg(BNODE_MOD, "copybytes: %u,%u,%u\n", dst, src, len);
1da177e4 LT	134	if (!len)
1da177e4 LT	135	return;
1da177e4 LT	136	src += src_node->page_offset;
1da177e4 LT	137	dst += dst_node->page_offset;
09cbfeaf KS	138	src_page = src_node->page + (src >> PAGE_SHIFT);
	139	src &= ~PAGE_MASK;
	140	dst_page = dst_node->page + (dst >> PAGE_SHIFT);
	141	dst &= ~PAGE_MASK;
1da177e4 LT	142
1da177e4 LT	143	if (src == dst) {
09cbfeaf	144	l = min_t(int, len, PAGE_SIZE - src);
1da177e4 LT	145	memcpy(kmap(dst_page) + src, kmap(src_page) + src, l);
	146	kunmap(*src_page);
	147	set_page_dirty(*dst_page);
	148	kunmap(*dst_page);
	149
	150	while ((len -= l) != 0) {
09cbfeaf	151	l = min_t(int, len, PAGE_SIZE);
1da177e4 LT	152	memcpy(kmap(++dst_page), kmap(++src_page), l);
	153	kunmap(*src_page);
	154	set_page_dirty(*dst_page);
	155	kunmap(*dst_page);
	156	}
	157	} else {
	158	void src_ptr, dst_ptr;
	159
	160	do {
	161	src_ptr = kmap(*src_page) + src;
	162	dst_ptr = kmap(*dst_page) + dst;
09cbfeaf KS	163	if (PAGE_SIZE - src < PAGE_SIZE - dst) {
09cbfeaf KS	164	l = PAGE_SIZE - src;
1da177e4 LT	165	src = 0;
	166	dst += l;
	167	} else {
09cbfeaf	168	l = PAGE_SIZE - dst;
1da177e4 LT	169	src += l;
	170	dst = 0;
	171	}
	172	l = min(len, l);
	173	memcpy(dst_ptr, src_ptr, l);
	174	kunmap(*src_page);
	175	set_page_dirty(*dst_page);
	176	kunmap(*dst_page);
	177	if (!dst)
	178	dst_page++;
	179	else
	180	src_page++;
	181	} while ((len -= l));
	182	}
	183	}
	184
	185	void hfs_bnode_move(struct hfs_bnode *node, int dst, int src, int len)
	186	{
	187	struct page src_page, dst_page;
	188	int l;
	189
c2b3e1f7	190	hfs_dbg(BNODE_MOD, "movebytes: %u,%u,%u\n", dst, src, len);
1da177e4 LT	191	if (!len)
	192	return;
	193	src += node->page_offset;
	194	dst += node->page_offset;
	195	if (dst > src) {
	196	src += len - 1;
09cbfeaf KS	197	src_page = node->page + (src >> PAGE_SHIFT);
09cbfeaf KS	198	src = (src & ~PAGE_MASK) + 1;
1da177e4	199	dst += len - 1;
09cbfeaf KS	200	dst_page = node->page + (dst >> PAGE_SHIFT);
09cbfeaf KS	201	dst = (dst & ~PAGE_MASK) + 1;
1da177e4 LT	202
	203	if (src == dst) {
	204	while (src < len) {
	205	memmove(kmap(dst_page), kmap(src_page), src);
	206	kunmap(*src_page);
	207	set_page_dirty(*dst_page);
	208	kunmap(*dst_page);
	209	len -= src;
09cbfeaf	210	src = PAGE_SIZE;
1da177e4 LT	211	src_page--;
	212	dst_page--;
	213	}
	214	src -= len;
2753cc28 AS	215	memmove(kmap(*dst_page) + src,
2753cc28 AS	216	kmap(*src_page) + src, len);
1da177e4 LT	217	kunmap(*src_page);
	218	set_page_dirty(*dst_page);
	219	kunmap(*dst_page);
	220	} else {
	221	void src_ptr, dst_ptr;
	222
	223	do {
	224	src_ptr = kmap(*src_page) + src;
	225	dst_ptr = kmap(*dst_page) + dst;
	226	if (src < dst) {
	227	l = src;
09cbfeaf	228	src = PAGE_SIZE;
1da177e4 LT	229	dst -= l;
	230	} else {
	231	l = dst;
	232	src -= l;
09cbfeaf	233	dst = PAGE_SIZE;
1da177e4 LT	234	}
	235	l = min(len, l);
	236	memmove(dst_ptr - l, src_ptr - l, l);
	237	kunmap(*src_page);
	238	set_page_dirty(*dst_page);
	239	kunmap(*dst_page);
09cbfeaf	240	if (dst == PAGE_SIZE)
1da177e4 LT	241	dst_page--;
	242	else
	243	src_page--;
	244	} while ((len -= l));
	245	}
	246	} else {
09cbfeaf KS	247	src_page = node->page + (src >> PAGE_SHIFT);
	248	src &= ~PAGE_MASK;
	249	dst_page = node->page + (dst >> PAGE_SHIFT);
	250	dst &= ~PAGE_MASK;
1da177e4 LT	251
1da177e4 LT	252	if (src == dst) {
09cbfeaf	253	l = min_t(int, len, PAGE_SIZE - src);
2753cc28 AS	254	memmove(kmap(*dst_page) + src,
2753cc28 AS	255	kmap(*src_page) + src, l);
1da177e4 LT	256	kunmap(*src_page);
	257	set_page_dirty(*dst_page);
	258	kunmap(*dst_page);
	259
	260	while ((len -= l) != 0) {
09cbfeaf	261	l = min_t(int, len, PAGE_SIZE);
2753cc28 AS	262	memmove(kmap(*++dst_page),
2753cc28 AS	263	kmap(*++src_page), l);
1da177e4 LT	264	kunmap(*src_page);
	265	set_page_dirty(*dst_page);
	266	kunmap(*dst_page);
	267	}
	268	} else {
	269	void src_ptr, dst_ptr;
	270
	271	do {
	272	src_ptr = kmap(*src_page) + src;
	273	dst_ptr = kmap(*dst_page) + dst;
09cbfeaf KS	274	if (PAGE_SIZE - src <
	275	PAGE_SIZE - dst) {
	276	l = PAGE_SIZE - src;
1da177e4 LT	277	src = 0;
	278	dst += l;
	279	} else {
09cbfeaf	280	l = PAGE_SIZE - dst;
1da177e4 LT	281	src += l;
	282	dst = 0;
	283	}
	284	l = min(len, l);
	285	memmove(dst_ptr, src_ptr, l);
	286	kunmap(*src_page);
	287	set_page_dirty(*dst_page);
	288	kunmap(*dst_page);
	289	if (!dst)
	290	dst_page++;
	291	else
	292	src_page++;
	293	} while ((len -= l));
	294	}
	295	}
	296	}
	297
	298	void hfs_bnode_dump(struct hfs_bnode *node)
	299	{
	300	struct hfs_bnode_desc desc;
	301	__be32 cnid;
	302	int i, off, key_off;
	303
c2b3e1f7	304	hfs_dbg(BNODE_MOD, "bnode: %d\n", node->this);
1da177e4	305	hfs_bnode_read(node, &desc, 0, sizeof(desc));
c2b3e1f7	306	hfs_dbg(BNODE_MOD, "%d, %d, %d, %d, %d\n",
1da177e4 LT	307	be32_to_cpu(desc.next), be32_to_cpu(desc.prev),
	308	desc.type, desc.height, be16_to_cpu(desc.num_recs));
	309
	310	off = node->tree->node_size - 2;
	311	for (i = be16_to_cpu(desc.num_recs); i >= 0; off -= 2, i--) {
	312	key_off = hfs_bnode_read_u16(node, off);
c2b3e1f7	313	hfs_dbg(BNODE_MOD, " %d", key_off);
1da177e4 LT	314	if (i && node->type == HFS_NODE_INDEX) {
	315	int tmp;
	316
324ef39a VD	317	if (node->tree->attributes & HFS_TREE_VARIDXKEYS \|\|
324ef39a VD	318	node->tree->cnid == HFSPLUS_ATTR_CNID)
1da177e4 LT	319	tmp = hfs_bnode_read_u16(node, key_off) + 2;
	320	else
	321	tmp = node->tree->max_key_len + 2;
c2b3e1f7	322	hfs_dbg_cont(BNODE_MOD, " (%d", tmp);
1da177e4	323	hfs_bnode_read(node, &cnid, key_off + tmp, 4);
c2b3e1f7	324	hfs_dbg_cont(BNODE_MOD, ",%d)", be32_to_cpu(cnid));
1da177e4 LT	325	} else if (i && node->type == HFS_NODE_LEAF) {
	326	int tmp;
	327
	328	tmp = hfs_bnode_read_u16(node, key_off);
c2b3e1f7	329	hfs_dbg_cont(BNODE_MOD, " (%d)", tmp);
1da177e4 LT	330	}
1da177e4 LT	331	}
c2b3e1f7	332	hfs_dbg_cont(BNODE_MOD, "\n");
1da177e4 LT	333	}
	334
	335	void hfs_bnode_unlink(struct hfs_bnode *node)
	336	{
	337	struct hfs_btree *tree;
	338	struct hfs_bnode *tmp;
	339	__be32 cnid;
	340
	341	tree = node->tree;
	342	if (node->prev) {
	343	tmp = hfs_bnode_find(tree, node->prev);
	344	if (IS_ERR(tmp))
	345	return;
	346	tmp->next = node->next;
	347	cnid = cpu_to_be32(tmp->next);
2753cc28 AS	348	hfs_bnode_write(tmp, &cnid,
2753cc28 AS	349	offsetof(struct hfs_bnode_desc, next), 4);
1da177e4 LT	350	hfs_bnode_put(tmp);
	351	} else if (node->type == HFS_NODE_LEAF)
	352	tree->leaf_head = node->next;
	353
	354	if (node->next) {
	355	tmp = hfs_bnode_find(tree, node->next);
	356	if (IS_ERR(tmp))
	357	return;
	358	tmp->prev = node->prev;
	359	cnid = cpu_to_be32(tmp->prev);
2753cc28 AS	360	hfs_bnode_write(tmp, &cnid,
2753cc28 AS	361	offsetof(struct hfs_bnode_desc, prev), 4);
1da177e4 LT	362	hfs_bnode_put(tmp);
	363	} else if (node->type == HFS_NODE_LEAF)
	364	tree->leaf_tail = node->prev;
	365
21f2296a	366	/* move down? */
b2837fcf	367	if (!node->prev && !node->next)
c2b3e1f7	368	hfs_dbg(BNODE_MOD, "hfs_btree_del_level\n");
1da177e4 LT	369	if (!node->parent) {
	370	tree->root = 0;
	371	tree->depth = 0;
	372	}
	373	set_bit(HFS_BNODE_DELETED, &node->flags);
	374	}
	375
	376	static inline int hfs_bnode_hash(u32 num)
	377	{
	378	num = (num >> 16) + num;
	379	num += num >> 8;
	380	return num & (NODE_HASH_SIZE - 1);
	381	}
	382
	383	struct hfs_bnode hfs_bnode_findhash(struct hfs_btree tree, u32 cnid)
	384	{
	385	struct hfs_bnode *node;
	386
	387	if (cnid >= tree->node_count) {
e46707d1 FF	388	pr_err("request for non-existent node %d in B*Tree\n",
e46707d1 FF	389	cnid);
1da177e4 LT	390	return NULL;
	391	}
	392
	393	for (node = tree->node_hash[hfs_bnode_hash(cnid)];
b2837fcf AS	394	node; node = node->next_hash)
b2837fcf AS	395	if (node->this == cnid)
1da177e4	396	return node;
1da177e4 LT	397	return NULL;
	398	}
	399
	400	static struct hfs_bnode __hfs_bnode_create(struct hfs_btree tree, u32 cnid)
	401	{
1da177e4 LT	402	struct hfs_bnode node, node2;
	403	struct address_space *mapping;
	404	struct page *page;
	405	int size, block, i, hash;
	406	loff_t off;
	407
	408	if (cnid >= tree->node_count) {
e46707d1 FF	409	pr_err("request for non-existent node %d in B*Tree\n",
e46707d1 FF	410	cnid);
1da177e4 LT	411	return NULL;
	412	}
	413
1da177e4 LT	414	size = sizeof(struct hfs_bnode) + tree->pages_per_bnode *
1da177e4 LT	415	sizeof(struct page *);
f8314dc6	416	node = kzalloc(size, GFP_KERNEL);
1da177e4 LT	417	if (!node)
1da177e4 LT	418	return NULL;
1da177e4 LT	419	node->tree = tree;
	420	node->this = cnid;
	421	set_bit(HFS_BNODE_NEW, &node->flags);
	422	atomic_set(&node->refcnt, 1);
c2b3e1f7 JP	423	hfs_dbg(BNODE_REFS, "new_node(%d:%d): 1\n",
c2b3e1f7 JP	424	node->tree->cnid, node->this);
1da177e4 LT	425	init_waitqueue_head(&node->lock_wq);
	426	spin_lock(&tree->hash_lock);
	427	node2 = hfs_bnode_findhash(tree, cnid);
	428	if (!node2) {
	429	hash = hfs_bnode_hash(cnid);
	430	node->next_hash = tree->node_hash[hash];
	431	tree->node_hash[hash] = node;
	432	tree->node_hash_cnt++;
	433	} else {
	434	spin_unlock(&tree->hash_lock);
	435	kfree(node);
2753cc28 AS	436	wait_event(node2->lock_wq,
2753cc28 AS	437	!test_bit(HFS_BNODE_NEW, &node2->flags));
1da177e4 LT	438	return node2;
	439	}
	440	spin_unlock(&tree->hash_lock);
	441
	442	mapping = tree->inode->i_mapping;
	443	off = (loff_t)cnid << tree->node_size_shift;
09cbfeaf KS	444	block = off >> PAGE_SHIFT;
09cbfeaf KS	445	node->page_offset = off & ~PAGE_MASK;
1da177e4	446	for (i = 0; i < tree->pages_per_bnode; block++, i++) {
090d2b18	447	page = read_mapping_page(mapping, block, NULL);
1da177e4 LT	448	if (IS_ERR(page))
	449	goto fail;
	450	if (PageError(page)) {
09cbfeaf	451	put_page(page);
1da177e4 LT	452	goto fail;
1da177e4 LT	453	}
1da177e4 LT	454	node->page[i] = page;
	455	}
	456
	457	return node;
	458	fail:
	459	set_bit(HFS_BNODE_ERROR, &node->flags);
	460	return node;
	461	}
	462
	463	void hfs_bnode_unhash(struct hfs_bnode *node)
	464	{
	465	struct hfs_bnode **p;
	466
c2b3e1f7	467	hfs_dbg(BNODE_REFS, "remove_node(%d:%d): %d\n",
1da177e4 LT	468	node->tree->cnid, node->this, atomic_read(&node->refcnt));
	469	for (p = &node->tree->node_hash[hfs_bnode_hash(node->this)];
	470	p && p != node; p = &(*p)->next_hash)
	471	;
0bf3ba53	472	BUG_ON(!*p);
1da177e4 LT	473	*p = node->next_hash;
	474	node->tree->node_hash_cnt--;
	475	}
	476
	477	/* Load a particular node out of a tree */
	478	struct hfs_bnode hfs_bnode_find(struct hfs_btree tree, u32 num)
	479	{
	480	struct hfs_bnode *node;
	481	struct hfs_bnode_desc *desc;
	482	int i, rec_off, off, next_off;
	483	int entry_size, key_size;
	484
	485	spin_lock(&tree->hash_lock);
	486	node = hfs_bnode_findhash(tree, num);
	487	if (node) {
	488	hfs_bnode_get(node);
	489	spin_unlock(&tree->hash_lock);
2753cc28 AS	490	wait_event(node->lock_wq,
2753cc28 AS	491	!test_bit(HFS_BNODE_NEW, &node->flags));
1da177e4 LT	492	if (test_bit(HFS_BNODE_ERROR, &node->flags))
	493	goto node_error;
	494	return node;
	495	}
	496	spin_unlock(&tree->hash_lock);
	497	node = __hfs_bnode_create(tree, num);
	498	if (!node)
	499	return ERR_PTR(-ENOMEM);
	500	if (test_bit(HFS_BNODE_ERROR, &node->flags))
	501	goto node_error;
	502	if (!test_bit(HFS_BNODE_NEW, &node->flags))
	503	return node;
	504
2753cc28 AS	505	desc = (struct hfs_bnode_desc *)(kmap(node->page[0]) +
2753cc28 AS	506	node->page_offset);
1da177e4 LT	507	node->prev = be32_to_cpu(desc->prev);
	508	node->next = be32_to_cpu(desc->next);
	509	node->num_recs = be16_to_cpu(desc->num_recs);
	510	node->type = desc->type;
	511	node->height = desc->height;
	512	kunmap(node->page[0]);
	513
	514	switch (node->type) {
	515	case HFS_NODE_HEADER:
	516	case HFS_NODE_MAP:
	517	if (node->height != 0)
	518	goto node_error;
	519	break;
	520	case HFS_NODE_LEAF:
	521	if (node->height != 1)
	522	goto node_error;
	523	break;
	524	case HFS_NODE_INDEX:
	525	if (node->height <= 1 \|\| node->height > tree->depth)
	526	goto node_error;
	527	break;
	528	default:
	529	goto node_error;
	530	}
	531
	532	rec_off = tree->node_size - 2;
	533	off = hfs_bnode_read_u16(node, rec_off);
	534	if (off != sizeof(struct hfs_bnode_desc))
	535	goto node_error;
	536	for (i = 1; i <= node->num_recs; off = next_off, i++) {
	537	rec_off -= 2;
	538	next_off = hfs_bnode_read_u16(node, rec_off);
	539	if (next_off <= off \|\|
	540	next_off > tree->node_size \|\|
	541	next_off & 1)
	542	goto node_error;
	543	entry_size = next_off - off;
	544	if (node->type != HFS_NODE_INDEX &&
	545	node->type != HFS_NODE_LEAF)
	546	continue;
	547	key_size = hfs_bnode_read_u16(node, off) + 2;
	548	if (key_size >= entry_size \|\| key_size & 1)
	549	goto node_error;
	550	}
	551	clear_bit(HFS_BNODE_NEW, &node->flags);
	552	wake_up(&node->lock_wq);
	553	return node;
	554
	555	node_error:
	556	set_bit(HFS_BNODE_ERROR, &node->flags);
	557	clear_bit(HFS_BNODE_NEW, &node->flags);
	558	wake_up(&node->lock_wq);
	559	hfs_bnode_put(node);
	560	return ERR_PTR(-EIO);
	561	}
	562
	563	void hfs_bnode_free(struct hfs_bnode *node)
	564	{
21f2296a	565	int i;
1da177e4	566
21f2296a AS	567	for (i = 0; i < node->tree->pages_per_bnode; i++)
21f2296a AS	568	if (node->page[i])
09cbfeaf	569	put_page(node->page[i]);
1da177e4 LT	570	kfree(node);
	571	}
	572
	573	struct hfs_bnode hfs_bnode_create(struct hfs_btree tree, u32 num)
	574	{
	575	struct hfs_bnode *node;
	576	struct page **pagep;
	577	int i;
	578
	579	spin_lock(&tree->hash_lock);
	580	node = hfs_bnode_findhash(tree, num);
	581	spin_unlock(&tree->hash_lock);
	582	if (node) {
d6142673	583	pr_crit("new node %u already hashed?\n", num);
634725a9 RZ	584	WARN_ON(1);
634725a9 RZ	585	return node;
1da177e4 LT	586	}
	587	node = __hfs_bnode_create(tree, num);
	588	if (!node)
	589	return ERR_PTR(-ENOMEM);
	590	if (test_bit(HFS_BNODE_ERROR, &node->flags)) {
	591	hfs_bnode_put(node);
	592	return ERR_PTR(-EIO);
	593	}
	594
	595	pagep = node->page;
	596	memset(kmap(*pagep) + node->page_offset, 0,
09cbfeaf	597	min_t(int, PAGE_SIZE, tree->node_size));
1da177e4 LT	598	set_page_dirty(*pagep);
	599	kunmap(*pagep);
	600	for (i = 1; i < tree->pages_per_bnode; i++) {
09cbfeaf	601	memset(kmap(*++pagep), 0, PAGE_SIZE);
1da177e4 LT	602	set_page_dirty(*pagep);
	603	kunmap(*pagep);
	604	}
	605	clear_bit(HFS_BNODE_NEW, &node->flags);
	606	wake_up(&node->lock_wq);
	607
	608	return node;
	609	}
	610
	611	void hfs_bnode_get(struct hfs_bnode *node)
	612	{
	613	if (node) {
	614	atomic_inc(&node->refcnt);
c2b3e1f7	615	hfs_dbg(BNODE_REFS, "get_node(%d:%d): %d\n",
2753cc28 AS	616	node->tree->cnid, node->this,
2753cc28 AS	617	atomic_read(&node->refcnt));
1da177e4 LT	618	}
	619	}
	620
	621	/* Dispose of resources used by a node */
	622	void hfs_bnode_put(struct hfs_bnode *node)
	623	{
	624	if (node) {
	625	struct hfs_btree *tree = node->tree;
	626	int i;
	627
c2b3e1f7	628	hfs_dbg(BNODE_REFS, "put_node(%d:%d): %d\n",
2753cc28 AS	629	node->tree->cnid, node->this,
2753cc28 AS	630	atomic_read(&node->refcnt));
0bf3ba53	631	BUG_ON(!atomic_read(&node->refcnt));
a5e3985f	632	if (!atomic_dec_and_lock(&node->refcnt, &tree->hash_lock))
1da177e4	633	return;
1da177e4	634	for (i = 0; i < tree->pages_per_bnode; i++) {
74f9c9c2 RZ	635	if (!node->page[i])
74f9c9c2 RZ	636	continue;
1da177e4	637	mark_page_accessed(node->page[i]);
1da177e4 LT	638	}
	639
	640	if (test_bit(HFS_BNODE_DELETED, &node->flags)) {
	641	hfs_bnode_unhash(node);
	642	spin_unlock(&tree->hash_lock);
2cd282a1 SA	643	if (hfs_bnode_need_zeroout(tree))
2cd282a1 SA	644	hfs_bnode_clear(node, 0, tree->node_size);
1da177e4 LT	645	hfs_bmap_free(node);
	646	hfs_bnode_free(node);
	647	return;
	648	}
	649	spin_unlock(&tree->hash_lock);
	650	}
	651	}
	652
2cd282a1 SA	653	/*
	654	* Unused nodes have to be zeroed if this is the catalog tree and
	655	* a corresponding flag in the volume header is set.
	656	*/
	657	bool hfs_bnode_need_zeroout(struct hfs_btree *tree)
	658	{
	659	struct super_block *sb = tree->inode->i_sb;
	660	struct hfsplus_sb_info *sbi = HFSPLUS_SB(sb);
	661	const u32 volume_attr = be32_to_cpu(sbi->s_vhdr->attributes);
	662
	663	return tree->cnid == HFSPLUS_CAT_CNID &&
	664	volume_attr & HFSPLUS_VOL_UNUSED_NODE_FIX;
	665	}