amigaffs.c 11 KB

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