namei.c 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474
  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. /* nilfs_new_inode() and 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. inode_dec_link_count(inode);
  177. iput(inode);
  178. goto out;
  179. }
  180. static int nilfs_link(struct dentry *old_dentry, struct inode *dir,
  181. struct dentry *dentry)
  182. {
  183. struct inode *inode = old_dentry->d_inode;
  184. struct nilfs_transaction_info ti;
  185. int err;
  186. if (inode->i_nlink >= NILFS_LINK_MAX)
  187. return -EMLINK;
  188. err = nilfs_transaction_begin(dir->i_sb, &ti, 1);
  189. if (err)
  190. return err;
  191. inode->i_ctime = CURRENT_TIME;
  192. inode_inc_link_count(inode);
  193. atomic_inc(&inode->i_count);
  194. err = nilfs_add_nondir(dentry, inode);
  195. if (!err)
  196. err = nilfs_transaction_commit(dir->i_sb);
  197. else
  198. nilfs_transaction_abort(dir->i_sb);
  199. return err;
  200. }
  201. static int nilfs_mkdir(struct inode *dir, struct dentry *dentry, int mode)
  202. {
  203. struct inode *inode;
  204. struct nilfs_transaction_info ti;
  205. int err;
  206. if (dir->i_nlink >= NILFS_LINK_MAX)
  207. return -EMLINK;
  208. err = nilfs_transaction_begin(dir->i_sb, &ti, 1);
  209. if (err)
  210. return err;
  211. inode_inc_link_count(dir);
  212. inode = nilfs_new_inode(dir, S_IFDIR | mode);
  213. err = PTR_ERR(inode);
  214. if (IS_ERR(inode))
  215. goto out_dir;
  216. inode->i_op = &nilfs_dir_inode_operations;
  217. inode->i_fop = &nilfs_dir_operations;
  218. inode->i_mapping->a_ops = &nilfs_aops;
  219. inode_inc_link_count(inode);
  220. err = nilfs_make_empty(inode, dir);
  221. if (err)
  222. goto out_fail;
  223. err = nilfs_add_link(dentry, inode);
  224. if (err)
  225. goto out_fail;
  226. d_instantiate(dentry, inode);
  227. out:
  228. if (!err)
  229. err = nilfs_transaction_commit(dir->i_sb);
  230. else
  231. nilfs_transaction_abort(dir->i_sb);
  232. return err;
  233. out_fail:
  234. inode_dec_link_count(inode);
  235. inode_dec_link_count(inode);
  236. iput(inode);
  237. out_dir:
  238. inode_dec_link_count(dir);
  239. goto out;
  240. }
  241. static int nilfs_unlink(struct inode *dir, struct dentry *dentry)
  242. {
  243. struct inode *inode;
  244. struct nilfs_dir_entry *de;
  245. struct page *page;
  246. struct nilfs_transaction_info ti;
  247. int err;
  248. err = nilfs_transaction_begin(dir->i_sb, &ti, 0);
  249. if (err)
  250. return err;
  251. err = -ENOENT;
  252. de = nilfs_find_entry(dir, dentry, &page);
  253. if (!de)
  254. goto out;
  255. inode = dentry->d_inode;
  256. err = -EIO;
  257. if (le64_to_cpu(de->inode) != inode->i_ino)
  258. goto out;
  259. if (!inode->i_nlink) {
  260. nilfs_warning(inode->i_sb, __func__,
  261. "deleting nonexistent file (%lu), %d\n",
  262. inode->i_ino, inode->i_nlink);
  263. inode->i_nlink = 1;
  264. }
  265. err = nilfs_delete_entry(de, page);
  266. if (err)
  267. goto out;
  268. inode->i_ctime = dir->i_ctime;
  269. inode_dec_link_count(inode);
  270. err = 0;
  271. out:
  272. if (!err)
  273. err = nilfs_transaction_commit(dir->i_sb);
  274. else
  275. nilfs_transaction_abort(dir->i_sb);
  276. return err;
  277. }
  278. static int nilfs_rmdir(struct inode *dir, struct dentry *dentry)
  279. {
  280. struct inode *inode = dentry->d_inode;
  281. struct nilfs_transaction_info ti;
  282. int err;
  283. err = nilfs_transaction_begin(dir->i_sb, &ti, 0);
  284. if (err)
  285. return err;
  286. err = -ENOTEMPTY;
  287. if (nilfs_empty_dir(inode)) {
  288. err = nilfs_unlink(dir, dentry);
  289. if (!err) {
  290. inode->i_size = 0;
  291. inode_dec_link_count(inode);
  292. inode_dec_link_count(dir);
  293. }
  294. }
  295. if (!err)
  296. err = nilfs_transaction_commit(dir->i_sb);
  297. else
  298. nilfs_transaction_abort(dir->i_sb);
  299. return err;
  300. }
  301. static int nilfs_rename(struct inode *old_dir, struct dentry *old_dentry,
  302. struct inode *new_dir, struct dentry *new_dentry)
  303. {
  304. struct inode *old_inode = old_dentry->d_inode;
  305. struct inode *new_inode = new_dentry->d_inode;
  306. struct page *dir_page = NULL;
  307. struct nilfs_dir_entry *dir_de = NULL;
  308. struct page *old_page;
  309. struct nilfs_dir_entry *old_de;
  310. struct nilfs_transaction_info ti;
  311. int err;
  312. err = nilfs_transaction_begin(old_dir->i_sb, &ti, 1);
  313. if (unlikely(err))
  314. return err;
  315. err = -ENOENT;
  316. old_de = nilfs_find_entry(old_dir, old_dentry, &old_page);
  317. if (!old_de)
  318. goto out;
  319. if (S_ISDIR(old_inode->i_mode)) {
  320. err = -EIO;
  321. dir_de = nilfs_dotdot(old_inode, &dir_page);
  322. if (!dir_de)
  323. goto out_old;
  324. }
  325. if (new_inode) {
  326. struct page *new_page;
  327. struct nilfs_dir_entry *new_de;
  328. err = -ENOTEMPTY;
  329. if (dir_de && !nilfs_empty_dir(new_inode))
  330. goto out_dir;
  331. err = -ENOENT;
  332. new_de = nilfs_find_entry(new_dir, new_dentry, &new_page);
  333. if (!new_de)
  334. goto out_dir;
  335. inode_inc_link_count(old_inode);
  336. nilfs_set_link(new_dir, new_de, new_page, old_inode);
  337. new_inode->i_ctime = CURRENT_TIME;
  338. if (dir_de)
  339. drop_nlink(new_inode);
  340. inode_dec_link_count(new_inode);
  341. } else {
  342. if (dir_de) {
  343. err = -EMLINK;
  344. if (new_dir->i_nlink >= NILFS_LINK_MAX)
  345. goto out_dir;
  346. }
  347. inode_inc_link_count(old_inode);
  348. err = nilfs_add_link(new_dentry, old_inode);
  349. if (err) {
  350. inode_dec_link_count(old_inode);
  351. goto out_dir;
  352. }
  353. if (dir_de)
  354. inode_inc_link_count(new_dir);
  355. }
  356. /*
  357. * Like most other Unix systems, set the ctime for inodes on a
  358. * rename.
  359. * inode_dec_link_count() will mark the inode dirty.
  360. */
  361. old_inode->i_ctime = CURRENT_TIME;
  362. nilfs_delete_entry(old_de, old_page);
  363. inode_dec_link_count(old_inode);
  364. if (dir_de) {
  365. nilfs_set_link(old_inode, dir_de, dir_page, new_dir);
  366. inode_dec_link_count(old_dir);
  367. }
  368. err = nilfs_transaction_commit(old_dir->i_sb);
  369. return err;
  370. out_dir:
  371. if (dir_de) {
  372. kunmap(dir_page);
  373. page_cache_release(dir_page);
  374. }
  375. out_old:
  376. kunmap(old_page);
  377. page_cache_release(old_page);
  378. out:
  379. nilfs_transaction_abort(old_dir->i_sb);
  380. return err;
  381. }
  382. struct inode_operations nilfs_dir_inode_operations = {
  383. .create = nilfs_create,
  384. .lookup = nilfs_lookup,
  385. .link = nilfs_link,
  386. .unlink = nilfs_unlink,
  387. .symlink = nilfs_symlink,
  388. .mkdir = nilfs_mkdir,
  389. .rmdir = nilfs_rmdir,
  390. .mknod = nilfs_mknod,
  391. .rename = nilfs_rename,
  392. .setattr = nilfs_setattr,
  393. .permission = nilfs_permission,
  394. };
  395. struct inode_operations nilfs_special_inode_operations = {
  396. .setattr = nilfs_setattr,
  397. .permission = nilfs_permission,
  398. };
  399. struct inode_operations nilfs_symlink_inode_operations = {
  400. .readlink = generic_readlink,
  401. .follow_link = page_follow_link_light,
  402. .put_link = page_put_link,
  403. };