namei.c 7.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342
  1. // SPDX-License-Identifier: GPL-2.0
  2. /*
  3. * linux/fs/ufs/namei.c
  4. *
  5. * Migration to usage of "page cache" on May 2006 by
  6. * Evgeniy Dushistov <dushistov@mail.ru> based on ext2 code base.
  7. *
  8. * Copyright (C) 1998
  9. * Daniel Pirkl <daniel.pirkl@email.cz>
  10. * Charles University, Faculty of Mathematics and Physics
  11. *
  12. * from
  13. *
  14. * linux/fs/ext2/namei.c
  15. *
  16. * Copyright (C) 1992, 1993, 1994, 1995
  17. * Remy Card (card@masi.ibp.fr)
  18. * Laboratoire MASI - Institut Blaise Pascal
  19. * Universite Pierre et Marie Curie (Paris VI)
  20. *
  21. * from
  22. *
  23. * linux/fs/minix/namei.c
  24. *
  25. * Copyright (C) 1991, 1992 Linus Torvalds
  26. *
  27. * Big-endian to little-endian byte-swapping/bitmaps by
  28. * David S. Miller (davem@caip.rutgers.edu), 1995
  29. */
  30. #include <linux/time.h>
  31. #include <linux/fs.h>
  32. #include "ufs_fs.h"
  33. #include "ufs.h"
  34. #include "util.h"
  35. static inline int ufs_add_nondir(struct dentry *dentry, struct inode *inode)
  36. {
  37. int err = ufs_add_link(dentry, inode);
  38. if (!err) {
  39. unlock_new_inode(inode);
  40. d_instantiate(dentry, inode);
  41. return 0;
  42. }
  43. inode_dec_link_count(inode);
  44. unlock_new_inode(inode);
  45. iput(inode);
  46. return err;
  47. }
  48. static struct dentry *ufs_lookup(struct inode * dir, struct dentry *dentry, unsigned int flags)
  49. {
  50. struct inode * inode = NULL;
  51. ino_t ino;
  52. if (dentry->d_name.len > UFS_MAXNAMLEN)
  53. return ERR_PTR(-ENAMETOOLONG);
  54. ino = ufs_inode_by_name(dir, &dentry->d_name);
  55. if (ino)
  56. inode = ufs_iget(dir->i_sb, ino);
  57. return d_splice_alias(inode, dentry);
  58. }
  59. /*
  60. * By the time this is called, we already have created
  61. * the directory cache entry for the new file, but it
  62. * is so far negative - it has no inode.
  63. *
  64. * If the create succeeds, we fill in the inode information
  65. * with d_instantiate().
  66. */
  67. static int ufs_create (struct inode * dir, struct dentry * dentry, umode_t mode,
  68. bool excl)
  69. {
  70. struct inode *inode;
  71. inode = ufs_new_inode(dir, mode);
  72. if (IS_ERR(inode))
  73. return PTR_ERR(inode);
  74. inode->i_op = &ufs_file_inode_operations;
  75. inode->i_fop = &ufs_file_operations;
  76. inode->i_mapping->a_ops = &ufs_aops;
  77. mark_inode_dirty(inode);
  78. return ufs_add_nondir(dentry, inode);
  79. }
  80. static int ufs_mknod(struct inode *dir, struct dentry *dentry, umode_t mode, dev_t rdev)
  81. {
  82. struct inode *inode;
  83. int err;
  84. if (!old_valid_dev(rdev))
  85. return -EINVAL;
  86. inode = ufs_new_inode(dir, mode);
  87. err = PTR_ERR(inode);
  88. if (!IS_ERR(inode)) {
  89. init_special_inode(inode, mode, rdev);
  90. ufs_set_inode_dev(inode->i_sb, UFS_I(inode), rdev);
  91. mark_inode_dirty(inode);
  92. err = ufs_add_nondir(dentry, inode);
  93. }
  94. return err;
  95. }
  96. static int ufs_symlink (struct inode * dir, struct dentry * dentry,
  97. const char * symname)
  98. {
  99. struct super_block * sb = dir->i_sb;
  100. int err;
  101. unsigned l = strlen(symname)+1;
  102. struct inode * inode;
  103. if (l > sb->s_blocksize)
  104. return -ENAMETOOLONG;
  105. inode = ufs_new_inode(dir, S_IFLNK | S_IRWXUGO);
  106. err = PTR_ERR(inode);
  107. if (IS_ERR(inode))
  108. return err;
  109. if (l > UFS_SB(sb)->s_uspi->s_maxsymlinklen) {
  110. /* slow symlink */
  111. inode->i_op = &page_symlink_inode_operations;
  112. inode_nohighmem(inode);
  113. inode->i_mapping->a_ops = &ufs_aops;
  114. err = page_symlink(inode, symname, l);
  115. if (err)
  116. goto out_fail;
  117. } else {
  118. /* fast symlink */
  119. inode->i_op = &simple_symlink_inode_operations;
  120. inode->i_link = (char *)UFS_I(inode)->i_u1.i_symlink;
  121. memcpy(inode->i_link, symname, l);
  122. inode->i_size = l-1;
  123. }
  124. mark_inode_dirty(inode);
  125. return ufs_add_nondir(dentry, inode);
  126. out_fail:
  127. inode_dec_link_count(inode);
  128. unlock_new_inode(inode);
  129. iput(inode);
  130. return err;
  131. }
  132. static int ufs_link (struct dentry * old_dentry, struct inode * dir,
  133. struct dentry *dentry)
  134. {
  135. struct inode *inode = d_inode(old_dentry);
  136. int error;
  137. inode->i_ctime = current_time(inode);
  138. inode_inc_link_count(inode);
  139. ihold(inode);
  140. error = ufs_add_link(dentry, inode);
  141. if (error) {
  142. inode_dec_link_count(inode);
  143. iput(inode);
  144. } else
  145. d_instantiate(dentry, inode);
  146. return error;
  147. }
  148. static int ufs_mkdir(struct inode * dir, struct dentry * dentry, umode_t mode)
  149. {
  150. struct inode * inode;
  151. int err;
  152. inode_inc_link_count(dir);
  153. inode = ufs_new_inode(dir, S_IFDIR|mode);
  154. err = PTR_ERR(inode);
  155. if (IS_ERR(inode))
  156. goto out_dir;
  157. inode->i_op = &ufs_dir_inode_operations;
  158. inode->i_fop = &ufs_dir_operations;
  159. inode->i_mapping->a_ops = &ufs_aops;
  160. inode_inc_link_count(inode);
  161. err = ufs_make_empty(inode, dir);
  162. if (err)
  163. goto out_fail;
  164. err = ufs_add_link(dentry, inode);
  165. if (err)
  166. goto out_fail;
  167. unlock_new_inode(inode);
  168. d_instantiate(dentry, inode);
  169. return 0;
  170. out_fail:
  171. inode_dec_link_count(inode);
  172. inode_dec_link_count(inode);
  173. unlock_new_inode(inode);
  174. iput (inode);
  175. out_dir:
  176. inode_dec_link_count(dir);
  177. return err;
  178. }
  179. static int ufs_unlink(struct inode *dir, struct dentry *dentry)
  180. {
  181. struct inode * inode = d_inode(dentry);
  182. struct ufs_dir_entry *de;
  183. struct page *page;
  184. int err = -ENOENT;
  185. de = ufs_find_entry(dir, &dentry->d_name, &page);
  186. if (!de)
  187. goto out;
  188. err = ufs_delete_entry(dir, de, page);
  189. if (err)
  190. goto out;
  191. inode->i_ctime = dir->i_ctime;
  192. inode_dec_link_count(inode);
  193. err = 0;
  194. out:
  195. return err;
  196. }
  197. static int ufs_rmdir (struct inode * dir, struct dentry *dentry)
  198. {
  199. struct inode * inode = d_inode(dentry);
  200. int err= -ENOTEMPTY;
  201. if (ufs_empty_dir (inode)) {
  202. err = ufs_unlink(dir, dentry);
  203. if (!err) {
  204. inode->i_size = 0;
  205. inode_dec_link_count(inode);
  206. inode_dec_link_count(dir);
  207. }
  208. }
  209. return err;
  210. }
  211. static int ufs_rename(struct inode *old_dir, struct dentry *old_dentry,
  212. struct inode *new_dir, struct dentry *new_dentry,
  213. unsigned int flags)
  214. {
  215. struct inode *old_inode = d_inode(old_dentry);
  216. struct inode *new_inode = d_inode(new_dentry);
  217. struct page *dir_page = NULL;
  218. struct ufs_dir_entry * dir_de = NULL;
  219. struct page *old_page;
  220. struct ufs_dir_entry *old_de;
  221. int err = -ENOENT;
  222. if (flags & ~RENAME_NOREPLACE)
  223. return -EINVAL;
  224. old_de = ufs_find_entry(old_dir, &old_dentry->d_name, &old_page);
  225. if (!old_de)
  226. goto out;
  227. if (S_ISDIR(old_inode->i_mode)) {
  228. err = -EIO;
  229. dir_de = ufs_dotdot(old_inode, &dir_page);
  230. if (!dir_de)
  231. goto out_old;
  232. }
  233. if (new_inode) {
  234. struct page *new_page;
  235. struct ufs_dir_entry *new_de;
  236. err = -ENOTEMPTY;
  237. if (dir_de && !ufs_empty_dir(new_inode))
  238. goto out_dir;
  239. err = -ENOENT;
  240. new_de = ufs_find_entry(new_dir, &new_dentry->d_name, &new_page);
  241. if (!new_de)
  242. goto out_dir;
  243. ufs_set_link(new_dir, new_de, new_page, old_inode, 1);
  244. new_inode->i_ctime = current_time(new_inode);
  245. if (dir_de)
  246. drop_nlink(new_inode);
  247. inode_dec_link_count(new_inode);
  248. } else {
  249. err = ufs_add_link(new_dentry, old_inode);
  250. if (err)
  251. goto out_dir;
  252. if (dir_de)
  253. inode_inc_link_count(new_dir);
  254. }
  255. /*
  256. * Like most other Unix systems, set the ctime for inodes on a
  257. * rename.
  258. */
  259. old_inode->i_ctime = current_time(old_inode);
  260. ufs_delete_entry(old_dir, old_de, old_page);
  261. mark_inode_dirty(old_inode);
  262. if (dir_de) {
  263. if (old_dir != new_dir)
  264. ufs_set_link(old_inode, dir_de, dir_page, new_dir, 0);
  265. else {
  266. kunmap(dir_page);
  267. put_page(dir_page);
  268. }
  269. inode_dec_link_count(old_dir);
  270. }
  271. return 0;
  272. out_dir:
  273. if (dir_de) {
  274. kunmap(dir_page);
  275. put_page(dir_page);
  276. }
  277. out_old:
  278. kunmap(old_page);
  279. put_page(old_page);
  280. out:
  281. return err;
  282. }
  283. const struct inode_operations ufs_dir_inode_operations = {
  284. .create = ufs_create,
  285. .lookup = ufs_lookup,
  286. .link = ufs_link,
  287. .unlink = ufs_unlink,
  288. .symlink = ufs_symlink,
  289. .mkdir = ufs_mkdir,
  290. .rmdir = ufs_rmdir,
  291. .mknod = ufs_mknod,
  292. .rename = ufs_rename,
  293. };