blob: 944a4042fb65a78719bb7f1e8a2b307b15082eaa [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);
Nick Pigginb1e6a012011-01-07 17:49:28 +110016static int affs_hash_dentry(const struct dentry *,
17 const struct inode *, struct qstr *);
Nick Piggin621e1552011-01-07 17:49:27 +110018static 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);
Linus Torvalds1da177e2005-04-16 15:20:36 -070022static int affs_intl_toupper(int ch);
Nick Pigginb1e6a012011-01-07 17:49:28 +110023static int affs_intl_hash_dentry(const struct dentry *,
24 const struct inode *, struct qstr *);
Nick Piggin621e1552011-01-07 17:49:27 +110025static 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);
Linus Torvalds1da177e2005-04-16 15:20:36 -070029
Al Viroe16404e2009-02-20 05:55:13 +000030const struct dentry_operations affs_dentry_operations = {
Linus Torvalds1da177e2005-04-16 15:20:36 -070031 .d_hash = affs_hash_dentry,
32 .d_compare = affs_compare_dentry,
33};
34
Al Viroe16404e2009-02-20 05:55:13 +000035static const struct dentry_operations affs_intl_dentry_operations = {
Linus Torvalds1da177e2005-04-16 15:20:36 -070036 .d_hash = affs_intl_hash_dentry,
37 .d_compare = affs_intl_compare_dentry,
38};
39
40
41/* Simple toupper() for DOS\1 */
42
43static int
44affs_toupper(int ch)
45{
46 return ch >= 'a' && ch <= 'z' ? ch -= ('a' - 'A') : ch;
47}
48
49/* International toupper() for DOS\3 ("international") */
50
51static int
52affs_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
59static inline toupper_t
60affs_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 */
68static inline int
Nick Pigginb1e6a012011-01-07 17:49:28 +110069__affs_hash_dentry(struct qstr *qstr, toupper_t toupper)
Linus Torvalds1da177e2005-04-16 15:20:36 -070070{
71 const u8 *name = qstr->name;
72 unsigned long hash;
73 int i;
74
Nick Pigginb1e6a012011-01-07 17:49:28 +110075 i = affs_check_name(qstr->name, qstr->len);
Linus Torvalds1da177e2005-04-16 15:20:36 -070076 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
88static int
Nick Pigginb1e6a012011-01-07 17:49:28 +110089affs_hash_dentry(const struct dentry *dentry, const struct inode *inode,
90 struct qstr *qstr)
Linus Torvalds1da177e2005-04-16 15:20:36 -070091{
Nick Pigginb1e6a012011-01-07 17:49:28 +110092 return __affs_hash_dentry(qstr, affs_toupper);
Linus Torvalds1da177e2005-04-16 15:20:36 -070093}
94static int
Nick Pigginb1e6a012011-01-07 17:49:28 +110095affs_intl_hash_dentry(const struct dentry *dentry, const struct inode *inode,
96 struct qstr *qstr)
Linus Torvalds1da177e2005-04-16 15:20:36 -070097{
Nick Pigginb1e6a012011-01-07 17:49:28 +110098 return __affs_hash_dentry(qstr, affs_intl_toupper);
Linus Torvalds1da177e2005-04-16 15:20:36 -070099}
100
Nick Piggin621e1552011-01-07 17:49:27 +1100101static inline int __affs_compare_dentry(unsigned int len,
102 const char *str, const struct qstr *name, toupper_t toupper)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700103{
Nick Piggin621e1552011-01-07 17:49:27 +1100104 const u8 *aname = str;
105 const u8 *bname = name->name;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700106
Nick Piggin621e1552011-01-07 17:49:27 +1100107 /*
108 * 'str' is the name of an already existing dentry, so the name
109 * must be valid. 'name' must be validated first.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700110 */
111
Nick Piggin621e1552011-01-07 17:49:27 +1100112 if (affs_check_name(name->name, name->len))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700113 return 1;
114
Nick Piggin621e1552011-01-07 17:49:27 +1100115 /*
116 * If the names are longer than the allowed 30 chars,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700117 * the excess is ignored, so their length may differ.
118 */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700119 if (len >= 30) {
Nick Piggin621e1552011-01-07 17:49:27 +1100120 if (name->len < 30)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700121 return 1;
122 len = 30;
Nick Piggin621e1552011-01-07 17:49:27 +1100123 } else if (len != name->len)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700124 return 1;
125
126 for (; len > 0; len--)
127 if (toupper(*aname++) != toupper(*bname++))
128 return 1;
129
130 return 0;
131}
132
133static int
Nick Piggin621e1552011-01-07 17:49:27 +1100134affs_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)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700137{
Nick Piggin621e1552011-01-07 17:49:27 +1100138 return __affs_compare_dentry(len, str, name, affs_toupper);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700139}
140static int
Nick Piggin621e1552011-01-07 17:49:27 +1100141affs_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)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700144{
Nick Piggin621e1552011-01-07 17:49:27 +1100145 return __affs_compare_dentry(len, str, name, affs_intl_toupper);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700146}
147
148/*
149 * NOTE! unlike strncmp, affs_match returns 1 for success, 0 for failure.
150 */
151
152static inline int
153affs_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
171int
172affs_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
184static struct buffer_head *
185affs_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
213struct dentry *
214affs_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);
David Howells210f8552008-02-07 00:15:29 -0800225 if (IS_ERR(bh))
David Howellse231c2e2008-02-07 00:15:26 -0800226 return ERR_CAST(bh);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700227 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);
David Howells210f8552008-02-07 00:15:29 -0800239 inode = affs_iget(sb, ino);
240 if (IS_ERR(inode))
Julia Lawallcccad8f2010-05-26 14:44:23 -0700241 return ERR_CAST(inode);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700242 }
Nick Pigginfb045ad2011-01-07 17:49:55 +1100243 d_set_d_op(dentry, AFFS_SB(sb)->s_flags & SF_INTL ? &affs_intl_dentry_operations : &affs_dentry_operations);
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
259affs_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
288int
289affs_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
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:
396 inode->i_nlink = 0;
397 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
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
Linus Torvalds1da177e2005-04-16 15:20:36 -0700436 bh = affs_bread(sb, old_dentry->d_inode->i_ino);
437 if (!bh)
Florin Malita3ac81412006-05-25 18:44:23 -0700438 return -EIO;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700439
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
455done:
456 mark_buffer_dirty_inode(bh, retval ? old_dir : new_dir);
457 affs_brelse(bh);
458 return retval;
459}