dir.c 8.9 KB

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