dir.c 8.6 KB

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