1 // SPDX-License-Identifier: GPL-2.0
3 * linux/fs/affs/namei.c
5 * (c) 1996 Hans-Joachim Widmaier - Rewritten
7 * (C) 1993 Ray Burr - Modified for Amiga FFS filesystem.
9 * (C) 1991 Linus Torvalds - minix filesystem
13 #include <linux/exportfs.h>
15 typedef int (*toupper_t)(int);
17 /* Simple toupper() for DOS\1 */
22 return ch >= 'a' && ch <= 'z' ? ch -= ('a' - 'A') : ch;
25 /* International toupper() for DOS\3 ("international") */
28 affs_intl_toupper(int ch)
30 return (ch >= 'a' && ch <= 'z') || (ch >= 0xE0
31 && ch <= 0xFE && ch != 0xF7) ?
32 ch - ('a' - 'A') : ch;
35 static inline toupper_t
36 affs_get_toupper(struct super_block *sb)
38 return affs_test_opt(AFFS_SB(sb)->s_flags, SF_INTL) ?
39 affs_intl_toupper : affs_toupper;
43 * Note: the dentry argument is the parent dentry.
46 __affs_hash_dentry(const struct dentry *dentry, struct qstr *qstr, toupper_t fn, bool notruncate)
48 const u8 *name = qstr->name;
53 retval = affs_check_name(qstr->name, qstr->len, notruncate);
57 hash = init_name_hash(dentry);
58 len = min(qstr->len, AFFSNAMEMAX);
59 for (; len > 0; name++, len--)
60 hash = partial_name_hash(fn(*name), hash);
61 qstr->hash = end_name_hash(hash);
67 affs_hash_dentry(const struct dentry *dentry, struct qstr *qstr)
69 return __affs_hash_dentry(dentry, qstr, affs_toupper,
70 affs_nofilenametruncate(dentry));
75 affs_intl_hash_dentry(const struct dentry *dentry, struct qstr *qstr)
77 return __affs_hash_dentry(dentry, qstr, affs_intl_toupper,
78 affs_nofilenametruncate(dentry));
82 static inline int __affs_compare_dentry(unsigned int len,
83 const char *str, const struct qstr *name, toupper_t fn,
86 const u8 *aname = str;
87 const u8 *bname = name->name;
90 * 'str' is the name of an already existing dentry, so the name
91 * must be valid. 'name' must be validated first.
94 if (affs_check_name(name->name, name->len, notruncate))
98 * If the names are longer than the allowed 30 chars,
99 * the excess is ignored, so their length may differ.
101 if (len >= AFFSNAMEMAX) {
102 if (name->len < AFFSNAMEMAX)
105 } else if (len != name->len)
108 for (; len > 0; len--)
109 if (fn(*aname++) != fn(*bname++))
116 affs_compare_dentry(const struct dentry *dentry,
117 unsigned int len, const char *str, const struct qstr *name)
120 return __affs_compare_dentry(len, str, name, affs_toupper,
121 affs_nofilenametruncate(dentry));
125 affs_intl_compare_dentry(const struct dentry *dentry,
126 unsigned int len, const char *str, const struct qstr *name)
128 return __affs_compare_dentry(len, str, name, affs_intl_toupper,
129 affs_nofilenametruncate(dentry));
134 * NOTE! unlike strncmp, affs_match returns 1 for success, 0 for failure.
138 affs_match(struct dentry *dentry, const u8 *name2, toupper_t fn)
140 const u8 *name = dentry->d_name.name;
141 int len = dentry->d_name.len;
143 if (len >= AFFSNAMEMAX) {
144 if (*name2 < AFFSNAMEMAX)
147 } else if (len != *name2)
150 for (name2++; len > 0; len--)
151 if (fn(*name++) != fn(*name2++))
157 affs_hash_name(struct super_block *sb, const u8 *name, unsigned int len)
159 toupper_t fn = affs_get_toupper(sb);
162 hash = len = min(len, AFFSNAMEMAX);
163 for (; len > 0; len--)
164 hash = (hash * 13 + fn(*name++)) & 0x7ff;
166 return hash % AFFS_SB(sb)->s_hashsize;
169 static struct buffer_head *
170 affs_find_entry(struct inode *dir, struct dentry *dentry)
172 struct super_block *sb = dir->i_sb;
173 struct buffer_head *bh;
174 toupper_t fn = affs_get_toupper(sb);
177 pr_debug("%s(\"%pd\")\n", __func__, dentry);
179 bh = affs_bread(sb, dir->i_ino);
181 return ERR_PTR(-EIO);
183 key = be32_to_cpu(AFFS_HEAD(bh)->table[affs_hash_name(sb, dentry->d_name.name, dentry->d_name.len)]);
189 bh = affs_bread(sb, key);
191 return ERR_PTR(-EIO);
192 if (affs_match(dentry, AFFS_TAIL(sb, bh)->name, fn))
194 key = be32_to_cpu(AFFS_TAIL(sb, bh)->hash_chain);
199 affs_lookup(struct inode *dir, struct dentry *dentry, unsigned int flags)
201 struct super_block *sb = dir->i_sb;
202 struct buffer_head *bh;
203 struct inode *inode = NULL;
206 pr_debug("%s(\"%pd\")\n", __func__, dentry);
209 bh = affs_find_entry(dir, dentry);
211 affs_unlock_dir(dir);
215 u32 ino = bh->b_blocknr;
217 /* store the real header ino in d_fsdata for faster lookups */
218 dentry->d_fsdata = (void *)(long)ino;
219 switch (be32_to_cpu(AFFS_TAIL(sb, bh)->stype)) {
220 //link to dirs disabled
223 ino = be32_to_cpu(AFFS_TAIL(sb, bh)->original);
226 inode = affs_iget(sb, ino);
228 res = d_splice_alias(inode, dentry);
229 if (!IS_ERR_OR_NULL(res))
230 res->d_fsdata = dentry->d_fsdata;
231 affs_unlock_dir(dir);
236 affs_unlink(struct inode *dir, struct dentry *dentry)
238 pr_debug("%s(dir=%lu, %lu \"%pd\")\n", __func__, dir->i_ino,
239 d_inode(dentry)->i_ino, dentry);
241 return affs_remove_header(dentry);
245 affs_create(struct mnt_idmap *idmap, struct inode *dir,
246 struct dentry *dentry, umode_t mode, bool excl)
248 struct super_block *sb = dir->i_sb;
252 pr_debug("%s(%lu,\"%pd\",0%ho)\n",
253 __func__, dir->i_ino, dentry, mode);
255 inode = affs_new_inode(dir);
259 inode->i_mode = mode;
260 affs_mode_to_prot(inode);
261 mark_inode_dirty(inode);
263 inode->i_op = &affs_file_inode_operations;
264 inode->i_fop = &affs_file_operations;
265 inode->i_mapping->a_ops = affs_test_opt(AFFS_SB(sb)->s_flags, SF_OFS) ?
266 &affs_aops_ofs : &affs_aops;
267 error = affs_add_entry(dir, inode, dentry, ST_FILE);
277 affs_mkdir(struct mnt_idmap *idmap, struct inode *dir,
278 struct dentry *dentry, umode_t mode)
283 pr_debug("%s(%lu,\"%pd\",0%ho)\n",
284 __func__, dir->i_ino, dentry, mode);
286 inode = affs_new_inode(dir);
290 inode->i_mode = S_IFDIR | mode;
291 affs_mode_to_prot(inode);
293 inode->i_op = &affs_dir_inode_operations;
294 inode->i_fop = &affs_dir_operations;
296 error = affs_add_entry(dir, inode, dentry, ST_USERDIR);
299 mark_inode_dirty(inode);
307 affs_rmdir(struct inode *dir, struct dentry *dentry)
309 pr_debug("%s(dir=%lu, %lu \"%pd\")\n", __func__, dir->i_ino,
310 d_inode(dentry)->i_ino, dentry);
312 return affs_remove_header(dentry);
316 affs_symlink(struct mnt_idmap *idmap, struct inode *dir,
317 struct dentry *dentry, const char *symname)
319 struct super_block *sb = dir->i_sb;
320 struct buffer_head *bh;
323 int i, maxlen, error;
326 pr_debug("%s(%lu,\"%pd\" -> \"%s\")\n",
327 __func__, dir->i_ino, dentry, symname);
329 maxlen = AFFS_SB(sb)->s_hashsize * sizeof(u32) - 1;
330 inode = affs_new_inode(dir);
334 inode->i_op = &affs_symlink_inode_operations;
335 inode_nohighmem(inode);
336 inode->i_data.a_ops = &affs_symlink_aops;
337 inode->i_mode = S_IFLNK | 0777;
338 affs_mode_to_prot(inode);
341 bh = affs_bread(sb, inode->i_ino);
345 p = (char *)AFFS_HEAD(bh)->table;
347 if (*symname == '/') {
348 struct affs_sb_info *sbi = AFFS_SB(sb);
349 while (*symname == '/')
351 spin_lock(&sbi->symlink_lock);
352 while (sbi->s_volume[i]) /* Cannot overflow */
353 *p++ = sbi->s_volume[i++];
354 spin_unlock(&sbi->symlink_lock);
356 while (i < maxlen && (c = *symname++)) {
357 if (c == '.' && lc == '/' && *symname == '.' && symname[1] == '/') {
362 } else if (c == '.' && lc == '/' && *symname == '/') {
371 while (*symname == '/')
375 inode->i_size = i + 1;
376 mark_buffer_dirty_inode(bh, inode);
378 mark_inode_dirty(inode);
380 error = affs_add_entry(dir, inode, dentry, ST_SOFTLINK);
388 mark_inode_dirty(inode);
394 affs_link(struct dentry *old_dentry, struct inode *dir, struct dentry *dentry)
396 struct inode *inode = d_inode(old_dentry);
398 pr_debug("%s(%lu, %lu, \"%pd\")\n", __func__, inode->i_ino, dir->i_ino,
401 return affs_add_entry(dir, inode, dentry, ST_LINKFILE);
405 affs_rename(struct inode *old_dir, struct dentry *old_dentry,
406 struct inode *new_dir, struct dentry *new_dentry)
408 struct super_block *sb = old_dir->i_sb;
409 struct buffer_head *bh = NULL;
412 retval = affs_check_name(new_dentry->d_name.name,
413 new_dentry->d_name.len,
414 affs_nofilenametruncate(old_dentry));
419 /* Unlink destination if it already exists */
420 if (d_really_is_positive(new_dentry)) {
421 retval = affs_remove_header(new_dentry);
426 bh = affs_bread(sb, d_inode(old_dentry)->i_ino);
430 /* Remove header from its parent directory. */
431 affs_lock_dir(old_dir);
432 retval = affs_remove_hash(old_dir, bh);
433 affs_unlock_dir(old_dir);
437 /* And insert it into the new directory with the new name. */
438 affs_copy_name(AFFS_TAIL(sb, bh)->name, new_dentry);
439 affs_fix_checksum(sb, bh);
440 affs_lock_dir(new_dir);
441 retval = affs_insert_hash(new_dir, bh);
442 affs_unlock_dir(new_dir);
443 /* TODO: move it back to old_dir, if error? */
446 mark_buffer_dirty_inode(bh, retval ? old_dir : new_dir);
452 affs_xrename(struct inode *old_dir, struct dentry *old_dentry,
453 struct inode *new_dir, struct dentry *new_dentry)
456 struct super_block *sb = old_dir->i_sb;
457 struct buffer_head *bh_old = NULL;
458 struct buffer_head *bh_new = NULL;
461 bh_old = affs_bread(sb, d_inode(old_dentry)->i_ino);
465 bh_new = affs_bread(sb, d_inode(new_dentry)->i_ino);
471 /* Remove old header from its parent directory. */
472 affs_lock_dir(old_dir);
473 retval = affs_remove_hash(old_dir, bh_old);
474 affs_unlock_dir(old_dir);
478 /* Remove new header from its parent directory. */
479 affs_lock_dir(new_dir);
480 retval = affs_remove_hash(new_dir, bh_new);
481 affs_unlock_dir(new_dir);
485 /* Insert old into the new directory with the new name. */
486 affs_copy_name(AFFS_TAIL(sb, bh_old)->name, new_dentry);
487 affs_fix_checksum(sb, bh_old);
488 affs_lock_dir(new_dir);
489 retval = affs_insert_hash(new_dir, bh_old);
490 affs_unlock_dir(new_dir);
492 /* Insert new into the old directory with the old name. */
493 affs_copy_name(AFFS_TAIL(sb, bh_new)->name, old_dentry);
494 affs_fix_checksum(sb, bh_new);
495 affs_lock_dir(old_dir);
496 retval = affs_insert_hash(old_dir, bh_new);
497 affs_unlock_dir(old_dir);
499 mark_buffer_dirty_inode(bh_old, new_dir);
500 mark_buffer_dirty_inode(bh_new, old_dir);
506 int affs_rename2(struct mnt_idmap *idmap, struct inode *old_dir,
507 struct dentry *old_dentry, struct inode *new_dir,
508 struct dentry *new_dentry, unsigned int flags)
511 if (flags & ~(RENAME_NOREPLACE | RENAME_EXCHANGE))
514 pr_debug("%s(old=%lu,\"%pd\" to new=%lu,\"%pd\")\n", __func__,
515 old_dir->i_ino, old_dentry, new_dir->i_ino, new_dentry);
517 if (flags & RENAME_EXCHANGE)
518 return affs_xrename(old_dir, old_dentry, new_dir, new_dentry);
520 return affs_rename(old_dir, old_dentry, new_dir, new_dentry);
523 static struct dentry *affs_get_parent(struct dentry *child)
525 struct inode *parent;
526 struct buffer_head *bh;
528 bh = affs_bread(child->d_sb, d_inode(child)->i_ino);
530 return ERR_PTR(-EIO);
532 parent = affs_iget(child->d_sb,
533 be32_to_cpu(AFFS_TAIL(child->d_sb, bh)->parent));
536 return ERR_CAST(parent);
538 return d_obtain_alias(parent);
541 static struct inode *affs_nfs_get_inode(struct super_block *sb, u64 ino,
546 if (!affs_validblock(sb, ino))
547 return ERR_PTR(-ESTALE);
549 inode = affs_iget(sb, ino);
551 return ERR_CAST(inode);
556 static struct dentry *affs_fh_to_dentry(struct super_block *sb, struct fid *fid,
557 int fh_len, int fh_type)
559 return generic_fh_to_dentry(sb, fid, fh_len, fh_type,
563 static struct dentry *affs_fh_to_parent(struct super_block *sb, struct fid *fid,
564 int fh_len, int fh_type)
566 return generic_fh_to_parent(sb, fid, fh_len, fh_type,
570 const struct export_operations affs_export_ops = {
571 .fh_to_dentry = affs_fh_to_dentry,
572 .fh_to_parent = affs_fh_to_parent,
573 .get_parent = affs_get_parent,
576 const struct dentry_operations affs_dentry_operations = {
577 .d_hash = affs_hash_dentry,
578 .d_compare = affs_compare_dentry,
581 const struct dentry_operations affs_intl_dentry_operations = {
582 .d_hash = affs_intl_hash_dentry,
583 .d_compare = affs_intl_compare_dentry,