namei.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594
  1. // SPDX-License-Identifier: GPL-2.0+
  2. /*
  3. * NILFS pathname lookup operations.
  4. *
  5. * Copyright (C) 2005-2008 Nippon Telegraph and Telephone Corporation.
  6. *
  7. * Modified for NILFS by Amagai Yoshiji and Ryusuke Konishi.
  8. */
  9. /*
  10. * linux/fs/ext2/namei.c
  11. *
  12. * Copyright (C) 1992, 1993, 1994, 1995
  13. * Remy Card (card@masi.ibp.fr)
  14. * Laboratoire MASI - Institut Blaise Pascal
  15. * Universite Pierre et Marie Curie (Paris VI)
  16. *
  17. * from
  18. *
  19. * linux/fs/minix/namei.c
  20. *
  21. * Copyright (C) 1991, 1992 Linus Torvalds
  22. *
  23. * Big-endian to little-endian byte-swapping/bitmaps by
  24. * David S. Miller (davem@caip.rutgers.edu), 1995
  25. */
  26. #include <linux/pagemap.h>
  27. #include "nilfs.h"
  28. #include "export.h"
  29. #define NILFS_FID_SIZE_NON_CONNECTABLE \
  30. (offsetof(struct nilfs_fid, parent_gen) / 4)
  31. #define NILFS_FID_SIZE_CONNECTABLE (sizeof(struct nilfs_fid) / 4)
  32. static inline int nilfs_add_nondir(struct dentry *dentry, struct inode *inode)
  33. {
  34. int err = nilfs_add_link(dentry, inode);
  35. if (!err) {
  36. d_instantiate_new(dentry, inode);
  37. return 0;
  38. }
  39. inode_dec_link_count(inode);
  40. unlock_new_inode(inode);
  41. iput(inode);
  42. return err;
  43. }
  44. /*
  45. * Methods themselves.
  46. */
  47. static struct dentry *
  48. nilfs_lookup(struct inode *dir, struct dentry *dentry, unsigned int flags)
  49. {
  50. struct inode *inode;
  51. ino_t ino;
  52. int res;
  53. if (dentry->d_name.len > NILFS_NAME_LEN)
  54. return ERR_PTR(-ENAMETOOLONG);
  55. res = nilfs_inode_by_name(dir, &dentry->d_name, &ino);
  56. if (res) {
  57. if (res != -ENOENT)
  58. return ERR_PTR(res);
  59. inode = NULL;
  60. } else {
  61. inode = nilfs_iget(dir->i_sb, NILFS_I(dir)->i_root, ino);
  62. if (inode == ERR_PTR(-ESTALE)) {
  63. nilfs_error(dir->i_sb,
  64. "deleted inode referenced: %lu", ino);
  65. return ERR_PTR(-EIO);
  66. }
  67. }
  68. return d_splice_alias(inode, dentry);
  69. }
  70. /*
  71. * By the time this is called, we already have created
  72. * the directory cache entry for the new file, but it
  73. * is so far negative - it has no inode.
  74. *
  75. * If the create succeeds, we fill in the inode information
  76. * with d_instantiate().
  77. */
  78. static int nilfs_create(struct mnt_idmap *idmap, struct inode *dir,
  79. struct dentry *dentry, umode_t mode, bool excl)
  80. {
  81. struct inode *inode;
  82. struct nilfs_transaction_info ti;
  83. int err;
  84. err = nilfs_transaction_begin(dir->i_sb, &ti, 1);
  85. if (err)
  86. return err;
  87. inode = nilfs_new_inode(dir, mode);
  88. err = PTR_ERR(inode);
  89. if (!IS_ERR(inode)) {
  90. inode->i_op = &nilfs_file_inode_operations;
  91. inode->i_fop = &nilfs_file_operations;
  92. inode->i_mapping->a_ops = &nilfs_aops;
  93. nilfs_mark_inode_dirty(inode);
  94. err = nilfs_add_nondir(dentry, inode);
  95. }
  96. if (!err)
  97. err = nilfs_transaction_commit(dir->i_sb);
  98. else
  99. nilfs_transaction_abort(dir->i_sb);
  100. return err;
  101. }
  102. static int
  103. nilfs_mknod(struct mnt_idmap *idmap, struct inode *dir,
  104. struct dentry *dentry, umode_t mode, dev_t rdev)
  105. {
  106. struct inode *inode;
  107. struct nilfs_transaction_info ti;
  108. int err;
  109. err = nilfs_transaction_begin(dir->i_sb, &ti, 1);
  110. if (err)
  111. return err;
  112. inode = nilfs_new_inode(dir, mode);
  113. err = PTR_ERR(inode);
  114. if (!IS_ERR(inode)) {
  115. init_special_inode(inode, inode->i_mode, rdev);
  116. nilfs_mark_inode_dirty(inode);
  117. err = nilfs_add_nondir(dentry, inode);
  118. }
  119. if (!err)
  120. err = nilfs_transaction_commit(dir->i_sb);
  121. else
  122. nilfs_transaction_abort(dir->i_sb);
  123. return err;
  124. }
  125. static int nilfs_symlink(struct mnt_idmap *idmap, struct inode *dir,
  126. struct dentry *dentry, const char *symname)
  127. {
  128. struct nilfs_transaction_info ti;
  129. struct super_block *sb = dir->i_sb;
  130. unsigned int l = strlen(symname) + 1;
  131. struct inode *inode;
  132. int err;
  133. if (l > sb->s_blocksize)
  134. return -ENAMETOOLONG;
  135. err = nilfs_transaction_begin(dir->i_sb, &ti, 1);
  136. if (err)
  137. return err;
  138. inode = nilfs_new_inode(dir, S_IFLNK | 0777);
  139. err = PTR_ERR(inode);
  140. if (IS_ERR(inode))
  141. goto out;
  142. /* slow symlink */
  143. inode->i_op = &nilfs_symlink_inode_operations;
  144. inode_nohighmem(inode);
  145. mapping_set_gfp_mask(inode->i_mapping,
  146. mapping_gfp_constraint(inode->i_mapping,
  147. ~__GFP_FS));
  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_set_ctime_current(inode);
  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 struct dentry *nilfs_mkdir(struct mnt_idmap *idmap, struct inode *dir,
  192. struct dentry *dentry, umode_t mode)
  193. {
  194. struct inode *inode;
  195. struct nilfs_transaction_info ti;
  196. int err;
  197. err = nilfs_transaction_begin(dir->i_sb, &ti, 1);
  198. if (err)
  199. return ERR_PTR(err);
  200. inc_nlink(dir);
  201. inode = nilfs_new_inode(dir, S_IFDIR | mode);
  202. err = PTR_ERR(inode);
  203. if (IS_ERR(inode))
  204. goto out_dir;
  205. inode->i_op = &nilfs_dir_inode_operations;
  206. inode->i_fop = &nilfs_dir_operations;
  207. inode->i_mapping->a_ops = &nilfs_aops;
  208. inc_nlink(inode);
  209. err = nilfs_make_empty(inode, dir);
  210. if (err)
  211. goto out_fail;
  212. err = nilfs_add_link(dentry, inode);
  213. if (err)
  214. goto out_fail;
  215. nilfs_mark_inode_dirty(inode);
  216. d_instantiate_new(dentry, 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_PTR(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 folio *folio;
  239. int err;
  240. de = nilfs_find_entry(dir, &dentry->d_name, &folio);
  241. if (IS_ERR(de)) {
  242. err = PTR_ERR(de);
  243. goto out;
  244. }
  245. inode = d_inode(dentry);
  246. err = -EIO;
  247. if (le64_to_cpu(de->inode) != inode->i_ino)
  248. goto out;
  249. if (!inode->i_nlink) {
  250. nilfs_warn(inode->i_sb,
  251. "deleting nonexistent file (ino=%lu), %d",
  252. inode->i_ino, inode->i_nlink);
  253. set_nlink(inode, 1);
  254. }
  255. err = nilfs_delete_entry(de, folio);
  256. folio_release_kmap(folio, de);
  257. if (err)
  258. goto out;
  259. inode_set_ctime_to_ts(inode, inode_get_ctime(dir));
  260. drop_nlink(inode);
  261. err = 0;
  262. out:
  263. return err;
  264. }
  265. static int nilfs_unlink(struct inode *dir, struct dentry *dentry)
  266. {
  267. struct nilfs_transaction_info ti;
  268. int err;
  269. err = nilfs_transaction_begin(dir->i_sb, &ti, 0);
  270. if (err)
  271. return err;
  272. err = nilfs_do_unlink(dir, dentry);
  273. if (!err) {
  274. nilfs_mark_inode_dirty(dir);
  275. nilfs_mark_inode_dirty(d_inode(dentry));
  276. err = nilfs_transaction_commit(dir->i_sb);
  277. } else
  278. nilfs_transaction_abort(dir->i_sb);
  279. return err;
  280. }
  281. static int nilfs_rmdir(struct inode *dir, struct dentry *dentry)
  282. {
  283. struct inode *inode = d_inode(dentry);
  284. struct nilfs_transaction_info ti;
  285. int err;
  286. err = nilfs_transaction_begin(dir->i_sb, &ti, 0);
  287. if (err)
  288. return err;
  289. err = -ENOTEMPTY;
  290. if (nilfs_empty_dir(inode)) {
  291. err = nilfs_do_unlink(dir, dentry);
  292. if (!err) {
  293. inode->i_size = 0;
  294. drop_nlink(inode);
  295. nilfs_mark_inode_dirty(inode);
  296. drop_nlink(dir);
  297. nilfs_mark_inode_dirty(dir);
  298. }
  299. }
  300. if (!err)
  301. err = nilfs_transaction_commit(dir->i_sb);
  302. else
  303. nilfs_transaction_abort(dir->i_sb);
  304. return err;
  305. }
  306. static int nilfs_rename(struct mnt_idmap *idmap,
  307. struct inode *old_dir, struct dentry *old_dentry,
  308. struct inode *new_dir, struct dentry *new_dentry,
  309. unsigned int flags)
  310. {
  311. struct inode *old_inode = d_inode(old_dentry);
  312. struct inode *new_inode = d_inode(new_dentry);
  313. struct folio *dir_folio = NULL;
  314. struct nilfs_dir_entry *dir_de = NULL;
  315. struct folio *old_folio;
  316. struct nilfs_dir_entry *old_de;
  317. struct nilfs_transaction_info ti;
  318. bool old_is_dir = S_ISDIR(old_inode->i_mode);
  319. int err;
  320. if (flags & ~RENAME_NOREPLACE)
  321. return -EINVAL;
  322. err = nilfs_transaction_begin(old_dir->i_sb, &ti, 1);
  323. if (unlikely(err))
  324. return err;
  325. old_de = nilfs_find_entry(old_dir, &old_dentry->d_name, &old_folio);
  326. if (IS_ERR(old_de)) {
  327. err = PTR_ERR(old_de);
  328. goto out;
  329. }
  330. if (old_is_dir && old_dir != new_dir) {
  331. err = -EIO;
  332. dir_de = nilfs_dotdot(old_inode, &dir_folio);
  333. if (!dir_de)
  334. goto out_old;
  335. }
  336. if (new_inode) {
  337. struct folio *new_folio;
  338. struct nilfs_dir_entry *new_de;
  339. err = -ENOTEMPTY;
  340. if (old_is_dir && !nilfs_empty_dir(new_inode))
  341. goto out_dir;
  342. new_de = nilfs_find_entry(new_dir, &new_dentry->d_name,
  343. &new_folio);
  344. if (IS_ERR(new_de)) {
  345. err = PTR_ERR(new_de);
  346. goto out_dir;
  347. }
  348. err = nilfs_set_link(new_dir, new_de, new_folio, old_inode);
  349. folio_release_kmap(new_folio, new_de);
  350. if (unlikely(err))
  351. goto out_dir;
  352. nilfs_mark_inode_dirty(new_dir);
  353. inode_set_ctime_current(new_inode);
  354. if (old_is_dir)
  355. drop_nlink(new_inode);
  356. drop_nlink(new_inode);
  357. nilfs_mark_inode_dirty(new_inode);
  358. } else {
  359. err = nilfs_add_link(new_dentry, old_inode);
  360. if (err)
  361. goto out_dir;
  362. if (old_is_dir) {
  363. inc_nlink(new_dir);
  364. nilfs_mark_inode_dirty(new_dir);
  365. }
  366. }
  367. /*
  368. * Like most other Unix systems, set the ctime for inodes on a
  369. * rename.
  370. */
  371. inode_set_ctime_current(old_inode);
  372. err = nilfs_delete_entry(old_de, old_folio);
  373. if (likely(!err)) {
  374. if (old_is_dir) {
  375. if (old_dir != new_dir)
  376. err = nilfs_set_link(old_inode, dir_de,
  377. dir_folio, new_dir);
  378. drop_nlink(old_dir);
  379. }
  380. nilfs_mark_inode_dirty(old_dir);
  381. }
  382. nilfs_mark_inode_dirty(old_inode);
  383. out_dir:
  384. if (dir_de)
  385. folio_release_kmap(dir_folio, dir_de);
  386. out_old:
  387. folio_release_kmap(old_folio, old_de);
  388. out:
  389. if (likely(!err))
  390. err = nilfs_transaction_commit(old_dir->i_sb);
  391. else
  392. nilfs_transaction_abort(old_dir->i_sb);
  393. return err;
  394. }
  395. /*
  396. * Export operations
  397. */
  398. static struct dentry *nilfs_get_parent(struct dentry *child)
  399. {
  400. ino_t ino;
  401. int res;
  402. struct nilfs_root *root;
  403. res = nilfs_inode_by_name(d_inode(child), &dotdot_name, &ino);
  404. if (res)
  405. return ERR_PTR(res);
  406. root = NILFS_I(d_inode(child))->i_root;
  407. return d_obtain_alias(nilfs_iget(child->d_sb, root, ino));
  408. }
  409. static struct dentry *nilfs_get_dentry(struct super_block *sb, u64 cno,
  410. u64 ino, u32 gen)
  411. {
  412. struct nilfs_root *root;
  413. struct inode *inode;
  414. if (ino < NILFS_FIRST_INO(sb) && ino != NILFS_ROOT_INO)
  415. return ERR_PTR(-ESTALE);
  416. root = nilfs_lookup_root(sb->s_fs_info, cno);
  417. if (!root)
  418. return ERR_PTR(-ESTALE);
  419. inode = nilfs_iget(sb, root, ino);
  420. nilfs_put_root(root);
  421. if (IS_ERR(inode))
  422. return ERR_CAST(inode);
  423. if (gen && inode->i_generation != gen) {
  424. iput(inode);
  425. return ERR_PTR(-ESTALE);
  426. }
  427. return d_obtain_alias(inode);
  428. }
  429. static struct dentry *nilfs_fh_to_dentry(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_NON_CONNECTABLE ||
  434. (fh_type != FILEID_NILFS_WITH_PARENT &&
  435. fh_type != FILEID_NILFS_WITHOUT_PARENT))
  436. return NULL;
  437. return nilfs_get_dentry(sb, fid->cno, fid->ino, fid->gen);
  438. }
  439. static struct dentry *nilfs_fh_to_parent(struct super_block *sb, struct fid *fh,
  440. int fh_len, int fh_type)
  441. {
  442. struct nilfs_fid *fid = (struct nilfs_fid *)fh;
  443. if (fh_len < NILFS_FID_SIZE_CONNECTABLE ||
  444. fh_type != FILEID_NILFS_WITH_PARENT)
  445. return NULL;
  446. return nilfs_get_dentry(sb, fid->cno, fid->parent_ino, fid->parent_gen);
  447. }
  448. static int nilfs_encode_fh(struct inode *inode, __u32 *fh, int *lenp,
  449. struct inode *parent)
  450. {
  451. struct nilfs_fid *fid = (struct nilfs_fid *)fh;
  452. struct nilfs_root *root = NILFS_I(inode)->i_root;
  453. int type;
  454. if (parent && *lenp < NILFS_FID_SIZE_CONNECTABLE) {
  455. *lenp = NILFS_FID_SIZE_CONNECTABLE;
  456. return FILEID_INVALID;
  457. }
  458. if (*lenp < NILFS_FID_SIZE_NON_CONNECTABLE) {
  459. *lenp = NILFS_FID_SIZE_NON_CONNECTABLE;
  460. return FILEID_INVALID;
  461. }
  462. fid->cno = root->cno;
  463. fid->ino = inode->i_ino;
  464. fid->gen = inode->i_generation;
  465. if (parent) {
  466. fid->parent_ino = parent->i_ino;
  467. fid->parent_gen = parent->i_generation;
  468. type = FILEID_NILFS_WITH_PARENT;
  469. *lenp = NILFS_FID_SIZE_CONNECTABLE;
  470. } else {
  471. type = FILEID_NILFS_WITHOUT_PARENT;
  472. *lenp = NILFS_FID_SIZE_NON_CONNECTABLE;
  473. }
  474. return type;
  475. }
  476. const struct inode_operations nilfs_dir_inode_operations = {
  477. .create = nilfs_create,
  478. .lookup = nilfs_lookup,
  479. .link = nilfs_link,
  480. .unlink = nilfs_unlink,
  481. .symlink = nilfs_symlink,
  482. .mkdir = nilfs_mkdir,
  483. .rmdir = nilfs_rmdir,
  484. .mknod = nilfs_mknod,
  485. .rename = nilfs_rename,
  486. .setattr = nilfs_setattr,
  487. .permission = nilfs_permission,
  488. .fiemap = nilfs_fiemap,
  489. .fileattr_get = nilfs_fileattr_get,
  490. .fileattr_set = nilfs_fileattr_set,
  491. };
  492. const struct inode_operations nilfs_special_inode_operations = {
  493. .setattr = nilfs_setattr,
  494. .permission = nilfs_permission,
  495. };
  496. const struct inode_operations nilfs_symlink_inode_operations = {
  497. .get_link = page_get_link,
  498. .permission = nilfs_permission,
  499. };
  500. const struct export_operations nilfs_export_ops = {
  501. .encode_fh = nilfs_encode_fh,
  502. .fh_to_dentry = nilfs_fh_to_dentry,
  503. .fh_to_parent = nilfs_fh_to_parent,
  504. .get_parent = nilfs_get_parent,
  505. };