namei.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585
  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. unlock_new_inode(inode);
  52. return 0;
  53. }
  54. inode_dec_link_count(inode);
  55. unlock_new_inode(inode);
  56. iput(inode);
  57. return err;
  58. }
  59. /*
  60. * Methods themselves.
  61. */
  62. static struct dentry *
  63. nilfs_lookup(struct inode *dir, struct dentry *dentry, unsigned int flags)
  64. {
  65. struct inode *inode;
  66. ino_t ino;
  67. if (dentry->d_name.len > NILFS_NAME_LEN)
  68. return ERR_PTR(-ENAMETOOLONG);
  69. ino = nilfs_inode_by_name(dir, &dentry->d_name);
  70. inode = ino ? nilfs_iget(dir->i_sb, NILFS_I(dir)->i_root, ino) : NULL;
  71. return d_splice_alias(inode, dentry);
  72. }
  73. /*
  74. * By the time this is called, we already have created
  75. * the directory cache entry for the new file, but it
  76. * is so far negative - it has no inode.
  77. *
  78. * If the create succeeds, we fill in the inode information
  79. * with d_instantiate().
  80. */
  81. static int nilfs_create(struct inode *dir, struct dentry *dentry, umode_t mode,
  82. bool excl)
  83. {
  84. struct inode *inode;
  85. struct nilfs_transaction_info ti;
  86. int err;
  87. err = nilfs_transaction_begin(dir->i_sb, &ti, 1);
  88. if (err)
  89. return err;
  90. inode = nilfs_new_inode(dir, mode);
  91. err = PTR_ERR(inode);
  92. if (!IS_ERR(inode)) {
  93. inode->i_op = &nilfs_file_inode_operations;
  94. inode->i_fop = &nilfs_file_operations;
  95. inode->i_mapping->a_ops = &nilfs_aops;
  96. nilfs_mark_inode_dirty(inode);
  97. err = nilfs_add_nondir(dentry, inode);
  98. }
  99. if (!err)
  100. err = nilfs_transaction_commit(dir->i_sb);
  101. else
  102. nilfs_transaction_abort(dir->i_sb);
  103. return err;
  104. }
  105. static int
  106. nilfs_mknod(struct inode *dir, struct dentry *dentry, umode_t mode, dev_t rdev)
  107. {
  108. struct inode *inode;
  109. struct nilfs_transaction_info ti;
  110. int err;
  111. if (!new_valid_dev(rdev))
  112. return -EINVAL;
  113. err = nilfs_transaction_begin(dir->i_sb, &ti, 1);
  114. if (err)
  115. return err;
  116. inode = nilfs_new_inode(dir, mode);
  117. err = PTR_ERR(inode);
  118. if (!IS_ERR(inode)) {
  119. init_special_inode(inode, inode->i_mode, rdev);
  120. nilfs_mark_inode_dirty(inode);
  121. err = nilfs_add_nondir(dentry, inode);
  122. }
  123. if (!err)
  124. err = nilfs_transaction_commit(dir->i_sb);
  125. else
  126. nilfs_transaction_abort(dir->i_sb);
  127. return err;
  128. }
  129. static int nilfs_symlink(struct inode *dir, struct dentry *dentry,
  130. const char *symname)
  131. {
  132. struct nilfs_transaction_info ti;
  133. struct super_block *sb = dir->i_sb;
  134. unsigned l = strlen(symname)+1;
  135. struct inode *inode;
  136. int err;
  137. if (l > sb->s_blocksize)
  138. return -ENAMETOOLONG;
  139. err = nilfs_transaction_begin(dir->i_sb, &ti, 1);
  140. if (err)
  141. return err;
  142. inode = nilfs_new_inode(dir, S_IFLNK | S_IRWXUGO);
  143. err = PTR_ERR(inode);
  144. if (IS_ERR(inode))
  145. goto out;
  146. /* slow symlink */
  147. inode->i_op = &nilfs_symlink_inode_operations;
  148. inode->i_mapping->a_ops = &nilfs_aops;
  149. err = page_symlink(inode, symname, l);
  150. if (err)
  151. goto out_fail;
  152. /* mark_inode_dirty(inode); */
  153. /* page_symlink() do this */
  154. err = nilfs_add_nondir(dentry, inode);
  155. out:
  156. if (!err)
  157. err = nilfs_transaction_commit(dir->i_sb);
  158. else
  159. nilfs_transaction_abort(dir->i_sb);
  160. return err;
  161. out_fail:
  162. drop_nlink(inode);
  163. nilfs_mark_inode_dirty(inode);
  164. unlock_new_inode(inode);
  165. iput(inode);
  166. goto out;
  167. }
  168. static int nilfs_link(struct dentry *old_dentry, struct inode *dir,
  169. struct dentry *dentry)
  170. {
  171. struct inode *inode = d_inode(old_dentry);
  172. struct nilfs_transaction_info ti;
  173. int err;
  174. err = nilfs_transaction_begin(dir->i_sb, &ti, 1);
  175. if (err)
  176. return err;
  177. inode->i_ctime = CURRENT_TIME;
  178. inode_inc_link_count(inode);
  179. ihold(inode);
  180. err = nilfs_add_link(dentry, inode);
  181. if (!err) {
  182. d_instantiate(dentry, inode);
  183. err = nilfs_transaction_commit(dir->i_sb);
  184. } else {
  185. inode_dec_link_count(inode);
  186. iput(inode);
  187. nilfs_transaction_abort(dir->i_sb);
  188. }
  189. return err;
  190. }
  191. static int nilfs_mkdir(struct inode *dir, struct dentry *dentry, umode_t mode)
  192. {
  193. struct inode *inode;
  194. struct nilfs_transaction_info ti;
  195. int err;
  196. err = nilfs_transaction_begin(dir->i_sb, &ti, 1);
  197. if (err)
  198. return err;
  199. inc_nlink(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. inc_nlink(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. nilfs_mark_inode_dirty(inode);
  215. d_instantiate(dentry, inode);
  216. unlock_new_inode(inode);
  217. out:
  218. if (!err)
  219. err = nilfs_transaction_commit(dir->i_sb);
  220. else
  221. nilfs_transaction_abort(dir->i_sb);
  222. return err;
  223. out_fail:
  224. drop_nlink(inode);
  225. drop_nlink(inode);
  226. nilfs_mark_inode_dirty(inode);
  227. unlock_new_inode(inode);
  228. iput(inode);
  229. out_dir:
  230. drop_nlink(dir);
  231. nilfs_mark_inode_dirty(dir);
  232. goto out;
  233. }
  234. static int nilfs_do_unlink(struct inode *dir, struct dentry *dentry)
  235. {
  236. struct inode *inode;
  237. struct nilfs_dir_entry *de;
  238. struct page *page;
  239. int err;
  240. err = -ENOENT;
  241. de = nilfs_find_entry(dir, &dentry->d_name, &page);
  242. if (!de)
  243. goto out;
  244. inode = d_inode(dentry);
  245. err = -EIO;
  246. if (le64_to_cpu(de->inode) != inode->i_ino)
  247. goto out;
  248. if (!inode->i_nlink) {
  249. nilfs_warning(inode->i_sb, __func__,
  250. "deleting nonexistent file (%lu), %d\n",
  251. inode->i_ino, inode->i_nlink);
  252. set_nlink(inode, 1);
  253. }
  254. err = nilfs_delete_entry(de, page);
  255. if (err)
  256. goto out;
  257. inode->i_ctime = dir->i_ctime;
  258. drop_nlink(inode);
  259. err = 0;
  260. out:
  261. return err;
  262. }
  263. static int nilfs_unlink(struct inode *dir, struct dentry *dentry)
  264. {
  265. struct nilfs_transaction_info ti;
  266. int err;
  267. err = nilfs_transaction_begin(dir->i_sb, &ti, 0);
  268. if (err)
  269. return err;
  270. err = nilfs_do_unlink(dir, dentry);
  271. if (!err) {
  272. nilfs_mark_inode_dirty(dir);
  273. nilfs_mark_inode_dirty(d_inode(dentry));
  274. err = nilfs_transaction_commit(dir->i_sb);
  275. } else
  276. nilfs_transaction_abort(dir->i_sb);
  277. return err;
  278. }
  279. static int nilfs_rmdir(struct inode *dir, struct dentry *dentry)
  280. {
  281. struct inode *inode = d_inode(dentry);
  282. struct nilfs_transaction_info ti;
  283. int err;
  284. err = nilfs_transaction_begin(dir->i_sb, &ti, 0);
  285. if (err)
  286. return err;
  287. err = -ENOTEMPTY;
  288. if (nilfs_empty_dir(inode)) {
  289. err = nilfs_do_unlink(dir, dentry);
  290. if (!err) {
  291. inode->i_size = 0;
  292. drop_nlink(inode);
  293. nilfs_mark_inode_dirty(inode);
  294. drop_nlink(dir);
  295. nilfs_mark_inode_dirty(dir);
  296. }
  297. }
  298. if (!err)
  299. err = nilfs_transaction_commit(dir->i_sb);
  300. else
  301. nilfs_transaction_abort(dir->i_sb);
  302. return err;
  303. }
  304. static int nilfs_rename(struct inode *old_dir, struct dentry *old_dentry,
  305. struct inode *new_dir, struct dentry *new_dentry)
  306. {
  307. struct inode *old_inode = d_inode(old_dentry);
  308. struct inode *new_inode = d_inode(new_dentry);
  309. struct page *dir_page = NULL;
  310. struct nilfs_dir_entry *dir_de = NULL;
  311. struct page *old_page;
  312. struct nilfs_dir_entry *old_de;
  313. struct nilfs_transaction_info ti;
  314. int err;
  315. err = nilfs_transaction_begin(old_dir->i_sb, &ti, 1);
  316. if (unlikely(err))
  317. return err;
  318. err = -ENOENT;
  319. old_de = nilfs_find_entry(old_dir, &old_dentry->d_name, &old_page);
  320. if (!old_de)
  321. goto out;
  322. if (S_ISDIR(old_inode->i_mode)) {
  323. err = -EIO;
  324. dir_de = nilfs_dotdot(old_inode, &dir_page);
  325. if (!dir_de)
  326. goto out_old;
  327. }
  328. if (new_inode) {
  329. struct page *new_page;
  330. struct nilfs_dir_entry *new_de;
  331. err = -ENOTEMPTY;
  332. if (dir_de && !nilfs_empty_dir(new_inode))
  333. goto out_dir;
  334. err = -ENOENT;
  335. new_de = nilfs_find_entry(new_dir, &new_dentry->d_name, &new_page);
  336. if (!new_de)
  337. goto out_dir;
  338. nilfs_set_link(new_dir, new_de, new_page, old_inode);
  339. nilfs_mark_inode_dirty(new_dir);
  340. new_inode->i_ctime = CURRENT_TIME;
  341. if (dir_de)
  342. drop_nlink(new_inode);
  343. drop_nlink(new_inode);
  344. nilfs_mark_inode_dirty(new_inode);
  345. } else {
  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 = QSTR_INIT("..", 2);
  388. struct nilfs_root *root;
  389. ino = nilfs_inode_by_name(d_inode(child), &dotdot);
  390. if (!ino)
  391. return ERR_PTR(-ENOENT);
  392. root = NILFS_I(d_inode(child))->i_root;
  393. inode = nilfs_iget(d_inode(child)->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 inode *inode, __u32 *fh, int *lenp,
  439. struct inode *parent)
  440. {
  441. struct nilfs_fid *fid = (struct nilfs_fid *)fh;
  442. struct nilfs_root *root = NILFS_I(inode)->i_root;
  443. int type;
  444. if (parent && *lenp < NILFS_FID_SIZE_CONNECTABLE) {
  445. *lenp = NILFS_FID_SIZE_CONNECTABLE;
  446. return FILEID_INVALID;
  447. }
  448. if (*lenp < NILFS_FID_SIZE_NON_CONNECTABLE) {
  449. *lenp = NILFS_FID_SIZE_NON_CONNECTABLE;
  450. return FILEID_INVALID;
  451. }
  452. fid->cno = root->cno;
  453. fid->ino = inode->i_ino;
  454. fid->gen = inode->i_generation;
  455. if (parent) {
  456. fid->parent_ino = parent->i_ino;
  457. fid->parent_gen = parent->i_generation;
  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. };