dir.c 9.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322
  1. /*
  2. * Copyright 2000 by Hans Reiser, licensing governed by reiserfs/README
  3. */
  4. #include <linux/string.h>
  5. #include <linux/errno.h>
  6. #include <linux/fs.h>
  7. #include "reiserfs.h"
  8. #include <linux/stat.h>
  9. #include <linux/buffer_head.h>
  10. #include <linux/slab.h>
  11. #include <asm/uaccess.h>
  12. extern const struct reiserfs_key MIN_KEY;
  13. static int reiserfs_readdir(struct file *, void *, filldir_t);
  14. static int reiserfs_dir_fsync(struct file *filp, loff_t start, loff_t end,
  15. int datasync);
  16. const struct file_operations reiserfs_dir_operations = {
  17. .llseek = generic_file_llseek,
  18. .read = generic_read_dir,
  19. .readdir = reiserfs_readdir,
  20. .fsync = reiserfs_dir_fsync,
  21. .unlocked_ioctl = reiserfs_ioctl,
  22. #ifdef CONFIG_COMPAT
  23. .compat_ioctl = reiserfs_compat_ioctl,
  24. #endif
  25. };
  26. static int reiserfs_dir_fsync(struct file *filp, loff_t start, loff_t end,
  27. int datasync)
  28. {
  29. struct inode *inode = filp->f_mapping->host;
  30. int err;
  31. err = filemap_write_and_wait_range(inode->i_mapping, start, end);
  32. if (err)
  33. return err;
  34. mutex_lock(&inode->i_mutex);
  35. reiserfs_write_lock(inode->i_sb);
  36. err = reiserfs_commit_for_inode(inode);
  37. reiserfs_write_unlock(inode->i_sb);
  38. mutex_unlock(&inode->i_mutex);
  39. if (err < 0)
  40. return err;
  41. return 0;
  42. }
  43. #define store_ih(where,what) copy_item_head (where, what)
  44. static inline bool is_privroot_deh(struct dentry *dir,
  45. struct reiserfs_de_head *deh)
  46. {
  47. struct dentry *privroot = REISERFS_SB(dir->d_sb)->priv_root;
  48. return (dir == dir->d_parent && privroot->d_inode &&
  49. deh->deh_objectid == INODE_PKEY(privroot->d_inode)->k_objectid);
  50. }
  51. int reiserfs_readdir_dentry(struct dentry *dentry, void *dirent,
  52. filldir_t filldir, loff_t *pos)
  53. {
  54. struct inode *inode = dentry->d_inode;
  55. struct cpu_key pos_key; /* key of current position in the directory (key of directory entry) */
  56. INITIALIZE_PATH(path_to_entry);
  57. struct buffer_head *bh;
  58. int item_num, entry_num;
  59. const struct reiserfs_key *rkey;
  60. struct item_head *ih, tmp_ih;
  61. int search_res;
  62. char *local_buf;
  63. loff_t next_pos;
  64. char small_buf[32]; /* avoid kmalloc if we can */
  65. struct reiserfs_dir_entry de;
  66. int ret = 0;
  67. reiserfs_write_lock(inode->i_sb);
  68. reiserfs_check_lock_depth(inode->i_sb, "readdir");
  69. /* form key for search the next directory entry using f_pos field of
  70. file structure */
  71. make_cpu_key(&pos_key, inode, *pos ?: DOT_OFFSET, TYPE_DIRENTRY, 3);
  72. next_pos = cpu_key_k_offset(&pos_key);
  73. path_to_entry.reada = PATH_READA;
  74. while (1) {
  75. research:
  76. /* search the directory item, containing entry with specified key */
  77. search_res =
  78. search_by_entry_key(inode->i_sb, &pos_key, &path_to_entry,
  79. &de);
  80. if (search_res == IO_ERROR) {
  81. // FIXME: we could just skip part of directory which could
  82. // not be read
  83. ret = -EIO;
  84. goto out;
  85. }
  86. entry_num = de.de_entry_num;
  87. bh = de.de_bh;
  88. item_num = de.de_item_num;
  89. ih = de.de_ih;
  90. store_ih(&tmp_ih, ih);
  91. /* we must have found item, that is item of this directory, */
  92. RFALSE(COMP_SHORT_KEYS(&(ih->ih_key), &pos_key),
  93. "vs-9000: found item %h does not match to dir we readdir %K",
  94. ih, &pos_key);
  95. RFALSE(item_num > B_NR_ITEMS(bh) - 1,
  96. "vs-9005 item_num == %d, item amount == %d",
  97. item_num, B_NR_ITEMS(bh));
  98. /* and entry must be not more than number of entries in the item */
  99. RFALSE(I_ENTRY_COUNT(ih) < entry_num,
  100. "vs-9010: entry number is too big %d (%d)",
  101. entry_num, I_ENTRY_COUNT(ih));
  102. if (search_res == POSITION_FOUND
  103. || entry_num < I_ENTRY_COUNT(ih)) {
  104. /* go through all entries in the directory item beginning from the entry, that has been found */
  105. struct reiserfs_de_head *deh =
  106. B_I_DEH(bh, ih) + entry_num;
  107. for (; entry_num < I_ENTRY_COUNT(ih);
  108. entry_num++, deh++) {
  109. int d_reclen;
  110. char *d_name;
  111. off_t d_off;
  112. ino_t d_ino;
  113. loff_t cur_pos = deh_offset(deh);
  114. if (!de_visible(deh))
  115. /* it is hidden entry */
  116. continue;
  117. d_reclen = entry_length(bh, ih, entry_num);
  118. d_name = B_I_DEH_ENTRY_FILE_NAME(bh, ih, deh);
  119. if (d_reclen <= 0 ||
  120. d_name + d_reclen > bh->b_data + bh->b_size) {
  121. /* There is corrupted data in entry,
  122. * We'd better stop here */
  123. pathrelse(&path_to_entry);
  124. ret = -EIO;
  125. goto out;
  126. }
  127. if (!d_name[d_reclen - 1])
  128. d_reclen = strlen(d_name);
  129. if (d_reclen >
  130. REISERFS_MAX_NAME(inode->i_sb->
  131. s_blocksize)) {
  132. /* too big to send back to VFS */
  133. continue;
  134. }
  135. /* Ignore the .reiserfs_priv entry */
  136. if (is_privroot_deh(dentry, deh))
  137. continue;
  138. d_off = deh_offset(deh);
  139. *pos = d_off;
  140. d_ino = deh_objectid(deh);
  141. if (d_reclen <= 32) {
  142. local_buf = small_buf;
  143. } else {
  144. local_buf = kmalloc(d_reclen,
  145. GFP_NOFS);
  146. if (!local_buf) {
  147. pathrelse(&path_to_entry);
  148. ret = -ENOMEM;
  149. goto out;
  150. }
  151. if (item_moved(&tmp_ih, &path_to_entry)) {
  152. kfree(local_buf);
  153. goto research;
  154. }
  155. }
  156. // Note, that we copy name to user space via temporary
  157. // buffer (local_buf) because filldir will block if
  158. // user space buffer is swapped out. At that time
  159. // entry can move to somewhere else
  160. memcpy(local_buf, d_name, d_reclen);
  161. /*
  162. * Since filldir might sleep, we can release
  163. * the write lock here for other waiters
  164. */
  165. reiserfs_write_unlock(inode->i_sb);
  166. if (filldir
  167. (dirent, local_buf, d_reclen, d_off, d_ino,
  168. DT_UNKNOWN) < 0) {
  169. reiserfs_write_lock(inode->i_sb);
  170. if (local_buf != small_buf) {
  171. kfree(local_buf);
  172. }
  173. goto end;
  174. }
  175. reiserfs_write_lock(inode->i_sb);
  176. if (local_buf != small_buf) {
  177. kfree(local_buf);
  178. }
  179. /* deh_offset(deh) may be invalid now. */
  180. next_pos = cur_pos + 1;
  181. if (item_moved(&tmp_ih, &path_to_entry)) {
  182. goto research;
  183. }
  184. } /* for */
  185. }
  186. if (item_num != B_NR_ITEMS(bh) - 1)
  187. // end of directory has been reached
  188. goto end;
  189. /* item we went through is last item of node. Using right
  190. delimiting key check is it directory end */
  191. rkey = get_rkey(&path_to_entry, inode->i_sb);
  192. if (!comp_le_keys(rkey, &MIN_KEY)) {
  193. /* set pos_key to key, that is the smallest and greater
  194. that key of the last entry in the item */
  195. set_cpu_key_k_offset(&pos_key, next_pos);
  196. continue;
  197. }
  198. if (COMP_SHORT_KEYS(rkey, &pos_key)) {
  199. // end of directory has been reached
  200. goto end;
  201. }
  202. /* directory continues in the right neighboring block */
  203. set_cpu_key_k_offset(&pos_key,
  204. le_key_k_offset(KEY_FORMAT_3_5, rkey));
  205. } /* while */
  206. end:
  207. *pos = next_pos;
  208. pathrelse(&path_to_entry);
  209. reiserfs_check_path(&path_to_entry);
  210. out:
  211. reiserfs_write_unlock(inode->i_sb);
  212. return ret;
  213. }
  214. static int reiserfs_readdir(struct file *file, void *dirent, filldir_t filldir)
  215. {
  216. struct dentry *dentry = file->f_path.dentry;
  217. return reiserfs_readdir_dentry(dentry, dirent, filldir, &file->f_pos);
  218. }
  219. /* compose directory item containing "." and ".." entries (entries are
  220. not aligned to 4 byte boundary) */
  221. /* the last four params are LE */
  222. void make_empty_dir_item_v1(char *body, __le32 dirid, __le32 objid,
  223. __le32 par_dirid, __le32 par_objid)
  224. {
  225. struct reiserfs_de_head *deh;
  226. memset(body, 0, EMPTY_DIR_SIZE_V1);
  227. deh = (struct reiserfs_de_head *)body;
  228. /* direntry header of "." */
  229. put_deh_offset(&(deh[0]), DOT_OFFSET);
  230. /* these two are from make_le_item_head, and are are LE */
  231. deh[0].deh_dir_id = dirid;
  232. deh[0].deh_objectid = objid;
  233. deh[0].deh_state = 0; /* Endian safe if 0 */
  234. put_deh_location(&(deh[0]), EMPTY_DIR_SIZE_V1 - strlen("."));
  235. mark_de_visible(&(deh[0]));
  236. /* direntry header of ".." */
  237. put_deh_offset(&(deh[1]), DOT_DOT_OFFSET);
  238. /* key of ".." for the root directory */
  239. /* these two are from the inode, and are are LE */
  240. deh[1].deh_dir_id = par_dirid;
  241. deh[1].deh_objectid = par_objid;
  242. deh[1].deh_state = 0; /* Endian safe if 0 */
  243. put_deh_location(&(deh[1]), deh_location(&(deh[0])) - strlen(".."));
  244. mark_de_visible(&(deh[1]));
  245. /* copy ".." and "." */
  246. memcpy(body + deh_location(&(deh[0])), ".", 1);
  247. memcpy(body + deh_location(&(deh[1])), "..", 2);
  248. }
  249. /* compose directory item containing "." and ".." entries */
  250. void make_empty_dir_item(char *body, __le32 dirid, __le32 objid,
  251. __le32 par_dirid, __le32 par_objid)
  252. {
  253. struct reiserfs_de_head *deh;
  254. memset(body, 0, EMPTY_DIR_SIZE);
  255. deh = (struct reiserfs_de_head *)body;
  256. /* direntry header of "." */
  257. put_deh_offset(&(deh[0]), DOT_OFFSET);
  258. /* these two are from make_le_item_head, and are are LE */
  259. deh[0].deh_dir_id = dirid;
  260. deh[0].deh_objectid = objid;
  261. deh[0].deh_state = 0; /* Endian safe if 0 */
  262. put_deh_location(&(deh[0]), EMPTY_DIR_SIZE - ROUND_UP(strlen(".")));
  263. mark_de_visible(&(deh[0]));
  264. /* direntry header of ".." */
  265. put_deh_offset(&(deh[1]), DOT_DOT_OFFSET);
  266. /* key of ".." for the root directory */
  267. /* these two are from the inode, and are are LE */
  268. deh[1].deh_dir_id = par_dirid;
  269. deh[1].deh_objectid = par_objid;
  270. deh[1].deh_state = 0; /* Endian safe if 0 */
  271. put_deh_location(&(deh[1]),
  272. deh_location(&(deh[0])) - ROUND_UP(strlen("..")));
  273. mark_de_visible(&(deh[1]));
  274. /* copy ".." and "." */
  275. memcpy(body + deh_location(&(deh[0])), ".", 1);
  276. memcpy(body + deh_location(&(deh[1])), "..", 2);
  277. }