namei.c 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446
  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, err2;
  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. err2 = nilfs_transaction_end(dir->i_sb, !err);
  114. return err ? : err2;
  115. }
  116. static int
  117. nilfs_mknod(struct inode *dir, struct dentry *dentry, int mode, dev_t rdev)
  118. {
  119. struct inode *inode;
  120. struct nilfs_transaction_info ti;
  121. int err, err2;
  122. if (!new_valid_dev(rdev))
  123. return -EINVAL;
  124. err = nilfs_transaction_begin(dir->i_sb, &ti, 1);
  125. if (err)
  126. return err;
  127. inode = nilfs_new_inode(dir, mode);
  128. err = PTR_ERR(inode);
  129. if (!IS_ERR(inode)) {
  130. init_special_inode(inode, inode->i_mode, rdev);
  131. mark_inode_dirty(inode);
  132. err = nilfs_add_nondir(dentry, inode);
  133. }
  134. err2 = nilfs_transaction_end(dir->i_sb, !err);
  135. return err ? : err2;
  136. }
  137. static int nilfs_symlink(struct inode *dir, struct dentry *dentry,
  138. const char *symname)
  139. {
  140. struct nilfs_transaction_info ti;
  141. struct super_block *sb = dir->i_sb;
  142. unsigned l = strlen(symname)+1;
  143. struct inode *inode;
  144. int err, err2;
  145. if (l > sb->s_blocksize)
  146. return -ENAMETOOLONG;
  147. err = nilfs_transaction_begin(dir->i_sb, &ti, 1);
  148. if (err)
  149. return err;
  150. inode = nilfs_new_inode(dir, S_IFLNK | S_IRWXUGO);
  151. err = PTR_ERR(inode);
  152. if (IS_ERR(inode))
  153. goto out;
  154. /* slow symlink */
  155. inode->i_op = &nilfs_symlink_inode_operations;
  156. inode->i_mapping->a_ops = &nilfs_aops;
  157. err = page_symlink(inode, symname, l);
  158. if (err)
  159. goto out_fail;
  160. /* mark_inode_dirty(inode); */
  161. /* nilfs_new_inode() and page_symlink() do this */
  162. err = nilfs_add_nondir(dentry, inode);
  163. out:
  164. err2 = nilfs_transaction_end(dir->i_sb, !err);
  165. return err ? : err2;
  166. out_fail:
  167. inode_dec_link_count(inode);
  168. iput(inode);
  169. goto out;
  170. }
  171. static int nilfs_link(struct dentry *old_dentry, struct inode *dir,
  172. struct dentry *dentry)
  173. {
  174. struct inode *inode = old_dentry->d_inode;
  175. struct nilfs_transaction_info ti;
  176. int err, err2;
  177. if (inode->i_nlink >= NILFS_LINK_MAX)
  178. return -EMLINK;
  179. err = nilfs_transaction_begin(dir->i_sb, &ti, 1);
  180. if (err)
  181. return err;
  182. inode->i_ctime = CURRENT_TIME;
  183. inode_inc_link_count(inode);
  184. atomic_inc(&inode->i_count);
  185. err = nilfs_add_nondir(dentry, inode);
  186. err2 = nilfs_transaction_end(dir->i_sb, !err);
  187. return err ? : err2;
  188. }
  189. static int nilfs_mkdir(struct inode *dir, struct dentry *dentry, int mode)
  190. {
  191. struct inode *inode;
  192. struct nilfs_transaction_info ti;
  193. int err, err2;
  194. if (dir->i_nlink >= NILFS_LINK_MAX)
  195. return -EMLINK;
  196. err = nilfs_transaction_begin(dir->i_sb, &ti, 1);
  197. if (err)
  198. return err;
  199. inode_inc_link_count(dir);
  200. inode = nilfs_new_inode(dir, S_IFDIR | mode);
  201. err = PTR_ERR(inode);
  202. if (IS_ERR(inode))
  203. goto out_dir;
  204. inode->i_op = &nilfs_dir_inode_operations;
  205. inode->i_fop = &nilfs_dir_operations;
  206. inode->i_mapping->a_ops = &nilfs_aops;
  207. inode_inc_link_count(inode);
  208. err = nilfs_make_empty(inode, dir);
  209. if (err)
  210. goto out_fail;
  211. err = nilfs_add_link(dentry, inode);
  212. if (err)
  213. goto out_fail;
  214. d_instantiate(dentry, inode);
  215. out:
  216. err2 = nilfs_transaction_end(dir->i_sb, !err);
  217. return err ? : err2;
  218. out_fail:
  219. inode_dec_link_count(inode);
  220. inode_dec_link_count(inode);
  221. iput(inode);
  222. out_dir:
  223. inode_dec_link_count(dir);
  224. goto out;
  225. }
  226. static int nilfs_unlink(struct inode *dir, struct dentry *dentry)
  227. {
  228. struct inode *inode;
  229. struct nilfs_dir_entry *de;
  230. struct page *page;
  231. struct nilfs_transaction_info ti;
  232. int err, err2;
  233. err = nilfs_transaction_begin(dir->i_sb, &ti, 0);
  234. if (err)
  235. return err;
  236. err = -ENOENT;
  237. de = nilfs_find_entry(dir, dentry, &page);
  238. if (!de)
  239. goto out;
  240. inode = dentry->d_inode;
  241. err = -EIO;
  242. if (le64_to_cpu(de->inode) != inode->i_ino)
  243. goto out;
  244. if (!inode->i_nlink) {
  245. nilfs_warning(inode->i_sb, __func__,
  246. "deleting nonexistent file (%lu), %d\n",
  247. inode->i_ino, inode->i_nlink);
  248. inode->i_nlink = 1;
  249. }
  250. err = nilfs_delete_entry(de, page);
  251. if (err)
  252. goto out;
  253. inode->i_ctime = dir->i_ctime;
  254. inode_dec_link_count(inode);
  255. err = 0;
  256. out:
  257. err2 = nilfs_transaction_end(dir->i_sb, !err);
  258. return err ? : err2;
  259. }
  260. static int nilfs_rmdir(struct inode *dir, struct dentry *dentry)
  261. {
  262. struct inode *inode = dentry->d_inode;
  263. struct nilfs_transaction_info ti;
  264. int err, err2;
  265. err = nilfs_transaction_begin(dir->i_sb, &ti, 0);
  266. if (err)
  267. return err;
  268. err = -ENOTEMPTY;
  269. if (nilfs_empty_dir(inode)) {
  270. err = nilfs_unlink(dir, dentry);
  271. if (!err) {
  272. inode->i_size = 0;
  273. inode_dec_link_count(inode);
  274. inode_dec_link_count(dir);
  275. }
  276. }
  277. err2 = nilfs_transaction_end(dir->i_sb, !err);
  278. return err ? : err2;
  279. }
  280. static int nilfs_rename(struct inode *old_dir, struct dentry *old_dentry,
  281. struct inode *new_dir, struct dentry *new_dentry)
  282. {
  283. struct inode *old_inode = old_dentry->d_inode;
  284. struct inode *new_inode = new_dentry->d_inode;
  285. struct page *dir_page = NULL;
  286. struct nilfs_dir_entry *dir_de = NULL;
  287. struct page *old_page;
  288. struct nilfs_dir_entry *old_de;
  289. struct nilfs_transaction_info ti;
  290. int err;
  291. err = nilfs_transaction_begin(old_dir->i_sb, &ti, 1);
  292. if (unlikely(err))
  293. return err;
  294. err = -ENOENT;
  295. old_de = nilfs_find_entry(old_dir, old_dentry, &old_page);
  296. if (!old_de)
  297. goto out;
  298. if (S_ISDIR(old_inode->i_mode)) {
  299. err = -EIO;
  300. dir_de = nilfs_dotdot(old_inode, &dir_page);
  301. if (!dir_de)
  302. goto out_old;
  303. }
  304. if (new_inode) {
  305. struct page *new_page;
  306. struct nilfs_dir_entry *new_de;
  307. err = -ENOTEMPTY;
  308. if (dir_de && !nilfs_empty_dir(new_inode))
  309. goto out_dir;
  310. err = -ENOENT;
  311. new_de = nilfs_find_entry(new_dir, new_dentry, &new_page);
  312. if (!new_de)
  313. goto out_dir;
  314. inode_inc_link_count(old_inode);
  315. nilfs_set_link(new_dir, new_de, new_page, old_inode);
  316. new_inode->i_ctime = CURRENT_TIME;
  317. if (dir_de)
  318. drop_nlink(new_inode);
  319. inode_dec_link_count(new_inode);
  320. } else {
  321. if (dir_de) {
  322. err = -EMLINK;
  323. if (new_dir->i_nlink >= NILFS_LINK_MAX)
  324. goto out_dir;
  325. }
  326. inode_inc_link_count(old_inode);
  327. err = nilfs_add_link(new_dentry, old_inode);
  328. if (err) {
  329. inode_dec_link_count(old_inode);
  330. goto out_dir;
  331. }
  332. if (dir_de)
  333. inode_inc_link_count(new_dir);
  334. }
  335. /*
  336. * Like most other Unix systems, set the ctime for inodes on a
  337. * rename.
  338. * inode_dec_link_count() will mark the inode dirty.
  339. */
  340. old_inode->i_ctime = CURRENT_TIME;
  341. nilfs_delete_entry(old_de, old_page);
  342. inode_dec_link_count(old_inode);
  343. if (dir_de) {
  344. nilfs_set_link(old_inode, dir_de, dir_page, new_dir);
  345. inode_dec_link_count(old_dir);
  346. }
  347. err = nilfs_transaction_end(old_dir->i_sb, 1);
  348. return err;
  349. out_dir:
  350. if (dir_de) {
  351. kunmap(dir_page);
  352. page_cache_release(dir_page);
  353. }
  354. out_old:
  355. kunmap(old_page);
  356. page_cache_release(old_page);
  357. out:
  358. nilfs_transaction_end(old_dir->i_sb, 0);
  359. return err;
  360. }
  361. struct inode_operations nilfs_dir_inode_operations = {
  362. .create = nilfs_create,
  363. .lookup = nilfs_lookup,
  364. .link = nilfs_link,
  365. .unlink = nilfs_unlink,
  366. .symlink = nilfs_symlink,
  367. .mkdir = nilfs_mkdir,
  368. .rmdir = nilfs_rmdir,
  369. .mknod = nilfs_mknod,
  370. .rename = nilfs_rename,
  371. .setattr = nilfs_setattr,
  372. .permission = nilfs_permission,
  373. };
  374. struct inode_operations nilfs_special_inode_operations = {
  375. .setattr = nilfs_setattr,
  376. .permission = nilfs_permission,
  377. };
  378. struct inode_operations nilfs_symlink_inode_operations = {
  379. .readlink = generic_readlink,
  380. .follow_link = page_follow_link_light,
  381. .put_link = page_put_link,
  382. };