dir.c 8.7 KB

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