namei.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487
  1. /*
  2. * namei.c - NILFS pathname lookup operations.
  3. *
  4. * Copyright (C) 2005-2008 Nippon Telegraph and Telephone Corporation.
  5. *
  6. * This program is free software; you can redistribute it and/or modify
  7. * it under the terms of the GNU General Public License as published by
  8. * the Free Software Foundation; either version 2 of the License, or
  9. * (at your option) any later version.
  10. *
  11. * This program is distributed in the hope that it will be useful,
  12. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  13. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  14. * GNU General Public License for more details.
  15. *
  16. * You should have received a copy of the GNU General Public License
  17. * along with this program; if not, write to the Free Software
  18. * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
  19. *
  20. * Modified for NILFS by Amagai Yoshiji <amagai@osrg.net>,
  21. * Ryusuke Konishi <ryusuke@osrg.net>
  22. */
  23. /*
  24. * linux/fs/ext2/namei.c
  25. *
  26. * Copyright (C) 1992, 1993, 1994, 1995
  27. * Remy Card (card@masi.ibp.fr)
  28. * Laboratoire MASI - Institut Blaise Pascal
  29. * Universite Pierre et Marie Curie (Paris VI)
  30. *
  31. * from
  32. *
  33. * linux/fs/minix/namei.c
  34. *
  35. * Copyright (C) 1991, 1992 Linus Torvalds
  36. *
  37. * Big-endian to little-endian byte-swapping/bitmaps by
  38. * David S. Miller (davem@caip.rutgers.edu), 1995
  39. */
  40. #include <linux/pagemap.h>
  41. #include "nilfs.h"
  42. static inline int nilfs_add_nondir(struct dentry *dentry, struct inode *inode)
  43. {
  44. int err = nilfs_add_link(dentry, inode);
  45. if (!err) {
  46. d_instantiate(dentry, inode);
  47. return 0;
  48. }
  49. inode_dec_link_count(inode);
  50. iput(inode);
  51. return err;
  52. }
  53. /*
  54. * Methods themselves.
  55. */
  56. static struct dentry *
  57. nilfs_lookup(struct inode *dir, struct dentry *dentry, struct nameidata *nd)
  58. {
  59. struct inode *inode;
  60. ino_t ino;
  61. if (dentry->d_name.len > NILFS_NAME_LEN)
  62. return ERR_PTR(-ENAMETOOLONG);
  63. ino = nilfs_inode_by_name(dir, dentry);
  64. inode = NULL;
  65. if (ino) {
  66. inode = nilfs_iget(dir->i_sb, ino);
  67. if (IS_ERR(inode))
  68. return ERR_CAST(inode);
  69. }
  70. return d_splice_alias(inode, dentry);
  71. }
  72. struct dentry *nilfs_get_parent(struct dentry *child)
  73. {
  74. unsigned long ino;
  75. struct inode *inode;
  76. struct dentry dotdot;
  77. dotdot.d_name.name = "..";
  78. dotdot.d_name.len = 2;
  79. ino = nilfs_inode_by_name(child->d_inode, &dotdot);
  80. if (!ino)
  81. return ERR_PTR(-ENOENT);
  82. inode = nilfs_iget(child->d_inode->i_sb, ino);
  83. if (IS_ERR(inode))
  84. return ERR_CAST(inode);
  85. return d_obtain_alias(inode);
  86. }
  87. /*
  88. * By the time this is called, we already have created
  89. * the directory cache entry for the new file, but it
  90. * is so far negative - it has no inode.
  91. *
  92. * If the create succeeds, we fill in the inode information
  93. * with d_instantiate().
  94. */
  95. static int nilfs_create(struct inode *dir, struct dentry *dentry, int mode,
  96. struct nameidata *nd)
  97. {
  98. struct inode *inode;
  99. struct nilfs_transaction_info ti;
  100. int err;
  101. err = nilfs_transaction_begin(dir->i_sb, &ti, 1);
  102. if (err)
  103. return err;
  104. inode = nilfs_new_inode(dir, mode);
  105. err = PTR_ERR(inode);
  106. if (!IS_ERR(inode)) {
  107. inode->i_op = &nilfs_file_inode_operations;
  108. inode->i_fop = &nilfs_file_operations;
  109. inode->i_mapping->a_ops = &nilfs_aops;
  110. mark_inode_dirty(inode);
  111. err = nilfs_add_nondir(dentry, inode);
  112. }
  113. if (!err)
  114. err = nilfs_transaction_commit(dir->i_sb);
  115. else
  116. nilfs_transaction_abort(dir->i_sb);
  117. return err;
  118. }
  119. static int
  120. nilfs_mknod(struct inode *dir, struct dentry *dentry, int mode, dev_t rdev)
  121. {
  122. struct inode *inode;
  123. struct nilfs_transaction_info ti;
  124. int err;
  125. if (!new_valid_dev(rdev))
  126. return -EINVAL;
  127. err = nilfs_transaction_begin(dir->i_sb, &ti, 1);
  128. if (err)
  129. return err;
  130. inode = nilfs_new_inode(dir, mode);
  131. err = PTR_ERR(inode);
  132. if (!IS_ERR(inode)) {
  133. init_special_inode(inode, inode->i_mode, rdev);
  134. mark_inode_dirty(inode);
  135. err = nilfs_add_nondir(dentry, inode);
  136. }
  137. if (!err)
  138. err = nilfs_transaction_commit(dir->i_sb);
  139. else
  140. nilfs_transaction_abort(dir->i_sb);
  141. return err;
  142. }
  143. static int nilfs_symlink(struct inode *dir, struct dentry *dentry,
  144. const char *symname)
  145. {
  146. struct nilfs_transaction_info ti;
  147. struct super_block *sb = dir->i_sb;
  148. unsigned l = strlen(symname)+1;
  149. struct inode *inode;
  150. int err;
  151. if (l > sb->s_blocksize)
  152. return -ENAMETOOLONG;
  153. err = nilfs_transaction_begin(dir->i_sb, &ti, 1);
  154. if (err)
  155. return err;
  156. inode = nilfs_new_inode(dir, S_IFLNK | S_IRWXUGO);
  157. err = PTR_ERR(inode);
  158. if (IS_ERR(inode))
  159. goto out;
  160. /* slow symlink */
  161. inode->i_op = &nilfs_symlink_inode_operations;
  162. inode->i_mapping->a_ops = &nilfs_aops;
  163. err = page_symlink(inode, symname, l);
  164. if (err)
  165. goto out_fail;
  166. /* mark_inode_dirty(inode); */
  167. /* page_symlink() do this */
  168. err = nilfs_add_nondir(dentry, inode);
  169. out:
  170. if (!err)
  171. err = nilfs_transaction_commit(dir->i_sb);
  172. else
  173. nilfs_transaction_abort(dir->i_sb);
  174. return err;
  175. out_fail:
  176. drop_nlink(inode);
  177. mark_inode_dirty(inode);
  178. iput(inode);
  179. goto out;
  180. }
  181. static int nilfs_link(struct dentry *old_dentry, struct inode *dir,
  182. struct dentry *dentry)
  183. {
  184. struct inode *inode = old_dentry->d_inode;
  185. struct nilfs_transaction_info ti;
  186. int err;
  187. if (inode->i_nlink >= NILFS_LINK_MAX)
  188. return -EMLINK;
  189. err = nilfs_transaction_begin(dir->i_sb, &ti, 1);
  190. if (err)
  191. return err;
  192. inode->i_ctime = CURRENT_TIME;
  193. inode_inc_link_count(inode);
  194. atomic_inc(&inode->i_count);
  195. err = nilfs_add_nondir(dentry, inode);
  196. if (!err)
  197. err = nilfs_transaction_commit(dir->i_sb);
  198. else
  199. nilfs_transaction_abort(dir->i_sb);
  200. return err;
  201. }
  202. static int nilfs_mkdir(struct inode *dir, struct dentry *dentry, int mode)
  203. {
  204. struct inode *inode;
  205. struct nilfs_transaction_info ti;
  206. int err;
  207. if (dir->i_nlink >= NILFS_LINK_MAX)
  208. return -EMLINK;
  209. err = nilfs_transaction_begin(dir->i_sb, &ti, 1);
  210. if (err)
  211. return err;
  212. inc_nlink(dir);
  213. inode = nilfs_new_inode(dir, S_IFDIR | mode);
  214. err = PTR_ERR(inode);
  215. if (IS_ERR(inode))
  216. goto out_dir;
  217. inode->i_op = &nilfs_dir_inode_operations;
  218. inode->i_fop = &nilfs_dir_operations;
  219. inode->i_mapping->a_ops = &nilfs_aops;
  220. inc_nlink(inode);
  221. mark_inode_dirty(inode);
  222. err = nilfs_make_empty(inode, dir);
  223. if (err)
  224. goto out_fail;
  225. err = nilfs_add_link(dentry, inode);
  226. if (err)
  227. goto out_fail;
  228. d_instantiate(dentry, inode);
  229. out:
  230. if (!err)
  231. err = nilfs_transaction_commit(dir->i_sb);
  232. else
  233. nilfs_transaction_abort(dir->i_sb);
  234. return err;
  235. out_fail:
  236. drop_nlink(inode);
  237. drop_nlink(inode);
  238. mark_inode_dirty(inode);
  239. iput(inode);
  240. out_dir:
  241. drop_nlink(dir);
  242. mark_inode_dirty(dir);
  243. goto out;
  244. }
  245. static int nilfs_unlink(struct inode *dir, struct dentry *dentry)
  246. {
  247. struct inode *inode;
  248. struct nilfs_dir_entry *de;
  249. struct page *page;
  250. struct nilfs_transaction_info ti;
  251. int err;
  252. err = nilfs_transaction_begin(dir->i_sb, &ti, 0);
  253. if (err)
  254. return err;
  255. err = -ENOENT;
  256. de = nilfs_find_entry(dir, dentry, &page);
  257. if (!de)
  258. goto out;
  259. inode = dentry->d_inode;
  260. err = -EIO;
  261. if (le64_to_cpu(de->inode) != inode->i_ino)
  262. goto out;
  263. if (!inode->i_nlink) {
  264. nilfs_warning(inode->i_sb, __func__,
  265. "deleting nonexistent file (%lu), %d\n",
  266. inode->i_ino, inode->i_nlink);
  267. inode->i_nlink = 1;
  268. }
  269. err = nilfs_delete_entry(de, page);
  270. if (err)
  271. goto out;
  272. inode->i_ctime = dir->i_ctime;
  273. drop_nlink(inode);
  274. mark_inode_dirty(inode);
  275. err = 0;
  276. out:
  277. if (!err)
  278. err = nilfs_transaction_commit(dir->i_sb);
  279. else
  280. nilfs_transaction_abort(dir->i_sb);
  281. return err;
  282. }
  283. static int nilfs_rmdir(struct inode *dir, struct dentry *dentry)
  284. {
  285. struct inode *inode = dentry->d_inode;
  286. struct nilfs_transaction_info ti;
  287. int err;
  288. err = nilfs_transaction_begin(dir->i_sb, &ti, 0);
  289. if (err)
  290. return err;
  291. err = -ENOTEMPTY;
  292. if (nilfs_empty_dir(inode)) {
  293. err = nilfs_unlink(dir, dentry);
  294. if (!err) {
  295. inode->i_size = 0;
  296. drop_nlink(inode);
  297. mark_inode_dirty(inode);
  298. drop_nlink(dir);
  299. mark_inode_dirty(dir);
  300. }
  301. }
  302. if (!err)
  303. err = nilfs_transaction_commit(dir->i_sb);
  304. else
  305. nilfs_transaction_abort(dir->i_sb);
  306. return err;
  307. }
  308. static int nilfs_rename(struct inode *old_dir, struct dentry *old_dentry,
  309. struct inode *new_dir, struct dentry *new_dentry)
  310. {
  311. struct inode *old_inode = old_dentry->d_inode;
  312. struct inode *new_inode = new_dentry->d_inode;
  313. struct page *dir_page = NULL;
  314. struct nilfs_dir_entry *dir_de = NULL;
  315. struct page *old_page;
  316. struct nilfs_dir_entry *old_de;
  317. struct nilfs_transaction_info ti;
  318. int err;
  319. err = nilfs_transaction_begin(old_dir->i_sb, &ti, 1);
  320. if (unlikely(err))
  321. return err;
  322. err = -ENOENT;
  323. old_de = nilfs_find_entry(old_dir, old_dentry, &old_page);
  324. if (!old_de)
  325. goto out;
  326. if (S_ISDIR(old_inode->i_mode)) {
  327. err = -EIO;
  328. dir_de = nilfs_dotdot(old_inode, &dir_page);
  329. if (!dir_de)
  330. goto out_old;
  331. }
  332. if (new_inode) {
  333. struct page *new_page;
  334. struct nilfs_dir_entry *new_de;
  335. err = -ENOTEMPTY;
  336. if (dir_de && !nilfs_empty_dir(new_inode))
  337. goto out_dir;
  338. err = -ENOENT;
  339. new_de = nilfs_find_entry(new_dir, new_dentry, &new_page);
  340. if (!new_de)
  341. goto out_dir;
  342. inc_nlink(old_inode);
  343. nilfs_set_link(new_dir, new_de, new_page, old_inode);
  344. mark_inode_dirty(new_dir);
  345. new_inode->i_ctime = CURRENT_TIME;
  346. if (dir_de)
  347. drop_nlink(new_inode);
  348. drop_nlink(new_inode);
  349. mark_inode_dirty(new_inode);
  350. } else {
  351. if (dir_de) {
  352. err = -EMLINK;
  353. if (new_dir->i_nlink >= NILFS_LINK_MAX)
  354. goto out_dir;
  355. }
  356. inc_nlink(old_inode);
  357. err = nilfs_add_link(new_dentry, old_inode);
  358. if (err) {
  359. drop_nlink(old_inode);
  360. mark_inode_dirty(old_inode);
  361. goto out_dir;
  362. }
  363. if (dir_de) {
  364. inc_nlink(new_dir);
  365. mark_inode_dirty(new_dir);
  366. }
  367. }
  368. /*
  369. * Like most other Unix systems, set the ctime for inodes on a
  370. * rename.
  371. */
  372. old_inode->i_ctime = CURRENT_TIME;
  373. nilfs_delete_entry(old_de, old_page);
  374. drop_nlink(old_inode);
  375. if (dir_de) {
  376. nilfs_set_link(old_inode, dir_de, dir_page, new_dir);
  377. drop_nlink(old_dir);
  378. mark_inode_dirty(old_dir);
  379. }
  380. mark_inode_dirty(old_inode);
  381. err = nilfs_transaction_commit(old_dir->i_sb);
  382. return err;
  383. out_dir:
  384. if (dir_de) {
  385. kunmap(dir_page);
  386. page_cache_release(dir_page);
  387. }
  388. out_old:
  389. kunmap(old_page);
  390. page_cache_release(old_page);
  391. out:
  392. nilfs_transaction_abort(old_dir->i_sb);
  393. return err;
  394. }
  395. const struct inode_operations nilfs_dir_inode_operations = {
  396. .create = nilfs_create,
  397. .lookup = nilfs_lookup,
  398. .link = nilfs_link,
  399. .unlink = nilfs_unlink,
  400. .symlink = nilfs_symlink,
  401. .mkdir = nilfs_mkdir,
  402. .rmdir = nilfs_rmdir,
  403. .mknod = nilfs_mknod,
  404. .rename = nilfs_rename,
  405. .setattr = nilfs_setattr,
  406. .permission = nilfs_permission,
  407. };
  408. const struct inode_operations nilfs_special_inode_operations = {
  409. .setattr = nilfs_setattr,
  410. .permission = nilfs_permission,
  411. };
  412. const struct inode_operations nilfs_symlink_inode_operations = {
  413. .readlink = generic_readlink,
  414. .follow_link = page_follow_link_light,
  415. .put_link = page_put_link,
  416. };