amigaffs.c 11 KB

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