dir.c 8.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370
  1. // SPDX-License-Identifier: GPL-2.0
  2. /*
  3. * fs/bfs/dir.c
  4. * BFS directory operations.
  5. * Copyright (C) 1999,2000 Tigran Aivazian <tigran@veritas.com>
  6. * Made endianness-clean by Andrew Stribblehill <ads@wompom.org> 2005
  7. */
  8. #include <linux/time.h>
  9. #include <linux/string.h>
  10. #include <linux/fs.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, struct dir_context *ctx)
  26. {
  27. struct inode *dir = file_inode(f);
  28. struct buffer_head *bh;
  29. struct bfs_dirent *de;
  30. unsigned int offset;
  31. int block;
  32. if (ctx->pos & (BFS_DIRENT_SIZE - 1)) {
  33. printf("Bad f_pos=%08lx for %s:%08lx\n",
  34. (unsigned long)ctx->pos,
  35. dir->i_sb->s_id, dir->i_ino);
  36. return -EINVAL;
  37. }
  38. while (ctx->pos < dir->i_size) {
  39. offset = ctx->pos & (BFS_BSIZE - 1);
  40. block = BFS_I(dir)->i_sblock + (ctx->pos >> BFS_BSIZE_BITS);
  41. bh = sb_bread(dir->i_sb, block);
  42. if (!bh) {
  43. ctx->pos += BFS_BSIZE - offset;
  44. continue;
  45. }
  46. do {
  47. de = (struct bfs_dirent *)(bh->b_data + offset);
  48. if (de->ino) {
  49. int size = strnlen(de->name, BFS_NAMELEN);
  50. if (!dir_emit(ctx, de->name, size,
  51. le16_to_cpu(de->ino),
  52. DT_UNKNOWN)) {
  53. brelse(bh);
  54. return 0;
  55. }
  56. }
  57. offset += BFS_DIRENT_SIZE;
  58. ctx->pos += BFS_DIRENT_SIZE;
  59. } while ((offset < BFS_BSIZE) && (ctx->pos < dir->i_size));
  60. brelse(bh);
  61. }
  62. return 0;
  63. }
  64. const struct file_operations bfs_dir_operations = {
  65. .read = generic_read_dir,
  66. .iterate_shared = bfs_readdir,
  67. .fsync = generic_file_fsync,
  68. .llseek = generic_file_llseek,
  69. };
  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 -ENOMEM;
  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(inode);
  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. bfs_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 = d_inode(old);
  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(inode);
  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 = d_inode(dentry);
  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(dir);
  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. unsigned int flags)
  192. {
  193. struct inode *old_inode, *new_inode;
  194. struct buffer_head *old_bh, *new_bh;
  195. struct bfs_dirent *old_de, *new_de;
  196. struct bfs_sb_info *info;
  197. int error = -ENOENT;
  198. if (flags & ~RENAME_NOREPLACE)
  199. return -EINVAL;
  200. old_bh = new_bh = NULL;
  201. old_inode = d_inode(old_dentry);
  202. if (S_ISDIR(old_inode->i_mode))
  203. return -EINVAL;
  204. info = BFS_SB(old_inode->i_sb);
  205. mutex_lock(&info->bfs_lock);
  206. old_bh = bfs_find_entry(old_dir,
  207. old_dentry->d_name.name,
  208. old_dentry->d_name.len, &old_de);
  209. if (!old_bh || (le16_to_cpu(old_de->ino) != old_inode->i_ino))
  210. goto end_rename;
  211. error = -EPERM;
  212. new_inode = d_inode(new_dentry);
  213. new_bh = bfs_find_entry(new_dir,
  214. new_dentry->d_name.name,
  215. new_dentry->d_name.len, &new_de);
  216. if (new_bh && !new_inode) {
  217. brelse(new_bh);
  218. new_bh = NULL;
  219. }
  220. if (!new_bh) {
  221. error = bfs_add_entry(new_dir,
  222. new_dentry->d_name.name,
  223. new_dentry->d_name.len,
  224. old_inode->i_ino);
  225. if (error)
  226. goto end_rename;
  227. }
  228. old_de->ino = 0;
  229. old_dir->i_ctime = old_dir->i_mtime = current_time(old_dir);
  230. mark_inode_dirty(old_dir);
  231. if (new_inode) {
  232. new_inode->i_ctime = current_time(new_inode);
  233. inode_dec_link_count(new_inode);
  234. }
  235. mark_buffer_dirty_inode(old_bh, old_dir);
  236. error = 0;
  237. end_rename:
  238. mutex_unlock(&info->bfs_lock);
  239. brelse(old_bh);
  240. brelse(new_bh);
  241. return error;
  242. }
  243. const struct inode_operations bfs_dir_inops = {
  244. .create = bfs_create,
  245. .lookup = bfs_lookup,
  246. .link = bfs_link,
  247. .unlink = bfs_unlink,
  248. .rename = bfs_rename,
  249. };
  250. static int bfs_add_entry(struct inode *dir, const unsigned char *name,
  251. int namelen, int ino)
  252. {
  253. struct buffer_head *bh;
  254. struct bfs_dirent *de;
  255. int block, sblock, eblock, off, pos;
  256. int i;
  257. dprintf("name=%s, namelen=%d\n", name, namelen);
  258. if (!namelen)
  259. return -ENOENT;
  260. if (namelen > BFS_NAMELEN)
  261. return -ENAMETOOLONG;
  262. sblock = BFS_I(dir)->i_sblock;
  263. eblock = BFS_I(dir)->i_eblock;
  264. for (block = sblock; block <= eblock; block++) {
  265. bh = sb_bread(dir->i_sb, block);
  266. if (!bh)
  267. return -EIO;
  268. for (off = 0; off < BFS_BSIZE; off += BFS_DIRENT_SIZE) {
  269. de = (struct bfs_dirent *)(bh->b_data + off);
  270. if (!de->ino) {
  271. pos = (block - sblock) * BFS_BSIZE + off;
  272. if (pos >= dir->i_size) {
  273. dir->i_size += BFS_DIRENT_SIZE;
  274. dir->i_ctime = current_time(dir);
  275. }
  276. dir->i_mtime = current_time(dir);
  277. mark_inode_dirty(dir);
  278. de->ino = cpu_to_le16((u16)ino);
  279. for (i = 0; i < BFS_NAMELEN; i++)
  280. de->name[i] =
  281. (i < namelen) ? name[i] : 0;
  282. mark_buffer_dirty_inode(bh, dir);
  283. brelse(bh);
  284. return 0;
  285. }
  286. }
  287. brelse(bh);
  288. }
  289. return -ENOSPC;
  290. }
  291. static inline int bfs_namecmp(int len, const unsigned char *name,
  292. const char *buffer)
  293. {
  294. if ((len < BFS_NAMELEN) && buffer[len])
  295. return 0;
  296. return !memcmp(name, buffer, len);
  297. }
  298. static struct buffer_head *bfs_find_entry(struct inode *dir,
  299. const unsigned char *name, int namelen,
  300. struct bfs_dirent **res_dir)
  301. {
  302. unsigned long block = 0, offset = 0;
  303. struct buffer_head *bh = NULL;
  304. struct bfs_dirent *de;
  305. *res_dir = NULL;
  306. if (namelen > BFS_NAMELEN)
  307. return NULL;
  308. while (block * BFS_BSIZE + offset < dir->i_size) {
  309. if (!bh) {
  310. bh = sb_bread(dir->i_sb, BFS_I(dir)->i_sblock + block);
  311. if (!bh) {
  312. block++;
  313. continue;
  314. }
  315. }
  316. de = (struct bfs_dirent *)(bh->b_data + offset);
  317. offset += BFS_DIRENT_SIZE;
  318. if (le16_to_cpu(de->ino) &&
  319. bfs_namecmp(namelen, name, de->name)) {
  320. *res_dir = de;
  321. return bh;
  322. }
  323. if (offset < bh->b_size)
  324. continue;
  325. brelse(bh);
  326. bh = NULL;
  327. offset = 0;
  328. block++;
  329. }
  330. brelse(bh);
  331. return NULL;
  332. }