blob: abc853968fed7307691aa7593f94b3b310cb80ab [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
2 * linux/fs/affs/amigaffs.c
3 *
4 * (c) 1996 Hans-Joachim Widmaier - Rewritten
5 *
6 * (C) 1993 Ray Burr - Amiga FFS filesystem.
7 *
8 * Please send bug reports to: hjw@zvw.de
9 */
10
11#include "affs.h"
12
Linus Torvalds1da177e2005-04-16 15:20:36 -070013static char ErrorBuffer[256];
14
15/*
16 * Functions for accessing Amiga-FFS structures.
17 */
18
19
20/* Insert a header block bh into the directory dir
21 * caller must hold AFFS_DIR->i_hash_lock!
22 */
23
24int
25affs_insert_hash(struct inode *dir, struct buffer_head *bh)
26{
27 struct super_block *sb = dir->i_sb;
28 struct buffer_head *dir_bh;
29 u32 ino, hash_ino;
30 int offset;
31
32 ino = bh->b_blocknr;
33 offset = affs_hash_name(sb, AFFS_TAIL(sb, bh)->name + 1, AFFS_TAIL(sb, bh)->name[0]);
34
Fabian Frederick9606d9a2014-06-06 14:37:25 -070035 pr_debug("%s(dir=%u, ino=%d)\n", __func__, (u32)dir->i_ino, ino);
Linus Torvalds1da177e2005-04-16 15:20:36 -070036
37 dir_bh = affs_bread(sb, dir->i_ino);
38 if (!dir_bh)
39 return -EIO;
40
41 hash_ino = be32_to_cpu(AFFS_HEAD(dir_bh)->table[offset]);
42 while (hash_ino) {
43 affs_brelse(dir_bh);
44 dir_bh = affs_bread(sb, hash_ino);
45 if (!dir_bh)
46 return -EIO;
47 hash_ino = be32_to_cpu(AFFS_TAIL(sb, dir_bh)->hash_chain);
48 }
49 AFFS_TAIL(sb, bh)->parent = cpu_to_be32(dir->i_ino);
50 AFFS_TAIL(sb, bh)->hash_chain = 0;
51 affs_fix_checksum(sb, bh);
52
53 if (dir->i_ino == dir_bh->b_blocknr)
54 AFFS_HEAD(dir_bh)->table[offset] = cpu_to_be32(ino);
55 else
56 AFFS_TAIL(sb, dir_bh)->hash_chain = cpu_to_be32(ino);
57
58 affs_adjust_checksum(dir_bh, ino);
59 mark_buffer_dirty_inode(dir_bh, dir);
60 affs_brelse(dir_bh);
61
62 dir->i_mtime = dir->i_ctime = CURRENT_TIME_SEC;
63 dir->i_version++;
64 mark_inode_dirty(dir);
65
66 return 0;
67}
68
69/* Remove a header block from its directory.
70 * caller must hold AFFS_DIR->i_hash_lock!
71 */
72
73int
74affs_remove_hash(struct inode *dir, struct buffer_head *rem_bh)
75{
76 struct super_block *sb;
77 struct buffer_head *bh;
78 u32 rem_ino, hash_ino;
79 __be32 ino;
80 int offset, retval;
81
82 sb = dir->i_sb;
83 rem_ino = rem_bh->b_blocknr;
84 offset = affs_hash_name(sb, AFFS_TAIL(sb, rem_bh)->name+1, AFFS_TAIL(sb, rem_bh)->name[0]);
Fabian Frederick9606d9a2014-06-06 14:37:25 -070085 pr_debug("%s(dir=%d, ino=%d, hashval=%d)\n",
86 __func__, (u32)dir->i_ino, rem_ino, offset);
Linus Torvalds1da177e2005-04-16 15:20:36 -070087
88 bh = affs_bread(sb, dir->i_ino);
89 if (!bh)
90 return -EIO;
91
92 retval = -ENOENT;
93 hash_ino = be32_to_cpu(AFFS_HEAD(bh)->table[offset]);
94 while (hash_ino) {
95 if (hash_ino == rem_ino) {
96 ino = AFFS_TAIL(sb, rem_bh)->hash_chain;
97 if (dir->i_ino == bh->b_blocknr)
98 AFFS_HEAD(bh)->table[offset] = ino;
99 else
100 AFFS_TAIL(sb, bh)->hash_chain = ino;
101 affs_adjust_checksum(bh, be32_to_cpu(ino) - hash_ino);
102 mark_buffer_dirty_inode(bh, dir);
103 AFFS_TAIL(sb, rem_bh)->parent = 0;
104 retval = 0;
105 break;
106 }
107 affs_brelse(bh);
108 bh = affs_bread(sb, hash_ino);
109 if (!bh)
110 return -EIO;
111 hash_ino = be32_to_cpu(AFFS_TAIL(sb, bh)->hash_chain);
112 }
113
114 affs_brelse(bh);
115
116 dir->i_mtime = dir->i_ctime = CURRENT_TIME_SEC;
117 dir->i_version++;
118 mark_inode_dirty(dir);
119
120 return retval;
121}
122
123static void
Al Viro12447c42012-06-09 13:06:09 -0400124affs_fix_dcache(struct inode *inode, u32 entry_ino)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700125{
Al Viro12447c42012-06-09 13:06:09 -0400126 struct dentry *dentry;
Nick Piggin873feea2011-01-07 17:50:06 +1100127 spin_lock(&inode->i_lock);
Sasha Levinb67bfe02013-02-27 17:06:00 -0800128 hlist_for_each_entry(dentry, &inode->i_dentry, d_alias) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700129 if (entry_ino == (u32)(long)dentry->d_fsdata) {
Al Viro12447c42012-06-09 13:06:09 -0400130 dentry->d_fsdata = (void *)inode->i_ino;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700131 break;
132 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700133 }
Nick Piggin873feea2011-01-07 17:50:06 +1100134 spin_unlock(&inode->i_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700135}
136
137
138/* Remove header from link chain */
139
140static int
141affs_remove_link(struct dentry *dentry)
142{
143 struct inode *dir, *inode = dentry->d_inode;
144 struct super_block *sb = inode->i_sb;
145 struct buffer_head *bh = NULL, *link_bh = NULL;
146 u32 link_ino, ino;
147 int retval;
148
Fabian Frederick9606d9a2014-06-06 14:37:25 -0700149 pr_debug("%s(key=%ld)\n", __func__, inode->i_ino);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700150 retval = -EIO;
151 bh = affs_bread(sb, inode->i_ino);
152 if (!bh)
153 goto done;
154
155 link_ino = (u32)(long)dentry->d_fsdata;
156 if (inode->i_ino == link_ino) {
157 /* we can't remove the head of the link, as its blocknr is still used as ino,
158 * so we remove the block of the first link instead.
159 */
160 link_ino = be32_to_cpu(AFFS_TAIL(sb, bh)->link_chain);
161 link_bh = affs_bread(sb, link_ino);
162 if (!link_bh)
163 goto done;
164
David Howells210f8552008-02-07 00:15:29 -0800165 dir = affs_iget(sb, be32_to_cpu(AFFS_TAIL(sb, link_bh)->parent));
166 if (IS_ERR(dir)) {
167 retval = PTR_ERR(dir);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700168 goto done;
David Howells210f8552008-02-07 00:15:29 -0800169 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700170
171 affs_lock_dir(dir);
Al Viro12447c42012-06-09 13:06:09 -0400172 /*
173 * if there's a dentry for that block, make it
174 * refer to inode itself.
175 */
176 affs_fix_dcache(inode, link_ino);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700177 retval = affs_remove_hash(dir, link_bh);
Christoph Hellwigec1ab0a2008-05-09 12:35:29 +0200178 if (retval) {
179 affs_unlock_dir(dir);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700180 goto done;
Christoph Hellwigec1ab0a2008-05-09 12:35:29 +0200181 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700182 mark_buffer_dirty_inode(link_bh, inode);
183
184 memcpy(AFFS_TAIL(sb, bh)->name, AFFS_TAIL(sb, link_bh)->name, 32);
185 retval = affs_insert_hash(dir, bh);
Christoph Hellwigec1ab0a2008-05-09 12:35:29 +0200186 if (retval) {
187 affs_unlock_dir(dir);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700188 goto done;
Christoph Hellwigec1ab0a2008-05-09 12:35:29 +0200189 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700190 mark_buffer_dirty_inode(bh, inode);
191
192 affs_unlock_dir(dir);
193 iput(dir);
194 } else {
195 link_bh = affs_bread(sb, link_ino);
196 if (!link_bh)
197 goto done;
198 }
199
200 while ((ino = be32_to_cpu(AFFS_TAIL(sb, bh)->link_chain)) != 0) {
201 if (ino == link_ino) {
202 __be32 ino2 = AFFS_TAIL(sb, link_bh)->link_chain;
203 AFFS_TAIL(sb, bh)->link_chain = ino2;
204 affs_adjust_checksum(bh, be32_to_cpu(ino2) - link_ino);
205 mark_buffer_dirty_inode(bh, inode);
206 retval = 0;
207 /* Fix the link count, if bh is a normal header block without links */
208 switch (be32_to_cpu(AFFS_TAIL(sb, bh)->stype)) {
209 case ST_LINKDIR:
210 case ST_LINKFILE:
211 break;
212 default:
213 if (!AFFS_TAIL(sb, bh)->link_chain)
Miklos Szeredibfe86842011-10-28 14:13:29 +0200214 set_nlink(inode, 1);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700215 }
216 affs_free_block(sb, link_ino);
217 goto done;
218 }
219 affs_brelse(bh);
220 bh = affs_bread(sb, ino);
221 if (!bh)
222 goto done;
223 }
224 retval = -ENOENT;
225done:
226 affs_brelse(link_bh);
227 affs_brelse(bh);
228 return retval;
229}
230
231
232static int
233affs_empty_dir(struct inode *inode)
234{
235 struct super_block *sb = inode->i_sb;
236 struct buffer_head *bh;
237 int retval, size;
238
239 retval = -EIO;
240 bh = affs_bread(sb, inode->i_ino);
241 if (!bh)
242 goto done;
243
244 retval = -ENOTEMPTY;
245 for (size = AFFS_SB(sb)->s_hashsize - 1; size >= 0; size--)
246 if (AFFS_HEAD(bh)->table[size])
247 goto not_empty;
248 retval = 0;
249not_empty:
250 affs_brelse(bh);
251done:
252 return retval;
253}
254
255
256/* Remove a filesystem object. If the object to be removed has
257 * links to it, one of the links must be changed to inherit
258 * the file or directory. As above, any inode will do.
259 * The buffer will not be freed. If the header is a link, the
260 * block will be marked as free.
261 * This function returns a negative error number in case of
262 * an error, else 0 if the inode is to be deleted or 1 if not.
263 */
264
265int
266affs_remove_header(struct dentry *dentry)
267{
268 struct super_block *sb;
269 struct inode *inode, *dir;
270 struct buffer_head *bh = NULL;
271 int retval;
272
273 dir = dentry->d_parent->d_inode;
274 sb = dir->i_sb;
275
276 retval = -ENOENT;
277 inode = dentry->d_inode;
278 if (!inode)
279 goto done;
280
Fabian Frederick9606d9a2014-06-06 14:37:25 -0700281 pr_debug("%s(key=%ld)\n", __func__, inode->i_ino);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700282 retval = -EIO;
283 bh = affs_bread(sb, (u32)(long)dentry->d_fsdata);
284 if (!bh)
285 goto done;
286
287 affs_lock_link(inode);
288 affs_lock_dir(dir);
289 switch (be32_to_cpu(AFFS_TAIL(sb, bh)->stype)) {
290 case ST_USERDIR:
291 /* if we ever want to support links to dirs
292 * i_hash_lock of the inode must only be
293 * taken after some checks
294 */
295 affs_lock_dir(inode);
296 retval = affs_empty_dir(inode);
297 affs_unlock_dir(inode);
298 if (retval)
299 goto done_unlock;
300 break;
301 default:
302 break;
303 }
304
305 retval = affs_remove_hash(dir, bh);
306 if (retval)
307 goto done_unlock;
308 mark_buffer_dirty_inode(bh, inode);
309
310 affs_unlock_dir(dir);
311
312 if (inode->i_nlink > 1)
313 retval = affs_remove_link(dentry);
314 else
Miklos Szeredi6d6b77f2011-10-28 14:13:28 +0200315 clear_nlink(inode);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700316 affs_unlock_link(inode);
317 inode->i_ctime = CURRENT_TIME_SEC;
318 mark_inode_dirty(inode);
319
320done:
321 affs_brelse(bh);
322 return retval;
323
324done_unlock:
325 affs_unlock_dir(dir);
326 affs_unlock_link(inode);
327 goto done;
328}
329
330/* Checksum a block, do various consistency checks and optionally return
331 the blocks type number. DATA points to the block. If their pointers
332 are non-null, *PTYPE and *STYPE are set to the primary and secondary
333 block types respectively, *HASHSIZE is set to the size of the hashtable
334 (which lets us calculate the block size).
335 Returns non-zero if the block is not consistent. */
336
337u32
338affs_checksum_block(struct super_block *sb, struct buffer_head *bh)
339{
340 __be32 *ptr = (__be32 *)bh->b_data;
341 u32 sum;
342 int bsize;
343
344 sum = 0;
345 for (bsize = sb->s_blocksize / sizeof(__be32); bsize > 0; bsize--)
346 sum += be32_to_cpu(*ptr++);
347 return sum;
348}
349
350/*
351 * Calculate the checksum of a disk block and store it
352 * at the indicated position.
353 */
354
355void
356affs_fix_checksum(struct super_block *sb, struct buffer_head *bh)
357{
358 int cnt = sb->s_blocksize / sizeof(__be32);
359 __be32 *ptr = (__be32 *)bh->b_data;
360 u32 checksum;
361 __be32 *checksumptr;
362
363 checksumptr = ptr + 5;
364 *checksumptr = 0;
365 for (checksum = 0; cnt > 0; ptr++, cnt--)
366 checksum += be32_to_cpu(*ptr);
367 *checksumptr = cpu_to_be32(-checksum);
368}
369
370void
371secs_to_datestamp(time_t secs, struct affs_date *ds)
372{
373 u32 days;
374 u32 minute;
375
376 secs -= sys_tz.tz_minuteswest * 60 + ((8 * 365 + 2) * 24 * 60 * 60);
377 if (secs < 0)
378 secs = 0;
379 days = secs / 86400;
380 secs -= days * 86400;
381 minute = secs / 60;
382 secs -= minute * 60;
383
384 ds->days = cpu_to_be32(days);
385 ds->mins = cpu_to_be32(minute);
386 ds->ticks = cpu_to_be32(secs * 50);
387}
388
Al Viroa760b032011-07-26 03:04:30 -0400389umode_t
Linus Torvalds1da177e2005-04-16 15:20:36 -0700390prot_to_mode(u32 prot)
391{
Al Viroa760b032011-07-26 03:04:30 -0400392 umode_t mode = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700393
394 if (!(prot & FIBF_NOWRITE))
395 mode |= S_IWUSR;
396 if (!(prot & FIBF_NOREAD))
397 mode |= S_IRUSR;
398 if (!(prot & FIBF_NOEXECUTE))
399 mode |= S_IXUSR;
400 if (prot & FIBF_GRP_WRITE)
401 mode |= S_IWGRP;
402 if (prot & FIBF_GRP_READ)
403 mode |= S_IRGRP;
404 if (prot & FIBF_GRP_EXECUTE)
405 mode |= S_IXGRP;
406 if (prot & FIBF_OTR_WRITE)
407 mode |= S_IWOTH;
408 if (prot & FIBF_OTR_READ)
409 mode |= S_IROTH;
410 if (prot & FIBF_OTR_EXECUTE)
411 mode |= S_IXOTH;
412
413 return mode;
414}
415
416void
417mode_to_prot(struct inode *inode)
418{
419 u32 prot = AFFS_I(inode)->i_protect;
Al Viroa760b032011-07-26 03:04:30 -0400420 umode_t mode = inode->i_mode;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700421
422 if (!(mode & S_IXUSR))
423 prot |= FIBF_NOEXECUTE;
424 if (!(mode & S_IRUSR))
425 prot |= FIBF_NOREAD;
426 if (!(mode & S_IWUSR))
427 prot |= FIBF_NOWRITE;
428 if (mode & S_IXGRP)
429 prot |= FIBF_GRP_EXECUTE;
430 if (mode & S_IRGRP)
431 prot |= FIBF_GRP_READ;
432 if (mode & S_IWGRP)
433 prot |= FIBF_GRP_WRITE;
434 if (mode & S_IXOTH)
435 prot |= FIBF_OTR_EXECUTE;
436 if (mode & S_IROTH)
437 prot |= FIBF_OTR_READ;
438 if (mode & S_IWOTH)
439 prot |= FIBF_OTR_WRITE;
440
441 AFFS_I(inode)->i_protect = prot;
442}
443
444void
445affs_error(struct super_block *sb, const char *function, const char *fmt, ...)
446{
447 va_list args;
448
449 va_start(args,fmt);
Alexey Dobriyan4a6e6172006-12-06 20:37:04 -0800450 vsnprintf(ErrorBuffer,sizeof(ErrorBuffer),fmt,args);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700451 va_end(args);
452
Fabian Frederick0158de12014-06-06 14:37:24 -0700453 pr_crit("error (device %s): %s(): %s\n", sb->s_id,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700454 function,ErrorBuffer);
455 if (!(sb->s_flags & MS_RDONLY))
Fabian Frederick0158de12014-06-06 14:37:24 -0700456 pr_warn("Remounting filesystem read-only\n");
Linus Torvalds1da177e2005-04-16 15:20:36 -0700457 sb->s_flags |= MS_RDONLY;
458}
459
460void
461affs_warning(struct super_block *sb, const char *function, const char *fmt, ...)
462{
463 va_list args;
464
465 va_start(args,fmt);
Alexey Dobriyan4a6e6172006-12-06 20:37:04 -0800466 vsnprintf(ErrorBuffer,sizeof(ErrorBuffer),fmt,args);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700467 va_end(args);
468
Fabian Frederick0158de12014-06-06 14:37:24 -0700469 pr_warn("(device %s): %s(): %s\n", sb->s_id,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700470 function,ErrorBuffer);
471}
472
Fabian Frederick8ca57722014-04-07 15:39:01 -0700473bool
474affs_nofilenametruncate(const struct dentry *dentry)
475{
476 struct inode *inode = dentry->d_inode;
477 return AFFS_SB(inode->i_sb)->s_flags & SF_NO_TRUNCATE;
478
479}
480
Linus Torvalds1da177e2005-04-16 15:20:36 -0700481/* Check if the name is valid for a affs object. */
482
483int
Fabian Frederick8ca57722014-04-07 15:39:01 -0700484affs_check_name(const unsigned char *name, int len, bool notruncate)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700485{
486 int i;
487
Fabian Frederick8ca57722014-04-07 15:39:01 -0700488 if (len > 30) {
489 if (notruncate)
490 return -ENAMETOOLONG;
491 else
492 len = 30;
493 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700494 for (i = 0; i < len; i++) {
495 if (name[i] < ' ' || name[i] == ':'
496 || (name[i] > 0x7e && name[i] < 0xa0))
497 return -EINVAL;
498 }
499
500 return 0;
501}
502
503/* This function copies name to bstr, with at most 30
504 * characters length. The bstr will be prepended by
505 * a length byte.
506 * NOTE: The name will must be already checked by
507 * affs_check_name()!
508 */
509
510int
511affs_copy_name(unsigned char *bstr, struct dentry *dentry)
512{
513 int len = min(dentry->d_name.len, 30u);
514
515 *bstr++ = len;
516 memcpy(bstr, dentry->d_name.name, len);
517 return len;
518}