[linux.git] / fs / affs / namei.c

// SPDX-License-Identifier: GPL-2.0
/*
 *  linux/fs/affs/namei.c
 *
 *  (c) 1996  Hans-Joachim Widmaier - Rewritten
 *
 *  (C) 1993  Ray Burr - Modified for Amiga FFS filesystem.
 *
 *  (C) 1991  Linus Torvalds - minix filesystem
 */

#include "affs.h"
#include <linux/exportfs.h>

typedef int (*toupper_t)(int);

/* Simple toupper() for DOS\1 */

static int
affs_toupper(int ch)
{
	return ch >= 'a' && ch <= 'z' ? ch -= ('a' - 'A') : ch;
}

/* International toupper() for DOS\3 ("international") */

static int
affs_intl_toupper(int ch)
{
	return (ch >= 'a' && ch <= 'z') || (ch >= 0xE0
		&& ch <= 0xFE && ch != 0xF7) ?
		ch - ('a' - 'A') : ch;
}

static inline toupper_t
affs_get_toupper(struct super_block *sb)
{
	return affs_test_opt(AFFS_SB(sb)->s_flags, SF_INTL) ?
	       affs_intl_toupper : affs_toupper;
}

/*
 * Note: the dentry argument is the parent dentry.
 */
static inline int
__affs_hash_dentry(const struct dentry *dentry, struct qstr *qstr, toupper_t toupper, bool notruncate)
{
	const u8 *name = qstr->name;
	unsigned long hash;
	int retval;
	u32 len;

	retval = affs_check_name(qstr->name, qstr->len, notruncate);
	if (retval)
		return retval;

	hash = init_name_hash(dentry);
	len = min(qstr->len, AFFSNAMEMAX);
	for (; len > 0; name++, len--)
		hash = partial_name_hash(toupper(*name), hash);
	qstr->hash = end_name_hash(hash);

	return 0;
}

static int
affs_hash_dentry(const struct dentry *dentry, struct qstr *qstr)
{
	return __affs_hash_dentry(dentry, qstr, affs_toupper,
				  affs_nofilenametruncate(dentry));

}

static int
affs_intl_hash_dentry(const struct dentry *dentry, struct qstr *qstr)
{
	return __affs_hash_dentry(dentry, qstr, affs_intl_toupper,
				  affs_nofilenametruncate(dentry));

}

static inline int __affs_compare_dentry(unsigned int len,
		const char *str, const struct qstr *name, toupper_t toupper,
		bool notruncate)
{
	const u8 *aname = str;
	const u8 *bname = name->name;

	/*
	 * 'str' is the name of an already existing dentry, so the name
	 * must be valid. 'name' must be validated first.
	 */

	if (affs_check_name(name->name, name->len, notruncate))
		return 1;

	/*
	 * If the names are longer than the allowed 30 chars,
	 * the excess is ignored, so their length may differ.
	 */
	if (len >= AFFSNAMEMAX) {
		if (name->len < AFFSNAMEMAX)
			return 1;
		len = AFFSNAMEMAX;
	} else if (len != name->len)
		return 1;

	for (; len > 0; len--)
		if (toupper(*aname++) != toupper(*bname++))
			return 1;

	return 0;
}

static int
affs_compare_dentry(const struct dentry *dentry,
		unsigned int len, const char *str, const struct qstr *name)
{

	return __affs_compare_dentry(len, str, name, affs_toupper,
				     affs_nofilenametruncate(dentry));
}

static int
affs_intl_compare_dentry(const struct dentry *dentry,
		unsigned int len, const char *str, const struct qstr *name)
{
	return __affs_compare_dentry(len, str, name, affs_intl_toupper,
				     affs_nofilenametruncate(dentry));

}

/*
 * NOTE! unlike strncmp, affs_match returns 1 for success, 0 for failure.
 */

static inline int
affs_match(struct dentry *dentry, const u8 *name2, toupper_t toupper)
{
	const u8 *name = dentry->d_name.name;
	int len = dentry->d_name.len;

	if (len >= AFFSNAMEMAX) {
		if (*name2 < AFFSNAMEMAX)
			return 0;
		len = AFFSNAMEMAX;
	} else if (len != *name2)
		return 0;

	for (name2++; len > 0; len--)
		if (toupper(*name++) != toupper(*name2++))
			return 0;
	return 1;
}

int
affs_hash_name(struct super_block *sb, const u8 *name, unsigned int len)
{
	toupper_t toupper = affs_get_toupper(sb);
	u32 hash;

	hash = len = min(len, AFFSNAMEMAX);
	for (; len > 0; len--)
		hash = (hash * 13 + toupper(*name++)) & 0x7ff;

	return hash % AFFS_SB(sb)->s_hashsize;
}

static struct buffer_head *
affs_find_entry(struct inode *dir, struct dentry *dentry)
{
	struct super_block *sb = dir->i_sb;
	struct buffer_head *bh;
	toupper_t toupper = affs_get_toupper(sb);
	u32 key;

	pr_debug("%s(\"%pd\")\n", __func__, dentry);

	bh = affs_bread(sb, dir->i_ino);
	if (!bh)
		return ERR_PTR(-EIO);

	key = be32_to_cpu(AFFS_HEAD(bh)->table[affs_hash_name(sb, dentry->d_name.name, dentry->d_name.len)]);

	for (;;) {
		affs_brelse(bh);
		if (key == 0)
			return NULL;
		bh = affs_bread(sb, key);
		if (!bh)
			return ERR_PTR(-EIO);
		if (affs_match(dentry, AFFS_TAIL(sb, bh)->name, toupper))
			return bh;
		key = be32_to_cpu(AFFS_TAIL(sb, bh)->hash_chain);
	}
}

struct dentry *
affs_lookup(struct inode *dir, struct dentry *dentry, unsigned int flags)
{
	struct super_block *sb = dir->i_sb;
	struct buffer_head *bh;
	struct inode *inode = NULL;
	struct dentry *res;

	pr_debug("%s(\"%pd\")\n", __func__, dentry);

	affs_lock_dir(dir);
	bh = affs_find_entry(dir, dentry);
	if (IS_ERR(bh)) {
		affs_unlock_dir(dir);
		return ERR_CAST(bh);
	}
	if (bh) {
		u32 ino = bh->b_blocknr;

		/* store the real header ino in d_fsdata for faster lookups */
		dentry->d_fsdata = (void *)(long)ino;
		switch (be32_to_cpu(AFFS_TAIL(sb, bh)->stype)) {
		//link to dirs disabled
		//case ST_LINKDIR:
		case ST_LINKFILE:
			ino = be32_to_cpu(AFFS_TAIL(sb, bh)->original);
		}
		affs_brelse(bh);
		inode = affs_iget(sb, ino);
	}
	res = d_splice_alias(inode, dentry);
	if (!IS_ERR_OR_NULL(res))
		res->d_fsdata = dentry->d_fsdata;
	affs_unlock_dir(dir);
	return res;
}

int
affs_unlink(struct inode *dir, struct dentry *dentry)
{
	pr_debug("%s(dir=%lu, %lu \"%pd\")\n", __func__, dir->i_ino,
		 d_inode(dentry)->i_ino, dentry);

	return affs_remove_header(dentry);
}

int
affs_create(struct inode *dir, struct dentry *dentry, umode_t mode, bool excl)
{
	struct super_block *sb = dir->i_sb;
	struct inode	*inode;
	int		 error;

	pr_debug("%s(%lu,\"%pd\",0%ho)\n",
		 __func__, dir->i_ino, dentry, mode);

	inode = affs_new_inode(dir);
	if (!inode)
		return -ENOSPC;

	inode->i_mode = mode;
	affs_mode_to_prot(inode);
	mark_inode_dirty(inode);

	inode->i_op = &affs_file_inode_operations;
	inode->i_fop = &affs_file_operations;
	inode->i_mapping->a_ops = affs_test_opt(AFFS_SB(sb)->s_flags, SF_OFS) ?
				  &affs_aops_ofs : &affs_aops;
	error = affs_add_entry(dir, inode, dentry, ST_FILE);
	if (error) {
		clear_nlink(inode);
		iput(inode);
		return error;
	}
	return 0;
}

int
affs_mkdir(struct inode *dir, struct dentry *dentry, umode_t mode)
{
	struct inode		*inode;
	int			 error;

	pr_debug("%s(%lu,\"%pd\",0%ho)\n",
		 __func__, dir->i_ino, dentry, mode);

	inode = affs_new_inode(dir);
	if (!inode)
		return -ENOSPC;

	inode->i_mode = S_IFDIR | mode;
	affs_mode_to_prot(inode);

	inode->i_op = &affs_dir_inode_operations;
	inode->i_fop = &affs_dir_operations;

	error = affs_add_entry(dir, inode, dentry, ST_USERDIR);
	if (error) {
		clear_nlink(inode);
		mark_inode_dirty(inode);
		iput(inode);
		return error;
	}
	return 0;
}

int
affs_rmdir(struct inode *dir, struct dentry *dentry)
{
	pr_debug("%s(dir=%lu, %lu \"%pd\")\n", __func__, dir->i_ino,
		 d_inode(dentry)->i_ino, dentry);

	return affs_remove_header(dentry);
}

int
affs_symlink(struct inode *dir, struct dentry *dentry, const char *symname)
{
	struct super_block	*sb = dir->i_sb;
	struct buffer_head	*bh;
	struct inode		*inode;
	char			*p;
	int			 i, maxlen, error;
	char			 c, lc;

	pr_debug("%s(%lu,\"%pd\" -> \"%s\")\n",
		 __func__, dir->i_ino, dentry, symname);

	maxlen = AFFS_SB(sb)->s_hashsize * sizeof(u32) - 1;
	inode  = affs_new_inode(dir);
	if (!inode)
		return -ENOSPC;

	inode->i_op = &affs_symlink_inode_operations;
	inode_nohighmem(inode);
	inode->i_data.a_ops = &affs_symlink_aops;
	inode->i_mode = S_IFLNK | 0777;
	affs_mode_to_prot(inode);

	error = -EIO;
	bh = affs_bread(sb, inode->i_ino);
	if (!bh)
		goto err;
	i  = 0;
	p  = (char *)AFFS_HEAD(bh)->table;
	lc = '/';
	if (*symname == '/') {
		struct affs_sb_info *sbi = AFFS_SB(sb);
		while (*symname == '/')
			symname++;
		spin_lock(&sbi->symlink_lock);
		while (sbi->s_volume[i])	/* Cannot overflow */
			*p++ = sbi->s_volume[i++];
		spin_unlock(&sbi->symlink_lock);
	}
	while (i < maxlen && (c = *symname++)) {
		if (c == '.' && lc == '/' && *symname == '.' && symname[1] == '/') {
			*p++ = '/';
			i++;
			symname += 2;
			lc = '/';
		} else if (c == '.' && lc == '/' && *symname == '/') {
			symname++;
			lc = '/';
		} else {
			*p++ = c;
			lc   = c;
			i++;
		}
		if (lc == '/')
			while (*symname == '/')
				symname++;
	}
	*p = 0;
	inode->i_size = i + 1;
	mark_buffer_dirty_inode(bh, inode);
	affs_brelse(bh);
	mark_inode_dirty(inode);

	error = affs_add_entry(dir, inode, dentry, ST_SOFTLINK);
	if (error)
		goto err;

	return 0;

err:
	clear_nlink(inode);
	mark_inode_dirty(inode);
	iput(inode);
	return error;
}

int
affs_link(struct dentry *old_dentry, struct inode *dir, struct dentry *dentry)
{
	struct inode *inode = d_inode(old_dentry);

	pr_debug("%s(%lu, %lu, \"%pd\")\n", __func__, inode->i_ino, dir->i_ino,
		 dentry);

	return affs_add_entry(dir, inode, dentry, ST_LINKFILE);
}

static int
affs_rename(struct inode *old_dir, struct dentry *old_dentry,
	    struct inode *new_dir, struct dentry *new_dentry)
{
	struct super_block *sb = old_dir->i_sb;
	struct buffer_head *bh = NULL;
	int retval;

	retval = affs_check_name(new_dentry->d_name.name,
				 new_dentry->d_name.len,
				 affs_nofilenametruncate(old_dentry));

	if (retval)
		return retval;

	/* Unlink destination if it already exists */
	if (d_really_is_positive(new_dentry)) {
		retval = affs_remove_header(new_dentry);
		if (retval)
			return retval;
	}

	bh = affs_bread(sb, d_inode(old_dentry)->i_ino);
	if (!bh)
		return -EIO;

	/* Remove header from its parent directory. */
	affs_lock_dir(old_dir);
	retval = affs_remove_hash(old_dir, bh);
	affs_unlock_dir(old_dir);
	if (retval)
		goto done;

	/* And insert it into the new directory with the new name. */
	affs_copy_name(AFFS_TAIL(sb, bh)->name, new_dentry);
	affs_fix_checksum(sb, bh);
	affs_lock_dir(new_dir);
	retval = affs_insert_hash(new_dir, bh);
	affs_unlock_dir(new_dir);
	/* TODO: move it back to old_dir, if error? */

done:
	mark_buffer_dirty_inode(bh, retval ? old_dir : new_dir);
	affs_brelse(bh);
	return retval;
}

static int
affs_xrename(struct inode *old_dir, struct dentry *old_dentry,
	     struct inode *new_dir, struct dentry *new_dentry)
{

	struct super_block *sb = old_dir->i_sb;
	struct buffer_head *bh_old = NULL;
	struct buffer_head *bh_new = NULL;
	int retval;

	bh_old = affs_bread(sb, d_inode(old_dentry)->i_ino);
	if (!bh_old)
		return -EIO;

	bh_new = affs_bread(sb, d_inode(new_dentry)->i_ino);
	if (!bh_new)
		return -EIO;

	/* Remove old header from its parent directory. */
	affs_lock_dir(old_dir);
	retval = affs_remove_hash(old_dir, bh_old);
	affs_unlock_dir(old_dir);
	if (retval)
		goto done;

	/* Remove new header from its parent directory. */
	affs_lock_dir(new_dir);
	retval = affs_remove_hash(new_dir, bh_new);
	affs_unlock_dir(new_dir);
	if (retval)
		goto done;

	/* Insert old into the new directory with the new name. */
	affs_copy_name(AFFS_TAIL(sb, bh_old)->name, new_dentry);
	affs_fix_checksum(sb, bh_old);
	affs_lock_dir(new_dir);
	retval = affs_insert_hash(new_dir, bh_old);
	affs_unlock_dir(new_dir);

	/* Insert new into the old directory with the old name. */
	affs_copy_name(AFFS_TAIL(sb, bh_new)->name, old_dentry);
	affs_fix_checksum(sb, bh_new);
	affs_lock_dir(old_dir);
	retval = affs_insert_hash(old_dir, bh_new);
	affs_unlock_dir(old_dir);
done:
	mark_buffer_dirty_inode(bh_old, new_dir);
	mark_buffer_dirty_inode(bh_new, old_dir);
	affs_brelse(bh_old);
	affs_brelse(bh_new);
	return retval;
}

int affs_rename2(struct inode *old_dir, struct dentry *old_dentry,
			struct inode *new_dir, struct dentry *new_dentry,
			unsigned int flags)
{

	if (flags & ~(RENAME_NOREPLACE | RENAME_EXCHANGE))
		return -EINVAL;

	pr_debug("%s(old=%lu,\"%pd\" to new=%lu,\"%pd\")\n", __func__,
		 old_dir->i_ino, old_dentry, new_dir->i_ino, new_dentry);

	if (flags & RENAME_EXCHANGE)
		return affs_xrename(old_dir, old_dentry, new_dir, new_dentry);

	return affs_rename(old_dir, old_dentry, new_dir, new_dentry);
}

static struct dentry *affs_get_parent(struct dentry *child)
{
	struct inode *parent;
	struct buffer_head *bh;

	bh = affs_bread(child->d_sb, d_inode(child)->i_ino);
	if (!bh)
		return ERR_PTR(-EIO);

	parent = affs_iget(child->d_sb,
			   be32_to_cpu(AFFS_TAIL(child->d_sb, bh)->parent));
	brelse(bh);
	if (IS_ERR(parent))
		return ERR_CAST(parent);

	return d_obtain_alias(parent);
}

static struct inode *affs_nfs_get_inode(struct super_block *sb, u64 ino,
					u32 generation)
{
	struct inode *inode;

	if (!affs_validblock(sb, ino))
		return ERR_PTR(-ESTALE);

	inode = affs_iget(sb, ino);
	if (IS_ERR(inode))
		return ERR_CAST(inode);

	return inode;
}

static struct dentry *affs_fh_to_dentry(struct super_block *sb, struct fid *fid,
					int fh_len, int fh_type)
{
	return generic_fh_to_dentry(sb, fid, fh_len, fh_type,
				    affs_nfs_get_inode);
}

static struct dentry *affs_fh_to_parent(struct super_block *sb, struct fid *fid,
					int fh_len, int fh_type)
{
	return generic_fh_to_parent(sb, fid, fh_len, fh_type,
				    affs_nfs_get_inode);
}

const struct export_operations affs_export_ops = {
	.fh_to_dentry = affs_fh_to_dentry,
	.fh_to_parent = affs_fh_to_parent,
	.get_parent = affs_get_parent,
};

const struct dentry_operations affs_dentry_operations = {
	.d_hash		= affs_hash_dentry,
	.d_compare	= affs_compare_dentry,
};

const struct dentry_operations affs_intl_dentry_operations = {
	.d_hash		= affs_intl_hash_dentry,
	.d_compare	= affs_intl_compare_dentry,
};
Commit	Line	Data
b2441318	1	// SPDX-License-Identifier: GPL-2.0
1da177e4 LT	2	/*
	3	* linux/fs/affs/namei.c
	4	*
	5	* (c) 1996 Hans-Joachim Widmaier - Rewritten
	6	*
	7	* (C) 1993 Ray Burr - Modified for Amiga FFS filesystem.
	8	*
	9	* (C) 1991 Linus Torvalds - minix filesystem
	10	*/
	11
	12	#include "affs.h"
ed4433d7	13	#include <linux/exportfs.h>
1da177e4 LT	14
	15	typedef int (*toupper_t)(int);
	16
1da177e4 LT	17	/* Simple toupper() for DOS\1 */
	18
	19	static int
	20	affs_toupper(int ch)
	21	{
	22	return ch >= 'a' && ch <= 'z' ? ch -= ('a' - 'A') : ch;
	23	}
	24
	25	/* International toupper() for DOS\3 ("international") */
	26
	27	static int
	28	affs_intl_toupper(int ch)
	29	{
	30	return (ch >= 'a' && ch <= 'z') \|\| (ch >= 0xE0
	31	&& ch <= 0xFE && ch != 0xF7) ?
	32	ch - ('a' - 'A') : ch;
	33	}
	34
	35	static inline toupper_t
	36	affs_get_toupper(struct super_block *sb)
	37	{
79bda4d5 FF	38	return affs_test_opt(AFFS_SB(sb)->s_flags, SF_INTL) ?
79bda4d5 FF	39	affs_intl_toupper : affs_toupper;
1da177e4 LT	40	}
	41
	42	/*
	43	* Note: the dentry argument is the parent dentry.
	44	*/
	45	static inline int
8387ff25	46	__affs_hash_dentry(const struct dentry dentry, struct qstr qstr, toupper_t toupper, bool notruncate)
1da177e4 LT	47	{
	48	const u8 *name = qstr->name;
	49	unsigned long hash;
eeb36f8e FF	50	int retval;
eeb36f8e FF	51	u32 len;
1da177e4	52
eeb36f8e FF	53	retval = affs_check_name(qstr->name, qstr->len, notruncate);
	54	if (retval)
	55	return retval;
1da177e4	56
8387ff25	57	hash = init_name_hash(dentry);
f157853e	58	len = min(qstr->len, AFFSNAMEMAX);
eeb36f8e	59	for (; len > 0; name++, len--)
1da177e4 LT	60	hash = partial_name_hash(toupper(*name), hash);
	61	qstr->hash = end_name_hash(hash);
	62
	63	return 0;
	64	}
	65
	66	static int
da53be12	67	affs_hash_dentry(const struct dentry dentry, struct qstr qstr)
1da177e4	68	{
8387ff25	69	return __affs_hash_dentry(dentry, qstr, affs_toupper,
8ca57722 FF	70	affs_nofilenametruncate(dentry));
8ca57722 FF	71
1da177e4	72	}
8ca57722	73
1da177e4	74	static int
da53be12	75	affs_intl_hash_dentry(const struct dentry dentry, struct qstr qstr)
1da177e4	76	{
8387ff25	77	return __affs_hash_dentry(dentry, qstr, affs_intl_toupper,
8ca57722 FF	78	affs_nofilenametruncate(dentry));
8ca57722 FF	79
1da177e4 LT	80	}
1da177e4 LT	81
621e155a	82	static inline int __affs_compare_dentry(unsigned int len,
8ca57722 FF	83	const char str, const struct qstr name, toupper_t toupper,
8ca57722 FF	84	bool notruncate)
1da177e4	85	{
621e155a NP	86	const u8 *aname = str;
621e155a NP	87	const u8 *bname = name->name;
1da177e4	88
621e155a NP	89	/*
	90	* 'str' is the name of an already existing dentry, so the name
	91	* must be valid. 'name' must be validated first.
1da177e4 LT	92	*/
1da177e4 LT	93
8ca57722	94	if (affs_check_name(name->name, name->len, notruncate))
1da177e4 LT	95	return 1;
1da177e4 LT	96
621e155a NP	97	/*
621e155a NP	98	* If the names are longer than the allowed 30 chars,
1da177e4 LT	99	* the excess is ignored, so their length may differ.
1da177e4 LT	100	*/
f157853e FF	101	if (len >= AFFSNAMEMAX) {
f157853e FF	102	if (name->len < AFFSNAMEMAX)
1da177e4	103	return 1;
f157853e	104	len = AFFSNAMEMAX;
621e155a	105	} else if (len != name->len)
1da177e4 LT	106	return 1;
	107
	108	for (; len > 0; len--)
	109	if (toupper(aname++) != toupper(bname++))
	110	return 1;
	111
	112	return 0;
	113	}
	114
	115	static int
6fa67e70	116	affs_compare_dentry(const struct dentry *dentry,
621e155a	117	unsigned int len, const char str, const struct qstr name)
1da177e4	118	{
8ca57722 FF	119
8ca57722 FF	120	return __affs_compare_dentry(len, str, name, affs_toupper,
e0b3f595	121	affs_nofilenametruncate(dentry));
1da177e4	122	}
8ca57722	123
1da177e4	124	static int
6fa67e70	125	affs_intl_compare_dentry(const struct dentry *dentry,
621e155a	126	unsigned int len, const char str, const struct qstr name)
1da177e4	127	{
8ca57722	128	return __affs_compare_dentry(len, str, name, affs_intl_toupper,
e0b3f595	129	affs_nofilenametruncate(dentry));
8ca57722	130
1da177e4 LT	131	}
	132
	133	/*
	134	* NOTE! unlike strncmp, affs_match returns 1 for success, 0 for failure.
	135	*/
	136
	137	static inline int
	138	affs_match(struct dentry dentry, const u8 name2, toupper_t toupper)
	139	{
	140	const u8 *name = dentry->d_name.name;
	141	int len = dentry->d_name.len;
	142
f157853e FF	143	if (len >= AFFSNAMEMAX) {
f157853e FF	144	if (*name2 < AFFSNAMEMAX)
1da177e4	145	return 0;
f157853e	146	len = AFFSNAMEMAX;
1da177e4 LT	147	} else if (len != *name2)
	148	return 0;
	149
	150	for (name2++; len > 0; len--)
	151	if (toupper(name++) != toupper(name2++))
	152	return 0;
	153	return 1;
	154	}
	155
	156	int
	157	affs_hash_name(struct super_block sb, const u8 name, unsigned int len)
	158	{
	159	toupper_t toupper = affs_get_toupper(sb);
eeb36f8e	160	u32 hash;
1da177e4	161
f157853e	162	hash = len = min(len, AFFSNAMEMAX);
1da177e4 LT	163	for (; len > 0; len--)
	164	hash = (hash * 13 + toupper(*name++)) & 0x7ff;
	165
	166	return hash % AFFS_SB(sb)->s_hashsize;
	167	}
	168
	169	static struct buffer_head *
	170	affs_find_entry(struct inode dir, struct dentry dentry)
	171	{
	172	struct super_block *sb = dir->i_sb;
	173	struct buffer_head *bh;
	174	toupper_t toupper = affs_get_toupper(sb);
	175	u32 key;
	176
a455589f	177	pr_debug("%s(\"%pd\")\n", __func__, dentry);
1da177e4 LT	178
	179	bh = affs_bread(sb, dir->i_ino);
	180	if (!bh)
	181	return ERR_PTR(-EIO);
	182
	183	key = be32_to_cpu(AFFS_HEAD(bh)->table[affs_hash_name(sb, dentry->d_name.name, dentry->d_name.len)]);
	184
	185	for (;;) {
	186	affs_brelse(bh);
	187	if (key == 0)
	188	return NULL;
	189	bh = affs_bread(sb, key);
	190	if (!bh)
	191	return ERR_PTR(-EIO);
	192	if (affs_match(dentry, AFFS_TAIL(sb, bh)->name, toupper))
	193	return bh;
	194	key = be32_to_cpu(AFFS_TAIL(sb, bh)->hash_chain);
	195	}
	196	}
	197
	198	struct dentry *
00cd8dd3	199	affs_lookup(struct inode dir, struct dentry dentry, unsigned int flags)
1da177e4 LT	200	{
	201	struct super_block *sb = dir->i_sb;
	202	struct buffer_head *bh;
	203	struct inode *inode = NULL;
87fbd639	204	struct dentry *res;
1da177e4	205
a455589f	206	pr_debug("%s(\"%pd\")\n", __func__, dentry);
1da177e4 LT	207
	208	affs_lock_dir(dir);
	209	bh = affs_find_entry(dir, dentry);
30da870c AV	210	if (IS_ERR(bh)) {
30da870c AV	211	affs_unlock_dir(dir);
e231c2ee	212	return ERR_CAST(bh);
30da870c	213	}
1da177e4 LT	214	if (bh) {
	215	u32 ino = bh->b_blocknr;
	216
	217	/* store the real header ino in d_fsdata for faster lookups */
	218	dentry->d_fsdata = (void *)(long)ino;
	219	switch (be32_to_cpu(AFFS_TAIL(sb, bh)->stype)) {
	220	//link to dirs disabled
	221	//case ST_LINKDIR:
	222	case ST_LINKFILE:
	223	ino = be32_to_cpu(AFFS_TAIL(sb, bh)->original);
	224	}
	225	affs_brelse(bh);
210f8559	226	inode = affs_iget(sb, ino);
1da177e4	227	}
87fbd639 AV	228	res = d_splice_alias(inode, dentry);
	229	if (!IS_ERR_OR_NULL(res))
	230	res->d_fsdata = dentry->d_fsdata;
30da870c	231	affs_unlock_dir(dir);
87fbd639	232	return res;
1da177e4 LT	233	}
	234
	235	int
	236	affs_unlink(struct inode dir, struct dentry dentry)
	237	{
08fe100d	238	pr_debug("%s(dir=%lu, %lu \"%pd\")\n", __func__, dir->i_ino,
2b0143b5	239	d_inode(dentry)->i_ino, dentry);
1da177e4 LT	240
	241	return affs_remove_header(dentry);
	242	}
	243
	244	int
ebfc3b49	245	affs_create(struct inode dir, struct dentry dentry, umode_t mode, bool excl)
1da177e4 LT	246	{
	247	struct super_block *sb = dir->i_sb;
	248	struct inode *inode;
	249	int error;
	250
a455589f AV	251	pr_debug("%s(%lu,\"%pd\",0%ho)\n",
a455589f AV	252	__func__, dir->i_ino, dentry, mode);
1da177e4 LT	253
	254	inode = affs_new_inode(dir);
	255	if (!inode)
	256	return -ENOSPC;
	257
	258	inode->i_mode = mode;
c1618208	259	affs_mode_to_prot(inode);
1da177e4 LT	260	mark_inode_dirty(inode);
	261
	262	inode->i_op = &affs_file_inode_operations;
	263	inode->i_fop = &affs_file_operations;
79bda4d5	264	inode->i_mapping->a_ops = affs_test_opt(AFFS_SB(sb)->s_flags, SF_OFS) ?
a0016ff2	265	&affs_aops_ofs : &affs_aops;
1da177e4 LT	266	error = affs_add_entry(dir, inode, dentry, ST_FILE);
1da177e4 LT	267	if (error) {
6d6b77f1	268	clear_nlink(inode);
1da177e4 LT	269	iput(inode);
	270	return error;
	271	}
	272	return 0;
	273	}
	274
	275	int
18bb1db3	276	affs_mkdir(struct inode dir, struct dentry dentry, umode_t mode)
1da177e4 LT	277	{
	278	struct inode *inode;
	279	int error;
	280
a455589f AV	281	pr_debug("%s(%lu,\"%pd\",0%ho)\n",
a455589f AV	282	__func__, dir->i_ino, dentry, mode);
1da177e4 LT	283
	284	inode = affs_new_inode(dir);
	285	if (!inode)
	286	return -ENOSPC;
	287
	288	inode->i_mode = S_IFDIR \| mode;
c1618208	289	affs_mode_to_prot(inode);
1da177e4 LT	290
	291	inode->i_op = &affs_dir_inode_operations;
	292	inode->i_fop = &affs_dir_operations;
	293
	294	error = affs_add_entry(dir, inode, dentry, ST_USERDIR);
	295	if (error) {
6d6b77f1	296	clear_nlink(inode);
1da177e4 LT	297	mark_inode_dirty(inode);
	298	iput(inode);
	299	return error;
	300	}
	301	return 0;
	302	}
	303
	304	int
	305	affs_rmdir(struct inode dir, struct dentry dentry)
	306	{
08fe100d	307	pr_debug("%s(dir=%lu, %lu \"%pd\")\n", __func__, dir->i_ino,
2b0143b5	308	d_inode(dentry)->i_ino, dentry);
1da177e4 LT	309
	310	return affs_remove_header(dentry);
	311	}
	312
	313	int
	314	affs_symlink(struct inode dir, struct dentry dentry, const char *symname)
	315	{
	316	struct super_block *sb = dir->i_sb;
	317	struct buffer_head *bh;
	318	struct inode *inode;
	319	char *p;
	320	int i, maxlen, error;
	321	char c, lc;
	322
a455589f AV	323	pr_debug("%s(%lu,\"%pd\" -> \"%s\")\n",
a455589f AV	324	__func__, dir->i_ino, dentry, symname);
1da177e4 LT	325
	326	maxlen = AFFS_SB(sb)->s_hashsize * sizeof(u32) - 1;
	327	inode = affs_new_inode(dir);
	328	if (!inode)
	329	return -ENOSPC;
	330
	331	inode->i_op = &affs_symlink_inode_operations;
21fc61c7	332	inode_nohighmem(inode);
1da177e4 LT	333	inode->i_data.a_ops = &affs_symlink_aops;
1da177e4 LT	334	inode->i_mode = S_IFLNK \| 0777;
c1618208	335	affs_mode_to_prot(inode);
1da177e4 LT	336
	337	error = -EIO;
	338	bh = affs_bread(sb, inode->i_ino);
	339	if (!bh)
	340	goto err;
	341	i = 0;
	342	p = (char *)AFFS_HEAD(bh)->table;
	343	lc = '/';
	344	if (*symname == '/') {
29333920	345	struct affs_sb_info *sbi = AFFS_SB(sb);
1da177e4 LT	346	while (*symname == '/')
1da177e4 LT	347	symname++;
29333920 AV	348	spin_lock(&sbi->symlink_lock);
	349	while (sbi->s_volume[i]) /* Cannot overflow */
	350	*p++ = sbi->s_volume[i++];
	351	spin_unlock(&sbi->symlink_lock);
1da177e4 LT	352	}
	353	while (i < maxlen && (c = *symname++)) {
	354	if (c == '.' && lc == '/' && *symname == '.' && symname[1] == '/') {
	355	*p++ = '/';
	356	i++;
	357	symname += 2;
	358	lc = '/';
	359	} else if (c == '.' && lc == '/' && *symname == '/') {
	360	symname++;
	361	lc = '/';
	362	} else {
	363	*p++ = c;
	364	lc = c;
	365	i++;
	366	}
	367	if (lc == '/')
	368	while (*symname == '/')
	369	symname++;
	370	}
	371	*p = 0;
f1bf9072	372	inode->i_size = i + 1;
1da177e4 LT	373	mark_buffer_dirty_inode(bh, inode);
	374	affs_brelse(bh);
	375	mark_inode_dirty(inode);
	376
	377	error = affs_add_entry(dir, inode, dentry, ST_SOFTLINK);
	378	if (error)
	379	goto err;
	380
	381	return 0;
	382
	383	err:
6d6b77f1	384	clear_nlink(inode);
1da177e4 LT	385	mark_inode_dirty(inode);
	386	iput(inode);
	387	return error;
	388	}
	389
	390	int
	391	affs_link(struct dentry old_dentry, struct inode dir, struct dentry *dentry)
	392	{
2b0143b5	393	struct inode *inode = d_inode(old_dentry);
1da177e4	394
08fe100d	395	pr_debug("%s(%lu, %lu, \"%pd\")\n", __func__, inode->i_ino, dir->i_ino,
a455589f	396	dentry);
1da177e4 LT	397
	398	return affs_add_entry(dir, inode, dentry, ST_LINKFILE);
	399	}
	400
c6184028	401	static int
1da177e4	402	affs_rename(struct inode old_dir, struct dentry old_dentry,
c6184028	403	struct inode new_dir, struct dentry new_dentry)
1da177e4 LT	404	{
	405	struct super_block *sb = old_dir->i_sb;
	406	struct buffer_head *bh = NULL;
	407	int retval;
	408
8ca57722 FF	409	retval = affs_check_name(new_dentry->d_name.name,
	410	new_dentry->d_name.len,
	411	affs_nofilenametruncate(old_dentry));
	412
1da177e4 LT	413	if (retval)
	414	return retval;
	415
	416	/* Unlink destination if it already exists */
2b0143b5	417	if (d_really_is_positive(new_dentry)) {
1da177e4 LT	418	retval = affs_remove_header(new_dentry);
	419	if (retval)
	420	return retval;
	421	}
	422
2b0143b5	423	bh = affs_bread(sb, d_inode(old_dentry)->i_ino);
1da177e4	424	if (!bh)
3ac81413	425	return -EIO;
1da177e4 LT	426
	427	/* Remove header from its parent directory. */
	428	affs_lock_dir(old_dir);
	429	retval = affs_remove_hash(old_dir, bh);
	430	affs_unlock_dir(old_dir);
	431	if (retval)
	432	goto done;
	433
	434	/* And insert it into the new directory with the new name. */
	435	affs_copy_name(AFFS_TAIL(sb, bh)->name, new_dentry);
	436	affs_fix_checksum(sb, bh);
	437	affs_lock_dir(new_dir);
	438	retval = affs_insert_hash(new_dir, bh);
	439	affs_unlock_dir(new_dir);
	440	/* TODO: move it back to old_dir, if error? */
	441
	442	done:
	443	mark_buffer_dirty_inode(bh, retval ? old_dir : new_dir);
	444	affs_brelse(bh);
	445	return retval;
	446	}
ed4433d7	447
6b465766 FF	448	static int
	449	affs_xrename(struct inode old_dir, struct dentry old_dentry,
	450	struct inode new_dir, struct dentry new_dentry)
	451	{
	452
	453	struct super_block *sb = old_dir->i_sb;
	454	struct buffer_head *bh_old = NULL;
	455	struct buffer_head *bh_new = NULL;
	456	int retval;
	457
	458	bh_old = affs_bread(sb, d_inode(old_dentry)->i_ino);
	459	if (!bh_old)
	460	return -EIO;
	461
	462	bh_new = affs_bread(sb, d_inode(new_dentry)->i_ino);
	463	if (!bh_new)
	464	return -EIO;
	465
	466	/* Remove old header from its parent directory. */
	467	affs_lock_dir(old_dir);
	468	retval = affs_remove_hash(old_dir, bh_old);
	469	affs_unlock_dir(old_dir);
	470	if (retval)
	471	goto done;
	472
	473	/* Remove new header from its parent directory. */
	474	affs_lock_dir(new_dir);
	475	retval = affs_remove_hash(new_dir, bh_new);
	476	affs_unlock_dir(new_dir);
	477	if (retval)
	478	goto done;
	479
	480	/* Insert old into the new directory with the new name. */
	481	affs_copy_name(AFFS_TAIL(sb, bh_old)->name, new_dentry);
	482	affs_fix_checksum(sb, bh_old);
	483	affs_lock_dir(new_dir);
	484	retval = affs_insert_hash(new_dir, bh_old);
	485	affs_unlock_dir(new_dir);
	486
	487	/* Insert new into the old directory with the old name. */
	488	affs_copy_name(AFFS_TAIL(sb, bh_new)->name, old_dentry);
	489	affs_fix_checksum(sb, bh_new);
	490	affs_lock_dir(old_dir);
	491	retval = affs_insert_hash(old_dir, bh_new);
	492	affs_unlock_dir(old_dir);
	493	done:
	494	mark_buffer_dirty_inode(bh_old, new_dir);
	495	mark_buffer_dirty_inode(bh_new, old_dir);
	496	affs_brelse(bh_old);
	497	affs_brelse(bh_new);
	498	return retval;
	499	}
	500
c6184028 FF	501	int affs_rename2(struct inode old_dir, struct dentry old_dentry,
	502	struct inode new_dir, struct dentry new_dentry,
	503	unsigned int flags)
	504	{
	505
6b465766	506	if (flags & ~(RENAME_NOREPLACE \| RENAME_EXCHANGE))
c6184028 FF	507	return -EINVAL;
	508
	509	pr_debug("%s(old=%lu,\"%pd\" to new=%lu,\"%pd\")\n", __func__,
	510	old_dir->i_ino, old_dentry, new_dir->i_ino, new_dentry);
	511
6b465766 FF	512	if (flags & RENAME_EXCHANGE)
	513	return affs_xrename(old_dir, old_dentry, new_dir, new_dentry);
	514
c6184028 FF	515	return affs_rename(old_dir, old_dentry, new_dir, new_dentry);
	516	}
	517
b3b42c0d FF	518	static struct dentry affs_get_parent(struct dentry child)
	519	{
	520	struct inode *parent;
	521	struct buffer_head *bh;
	522
	523	bh = affs_bread(child->d_sb, d_inode(child)->i_ino);
	524	if (!bh)
	525	return ERR_PTR(-EIO);
	526
	527	parent = affs_iget(child->d_sb,
	528	be32_to_cpu(AFFS_TAIL(child->d_sb, bh)->parent));
	529	brelse(bh);
	530	if (IS_ERR(parent))
	531	return ERR_CAST(parent);
	532
	533	return d_obtain_alias(parent);
	534	}
	535
ed4433d7 FF	536	static struct inode affs_nfs_get_inode(struct super_block sb, u64 ino,
	537	u32 generation)
	538	{
	539	struct inode *inode;
	540
	541	if (!affs_validblock(sb, ino))
	542	return ERR_PTR(-ESTALE);
	543
	544	inode = affs_iget(sb, ino);
	545	if (IS_ERR(inode))
	546	return ERR_CAST(inode);
	547
ed4433d7 FF	548	return inode;
	549	}
	550
	551	static struct dentry affs_fh_to_dentry(struct super_block sb, struct fid *fid,
	552	int fh_len, int fh_type)
	553	{
	554	return generic_fh_to_dentry(sb, fid, fh_len, fh_type,
	555	affs_nfs_get_inode);
	556	}
	557
	558	static struct dentry affs_fh_to_parent(struct super_block sb, struct fid *fid,
	559	int fh_len, int fh_type)
	560	{
	561	return generic_fh_to_parent(sb, fid, fh_len, fh_type,
	562	affs_nfs_get_inode);
	563	}
	564
	565	const struct export_operations affs_export_ops = {
	566	.fh_to_dentry = affs_fh_to_dentry,
	567	.fh_to_parent = affs_fh_to_parent,
b3b42c0d	568	.get_parent = affs_get_parent,
ed4433d7	569	};
f567accb FF	570
	571	const struct dentry_operations affs_dentry_operations = {
	572	.d_hash = affs_hash_dentry,
	573	.d_compare = affs_compare_dentry,
	574	};
	575
	576	const struct dentry_operations affs_intl_dentry_operations = {
	577	.d_hash = affs_intl_hash_dentry,
	578	.d_compare = affs_intl_compare_dentry,
	579	};