dir.c 8.9 KB

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