namei.c 13 KB

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