1 // SPDX-License-Identifier: GPL-2.0
3 * linux/fs/ext4/namei.c
5 * Copyright (C) 1992, 1993, 1994, 1995
6 * Remy Card (card@masi.ibp.fr)
7 * Laboratoire MASI - Institut Blaise Pascal
8 * Universite Pierre et Marie Curie (Paris VI)
12 * linux/fs/minix/namei.c
14 * Copyright (C) 1991, 1992 Linus Torvalds
16 * Big-endian to little-endian byte-swapping/bitmaps by
17 * David S. Miller (davem@caip.rutgers.edu), 1995
18 * Directory entry file type support and forward compatibility hooks
19 * for B-tree directories by Theodore Ts'o (tytso@mit.edu), 1998
20 * Hash Tree Directory indexing (c)
21 * Daniel Phillips, 2001
22 * Hash Tree Directory indexing porting
23 * Christopher Li, 2002
24 * Hash Tree Directory indexing cleanup
29 #include <linux/pagemap.h>
30 #include <linux/time.h>
31 #include <linux/fcntl.h>
32 #include <linux/stat.h>
33 #include <linux/string.h>
34 #include <linux/quotaops.h>
35 #include <linux/buffer_head.h>
36 #include <linux/bio.h>
37 #include <linux/iversion.h>
38 #include <linux/unicode.h>
40 #include "ext4_jbd2.h"
45 #include <trace/events/ext4.h>
47 * define how far ahead to read directories while searching them.
49 #define NAMEI_RA_CHUNKS 2
50 #define NAMEI_RA_BLOCKS 4
51 #define NAMEI_RA_SIZE (NAMEI_RA_CHUNKS * NAMEI_RA_BLOCKS)
53 static struct buffer_head
*ext4_append(handle_t
*handle
,
57 struct ext4_map_blocks map
;
58 struct buffer_head
*bh
;
61 if (unlikely(EXT4_SB(inode
->i_sb
)->s_max_dir_size_kb
&&
62 ((inode
->i_size
>> 10) >=
63 EXT4_SB(inode
->i_sb
)->s_max_dir_size_kb
)))
64 return ERR_PTR(-ENOSPC
);
66 *block
= inode
->i_size
>> inode
->i_sb
->s_blocksize_bits
;
71 * We're appending new directory block. Make sure the block is not
72 * allocated yet, otherwise we will end up corrupting the
75 err
= ext4_map_blocks(NULL
, inode
, &map
, 0);
79 EXT4_ERROR_INODE(inode
, "Logical block already allocated");
80 return ERR_PTR(-EFSCORRUPTED
);
83 bh
= ext4_bread(handle
, inode
, *block
, EXT4_GET_BLOCKS_CREATE
);
86 inode
->i_size
+= inode
->i_sb
->s_blocksize
;
87 EXT4_I(inode
)->i_disksize
= inode
->i_size
;
88 err
= ext4_mark_inode_dirty(handle
, inode
);
91 BUFFER_TRACE(bh
, "get_write_access");
92 err
= ext4_journal_get_write_access(handle
, inode
->i_sb
, bh
,
100 ext4_std_error(inode
->i_sb
, err
);
104 static int ext4_dx_csum_verify(struct inode
*inode
,
105 struct ext4_dir_entry
*dirent
);
108 * Hints to ext4_read_dirblock regarding whether we expect a directory
109 * block being read to be an index block, or a block containing
110 * directory entries (and if the latter, whether it was found via a
111 * logical block in an htree index block). This is used to control
112 * what sort of sanity checkinig ext4_read_dirblock() will do on the
113 * directory block read from the storage device. EITHER will means
114 * the caller doesn't know what kind of directory block will be read,
115 * so no specific verification will be done.
118 EITHER
, INDEX
, DIRENT
, DIRENT_HTREE
121 #define ext4_read_dirblock(inode, block, type) \
122 __ext4_read_dirblock((inode), (block), (type), __func__, __LINE__)
124 static struct buffer_head
*__ext4_read_dirblock(struct inode
*inode
,
126 dirblock_type_t type
,
130 struct buffer_head
*bh
;
131 struct ext4_dir_entry
*dirent
;
134 if (block
>= inode
->i_size
>> inode
->i_blkbits
) {
135 ext4_error_inode(inode
, func
, line
, block
,
136 "Attempting to read directory block (%u) that is past i_size (%llu)",
137 block
, inode
->i_size
);
138 return ERR_PTR(-EFSCORRUPTED
);
141 if (ext4_simulate_fail(inode
->i_sb
, EXT4_SIM_DIRBLOCK_EIO
))
144 bh
= ext4_bread(NULL
, inode
, block
, 0);
146 __ext4_warning(inode
->i_sb
, func
, line
,
147 "inode #%lu: lblock %lu: comm %s: "
148 "error %ld reading directory block",
149 inode
->i_ino
, (unsigned long)block
,
150 current
->comm
, PTR_ERR(bh
));
154 /* The first directory block must not be a hole. */
155 if (!bh
&& (type
== INDEX
|| type
== DIRENT_HTREE
|| block
== 0)) {
156 ext4_error_inode(inode
, func
, line
, block
,
157 "Directory hole found for htree %s block %u",
158 (type
== INDEX
) ? "index" : "leaf", block
);
159 return ERR_PTR(-EFSCORRUPTED
);
163 dirent
= (struct ext4_dir_entry
*) bh
->b_data
;
164 /* Determine whether or not we have an index block */
168 else if (ext4_rec_len_from_disk(dirent
->rec_len
,
169 inode
->i_sb
->s_blocksize
) ==
170 inode
->i_sb
->s_blocksize
)
173 if (!is_dx_block
&& type
== INDEX
) {
174 ext4_error_inode(inode
, func
, line
, block
,
175 "directory leaf block found instead of index block");
177 return ERR_PTR(-EFSCORRUPTED
);
179 if (!ext4_has_metadata_csum(inode
->i_sb
) ||
184 * An empty leaf block can get mistaken for a index block; for
185 * this reason, we can only check the index checksum when the
186 * caller is sure it should be an index block.
188 if (is_dx_block
&& type
== INDEX
) {
189 if (ext4_dx_csum_verify(inode
, dirent
) &&
190 !ext4_simulate_fail(inode
->i_sb
, EXT4_SIM_DIRBLOCK_CRC
))
191 set_buffer_verified(bh
);
193 ext4_error_inode_err(inode
, func
, line
, block
,
195 "Directory index failed checksum");
197 return ERR_PTR(-EFSBADCRC
);
201 if (ext4_dirblock_csum_verify(inode
, bh
) &&
202 !ext4_simulate_fail(inode
->i_sb
, EXT4_SIM_DIRBLOCK_CRC
))
203 set_buffer_verified(bh
);
205 ext4_error_inode_err(inode
, func
, line
, block
,
207 "Directory block failed checksum");
209 return ERR_PTR(-EFSBADCRC
);
216 #define dxtrace(command) command
218 #define dxtrace(command)
242 * dx_root_info is laid out so that if it should somehow get overlaid by a
243 * dirent the two low bits of the hash version will be zero. Therefore, the
244 * hash version mod 4 should never be 0. Sincerely, the paranoia department.
249 struct fake_dirent dot
;
251 struct fake_dirent dotdot
;
255 __le32 reserved_zero
;
257 u8 info_length
; /* 8 */
262 struct dx_entry entries
[];
267 struct fake_dirent fake
;
268 struct dx_entry entries
[];
274 struct buffer_head
*bh
;
275 struct dx_entry
*entries
;
287 * This goes at the end of each htree block.
291 __le32 dt_checksum
; /* crc32c(uuid+inum+dirblock) */
294 static inline ext4_lblk_t
dx_get_block(struct dx_entry
*entry
);
295 static void dx_set_block(struct dx_entry
*entry
, ext4_lblk_t value
);
296 static inline unsigned dx_get_hash(struct dx_entry
*entry
);
297 static void dx_set_hash(struct dx_entry
*entry
, unsigned value
);
298 static unsigned dx_get_count(struct dx_entry
*entries
);
299 static unsigned dx_get_limit(struct dx_entry
*entries
);
300 static void dx_set_count(struct dx_entry
*entries
, unsigned value
);
301 static void dx_set_limit(struct dx_entry
*entries
, unsigned value
);
302 static unsigned dx_root_limit(struct inode
*dir
, unsigned infosize
);
303 static unsigned dx_node_limit(struct inode
*dir
);
304 static struct dx_frame
*dx_probe(struct ext4_filename
*fname
,
306 struct dx_hash_info
*hinfo
,
307 struct dx_frame
*frame
);
308 static void dx_release(struct dx_frame
*frames
);
309 static int dx_make_map(struct inode
*dir
, struct buffer_head
*bh
,
310 struct dx_hash_info
*hinfo
,
311 struct dx_map_entry
*map_tail
);
312 static void dx_sort_map(struct dx_map_entry
*map
, unsigned count
);
313 static struct ext4_dir_entry_2
*dx_move_dirents(struct inode
*dir
, char *from
,
314 char *to
, struct dx_map_entry
*offsets
,
315 int count
, unsigned int blocksize
);
316 static struct ext4_dir_entry_2
*dx_pack_dirents(struct inode
*dir
, char *base
,
317 unsigned int blocksize
);
318 static void dx_insert_block(struct dx_frame
*frame
,
319 u32 hash
, ext4_lblk_t block
);
320 static int ext4_htree_next_block(struct inode
*dir
, __u32 hash
,
321 struct dx_frame
*frame
,
322 struct dx_frame
*frames
,
324 static struct buffer_head
* ext4_dx_find_entry(struct inode
*dir
,
325 struct ext4_filename
*fname
,
326 struct ext4_dir_entry_2
**res_dir
);
327 static int ext4_dx_add_entry(handle_t
*handle
, struct ext4_filename
*fname
,
328 struct inode
*dir
, struct inode
*inode
);
330 /* checksumming functions */
331 void ext4_initialize_dirent_tail(struct buffer_head
*bh
,
332 unsigned int blocksize
)
334 struct ext4_dir_entry_tail
*t
= EXT4_DIRENT_TAIL(bh
->b_data
, blocksize
);
336 memset(t
, 0, sizeof(struct ext4_dir_entry_tail
));
337 t
->det_rec_len
= ext4_rec_len_to_disk(
338 sizeof(struct ext4_dir_entry_tail
), blocksize
);
339 t
->det_reserved_ft
= EXT4_FT_DIR_CSUM
;
342 /* Walk through a dirent block to find a checksum "dirent" at the tail */
343 static struct ext4_dir_entry_tail
*get_dirent_tail(struct inode
*inode
,
344 struct buffer_head
*bh
)
346 struct ext4_dir_entry_tail
*t
;
347 int blocksize
= EXT4_BLOCK_SIZE(inode
->i_sb
);
350 struct ext4_dir_entry
*d
, *top
;
352 d
= (struct ext4_dir_entry
*)bh
->b_data
;
353 top
= (struct ext4_dir_entry
*)(bh
->b_data
+
354 (blocksize
- sizeof(struct ext4_dir_entry_tail
)));
355 while (d
< top
&& ext4_rec_len_from_disk(d
->rec_len
, blocksize
))
356 d
= (struct ext4_dir_entry
*)(((void *)d
) +
357 ext4_rec_len_from_disk(d
->rec_len
, blocksize
));
362 t
= (struct ext4_dir_entry_tail
*)d
;
364 t
= EXT4_DIRENT_TAIL(bh
->b_data
, EXT4_BLOCK_SIZE(inode
->i_sb
));
367 if (t
->det_reserved_zero1
||
368 (ext4_rec_len_from_disk(t
->det_rec_len
, blocksize
) !=
369 sizeof(struct ext4_dir_entry_tail
)) ||
370 t
->det_reserved_zero2
||
371 t
->det_reserved_ft
!= EXT4_FT_DIR_CSUM
)
377 static __le32
ext4_dirblock_csum(struct inode
*inode
, void *dirent
, int size
)
379 struct ext4_sb_info
*sbi
= EXT4_SB(inode
->i_sb
);
380 struct ext4_inode_info
*ei
= EXT4_I(inode
);
383 csum
= ext4_chksum(sbi
, ei
->i_csum_seed
, (__u8
*)dirent
, size
);
384 return cpu_to_le32(csum
);
387 #define warn_no_space_for_csum(inode) \
388 __warn_no_space_for_csum((inode), __func__, __LINE__)
390 static void __warn_no_space_for_csum(struct inode
*inode
, const char *func
,
393 __ext4_warning_inode(inode
, func
, line
,
394 "No space for directory leaf checksum. Please run e2fsck -D.");
397 int ext4_dirblock_csum_verify(struct inode
*inode
, struct buffer_head
*bh
)
399 struct ext4_dir_entry_tail
*t
;
401 if (!ext4_has_metadata_csum(inode
->i_sb
))
404 t
= get_dirent_tail(inode
, bh
);
406 warn_no_space_for_csum(inode
);
410 if (t
->det_checksum
!= ext4_dirblock_csum(inode
, bh
->b_data
,
411 (char *)t
- bh
->b_data
))
417 static void ext4_dirblock_csum_set(struct inode
*inode
,
418 struct buffer_head
*bh
)
420 struct ext4_dir_entry_tail
*t
;
422 if (!ext4_has_metadata_csum(inode
->i_sb
))
425 t
= get_dirent_tail(inode
, bh
);
427 warn_no_space_for_csum(inode
);
431 t
->det_checksum
= ext4_dirblock_csum(inode
, bh
->b_data
,
432 (char *)t
- bh
->b_data
);
435 int ext4_handle_dirty_dirblock(handle_t
*handle
,
437 struct buffer_head
*bh
)
439 ext4_dirblock_csum_set(inode
, bh
);
440 return ext4_handle_dirty_metadata(handle
, inode
, bh
);
443 static struct dx_countlimit
*get_dx_countlimit(struct inode
*inode
,
444 struct ext4_dir_entry
*dirent
,
447 struct ext4_dir_entry
*dp
;
448 struct dx_root_info
*root
;
450 int blocksize
= EXT4_BLOCK_SIZE(inode
->i_sb
);
451 unsigned int rlen
= ext4_rec_len_from_disk(dirent
->rec_len
, blocksize
);
453 if (rlen
== blocksize
)
455 else if (rlen
== 12) {
456 dp
= (struct ext4_dir_entry
*)(((void *)dirent
) + 12);
457 if (ext4_rec_len_from_disk(dp
->rec_len
, blocksize
) != blocksize
- 12)
459 root
= (struct dx_root_info
*)(((void *)dp
+ 12));
460 if (root
->reserved_zero
||
461 root
->info_length
!= sizeof(struct dx_root_info
))
468 *offset
= count_offset
;
469 return (struct dx_countlimit
*)(((void *)dirent
) + count_offset
);
472 static __le32
ext4_dx_csum(struct inode
*inode
, struct ext4_dir_entry
*dirent
,
473 int count_offset
, int count
, struct dx_tail
*t
)
475 struct ext4_sb_info
*sbi
= EXT4_SB(inode
->i_sb
);
476 struct ext4_inode_info
*ei
= EXT4_I(inode
);
479 __u32 dummy_csum
= 0;
480 int offset
= offsetof(struct dx_tail
, dt_checksum
);
482 size
= count_offset
+ (count
* sizeof(struct dx_entry
));
483 csum
= ext4_chksum(sbi
, ei
->i_csum_seed
, (__u8
*)dirent
, size
);
484 csum
= ext4_chksum(sbi
, csum
, (__u8
*)t
, offset
);
485 csum
= ext4_chksum(sbi
, csum
, (__u8
*)&dummy_csum
, sizeof(dummy_csum
));
487 return cpu_to_le32(csum
);
490 static int ext4_dx_csum_verify(struct inode
*inode
,
491 struct ext4_dir_entry
*dirent
)
493 struct dx_countlimit
*c
;
495 int count_offset
, limit
, count
;
497 if (!ext4_has_metadata_csum(inode
->i_sb
))
500 c
= get_dx_countlimit(inode
, dirent
, &count_offset
);
502 EXT4_ERROR_INODE(inode
, "dir seems corrupt? Run e2fsck -D.");
505 limit
= le16_to_cpu(c
->limit
);
506 count
= le16_to_cpu(c
->count
);
507 if (count_offset
+ (limit
* sizeof(struct dx_entry
)) >
508 EXT4_BLOCK_SIZE(inode
->i_sb
) - sizeof(struct dx_tail
)) {
509 warn_no_space_for_csum(inode
);
512 t
= (struct dx_tail
*)(((struct dx_entry
*)c
) + limit
);
514 if (t
->dt_checksum
!= ext4_dx_csum(inode
, dirent
, count_offset
,
520 static void ext4_dx_csum_set(struct inode
*inode
, struct ext4_dir_entry
*dirent
)
522 struct dx_countlimit
*c
;
524 int count_offset
, limit
, count
;
526 if (!ext4_has_metadata_csum(inode
->i_sb
))
529 c
= get_dx_countlimit(inode
, dirent
, &count_offset
);
531 EXT4_ERROR_INODE(inode
, "dir seems corrupt? Run e2fsck -D.");
534 limit
= le16_to_cpu(c
->limit
);
535 count
= le16_to_cpu(c
->count
);
536 if (count_offset
+ (limit
* sizeof(struct dx_entry
)) >
537 EXT4_BLOCK_SIZE(inode
->i_sb
) - sizeof(struct dx_tail
)) {
538 warn_no_space_for_csum(inode
);
541 t
= (struct dx_tail
*)(((struct dx_entry
*)c
) + limit
);
543 t
->dt_checksum
= ext4_dx_csum(inode
, dirent
, count_offset
, count
, t
);
546 static inline int ext4_handle_dirty_dx_node(handle_t
*handle
,
548 struct buffer_head
*bh
)
550 ext4_dx_csum_set(inode
, (struct ext4_dir_entry
*)bh
->b_data
);
551 return ext4_handle_dirty_metadata(handle
, inode
, bh
);
555 * p is at least 6 bytes before the end of page
557 static inline struct ext4_dir_entry_2
*
558 ext4_next_entry(struct ext4_dir_entry_2
*p
, unsigned long blocksize
)
560 return (struct ext4_dir_entry_2
*)((char *)p
+
561 ext4_rec_len_from_disk(p
->rec_len
, blocksize
));
565 * Future: use high four bits of block for coalesce-on-delete flags
566 * Mask them off for now.
569 static inline ext4_lblk_t
dx_get_block(struct dx_entry
*entry
)
571 return le32_to_cpu(entry
->block
) & 0x0fffffff;
574 static inline void dx_set_block(struct dx_entry
*entry
, ext4_lblk_t value
)
576 entry
->block
= cpu_to_le32(value
);
579 static inline unsigned dx_get_hash(struct dx_entry
*entry
)
581 return le32_to_cpu(entry
->hash
);
584 static inline void dx_set_hash(struct dx_entry
*entry
, unsigned value
)
586 entry
->hash
= cpu_to_le32(value
);
589 static inline unsigned dx_get_count(struct dx_entry
*entries
)
591 return le16_to_cpu(((struct dx_countlimit
*) entries
)->count
);
594 static inline unsigned dx_get_limit(struct dx_entry
*entries
)
596 return le16_to_cpu(((struct dx_countlimit
*) entries
)->limit
);
599 static inline void dx_set_count(struct dx_entry
*entries
, unsigned value
)
601 ((struct dx_countlimit
*) entries
)->count
= cpu_to_le16(value
);
604 static inline void dx_set_limit(struct dx_entry
*entries
, unsigned value
)
606 ((struct dx_countlimit
*) entries
)->limit
= cpu_to_le16(value
);
609 static inline unsigned dx_root_limit(struct inode
*dir
, unsigned infosize
)
611 unsigned int entry_space
= dir
->i_sb
->s_blocksize
-
612 ext4_dir_rec_len(1, NULL
) -
613 ext4_dir_rec_len(2, NULL
) - infosize
;
615 if (ext4_has_metadata_csum(dir
->i_sb
))
616 entry_space
-= sizeof(struct dx_tail
);
617 return entry_space
/ sizeof(struct dx_entry
);
620 static inline unsigned dx_node_limit(struct inode
*dir
)
622 unsigned int entry_space
= dir
->i_sb
->s_blocksize
-
623 ext4_dir_rec_len(0, dir
);
625 if (ext4_has_metadata_csum(dir
->i_sb
))
626 entry_space
-= sizeof(struct dx_tail
);
627 return entry_space
/ sizeof(struct dx_entry
);
634 static void dx_show_index(char * label
, struct dx_entry
*entries
)
636 int i
, n
= dx_get_count (entries
);
637 printk(KERN_DEBUG
"%s index", label
);
638 for (i
= 0; i
< n
; i
++) {
639 printk(KERN_CONT
" %x->%lu",
640 i
? dx_get_hash(entries
+ i
) : 0,
641 (unsigned long)dx_get_block(entries
+ i
));
643 printk(KERN_CONT
"\n");
653 static struct stats
dx_show_leaf(struct inode
*dir
,
654 struct dx_hash_info
*hinfo
,
655 struct ext4_dir_entry_2
*de
,
656 int size
, int show_names
)
658 unsigned names
= 0, space
= 0;
659 char *base
= (char *) de
;
660 struct dx_hash_info h
= *hinfo
;
663 while ((char *) de
< base
+ size
)
669 #ifdef CONFIG_FS_ENCRYPTION
672 struct fscrypt_str fname_crypto_str
=
678 if (!IS_ENCRYPTED(dir
)) {
679 /* Directory is not encrypted */
680 (void) ext4fs_dirhash(dir
, de
->name
,
682 printk("%*.s:(U)%x.%u ", len
,
684 (unsigned) ((char *) de
687 struct fscrypt_str de_name
=
688 FSTR_INIT(name
, len
);
690 /* Directory is encrypted */
691 res
= fscrypt_fname_alloc_buffer(
692 len
, &fname_crypto_str
);
694 printk(KERN_WARNING
"Error "
698 res
= fscrypt_fname_disk_to_usr(dir
,
702 printk(KERN_WARNING
"Error "
703 "converting filename "
709 name
= fname_crypto_str
.name
;
710 len
= fname_crypto_str
.len
;
712 if (IS_CASEFOLDED(dir
))
713 h
.hash
= EXT4_DIRENT_HASH(de
);
715 (void) ext4fs_dirhash(dir
,
718 printk("%*.s:(E)%x.%u ", len
, name
,
719 h
.hash
, (unsigned) ((char *) de
721 fscrypt_fname_free_buffer(
725 int len
= de
->name_len
;
726 char *name
= de
->name
;
727 (void) ext4fs_dirhash(dir
, de
->name
,
729 printk("%*.s:%x.%u ", len
, name
, h
.hash
,
730 (unsigned) ((char *) de
- base
));
733 space
+= ext4_dir_rec_len(de
->name_len
, dir
);
736 de
= ext4_next_entry(de
, size
);
738 printk(KERN_CONT
"(%i)\n", names
);
739 return (struct stats
) { names
, space
, 1 };
742 struct stats
dx_show_entries(struct dx_hash_info
*hinfo
, struct inode
*dir
,
743 struct dx_entry
*entries
, int levels
)
745 unsigned blocksize
= dir
->i_sb
->s_blocksize
;
746 unsigned count
= dx_get_count(entries
), names
= 0, space
= 0, i
;
748 struct buffer_head
*bh
;
749 printk("%i indexed blocks...\n", count
);
750 for (i
= 0; i
< count
; i
++, entries
++)
752 ext4_lblk_t block
= dx_get_block(entries
);
753 ext4_lblk_t hash
= i
? dx_get_hash(entries
): 0;
754 u32 range
= i
< count
- 1? (dx_get_hash(entries
+ 1) - hash
): ~hash
;
756 printk("%s%3u:%03u hash %8x/%8x ",levels
?"":" ", i
, block
, hash
, range
);
757 bh
= ext4_bread(NULL
,dir
, block
, 0);
758 if (!bh
|| IS_ERR(bh
))
761 dx_show_entries(hinfo
, dir
, ((struct dx_node
*) bh
->b_data
)->entries
, levels
- 1):
762 dx_show_leaf(dir
, hinfo
, (struct ext4_dir_entry_2
*)
763 bh
->b_data
, blocksize
, 0);
764 names
+= stats
.names
;
765 space
+= stats
.space
;
766 bcount
+= stats
.bcount
;
770 printk(KERN_DEBUG
"%snames %u, fullness %u (%u%%)\n",
771 levels
? "" : " ", names
, space
/bcount
,
772 (space
/bcount
)*100/blocksize
);
773 return (struct stats
) { names
, space
, bcount
};
777 * Linear search cross check
779 static inline void htree_rep_invariant_check(struct dx_entry
*at
,
780 struct dx_entry
*target
,
781 u32 hash
, unsigned int n
)
784 dxtrace(printk(KERN_CONT
","));
785 if (dx_get_hash(++at
) > hash
) {
790 ASSERT(at
== target
- 1);
793 static inline void htree_rep_invariant_check(struct dx_entry
*at
,
794 struct dx_entry
*target
,
795 u32 hash
, unsigned int n
)
798 #endif /* DX_DEBUG */
801 * Probe for a directory leaf block to search.
803 * dx_probe can return ERR_BAD_DX_DIR, which means there was a format
804 * error in the directory index, and the caller should fall back to
805 * searching the directory normally. The callers of dx_probe **MUST**
806 * check for this error code, and make sure it never gets reflected
809 static struct dx_frame
*
810 dx_probe(struct ext4_filename
*fname
, struct inode
*dir
,
811 struct dx_hash_info
*hinfo
, struct dx_frame
*frame_in
)
813 unsigned count
, indirect
, level
, i
;
814 struct dx_entry
*at
, *entries
, *p
, *q
, *m
;
815 struct dx_root
*root
;
816 struct dx_frame
*frame
= frame_in
;
817 struct dx_frame
*ret_err
= ERR_PTR(ERR_BAD_DX_DIR
);
820 ext4_lblk_t blocks
[EXT4_HTREE_LEVEL
];
822 memset(frame_in
, 0, EXT4_HTREE_LEVEL
* sizeof(frame_in
[0]));
823 frame
->bh
= ext4_read_dirblock(dir
, 0, INDEX
);
824 if (IS_ERR(frame
->bh
))
825 return (struct dx_frame
*) frame
->bh
;
827 root
= (struct dx_root
*) frame
->bh
->b_data
;
828 if (root
->info
.hash_version
!= DX_HASH_TEA
&&
829 root
->info
.hash_version
!= DX_HASH_HALF_MD4
&&
830 root
->info
.hash_version
!= DX_HASH_LEGACY
&&
831 root
->info
.hash_version
!= DX_HASH_SIPHASH
) {
832 ext4_warning_inode(dir
, "Unrecognised inode hash code %u",
833 root
->info
.hash_version
);
836 if (ext4_hash_in_dirent(dir
)) {
837 if (root
->info
.hash_version
!= DX_HASH_SIPHASH
) {
838 ext4_warning_inode(dir
,
839 "Hash in dirent, but hash is not SIPHASH");
843 if (root
->info
.hash_version
== DX_HASH_SIPHASH
) {
844 ext4_warning_inode(dir
,
845 "Hash code is SIPHASH, but hash not in dirent");
850 hinfo
= &fname
->hinfo
;
851 hinfo
->hash_version
= root
->info
.hash_version
;
852 if (hinfo
->hash_version
<= DX_HASH_TEA
)
853 hinfo
->hash_version
+= EXT4_SB(dir
->i_sb
)->s_hash_unsigned
;
854 hinfo
->seed
= EXT4_SB(dir
->i_sb
)->s_hash_seed
;
855 /* hash is already computed for encrypted casefolded directory */
856 if (fname
&& fname_name(fname
) &&
857 !(IS_ENCRYPTED(dir
) && IS_CASEFOLDED(dir
))) {
858 int ret
= ext4fs_dirhash(dir
, fname_name(fname
),
859 fname_len(fname
), hinfo
);
861 ret_err
= ERR_PTR(ret
);
867 if (root
->info
.unused_flags
& 1) {
868 ext4_warning_inode(dir
, "Unimplemented hash flags: %#06x",
869 root
->info
.unused_flags
);
873 indirect
= root
->info
.indirect_levels
;
874 if (indirect
>= ext4_dir_htree_level(dir
->i_sb
)) {
875 ext4_warning(dir
->i_sb
,
876 "Directory (ino: %lu) htree depth %#06x exceed"
877 "supported value", dir
->i_ino
,
878 ext4_dir_htree_level(dir
->i_sb
));
879 if (ext4_dir_htree_level(dir
->i_sb
) < EXT4_HTREE_LEVEL
) {
880 ext4_warning(dir
->i_sb
, "Enable large directory "
881 "feature to access it");
886 entries
= (struct dx_entry
*)(((char *)&root
->info
) +
887 root
->info
.info_length
);
889 if (dx_get_limit(entries
) != dx_root_limit(dir
,
890 root
->info
.info_length
)) {
891 ext4_warning_inode(dir
, "dx entry: limit %u != root limit %u",
892 dx_get_limit(entries
),
893 dx_root_limit(dir
, root
->info
.info_length
));
897 dxtrace(printk("Look up %x", hash
));
901 count
= dx_get_count(entries
);
902 if (!count
|| count
> dx_get_limit(entries
)) {
903 ext4_warning_inode(dir
,
904 "dx entry: count %u beyond limit %u",
905 count
, dx_get_limit(entries
));
910 q
= entries
+ count
- 1;
913 dxtrace(printk(KERN_CONT
"."));
914 if (dx_get_hash(m
) > hash
)
920 htree_rep_invariant_check(entries
, p
, hash
, count
- 1);
923 dxtrace(printk(KERN_CONT
" %x->%u\n",
924 at
== entries
? 0 : dx_get_hash(at
),
926 frame
->entries
= entries
;
929 block
= dx_get_block(at
);
930 for (i
= 0; i
<= level
; i
++) {
931 if (blocks
[i
] == block
) {
932 ext4_warning_inode(dir
,
933 "dx entry: tree cycle block %u points back to block %u",
934 blocks
[level
], block
);
938 if (++level
> indirect
)
940 blocks
[level
] = block
;
942 frame
->bh
= ext4_read_dirblock(dir
, block
, INDEX
);
943 if (IS_ERR(frame
->bh
)) {
944 ret_err
= (struct dx_frame
*) frame
->bh
;
949 entries
= ((struct dx_node
*) frame
->bh
->b_data
)->entries
;
951 if (dx_get_limit(entries
) != dx_node_limit(dir
)) {
952 ext4_warning_inode(dir
,
953 "dx entry: limit %u != node limit %u",
954 dx_get_limit(entries
), dx_node_limit(dir
));
959 while (frame
>= frame_in
) {
964 if (ret_err
== ERR_PTR(ERR_BAD_DX_DIR
))
965 ext4_warning_inode(dir
,
966 "Corrupt directory, running e2fsck is recommended");
970 static void dx_release(struct dx_frame
*frames
)
972 struct dx_root_info
*info
;
974 unsigned int indirect_levels
;
976 if (frames
[0].bh
== NULL
)
979 info
= &((struct dx_root
*)frames
[0].bh
->b_data
)->info
;
980 /* save local copy, "info" may be freed after brelse() */
981 indirect_levels
= info
->indirect_levels
;
982 for (i
= 0; i
<= indirect_levels
; i
++) {
983 if (frames
[i
].bh
== NULL
)
985 brelse(frames
[i
].bh
);
991 * This function increments the frame pointer to search the next leaf
992 * block, and reads in the necessary intervening nodes if the search
993 * should be necessary. Whether or not the search is necessary is
994 * controlled by the hash parameter. If the hash value is even, then
995 * the search is only continued if the next block starts with that
996 * hash value. This is used if we are searching for a specific file.
998 * If the hash value is HASH_NB_ALWAYS, then always go to the next block.
1000 * This function returns 1 if the caller should continue to search,
1001 * or 0 if it should not. If there is an error reading one of the
1002 * index blocks, it will a negative error code.
1004 * If start_hash is non-null, it will be filled in with the starting
1005 * hash of the next page.
1007 static int ext4_htree_next_block(struct inode
*dir
, __u32 hash
,
1008 struct dx_frame
*frame
,
1009 struct dx_frame
*frames
,
1013 struct buffer_head
*bh
;
1019 * Find the next leaf page by incrementing the frame pointer.
1020 * If we run out of entries in the interior node, loop around and
1021 * increment pointer in the parent node. When we break out of
1022 * this loop, num_frames indicates the number of interior
1023 * nodes need to be read.
1026 if (++(p
->at
) < p
->entries
+ dx_get_count(p
->entries
))
1035 * If the hash is 1, then continue only if the next page has a
1036 * continuation hash of any value. This is used for readdir
1037 * handling. Otherwise, check to see if the hash matches the
1038 * desired continuation hash. If it doesn't, return since
1039 * there's no point to read in the successive index pages.
1041 bhash
= dx_get_hash(p
->at
);
1043 *start_hash
= bhash
;
1044 if ((hash
& 1) == 0) {
1045 if ((bhash
& ~1) != hash
)
1049 * If the hash is HASH_NB_ALWAYS, we always go to the next
1050 * block so no check is necessary
1052 while (num_frames
--) {
1053 bh
= ext4_read_dirblock(dir
, dx_get_block(p
->at
), INDEX
);
1059 p
->at
= p
->entries
= ((struct dx_node
*) bh
->b_data
)->entries
;
1066 * This function fills a red-black tree with information from a
1067 * directory block. It returns the number directory entries loaded
1068 * into the tree. If there is an error it is returned in err.
1070 static int htree_dirblock_to_tree(struct file
*dir_file
,
1071 struct inode
*dir
, ext4_lblk_t block
,
1072 struct dx_hash_info
*hinfo
,
1073 __u32 start_hash
, __u32 start_minor_hash
)
1075 struct buffer_head
*bh
;
1076 struct ext4_dir_entry_2
*de
, *top
;
1077 int err
= 0, count
= 0;
1078 struct fscrypt_str fname_crypto_str
= FSTR_INIT(NULL
, 0), tmp_str
;
1079 int csum
= ext4_has_metadata_csum(dir
->i_sb
);
1081 dxtrace(printk(KERN_INFO
"In htree dirblock_to_tree: block %lu\n",
1082 (unsigned long)block
));
1083 bh
= ext4_read_dirblock(dir
, block
, DIRENT_HTREE
);
1087 de
= (struct ext4_dir_entry_2
*) bh
->b_data
;
1088 /* csum entries are not larger in the casefolded encrypted case */
1089 top
= (struct ext4_dir_entry_2
*) ((char *) de
+
1090 dir
->i_sb
->s_blocksize
-
1092 csum
? NULL
: dir
));
1093 /* Check if the directory is encrypted */
1094 if (IS_ENCRYPTED(dir
)) {
1095 err
= fscrypt_prepare_readdir(dir
);
1100 err
= fscrypt_fname_alloc_buffer(EXT4_NAME_LEN
,
1108 for (; de
< top
; de
= ext4_next_entry(de
, dir
->i_sb
->s_blocksize
)) {
1109 if (ext4_check_dir_entry(dir
, NULL
, de
, bh
,
1110 bh
->b_data
, bh
->b_size
,
1111 (block
<<EXT4_BLOCK_SIZE_BITS(dir
->i_sb
))
1112 + ((char *)de
- bh
->b_data
))) {
1113 /* silently ignore the rest of the block */
1116 if (ext4_hash_in_dirent(dir
)) {
1117 if (de
->name_len
&& de
->inode
) {
1118 hinfo
->hash
= EXT4_DIRENT_HASH(de
);
1119 hinfo
->minor_hash
= EXT4_DIRENT_MINOR_HASH(de
);
1122 hinfo
->minor_hash
= 0;
1125 err
= ext4fs_dirhash(dir
, de
->name
,
1126 de
->name_len
, hinfo
);
1132 if ((hinfo
->hash
< start_hash
) ||
1133 ((hinfo
->hash
== start_hash
) &&
1134 (hinfo
->minor_hash
< start_minor_hash
)))
1138 if (!IS_ENCRYPTED(dir
)) {
1139 tmp_str
.name
= de
->name
;
1140 tmp_str
.len
= de
->name_len
;
1141 err
= ext4_htree_store_dirent(dir_file
,
1142 hinfo
->hash
, hinfo
->minor_hash
, de
,
1145 int save_len
= fname_crypto_str
.len
;
1146 struct fscrypt_str de_name
= FSTR_INIT(de
->name
,
1149 /* Directory is encrypted */
1150 err
= fscrypt_fname_disk_to_usr(dir
, hinfo
->hash
,
1151 hinfo
->minor_hash
, &de_name
,
1157 err
= ext4_htree_store_dirent(dir_file
,
1158 hinfo
->hash
, hinfo
->minor_hash
, de
,
1160 fname_crypto_str
.len
= save_len
;
1170 fscrypt_fname_free_buffer(&fname_crypto_str
);
1176 * This function fills a red-black tree with information from a
1177 * directory. We start scanning the directory in hash order, starting
1178 * at start_hash and start_minor_hash.
1180 * This function returns the number of entries inserted into the tree,
1181 * or a negative error code.
1183 int ext4_htree_fill_tree(struct file
*dir_file
, __u32 start_hash
,
1184 __u32 start_minor_hash
, __u32
*next_hash
)
1186 struct dx_hash_info hinfo
;
1187 struct ext4_dir_entry_2
*de
;
1188 struct dx_frame frames
[EXT4_HTREE_LEVEL
], *frame
;
1194 struct fscrypt_str tmp_str
;
1196 dxtrace(printk(KERN_DEBUG
"In htree_fill_tree, start hash: %x:%x\n",
1197 start_hash
, start_minor_hash
));
1198 dir
= file_inode(dir_file
);
1199 if (!(ext4_test_inode_flag(dir
, EXT4_INODE_INDEX
))) {
1200 if (ext4_hash_in_dirent(dir
))
1201 hinfo
.hash_version
= DX_HASH_SIPHASH
;
1203 hinfo
.hash_version
=
1204 EXT4_SB(dir
->i_sb
)->s_def_hash_version
;
1205 if (hinfo
.hash_version
<= DX_HASH_TEA
)
1206 hinfo
.hash_version
+=
1207 EXT4_SB(dir
->i_sb
)->s_hash_unsigned
;
1208 hinfo
.seed
= EXT4_SB(dir
->i_sb
)->s_hash_seed
;
1209 if (ext4_has_inline_data(dir
)) {
1210 int has_inline_data
= 1;
1211 count
= ext4_inlinedir_to_tree(dir_file
, dir
, 0,
1215 if (has_inline_data
) {
1220 count
= htree_dirblock_to_tree(dir_file
, dir
, 0, &hinfo
,
1221 start_hash
, start_minor_hash
);
1225 hinfo
.hash
= start_hash
;
1226 hinfo
.minor_hash
= 0;
1227 frame
= dx_probe(NULL
, dir
, &hinfo
, frames
);
1229 return PTR_ERR(frame
);
1231 /* Add '.' and '..' from the htree header */
1232 if (!start_hash
&& !start_minor_hash
) {
1233 de
= (struct ext4_dir_entry_2
*) frames
[0].bh
->b_data
;
1234 tmp_str
.name
= de
->name
;
1235 tmp_str
.len
= de
->name_len
;
1236 err
= ext4_htree_store_dirent(dir_file
, 0, 0,
1242 if (start_hash
< 2 || (start_hash
==2 && start_minor_hash
==0)) {
1243 de
= (struct ext4_dir_entry_2
*) frames
[0].bh
->b_data
;
1244 de
= ext4_next_entry(de
, dir
->i_sb
->s_blocksize
);
1245 tmp_str
.name
= de
->name
;
1246 tmp_str
.len
= de
->name_len
;
1247 err
= ext4_htree_store_dirent(dir_file
, 2, 0,
1255 if (fatal_signal_pending(current
)) {
1260 block
= dx_get_block(frame
->at
);
1261 ret
= htree_dirblock_to_tree(dir_file
, dir
, block
, &hinfo
,
1262 start_hash
, start_minor_hash
);
1269 ret
= ext4_htree_next_block(dir
, HASH_NB_ALWAYS
,
1270 frame
, frames
, &hashval
);
1271 *next_hash
= hashval
;
1277 * Stop if: (a) there are no more entries, or
1278 * (b) we have inserted at least one entry and the
1279 * next hash value is not a continuation
1282 (count
&& ((hashval
& 1) == 0)))
1286 dxtrace(printk(KERN_DEBUG
"Fill tree: returned %d entries, "
1287 "next hash: %x\n", count
, *next_hash
));
1294 static inline int search_dirblock(struct buffer_head
*bh
,
1296 struct ext4_filename
*fname
,
1297 unsigned int offset
,
1298 struct ext4_dir_entry_2
**res_dir
)
1300 return ext4_search_dir(bh
, bh
->b_data
, dir
->i_sb
->s_blocksize
, dir
,
1301 fname
, offset
, res_dir
);
1305 * Directory block splitting, compacting
1309 * Create map of hash values, offsets, and sizes, stored at end of block.
1310 * Returns number of entries mapped.
1312 static int dx_make_map(struct inode
*dir
, struct buffer_head
*bh
,
1313 struct dx_hash_info
*hinfo
,
1314 struct dx_map_entry
*map_tail
)
1317 struct ext4_dir_entry_2
*de
= (struct ext4_dir_entry_2
*)bh
->b_data
;
1318 unsigned int buflen
= bh
->b_size
;
1319 char *base
= bh
->b_data
;
1320 struct dx_hash_info h
= *hinfo
;
1321 int blocksize
= EXT4_BLOCK_SIZE(dir
->i_sb
);
1323 if (ext4_has_metadata_csum(dir
->i_sb
))
1324 buflen
-= sizeof(struct ext4_dir_entry_tail
);
1326 while ((char *) de
< base
+ buflen
) {
1327 if (ext4_check_dir_entry(dir
, NULL
, de
, bh
, base
, buflen
,
1328 ((char *)de
) - base
))
1329 return -EFSCORRUPTED
;
1330 if (de
->name_len
&& de
->inode
) {
1331 if (ext4_hash_in_dirent(dir
))
1332 h
.hash
= EXT4_DIRENT_HASH(de
);
1334 int err
= ext4fs_dirhash(dir
, de
->name
,
1340 map_tail
->hash
= h
.hash
;
1341 map_tail
->offs
= ((char *) de
- base
)>>2;
1342 map_tail
->size
= ext4_rec_len_from_disk(de
->rec_len
,
1347 de
= ext4_next_entry(de
, blocksize
);
1352 /* Sort map by hash value */
1353 static void dx_sort_map (struct dx_map_entry
*map
, unsigned count
)
1355 struct dx_map_entry
*p
, *q
, *top
= map
+ count
- 1;
1357 /* Combsort until bubble sort doesn't suck */
1359 count
= count
*10/13;
1360 if (count
- 9 < 2) /* 9, 10 -> 11 */
1362 for (p
= top
, q
= p
- count
; q
>= map
; p
--, q
--)
1363 if (p
->hash
< q
->hash
)
1366 /* Garden variety bubble sort */
1371 if (q
[1].hash
>= q
[0].hash
)
1379 static void dx_insert_block(struct dx_frame
*frame
, u32 hash
, ext4_lblk_t block
)
1381 struct dx_entry
*entries
= frame
->entries
;
1382 struct dx_entry
*old
= frame
->at
, *new = old
+ 1;
1383 int count
= dx_get_count(entries
);
1385 ASSERT(count
< dx_get_limit(entries
));
1386 ASSERT(old
< entries
+ count
);
1387 memmove(new + 1, new, (char *)(entries
+ count
) - (char *)(new));
1388 dx_set_hash(new, hash
);
1389 dx_set_block(new, block
);
1390 dx_set_count(entries
, count
+ 1);
1393 #if IS_ENABLED(CONFIG_UNICODE)
1394 int ext4_fname_setup_ci_filename(struct inode
*dir
, const struct qstr
*iname
,
1395 struct ext4_filename
*name
)
1397 struct qstr
*cf_name
= &name
->cf_name
;
1399 struct dx_hash_info
*hinfo
= &name
->hinfo
;
1402 if (!IS_CASEFOLDED(dir
) ||
1403 (IS_ENCRYPTED(dir
) && !fscrypt_has_encryption_key(dir
))) {
1404 cf_name
->name
= NULL
;
1408 buf
= kmalloc(EXT4_NAME_LEN
, GFP_NOFS
);
1412 len
= utf8_casefold(dir
->i_sb
->s_encoding
, iname
, buf
, EXT4_NAME_LEN
);
1417 cf_name
->name
= buf
;
1418 cf_name
->len
= (unsigned) len
;
1420 if (!IS_ENCRYPTED(dir
))
1423 hinfo
->hash_version
= DX_HASH_SIPHASH
;
1426 return ext4fs_dirhash(dir
, cf_name
->name
, cf_name
->len
, hinfo
);
1428 return ext4fs_dirhash(dir
, iname
->name
, iname
->len
, hinfo
);
1433 * Test whether a directory entry matches the filename being searched for.
1435 * Return: %true if the directory entry matches, otherwise %false.
1437 static bool ext4_match(struct inode
*parent
,
1438 const struct ext4_filename
*fname
,
1439 struct ext4_dir_entry_2
*de
)
1441 struct fscrypt_name f
;
1446 f
.usr_fname
= fname
->usr_fname
;
1447 f
.disk_name
= fname
->disk_name
;
1448 #ifdef CONFIG_FS_ENCRYPTION
1449 f
.crypto_buf
= fname
->crypto_buf
;
1452 #if IS_ENABLED(CONFIG_UNICODE)
1453 if (IS_CASEFOLDED(parent
) &&
1454 (!IS_ENCRYPTED(parent
) || fscrypt_has_encryption_key(parent
))) {
1456 * Just checking IS_ENCRYPTED(parent) below is not
1457 * sufficient to decide whether one can use the hash for
1458 * skipping the string comparison, because the key might
1459 * have been added right after
1460 * ext4_fname_setup_ci_filename(). In this case, a hash
1461 * mismatch will be a false negative. Therefore, make
1462 * sure cf_name was properly initialized before
1463 * considering the calculated hash.
1465 if (IS_ENCRYPTED(parent
) && fname
->cf_name
.name
&&
1466 (fname
->hinfo
.hash
!= EXT4_DIRENT_HASH(de
) ||
1467 fname
->hinfo
.minor_hash
!= EXT4_DIRENT_MINOR_HASH(de
)))
1470 * Treat comparison errors as not a match. The
1471 * only case where it happens is on a disk
1472 * corruption or ENOMEM.
1475 return generic_ci_match(parent
, fname
->usr_fname
,
1476 &fname
->cf_name
, de
->name
,
1481 return fscrypt_match_name(&f
, de
->name
, de
->name_len
);
1485 * Returns 0 if not found, -EFSCORRUPTED on failure, and 1 on success
1487 int ext4_search_dir(struct buffer_head
*bh
, char *search_buf
, int buf_size
,
1488 struct inode
*dir
, struct ext4_filename
*fname
,
1489 unsigned int offset
, struct ext4_dir_entry_2
**res_dir
)
1491 struct ext4_dir_entry_2
* de
;
1495 de
= (struct ext4_dir_entry_2
*)search_buf
;
1496 dlimit
= search_buf
+ buf_size
;
1497 while ((char *) de
< dlimit
- EXT4_BASE_DIR_LEN
) {
1498 /* this code is executed quadratically often */
1499 /* do minimal checking `by hand' */
1500 if (de
->name
+ de
->name_len
<= dlimit
&&
1501 ext4_match(dir
, fname
, de
)) {
1502 /* found a match - just to be sure, do
1504 if (ext4_check_dir_entry(dir
, NULL
, de
, bh
, search_buf
,
1506 return -EFSCORRUPTED
;
1510 /* prevent looping on a bad block */
1511 de_len
= ext4_rec_len_from_disk(de
->rec_len
,
1512 dir
->i_sb
->s_blocksize
);
1514 return -EFSCORRUPTED
;
1516 de
= (struct ext4_dir_entry_2
*) ((char *) de
+ de_len
);
1521 static int is_dx_internal_node(struct inode
*dir
, ext4_lblk_t block
,
1522 struct ext4_dir_entry
*de
)
1524 struct super_block
*sb
= dir
->i_sb
;
1530 if (de
->inode
== 0 &&
1531 ext4_rec_len_from_disk(de
->rec_len
, sb
->s_blocksize
) ==
1538 * __ext4_find_entry()
1540 * finds an entry in the specified directory with the wanted name. It
1541 * returns the cache buffer in which the entry was found, and the entry
1542 * itself (as a parameter - res_dir). It does NOT read the inode of the
1543 * entry - you'll have to do that yourself if you want to.
1545 * The returned buffer_head has ->b_count elevated. The caller is expected
1546 * to brelse() it when appropriate.
1548 static struct buffer_head
*__ext4_find_entry(struct inode
*dir
,
1549 struct ext4_filename
*fname
,
1550 struct ext4_dir_entry_2
**res_dir
,
1553 struct super_block
*sb
;
1554 struct buffer_head
*bh_use
[NAMEI_RA_SIZE
];
1555 struct buffer_head
*bh
, *ret
= NULL
;
1556 ext4_lblk_t start
, block
;
1557 const u8
*name
= fname
->usr_fname
->name
;
1558 size_t ra_max
= 0; /* Number of bh's in the readahead
1560 size_t ra_ptr
= 0; /* Current index into readahead
1562 ext4_lblk_t nblocks
;
1563 int i
, namelen
, retval
;
1567 namelen
= fname
->usr_fname
->len
;
1568 if (namelen
> EXT4_NAME_LEN
)
1571 if (ext4_has_inline_data(dir
)) {
1572 int has_inline_data
= 1;
1573 ret
= ext4_find_inline_entry(dir
, fname
, res_dir
,
1576 *inlined
= has_inline_data
;
1577 if (has_inline_data
|| IS_ERR(ret
))
1578 goto cleanup_and_exit
;
1581 if ((namelen
<= 2) && (name
[0] == '.') &&
1582 (name
[1] == '.' || name
[1] == '\0')) {
1584 * "." or ".." will only be in the first block
1585 * NFS may look up ".."; "." should be handled by the VFS
1592 ret
= ext4_dx_find_entry(dir
, fname
, res_dir
);
1594 * On success, or if the error was file not found,
1595 * return. Otherwise, fall back to doing a search the
1596 * old fashioned way.
1598 if (!IS_ERR(ret
) || PTR_ERR(ret
) != ERR_BAD_DX_DIR
)
1599 goto cleanup_and_exit
;
1600 dxtrace(printk(KERN_DEBUG
"ext4_find_entry: dx failed, "
1604 nblocks
= dir
->i_size
>> EXT4_BLOCK_SIZE_BITS(sb
);
1607 goto cleanup_and_exit
;
1609 start
= EXT4_I(dir
)->i_dir_start_lookup
;
1610 if (start
>= nblocks
)
1616 * We deal with the read-ahead logic here.
1619 if (ra_ptr
>= ra_max
) {
1620 /* Refill the readahead buffer */
1623 ra_max
= start
- block
;
1625 ra_max
= nblocks
- block
;
1626 ra_max
= min(ra_max
, ARRAY_SIZE(bh_use
));
1627 retval
= ext4_bread_batch(dir
, block
, ra_max
,
1628 false /* wait */, bh_use
);
1630 ret
= ERR_PTR(retval
);
1632 goto cleanup_and_exit
;
1635 if ((bh
= bh_use
[ra_ptr
++]) == NULL
)
1638 if (!buffer_uptodate(bh
)) {
1639 EXT4_ERROR_INODE_ERR(dir
, EIO
,
1640 "reading directory lblock %lu",
1641 (unsigned long) block
);
1643 ret
= ERR_PTR(-EIO
);
1644 goto cleanup_and_exit
;
1646 if (!buffer_verified(bh
) &&
1647 !is_dx_internal_node(dir
, block
,
1648 (struct ext4_dir_entry
*)bh
->b_data
) &&
1649 !ext4_dirblock_csum_verify(dir
, bh
)) {
1650 EXT4_ERROR_INODE_ERR(dir
, EFSBADCRC
,
1651 "checksumming directory "
1652 "block %lu", (unsigned long)block
);
1654 ret
= ERR_PTR(-EFSBADCRC
);
1655 goto cleanup_and_exit
;
1657 set_buffer_verified(bh
);
1658 i
= search_dirblock(bh
, dir
, fname
,
1659 block
<< EXT4_BLOCK_SIZE_BITS(sb
), res_dir
);
1661 EXT4_I(dir
)->i_dir_start_lookup
= block
;
1663 goto cleanup_and_exit
;
1668 goto cleanup_and_exit
;
1672 if (++block
>= nblocks
)
1674 } while (block
!= start
);
1677 * If the directory has grown while we were searching, then
1678 * search the last part of the directory before giving up.
1681 nblocks
= dir
->i_size
>> EXT4_BLOCK_SIZE_BITS(sb
);
1682 if (block
< nblocks
) {
1688 /* Clean up the read-ahead blocks */
1689 for (; ra_ptr
< ra_max
; ra_ptr
++)
1690 brelse(bh_use
[ra_ptr
]);
1694 static struct buffer_head
*ext4_find_entry(struct inode
*dir
,
1695 const struct qstr
*d_name
,
1696 struct ext4_dir_entry_2
**res_dir
,
1700 struct ext4_filename fname
;
1701 struct buffer_head
*bh
;
1703 err
= ext4_fname_setup_filename(dir
, d_name
, 1, &fname
);
1707 return ERR_PTR(err
);
1709 bh
= __ext4_find_entry(dir
, &fname
, res_dir
, inlined
);
1711 ext4_fname_free_filename(&fname
);
1715 static struct buffer_head
*ext4_lookup_entry(struct inode
*dir
,
1716 struct dentry
*dentry
,
1717 struct ext4_dir_entry_2
**res_dir
)
1720 struct ext4_filename fname
;
1721 struct buffer_head
*bh
;
1723 err
= ext4_fname_prepare_lookup(dir
, dentry
, &fname
);
1727 return ERR_PTR(err
);
1729 bh
= __ext4_find_entry(dir
, &fname
, res_dir
, NULL
);
1731 ext4_fname_free_filename(&fname
);
1735 static struct buffer_head
* ext4_dx_find_entry(struct inode
*dir
,
1736 struct ext4_filename
*fname
,
1737 struct ext4_dir_entry_2
**res_dir
)
1739 struct super_block
* sb
= dir
->i_sb
;
1740 struct dx_frame frames
[EXT4_HTREE_LEVEL
], *frame
;
1741 struct buffer_head
*bh
;
1745 #ifdef CONFIG_FS_ENCRYPTION
1748 frame
= dx_probe(fname
, dir
, NULL
, frames
);
1750 return ERR_CAST(frame
);
1752 block
= dx_get_block(frame
->at
);
1753 bh
= ext4_read_dirblock(dir
, block
, DIRENT_HTREE
);
1757 retval
= search_dirblock(bh
, dir
, fname
,
1758 block
<< EXT4_BLOCK_SIZE_BITS(sb
),
1764 bh
= ERR_PTR(ERR_BAD_DX_DIR
);
1768 /* Check to see if we should continue to search */
1769 retval
= ext4_htree_next_block(dir
, fname
->hinfo
.hash
, frame
,
1772 ext4_warning_inode(dir
,
1773 "error %d reading directory index block",
1775 bh
= ERR_PTR(retval
);
1778 } while (retval
== 1);
1782 dxtrace(printk(KERN_DEBUG
"%s not found\n", fname
->usr_fname
->name
));
1788 static struct dentry
*ext4_lookup(struct inode
*dir
, struct dentry
*dentry
, unsigned int flags
)
1790 struct inode
*inode
;
1791 struct ext4_dir_entry_2
*de
;
1792 struct buffer_head
*bh
;
1794 if (dentry
->d_name
.len
> EXT4_NAME_LEN
)
1795 return ERR_PTR(-ENAMETOOLONG
);
1797 bh
= ext4_lookup_entry(dir
, dentry
, &de
);
1799 return ERR_CAST(bh
);
1802 __u32 ino
= le32_to_cpu(de
->inode
);
1804 if (!ext4_valid_inum(dir
->i_sb
, ino
)) {
1805 EXT4_ERROR_INODE(dir
, "bad inode number: %u", ino
);
1806 return ERR_PTR(-EFSCORRUPTED
);
1808 if (unlikely(ino
== dir
->i_ino
)) {
1809 EXT4_ERROR_INODE(dir
, "'%pd' linked to parent dir",
1811 return ERR_PTR(-EFSCORRUPTED
);
1813 inode
= ext4_iget(dir
->i_sb
, ino
, EXT4_IGET_NORMAL
);
1814 if (inode
== ERR_PTR(-ESTALE
)) {
1815 EXT4_ERROR_INODE(dir
,
1816 "deleted inode referenced: %u",
1818 return ERR_PTR(-EFSCORRUPTED
);
1820 if (!IS_ERR(inode
) && IS_ENCRYPTED(dir
) &&
1821 (S_ISDIR(inode
->i_mode
) || S_ISLNK(inode
->i_mode
)) &&
1822 !fscrypt_has_permitted_context(dir
, inode
)) {
1823 ext4_warning(inode
->i_sb
,
1824 "Inconsistent encryption contexts: %lu/%lu",
1825 dir
->i_ino
, inode
->i_ino
);
1827 return ERR_PTR(-EPERM
);
1831 if (IS_ENABLED(CONFIG_UNICODE
) && !inode
&& IS_CASEFOLDED(dir
)) {
1832 /* Eventually we want to call d_add_ci(dentry, NULL)
1833 * for negative dentries in the encoding case as
1834 * well. For now, prevent the negative dentry
1835 * from being cached.
1840 return d_splice_alias(inode
, dentry
);
1844 struct dentry
*ext4_get_parent(struct dentry
*child
)
1847 struct ext4_dir_entry_2
* de
;
1848 struct buffer_head
*bh
;
1850 bh
= ext4_find_entry(d_inode(child
), &dotdot_name
, &de
, NULL
);
1852 return ERR_CAST(bh
);
1854 return ERR_PTR(-ENOENT
);
1855 ino
= le32_to_cpu(de
->inode
);
1858 if (!ext4_valid_inum(child
->d_sb
, ino
)) {
1859 EXT4_ERROR_INODE(d_inode(child
),
1860 "bad parent inode number: %u", ino
);
1861 return ERR_PTR(-EFSCORRUPTED
);
1864 return d_obtain_alias(ext4_iget(child
->d_sb
, ino
, EXT4_IGET_NORMAL
));
1868 * Move count entries from end of map between two memory locations.
1869 * Returns pointer to last entry moved.
1871 static struct ext4_dir_entry_2
*
1872 dx_move_dirents(struct inode
*dir
, char *from
, char *to
,
1873 struct dx_map_entry
*map
, int count
,
1876 unsigned rec_len
= 0;
1879 struct ext4_dir_entry_2
*de
= (struct ext4_dir_entry_2
*)
1880 (from
+ (map
->offs
<<2));
1881 rec_len
= ext4_dir_rec_len(de
->name_len
, dir
);
1883 memcpy (to
, de
, rec_len
);
1884 ((struct ext4_dir_entry_2
*) to
)->rec_len
=
1885 ext4_rec_len_to_disk(rec_len
, blocksize
);
1887 /* wipe dir_entry excluding the rec_len field */
1889 memset(&de
->name_len
, 0, ext4_rec_len_from_disk(de
->rec_len
,
1891 offsetof(struct ext4_dir_entry_2
,
1897 return (struct ext4_dir_entry_2
*) (to
- rec_len
);
1901 * Compact each dir entry in the range to the minimal rec_len.
1902 * Returns pointer to last entry in range.
1904 static struct ext4_dir_entry_2
*dx_pack_dirents(struct inode
*dir
, char *base
,
1905 unsigned int blocksize
)
1907 struct ext4_dir_entry_2
*next
, *to
, *prev
, *de
= (struct ext4_dir_entry_2
*) base
;
1908 unsigned rec_len
= 0;
1911 while ((char*)de
< base
+ blocksize
) {
1912 next
= ext4_next_entry(de
, blocksize
);
1913 if (de
->inode
&& de
->name_len
) {
1914 rec_len
= ext4_dir_rec_len(de
->name_len
, dir
);
1916 memmove(to
, de
, rec_len
);
1917 to
->rec_len
= ext4_rec_len_to_disk(rec_len
, blocksize
);
1919 to
= (struct ext4_dir_entry_2
*) (((char *) to
) + rec_len
);
1927 * Split a full leaf block to make room for a new dir entry.
1928 * Allocate a new block, and move entries so that they are approx. equally full.
1929 * Returns pointer to de in block into which the new entry will be inserted.
1931 static struct ext4_dir_entry_2
*do_split(handle_t
*handle
, struct inode
*dir
,
1932 struct buffer_head
**bh
,struct dx_frame
*frame
,
1933 struct dx_hash_info
*hinfo
)
1935 unsigned blocksize
= dir
->i_sb
->s_blocksize
;
1938 struct buffer_head
*bh2
;
1939 ext4_lblk_t newblock
;
1941 struct dx_map_entry
*map
;
1942 char *data1
= (*bh
)->b_data
, *data2
;
1943 unsigned split
, move
, size
;
1944 struct ext4_dir_entry_2
*de
= NULL
, *de2
;
1948 if (ext4_has_metadata_csum(dir
->i_sb
))
1949 csum_size
= sizeof(struct ext4_dir_entry_tail
);
1951 bh2
= ext4_append(handle
, dir
, &newblock
);
1955 return ERR_CAST(bh2
);
1958 BUFFER_TRACE(*bh
, "get_write_access");
1959 err
= ext4_journal_get_write_access(handle
, dir
->i_sb
, *bh
,
1964 BUFFER_TRACE(frame
->bh
, "get_write_access");
1965 err
= ext4_journal_get_write_access(handle
, dir
->i_sb
, frame
->bh
,
1970 data2
= bh2
->b_data
;
1972 /* create map in the end of data2 block */
1973 map
= (struct dx_map_entry
*) (data2
+ blocksize
);
1974 count
= dx_make_map(dir
, *bh
, hinfo
, map
);
1980 dx_sort_map(map
, count
);
1981 /* Ensure that neither split block is over half full */
1984 for (i
= count
-1; i
>= 0; i
--) {
1985 /* is more than half of this entry in 2nd half of the block? */
1986 if (size
+ map
[i
].size
/2 > blocksize
/2)
1988 size
+= map
[i
].size
;
1992 * map index at which we will split
1994 * If the sum of active entries didn't exceed half the block size, just
1995 * split it in half by count; each resulting block will have at least
1996 * half the space free.
1999 split
= count
- move
;
2003 if (WARN_ON_ONCE(split
== 0)) {
2004 /* Should never happen, but avoid out-of-bounds access below */
2005 ext4_error_inode_block(dir
, (*bh
)->b_blocknr
, 0,
2006 "bad indexed directory? hash=%08x:%08x count=%d move=%u",
2007 hinfo
->hash
, hinfo
->minor_hash
, count
, move
);
2008 err
= -EFSCORRUPTED
;
2012 hash2
= map
[split
].hash
;
2013 continued
= hash2
== map
[split
- 1].hash
;
2014 dxtrace(printk(KERN_INFO
"Split block %lu at %x, %i/%i\n",
2015 (unsigned long)dx_get_block(frame
->at
),
2016 hash2
, split
, count
-split
));
2018 /* Fancy dance to stay within two buffers */
2019 de2
= dx_move_dirents(dir
, data1
, data2
, map
+ split
, count
- split
,
2021 de
= dx_pack_dirents(dir
, data1
, blocksize
);
2022 de
->rec_len
= ext4_rec_len_to_disk(data1
+ (blocksize
- csum_size
) -
2025 de2
->rec_len
= ext4_rec_len_to_disk(data2
+ (blocksize
- csum_size
) -
2029 ext4_initialize_dirent_tail(*bh
, blocksize
);
2030 ext4_initialize_dirent_tail(bh2
, blocksize
);
2033 dxtrace(dx_show_leaf(dir
, hinfo
, (struct ext4_dir_entry_2
*) data1
,
2035 dxtrace(dx_show_leaf(dir
, hinfo
, (struct ext4_dir_entry_2
*) data2
,
2038 /* Which block gets the new entry? */
2039 if (hinfo
->hash
>= hash2
) {
2043 dx_insert_block(frame
, hash2
+ continued
, newblock
);
2044 err
= ext4_handle_dirty_dirblock(handle
, dir
, bh2
);
2047 err
= ext4_handle_dirty_dx_node(handle
, dir
, frame
->bh
);
2051 dxtrace(dx_show_index("frame", frame
->entries
));
2055 ext4_std_error(dir
->i_sb
, err
);
2060 return ERR_PTR(err
);
2063 int ext4_find_dest_de(struct inode
*dir
, struct inode
*inode
,
2064 struct buffer_head
*bh
,
2065 void *buf
, int buf_size
,
2066 struct ext4_filename
*fname
,
2067 struct ext4_dir_entry_2
**dest_de
)
2069 struct ext4_dir_entry_2
*de
;
2070 unsigned short reclen
= ext4_dir_rec_len(fname_len(fname
), dir
);
2072 unsigned int offset
= 0;
2076 top
= buf
+ buf_size
- reclen
;
2077 while ((char *) de
<= top
) {
2078 if (ext4_check_dir_entry(dir
, NULL
, de
, bh
,
2079 buf
, buf_size
, offset
))
2080 return -EFSCORRUPTED
;
2081 if (ext4_match(dir
, fname
, de
))
2083 nlen
= ext4_dir_rec_len(de
->name_len
, dir
);
2084 rlen
= ext4_rec_len_from_disk(de
->rec_len
, buf_size
);
2085 if ((de
->inode
? rlen
- nlen
: rlen
) >= reclen
)
2087 de
= (struct ext4_dir_entry_2
*)((char *)de
+ rlen
);
2090 if ((char *) de
> top
)
2097 void ext4_insert_dentry(struct inode
*dir
,
2098 struct inode
*inode
,
2099 struct ext4_dir_entry_2
*de
,
2101 struct ext4_filename
*fname
)
2106 nlen
= ext4_dir_rec_len(de
->name_len
, dir
);
2107 rlen
= ext4_rec_len_from_disk(de
->rec_len
, buf_size
);
2109 struct ext4_dir_entry_2
*de1
=
2110 (struct ext4_dir_entry_2
*)((char *)de
+ nlen
);
2111 de1
->rec_len
= ext4_rec_len_to_disk(rlen
- nlen
, buf_size
);
2112 de
->rec_len
= ext4_rec_len_to_disk(nlen
, buf_size
);
2115 de
->file_type
= EXT4_FT_UNKNOWN
;
2116 de
->inode
= cpu_to_le32(inode
->i_ino
);
2117 ext4_set_de_type(inode
->i_sb
, de
, inode
->i_mode
);
2118 de
->name_len
= fname_len(fname
);
2119 memcpy(de
->name
, fname_name(fname
), fname_len(fname
));
2120 if (ext4_hash_in_dirent(dir
)) {
2121 struct dx_hash_info
*hinfo
= &fname
->hinfo
;
2123 EXT4_DIRENT_HASHES(de
)->hash
= cpu_to_le32(hinfo
->hash
);
2124 EXT4_DIRENT_HASHES(de
)->minor_hash
=
2125 cpu_to_le32(hinfo
->minor_hash
);
2130 * Add a new entry into a directory (leaf) block. If de is non-NULL,
2131 * it points to a directory entry which is guaranteed to be large
2132 * enough for new directory entry. If de is NULL, then
2133 * add_dirent_to_buf will attempt search the directory block for
2134 * space. It will return -ENOSPC if no space is available, and -EIO
2135 * and -EEXIST if directory entry already exists.
2137 static int add_dirent_to_buf(handle_t
*handle
, struct ext4_filename
*fname
,
2139 struct inode
*inode
, struct ext4_dir_entry_2
*de
,
2140 struct buffer_head
*bh
)
2142 unsigned int blocksize
= dir
->i_sb
->s_blocksize
;
2146 if (ext4_has_metadata_csum(inode
->i_sb
))
2147 csum_size
= sizeof(struct ext4_dir_entry_tail
);
2150 err
= ext4_find_dest_de(dir
, inode
, bh
, bh
->b_data
,
2151 blocksize
- csum_size
, fname
, &de
);
2155 BUFFER_TRACE(bh
, "get_write_access");
2156 err
= ext4_journal_get_write_access(handle
, dir
->i_sb
, bh
,
2159 ext4_std_error(dir
->i_sb
, err
);
2163 /* By now the buffer is marked for journaling */
2164 ext4_insert_dentry(dir
, inode
, de
, blocksize
, fname
);
2167 * XXX shouldn't update any times until successful
2168 * completion of syscall, but too many callers depend
2171 * XXX similarly, too many callers depend on
2172 * ext4_new_inode() setting the times, but error
2173 * recovery deletes the inode, so the worst that can
2174 * happen is that the times are slightly out of date
2175 * and/or different from the directory change time.
2177 inode_set_mtime_to_ts(dir
, inode_set_ctime_current(dir
));
2178 ext4_update_dx_flag(dir
);
2179 inode_inc_iversion(dir
);
2180 err2
= ext4_mark_inode_dirty(handle
, dir
);
2181 BUFFER_TRACE(bh
, "call ext4_handle_dirty_metadata");
2182 err
= ext4_handle_dirty_dirblock(handle
, dir
, bh
);
2184 ext4_std_error(dir
->i_sb
, err
);
2185 return err
? err
: err2
;
2188 static bool ext4_check_dx_root(struct inode
*dir
, struct dx_root
*root
)
2190 struct fake_dirent
*fde
;
2191 const char *error_msg
;
2193 unsigned int blocksize
= dir
->i_sb
->s_blocksize
;
2194 char *blockend
= (char *)root
+ dir
->i_sb
->s_blocksize
;
2197 if (unlikely(fde
->name_len
!= 1)) {
2198 error_msg
= "invalid name_len for '.'";
2201 if (unlikely(strncmp(root
->dot_name
, ".", fde
->name_len
))) {
2202 error_msg
= "invalid name for '.'";
2205 rlen
= ext4_rec_len_from_disk(fde
->rec_len
, blocksize
);
2206 if (unlikely((char *)fde
+ rlen
>= blockend
)) {
2207 error_msg
= "invalid rec_len for '.'";
2211 fde
= &root
->dotdot
;
2212 if (unlikely(fde
->name_len
!= 2)) {
2213 error_msg
= "invalid name_len for '..'";
2216 if (unlikely(strncmp(root
->dotdot_name
, "..", fde
->name_len
))) {
2217 error_msg
= "invalid name for '..'";
2220 rlen
= ext4_rec_len_from_disk(fde
->rec_len
, blocksize
);
2221 if (unlikely((char *)fde
+ rlen
>= blockend
)) {
2222 error_msg
= "invalid rec_len for '..'";
2229 EXT4_ERROR_INODE(dir
, "Corrupt dir, %s, running e2fsck is recommended",
2235 * This converts a one block unindexed directory to a 3 block indexed
2236 * directory, and adds the dentry to the indexed directory.
2238 static int make_indexed_dir(handle_t
*handle
, struct ext4_filename
*fname
,
2240 struct inode
*inode
, struct buffer_head
*bh
)
2242 struct buffer_head
*bh2
;
2243 struct dx_root
*root
;
2244 struct dx_frame frames
[EXT4_HTREE_LEVEL
], *frame
;
2245 struct dx_entry
*entries
;
2246 struct ext4_dir_entry_2
*de
, *de2
;
2252 struct fake_dirent
*fde
;
2255 if (ext4_has_metadata_csum(inode
->i_sb
))
2256 csum_size
= sizeof(struct ext4_dir_entry_tail
);
2258 blocksize
= dir
->i_sb
->s_blocksize
;
2259 dxtrace(printk(KERN_DEBUG
"Creating index: inode %lu\n", dir
->i_ino
));
2260 BUFFER_TRACE(bh
, "get_write_access");
2261 retval
= ext4_journal_get_write_access(handle
, dir
->i_sb
, bh
,
2264 ext4_std_error(dir
->i_sb
, retval
);
2269 root
= (struct dx_root
*) bh
->b_data
;
2270 if (!ext4_check_dx_root(dir
, root
)) {
2272 return -EFSCORRUPTED
;
2275 /* The 0th block becomes the root, move the dirents out */
2276 fde
= &root
->dotdot
;
2277 de
= (struct ext4_dir_entry_2
*)((char *)fde
+
2278 ext4_rec_len_from_disk(fde
->rec_len
, blocksize
));
2279 len
= ((char *) root
) + (blocksize
- csum_size
) - (char *) de
;
2281 /* Allocate new block for the 0th block's dirents */
2282 bh2
= ext4_append(handle
, dir
, &block
);
2285 return PTR_ERR(bh2
);
2287 ext4_set_inode_flag(dir
, EXT4_INODE_INDEX
);
2288 data2
= bh2
->b_data
;
2290 memcpy(data2
, de
, len
);
2291 memset(de
, 0, len
); /* wipe old data */
2292 de
= (struct ext4_dir_entry_2
*) data2
;
2294 while ((char *)(de2
= ext4_next_entry(de
, blocksize
)) < top
) {
2295 if (ext4_check_dir_entry(dir
, NULL
, de
, bh2
, data2
, len
,
2296 (char *)de
- data2
)) {
2299 return -EFSCORRUPTED
;
2303 de
->rec_len
= ext4_rec_len_to_disk(data2
+ (blocksize
- csum_size
) -
2304 (char *) de
, blocksize
);
2307 ext4_initialize_dirent_tail(bh2
, blocksize
);
2309 /* Initialize the root; the dot dirents already exist */
2310 de
= (struct ext4_dir_entry_2
*) (&root
->dotdot
);
2311 de
->rec_len
= ext4_rec_len_to_disk(
2312 blocksize
- ext4_dir_rec_len(2, NULL
), blocksize
);
2313 memset (&root
->info
, 0, sizeof(root
->info
));
2314 root
->info
.info_length
= sizeof(root
->info
);
2315 if (ext4_hash_in_dirent(dir
))
2316 root
->info
.hash_version
= DX_HASH_SIPHASH
;
2318 root
->info
.hash_version
=
2319 EXT4_SB(dir
->i_sb
)->s_def_hash_version
;
2321 entries
= root
->entries
;
2322 dx_set_block(entries
, 1);
2323 dx_set_count(entries
, 1);
2324 dx_set_limit(entries
, dx_root_limit(dir
, sizeof(root
->info
)));
2326 /* Initialize as for dx_probe */
2327 fname
->hinfo
.hash_version
= root
->info
.hash_version
;
2328 if (fname
->hinfo
.hash_version
<= DX_HASH_TEA
)
2329 fname
->hinfo
.hash_version
+= EXT4_SB(dir
->i_sb
)->s_hash_unsigned
;
2330 fname
->hinfo
.seed
= EXT4_SB(dir
->i_sb
)->s_hash_seed
;
2332 /* casefolded encrypted hashes are computed on fname setup */
2333 if (!ext4_hash_in_dirent(dir
)) {
2334 int err
= ext4fs_dirhash(dir
, fname_name(fname
),
2335 fname_len(fname
), &fname
->hinfo
);
2342 memset(frames
, 0, sizeof(frames
));
2344 frame
->entries
= entries
;
2345 frame
->at
= entries
;
2348 retval
= ext4_handle_dirty_dx_node(handle
, dir
, frame
->bh
);
2351 retval
= ext4_handle_dirty_dirblock(handle
, dir
, bh2
);
2355 de
= do_split(handle
,dir
, &bh2
, frame
, &fname
->hinfo
);
2357 retval
= PTR_ERR(de
);
2361 retval
= add_dirent_to_buf(handle
, fname
, dir
, inode
, de
, bh2
);
2364 * Even if the block split failed, we have to properly write
2365 * out all the changes we did so far. Otherwise we can end up
2366 * with corrupted filesystem.
2369 ext4_mark_inode_dirty(handle
, dir
);
2378 * adds a file entry to the specified directory, using the same
2379 * semantics as ext4_find_entry(). It returns NULL if it failed.
2381 * NOTE!! The inode part of 'de' is left at 0 - which means you
2382 * may not sleep between calling this and putting something into
2383 * the entry, as someone else might have used it while you slept.
2385 static int ext4_add_entry(handle_t
*handle
, struct dentry
*dentry
,
2386 struct inode
*inode
)
2388 struct inode
*dir
= d_inode(dentry
->d_parent
);
2389 struct buffer_head
*bh
= NULL
;
2390 struct ext4_dir_entry_2
*de
;
2391 struct super_block
*sb
;
2392 struct ext4_filename fname
;
2396 ext4_lblk_t block
, blocks
;
2399 if (ext4_has_metadata_csum(inode
->i_sb
))
2400 csum_size
= sizeof(struct ext4_dir_entry_tail
);
2403 blocksize
= sb
->s_blocksize
;
2405 if (fscrypt_is_nokey_name(dentry
))
2408 if (!generic_ci_validate_strict_name(dir
, &dentry
->d_name
))
2411 retval
= ext4_fname_setup_filename(dir
, &dentry
->d_name
, 0, &fname
);
2415 if (ext4_has_inline_data(dir
)) {
2416 retval
= ext4_try_add_inline_entry(handle
, &fname
, dir
, inode
);
2426 retval
= ext4_dx_add_entry(handle
, &fname
, dir
, inode
);
2427 if (!retval
|| (retval
!= ERR_BAD_DX_DIR
))
2429 /* Can we just ignore htree data? */
2430 if (ext4_has_metadata_csum(sb
)) {
2431 EXT4_ERROR_INODE(dir
,
2432 "Directory has corrupted htree index.");
2433 retval
= -EFSCORRUPTED
;
2436 ext4_clear_inode_flag(dir
, EXT4_INODE_INDEX
);
2438 retval
= ext4_mark_inode_dirty(handle
, dir
);
2439 if (unlikely(retval
))
2442 blocks
= dir
->i_size
>> sb
->s_blocksize_bits
;
2443 for (block
= 0; block
< blocks
; block
++) {
2444 bh
= ext4_read_dirblock(dir
, block
, DIRENT
);
2446 bh
= ext4_bread(handle
, dir
, block
,
2447 EXT4_GET_BLOCKS_CREATE
);
2448 goto add_to_new_block
;
2451 retval
= PTR_ERR(bh
);
2455 retval
= add_dirent_to_buf(handle
, &fname
, dir
, inode
,
2457 if (retval
!= -ENOSPC
)
2460 if (blocks
== 1 && !dx_fallback
&&
2461 ext4_has_feature_dir_index(sb
)) {
2462 retval
= make_indexed_dir(handle
, &fname
, dir
,
2464 bh
= NULL
; /* make_indexed_dir releases bh */
2469 bh
= ext4_append(handle
, dir
, &block
);
2472 retval
= PTR_ERR(bh
);
2476 de
= (struct ext4_dir_entry_2
*) bh
->b_data
;
2478 de
->rec_len
= ext4_rec_len_to_disk(blocksize
- csum_size
, blocksize
);
2481 ext4_initialize_dirent_tail(bh
, blocksize
);
2483 retval
= add_dirent_to_buf(handle
, &fname
, dir
, inode
, de
, bh
);
2485 ext4_fname_free_filename(&fname
);
2488 ext4_set_inode_state(inode
, EXT4_STATE_NEWENTRY
);
2493 * Returns 0 for success, or a negative error value
2495 static int ext4_dx_add_entry(handle_t
*handle
, struct ext4_filename
*fname
,
2496 struct inode
*dir
, struct inode
*inode
)
2498 struct dx_frame frames
[EXT4_HTREE_LEVEL
], *frame
;
2499 struct dx_entry
*entries
, *at
;
2500 struct buffer_head
*bh
;
2501 struct super_block
*sb
= dir
->i_sb
;
2502 struct ext4_dir_entry_2
*de
;
2508 frame
= dx_probe(fname
, dir
, NULL
, frames
);
2510 return PTR_ERR(frame
);
2511 entries
= frame
->entries
;
2513 bh
= ext4_read_dirblock(dir
, dx_get_block(frame
->at
), DIRENT_HTREE
);
2520 BUFFER_TRACE(bh
, "get_write_access");
2521 err
= ext4_journal_get_write_access(handle
, sb
, bh
, EXT4_JTR_NONE
);
2525 err
= add_dirent_to_buf(handle
, fname
, dir
, inode
, NULL
, bh
);
2530 /* Block full, should compress but for now just split */
2531 dxtrace(printk(KERN_DEBUG
"using %u of %u node entries\n",
2532 dx_get_count(entries
), dx_get_limit(entries
)));
2533 /* Need to split index? */
2534 if (dx_get_count(entries
) == dx_get_limit(entries
)) {
2535 ext4_lblk_t newblock
;
2536 int levels
= frame
- frames
+ 1;
2537 unsigned int icount
;
2539 struct dx_entry
*entries2
;
2540 struct dx_node
*node2
;
2541 struct buffer_head
*bh2
;
2543 while (frame
> frames
) {
2544 if (dx_get_count((frame
- 1)->entries
) <
2545 dx_get_limit((frame
- 1)->entries
)) {
2549 frame
--; /* split higher index block */
2551 entries
= frame
->entries
;
2554 if (add_level
&& levels
== ext4_dir_htree_level(sb
)) {
2555 ext4_warning(sb
, "Directory (ino: %lu) index full, "
2556 "reach max htree level :%d",
2557 dir
->i_ino
, levels
);
2558 if (ext4_dir_htree_level(sb
) < EXT4_HTREE_LEVEL
) {
2559 ext4_warning(sb
, "Large directory feature is "
2560 "not enabled on this "
2566 icount
= dx_get_count(entries
);
2567 bh2
= ext4_append(handle
, dir
, &newblock
);
2572 node2
= (struct dx_node
*)(bh2
->b_data
);
2573 entries2
= node2
->entries
;
2574 memset(&node2
->fake
, 0, sizeof(struct fake_dirent
));
2575 node2
->fake
.rec_len
= ext4_rec_len_to_disk(sb
->s_blocksize
,
2577 BUFFER_TRACE(frame
->bh
, "get_write_access");
2578 err
= ext4_journal_get_write_access(handle
, sb
, frame
->bh
,
2583 unsigned icount1
= icount
/2, icount2
= icount
- icount1
;
2584 unsigned hash2
= dx_get_hash(entries
+ icount1
);
2585 dxtrace(printk(KERN_DEBUG
"Split index %i/%i\n",
2588 BUFFER_TRACE(frame
->bh
, "get_write_access"); /* index root */
2589 err
= ext4_journal_get_write_access(handle
, sb
,
2595 memcpy((char *) entries2
, (char *) (entries
+ icount1
),
2596 icount2
* sizeof(struct dx_entry
));
2597 dx_set_count(entries
, icount1
);
2598 dx_set_count(entries2
, icount2
);
2599 dx_set_limit(entries2
, dx_node_limit(dir
));
2601 /* Which index block gets the new entry? */
2602 if (at
- entries
>= icount1
) {
2603 frame
->at
= at
- entries
- icount1
+ entries2
;
2604 frame
->entries
= entries
= entries2
;
2605 swap(frame
->bh
, bh2
);
2607 dx_insert_block((frame
- 1), hash2
, newblock
);
2608 dxtrace(dx_show_index("node", frame
->entries
));
2609 dxtrace(dx_show_index("node",
2610 ((struct dx_node
*) bh2
->b_data
)->entries
));
2611 err
= ext4_handle_dirty_dx_node(handle
, dir
, bh2
);
2615 err
= ext4_handle_dirty_dx_node(handle
, dir
,
2619 err
= ext4_handle_dirty_dx_node(handle
, dir
,
2624 struct dx_root
*dxroot
;
2625 memcpy((char *) entries2
, (char *) entries
,
2626 icount
* sizeof(struct dx_entry
));
2627 dx_set_limit(entries2
, dx_node_limit(dir
));
2630 dx_set_count(entries
, 1);
2631 dx_set_block(entries
+ 0, newblock
);
2632 dxroot
= (struct dx_root
*)frames
[0].bh
->b_data
;
2633 dxroot
->info
.indirect_levels
+= 1;
2634 dxtrace(printk(KERN_DEBUG
2635 "Creating %d level index...\n",
2636 dxroot
->info
.indirect_levels
));
2637 err
= ext4_handle_dirty_dx_node(handle
, dir
, frame
->bh
);
2640 err
= ext4_handle_dirty_dx_node(handle
, dir
, bh2
);
2646 de
= do_split(handle
, dir
, &bh
, frame
, &fname
->hinfo
);
2651 err
= add_dirent_to_buf(handle
, fname
, dir
, inode
, de
, bh
);
2655 ext4_std_error(dir
->i_sb
, err
); /* this is a no-op if err == 0 */
2659 /* @restart is true means htree-path has been changed, we need to
2660 * repeat dx_probe() to find out valid htree-path
2662 if (restart
&& err
== 0)
2668 * ext4_generic_delete_entry deletes a directory entry by merging it
2669 * with the previous entry
2671 int ext4_generic_delete_entry(struct inode
*dir
,
2672 struct ext4_dir_entry_2
*de_del
,
2673 struct buffer_head
*bh
,
2678 struct ext4_dir_entry_2
*de
, *pde
;
2679 unsigned int blocksize
= dir
->i_sb
->s_blocksize
;
2685 while (i
< buf_size
- csum_size
) {
2686 if (ext4_check_dir_entry(dir
, NULL
, de
, bh
,
2687 entry_buf
, buf_size
, i
))
2688 return -EFSCORRUPTED
;
2691 pde
->rec_len
= ext4_rec_len_to_disk(
2692 ext4_rec_len_from_disk(pde
->rec_len
,
2694 ext4_rec_len_from_disk(de
->rec_len
,
2698 /* wipe entire dir_entry */
2699 memset(de
, 0, ext4_rec_len_from_disk(de
->rec_len
,
2702 /* wipe dir_entry excluding the rec_len field */
2704 memset(&de
->name_len
, 0,
2705 ext4_rec_len_from_disk(de
->rec_len
,
2707 offsetof(struct ext4_dir_entry_2
,
2711 inode_inc_iversion(dir
);
2714 i
+= ext4_rec_len_from_disk(de
->rec_len
, blocksize
);
2716 de
= ext4_next_entry(de
, blocksize
);
2721 static int ext4_delete_entry(handle_t
*handle
,
2723 struct ext4_dir_entry_2
*de_del
,
2724 struct buffer_head
*bh
)
2726 int err
, csum_size
= 0;
2728 if (ext4_has_inline_data(dir
)) {
2729 int has_inline_data
= 1;
2730 err
= ext4_delete_inline_entry(handle
, dir
, de_del
, bh
,
2732 if (has_inline_data
)
2736 if (ext4_has_metadata_csum(dir
->i_sb
))
2737 csum_size
= sizeof(struct ext4_dir_entry_tail
);
2739 BUFFER_TRACE(bh
, "get_write_access");
2740 err
= ext4_journal_get_write_access(handle
, dir
->i_sb
, bh
,
2745 err
= ext4_generic_delete_entry(dir
, de_del
, bh
, bh
->b_data
,
2746 dir
->i_sb
->s_blocksize
, csum_size
);
2750 BUFFER_TRACE(bh
, "call ext4_handle_dirty_metadata");
2751 err
= ext4_handle_dirty_dirblock(handle
, dir
, bh
);
2758 ext4_std_error(dir
->i_sb
, err
);
2763 * Set directory link count to 1 if nlinks > EXT4_LINK_MAX, or if nlinks == 2
2764 * since this indicates that nlinks count was previously 1 to avoid overflowing
2765 * the 16-bit i_links_count field on disk. Directories with i_nlink == 1 mean
2766 * that subdirectory link counts are not being maintained accurately.
2768 * The caller has already checked for i_nlink overflow in case the DIR_LINK
2769 * feature is not enabled and returned -EMLINK. The is_dx() check is a proxy
2770 * for checking S_ISDIR(inode) (since the INODE_INDEX feature will not be set
2771 * on regular files) and to avoid creating huge/slow non-HTREE directories.
2773 static void ext4_inc_count(struct inode
*inode
)
2777 (inode
->i_nlink
> EXT4_LINK_MAX
|| inode
->i_nlink
== 2))
2778 set_nlink(inode
, 1);
2782 * If a directory had nlink == 1, then we should let it be 1. This indicates
2783 * directory has >EXT4_LINK_MAX subdirs.
2785 static void ext4_dec_count(struct inode
*inode
)
2787 if (!S_ISDIR(inode
->i_mode
) || inode
->i_nlink
> 2)
2793 * Add non-directory inode to a directory. On success, the inode reference is
2794 * consumed by dentry is instantiation. This is also indicated by clearing of
2795 * *inodep pointer. On failure, the caller is responsible for dropping the
2796 * inode reference in the safe context.
2798 static int ext4_add_nondir(handle_t
*handle
,
2799 struct dentry
*dentry
, struct inode
**inodep
)
2801 struct inode
*dir
= d_inode(dentry
->d_parent
);
2802 struct inode
*inode
= *inodep
;
2803 int err
= ext4_add_entry(handle
, dentry
, inode
);
2805 err
= ext4_mark_inode_dirty(handle
, inode
);
2806 if (IS_DIRSYNC(dir
))
2807 ext4_handle_sync(handle
);
2808 d_instantiate_new(dentry
, inode
);
2813 ext4_mark_inode_dirty(handle
, inode
);
2814 ext4_orphan_add(handle
, inode
);
2815 unlock_new_inode(inode
);
2820 * By the time this is called, we already have created
2821 * the directory cache entry for the new file, but it
2822 * is so far negative - it has no inode.
2824 * If the create succeeds, we fill in the inode information
2825 * with d_instantiate().
2827 static int ext4_create(struct mnt_idmap
*idmap
, struct inode
*dir
,
2828 struct dentry
*dentry
, umode_t mode
, bool excl
)
2831 struct inode
*inode
;
2832 int err
, credits
, retries
= 0;
2834 err
= dquot_initialize(dir
);
2838 credits
= (EXT4_DATA_TRANS_BLOCKS(dir
->i_sb
) +
2839 EXT4_INDEX_EXTRA_TRANS_BLOCKS
+ 3);
2841 inode
= ext4_new_inode_start_handle(idmap
, dir
, mode
, &dentry
->d_name
,
2842 0, NULL
, EXT4_HT_DIR
, credits
);
2843 handle
= ext4_journal_current_handle();
2844 err
= PTR_ERR(inode
);
2845 if (!IS_ERR(inode
)) {
2846 inode
->i_op
= &ext4_file_inode_operations
;
2847 inode
->i_fop
= &ext4_file_operations
;
2848 ext4_set_aops(inode
);
2849 err
= ext4_add_nondir(handle
, dentry
, &inode
);
2851 ext4_fc_track_create(handle
, dentry
);
2854 ext4_journal_stop(handle
);
2855 if (!IS_ERR_OR_NULL(inode
))
2857 if (err
== -ENOSPC
&& ext4_should_retry_alloc(dir
->i_sb
, &retries
))
2862 static int ext4_mknod(struct mnt_idmap
*idmap
, struct inode
*dir
,
2863 struct dentry
*dentry
, umode_t mode
, dev_t rdev
)
2866 struct inode
*inode
;
2867 int err
, credits
, retries
= 0;
2869 err
= dquot_initialize(dir
);
2873 credits
= (EXT4_DATA_TRANS_BLOCKS(dir
->i_sb
) +
2874 EXT4_INDEX_EXTRA_TRANS_BLOCKS
+ 3);
2876 inode
= ext4_new_inode_start_handle(idmap
, dir
, mode
, &dentry
->d_name
,
2877 0, NULL
, EXT4_HT_DIR
, credits
);
2878 handle
= ext4_journal_current_handle();
2879 err
= PTR_ERR(inode
);
2880 if (!IS_ERR(inode
)) {
2881 init_special_inode(inode
, inode
->i_mode
, rdev
);
2882 inode
->i_op
= &ext4_special_inode_operations
;
2883 err
= ext4_add_nondir(handle
, dentry
, &inode
);
2885 ext4_fc_track_create(handle
, dentry
);
2888 ext4_journal_stop(handle
);
2889 if (!IS_ERR_OR_NULL(inode
))
2891 if (err
== -ENOSPC
&& ext4_should_retry_alloc(dir
->i_sb
, &retries
))
2896 static int ext4_tmpfile(struct mnt_idmap
*idmap
, struct inode
*dir
,
2897 struct file
*file
, umode_t mode
)
2900 struct inode
*inode
;
2901 int err
, retries
= 0;
2903 err
= dquot_initialize(dir
);
2908 inode
= ext4_new_inode_start_handle(idmap
, dir
, mode
,
2911 EXT4_MAXQUOTAS_TRANS_BLOCKS(dir
->i_sb
) +
2912 4 + EXT4_XATTR_TRANS_BLOCKS
);
2913 handle
= ext4_journal_current_handle();
2914 err
= PTR_ERR(inode
);
2915 if (!IS_ERR(inode
)) {
2916 inode
->i_op
= &ext4_file_inode_operations
;
2917 inode
->i_fop
= &ext4_file_operations
;
2918 ext4_set_aops(inode
);
2919 d_tmpfile(file
, inode
);
2920 err
= ext4_orphan_add(handle
, inode
);
2922 goto err_unlock_inode
;
2923 mark_inode_dirty(inode
);
2924 unlock_new_inode(inode
);
2927 ext4_journal_stop(handle
);
2928 if (err
== -ENOSPC
&& ext4_should_retry_alloc(dir
->i_sb
, &retries
))
2930 return finish_open_simple(file
, err
);
2932 ext4_journal_stop(handle
);
2933 unlock_new_inode(inode
);
2937 struct ext4_dir_entry_2
*ext4_init_dot_dotdot(struct inode
*inode
,
2938 struct ext4_dir_entry_2
*de
,
2939 int blocksize
, int csum_size
,
2940 unsigned int parent_ino
, int dotdot_real_len
)
2942 de
->inode
= cpu_to_le32(inode
->i_ino
);
2944 de
->rec_len
= ext4_rec_len_to_disk(ext4_dir_rec_len(de
->name_len
, NULL
),
2946 strcpy(de
->name
, ".");
2947 ext4_set_de_type(inode
->i_sb
, de
, S_IFDIR
);
2949 de
= ext4_next_entry(de
, blocksize
);
2950 de
->inode
= cpu_to_le32(parent_ino
);
2952 if (!dotdot_real_len
)
2953 de
->rec_len
= ext4_rec_len_to_disk(blocksize
-
2954 (csum_size
+ ext4_dir_rec_len(1, NULL
)),
2957 de
->rec_len
= ext4_rec_len_to_disk(
2958 ext4_dir_rec_len(de
->name_len
, NULL
),
2960 strcpy(de
->name
, "..");
2961 ext4_set_de_type(inode
->i_sb
, de
, S_IFDIR
);
2963 return ext4_next_entry(de
, blocksize
);
2966 int ext4_init_new_dir(handle_t
*handle
, struct inode
*dir
,
2967 struct inode
*inode
)
2969 struct buffer_head
*dir_block
= NULL
;
2970 struct ext4_dir_entry_2
*de
;
2971 ext4_lblk_t block
= 0;
2972 unsigned int blocksize
= dir
->i_sb
->s_blocksize
;
2976 if (ext4_has_metadata_csum(dir
->i_sb
))
2977 csum_size
= sizeof(struct ext4_dir_entry_tail
);
2979 if (ext4_test_inode_state(inode
, EXT4_STATE_MAY_INLINE_DATA
)) {
2980 err
= ext4_try_create_inline_dir(handle
, dir
, inode
);
2981 if (err
< 0 && err
!= -ENOSPC
)
2988 dir_block
= ext4_append(handle
, inode
, &block
);
2989 if (IS_ERR(dir_block
))
2990 return PTR_ERR(dir_block
);
2991 de
= (struct ext4_dir_entry_2
*)dir_block
->b_data
;
2992 ext4_init_dot_dotdot(inode
, de
, blocksize
, csum_size
, dir
->i_ino
, 0);
2993 set_nlink(inode
, 2);
2995 ext4_initialize_dirent_tail(dir_block
, blocksize
);
2997 BUFFER_TRACE(dir_block
, "call ext4_handle_dirty_metadata");
2998 err
= ext4_handle_dirty_dirblock(handle
, inode
, dir_block
);
3001 set_buffer_verified(dir_block
);
3007 static int ext4_mkdir(struct mnt_idmap
*idmap
, struct inode
*dir
,
3008 struct dentry
*dentry
, umode_t mode
)
3011 struct inode
*inode
;
3012 int err
, err2
= 0, credits
, retries
= 0;
3014 if (EXT4_DIR_LINK_MAX(dir
))
3017 err
= dquot_initialize(dir
);
3021 credits
= (EXT4_DATA_TRANS_BLOCKS(dir
->i_sb
) +
3022 EXT4_INDEX_EXTRA_TRANS_BLOCKS
+ 3);
3024 inode
= ext4_new_inode_start_handle(idmap
, dir
, S_IFDIR
| mode
,
3026 0, NULL
, EXT4_HT_DIR
, credits
);
3027 handle
= ext4_journal_current_handle();
3028 err
= PTR_ERR(inode
);
3032 inode
->i_op
= &ext4_dir_inode_operations
;
3033 inode
->i_fop
= &ext4_dir_operations
;
3034 err
= ext4_init_new_dir(handle
, dir
, inode
);
3036 goto out_clear_inode
;
3037 err
= ext4_mark_inode_dirty(handle
, inode
);
3039 err
= ext4_add_entry(handle
, dentry
, inode
);
3043 ext4_orphan_add(handle
, inode
);
3044 unlock_new_inode(inode
);
3045 err2
= ext4_mark_inode_dirty(handle
, inode
);
3048 ext4_journal_stop(handle
);
3052 ext4_inc_count(dir
);
3054 ext4_update_dx_flag(dir
);
3055 err
= ext4_mark_inode_dirty(handle
, dir
);
3057 goto out_clear_inode
;
3058 d_instantiate_new(dentry
, inode
);
3059 ext4_fc_track_create(handle
, dentry
);
3060 if (IS_DIRSYNC(dir
))
3061 ext4_handle_sync(handle
);
3065 ext4_journal_stop(handle
);
3067 if (err
== -ENOSPC
&& ext4_should_retry_alloc(dir
->i_sb
, &retries
))
3073 * routine to check that the specified directory is empty (for rmdir)
3075 bool ext4_empty_dir(struct inode
*inode
)
3077 unsigned int offset
;
3078 struct buffer_head
*bh
;
3079 struct ext4_dir_entry_2
*de
;
3080 struct super_block
*sb
;
3082 if (ext4_has_inline_data(inode
)) {
3083 int has_inline_data
= 1;
3086 ret
= empty_inline_dir(inode
, &has_inline_data
);
3087 if (has_inline_data
)
3092 if (inode
->i_size
< ext4_dir_rec_len(1, NULL
) +
3093 ext4_dir_rec_len(2, NULL
)) {
3094 EXT4_ERROR_INODE(inode
, "invalid size");
3097 bh
= ext4_read_dirblock(inode
, 0, EITHER
);
3101 de
= (struct ext4_dir_entry_2
*) bh
->b_data
;
3102 if (ext4_check_dir_entry(inode
, NULL
, de
, bh
, bh
->b_data
, bh
->b_size
,
3104 le32_to_cpu(de
->inode
) != inode
->i_ino
|| strcmp(".", de
->name
)) {
3105 ext4_warning_inode(inode
, "directory missing '.'");
3109 offset
= ext4_rec_len_from_disk(de
->rec_len
, sb
->s_blocksize
);
3110 de
= ext4_next_entry(de
, sb
->s_blocksize
);
3111 if (ext4_check_dir_entry(inode
, NULL
, de
, bh
, bh
->b_data
, bh
->b_size
,
3113 le32_to_cpu(de
->inode
) == 0 || strcmp("..", de
->name
)) {
3114 ext4_warning_inode(inode
, "directory missing '..'");
3118 offset
+= ext4_rec_len_from_disk(de
->rec_len
, sb
->s_blocksize
);
3119 while (offset
< inode
->i_size
) {
3120 if (!(offset
& (sb
->s_blocksize
- 1))) {
3121 unsigned int lblock
;
3123 lblock
= offset
>> EXT4_BLOCK_SIZE_BITS(sb
);
3124 bh
= ext4_read_dirblock(inode
, lblock
, EITHER
);
3126 offset
+= sb
->s_blocksize
;
3132 de
= (struct ext4_dir_entry_2
*) (bh
->b_data
+
3133 (offset
& (sb
->s_blocksize
- 1)));
3134 if (ext4_check_dir_entry(inode
, NULL
, de
, bh
,
3135 bh
->b_data
, bh
->b_size
, offset
) ||
3136 le32_to_cpu(de
->inode
)) {
3140 offset
+= ext4_rec_len_from_disk(de
->rec_len
, sb
->s_blocksize
);
3146 static int ext4_rmdir(struct inode
*dir
, struct dentry
*dentry
)
3149 struct inode
*inode
;
3150 struct buffer_head
*bh
;
3151 struct ext4_dir_entry_2
*de
;
3152 handle_t
*handle
= NULL
;
3154 if (unlikely(ext4_forced_shutdown(dir
->i_sb
)))
3157 /* Initialize quotas before so that eventual writes go in
3158 * separate transaction */
3159 retval
= dquot_initialize(dir
);
3162 retval
= dquot_initialize(d_inode(dentry
));
3167 bh
= ext4_find_entry(dir
, &dentry
->d_name
, &de
, NULL
);
3173 inode
= d_inode(dentry
);
3175 retval
= -EFSCORRUPTED
;
3176 if (le32_to_cpu(de
->inode
) != inode
->i_ino
)
3179 retval
= -ENOTEMPTY
;
3180 if (!ext4_empty_dir(inode
))
3183 handle
= ext4_journal_start(dir
, EXT4_HT_DIR
,
3184 EXT4_DATA_TRANS_BLOCKS(dir
->i_sb
));
3185 if (IS_ERR(handle
)) {
3186 retval
= PTR_ERR(handle
);
3191 if (IS_DIRSYNC(dir
))
3192 ext4_handle_sync(handle
);
3194 retval
= ext4_delete_entry(handle
, dir
, de
, bh
);
3197 if (!EXT4_DIR_LINK_EMPTY(inode
))
3198 ext4_warning_inode(inode
,
3199 "empty directory '%.*s' has too many links (%u)",
3200 dentry
->d_name
.len
, dentry
->d_name
.name
,
3202 inode_inc_iversion(inode
);
3204 /* There's no need to set i_disksize: the fact that i_nlink is
3205 * zero will ensure that the right thing happens during any
3208 ext4_orphan_add(handle
, inode
);
3209 inode_set_mtime_to_ts(dir
, inode_set_ctime_current(dir
));
3210 inode_set_ctime_current(inode
);
3211 retval
= ext4_mark_inode_dirty(handle
, inode
);
3214 ext4_dec_count(dir
);
3215 ext4_update_dx_flag(dir
);
3216 ext4_fc_track_unlink(handle
, dentry
);
3217 retval
= ext4_mark_inode_dirty(handle
, dir
);
3219 /* VFS negative dentries are incompatible with Encoding and
3220 * Case-insensitiveness. Eventually we'll want avoid
3221 * invalidating the dentries here, alongside with returning the
3222 * negative dentries at ext4_lookup(), when it is better
3223 * supported by the VFS for the CI case.
3225 if (IS_ENABLED(CONFIG_UNICODE
) && IS_CASEFOLDED(dir
))
3226 d_invalidate(dentry
);
3231 ext4_journal_stop(handle
);
3235 int __ext4_unlink(struct inode
*dir
, const struct qstr
*d_name
,
3236 struct inode
*inode
,
3237 struct dentry
*dentry
/* NULL during fast_commit recovery */)
3239 int retval
= -ENOENT
;
3240 struct buffer_head
*bh
;
3241 struct ext4_dir_entry_2
*de
;
3243 int skip_remove_dentry
= 0;
3246 * Keep this outside the transaction; it may have to set up the
3247 * directory's encryption key, which isn't GFP_NOFS-safe.
3249 bh
= ext4_find_entry(dir
, d_name
, &de
, NULL
);
3256 if (le32_to_cpu(de
->inode
) != inode
->i_ino
) {
3258 * It's okay if we find dont find dentry which matches
3259 * the inode. That's because it might have gotten
3260 * renamed to a different inode number
3262 if (EXT4_SB(inode
->i_sb
)->s_mount_state
& EXT4_FC_REPLAY
)
3263 skip_remove_dentry
= 1;
3268 handle
= ext4_journal_start(dir
, EXT4_HT_DIR
,
3269 EXT4_DATA_TRANS_BLOCKS(dir
->i_sb
));
3270 if (IS_ERR(handle
)) {
3271 retval
= PTR_ERR(handle
);
3275 if (IS_DIRSYNC(dir
))
3276 ext4_handle_sync(handle
);
3278 if (!skip_remove_dentry
) {
3279 retval
= ext4_delete_entry(handle
, dir
, de
, bh
);
3282 inode_set_mtime_to_ts(dir
, inode_set_ctime_current(dir
));
3283 ext4_update_dx_flag(dir
);
3284 retval
= ext4_mark_inode_dirty(handle
, dir
);
3290 if (inode
->i_nlink
== 0)
3291 ext4_warning_inode(inode
, "Deleting file '%.*s' with no links",
3292 d_name
->len
, d_name
->name
);
3295 if (!inode
->i_nlink
)
3296 ext4_orphan_add(handle
, inode
);
3297 inode_set_ctime_current(inode
);
3298 retval
= ext4_mark_inode_dirty(handle
, inode
);
3299 if (dentry
&& !retval
)
3300 ext4_fc_track_unlink(handle
, dentry
);
3302 ext4_journal_stop(handle
);
3308 static int ext4_unlink(struct inode
*dir
, struct dentry
*dentry
)
3312 if (unlikely(ext4_forced_shutdown(dir
->i_sb
)))
3315 trace_ext4_unlink_enter(dir
, dentry
);
3317 * Initialize quotas before so that eventual writes go
3318 * in separate transaction
3320 retval
= dquot_initialize(dir
);
3323 retval
= dquot_initialize(d_inode(dentry
));
3327 retval
= __ext4_unlink(dir
, &dentry
->d_name
, d_inode(dentry
), dentry
);
3329 /* VFS negative dentries are incompatible with Encoding and
3330 * Case-insensitiveness. Eventually we'll want avoid
3331 * invalidating the dentries here, alongside with returning the
3332 * negative dentries at ext4_lookup(), when it is better
3333 * supported by the VFS for the CI case.
3335 if (IS_ENABLED(CONFIG_UNICODE
) && IS_CASEFOLDED(dir
))
3336 d_invalidate(dentry
);
3339 trace_ext4_unlink_exit(dentry
, retval
);
3343 static int ext4_init_symlink_block(handle_t
*handle
, struct inode
*inode
,
3344 struct fscrypt_str
*disk_link
)
3346 struct buffer_head
*bh
;
3350 bh
= ext4_bread(handle
, inode
, 0, EXT4_GET_BLOCKS_CREATE
);
3354 BUFFER_TRACE(bh
, "get_write_access");
3355 err
= ext4_journal_get_write_access(handle
, inode
->i_sb
, bh
, EXT4_JTR_NONE
);
3359 kaddr
= (char *)bh
->b_data
;
3360 memcpy(kaddr
, disk_link
->name
, disk_link
->len
);
3361 inode
->i_size
= disk_link
->len
- 1;
3362 EXT4_I(inode
)->i_disksize
= inode
->i_size
;
3363 err
= ext4_handle_dirty_metadata(handle
, inode
, bh
);
3369 static int ext4_symlink(struct mnt_idmap
*idmap
, struct inode
*dir
,
3370 struct dentry
*dentry
, const char *symname
)
3373 struct inode
*inode
;
3374 int err
, len
= strlen(symname
);
3376 struct fscrypt_str disk_link
;
3379 if (unlikely(ext4_forced_shutdown(dir
->i_sb
)))
3382 err
= fscrypt_prepare_symlink(dir
, symname
, len
, dir
->i_sb
->s_blocksize
,
3387 err
= dquot_initialize(dir
);
3392 * EXT4_INDEX_EXTRA_TRANS_BLOCKS for addition of entry into the
3393 * directory. +3 for inode, inode bitmap, group descriptor allocation.
3394 * EXT4_DATA_TRANS_BLOCKS for the data block allocation and
3397 credits
= EXT4_DATA_TRANS_BLOCKS(dir
->i_sb
) +
3398 EXT4_INDEX_EXTRA_TRANS_BLOCKS
+ 3;
3400 inode
= ext4_new_inode_start_handle(idmap
, dir
, S_IFLNK
|S_IRWXUGO
,
3401 &dentry
->d_name
, 0, NULL
,
3402 EXT4_HT_DIR
, credits
);
3403 handle
= ext4_journal_current_handle();
3404 if (IS_ERR(inode
)) {
3406 ext4_journal_stop(handle
);
3407 err
= PTR_ERR(inode
);
3411 if (IS_ENCRYPTED(inode
)) {
3412 err
= fscrypt_encrypt_symlink(inode
, symname
, len
, &disk_link
);
3414 goto err_drop_inode
;
3415 inode
->i_op
= &ext4_encrypted_symlink_inode_operations
;
3417 if ((disk_link
.len
> EXT4_N_BLOCKS
* 4)) {
3418 inode
->i_op
= &ext4_symlink_inode_operations
;
3420 inode
->i_op
= &ext4_fast_symlink_inode_operations
;
3421 inode
->i_link
= (char *)&EXT4_I(inode
)->i_data
;
3425 if ((disk_link
.len
> EXT4_N_BLOCKS
* 4)) {
3426 /* alloc symlink block and fill it */
3427 err
= ext4_init_symlink_block(handle
, inode
, &disk_link
);
3429 goto err_drop_inode
;
3431 /* clear the extent format for fast symlink */
3432 ext4_clear_inode_flag(inode
, EXT4_INODE_EXTENTS
);
3433 memcpy((char *)&EXT4_I(inode
)->i_data
, disk_link
.name
,
3435 inode
->i_size
= disk_link
.len
- 1;
3436 EXT4_I(inode
)->i_disksize
= inode
->i_size
;
3438 err
= ext4_add_nondir(handle
, dentry
, &inode
);
3440 ext4_journal_stop(handle
);
3446 ext4_mark_inode_dirty(handle
, inode
);
3447 ext4_orphan_add(handle
, inode
);
3448 unlock_new_inode(inode
);
3450 ext4_journal_stop(handle
);
3453 if (err
== -ENOSPC
&& ext4_should_retry_alloc(dir
->i_sb
, &retries
))
3455 if (disk_link
.name
!= (unsigned char *)symname
)
3456 kfree(disk_link
.name
);
3460 int __ext4_link(struct inode
*dir
, struct inode
*inode
, struct dentry
*dentry
)
3463 int err
, retries
= 0;
3465 handle
= ext4_journal_start(dir
, EXT4_HT_DIR
,
3466 (EXT4_DATA_TRANS_BLOCKS(dir
->i_sb
) +
3467 EXT4_INDEX_EXTRA_TRANS_BLOCKS
) + 1);
3469 return PTR_ERR(handle
);
3471 if (IS_DIRSYNC(dir
))
3472 ext4_handle_sync(handle
);
3474 inode_set_ctime_current(inode
);
3475 ext4_inc_count(inode
);
3478 err
= ext4_add_entry(handle
, dentry
, inode
);
3480 err
= ext4_mark_inode_dirty(handle
, inode
);
3481 /* this can happen only for tmpfile being
3482 * linked the first time
3484 if (inode
->i_nlink
== 1)
3485 ext4_orphan_del(handle
, inode
);
3486 d_instantiate(dentry
, inode
);
3487 ext4_fc_track_link(handle
, dentry
);
3492 ext4_journal_stop(handle
);
3493 if (err
== -ENOSPC
&& ext4_should_retry_alloc(dir
->i_sb
, &retries
))
3498 static int ext4_link(struct dentry
*old_dentry
,
3499 struct inode
*dir
, struct dentry
*dentry
)
3501 struct inode
*inode
= d_inode(old_dentry
);
3504 if (inode
->i_nlink
>= EXT4_LINK_MAX
)
3507 err
= fscrypt_prepare_link(old_dentry
, dir
, dentry
);
3511 if ((ext4_test_inode_flag(dir
, EXT4_INODE_PROJINHERIT
)) &&
3512 (!projid_eq(EXT4_I(dir
)->i_projid
,
3513 EXT4_I(old_dentry
->d_inode
)->i_projid
)))
3516 err
= dquot_initialize(dir
);
3519 return __ext4_link(dir
, inode
, dentry
);
3523 * Try to find buffer head where contains the parent block.
3524 * It should be the inode block if it is inlined or the 1st block
3525 * if it is a normal dir.
3527 static struct buffer_head
*ext4_get_first_dir_block(handle_t
*handle
,
3528 struct inode
*inode
,
3530 struct ext4_dir_entry_2
**parent_de
,
3533 struct buffer_head
*bh
;
3535 if (!ext4_has_inline_data(inode
)) {
3536 struct ext4_dir_entry_2
*de
;
3537 unsigned int offset
;
3539 bh
= ext4_read_dirblock(inode
, 0, EITHER
);
3541 *retval
= PTR_ERR(bh
);
3545 de
= (struct ext4_dir_entry_2
*) bh
->b_data
;
3546 if (ext4_check_dir_entry(inode
, NULL
, de
, bh
, bh
->b_data
,
3548 le32_to_cpu(de
->inode
) != inode
->i_ino
||
3549 strcmp(".", de
->name
)) {
3550 EXT4_ERROR_INODE(inode
, "directory missing '.'");
3552 *retval
= -EFSCORRUPTED
;
3555 offset
= ext4_rec_len_from_disk(de
->rec_len
,
3556 inode
->i_sb
->s_blocksize
);
3557 de
= ext4_next_entry(de
, inode
->i_sb
->s_blocksize
);
3558 if (ext4_check_dir_entry(inode
, NULL
, de
, bh
, bh
->b_data
,
3559 bh
->b_size
, offset
) ||
3560 le32_to_cpu(de
->inode
) == 0 || strcmp("..", de
->name
)) {
3561 EXT4_ERROR_INODE(inode
, "directory missing '..'");
3563 *retval
= -EFSCORRUPTED
;
3572 return ext4_get_first_inline_block(inode
, parent_de
, retval
);
3575 struct ext4_renament
{
3577 struct dentry
*dentry
;
3578 struct inode
*inode
;
3580 int dir_nlink_delta
;
3582 /* entry for "dentry" */
3583 struct buffer_head
*bh
;
3584 struct ext4_dir_entry_2
*de
;
3587 /* entry for ".." in inode if it's a directory */
3588 struct buffer_head
*dir_bh
;
3589 struct ext4_dir_entry_2
*parent_de
;
3593 static int ext4_rename_dir_prepare(handle_t
*handle
, struct ext4_renament
*ent
, bool is_cross
)
3601 ent
->dir_bh
= ext4_get_first_dir_block(handle
, ent
->inode
,
3602 &retval
, &ent
->parent_de
,
3606 if (le32_to_cpu(ent
->parent_de
->inode
) != ent
->dir
->i_ino
)
3607 return -EFSCORRUPTED
;
3608 BUFFER_TRACE(ent
->dir_bh
, "get_write_access");
3609 return ext4_journal_get_write_access(handle
, ent
->dir
->i_sb
,
3610 ent
->dir_bh
, EXT4_JTR_NONE
);
3613 static int ext4_rename_dir_finish(handle_t
*handle
, struct ext4_renament
*ent
,
3621 ent
->parent_de
->inode
= cpu_to_le32(dir_ino
);
3622 BUFFER_TRACE(ent
->dir_bh
, "call ext4_handle_dirty_metadata");
3623 if (!ent
->dir_inlined
) {
3624 if (is_dx(ent
->inode
)) {
3625 retval
= ext4_handle_dirty_dx_node(handle
,
3629 retval
= ext4_handle_dirty_dirblock(handle
, ent
->inode
,
3633 retval
= ext4_mark_inode_dirty(handle
, ent
->inode
);
3636 ext4_std_error(ent
->dir
->i_sb
, retval
);
3642 static int ext4_setent(handle_t
*handle
, struct ext4_renament
*ent
,
3643 unsigned ino
, unsigned file_type
)
3645 int retval
, retval2
;
3647 BUFFER_TRACE(ent
->bh
, "get write access");
3648 retval
= ext4_journal_get_write_access(handle
, ent
->dir
->i_sb
, ent
->bh
,
3652 ent
->de
->inode
= cpu_to_le32(ino
);
3653 if (ext4_has_feature_filetype(ent
->dir
->i_sb
))
3654 ent
->de
->file_type
= file_type
;
3655 inode_inc_iversion(ent
->dir
);
3656 inode_set_mtime_to_ts(ent
->dir
, inode_set_ctime_current(ent
->dir
));
3657 retval
= ext4_mark_inode_dirty(handle
, ent
->dir
);
3658 BUFFER_TRACE(ent
->bh
, "call ext4_handle_dirty_metadata");
3659 if (!ent
->inlined
) {
3660 retval2
= ext4_handle_dirty_dirblock(handle
, ent
->dir
, ent
->bh
);
3661 if (unlikely(retval2
)) {
3662 ext4_std_error(ent
->dir
->i_sb
, retval2
);
3669 static void ext4_resetent(handle_t
*handle
, struct ext4_renament
*ent
,
3670 unsigned ino
, unsigned file_type
)
3672 struct ext4_renament old
= *ent
;
3676 * old->de could have moved from under us during make indexed dir,
3677 * so the old->de may no longer valid and need to find it again
3678 * before reset old inode info.
3680 old
.bh
= ext4_find_entry(old
.dir
, &old
.dentry
->d_name
, &old
.de
,
3683 retval
= PTR_ERR(old
.bh
);
3687 ext4_std_error(old
.dir
->i_sb
, retval
);
3691 ext4_setent(handle
, &old
, ino
, file_type
);
3695 static int ext4_find_delete_entry(handle_t
*handle
, struct inode
*dir
,
3696 const struct qstr
*d_name
)
3698 int retval
= -ENOENT
;
3699 struct buffer_head
*bh
;
3700 struct ext4_dir_entry_2
*de
;
3702 bh
= ext4_find_entry(dir
, d_name
, &de
, NULL
);
3706 retval
= ext4_delete_entry(handle
, dir
, de
, bh
);
3712 static void ext4_rename_delete(handle_t
*handle
, struct ext4_renament
*ent
,
3717 * ent->de could have moved from under us during htree split, so make
3718 * sure that we are deleting the right entry. We might also be pointing
3719 * to a stale entry in the unused part of ent->bh so just checking inum
3720 * and the name isn't enough.
3722 if (le32_to_cpu(ent
->de
->inode
) != ent
->inode
->i_ino
||
3723 ent
->de
->name_len
!= ent
->dentry
->d_name
.len
||
3724 strncmp(ent
->de
->name
, ent
->dentry
->d_name
.name
,
3725 ent
->de
->name_len
) ||
3727 retval
= ext4_find_delete_entry(handle
, ent
->dir
,
3728 &ent
->dentry
->d_name
);
3730 retval
= ext4_delete_entry(handle
, ent
->dir
, ent
->de
, ent
->bh
);
3731 if (retval
== -ENOENT
) {
3732 retval
= ext4_find_delete_entry(handle
, ent
->dir
,
3733 &ent
->dentry
->d_name
);
3738 ext4_warning_inode(ent
->dir
,
3739 "Deleting old file: nlink %d, error=%d",
3740 ent
->dir
->i_nlink
, retval
);
3744 static void ext4_update_dir_count(handle_t
*handle
, struct ext4_renament
*ent
)
3746 if (ent
->dir_nlink_delta
) {
3747 if (ent
->dir_nlink_delta
== -1)
3748 ext4_dec_count(ent
->dir
);
3750 ext4_inc_count(ent
->dir
);
3751 ext4_mark_inode_dirty(handle
, ent
->dir
);
3755 static struct inode
*ext4_whiteout_for_rename(struct mnt_idmap
*idmap
,
3756 struct ext4_renament
*ent
,
3757 int credits
, handle_t
**h
)
3764 * for inode block, sb block, group summaries,
3767 credits
+= (EXT4_MAXQUOTAS_TRANS_BLOCKS(ent
->dir
->i_sb
) +
3768 EXT4_XATTR_TRANS_BLOCKS
+ 4);
3770 wh
= ext4_new_inode_start_handle(idmap
, ent
->dir
,
3771 S_IFCHR
| WHITEOUT_MODE
,
3772 &ent
->dentry
->d_name
, 0, NULL
,
3773 EXT4_HT_DIR
, credits
);
3775 handle
= ext4_journal_current_handle();
3778 ext4_journal_stop(handle
);
3779 if (PTR_ERR(wh
) == -ENOSPC
&&
3780 ext4_should_retry_alloc(ent
->dir
->i_sb
, &retries
))
3784 init_special_inode(wh
, wh
->i_mode
, WHITEOUT_DEV
);
3785 wh
->i_op
= &ext4_special_inode_operations
;
3791 * Anybody can rename anything with this: the permission checks are left to the
3792 * higher-level routines.
3794 * n.b. old_{dentry,inode) refers to the source dentry/inode
3795 * while new_{dentry,inode) refers to the destination dentry/inode
3796 * This comes from rename(const char *oldpath, const char *newpath)
3798 static int ext4_rename(struct mnt_idmap
*idmap
, struct inode
*old_dir
,
3799 struct dentry
*old_dentry
, struct inode
*new_dir
,
3800 struct dentry
*new_dentry
, unsigned int flags
)
3802 handle_t
*handle
= NULL
;
3803 struct ext4_renament old
= {
3805 .dentry
= old_dentry
,
3806 .inode
= d_inode(old_dentry
),
3808 struct ext4_renament
new = {
3810 .dentry
= new_dentry
,
3811 .inode
= d_inode(new_dentry
),
3815 struct inode
*whiteout
= NULL
;
3819 if (new.inode
&& new.inode
->i_nlink
== 0) {
3820 EXT4_ERROR_INODE(new.inode
,
3821 "target of rename is already freed");
3822 return -EFSCORRUPTED
;
3825 if ((ext4_test_inode_flag(new_dir
, EXT4_INODE_PROJINHERIT
)) &&
3826 (!projid_eq(EXT4_I(new_dir
)->i_projid
,
3827 EXT4_I(old_dentry
->d_inode
)->i_projid
)))
3830 retval
= dquot_initialize(old
.dir
);
3833 retval
= dquot_initialize(old
.inode
);
3836 retval
= dquot_initialize(new.dir
);
3840 /* Initialize quotas before so that eventual writes go
3841 * in separate transaction */
3843 retval
= dquot_initialize(new.inode
);
3848 old
.bh
= ext4_find_entry(old
.dir
, &old
.dentry
->d_name
, &old
.de
,
3851 return PTR_ERR(old
.bh
);
3854 * Check for inode number is _not_ due to possible IO errors.
3855 * We might rmdir the source, keep it as pwd of some process
3856 * and merrily kill the link to whatever was created under the
3857 * same name. Goodbye sticky bit ;-<
3860 if (!old
.bh
|| le32_to_cpu(old
.de
->inode
) != old
.inode
->i_ino
)
3863 new.bh
= ext4_find_entry(new.dir
, &new.dentry
->d_name
,
3864 &new.de
, &new.inlined
);
3865 if (IS_ERR(new.bh
)) {
3866 retval
= PTR_ERR(new.bh
);
3876 if (new.inode
&& !test_opt(new.dir
->i_sb
, NO_AUTO_DA_ALLOC
))
3877 ext4_alloc_da_blocks(old
.inode
);
3879 credits
= (2 * EXT4_DATA_TRANS_BLOCKS(old
.dir
->i_sb
) +
3880 EXT4_INDEX_EXTRA_TRANS_BLOCKS
+ 2);
3881 if (!(flags
& RENAME_WHITEOUT
)) {
3882 handle
= ext4_journal_start(old
.dir
, EXT4_HT_DIR
, credits
);
3883 if (IS_ERR(handle
)) {
3884 retval
= PTR_ERR(handle
);
3888 whiteout
= ext4_whiteout_for_rename(idmap
, &old
, credits
, &handle
);
3889 if (IS_ERR(whiteout
)) {
3890 retval
= PTR_ERR(whiteout
);
3895 old_file_type
= old
.de
->file_type
;
3896 if (IS_DIRSYNC(old
.dir
) || IS_DIRSYNC(new.dir
))
3897 ext4_handle_sync(handle
);
3899 if (S_ISDIR(old
.inode
->i_mode
)) {
3901 retval
= -ENOTEMPTY
;
3902 if (!ext4_empty_dir(new.inode
))
3906 if (new.dir
!= old
.dir
&& EXT4_DIR_LINK_MAX(new.dir
))
3909 retval
= ext4_rename_dir_prepare(handle
, &old
, new.dir
!= old
.dir
);
3914 * If we're renaming a file within an inline_data dir and adding or
3915 * setting the new dirent causes a conversion from inline_data to
3916 * extents/blockmap, we need to force the dirent delete code to
3917 * re-read the directory, or else we end up trying to delete a dirent
3918 * from what is now the extent tree root (or a block map).
3920 force_reread
= (new.dir
->i_ino
== old
.dir
->i_ino
&&
3921 ext4_test_inode_flag(new.dir
, EXT4_INODE_INLINE_DATA
));
3925 * Do this before adding a new entry, so the old entry is sure
3926 * to be still pointing to the valid old entry.
3928 retval
= ext4_setent(handle
, &old
, whiteout
->i_ino
,
3932 retval
= ext4_mark_inode_dirty(handle
, whiteout
);
3933 if (unlikely(retval
))
3938 retval
= ext4_add_entry(handle
, new.dentry
, old
.inode
);
3942 retval
= ext4_setent(handle
, &new,
3943 old
.inode
->i_ino
, old_file_type
);
3948 force_reread
= !ext4_test_inode_flag(new.dir
,
3949 EXT4_INODE_INLINE_DATA
);
3952 * Like most other Unix systems, set the ctime for inodes on a
3955 inode_set_ctime_current(old
.inode
);
3956 retval
= ext4_mark_inode_dirty(handle
, old
.inode
);
3957 if (unlikely(retval
))
3964 ext4_rename_delete(handle
, &old
, force_reread
);
3968 ext4_dec_count(new.inode
);
3969 inode_set_ctime_current(new.inode
);
3971 inode_set_mtime_to_ts(old
.dir
, inode_set_ctime_current(old
.dir
));
3972 ext4_update_dx_flag(old
.dir
);
3974 retval
= ext4_rename_dir_finish(handle
, &old
, new.dir
->i_ino
);
3978 ext4_dec_count(old
.dir
);
3980 /* checked ext4_empty_dir above, can't have another
3981 * parent, ext4_dec_count() won't work for many-linked
3983 clear_nlink(new.inode
);
3985 ext4_inc_count(new.dir
);
3986 ext4_update_dx_flag(new.dir
);
3987 retval
= ext4_mark_inode_dirty(handle
, new.dir
);
3988 if (unlikely(retval
))
3992 retval
= ext4_mark_inode_dirty(handle
, old
.dir
);
3993 if (unlikely(retval
))
3998 * We disable fast commits here that's because the
3999 * replay code is not yet capable of changing dot dot
4000 * dirents in directories.
4002 ext4_fc_mark_ineligible(old
.inode
->i_sb
,
4003 EXT4_FC_REASON_RENAME_DIR
, handle
);
4005 struct super_block
*sb
= old
.inode
->i_sb
;
4008 ext4_fc_track_unlink(handle
, new.dentry
);
4009 if (test_opt2(sb
, JOURNAL_FAST_COMMIT
) &&
4010 !(EXT4_SB(sb
)->s_mount_state
& EXT4_FC_REPLAY
) &&
4011 !(ext4_test_mount_flag(sb
, EXT4_MF_FC_INELIGIBLE
))) {
4012 __ext4_fc_track_link(handle
, old
.inode
, new.dentry
);
4013 __ext4_fc_track_unlink(handle
, old
.inode
, old
.dentry
);
4015 __ext4_fc_track_create(handle
, whiteout
,
4021 retval
= ext4_mark_inode_dirty(handle
, new.inode
);
4022 if (unlikely(retval
))
4024 if (!new.inode
->i_nlink
)
4025 ext4_orphan_add(handle
, new.inode
);
4032 ext4_resetent(handle
, &old
,
4033 old
.inode
->i_ino
, old_file_type
);
4034 drop_nlink(whiteout
);
4035 ext4_mark_inode_dirty(handle
, whiteout
);
4036 ext4_orphan_add(handle
, whiteout
);
4038 unlock_new_inode(whiteout
);
4039 ext4_journal_stop(handle
);
4042 ext4_journal_stop(handle
);
4052 static int ext4_cross_rename(struct inode
*old_dir
, struct dentry
*old_dentry
,
4053 struct inode
*new_dir
, struct dentry
*new_dentry
)
4055 handle_t
*handle
= NULL
;
4056 struct ext4_renament old
= {
4058 .dentry
= old_dentry
,
4059 .inode
= d_inode(old_dentry
),
4061 struct ext4_renament
new = {
4063 .dentry
= new_dentry
,
4064 .inode
= d_inode(new_dentry
),
4069 if ((ext4_test_inode_flag(new_dir
, EXT4_INODE_PROJINHERIT
) &&
4070 !projid_eq(EXT4_I(new_dir
)->i_projid
,
4071 EXT4_I(old_dentry
->d_inode
)->i_projid
)) ||
4072 (ext4_test_inode_flag(old_dir
, EXT4_INODE_PROJINHERIT
) &&
4073 !projid_eq(EXT4_I(old_dir
)->i_projid
,
4074 EXT4_I(new_dentry
->d_inode
)->i_projid
)))
4077 retval
= dquot_initialize(old
.dir
);
4080 retval
= dquot_initialize(new.dir
);
4084 old
.bh
= ext4_find_entry(old
.dir
, &old
.dentry
->d_name
,
4085 &old
.de
, &old
.inlined
);
4087 return PTR_ERR(old
.bh
);
4089 * Check for inode number is _not_ due to possible IO errors.
4090 * We might rmdir the source, keep it as pwd of some process
4091 * and merrily kill the link to whatever was created under the
4092 * same name. Goodbye sticky bit ;-<
4095 if (!old
.bh
|| le32_to_cpu(old
.de
->inode
) != old
.inode
->i_ino
)
4098 new.bh
= ext4_find_entry(new.dir
, &new.dentry
->d_name
,
4099 &new.de
, &new.inlined
);
4100 if (IS_ERR(new.bh
)) {
4101 retval
= PTR_ERR(new.bh
);
4106 /* RENAME_EXCHANGE case: old *and* new must both exist */
4107 if (!new.bh
|| le32_to_cpu(new.de
->inode
) != new.inode
->i_ino
)
4110 handle
= ext4_journal_start(old
.dir
, EXT4_HT_DIR
,
4111 (2 * EXT4_DATA_TRANS_BLOCKS(old
.dir
->i_sb
) +
4112 2 * EXT4_INDEX_EXTRA_TRANS_BLOCKS
+ 2));
4113 if (IS_ERR(handle
)) {
4114 retval
= PTR_ERR(handle
);
4119 if (IS_DIRSYNC(old
.dir
) || IS_DIRSYNC(new.dir
))
4120 ext4_handle_sync(handle
);
4122 if (S_ISDIR(old
.inode
->i_mode
)) {
4123 retval
= ext4_rename_dir_prepare(handle
, &old
, new.dir
!= old
.dir
);
4127 if (S_ISDIR(new.inode
->i_mode
)) {
4128 retval
= ext4_rename_dir_prepare(handle
, &new, new.dir
!= old
.dir
);
4134 * Other than the special case of overwriting a directory, parents'
4135 * nlink only needs to be modified if this is a cross directory rename.
4137 if (old
.dir
!= new.dir
&& old
.is_dir
!= new.is_dir
) {
4138 old
.dir_nlink_delta
= old
.is_dir
? -1 : 1;
4139 new.dir_nlink_delta
= -old
.dir_nlink_delta
;
4141 if ((old
.dir_nlink_delta
> 0 && EXT4_DIR_LINK_MAX(old
.dir
)) ||
4142 (new.dir_nlink_delta
> 0 && EXT4_DIR_LINK_MAX(new.dir
)))
4146 new_file_type
= new.de
->file_type
;
4147 retval
= ext4_setent(handle
, &new, old
.inode
->i_ino
, old
.de
->file_type
);
4151 retval
= ext4_setent(handle
, &old
, new.inode
->i_ino
, new_file_type
);
4156 * Like most other Unix systems, set the ctime for inodes on a
4159 inode_set_ctime_current(old
.inode
);
4160 inode_set_ctime_current(new.inode
);
4161 retval
= ext4_mark_inode_dirty(handle
, old
.inode
);
4162 if (unlikely(retval
))
4164 retval
= ext4_mark_inode_dirty(handle
, new.inode
);
4165 if (unlikely(retval
))
4167 ext4_fc_mark_ineligible(new.inode
->i_sb
,
4168 EXT4_FC_REASON_CROSS_RENAME
, handle
);
4170 retval
= ext4_rename_dir_finish(handle
, &old
, new.dir
->i_ino
);
4175 retval
= ext4_rename_dir_finish(handle
, &new, old
.dir
->i_ino
);
4179 ext4_update_dir_count(handle
, &old
);
4180 ext4_update_dir_count(handle
, &new);
4189 ext4_journal_stop(handle
);
4193 static int ext4_rename2(struct mnt_idmap
*idmap
,
4194 struct inode
*old_dir
, struct dentry
*old_dentry
,
4195 struct inode
*new_dir
, struct dentry
*new_dentry
,
4200 if (unlikely(ext4_forced_shutdown(old_dir
->i_sb
)))
4203 if (flags
& ~(RENAME_NOREPLACE
| RENAME_EXCHANGE
| RENAME_WHITEOUT
))
4206 err
= fscrypt_prepare_rename(old_dir
, old_dentry
, new_dir
, new_dentry
,
4211 if (flags
& RENAME_EXCHANGE
) {
4212 return ext4_cross_rename(old_dir
, old_dentry
,
4213 new_dir
, new_dentry
);
4216 return ext4_rename(idmap
, old_dir
, old_dentry
, new_dir
, new_dentry
, flags
);
4220 * directories can handle most operations...
4222 const struct inode_operations ext4_dir_inode_operations
= {
4223 .create
= ext4_create
,
4224 .lookup
= ext4_lookup
,
4226 .unlink
= ext4_unlink
,
4227 .symlink
= ext4_symlink
,
4228 .mkdir
= ext4_mkdir
,
4229 .rmdir
= ext4_rmdir
,
4230 .mknod
= ext4_mknod
,
4231 .tmpfile
= ext4_tmpfile
,
4232 .rename
= ext4_rename2
,
4233 .setattr
= ext4_setattr
,
4234 .getattr
= ext4_getattr
,
4235 .listxattr
= ext4_listxattr
,
4236 .get_inode_acl
= ext4_get_acl
,
4237 .set_acl
= ext4_set_acl
,
4238 .fiemap
= ext4_fiemap
,
4239 .fileattr_get
= ext4_fileattr_get
,
4240 .fileattr_set
= ext4_fileattr_set
,
4243 const struct inode_operations ext4_special_inode_operations
= {
4244 .setattr
= ext4_setattr
,
4245 .getattr
= ext4_getattr
,
4246 .listxattr
= ext4_listxattr
,
4247 .get_inode_acl
= ext4_get_acl
,
4248 .set_acl
= ext4_set_acl
,