]> git.proxmox.com Git - mirror_ubuntu-bionic-kernel.git/blob - fs/ext4/dir.c
Merge branch 'for-linus' of git://git.kernel.org/pub/scm/linux/kernel/git/mason/linux...
[mirror_ubuntu-bionic-kernel.git] / fs / ext4 / dir.c
1 /*
2 * linux/fs/ext4/dir.c
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 *
15 * ext4 directory handling functions
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>
25 #include <linux/jbd2.h>
26 #include <linux/buffer_head.h>
27 #include <linux/slab.h>
28 #include <linux/rbtree.h>
29 #include "ext4.h"
30 #include "xattr.h"
31
32 static int ext4_dx_readdir(struct file *, struct dir_context *);
33
34 /**
35 * Check if the given dir-inode refers to an htree-indexed directory
36 * (or a directory which could potentially get converted to use htree
37 * indexing).
38 *
39 * Return 1 if it is a dx dir, 0 if not
40 */
41 static int is_dx_dir(struct inode *inode)
42 {
43 struct super_block *sb = inode->i_sb;
44
45 if (EXT4_HAS_COMPAT_FEATURE(inode->i_sb,
46 EXT4_FEATURE_COMPAT_DIR_INDEX) &&
47 ((ext4_test_inode_flag(inode, EXT4_INODE_INDEX)) ||
48 ((inode->i_size >> sb->s_blocksize_bits) == 1) ||
49 ext4_has_inline_data(inode)))
50 return 1;
51
52 return 0;
53 }
54
55 /*
56 * Return 0 if the directory entry is OK, and 1 if there is a problem
57 *
58 * Note: this is the opposite of what ext2 and ext3 historically returned...
59 *
60 * bh passed here can be an inode block or a dir data block, depending
61 * on the inode inline data flag.
62 */
63 int __ext4_check_dir_entry(const char *function, unsigned int line,
64 struct inode *dir, struct file *filp,
65 struct ext4_dir_entry_2 *de,
66 struct buffer_head *bh, char *buf, int size,
67 unsigned int offset)
68 {
69 const char *error_msg = NULL;
70 const int rlen = ext4_rec_len_from_disk(de->rec_len,
71 dir->i_sb->s_blocksize);
72
73 if (unlikely(rlen < EXT4_DIR_REC_LEN(1)))
74 error_msg = "rec_len is smaller than minimal";
75 else if (unlikely(rlen % 4 != 0))
76 error_msg = "rec_len % 4 != 0";
77 else if (unlikely(rlen < EXT4_DIR_REC_LEN(de->name_len)))
78 error_msg = "rec_len is too small for name_len";
79 else if (unlikely(((char *) de - buf) + rlen > size))
80 error_msg = "directory entry across range";
81 else if (unlikely(le32_to_cpu(de->inode) >
82 le32_to_cpu(EXT4_SB(dir->i_sb)->s_es->s_inodes_count)))
83 error_msg = "inode out of bounds";
84 else
85 return 0;
86
87 if (filp)
88 ext4_error_file(filp, function, line, bh->b_blocknr,
89 "bad entry in directory: %s - offset=%u(%u), "
90 "inode=%u, rec_len=%d, name_len=%d",
91 error_msg, (unsigned) (offset % size),
92 offset, le32_to_cpu(de->inode),
93 rlen, de->name_len);
94 else
95 ext4_error_inode(dir, function, line, bh->b_blocknr,
96 "bad entry in directory: %s - offset=%u(%u), "
97 "inode=%u, rec_len=%d, name_len=%d",
98 error_msg, (unsigned) (offset % size),
99 offset, le32_to_cpu(de->inode),
100 rlen, de->name_len);
101
102 return 1;
103 }
104
105 static int ext4_readdir(struct file *file, struct dir_context *ctx)
106 {
107 unsigned int offset;
108 int i, stored;
109 struct ext4_dir_entry_2 *de;
110 int err;
111 struct inode *inode = file_inode(file);
112 struct super_block *sb = inode->i_sb;
113 int dir_has_error = 0;
114
115 if (is_dx_dir(inode)) {
116 err = ext4_dx_readdir(file, ctx);
117 if (err != ERR_BAD_DX_DIR) {
118 return err;
119 }
120 /*
121 * We don't set the inode dirty flag since it's not
122 * critical that it get flushed back to the disk.
123 */
124 ext4_clear_inode_flag(file_inode(file),
125 EXT4_INODE_INDEX);
126 }
127
128 if (ext4_has_inline_data(inode)) {
129 int has_inline_data = 1;
130 int ret = ext4_read_inline_dir(file, ctx,
131 &has_inline_data);
132 if (has_inline_data)
133 return ret;
134 }
135
136 stored = 0;
137 offset = ctx->pos & (sb->s_blocksize - 1);
138
139 while (ctx->pos < inode->i_size) {
140 struct ext4_map_blocks map;
141 struct buffer_head *bh = NULL;
142
143 map.m_lblk = ctx->pos >> EXT4_BLOCK_SIZE_BITS(sb);
144 map.m_len = 1;
145 err = ext4_map_blocks(NULL, inode, &map, 0);
146 if (err > 0) {
147 pgoff_t index = map.m_pblk >>
148 (PAGE_CACHE_SHIFT - inode->i_blkbits);
149 if (!ra_has_index(&file->f_ra, index))
150 page_cache_sync_readahead(
151 sb->s_bdev->bd_inode->i_mapping,
152 &file->f_ra, file,
153 index, 1);
154 file->f_ra.prev_pos = (loff_t)index << PAGE_CACHE_SHIFT;
155 bh = ext4_bread(NULL, inode, map.m_lblk, 0, &err);
156 }
157
158 /*
159 * We ignore I/O errors on directories so users have a chance
160 * of recovering data when there's a bad sector
161 */
162 if (!bh) {
163 if (!dir_has_error) {
164 EXT4_ERROR_FILE(file, 0,
165 "directory contains a "
166 "hole at offset %llu",
167 (unsigned long long) ctx->pos);
168 dir_has_error = 1;
169 }
170 /* corrupt size? Maybe no more blocks to read */
171 if (ctx->pos > inode->i_blocks << 9)
172 break;
173 ctx->pos += sb->s_blocksize - offset;
174 continue;
175 }
176
177 /* Check the checksum */
178 if (!buffer_verified(bh) &&
179 !ext4_dirent_csum_verify(inode,
180 (struct ext4_dir_entry *)bh->b_data)) {
181 EXT4_ERROR_FILE(file, 0, "directory fails checksum "
182 "at offset %llu",
183 (unsigned long long)ctx->pos);
184 ctx->pos += sb->s_blocksize - offset;
185 brelse(bh);
186 continue;
187 }
188 set_buffer_verified(bh);
189
190 /* If the dir block has changed since the last call to
191 * readdir(2), then we might be pointing to an invalid
192 * dirent right now. Scan from the start of the block
193 * to make sure. */
194 if (file->f_version != inode->i_version) {
195 for (i = 0; i < sb->s_blocksize && i < offset; ) {
196 de = (struct ext4_dir_entry_2 *)
197 (bh->b_data + i);
198 /* It's too expensive to do a full
199 * dirent test each time round this
200 * loop, but we do have to test at
201 * least that it is non-zero. A
202 * failure will be detected in the
203 * dirent test below. */
204 if (ext4_rec_len_from_disk(de->rec_len,
205 sb->s_blocksize) < EXT4_DIR_REC_LEN(1))
206 break;
207 i += ext4_rec_len_from_disk(de->rec_len,
208 sb->s_blocksize);
209 }
210 offset = i;
211 ctx->pos = (ctx->pos & ~(sb->s_blocksize - 1))
212 | offset;
213 file->f_version = inode->i_version;
214 }
215
216 while (ctx->pos < inode->i_size
217 && offset < sb->s_blocksize) {
218 de = (struct ext4_dir_entry_2 *) (bh->b_data + offset);
219 if (ext4_check_dir_entry(inode, file, de, bh,
220 bh->b_data, bh->b_size,
221 offset)) {
222 /*
223 * On error, skip to the next block
224 */
225 ctx->pos = (ctx->pos |
226 (sb->s_blocksize - 1)) + 1;
227 break;
228 }
229 offset += ext4_rec_len_from_disk(de->rec_len,
230 sb->s_blocksize);
231 if (le32_to_cpu(de->inode)) {
232 if (!dir_emit(ctx, de->name,
233 de->name_len,
234 le32_to_cpu(de->inode),
235 get_dtype(sb, de->file_type))) {
236 brelse(bh);
237 return 0;
238 }
239 }
240 ctx->pos += ext4_rec_len_from_disk(de->rec_len,
241 sb->s_blocksize);
242 }
243 offset = 0;
244 brelse(bh);
245 if (ctx->pos < inode->i_size) {
246 if (!dir_relax(inode))
247 return 0;
248 }
249 }
250 return 0;
251 }
252
253 static inline int is_32bit_api(void)
254 {
255 #ifdef CONFIG_COMPAT
256 return is_compat_task();
257 #else
258 return (BITS_PER_LONG == 32);
259 #endif
260 }
261
262 /*
263 * These functions convert from the major/minor hash to an f_pos
264 * value for dx directories
265 *
266 * Upper layer (for example NFS) should specify FMODE_32BITHASH or
267 * FMODE_64BITHASH explicitly. On the other hand, we allow ext4 to be mounted
268 * directly on both 32-bit and 64-bit nodes, under such case, neither
269 * FMODE_32BITHASH nor FMODE_64BITHASH is specified.
270 */
271 static inline loff_t hash2pos(struct file *filp, __u32 major, __u32 minor)
272 {
273 if ((filp->f_mode & FMODE_32BITHASH) ||
274 (!(filp->f_mode & FMODE_64BITHASH) && is_32bit_api()))
275 return major >> 1;
276 else
277 return ((__u64)(major >> 1) << 32) | (__u64)minor;
278 }
279
280 static inline __u32 pos2maj_hash(struct file *filp, loff_t pos)
281 {
282 if ((filp->f_mode & FMODE_32BITHASH) ||
283 (!(filp->f_mode & FMODE_64BITHASH) && is_32bit_api()))
284 return (pos << 1) & 0xffffffff;
285 else
286 return ((pos >> 32) << 1) & 0xffffffff;
287 }
288
289 static inline __u32 pos2min_hash(struct file *filp, loff_t pos)
290 {
291 if ((filp->f_mode & FMODE_32BITHASH) ||
292 (!(filp->f_mode & FMODE_64BITHASH) && is_32bit_api()))
293 return 0;
294 else
295 return pos & 0xffffffff;
296 }
297
298 /*
299 * Return 32- or 64-bit end-of-file for dx directories
300 */
301 static inline loff_t ext4_get_htree_eof(struct file *filp)
302 {
303 if ((filp->f_mode & FMODE_32BITHASH) ||
304 (!(filp->f_mode & FMODE_64BITHASH) && is_32bit_api()))
305 return EXT4_HTREE_EOF_32BIT;
306 else
307 return EXT4_HTREE_EOF_64BIT;
308 }
309
310
311 /*
312 * ext4_dir_llseek() calls generic_file_llseek_size to handle htree
313 * directories, where the "offset" is in terms of the filename hash
314 * value instead of the byte offset.
315 *
316 * Because we may return a 64-bit hash that is well beyond offset limits,
317 * we need to pass the max hash as the maximum allowable offset in
318 * the htree directory case.
319 *
320 * For non-htree, ext4_llseek already chooses the proper max offset.
321 */
322 static loff_t ext4_dir_llseek(struct file *file, loff_t offset, int whence)
323 {
324 struct inode *inode = file->f_mapping->host;
325 int dx_dir = is_dx_dir(inode);
326 loff_t htree_max = ext4_get_htree_eof(file);
327
328 if (likely(dx_dir))
329 return generic_file_llseek_size(file, offset, whence,
330 htree_max, htree_max);
331 else
332 return ext4_llseek(file, offset, whence);
333 }
334
335 /*
336 * This structure holds the nodes of the red-black tree used to store
337 * the directory entry in hash order.
338 */
339 struct fname {
340 __u32 hash;
341 __u32 minor_hash;
342 struct rb_node rb_hash;
343 struct fname *next;
344 __u32 inode;
345 __u8 name_len;
346 __u8 file_type;
347 char name[0];
348 };
349
350 /*
351 * This functoin implements a non-recursive way of freeing all of the
352 * nodes in the red-black tree.
353 */
354 static void free_rb_tree_fname(struct rb_root *root)
355 {
356 struct fname *fname, *next;
357
358 rbtree_postorder_for_each_entry_safe(fname, next, root, rb_hash)
359 while (fname) {
360 struct fname *old = fname;
361 fname = fname->next;
362 kfree(old);
363 }
364
365 *root = RB_ROOT;
366 }
367
368
369 static struct dir_private_info *ext4_htree_create_dir_info(struct file *filp,
370 loff_t pos)
371 {
372 struct dir_private_info *p;
373
374 p = kzalloc(sizeof(struct dir_private_info), GFP_KERNEL);
375 if (!p)
376 return NULL;
377 p->curr_hash = pos2maj_hash(filp, pos);
378 p->curr_minor_hash = pos2min_hash(filp, pos);
379 return p;
380 }
381
382 void ext4_htree_free_dir_info(struct dir_private_info *p)
383 {
384 free_rb_tree_fname(&p->root);
385 kfree(p);
386 }
387
388 /*
389 * Given a directory entry, enter it into the fname rb tree.
390 */
391 int ext4_htree_store_dirent(struct file *dir_file, __u32 hash,
392 __u32 minor_hash,
393 struct ext4_dir_entry_2 *dirent)
394 {
395 struct rb_node **p, *parent = NULL;
396 struct fname *fname, *new_fn;
397 struct dir_private_info *info;
398 int len;
399
400 info = dir_file->private_data;
401 p = &info->root.rb_node;
402
403 /* Create and allocate the fname structure */
404 len = sizeof(struct fname) + dirent->name_len + 1;
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);
411 new_fn->name_len = dirent->name_len;
412 new_fn->file_type = dirent->file_type;
413 memcpy(new_fn->name, dirent->name, dirent->name_len);
414 new_fn->name[dirent->name_len] = 0;
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 /*
449 * This is a helper function for ext4_dx_readdir. It calls filldir
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 */
453 static int call_filldir(struct file *file, struct dir_context *ctx,
454 struct fname *fname)
455 {
456 struct dir_private_info *info = file->private_data;
457 struct inode *inode = file_inode(file);
458 struct super_block *sb = inode->i_sb;
459
460 if (!fname) {
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);
464 return 0;
465 }
466 ctx->pos = hash2pos(file, fname->hash, fname->minor_hash);
467 while (fname) {
468 if (!dir_emit(ctx, fname->name,
469 fname->name_len,
470 fname->inode,
471 get_dtype(sb, fname->file_type))) {
472 info->extra_fname = fname;
473 return 1;
474 }
475 fname = fname->next;
476 }
477 return 0;
478 }
479
480 static int ext4_dx_readdir(struct file *file, struct dir_context *ctx)
481 {
482 struct dir_private_info *info = file->private_data;
483 struct inode *inode = file_inode(file);
484 struct fname *fname;
485 int ret;
486
487 if (!info) {
488 info = ext4_htree_create_dir_info(file, ctx->pos);
489 if (!info)
490 return -ENOMEM;
491 file->private_data = info;
492 }
493
494 if (ctx->pos == ext4_get_htree_eof(file))
495 return 0; /* EOF */
496
497 /* Some one has messed with f_pos; reset the world */
498 if (info->last_pos != ctx->pos) {
499 free_rb_tree_fname(&info->root);
500 info->curr_node = NULL;
501 info->extra_fname = NULL;
502 info->curr_hash = pos2maj_hash(file, ctx->pos);
503 info->curr_minor_hash = pos2min_hash(file, ctx->pos);
504 }
505
506 /*
507 * If there are any leftover names on the hash collision
508 * chain, return them first.
509 */
510 if (info->extra_fname) {
511 if (call_filldir(file, ctx, info->extra_fname))
512 goto finished;
513 info->extra_fname = NULL;
514 goto next_node;
515 } else if (!info->curr_node)
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) ||
525 (file->f_version != inode->i_version)) {
526 info->curr_node = NULL;
527 free_rb_tree_fname(&info->root);
528 file->f_version = inode->i_version;
529 ret = ext4_htree_fill_tree(file, info->curr_hash,
530 info->curr_minor_hash,
531 &info->next_hash);
532 if (ret < 0)
533 return ret;
534 if (ret == 0) {
535 ctx->pos = ext4_get_htree_eof(file);
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;
544 if (call_filldir(file, ctx, fname))
545 break;
546 next_node:
547 info->curr_node = rb_next(info->curr_node);
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 {
554 if (info->next_hash == ~0) {
555 ctx->pos = ext4_get_htree_eof(file);
556 break;
557 }
558 info->curr_hash = info->next_hash;
559 info->curr_minor_hash = 0;
560 }
561 }
562 finished:
563 info->last_pos = ctx->pos;
564 return 0;
565 }
566
567 static int ext4_release_dir(struct inode *inode, struct file *filp)
568 {
569 if (filp->private_data)
570 ext4_htree_free_dir_info(filp->private_data);
571
572 return 0;
573 }
574
575 const struct file_operations ext4_dir_operations = {
576 .llseek = ext4_dir_llseek,
577 .read = generic_read_dir,
578 .iterate = ext4_readdir,
579 .unlocked_ioctl = ext4_ioctl,
580 #ifdef CONFIG_COMPAT
581 .compat_ioctl = ext4_compat_ioctl,
582 #endif
583 .fsync = ext4_sync_file,
584 .release = ext4_release_dir,
585 };