]>
Commit | Line | Data |
---|---|---|
ac27a0ec | 1 | /* |
617ba13b | 2 | * linux/fs/ext4/dir.c |
ac27a0ec DK |
3 | * |
4 | * Copyright (C) 1992, 1993, 1994, 1995 | |
5 | * Remy Card (card@masi.ibp.fr) | |
6 | * Laboratoire MASI - Institut Blaise Pascal | |
7 | * Universite Pierre et Marie Curie (Paris VI) | |
8 | * | |
9 | * from | |
10 | * | |
11 | * linux/fs/minix/dir.c | |
12 | * | |
13 | * Copyright (C) 1991, 1992 Linus Torvalds | |
14 | * | |
617ba13b | 15 | * ext4 directory handling functions |
ac27a0ec DK |
16 | * |
17 | * Big-endian to little-endian byte-swapping/bitmaps by | |
18 | * David S. Miller (davem@caip.rutgers.edu), 1995 | |
19 | * | |
20 | * Hash Tree Directory indexing (c) 2001 Daniel Phillips | |
21 | * | |
22 | */ | |
23 | ||
24 | #include <linux/fs.h> | |
ac27a0ec | 25 | #include <linux/buffer_head.h> |
ac27a0ec | 26 | #include <linux/slab.h> |
3dcf5451 | 27 | #include "ext4.h" |
65d165d9 | 28 | #include "xattr.h" |
ac27a0ec | 29 | |
725bebb2 | 30 | static int ext4_dx_readdir(struct file *, struct dir_context *); |
ac27a0ec | 31 | |
d1f5273e FY |
32 | /** |
33 | * Check if the given dir-inode refers to an htree-indexed directory | |
70261f56 | 34 | * (or a directory which could potentially get converted to use htree |
d1f5273e FY |
35 | * indexing). |
36 | * | |
37 | * Return 1 if it is a dx dir, 0 if not | |
38 | */ | |
39 | static int is_dx_dir(struct inode *inode) | |
40 | { | |
41 | struct super_block *sb = inode->i_sb; | |
42 | ||
43 | if (EXT4_HAS_COMPAT_FEATURE(inode->i_sb, | |
44 | EXT4_FEATURE_COMPAT_DIR_INDEX) && | |
45 | ((ext4_test_inode_flag(inode, EXT4_INODE_INDEX)) || | |
8af0f082 TM |
46 | ((inode->i_size >> sb->s_blocksize_bits) == 1) || |
47 | ext4_has_inline_data(inode))) | |
d1f5273e FY |
48 | return 1; |
49 | ||
50 | return 0; | |
51 | } | |
52 | ||
cad3f007 TT |
53 | /* |
54 | * Return 0 if the directory entry is OK, and 1 if there is a problem | |
55 | * | |
56 | * Note: this is the opposite of what ext2 and ext3 historically returned... | |
65d165d9 TM |
57 | * |
58 | * bh passed here can be an inode block or a dir data block, depending | |
59 | * on the inode inline data flag. | |
cad3f007 | 60 | */ |
60fd4da3 | 61 | int __ext4_check_dir_entry(const char *function, unsigned int line, |
f7c21177 | 62 | struct inode *dir, struct file *filp, |
60fd4da3 | 63 | struct ext4_dir_entry_2 *de, |
226ba972 | 64 | struct buffer_head *bh, char *buf, int size, |
60fd4da3 | 65 | unsigned int offset) |
ac27a0ec | 66 | { |
af5bc92d | 67 | const char *error_msg = NULL; |
3d0518f4 WY |
68 | const int rlen = ext4_rec_len_from_disk(de->rec_len, |
69 | dir->i_sb->s_blocksize); | |
ac27a0ec | 70 | |
cad3f007 | 71 | if (unlikely(rlen < EXT4_DIR_REC_LEN(1))) |
ac27a0ec | 72 | error_msg = "rec_len is smaller than minimal"; |
cad3f007 | 73 | else if (unlikely(rlen % 4 != 0)) |
ac27a0ec | 74 | error_msg = "rec_len % 4 != 0"; |
cad3f007 | 75 | else if (unlikely(rlen < EXT4_DIR_REC_LEN(de->name_len))) |
ac27a0ec | 76 | error_msg = "rec_len is too small for name_len"; |
226ba972 TM |
77 | else if (unlikely(((char *) de - buf) + rlen > size)) |
78 | error_msg = "directory entry across range"; | |
cad3f007 TT |
79 | else if (unlikely(le32_to_cpu(de->inode) > |
80 | le32_to_cpu(EXT4_SB(dir->i_sb)->s_es->s_inodes_count))) | |
ac27a0ec | 81 | error_msg = "inode out of bounds"; |
cad3f007 TT |
82 | else |
83 | return 0; | |
84 | ||
f7c21177 | 85 | if (filp) |
4fda4003 | 86 | ext4_error_file(filp, function, line, bh->b_blocknr, |
f7c21177 TT |
87 | "bad entry in directory: %s - offset=%u(%u), " |
88 | "inode=%u, rec_len=%d, name_len=%d", | |
226ba972 | 89 | error_msg, (unsigned) (offset % size), |
f7c21177 TT |
90 | offset, le32_to_cpu(de->inode), |
91 | rlen, de->name_len); | |
92 | else | |
4fda4003 | 93 | ext4_error_inode(dir, function, line, bh->b_blocknr, |
f7c21177 TT |
94 | "bad entry in directory: %s - offset=%u(%u), " |
95 | "inode=%u, rec_len=%d, name_len=%d", | |
226ba972 | 96 | error_msg, (unsigned) (offset % size), |
f7c21177 TT |
97 | offset, le32_to_cpu(de->inode), |
98 | rlen, de->name_len); | |
99 | ||
cad3f007 | 100 | return 1; |
ac27a0ec DK |
101 | } |
102 | ||
725bebb2 | 103 | static int ext4_readdir(struct file *file, struct dir_context *ctx) |
ac27a0ec | 104 | { |
498e5f24 | 105 | unsigned int offset; |
aa13d5f6 | 106 | int i; |
617ba13b | 107 | struct ext4_dir_entry_2 *de; |
ac27a0ec | 108 | int err; |
725bebb2 | 109 | struct inode *inode = file_inode(file); |
d1f5273e | 110 | struct super_block *sb = inode->i_sb; |
9d9f1775 | 111 | int dir_has_error = 0; |
ac27a0ec | 112 | |
d1f5273e | 113 | if (is_dx_dir(inode)) { |
725bebb2 | 114 | err = ext4_dx_readdir(file, ctx); |
ac27a0ec | 115 | if (err != ERR_BAD_DX_DIR) { |
725bebb2 | 116 | return err; |
ac27a0ec DK |
117 | } |
118 | /* | |
119 | * We don't set the inode dirty flag since it's not | |
120 | * critical that it get flushed back to the disk. | |
121 | */ | |
725bebb2 | 122 | ext4_clear_inode_flag(file_inode(file), |
07a03824 | 123 | EXT4_INODE_INDEX); |
ac27a0ec | 124 | } |
8af0f082 TM |
125 | |
126 | if (ext4_has_inline_data(inode)) { | |
127 | int has_inline_data = 1; | |
725bebb2 | 128 | int ret = ext4_read_inline_dir(file, ctx, |
8af0f082 TM |
129 | &has_inline_data); |
130 | if (has_inline_data) | |
131 | return ret; | |
132 | } | |
133 | ||
725bebb2 | 134 | offset = ctx->pos & (sb->s_blocksize - 1); |
ac27a0ec | 135 | |
725bebb2 | 136 | while (ctx->pos < inode->i_size) { |
2ed88685 | 137 | struct ext4_map_blocks map; |
ac27a0ec DK |
138 | struct buffer_head *bh = NULL; |
139 | ||
725bebb2 | 140 | map.m_lblk = ctx->pos >> EXT4_BLOCK_SIZE_BITS(sb); |
2ed88685 TT |
141 | map.m_len = 1; |
142 | err = ext4_map_blocks(NULL, inode, &map, 0); | |
ac27a0ec | 143 | if (err > 0) { |
2ed88685 | 144 | pgoff_t index = map.m_pblk >> |
dc7868fc | 145 | (PAGE_CACHE_SHIFT - inode->i_blkbits); |
725bebb2 | 146 | if (!ra_has_index(&file->f_ra, index)) |
cf914a7d | 147 | page_cache_sync_readahead( |
dc7868fc | 148 | sb->s_bdev->bd_inode->i_mapping, |
725bebb2 | 149 | &file->f_ra, file, |
cf914a7d | 150 | index, 1); |
725bebb2 | 151 | file->f_ra.prev_pos = (loff_t)index << PAGE_CACHE_SHIFT; |
1c215028 TT |
152 | bh = ext4_bread(NULL, inode, map.m_lblk, 0); |
153 | if (IS_ERR(bh)) | |
154 | return PTR_ERR(bh); | |
ac27a0ec DK |
155 | } |
156 | ||
ac27a0ec | 157 | if (!bh) { |
9d9f1775 | 158 | if (!dir_has_error) { |
725bebb2 | 159 | EXT4_ERROR_FILE(file, 0, |
f7c21177 TT |
160 | "directory contains a " |
161 | "hole at offset %llu", | |
725bebb2 | 162 | (unsigned long long) ctx->pos); |
9d9f1775 ES |
163 | dir_has_error = 1; |
164 | } | |
e6c40211 | 165 | /* corrupt size? Maybe no more blocks to read */ |
725bebb2 | 166 | if (ctx->pos > inode->i_blocks << 9) |
e6c40211 | 167 | break; |
725bebb2 | 168 | ctx->pos += sb->s_blocksize - offset; |
ac27a0ec DK |
169 | continue; |
170 | } | |
171 | ||
b0336e8d DW |
172 | /* Check the checksum */ |
173 | if (!buffer_verified(bh) && | |
174 | !ext4_dirent_csum_verify(inode, | |
175 | (struct ext4_dir_entry *)bh->b_data)) { | |
725bebb2 | 176 | EXT4_ERROR_FILE(file, 0, "directory fails checksum " |
b0336e8d | 177 | "at offset %llu", |
725bebb2 AV |
178 | (unsigned long long)ctx->pos); |
179 | ctx->pos += sb->s_blocksize - offset; | |
d5ac7773 | 180 | brelse(bh); |
b0336e8d DW |
181 | continue; |
182 | } | |
183 | set_buffer_verified(bh); | |
184 | ||
ac27a0ec DK |
185 | /* If the dir block has changed since the last call to |
186 | * readdir(2), then we might be pointing to an invalid | |
187 | * dirent right now. Scan from the start of the block | |
188 | * to make sure. */ | |
725bebb2 | 189 | if (file->f_version != inode->i_version) { |
ac27a0ec | 190 | for (i = 0; i < sb->s_blocksize && i < offset; ) { |
617ba13b | 191 | de = (struct ext4_dir_entry_2 *) |
ac27a0ec DK |
192 | (bh->b_data + i); |
193 | /* It's too expensive to do a full | |
194 | * dirent test each time round this | |
195 | * loop, but we do have to test at | |
196 | * least that it is non-zero. A | |
197 | * failure will be detected in the | |
198 | * dirent test below. */ | |
3d0518f4 WY |
199 | if (ext4_rec_len_from_disk(de->rec_len, |
200 | sb->s_blocksize) < EXT4_DIR_REC_LEN(1)) | |
ac27a0ec | 201 | break; |
3d0518f4 WY |
202 | i += ext4_rec_len_from_disk(de->rec_len, |
203 | sb->s_blocksize); | |
ac27a0ec DK |
204 | } |
205 | offset = i; | |
725bebb2 | 206 | ctx->pos = (ctx->pos & ~(sb->s_blocksize - 1)) |
ac27a0ec | 207 | | offset; |
725bebb2 | 208 | file->f_version = inode->i_version; |
ac27a0ec DK |
209 | } |
210 | ||
725bebb2 | 211 | while (ctx->pos < inode->i_size |
ac27a0ec | 212 | && offset < sb->s_blocksize) { |
617ba13b | 213 | de = (struct ext4_dir_entry_2 *) (bh->b_data + offset); |
725bebb2 | 214 | if (ext4_check_dir_entry(inode, file, de, bh, |
226ba972 TM |
215 | bh->b_data, bh->b_size, |
216 | offset)) { | |
63f57933 | 217 | /* |
725bebb2 | 218 | * On error, skip to the next block |
63f57933 | 219 | */ |
725bebb2 | 220 | ctx->pos = (ctx->pos | |
ac27a0ec | 221 | (sb->s_blocksize - 1)) + 1; |
725bebb2 | 222 | break; |
ac27a0ec | 223 | } |
3d0518f4 WY |
224 | offset += ext4_rec_len_from_disk(de->rec_len, |
225 | sb->s_blocksize); | |
ac27a0ec | 226 | if (le32_to_cpu(de->inode)) { |
725bebb2 | 227 | if (!dir_emit(ctx, de->name, |
ac27a0ec | 228 | de->name_len, |
ac27a0ec | 229 | le32_to_cpu(de->inode), |
725bebb2 AV |
230 | get_dtype(sb, de->file_type))) { |
231 | brelse(bh); | |
232 | return 0; | |
233 | } | |
ac27a0ec | 234 | } |
725bebb2 | 235 | ctx->pos += ext4_rec_len_from_disk(de->rec_len, |
3d0518f4 | 236 | sb->s_blocksize); |
ac27a0ec DK |
237 | } |
238 | offset = 0; | |
af5bc92d | 239 | brelse(bh); |
725bebb2 AV |
240 | if (ctx->pos < inode->i_size) { |
241 | if (!dir_relax(inode)) | |
242 | return 0; | |
243 | } | |
ac27a0ec | 244 | } |
725bebb2 | 245 | return 0; |
ac27a0ec DK |
246 | } |
247 | ||
d1f5273e FY |
248 | static inline int is_32bit_api(void) |
249 | { | |
250 | #ifdef CONFIG_COMPAT | |
251 | return is_compat_task(); | |
252 | #else | |
253 | return (BITS_PER_LONG == 32); | |
254 | #endif | |
255 | } | |
256 | ||
ac27a0ec DK |
257 | /* |
258 | * These functions convert from the major/minor hash to an f_pos | |
d1f5273e FY |
259 | * value for dx directories |
260 | * | |
261 | * Upper layer (for example NFS) should specify FMODE_32BITHASH or | |
262 | * FMODE_64BITHASH explicitly. On the other hand, we allow ext4 to be mounted | |
263 | * directly on both 32-bit and 64-bit nodes, under such case, neither | |
264 | * FMODE_32BITHASH nor FMODE_64BITHASH is specified. | |
265 | */ | |
266 | static inline loff_t hash2pos(struct file *filp, __u32 major, __u32 minor) | |
267 | { | |
268 | if ((filp->f_mode & FMODE_32BITHASH) || | |
269 | (!(filp->f_mode & FMODE_64BITHASH) && is_32bit_api())) | |
270 | return major >> 1; | |
271 | else | |
272 | return ((__u64)(major >> 1) << 32) | (__u64)minor; | |
273 | } | |
274 | ||
275 | static inline __u32 pos2maj_hash(struct file *filp, loff_t pos) | |
276 | { | |
277 | if ((filp->f_mode & FMODE_32BITHASH) || | |
278 | (!(filp->f_mode & FMODE_64BITHASH) && is_32bit_api())) | |
279 | return (pos << 1) & 0xffffffff; | |
280 | else | |
281 | return ((pos >> 32) << 1) & 0xffffffff; | |
282 | } | |
283 | ||
284 | static inline __u32 pos2min_hash(struct file *filp, loff_t pos) | |
285 | { | |
286 | if ((filp->f_mode & FMODE_32BITHASH) || | |
287 | (!(filp->f_mode & FMODE_64BITHASH) && is_32bit_api())) | |
288 | return 0; | |
289 | else | |
290 | return pos & 0xffffffff; | |
291 | } | |
292 | ||
293 | /* | |
294 | * Return 32- or 64-bit end-of-file for dx directories | |
295 | */ | |
296 | static inline loff_t ext4_get_htree_eof(struct file *filp) | |
297 | { | |
298 | if ((filp->f_mode & FMODE_32BITHASH) || | |
299 | (!(filp->f_mode & FMODE_64BITHASH) && is_32bit_api())) | |
300 | return EXT4_HTREE_EOF_32BIT; | |
301 | else | |
302 | return EXT4_HTREE_EOF_64BIT; | |
303 | } | |
304 | ||
305 | ||
306 | /* | |
ec7268ce ES |
307 | * ext4_dir_llseek() calls generic_file_llseek_size to handle htree |
308 | * directories, where the "offset" is in terms of the filename hash | |
309 | * value instead of the byte offset. | |
ac27a0ec | 310 | * |
ec7268ce ES |
311 | * Because we may return a 64-bit hash that is well beyond offset limits, |
312 | * we need to pass the max hash as the maximum allowable offset in | |
313 | * the htree directory case. | |
314 | * | |
315 | * For non-htree, ext4_llseek already chooses the proper max offset. | |
ac27a0ec | 316 | */ |
d4e43954 | 317 | static loff_t ext4_dir_llseek(struct file *file, loff_t offset, int whence) |
d1f5273e FY |
318 | { |
319 | struct inode *inode = file->f_mapping->host; | |
d1f5273e | 320 | int dx_dir = is_dx_dir(inode); |
ec7268ce | 321 | loff_t htree_max = ext4_get_htree_eof(file); |
d1f5273e | 322 | |
ec7268ce | 323 | if (likely(dx_dir)) |
965c8e59 | 324 | return generic_file_llseek_size(file, offset, whence, |
ec7268ce ES |
325 | htree_max, htree_max); |
326 | else | |
965c8e59 | 327 | return ext4_llseek(file, offset, whence); |
d1f5273e | 328 | } |
ac27a0ec DK |
329 | |
330 | /* | |
331 | * This structure holds the nodes of the red-black tree used to store | |
332 | * the directory entry in hash order. | |
333 | */ | |
334 | struct fname { | |
335 | __u32 hash; | |
336 | __u32 minor_hash; | |
337 | struct rb_node rb_hash; | |
338 | struct fname *next; | |
339 | __u32 inode; | |
340 | __u8 name_len; | |
341 | __u8 file_type; | |
342 | char name[0]; | |
343 | }; | |
344 | ||
345 | /* | |
346 | * This functoin implements a non-recursive way of freeing all of the | |
347 | * nodes in the red-black tree. | |
348 | */ | |
349 | static void free_rb_tree_fname(struct rb_root *root) | |
350 | { | |
d1866bd0 CS |
351 | struct fname *fname, *next; |
352 | ||
353 | rbtree_postorder_for_each_entry_safe(fname, next, root, rb_hash) | |
ac27a0ec | 354 | while (fname) { |
af5bc92d | 355 | struct fname *old = fname; |
ac27a0ec | 356 | fname = fname->next; |
af5bc92d | 357 | kfree(old); |
ac27a0ec | 358 | } |
d1866bd0 CS |
359 | |
360 | *root = RB_ROOT; | |
ac27a0ec DK |
361 | } |
362 | ||
363 | ||
d1f5273e FY |
364 | static struct dir_private_info *ext4_htree_create_dir_info(struct file *filp, |
365 | loff_t pos) | |
ac27a0ec DK |
366 | { |
367 | struct dir_private_info *p; | |
368 | ||
69baee06 | 369 | p = kzalloc(sizeof(struct dir_private_info), GFP_KERNEL); |
ac27a0ec DK |
370 | if (!p) |
371 | return NULL; | |
d1f5273e FY |
372 | p->curr_hash = pos2maj_hash(filp, pos); |
373 | p->curr_minor_hash = pos2min_hash(filp, pos); | |
ac27a0ec DK |
374 | return p; |
375 | } | |
376 | ||
617ba13b | 377 | void ext4_htree_free_dir_info(struct dir_private_info *p) |
ac27a0ec DK |
378 | { |
379 | free_rb_tree_fname(&p->root); | |
380 | kfree(p); | |
381 | } | |
382 | ||
383 | /* | |
384 | * Given a directory entry, enter it into the fname rb tree. | |
2f61830a TT |
385 | * |
386 | * When filename encryption is enabled, the dirent will hold the | |
387 | * encrypted filename, while the htree will hold decrypted filename. | |
388 | * The decrypted filename is passed in via ent_name. parameter. | |
ac27a0ec | 389 | */ |
617ba13b | 390 | int ext4_htree_store_dirent(struct file *dir_file, __u32 hash, |
ac27a0ec | 391 | __u32 minor_hash, |
2f61830a TT |
392 | struct ext4_dir_entry_2 *dirent, |
393 | struct ext4_str *ent_name) | |
ac27a0ec DK |
394 | { |
395 | struct rb_node **p, *parent = NULL; | |
af5bc92d | 396 | struct fname *fname, *new_fn; |
ac27a0ec DK |
397 | struct dir_private_info *info; |
398 | int len; | |
399 | ||
a271fe85 | 400 | info = dir_file->private_data; |
ac27a0ec DK |
401 | p = &info->root.rb_node; |
402 | ||
403 | /* Create and allocate the fname structure */ | |
2f61830a | 404 | len = sizeof(struct fname) + ent_name->len + 1; |
ac27a0ec DK |
405 | new_fn = kzalloc(len, GFP_KERNEL); |
406 | if (!new_fn) | |
407 | return -ENOMEM; | |
408 | new_fn->hash = hash; | |
409 | new_fn->minor_hash = minor_hash; | |
410 | new_fn->inode = le32_to_cpu(dirent->inode); | |
2f61830a | 411 | new_fn->name_len = ent_name->len; |
ac27a0ec | 412 | new_fn->file_type = dirent->file_type; |
2f61830a TT |
413 | memcpy(new_fn->name, ent_name->name, ent_name->len); |
414 | new_fn->name[ent_name->len] = 0; | |
ac27a0ec DK |
415 | |
416 | while (*p) { | |
417 | parent = *p; | |
418 | fname = rb_entry(parent, struct fname, rb_hash); | |
419 | ||
420 | /* | |
421 | * If the hash and minor hash match up, then we put | |
422 | * them on a linked list. This rarely happens... | |
423 | */ | |
424 | if ((new_fn->hash == fname->hash) && | |
425 | (new_fn->minor_hash == fname->minor_hash)) { | |
426 | new_fn->next = fname->next; | |
427 | fname->next = new_fn; | |
428 | return 0; | |
429 | } | |
430 | ||
431 | if (new_fn->hash < fname->hash) | |
432 | p = &(*p)->rb_left; | |
433 | else if (new_fn->hash > fname->hash) | |
434 | p = &(*p)->rb_right; | |
435 | else if (new_fn->minor_hash < fname->minor_hash) | |
436 | p = &(*p)->rb_left; | |
437 | else /* if (new_fn->minor_hash > fname->minor_hash) */ | |
438 | p = &(*p)->rb_right; | |
439 | } | |
440 | ||
441 | rb_link_node(&new_fn->rb_hash, parent, p); | |
442 | rb_insert_color(&new_fn->rb_hash, &info->root); | |
443 | return 0; | |
444 | } | |
445 | ||
446 | ||
447 | ||
448 | /* | |
617ba13b | 449 | * This is a helper function for ext4_dx_readdir. It calls filldir |
ac27a0ec DK |
450 | * for all entres on the fname linked list. (Normally there is only |
451 | * one entry on the linked list, unless there are 62 bit hash collisions.) | |
452 | */ | |
725bebb2 AV |
453 | static int call_filldir(struct file *file, struct dir_context *ctx, |
454 | struct fname *fname) | |
ac27a0ec | 455 | { |
725bebb2 AV |
456 | struct dir_private_info *info = file->private_data; |
457 | struct inode *inode = file_inode(file); | |
458 | struct super_block *sb = inode->i_sb; | |
ac27a0ec DK |
459 | |
460 | if (!fname) { | |
92b97816 TT |
461 | ext4_msg(sb, KERN_ERR, "%s:%d: inode #%lu: comm %s: " |
462 | "called with null fname?!?", __func__, __LINE__, | |
463 | inode->i_ino, current->comm); | |
ac27a0ec DK |
464 | return 0; |
465 | } | |
725bebb2 | 466 | ctx->pos = hash2pos(file, fname->hash, fname->minor_hash); |
ac27a0ec | 467 | while (fname) { |
725bebb2 AV |
468 | if (!dir_emit(ctx, fname->name, |
469 | fname->name_len, | |
ac27a0ec | 470 | fname->inode, |
725bebb2 | 471 | get_dtype(sb, fname->file_type))) { |
d0156417 | 472 | info->extra_fname = fname; |
725bebb2 | 473 | return 1; |
ac27a0ec DK |
474 | } |
475 | fname = fname->next; | |
476 | } | |
477 | return 0; | |
478 | } | |
479 | ||
725bebb2 | 480 | static int ext4_dx_readdir(struct file *file, struct dir_context *ctx) |
ac27a0ec | 481 | { |
725bebb2 AV |
482 | struct dir_private_info *info = file->private_data; |
483 | struct inode *inode = file_inode(file); | |
ac27a0ec DK |
484 | struct fname *fname; |
485 | int ret; | |
486 | ||
487 | if (!info) { | |
725bebb2 | 488 | info = ext4_htree_create_dir_info(file, ctx->pos); |
ac27a0ec DK |
489 | if (!info) |
490 | return -ENOMEM; | |
725bebb2 | 491 | file->private_data = info; |
ac27a0ec DK |
492 | } |
493 | ||
725bebb2 | 494 | if (ctx->pos == ext4_get_htree_eof(file)) |
ac27a0ec DK |
495 | return 0; /* EOF */ |
496 | ||
497 | /* Some one has messed with f_pos; reset the world */ | |
725bebb2 | 498 | if (info->last_pos != ctx->pos) { |
ac27a0ec DK |
499 | free_rb_tree_fname(&info->root); |
500 | info->curr_node = NULL; | |
501 | info->extra_fname = NULL; | |
725bebb2 AV |
502 | info->curr_hash = pos2maj_hash(file, ctx->pos); |
503 | info->curr_minor_hash = pos2min_hash(file, ctx->pos); | |
ac27a0ec DK |
504 | } |
505 | ||
506 | /* | |
507 | * If there are any leftover names on the hash collision | |
508 | * chain, return them first. | |
509 | */ | |
d0156417 | 510 | if (info->extra_fname) { |
725bebb2 | 511 | if (call_filldir(file, ctx, info->extra_fname)) |
d0156417 | 512 | goto finished; |
d0156417 | 513 | info->extra_fname = NULL; |
3c37fc86 | 514 | goto next_node; |
d0156417 | 515 | } else if (!info->curr_node) |
ac27a0ec DK |
516 | info->curr_node = rb_first(&info->root); |
517 | ||
518 | while (1) { | |
519 | /* | |
520 | * Fill the rbtree if we have no more entries, | |
521 | * or the inode has changed since we last read in the | |
522 | * cached entries. | |
523 | */ | |
524 | if ((!info->curr_node) || | |
725bebb2 | 525 | (file->f_version != inode->i_version)) { |
ac27a0ec DK |
526 | info->curr_node = NULL; |
527 | free_rb_tree_fname(&info->root); | |
725bebb2 AV |
528 | file->f_version = inode->i_version; |
529 | ret = ext4_htree_fill_tree(file, info->curr_hash, | |
ac27a0ec DK |
530 | info->curr_minor_hash, |
531 | &info->next_hash); | |
532 | if (ret < 0) | |
533 | return ret; | |
534 | if (ret == 0) { | |
725bebb2 | 535 | ctx->pos = ext4_get_htree_eof(file); |
ac27a0ec DK |
536 | break; |
537 | } | |
538 | info->curr_node = rb_first(&info->root); | |
539 | } | |
540 | ||
541 | fname = rb_entry(info->curr_node, struct fname, rb_hash); | |
542 | info->curr_hash = fname->hash; | |
543 | info->curr_minor_hash = fname->minor_hash; | |
725bebb2 | 544 | if (call_filldir(file, ctx, fname)) |
ac27a0ec | 545 | break; |
3c37fc86 | 546 | next_node: |
ac27a0ec | 547 | info->curr_node = rb_next(info->curr_node); |
3c37fc86 TT |
548 | if (info->curr_node) { |
549 | fname = rb_entry(info->curr_node, struct fname, | |
550 | rb_hash); | |
551 | info->curr_hash = fname->hash; | |
552 | info->curr_minor_hash = fname->minor_hash; | |
553 | } else { | |
ac27a0ec | 554 | if (info->next_hash == ~0) { |
725bebb2 | 555 | ctx->pos = ext4_get_htree_eof(file); |
ac27a0ec DK |
556 | break; |
557 | } | |
558 | info->curr_hash = info->next_hash; | |
559 | info->curr_minor_hash = 0; | |
560 | } | |
561 | } | |
562 | finished: | |
725bebb2 | 563 | info->last_pos = ctx->pos; |
ac27a0ec DK |
564 | return 0; |
565 | } | |
566 | ||
af5bc92d | 567 | static int ext4_release_dir(struct inode *inode, struct file *filp) |
ac27a0ec | 568 | { |
63f57933 | 569 | if (filp->private_data) |
617ba13b | 570 | ext4_htree_free_dir_info(filp->private_data); |
ac27a0ec DK |
571 | |
572 | return 0; | |
573 | } | |
d1f5273e | 574 | |
40b163f1 DW |
575 | int ext4_check_all_de(struct inode *dir, struct buffer_head *bh, void *buf, |
576 | int buf_size) | |
577 | { | |
578 | struct ext4_dir_entry_2 *de; | |
579 | int nlen, rlen; | |
580 | unsigned int offset = 0; | |
581 | char *top; | |
582 | ||
583 | de = (struct ext4_dir_entry_2 *)buf; | |
584 | top = buf + buf_size; | |
585 | while ((char *) de < top) { | |
586 | if (ext4_check_dir_entry(dir, NULL, de, bh, | |
587 | buf, buf_size, offset)) | |
588 | return -EIO; | |
589 | nlen = EXT4_DIR_REC_LEN(de->name_len); | |
590 | rlen = ext4_rec_len_from_disk(de->rec_len, buf_size); | |
591 | de = (struct ext4_dir_entry_2 *)((char *)de + rlen); | |
592 | offset += rlen; | |
593 | } | |
594 | if ((char *) de > top) | |
595 | return -EIO; | |
596 | ||
597 | return 0; | |
598 | } | |
599 | ||
d1f5273e FY |
600 | const struct file_operations ext4_dir_operations = { |
601 | .llseek = ext4_dir_llseek, | |
602 | .read = generic_read_dir, | |
725bebb2 | 603 | .iterate = ext4_readdir, |
d1f5273e FY |
604 | .unlocked_ioctl = ext4_ioctl, |
605 | #ifdef CONFIG_COMPAT | |
606 | .compat_ioctl = ext4_compat_ioctl, | |
607 | #endif | |
608 | .fsync = ext4_sync_file, | |
609 | .release = ext4_release_dir, | |
610 | }; |