[linux-2.6-block.git] / fs / affs / namei.c

/*
 *  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"

typedef int (*toupper_t)(int);

static int	 affs_toupper(int ch);
static int	 affs_hash_dentry(const struct dentry *, struct qstr *);
static int       affs_compare_dentry(const struct dentry *parent, const struct dentry *dentry,
		unsigned int len, const char *str, const struct qstr *name);
static int	 affs_intl_toupper(int ch);
static int	 affs_intl_hash_dentry(const struct dentry *, struct qstr *);
static int       affs_intl_compare_dentry(const struct dentry *parent, const struct dentry *dentry,
		unsigned int len, const char *str, const struct qstr *name);

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,
};


/* 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(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();
	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(qstr, affs_toupper,
				  affs_nofilenametruncate(dentry));

}

static int
affs_intl_hash_dentry(const struct dentry *dentry, struct qstr *qstr)
{
	return __affs_hash_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 *parent, 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(parent));
}

static int
affs_intl_compare_dentry(const struct dentry *parent, 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(parent));

}

/*
 * 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;
	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;
	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->i_data.a_ops = &affs_symlink_aops;
	inode->i_mode = S_IFLNK | 0777;
	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;
	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);
}

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;

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

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