[mirror_ubuntu-jammy-kernel.git] / fs / hpfs / anode.c

// SPDX-License-Identifier: GPL-2.0
/*
 *  linux/fs/hpfs/anode.c
 *
 *  Mikulas Patocka (mikulas@artax.karlin.mff.cuni.cz), 1998-1999
 *
 *  handling HPFS anode tree that contains file allocation info
 */

#include "hpfs_fn.h"

/* Find a sector in allocation tree */

secno hpfs_bplus_lookup(struct super_block *s, struct inode *inode,
		   struct bplus_header *btree, unsigned sec,
		   struct buffer_head *bh)
{
	anode_secno a = -1;
	struct anode *anode;
	int i;
	int c1, c2 = 0;
	go_down:
	if (hpfs_sb(s)->sb_chk) if (hpfs_stop_cycles(s, a, &c1, &c2, "hpfs_bplus_lookup")) return -1;
	if (bp_internal(btree)) {
		for (i = 0; i < btree->n_used_nodes; i++)
			if (le32_to_cpu(btree->u.internal[i].file_secno) > sec) {
				a = le32_to_cpu(btree->u.internal[i].down);
				brelse(bh);
				if (!(anode = hpfs_map_anode(s, a, &bh))) return -1;
				btree = &anode->btree;
				goto go_down;
			}
		hpfs_error(s, "sector %08x not found in internal anode %08x", sec, a);
		brelse(bh);
		return -1;
	}
	for (i = 0; i < btree->n_used_nodes; i++)
		if (le32_to_cpu(btree->u.external[i].file_secno) <= sec &&
		    le32_to_cpu(btree->u.external[i].file_secno) + le32_to_cpu(btree->u.external[i].length) > sec) {
			a = le32_to_cpu(btree->u.external[i].disk_secno) + sec - le32_to_cpu(btree->u.external[i].file_secno);
			if (hpfs_sb(s)->sb_chk) if (hpfs_chk_sectors(s, a, 1, "data")) {
				brelse(bh);
				return -1;
			}
			if (inode) {
				struct hpfs_inode_info *hpfs_inode = hpfs_i(inode);
				hpfs_inode->i_file_sec = le32_to_cpu(btree->u.external[i].file_secno);
				hpfs_inode->i_disk_sec = le32_to_cpu(btree->u.external[i].disk_secno);
				hpfs_inode->i_n_secs = le32_to_cpu(btree->u.external[i].length);
			}
			brelse(bh);
			return a;
		}
	hpfs_error(s, "sector %08x not found in external anode %08x", sec, a);
	brelse(bh);
	return -1;
}

/* Add a sector to tree */

secno hpfs_add_sector_to_btree(struct super_block *s, secno node, int fnod, unsigned fsecno)
{
	struct bplus_header *btree;
	struct anode *anode = NULL, *ranode = NULL;
	struct fnode *fnode;
	anode_secno a, na = -1, ra, up = -1;
	secno se;
	struct buffer_head *bh, *bh1, *bh2;
	int n;
	unsigned fs;
	int c1, c2 = 0;
	if (fnod) {
		if (!(fnode = hpfs_map_fnode(s, node, &bh))) return -1;
		btree = &fnode->btree;
	} else {
		if (!(anode = hpfs_map_anode(s, node, &bh))) return -1;
		btree = &anode->btree;
	}
	a = node;
	go_down:
	if ((n = btree->n_used_nodes - 1) < -!!fnod) {
		hpfs_error(s, "anode %08x has no entries", a);
		brelse(bh);
		return -1;
	}
	if (bp_internal(btree)) {
		a = le32_to_cpu(btree->u.internal[n].down);
		btree->u.internal[n].file_secno = cpu_to_le32(-1);
		mark_buffer_dirty(bh);
		brelse(bh);
		if (hpfs_sb(s)->sb_chk)
			if (hpfs_stop_cycles(s, a, &c1, &c2, "hpfs_add_sector_to_btree #1")) return -1;
		if (!(anode = hpfs_map_anode(s, a, &bh))) return -1;
		btree = &anode->btree;
		goto go_down;
	}
	if (n >= 0) {
		if (le32_to_cpu(btree->u.external[n].file_secno) + le32_to_cpu(btree->u.external[n].length) != fsecno) {
			hpfs_error(s, "allocated size %08x, trying to add sector %08x, %cnode %08x",
				le32_to_cpu(btree->u.external[n].file_secno) + le32_to_cpu(btree->u.external[n].length), fsecno,
				fnod?'f':'a', node);
			brelse(bh);
			return -1;
		}
		if (hpfs_alloc_if_possible(s, se = le32_to_cpu(btree->u.external[n].disk_secno) + le32_to_cpu(btree->u.external[n].length))) {
			le32_add_cpu(&btree->u.external[n].length, 1);
			mark_buffer_dirty(bh);
			brelse(bh);
			return se;
		}
	} else {
		if (fsecno) {
			hpfs_error(s, "empty file %08x, trying to add sector %08x", node, fsecno);
			brelse(bh);
			return -1;
		}
		se = !fnod ? node : (node + 16384) & ~16383;
	}	
	if (!(se = hpfs_alloc_sector(s, se, 1, fsecno*ALLOC_M>ALLOC_FWD_MAX ? ALLOC_FWD_MAX : fsecno*ALLOC_M<ALLOC_FWD_MIN ? ALLOC_FWD_MIN : fsecno*ALLOC_M))) {
		brelse(bh);
		return -1;
	}
	fs = n < 0 ? 0 : le32_to_cpu(btree->u.external[n].file_secno) + le32_to_cpu(btree->u.external[n].length);
	if (!btree->n_free_nodes) {
		up = a != node ? le32_to_cpu(anode->up) : -1;
		if (!(anode = hpfs_alloc_anode(s, a, &na, &bh1))) {
			brelse(bh);
			hpfs_free_sectors(s, se, 1);
			return -1;
		}
		if (a == node && fnod) {
			anode->up = cpu_to_le32(node);
			anode->btree.flags |= BP_fnode_parent;
			anode->btree.n_used_nodes = btree->n_used_nodes;
			anode->btree.first_free = btree->first_free;
			anode->btree.n_free_nodes = 40 - anode->btree.n_used_nodes;
			memcpy(&anode->u, &btree->u, btree->n_used_nodes * 12);
			btree->flags |= BP_internal;
			btree->n_free_nodes = 11;
			btree->n_used_nodes = 1;
			btree->first_free = cpu_to_le16((char *)&(btree->u.internal[1]) - (char *)btree);
			btree->u.internal[0].file_secno = cpu_to_le32(-1);
			btree->u.internal[0].down = cpu_to_le32(na);
			mark_buffer_dirty(bh);
		} else if (!(ranode = hpfs_alloc_anode(s, /*a*/0, &ra, &bh2))) {
			brelse(bh);
			brelse(bh1);
			hpfs_free_sectors(s, se, 1);
			hpfs_free_sectors(s, na, 1);
			return -1;
		}
		brelse(bh);
		bh = bh1;
		btree = &anode->btree;
	}
	btree->n_free_nodes--; n = btree->n_used_nodes++;
	le16_add_cpu(&btree->first_free, 12);
	btree->u.external[n].disk_secno = cpu_to_le32(se);
	btree->u.external[n].file_secno = cpu_to_le32(fs);
	btree->u.external[n].length = cpu_to_le32(1);
	mark_buffer_dirty(bh);
	brelse(bh);
	if ((a == node && fnod) || na == -1) return se;
	c2 = 0;
	while (up != (anode_secno)-1) {
		struct anode *new_anode;
		if (hpfs_sb(s)->sb_chk)
			if (hpfs_stop_cycles(s, up, &c1, &c2, "hpfs_add_sector_to_btree #2")) return -1;
		if (up != node || !fnod) {
			if (!(anode = hpfs_map_anode(s, up, &bh))) return -1;
			btree = &anode->btree;
		} else {
			if (!(fnode = hpfs_map_fnode(s, up, &bh))) return -1;
			btree = &fnode->btree;
		}
		if (btree->n_free_nodes) {
			btree->n_free_nodes--; n = btree->n_used_nodes++;
			le16_add_cpu(&btree->first_free, 8);
			btree->u.internal[n].file_secno = cpu_to_le32(-1);
			btree->u.internal[n].down = cpu_to_le32(na);
			btree->u.internal[n-1].file_secno = cpu_to_le32(fs);
			mark_buffer_dirty(bh);
			brelse(bh);
			brelse(bh2);
			hpfs_free_sectors(s, ra, 1);
			if ((anode = hpfs_map_anode(s, na, &bh))) {
				anode->up = cpu_to_le32(up);
				if (up == node && fnod)
					anode->btree.flags |= BP_fnode_parent;
				else
					anode->btree.flags &= ~BP_fnode_parent;
				mark_buffer_dirty(bh);
				brelse(bh);
			}
			return se;
		}
		up = up != node ? le32_to_cpu(anode->up) : -1;
		btree->u.internal[btree->n_used_nodes - 1].file_secno = cpu_to_le32(/*fs*/-1);
		mark_buffer_dirty(bh);
		brelse(bh);
		a = na;
		if ((new_anode = hpfs_alloc_anode(s, a, &na, &bh))) {
			anode = new_anode;
			/*anode->up = cpu_to_le32(up != -1 ? up : ra);*/
			anode->btree.flags |= BP_internal;
			anode->btree.n_used_nodes = 1;
			anode->btree.n_free_nodes = 59;
			anode->btree.first_free = cpu_to_le16(16);
			anode->btree.u.internal[0].down = cpu_to_le32(a);
			anode->btree.u.internal[0].file_secno = cpu_to_le32(-1);
			mark_buffer_dirty(bh);
			brelse(bh);
			if ((anode = hpfs_map_anode(s, a, &bh))) {
				anode->up = cpu_to_le32(na);
				mark_buffer_dirty(bh);
				brelse(bh);
			}
		} else na = a;
	}
	if ((anode = hpfs_map_anode(s, na, &bh))) {
		anode->up = cpu_to_le32(node);
		if (fnod)
			anode->btree.flags |= BP_fnode_parent;
		mark_buffer_dirty(bh);
		brelse(bh);
	}
	if (!fnod) {
		if (!(anode = hpfs_map_anode(s, node, &bh))) {
			brelse(bh2);
			return -1;
		}
		btree = &anode->btree;
	} else {
		if (!(fnode = hpfs_map_fnode(s, node, &bh))) {
			brelse(bh2);
			return -1;
		}
		btree = &fnode->btree;
	}
	ranode->up = cpu_to_le32(node);
	memcpy(&ranode->btree, btree, le16_to_cpu(btree->first_free));
	if (fnod)
		ranode->btree.flags |= BP_fnode_parent;
	ranode->btree.n_free_nodes = (bp_internal(&ranode->btree) ? 60 : 40) - ranode->btree.n_used_nodes;
	if (bp_internal(&ranode->btree)) for (n = 0; n < ranode->btree.n_used_nodes; n++) {
		struct anode *unode;
		if ((unode = hpfs_map_anode(s, le32_to_cpu(ranode->u.internal[n].down), &bh1))) {
			unode->up = cpu_to_le32(ra);
			unode->btree.flags &= ~BP_fnode_parent;
			mark_buffer_dirty(bh1);
			brelse(bh1);
		}
	}
	btree->flags |= BP_internal;
	btree->n_free_nodes = fnod ? 10 : 58;
	btree->n_used_nodes = 2;
	btree->first_free = cpu_to_le16((char *)&btree->u.internal[2] - (char *)btree);
	btree->u.internal[0].file_secno = cpu_to_le32(fs);
	btree->u.internal[0].down = cpu_to_le32(ra);
	btree->u.internal[1].file_secno = cpu_to_le32(-1);
	btree->u.internal[1].down = cpu_to_le32(na);
	mark_buffer_dirty(bh);
	brelse(bh);
	mark_buffer_dirty(bh2);
	brelse(bh2);
	return se;
}

/*
 * Remove allocation tree. Recursion would look much nicer but
 * I want to avoid it because it can cause stack overflow.
 */

void hpfs_remove_btree(struct super_block *s, struct bplus_header *btree)
{
	struct bplus_header *btree1 = btree;
	struct anode *anode = NULL;
	anode_secno ano = 0, oano;
	struct buffer_head *bh;
	int level = 0;
	int pos = 0;
	int i;
	int c1, c2 = 0;
	int d1, d2;
	go_down:
	d2 = 0;
	while (bp_internal(btree1)) {
		ano = le32_to_cpu(btree1->u.internal[pos].down);
		if (level) brelse(bh);
		if (hpfs_sb(s)->sb_chk)
			if (hpfs_stop_cycles(s, ano, &d1, &d2, "hpfs_remove_btree #1"))
				return;
		if (!(anode = hpfs_map_anode(s, ano, &bh))) return;
		btree1 = &anode->btree;
		level++;
		pos = 0;
	}
	for (i = 0; i < btree1->n_used_nodes; i++)
		hpfs_free_sectors(s, le32_to_cpu(btree1->u.external[i].disk_secno), le32_to_cpu(btree1->u.external[i].length));
	go_up:
	if (!level) return;
	brelse(bh);
	if (hpfs_sb(s)->sb_chk)
		if (hpfs_stop_cycles(s, ano, &c1, &c2, "hpfs_remove_btree #2")) return;
	hpfs_free_sectors(s, ano, 1);
	oano = ano;
	ano = le32_to_cpu(anode->up);
	if (--level) {
		if (!(anode = hpfs_map_anode(s, ano, &bh))) return;
		btree1 = &anode->btree;
	} else btree1 = btree;
	for (i = 0; i < btree1->n_used_nodes; i++) {
		if (le32_to_cpu(btree1->u.internal[i].down) == oano) {
			if ((pos = i + 1) < btree1->n_used_nodes)
				goto go_down;
			else
				goto go_up;
		}
	}
	hpfs_error(s,
		   "reference to anode %08x not found in anode %08x "
		   "(probably bad up pointer)",
		   oano, level ? ano : -1);
	if (level)
		brelse(bh);
}

/* Just a wrapper around hpfs_bplus_lookup .. used for reading eas */

static secno anode_lookup(struct super_block *s, anode_secno a, unsigned sec)
{
	struct anode *anode;
	struct buffer_head *bh;
	if (!(anode = hpfs_map_anode(s, a, &bh))) return -1;
	return hpfs_bplus_lookup(s, NULL, &anode->btree, sec, bh);
}

int hpfs_ea_read(struct super_block *s, secno a, int ano, unsigned pos,
	    unsigned len, char *buf)
{
	struct buffer_head *bh;
	char *data;
	secno sec;
	unsigned l;
	while (len) {
		if (ano) {
			if ((sec = anode_lookup(s, a, pos >> 9)) == -1)
				return -1;
		} else sec = a + (pos >> 9);
		if (hpfs_sb(s)->sb_chk) if (hpfs_chk_sectors(s, sec, 1, "ea #1")) return -1;
		if (!(data = hpfs_map_sector(s, sec, &bh, (len - 1) >> 9)))
			return -1;
		l = 0x200 - (pos & 0x1ff); if (l > len) l = len;
		memcpy(buf, data + (pos & 0x1ff), l);
		brelse(bh);
		buf += l; pos += l; len -= l;
	}
	return 0;
}

int hpfs_ea_write(struct super_block *s, secno a, int ano, unsigned pos,
	     unsigned len, const char *buf)
{
	struct buffer_head *bh;
	char *data;
	secno sec;
	unsigned l;
	while (len) {
		if (ano) {
			if ((sec = anode_lookup(s, a, pos >> 9)) == -1)
				return -1;
		} else sec = a + (pos >> 9);
		if (hpfs_sb(s)->sb_chk) if (hpfs_chk_sectors(s, sec, 1, "ea #2")) return -1;
		if (!(data = hpfs_map_sector(s, sec, &bh, (len - 1) >> 9)))
			return -1;
		l = 0x200 - (pos & 0x1ff); if (l > len) l = len;
		memcpy(data + (pos & 0x1ff), buf, l);
		mark_buffer_dirty(bh);
		brelse(bh);
		buf += l; pos += l; len -= l;
	}
	return 0;
}

void hpfs_ea_remove(struct super_block *s, secno a, int ano, unsigned len)
{
	struct anode *anode;
	struct buffer_head *bh;
	if (ano) {
		if (!(anode = hpfs_map_anode(s, a, &bh))) return;
		hpfs_remove_btree(s, &anode->btree);
		brelse(bh);
		hpfs_free_sectors(s, a, 1);
	} else hpfs_free_sectors(s, a, (len + 511) >> 9);
}

/* Truncate allocation tree. Doesn't join anodes - I hope it doesn't matter */

void hpfs_truncate_btree(struct super_block *s, secno f, int fno, unsigned secs)
{
	struct fnode *fnode;
	struct anode *anode;
	struct buffer_head *bh;
	struct bplus_header *btree;
	anode_secno node = f;
	int i, j, nodes;
	int c1, c2 = 0;
	if (fno) {
		if (!(fnode = hpfs_map_fnode(s, f, &bh))) return;
		btree = &fnode->btree;
	} else {
		if (!(anode = hpfs_map_anode(s, f, &bh))) return;
		btree = &anode->btree;
	}
	if (!secs) {
		hpfs_remove_btree(s, btree);
		if (fno) {
			btree->n_free_nodes = 8;
			btree->n_used_nodes = 0;
			btree->first_free = cpu_to_le16(8);
			btree->flags &= ~BP_internal;
			mark_buffer_dirty(bh);
		} else hpfs_free_sectors(s, f, 1);
		brelse(bh);
		return;
	}
	while (bp_internal(btree)) {
		nodes = btree->n_used_nodes + btree->n_free_nodes;
		for (i = 0; i < btree->n_used_nodes; i++)
			if (le32_to_cpu(btree->u.internal[i].file_secno) >= secs) goto f;
		brelse(bh);
		hpfs_error(s, "internal btree %08x doesn't end with -1", node);
		return;
		f:
		for (j = i + 1; j < btree->n_used_nodes; j++)
			hpfs_ea_remove(s, le32_to_cpu(btree->u.internal[j].down), 1, 0);
		btree->n_used_nodes = i + 1;
		btree->n_free_nodes = nodes - btree->n_used_nodes;
		btree->first_free = cpu_to_le16(8 + 8 * btree->n_used_nodes);
		mark_buffer_dirty(bh);
		if (btree->u.internal[i].file_secno == cpu_to_le32(secs)) {
			brelse(bh);
			return;
		}
		node = le32_to_cpu(btree->u.internal[i].down);
		brelse(bh);
		if (hpfs_sb(s)->sb_chk)
			if (hpfs_stop_cycles(s, node, &c1, &c2, "hpfs_truncate_btree"))
				return;
		if (!(anode = hpfs_map_anode(s, node, &bh))) return;
		btree = &anode->btree;
	}	
	nodes = btree->n_used_nodes + btree->n_free_nodes;
	for (i = 0; i < btree->n_used_nodes; i++)
		if (le32_to_cpu(btree->u.external[i].file_secno) + le32_to_cpu(btree->u.external[i].length) >= secs) goto ff;
	brelse(bh);
	return;
	ff:
	if (secs <= le32_to_cpu(btree->u.external[i].file_secno)) {
		hpfs_error(s, "there is an allocation error in file %08x, sector %08x", f, secs);
		if (i) i--;
	}
	else if (le32_to_cpu(btree->u.external[i].file_secno) + le32_to_cpu(btree->u.external[i].length) > secs) {
		hpfs_free_sectors(s, le32_to_cpu(btree->u.external[i].disk_secno) + secs -
			le32_to_cpu(btree->u.external[i].file_secno), le32_to_cpu(btree->u.external[i].length)
			- secs + le32_to_cpu(btree->u.external[i].file_secno)); /* I hope gcc optimizes this :-) */
		btree->u.external[i].length = cpu_to_le32(secs - le32_to_cpu(btree->u.external[i].file_secno));
	}
	for (j = i + 1; j < btree->n_used_nodes; j++)
		hpfs_free_sectors(s, le32_to_cpu(btree->u.external[j].disk_secno), le32_to_cpu(btree->u.external[j].length));
	btree->n_used_nodes = i + 1;
	btree->n_free_nodes = nodes - btree->n_used_nodes;
	btree->first_free = cpu_to_le16(8 + 12 * btree->n_used_nodes);
	mark_buffer_dirty(bh);
	brelse(bh);
}

/* Remove file or directory and it's eas - note that directory must
   be empty when this is called. */

void hpfs_remove_fnode(struct super_block *s, fnode_secno fno)
{
	struct buffer_head *bh;
	struct fnode *fnode;
	struct extended_attribute *ea;
	struct extended_attribute *ea_end;
	if (!(fnode = hpfs_map_fnode(s, fno, &bh))) return;
	if (!fnode_is_dir(fnode)) hpfs_remove_btree(s, &fnode->btree);
	else hpfs_remove_dtree(s, le32_to_cpu(fnode->u.external[0].disk_secno));
	ea_end = fnode_end_ea(fnode);
	for (ea = fnode_ea(fnode); ea < ea_end; ea = next_ea(ea))
		if (ea_indirect(ea))
			hpfs_ea_remove(s, ea_sec(ea), ea_in_anode(ea), ea_len(ea));
	hpfs_ea_ext_remove(s, le32_to_cpu(fnode->ea_secno), fnode_in_anode(fnode), le32_to_cpu(fnode->ea_size_l));
	brelse(bh);
	hpfs_free_sectors(s, fno, 1);
}
Commit	Line	Data
b2441318	1	// SPDX-License-Identifier: GPL-2.0
1da177e4 LT	2	/*
	3	* linux/fs/hpfs/anode.c
	4	*
	5	* Mikulas Patocka (mikulas@artax.karlin.mff.cuni.cz), 1998-1999
	6	*
	7	* handling HPFS anode tree that contains file allocation info
	8	*/
	9
	10	#include "hpfs_fn.h"
	11
	12	/* Find a sector in allocation tree */
	13
	14	secno hpfs_bplus_lookup(struct super_block s, struct inode inode,
	15	struct bplus_header *btree, unsigned sec,
	16	struct buffer_head *bh)
	17	{
	18	anode_secno a = -1;
	19	struct anode *anode;
	20	int i;
	21	int c1, c2 = 0;
	22	go_down:
	23	if (hpfs_sb(s)->sb_chk) if (hpfs_stop_cycles(s, a, &c1, &c2, "hpfs_bplus_lookup")) return -1;
ddc19e6e	24	if (bp_internal(btree)) {
1da177e4	25	for (i = 0; i < btree->n_used_nodes; i++)
0b69760b MP	26	if (le32_to_cpu(btree->u.internal[i].file_secno) > sec) {
0b69760b MP	27	a = le32_to_cpu(btree->u.internal[i].down);
1da177e4 LT	28	brelse(bh);
	29	if (!(anode = hpfs_map_anode(s, a, &bh))) return -1;
	30	btree = &anode->btree;
	31	goto go_down;
	32	}
	33	hpfs_error(s, "sector %08x not found in internal anode %08x", sec, a);
	34	brelse(bh);
	35	return -1;
	36	}
	37	for (i = 0; i < btree->n_used_nodes; i++)
0b69760b MP	38	if (le32_to_cpu(btree->u.external[i].file_secno) <= sec &&
	39	le32_to_cpu(btree->u.external[i].file_secno) + le32_to_cpu(btree->u.external[i].length) > sec) {
	40	a = le32_to_cpu(btree->u.external[i].disk_secno) + sec - le32_to_cpu(btree->u.external[i].file_secno);
1da177e4 LT	41	if (hpfs_sb(s)->sb_chk) if (hpfs_chk_sectors(s, a, 1, "data")) {
	42	brelse(bh);
	43	return -1;
	44	}
	45	if (inode) {
	46	struct hpfs_inode_info *hpfs_inode = hpfs_i(inode);
0b69760b MP	47	hpfs_inode->i_file_sec = le32_to_cpu(btree->u.external[i].file_secno);
	48	hpfs_inode->i_disk_sec = le32_to_cpu(btree->u.external[i].disk_secno);
	49	hpfs_inode->i_n_secs = le32_to_cpu(btree->u.external[i].length);
1da177e4 LT	50	}
	51	brelse(bh);
	52	return a;
	53	}
	54	hpfs_error(s, "sector %08x not found in external anode %08x", sec, a);
	55	brelse(bh);
	56	return -1;
	57	}
	58
	59	/* Add a sector to tree */
	60
	61	secno hpfs_add_sector_to_btree(struct super_block *s, secno node, int fnod, unsigned fsecno)
	62	{
	63	struct bplus_header *btree;
	64	struct anode anode = NULL, ranode = NULL;
	65	struct fnode *fnode;
	66	anode_secno a, na = -1, ra, up = -1;
	67	secno se;
	68	struct buffer_head bh, bh1, *bh2;
	69	int n;
	70	unsigned fs;
	71	int c1, c2 = 0;
	72	if (fnod) {
	73	if (!(fnode = hpfs_map_fnode(s, node, &bh))) return -1;
	74	btree = &fnode->btree;
	75	} else {
	76	if (!(anode = hpfs_map_anode(s, node, &bh))) return -1;
	77	btree = &anode->btree;
	78	}
	79	a = node;
	80	go_down:
	81	if ((n = btree->n_used_nodes - 1) < -!!fnod) {
	82	hpfs_error(s, "anode %08x has no entries", a);
	83	brelse(bh);
	84	return -1;
	85	}
ddc19e6e	86	if (bp_internal(btree)) {
0b69760b MP	87	a = le32_to_cpu(btree->u.internal[n].down);
0b69760b MP	88	btree->u.internal[n].file_secno = cpu_to_le32(-1);
1da177e4 LT	89	mark_buffer_dirty(bh);
	90	brelse(bh);
	91	if (hpfs_sb(s)->sb_chk)
	92	if (hpfs_stop_cycles(s, a, &c1, &c2, "hpfs_add_sector_to_btree #1")) return -1;
	93	if (!(anode = hpfs_map_anode(s, a, &bh))) return -1;
	94	btree = &anode->btree;
	95	goto go_down;
	96	}
	97	if (n >= 0) {
0b69760b	98	if (le32_to_cpu(btree->u.external[n].file_secno) + le32_to_cpu(btree->u.external[n].length) != fsecno) {
1da177e4	99	hpfs_error(s, "allocated size %08x, trying to add sector %08x, %cnode %08x",
0b69760b	100	le32_to_cpu(btree->u.external[n].file_secno) + le32_to_cpu(btree->u.external[n].length), fsecno,
1da177e4 LT	101	fnod?'f':'a', node);
	102	brelse(bh);
	103	return -1;
	104	}
0b69760b	105	if (hpfs_alloc_if_possible(s, se = le32_to_cpu(btree->u.external[n].disk_secno) + le32_to_cpu(btree->u.external[n].length))) {
32daab96	106	le32_add_cpu(&btree->u.external[n].length, 1);
1da177e4 LT	107	mark_buffer_dirty(bh);
	108	brelse(bh);
	109	return se;
	110	}
	111	} else {
	112	if (fsecno) {
	113	hpfs_error(s, "empty file %08x, trying to add sector %08x", node, fsecno);
	114	brelse(bh);
	115	return -1;
	116	}
	117	se = !fnod ? node : (node + 16384) & ~16383;
	118	}
7d23ce36	119	if (!(se = hpfs_alloc_sector(s, se, 1, fsecnoALLOC_M>ALLOC_FWD_MAX ? ALLOC_FWD_MAX : fsecnoALLOC_M<ALLOC_FWD_MIN ? ALLOC_FWD_MIN : fsecno*ALLOC_M))) {
1da177e4 LT	120	brelse(bh);
	121	return -1;
	122	}
0b69760b	123	fs = n < 0 ? 0 : le32_to_cpu(btree->u.external[n].file_secno) + le32_to_cpu(btree->u.external[n].length);
1da177e4	124	if (!btree->n_free_nodes) {
0b69760b	125	up = a != node ? le32_to_cpu(anode->up) : -1;
1da177e4 LT	126	if (!(anode = hpfs_alloc_anode(s, a, &na, &bh1))) {
	127	brelse(bh);
	128	hpfs_free_sectors(s, se, 1);
	129	return -1;
	130	}
	131	if (a == node && fnod) {
0b69760b	132	anode->up = cpu_to_le32(node);
ddc19e6e	133	anode->btree.flags \|= BP_fnode_parent;
1da177e4 LT	134	anode->btree.n_used_nodes = btree->n_used_nodes;
	135	anode->btree.first_free = btree->first_free;
	136	anode->btree.n_free_nodes = 40 - anode->btree.n_used_nodes;
	137	memcpy(&anode->u, &btree->u, btree->n_used_nodes * 12);
ddc19e6e	138	btree->flags \|= BP_internal;
1da177e4 LT	139	btree->n_free_nodes = 11;
1da177e4 LT	140	btree->n_used_nodes = 1;
0b69760b MP	141	btree->first_free = cpu_to_le16((char )&(btree->u.internal[1]) - (char )btree);
	142	btree->u.internal[0].file_secno = cpu_to_le32(-1);
	143	btree->u.internal[0].down = cpu_to_le32(na);
1da177e4 LT	144	mark_buffer_dirty(bh);
	145	} else if (!(ranode = hpfs_alloc_anode(s, /a/0, &ra, &bh2))) {
	146	brelse(bh);
	147	brelse(bh1);
	148	hpfs_free_sectors(s, se, 1);
	149	hpfs_free_sectors(s, na, 1);
	150	return -1;
	151	}
	152	brelse(bh);
	153	bh = bh1;
	154	btree = &anode->btree;
	155	}
	156	btree->n_free_nodes--; n = btree->n_used_nodes++;
32daab96	157	le16_add_cpu(&btree->first_free, 12);
0b69760b MP	158	btree->u.external[n].disk_secno = cpu_to_le32(se);
	159	btree->u.external[n].file_secno = cpu_to_le32(fs);
	160	btree->u.external[n].length = cpu_to_le32(1);
1da177e4 LT	161	mark_buffer_dirty(bh);
	162	brelse(bh);
	163	if ((a == node && fnod) \|\| na == -1) return se;
	164	c2 = 0;
0b69760b	165	while (up != (anode_secno)-1) {
1da177e4 LT	166	struct anode *new_anode;
	167	if (hpfs_sb(s)->sb_chk)
	168	if (hpfs_stop_cycles(s, up, &c1, &c2, "hpfs_add_sector_to_btree #2")) return -1;
	169	if (up != node \|\| !fnod) {
	170	if (!(anode = hpfs_map_anode(s, up, &bh))) return -1;
	171	btree = &anode->btree;
	172	} else {
	173	if (!(fnode = hpfs_map_fnode(s, up, &bh))) return -1;
	174	btree = &fnode->btree;
	175	}
	176	if (btree->n_free_nodes) {
	177	btree->n_free_nodes--; n = btree->n_used_nodes++;
32daab96	178	le16_add_cpu(&btree->first_free, 8);
0b69760b MP	179	btree->u.internal[n].file_secno = cpu_to_le32(-1);
	180	btree->u.internal[n].down = cpu_to_le32(na);
	181	btree->u.internal[n-1].file_secno = cpu_to_le32(fs);
1da177e4 LT	182	mark_buffer_dirty(bh);
	183	brelse(bh);
	184	brelse(bh2);
	185	hpfs_free_sectors(s, ra, 1);
	186	if ((anode = hpfs_map_anode(s, na, &bh))) {
0b69760b	187	anode->up = cpu_to_le32(up);
ddc19e6e AV	188	if (up == node && fnod)
	189	anode->btree.flags \|= BP_fnode_parent;
	190	else
	191	anode->btree.flags &= ~BP_fnode_parent;
1da177e4 LT	192	mark_buffer_dirty(bh);
	193	brelse(bh);
	194	}
	195	return se;
	196	}
0b69760b MP	197	up = up != node ? le32_to_cpu(anode->up) : -1;
0b69760b MP	198	btree->u.internal[btree->n_used_nodes - 1].file_secno = cpu_to_le32(/fs/-1);
1da177e4 LT	199	mark_buffer_dirty(bh);
	200	brelse(bh);
	201	a = na;
	202	if ((new_anode = hpfs_alloc_anode(s, a, &na, &bh))) {
	203	anode = new_anode;
0b69760b	204	/anode->up = cpu_to_le32(up != -1 ? up : ra);/
ddc19e6e	205	anode->btree.flags \|= BP_internal;
1da177e4 LT	206	anode->btree.n_used_nodes = 1;
1da177e4 LT	207	anode->btree.n_free_nodes = 59;
0b69760b MP	208	anode->btree.first_free = cpu_to_le16(16);
	209	anode->btree.u.internal[0].down = cpu_to_le32(a);
	210	anode->btree.u.internal[0].file_secno = cpu_to_le32(-1);
1da177e4 LT	211	mark_buffer_dirty(bh);
	212	brelse(bh);
	213	if ((anode = hpfs_map_anode(s, a, &bh))) {
0b69760b	214	anode->up = cpu_to_le32(na);
1da177e4 LT	215	mark_buffer_dirty(bh);
	216	brelse(bh);
	217	}
	218	} else na = a;
	219	}
	220	if ((anode = hpfs_map_anode(s, na, &bh))) {
0b69760b	221	anode->up = cpu_to_le32(node);
ddc19e6e AV	222	if (fnod)
ddc19e6e AV	223	anode->btree.flags \|= BP_fnode_parent;
1da177e4 LT	224	mark_buffer_dirty(bh);
	225	brelse(bh);
	226	}
	227	if (!fnod) {
	228	if (!(anode = hpfs_map_anode(s, node, &bh))) {
	229	brelse(bh2);
	230	return -1;
	231	}
	232	btree = &anode->btree;
	233	} else {
	234	if (!(fnode = hpfs_map_fnode(s, node, &bh))) {
	235	brelse(bh2);
	236	return -1;
	237	}
	238	btree = &fnode->btree;
	239	}
0b69760b MP	240	ranode->up = cpu_to_le32(node);
0b69760b MP	241	memcpy(&ranode->btree, btree, le16_to_cpu(btree->first_free));
ddc19e6e AV	242	if (fnod)
	243	ranode->btree.flags \|= BP_fnode_parent;
	244	ranode->btree.n_free_nodes = (bp_internal(&ranode->btree) ? 60 : 40) - ranode->btree.n_used_nodes;
	245	if (bp_internal(&ranode->btree)) for (n = 0; n < ranode->btree.n_used_nodes; n++) {
1da177e4	246	struct anode *unode;
0b69760b MP	247	if ((unode = hpfs_map_anode(s, le32_to_cpu(ranode->u.internal[n].down), &bh1))) {
0b69760b MP	248	unode->up = cpu_to_le32(ra);
ddc19e6e	249	unode->btree.flags &= ~BP_fnode_parent;
1da177e4 LT	250	mark_buffer_dirty(bh1);
	251	brelse(bh1);
	252	}
	253	}
ddc19e6e	254	btree->flags \|= BP_internal;
1da177e4 LT	255	btree->n_free_nodes = fnod ? 10 : 58;
1da177e4 LT	256	btree->n_used_nodes = 2;
0b69760b MP	257	btree->first_free = cpu_to_le16((char )&btree->u.internal[2] - (char )btree);
	258	btree->u.internal[0].file_secno = cpu_to_le32(fs);
	259	btree->u.internal[0].down = cpu_to_le32(ra);
	260	btree->u.internal[1].file_secno = cpu_to_le32(-1);
	261	btree->u.internal[1].down = cpu_to_le32(na);
1da177e4 LT	262	mark_buffer_dirty(bh);
	263	brelse(bh);
	264	mark_buffer_dirty(bh2);
	265	brelse(bh2);
	266	return se;
	267	}
	268
	269	/*
	270	* Remove allocation tree. Recursion would look much nicer but
	271	* I want to avoid it because it can cause stack overflow.
	272	*/
	273
	274	void hpfs_remove_btree(struct super_block s, struct bplus_header btree)
	275	{
	276	struct bplus_header *btree1 = btree;
	277	struct anode *anode = NULL;
	278	anode_secno ano = 0, oano;
	279	struct buffer_head *bh;
	280	int level = 0;
	281	int pos = 0;
	282	int i;
	283	int c1, c2 = 0;
	284	int d1, d2;
	285	go_down:
	286	d2 = 0;
ddc19e6e	287	while (bp_internal(btree1)) {
0b69760b	288	ano = le32_to_cpu(btree1->u.internal[pos].down);
1da177e4 LT	289	if (level) brelse(bh);
	290	if (hpfs_sb(s)->sb_chk)
	291	if (hpfs_stop_cycles(s, ano, &d1, &d2, "hpfs_remove_btree #1"))
	292	return;
	293	if (!(anode = hpfs_map_anode(s, ano, &bh))) return;
	294	btree1 = &anode->btree;
	295	level++;
	296	pos = 0;
	297	}
	298	for (i = 0; i < btree1->n_used_nodes; i++)
0b69760b	299	hpfs_free_sectors(s, le32_to_cpu(btree1->u.external[i].disk_secno), le32_to_cpu(btree1->u.external[i].length));
1da177e4 LT	300	go_up:
	301	if (!level) return;
	302	brelse(bh);
	303	if (hpfs_sb(s)->sb_chk)
	304	if (hpfs_stop_cycles(s, ano, &c1, &c2, "hpfs_remove_btree #2")) return;
	305	hpfs_free_sectors(s, ano, 1);
	306	oano = ano;
0b69760b	307	ano = le32_to_cpu(anode->up);
1da177e4 LT	308	if (--level) {
	309	if (!(anode = hpfs_map_anode(s, ano, &bh))) return;
	310	btree1 = &anode->btree;
	311	} else btree1 = btree;
	312	for (i = 0; i < btree1->n_used_nodes; i++) {
0b69760b	313	if (le32_to_cpu(btree1->u.internal[i].down) == oano) {
1da177e4 LT	314	if ((pos = i + 1) < btree1->n_used_nodes)
	315	goto go_down;
	316	else
	317	goto go_up;
	318	}
	319	}
	320	hpfs_error(s,
	321	"reference to anode %08x not found in anode %08x "
	322	"(probably bad up pointer)",
	323	oano, level ? ano : -1);
	324	if (level)
	325	brelse(bh);
	326	}
	327
	328	/* Just a wrapper around hpfs_bplus_lookup .. used for reading eas */
	329
	330	static secno anode_lookup(struct super_block *s, anode_secno a, unsigned sec)
	331	{
	332	struct anode *anode;
	333	struct buffer_head *bh;
	334	if (!(anode = hpfs_map_anode(s, a, &bh))) return -1;
	335	return hpfs_bplus_lookup(s, NULL, &anode->btree, sec, bh);
	336	}
	337
	338	int hpfs_ea_read(struct super_block *s, secno a, int ano, unsigned pos,
	339	unsigned len, char *buf)
	340	{
	341	struct buffer_head *bh;
	342	char *data;
	343	secno sec;
	344	unsigned l;
	345	while (len) {
	346	if (ano) {
	347	if ((sec = anode_lookup(s, a, pos >> 9)) == -1)
	348	return -1;
	349	} else sec = a + (pos >> 9);
	350	if (hpfs_sb(s)->sb_chk) if (hpfs_chk_sectors(s, sec, 1, "ea #1")) return -1;
	351	if (!(data = hpfs_map_sector(s, sec, &bh, (len - 1) >> 9)))
	352	return -1;
	353	l = 0x200 - (pos & 0x1ff); if (l > len) l = len;
	354	memcpy(buf, data + (pos & 0x1ff), l);
	355	brelse(bh);
	356	buf += l; pos += l; len -= l;
	357	}
	358	return 0;
	359	}
	360
	361	int hpfs_ea_write(struct super_block *s, secno a, int ano, unsigned pos,
7e7742ee	362	unsigned len, const char *buf)
1da177e4 LT	363	{
	364	struct buffer_head *bh;
	365	char *data;
	366	secno sec;
	367	unsigned l;
	368	while (len) {
	369	if (ano) {
	370	if ((sec = anode_lookup(s, a, pos >> 9)) == -1)
	371	return -1;
	372	} else sec = a + (pos >> 9);
	373	if (hpfs_sb(s)->sb_chk) if (hpfs_chk_sectors(s, sec, 1, "ea #2")) return -1;
	374	if (!(data = hpfs_map_sector(s, sec, &bh, (len - 1) >> 9)))
	375	return -1;
	376	l = 0x200 - (pos & 0x1ff); if (l > len) l = len;
	377	memcpy(data + (pos & 0x1ff), buf, l);
	378	mark_buffer_dirty(bh);
	379	brelse(bh);
	380	buf += l; pos += l; len -= l;
	381	}
	382	return 0;
	383	}
	384
	385	void hpfs_ea_remove(struct super_block *s, secno a, int ano, unsigned len)
	386	{
	387	struct anode *anode;
	388	struct buffer_head *bh;
	389	if (ano) {
	390	if (!(anode = hpfs_map_anode(s, a, &bh))) return;
	391	hpfs_remove_btree(s, &anode->btree);
	392	brelse(bh);
	393	hpfs_free_sectors(s, a, 1);
	394	} else hpfs_free_sectors(s, a, (len + 511) >> 9);
	395	}
	396
	397	/* Truncate allocation tree. Doesn't join anodes - I hope it doesn't matter */
	398
	399	void hpfs_truncate_btree(struct super_block *s, secno f, int fno, unsigned secs)
	400	{
	401	struct fnode *fnode;
	402	struct anode *anode;
	403	struct buffer_head *bh;
	404	struct bplus_header *btree;
	405	anode_secno node = f;
	406	int i, j, nodes;
	407	int c1, c2 = 0;
	408	if (fno) {
	409	if (!(fnode = hpfs_map_fnode(s, f, &bh))) return;
	410	btree = &fnode->btree;
	411	} else {
	412	if (!(anode = hpfs_map_anode(s, f, &bh))) return;
	413	btree = &anode->btree;
	414	}
	415	if (!secs) {
	416	hpfs_remove_btree(s, btree);
	417	if (fno) {
	418	btree->n_free_nodes = 8;
	419	btree->n_used_nodes = 0;
0b69760b	420	btree->first_free = cpu_to_le16(8);
ddc19e6e	421	btree->flags &= ~BP_internal;
1da177e4 LT	422	mark_buffer_dirty(bh);
	423	} else hpfs_free_sectors(s, f, 1);
	424	brelse(bh);
	425	return;
	426	}
ddc19e6e	427	while (bp_internal(btree)) {
1da177e4 LT	428	nodes = btree->n_used_nodes + btree->n_free_nodes;
1da177e4 LT	429	for (i = 0; i < btree->n_used_nodes; i++)
0b69760b	430	if (le32_to_cpu(btree->u.internal[i].file_secno) >= secs) goto f;
1da177e4 LT	431	brelse(bh);
	432	hpfs_error(s, "internal btree %08x doesn't end with -1", node);
	433	return;
	434	f:
	435	for (j = i + 1; j < btree->n_used_nodes; j++)
0b69760b	436	hpfs_ea_remove(s, le32_to_cpu(btree->u.internal[j].down), 1, 0);
1da177e4 LT	437	btree->n_used_nodes = i + 1;
1da177e4 LT	438	btree->n_free_nodes = nodes - btree->n_used_nodes;
0b69760b	439	btree->first_free = cpu_to_le16(8 + 8 * btree->n_used_nodes);
1da177e4	440	mark_buffer_dirty(bh);
0b69760b	441	if (btree->u.internal[i].file_secno == cpu_to_le32(secs)) {
1da177e4 LT	442	brelse(bh);
	443	return;
	444	}
0b69760b	445	node = le32_to_cpu(btree->u.internal[i].down);
1da177e4 LT	446	brelse(bh);
	447	if (hpfs_sb(s)->sb_chk)
	448	if (hpfs_stop_cycles(s, node, &c1, &c2, "hpfs_truncate_btree"))
	449	return;
	450	if (!(anode = hpfs_map_anode(s, node, &bh))) return;
	451	btree = &anode->btree;
	452	}
	453	nodes = btree->n_used_nodes + btree->n_free_nodes;
	454	for (i = 0; i < btree->n_used_nodes; i++)
0b69760b	455	if (le32_to_cpu(btree->u.external[i].file_secno) + le32_to_cpu(btree->u.external[i].length) >= secs) goto ff;
1da177e4 LT	456	brelse(bh);
	457	return;
	458	ff:
0b69760b	459	if (secs <= le32_to_cpu(btree->u.external[i].file_secno)) {
1da177e4 LT	460	hpfs_error(s, "there is an allocation error in file %08x, sector %08x", f, secs);
	461	if (i) i--;
	462	}
0b69760b MP	463	else if (le32_to_cpu(btree->u.external[i].file_secno) + le32_to_cpu(btree->u.external[i].length) > secs) {
	464	hpfs_free_sectors(s, le32_to_cpu(btree->u.external[i].disk_secno) + secs -
	465	le32_to_cpu(btree->u.external[i].file_secno), le32_to_cpu(btree->u.external[i].length)
	466	- secs + le32_to_cpu(btree->u.external[i].file_secno)); /* I hope gcc optimizes this :-) */
	467	btree->u.external[i].length = cpu_to_le32(secs - le32_to_cpu(btree->u.external[i].file_secno));
1da177e4 LT	468	}
1da177e4 LT	469	for (j = i + 1; j < btree->n_used_nodes; j++)
0b69760b	470	hpfs_free_sectors(s, le32_to_cpu(btree->u.external[j].disk_secno), le32_to_cpu(btree->u.external[j].length));
1da177e4 LT	471	btree->n_used_nodes = i + 1;
1da177e4 LT	472	btree->n_free_nodes = nodes - btree->n_used_nodes;
0b69760b	473	btree->first_free = cpu_to_le16(8 + 12 * btree->n_used_nodes);
1da177e4 LT	474	mark_buffer_dirty(bh);
	475	brelse(bh);
	476	}
	477
	478	/* Remove file or directory and it's eas - note that directory must
	479	be empty when this is called. */
	480
	481	void hpfs_remove_fnode(struct super_block *s, fnode_secno fno)
	482	{
	483	struct buffer_head *bh;
	484	struct fnode *fnode;
	485	struct extended_attribute *ea;
	486	struct extended_attribute *ea_end;
	487	if (!(fnode = hpfs_map_fnode(s, fno, &bh))) return;
c4c99543	488	if (!fnode_is_dir(fnode)) hpfs_remove_btree(s, &fnode->btree);
0b69760b	489	else hpfs_remove_dtree(s, le32_to_cpu(fnode->u.external[0].disk_secno));
1da177e4 LT	490	ea_end = fnode_end_ea(fnode);
1da177e4 LT	491	for (ea = fnode_ea(fnode); ea < ea_end; ea = next_ea(ea))
4085e155 AV	492	if (ea_indirect(ea))
4085e155 AV	493	hpfs_ea_remove(s, ea_sec(ea), ea_in_anode(ea), ea_len(ea));
c4c99543	494	hpfs_ea_ext_remove(s, le32_to_cpu(fnode->ea_secno), fnode_in_anode(fnode), le32_to_cpu(fnode->ea_size_l));
1da177e4 LT	495	brelse(bh);
	496	hpfs_free_sectors(s, fno, 1);
	497	}