dir.c 8.3 KB

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