blob: 6dae1ccd176d60446f45ff8c35d24c1a17e34f13 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
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
13typedef int (*toupper_t)(int);
14
15static int affs_toupper(int ch);
Linus Torvaldsda53be12013-05-21 15:22:44 -070016static int affs_hash_dentry(const struct dentry *, struct qstr *);
17static int affs_compare_dentry(const struct dentry *parent, const struct dentry *dentry,
Nick Piggin621e1552011-01-07 17:49:27 +110018 unsigned int len, const char *str, const struct qstr *name);
Linus Torvalds1da177e2005-04-16 15:20:36 -070019static int affs_intl_toupper(int ch);
Linus Torvaldsda53be12013-05-21 15:22:44 -070020static int affs_intl_hash_dentry(const struct dentry *, struct qstr *);
21static int affs_intl_compare_dentry(const struct dentry *parent, const struct dentry *dentry,
Nick Piggin621e1552011-01-07 17:49:27 +110022 unsigned int len, const char *str, const struct qstr *name);
Linus Torvalds1da177e2005-04-16 15:20:36 -070023
Al Viroe16404e2009-02-20 05:55:13 +000024const struct dentry_operations affs_dentry_operations = {
Linus Torvalds1da177e2005-04-16 15:20:36 -070025 .d_hash = affs_hash_dentry,
26 .d_compare = affs_compare_dentry,
27};
28
Al Viroa1298802011-01-12 16:45:19 -050029const struct dentry_operations affs_intl_dentry_operations = {
Linus Torvalds1da177e2005-04-16 15:20:36 -070030 .d_hash = affs_intl_hash_dentry,
31 .d_compare = affs_intl_compare_dentry,
32};
33
34
35/* Simple toupper() for DOS\1 */
36
37static int
38affs_toupper(int ch)
39{
40 return ch >= 'a' && ch <= 'z' ? ch -= ('a' - 'A') : ch;
41}
42
43/* International toupper() for DOS\3 ("international") */
44
45static int
46affs_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
53static inline toupper_t
54affs_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 */
62static inline int
Fabian Frederick8ca57722014-04-07 15:39:01 -070063__affs_hash_dentry(struct qstr *qstr, toupper_t toupper, bool notruncate)
Linus Torvalds1da177e2005-04-16 15:20:36 -070064{
65 const u8 *name = qstr->name;
66 unsigned long hash;
67 int i;
68
Fabian Frederick8ca57722014-04-07 15:39:01 -070069 i = affs_check_name(qstr->name, qstr->len, notruncate);
Linus Torvalds1da177e2005-04-16 15:20:36 -070070 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
82static int
Linus Torvaldsda53be12013-05-21 15:22:44 -070083affs_hash_dentry(const struct dentry *dentry, struct qstr *qstr)
Linus Torvalds1da177e2005-04-16 15:20:36 -070084{
Fabian Frederick8ca57722014-04-07 15:39:01 -070085 return __affs_hash_dentry(qstr, affs_toupper,
86 affs_nofilenametruncate(dentry));
87
Linus Torvalds1da177e2005-04-16 15:20:36 -070088}
Fabian Frederick8ca57722014-04-07 15:39:01 -070089
Linus Torvalds1da177e2005-04-16 15:20:36 -070090static int
Linus Torvaldsda53be12013-05-21 15:22:44 -070091affs_intl_hash_dentry(const struct dentry *dentry, struct qstr *qstr)
Linus Torvalds1da177e2005-04-16 15:20:36 -070092{
Fabian Frederick8ca57722014-04-07 15:39:01 -070093 return __affs_hash_dentry(qstr, affs_intl_toupper,
94 affs_nofilenametruncate(dentry));
95
Linus Torvalds1da177e2005-04-16 15:20:36 -070096}
97
Nick Piggin621e1552011-01-07 17:49:27 +110098static inline int __affs_compare_dentry(unsigned int len,
Fabian Frederick8ca57722014-04-07 15:39:01 -070099 const char *str, const struct qstr *name, toupper_t toupper,
100 bool notruncate)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700101{
Nick Piggin621e1552011-01-07 17:49:27 +1100102 const u8 *aname = str;
103 const u8 *bname = name->name;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700104
Nick Piggin621e1552011-01-07 17:49:27 +1100105 /*
106 * 'str' is the name of an already existing dentry, so the name
107 * must be valid. 'name' must be validated first.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700108 */
109
Fabian Frederick8ca57722014-04-07 15:39:01 -0700110 if (affs_check_name(name->name, name->len, notruncate))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700111 return 1;
112
Nick Piggin621e1552011-01-07 17:49:27 +1100113 /*
114 * If the names are longer than the allowed 30 chars,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700115 * the excess is ignored, so their length may differ.
116 */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700117 if (len >= 30) {
Nick Piggin621e1552011-01-07 17:49:27 +1100118 if (name->len < 30)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700119 return 1;
120 len = 30;
Nick Piggin621e1552011-01-07 17:49:27 +1100121 } else if (len != name->len)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700122 return 1;
123
124 for (; len > 0; len--)
125 if (toupper(*aname++) != toupper(*bname++))
126 return 1;
127
128 return 0;
129}
130
131static int
Linus Torvaldsda53be12013-05-21 15:22:44 -0700132affs_compare_dentry(const struct dentry *parent, const struct dentry *dentry,
Nick Piggin621e1552011-01-07 17:49:27 +1100133 unsigned int len, const char *str, const struct qstr *name)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700134{
Fabian Frederick8ca57722014-04-07 15:39:01 -0700135
136 return __affs_compare_dentry(len, str, name, affs_toupper,
137 affs_nofilenametruncate(parent));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700138}
Fabian Frederick8ca57722014-04-07 15:39:01 -0700139
Linus Torvalds1da177e2005-04-16 15:20:36 -0700140static int
Linus Torvaldsda53be12013-05-21 15:22:44 -0700141affs_intl_compare_dentry(const struct dentry *parent, const struct dentry *dentry,
Nick Piggin621e1552011-01-07 17:49:27 +1100142 unsigned int len, const char *str, const struct qstr *name)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700143{
Fabian Frederick8ca57722014-04-07 15:39:01 -0700144 return __affs_compare_dentry(len, str, name, affs_intl_toupper,
145 affs_nofilenametruncate(parent));
146
Linus Torvalds1da177e2005-04-16 15:20:36 -0700147}
148
149/*
150 * NOTE! unlike strncmp, affs_match returns 1 for success, 0 for failure.
151 */
152
153static inline int
154affs_match(struct dentry *dentry, const u8 *name2, toupper_t toupper)
155{
156 const u8 *name = dentry->d_name.name;
157 int len = dentry->d_name.len;
158
159 if (len >= 30) {
160 if (*name2 < 30)
161 return 0;
162 len = 30;
163 } else if (len != *name2)
164 return 0;
165
166 for (name2++; len > 0; len--)
167 if (toupper(*name++) != toupper(*name2++))
168 return 0;
169 return 1;
170}
171
172int
173affs_hash_name(struct super_block *sb, const u8 *name, unsigned int len)
174{
175 toupper_t toupper = affs_get_toupper(sb);
176 int hash;
177
178 hash = len = min(len, 30u);
179 for (; len > 0; len--)
180 hash = (hash * 13 + toupper(*name++)) & 0x7ff;
181
182 return hash % AFFS_SB(sb)->s_hashsize;
183}
184
185static struct buffer_head *
186affs_find_entry(struct inode *dir, struct dentry *dentry)
187{
188 struct super_block *sb = dir->i_sb;
189 struct buffer_head *bh;
190 toupper_t toupper = affs_get_toupper(sb);
191 u32 key;
192
193 pr_debug("AFFS: find_entry(\"%.*s\")\n", (int)dentry->d_name.len, dentry->d_name.name);
194
195 bh = affs_bread(sb, dir->i_ino);
196 if (!bh)
197 return ERR_PTR(-EIO);
198
199 key = be32_to_cpu(AFFS_HEAD(bh)->table[affs_hash_name(sb, dentry->d_name.name, dentry->d_name.len)]);
200
201 for (;;) {
202 affs_brelse(bh);
203 if (key == 0)
204 return NULL;
205 bh = affs_bread(sb, key);
206 if (!bh)
207 return ERR_PTR(-EIO);
208 if (affs_match(dentry, AFFS_TAIL(sb, bh)->name, toupper))
209 return bh;
210 key = be32_to_cpu(AFFS_TAIL(sb, bh)->hash_chain);
211 }
212}
213
214struct dentry *
Al Viro00cd8dd2012-06-10 17:13:09 -0400215affs_lookup(struct inode *dir, struct dentry *dentry, unsigned int flags)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700216{
217 struct super_block *sb = dir->i_sb;
218 struct buffer_head *bh;
219 struct inode *inode = NULL;
220
221 pr_debug("AFFS: lookup(\"%.*s\")\n",(int)dentry->d_name.len,dentry->d_name.name);
222
223 affs_lock_dir(dir);
224 bh = affs_find_entry(dir, dentry);
225 affs_unlock_dir(dir);
David Howells210f8552008-02-07 00:15:29 -0800226 if (IS_ERR(bh))
David Howellse231c2e2008-02-07 00:15:26 -0800227 return ERR_CAST(bh);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700228 if (bh) {
229 u32 ino = bh->b_blocknr;
230
231 /* store the real header ino in d_fsdata for faster lookups */
232 dentry->d_fsdata = (void *)(long)ino;
233 switch (be32_to_cpu(AFFS_TAIL(sb, bh)->stype)) {
234 //link to dirs disabled
235 //case ST_LINKDIR:
236 case ST_LINKFILE:
237 ino = be32_to_cpu(AFFS_TAIL(sb, bh)->original);
238 }
239 affs_brelse(bh);
David Howells210f8552008-02-07 00:15:29 -0800240 inode = affs_iget(sb, ino);
241 if (IS_ERR(inode))
Julia Lawallcccad8f2010-05-26 14:44:23 -0700242 return ERR_CAST(inode);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700243 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700244 d_add(dentry, inode);
245 return NULL;
246}
247
248int
249affs_unlink(struct inode *dir, struct dentry *dentry)
250{
Roman Zippeldca3c332008-04-29 17:02:20 +0200251 pr_debug("AFFS: unlink(dir=%d, %lu \"%.*s\")\n", (u32)dir->i_ino,
252 dentry->d_inode->i_ino,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700253 (int)dentry->d_name.len, dentry->d_name.name);
254
255 return affs_remove_header(dentry);
256}
257
258int
Al Viroebfc3b42012-06-10 18:05:36 -0400259affs_create(struct inode *dir, struct dentry *dentry, umode_t mode, bool excl)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700260{
261 struct super_block *sb = dir->i_sb;
262 struct inode *inode;
263 int error;
264
Al Viro4acdaf22011-07-26 01:42:34 -0400265 pr_debug("AFFS: create(%lu,\"%.*s\",0%ho)\n",dir->i_ino,(int)dentry->d_name.len,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700266 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) {
Miklos Szeredi6d6b77f2011-10-28 14:13:28 +0200281 clear_nlink(inode);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700282 iput(inode);
283 return error;
284 }
285 return 0;
286}
287
288int
Al Viro18bb1db2011-07-26 01:41:39 -0400289affs_mkdir(struct inode *dir, struct dentry *dentry, umode_t mode)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700290{
291 struct inode *inode;
292 int error;
293
Al Viro18bb1db2011-07-26 01:41:39 -0400294 pr_debug("AFFS: mkdir(%lu,\"%.*s\",0%ho)\n",dir->i_ino,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700295 (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) {
Miklos Szeredi6d6b77f2011-10-28 14:13:28 +0200309 clear_nlink(inode);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700310 mark_inode_dirty(inode);
311 iput(inode);
312 return error;
313 }
314 return 0;
315}
316
317int
318affs_rmdir(struct inode *dir, struct dentry *dentry)
319{
Roman Zippeldca3c332008-04-29 17:02:20 +0200320 pr_debug("AFFS: rmdir(dir=%u, %lu \"%.*s\")\n", (u32)dir->i_ino,
321 dentry->d_inode->i_ino,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700322 (int)dentry->d_name.len, dentry->d_name.name);
323
324 return affs_remove_header(dentry);
325}
326
327int
328affs_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 == '/') {
Al Viro29333922010-01-24 00:04:07 -0500358 struct affs_sb_info *sbi = AFFS_SB(sb);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700359 while (*symname == '/')
360 symname++;
Al Viro29333922010-01-24 00:04:07 -0500361 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);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700365 }
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
395err:
Miklos Szeredi6d6b77f2011-10-28 14:13:28 +0200396 clear_nlink(inode);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700397 mark_inode_dirty(inode);
398 iput(inode);
399 return error;
400}
401
402int
403affs_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
413int
414affs_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
Fabian Frederick8ca57722014-04-07 15:39:01 -0700425 retval = affs_check_name(new_dentry->d_name.name,
426 new_dentry->d_name.len,
427 affs_nofilenametruncate(old_dentry));
428
Linus Torvalds1da177e2005-04-16 15:20:36 -0700429 if (retval)
430 return retval;
431
432 /* Unlink destination if it already exists */
433 if (new_dentry->d_inode) {
434 retval = affs_remove_header(new_dentry);
435 if (retval)
436 return retval;
437 }
438
Linus Torvalds1da177e2005-04-16 15:20:36 -0700439 bh = affs_bread(sb, old_dentry->d_inode->i_ino);
440 if (!bh)
Florin Malita3ac81412006-05-25 18:44:23 -0700441 return -EIO;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700442
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
458done:
459 mark_buffer_dirty_inode(bh, retval ? old_dir : new_dir);
460 affs_brelse(bh);
461 return retval;
462}