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