2 * linux/fs/affs/namei.c
4 * (c) 1996 Hans-Joachim Widmaier - Rewritten
6 * (C) 1993 Ray Burr - Modified for Amiga FFS filesystem.
8 * (C) 1991 Linus Torvalds - minix filesystem
13 typedef int (*toupper_t)(int);
15 static int affs_toupper(int ch);
16 static int affs_hash_dentry(const struct dentry *, struct qstr *);
17 static int affs_compare_dentry(const struct dentry *parent, const struct dentry *dentry,
18 unsigned int len, const char *str, const struct qstr *name);
19 static int affs_intl_toupper(int ch);
20 static int affs_intl_hash_dentry(const struct dentry *, struct qstr *);
21 static int affs_intl_compare_dentry(const struct dentry *parent, const struct dentry *dentry,
22 unsigned int len, const char *str, const struct qstr *name);
24 const struct dentry_operations affs_dentry_operations = {
25 .d_hash = affs_hash_dentry,
26 .d_compare = affs_compare_dentry,
29 const struct dentry_operations affs_intl_dentry_operations = {
30 .d_hash = affs_intl_hash_dentry,
31 .d_compare = affs_intl_compare_dentry,
35 /* Simple toupper() for DOS\1 */
40 return ch >= 'a' && ch <= 'z' ? ch -= ('a' - 'A') : ch;
43 /* International toupper() for DOS\3 ("international") */
46 affs_intl_toupper(int ch)
48 return (ch >= 'a' && ch <= 'z') || (ch >= 0xE0
49 && ch <= 0xFE && ch != 0xF7) ?
50 ch - ('a' - 'A') : ch;
53 static inline toupper_t
54 affs_get_toupper(struct super_block *sb)
56 return AFFS_SB(sb)->s_flags & SF_INTL ? affs_intl_toupper : affs_toupper;
60 * Note: the dentry argument is the parent dentry.
63 __affs_hash_dentry(struct qstr *qstr, toupper_t toupper, bool notruncate)
65 const u8 *name = qstr->name;
70 retval = affs_check_name(qstr->name, qstr->len, notruncate);
74 hash = init_name_hash();
75 len = min(qstr->len, AFFSNAMEMAX);
76 for (; len > 0; name++, len--)
77 hash = partial_name_hash(toupper(*name), hash);
78 qstr->hash = end_name_hash(hash);
84 affs_hash_dentry(const struct dentry *dentry, struct qstr *qstr)
86 return __affs_hash_dentry(qstr, affs_toupper,
87 affs_nofilenametruncate(dentry));
92 affs_intl_hash_dentry(const struct dentry *dentry, struct qstr *qstr)
94 return __affs_hash_dentry(qstr, affs_intl_toupper,
95 affs_nofilenametruncate(dentry));
99 static inline int __affs_compare_dentry(unsigned int len,
100 const char *str, const struct qstr *name, toupper_t toupper,
103 const u8 *aname = str;
104 const u8 *bname = name->name;
107 * 'str' is the name of an already existing dentry, so the name
108 * must be valid. 'name' must be validated first.
111 if (affs_check_name(name->name, name->len, notruncate))
115 * If the names are longer than the allowed 30 chars,
116 * the excess is ignored, so their length may differ.
118 if (len >= AFFSNAMEMAX) {
119 if (name->len < AFFSNAMEMAX)
122 } else if (len != name->len)
125 for (; len > 0; len--)
126 if (toupper(*aname++) != toupper(*bname++))
133 affs_compare_dentry(const struct dentry *parent, const struct dentry *dentry,
134 unsigned int len, const char *str, const struct qstr *name)
137 return __affs_compare_dentry(len, str, name, affs_toupper,
138 affs_nofilenametruncate(parent));
142 affs_intl_compare_dentry(const struct dentry *parent, const struct dentry *dentry,
143 unsigned int len, const char *str, const struct qstr *name)
145 return __affs_compare_dentry(len, str, name, affs_intl_toupper,
146 affs_nofilenametruncate(parent));
151 * NOTE! unlike strncmp, affs_match returns 1 for success, 0 for failure.
155 affs_match(struct dentry *dentry, const u8 *name2, toupper_t toupper)
157 const u8 *name = dentry->d_name.name;
158 int len = dentry->d_name.len;
160 if (len >= AFFSNAMEMAX) {
161 if (*name2 < AFFSNAMEMAX)
164 } else if (len != *name2)
167 for (name2++; len > 0; len--)
168 if (toupper(*name++) != toupper(*name2++))
174 affs_hash_name(struct super_block *sb, const u8 *name, unsigned int len)
176 toupper_t toupper = affs_get_toupper(sb);
179 hash = len = min(len, AFFSNAMEMAX);
180 for (; len > 0; len--)
181 hash = (hash * 13 + toupper(*name++)) & 0x7ff;
183 return hash % AFFS_SB(sb)->s_hashsize;
186 static struct buffer_head *
187 affs_find_entry(struct inode *dir, struct dentry *dentry)
189 struct super_block *sb = dir->i_sb;
190 struct buffer_head *bh;
191 toupper_t toupper = affs_get_toupper(sb);
194 pr_debug("%s(\"%pd\")\n", __func__, dentry);
196 bh = affs_bread(sb, dir->i_ino);
198 return ERR_PTR(-EIO);
200 key = be32_to_cpu(AFFS_HEAD(bh)->table[affs_hash_name(sb, dentry->d_name.name, dentry->d_name.len)]);
206 bh = affs_bread(sb, key);
208 return ERR_PTR(-EIO);
209 if (affs_match(dentry, AFFS_TAIL(sb, bh)->name, toupper))
211 key = be32_to_cpu(AFFS_TAIL(sb, bh)->hash_chain);
216 affs_lookup(struct inode *dir, struct dentry *dentry, unsigned int flags)
218 struct super_block *sb = dir->i_sb;
219 struct buffer_head *bh;
220 struct inode *inode = NULL;
222 pr_debug("%s(\"%pd\")\n", __func__, dentry);
225 bh = affs_find_entry(dir, dentry);
226 affs_unlock_dir(dir);
230 u32 ino = bh->b_blocknr;
232 /* store the real header ino in d_fsdata for faster lookups */
233 dentry->d_fsdata = (void *)(long)ino;
234 switch (be32_to_cpu(AFFS_TAIL(sb, bh)->stype)) {
235 //link to dirs disabled
238 ino = be32_to_cpu(AFFS_TAIL(sb, bh)->original);
241 inode = affs_iget(sb, ino);
243 return ERR_CAST(inode);
245 d_add(dentry, inode);
250 affs_unlink(struct inode *dir, struct dentry *dentry)
252 pr_debug("%s(dir=%lu, %lu \"%pd\")\n", __func__, dir->i_ino,
253 dentry->d_inode->i_ino, dentry);
255 return affs_remove_header(dentry);
259 affs_create(struct inode *dir, struct dentry *dentry, umode_t mode, bool excl)
261 struct super_block *sb = dir->i_sb;
265 pr_debug("%s(%lu,\"%pd\",0%ho)\n",
266 __func__, dir->i_ino, dentry, mode);
268 inode = affs_new_inode(dir);
272 inode->i_mode = mode;
274 mark_inode_dirty(inode);
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);
289 affs_mkdir(struct inode *dir, struct dentry *dentry, umode_t mode)
294 pr_debug("%s(%lu,\"%pd\",0%ho)\n",
295 __func__, dir->i_ino, dentry, mode);
297 inode = affs_new_inode(dir);
301 inode->i_mode = S_IFDIR | mode;
304 inode->i_op = &affs_dir_inode_operations;
305 inode->i_fop = &affs_dir_operations;
307 error = affs_add_entry(dir, inode, dentry, ST_USERDIR);
310 mark_inode_dirty(inode);
318 affs_rmdir(struct inode *dir, struct dentry *dentry)
320 pr_debug("%s(dir=%lu, %lu \"%pd\")\n", __func__, dir->i_ino,
321 dentry->d_inode->i_ino, dentry);
323 return affs_remove_header(dentry);
327 affs_symlink(struct inode *dir, struct dentry *dentry, const char *symname)
329 struct super_block *sb = dir->i_sb;
330 struct buffer_head *bh;
333 int i, maxlen, error;
336 pr_debug("%s(%lu,\"%pd\" -> \"%s\")\n",
337 __func__, dir->i_ino, dentry, symname);
339 maxlen = AFFS_SB(sb)->s_hashsize * sizeof(u32) - 1;
340 inode = affs_new_inode(dir);
344 inode->i_op = &affs_symlink_inode_operations;
345 inode->i_data.a_ops = &affs_symlink_aops;
346 inode->i_mode = S_IFLNK | 0777;
350 bh = affs_bread(sb, inode->i_ino);
354 p = (char *)AFFS_HEAD(bh)->table;
356 if (*symname == '/') {
357 struct affs_sb_info *sbi = AFFS_SB(sb);
358 while (*symname == '/')
360 spin_lock(&sbi->symlink_lock);
361 while (sbi->s_volume[i]) /* Cannot overflow */
362 *p++ = sbi->s_volume[i++];
363 spin_unlock(&sbi->symlink_lock);
365 while (i < maxlen && (c = *symname++)) {
366 if (c == '.' && lc == '/' && *symname == '.' && symname[1] == '/') {
371 } else if (c == '.' && lc == '/' && *symname == '/') {
380 while (*symname == '/')
384 mark_buffer_dirty_inode(bh, inode);
386 mark_inode_dirty(inode);
388 error = affs_add_entry(dir, inode, dentry, ST_SOFTLINK);
396 mark_inode_dirty(inode);
402 affs_link(struct dentry *old_dentry, struct inode *dir, struct dentry *dentry)
404 struct inode *inode = old_dentry->d_inode;
406 pr_debug("%s(%lu, %lu, \"%pd\")\n", __func__, inode->i_ino, dir->i_ino,
409 return affs_add_entry(dir, inode, dentry, ST_LINKFILE);
413 affs_rename(struct inode *old_dir, struct dentry *old_dentry,
414 struct inode *new_dir, struct dentry *new_dentry)
416 struct super_block *sb = old_dir->i_sb;
417 struct buffer_head *bh = NULL;
420 pr_debug("%s(old=%lu,\"%pd\" to new=%lu,\"%pd\")\n", __func__,
421 old_dir->i_ino, old_dentry, new_dir->i_ino, new_dentry);
423 retval = affs_check_name(new_dentry->d_name.name,
424 new_dentry->d_name.len,
425 affs_nofilenametruncate(old_dentry));
430 /* Unlink destination if it already exists */
431 if (new_dentry->d_inode) {
432 retval = affs_remove_header(new_dentry);
437 bh = affs_bread(sb, old_dentry->d_inode->i_ino);
441 /* Remove header from its parent directory. */
442 affs_lock_dir(old_dir);
443 retval = affs_remove_hash(old_dir, bh);
444 affs_unlock_dir(old_dir);
448 /* And insert it into the new directory with the new name. */
449 affs_copy_name(AFFS_TAIL(sb, bh)->name, new_dentry);
450 affs_fix_checksum(sb, bh);
451 affs_lock_dir(new_dir);
452 retval = affs_insert_hash(new_dir, bh);
453 affs_unlock_dir(new_dir);
454 /* TODO: move it back to old_dir, if error? */
457 mark_buffer_dirty_inode(bh, retval ? old_dir : new_dir);