1 // SPDX-License-Identifier: GPL-2.0
3 * linux/fs/ext4/namei.c
5 * Copyright (C) 1992, 1993, 1994, 1995
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
18 * Directory entry file type support and forward compatibility hooks
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 buffer_head *bh;
60 if (unlikely(EXT4_SB(inode->i_sb)->s_max_dir_size_kb &&
61 ((inode->i_size >> 10) >=
62 EXT4_SB(inode->i_sb)->s_max_dir_size_kb)))
63 return ERR_PTR(-ENOSPC);
65 *block = inode->i_size >> inode->i_sb->s_blocksize_bits;
67 bh = ext4_bread(handle, inode, *block, EXT4_GET_BLOCKS_CREATE);
70 inode->i_size += inode->i_sb->s_blocksize;
71 EXT4_I(inode)->i_disksize = inode->i_size;
72 BUFFER_TRACE(bh, "get_write_access");
73 err = ext4_journal_get_write_access(handle, inode->i_sb, bh,
77 ext4_std_error(inode->i_sb, err);
83 static int ext4_dx_csum_verify(struct inode *inode,
84 struct ext4_dir_entry *dirent);
87 * Hints to ext4_read_dirblock regarding whether we expect a directory
88 * block being read to be an index block, or a block containing
89 * directory entries (and if the latter, whether it was found via a
90 * logical block in an htree index block). This is used to control
91 * what sort of sanity checkinig ext4_read_dirblock() will do on the
92 * directory block read from the storage device. EITHER will means
93 * the caller doesn't know what kind of directory block will be read,
94 * so no specific verification will be done.
97 EITHER, INDEX, DIRENT, DIRENT_HTREE
100 #define ext4_read_dirblock(inode, block, type) \
101 __ext4_read_dirblock((inode), (block), (type), __func__, __LINE__)
103 static struct buffer_head *__ext4_read_dirblock(struct inode *inode,
105 dirblock_type_t type,
109 struct buffer_head *bh;
110 struct ext4_dir_entry *dirent;
113 if (ext4_simulate_fail(inode->i_sb, EXT4_SIM_DIRBLOCK_EIO))
116 bh = ext4_bread(NULL, inode, block, 0);
118 __ext4_warning(inode->i_sb, func, line,
119 "inode #%lu: lblock %lu: comm %s: "
120 "error %ld reading directory block",
121 inode->i_ino, (unsigned long)block,
122 current->comm, PTR_ERR(bh));
126 if (!bh && (type == INDEX || type == DIRENT_HTREE)) {
127 ext4_error_inode(inode, func, line, block,
128 "Directory hole found for htree %s block",
129 (type == INDEX) ? "index" : "leaf");
130 return ERR_PTR(-EFSCORRUPTED);
134 dirent = (struct ext4_dir_entry *) bh->b_data;
135 /* Determine whether or not we have an index block */
139 else if (ext4_rec_len_from_disk(dirent->rec_len,
140 inode->i_sb->s_blocksize) ==
141 inode->i_sb->s_blocksize)
144 if (!is_dx_block && type == INDEX) {
145 ext4_error_inode(inode, func, line, block,
146 "directory leaf block found instead of index block");
148 return ERR_PTR(-EFSCORRUPTED);
150 if (!ext4_has_metadata_csum(inode->i_sb) ||
155 * An empty leaf block can get mistaken for a index block; for
156 * this reason, we can only check the index checksum when the
157 * caller is sure it should be an index block.
159 if (is_dx_block && type == INDEX) {
160 if (ext4_dx_csum_verify(inode, dirent) &&
161 !ext4_simulate_fail(inode->i_sb, EXT4_SIM_DIRBLOCK_CRC))
162 set_buffer_verified(bh);
164 ext4_error_inode_err(inode, func, line, block,
166 "Directory index failed checksum");
168 return ERR_PTR(-EFSBADCRC);
172 if (ext4_dirblock_csum_verify(inode, bh) &&
173 !ext4_simulate_fail(inode->i_sb, EXT4_SIM_DIRBLOCK_CRC))
174 set_buffer_verified(bh);
176 ext4_error_inode_err(inode, func, line, block,
178 "Directory block failed checksum");
180 return ERR_PTR(-EFSBADCRC);
187 #define dxtrace(command) command
189 #define dxtrace(command)
213 * dx_root_info is laid out so that if it should somehow get overlaid by a
214 * dirent the two low bits of the hash version will be zero. Therefore, the
215 * hash version mod 4 should never be 0. Sincerely, the paranoia department.
220 struct fake_dirent dot;
222 struct fake_dirent dotdot;
226 __le32 reserved_zero;
228 u8 info_length; /* 8 */
233 struct dx_entry entries[];
238 struct fake_dirent fake;
239 struct dx_entry entries[];
245 struct buffer_head *bh;
246 struct dx_entry *entries;
258 * This goes at the end of each htree block.
262 __le32 dt_checksum; /* crc32c(uuid+inum+dirblock) */
265 static inline ext4_lblk_t dx_get_block(struct dx_entry *entry);
266 static void dx_set_block(struct dx_entry *entry, ext4_lblk_t value);
267 static inline unsigned dx_get_hash(struct dx_entry *entry);
268 static void dx_set_hash(struct dx_entry *entry, unsigned value);
269 static unsigned dx_get_count(struct dx_entry *entries);
270 static unsigned dx_get_limit(struct dx_entry *entries);
271 static void dx_set_count(struct dx_entry *entries, unsigned value);
272 static void dx_set_limit(struct dx_entry *entries, unsigned value);
273 static unsigned dx_root_limit(struct inode *dir, unsigned infosize);
274 static unsigned dx_node_limit(struct inode *dir);
275 static struct dx_frame *dx_probe(struct ext4_filename *fname,
277 struct dx_hash_info *hinfo,
278 struct dx_frame *frame);
279 static void dx_release(struct dx_frame *frames);
280 static int dx_make_map(struct inode *dir, struct buffer_head *bh,
281 struct dx_hash_info *hinfo,
282 struct dx_map_entry *map_tail);
283 static void dx_sort_map(struct dx_map_entry *map, unsigned count);
284 static struct ext4_dir_entry_2 *dx_move_dirents(struct inode *dir, char *from,
285 char *to, struct dx_map_entry *offsets,
286 int count, unsigned int blocksize);
287 static struct ext4_dir_entry_2 *dx_pack_dirents(struct inode *dir, char *base,
288 unsigned int blocksize);
289 static void dx_insert_block(struct dx_frame *frame,
290 u32 hash, ext4_lblk_t block);
291 static int ext4_htree_next_block(struct inode *dir, __u32 hash,
292 struct dx_frame *frame,
293 struct dx_frame *frames,
295 static struct buffer_head * ext4_dx_find_entry(struct inode *dir,
296 struct ext4_filename *fname,
297 struct ext4_dir_entry_2 **res_dir);
298 static int ext4_dx_add_entry(handle_t *handle, struct ext4_filename *fname,
299 struct inode *dir, struct inode *inode);
301 /* checksumming functions */
302 void ext4_initialize_dirent_tail(struct buffer_head *bh,
303 unsigned int blocksize)
305 struct ext4_dir_entry_tail *t = EXT4_DIRENT_TAIL(bh->b_data, blocksize);
307 memset(t, 0, sizeof(struct ext4_dir_entry_tail));
308 t->det_rec_len = ext4_rec_len_to_disk(
309 sizeof(struct ext4_dir_entry_tail), blocksize);
310 t->det_reserved_ft = EXT4_FT_DIR_CSUM;
313 /* Walk through a dirent block to find a checksum "dirent" at the tail */
314 static struct ext4_dir_entry_tail *get_dirent_tail(struct inode *inode,
315 struct buffer_head *bh)
317 struct ext4_dir_entry_tail *t;
320 struct ext4_dir_entry *d, *top;
322 d = (struct ext4_dir_entry *)bh->b_data;
323 top = (struct ext4_dir_entry *)(bh->b_data +
324 (EXT4_BLOCK_SIZE(inode->i_sb) -
325 sizeof(struct ext4_dir_entry_tail)));
326 while (d < top && d->rec_len)
327 d = (struct ext4_dir_entry *)(((void *)d) +
328 le16_to_cpu(d->rec_len));
333 t = (struct ext4_dir_entry_tail *)d;
335 t = EXT4_DIRENT_TAIL(bh->b_data, EXT4_BLOCK_SIZE(inode->i_sb));
338 if (t->det_reserved_zero1 ||
339 le16_to_cpu(t->det_rec_len) != sizeof(struct ext4_dir_entry_tail) ||
340 t->det_reserved_zero2 ||
341 t->det_reserved_ft != EXT4_FT_DIR_CSUM)
347 static __le32 ext4_dirblock_csum(struct inode *inode, void *dirent, int size)
349 struct ext4_sb_info *sbi = EXT4_SB(inode->i_sb);
350 struct ext4_inode_info *ei = EXT4_I(inode);
353 csum = ext4_chksum(sbi, ei->i_csum_seed, (__u8 *)dirent, size);
354 return cpu_to_le32(csum);
357 #define warn_no_space_for_csum(inode) \
358 __warn_no_space_for_csum((inode), __func__, __LINE__)
360 static void __warn_no_space_for_csum(struct inode *inode, const char *func,
363 __ext4_warning_inode(inode, func, line,
364 "No space for directory leaf checksum. Please run e2fsck -D.");
367 int ext4_dirblock_csum_verify(struct inode *inode, struct buffer_head *bh)
369 struct ext4_dir_entry_tail *t;
371 if (!ext4_has_metadata_csum(inode->i_sb))
374 t = get_dirent_tail(inode, bh);
376 warn_no_space_for_csum(inode);
380 if (t->det_checksum != ext4_dirblock_csum(inode, bh->b_data,
381 (char *)t - bh->b_data))
387 static void ext4_dirblock_csum_set(struct inode *inode,
388 struct buffer_head *bh)
390 struct ext4_dir_entry_tail *t;
392 if (!ext4_has_metadata_csum(inode->i_sb))
395 t = get_dirent_tail(inode, bh);
397 warn_no_space_for_csum(inode);
401 t->det_checksum = ext4_dirblock_csum(inode, bh->b_data,
402 (char *)t - bh->b_data);
405 int ext4_handle_dirty_dirblock(handle_t *handle,
407 struct buffer_head *bh)
409 ext4_dirblock_csum_set(inode, bh);
410 return ext4_handle_dirty_metadata(handle, inode, bh);
413 static struct dx_countlimit *get_dx_countlimit(struct inode *inode,
414 struct ext4_dir_entry *dirent,
417 struct ext4_dir_entry *dp;
418 struct dx_root_info *root;
421 if (le16_to_cpu(dirent->rec_len) == EXT4_BLOCK_SIZE(inode->i_sb))
423 else if (le16_to_cpu(dirent->rec_len) == 12) {
424 dp = (struct ext4_dir_entry *)(((void *)dirent) + 12);
425 if (le16_to_cpu(dp->rec_len) !=
426 EXT4_BLOCK_SIZE(inode->i_sb) - 12)
428 root = (struct dx_root_info *)(((void *)dp + 12));
429 if (root->reserved_zero ||
430 root->info_length != sizeof(struct dx_root_info))
437 *offset = count_offset;
438 return (struct dx_countlimit *)(((void *)dirent) + count_offset);
441 static __le32 ext4_dx_csum(struct inode *inode, struct ext4_dir_entry *dirent,
442 int count_offset, int count, struct dx_tail *t)
444 struct ext4_sb_info *sbi = EXT4_SB(inode->i_sb);
445 struct ext4_inode_info *ei = EXT4_I(inode);
448 __u32 dummy_csum = 0;
449 int offset = offsetof(struct dx_tail, dt_checksum);
451 size = count_offset + (count * sizeof(struct dx_entry));
452 csum = ext4_chksum(sbi, ei->i_csum_seed, (__u8 *)dirent, size);
453 csum = ext4_chksum(sbi, csum, (__u8 *)t, offset);
454 csum = ext4_chksum(sbi, csum, (__u8 *)&dummy_csum, sizeof(dummy_csum));
456 return cpu_to_le32(csum);
459 static int ext4_dx_csum_verify(struct inode *inode,
460 struct ext4_dir_entry *dirent)
462 struct dx_countlimit *c;
464 int count_offset, limit, count;
466 if (!ext4_has_metadata_csum(inode->i_sb))
469 c = get_dx_countlimit(inode, dirent, &count_offset);
471 EXT4_ERROR_INODE(inode, "dir seems corrupt? Run e2fsck -D.");
474 limit = le16_to_cpu(c->limit);
475 count = le16_to_cpu(c->count);
476 if (count_offset + (limit * sizeof(struct dx_entry)) >
477 EXT4_BLOCK_SIZE(inode->i_sb) - sizeof(struct dx_tail)) {
478 warn_no_space_for_csum(inode);
481 t = (struct dx_tail *)(((struct dx_entry *)c) + limit);
483 if (t->dt_checksum != ext4_dx_csum(inode, dirent, count_offset,
489 static void ext4_dx_csum_set(struct inode *inode, struct ext4_dir_entry *dirent)
491 struct dx_countlimit *c;
493 int count_offset, limit, count;
495 if (!ext4_has_metadata_csum(inode->i_sb))
498 c = get_dx_countlimit(inode, dirent, &count_offset);
500 EXT4_ERROR_INODE(inode, "dir seems corrupt? Run e2fsck -D.");
503 limit = le16_to_cpu(c->limit);
504 count = le16_to_cpu(c->count);
505 if (count_offset + (limit * sizeof(struct dx_entry)) >
506 EXT4_BLOCK_SIZE(inode->i_sb) - sizeof(struct dx_tail)) {
507 warn_no_space_for_csum(inode);
510 t = (struct dx_tail *)(((struct dx_entry *)c) + limit);
512 t->dt_checksum = ext4_dx_csum(inode, dirent, count_offset, count, t);
515 static inline int ext4_handle_dirty_dx_node(handle_t *handle,
517 struct buffer_head *bh)
519 ext4_dx_csum_set(inode, (struct ext4_dir_entry *)bh->b_data);
520 return ext4_handle_dirty_metadata(handle, inode, bh);
524 * p is at least 6 bytes before the end of page
526 static inline struct ext4_dir_entry_2 *
527 ext4_next_entry(struct ext4_dir_entry_2 *p, unsigned long blocksize)
529 return (struct ext4_dir_entry_2 *)((char *)p +
530 ext4_rec_len_from_disk(p->rec_len, blocksize));
534 * Future: use high four bits of block for coalesce-on-delete flags
535 * Mask them off for now.
538 static inline ext4_lblk_t dx_get_block(struct dx_entry *entry)
540 return le32_to_cpu(entry->block) & 0x0fffffff;
543 static inline void dx_set_block(struct dx_entry *entry, ext4_lblk_t value)
545 entry->block = cpu_to_le32(value);
548 static inline unsigned dx_get_hash(struct dx_entry *entry)
550 return le32_to_cpu(entry->hash);
553 static inline void dx_set_hash(struct dx_entry *entry, unsigned value)
555 entry->hash = cpu_to_le32(value);
558 static inline unsigned dx_get_count(struct dx_entry *entries)
560 return le16_to_cpu(((struct dx_countlimit *) entries)->count);
563 static inline unsigned dx_get_limit(struct dx_entry *entries)
565 return le16_to_cpu(((struct dx_countlimit *) entries)->limit);
568 static inline void dx_set_count(struct dx_entry *entries, unsigned value)
570 ((struct dx_countlimit *) entries)->count = cpu_to_le16(value);
573 static inline void dx_set_limit(struct dx_entry *entries, unsigned value)
575 ((struct dx_countlimit *) entries)->limit = cpu_to_le16(value);
578 static inline unsigned dx_root_limit(struct inode *dir, unsigned infosize)
580 unsigned int entry_space = dir->i_sb->s_blocksize -
581 ext4_dir_rec_len(1, NULL) -
582 ext4_dir_rec_len(2, NULL) - infosize;
584 if (ext4_has_metadata_csum(dir->i_sb))
585 entry_space -= sizeof(struct dx_tail);
586 return entry_space / sizeof(struct dx_entry);
589 static inline unsigned dx_node_limit(struct inode *dir)
591 unsigned int entry_space = dir->i_sb->s_blocksize -
592 ext4_dir_rec_len(0, dir);
594 if (ext4_has_metadata_csum(dir->i_sb))
595 entry_space -= sizeof(struct dx_tail);
596 return entry_space / sizeof(struct dx_entry);
603 static void dx_show_index(char * label, struct dx_entry *entries)
605 int i, n = dx_get_count (entries);
606 printk(KERN_DEBUG "%s index", label);
607 for (i = 0; i < n; i++) {
608 printk(KERN_CONT " %x->%lu",
609 i ? dx_get_hash(entries + i) : 0,
610 (unsigned long)dx_get_block(entries + i));
612 printk(KERN_CONT "\n");
622 static struct stats dx_show_leaf(struct inode *dir,
623 struct dx_hash_info *hinfo,
624 struct ext4_dir_entry_2 *de,
625 int size, int show_names)
627 unsigned names = 0, space = 0;
628 char *base = (char *) de;
629 struct dx_hash_info h = *hinfo;
632 while ((char *) de < base + size)
638 #ifdef CONFIG_FS_ENCRYPTION
641 struct fscrypt_str fname_crypto_str =
647 if (!IS_ENCRYPTED(dir)) {
648 /* Directory is not encrypted */
649 ext4fs_dirhash(dir, de->name,
651 printk("%*.s:(U)%x.%u ", len,
653 (unsigned) ((char *) de
656 struct fscrypt_str de_name =
657 FSTR_INIT(name, len);
659 /* Directory is encrypted */
660 res = fscrypt_fname_alloc_buffer(
661 len, &fname_crypto_str);
663 printk(KERN_WARNING "Error "
667 res = fscrypt_fname_disk_to_usr(dir,
671 printk(KERN_WARNING "Error "
672 "converting filename "
678 name = fname_crypto_str.name;
679 len = fname_crypto_str.len;
681 if (IS_CASEFOLDED(dir))
682 h.hash = EXT4_DIRENT_HASH(de);
684 ext4fs_dirhash(dir, de->name,
686 printk("%*.s:(E)%x.%u ", len, name,
687 h.hash, (unsigned) ((char *) de
689 fscrypt_fname_free_buffer(
693 int len = de->name_len;
694 char *name = de->name;
695 ext4fs_dirhash(dir, de->name, de->name_len, &h);
696 printk("%*.s:%x.%u ", len, name, h.hash,
697 (unsigned) ((char *) de - base));
700 space += ext4_dir_rec_len(de->name_len, dir);
703 de = ext4_next_entry(de, size);
705 printk(KERN_CONT "(%i)\n", names);
706 return (struct stats) { names, space, 1 };
709 struct stats dx_show_entries(struct dx_hash_info *hinfo, struct inode *dir,
710 struct dx_entry *entries, int levels)
712 unsigned blocksize = dir->i_sb->s_blocksize;
713 unsigned count = dx_get_count(entries), names = 0, space = 0, i;
715 struct buffer_head *bh;
716 printk("%i indexed blocks...\n", count);
717 for (i = 0; i < count; i++, entries++)
719 ext4_lblk_t block = dx_get_block(entries);
720 ext4_lblk_t hash = i ? dx_get_hash(entries): 0;
721 u32 range = i < count - 1? (dx_get_hash(entries + 1) - hash): ~hash;
723 printk("%s%3u:%03u hash %8x/%8x ",levels?"":" ", i, block, hash, range);
724 bh = ext4_bread(NULL,dir, block, 0);
725 if (!bh || IS_ERR(bh))
728 dx_show_entries(hinfo, dir, ((struct dx_node *) bh->b_data)->entries, levels - 1):
729 dx_show_leaf(dir, hinfo, (struct ext4_dir_entry_2 *)
730 bh->b_data, blocksize, 0);
731 names += stats.names;
732 space += stats.space;
733 bcount += stats.bcount;
737 printk(KERN_DEBUG "%snames %u, fullness %u (%u%%)\n",
738 levels ? "" : " ", names, space/bcount,
739 (space/bcount)*100/blocksize);
740 return (struct stats) { names, space, bcount};
744 * Linear search cross check
746 static inline void htree_rep_invariant_check(struct dx_entry *at,
747 struct dx_entry *target,
748 u32 hash, unsigned int n)
751 dxtrace(printk(KERN_CONT ","));
752 if (dx_get_hash(++at) > hash) {
757 ASSERT(at == target - 1);
760 static inline void htree_rep_invariant_check(struct dx_entry *at,
761 struct dx_entry *target,
762 u32 hash, unsigned int n)
765 #endif /* DX_DEBUG */
768 * Probe for a directory leaf block to search.
770 * dx_probe can return ERR_BAD_DX_DIR, which means there was a format
771 * error in the directory index, and the caller should fall back to
772 * searching the directory normally. The callers of dx_probe **MUST**
773 * check for this error code, and make sure it never gets reflected
776 static struct dx_frame *
777 dx_probe(struct ext4_filename *fname, struct inode *dir,
778 struct dx_hash_info *hinfo, struct dx_frame *frame_in)
780 unsigned count, indirect, level, i;
781 struct dx_entry *at, *entries, *p, *q, *m;
782 struct dx_root *root;
783 struct dx_frame *frame = frame_in;
784 struct dx_frame *ret_err = ERR_PTR(ERR_BAD_DX_DIR);
787 ext4_lblk_t blocks[EXT4_HTREE_LEVEL];
789 memset(frame_in, 0, EXT4_HTREE_LEVEL * sizeof(frame_in[0]));
790 frame->bh = ext4_read_dirblock(dir, 0, INDEX);
791 if (IS_ERR(frame->bh))
792 return (struct dx_frame *) frame->bh;
794 root = (struct dx_root *) frame->bh->b_data;
795 if (root->info.hash_version != DX_HASH_TEA &&
796 root->info.hash_version != DX_HASH_HALF_MD4 &&
797 root->info.hash_version != DX_HASH_LEGACY &&
798 root->info.hash_version != DX_HASH_SIPHASH) {
799 ext4_warning_inode(dir, "Unrecognised inode hash code %u",
800 root->info.hash_version);
803 if (ext4_hash_in_dirent(dir)) {
804 if (root->info.hash_version != DX_HASH_SIPHASH) {
805 ext4_warning_inode(dir,
806 "Hash in dirent, but hash is not SIPHASH");
810 if (root->info.hash_version == DX_HASH_SIPHASH) {
811 ext4_warning_inode(dir,
812 "Hash code is SIPHASH, but hash not in dirent");
817 hinfo = &fname->hinfo;
818 hinfo->hash_version = root->info.hash_version;
819 if (hinfo->hash_version <= DX_HASH_TEA)
820 hinfo->hash_version += EXT4_SB(dir->i_sb)->s_hash_unsigned;
821 hinfo->seed = EXT4_SB(dir->i_sb)->s_hash_seed;
822 /* hash is already computed for encrypted casefolded directory */
823 if (fname && fname_name(fname) &&
824 !(IS_ENCRYPTED(dir) && IS_CASEFOLDED(dir)))
825 ext4fs_dirhash(dir, fname_name(fname), fname_len(fname), hinfo);
828 if (root->info.unused_flags & 1) {
829 ext4_warning_inode(dir, "Unimplemented hash flags: %#06x",
830 root->info.unused_flags);
834 indirect = root->info.indirect_levels;
835 if (indirect >= ext4_dir_htree_level(dir->i_sb)) {
836 ext4_warning(dir->i_sb,
837 "Directory (ino: %lu) htree depth %#06x exceed"
838 "supported value", dir->i_ino,
839 ext4_dir_htree_level(dir->i_sb));
840 if (ext4_dir_htree_level(dir->i_sb) < EXT4_HTREE_LEVEL) {
841 ext4_warning(dir->i_sb, "Enable large directory "
842 "feature to access it");
847 entries = (struct dx_entry *)(((char *)&root->info) +
848 root->info.info_length);
850 if (dx_get_limit(entries) != dx_root_limit(dir,
851 root->info.info_length)) {
852 ext4_warning_inode(dir, "dx entry: limit %u != root limit %u",
853 dx_get_limit(entries),
854 dx_root_limit(dir, root->info.info_length));
858 dxtrace(printk("Look up %x", hash));
862 count = dx_get_count(entries);
863 if (!count || count > dx_get_limit(entries)) {
864 ext4_warning_inode(dir,
865 "dx entry: count %u beyond limit %u",
866 count, dx_get_limit(entries));
871 q = entries + count - 1;
874 dxtrace(printk(KERN_CONT "."));
875 if (dx_get_hash(m) > hash)
881 htree_rep_invariant_check(entries, p, hash, count - 1);
884 dxtrace(printk(KERN_CONT " %x->%u\n",
885 at == entries ? 0 : dx_get_hash(at),
887 frame->entries = entries;
890 block = dx_get_block(at);
891 for (i = 0; i <= level; i++) {
892 if (blocks[i] == block) {
893 ext4_warning_inode(dir,
894 "dx entry: tree cycle block %u points back to block %u",
895 blocks[level], block);
899 if (++level > indirect)
901 blocks[level] = block;
903 frame->bh = ext4_read_dirblock(dir, block, INDEX);
904 if (IS_ERR(frame->bh)) {
905 ret_err = (struct dx_frame *) frame->bh;
910 entries = ((struct dx_node *) frame->bh->b_data)->entries;
912 if (dx_get_limit(entries) != dx_node_limit(dir)) {
913 ext4_warning_inode(dir,
914 "dx entry: limit %u != node limit %u",
915 dx_get_limit(entries), dx_node_limit(dir));
920 while (frame >= frame_in) {
925 if (ret_err == ERR_PTR(ERR_BAD_DX_DIR))
926 ext4_warning_inode(dir,
927 "Corrupt directory, running e2fsck is recommended");
931 static void dx_release(struct dx_frame *frames)
933 struct dx_root_info *info;
935 unsigned int indirect_levels;
937 if (frames[0].bh == NULL)
940 info = &((struct dx_root *)frames[0].bh->b_data)->info;
941 /* save local copy, "info" may be freed after brelse() */
942 indirect_levels = info->indirect_levels;
943 for (i = 0; i <= indirect_levels; i++) {
944 if (frames[i].bh == NULL)
946 brelse(frames[i].bh);
952 * This function increments the frame pointer to search the next leaf
953 * block, and reads in the necessary intervening nodes if the search
954 * should be necessary. Whether or not the search is necessary is
955 * controlled by the hash parameter. If the hash value is even, then
956 * the search is only continued if the next block starts with that
957 * hash value. This is used if we are searching for a specific file.
959 * If the hash value is HASH_NB_ALWAYS, then always go to the next block.
961 * This function returns 1 if the caller should continue to search,
962 * or 0 if it should not. If there is an error reading one of the
963 * index blocks, it will a negative error code.
965 * If start_hash is non-null, it will be filled in with the starting
966 * hash of the next page.
968 static int ext4_htree_next_block(struct inode *dir, __u32 hash,
969 struct dx_frame *frame,
970 struct dx_frame *frames,
974 struct buffer_head *bh;
980 * Find the next leaf page by incrementing the frame pointer.
981 * If we run out of entries in the interior node, loop around and
982 * increment pointer in the parent node. When we break out of
983 * this loop, num_frames indicates the number of interior
984 * nodes need to be read.
987 if (++(p->at) < p->entries + dx_get_count(p->entries))
996 * If the hash is 1, then continue only if the next page has a
997 * continuation hash of any value. This is used for readdir
998 * handling. Otherwise, check to see if the hash matches the
999 * desired continuation hash. If it doesn't, return since
1000 * there's no point to read in the successive index pages.
1002 bhash = dx_get_hash(p->at);
1004 *start_hash = bhash;
1005 if ((hash & 1) == 0) {
1006 if ((bhash & ~1) != hash)
1010 * If the hash is HASH_NB_ALWAYS, we always go to the next
1011 * block so no check is necessary
1013 while (num_frames--) {
1014 bh = ext4_read_dirblock(dir, dx_get_block(p->at), INDEX);
1020 p->at = p->entries = ((struct dx_node *) bh->b_data)->entries;
1027 * This function fills a red-black tree with information from a
1028 * directory block. It returns the number directory entries loaded
1029 * into the tree. If there is an error it is returned in err.
1031 static int htree_dirblock_to_tree(struct file *dir_file,
1032 struct inode *dir, ext4_lblk_t block,
1033 struct dx_hash_info *hinfo,
1034 __u32 start_hash, __u32 start_minor_hash)
1036 struct buffer_head *bh;
1037 struct ext4_dir_entry_2 *de, *top;
1038 int err = 0, count = 0;
1039 struct fscrypt_str fname_crypto_str = FSTR_INIT(NULL, 0), tmp_str;
1040 int csum = ext4_has_metadata_csum(dir->i_sb);
1042 dxtrace(printk(KERN_INFO "In htree dirblock_to_tree: block %lu\n",
1043 (unsigned long)block));
1044 bh = ext4_read_dirblock(dir, block, DIRENT_HTREE);
1048 de = (struct ext4_dir_entry_2 *) bh->b_data;
1049 /* csum entries are not larger in the casefolded encrypted case */
1050 top = (struct ext4_dir_entry_2 *) ((char *) de +
1051 dir->i_sb->s_blocksize -
1053 csum ? NULL : dir));
1054 /* Check if the directory is encrypted */
1055 if (IS_ENCRYPTED(dir)) {
1056 err = fscrypt_prepare_readdir(dir);
1061 err = fscrypt_fname_alloc_buffer(EXT4_NAME_LEN,
1069 for (; de < top; de = ext4_next_entry(de, dir->i_sb->s_blocksize)) {
1070 if (ext4_check_dir_entry(dir, NULL, de, bh,
1071 bh->b_data, bh->b_size,
1072 (block<<EXT4_BLOCK_SIZE_BITS(dir->i_sb))
1073 + ((char *)de - bh->b_data))) {
1074 /* silently ignore the rest of the block */
1077 if (ext4_hash_in_dirent(dir)) {
1078 if (de->name_len && de->inode) {
1079 hinfo->hash = EXT4_DIRENT_HASH(de);
1080 hinfo->minor_hash = EXT4_DIRENT_MINOR_HASH(de);
1083 hinfo->minor_hash = 0;
1086 ext4fs_dirhash(dir, de->name, de->name_len, hinfo);
1088 if ((hinfo->hash < start_hash) ||
1089 ((hinfo->hash == start_hash) &&
1090 (hinfo->minor_hash < start_minor_hash)))
1094 if (!IS_ENCRYPTED(dir)) {
1095 tmp_str.name = de->name;
1096 tmp_str.len = de->name_len;
1097 err = ext4_htree_store_dirent(dir_file,
1098 hinfo->hash, hinfo->minor_hash, de,
1101 int save_len = fname_crypto_str.len;
1102 struct fscrypt_str de_name = FSTR_INIT(de->name,
1105 /* Directory is encrypted */
1106 err = fscrypt_fname_disk_to_usr(dir, hinfo->hash,
1107 hinfo->minor_hash, &de_name,
1113 err = ext4_htree_store_dirent(dir_file,
1114 hinfo->hash, hinfo->minor_hash, de,
1116 fname_crypto_str.len = save_len;
1126 fscrypt_fname_free_buffer(&fname_crypto_str);
1132 * This function fills a red-black tree with information from a
1133 * directory. We start scanning the directory in hash order, starting
1134 * at start_hash and start_minor_hash.
1136 * This function returns the number of entries inserted into the tree,
1137 * or a negative error code.
1139 int ext4_htree_fill_tree(struct file *dir_file, __u32 start_hash,
1140 __u32 start_minor_hash, __u32 *next_hash)
1142 struct dx_hash_info hinfo;
1143 struct ext4_dir_entry_2 *de;
1144 struct dx_frame frames[EXT4_HTREE_LEVEL], *frame;
1150 struct fscrypt_str tmp_str;
1152 dxtrace(printk(KERN_DEBUG "In htree_fill_tree, start hash: %x:%x\n",
1153 start_hash, start_minor_hash));
1154 dir = file_inode(dir_file);
1155 if (!(ext4_test_inode_flag(dir, EXT4_INODE_INDEX))) {
1156 if (ext4_hash_in_dirent(dir))
1157 hinfo.hash_version = DX_HASH_SIPHASH;
1159 hinfo.hash_version =
1160 EXT4_SB(dir->i_sb)->s_def_hash_version;
1161 if (hinfo.hash_version <= DX_HASH_TEA)
1162 hinfo.hash_version +=
1163 EXT4_SB(dir->i_sb)->s_hash_unsigned;
1164 hinfo.seed = EXT4_SB(dir->i_sb)->s_hash_seed;
1165 if (ext4_has_inline_data(dir)) {
1166 int has_inline_data = 1;
1167 count = ext4_inlinedir_to_tree(dir_file, dir, 0,
1171 if (has_inline_data) {
1176 count = htree_dirblock_to_tree(dir_file, dir, 0, &hinfo,
1177 start_hash, start_minor_hash);
1181 hinfo.hash = start_hash;
1182 hinfo.minor_hash = 0;
1183 frame = dx_probe(NULL, dir, &hinfo, frames);
1185 return PTR_ERR(frame);
1187 /* Add '.' and '..' from the htree header */
1188 if (!start_hash && !start_minor_hash) {
1189 de = (struct ext4_dir_entry_2 *) frames[0].bh->b_data;
1190 tmp_str.name = de->name;
1191 tmp_str.len = de->name_len;
1192 err = ext4_htree_store_dirent(dir_file, 0, 0,
1198 if (start_hash < 2 || (start_hash ==2 && start_minor_hash==0)) {
1199 de = (struct ext4_dir_entry_2 *) frames[0].bh->b_data;
1200 de = ext4_next_entry(de, dir->i_sb->s_blocksize);
1201 tmp_str.name = de->name;
1202 tmp_str.len = de->name_len;
1203 err = ext4_htree_store_dirent(dir_file, 2, 0,
1211 if (fatal_signal_pending(current)) {
1216 block = dx_get_block(frame->at);
1217 ret = htree_dirblock_to_tree(dir_file, dir, block, &hinfo,
1218 start_hash, start_minor_hash);
1225 ret = ext4_htree_next_block(dir, HASH_NB_ALWAYS,
1226 frame, frames, &hashval);
1227 *next_hash = hashval;
1233 * Stop if: (a) there are no more entries, or
1234 * (b) we have inserted at least one entry and the
1235 * next hash value is not a continuation
1238 (count && ((hashval & 1) == 0)))
1242 dxtrace(printk(KERN_DEBUG "Fill tree: returned %d entries, "
1243 "next hash: %x\n", count, *next_hash));
1250 static inline int search_dirblock(struct buffer_head *bh,
1252 struct ext4_filename *fname,
1253 unsigned int offset,
1254 struct ext4_dir_entry_2 **res_dir)
1256 return ext4_search_dir(bh, bh->b_data, dir->i_sb->s_blocksize, dir,
1257 fname, offset, res_dir);
1261 * Directory block splitting, compacting
1265 * Create map of hash values, offsets, and sizes, stored at end of block.
1266 * Returns number of entries mapped.
1268 static int dx_make_map(struct inode *dir, struct buffer_head *bh,
1269 struct dx_hash_info *hinfo,
1270 struct dx_map_entry *map_tail)
1273 struct ext4_dir_entry_2 *de = (struct ext4_dir_entry_2 *)bh->b_data;
1274 unsigned int buflen = bh->b_size;
1275 char *base = bh->b_data;
1276 struct dx_hash_info h = *hinfo;
1278 if (ext4_has_metadata_csum(dir->i_sb))
1279 buflen -= sizeof(struct ext4_dir_entry_tail);
1281 while ((char *) de < base + buflen) {
1282 if (ext4_check_dir_entry(dir, NULL, de, bh, base, buflen,
1283 ((char *)de) - base))
1284 return -EFSCORRUPTED;
1285 if (de->name_len && de->inode) {
1286 if (ext4_hash_in_dirent(dir))
1287 h.hash = EXT4_DIRENT_HASH(de);
1289 ext4fs_dirhash(dir, de->name, de->name_len, &h);
1291 map_tail->hash = h.hash;
1292 map_tail->offs = ((char *) de - base)>>2;
1293 map_tail->size = le16_to_cpu(de->rec_len);
1297 de = ext4_next_entry(de, dir->i_sb->s_blocksize);
1302 /* Sort map by hash value */
1303 static void dx_sort_map (struct dx_map_entry *map, unsigned count)
1305 struct dx_map_entry *p, *q, *top = map + count - 1;
1307 /* Combsort until bubble sort doesn't suck */
1309 count = count*10/13;
1310 if (count - 9 < 2) /* 9, 10 -> 11 */
1312 for (p = top, q = p - count; q >= map; p--, q--)
1313 if (p->hash < q->hash)
1316 /* Garden variety bubble sort */
1321 if (q[1].hash >= q[0].hash)
1329 static void dx_insert_block(struct dx_frame *frame, u32 hash, ext4_lblk_t block)
1331 struct dx_entry *entries = frame->entries;
1332 struct dx_entry *old = frame->at, *new = old + 1;
1333 int count = dx_get_count(entries);
1335 ASSERT(count < dx_get_limit(entries));
1336 ASSERT(old < entries + count);
1337 memmove(new + 1, new, (char *)(entries + count) - (char *)(new));
1338 dx_set_hash(new, hash);
1339 dx_set_block(new, block);
1340 dx_set_count(entries, count + 1);
1343 #if IS_ENABLED(CONFIG_UNICODE)
1345 * Test whether a case-insensitive directory entry matches the filename
1346 * being searched for. If quick is set, assume the name being looked up
1347 * is already in the casefolded form.
1349 * Returns: 0 if the directory entry matches, more than 0 if it
1350 * doesn't match or less than zero on error.
1352 static int ext4_ci_compare(const struct inode *parent, const struct qstr *name,
1353 u8 *de_name, size_t de_name_len, bool quick)
1355 const struct super_block *sb = parent->i_sb;
1356 const struct unicode_map *um = sb->s_encoding;
1357 struct fscrypt_str decrypted_name = FSTR_INIT(NULL, de_name_len);
1358 struct qstr entry = QSTR_INIT(de_name, de_name_len);
1361 if (IS_ENCRYPTED(parent)) {
1362 const struct fscrypt_str encrypted_name =
1363 FSTR_INIT(de_name, de_name_len);
1365 decrypted_name.name = kmalloc(de_name_len, GFP_KERNEL);
1366 if (!decrypted_name.name)
1368 ret = fscrypt_fname_disk_to_usr(parent, 0, 0, &encrypted_name,
1372 entry.name = decrypted_name.name;
1373 entry.len = decrypted_name.len;
1377 ret = utf8_strncasecmp_folded(um, name, &entry);
1379 ret = utf8_strncasecmp(um, name, &entry);
1381 /* Handle invalid character sequence as either an error
1382 * or as an opaque byte sequence.
1384 if (sb_has_strict_encoding(sb))
1386 else if (name->len != entry.len)
1389 ret = !!memcmp(name->name, entry.name, entry.len);
1392 kfree(decrypted_name.name);
1396 int ext4_fname_setup_ci_filename(struct inode *dir, const struct qstr *iname,
1397 struct ext4_filename *name)
1399 struct fscrypt_str *cf_name = &name->cf_name;
1400 struct dx_hash_info *hinfo = &name->hinfo;
1403 if (!IS_CASEFOLDED(dir) || !dir->i_sb->s_encoding ||
1404 (IS_ENCRYPTED(dir) && !fscrypt_has_encryption_key(dir))) {
1405 cf_name->name = NULL;
1409 cf_name->name = kmalloc(EXT4_NAME_LEN, GFP_NOFS);
1413 len = utf8_casefold(dir->i_sb->s_encoding,
1414 iname, cf_name->name,
1417 kfree(cf_name->name);
1418 cf_name->name = NULL;
1420 cf_name->len = (unsigned) len;
1421 if (!IS_ENCRYPTED(dir))
1424 hinfo->hash_version = DX_HASH_SIPHASH;
1427 ext4fs_dirhash(dir, cf_name->name, cf_name->len, hinfo);
1429 ext4fs_dirhash(dir, iname->name, iname->len, hinfo);
1435 * Test whether a directory entry matches the filename being searched for.
1437 * Return: %true if the directory entry matches, otherwise %false.
1439 static bool ext4_match(struct inode *parent,
1440 const struct ext4_filename *fname,
1441 struct ext4_dir_entry_2 *de)
1443 struct fscrypt_name f;
1448 f.usr_fname = fname->usr_fname;
1449 f.disk_name = fname->disk_name;
1450 #ifdef CONFIG_FS_ENCRYPTION
1451 f.crypto_buf = fname->crypto_buf;
1454 #if IS_ENABLED(CONFIG_UNICODE)
1455 if (parent->i_sb->s_encoding && IS_CASEFOLDED(parent) &&
1456 (!IS_ENCRYPTED(parent) || fscrypt_has_encryption_key(parent))) {
1457 if (fname->cf_name.name) {
1458 struct qstr cf = {.name = fname->cf_name.name,
1459 .len = fname->cf_name.len};
1460 if (IS_ENCRYPTED(parent)) {
1461 if (fname->hinfo.hash != EXT4_DIRENT_HASH(de) ||
1462 fname->hinfo.minor_hash !=
1463 EXT4_DIRENT_MINOR_HASH(de)) {
1468 return !ext4_ci_compare(parent, &cf, de->name,
1469 de->name_len, true);
1471 return !ext4_ci_compare(parent, fname->usr_fname, de->name,
1472 de->name_len, false);
1476 return fscrypt_match_name(&f, de->name, de->name_len);
1480 * Returns 0 if not found, -1 on failure, and 1 on success
1482 int ext4_search_dir(struct buffer_head *bh, char *search_buf, int buf_size,
1483 struct inode *dir, struct ext4_filename *fname,
1484 unsigned int offset, struct ext4_dir_entry_2 **res_dir)
1486 struct ext4_dir_entry_2 * de;
1490 de = (struct ext4_dir_entry_2 *)search_buf;
1491 dlimit = search_buf + buf_size;
1492 while ((char *) de < dlimit - EXT4_BASE_DIR_LEN) {
1493 /* this code is executed quadratically often */
1494 /* do minimal checking `by hand' */
1495 if (de->name + de->name_len <= dlimit &&
1496 ext4_match(dir, fname, de)) {
1497 /* found a match - just to be sure, do
1499 if (ext4_check_dir_entry(dir, NULL, de, bh, search_buf,
1505 /* prevent looping on a bad block */
1506 de_len = ext4_rec_len_from_disk(de->rec_len,
1507 dir->i_sb->s_blocksize);
1511 de = (struct ext4_dir_entry_2 *) ((char *) de + de_len);
1516 static int is_dx_internal_node(struct inode *dir, ext4_lblk_t block,
1517 struct ext4_dir_entry *de)
1519 struct super_block *sb = dir->i_sb;
1525 if (de->inode == 0 &&
1526 ext4_rec_len_from_disk(de->rec_len, sb->s_blocksize) ==
1533 * __ext4_find_entry()
1535 * finds an entry in the specified directory with the wanted name. It
1536 * returns the cache buffer in which the entry was found, and the entry
1537 * itself (as a parameter - res_dir). It does NOT read the inode of the
1538 * entry - you'll have to do that yourself if you want to.
1540 * The returned buffer_head has ->b_count elevated. The caller is expected
1541 * to brelse() it when appropriate.
1543 static struct buffer_head *__ext4_find_entry(struct inode *dir,
1544 struct ext4_filename *fname,
1545 struct ext4_dir_entry_2 **res_dir,
1548 struct super_block *sb;
1549 struct buffer_head *bh_use[NAMEI_RA_SIZE];
1550 struct buffer_head *bh, *ret = NULL;
1551 ext4_lblk_t start, block;
1552 const u8 *name = fname->usr_fname->name;
1553 size_t ra_max = 0; /* Number of bh's in the readahead
1555 size_t ra_ptr = 0; /* Current index into readahead
1557 ext4_lblk_t nblocks;
1558 int i, namelen, retval;
1562 namelen = fname->usr_fname->len;
1563 if (namelen > EXT4_NAME_LEN)
1566 if (ext4_has_inline_data(dir)) {
1567 int has_inline_data = 1;
1568 ret = ext4_find_inline_entry(dir, fname, res_dir,
1570 if (has_inline_data) {
1573 goto cleanup_and_exit;
1577 if ((namelen <= 2) && (name[0] == '.') &&
1578 (name[1] == '.' || name[1] == '\0')) {
1580 * "." or ".." will only be in the first block
1581 * NFS may look up ".."; "." should be handled by the VFS
1588 ret = ext4_dx_find_entry(dir, fname, res_dir);
1590 * On success, or if the error was file not found,
1591 * return. Otherwise, fall back to doing a search the
1592 * old fashioned way.
1594 if (!IS_ERR(ret) || PTR_ERR(ret) != ERR_BAD_DX_DIR)
1595 goto cleanup_and_exit;
1596 dxtrace(printk(KERN_DEBUG "ext4_find_entry: dx failed, "
1600 nblocks = dir->i_size >> EXT4_BLOCK_SIZE_BITS(sb);
1603 goto cleanup_and_exit;
1605 start = EXT4_I(dir)->i_dir_start_lookup;
1606 if (start >= nblocks)
1612 * We deal with the read-ahead logic here.
1615 if (ra_ptr >= ra_max) {
1616 /* Refill the readahead buffer */
1619 ra_max = start - block;
1621 ra_max = nblocks - block;
1622 ra_max = min(ra_max, ARRAY_SIZE(bh_use));
1623 retval = ext4_bread_batch(dir, block, ra_max,
1624 false /* wait */, bh_use);
1626 ret = ERR_PTR(retval);
1628 goto cleanup_and_exit;
1631 if ((bh = bh_use[ra_ptr++]) == NULL)
1634 if (!buffer_uptodate(bh)) {
1635 EXT4_ERROR_INODE_ERR(dir, EIO,
1636 "reading directory lblock %lu",
1637 (unsigned long) block);
1639 ret = ERR_PTR(-EIO);
1640 goto cleanup_and_exit;
1642 if (!buffer_verified(bh) &&
1643 !is_dx_internal_node(dir, block,
1644 (struct ext4_dir_entry *)bh->b_data) &&
1645 !ext4_dirblock_csum_verify(dir, bh)) {
1646 EXT4_ERROR_INODE_ERR(dir, EFSBADCRC,
1647 "checksumming directory "
1648 "block %lu", (unsigned long)block);
1650 ret = ERR_PTR(-EFSBADCRC);
1651 goto cleanup_and_exit;
1653 set_buffer_verified(bh);
1654 i = search_dirblock(bh, dir, fname,
1655 block << EXT4_BLOCK_SIZE_BITS(sb), res_dir);
1657 EXT4_I(dir)->i_dir_start_lookup = block;
1659 goto cleanup_and_exit;
1663 goto cleanup_and_exit;
1666 if (++block >= nblocks)
1668 } while (block != start);
1671 * If the directory has grown while we were searching, then
1672 * search the last part of the directory before giving up.
1675 nblocks = dir->i_size >> EXT4_BLOCK_SIZE_BITS(sb);
1676 if (block < nblocks) {
1682 /* Clean up the read-ahead blocks */
1683 for (; ra_ptr < ra_max; ra_ptr++)
1684 brelse(bh_use[ra_ptr]);
1688 static struct buffer_head *ext4_find_entry(struct inode *dir,
1689 const struct qstr *d_name,
1690 struct ext4_dir_entry_2 **res_dir,
1694 struct ext4_filename fname;
1695 struct buffer_head *bh;
1697 err = ext4_fname_setup_filename(dir, d_name, 1, &fname);
1701 return ERR_PTR(err);
1703 bh = __ext4_find_entry(dir, &fname, res_dir, inlined);
1705 ext4_fname_free_filename(&fname);
1709 static struct buffer_head *ext4_lookup_entry(struct inode *dir,
1710 struct dentry *dentry,
1711 struct ext4_dir_entry_2 **res_dir)
1714 struct ext4_filename fname;
1715 struct buffer_head *bh;
1717 err = ext4_fname_prepare_lookup(dir, dentry, &fname);
1718 generic_set_encrypted_ci_d_ops(dentry);
1722 return ERR_PTR(err);
1724 bh = __ext4_find_entry(dir, &fname, res_dir, NULL);
1726 ext4_fname_free_filename(&fname);
1730 static struct buffer_head * ext4_dx_find_entry(struct inode *dir,
1731 struct ext4_filename *fname,
1732 struct ext4_dir_entry_2 **res_dir)
1734 struct super_block * sb = dir->i_sb;
1735 struct dx_frame frames[EXT4_HTREE_LEVEL], *frame;
1736 struct buffer_head *bh;
1740 #ifdef CONFIG_FS_ENCRYPTION
1743 frame = dx_probe(fname, dir, NULL, frames);
1745 return (struct buffer_head *) frame;
1747 block = dx_get_block(frame->at);
1748 bh = ext4_read_dirblock(dir, block, DIRENT_HTREE);
1752 retval = search_dirblock(bh, dir, fname,
1753 block << EXT4_BLOCK_SIZE_BITS(sb),
1759 bh = ERR_PTR(ERR_BAD_DX_DIR);
1763 /* Check to see if we should continue to search */
1764 retval = ext4_htree_next_block(dir, fname->hinfo.hash, frame,
1767 ext4_warning_inode(dir,
1768 "error %d reading directory index block",
1770 bh = ERR_PTR(retval);
1773 } while (retval == 1);
1777 dxtrace(printk(KERN_DEBUG "%s not found\n", fname->usr_fname->name));
1783 static struct dentry *ext4_lookup(struct inode *dir, struct dentry *dentry, unsigned int flags)
1785 struct inode *inode;
1786 struct ext4_dir_entry_2 *de;
1787 struct buffer_head *bh;
1789 if (dentry->d_name.len > EXT4_NAME_LEN)
1790 return ERR_PTR(-ENAMETOOLONG);
1792 bh = ext4_lookup_entry(dir, dentry, &de);
1794 return ERR_CAST(bh);
1797 __u32 ino = le32_to_cpu(de->inode);
1799 if (!ext4_valid_inum(dir->i_sb, ino)) {
1800 EXT4_ERROR_INODE(dir, "bad inode number: %u", ino);
1801 return ERR_PTR(-EFSCORRUPTED);
1803 if (unlikely(ino == dir->i_ino)) {
1804 EXT4_ERROR_INODE(dir, "'%pd' linked to parent dir",
1806 return ERR_PTR(-EFSCORRUPTED);
1808 inode = ext4_iget(dir->i_sb, ino, EXT4_IGET_NORMAL);
1809 if (inode == ERR_PTR(-ESTALE)) {
1810 EXT4_ERROR_INODE(dir,
1811 "deleted inode referenced: %u",
1813 return ERR_PTR(-EFSCORRUPTED);
1815 if (!IS_ERR(inode) && IS_ENCRYPTED(dir) &&
1816 (S_ISDIR(inode->i_mode) || S_ISLNK(inode->i_mode)) &&
1817 !fscrypt_has_permitted_context(dir, inode)) {
1818 ext4_warning(inode->i_sb,
1819 "Inconsistent encryption contexts: %lu/%lu",
1820 dir->i_ino, inode->i_ino);
1822 return ERR_PTR(-EPERM);
1826 #if IS_ENABLED(CONFIG_UNICODE)
1827 if (!inode && IS_CASEFOLDED(dir)) {
1828 /* Eventually we want to call d_add_ci(dentry, NULL)
1829 * for negative dentries in the encoding case as
1830 * well. For now, prevent the negative dentry
1831 * from being cached.
1836 return d_splice_alias(inode, dentry);
1840 struct dentry *ext4_get_parent(struct dentry *child)
1843 struct ext4_dir_entry_2 * de;
1844 struct buffer_head *bh;
1846 bh = ext4_find_entry(d_inode(child), &dotdot_name, &de, NULL);
1848 return ERR_CAST(bh);
1850 return ERR_PTR(-ENOENT);
1851 ino = le32_to_cpu(de->inode);
1854 if (!ext4_valid_inum(child->d_sb, ino)) {
1855 EXT4_ERROR_INODE(d_inode(child),
1856 "bad parent inode number: %u", ino);
1857 return ERR_PTR(-EFSCORRUPTED);
1860 return d_obtain_alias(ext4_iget(child->d_sb, ino, EXT4_IGET_NORMAL));
1864 * Move count entries from end of map between two memory locations.
1865 * Returns pointer to last entry moved.
1867 static struct ext4_dir_entry_2 *
1868 dx_move_dirents(struct inode *dir, char *from, char *to,
1869 struct dx_map_entry *map, int count,
1872 unsigned rec_len = 0;
1875 struct ext4_dir_entry_2 *de = (struct ext4_dir_entry_2 *)
1876 (from + (map->offs<<2));
1877 rec_len = ext4_dir_rec_len(de->name_len, dir);
1879 memcpy (to, de, rec_len);
1880 ((struct ext4_dir_entry_2 *) to)->rec_len =
1881 ext4_rec_len_to_disk(rec_len, blocksize);
1883 /* wipe dir_entry excluding the rec_len field */
1885 memset(&de->name_len, 0, ext4_rec_len_from_disk(de->rec_len,
1887 offsetof(struct ext4_dir_entry_2,
1893 return (struct ext4_dir_entry_2 *) (to - rec_len);
1897 * Compact each dir entry in the range to the minimal rec_len.
1898 * Returns pointer to last entry in range.
1900 static struct ext4_dir_entry_2 *dx_pack_dirents(struct inode *dir, char *base,
1901 unsigned int blocksize)
1903 struct ext4_dir_entry_2 *next, *to, *prev, *de = (struct ext4_dir_entry_2 *) base;
1904 unsigned rec_len = 0;
1907 while ((char*)de < base + blocksize) {
1908 next = ext4_next_entry(de, blocksize);
1909 if (de->inode && de->name_len) {
1910 rec_len = ext4_dir_rec_len(de->name_len, dir);
1912 memmove(to, de, rec_len);
1913 to->rec_len = ext4_rec_len_to_disk(rec_len, blocksize);
1915 to = (struct ext4_dir_entry_2 *) (((char *) to) + rec_len);
1923 * Split a full leaf block to make room for a new dir entry.
1924 * Allocate a new block, and move entries so that they are approx. equally full.
1925 * Returns pointer to de in block into which the new entry will be inserted.
1927 static struct ext4_dir_entry_2 *do_split(handle_t *handle, struct inode *dir,
1928 struct buffer_head **bh,struct dx_frame *frame,
1929 struct dx_hash_info *hinfo)
1931 unsigned blocksize = dir->i_sb->s_blocksize;
1934 struct buffer_head *bh2;
1935 ext4_lblk_t newblock;
1937 struct dx_map_entry *map;
1938 char *data1 = (*bh)->b_data, *data2;
1939 unsigned split, move, size;
1940 struct ext4_dir_entry_2 *de = NULL, *de2;
1944 if (ext4_has_metadata_csum(dir->i_sb))
1945 csum_size = sizeof(struct ext4_dir_entry_tail);
1947 bh2 = ext4_append(handle, dir, &newblock);
1951 return (struct ext4_dir_entry_2 *) bh2;
1954 BUFFER_TRACE(*bh, "get_write_access");
1955 err = ext4_journal_get_write_access(handle, dir->i_sb, *bh,
1960 BUFFER_TRACE(frame->bh, "get_write_access");
1961 err = ext4_journal_get_write_access(handle, dir->i_sb, frame->bh,
1966 data2 = bh2->b_data;
1968 /* create map in the end of data2 block */
1969 map = (struct dx_map_entry *) (data2 + blocksize);
1970 count = dx_make_map(dir, *bh, hinfo, map);
1976 dx_sort_map(map, count);
1977 /* Ensure that neither split block is over half full */
1980 for (i = count-1; i >= 0; i--) {
1981 /* is more than half of this entry in 2nd half of the block? */
1982 if (size + map[i].size/2 > blocksize/2)
1984 size += map[i].size;
1988 * map index at which we will split
1990 * If the sum of active entries didn't exceed half the block size, just
1991 * split it in half by count; each resulting block will have at least
1992 * half the space free.
1995 split = count - move;
1999 hash2 = map[split].hash;
2000 continued = hash2 == map[split - 1].hash;
2001 dxtrace(printk(KERN_INFO "Split block %lu at %x, %i/%i\n",
2002 (unsigned long)dx_get_block(frame->at),
2003 hash2, split, count-split));
2005 /* Fancy dance to stay within two buffers */
2006 de2 = dx_move_dirents(dir, data1, data2, map + split, count - split,
2008 de = dx_pack_dirents(dir, data1, blocksize);
2009 de->rec_len = ext4_rec_len_to_disk(data1 + (blocksize - csum_size) -
2012 de2->rec_len = ext4_rec_len_to_disk(data2 + (blocksize - csum_size) -
2016 ext4_initialize_dirent_tail(*bh, blocksize);
2017 ext4_initialize_dirent_tail(bh2, blocksize);
2020 dxtrace(dx_show_leaf(dir, hinfo, (struct ext4_dir_entry_2 *) data1,
2022 dxtrace(dx_show_leaf(dir, hinfo, (struct ext4_dir_entry_2 *) data2,
2025 /* Which block gets the new entry? */
2026 if (hinfo->hash >= hash2) {
2030 dx_insert_block(frame, hash2 + continued, newblock);
2031 err = ext4_handle_dirty_dirblock(handle, dir, bh2);
2034 err = ext4_handle_dirty_dx_node(handle, dir, frame->bh);
2038 dxtrace(dx_show_index("frame", frame->entries));
2045 ext4_std_error(dir->i_sb, err);
2046 return ERR_PTR(err);
2049 int ext4_find_dest_de(struct inode *dir, struct inode *inode,
2050 struct buffer_head *bh,
2051 void *buf, int buf_size,
2052 struct ext4_filename *fname,
2053 struct ext4_dir_entry_2 **dest_de)
2055 struct ext4_dir_entry_2 *de;
2056 unsigned short reclen = ext4_dir_rec_len(fname_len(fname), dir);
2058 unsigned int offset = 0;
2062 top = buf + buf_size - reclen;
2063 while ((char *) de <= top) {
2064 if (ext4_check_dir_entry(dir, NULL, de, bh,
2065 buf, buf_size, offset))
2066 return -EFSCORRUPTED;
2067 if (ext4_match(dir, fname, de))
2069 nlen = ext4_dir_rec_len(de->name_len, dir);
2070 rlen = ext4_rec_len_from_disk(de->rec_len, buf_size);
2071 if ((de->inode ? rlen - nlen : rlen) >= reclen)
2073 de = (struct ext4_dir_entry_2 *)((char *)de + rlen);
2076 if ((char *) de > top)
2083 void ext4_insert_dentry(struct inode *dir,
2084 struct inode *inode,
2085 struct ext4_dir_entry_2 *de,
2087 struct ext4_filename *fname)
2092 nlen = ext4_dir_rec_len(de->name_len, dir);
2093 rlen = ext4_rec_len_from_disk(de->rec_len, buf_size);
2095 struct ext4_dir_entry_2 *de1 =
2096 (struct ext4_dir_entry_2 *)((char *)de + nlen);
2097 de1->rec_len = ext4_rec_len_to_disk(rlen - nlen, buf_size);
2098 de->rec_len = ext4_rec_len_to_disk(nlen, buf_size);
2101 de->file_type = EXT4_FT_UNKNOWN;
2102 de->inode = cpu_to_le32(inode->i_ino);
2103 ext4_set_de_type(inode->i_sb, de, inode->i_mode);
2104 de->name_len = fname_len(fname);
2105 memcpy(de->name, fname_name(fname), fname_len(fname));
2106 if (ext4_hash_in_dirent(dir)) {
2107 struct dx_hash_info *hinfo = &fname->hinfo;
2109 EXT4_DIRENT_HASHES(de)->hash = cpu_to_le32(hinfo->hash);
2110 EXT4_DIRENT_HASHES(de)->minor_hash =
2111 cpu_to_le32(hinfo->minor_hash);
2116 * Add a new entry into a directory (leaf) block. If de is non-NULL,
2117 * it points to a directory entry which is guaranteed to be large
2118 * enough for new directory entry. If de is NULL, then
2119 * add_dirent_to_buf will attempt search the directory block for
2120 * space. It will return -ENOSPC if no space is available, and -EIO
2121 * and -EEXIST if directory entry already exists.
2123 static int add_dirent_to_buf(handle_t *handle, struct ext4_filename *fname,
2125 struct inode *inode, struct ext4_dir_entry_2 *de,
2126 struct buffer_head *bh)
2128 unsigned int blocksize = dir->i_sb->s_blocksize;
2132 if (ext4_has_metadata_csum(inode->i_sb))
2133 csum_size = sizeof(struct ext4_dir_entry_tail);
2136 err = ext4_find_dest_de(dir, inode, bh, bh->b_data,
2137 blocksize - csum_size, fname, &de);
2141 BUFFER_TRACE(bh, "get_write_access");
2142 err = ext4_journal_get_write_access(handle, dir->i_sb, bh,
2145 ext4_std_error(dir->i_sb, err);
2149 /* By now the buffer is marked for journaling */
2150 ext4_insert_dentry(dir, inode, de, blocksize, fname);
2153 * XXX shouldn't update any times until successful
2154 * completion of syscall, but too many callers depend
2157 * XXX similarly, too many callers depend on
2158 * ext4_new_inode() setting the times, but error
2159 * recovery deletes the inode, so the worst that can
2160 * happen is that the times are slightly out of date
2161 * and/or different from the directory change time.
2163 dir->i_mtime = dir->i_ctime = current_time(dir);
2164 ext4_update_dx_flag(dir);
2165 inode_inc_iversion(dir);
2166 err2 = ext4_mark_inode_dirty(handle, dir);
2167 BUFFER_TRACE(bh, "call ext4_handle_dirty_metadata");
2168 err = ext4_handle_dirty_dirblock(handle, dir, bh);
2170 ext4_std_error(dir->i_sb, err);
2171 return err ? err : err2;
2175 * This converts a one block unindexed directory to a 3 block indexed
2176 * directory, and adds the dentry to the indexed directory.
2178 static int make_indexed_dir(handle_t *handle, struct ext4_filename *fname,
2180 struct inode *inode, struct buffer_head *bh)
2182 struct buffer_head *bh2;
2183 struct dx_root *root;
2184 struct dx_frame frames[EXT4_HTREE_LEVEL], *frame;
2185 struct dx_entry *entries;
2186 struct ext4_dir_entry_2 *de, *de2;
2192 struct fake_dirent *fde;
2195 if (ext4_has_metadata_csum(inode->i_sb))
2196 csum_size = sizeof(struct ext4_dir_entry_tail);
2198 blocksize = dir->i_sb->s_blocksize;
2199 dxtrace(printk(KERN_DEBUG "Creating index: inode %lu\n", dir->i_ino));
2200 BUFFER_TRACE(bh, "get_write_access");
2201 retval = ext4_journal_get_write_access(handle, dir->i_sb, bh,
2204 ext4_std_error(dir->i_sb, retval);
2208 root = (struct dx_root *) bh->b_data;
2210 /* The 0th block becomes the root, move the dirents out */
2211 fde = &root->dotdot;
2212 de = (struct ext4_dir_entry_2 *)((char *)fde +
2213 ext4_rec_len_from_disk(fde->rec_len, blocksize));
2214 if ((char *) de >= (((char *) root) + blocksize)) {
2215 EXT4_ERROR_INODE(dir, "invalid rec_len for '..'");
2217 return -EFSCORRUPTED;
2219 len = ((char *) root) + (blocksize - csum_size) - (char *) de;
2221 /* Allocate new block for the 0th block's dirents */
2222 bh2 = ext4_append(handle, dir, &block);
2225 return PTR_ERR(bh2);
2227 ext4_set_inode_flag(dir, EXT4_INODE_INDEX);
2228 data2 = bh2->b_data;
2230 memcpy(data2, de, len);
2231 memset(de, 0, len); /* wipe old data */
2232 de = (struct ext4_dir_entry_2 *) data2;
2234 while ((char *)(de2 = ext4_next_entry(de, blocksize)) < top)
2236 de->rec_len = ext4_rec_len_to_disk(data2 + (blocksize - csum_size) -
2237 (char *) de, blocksize);
2240 ext4_initialize_dirent_tail(bh2, blocksize);
2242 /* Initialize the root; the dot dirents already exist */
2243 de = (struct ext4_dir_entry_2 *) (&root->dotdot);
2244 de->rec_len = ext4_rec_len_to_disk(
2245 blocksize - ext4_dir_rec_len(2, NULL), blocksize);
2246 memset (&root->info, 0, sizeof(root->info));
2247 root->info.info_length = sizeof(root->info);
2248 if (ext4_hash_in_dirent(dir))
2249 root->info.hash_version = DX_HASH_SIPHASH;
2251 root->info.hash_version =
2252 EXT4_SB(dir->i_sb)->s_def_hash_version;
2254 entries = root->entries;
2255 dx_set_block(entries, 1);
2256 dx_set_count(entries, 1);
2257 dx_set_limit(entries, dx_root_limit(dir, sizeof(root->info)));
2259 /* Initialize as for dx_probe */
2260 fname->hinfo.hash_version = root->info.hash_version;
2261 if (fname->hinfo.hash_version <= DX_HASH_TEA)
2262 fname->hinfo.hash_version += EXT4_SB(dir->i_sb)->s_hash_unsigned;
2263 fname->hinfo.seed = EXT4_SB(dir->i_sb)->s_hash_seed;
2265 /* casefolded encrypted hashes are computed on fname setup */
2266 if (!ext4_hash_in_dirent(dir))
2267 ext4fs_dirhash(dir, fname_name(fname),
2268 fname_len(fname), &fname->hinfo);
2270 memset(frames, 0, sizeof(frames));
2272 frame->entries = entries;
2273 frame->at = entries;
2276 retval = ext4_handle_dirty_dx_node(handle, dir, frame->bh);
2279 retval = ext4_handle_dirty_dirblock(handle, dir, bh2);
2283 de = do_split(handle,dir, &bh2, frame, &fname->hinfo);
2285 retval = PTR_ERR(de);
2289 retval = add_dirent_to_buf(handle, fname, dir, inode, de, bh2);
2292 * Even if the block split failed, we have to properly write
2293 * out all the changes we did so far. Otherwise we can end up
2294 * with corrupted filesystem.
2297 ext4_mark_inode_dirty(handle, dir);
2306 * adds a file entry to the specified directory, using the same
2307 * semantics as ext4_find_entry(). It returns NULL if it failed.
2309 * NOTE!! The inode part of 'de' is left at 0 - which means you
2310 * may not sleep between calling this and putting something into
2311 * the entry, as someone else might have used it while you slept.
2313 static int ext4_add_entry(handle_t *handle, struct dentry *dentry,
2314 struct inode *inode)
2316 struct inode *dir = d_inode(dentry->d_parent);
2317 struct buffer_head *bh = NULL;
2318 struct ext4_dir_entry_2 *de;
2319 struct super_block *sb;
2320 struct ext4_filename fname;
2324 ext4_lblk_t block, blocks;
2327 if (ext4_has_metadata_csum(inode->i_sb))
2328 csum_size = sizeof(struct ext4_dir_entry_tail);
2331 blocksize = sb->s_blocksize;
2332 if (!dentry->d_name.len)
2335 if (fscrypt_is_nokey_name(dentry))
2338 #if IS_ENABLED(CONFIG_UNICODE)
2339 if (sb_has_strict_encoding(sb) && IS_CASEFOLDED(dir) &&
2340 sb->s_encoding && utf8_validate(sb->s_encoding, &dentry->d_name))
2344 retval = ext4_fname_setup_filename(dir, &dentry->d_name, 0, &fname);
2348 if (ext4_has_inline_data(dir)) {
2349 retval = ext4_try_add_inline_entry(handle, &fname, dir, inode);
2359 retval = ext4_dx_add_entry(handle, &fname, dir, inode);
2360 if (!retval || (retval != ERR_BAD_DX_DIR))
2362 /* Can we just ignore htree data? */
2363 if (ext4_has_metadata_csum(sb)) {
2364 EXT4_ERROR_INODE(dir,
2365 "Directory has corrupted htree index.");
2366 retval = -EFSCORRUPTED;
2369 ext4_clear_inode_flag(dir, EXT4_INODE_INDEX);
2371 retval = ext4_mark_inode_dirty(handle, dir);
2372 if (unlikely(retval))
2375 blocks = dir->i_size >> sb->s_blocksize_bits;
2376 for (block = 0; block < blocks; block++) {
2377 bh = ext4_read_dirblock(dir, block, DIRENT);
2379 bh = ext4_bread(handle, dir, block,
2380 EXT4_GET_BLOCKS_CREATE);
2381 goto add_to_new_block;
2384 retval = PTR_ERR(bh);
2388 retval = add_dirent_to_buf(handle, &fname, dir, inode,
2390 if (retval != -ENOSPC)
2393 if (blocks == 1 && !dx_fallback &&
2394 ext4_has_feature_dir_index(sb)) {
2395 retval = make_indexed_dir(handle, &fname, dir,
2397 bh = NULL; /* make_indexed_dir releases bh */
2402 bh = ext4_append(handle, dir, &block);
2405 retval = PTR_ERR(bh);
2409 de = (struct ext4_dir_entry_2 *) bh->b_data;
2411 de->rec_len = ext4_rec_len_to_disk(blocksize - csum_size, blocksize);
2414 ext4_initialize_dirent_tail(bh, blocksize);
2416 retval = add_dirent_to_buf(handle, &fname, dir, inode, de, bh);
2418 ext4_fname_free_filename(&fname);
2421 ext4_set_inode_state(inode, EXT4_STATE_NEWENTRY);
2426 * Returns 0 for success, or a negative error value
2428 static int ext4_dx_add_entry(handle_t *handle, struct ext4_filename *fname,
2429 struct inode *dir, struct inode *inode)
2431 struct dx_frame frames[EXT4_HTREE_LEVEL], *frame;
2432 struct dx_entry *entries, *at;
2433 struct buffer_head *bh;
2434 struct super_block *sb = dir->i_sb;
2435 struct ext4_dir_entry_2 *de;
2441 frame = dx_probe(fname, dir, NULL, frames);
2443 return PTR_ERR(frame);
2444 entries = frame->entries;
2446 bh = ext4_read_dirblock(dir, dx_get_block(frame->at), DIRENT_HTREE);
2453 BUFFER_TRACE(bh, "get_write_access");
2454 err = ext4_journal_get_write_access(handle, sb, bh, EXT4_JTR_NONE);
2458 err = add_dirent_to_buf(handle, fname, dir, inode, NULL, bh);
2463 /* Block full, should compress but for now just split */
2464 dxtrace(printk(KERN_DEBUG "using %u of %u node entries\n",
2465 dx_get_count(entries), dx_get_limit(entries)));
2466 /* Need to split index? */
2467 if (dx_get_count(entries) == dx_get_limit(entries)) {
2468 ext4_lblk_t newblock;
2469 int levels = frame - frames + 1;
2470 unsigned int icount;
2472 struct dx_entry *entries2;
2473 struct dx_node *node2;
2474 struct buffer_head *bh2;
2476 while (frame > frames) {
2477 if (dx_get_count((frame - 1)->entries) <
2478 dx_get_limit((frame - 1)->entries)) {
2482 frame--; /* split higher index block */
2484 entries = frame->entries;
2487 if (add_level && levels == ext4_dir_htree_level(sb)) {
2488 ext4_warning(sb, "Directory (ino: %lu) index full, "
2489 "reach max htree level :%d",
2490 dir->i_ino, levels);
2491 if (ext4_dir_htree_level(sb) < EXT4_HTREE_LEVEL) {
2492 ext4_warning(sb, "Large directory feature is "
2493 "not enabled on this "
2499 icount = dx_get_count(entries);
2500 bh2 = ext4_append(handle, dir, &newblock);
2505 node2 = (struct dx_node *)(bh2->b_data);
2506 entries2 = node2->entries;
2507 memset(&node2->fake, 0, sizeof(struct fake_dirent));
2508 node2->fake.rec_len = ext4_rec_len_to_disk(sb->s_blocksize,
2510 BUFFER_TRACE(frame->bh, "get_write_access");
2511 err = ext4_journal_get_write_access(handle, sb, frame->bh,
2516 unsigned icount1 = icount/2, icount2 = icount - icount1;
2517 unsigned hash2 = dx_get_hash(entries + icount1);
2518 dxtrace(printk(KERN_DEBUG "Split index %i/%i\n",
2521 BUFFER_TRACE(frame->bh, "get_write_access"); /* index root */
2522 err = ext4_journal_get_write_access(handle, sb,
2528 memcpy((char *) entries2, (char *) (entries + icount1),
2529 icount2 * sizeof(struct dx_entry));
2530 dx_set_count(entries, icount1);
2531 dx_set_count(entries2, icount2);
2532 dx_set_limit(entries2, dx_node_limit(dir));
2534 /* Which index block gets the new entry? */
2535 if (at - entries >= icount1) {
2536 frame->at = at - entries - icount1 + entries2;
2537 frame->entries = entries = entries2;
2538 swap(frame->bh, bh2);
2540 dx_insert_block((frame - 1), hash2, newblock);
2541 dxtrace(dx_show_index("node", frame->entries));
2542 dxtrace(dx_show_index("node",
2543 ((struct dx_node *) bh2->b_data)->entries));
2544 err = ext4_handle_dirty_dx_node(handle, dir, bh2);
2548 err = ext4_handle_dirty_dx_node(handle, dir,
2552 err = ext4_handle_dirty_dx_node(handle, dir,
2557 struct dx_root *dxroot;
2558 memcpy((char *) entries2, (char *) entries,
2559 icount * sizeof(struct dx_entry));
2560 dx_set_limit(entries2, dx_node_limit(dir));
2563 dx_set_count(entries, 1);
2564 dx_set_block(entries + 0, newblock);
2565 dxroot = (struct dx_root *)frames[0].bh->b_data;
2566 dxroot->info.indirect_levels += 1;
2567 dxtrace(printk(KERN_DEBUG
2568 "Creating %d level index...\n",
2569 dxroot->info.indirect_levels));
2570 err = ext4_handle_dirty_dx_node(handle, dir, frame->bh);
2573 err = ext4_handle_dirty_dx_node(handle, dir, bh2);
2579 de = do_split(handle, dir, &bh, frame, &fname->hinfo);
2584 err = add_dirent_to_buf(handle, fname, dir, inode, de, bh);
2588 ext4_std_error(dir->i_sb, err); /* this is a no-op if err == 0 */
2592 /* @restart is true means htree-path has been changed, we need to
2593 * repeat dx_probe() to find out valid htree-path
2595 if (restart && err == 0)
2601 * ext4_generic_delete_entry deletes a directory entry by merging it
2602 * with the previous entry
2604 int ext4_generic_delete_entry(struct inode *dir,
2605 struct ext4_dir_entry_2 *de_del,
2606 struct buffer_head *bh,
2611 struct ext4_dir_entry_2 *de, *pde;
2612 unsigned int blocksize = dir->i_sb->s_blocksize;
2618 while (i < buf_size - csum_size) {
2619 if (ext4_check_dir_entry(dir, NULL, de, bh,
2620 entry_buf, buf_size, i))
2621 return -EFSCORRUPTED;
2624 pde->rec_len = ext4_rec_len_to_disk(
2625 ext4_rec_len_from_disk(pde->rec_len,
2627 ext4_rec_len_from_disk(de->rec_len,
2631 /* wipe entire dir_entry */
2632 memset(de, 0, ext4_rec_len_from_disk(de->rec_len,
2635 /* wipe dir_entry excluding the rec_len field */
2637 memset(&de->name_len, 0,
2638 ext4_rec_len_from_disk(de->rec_len,
2640 offsetof(struct ext4_dir_entry_2,
2644 inode_inc_iversion(dir);
2647 i += ext4_rec_len_from_disk(de->rec_len, blocksize);
2649 de = ext4_next_entry(de, blocksize);
2654 static int ext4_delete_entry(handle_t *handle,
2656 struct ext4_dir_entry_2 *de_del,
2657 struct buffer_head *bh)
2659 int err, csum_size = 0;
2661 if (ext4_has_inline_data(dir)) {
2662 int has_inline_data = 1;
2663 err = ext4_delete_inline_entry(handle, dir, de_del, bh,
2665 if (has_inline_data)
2669 if (ext4_has_metadata_csum(dir->i_sb))
2670 csum_size = sizeof(struct ext4_dir_entry_tail);
2672 BUFFER_TRACE(bh, "get_write_access");
2673 err = ext4_journal_get_write_access(handle, dir->i_sb, bh,
2678 err = ext4_generic_delete_entry(dir, de_del, bh, bh->b_data,
2679 dir->i_sb->s_blocksize, csum_size);
2683 BUFFER_TRACE(bh, "call ext4_handle_dirty_metadata");
2684 err = ext4_handle_dirty_dirblock(handle, dir, bh);
2691 ext4_std_error(dir->i_sb, err);
2696 * Set directory link count to 1 if nlinks > EXT4_LINK_MAX, or if nlinks == 2
2697 * since this indicates that nlinks count was previously 1 to avoid overflowing
2698 * the 16-bit i_links_count field on disk. Directories with i_nlink == 1 mean
2699 * that subdirectory link counts are not being maintained accurately.
2701 * The caller has already checked for i_nlink overflow in case the DIR_LINK
2702 * feature is not enabled and returned -EMLINK. The is_dx() check is a proxy
2703 * for checking S_ISDIR(inode) (since the INODE_INDEX feature will not be set
2704 * on regular files) and to avoid creating huge/slow non-HTREE directories.
2706 static void ext4_inc_count(struct inode *inode)
2710 (inode->i_nlink > EXT4_LINK_MAX || inode->i_nlink == 2))
2711 set_nlink(inode, 1);
2715 * If a directory had nlink == 1, then we should let it be 1. This indicates
2716 * directory has >EXT4_LINK_MAX subdirs.
2718 static void ext4_dec_count(struct inode *inode)
2720 if (!S_ISDIR(inode->i_mode) || inode->i_nlink > 2)
2726 * Add non-directory inode to a directory. On success, the inode reference is
2727 * consumed by dentry is instantiation. This is also indicated by clearing of
2728 * *inodep pointer. On failure, the caller is responsible for dropping the
2729 * inode reference in the safe context.
2731 static int ext4_add_nondir(handle_t *handle,
2732 struct dentry *dentry, struct inode **inodep)
2734 struct inode *dir = d_inode(dentry->d_parent);
2735 struct inode *inode = *inodep;
2736 int err = ext4_add_entry(handle, dentry, inode);
2738 err = ext4_mark_inode_dirty(handle, inode);
2739 if (IS_DIRSYNC(dir))
2740 ext4_handle_sync(handle);
2741 d_instantiate_new(dentry, inode);
2746 ext4_orphan_add(handle, inode);
2747 unlock_new_inode(inode);
2752 * By the time this is called, we already have created
2753 * the directory cache entry for the new file, but it
2754 * is so far negative - it has no inode.
2756 * If the create succeeds, we fill in the inode information
2757 * with d_instantiate().
2759 static int ext4_create(struct user_namespace *mnt_userns, struct inode *dir,
2760 struct dentry *dentry, umode_t mode, bool excl)
2763 struct inode *inode;
2764 int err, credits, retries = 0;
2766 err = dquot_initialize(dir);
2770 credits = (EXT4_DATA_TRANS_BLOCKS(dir->i_sb) +
2771 EXT4_INDEX_EXTRA_TRANS_BLOCKS + 3);
2773 inode = ext4_new_inode_start_handle(mnt_userns, dir, mode, &dentry->d_name,
2774 0, NULL, EXT4_HT_DIR, credits);
2775 handle = ext4_journal_current_handle();
2776 err = PTR_ERR(inode);
2777 if (!IS_ERR(inode)) {
2778 inode->i_op = &ext4_file_inode_operations;
2779 inode->i_fop = &ext4_file_operations;
2780 ext4_set_aops(inode);
2781 err = ext4_add_nondir(handle, dentry, &inode);
2783 ext4_fc_track_create(handle, dentry);
2786 ext4_journal_stop(handle);
2787 if (!IS_ERR_OR_NULL(inode))
2789 if (err == -ENOSPC && ext4_should_retry_alloc(dir->i_sb, &retries))
2794 static int ext4_mknod(struct user_namespace *mnt_userns, struct inode *dir,
2795 struct dentry *dentry, umode_t mode, dev_t rdev)
2798 struct inode *inode;
2799 int err, credits, retries = 0;
2801 err = dquot_initialize(dir);
2805 credits = (EXT4_DATA_TRANS_BLOCKS(dir->i_sb) +
2806 EXT4_INDEX_EXTRA_TRANS_BLOCKS + 3);
2808 inode = ext4_new_inode_start_handle(mnt_userns, dir, mode, &dentry->d_name,
2809 0, NULL, EXT4_HT_DIR, credits);
2810 handle = ext4_journal_current_handle();
2811 err = PTR_ERR(inode);
2812 if (!IS_ERR(inode)) {
2813 init_special_inode(inode, inode->i_mode, rdev);
2814 inode->i_op = &ext4_special_inode_operations;
2815 err = ext4_add_nondir(handle, dentry, &inode);
2817 ext4_fc_track_create(handle, dentry);
2820 ext4_journal_stop(handle);
2821 if (!IS_ERR_OR_NULL(inode))
2823 if (err == -ENOSPC && ext4_should_retry_alloc(dir->i_sb, &retries))
2828 static int ext4_tmpfile(struct user_namespace *mnt_userns, struct inode *dir,
2829 struct dentry *dentry, umode_t mode)
2832 struct inode *inode;
2833 int err, retries = 0;
2835 err = dquot_initialize(dir);
2840 inode = ext4_new_inode_start_handle(mnt_userns, dir, mode,
2843 EXT4_MAXQUOTAS_INIT_BLOCKS(dir->i_sb) +
2844 4 + EXT4_XATTR_TRANS_BLOCKS);
2845 handle = ext4_journal_current_handle();
2846 err = PTR_ERR(inode);
2847 if (!IS_ERR(inode)) {
2848 inode->i_op = &ext4_file_inode_operations;
2849 inode->i_fop = &ext4_file_operations;
2850 ext4_set_aops(inode);
2851 d_tmpfile(dentry, inode);
2852 err = ext4_orphan_add(handle, inode);
2854 goto err_unlock_inode;
2855 mark_inode_dirty(inode);
2856 unlock_new_inode(inode);
2859 ext4_journal_stop(handle);
2860 if (err == -ENOSPC && ext4_should_retry_alloc(dir->i_sb, &retries))
2864 ext4_journal_stop(handle);
2865 unlock_new_inode(inode);
2869 struct ext4_dir_entry_2 *ext4_init_dot_dotdot(struct inode *inode,
2870 struct ext4_dir_entry_2 *de,
2871 int blocksize, int csum_size,
2872 unsigned int parent_ino, int dotdot_real_len)
2874 de->inode = cpu_to_le32(inode->i_ino);
2876 de->rec_len = ext4_rec_len_to_disk(ext4_dir_rec_len(de->name_len, NULL),
2878 strcpy(de->name, ".");
2879 ext4_set_de_type(inode->i_sb, de, S_IFDIR);
2881 de = ext4_next_entry(de, blocksize);
2882 de->inode = cpu_to_le32(parent_ino);
2884 if (!dotdot_real_len)
2885 de->rec_len = ext4_rec_len_to_disk(blocksize -
2886 (csum_size + ext4_dir_rec_len(1, NULL)),
2889 de->rec_len = ext4_rec_len_to_disk(
2890 ext4_dir_rec_len(de->name_len, NULL),
2892 strcpy(de->name, "..");
2893 ext4_set_de_type(inode->i_sb, de, S_IFDIR);
2895 return ext4_next_entry(de, blocksize);
2898 int ext4_init_new_dir(handle_t *handle, struct inode *dir,
2899 struct inode *inode)
2901 struct buffer_head *dir_block = NULL;
2902 struct ext4_dir_entry_2 *de;
2903 ext4_lblk_t block = 0;
2904 unsigned int blocksize = dir->i_sb->s_blocksize;
2908 if (ext4_has_metadata_csum(dir->i_sb))
2909 csum_size = sizeof(struct ext4_dir_entry_tail);
2911 if (ext4_test_inode_state(inode, EXT4_STATE_MAY_INLINE_DATA)) {
2912 err = ext4_try_create_inline_dir(handle, dir, inode);
2913 if (err < 0 && err != -ENOSPC)
2920 dir_block = ext4_append(handle, inode, &block);
2921 if (IS_ERR(dir_block))
2922 return PTR_ERR(dir_block);
2923 de = (struct ext4_dir_entry_2 *)dir_block->b_data;
2924 ext4_init_dot_dotdot(inode, de, blocksize, csum_size, dir->i_ino, 0);
2925 set_nlink(inode, 2);
2927 ext4_initialize_dirent_tail(dir_block, blocksize);
2929 BUFFER_TRACE(dir_block, "call ext4_handle_dirty_metadata");
2930 err = ext4_handle_dirty_dirblock(handle, inode, dir_block);
2933 set_buffer_verified(dir_block);
2939 static int ext4_mkdir(struct user_namespace *mnt_userns, struct inode *dir,
2940 struct dentry *dentry, umode_t mode)
2943 struct inode *inode;
2944 int err, err2 = 0, credits, retries = 0;
2946 if (EXT4_DIR_LINK_MAX(dir))
2949 err = dquot_initialize(dir);
2953 credits = (EXT4_DATA_TRANS_BLOCKS(dir->i_sb) +
2954 EXT4_INDEX_EXTRA_TRANS_BLOCKS + 3);
2956 inode = ext4_new_inode_start_handle(mnt_userns, dir, S_IFDIR | mode,
2958 0, NULL, EXT4_HT_DIR, credits);
2959 handle = ext4_journal_current_handle();
2960 err = PTR_ERR(inode);
2964 inode->i_op = &ext4_dir_inode_operations;
2965 inode->i_fop = &ext4_dir_operations;
2966 err = ext4_init_new_dir(handle, dir, inode);
2968 goto out_clear_inode;
2969 err = ext4_mark_inode_dirty(handle, inode);
2971 err = ext4_add_entry(handle, dentry, inode);
2975 ext4_orphan_add(handle, inode);
2976 unlock_new_inode(inode);
2977 err2 = ext4_mark_inode_dirty(handle, inode);
2980 ext4_journal_stop(handle);
2984 ext4_inc_count(dir);
2986 ext4_update_dx_flag(dir);
2987 err = ext4_mark_inode_dirty(handle, dir);
2989 goto out_clear_inode;
2990 d_instantiate_new(dentry, inode);
2991 ext4_fc_track_create(handle, dentry);
2992 if (IS_DIRSYNC(dir))
2993 ext4_handle_sync(handle);
2997 ext4_journal_stop(handle);
2999 if (err == -ENOSPC && ext4_should_retry_alloc(dir->i_sb, &retries))
3005 * routine to check that the specified directory is empty (for rmdir)
3007 bool ext4_empty_dir(struct inode *inode)
3009 unsigned int offset;
3010 struct buffer_head *bh;
3011 struct ext4_dir_entry_2 *de;
3012 struct super_block *sb;
3014 if (ext4_has_inline_data(inode)) {
3015 int has_inline_data = 1;
3018 ret = empty_inline_dir(inode, &has_inline_data);
3019 if (has_inline_data)
3024 if (inode->i_size < ext4_dir_rec_len(1, NULL) +
3025 ext4_dir_rec_len(2, NULL)) {
3026 EXT4_ERROR_INODE(inode, "invalid size");
3029 /* The first directory block must not be a hole,
3030 * so treat it as DIRENT_HTREE
3032 bh = ext4_read_dirblock(inode, 0, DIRENT_HTREE);
3036 de = (struct ext4_dir_entry_2 *) bh->b_data;
3037 if (ext4_check_dir_entry(inode, NULL, de, bh, bh->b_data, bh->b_size,
3039 le32_to_cpu(de->inode) != inode->i_ino || strcmp(".", de->name)) {
3040 ext4_warning_inode(inode, "directory missing '.'");
3044 offset = ext4_rec_len_from_disk(de->rec_len, sb->s_blocksize);
3045 de = ext4_next_entry(de, sb->s_blocksize);
3046 if (ext4_check_dir_entry(inode, NULL, de, bh, bh->b_data, bh->b_size,
3048 le32_to_cpu(de->inode) == 0 || strcmp("..", de->name)) {
3049 ext4_warning_inode(inode, "directory missing '..'");
3053 offset += ext4_rec_len_from_disk(de->rec_len, sb->s_blocksize);
3054 while (offset < inode->i_size) {
3055 if (!(offset & (sb->s_blocksize - 1))) {
3056 unsigned int lblock;
3058 lblock = offset >> EXT4_BLOCK_SIZE_BITS(sb);
3059 bh = ext4_read_dirblock(inode, lblock, EITHER);
3061 offset += sb->s_blocksize;
3067 de = (struct ext4_dir_entry_2 *) (bh->b_data +
3068 (offset & (sb->s_blocksize - 1)));
3069 if (ext4_check_dir_entry(inode, NULL, de, bh,
3070 bh->b_data, bh->b_size, offset)) {
3071 offset = (offset | (sb->s_blocksize - 1)) + 1;
3074 if (le32_to_cpu(de->inode)) {
3078 offset += ext4_rec_len_from_disk(de->rec_len, sb->s_blocksize);
3084 static int ext4_rmdir(struct inode *dir, struct dentry *dentry)
3087 struct inode *inode;
3088 struct buffer_head *bh;
3089 struct ext4_dir_entry_2 *de;
3090 handle_t *handle = NULL;
3092 if (unlikely(ext4_forced_shutdown(EXT4_SB(dir->i_sb))))
3095 /* Initialize quotas before so that eventual writes go in
3096 * separate transaction */
3097 retval = dquot_initialize(dir);
3100 retval = dquot_initialize(d_inode(dentry));
3105 bh = ext4_find_entry(dir, &dentry->d_name, &de, NULL);
3111 inode = d_inode(dentry);
3113 retval = -EFSCORRUPTED;
3114 if (le32_to_cpu(de->inode) != inode->i_ino)
3117 retval = -ENOTEMPTY;
3118 if (!ext4_empty_dir(inode))
3121 handle = ext4_journal_start(dir, EXT4_HT_DIR,
3122 EXT4_DATA_TRANS_BLOCKS(dir->i_sb));
3123 if (IS_ERR(handle)) {
3124 retval = PTR_ERR(handle);
3129 if (IS_DIRSYNC(dir))
3130 ext4_handle_sync(handle);
3132 retval = ext4_delete_entry(handle, dir, de, bh);
3135 if (!EXT4_DIR_LINK_EMPTY(inode))
3136 ext4_warning_inode(inode,
3137 "empty directory '%.*s' has too many links (%u)",
3138 dentry->d_name.len, dentry->d_name.name,
3140 inode_inc_iversion(inode);
3142 /* There's no need to set i_disksize: the fact that i_nlink is
3143 * zero will ensure that the right thing happens during any
3146 ext4_orphan_add(handle, inode);
3147 inode->i_ctime = dir->i_ctime = dir->i_mtime = current_time(inode);
3148 retval = ext4_mark_inode_dirty(handle, inode);
3151 ext4_dec_count(dir);
3152 ext4_update_dx_flag(dir);
3153 ext4_fc_track_unlink(handle, dentry);
3154 retval = ext4_mark_inode_dirty(handle, dir);
3156 #if IS_ENABLED(CONFIG_UNICODE)
3157 /* VFS negative dentries are incompatible with Encoding and
3158 * Case-insensitiveness. Eventually we'll want avoid
3159 * invalidating the dentries here, alongside with returning the
3160 * negative dentries at ext4_lookup(), when it is better
3161 * supported by the VFS for the CI case.
3163 if (IS_CASEFOLDED(dir))
3164 d_invalidate(dentry);
3170 ext4_journal_stop(handle);
3174 int __ext4_unlink(handle_t *handle, struct inode *dir, const struct qstr *d_name,
3175 struct inode *inode)
3177 int retval = -ENOENT;
3178 struct buffer_head *bh;
3179 struct ext4_dir_entry_2 *de;
3180 int skip_remove_dentry = 0;
3182 bh = ext4_find_entry(dir, d_name, &de, NULL);
3189 if (le32_to_cpu(de->inode) != inode->i_ino) {
3191 * It's okay if we find dont find dentry which matches
3192 * the inode. That's because it might have gotten
3193 * renamed to a different inode number
3195 if (EXT4_SB(inode->i_sb)->s_mount_state & EXT4_FC_REPLAY)
3196 skip_remove_dentry = 1;
3201 if (IS_DIRSYNC(dir))
3202 ext4_handle_sync(handle);
3204 if (!skip_remove_dentry) {
3205 retval = ext4_delete_entry(handle, dir, de, bh);
3208 dir->i_ctime = dir->i_mtime = current_time(dir);
3209 ext4_update_dx_flag(dir);
3210 retval = ext4_mark_inode_dirty(handle, dir);
3216 if (inode->i_nlink == 0)
3217 ext4_warning_inode(inode, "Deleting file '%.*s' with no links",
3218 d_name->len, d_name->name);
3221 if (!inode->i_nlink)
3222 ext4_orphan_add(handle, inode);
3223 inode->i_ctime = current_time(inode);
3224 retval = ext4_mark_inode_dirty(handle, inode);
3231 static int ext4_unlink(struct inode *dir, struct dentry *dentry)
3236 if (unlikely(ext4_forced_shutdown(EXT4_SB(dir->i_sb))))
3239 trace_ext4_unlink_enter(dir, dentry);
3241 * Initialize quotas before so that eventual writes go
3242 * in separate transaction
3244 retval = dquot_initialize(dir);
3247 retval = dquot_initialize(d_inode(dentry));
3251 handle = ext4_journal_start(dir, EXT4_HT_DIR,
3252 EXT4_DATA_TRANS_BLOCKS(dir->i_sb));
3253 if (IS_ERR(handle)) {
3254 retval = PTR_ERR(handle);
3258 retval = __ext4_unlink(handle, dir, &dentry->d_name, d_inode(dentry));
3260 ext4_fc_track_unlink(handle, dentry);
3261 #if IS_ENABLED(CONFIG_UNICODE)
3262 /* VFS negative dentries are incompatible with Encoding and
3263 * Case-insensitiveness. Eventually we'll want avoid
3264 * invalidating the dentries here, alongside with returning the
3265 * negative dentries at ext4_lookup(), when it is better
3266 * supported by the VFS for the CI case.
3268 if (IS_CASEFOLDED(dir))
3269 d_invalidate(dentry);
3272 ext4_journal_stop(handle);
3275 trace_ext4_unlink_exit(dentry, retval);
3279 static int ext4_init_symlink_block(handle_t *handle, struct inode *inode,
3280 struct fscrypt_str *disk_link)
3282 struct buffer_head *bh;
3286 bh = ext4_bread(handle, inode, 0, EXT4_GET_BLOCKS_CREATE);
3290 BUFFER_TRACE(bh, "get_write_access");
3291 err = ext4_journal_get_write_access(handle, inode->i_sb, bh, EXT4_JTR_NONE);
3295 kaddr = (char *)bh->b_data;
3296 memcpy(kaddr, disk_link->name, disk_link->len);
3297 inode->i_size = disk_link->len - 1;
3298 EXT4_I(inode)->i_disksize = inode->i_size;
3299 err = ext4_handle_dirty_metadata(handle, inode, bh);
3305 static int ext4_symlink(struct user_namespace *mnt_userns, struct inode *dir,
3306 struct dentry *dentry, const char *symname)
3309 struct inode *inode;
3310 int err, len = strlen(symname);
3312 struct fscrypt_str disk_link;
3315 if (unlikely(ext4_forced_shutdown(EXT4_SB(dir->i_sb))))
3318 err = fscrypt_prepare_symlink(dir, symname, len, dir->i_sb->s_blocksize,
3323 err = dquot_initialize(dir);
3328 * EXT4_INDEX_EXTRA_TRANS_BLOCKS for addition of entry into the
3329 * directory. +3 for inode, inode bitmap, group descriptor allocation.
3330 * EXT4_DATA_TRANS_BLOCKS for the data block allocation and
3333 credits = EXT4_DATA_TRANS_BLOCKS(dir->i_sb) +
3334 EXT4_INDEX_EXTRA_TRANS_BLOCKS + 3;
3336 inode = ext4_new_inode_start_handle(mnt_userns, dir, S_IFLNK|S_IRWXUGO,
3337 &dentry->d_name, 0, NULL,
3338 EXT4_HT_DIR, credits);
3339 handle = ext4_journal_current_handle();
3340 if (IS_ERR(inode)) {
3342 ext4_journal_stop(handle);
3343 err = PTR_ERR(inode);
3347 if (IS_ENCRYPTED(inode)) {
3348 err = fscrypt_encrypt_symlink(inode, symname, len, &disk_link);
3350 goto err_drop_inode;
3351 inode->i_op = &ext4_encrypted_symlink_inode_operations;
3353 if ((disk_link.len > EXT4_N_BLOCKS * 4)) {
3354 inode->i_op = &ext4_symlink_inode_operations;
3356 inode->i_op = &ext4_fast_symlink_inode_operations;
3357 inode->i_link = (char *)&EXT4_I(inode)->i_data;
3361 if ((disk_link.len > EXT4_N_BLOCKS * 4)) {
3362 /* alloc symlink block and fill it */
3363 err = ext4_init_symlink_block(handle, inode, &disk_link);
3365 goto err_drop_inode;
3367 /* clear the extent format for fast symlink */
3368 ext4_clear_inode_flag(inode, EXT4_INODE_EXTENTS);
3369 memcpy((char *)&EXT4_I(inode)->i_data, disk_link.name,
3371 inode->i_size = disk_link.len - 1;
3372 EXT4_I(inode)->i_disksize = inode->i_size;
3374 err = ext4_add_nondir(handle, dentry, &inode);
3376 ext4_journal_stop(handle);
3382 ext4_orphan_add(handle, inode);
3383 unlock_new_inode(inode);
3385 ext4_journal_stop(handle);
3388 if (err == -ENOSPC && ext4_should_retry_alloc(dir->i_sb, &retries))
3390 if (disk_link.name != (unsigned char *)symname)
3391 kfree(disk_link.name);
3395 int __ext4_link(struct inode *dir, struct inode *inode, struct dentry *dentry)
3398 int err, retries = 0;
3400 handle = ext4_journal_start(dir, EXT4_HT_DIR,
3401 (EXT4_DATA_TRANS_BLOCKS(dir->i_sb) +
3402 EXT4_INDEX_EXTRA_TRANS_BLOCKS) + 1);
3404 return PTR_ERR(handle);
3406 if (IS_DIRSYNC(dir))
3407 ext4_handle_sync(handle);
3409 inode->i_ctime = current_time(inode);
3410 ext4_inc_count(inode);
3413 err = ext4_add_entry(handle, dentry, inode);
3415 err = ext4_mark_inode_dirty(handle, inode);
3416 /* this can happen only for tmpfile being
3417 * linked the first time
3419 if (inode->i_nlink == 1)
3420 ext4_orphan_del(handle, inode);
3421 d_instantiate(dentry, inode);
3422 ext4_fc_track_link(handle, dentry);
3427 ext4_journal_stop(handle);
3428 if (err == -ENOSPC && ext4_should_retry_alloc(dir->i_sb, &retries))
3433 static int ext4_link(struct dentry *old_dentry,
3434 struct inode *dir, struct dentry *dentry)
3436 struct inode *inode = d_inode(old_dentry);
3439 if (inode->i_nlink >= EXT4_LINK_MAX)
3442 err = fscrypt_prepare_link(old_dentry, dir, dentry);
3446 if ((ext4_test_inode_flag(dir, EXT4_INODE_PROJINHERIT)) &&
3447 (!projid_eq(EXT4_I(dir)->i_projid,
3448 EXT4_I(old_dentry->d_inode)->i_projid)))
3451 err = dquot_initialize(dir);
3454 return __ext4_link(dir, inode, dentry);
3458 * Try to find buffer head where contains the parent block.
3459 * It should be the inode block if it is inlined or the 1st block
3460 * if it is a normal dir.
3462 static struct buffer_head *ext4_get_first_dir_block(handle_t *handle,
3463 struct inode *inode,
3465 struct ext4_dir_entry_2 **parent_de,
3468 struct buffer_head *bh;
3470 if (!ext4_has_inline_data(inode)) {
3471 struct ext4_dir_entry_2 *de;
3472 unsigned int offset;
3474 /* The first directory block must not be a hole, so
3475 * treat it as DIRENT_HTREE
3477 bh = ext4_read_dirblock(inode, 0, DIRENT_HTREE);
3479 *retval = PTR_ERR(bh);
3483 de = (struct ext4_dir_entry_2 *) bh->b_data;
3484 if (ext4_check_dir_entry(inode, NULL, de, bh, bh->b_data,
3486 le32_to_cpu(de->inode) != inode->i_ino ||
3487 strcmp(".", de->name)) {
3488 EXT4_ERROR_INODE(inode, "directory missing '.'");
3490 *retval = -EFSCORRUPTED;
3493 offset = ext4_rec_len_from_disk(de->rec_len,
3494 inode->i_sb->s_blocksize);
3495 de = ext4_next_entry(de, inode->i_sb->s_blocksize);
3496 if (ext4_check_dir_entry(inode, NULL, de, bh, bh->b_data,
3497 bh->b_size, offset) ||
3498 le32_to_cpu(de->inode) == 0 || strcmp("..", de->name)) {
3499 EXT4_ERROR_INODE(inode, "directory missing '..'");
3501 *retval = -EFSCORRUPTED;
3510 return ext4_get_first_inline_block(inode, parent_de, retval);
3513 struct ext4_renament {
3515 struct dentry *dentry;
3516 struct inode *inode;
3518 int dir_nlink_delta;
3520 /* entry for "dentry" */
3521 struct buffer_head *bh;
3522 struct ext4_dir_entry_2 *de;
3525 /* entry for ".." in inode if it's a directory */
3526 struct buffer_head *dir_bh;
3527 struct ext4_dir_entry_2 *parent_de;
3531 static int ext4_rename_dir_prepare(handle_t *handle, struct ext4_renament *ent)
3535 ent->dir_bh = ext4_get_first_dir_block(handle, ent->inode,
3536 &retval, &ent->parent_de,
3540 if (le32_to_cpu(ent->parent_de->inode) != ent->dir->i_ino)
3541 return -EFSCORRUPTED;
3542 BUFFER_TRACE(ent->dir_bh, "get_write_access");
3543 return ext4_journal_get_write_access(handle, ent->dir->i_sb,
3544 ent->dir_bh, EXT4_JTR_NONE);
3547 static int ext4_rename_dir_finish(handle_t *handle, struct ext4_renament *ent,
3552 ent->parent_de->inode = cpu_to_le32(dir_ino);
3553 BUFFER_TRACE(ent->dir_bh, "call ext4_handle_dirty_metadata");
3554 if (!ent->dir_inlined) {
3555 if (is_dx(ent->inode)) {
3556 retval = ext4_handle_dirty_dx_node(handle,
3560 retval = ext4_handle_dirty_dirblock(handle, ent->inode,
3564 retval = ext4_mark_inode_dirty(handle, ent->inode);
3567 ext4_std_error(ent->dir->i_sb, retval);
3573 static int ext4_setent(handle_t *handle, struct ext4_renament *ent,
3574 unsigned ino, unsigned file_type)
3576 int retval, retval2;
3578 BUFFER_TRACE(ent->bh, "get write access");
3579 retval = ext4_journal_get_write_access(handle, ent->dir->i_sb, ent->bh,
3583 ent->de->inode = cpu_to_le32(ino);
3584 if (ext4_has_feature_filetype(ent->dir->i_sb))
3585 ent->de->file_type = file_type;
3586 inode_inc_iversion(ent->dir);
3587 ent->dir->i_ctime = ent->dir->i_mtime =
3588 current_time(ent->dir);
3589 retval = ext4_mark_inode_dirty(handle, ent->dir);
3590 BUFFER_TRACE(ent->bh, "call ext4_handle_dirty_metadata");
3591 if (!ent->inlined) {
3592 retval2 = ext4_handle_dirty_dirblock(handle, ent->dir, ent->bh);
3593 if (unlikely(retval2)) {
3594 ext4_std_error(ent->dir->i_sb, retval2);
3601 static void ext4_resetent(handle_t *handle, struct ext4_renament *ent,
3602 unsigned ino, unsigned file_type)
3604 struct ext4_renament old = *ent;
3608 * old->de could have moved from under us during make indexed dir,
3609 * so the old->de may no longer valid and need to find it again
3610 * before reset old inode info.
3612 old.bh = ext4_find_entry(old.dir, &old.dentry->d_name, &old.de, NULL);
3614 retval = PTR_ERR(old.bh);
3618 ext4_std_error(old.dir->i_sb, retval);
3622 ext4_setent(handle, &old, ino, file_type);
3626 static int ext4_find_delete_entry(handle_t *handle, struct inode *dir,
3627 const struct qstr *d_name)
3629 int retval = -ENOENT;
3630 struct buffer_head *bh;
3631 struct ext4_dir_entry_2 *de;
3633 bh = ext4_find_entry(dir, d_name, &de, NULL);
3637 retval = ext4_delete_entry(handle, dir, de, bh);
3643 static void ext4_rename_delete(handle_t *handle, struct ext4_renament *ent,
3648 * ent->de could have moved from under us during htree split, so make
3649 * sure that we are deleting the right entry. We might also be pointing
3650 * to a stale entry in the unused part of ent->bh so just checking inum
3651 * and the name isn't enough.
3653 if (le32_to_cpu(ent->de->inode) != ent->inode->i_ino ||
3654 ent->de->name_len != ent->dentry->d_name.len ||
3655 strncmp(ent->de->name, ent->dentry->d_name.name,
3656 ent->de->name_len) ||
3658 retval = ext4_find_delete_entry(handle, ent->dir,
3659 &ent->dentry->d_name);
3661 retval = ext4_delete_entry(handle, ent->dir, ent->de, ent->bh);
3662 if (retval == -ENOENT) {
3663 retval = ext4_find_delete_entry(handle, ent->dir,
3664 &ent->dentry->d_name);
3669 ext4_warning_inode(ent->dir,
3670 "Deleting old file: nlink %d, error=%d",
3671 ent->dir->i_nlink, retval);
3675 static void ext4_update_dir_count(handle_t *handle, struct ext4_renament *ent)
3677 if (ent->dir_nlink_delta) {
3678 if (ent->dir_nlink_delta == -1)
3679 ext4_dec_count(ent->dir);
3681 ext4_inc_count(ent->dir);
3682 ext4_mark_inode_dirty(handle, ent->dir);
3686 static struct inode *ext4_whiteout_for_rename(struct user_namespace *mnt_userns,
3687 struct ext4_renament *ent,
3688 int credits, handle_t **h)
3695 * for inode block, sb block, group summaries,
3698 credits += (EXT4_MAXQUOTAS_TRANS_BLOCKS(ent->dir->i_sb) +
3699 EXT4_XATTR_TRANS_BLOCKS + 4);
3701 wh = ext4_new_inode_start_handle(mnt_userns, ent->dir,
3702 S_IFCHR | WHITEOUT_MODE,
3703 &ent->dentry->d_name, 0, NULL,
3704 EXT4_HT_DIR, credits);
3706 handle = ext4_journal_current_handle();
3709 ext4_journal_stop(handle);
3710 if (PTR_ERR(wh) == -ENOSPC &&
3711 ext4_should_retry_alloc(ent->dir->i_sb, &retries))
3715 init_special_inode(wh, wh->i_mode, WHITEOUT_DEV);
3716 wh->i_op = &ext4_special_inode_operations;
3722 * Anybody can rename anything with this: the permission checks are left to the
3723 * higher-level routines.
3725 * n.b. old_{dentry,inode) refers to the source dentry/inode
3726 * while new_{dentry,inode) refers to the destination dentry/inode
3727 * This comes from rename(const char *oldpath, const char *newpath)
3729 static int ext4_rename(struct user_namespace *mnt_userns, struct inode *old_dir,
3730 struct dentry *old_dentry, struct inode *new_dir,
3731 struct dentry *new_dentry, unsigned int flags)
3733 handle_t *handle = NULL;
3734 struct ext4_renament old = {
3736 .dentry = old_dentry,
3737 .inode = d_inode(old_dentry),
3739 struct ext4_renament new = {
3741 .dentry = new_dentry,
3742 .inode = d_inode(new_dentry),
3746 struct inode *whiteout = NULL;
3750 if (new.inode && new.inode->i_nlink == 0) {
3751 EXT4_ERROR_INODE(new.inode,
3752 "target of rename is already freed");
3753 return -EFSCORRUPTED;
3756 if ((ext4_test_inode_flag(new_dir, EXT4_INODE_PROJINHERIT)) &&
3757 (!projid_eq(EXT4_I(new_dir)->i_projid,
3758 EXT4_I(old_dentry->d_inode)->i_projid)))
3761 retval = dquot_initialize(old.dir);
3764 retval = dquot_initialize(new.dir);
3768 /* Initialize quotas before so that eventual writes go
3769 * in separate transaction */
3771 retval = dquot_initialize(new.inode);
3776 old.bh = ext4_find_entry(old.dir, &old.dentry->d_name, &old.de, NULL);
3778 return PTR_ERR(old.bh);
3780 * Check for inode number is _not_ due to possible IO errors.
3781 * We might rmdir the source, keep it as pwd of some process
3782 * and merrily kill the link to whatever was created under the
3783 * same name. Goodbye sticky bit ;-<
3786 if (!old.bh || le32_to_cpu(old.de->inode) != old.inode->i_ino)
3789 new.bh = ext4_find_entry(new.dir, &new.dentry->d_name,
3790 &new.de, &new.inlined);
3791 if (IS_ERR(new.bh)) {
3792 retval = PTR_ERR(new.bh);
3802 if (new.inode && !test_opt(new.dir->i_sb, NO_AUTO_DA_ALLOC))
3803 ext4_alloc_da_blocks(old.inode);
3805 credits = (2 * EXT4_DATA_TRANS_BLOCKS(old.dir->i_sb) +
3806 EXT4_INDEX_EXTRA_TRANS_BLOCKS + 2);
3807 if (!(flags & RENAME_WHITEOUT)) {
3808 handle = ext4_journal_start(old.dir, EXT4_HT_DIR, credits);
3809 if (IS_ERR(handle)) {
3810 retval = PTR_ERR(handle);
3814 whiteout = ext4_whiteout_for_rename(mnt_userns, &old, credits, &handle);
3815 if (IS_ERR(whiteout)) {
3816 retval = PTR_ERR(whiteout);
3821 old_file_type = old.de->file_type;
3822 if (IS_DIRSYNC(old.dir) || IS_DIRSYNC(new.dir))
3823 ext4_handle_sync(handle);
3825 if (S_ISDIR(old.inode->i_mode)) {
3827 retval = -ENOTEMPTY;
3828 if (!ext4_empty_dir(new.inode))
3832 if (new.dir != old.dir && EXT4_DIR_LINK_MAX(new.dir))
3835 retval = ext4_rename_dir_prepare(handle, &old);
3840 * If we're renaming a file within an inline_data dir and adding or
3841 * setting the new dirent causes a conversion from inline_data to
3842 * extents/blockmap, we need to force the dirent delete code to
3843 * re-read the directory, or else we end up trying to delete a dirent
3844 * from what is now the extent tree root (or a block map).
3846 force_reread = (new.dir->i_ino == old.dir->i_ino &&
3847 ext4_test_inode_flag(new.dir, EXT4_INODE_INLINE_DATA));
3851 * Do this before adding a new entry, so the old entry is sure
3852 * to be still pointing to the valid old entry.
3854 retval = ext4_setent(handle, &old, whiteout->i_ino,
3858 retval = ext4_mark_inode_dirty(handle, whiteout);
3859 if (unlikely(retval))
3864 retval = ext4_add_entry(handle, new.dentry, old.inode);
3868 retval = ext4_setent(handle, &new,
3869 old.inode->i_ino, old_file_type);
3874 force_reread = !ext4_test_inode_flag(new.dir,
3875 EXT4_INODE_INLINE_DATA);
3878 * Like most other Unix systems, set the ctime for inodes on a
3881 old.inode->i_ctime = current_time(old.inode);
3882 retval = ext4_mark_inode_dirty(handle, old.inode);
3883 if (unlikely(retval))
3890 ext4_rename_delete(handle, &old, force_reread);
3894 ext4_dec_count(new.inode);
3895 new.inode->i_ctime = current_time(new.inode);
3897 old.dir->i_ctime = old.dir->i_mtime = current_time(old.dir);
3898 ext4_update_dx_flag(old.dir);
3900 retval = ext4_rename_dir_finish(handle, &old, new.dir->i_ino);
3904 ext4_dec_count(old.dir);
3906 /* checked ext4_empty_dir above, can't have another
3907 * parent, ext4_dec_count() won't work for many-linked
3909 clear_nlink(new.inode);
3911 ext4_inc_count(new.dir);
3912 ext4_update_dx_flag(new.dir);
3913 retval = ext4_mark_inode_dirty(handle, new.dir);
3914 if (unlikely(retval))
3918 retval = ext4_mark_inode_dirty(handle, old.dir);
3919 if (unlikely(retval))
3922 if (S_ISDIR(old.inode->i_mode)) {
3924 * We disable fast commits here that's because the
3925 * replay code is not yet capable of changing dot dot
3926 * dirents in directories.
3928 ext4_fc_mark_ineligible(old.inode->i_sb,
3929 EXT4_FC_REASON_RENAME_DIR, handle);
3931 struct super_block *sb = old.inode->i_sb;
3934 ext4_fc_track_unlink(handle, new.dentry);
3935 if (test_opt2(sb, JOURNAL_FAST_COMMIT) &&
3936 !(EXT4_SB(sb)->s_mount_state & EXT4_FC_REPLAY) &&
3937 !(ext4_test_mount_flag(sb, EXT4_MF_FC_INELIGIBLE))) {
3938 __ext4_fc_track_link(handle, old.inode, new.dentry);
3939 __ext4_fc_track_unlink(handle, old.inode, old.dentry);
3941 __ext4_fc_track_create(handle, whiteout,
3947 retval = ext4_mark_inode_dirty(handle, new.inode);
3948 if (unlikely(retval))
3950 if (!new.inode->i_nlink)
3951 ext4_orphan_add(handle, new.inode);
3958 ext4_resetent(handle, &old,
3959 old.inode->i_ino, old_file_type);
3960 drop_nlink(whiteout);
3961 ext4_orphan_add(handle, whiteout);
3963 unlock_new_inode(whiteout);
3964 ext4_journal_stop(handle);
3967 ext4_journal_stop(handle);
3976 static int ext4_cross_rename(struct inode *old_dir, struct dentry *old_dentry,
3977 struct inode *new_dir, struct dentry *new_dentry)
3979 handle_t *handle = NULL;
3980 struct ext4_renament old = {
3982 .dentry = old_dentry,
3983 .inode = d_inode(old_dentry),
3985 struct ext4_renament new = {
3987 .dentry = new_dentry,
3988 .inode = d_inode(new_dentry),
3992 struct timespec64 ctime;
3994 if ((ext4_test_inode_flag(new_dir, EXT4_INODE_PROJINHERIT) &&
3995 !projid_eq(EXT4_I(new_dir)->i_projid,
3996 EXT4_I(old_dentry->d_inode)->i_projid)) ||
3997 (ext4_test_inode_flag(old_dir, EXT4_INODE_PROJINHERIT) &&
3998 !projid_eq(EXT4_I(old_dir)->i_projid,
3999 EXT4_I(new_dentry->d_inode)->i_projid)))
4002 retval = dquot_initialize(old.dir);
4005 retval = dquot_initialize(new.dir);
4009 old.bh = ext4_find_entry(old.dir, &old.dentry->d_name,
4010 &old.de, &old.inlined);
4012 return PTR_ERR(old.bh);
4014 * Check for inode number is _not_ due to possible IO errors.
4015 * We might rmdir the source, keep it as pwd of some process
4016 * and merrily kill the link to whatever was created under the
4017 * same name. Goodbye sticky bit ;-<
4020 if (!old.bh || le32_to_cpu(old.de->inode) != old.inode->i_ino)
4023 new.bh = ext4_find_entry(new.dir, &new.dentry->d_name,
4024 &new.de, &new.inlined);
4025 if (IS_ERR(new.bh)) {
4026 retval = PTR_ERR(new.bh);
4031 /* RENAME_EXCHANGE case: old *and* new must both exist */
4032 if (!new.bh || le32_to_cpu(new.de->inode) != new.inode->i_ino)
4035 handle = ext4_journal_start(old.dir, EXT4_HT_DIR,
4036 (2 * EXT4_DATA_TRANS_BLOCKS(old.dir->i_sb) +
4037 2 * EXT4_INDEX_EXTRA_TRANS_BLOCKS + 2));
4038 if (IS_ERR(handle)) {
4039 retval = PTR_ERR(handle);
4044 if (IS_DIRSYNC(old.dir) || IS_DIRSYNC(new.dir))
4045 ext4_handle_sync(handle);
4047 if (S_ISDIR(old.inode->i_mode)) {
4049 retval = ext4_rename_dir_prepare(handle, &old);
4053 if (S_ISDIR(new.inode->i_mode)) {
4055 retval = ext4_rename_dir_prepare(handle, &new);
4061 * Other than the special case of overwriting a directory, parents'
4062 * nlink only needs to be modified if this is a cross directory rename.
4064 if (old.dir != new.dir && old.is_dir != new.is_dir) {
4065 old.dir_nlink_delta = old.is_dir ? -1 : 1;
4066 new.dir_nlink_delta = -old.dir_nlink_delta;
4068 if ((old.dir_nlink_delta > 0 && EXT4_DIR_LINK_MAX(old.dir)) ||
4069 (new.dir_nlink_delta > 0 && EXT4_DIR_LINK_MAX(new.dir)))
4073 new_file_type = new.de->file_type;
4074 retval = ext4_setent(handle, &new, old.inode->i_ino, old.de->file_type);
4078 retval = ext4_setent(handle, &old, new.inode->i_ino, new_file_type);
4083 * Like most other Unix systems, set the ctime for inodes on a
4086 ctime = current_time(old.inode);
4087 old.inode->i_ctime = ctime;
4088 new.inode->i_ctime = ctime;
4089 retval = ext4_mark_inode_dirty(handle, old.inode);
4090 if (unlikely(retval))
4092 retval = ext4_mark_inode_dirty(handle, new.inode);
4093 if (unlikely(retval))
4095 ext4_fc_mark_ineligible(new.inode->i_sb,
4096 EXT4_FC_REASON_CROSS_RENAME, handle);
4098 retval = ext4_rename_dir_finish(handle, &old, new.dir->i_ino);
4103 retval = ext4_rename_dir_finish(handle, &new, old.dir->i_ino);
4107 ext4_update_dir_count(handle, &old);
4108 ext4_update_dir_count(handle, &new);
4117 ext4_journal_stop(handle);
4121 static int ext4_rename2(struct user_namespace *mnt_userns,
4122 struct inode *old_dir, struct dentry *old_dentry,
4123 struct inode *new_dir, struct dentry *new_dentry,
4128 if (unlikely(ext4_forced_shutdown(EXT4_SB(old_dir->i_sb))))
4131 if (flags & ~(RENAME_NOREPLACE | RENAME_EXCHANGE | RENAME_WHITEOUT))
4134 err = fscrypt_prepare_rename(old_dir, old_dentry, new_dir, new_dentry,
4139 if (flags & RENAME_EXCHANGE) {
4140 return ext4_cross_rename(old_dir, old_dentry,
4141 new_dir, new_dentry);
4144 return ext4_rename(mnt_userns, old_dir, old_dentry, new_dir, new_dentry, flags);
4148 * directories can handle most operations...
4150 const struct inode_operations ext4_dir_inode_operations = {
4151 .create = ext4_create,
4152 .lookup = ext4_lookup,
4154 .unlink = ext4_unlink,
4155 .symlink = ext4_symlink,
4156 .mkdir = ext4_mkdir,
4157 .rmdir = ext4_rmdir,
4158 .mknod = ext4_mknod,
4159 .tmpfile = ext4_tmpfile,
4160 .rename = ext4_rename2,
4161 .setattr = ext4_setattr,
4162 .getattr = ext4_getattr,
4163 .listxattr = ext4_listxattr,
4164 .get_acl = ext4_get_acl,
4165 .set_acl = ext4_set_acl,
4166 .fiemap = ext4_fiemap,
4167 .fileattr_get = ext4_fileattr_get,
4168 .fileattr_set = ext4_fileattr_set,
4171 const struct inode_operations ext4_special_inode_operations = {
4172 .setattr = ext4_setattr,
4173 .getattr = ext4_getattr,
4174 .listxattr = ext4_listxattr,
4175 .get_acl = ext4_get_acl,
4176 .set_acl = ext4_set_acl,