dir.c 8.9 KB

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