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