amigaffs.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516
  1. /*
  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. #include "affs.h"
  11. extern struct timezone sys_tz;
  12. static char ErrorBuffer[256];
  13. /*
  14. * Functions for accessing Amiga-FFS structures.
  15. */
  16. /* Insert a header block bh into the directory dir
  17. * caller must hold AFFS_DIR->i_hash_lock!
  18. */
  19. int
  20. affs_insert_hash(struct inode *dir, struct buffer_head *bh)
  21. {
  22. struct super_block *sb = dir->i_sb;
  23. struct buffer_head *dir_bh;
  24. u32 ino, hash_ino;
  25. int offset;
  26. ino = bh->b_blocknr;
  27. offset = affs_hash_name(sb, AFFS_TAIL(sb, bh)->name + 1, AFFS_TAIL(sb, bh)->name[0]);
  28. pr_debug("AFFS: insert_hash(dir=%u, ino=%d)\n", (u32)dir->i_ino, ino);
  29. dir_bh = affs_bread(sb, dir->i_ino);
  30. if (!dir_bh)
  31. return -EIO;
  32. hash_ino = be32_to_cpu(AFFS_HEAD(dir_bh)->table[offset]);
  33. while (hash_ino) {
  34. affs_brelse(dir_bh);
  35. dir_bh = affs_bread(sb, hash_ino);
  36. if (!dir_bh)
  37. return -EIO;
  38. hash_ino = be32_to_cpu(AFFS_TAIL(sb, dir_bh)->hash_chain);
  39. }
  40. AFFS_TAIL(sb, bh)->parent = cpu_to_be32(dir->i_ino);
  41. AFFS_TAIL(sb, bh)->hash_chain = 0;
  42. affs_fix_checksum(sb, bh);
  43. if (dir->i_ino == dir_bh->b_blocknr)
  44. AFFS_HEAD(dir_bh)->table[offset] = cpu_to_be32(ino);
  45. else
  46. AFFS_TAIL(sb, dir_bh)->hash_chain = cpu_to_be32(ino);
  47. affs_adjust_checksum(dir_bh, ino);
  48. mark_buffer_dirty_inode(dir_bh, dir);
  49. affs_brelse(dir_bh);
  50. dir->i_mtime = dir->i_ctime = CURRENT_TIME_SEC;
  51. dir->i_version++;
  52. mark_inode_dirty(dir);
  53. return 0;
  54. }
  55. /* Remove a header block from its directory.
  56. * caller must hold AFFS_DIR->i_hash_lock!
  57. */
  58. int
  59. affs_remove_hash(struct inode *dir, struct buffer_head *rem_bh)
  60. {
  61. struct super_block *sb;
  62. struct buffer_head *bh;
  63. u32 rem_ino, hash_ino;
  64. __be32 ino;
  65. int offset, retval;
  66. sb = dir->i_sb;
  67. rem_ino = rem_bh->b_blocknr;
  68. offset = affs_hash_name(sb, AFFS_TAIL(sb, rem_bh)->name+1, AFFS_TAIL(sb, rem_bh)->name[0]);
  69. pr_debug("AFFS: remove_hash(dir=%d, ino=%d, hashval=%d)\n", (u32)dir->i_ino, rem_ino, offset);
  70. bh = affs_bread(sb, dir->i_ino);
  71. if (!bh)
  72. return -EIO;
  73. retval = -ENOENT;
  74. hash_ino = be32_to_cpu(AFFS_HEAD(bh)->table[offset]);
  75. while (hash_ino) {
  76. if (hash_ino == rem_ino) {
  77. ino = AFFS_TAIL(sb, rem_bh)->hash_chain;
  78. if (dir->i_ino == bh->b_blocknr)
  79. AFFS_HEAD(bh)->table[offset] = ino;
  80. else
  81. AFFS_TAIL(sb, bh)->hash_chain = ino;
  82. affs_adjust_checksum(bh, be32_to_cpu(ino) - hash_ino);
  83. mark_buffer_dirty_inode(bh, dir);
  84. AFFS_TAIL(sb, rem_bh)->parent = 0;
  85. retval = 0;
  86. break;
  87. }
  88. affs_brelse(bh);
  89. bh = affs_bread(sb, hash_ino);
  90. if (!bh)
  91. return -EIO;
  92. hash_ino = be32_to_cpu(AFFS_TAIL(sb, bh)->hash_chain);
  93. }
  94. affs_brelse(bh);
  95. dir->i_mtime = dir->i_ctime = CURRENT_TIME_SEC;
  96. dir->i_version++;
  97. mark_inode_dirty(dir);
  98. return retval;
  99. }
  100. static void
  101. affs_fix_dcache(struct dentry *dentry, u32 entry_ino)
  102. {
  103. struct inode *inode = dentry->d_inode;
  104. void *data = dentry->d_fsdata;
  105. struct list_head *head, *next;
  106. spin_lock(&inode->i_lock);
  107. head = &inode->i_dentry;
  108. next = head->next;
  109. while (next != head) {
  110. dentry = list_entry(next, struct dentry, d_u.d_alias);
  111. if (entry_ino == (u32)(long)dentry->d_fsdata) {
  112. dentry->d_fsdata = data;
  113. break;
  114. }
  115. next = next->next;
  116. }
  117. spin_unlock(&inode->i_lock);
  118. }
  119. /* Remove header from link chain */
  120. static int
  121. affs_remove_link(struct dentry *dentry)
  122. {
  123. struct inode *dir, *inode = dentry->d_inode;
  124. struct super_block *sb = inode->i_sb;
  125. struct buffer_head *bh = NULL, *link_bh = NULL;
  126. u32 link_ino, ino;
  127. int retval;
  128. pr_debug("AFFS: remove_link(key=%ld)\n", inode->i_ino);
  129. retval = -EIO;
  130. bh = affs_bread(sb, inode->i_ino);
  131. if (!bh)
  132. goto done;
  133. link_ino = (u32)(long)dentry->d_fsdata;
  134. if (inode->i_ino == link_ino) {
  135. /* we can't remove the head of the link, as its blocknr is still used as ino,
  136. * so we remove the block of the first link instead.
  137. */
  138. link_ino = be32_to_cpu(AFFS_TAIL(sb, bh)->link_chain);
  139. link_bh = affs_bread(sb, link_ino);
  140. if (!link_bh)
  141. goto done;
  142. dir = affs_iget(sb, be32_to_cpu(AFFS_TAIL(sb, link_bh)->parent));
  143. if (IS_ERR(dir)) {
  144. retval = PTR_ERR(dir);
  145. goto done;
  146. }
  147. affs_lock_dir(dir);
  148. affs_fix_dcache(dentry, link_ino);
  149. retval = affs_remove_hash(dir, link_bh);
  150. if (retval) {
  151. affs_unlock_dir(dir);
  152. goto done;
  153. }
  154. mark_buffer_dirty_inode(link_bh, inode);
  155. memcpy(AFFS_TAIL(sb, bh)->name, AFFS_TAIL(sb, link_bh)->name, 32);
  156. retval = affs_insert_hash(dir, bh);
  157. if (retval) {
  158. affs_unlock_dir(dir);
  159. goto done;
  160. }
  161. mark_buffer_dirty_inode(bh, inode);
  162. affs_unlock_dir(dir);
  163. iput(dir);
  164. } else {
  165. link_bh = affs_bread(sb, link_ino);
  166. if (!link_bh)
  167. goto done;
  168. }
  169. while ((ino = be32_to_cpu(AFFS_TAIL(sb, bh)->link_chain)) != 0) {
  170. if (ino == link_ino) {
  171. __be32 ino2 = AFFS_TAIL(sb, link_bh)->link_chain;
  172. AFFS_TAIL(sb, bh)->link_chain = ino2;
  173. affs_adjust_checksum(bh, be32_to_cpu(ino2) - link_ino);
  174. mark_buffer_dirty_inode(bh, inode);
  175. retval = 0;
  176. /* Fix the link count, if bh is a normal header block without links */
  177. switch (be32_to_cpu(AFFS_TAIL(sb, bh)->stype)) {
  178. case ST_LINKDIR:
  179. case ST_LINKFILE:
  180. break;
  181. default:
  182. if (!AFFS_TAIL(sb, bh)->link_chain)
  183. set_nlink(inode, 1);
  184. }
  185. affs_free_block(sb, link_ino);
  186. goto done;
  187. }
  188. affs_brelse(bh);
  189. bh = affs_bread(sb, ino);
  190. if (!bh)
  191. goto done;
  192. }
  193. retval = -ENOENT;
  194. done:
  195. affs_brelse(link_bh);
  196. affs_brelse(bh);
  197. return retval;
  198. }
  199. static int
  200. affs_empty_dir(struct inode *inode)
  201. {
  202. struct super_block *sb = inode->i_sb;
  203. struct buffer_head *bh;
  204. int retval, size;
  205. retval = -EIO;
  206. bh = affs_bread(sb, inode->i_ino);
  207. if (!bh)
  208. goto done;
  209. retval = -ENOTEMPTY;
  210. for (size = AFFS_SB(sb)->s_hashsize - 1; size >= 0; size--)
  211. if (AFFS_HEAD(bh)->table[size])
  212. goto not_empty;
  213. retval = 0;
  214. not_empty:
  215. affs_brelse(bh);
  216. done:
  217. return retval;
  218. }
  219. /* Remove a filesystem object. If the object to be removed has
  220. * links to it, one of the links must be changed to inherit
  221. * the file or directory. As above, any inode will do.
  222. * The buffer will not be freed. If the header is a link, the
  223. * block will be marked as free.
  224. * This function returns a negative error number in case of
  225. * an error, else 0 if the inode is to be deleted or 1 if not.
  226. */
  227. int
  228. affs_remove_header(struct dentry *dentry)
  229. {
  230. struct super_block *sb;
  231. struct inode *inode, *dir;
  232. struct buffer_head *bh = NULL;
  233. int retval;
  234. dir = dentry->d_parent->d_inode;
  235. sb = dir->i_sb;
  236. retval = -ENOENT;
  237. inode = dentry->d_inode;
  238. if (!inode)
  239. goto done;
  240. pr_debug("AFFS: remove_header(key=%ld)\n", inode->i_ino);
  241. retval = -EIO;
  242. bh = affs_bread(sb, (u32)(long)dentry->d_fsdata);
  243. if (!bh)
  244. goto done;
  245. affs_lock_link(inode);
  246. affs_lock_dir(dir);
  247. switch (be32_to_cpu(AFFS_TAIL(sb, bh)->stype)) {
  248. case ST_USERDIR:
  249. /* if we ever want to support links to dirs
  250. * i_hash_lock of the inode must only be
  251. * taken after some checks
  252. */
  253. affs_lock_dir(inode);
  254. retval = affs_empty_dir(inode);
  255. affs_unlock_dir(inode);
  256. if (retval)
  257. goto done_unlock;
  258. break;
  259. default:
  260. break;
  261. }
  262. retval = affs_remove_hash(dir, bh);
  263. if (retval)
  264. goto done_unlock;
  265. mark_buffer_dirty_inode(bh, inode);
  266. affs_unlock_dir(dir);
  267. if (inode->i_nlink > 1)
  268. retval = affs_remove_link(dentry);
  269. else
  270. clear_nlink(inode);
  271. affs_unlock_link(inode);
  272. inode->i_ctime = CURRENT_TIME_SEC;
  273. mark_inode_dirty(inode);
  274. done:
  275. affs_brelse(bh);
  276. return retval;
  277. done_unlock:
  278. affs_unlock_dir(dir);
  279. affs_unlock_link(inode);
  280. goto done;
  281. }
  282. /* Checksum a block, do various consistency checks and optionally return
  283. the blocks type number. DATA points to the block. If their pointers
  284. are non-null, *PTYPE and *STYPE are set to the primary and secondary
  285. block types respectively, *HASHSIZE is set to the size of the hashtable
  286. (which lets us calculate the block size).
  287. Returns non-zero if the block is not consistent. */
  288. u32
  289. affs_checksum_block(struct super_block *sb, struct buffer_head *bh)
  290. {
  291. __be32 *ptr = (__be32 *)bh->b_data;
  292. u32 sum;
  293. int bsize;
  294. sum = 0;
  295. for (bsize = sb->s_blocksize / sizeof(__be32); bsize > 0; bsize--)
  296. sum += be32_to_cpu(*ptr++);
  297. return sum;
  298. }
  299. /*
  300. * Calculate the checksum of a disk block and store it
  301. * at the indicated position.
  302. */
  303. void
  304. affs_fix_checksum(struct super_block *sb, struct buffer_head *bh)
  305. {
  306. int cnt = sb->s_blocksize / sizeof(__be32);
  307. __be32 *ptr = (__be32 *)bh->b_data;
  308. u32 checksum;
  309. __be32 *checksumptr;
  310. checksumptr = ptr + 5;
  311. *checksumptr = 0;
  312. for (checksum = 0; cnt > 0; ptr++, cnt--)
  313. checksum += be32_to_cpu(*ptr);
  314. *checksumptr = cpu_to_be32(-checksum);
  315. }
  316. void
  317. secs_to_datestamp(time_t secs, struct affs_date *ds)
  318. {
  319. u32 days;
  320. u32 minute;
  321. secs -= sys_tz.tz_minuteswest * 60 + ((8 * 365 + 2) * 24 * 60 * 60);
  322. if (secs < 0)
  323. secs = 0;
  324. days = secs / 86400;
  325. secs -= days * 86400;
  326. minute = secs / 60;
  327. secs -= minute * 60;
  328. ds->days = cpu_to_be32(days);
  329. ds->mins = cpu_to_be32(minute);
  330. ds->ticks = cpu_to_be32(secs * 50);
  331. }
  332. umode_t
  333. prot_to_mode(u32 prot)
  334. {
  335. umode_t mode = 0;
  336. if (!(prot & FIBF_NOWRITE))
  337. mode |= S_IWUSR;
  338. if (!(prot & FIBF_NOREAD))
  339. mode |= S_IRUSR;
  340. if (!(prot & FIBF_NOEXECUTE))
  341. mode |= S_IXUSR;
  342. if (prot & FIBF_GRP_WRITE)
  343. mode |= S_IWGRP;
  344. if (prot & FIBF_GRP_READ)
  345. mode |= S_IRGRP;
  346. if (prot & FIBF_GRP_EXECUTE)
  347. mode |= S_IXGRP;
  348. if (prot & FIBF_OTR_WRITE)
  349. mode |= S_IWOTH;
  350. if (prot & FIBF_OTR_READ)
  351. mode |= S_IROTH;
  352. if (prot & FIBF_OTR_EXECUTE)
  353. mode |= S_IXOTH;
  354. return mode;
  355. }
  356. void
  357. mode_to_prot(struct inode *inode)
  358. {
  359. u32 prot = AFFS_I(inode)->i_protect;
  360. umode_t mode = inode->i_mode;
  361. if (!(mode & S_IXUSR))
  362. prot |= FIBF_NOEXECUTE;
  363. if (!(mode & S_IRUSR))
  364. prot |= FIBF_NOREAD;
  365. if (!(mode & S_IWUSR))
  366. prot |= FIBF_NOWRITE;
  367. if (mode & S_IXGRP)
  368. prot |= FIBF_GRP_EXECUTE;
  369. if (mode & S_IRGRP)
  370. prot |= FIBF_GRP_READ;
  371. if (mode & S_IWGRP)
  372. prot |= FIBF_GRP_WRITE;
  373. if (mode & S_IXOTH)
  374. prot |= FIBF_OTR_EXECUTE;
  375. if (mode & S_IROTH)
  376. prot |= FIBF_OTR_READ;
  377. if (mode & S_IWOTH)
  378. prot |= FIBF_OTR_WRITE;
  379. AFFS_I(inode)->i_protect = prot;
  380. }
  381. void
  382. affs_error(struct super_block *sb, const char *function, const char *fmt, ...)
  383. {
  384. va_list args;
  385. va_start(args,fmt);
  386. vsnprintf(ErrorBuffer,sizeof(ErrorBuffer),fmt,args);
  387. va_end(args);
  388. printk(KERN_CRIT "AFFS error (device %s): %s(): %s\n", sb->s_id,
  389. function,ErrorBuffer);
  390. if (!(sb->s_flags & MS_RDONLY))
  391. printk(KERN_WARNING "AFFS: Remounting filesystem read-only\n");
  392. sb->s_flags |= MS_RDONLY;
  393. }
  394. void
  395. affs_warning(struct super_block *sb, const char *function, const char *fmt, ...)
  396. {
  397. va_list args;
  398. va_start(args,fmt);
  399. vsnprintf(ErrorBuffer,sizeof(ErrorBuffer),fmt,args);
  400. va_end(args);
  401. printk(KERN_WARNING "AFFS warning (device %s): %s(): %s\n", sb->s_id,
  402. function,ErrorBuffer);
  403. }
  404. /* Check if the name is valid for a affs object. */
  405. int
  406. affs_check_name(const unsigned char *name, int len)
  407. {
  408. int i;
  409. if (len > 30)
  410. #ifdef AFFS_NO_TRUNCATE
  411. return -ENAMETOOLONG;
  412. #else
  413. len = 30;
  414. #endif
  415. for (i = 0; i < len; i++) {
  416. if (name[i] < ' ' || name[i] == ':'
  417. || (name[i] > 0x7e && name[i] < 0xa0))
  418. return -EINVAL;
  419. }
  420. return 0;
  421. }
  422. /* This function copies name to bstr, with at most 30
  423. * characters length. The bstr will be prepended by
  424. * a length byte.
  425. * NOTE: The name will must be already checked by
  426. * affs_check_name()!
  427. */
  428. int
  429. affs_copy_name(unsigned char *bstr, struct dentry *dentry)
  430. {
  431. int len = min(dentry->d_name.len, 30u);
  432. *bstr++ = len;
  433. memcpy(bstr, dentry->d_name.name, len);
  434. return len;
  435. }