namei.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578
  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. #include "export.h"
  43. #define NILFS_FID_SIZE_NON_CONNECTABLE \
  44. (offsetof(struct nilfs_fid, parent_gen) / 4)
  45. #define NILFS_FID_SIZE_CONNECTABLE (sizeof(struct nilfs_fid) / 4)
  46. static inline int nilfs_add_nondir(struct dentry *dentry, struct inode *inode)
  47. {
  48. int err = nilfs_add_link(dentry, inode);
  49. if (!err) {
  50. d_instantiate(dentry, inode);
  51. return 0;
  52. }
  53. inode_dec_link_count(inode);
  54. iput(inode);
  55. return err;
  56. }
  57. /*
  58. * Methods themselves.
  59. */
  60. static struct dentry *
  61. nilfs_lookup(struct inode *dir, struct dentry *dentry, struct nameidata *nd)
  62. {
  63. struct inode *inode;
  64. ino_t ino;
  65. if (dentry->d_name.len > NILFS_NAME_LEN)
  66. return ERR_PTR(-ENAMETOOLONG);
  67. ino = nilfs_inode_by_name(dir, &dentry->d_name);
  68. inode = ino ? nilfs_iget(dir->i_sb, NILFS_I(dir)->i_root, ino) : NULL;
  69. return d_splice_alias(inode, dentry);
  70. }
  71. /*
  72. * By the time this is called, we already have created
  73. * the directory cache entry for the new file, but it
  74. * is so far negative - it has no inode.
  75. *
  76. * If the create succeeds, we fill in the inode information
  77. * with d_instantiate().
  78. */
  79. static int nilfs_create(struct inode *dir, struct dentry *dentry, umode_t mode,
  80. struct nameidata *nd)
  81. {
  82. struct inode *inode;
  83. struct nilfs_transaction_info ti;
  84. int err;
  85. err = nilfs_transaction_begin(dir->i_sb, &ti, 1);
  86. if (err)
  87. return err;
  88. inode = nilfs_new_inode(dir, mode);
  89. err = PTR_ERR(inode);
  90. if (!IS_ERR(inode)) {
  91. inode->i_op = &nilfs_file_inode_operations;
  92. inode->i_fop = &nilfs_file_operations;
  93. inode->i_mapping->a_ops = &nilfs_aops;
  94. nilfs_mark_inode_dirty(inode);
  95. err = nilfs_add_nondir(dentry, inode);
  96. }
  97. if (!err)
  98. err = nilfs_transaction_commit(dir->i_sb);
  99. else
  100. nilfs_transaction_abort(dir->i_sb);
  101. return err;
  102. }
  103. static int
  104. nilfs_mknod(struct inode *dir, struct dentry *dentry, umode_t mode, dev_t rdev)
  105. {
  106. struct inode *inode;
  107. struct nilfs_transaction_info ti;
  108. int err;
  109. if (!new_valid_dev(rdev))
  110. return -EINVAL;
  111. err = nilfs_transaction_begin(dir->i_sb, &ti, 1);
  112. if (err)
  113. return err;
  114. inode = nilfs_new_inode(dir, mode);
  115. err = PTR_ERR(inode);
  116. if (!IS_ERR(inode)) {
  117. init_special_inode(inode, inode->i_mode, rdev);
  118. nilfs_mark_inode_dirty(inode);
  119. err = nilfs_add_nondir(dentry, inode);
  120. }
  121. if (!err)
  122. err = nilfs_transaction_commit(dir->i_sb);
  123. else
  124. nilfs_transaction_abort(dir->i_sb);
  125. return err;
  126. }
  127. static int nilfs_symlink(struct inode *dir, struct dentry *dentry,
  128. const char *symname)
  129. {
  130. struct nilfs_transaction_info ti;
  131. struct super_block *sb = dir->i_sb;
  132. unsigned l = strlen(symname)+1;
  133. struct inode *inode;
  134. int err;
  135. if (l > sb->s_blocksize)
  136. return -ENAMETOOLONG;
  137. err = nilfs_transaction_begin(dir->i_sb, &ti, 1);
  138. if (err)
  139. return err;
  140. inode = nilfs_new_inode(dir, S_IFLNK | S_IRWXUGO);
  141. err = PTR_ERR(inode);
  142. if (IS_ERR(inode))
  143. goto out;
  144. /* slow symlink */
  145. inode->i_op = &nilfs_symlink_inode_operations;
  146. inode->i_mapping->a_ops = &nilfs_aops;
  147. err = page_symlink(inode, symname, l);
  148. if (err)
  149. goto out_fail;
  150. /* mark_inode_dirty(inode); */
  151. /* page_symlink() do this */
  152. err = nilfs_add_nondir(dentry, inode);
  153. out:
  154. if (!err)
  155. err = nilfs_transaction_commit(dir->i_sb);
  156. else
  157. nilfs_transaction_abort(dir->i_sb);
  158. return err;
  159. out_fail:
  160. drop_nlink(inode);
  161. nilfs_mark_inode_dirty(inode);
  162. iput(inode);
  163. goto out;
  164. }
  165. static int nilfs_link(struct dentry *old_dentry, struct inode *dir,
  166. struct dentry *dentry)
  167. {
  168. struct inode *inode = old_dentry->d_inode;
  169. struct nilfs_transaction_info ti;
  170. int err;
  171. err = nilfs_transaction_begin(dir->i_sb, &ti, 1);
  172. if (err)
  173. return err;
  174. inode->i_ctime = CURRENT_TIME;
  175. inode_inc_link_count(inode);
  176. ihold(inode);
  177. err = nilfs_add_nondir(dentry, inode);
  178. if (!err)
  179. err = nilfs_transaction_commit(dir->i_sb);
  180. else
  181. nilfs_transaction_abort(dir->i_sb);
  182. return err;
  183. }
  184. static int nilfs_mkdir(struct inode *dir, struct dentry *dentry, umode_t mode)
  185. {
  186. struct inode *inode;
  187. struct nilfs_transaction_info ti;
  188. int err;
  189. err = nilfs_transaction_begin(dir->i_sb, &ti, 1);
  190. if (err)
  191. return err;
  192. inc_nlink(dir);
  193. inode = nilfs_new_inode(dir, S_IFDIR | mode);
  194. err = PTR_ERR(inode);
  195. if (IS_ERR(inode))
  196. goto out_dir;
  197. inode->i_op = &nilfs_dir_inode_operations;
  198. inode->i_fop = &nilfs_dir_operations;
  199. inode->i_mapping->a_ops = &nilfs_aops;
  200. inc_nlink(inode);
  201. err = nilfs_make_empty(inode, dir);
  202. if (err)
  203. goto out_fail;
  204. err = nilfs_add_link(dentry, inode);
  205. if (err)
  206. goto out_fail;
  207. nilfs_mark_inode_dirty(inode);
  208. d_instantiate(dentry, inode);
  209. out:
  210. if (!err)
  211. err = nilfs_transaction_commit(dir->i_sb);
  212. else
  213. nilfs_transaction_abort(dir->i_sb);
  214. return err;
  215. out_fail:
  216. drop_nlink(inode);
  217. drop_nlink(inode);
  218. nilfs_mark_inode_dirty(inode);
  219. iput(inode);
  220. out_dir:
  221. drop_nlink(dir);
  222. nilfs_mark_inode_dirty(dir);
  223. goto out;
  224. }
  225. static int nilfs_do_unlink(struct inode *dir, struct dentry *dentry)
  226. {
  227. struct inode *inode;
  228. struct nilfs_dir_entry *de;
  229. struct page *page;
  230. int err;
  231. err = -ENOENT;
  232. de = nilfs_find_entry(dir, &dentry->d_name, &page);
  233. if (!de)
  234. goto out;
  235. inode = dentry->d_inode;
  236. err = -EIO;
  237. if (le64_to_cpu(de->inode) != inode->i_ino)
  238. goto out;
  239. if (!inode->i_nlink) {
  240. nilfs_warning(inode->i_sb, __func__,
  241. "deleting nonexistent file (%lu), %d\n",
  242. inode->i_ino, inode->i_nlink);
  243. set_nlink(inode, 1);
  244. }
  245. err = nilfs_delete_entry(de, page);
  246. if (err)
  247. goto out;
  248. inode->i_ctime = dir->i_ctime;
  249. drop_nlink(inode);
  250. err = 0;
  251. out:
  252. return err;
  253. }
  254. static int nilfs_unlink(struct inode *dir, struct dentry *dentry)
  255. {
  256. struct nilfs_transaction_info ti;
  257. int err;
  258. err = nilfs_transaction_begin(dir->i_sb, &ti, 0);
  259. if (err)
  260. return err;
  261. err = nilfs_do_unlink(dir, dentry);
  262. if (!err) {
  263. nilfs_mark_inode_dirty(dir);
  264. nilfs_mark_inode_dirty(dentry->d_inode);
  265. err = nilfs_transaction_commit(dir->i_sb);
  266. } else
  267. nilfs_transaction_abort(dir->i_sb);
  268. return err;
  269. }
  270. static int nilfs_rmdir(struct inode *dir, struct dentry *dentry)
  271. {
  272. struct inode *inode = dentry->d_inode;
  273. struct nilfs_transaction_info ti;
  274. int err;
  275. err = nilfs_transaction_begin(dir->i_sb, &ti, 0);
  276. if (err)
  277. return err;
  278. err = -ENOTEMPTY;
  279. if (nilfs_empty_dir(inode)) {
  280. err = nilfs_do_unlink(dir, dentry);
  281. if (!err) {
  282. inode->i_size = 0;
  283. drop_nlink(inode);
  284. nilfs_mark_inode_dirty(inode);
  285. drop_nlink(dir);
  286. nilfs_mark_inode_dirty(dir);
  287. }
  288. }
  289. if (!err)
  290. err = nilfs_transaction_commit(dir->i_sb);
  291. else
  292. nilfs_transaction_abort(dir->i_sb);
  293. return err;
  294. }
  295. static int nilfs_rename(struct inode *old_dir, struct dentry *old_dentry,
  296. struct inode *new_dir, struct dentry *new_dentry)
  297. {
  298. struct inode *old_inode = old_dentry->d_inode;
  299. struct inode *new_inode = new_dentry->d_inode;
  300. struct page *dir_page = NULL;
  301. struct nilfs_dir_entry *dir_de = NULL;
  302. struct page *old_page;
  303. struct nilfs_dir_entry *old_de;
  304. struct nilfs_transaction_info ti;
  305. int err;
  306. err = nilfs_transaction_begin(old_dir->i_sb, &ti, 1);
  307. if (unlikely(err))
  308. return err;
  309. err = -ENOENT;
  310. old_de = nilfs_find_entry(old_dir, &old_dentry->d_name, &old_page);
  311. if (!old_de)
  312. goto out;
  313. if (S_ISDIR(old_inode->i_mode)) {
  314. err = -EIO;
  315. dir_de = nilfs_dotdot(old_inode, &dir_page);
  316. if (!dir_de)
  317. goto out_old;
  318. }
  319. if (new_inode) {
  320. struct page *new_page;
  321. struct nilfs_dir_entry *new_de;
  322. err = -ENOTEMPTY;
  323. if (dir_de && !nilfs_empty_dir(new_inode))
  324. goto out_dir;
  325. err = -ENOENT;
  326. new_de = nilfs_find_entry(new_dir, &new_dentry->d_name, &new_page);
  327. if (!new_de)
  328. goto out_dir;
  329. nilfs_set_link(new_dir, new_de, new_page, old_inode);
  330. nilfs_mark_inode_dirty(new_dir);
  331. new_inode->i_ctime = CURRENT_TIME;
  332. if (dir_de)
  333. drop_nlink(new_inode);
  334. drop_nlink(new_inode);
  335. nilfs_mark_inode_dirty(new_inode);
  336. } else {
  337. err = nilfs_add_link(new_dentry, old_inode);
  338. if (err)
  339. goto out_dir;
  340. if (dir_de) {
  341. inc_nlink(new_dir);
  342. nilfs_mark_inode_dirty(new_dir);
  343. }
  344. }
  345. /*
  346. * Like most other Unix systems, set the ctime for inodes on a
  347. * rename.
  348. */
  349. old_inode->i_ctime = CURRENT_TIME;
  350. nilfs_delete_entry(old_de, old_page);
  351. if (dir_de) {
  352. nilfs_set_link(old_inode, dir_de, dir_page, new_dir);
  353. drop_nlink(old_dir);
  354. }
  355. nilfs_mark_inode_dirty(old_dir);
  356. nilfs_mark_inode_dirty(old_inode);
  357. err = nilfs_transaction_commit(old_dir->i_sb);
  358. return err;
  359. out_dir:
  360. if (dir_de) {
  361. kunmap(dir_page);
  362. page_cache_release(dir_page);
  363. }
  364. out_old:
  365. kunmap(old_page);
  366. page_cache_release(old_page);
  367. out:
  368. nilfs_transaction_abort(old_dir->i_sb);
  369. return err;
  370. }
  371. /*
  372. * Export operations
  373. */
  374. static struct dentry *nilfs_get_parent(struct dentry *child)
  375. {
  376. unsigned long ino;
  377. struct inode *inode;
  378. struct qstr dotdot = {.name = "..", .len = 2};
  379. struct nilfs_root *root;
  380. ino = nilfs_inode_by_name(child->d_inode, &dotdot);
  381. if (!ino)
  382. return ERR_PTR(-ENOENT);
  383. root = NILFS_I(child->d_inode)->i_root;
  384. inode = nilfs_iget(child->d_inode->i_sb, root, ino);
  385. if (IS_ERR(inode))
  386. return ERR_CAST(inode);
  387. return d_obtain_alias(inode);
  388. }
  389. static struct dentry *nilfs_get_dentry(struct super_block *sb, u64 cno,
  390. u64 ino, u32 gen)
  391. {
  392. struct nilfs_root *root;
  393. struct inode *inode;
  394. if (ino < NILFS_FIRST_INO(sb) && ino != NILFS_ROOT_INO)
  395. return ERR_PTR(-ESTALE);
  396. root = nilfs_lookup_root(sb->s_fs_info, cno);
  397. if (!root)
  398. return ERR_PTR(-ESTALE);
  399. inode = nilfs_iget(sb, root, ino);
  400. nilfs_put_root(root);
  401. if (IS_ERR(inode))
  402. return ERR_CAST(inode);
  403. if (gen && inode->i_generation != gen) {
  404. iput(inode);
  405. return ERR_PTR(-ESTALE);
  406. }
  407. return d_obtain_alias(inode);
  408. }
  409. static struct dentry *nilfs_fh_to_dentry(struct super_block *sb, struct fid *fh,
  410. int fh_len, int fh_type)
  411. {
  412. struct nilfs_fid *fid = (struct nilfs_fid *)fh;
  413. if ((fh_len != NILFS_FID_SIZE_NON_CONNECTABLE &&
  414. fh_len != NILFS_FID_SIZE_CONNECTABLE) ||
  415. (fh_type != FILEID_NILFS_WITH_PARENT &&
  416. fh_type != FILEID_NILFS_WITHOUT_PARENT))
  417. return NULL;
  418. return nilfs_get_dentry(sb, fid->cno, fid->ino, fid->gen);
  419. }
  420. static struct dentry *nilfs_fh_to_parent(struct super_block *sb, struct fid *fh,
  421. int fh_len, int fh_type)
  422. {
  423. struct nilfs_fid *fid = (struct nilfs_fid *)fh;
  424. if (fh_len != NILFS_FID_SIZE_CONNECTABLE ||
  425. fh_type != FILEID_NILFS_WITH_PARENT)
  426. return NULL;
  427. return nilfs_get_dentry(sb, fid->cno, fid->parent_ino, fid->parent_gen);
  428. }
  429. static int nilfs_encode_fh(struct dentry *dentry, __u32 *fh, int *lenp,
  430. int connectable)
  431. {
  432. struct nilfs_fid *fid = (struct nilfs_fid *)fh;
  433. struct inode *inode = dentry->d_inode;
  434. struct nilfs_root *root = NILFS_I(inode)->i_root;
  435. int type;
  436. if (*lenp < NILFS_FID_SIZE_NON_CONNECTABLE ||
  437. (connectable && *lenp < NILFS_FID_SIZE_CONNECTABLE))
  438. return 255;
  439. fid->cno = root->cno;
  440. fid->ino = inode->i_ino;
  441. fid->gen = inode->i_generation;
  442. if (connectable && !S_ISDIR(inode->i_mode)) {
  443. struct inode *parent;
  444. spin_lock(&dentry->d_lock);
  445. parent = dentry->d_parent->d_inode;
  446. fid->parent_ino = parent->i_ino;
  447. fid->parent_gen = parent->i_generation;
  448. spin_unlock(&dentry->d_lock);
  449. type = FILEID_NILFS_WITH_PARENT;
  450. *lenp = NILFS_FID_SIZE_CONNECTABLE;
  451. } else {
  452. type = FILEID_NILFS_WITHOUT_PARENT;
  453. *lenp = NILFS_FID_SIZE_NON_CONNECTABLE;
  454. }
  455. return type;
  456. }
  457. const struct inode_operations nilfs_dir_inode_operations = {
  458. .create = nilfs_create,
  459. .lookup = nilfs_lookup,
  460. .link = nilfs_link,
  461. .unlink = nilfs_unlink,
  462. .symlink = nilfs_symlink,
  463. .mkdir = nilfs_mkdir,
  464. .rmdir = nilfs_rmdir,
  465. .mknod = nilfs_mknod,
  466. .rename = nilfs_rename,
  467. .setattr = nilfs_setattr,
  468. .permission = nilfs_permission,
  469. .fiemap = nilfs_fiemap,
  470. };
  471. const struct inode_operations nilfs_special_inode_operations = {
  472. .setattr = nilfs_setattr,
  473. .permission = nilfs_permission,
  474. };
  475. const struct inode_operations nilfs_symlink_inode_operations = {
  476. .readlink = generic_readlink,
  477. .follow_link = page_follow_link_light,
  478. .put_link = page_put_link,
  479. .permission = nilfs_permission,
  480. };
  481. const struct export_operations nilfs_export_ops = {
  482. .encode_fh = nilfs_encode_fh,
  483. .fh_to_dentry = nilfs_fh_to_dentry,
  484. .fh_to_parent = nilfs_fh_to_parent,
  485. .get_parent = nilfs_get_parent,
  486. };