[mirror_ubuntu-bionic-kernel.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;

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

	affs_lock_dir(dir);
	bh = affs_find_entry(dir, dentry);
	affs_unlock_dir(dir);
	if (IS_ERR(bh))
		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);
		if (IS_ERR(inode))
			return ERR_CAST(inode);
	}
	d_add(dentry, inode);
	return NULL;
}

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;
	204
a455589f	205	pr_debug("%s(\"%pd\")\n", __func__, dentry);
1da177e4 LT	206
	207	affs_lock_dir(dir);
	208	bh = affs_find_entry(dir, dentry);
	209	affs_unlock_dir(dir);
210f8559	210	if (IS_ERR(bh))
e231c2ee	211	return ERR_CAST(bh);
1da177e4 LT	212	if (bh) {
	213	u32 ino = bh->b_blocknr;
	214
	215	/* store the real header ino in d_fsdata for faster lookups */
	216	dentry->d_fsdata = (void *)(long)ino;
	217	switch (be32_to_cpu(AFFS_TAIL(sb, bh)->stype)) {
	218	//link to dirs disabled
	219	//case ST_LINKDIR:
	220	case ST_LINKFILE:
	221	ino = be32_to_cpu(AFFS_TAIL(sb, bh)->original);
	222	}
	223	affs_brelse(bh);
210f8559 DH	224	inode = affs_iget(sb, ino);
210f8559 DH	225	if (IS_ERR(inode))
cccad8f9	226	return ERR_CAST(inode);
1da177e4	227	}
1da177e4 LT	228	d_add(dentry, inode);
	229	return NULL;
	230	}
	231
	232	int
	233	affs_unlink(struct inode dir, struct dentry dentry)
	234	{
08fe100d	235	pr_debug("%s(dir=%lu, %lu \"%pd\")\n", __func__, dir->i_ino,
2b0143b5	236	d_inode(dentry)->i_ino, dentry);
1da177e4 LT	237
	238	return affs_remove_header(dentry);
	239	}
	240
	241	int
ebfc3b49	242	affs_create(struct inode dir, struct dentry dentry, umode_t mode, bool excl)
1da177e4 LT	243	{
	244	struct super_block *sb = dir->i_sb;
	245	struct inode *inode;
	246	int error;
	247
a455589f AV	248	pr_debug("%s(%lu,\"%pd\",0%ho)\n",
a455589f AV	249	__func__, dir->i_ino, dentry, mode);
1da177e4 LT	250
	251	inode = affs_new_inode(dir);
	252	if (!inode)
	253	return -ENOSPC;
	254
	255	inode->i_mode = mode;
c1618208	256	affs_mode_to_prot(inode);
1da177e4 LT	257	mark_inode_dirty(inode);
	258
	259	inode->i_op = &affs_file_inode_operations;
	260	inode->i_fop = &affs_file_operations;
79bda4d5	261	inode->i_mapping->a_ops = affs_test_opt(AFFS_SB(sb)->s_flags, SF_OFS) ?
a0016ff2	262	&affs_aops_ofs : &affs_aops;
1da177e4 LT	263	error = affs_add_entry(dir, inode, dentry, ST_FILE);
1da177e4 LT	264	if (error) {
6d6b77f1	265	clear_nlink(inode);
1da177e4 LT	266	iput(inode);
	267	return error;
	268	}
	269	return 0;
	270	}
	271
	272	int
18bb1db3	273	affs_mkdir(struct inode dir, struct dentry dentry, umode_t mode)
1da177e4 LT	274	{
	275	struct inode *inode;
	276	int error;
	277
a455589f AV	278	pr_debug("%s(%lu,\"%pd\",0%ho)\n",
a455589f AV	279	__func__, dir->i_ino, dentry, mode);
1da177e4 LT	280
	281	inode = affs_new_inode(dir);
	282	if (!inode)
	283	return -ENOSPC;
	284
	285	inode->i_mode = S_IFDIR \| mode;
c1618208	286	affs_mode_to_prot(inode);
1da177e4 LT	287
	288	inode->i_op = &affs_dir_inode_operations;
	289	inode->i_fop = &affs_dir_operations;
	290
	291	error = affs_add_entry(dir, inode, dentry, ST_USERDIR);
	292	if (error) {
6d6b77f1	293	clear_nlink(inode);
1da177e4 LT	294	mark_inode_dirty(inode);
	295	iput(inode);
	296	return error;
	297	}
	298	return 0;
	299	}
	300
	301	int
	302	affs_rmdir(struct inode dir, struct dentry dentry)
	303	{
08fe100d	304	pr_debug("%s(dir=%lu, %lu \"%pd\")\n", __func__, dir->i_ino,
2b0143b5	305	d_inode(dentry)->i_ino, dentry);
1da177e4 LT	306
	307	return affs_remove_header(dentry);
	308	}
	309
	310	int
	311	affs_symlink(struct inode dir, struct dentry dentry, const char *symname)
	312	{
	313	struct super_block *sb = dir->i_sb;
	314	struct buffer_head *bh;
	315	struct inode *inode;
	316	char *p;
	317	int i, maxlen, error;
	318	char c, lc;
	319
a455589f AV	320	pr_debug("%s(%lu,\"%pd\" -> \"%s\")\n",
a455589f AV	321	__func__, dir->i_ino, dentry, symname);
1da177e4 LT	322
	323	maxlen = AFFS_SB(sb)->s_hashsize * sizeof(u32) - 1;
	324	inode = affs_new_inode(dir);
	325	if (!inode)
	326	return -ENOSPC;
	327
	328	inode->i_op = &affs_symlink_inode_operations;
21fc61c7	329	inode_nohighmem(inode);
1da177e4 LT	330	inode->i_data.a_ops = &affs_symlink_aops;
1da177e4 LT	331	inode->i_mode = S_IFLNK \| 0777;
c1618208	332	affs_mode_to_prot(inode);
1da177e4 LT	333
	334	error = -EIO;
	335	bh = affs_bread(sb, inode->i_ino);
	336	if (!bh)
	337	goto err;
	338	i = 0;
	339	p = (char *)AFFS_HEAD(bh)->table;
	340	lc = '/';
	341	if (*symname == '/') {
29333920	342	struct affs_sb_info *sbi = AFFS_SB(sb);
1da177e4 LT	343	while (*symname == '/')
1da177e4 LT	344	symname++;
29333920 AV	345	spin_lock(&sbi->symlink_lock);
	346	while (sbi->s_volume[i]) /* Cannot overflow */
	347	*p++ = sbi->s_volume[i++];
	348	spin_unlock(&sbi->symlink_lock);
1da177e4 LT	349	}
	350	while (i < maxlen && (c = *symname++)) {
	351	if (c == '.' && lc == '/' && *symname == '.' && symname[1] == '/') {
	352	*p++ = '/';
	353	i++;
	354	symname += 2;
	355	lc = '/';
	356	} else if (c == '.' && lc == '/' && *symname == '/') {
	357	symname++;
	358	lc = '/';
	359	} else {
	360	*p++ = c;
	361	lc = c;
	362	i++;
	363	}
	364	if (lc == '/')
	365	while (*symname == '/')
	366	symname++;
	367	}
	368	*p = 0;
f1bf9072	369	inode->i_size = i + 1;
1da177e4 LT	370	mark_buffer_dirty_inode(bh, inode);
	371	affs_brelse(bh);
	372	mark_inode_dirty(inode);
	373
	374	error = affs_add_entry(dir, inode, dentry, ST_SOFTLINK);
	375	if (error)
	376	goto err;
	377
	378	return 0;
	379
	380	err:
6d6b77f1	381	clear_nlink(inode);
1da177e4 LT	382	mark_inode_dirty(inode);
	383	iput(inode);
	384	return error;
	385	}
	386
	387	int
	388	affs_link(struct dentry old_dentry, struct inode dir, struct dentry *dentry)
	389	{
2b0143b5	390	struct inode *inode = d_inode(old_dentry);
1da177e4	391
08fe100d	392	pr_debug("%s(%lu, %lu, \"%pd\")\n", __func__, inode->i_ino, dir->i_ino,
a455589f	393	dentry);
1da177e4 LT	394
	395	return affs_add_entry(dir, inode, dentry, ST_LINKFILE);
	396	}
	397
c6184028	398	static int
1da177e4	399	affs_rename(struct inode old_dir, struct dentry old_dentry,
c6184028	400	struct inode new_dir, struct dentry new_dentry)
1da177e4 LT	401	{
	402	struct super_block *sb = old_dir->i_sb;
	403	struct buffer_head *bh = NULL;
	404	int retval;
	405
8ca57722 FF	406	retval = affs_check_name(new_dentry->d_name.name,
	407	new_dentry->d_name.len,
	408	affs_nofilenametruncate(old_dentry));
	409
1da177e4 LT	410	if (retval)
	411	return retval;
	412
	413	/* Unlink destination if it already exists */
2b0143b5	414	if (d_really_is_positive(new_dentry)) {
1da177e4 LT	415	retval = affs_remove_header(new_dentry);
	416	if (retval)
	417	return retval;
	418	}
	419
2b0143b5	420	bh = affs_bread(sb, d_inode(old_dentry)->i_ino);
1da177e4	421	if (!bh)
3ac81413	422	return -EIO;
1da177e4 LT	423
	424	/* Remove header from its parent directory. */
	425	affs_lock_dir(old_dir);
	426	retval = affs_remove_hash(old_dir, bh);
	427	affs_unlock_dir(old_dir);
	428	if (retval)
	429	goto done;
	430
	431	/* And insert it into the new directory with the new name. */
	432	affs_copy_name(AFFS_TAIL(sb, bh)->name, new_dentry);
	433	affs_fix_checksum(sb, bh);
	434	affs_lock_dir(new_dir);
	435	retval = affs_insert_hash(new_dir, bh);
	436	affs_unlock_dir(new_dir);
	437	/* TODO: move it back to old_dir, if error? */
	438
	439	done:
	440	mark_buffer_dirty_inode(bh, retval ? old_dir : new_dir);
	441	affs_brelse(bh);
	442	return retval;
	443	}
ed4433d7	444
6b465766 FF	445	static int
	446	affs_xrename(struct inode old_dir, struct dentry old_dentry,
	447	struct inode new_dir, struct dentry new_dentry)
	448	{
	449
	450	struct super_block *sb = old_dir->i_sb;
	451	struct buffer_head *bh_old = NULL;
	452	struct buffer_head *bh_new = NULL;
	453	int retval;
	454
	455	bh_old = affs_bread(sb, d_inode(old_dentry)->i_ino);
	456	if (!bh_old)
	457	return -EIO;
	458
	459	bh_new = affs_bread(sb, d_inode(new_dentry)->i_ino);
	460	if (!bh_new)
	461	return -EIO;
	462
	463	/* Remove old header from its parent directory. */
	464	affs_lock_dir(old_dir);
	465	retval = affs_remove_hash(old_dir, bh_old);
	466	affs_unlock_dir(old_dir);
	467	if (retval)
	468	goto done;
	469
	470	/* Remove new header from its parent directory. */
	471	affs_lock_dir(new_dir);
	472	retval = affs_remove_hash(new_dir, bh_new);
	473	affs_unlock_dir(new_dir);
	474	if (retval)
	475	goto done;
	476
	477	/* Insert old into the new directory with the new name. */
	478	affs_copy_name(AFFS_TAIL(sb, bh_old)->name, new_dentry);
	479	affs_fix_checksum(sb, bh_old);
	480	affs_lock_dir(new_dir);
	481	retval = affs_insert_hash(new_dir, bh_old);
	482	affs_unlock_dir(new_dir);
	483
	484	/* Insert new into the old directory with the old name. */
	485	affs_copy_name(AFFS_TAIL(sb, bh_new)->name, old_dentry);
	486	affs_fix_checksum(sb, bh_new);
	487	affs_lock_dir(old_dir);
	488	retval = affs_insert_hash(old_dir, bh_new);
	489	affs_unlock_dir(old_dir);
	490	done:
	491	mark_buffer_dirty_inode(bh_old, new_dir);
	492	mark_buffer_dirty_inode(bh_new, old_dir);
	493	affs_brelse(bh_old);
	494	affs_brelse(bh_new);
	495	return retval;
	496	}
	497
c6184028 FF	498	int affs_rename2(struct inode old_dir, struct dentry old_dentry,
	499	struct inode new_dir, struct dentry new_dentry,
	500	unsigned int flags)
	501	{
	502
6b465766	503	if (flags & ~(RENAME_NOREPLACE \| RENAME_EXCHANGE))
c6184028 FF	504	return -EINVAL;
	505
	506	pr_debug("%s(old=%lu,\"%pd\" to new=%lu,\"%pd\")\n", __func__,
	507	old_dir->i_ino, old_dentry, new_dir->i_ino, new_dentry);
	508
6b465766 FF	509	if (flags & RENAME_EXCHANGE)
	510	return affs_xrename(old_dir, old_dentry, new_dir, new_dentry);
	511
c6184028 FF	512	return affs_rename(old_dir, old_dentry, new_dir, new_dentry);
	513	}
	514
b3b42c0d FF	515	static struct dentry affs_get_parent(struct dentry child)
	516	{
	517	struct inode *parent;
	518	struct buffer_head *bh;
	519
	520	bh = affs_bread(child->d_sb, d_inode(child)->i_ino);
	521	if (!bh)
	522	return ERR_PTR(-EIO);
	523
	524	parent = affs_iget(child->d_sb,
	525	be32_to_cpu(AFFS_TAIL(child->d_sb, bh)->parent));
	526	brelse(bh);
	527	if (IS_ERR(parent))
	528	return ERR_CAST(parent);
	529
	530	return d_obtain_alias(parent);
	531	}
	532
ed4433d7 FF	533	static struct inode affs_nfs_get_inode(struct super_block sb, u64 ino,
	534	u32 generation)
	535	{
	536	struct inode *inode;
	537
	538	if (!affs_validblock(sb, ino))
	539	return ERR_PTR(-ESTALE);
	540
	541	inode = affs_iget(sb, ino);
	542	if (IS_ERR(inode))
	543	return ERR_CAST(inode);
	544
ed4433d7 FF	545	return inode;
	546	}
	547
	548	static struct dentry affs_fh_to_dentry(struct super_block sb, struct fid *fid,
	549	int fh_len, int fh_type)
	550	{
	551	return generic_fh_to_dentry(sb, fid, fh_len, fh_type,
	552	affs_nfs_get_inode);
	553	}
	554
	555	static struct dentry affs_fh_to_parent(struct super_block sb, struct fid *fid,
	556	int fh_len, int fh_type)
	557	{
	558	return generic_fh_to_parent(sb, fid, fh_len, fh_type,
	559	affs_nfs_get_inode);
	560	}
	561
	562	const struct export_operations affs_export_ops = {
	563	.fh_to_dentry = affs_fh_to_dentry,
	564	.fh_to_parent = affs_fh_to_parent,
b3b42c0d	565	.get_parent = affs_get_parent,
ed4433d7	566	};
f567accb FF	567
	568	const struct dentry_operations affs_dentry_operations = {
	569	.d_hash = affs_hash_dentry,
	570	.d_compare = affs_compare_dentry,
	571	};
	572
	573	const struct dentry_operations affs_intl_dentry_operations = {
	574	.d_hash = affs_intl_hash_dentry,
	575	.d_compare = affs_intl_compare_dentry,
	576	};