PageRenderTime 27ms CodeModel.GetById 24ms RepoModel.GetById 0ms app.codeStats 0ms

/fs/omfs/dir.c

https://github.com/galaxyishere/samsung-kernel-latona
C | 505 lines | 393 code | 89 blank | 23 comment | 59 complexity | 432e80713eb48cb6185dccf5fae84df4 MD5 | raw file
  1. /*
  2. * OMFS (as used by RIO Karma) directory operations.
  3. * Copyright (C) 2005 Bob Copeland <me@bobcopeland.com>
  4. * Released under GPL v2.
  5. */
  6. #include <linux/fs.h>
  7. #include <linux/ctype.h>
  8. #include <linux/buffer_head.h>
  9. #include "omfs.h"
  10. static int omfs_hash(const char *name, int namelen, int mod)
  11. {
  12. int i, hash = 0;
  13. for (i = 0; i < namelen; i++)
  14. hash ^= tolower(name[i]) << (i % 24);
  15. return hash % mod;
  16. }
  17. /*
  18. * Finds the bucket for a given name and reads the containing block;
  19. * *ofs is set to the offset of the first list entry.
  20. */
  21. static struct buffer_head *omfs_get_bucket(struct inode *dir,
  22. const char *name, int namelen, int *ofs)
  23. {
  24. int nbuckets = (dir->i_size - OMFS_DIR_START)/8;
  25. int block = clus_to_blk(OMFS_SB(dir->i_sb), dir->i_ino);
  26. int bucket = omfs_hash(name, namelen, nbuckets);
  27. *ofs = OMFS_DIR_START + bucket * 8;
  28. return sb_bread(dir->i_sb, block);
  29. }
  30. static struct buffer_head *omfs_scan_list(struct inode *dir, u64 block,
  31. const char *name, int namelen,
  32. u64 *prev_block)
  33. {
  34. struct buffer_head *bh;
  35. struct omfs_inode *oi;
  36. int err = -ENOENT;
  37. *prev_block = ~0;
  38. while (block != ~0) {
  39. bh = sb_bread(dir->i_sb,
  40. clus_to_blk(OMFS_SB(dir->i_sb), block));
  41. if (!bh) {
  42. err = -EIO;
  43. goto err;
  44. }
  45. oi = (struct omfs_inode *) bh->b_data;
  46. if (omfs_is_bad(OMFS_SB(dir->i_sb), &oi->i_head, block)) {
  47. brelse(bh);
  48. goto err;
  49. }
  50. if (strncmp(oi->i_name, name, namelen) == 0)
  51. return bh;
  52. *prev_block = block;
  53. block = be64_to_cpu(oi->i_sibling);
  54. brelse(bh);
  55. }
  56. err:
  57. return ERR_PTR(err);
  58. }
  59. static struct buffer_head *omfs_find_entry(struct inode *dir,
  60. const char *name, int namelen)
  61. {
  62. struct buffer_head *bh;
  63. int ofs;
  64. u64 block, dummy;
  65. bh = omfs_get_bucket(dir, name, namelen, &ofs);
  66. if (!bh)
  67. return ERR_PTR(-EIO);
  68. block = be64_to_cpu(*((__be64 *) &bh->b_data[ofs]));
  69. brelse(bh);
  70. return omfs_scan_list(dir, block, name, namelen, &dummy);
  71. }
  72. int omfs_make_empty(struct inode *inode, struct super_block *sb)
  73. {
  74. struct omfs_sb_info *sbi = OMFS_SB(sb);
  75. int block = clus_to_blk(sbi, inode->i_ino);
  76. struct buffer_head *bh;
  77. struct omfs_inode *oi;
  78. bh = sb_bread(sb, block);
  79. if (!bh)
  80. return -ENOMEM;
  81. memset(bh->b_data, 0, sizeof(struct omfs_inode));
  82. if (inode->i_mode & S_IFDIR) {
  83. memset(&bh->b_data[OMFS_DIR_START], 0xff,
  84. sbi->s_sys_blocksize - OMFS_DIR_START);
  85. } else
  86. omfs_make_empty_table(bh, OMFS_EXTENT_START);
  87. oi = (struct omfs_inode *) bh->b_data;
  88. oi->i_head.h_self = cpu_to_be64(inode->i_ino);
  89. oi->i_sibling = ~cpu_to_be64(0ULL);
  90. mark_buffer_dirty(bh);
  91. brelse(bh);
  92. return 0;
  93. }
  94. static int omfs_add_link(struct dentry *dentry, struct inode *inode)
  95. {
  96. struct inode *dir = dentry->d_parent->d_inode;
  97. const char *name = dentry->d_name.name;
  98. int namelen = dentry->d_name.len;
  99. struct omfs_inode *oi;
  100. struct buffer_head *bh;
  101. u64 block;
  102. __be64 *entry;
  103. int ofs;
  104. /* just prepend to head of queue in proper bucket */
  105. bh = omfs_get_bucket(dir, name, namelen, &ofs);
  106. if (!bh)
  107. goto out;
  108. entry = (__be64 *) &bh->b_data[ofs];
  109. block = be64_to_cpu(*entry);
  110. *entry = cpu_to_be64(inode->i_ino);
  111. mark_buffer_dirty(bh);
  112. brelse(bh);
  113. /* now set the sibling and parent pointers on the new inode */
  114. bh = sb_bread(dir->i_sb, clus_to_blk(OMFS_SB(dir->i_sb), inode->i_ino));
  115. if (!bh)
  116. goto out;
  117. oi = (struct omfs_inode *) bh->b_data;
  118. memcpy(oi->i_name, name, namelen);
  119. memset(oi->i_name + namelen, 0, OMFS_NAMELEN - namelen);
  120. oi->i_sibling = cpu_to_be64(block);
  121. oi->i_parent = cpu_to_be64(dir->i_ino);
  122. mark_buffer_dirty(bh);
  123. brelse(bh);
  124. dir->i_ctime = CURRENT_TIME_SEC;
  125. /* mark affected inodes dirty to rebuild checksums */
  126. mark_inode_dirty(dir);
  127. mark_inode_dirty(inode);
  128. return 0;
  129. out:
  130. return -ENOMEM;
  131. }
  132. static int omfs_delete_entry(struct dentry *dentry)
  133. {
  134. struct inode *dir = dentry->d_parent->d_inode;
  135. struct inode *dirty;
  136. const char *name = dentry->d_name.name;
  137. int namelen = dentry->d_name.len;
  138. struct omfs_inode *oi;
  139. struct buffer_head *bh, *bh2;
  140. __be64 *entry, next;
  141. u64 block, prev;
  142. int ofs;
  143. int err = -ENOMEM;
  144. /* delete the proper node in the bucket's linked list */
  145. bh = omfs_get_bucket(dir, name, namelen, &ofs);
  146. if (!bh)
  147. goto out;
  148. entry = (__be64 *) &bh->b_data[ofs];
  149. block = be64_to_cpu(*entry);
  150. bh2 = omfs_scan_list(dir, block, name, namelen, &prev);
  151. if (IS_ERR(bh2)) {
  152. err = PTR_ERR(bh2);
  153. goto out_free_bh;
  154. }
  155. oi = (struct omfs_inode *) bh2->b_data;
  156. next = oi->i_sibling;
  157. brelse(bh2);
  158. if (prev != ~0) {
  159. /* found in middle of list, get list ptr */
  160. brelse(bh);
  161. bh = sb_bread(dir->i_sb,
  162. clus_to_blk(OMFS_SB(dir->i_sb), prev));
  163. if (!bh)
  164. goto out;
  165. oi = (struct omfs_inode *) bh->b_data;
  166. entry = &oi->i_sibling;
  167. }
  168. *entry = next;
  169. mark_buffer_dirty(bh);
  170. if (prev != ~0) {
  171. dirty = omfs_iget(dir->i_sb, prev);
  172. if (!IS_ERR(dirty)) {
  173. mark_inode_dirty(dirty);
  174. iput(dirty);
  175. }
  176. }
  177. err = 0;
  178. out_free_bh:
  179. brelse(bh);
  180. out:
  181. return err;
  182. }
  183. static int omfs_dir_is_empty(struct inode *inode)
  184. {
  185. int nbuckets = (inode->i_size - OMFS_DIR_START) / 8;
  186. struct buffer_head *bh;
  187. u64 *ptr;
  188. int i;
  189. bh = sb_bread(inode->i_sb, clus_to_blk(OMFS_SB(inode->i_sb),
  190. inode->i_ino));
  191. if (!bh)
  192. return 0;
  193. ptr = (u64 *) &bh->b_data[OMFS_DIR_START];
  194. for (i = 0; i < nbuckets; i++, ptr++)
  195. if (*ptr != ~0)
  196. break;
  197. brelse(bh);
  198. return *ptr != ~0;
  199. }
  200. static int omfs_unlink(struct inode *dir, struct dentry *dentry)
  201. {
  202. int ret;
  203. struct inode *inode = dentry->d_inode;
  204. ret = omfs_delete_entry(dentry);
  205. if (ret)
  206. goto end_unlink;
  207. inode_dec_link_count(inode);
  208. mark_inode_dirty(dir);
  209. end_unlink:
  210. return ret;
  211. }
  212. static int omfs_rmdir(struct inode *dir, struct dentry *dentry)
  213. {
  214. int err = -ENOTEMPTY;
  215. struct inode *inode = dentry->d_inode;
  216. if (omfs_dir_is_empty(inode)) {
  217. err = omfs_unlink(dir, dentry);
  218. if (!err)
  219. inode_dec_link_count(inode);
  220. }
  221. return err;
  222. }
  223. static int omfs_add_node(struct inode *dir, struct dentry *dentry, int mode)
  224. {
  225. int err;
  226. struct inode *inode = omfs_new_inode(dir, mode);
  227. if (IS_ERR(inode))
  228. return PTR_ERR(inode);
  229. err = omfs_make_empty(inode, dir->i_sb);
  230. if (err)
  231. goto out_free_inode;
  232. err = omfs_add_link(dentry, inode);
  233. if (err)
  234. goto out_free_inode;
  235. d_instantiate(dentry, inode);
  236. return 0;
  237. out_free_inode:
  238. iput(inode);
  239. return err;
  240. }
  241. static int omfs_mkdir(struct inode *dir, struct dentry *dentry, int mode)
  242. {
  243. return omfs_add_node(dir, dentry, mode | S_IFDIR);
  244. }
  245. static int omfs_create(struct inode *dir, struct dentry *dentry, int mode,
  246. struct nameidata *nd)
  247. {
  248. return omfs_add_node(dir, dentry, mode | S_IFREG);
  249. }
  250. static struct dentry *omfs_lookup(struct inode *dir, struct dentry *dentry,
  251. struct nameidata *nd)
  252. {
  253. struct buffer_head *bh;
  254. struct inode *inode = NULL;
  255. if (dentry->d_name.len > OMFS_NAMELEN)
  256. return ERR_PTR(-ENAMETOOLONG);
  257. bh = omfs_find_entry(dir, dentry->d_name.name, dentry->d_name.len);
  258. if (!IS_ERR(bh)) {
  259. struct omfs_inode *oi = (struct omfs_inode *)bh->b_data;
  260. ino_t ino = be64_to_cpu(oi->i_head.h_self);
  261. brelse(bh);
  262. inode = omfs_iget(dir->i_sb, ino);
  263. if (IS_ERR(inode))
  264. return ERR_CAST(inode);
  265. }
  266. d_add(dentry, inode);
  267. return NULL;
  268. }
  269. /* sanity check block's self pointer */
  270. int omfs_is_bad(struct omfs_sb_info *sbi, struct omfs_header *header,
  271. u64 fsblock)
  272. {
  273. int is_bad;
  274. u64 ino = be64_to_cpu(header->h_self);
  275. is_bad = ((ino != fsblock) || (ino < sbi->s_root_ino) ||
  276. (ino > sbi->s_num_blocks));
  277. if (is_bad)
  278. printk(KERN_WARNING "omfs: bad hash chain detected\n");
  279. return is_bad;
  280. }
  281. static int omfs_fill_chain(struct file *filp, void *dirent, filldir_t filldir,
  282. u64 fsblock, int hindex)
  283. {
  284. struct inode *dir = filp->f_dentry->d_inode;
  285. struct buffer_head *bh;
  286. struct omfs_inode *oi;
  287. u64 self;
  288. int res = 0;
  289. unsigned char d_type;
  290. /* follow chain in this bucket */
  291. while (fsblock != ~0) {
  292. bh = sb_bread(dir->i_sb, clus_to_blk(OMFS_SB(dir->i_sb),
  293. fsblock));
  294. if (!bh)
  295. goto out;
  296. oi = (struct omfs_inode *) bh->b_data;
  297. if (omfs_is_bad(OMFS_SB(dir->i_sb), &oi->i_head, fsblock)) {
  298. brelse(bh);
  299. goto out;
  300. }
  301. self = fsblock;
  302. fsblock = be64_to_cpu(oi->i_sibling);
  303. /* skip visited nodes */
  304. if (hindex) {
  305. hindex--;
  306. brelse(bh);
  307. continue;
  308. }
  309. d_type = (oi->i_type == OMFS_DIR) ? DT_DIR : DT_REG;
  310. res = filldir(dirent, oi->i_name, strnlen(oi->i_name,
  311. OMFS_NAMELEN), filp->f_pos, self, d_type);
  312. if (res == 0)
  313. filp->f_pos++;
  314. brelse(bh);
  315. }
  316. out:
  317. return res;
  318. }
  319. static int omfs_rename(struct inode *old_dir, struct dentry *old_dentry,
  320. struct inode *new_dir, struct dentry *new_dentry)
  321. {
  322. struct inode *new_inode = new_dentry->d_inode;
  323. struct inode *old_inode = old_dentry->d_inode;
  324. struct buffer_head *bh;
  325. int is_dir;
  326. int err;
  327. is_dir = S_ISDIR(old_inode->i_mode);
  328. if (new_inode) {
  329. /* overwriting existing file/dir */
  330. err = -ENOTEMPTY;
  331. if (is_dir && !omfs_dir_is_empty(new_inode))
  332. goto out;
  333. err = -ENOENT;
  334. bh = omfs_find_entry(new_dir, new_dentry->d_name.name,
  335. new_dentry->d_name.len);
  336. if (IS_ERR(bh))
  337. goto out;
  338. brelse(bh);
  339. err = omfs_unlink(new_dir, new_dentry);
  340. if (err)
  341. goto out;
  342. }
  343. /* since omfs locates files by name, we need to unlink _before_
  344. * adding the new link or we won't find the old one */
  345. inode_inc_link_count(old_inode);
  346. err = omfs_unlink(old_dir, old_dentry);
  347. if (err) {
  348. inode_dec_link_count(old_inode);
  349. goto out;
  350. }
  351. err = omfs_add_link(new_dentry, old_inode);
  352. if (err)
  353. goto out;
  354. old_inode->i_ctime = CURRENT_TIME_SEC;
  355. out:
  356. return err;
  357. }
  358. static int omfs_readdir(struct file *filp, void *dirent, filldir_t filldir)
  359. {
  360. struct inode *dir = filp->f_dentry->d_inode;
  361. struct buffer_head *bh;
  362. loff_t offset, res;
  363. unsigned int hchain, hindex;
  364. int nbuckets;
  365. u64 fsblock;
  366. int ret = -EINVAL;
  367. if (filp->f_pos >> 32)
  368. goto success;
  369. switch ((unsigned long) filp->f_pos) {
  370. case 0:
  371. if (filldir(dirent, ".", 1, 0, dir->i_ino, DT_DIR) < 0)
  372. goto success;
  373. filp->f_pos++;
  374. /* fall through */
  375. case 1:
  376. if (filldir(dirent, "..", 2, 1,
  377. parent_ino(filp->f_dentry), DT_DIR) < 0)
  378. goto success;
  379. filp->f_pos = 1 << 20;
  380. /* fall through */
  381. }
  382. nbuckets = (dir->i_size - OMFS_DIR_START) / 8;
  383. /* high 12 bits store bucket + 1 and low 20 bits store hash index */
  384. hchain = (filp->f_pos >> 20) - 1;
  385. hindex = filp->f_pos & 0xfffff;
  386. bh = sb_bread(dir->i_sb, clus_to_blk(OMFS_SB(dir->i_sb), dir->i_ino));
  387. if (!bh)
  388. goto out;
  389. offset = OMFS_DIR_START + hchain * 8;
  390. for (; hchain < nbuckets; hchain++, offset += 8) {
  391. fsblock = be64_to_cpu(*((__be64 *) &bh->b_data[offset]));
  392. res = omfs_fill_chain(filp, dirent, filldir, fsblock, hindex);
  393. hindex = 0;
  394. if (res < 0)
  395. break;
  396. filp->f_pos = (hchain+2) << 20;
  397. }
  398. brelse(bh);
  399. success:
  400. ret = 0;
  401. out:
  402. return ret;
  403. }
  404. const struct inode_operations omfs_dir_inops = {
  405. .lookup = omfs_lookup,
  406. .mkdir = omfs_mkdir,
  407. .rename = omfs_rename,
  408. .create = omfs_create,
  409. .unlink = omfs_unlink,
  410. .rmdir = omfs_rmdir,
  411. };
  412. const struct file_operations omfs_dir_operations = {
  413. .read = generic_read_dir,
  414. .readdir = omfs_readdir,
  415. .llseek = generic_file_llseek,
  416. };