[deliverable/linux.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_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)
{
	const u8 *name = qstr->name;
	unsigned long hash;
	int i;

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

	hash = init_name_hash();
	i = min(qstr->len, 30u);
	for (; i > 0; name++, i--)
		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);
}
static int
affs_intl_hash_dentry(const struct dentry *dentry, struct qstr *qstr)
{
	return __affs_hash_dentry(qstr, affs_intl_toupper);
}

static inline int __affs_compare_dentry(unsigned int len,
		const char *str, const struct qstr *name, toupper_t toupper)
{
	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))
		return 1;

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

/*
 * 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 >= 30) {
		if (*name2 < 30)
			return 0;
		len = 30;
	} 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);
	int hash;

	hash = len = min(len, 30u);
	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("AFFS: find_entry(\"%.*s\")\n", (int)dentry->d_name.len, dentry->d_name.name);

	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("AFFS: lookup(\"%.*s\")\n",(int)dentry->d_name.len,dentry->d_name.name);

	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("AFFS: unlink(dir=%d, %lu \"%.*s\")\n", (u32)dir->i_ino,
		 dentry->d_inode->i_ino,
		 (int)dentry->d_name.len, dentry->d_name.name);

	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("AFFS: create(%lu,\"%.*s\",0%ho)\n",dir->i_ino,(int)dentry->d_name.len,
		 dentry->d_name.name,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_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("AFFS: mkdir(%lu,\"%.*s\",0%ho)\n",dir->i_ino,
		 (int)dentry->d_name.len,dentry->d_name.name,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("AFFS: rmdir(dir=%u, %lu \"%.*s\")\n", (u32)dir->i_ino,
		 dentry->d_inode->i_ino,
		 (int)dentry->d_name.len, dentry->d_name.name);

	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("AFFS: symlink(%lu,\"%.*s\" -> \"%s\")\n",dir->i_ino,
		 (int)dentry->d_name.len,dentry->d_name.name,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 = old_dentry->d_inode;

	pr_debug("AFFS: link(%u, %u, \"%.*s\")\n", (u32)inode->i_ino, (u32)dir->i_ino,
		 (int)dentry->d_name.len,dentry->d_name.name);

	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("AFFS: rename(old=%u,\"%*s\" to new=%u,\"%*s\")\n",
		 (u32)old_dir->i_ino, (int)old_dentry->d_name.len, old_dentry->d_name.name,
		 (u32)new_dir->i_ino, (int)new_dentry->d_name.len, new_dentry->d_name.name);

	retval = affs_check_name(new_dentry->d_name.name,new_dentry->d_name.len);
	if (retval)
		return retval;

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

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