namei.c 13 KB

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