dir.c 8.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370
  1. /*
  2. * fs/bfs/dir.c
  3. * BFS directory operations.
  4. * Copyright (C) 1999,2000 Tigran Aivazian <tigran@veritas.com>
  5. * Made endianness-clean by Andrew Stribblehill <ads@wompom.org> 2005
  6. */
  7. #include <linux/time.h>
  8. #include <linux/string.h>
  9. #include <linux/fs.h>
  10. #include <linux/smp_lock.h>
  11. #include <linux/buffer_head.h>
  12. #include <linux/sched.h>
  13. #include "bfs.h"
  14. #undef DEBUG
  15. #ifdef DEBUG
  16. #define dprintf(x...) printf(x)
  17. #else
  18. #define dprintf(x...)
  19. #endif
  20. static int bfs_add_entry(struct inode *dir, const unsigned char *name,
  21. int namelen, int ino);
  22. static struct buffer_head *bfs_find_entry(struct inode *dir,
  23. const unsigned char *name, int namelen,
  24. struct bfs_dirent **res_dir);
  25. static int bfs_readdir(struct file *f, void *dirent, filldir_t filldir)
  26. {
  27. struct inode *dir = f->f_path.dentry->d_inode;
  28. struct buffer_head *bh;
  29. struct bfs_dirent *de;
  30. unsigned int offset;
  31. int block;
  32. lock_kernel();
  33. if (f->f_pos & (BFS_DIRENT_SIZE - 1)) {
  34. printf("Bad f_pos=%08lx for %s:%08lx\n",
  35. (unsigned long)f->f_pos,
  36. dir->i_sb->s_id, dir->i_ino);
  37. unlock_kernel();
  38. return -EBADF;
  39. }
  40. while (f->f_pos < dir->i_size) {
  41. offset = f->f_pos & (BFS_BSIZE - 1);
  42. block = BFS_I(dir)->i_sblock + (f->f_pos >> BFS_BSIZE_BITS);
  43. bh = sb_bread(dir->i_sb, block);
  44. if (!bh) {
  45. f->f_pos += BFS_BSIZE - offset;
  46. continue;
  47. }
  48. do {
  49. de = (struct bfs_dirent *)(bh->b_data + offset);
  50. if (de->ino) {
  51. int size = strnlen(de->name, BFS_NAMELEN);
  52. if (filldir(dirent, de->name, size, f->f_pos,
  53. le16_to_cpu(de->ino),
  54. DT_UNKNOWN) < 0) {
  55. brelse(bh);
  56. unlock_kernel();
  57. return 0;
  58. }
  59. }
  60. offset += BFS_DIRENT_SIZE;
  61. f->f_pos += BFS_DIRENT_SIZE;
  62. } while ((offset < BFS_BSIZE) && (f->f_pos < dir->i_size));
  63. brelse(bh);
  64. }
  65. unlock_kernel();
  66. return 0;
  67. }
  68. const struct file_operations bfs_dir_operations = {
  69. .read = generic_read_dir,
  70. .readdir = bfs_readdir,
  71. .fsync = file_fsync,
  72. };
  73. extern void dump_imap(const char *, struct super_block *);
  74. static int bfs_create(struct inode *dir, struct dentry *dentry, int mode,
  75. struct nameidata *nd)
  76. {
  77. int err;
  78. struct inode *inode;
  79. struct super_block *s = dir->i_sb;
  80. struct bfs_sb_info *info = BFS_SB(s);
  81. unsigned long ino;
  82. inode = new_inode(s);
  83. if (!inode)
  84. return -ENOSPC;
  85. lock_kernel();
  86. ino = find_first_zero_bit(info->si_imap, info->si_lasti);
  87. if (ino > info->si_lasti) {
  88. unlock_kernel();
  89. iput(inode);
  90. return -ENOSPC;
  91. }
  92. set_bit(ino, info->si_imap);
  93. info->si_freei--;
  94. inode->i_uid = current->fsuid;
  95. inode->i_gid = (dir->i_mode & S_ISGID) ? dir->i_gid : current->fsgid;
  96. inode->i_mtime = inode->i_atime = inode->i_ctime = CURRENT_TIME_SEC;
  97. inode->i_blocks = 0;
  98. inode->i_op = &bfs_file_inops;
  99. inode->i_fop = &bfs_file_operations;
  100. inode->i_mapping->a_ops = &bfs_aops;
  101. inode->i_mode = mode;
  102. inode->i_ino = ino;
  103. BFS_I(inode)->i_dsk_ino = ino;
  104. BFS_I(inode)->i_sblock = 0;
  105. BFS_I(inode)->i_eblock = 0;
  106. insert_inode_hash(inode);
  107. mark_inode_dirty(inode);
  108. dump_imap("create", s);
  109. err = bfs_add_entry(dir, dentry->d_name.name, dentry->d_name.len,
  110. inode->i_ino);
  111. if (err) {
  112. inode_dec_link_count(inode);
  113. iput(inode);
  114. unlock_kernel();
  115. return err;
  116. }
  117. unlock_kernel();
  118. d_instantiate(dentry, inode);
  119. return 0;
  120. }
  121. static struct dentry *bfs_lookup(struct inode *dir, struct dentry *dentry,
  122. struct nameidata *nd)
  123. {
  124. struct inode *inode = NULL;
  125. struct buffer_head *bh;
  126. struct bfs_dirent *de;
  127. if (dentry->d_name.len > BFS_NAMELEN)
  128. return ERR_PTR(-ENAMETOOLONG);
  129. lock_kernel();
  130. bh = bfs_find_entry(dir, dentry->d_name.name, dentry->d_name.len, &de);
  131. if (bh) {
  132. unsigned long ino = (unsigned long)le16_to_cpu(de->ino);
  133. brelse(bh);
  134. inode = bfs_iget(dir->i_sb, ino);
  135. if (IS_ERR(inode)) {
  136. unlock_kernel();
  137. return ERR_CAST(inode);
  138. }
  139. }
  140. unlock_kernel();
  141. d_add(dentry, inode);
  142. return NULL;
  143. }
  144. static int bfs_link(struct dentry *old, struct inode *dir,
  145. struct dentry *new)
  146. {
  147. struct inode *inode = old->d_inode;
  148. int err;
  149. lock_kernel();
  150. err = bfs_add_entry(dir, new->d_name.name, new->d_name.len,
  151. inode->i_ino);
  152. if (err) {
  153. unlock_kernel();
  154. return err;
  155. }
  156. inc_nlink(inode);
  157. inode->i_ctime = CURRENT_TIME_SEC;
  158. mark_inode_dirty(inode);
  159. atomic_inc(&inode->i_count);
  160. d_instantiate(new, inode);
  161. unlock_kernel();
  162. return 0;
  163. }
  164. static int bfs_unlink(struct inode *dir, struct dentry *dentry)
  165. {
  166. int error = -ENOENT;
  167. struct inode *inode;
  168. struct buffer_head *bh;
  169. struct bfs_dirent *de;
  170. inode = dentry->d_inode;
  171. lock_kernel();
  172. bh = bfs_find_entry(dir, dentry->d_name.name, dentry->d_name.len, &de);
  173. if (!bh || (le16_to_cpu(de->ino) != inode->i_ino))
  174. goto out_brelse;
  175. if (!inode->i_nlink) {
  176. printf("unlinking non-existent file %s:%lu (nlink=%d)\n",
  177. inode->i_sb->s_id, inode->i_ino,
  178. inode->i_nlink);
  179. inode->i_nlink = 1;
  180. }
  181. de->ino = 0;
  182. mark_buffer_dirty(bh);
  183. dir->i_ctime = dir->i_mtime = CURRENT_TIME_SEC;
  184. mark_inode_dirty(dir);
  185. inode->i_ctime = dir->i_ctime;
  186. inode_dec_link_count(inode);
  187. error = 0;
  188. out_brelse:
  189. brelse(bh);
  190. unlock_kernel();
  191. return error;
  192. }
  193. static int bfs_rename(struct inode *old_dir, struct dentry *old_dentry,
  194. struct inode *new_dir, struct dentry *new_dentry)
  195. {
  196. struct inode *old_inode, *new_inode;
  197. struct buffer_head *old_bh, *new_bh;
  198. struct bfs_dirent *old_de, *new_de;
  199. int error = -ENOENT;
  200. old_bh = new_bh = NULL;
  201. old_inode = old_dentry->d_inode;
  202. if (S_ISDIR(old_inode->i_mode))
  203. return -EINVAL;
  204. lock_kernel();
  205. old_bh = bfs_find_entry(old_dir,
  206. old_dentry->d_name.name,
  207. old_dentry->d_name.len, &old_de);
  208. if (!old_bh || (le16_to_cpu(old_de->ino) != old_inode->i_ino))
  209. goto end_rename;
  210. error = -EPERM;
  211. new_inode = new_dentry->d_inode;
  212. new_bh = bfs_find_entry(new_dir,
  213. new_dentry->d_name.name,
  214. new_dentry->d_name.len, &new_de);
  215. if (new_bh && !new_inode) {
  216. brelse(new_bh);
  217. new_bh = NULL;
  218. }
  219. if (!new_bh) {
  220. error = bfs_add_entry(new_dir,
  221. new_dentry->d_name.name,
  222. new_dentry->d_name.len,
  223. old_inode->i_ino);
  224. if (error)
  225. goto end_rename;
  226. }
  227. old_de->ino = 0;
  228. old_dir->i_ctime = old_dir->i_mtime = CURRENT_TIME_SEC;
  229. mark_inode_dirty(old_dir);
  230. if (new_inode) {
  231. new_inode->i_ctime = CURRENT_TIME_SEC;
  232. inode_dec_link_count(new_inode);
  233. }
  234. mark_buffer_dirty(old_bh);
  235. error = 0;
  236. end_rename:
  237. unlock_kernel();
  238. brelse(old_bh);
  239. brelse(new_bh);
  240. return error;
  241. }
  242. const struct inode_operations bfs_dir_inops = {
  243. .create = bfs_create,
  244. .lookup = bfs_lookup,
  245. .link = bfs_link,
  246. .unlink = bfs_unlink,
  247. .rename = bfs_rename,
  248. };
  249. static int bfs_add_entry(struct inode *dir, const unsigned char *name,
  250. int namelen, int ino)
  251. {
  252. struct buffer_head *bh;
  253. struct bfs_dirent *de;
  254. int block, sblock, eblock, off, pos;
  255. int i;
  256. dprintf("name=%s, namelen=%d\n", name, namelen);
  257. if (!namelen)
  258. return -ENOENT;
  259. if (namelen > BFS_NAMELEN)
  260. return -ENAMETOOLONG;
  261. sblock = BFS_I(dir)->i_sblock;
  262. eblock = BFS_I(dir)->i_eblock;
  263. for (block = sblock; block <= eblock; block++) {
  264. bh = sb_bread(dir->i_sb, block);
  265. if (!bh)
  266. return -ENOSPC;
  267. for (off = 0; off < BFS_BSIZE; off += BFS_DIRENT_SIZE) {
  268. de = (struct bfs_dirent *)(bh->b_data + off);
  269. if (!de->ino) {
  270. pos = (block - sblock) * BFS_BSIZE + off;
  271. if (pos >= dir->i_size) {
  272. dir->i_size += BFS_DIRENT_SIZE;
  273. dir->i_ctime = CURRENT_TIME_SEC;
  274. }
  275. dir->i_mtime = CURRENT_TIME_SEC;
  276. mark_inode_dirty(dir);
  277. de->ino = cpu_to_le16((u16)ino);
  278. for (i = 0; i < BFS_NAMELEN; i++)
  279. de->name[i] =
  280. (i < namelen) ? name[i] : 0;
  281. mark_buffer_dirty(bh);
  282. brelse(bh);
  283. return 0;
  284. }
  285. }
  286. brelse(bh);
  287. }
  288. return -ENOSPC;
  289. }
  290. static inline int bfs_namecmp(int len, const unsigned char *name,
  291. const char *buffer)
  292. {
  293. if ((len < BFS_NAMELEN) && buffer[len])
  294. return 0;
  295. return !memcmp(name, buffer, len);
  296. }
  297. static struct buffer_head *bfs_find_entry(struct inode *dir,
  298. const unsigned char *name, int namelen,
  299. struct bfs_dirent **res_dir)
  300. {
  301. unsigned long block = 0, offset = 0;
  302. struct buffer_head *bh = NULL;
  303. struct bfs_dirent *de;
  304. *res_dir = NULL;
  305. if (namelen > BFS_NAMELEN)
  306. return NULL;
  307. while (block * BFS_BSIZE + offset < dir->i_size) {
  308. if (!bh) {
  309. bh = sb_bread(dir->i_sb, BFS_I(dir)->i_sblock + block);
  310. if (!bh) {
  311. block++;
  312. continue;
  313. }
  314. }
  315. de = (struct bfs_dirent *)(bh->b_data + offset);
  316. offset += BFS_DIRENT_SIZE;
  317. if (le16_to_cpu(de->ino) &&
  318. bfs_namecmp(namelen, name, de->name)) {
  319. *res_dir = de;
  320. return bh;
  321. }
  322. if (offset < bh->b_size)
  323. continue;
  324. brelse(bh);
  325. bh = NULL;
  326. offset = 0;
  327. block++;
  328. }
  329. brelse(bh);
  330. return NULL;
  331. }