namei.c 7.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375
  1. /*
  2. * linux/fs/ufs/namei.c
  3. *
  4. * Copyright (C) 1998
  5. * Daniel Pirkl <daniel.pirkl@email.cz>
  6. * Charles University, Faculty of Mathematics and Physics
  7. *
  8. * from
  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/time.h>
  27. #include <linux/fs.h>
  28. #include <linux/ufs_fs.h>
  29. #include <linux/smp_lock.h>
  30. #include <linux/buffer_head.h>
  31. #include "swab.h" /* will go away - see comment in mknod() */
  32. #include "util.h"
  33. /*
  34. #undef UFS_NAMEI_DEBUG
  35. */
  36. #define UFS_NAMEI_DEBUG
  37. #ifdef UFS_NAMEI_DEBUG
  38. #define UFSD(x) printk("(%s, %d), %s: ", __FILE__, __LINE__, __FUNCTION__); printk x;
  39. #else
  40. #define UFSD(x)
  41. #endif
  42. static inline void ufs_inc_count(struct inode *inode)
  43. {
  44. inode->i_nlink++;
  45. mark_inode_dirty(inode);
  46. }
  47. static inline void ufs_dec_count(struct inode *inode)
  48. {
  49. inode->i_nlink--;
  50. mark_inode_dirty(inode);
  51. }
  52. static inline int ufs_add_nondir(struct dentry *dentry, struct inode *inode)
  53. {
  54. int err = ufs_add_link(dentry, inode);
  55. if (!err) {
  56. d_instantiate(dentry, inode);
  57. return 0;
  58. }
  59. ufs_dec_count(inode);
  60. iput(inode);
  61. return err;
  62. }
  63. static struct dentry *ufs_lookup(struct inode * dir, struct dentry *dentry, struct nameidata *nd)
  64. {
  65. struct inode * inode = NULL;
  66. ino_t ino;
  67. if (dentry->d_name.len > UFS_MAXNAMLEN)
  68. return ERR_PTR(-ENAMETOOLONG);
  69. lock_kernel();
  70. ino = ufs_inode_by_name(dir, dentry);
  71. if (ino) {
  72. inode = iget(dir->i_sb, ino);
  73. if (!inode) {
  74. unlock_kernel();
  75. return ERR_PTR(-EACCES);
  76. }
  77. }
  78. unlock_kernel();
  79. d_add(dentry, inode);
  80. return NULL;
  81. }
  82. /*
  83. * By the time this is called, we already have created
  84. * the directory cache entry for the new file, but it
  85. * is so far negative - it has no inode.
  86. *
  87. * If the create succeeds, we fill in the inode information
  88. * with d_instantiate().
  89. */
  90. static int ufs_create (struct inode * dir, struct dentry * dentry, int mode,
  91. struct nameidata *nd)
  92. {
  93. struct inode * inode = ufs_new_inode(dir, mode);
  94. int err = PTR_ERR(inode);
  95. if (!IS_ERR(inode)) {
  96. inode->i_op = &ufs_file_inode_operations;
  97. inode->i_fop = &ufs_file_operations;
  98. inode->i_mapping->a_ops = &ufs_aops;
  99. mark_inode_dirty(inode);
  100. lock_kernel();
  101. err = ufs_add_nondir(dentry, inode);
  102. unlock_kernel();
  103. }
  104. return err;
  105. }
  106. static int ufs_mknod (struct inode * dir, struct dentry *dentry, int mode, dev_t rdev)
  107. {
  108. struct inode *inode;
  109. int err;
  110. if (!old_valid_dev(rdev))
  111. return -EINVAL;
  112. inode = ufs_new_inode(dir, mode);
  113. err = PTR_ERR(inode);
  114. if (!IS_ERR(inode)) {
  115. init_special_inode(inode, mode, rdev);
  116. /* NOTE: that'll go when we get wide dev_t */
  117. ufs_set_inode_dev(inode->i_sb, UFS_I(inode), rdev);
  118. mark_inode_dirty(inode);
  119. lock_kernel();
  120. err = ufs_add_nondir(dentry, inode);
  121. unlock_kernel();
  122. }
  123. return err;
  124. }
  125. static int ufs_symlink (struct inode * dir, struct dentry * dentry,
  126. const char * symname)
  127. {
  128. struct super_block * sb = dir->i_sb;
  129. int err = -ENAMETOOLONG;
  130. unsigned l = strlen(symname)+1;
  131. struct inode * inode;
  132. if (l > sb->s_blocksize)
  133. goto out;
  134. lock_kernel();
  135. inode = ufs_new_inode(dir, S_IFLNK | S_IRWXUGO);
  136. err = PTR_ERR(inode);
  137. if (IS_ERR(inode))
  138. goto out;
  139. if (l > UFS_SB(sb)->s_uspi->s_maxsymlinklen) {
  140. /* slow symlink */
  141. inode->i_op = &page_symlink_inode_operations;
  142. inode->i_mapping->a_ops = &ufs_aops;
  143. err = page_symlink(inode, symname, l);
  144. if (err)
  145. goto out_fail;
  146. } else {
  147. /* fast symlink */
  148. inode->i_op = &ufs_fast_symlink_inode_operations;
  149. memcpy((char*)&UFS_I(inode)->i_u1.i_data,symname,l);
  150. inode->i_size = l-1;
  151. }
  152. mark_inode_dirty(inode);
  153. err = ufs_add_nondir(dentry, inode);
  154. out:
  155. unlock_kernel();
  156. return err;
  157. out_fail:
  158. ufs_dec_count(inode);
  159. iput(inode);
  160. goto out;
  161. }
  162. static int ufs_link (struct dentry * old_dentry, struct inode * dir,
  163. struct dentry *dentry)
  164. {
  165. struct inode *inode = old_dentry->d_inode;
  166. int error;
  167. lock_kernel();
  168. if (inode->i_nlink >= UFS_LINK_MAX) {
  169. unlock_kernel();
  170. return -EMLINK;
  171. }
  172. inode->i_ctime = CURRENT_TIME_SEC;
  173. ufs_inc_count(inode);
  174. atomic_inc(&inode->i_count);
  175. error = ufs_add_nondir(dentry, inode);
  176. unlock_kernel();
  177. return error;
  178. }
  179. static int ufs_mkdir(struct inode * dir, struct dentry * dentry, int mode)
  180. {
  181. struct inode * inode;
  182. int err = -EMLINK;
  183. if (dir->i_nlink >= UFS_LINK_MAX)
  184. goto out;
  185. lock_kernel();
  186. ufs_inc_count(dir);
  187. inode = ufs_new_inode(dir, S_IFDIR|mode);
  188. err = PTR_ERR(inode);
  189. if (IS_ERR(inode))
  190. goto out_dir;
  191. inode->i_op = &ufs_dir_inode_operations;
  192. inode->i_fop = &ufs_dir_operations;
  193. ufs_inc_count(inode);
  194. err = ufs_make_empty(inode, dir);
  195. if (err)
  196. goto out_fail;
  197. err = ufs_add_link(dentry, inode);
  198. if (err)
  199. goto out_fail;
  200. unlock_kernel();
  201. d_instantiate(dentry, inode);
  202. out:
  203. return err;
  204. out_fail:
  205. ufs_dec_count(inode);
  206. ufs_dec_count(inode);
  207. iput (inode);
  208. out_dir:
  209. ufs_dec_count(dir);
  210. unlock_kernel();
  211. goto out;
  212. }
  213. static int ufs_unlink(struct inode * dir, struct dentry *dentry)
  214. {
  215. struct inode * inode = dentry->d_inode;
  216. struct buffer_head * bh;
  217. struct ufs_dir_entry * de;
  218. int err = -ENOENT;
  219. lock_kernel();
  220. de = ufs_find_entry (dentry, &bh);
  221. if (!de)
  222. goto out;
  223. err = ufs_delete_entry (dir, de, bh);
  224. if (err)
  225. goto out;
  226. inode->i_ctime = dir->i_ctime;
  227. ufs_dec_count(inode);
  228. err = 0;
  229. out:
  230. unlock_kernel();
  231. return err;
  232. }
  233. static int ufs_rmdir (struct inode * dir, struct dentry *dentry)
  234. {
  235. struct inode * inode = dentry->d_inode;
  236. int err= -ENOTEMPTY;
  237. lock_kernel();
  238. if (ufs_empty_dir (inode)) {
  239. err = ufs_unlink(dir, dentry);
  240. if (!err) {
  241. inode->i_size = 0;
  242. ufs_dec_count(inode);
  243. ufs_dec_count(dir);
  244. }
  245. }
  246. unlock_kernel();
  247. return err;
  248. }
  249. static int ufs_rename (struct inode * old_dir, struct dentry * old_dentry,
  250. struct inode * new_dir, struct dentry * new_dentry )
  251. {
  252. struct inode *old_inode = old_dentry->d_inode;
  253. struct inode *new_inode = new_dentry->d_inode;
  254. struct buffer_head *dir_bh = NULL;
  255. struct ufs_dir_entry *dir_de = NULL;
  256. struct buffer_head *old_bh;
  257. struct ufs_dir_entry *old_de;
  258. int err = -ENOENT;
  259. lock_kernel();
  260. old_de = ufs_find_entry (old_dentry, &old_bh);
  261. if (!old_de)
  262. goto out;
  263. if (S_ISDIR(old_inode->i_mode)) {
  264. err = -EIO;
  265. dir_de = ufs_dotdot(old_inode, &dir_bh);
  266. if (!dir_de)
  267. goto out_old;
  268. }
  269. if (new_inode) {
  270. struct buffer_head *new_bh;
  271. struct ufs_dir_entry *new_de;
  272. err = -ENOTEMPTY;
  273. if (dir_de && !ufs_empty_dir (new_inode))
  274. goto out_dir;
  275. err = -ENOENT;
  276. new_de = ufs_find_entry (new_dentry, &new_bh);
  277. if (!new_de)
  278. goto out_dir;
  279. ufs_inc_count(old_inode);
  280. ufs_set_link(new_dir, new_de, new_bh, old_inode);
  281. new_inode->i_ctime = CURRENT_TIME_SEC;
  282. if (dir_de)
  283. new_inode->i_nlink--;
  284. ufs_dec_count(new_inode);
  285. } else {
  286. if (dir_de) {
  287. err = -EMLINK;
  288. if (new_dir->i_nlink >= UFS_LINK_MAX)
  289. goto out_dir;
  290. }
  291. ufs_inc_count(old_inode);
  292. err = ufs_add_link(new_dentry, old_inode);
  293. if (err) {
  294. ufs_dec_count(old_inode);
  295. goto out_dir;
  296. }
  297. if (dir_de)
  298. ufs_inc_count(new_dir);
  299. }
  300. ufs_delete_entry (old_dir, old_de, old_bh);
  301. ufs_dec_count(old_inode);
  302. if (dir_de) {
  303. ufs_set_link(old_inode, dir_de, dir_bh, new_dir);
  304. ufs_dec_count(old_dir);
  305. }
  306. unlock_kernel();
  307. return 0;
  308. out_dir:
  309. if (dir_de)
  310. brelse(dir_bh);
  311. out_old:
  312. brelse (old_bh);
  313. out:
  314. unlock_kernel();
  315. return err;
  316. }
  317. struct inode_operations ufs_dir_inode_operations = {
  318. .create = ufs_create,
  319. .lookup = ufs_lookup,
  320. .link = ufs_link,
  321. .unlink = ufs_unlink,
  322. .symlink = ufs_symlink,
  323. .mkdir = ufs_mkdir,
  324. .rmdir = ufs_rmdir,
  325. .mknod = ufs_mknod,
  326. .rename = ufs_rename,
  327. };