[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 *,
		const struct inode *, struct qstr *);
static int       affs_compare_dentry(const struct dentry *parent,
		const struct inode *pinode,
		const struct dentry *dentry, const struct inode *inode,
		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 *,
		const struct inode *, struct qstr *);
static int       affs_intl_compare_dentry(const struct dentry *parent,
		const struct inode *pinode,
		const struct dentry *dentry, const struct inode *inode,
		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,
};

static 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, const struct inode *inode,
		struct qstr *qstr)
{
	return __affs_hash_dentry(qstr, affs_toupper);
}
static int
affs_intl_hash_dentry(const struct dentry *dentry, const struct inode *inode,
		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 inode *pinode,
		const struct dentry *dentry, const struct inode *inode,
		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 inode *pinode,
		const struct dentry *dentry, const struct inode *inode,
		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, struct nameidata *nd)
{
	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_set_d_op(dentry, AFFS_SB(sb)->s_flags & SF_INTL ? &affs_intl_dentry_operations : &affs_dentry_operations);
	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, int mode, struct nameidata *nd)
{
	struct super_block *sb = dir->i_sb;
	struct inode	*inode;
	int		 error;

	pr_debug("AFFS: create(%lu,\"%.*s\",0%o)\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) {
		inode->i_nlink = 0;
		iput(inode);
		return error;
	}
	return 0;
}

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

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