namei.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589
  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, int 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, int 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. if (inode->i_nlink >= NILFS_LINK_MAX)
  172. return -EMLINK;
  173. err = nilfs_transaction_begin(dir->i_sb, &ti, 1);
  174. if (err)
  175. return err;
  176. inode->i_ctime = CURRENT_TIME;
  177. inode_inc_link_count(inode);
  178. ihold(inode);
  179. err = nilfs_add_nondir(dentry, inode);
  180. if (!err)
  181. err = nilfs_transaction_commit(dir->i_sb);
  182. else
  183. nilfs_transaction_abort(dir->i_sb);
  184. return err;
  185. }
  186. static int nilfs_mkdir(struct inode *dir, struct dentry *dentry, int mode)
  187. {
  188. struct inode *inode;
  189. struct nilfs_transaction_info ti;
  190. int err;
  191. if (dir->i_nlink >= NILFS_LINK_MAX)
  192. return -EMLINK;
  193. err = nilfs_transaction_begin(dir->i_sb, &ti, 1);
  194. if (err)
  195. return err;
  196. inc_nlink(dir);
  197. inode = nilfs_new_inode(dir, S_IFDIR | mode);
  198. err = PTR_ERR(inode);
  199. if (IS_ERR(inode))
  200. goto out_dir;
  201. inode->i_op = &nilfs_dir_inode_operations;
  202. inode->i_fop = &nilfs_dir_operations;
  203. inode->i_mapping->a_ops = &nilfs_aops;
  204. inc_nlink(inode);
  205. err = nilfs_make_empty(inode, dir);
  206. if (err)
  207. goto out_fail;
  208. err = nilfs_add_link(dentry, inode);
  209. if (err)
  210. goto out_fail;
  211. nilfs_mark_inode_dirty(inode);
  212. d_instantiate(dentry, inode);
  213. out:
  214. if (!err)
  215. err = nilfs_transaction_commit(dir->i_sb);
  216. else
  217. nilfs_transaction_abort(dir->i_sb);
  218. return err;
  219. out_fail:
  220. drop_nlink(inode);
  221. drop_nlink(inode);
  222. nilfs_mark_inode_dirty(inode);
  223. iput(inode);
  224. out_dir:
  225. drop_nlink(dir);
  226. nilfs_mark_inode_dirty(dir);
  227. goto out;
  228. }
  229. static int nilfs_do_unlink(struct inode *dir, struct dentry *dentry)
  230. {
  231. struct inode *inode;
  232. struct nilfs_dir_entry *de;
  233. struct page *page;
  234. int err;
  235. err = -ENOENT;
  236. de = nilfs_find_entry(dir, &dentry->d_name, &page);
  237. if (!de)
  238. goto out;
  239. inode = dentry->d_inode;
  240. err = -EIO;
  241. if (le64_to_cpu(de->inode) != inode->i_ino)
  242. goto out;
  243. if (!inode->i_nlink) {
  244. nilfs_warning(inode->i_sb, __func__,
  245. "deleting nonexistent file (%lu), %d\n",
  246. inode->i_ino, inode->i_nlink);
  247. set_nlink(inode, 1);
  248. }
  249. err = nilfs_delete_entry(de, page);
  250. if (err)
  251. goto out;
  252. inode->i_ctime = dir->i_ctime;
  253. drop_nlink(inode);
  254. err = 0;
  255. out:
  256. return err;
  257. }
  258. static int nilfs_unlink(struct inode *dir, struct dentry *dentry)
  259. {
  260. struct nilfs_transaction_info ti;
  261. int err;
  262. err = nilfs_transaction_begin(dir->i_sb, &ti, 0);
  263. if (err)
  264. return err;
  265. err = nilfs_do_unlink(dir, dentry);
  266. if (!err) {
  267. nilfs_mark_inode_dirty(dir);
  268. nilfs_mark_inode_dirty(dentry->d_inode);
  269. err = nilfs_transaction_commit(dir->i_sb);
  270. } else
  271. nilfs_transaction_abort(dir->i_sb);
  272. return err;
  273. }
  274. static int nilfs_rmdir(struct inode *dir, struct dentry *dentry)
  275. {
  276. struct inode *inode = dentry->d_inode;
  277. struct nilfs_transaction_info ti;
  278. int err;
  279. err = nilfs_transaction_begin(dir->i_sb, &ti, 0);
  280. if (err)
  281. return err;
  282. err = -ENOTEMPTY;
  283. if (nilfs_empty_dir(inode)) {
  284. err = nilfs_do_unlink(dir, dentry);
  285. if (!err) {
  286. inode->i_size = 0;
  287. drop_nlink(inode);
  288. nilfs_mark_inode_dirty(inode);
  289. drop_nlink(dir);
  290. nilfs_mark_inode_dirty(dir);
  291. }
  292. }
  293. if (!err)
  294. err = nilfs_transaction_commit(dir->i_sb);
  295. else
  296. nilfs_transaction_abort(dir->i_sb);
  297. return err;
  298. }
  299. static int nilfs_rename(struct inode *old_dir, struct dentry *old_dentry,
  300. struct inode *new_dir, struct dentry *new_dentry)
  301. {
  302. struct inode *old_inode = old_dentry->d_inode;
  303. struct inode *new_inode = new_dentry->d_inode;
  304. struct page *dir_page = NULL;
  305. struct nilfs_dir_entry *dir_de = NULL;
  306. struct page *old_page;
  307. struct nilfs_dir_entry *old_de;
  308. struct nilfs_transaction_info ti;
  309. int err;
  310. err = nilfs_transaction_begin(old_dir->i_sb, &ti, 1);
  311. if (unlikely(err))
  312. return err;
  313. err = -ENOENT;
  314. old_de = nilfs_find_entry(old_dir, &old_dentry->d_name, &old_page);
  315. if (!old_de)
  316. goto out;
  317. if (S_ISDIR(old_inode->i_mode)) {
  318. err = -EIO;
  319. dir_de = nilfs_dotdot(old_inode, &dir_page);
  320. if (!dir_de)
  321. goto out_old;
  322. }
  323. if (new_inode) {
  324. struct page *new_page;
  325. struct nilfs_dir_entry *new_de;
  326. err = -ENOTEMPTY;
  327. if (dir_de && !nilfs_empty_dir(new_inode))
  328. goto out_dir;
  329. err = -ENOENT;
  330. new_de = nilfs_find_entry(new_dir, &new_dentry->d_name, &new_page);
  331. if (!new_de)
  332. goto out_dir;
  333. nilfs_set_link(new_dir, new_de, new_page, old_inode);
  334. nilfs_mark_inode_dirty(new_dir);
  335. new_inode->i_ctime = CURRENT_TIME;
  336. if (dir_de)
  337. drop_nlink(new_inode);
  338. drop_nlink(new_inode);
  339. nilfs_mark_inode_dirty(new_inode);
  340. } else {
  341. if (dir_de) {
  342. err = -EMLINK;
  343. if (new_dir->i_nlink >= NILFS_LINK_MAX)
  344. goto out_dir;
  345. }
  346. err = nilfs_add_link(new_dentry, old_inode);
  347. if (err)
  348. goto out_dir;
  349. if (dir_de) {
  350. inc_nlink(new_dir);
  351. nilfs_mark_inode_dirty(new_dir);
  352. }
  353. }
  354. /*
  355. * Like most other Unix systems, set the ctime for inodes on a
  356. * rename.
  357. */
  358. old_inode->i_ctime = CURRENT_TIME;
  359. nilfs_delete_entry(old_de, old_page);
  360. if (dir_de) {
  361. nilfs_set_link(old_inode, dir_de, dir_page, new_dir);
  362. drop_nlink(old_dir);
  363. }
  364. nilfs_mark_inode_dirty(old_dir);
  365. nilfs_mark_inode_dirty(old_inode);
  366. err = nilfs_transaction_commit(old_dir->i_sb);
  367. return err;
  368. out_dir:
  369. if (dir_de) {
  370. kunmap(dir_page);
  371. page_cache_release(dir_page);
  372. }
  373. out_old:
  374. kunmap(old_page);
  375. page_cache_release(old_page);
  376. out:
  377. nilfs_transaction_abort(old_dir->i_sb);
  378. return err;
  379. }
  380. /*
  381. * Export operations
  382. */
  383. static struct dentry *nilfs_get_parent(struct dentry *child)
  384. {
  385. unsigned long ino;
  386. struct inode *inode;
  387. struct qstr dotdot = {.name = "..", .len = 2};
  388. struct nilfs_root *root;
  389. ino = nilfs_inode_by_name(child->d_inode, &dotdot);
  390. if (!ino)
  391. return ERR_PTR(-ENOENT);
  392. root = NILFS_I(child->d_inode)->i_root;
  393. inode = nilfs_iget(child->d_inode->i_sb, root, ino);
  394. if (IS_ERR(inode))
  395. return ERR_CAST(inode);
  396. return d_obtain_alias(inode);
  397. }
  398. static struct dentry *nilfs_get_dentry(struct super_block *sb, u64 cno,
  399. u64 ino, u32 gen)
  400. {
  401. struct nilfs_root *root;
  402. struct inode *inode;
  403. if (ino < NILFS_FIRST_INO(sb) && ino != NILFS_ROOT_INO)
  404. return ERR_PTR(-ESTALE);
  405. root = nilfs_lookup_root(sb->s_fs_info, cno);
  406. if (!root)
  407. return ERR_PTR(-ESTALE);
  408. inode = nilfs_iget(sb, root, ino);
  409. nilfs_put_root(root);
  410. if (IS_ERR(inode))
  411. return ERR_CAST(inode);
  412. if (gen && inode->i_generation != gen) {
  413. iput(inode);
  414. return ERR_PTR(-ESTALE);
  415. }
  416. return d_obtain_alias(inode);
  417. }
  418. static struct dentry *nilfs_fh_to_dentry(struct super_block *sb, struct fid *fh,
  419. int fh_len, int fh_type)
  420. {
  421. struct nilfs_fid *fid = (struct nilfs_fid *)fh;
  422. if ((fh_len != NILFS_FID_SIZE_NON_CONNECTABLE &&
  423. fh_len != NILFS_FID_SIZE_CONNECTABLE) ||
  424. (fh_type != FILEID_NILFS_WITH_PARENT &&
  425. fh_type != FILEID_NILFS_WITHOUT_PARENT))
  426. return NULL;
  427. return nilfs_get_dentry(sb, fid->cno, fid->ino, fid->gen);
  428. }
  429. static struct dentry *nilfs_fh_to_parent(struct super_block *sb, struct fid *fh,
  430. int fh_len, int fh_type)
  431. {
  432. struct nilfs_fid *fid = (struct nilfs_fid *)fh;
  433. if (fh_len != NILFS_FID_SIZE_CONNECTABLE ||
  434. fh_type != FILEID_NILFS_WITH_PARENT)
  435. return NULL;
  436. return nilfs_get_dentry(sb, fid->cno, fid->parent_ino, fid->parent_gen);
  437. }
  438. static int nilfs_encode_fh(struct dentry *dentry, __u32 *fh, int *lenp,
  439. int connectable)
  440. {
  441. struct nilfs_fid *fid = (struct nilfs_fid *)fh;
  442. struct inode *inode = dentry->d_inode;
  443. struct nilfs_root *root = NILFS_I(inode)->i_root;
  444. int type;
  445. if (*lenp < NILFS_FID_SIZE_NON_CONNECTABLE ||
  446. (connectable && *lenp < NILFS_FID_SIZE_CONNECTABLE))
  447. return 255;
  448. fid->cno = root->cno;
  449. fid->ino = inode->i_ino;
  450. fid->gen = inode->i_generation;
  451. if (connectable && !S_ISDIR(inode->i_mode)) {
  452. struct inode *parent;
  453. spin_lock(&dentry->d_lock);
  454. parent = dentry->d_parent->d_inode;
  455. fid->parent_ino = parent->i_ino;
  456. fid->parent_gen = parent->i_generation;
  457. spin_unlock(&dentry->d_lock);
  458. type = FILEID_NILFS_WITH_PARENT;
  459. *lenp = NILFS_FID_SIZE_CONNECTABLE;
  460. } else {
  461. type = FILEID_NILFS_WITHOUT_PARENT;
  462. *lenp = NILFS_FID_SIZE_NON_CONNECTABLE;
  463. }
  464. return type;
  465. }
  466. const struct inode_operations nilfs_dir_inode_operations = {
  467. .create = nilfs_create,
  468. .lookup = nilfs_lookup,
  469. .link = nilfs_link,
  470. .unlink = nilfs_unlink,
  471. .symlink = nilfs_symlink,
  472. .mkdir = nilfs_mkdir,
  473. .rmdir = nilfs_rmdir,
  474. .mknod = nilfs_mknod,
  475. .rename = nilfs_rename,
  476. .setattr = nilfs_setattr,
  477. .permission = nilfs_permission,
  478. .fiemap = nilfs_fiemap,
  479. };
  480. const struct inode_operations nilfs_special_inode_operations = {
  481. .setattr = nilfs_setattr,
  482. .permission = nilfs_permission,
  483. };
  484. const struct inode_operations nilfs_symlink_inode_operations = {
  485. .readlink = generic_readlink,
  486. .follow_link = page_follow_link_light,
  487. .put_link = page_put_link,
  488. .permission = nilfs_permission,
  489. };
  490. const struct export_operations nilfs_export_ops = {
  491. .encode_fh = nilfs_encode_fh,
  492. .fh_to_dentry = nilfs_fh_to_dentry,
  493. .fh_to_parent = nilfs_fh_to_parent,
  494. .get_parent = nilfs_get_parent,
  495. };